ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.74 by root, Wed Dec 20 09:14:21 2006 UTC vs.
Revision 1.162 by root, Sat Jun 16 00:12:20 2007 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3		3	*
		4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* Crossfire TRT is free software; you can redistribute it and/or modify it
8	it under the terms of the GNU General Public License as published by	9	* under the terms of the GNU General Public License as published by the Free
9	the Free Software Foundation; either version 2 of the License, or	10	* Software Foundation; either version 2 of the License, or (at your option)
10	(at your option) any later version.	11	* any later version.
11		12	*
12	This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful, but
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15	GNU General Public License for more details.	16	* for more details.
16		17	*
17	You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License along
18	along with this program; if not, write to the Free Software	19	* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20		21	*
21	The authors can be reached via e-mail at <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <crossfire@schmorp.de>
22	*/	23	*/
23		24
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying	26	sub/add_weight will transcend the environment updating the carrying
26	variable. */	27	variable. */
27	#include <global.h>	28	#include <global.h>
28	#include <stdio.h>	29	#include <stdio.h>
29	#include <sys/types.h>	30	#include <sys/types.h>
30	#include <sys/uio.h>	31	#include <sys/uio.h>
31	#include <object.h>	32	#include <object.h>
32	#include <funcpoint.h>	33	#include <funcpoint.h>
		34	#include <sproto.h>
33	#include <loader.h>	35	#include <loader.h>
34		36
35	#include <bitset>	37	#include <bitset>
36		38
37	int nrofallocobjects = 0;	39	int nrofallocobjects = 0;
38	static UUID uuid;	40	static UUID uuid;
39	const uint64 UUID_SKIP = 1<<19;	41	const uint64 UUID_SKIP = 1<<19;
40		42
41	object *active_objects; /* List of active objects that need to be processed */	43	objectvec objects;
		44	activevec actives;
42		45
43	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	46	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
44	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	47	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
45	};	48	};
46	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	49	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
…		…
141	* objects with lists are rare, and lists stay short. If not, use a	144	* objects with lists are rare, and lists stay short. If not, use a
142	* different structure or at least keep the lists sorted...	145	* different structure or at least keep the lists sorted...
143	*/	146	*/
144		147
145	/* For each field in wants, */	148	/* For each field in wants, */
146	for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)	149	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)
147	{	150	{
148	key_value *has_field;	151	key_value *has_field;
149		152
150	/* Look for a field in has with the same key. */	153	/* Look for a field in has with the same key. */
151	has_field = get_ob_key_link (has, wants_field->key);	154	has_field = get_ob_key_link (has, wants_field->key);
…		…
190	* Check nrof variable *before* calling can_merge()	193	* Check nrof variable *before* calling can_merge()
191	*	194	*
192	* Improvements made with merge: Better checking on potion, and also	195	* Improvements made with merge: Better checking on potion, and also
193	* check weight	196	* check weight
194	*/	197	*/
195
196	bool object::can_merge_slow (object *ob1, object *ob2)	198	bool object::can_merge_slow (object *ob1, object *ob2)
197	{	199	{
198	/* A couple quicksanity checks */	200	/* A couple quicksanity checks */
199	if (ob1 == ob2	201	if (ob1 == ob2
200	|| ob1->type != ob2->type	202	|| ob1->type != ob2->type
…		…
221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	223	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
222		224
223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	225	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	226	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
225		227
226	if ((ob1->flags ^ ob2->flags).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	228	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
227	|| ob1->arch != ob2->arch	229	|| ob1->arch != ob2->arch
228	|| ob1->name != ob2->name	230	|| ob1->name != ob2->name
229	|| ob1->title != ob2->title	231	|| ob1->title != ob2->title
230	|| ob1->msg != ob2->msg	232	|| ob1->msg != ob2->msg
231	|| ob1->weight != ob2->weight	233	|| ob1->weight != ob2->weight
…		…
277		279
278	/* Note sure why the following is the case - either the object has to	280	/* Note sure why the following is the case - either the object has to
279	* be animated or have a very low speed. Is this an attempted monster	281	* be animated or have a very low speed. Is this an attempted monster
280	* check?	282	* check?
281	*/	283	*/
282	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	284	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
283	return 0;	285	return 0;
284		286
285	switch (ob1->type)	287	switch (ob1->type)
286	{	288	{
287	case SCROLL:	289	case SCROLL:
…		…
323	sum_weight (object *op)	325	sum_weight (object *op)
324	{	326	{
325	long sum;	327	long sum;
326	object *inv;	328	object *inv;
327		329
328	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	330	for (sum = 0, inv = op->inv; inv; inv = inv->below)
329	{	331	{
330	if (inv->inv)	332	if (inv->inv)
331	sum_weight (inv);	333	sum_weight (inv);
		334
332	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	335	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
333	}	336	}
334		337
335	if (op->type == CONTAINER && op->stats.Str)	338	if (op->type == CONTAINER && op->stats.Str)
336	sum = (sum * (100 - op->stats.Str)) / 100;	339	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
356	/*	359	/*
357	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	360	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
358	* Some error messages.	361	* Some error messages.
359	* The result of the dump is stored in the static global errmsg array.	362	* The result of the dump is stored in the static global errmsg array.
360	*/	363	*/
361
362	char *	364	char *
363	dump_object (object *op)	365	dump_object (object *op)
364	{	366	{
365	if (!op)	367	if (!op)
366	return strdup ("[NULLOBJ]");	368	return strdup ("[NULLOBJ]");
367		369
368	object_freezer freezer;	370	object_freezer freezer;
369	save_object (freezer, op, 3);	371	op->write (freezer);
370	return freezer.as_string ();	372	return freezer.as_string ();
371	}	373	}
372		374
373	/*	375	/*
374	* get_nearest_part(multi-object, object 2) returns the part of the	376	* get_nearest_part(multi-object, object 2) returns the part of the
…		…
391	}	393	}
392		394
393	/*	395	/*
394	* Returns the object which has the count-variable equal to the argument.	396	* Returns the object which has the count-variable equal to the argument.
395	*/	397	*/
396
397	object *	398	object *
398	find_object (tag_t i)	399	find_object (tag_t i)
399	{	400	{
400	for (object *op = object::first; op; op = op->next)	401	for_all_objects (op)
401	if (op->count == i)	402	if (op->count == i)
402	return op;	403	return op;
403		404
404	return 0;	405	return 0;
405	}	406	}
406		407
407	/*	408	/*
408	* Returns the first object which has a name equal to the argument.	409	* Returns the first object which has a name equal to the argument.
409	* Used only by the patch command, but not all that useful.	410	* Used only by the patch command, but not all that useful.
410	* Enables features like "patch <name-of-other-player> food 999"	411	* Enables features like "patch <name-of-other-player> food 999"
411	*/	412	*/
412
413	object *	413	object *
414	find_object_name (const char *str)	414	find_object_name (const char *str)
415	{	415	{
416	shstr_cmp str_ (str);	416	shstr_cmp str_ (str);
417	object *op;	417	object *op;
418		418
419	for (op = object::first; op != NULL; op = op->next)	419	for_all_objects (op)
420	if (op->name == str_)	420	if (op->name == str_)
421	break;	421	break;
422		422
423	return op;	423	return op;
424	}	424	}
…		…
450	owner = owner->owner;	450	owner = owner->owner;
451		451
452	this->owner = owner;	452	this->owner = owner;
453	}	453	}
454		454
		455	int
		456	object::slottype () const
		457	{
		458	if (type == SKILL)
		459	{
		460	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		461	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		462	}
		463	else
		464	{
		465	if (slot [body_combat].info) return slot_combat;
		466	if (slot [body_range ].info) return slot_ranged;
		467	}
		468
		469	return slot_none;
		470	}
		471
		472	bool
		473	object::change_weapon (object *ob)
		474	{
		475	if (current_weapon == ob)
		476	return true;
		477
		478	if (chosen_skill)
		479	chosen_skill->flag [FLAG_APPLIED] = false;
		480
		481	current_weapon = ob;
		482	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		483
		484	if (chosen_skill)
		485	chosen_skill->flag [FLAG_APPLIED] = true;
		486
		487	update_stats ();
		488
		489	if (ob)
		490	{
		491	// now check wether any body locations became invalid, in which case
		492	// we cannot apply the weapon at the moment.
		493	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		494	if (slot[i].used < 0)
		495	{
		496	current_weapon = chosen_skill = 0;
		497	update_stats ();
		498
		499	new_draw_info_format (NDI_UNIQUE, 0, this,
		500	"You try to balance all your items at once, "
		501	"but the %s is just too much for your body. "
		502	"[You need to unapply some items first.]", &ob->name);
		503	return false;
		504	}
		505
		506	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		507	}
		508	else
		509	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		510
		511	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		512	{
		513	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		514	&name, ob->debug_desc ());
		515	return false;
		516	}
		517
		518	return true;
		519	}
		520
455	/* Zero the key_values on op, decrementing the shared-string	521	/* Zero the key_values on op, decrementing the shared-string
456	* refcounts and freeing the links.	522	* refcounts and freeing the links.
457	*/	523	*/
458	static void	524	static void
459	free_key_values (object *op)	525	free_key_values (object *op)
460	{	526	{
461	for (key_value *i = op->key_values; i != 0;)	527	for (key_value *i = op->key_values; i; )
462	{	528	{
463	key_value *next = i->next;	529	key_value *next = i->next;
464	delete i;	530	delete i;
465		531
466	i = next;	532	i = next;
467	}	533	}
468		534
469	op->key_values = 0;	535	op->key_values = 0;
470	}	536	}
471		537
472	void object::clear ()	538	object &
		539	object::operator =(const object &src)
473	{	540	{
474	attachable_base::clear ();	541	bool is_freed = flag [FLAG_FREED];
		542	bool is_removed = flag [FLAG_REMOVED];
475		543
476	free_key_values (this);
477
478	owner = 0;
479	name = 0;
480	name_pl = 0;
481	title = 0;
482	race = 0;
483	slaying = 0;
484	skill = 0;
485	msg = 0;
486	lore = 0;
487	custom_name = 0;
488	materialname = 0;
489	contr = 0;
490	below = 0;
491	above = 0;
492	inv = 0;
493	container = 0;
494	env = 0;
495	more = 0;
496	head = 0;
497	map = 0;
498	active_next = 0;
499	active_prev = 0;
500
501	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
502
503	SET_FLAG (this, FLAG_REMOVED);
504
505	/* What is not cleared is next, prev, and count */
506
507	expmul = 1.0;
508	face = blank_face;
509
510	if (settings.casting_time)
511	casting_time = -1;
512	}
513
514	/*
515	* copy_to first frees everything allocated by the dst object,
516	* and then copies the contents of itself into the second
517	* object, allocating what needs to be allocated. Basically, any
518	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
519	* if the first object is freed, the pointers in the new object
520	* will point at garbage.
521	*/
522	void
523	object::copy_to (object *dst)
524	{
525	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
526	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
527
528	*(object_copy *)dst = *this;	544	*(object_copy *)this = src;
529	*(object_pod *)dst = *this;
530		545
531	if (self || cb)	546	flag [FLAG_FREED] = is_freed;
532	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst));	547	flag [FLAG_REMOVED] = is_removed;
533
534	if (is_freed)
535	SET_FLAG (dst, FLAG_FREED);
536
537	if (is_removed)
538	SET_FLAG (dst, FLAG_REMOVED);
539
540	if (speed < 0)
541	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
542		548
543	/* Copy over key_values, if any. */	549	/* Copy over key_values, if any. */
544	if (key_values)	550	if (src.key_values)
545	{	551	{
546	key_value *tail = 0;	552	key_value *tail = 0;
547	key_value *i;
548
549	dst->key_values = 0;	553	key_values = 0;
550		554
551	for (i = key_values; i; i = i->next)	555	for (key_value *i = src.key_values; i; i = i->next)
552	{	556	{
553	key_value *new_link = new key_value;	557	key_value *new_link = new key_value;
554		558
555	new_link->next = 0;	559	new_link->next = 0;
556	new_link->key = i->key;	560	new_link->key = i->key;
557	new_link->value = i->value;	561	new_link->value = i->value;
558		562
559	/* Try and be clever here, too. */	563	/* Try and be clever here, too. */
560	if (!dst->key_values)	564	if (!key_values)
561	{	565	{
562	dst->key_values = new_link;	566	key_values = new_link;
563	tail = new_link;	567	tail = new_link;
564	}	568	}
565	else	569	else
566	{	570	{
567	tail->next = new_link;	571	tail->next = new_link;
568	tail = new_link;	572	tail = new_link;
569	}	573	}
570	}	574	}
571	}	575	}
		576	}
572		577
573	update_ob_speed (dst);	578	/*
		579	* copy_to first frees everything allocated by the dst object,
		580	* and then copies the contents of itself into the second
		581	* object, allocating what needs to be allocated. Basically, any
		582	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		583	* if the first object is freed, the pointers in the new object
		584	* will point at garbage.
		585	*/
		586	void
		587	object::copy_to (object *dst)
		588	{
		589	*dst = *this;
		590
		591	if (speed < 0)
		592	dst->speed_left = speed_left - rndm ();
		593
		594	dst->set_speed (dst->speed);
		595	}
		596
		597	void
		598	object::instantiate ()
		599	{
		600	if (!uuid.seq) // HACK
		601	uuid = gen_uuid ();
		602
		603	speed_left = -0.1f;
		604	/* copy the body_info to the body_used - this is only really
		605	* need for monsters, but doesn't hurt to do it for everything.
		606	* by doing so, when a monster is created, it has good starting
		607	* values for the body_used info, so when items are created
		608	* for it, they can be properly equipped.
		609	*/
		610	for (int i = NUM_BODY_LOCATIONS; i--; )
		611	slot[i].used = slot[i].info;
		612
		613	attachable::instantiate ();
574	}	614	}
575		615
576	object *	616	object *
577	object::clone ()	617	object::clone ()
578	{	618	{
…		…
584	/*	624	/*
585	* If an object with the IS_TURNABLE() flag needs to be turned due	625	* If an object with the IS_TURNABLE() flag needs to be turned due
586	* to the closest player being on the other side, this function can	626	* to the closest player being on the other side, this function can
587	* be called to update the face variable, _and_ how it looks on the map.	627	* be called to update the face variable, _and_ how it looks on the map.
588	*/	628	*/
589
590	void	629	void
591	update_turn_face (object *op)	630	update_turn_face (object *op)
592	{	631	{
593	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	632	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
594	return;	633	return;
		634
595	SET_ANIMATION (op, op->direction);	635	SET_ANIMATION (op, op->direction);
596	update_object (op, UP_OBJ_FACE);	636	update_object (op, UP_OBJ_FACE);
597	}	637	}
598		638
599	/*	639	/*
600	* Updates the speed of an object. If the speed changes from 0 to another	640	* Updates the speed of an object. If the speed changes from 0 to another
601	* value, or vice versa, then add/remove the object from the active list.	641	* value, or vice versa, then add/remove the object from the active list.
602	* This function needs to be called whenever the speed of an object changes.	642	* This function needs to be called whenever the speed of an object changes.
603	*/	643	*/
604	void	644	void
605	update_ob_speed (object *op)	645	object::set_speed (float speed)
606	{	646	{
607	extern int arch_init;	647	if (flag [FLAG_FREED] && speed)
608
609	/* No reason putting the archetypes objects on the speed list,
610	* since they never really need to be updated.
611	*/
612
613	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
614	{	648	{
615	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	649	LOG (llevError, "Object %s is freed but has speed.\n", &name);
616	#ifdef MANY_CORES
617	abort ();
618	#else
619	op->speed = 0;	650	speed = 0;
620	#endif
621	}
622
623	if (arch_init)
624	return;
625
626	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
627	{	651	}
628	/* If already on active list, don't do anything */
629	if (op->active_next || op->active_prev || op == active_objects)
630	return;
631		652
632	/* process_events() expects us to insert the object at the beginning	653	this->speed = speed;
633	* of the list. */
634	op->active_next = active_objects;
635		654
636	if (op->active_next != NULL)	655	if (has_active_speed ())
637	op->active_next->active_prev = op;	656	activate ();
638
639	active_objects = op;
640	}
641	else	657	else
642	{	658	deactivate ();
643	/* If not on the active list, nothing needs to be done */
644	if (!op->active_next && !op->active_prev && op != active_objects)
645	return;
646
647	if (op->active_prev == NULL)
648	{
649	active_objects = op->active_next;
650
651	if (op->active_next != NULL)
652	op->active_next->active_prev = NULL;
653	}
654	else
655	{
656	op->active_prev->active_next = op->active_next;
657
658	if (op->active_next)
659	op->active_next->active_prev = op->active_prev;
660	}
661
662	op->active_next = NULL;
663	op->active_prev = NULL;
664	}
665	}	659	}
666		660
667	/* This function removes object 'op' from the list of active
668	* objects.
669	* This should only be used for style maps or other such
670	* reference maps where you don't want an object that isn't
671	* in play chewing up cpu time getting processed.
672	* The reverse of this is to call update_ob_speed, which
673	* will do the right thing based on the speed of the object.
674	*/
675	void
676	remove_from_active_list (object *op)
677	{
678	/* If not on the active list, nothing needs to be done */
679	if (!op->active_next && !op->active_prev && op != active_objects)
680	return;
681
682	if (op->active_prev == NULL)
683	{
684	active_objects = op->active_next;
685	if (op->active_next != NULL)
686	op->active_next->active_prev = NULL;
687	}
688	else
689	{
690	op->active_prev->active_next = op->active_next;
691	if (op->active_next)
692	op->active_next->active_prev = op->active_prev;
693	}
694	op->active_next = NULL;
695	op->active_prev = NULL;
696	}
697
698	/*	661	/*
699	* update_object() updates the array which represents the map.	662	* update_object() updates the the map.
700	* It takes into account invisible objects (and represent squares covered	663	* It takes into account invisible objects (and represent squares covered
701	* by invisible objects by whatever is below them (unless it's another	664	* by invisible objects by whatever is below them (unless it's another
702	* invisible object, etc...)	665	* invisible object, etc...)
703	* If the object being updated is beneath a player, the look-window	666	* If the object being updated is beneath a player, the look-window
704	* of that player is updated (this might be a suboptimal way of	667	* of that player is updated (this might be a suboptimal way of
705	* updating that window, though, since update_object() is called _often_)	668	* updating that window, though, since update_object() is called _often_)
706	*	669	*
707	* action is a hint of what the caller believes need to be done.	670	* action is a hint of what the caller believes need to be done.
708	* For example, if the only thing that has changed is the face (due to
709	* an animation), we don't need to call update_position until that actually
710	* comes into view of a player. OTOH, many other things, like addition/removal
711	* of walls or living creatures may need us to update the flags now.
712	* current action are:	671	* current action are:
713	* UP_OBJ_INSERT: op was inserted	672	* UP_OBJ_INSERT: op was inserted
714	* UP_OBJ_REMOVE: op was removed	673	* UP_OBJ_REMOVE: op was removed
715	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update	674	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
716	* as that is easier than trying to look at what may have changed.	675	* as that is easier than trying to look at what may have changed.
717	* UP_OBJ_FACE: only the objects face has changed.	676	* UP_OBJ_FACE: only the objects face has changed.
718	*/	677	*/
719
720	void	678	void
721	update_object (object *op, int action)	679	update_object (object *op, int action)
722	{	680	{
723	int update_now = 0, flags;
724	MoveType move_on, move_off, move_block, move_slow;
725
726	if (op == NULL)	681	if (op == NULL)
727	{	682	{
728	/* this should never happen */	683	/* this should never happen */
729	LOG (llevDebug, "update_object() called for NULL object.\n");	684	LOG (llevDebug, "update_object() called for NULL object.\n");
730	return;	685	return;
731	}	686	}
732		687
733	if (op->env != NULL)	688	if (op->env)
734	{	689	{
735	/* Animation is currently handled by client, so nothing	690	/* Animation is currently handled by client, so nothing
736	* to do in this case.	691	* to do in this case.
737	*/	692	*/
738	return;	693	return;
…		…
743	*/	698	*/
744	if (!op->map || op->map->in_memory == MAP_SAVING)	699	if (!op->map || op->map->in_memory == MAP_SAVING)
745	return;	700	return;
746		701
747	/* make sure the object is within map boundaries */	702	/* make sure the object is within map boundaries */
748	if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))	703	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
749	{	704	{
750	LOG (llevError, "update_object() called for object out of map!\n");	705	LOG (llevError, "update_object() called for object out of map!\n");
751	#ifdef MANY_CORES	706	#ifdef MANY_CORES
752	abort ();	707	abort ();
753	#endif	708	#endif
754	return;	709	return;
755	}	710	}
756		711
757	flags = GET_MAP_FLAGS (op->map, op->x, op->y);	712	mapspace &m = op->ms ();
758	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
759	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
760	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
761	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
762	move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
763		713
		714	if (!(m.flags_ & P_UPTODATE))
		715	/* nop */;
764	if (action == UP_OBJ_INSERT)	716	else if (action == UP_OBJ_INSERT)
765	{	717	{
		718	// this is likely overkill, TODO: revisit (schmorp)
766	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))	719	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
767	update_now = 1;
768
769	if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))	720	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
770	update_now = 1;	721	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))
771		722	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
		723	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
772	if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))	724	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
773	update_now = 1;
774
775	if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
776	update_now = 1;
777
778	if (op->type == SAFE_GROUND && !(flags & P_SAFE))
779	update_now = 1;
780
781	if ((move_on | op->move_on) != move_on)	725	|| (m.move_on | op->move_on ) != m.move_on
782	update_now = 1;
783
784	if ((move_off | op->move_off) != move_off)	726	|| (m.move_off | op->move_off ) != m.move_off
785	update_now = 1;	727	|| (m.move_slow | op->move_slow) != m.move_slow
786
787	/* This isn't perfect, but I don't expect a lot of objects to	728	/* This isn't perfect, but I don't expect a lot of objects to
788	* to have move_allow right now.	729	* to have move_allow right now.
789	*/	730	*/
790	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	731	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
791	update_now = 1;	732	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
792		733	m.flags_ = 0;
793	if ((move_slow | op->move_slow) != move_slow)
794	update_now = 1;
795	}	734	}
796
797	/* if the object is being removed, we can't make intelligent	735	/* if the object is being removed, we can't make intelligent
798	* decisions, because remove_ob can't really pass the object	736	* decisions, because remove_ob can't really pass the object
799	* that is being removed.	737	* that is being removed.
800	*/	738	*/
801	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	739	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
802	update_now = 1;	740	m.flags_ = 0;
803	else if (action == UP_OBJ_FACE)	741	else if (action == UP_OBJ_FACE)
804	/* Nothing to do for that case */ ;	742	/* Nothing to do for that case */ ;
805	else	743	else
806	LOG (llevError, "update_object called with invalid action: %d\n", action);	744	LOG (llevError, "update_object called with invalid action: %d\n", action);
807		745
808	if (update_now)
809	{
810	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
811	update_position (op->map, op->x, op->y);
812	}
813
814	if (op->more != NULL)	746	if (op->more)
815	update_object (op->more, action);	747	update_object (op->more, action);
816	}
817
818	object::vector object::mortals;
819	object::vector object::objects; // not yet used
820	object *object::first;
821
822	void object::free_mortals ()
823	{
824	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
825	if ((*i)->refcnt)
826	++i; // further delay freeing
827	else
828	{
829	delete *i;
830	mortals.erase (i);
831	}
832	}	748	}
833		749
834	object::object ()	750	object::object ()
835	{	751	{
836	SET_FLAG (this, FLAG_REMOVED);	752	SET_FLAG (this, FLAG_REMOVED);
…		…
839	face = blank_face;	755	face = blank_face;
840	}	756	}
841		757
842	object::~object ()	758	object::~object ()
843	{	759	{
		760	unlink ();
		761
844	free_key_values (this);	762	free_key_values (this);
845	}	763	}
846		764
		765	static int object_count;
		766
847	void object::link ()	767	void object::link ()
848	{	768	{
849	count = ++ob_count;	769	assert (!index);//D
850	uuid = gen_uuid ();	770	uuid = gen_uuid ();
		771	count = ++object_count;
851		772
852	prev = 0;	773	refcnt_inc ();
853	next = object::first;	774	objects.insert (this);
854
855	if (object::first)
856	object::first->prev = this;
857
858	object::first = this;
859	}	775	}
860		776
861	void object::unlink ()	777	void object::unlink ()
862	{	778	{
863	if (this == object::first)	779	if (!index)
864	object::first = next;	780	return;
865		781
866	/* Remove this object from the list of used objects */	782	objects.erase (this);
867	if (prev) prev->next = next;	783	refcnt_dec ();
868	if (next) next->prev = prev;	784	}
869		785
870	prev = 0;	786	void
871	next = 0;	787	object::activate ()
		788	{
		789	/* If already on active list, don't do anything */
		790	if (active)
		791	return;
		792
		793	if (has_active_speed ())
		794	actives.insert (this);
		795	}
		796
		797	void
		798	object::activate_recursive ()
		799	{
		800	activate ();
		801
		802	for (object *op = inv; op; op = op->below)
		803	op->activate_recursive ();
		804	}
		805
		806	/* This function removes object 'op' from the list of active
		807	* objects.
		808	* This should only be used for style maps or other such
		809	* reference maps where you don't want an object that isn't
		810	* in play chewing up cpu time getting processed.
		811	* The reverse of this is to call update_ob_speed, which
		812	* will do the right thing based on the speed of the object.
		813	*/
		814	void
		815	object::deactivate ()
		816	{
		817	/* If not on the active list, nothing needs to be done */
		818	if (!active)
		819	return;
		820
		821	actives.erase (this);
		822	}
		823
		824	void
		825	object::deactivate_recursive ()
		826	{
		827	for (object *op = inv; op; op = op->below)
		828	op->deactivate_recursive ();
		829
		830	deactivate ();
		831	}
		832
		833	void
		834	object::set_flag_inv (int flag, int value)
		835	{
		836	for (object *op = inv; op; op = op->below)
		837	{
		838	op->flag [flag] = value;
		839	op->set_flag_inv (flag, value);
		840	}
		841	}
		842
		843	/*
		844	* Remove and free all objects in the inventory of the given object.
		845	* object.c ?
		846	*/
		847	void
		848	object::destroy_inv (bool drop_to_ground)
		849	{
		850	// need to check first, because the checks below might segfault
		851	// as we might be on an invalid mapspace and crossfire code
		852	// is too buggy to ensure that the inventory is empty.
		853	// corollary: if you create arrows etc. with stuff in tis inventory,
		854	// cf will crash below with off-map x and y
		855	if (!inv)
		856	return;
		857
		858	/* Only if the space blocks everything do we not process -
		859	* if some form of movement is allowed, let objects
		860	* drop on that space.
		861	*/
		862	if (!drop_to_ground
		863	|| !map
		864	|| map->in_memory != MAP_IN_MEMORY
		865	|| map->nodrop
		866	|| ms ().move_block == MOVE_ALL)
		867	{
		868	while (inv)
		869	{
		870	inv->destroy_inv (drop_to_ground);
		871	inv->destroy ();
		872	}
		873	}
		874	else
		875	{ /* Put objects in inventory onto this space */
		876	while (inv)
		877	{
		878	object *op = inv;
		879
		880	if (op->flag [FLAG_STARTEQUIP]
		881	|| op->flag [FLAG_NO_DROP]
		882	|| op->type == RUNE
		883	|| op->type == TRAP
		884	|| op->flag [FLAG_IS_A_TEMPLATE]
		885	|| op->flag [FLAG_DESTROY_ON_DEATH])
		886	op->destroy ();
		887	else
		888	map->insert (op, x, y);
		889	}
		890	}
872	}	891	}
873		892
874	object *object::create ()	893	object *object::create ()
875	{	894	{
876	object *op = new object;	895	object *op = new object;
877	op->link ();	896	op->link ();
878	return op;	897	return op;
879	}	898	}
880		899
881	/*	900	void
882	* free_object() frees everything allocated by an object, removes	901	object::do_destroy ()
883	* it from the list of used objects, and puts it on the list of
884	* free objects. The IS_FREED() flag is set in the object.
885	* The object must have been removed by remove_ob() first for
886	* this function to succeed.
887	*
888	* If destroy_inventory is set, free inventory as well. Else drop items in
889	* inventory to the ground.
890	*/
891	void object::destroy (bool destroy_inventory)
892	{	902	{
893	if (QUERY_FLAG (this, FLAG_FREED))	903	attachable::do_destroy ();
894	return;
895		904
896	if (QUERY_FLAG (this, FLAG_FRIENDLY))	905	if (flag [FLAG_IS_LINKED])
		906	remove_button_link (this);
		907
		908	if (flag [FLAG_FRIENDLY])
897	remove_friendly_object (this);	909	remove_friendly_object (this);
898		910
899	if (!QUERY_FLAG (this, FLAG_REMOVED))	911	if (!flag [FLAG_REMOVED])
900	remove ();	912	remove ();
901		913
902	SET_FLAG (this, FLAG_FREED);	914	destroy_inv (true);
903		915
904	if (more)	916	deactivate ();
905	{	917	unlink ();
906	more->destroy (destroy_inventory);
907	more = 0;
908	}
909		918
910	if (inv)	919	flag [FLAG_FREED] = 1;
911	{
912	/* Only if the space blocks everything do we not process -
913	* if some form of movement is allowed, let objects
914	* drop on that space.
915	*/
916	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
917	{
918	object *op = inv;
919
920	while (op)
921	{
922	object *tmp = op->below;
923	op->destroy (destroy_inventory);
924	op = tmp;
925	}
926	}
927	else
928	{ /* Put objects in inventory onto this space */
929	object *op = inv;
930
931	while (op)
932	{
933	object *tmp = op->below;
934
935	op->remove ();
936
937	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
938	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
939	op->destroy ();
940	else
941	{
942	op->x = x;
943	op->y = y;
944	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
945	}
946
947	op = tmp;
948	}
949	}
950	}
951		920
952	// hack to ensure that freed objects still have a valid map	921	// hack to ensure that freed objects still have a valid map
953	{	922	{
954	static maptile *freed_map; // freed objects are moved here to avoid crashes	923	static maptile *freed_map; // freed objects are moved here to avoid crashes
955		924
…		…
959		928
960	freed_map->name = "/internal/freed_objects_map";	929	freed_map->name = "/internal/freed_objects_map";
961	freed_map->width = 3;	930	freed_map->width = 3;
962	freed_map->height = 3;	931	freed_map->height = 3;
963		932
964	freed_map->allocate ();	933	freed_map->alloc ();
		934	freed_map->in_memory = MAP_IN_MEMORY;
965	}	935	}
966		936
967	map = freed_map;	937	map = freed_map;
968	x = 1;	938	x = 1;
969	y = 1;	939	y = 1;
970	}	940	}
971		941
		942	if (more)
		943	{
		944	more->destroy ();
		945	more = 0;
		946	}
		947
		948	head = 0;
		949
972	// clear those pointers that likely might have circular references to us	950	// clear those pointers that likely might cause circular references
973	owner = 0;	951	owner = 0;
974	enemy = 0;	952	enemy = 0;
975	attacked_by = 0;	953	attacked_by = 0;
		954	current_weapon = 0;
		955	}
976		956
977	// only relevant for players(?), but make sure of it anyways	957	void
978	contr = 0;	958	object::destroy (bool destroy_inventory)
		959	{
		960	if (destroyed ())
		961	return;
979		962
980	/* Remove object from the active list */	963	if (destroy_inventory)
981	speed = 0;	964	destroy_inv (false);
982	update_ob_speed (this);
983		965
984	unlink ();	966	attachable::destroy ();
985
986	mortals.push_back (this);
987	}	967	}
988		968
989	/*	969	/*
990	* sub_weight() recursively (outwards) subtracts a number from the	970	* sub_weight() recursively (outwards) subtracts a number from the
991	* weight of an object (and what is carried by it's environment(s)).	971	* weight of an object (and what is carried by it's environment(s)).
…		…
1007	* This function removes the object op from the linked list of objects	987	* This function removes the object op from the linked list of objects
1008	* which it is currently tied to. When this function is done, the	988	* which it is currently tied to. When this function is done, the
1009	* object will have no environment. If the object previously had an	989	* object will have no environment. If the object previously had an
1010	* environment, the x and y coordinates will be updated to	990	* environment, the x and y coordinates will be updated to
1011	* the previous environment.	991	* the previous environment.
1012	* Beware: This function is called from the editor as well!
1013	*/	992	*/
1014	void	993	void
1015	object::remove ()	994	object::do_remove ()
1016	{	995	{
1017	object *tmp, *last = 0;	996	object *tmp, *last = 0;
1018	object *otmp;	997	object *otmp;
1019		998
1020	int check_walk_off;
1021
1022	if (QUERY_FLAG (this, FLAG_REMOVED))	999	if (QUERY_FLAG (this, FLAG_REMOVED))
1023	return;	1000	return;
1024		1001
1025	SET_FLAG (this, FLAG_REMOVED);	1002	SET_FLAG (this, FLAG_REMOVED);
		1003	INVOKE_OBJECT (REMOVE, this);
1026		1004
1027	if (more)	1005	if (more)
1028	more->remove ();	1006	more->remove ();
1029		1007
1030	/*	1008	/*
…		…
1041	/* NO_FIX_PLAYER is set when a great many changes are being	1019	/* NO_FIX_PLAYER is set when a great many changes are being
1042	* made to players inventory. If set, avoiding the call	1020	* made to players inventory. If set, avoiding the call
1043	* to save cpu time.	1021	* to save cpu time.
1044	*/	1022	*/
1045	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1023	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1046	fix_player (otmp);	1024	otmp->update_stats ();
1047		1025
1048	if (above != NULL)	1026	if (above)
1049	above->below = below;	1027	above->below = below;
1050	else	1028	else
1051	env->inv = below;	1029	env->inv = below;
1052		1030
1053	if (below != NULL)	1031	if (below)
1054	below->above = above;	1032	below->above = above;
1055		1033
1056	/* we set up values so that it could be inserted into	1034	/* we set up values so that it could be inserted into
1057	* the map, but we don't actually do that - it is up	1035	* the map, but we don't actually do that - it is up
1058	* to the caller to decide what we want to do.	1036	* to the caller to decide what we want to do.
…		…
1062	above = 0, below = 0;	1040	above = 0, below = 0;
1063	env = 0;	1041	env = 0;
1064	}	1042	}
1065	else if (map)	1043	else if (map)
1066	{	1044	{
1067	/* Re did the following section of code - it looks like it had	1045	if (type == PLAYER)
1068	* lots of logic for things we no longer care about
1069	*/	1046	{
		1047	// leaving a spot always closes any open container on the ground
		1048	if (container && !container->env)
		1049	// this causes spurious floorbox updates, but it ensures
		1050	// that the CLOSE event is being sent.
		1051	close_container ();
		1052
		1053	--map->players;
		1054	map->touch ();
		1055	}
		1056
		1057	map->dirty = true;
		1058	mapspace &ms = this->ms ();
1070		1059
1071	/* link the object above us */	1060	/* link the object above us */
1072	if (above)	1061	if (above)
1073	above->below = below;	1062	above->below = below;
1074	else	1063	else
1075	SET_MAP_TOP (map, x, y, below); /* we were top, set new top */	1064	ms.top = below; /* we were top, set new top */
1076		1065
1077	/* Relink the object below us, if there is one */	1066	/* Relink the object below us, if there is one */
1078	if (below)	1067	if (below)
1079	below->above = above;	1068	below->above = above;
1080	else	1069	else
…		…
1082	/* Nothing below, which means we need to relink map object for this space	1071	/* Nothing below, which means we need to relink map object for this space
1083	* use translated coordinates in case some oddness with map tiling is	1072	* use translated coordinates in case some oddness with map tiling is
1084	* evident	1073	* evident
1085	*/	1074	*/
1086	if (GET_MAP_OB (map, x, y) != this)	1075	if (GET_MAP_OB (map, x, y) != this)
1087	{
1088	char *dump = dump_object (this);
1089	LOG (llevError,
1090	"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump);	1076	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1091	free (dump);
1092	dump = dump_object (GET_MAP_OB (map, x, y));
1093	LOG (llevError, "%s\n", dump);
1094	free (dump);
1095	}
1096		1077
1097	SET_MAP_OB (map, x, y, above); /* goes on above it. */	1078	ms.bot = above; /* goes on above it. */
1098	}	1079	}
1099		1080
1100	above = 0;	1081	above = 0;
1101	below = 0;	1082	below = 0;
1102		1083
1103	if (map->in_memory == MAP_SAVING)	1084	if (map->in_memory == MAP_SAVING)
1104	return;	1085	return;
1105		1086
1106	check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);	1087	int check_walk_off = !flag [FLAG_NO_APPLY];
1107		1088
1108	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	1089	for (tmp = ms.bot; tmp; tmp = tmp->above)
1109	{	1090	{
1110	/* No point updating the players look faces if he is the object	1091	/* No point updating the players look faces if he is the object
1111	* being removed.	1092	* being removed.
1112	*/	1093	*/
1113		1094
…		…
1117	* removed (most likely destroyed), update the player view	1098	* removed (most likely destroyed), update the player view
1118	* appropriately.	1099	* appropriately.
1119	*/	1100	*/
1120	if (tmp->container == this)	1101	if (tmp->container == this)
1121	{	1102	{
1122	CLEAR_FLAG (this, FLAG_APPLIED);	1103	flag [FLAG_APPLIED] = 0;
1123	tmp->container = 0;	1104	tmp->container = 0;
1124	}	1105	}
1125		1106
		1107	if (tmp->contr->ns)
1126	tmp->contr->socket->floorbox_update ();	1108	tmp->contr->ns->floorbox_update ();
1127	}	1109	}
1128		1110
1129	/* See if player moving off should effect something */	1111	/* See if object moving off should effect something */
1130	if (check_walk_off	1112	if (check_walk_off
1131	&& ((move_type & tmp->move_off)	1113	&& ((move_type & tmp->move_off)
1132	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1114	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1133	{	1115	{
1134	move_apply (tmp, this, 0);	1116	move_apply (tmp, this, 0);
1135		1117
1136	if (destroyed ())	1118	if (destroyed ())
1137	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1119	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1138	}	1120	}
1139		1121
1140	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1141
1142	if (tmp->above == tmp)
1143	tmp->above = 0;
1144
1145	last = tmp;	1122	last = tmp;
1146	}	1123	}
1147		1124
1148	/* last == NULL of there are no objects on this space */	1125	/* last == NULL if there are no objects on this space */
		1126	//TODO: this makes little sense, why only update the topmost object?
1149	if (!last)	1127	if (!last)
1150	{	1128	map->at (x, y).flags_ = 0;
1151	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1152	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1153	* those out anyways, and if there are any flags set right now, they won't
1154	* be correct anyways.
1155	*/
1156	SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE);
1157	update_position (map, x, y);
1158	}
1159	else	1129	else
1160	update_object (last, UP_OBJ_REMOVE);	1130	update_object (last, UP_OBJ_REMOVE);
1161		1131
1162	if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)	1132	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1163	update_all_los (map, x, y);	1133	update_all_los (map, x, y);
1164	}	1134	}
1165	}	1135	}
1166		1136
1167	/*	1137	/*
…		…
1176	merge_ob (object *op, object *top)	1146	merge_ob (object *op, object *top)
1177	{	1147	{
1178	if (!op->nrof)	1148	if (!op->nrof)
1179	return 0;	1149	return 0;
1180		1150
1181	if (top == NULL)	1151	if (top)
1182	for (top = op; top != NULL && top->above != NULL; top = top->above);	1152	for (top = op; top && top->above; top = top->above)
		1153	;
1183		1154
1184	for (; top != NULL; top = top->below)	1155	for (; top; top = top->below)
1185	{	1156	{
1186	if (top == op)	1157	if (top == op)
1187	continue;	1158	continue;
1188		1159
1189	if (object::can_merge (op, top))	1160	if (object::can_merge (op, top))
…		…
1198	}	1169	}
1199		1170
1200	return 0;	1171	return 0;
1201	}	1172	}
1202		1173
		1174	void
		1175	object::expand_tail ()
		1176	{
		1177	if (more)
		1178	return;
		1179
		1180	object *prev = this;
		1181
		1182	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1183	{
		1184	object *op = arch_to_object (at);
		1185
		1186	op->name = name;
		1187	op->name_pl = name_pl;
		1188	op->title = title;
		1189
		1190	op->head = this;
		1191	prev->more = op;
		1192
		1193	prev = op;
		1194	}
		1195	}
		1196
1203	/*	1197	/*
1204	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1198	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1205	* job preparing multi-part monsters	1199	* job preparing multi-part monsters.
1206	*/	1200	*/
1207	object *	1201	object *
1208	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1202	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1209	{	1203	{
1210	object *tmp;
1211
1212	if (op->head)
1213	op = op->head;
1214
1215	for (tmp = op; tmp; tmp = tmp->more)	1204	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1216	{	1205	{
1217	tmp->x = x + tmp->arch->clone.x;	1206	tmp->x = x + tmp->arch->x;
1218	tmp->y = y + tmp->arch->clone.y;	1207	tmp->y = y + tmp->arch->y;
1219	}	1208	}
1220		1209
1221	return insert_ob_in_map (op, m, originator, flag);	1210	return insert_ob_in_map (op, m, originator, flag);
1222	}	1211	}
1223		1212
…		…
1239	* Return value:	1228	* Return value:
1240	* new object if 'op' was merged with other object	1229	* new object if 'op' was merged with other object
1241	* NULL if 'op' was destroyed	1230	* NULL if 'op' was destroyed
1242	* just 'op' otherwise	1231	* just 'op' otherwise
1243	*/	1232	*/
1244
1245	object *	1233	object *
1246	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1234	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1247	{	1235	{
		1236	assert (!op->flag [FLAG_FREED]);
		1237
1248	object *tmp, *top, *floor = NULL;	1238	object *top, *floor = NULL;
1249	sint16 x, y;
1250		1239
1251	if (QUERY_FLAG (op, FLAG_FREED))	1240	op->remove ();
1252	{
1253	LOG (llevError, "Trying to insert freed object!\n");
1254	return NULL;
1255	}
1256		1241
1257	if (m == NULL)	1242	#if 0
1258	{	1243	if (!m->active != !op->active)
1259	char *dump = dump_object (op);	1244	if (m->active)
1260	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1245	op->activate_recursive ();
1261	free (dump);	1246	else
1262	return op;	1247	op->deactivate_recursive ();
1263	}	1248	#endif
1264		1249
1265	if (out_of_map (m, op->x, op->y))	1250	if (out_of_map (m, op->x, op->y))
1266	{	1251	{
1267	char *dump = dump_object (op);
1268	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);	1252	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1269	#ifdef MANY_CORES	1253	#ifdef MANY_CORES
1270	/* Better to catch this here, as otherwise the next use of this object	1254	/* Better to catch this here, as otherwise the next use of this object
1271	* is likely to cause a crash. Better to find out where it is getting	1255	* is likely to cause a crash. Better to find out where it is getting
1272	* improperly inserted.	1256	* improperly inserted.
1273	*/	1257	*/
1274	abort ();	1258	abort ();
1275	#endif	1259	#endif
1276	free (dump);
1277	return op;	1260	return op;
1278	}	1261	}
1279		1262
1280	if (!QUERY_FLAG (op, FLAG_REMOVED))	1263	if (object *more = op->more)
1281	{	1264	if (!insert_ob_in_map (more, m, originator, flag))
1282	char *dump = dump_object (op);
1283	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1284	free (dump);
1285	return op;	1265	return 0;
1286	}
1287
1288	if (op->more != NULL)
1289	{
1290	/* The part may be on a different map. */
1291
1292	object *more = op->more;
1293
1294	/* We really need the caller to normalize coordinates - if
1295	* we set the map, that doesn't work if the location is within
1296	* a map and this is straddling an edge. So only if coordinate
1297	* is clear wrong do we normalize it.
1298	*/
1299	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1300	more->map = get_map_from_coord (m, &more->x, &more->y);
1301	else if (!more->map)
1302	{
1303	/* For backwards compatibility - when not dealing with tiled maps,
1304	* more->map should always point to the parent.
1305	*/
1306	more->map = m;
1307	}
1308
1309	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1310	{
1311	if (!op->head)
1312	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1313
1314	return NULL;
1315	}
1316	}
1317		1266
1318	CLEAR_FLAG (op, FLAG_REMOVED);	1267	CLEAR_FLAG (op, FLAG_REMOVED);
1319		1268
1320	/* Ideally, the caller figures this out. However, it complicates a lot	1269	/* Ideally, the caller figures this out. However, it complicates a lot
1321	* of areas of callers (eg, anything that uses find_free_spot would now	1270	* of areas of callers (eg, anything that uses find_free_spot would now
1322	* need extra work	1271	* need extra work
1323	*/	1272	*/
1324	op->map = get_map_from_coord (m, &op->x, &op->y);	1273	if (!xy_normalise (m, op->x, op->y))
1325	x = op->x;	1274	return 0;
1326	y = op->y;	1275
		1276	op->map = m;
		1277	mapspace &ms = op->ms ();
1327		1278
1328	/* this has to be done after we translate the coordinates.	1279	/* this has to be done after we translate the coordinates.
1329	*/	1280	*/
1330	if (op->nrof && !(flag & INS_NO_MERGE))	1281	if (op->nrof && !(flag & INS_NO_MERGE))
1331	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1282	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1332	if (object::can_merge (op, tmp))	1283	if (object::can_merge (op, tmp))
1333	{	1284	{
1334	op->nrof += tmp->nrof;	1285	op->nrof += tmp->nrof;
1335	tmp->destroy ();	1286	tmp->destroy ();
1336	}	1287	}
…		…
1353	op->below = originator->below;	1304	op->below = originator->below;
1354		1305
1355	if (op->below)	1306	if (op->below)
1356	op->below->above = op;	1307	op->below->above = op;
1357	else	1308	else
1358	SET_MAP_OB (op->map, op->x, op->y, op);	1309	ms.bot = op;
1359		1310
1360	/* since *below* originator, no need to update top */	1311	/* since *below* originator, no need to update top */
1361	originator->below = op;	1312	originator->below = op;
1362	}	1313	}
1363	else	1314	else
1364	{	1315	{
		1316	top = ms.bot;
		1317
1365	/* If there are other objects, then */	1318	/* If there are other objects, then */
1366	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1319	if ((!(flag & INS_MAP_LOAD)) && top)
1367	{	1320	{
1368	object *last = NULL;	1321	object *last = 0;
1369		1322
1370	/*	1323	/*
1371	* If there are multiple objects on this space, we do some trickier handling.	1324	* If there are multiple objects on this space, we do some trickier handling.
1372	* We've already dealt with merging if appropriate.	1325	* We've already dealt with merging if appropriate.
1373	* Generally, we want to put the new object on top. But if	1326	* Generally, we want to put the new object on top. But if
…		…
1377	* once we get to them. This reduces the need to traverse over all of	1330	* once we get to them. This reduces the need to traverse over all of
1378	* them when adding another one - this saves quite a bit of cpu time	1331	* them when adding another one - this saves quite a bit of cpu time
1379	* when lots of spells are cast in one area. Currently, it is presumed	1332	* when lots of spells are cast in one area. Currently, it is presumed
1380	* that flying non pickable objects are spell objects.	1333	* that flying non pickable objects are spell objects.
1381	*/	1334	*/
1382		1335	for (top = ms.bot; top; top = top->above)
1383	while (top != NULL)
1384	{	1336	{
1385	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1337	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1386	floor = top;	1338	floor = top;
1387		1339
1388	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1340	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1391	top = top->below;	1343	top = top->below;
1392	break;	1344	break;
1393	}	1345	}
1394		1346
1395	last = top;	1347	last = top;
1396	top = top->above;
1397	}	1348	}
1398		1349
1399	/* Don't want top to be NULL, so set it to the last valid object */	1350	/* Don't want top to be NULL, so set it to the last valid object */
1400	top = last;	1351	top = last;
1401		1352
…		…
1403	* looks like instead of lots of conditions here.	1354	* looks like instead of lots of conditions here.
1404	* makes things faster, and effectively the same result.	1355	* makes things faster, and effectively the same result.
1405	*/	1356	*/
1406		1357
1407	/* Have object 'fall below' other objects that block view.	1358	/* Have object 'fall below' other objects that block view.
1408	* Unless those objects are exits, type 66	1359	* Unless those objects are exits.
1409	* If INS_ON_TOP is used, don't do this processing	1360	* If INS_ON_TOP is used, don't do this processing
1410	* Need to find the object that in fact blocks view, otherwise	1361	* Need to find the object that in fact blocks view, otherwise
1411	* stacking is a bit odd.	1362	* stacking is a bit odd.
1412	*/	1363	*/
1413	if (!(flag & INS_ON_TOP) &&	1364	if (!(flag & INS_ON_TOP)
1414	(get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1365	&& ms.flags () & P_BLOCKSVIEW
		1366	&& (op->face && !faces [op->face].visibility))
1415	{	1367	{
1416	for (last = top; last != floor; last = last->below)	1368	for (last = top; last != floor; last = last->below)
1417	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1369	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1418	break;	1370	break;
		1371
1419	/* Check to see if we found the object that blocks view,	1372	/* Check to see if we found the object that blocks view,
1420	* and make sure we have a below pointer for it so that	1373	* and make sure we have a below pointer for it so that
1421	* we can get inserted below this one, which requires we	1374	* we can get inserted below this one, which requires we
1422	* set top to the object below us.	1375	* set top to the object below us.
1423	*/	1376	*/
…		…
1425	top = last->below;	1378	top = last->below;
1426	}	1379	}
1427	} /* If objects on this space */	1380	} /* If objects on this space */
1428		1381
1429	if (flag & INS_MAP_LOAD)	1382	if (flag & INS_MAP_LOAD)
1430	top = GET_MAP_TOP (op->map, op->x, op->y);	1383	top = ms.top;
1431		1384
1432	if (flag & INS_ABOVE_FLOOR_ONLY)	1385	if (flag & INS_ABOVE_FLOOR_ONLY)
1433	top = floor;	1386	top = floor;
1434		1387
1435	/* Top is the object that our object (op) is going to get inserted above.	1388	/* Top is the object that our object (op) is going to get inserted above.
1436	*/	1389	*/
1437		1390
1438	/* First object on this space */	1391	/* First object on this space */
1439	if (!top)	1392	if (!top)
1440	{	1393	{
1441	op->above = GET_MAP_OB (op->map, op->x, op->y);	1394	op->above = ms.bot;
1442		1395
1443	if (op->above)	1396	if (op->above)
1444	op->above->below = op;	1397	op->above->below = op;
1445		1398
1446	op->below = NULL;	1399	op->below = 0;
1447	SET_MAP_OB (op->map, op->x, op->y, op);	1400	ms.bot = op;
1448	}	1401	}
1449	else	1402	else
1450	{ /* get inserted into the stack above top */	1403	{ /* get inserted into the stack above top */
1451	op->above = top->above;	1404	op->above = top->above;
1452		1405
…		…
1455		1408
1456	op->below = top;	1409	op->below = top;
1457	top->above = op;	1410	top->above = op;
1458	}	1411	}
1459		1412
1460	if (op->above == NULL)	1413	if (!op->above)
1461	SET_MAP_TOP (op->map, op->x, op->y, op);	1414	ms.top = op;
1462	} /* else not INS_BELOW_ORIGINATOR */	1415	} /* else not INS_BELOW_ORIGINATOR */
1463		1416
1464	if (op->type == PLAYER)	1417	if (op->type == PLAYER)
		1418	{
1465	op->contr->do_los = 1;	1419	op->contr->do_los = 1;
		1420	++op->map->players;
		1421	op->map->touch ();
		1422	}
		1423
		1424	op->map->dirty = true;
1466		1425
1467	/* If we have a floor, we know the player, if any, will be above	1426	/* If we have a floor, we know the player, if any, will be above
1468	* it, so save a few ticks and start from there.	1427	* it, so save a few ticks and start from there.
1469	*/	1428	*/
1470	if (!(flag & INS_MAP_LOAD))	1429	if (!(flag & INS_MAP_LOAD))
1471	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1430	if (object *pl = ms.player ())
1472	if (tmp->type == PLAYER)	1431	if (pl->contr->ns)
1473	tmp->contr->socket->floorbox_update ();	1432	pl->contr->ns->floorbox_update ();
1474		1433
1475	/* If this object glows, it may affect lighting conditions that are	1434	/* If this object glows, it may affect lighting conditions that are
1476	* visible to others on this map. But update_all_los is really	1435	* visible to others on this map. But update_all_los is really
1477	* an inefficient way to do this, as it means los for all players	1436	* an inefficient way to do this, as it means los for all players
1478	* on the map will get recalculated. The players could very well	1437	* on the map will get recalculated. The players could very well
1479	* be far away from this change and not affected in any way -	1438	* be far away from this change and not affected in any way -
1480	* this should get redone to only look for players within range,	1439	* this should get redone to only look for players within range,
1481	* or just updating the P_NEED_UPDATE for spaces within this area	1440	* or just updating the P_UPTODATE for spaces within this area
1482	* of effect may be sufficient.	1441	* of effect may be sufficient.
1483	*/	1442	*/
1484	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1443	if (op->map->darkness && (op->glow_radius != 0))
1485	update_all_los (op->map, op->x, op->y);	1444	update_all_los (op->map, op->x, op->y);
1486		1445
1487	/* updates flags (blocked, alive, no magic, etc) for this map space */	1446	/* updates flags (blocked, alive, no magic, etc) for this map space */
1488	update_object (op, UP_OBJ_INSERT);	1447	update_object (op, UP_OBJ_INSERT);
		1448
		1449	INVOKE_OBJECT (INSERT, op);
1489		1450
1490	/* Don't know if moving this to the end will break anything. However,	1451	/* Don't know if moving this to the end will break anything. However,
1491	* we want to have floorbox_update called before calling this.	1452	* we want to have floorbox_update called before calling this.
1492	*	1453	*
1493	* check_move_on() must be after this because code called from	1454	* check_move_on() must be after this because code called from
…		…
1495	* blocked() and wall() work properly), and these flags are updated by	1456	* blocked() and wall() work properly), and these flags are updated by
1496	* update_object().	1457	* update_object().
1497	*/	1458	*/
1498		1459
1499	/* if this is not the head or flag has been passed, don't check walk on status */	1460	/* if this is not the head or flag has been passed, don't check walk on status */
1500	if (!(flag & INS_NO_WALK_ON) && !op->head)	1461	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1501	{	1462	{
1502	if (check_move_on (op, originator))	1463	if (check_move_on (op, originator))
1503	return NULL;	1464	return 0;
1504		1465
1505	/* If we are a multi part object, lets work our way through the check	1466	/* If we are a multi part object, lets work our way through the check
1506	* walk on's.	1467	* walk on's.
1507	*/	1468	*/
1508	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1469	for (object *tmp = op->more; tmp; tmp = tmp->more)
1509	if (check_move_on (tmp, originator))	1470	if (check_move_on (tmp, originator))
1510	return NULL;	1471	return 0;
1511	}	1472	}
1512		1473
1513	return op;	1474	return op;
1514	}	1475	}
1515		1476
1516	/* this function inserts an object in the map, but if it	1477	/* this function inserts an object in the map, but if it
1517	* finds an object of its own type, it'll remove that one first.	1478	* finds an object of its own type, it'll remove that one first.
1518	* op is the object to insert it under: supplies x and the map.	1479	* op is the object to insert it under: supplies x and the map.
1519	*/	1480	*/
1520	void	1481	void
1521	replace_insert_ob_in_map (const char *arch_string, object *op)	1482	replace_insert_ob_in_map (const char *arch_string, object *op)
1522	{	1483	{
1523	object *	1484	object *tmp, *tmp1;
1524	tmp;
1525	object *
1526	tmp1;
1527		1485
1528	/* first search for itself and remove any old instances */	1486	/* first search for itself and remove any old instances */
1529		1487
1530	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1488	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1531	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1489	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1532	tmp->destroy ();	1490	tmp->destroy ();
1533		1491
1534	tmp1 = arch_to_object (archetype::find (arch_string));	1492	tmp1 = arch_to_object (archetype::find (arch_string));
1535		1493
1536	tmp1->x = op->x;	1494	tmp1->x = op->x;
1537	tmp1->y = op->y;	1495	tmp1->y = op->y;
1538	insert_ob_in_map (tmp1, op->map, op, 0);	1496	insert_ob_in_map (tmp1, op->map, op, 0);
		1497	}
		1498
		1499	object *
		1500	object::insert_at (object *where, object *originator, int flags)
		1501	{
		1502	return where->map->insert (this, where->x, where->y, originator, flags);
1539	}	1503	}
1540		1504
1541	/*	1505	/*
1542	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1506	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1543	* is returned contains nr objects, and the remaining parts contains	1507	* is returned contains nr objects, and the remaining parts contains
1544	* the rest (or is removed and freed if that number is 0).	1508	* the rest (or is removed and freed if that number is 0).
1545	* On failure, NULL is returned, and the reason put into the	1509	* On failure, NULL is returned, and the reason put into the
1546	* global static errmsg array.	1510	* global static errmsg array.
1547	*/	1511	*/
1548
1549	object *	1512	object *
1550	get_split_ob (object *orig_ob, uint32 nr)	1513	get_split_ob (object *orig_ob, uint32 nr)
1551	{	1514	{
1552	object *newob;	1515	object *newob;
1553	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1516	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1584	* the amount of an object. If the amount reaches 0, the object	1547	* the amount of an object. If the amount reaches 0, the object
1585	* is subsequently removed and freed.	1548	* is subsequently removed and freed.
1586	*	1549	*
1587	* Return value: 'op' if something is left, NULL if the amount reached 0	1550	* Return value: 'op' if something is left, NULL if the amount reached 0
1588	*/	1551	*/
1589
1590	object *	1552	object *
1591	decrease_ob_nr (object *op, uint32 i)	1553	decrease_ob_nr (object *op, uint32 i)
1592	{	1554	{
1593	object *tmp;	1555	object *tmp;
1594	player *pl;
1595		1556
1596	if (i == 0) /* objects with op->nrof require this check */	1557	if (i == 0) /* objects with op->nrof require this check */
1597	return op;	1558	return op;
1598		1559
1599	if (i > op->nrof)	1560	if (i > op->nrof)
…		…
1612	* IMO, searching through all the players will mostly	1573	* IMO, searching through all the players will mostly
1613	* likely be quicker than following op->env to the map,	1574	* likely be quicker than following op->env to the map,
1614	* and then searching the map for a player.	1575	* and then searching the map for a player.
1615	*/	1576	*/
1616	if (!tmp)	1577	if (!tmp)
1617	{	1578	for_all_players (pl)
1618	for (pl = first_player; pl; pl = pl->next)
1619	if (pl->ob->container == op->env)	1579	if (pl->ob->container == op->env)
1620	{	1580	{
1621	tmp = pl->ob;	1581	tmp = pl->ob;
1622	break;	1582	break;
1623	}	1583	}
1624	}
1625		1584
1626	if (i < op->nrof)	1585	if (i < op->nrof)
1627	{	1586	{
1628	sub_weight (op->env, op->weight * i);	1587	sub_weight (op->env, op->weight * i);
1629	op->nrof -= i;	1588	op->nrof -= i;
…		…
1672		1631
1673	/*	1632	/*
1674	* add_weight(object, weight) adds the specified weight to an object,	1633	* add_weight(object, weight) adds the specified weight to an object,
1675	* and also updates how much the environment(s) is/are carrying.	1634	* and also updates how much the environment(s) is/are carrying.
1676	*/	1635	*/
1677
1678	void	1636	void
1679	add_weight (object *op, signed long weight)	1637	add_weight (object *op, signed long weight)
1680	{	1638	{
1681	while (op != NULL)	1639	while (op != NULL)
1682	{	1640	{
…		…
1697	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1655	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1698	free (dump);	1656	free (dump);
1699	return op;	1657	return op;
1700	}	1658	}
1701		1659
1702	if (where->head)	1660	if (where->head_ () != where)
1703	{	1661	{
1704	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1662	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1705	where = where->head;	1663	where = where->head;
1706	}	1664	}
1707		1665
1708	return where->insert (op);	1666	return where->insert (op);
1709	}	1667	}
…		…
1714	* inside the object environment.	1672	* inside the object environment.
1715	*	1673	*
1716	* The function returns now pointer to inserted item, and return value can	1674	* The function returns now pointer to inserted item, and return value can
1717	* be != op, if items are merged. -Tero	1675	* be != op, if items are merged. -Tero
1718	*/	1676	*/
1719
1720	object *	1677	object *
1721	object::insert (object *op)	1678	object::insert (object *op)
1722	{	1679	{
1723	object *tmp, *otmp;	1680	object *tmp, *otmp;
1724		1681
…		…
1765	add_weight (this, (op->weight + op->carrying));	1722	add_weight (this, (op->weight + op->carrying));
1766		1723
1767	otmp = this->in_player ();	1724	otmp = this->in_player ();
1768	if (otmp && otmp->contr)	1725	if (otmp && otmp->contr)
1769	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1726	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1770	fix_player (otmp);	1727	otmp->update_stats ();
1771		1728
1772	op->map = 0;	1729	op->map = 0;
1773	op->env = this;	1730	op->env = this;
1774	op->above = 0;	1731	op->above = 0;
1775	op->below = 0;	1732	op->below = 0;
…		…
1779	if ((op->glow_radius != 0) && map)	1736	if ((op->glow_radius != 0) && map)
1780	{	1737	{
1781	#ifdef DEBUG_LIGHTS	1738	#ifdef DEBUG_LIGHTS
1782	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1739	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1783	#endif /* DEBUG_LIGHTS */	1740	#endif /* DEBUG_LIGHTS */
1784	if (MAP_DARKNESS (map))	1741	if (map->darkness)
1785	update_all_los (map, x, y);	1742	update_all_los (map, x, y);
1786	}	1743	}
1787		1744
1788	/* Client has no idea of ordering so lets not bother ordering it here.	1745	/* Client has no idea of ordering so lets not bother ordering it here.
1789	* It sure simplifies this function...	1746	* It sure simplifies this function...
…		…
1794	{	1751	{
1795	op->below = inv;	1752	op->below = inv;
1796	op->below->above = op;	1753	op->below->above = op;
1797	inv = op;	1754	inv = op;
1798	}	1755	}
		1756
		1757	INVOKE_OBJECT (INSERT, this);
1799		1758
1800	return op;	1759	return op;
1801	}	1760	}
1802		1761
1803	/*	1762	/*
…		…
1818	*	1777	*
1819	* MSW 2001-07-08: Check all objects on space, not just those below	1778	* MSW 2001-07-08: Check all objects on space, not just those below
1820	* object being inserted. insert_ob_in_map may not put new objects	1779	* object being inserted. insert_ob_in_map may not put new objects
1821	* on top.	1780	* on top.
1822	*/	1781	*/
1823
1824	int	1782	int
1825	check_move_on (object *op, object *originator)	1783	check_move_on (object *op, object *originator)
1826	{	1784	{
1827	object *tmp;	1785	object *tmp;
1828	maptile *m = op->map;	1786	maptile *m = op->map;
…		…
1855		1813
1856	/* The objects have to be checked from top to bottom.	1814	/* The objects have to be checked from top to bottom.
1857	* Hence, we first go to the top:	1815	* Hence, we first go to the top:
1858	*/	1816	*/
1859		1817
1860	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1818	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1861	{	1819	{
1862	/* Trim the search when we find the first other spell effect	1820	/* Trim the search when we find the first other spell effect
1863	* this helps performance so that if a space has 50 spell objects,	1821	* this helps performance so that if a space has 50 spell objects,
1864	* we don't need to check all of them.	1822	* we don't need to check all of them.
1865	*/	1823	*/
…		…
1883	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1841	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1884	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1842	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1885	{	1843	{
1886		1844
1887	float	1845	float
1888	diff = tmp->move_slow_penalty * FABS (op->speed);	1846	diff = tmp->move_slow_penalty * fabs (op->speed);
1889		1847
1890	if (op->type == PLAYER)	1848	if (op->type == PLAYER)
1891	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1849	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1892	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1850	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1893	diff /= 4.0;	1851	diff /= 4.0;
…		…
1920	/*	1878	/*
1921	* present_arch(arch, map, x, y) searches for any objects with	1879	* present_arch(arch, map, x, y) searches for any objects with
1922	* a matching archetype at the given map and coordinates.	1880	* a matching archetype at the given map and coordinates.
1923	* The first matching object is returned, or NULL if none.	1881	* The first matching object is returned, or NULL if none.
1924	*/	1882	*/
1925
1926	object *	1883	object *
1927	present_arch (const archetype *at, maptile *m, int x, int y)	1884	present_arch (const archetype *at, maptile *m, int x, int y)
1928	{	1885	{
1929	object *
1930	tmp;
1931
1932	if (m == NULL || out_of_map (m, x, y))	1886	if (!m || out_of_map (m, x, y))
1933	{	1887	{
1934	LOG (llevError, "Present_arch called outside map.\n");	1888	LOG (llevError, "Present_arch called outside map.\n");
1935	return NULL;	1889	return NULL;
1936	}	1890	}
1937	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1891
		1892	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1938	if (tmp->arch == at)	1893	if (tmp->arch == at)
1939	return tmp;	1894	return tmp;
		1895
1940	return NULL;	1896	return NULL;
1941	}	1897	}
1942		1898
1943	/*	1899	/*
1944	* present(type, map, x, y) searches for any objects with	1900	* present(type, map, x, y) searches for any objects with
1945	* a matching type variable at the given map and coordinates.	1901	* a matching type variable at the given map and coordinates.
1946	* The first matching object is returned, or NULL if none.	1902	* The first matching object is returned, or NULL if none.
1947	*/	1903	*/
1948
1949	object *	1904	object *
1950	present (unsigned char type, maptile *m, int x, int y)	1905	present (unsigned char type, maptile *m, int x, int y)
1951	{	1906	{
1952	object *
1953	tmp;
1954
1955	if (out_of_map (m, x, y))	1907	if (out_of_map (m, x, y))
1956	{	1908	{
1957	LOG (llevError, "Present called outside map.\n");	1909	LOG (llevError, "Present called outside map.\n");
1958	return NULL;	1910	return NULL;
1959	}	1911	}
1960	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1912
		1913	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1961	if (tmp->type == type)	1914	if (tmp->type == type)
1962	return tmp;	1915	return tmp;
		1916
1963	return NULL;	1917	return NULL;
1964	}	1918	}
1965		1919
1966	/*	1920	/*
1967	* present_in_ob(type, object) searches for any objects with	1921	* present_in_ob(type, object) searches for any objects with
1968	* a matching type variable in the inventory of the given object.	1922	* a matching type variable in the inventory of the given object.
1969	* The first matching object is returned, or NULL if none.	1923	* The first matching object is returned, or NULL if none.
1970	*/	1924	*/
1971
1972	object *	1925	object *
1973	present_in_ob (unsigned char type, const object *op)	1926	present_in_ob (unsigned char type, const object *op)
1974	{	1927	{
1975	object *
1976	tmp;
1977
1978	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1928	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1979	if (tmp->type == type)	1929	if (tmp->type == type)
1980	return tmp;	1930	return tmp;
		1931
1981	return NULL;	1932	return NULL;
1982	}	1933	}
1983		1934
1984	/*	1935	/*
1985	* present_in_ob (type, str, object) searches for any objects with	1936	* present_in_ob (type, str, object) searches for any objects with
…		…
1993	* str is the string to match against. Note that we match against	1944	* str is the string to match against. Note that we match against
1994	* the object name, not the archetype name. this is so that the	1945	* the object name, not the archetype name. this is so that the
1995	* spell code can use one object type (force), but change it's name	1946	* spell code can use one object type (force), but change it's name
1996	* to be unique.	1947	* to be unique.
1997	*/	1948	*/
1998
1999	object *	1949	object *
2000	present_in_ob_by_name (int type, const char *str, const object *op)	1950	present_in_ob_by_name (int type, const char *str, const object *op)
2001	{	1951	{
2002	object *
2003	tmp;
2004
2005	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1952	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2006	{
2007	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1953	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2008	return tmp;	1954	return tmp;
2009	}	1955
2010	return NULL;	1956	return 0;
2011	}	1957	}
2012		1958
2013	/*	1959	/*
2014	* present_arch_in_ob(archetype, object) searches for any objects with	1960	* present_arch_in_ob(archetype, object) searches for any objects with
2015	* a matching archetype in the inventory of the given object.	1961	* a matching archetype in the inventory of the given object.
2016	* The first matching object is returned, or NULL if none.	1962	* The first matching object is returned, or NULL if none.
2017	*/	1963	*/
2018
2019	object *	1964	object *
2020	present_arch_in_ob (const archetype *at, const object *op)	1965	present_arch_in_ob (const archetype *at, const object *op)
2021	{	1966	{
2022	object *
2023	tmp;
2024
2025	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1967	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2026	if (tmp->arch == at)	1968	if (tmp->arch == at)
2027	return tmp;	1969	return tmp;
		1970
2028	return NULL;	1971	return NULL;
2029	}	1972	}
2030		1973
2031	/*	1974	/*
2032	* activate recursively a flag on an object inventory	1975	* activate recursively a flag on an object inventory
2033	*/	1976	*/
2034	void	1977	void
2035	flag_inv (object *op, int flag)	1978	flag_inv (object *op, int flag)
2036	{	1979	{
2037	object *
2038	tmp;
2039
2040	if (op->inv)	1980	if (op->inv)
2041	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1981	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2042	{	1982	{
2043	SET_FLAG (tmp, flag);	1983	SET_FLAG (tmp, flag);
2044	flag_inv (tmp, flag);	1984	flag_inv (tmp, flag);
2045	}	1985	}
2046	} /*	1986	}
		1987
		1988	/*
2047	* desactivate recursively a flag on an object inventory	1989	* deactivate recursively a flag on an object inventory
2048	*/	1990	*/
2049	void	1991	void
2050	unflag_inv (object *op, int flag)	1992	unflag_inv (object *op, int flag)
2051	{	1993	{
2052	object *
2053	tmp;
2054
2055	if (op->inv)	1994	if (op->inv)
2056	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1995	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2057	{	1996	{
2058	CLEAR_FLAG (tmp, flag);	1997	CLEAR_FLAG (tmp, flag);
2059	unflag_inv (tmp, flag);	1998	unflag_inv (tmp, flag);
2060	}	1999	}
2061	}
2062
2063	/*
2064	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2065	* all it's inventory (recursively).
2066	* If checksums are used, a player will get set_cheat called for
2067	* him/her-self and all object carried by a call to this function.
2068	*/
2069
2070	void
2071	set_cheat (object *op)
2072	{
2073	SET_FLAG (op, FLAG_WAS_WIZ);
2074	flag_inv (op, FLAG_WAS_WIZ);
2075	}	2000	}
2076		2001
2077	/*	2002	/*
2078	* find_free_spot(object, map, x, y, start, stop) will search for	2003	* find_free_spot(object, map, x, y, start, stop) will search for
2079	* a spot at the given map and coordinates which will be able to contain	2004	* a spot at the given map and coordinates which will be able to contain
…		…
2093	* because arch_blocked (now ob_blocked) needs to know the movement type	2018	* because arch_blocked (now ob_blocked) needs to know the movement type
2094	* to know if the space in question will block the object. We can't use	2019	* to know if the space in question will block the object. We can't use
2095	* the archetype because that isn't correct if the monster has been	2020	* the archetype because that isn't correct if the monster has been
2096	* customized, changed states, etc.	2021	* customized, changed states, etc.
2097	*/	2022	*/
2098
2099	int	2023	int
2100	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	2024	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2101	{	2025	{
2102	int
2103	i,
2104	index = 0, flag;	2026	int index = 0, flag;
2105	static int
2106	altern[SIZEOFFREE];	2027	int altern[SIZEOFFREE];
2107		2028
2108	for (i = start; i < stop; i++)	2029	for (int i = start; i < stop; i++)
2109	{	2030	{
2110	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2031	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2111	if (!flag)	2032	if (!flag)
2112	altern[index++] = i;	2033	altern [index++] = i;
2113		2034
2114	/* Basically, if we find a wall on a space, we cut down the search size.	2035	/* Basically, if we find a wall on a space, we cut down the search size.
2115	* In this way, we won't return spaces that are on another side of a wall.	2036	* In this way, we won't return spaces that are on another side of a wall.
2116	* This mostly work, but it cuts down the search size in all directions -	2037	* This mostly work, but it cuts down the search size in all directions -
2117	* if the space being examined only has a wall to the north and empty	2038	* if the space being examined only has a wall to the north and empty
…		…
2124	}	2045	}
2125		2046
2126	if (!index)	2047	if (!index)
2127	return -1;	2048	return -1;
2128		2049
2129	return altern[RANDOM () % index];	2050	return altern [rndm (index)];
2130	}	2051	}
2131		2052
2132	/*	2053	/*
2133	* find_first_free_spot(archetype, maptile, x, y) works like	2054	* find_first_free_spot(archetype, maptile, x, y) works like
2134	* find_free_spot(), but it will search max number of squares.	2055	* find_free_spot(), but it will search max number of squares.
2135	* But it will return the first available spot, not a random choice.	2056	* But it will return the first available spot, not a random choice.
2136	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2057	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2137	*/	2058	*/
2138
2139	int	2059	int
2140	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2060	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2141	{	2061	{
2142	int
2143	i;
2144
2145	for (i = 0; i < SIZEOFFREE; i++)	2062	for (int i = 0; i < SIZEOFFREE; i++)
2146	{
2147	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2063	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2148	return i;	2064	return i;
2149	}	2065
2150	return -1;	2066	return -1;
2151	}	2067	}
2152		2068
2153	/*	2069	/*
2154	* The function permute(arr, begin, end) randomly reorders the array	2070	* The function permute(arr, begin, end) randomly reorders the array
2155	* arr[begin..end-1].	2071	* arr[begin..end-1].
		2072	* now uses a fisher-yates shuffle, old permute was broken
2156	*/	2073	*/
2157	static void	2074	static void
2158	permute (int *arr, int begin, int end)	2075	permute (int *arr, int begin, int end)
2159	{	2076	{
2160	int	2077	arr += begin;
2161	i,
2162	j,
2163	tmp,
2164	len;
2165
2166	len = end - begin;	2078	end -= begin;
2167	for (i = begin; i < end; i++)
2168	{
2169	j = begin + RANDOM () % len;
2170		2079
2171	tmp = arr[i];	2080	while (--end)
2172	arr[i] = arr[j];	2081	swap (arr [end], arr [rndm (end + 1)]);
2173	arr[j] = tmp;
2174	}
2175	}	2082	}
2176		2083
2177	/* new function to make monster searching more efficient, and effective!	2084	/* new function to make monster searching more efficient, and effective!
2178	* This basically returns a randomized array (in the passed pointer) of	2085	* This basically returns a randomized array (in the passed pointer) of
2179	* the spaces to find monsters. In this way, it won't always look for	2086	* the spaces to find monsters. In this way, it won't always look for
…		…
2182	* the 3x3 area will be searched, just not in a predictable order.	2089	* the 3x3 area will be searched, just not in a predictable order.
2183	*/	2090	*/
2184	void	2091	void
2185	get_search_arr (int *search_arr)	2092	get_search_arr (int *search_arr)
2186	{	2093	{
2187	int	2094	int i;
2188	i;
2189		2095
2190	for (i = 0; i < SIZEOFFREE; i++)	2096	for (i = 0; i < SIZEOFFREE; i++)
2191	{
2192	search_arr[i] = i;	2097	search_arr[i] = i;
2193	}
2194		2098
2195	permute (search_arr, 1, SIZEOFFREE1 + 1);	2099	permute (search_arr, 1, SIZEOFFREE1 + 1);
2196	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2100	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2197	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2101	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2198	}	2102	}
…		…
2207	* Perhaps incorrectly, but I'm making the assumption that exclude	2111	* Perhaps incorrectly, but I'm making the assumption that exclude
2208	* is actually want is going to try and move there. We need this info	2112	* is actually want is going to try and move there. We need this info
2209	* because we have to know what movement the thing looking to move	2113	* because we have to know what movement the thing looking to move
2210	* there is capable of.	2114	* there is capable of.
2211	*/	2115	*/
2212
2213	int	2116	int
2214	find_dir (maptile *m, int x, int y, object *exclude)	2117	find_dir (maptile *m, int x, int y, object *exclude)
2215	{	2118	{
2216	int
2217	i,
2218	max = SIZEOFFREE, mflags;	2119	int i, max = SIZEOFFREE, mflags;
2219		2120
2220	sint16 nx, ny;	2121	sint16 nx, ny;
2221	object *	2122	object *tmp;
2222	tmp;
2223	maptile *	2123	maptile *mp;
2224	mp;
2225		2124
2226	MoveType blocked, move_type;	2125	MoveType blocked, move_type;
2227		2126
2228	if (exclude && exclude->head)	2127	if (exclude && exclude->head_ () != exclude)
2229	{	2128	{
2230	exclude = exclude->head;	2129	exclude = exclude->head;
2231	move_type = exclude->move_type;	2130	move_type = exclude->move_type;
2232	}	2131	}
2233	else	2132	else
…		…
2241	mp = m;	2140	mp = m;
2242	nx = x + freearr_x[i];	2141	nx = x + freearr_x[i];
2243	ny = y + freearr_y[i];	2142	ny = y + freearr_y[i];
2244		2143
2245	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2144	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
		2145
2246	if (mflags & P_OUT_OF_MAP)	2146	if (mflags & P_OUT_OF_MAP)
2247	{
2248	max = maxfree[i];	2147	max = maxfree[i];
2249	}
2250	else	2148	else
2251	{	2149	{
2252	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2150	mapspace &ms = mp->at (nx, ny);
		2151
		2152	blocked = ms.move_block;
2253		2153
2254	if ((move_type & blocked) == move_type)	2154	if ((move_type & blocked) == move_type)
2255	{
2256	max = maxfree[i];	2155	max = maxfree[i];
2257	}
2258	else if (mflags & P_IS_ALIVE)	2156	else if (mflags & P_IS_ALIVE)
2259	{	2157	{
2260	for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)	2158	for (tmp = ms.bot; tmp; tmp = tmp->above)
2261	{	2159	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2262	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2160	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2263	{
2264	break;	2161	break;
2265	}	2162
2266	}
2267	if (tmp)	2163	if (tmp)
2268	{
2269	return freedir[i];	2164	return freedir[i];
2270	}
2271	}	2165	}
2272	}	2166	}
2273	}	2167	}
		2168
2274	return 0;	2169	return 0;
2275	}	2170	}
2276		2171
2277	/*	2172	/*
2278	* distance(object 1, object 2) will return the square of the	2173	* distance(object 1, object 2) will return the square of the
2279	* distance between the two given objects.	2174	* distance between the two given objects.
2280	*/	2175	*/
2281
2282	int	2176	int
2283	distance (const object *ob1, const object *ob2)	2177	distance (const object *ob1, const object *ob2)
2284	{	2178	{
2285	int
2286	i;
2287
2288	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2179	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2289	return i;
2290	}	2180	}
2291		2181
2292	/*	2182	/*
2293	* find_dir_2(delta-x,delta-y) will return a direction in which	2183	* find_dir_2(delta-x,delta-y) will return a direction in which
2294	* an object which has subtracted the x and y coordinates of another	2184	* an object which has subtracted the x and y coordinates of another
2295	* object, needs to travel toward it.	2185	* object, needs to travel toward it.
2296	*/	2186	*/
2297
2298	int	2187	int
2299	find_dir_2 (int x, int y)	2188	find_dir_2 (int x, int y)
2300	{	2189	{
2301	int	2190	int q;
2302	q;
2303		2191
2304	if (y)	2192	if (y)
2305	q = x * 100 / y;	2193	q = x * 100 / y;
2306	else if (x)	2194	else if (x)
2307	q = -300 * x;	2195	q = -300 * x;
…		…
2332		2220
2333	return 3;	2221	return 3;
2334	}	2222	}
2335		2223
2336	/*	2224	/*
2337	* absdir(int): Returns a number between 1 and 8, which represent
2338	* the "absolute" direction of a number (it actually takes care of
2339	* "overflow" in previous calculations of a direction).
2340	*/
2341
2342	int
2343	absdir (int d)
2344	{
2345	while (d < 1)
2346	d += 8;
2347	while (d > 8)
2348	d -= 8;
2349	return d;
2350	}
2351
2352	/*
2353	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2225	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2354	* between two directions (which are expected to be absolute (see absdir())	2226	* between two directions (which are expected to be absolute (see absdir())
2355	*/	2227	*/
2356
2357	int	2228	int
2358	dirdiff (int dir1, int dir2)	2229	dirdiff (int dir1, int dir2)
2359	{	2230	{
2360	int	2231	int d;
2361	d;
2362		2232
2363	d = abs (dir1 - dir2);	2233	d = abs (dir1 - dir2);
2364	if (d > 4)	2234	if (d > 4)
2365	d = 8 - d;	2235	d = 8 - d;
		2236
2366	return d;	2237	return d;
2367	}	2238	}
2368		2239
2369	/* peterm:	2240	/* peterm:
2370	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2241	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2373	* This basically means that if direction is 15, then it could either go	2244	* This basically means that if direction is 15, then it could either go
2374	* direction 4, 14, or 16 to get back to where we are.	2245	* direction 4, 14, or 16 to get back to where we are.
2375	* Moved from spell_util.c to object.c with the other related direction	2246	* Moved from spell_util.c to object.c with the other related direction
2376	* functions.	2247	* functions.
2377	*/	2248	*/
2378
2379	int
2380	reduction_dir[SIZEOFFREE][3] = {	2249	int reduction_dir[SIZEOFFREE][3] = {
2381	{0, 0, 0}, /* 0 */	2250	{0, 0, 0}, /* 0 */
2382	{0, 0, 0}, /* 1 */	2251	{0, 0, 0}, /* 1 */
2383	{0, 0, 0}, /* 2 */	2252	{0, 0, 0}, /* 2 */
2384	{0, 0, 0}, /* 3 */	2253	{0, 0, 0}, /* 3 */
2385	{0, 0, 0}, /* 4 */	2254	{0, 0, 0}, /* 4 */
…		…
2433	* find a path to that monster that we found. If not,	2302	* find a path to that monster that we found. If not,
2434	* we don't bother going toward it. Returns 1 if we	2303	* we don't bother going toward it. Returns 1 if we
2435	* can see a direct way to get it	2304	* can see a direct way to get it
2436	* Modified to be map tile aware -.MSW	2305	* Modified to be map tile aware -.MSW
2437	*/	2306	*/
2438
2439
2440	int	2307	int
2441	can_see_monsterP (maptile *m, int x, int y, int dir)	2308	can_see_monsterP (maptile *m, int x, int y, int dir)
2442	{	2309	{
2443	sint16 dx, dy;	2310	sint16 dx, dy;
2444	int
2445	mflags;	2311	int mflags;
2446		2312
2447	if (dir < 0)	2313	if (dir < 0)
2448	return 0; /* exit condition: invalid direction */	2314	return 0; /* exit condition: invalid direction */
2449		2315
2450	dx = x + freearr_x[dir];	2316	dx = x + freearr_x[dir];
…		…
2463	return 0;	2329	return 0;
2464		2330
2465	/* yes, can see. */	2331	/* yes, can see. */
2466	if (dir < 9)	2332	if (dir < 9)
2467	return 1;	2333	return 1;
		2334
2468	return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |	2335	return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2469	can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);	2336	| can_see_monsterP (m, x, y, reduction_dir[dir][1])
		2337	| can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2470	}	2338	}
2471
2472
2473		2339
2474	/*	2340	/*
2475	* can_pick(picker, item): finds out if an object is possible to be	2341	* can_pick(picker, item): finds out if an object is possible to be
2476	* picked up by the picker. Returnes 1 if it can be	2342	* picked up by the picker. Returnes 1 if it can be
2477	* picked up, otherwise 0.	2343	* picked up, otherwise 0.
…		…
2488	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2354	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2489	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2355	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2490	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2356	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2491	}	2357	}
2492		2358
2493
2494	/*	2359	/*
2495	* create clone from object to another	2360	* create clone from object to another
2496	*/	2361	*/
2497	object *	2362	object *
2498	object_create_clone (object *asrc)	2363	object_create_clone (object *asrc)
2499	{	2364	{
2500	object *dst = 0, *tmp, *src, *part, *prev, *item;	2365	object *dst = 0, *tmp, *src, *prev, *item;
2501		2366
2502	if (!asrc)	2367	if (!asrc)
2503	return 0;	2368	return 0;
2504		2369
2505	src = asrc;
2506	if (src->head)
2507	src = src->head;	2370	src = asrc->head_ ();
2508		2371
2509	prev = 0;	2372	prev = 0;
2510	for (part = src; part; part = part->more)	2373	for (object *part = src; part; part = part->more)
2511	{	2374	{
2512	tmp = part->clone ();	2375	tmp = part->clone ();
2513	tmp->x -= src->x;	2376	tmp->x -= src->x;
2514	tmp->y -= src->y;	2377	tmp->y -= src->y;
2515		2378
…		…
2517	{	2380	{
2518	dst = tmp;	2381	dst = tmp;
2519	tmp->head = 0;	2382	tmp->head = 0;
2520	}	2383	}
2521	else	2384	else
2522	{
2523	tmp->head = dst;	2385	tmp->head = dst;
2524	}
2525		2386
2526	tmp->more = 0;	2387	tmp->more = 0;
2527		2388
2528	if (prev)	2389	if (prev)
2529	prev->more = tmp;	2390	prev->more = tmp;
…		…
2533		2394
2534	for (item = src->inv; item; item = item->below)	2395	for (item = src->inv; item; item = item->below)
2535	insert_ob_in_ob (object_create_clone (item), dst);	2396	insert_ob_in_ob (object_create_clone (item), dst);
2536		2397
2537	return dst;	2398	return dst;
2538	}
2539
2540	/* GROS - Creates an object using a string representing its content. */
2541	/* Basically, we save the content of the string to a temp file, then call */
2542	/* load_object on it. I admit it is a highly inefficient way to make things, */
2543	/* but it was simple to make and allows reusing the load_object function. */
2544	/* Remember not to use load_object_str in a time-critical situation. */
2545	/* Also remember that multiparts objects are not supported for now. */
2546
2547	object *
2548	load_object_str (const char *obstr)
2549	{
2550	object *op;
2551	char filename[MAX_BUF];
2552
2553	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2554
2555	FILE *tempfile = fopen (filename, "w");
2556
2557	if (tempfile == NULL)
2558	{
2559	LOG (llevError, "Error - Unable to access load object temp file\n");
2560	return NULL;
2561	}
2562
2563	fprintf (tempfile, obstr);
2564	fclose (tempfile);
2565
2566	op = object::create ();
2567
2568	object_thawer thawer (filename);
2569
2570	if (thawer)
2571	load_object (thawer, op, 0);
2572
2573	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2574	CLEAR_FLAG (op, FLAG_REMOVED);
2575
2576	return op;
2577	}	2399	}
2578		2400
2579	/* This returns the first object in who's inventory that	2401	/* This returns the first object in who's inventory that
2580	* has the same type and subtype match.	2402	* has the same type and subtype match.
2581	* returns NULL if no match.	2403	* returns NULL if no match.
2582	*/	2404	*/
2583	object *	2405	object *
2584	find_obj_by_type_subtype (const object *who, int type, int subtype)	2406	find_obj_by_type_subtype (const object *who, int type, int subtype)
2585	{	2407	{
2586	object *tmp;
2587
2588	for (tmp = who->inv; tmp; tmp = tmp->below)	2408	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2589	if (tmp->type == type && tmp->subtype == subtype)	2409	if (tmp->type == type && tmp->subtype == subtype)
2590	return tmp;	2410	return tmp;
2591		2411
2592	return NULL;	2412	return 0;
2593	}	2413	}
2594		2414
2595	/* If ob has a field named key, return the link from the list,	2415	/* If ob has a field named key, return the link from the list,
2596	* otherwise return NULL.	2416	* otherwise return NULL.
2597	*	2417	*
…		…
2599	* do the desired thing.	2419	* do the desired thing.
2600	*/	2420	*/
2601	key_value *	2421	key_value *
2602	get_ob_key_link (const object *ob, const char *key)	2422	get_ob_key_link (const object *ob, const char *key)
2603	{	2423	{
2604	key_value *link;
2605
2606	for (link = ob->key_values; link != NULL; link = link->next)	2424	for (key_value *link = ob->key_values; link; link = link->next)
2607	if (link->key == key)	2425	if (link->key == key)
2608	return link;	2426	return link;
2609		2427
2610	return NULL;	2428	return 0;
2611	}	2429	}
2612		2430
2613	/*	2431	/*
2614	* Returns the value of op has an extra_field for key, or NULL.	2432	* Returns the value of op has an extra_field for key, or NULL.
2615	*	2433	*
…		…
2640	if (link->key == canonical_key)	2458	if (link->key == canonical_key)
2641	return link->value;	2459	return link->value;
2642		2460
2643	return 0;	2461	return 0;
2644	}	2462	}
2645
2646		2463
2647	/*	2464	/*
2648	* Updates the canonical_key in op to value.	2465	* Updates the canonical_key in op to value.
2649	*	2466	*
2650	* canonical_key is a shared string (value doesn't have to be).	2467	* canonical_key is a shared string (value doesn't have to be).
…		…
2655	* Returns TRUE on success.	2472	* Returns TRUE on success.
2656	*/	2473	*/
2657	int	2474	int
2658	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2475	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2659	{	2476	{
2660	key_value *
2661	field = NULL, *last = NULL;	2477	key_value *field = NULL, *last = NULL;
2662		2478
2663	for (field = op->key_values; field != NULL; field = field->next)	2479	for (field = op->key_values; field != NULL; field = field->next)
2664	{	2480	{
2665	if (field->key != canonical_key)	2481	if (field->key != canonical_key)
2666	{	2482	{
…		…
2675	/* Basically, if the archetype has this key set,	2491	/* Basically, if the archetype has this key set,
2676	* we need to store the null value so when we save	2492	* we need to store the null value so when we save
2677	* it, we save the empty value so that when we load,	2493	* it, we save the empty value so that when we load,
2678	* we get this value back again.	2494	* we get this value back again.
2679	*/	2495	*/
2680	if (get_ob_key_link (&op->arch->clone, canonical_key))	2496	if (get_ob_key_link (op->arch, canonical_key))
2681	field->value = 0;	2497	field->value = 0;
2682	else	2498	else
2683	{	2499	{
2684	if (last)	2500	if (last)
2685	last->next = field->next;	2501	last->next = field->next;
…		…
2694	/* IF we get here, key doesn't exist */	2510	/* IF we get here, key doesn't exist */
2695		2511
2696	/* No field, we'll have to add it. */	2512	/* No field, we'll have to add it. */
2697		2513
2698	if (!add_key)	2514	if (!add_key)
2699	{
2700	return FALSE;	2515	return FALSE;
2701	}	2516
2702	/* There isn't any good reason to store a null	2517	/* There isn't any good reason to store a null
2703	* value in the key/value list. If the archetype has	2518	* value in the key/value list. If the archetype has
2704	* this key, then we should also have it, so shouldn't	2519	* this key, then we should also have it, so shouldn't
2705	* be here. If user wants to store empty strings,	2520	* be here. If user wants to store empty strings,
2706	* should pass in ""	2521	* should pass in ""
…		…
2755	}	2570	}
2756	else	2571	else
2757	item = item->env;	2572	item = item->env;
2758	}	2573	}
2759		2574
		2575	const char *
		2576	object::flag_desc (char *desc, int len) const
		2577	{
		2578	char *p = desc;
		2579	bool first = true;
		2580
		2581	*p = 0;
		2582
		2583	for (int i = 0; i < NUM_FLAGS; i++)
		2584	{
		2585	if (len <= 10) // magic constant!
		2586	{
		2587	snprintf (p, len, ",...");
		2588	break;
		2589	}
		2590
		2591	if (flag [i])
		2592	{
		2593	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2594	len -= cnt;
		2595	p += cnt;
		2596	first = false;
		2597	}
		2598	}
		2599
		2600	return desc;
		2601	}
		2602
2760	// return a suitable string describing an objetc in enough detail to find it	2603	// return a suitable string describing an object in enough detail to find it
2761	const char *	2604	const char *
2762	object::debug_desc (char *info) const	2605	object::debug_desc (char *info) const
2763	{	2606	{
		2607	char flagdesc[512];
2764	char info2[256 * 3];	2608	char info2[256 * 4];
2765	char *p = info;	2609	char *p = info;
2766		2610
2767	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2611	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2768	count,	2612	count, uuid.seq,
2769	&name,	2613	&name,
2770	title ? " " : "",	2614	title ? "\",title:\"" : "",
2771	title ? (const char *)title : "");	2615	title ? (const char *)title : "",
		2616	flag_desc (flagdesc, 512), type);
2772		2617
2773	if (env)	2618	if (env)
2774	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2619	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2775		2620
2776	if (map)	2621	if (map)
2777	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2622	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2778		2623
2779	return info;	2624	return info;
2780	}	2625	}
2781		2626
2782	const char *	2627	const char *
2783	object::debug_desc () const	2628	object::debug_desc () const
2784	{	2629	{
2785	static char info[256 * 3];	2630	static char info[3][256 * 4];
		2631	static int info_idx;
		2632
2786	return debug_desc (info);	2633	return debug_desc (info [++info_idx % 3]);
2787	}	2634	}
2788		2635
		2636	struct region *
		2637	object::region () const
		2638	{
		2639	return map ? map->region (x, y)
		2640	: region::default_region ();
		2641	}
		2642
		2643	const materialtype_t *
		2644	object::dominant_material () const
		2645	{
		2646	if (materialtype_t *mat = name_to_material (materialname))
		2647	return mat;
		2648
		2649	// omfg this is slow, this has to be temporary :)
		2650	shstr unknown ("unknown");
		2651
		2652	return name_to_material (unknown);
		2653	}
		2654
		2655	void
		2656	object::open_container (object *new_container)
		2657	{
		2658	if (container == new_container)
		2659	return;
		2660
		2661	if (object *old_container = container)
		2662	{
		2663	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2664	return;
		2665
		2666	#if 0
		2667	// remove the "Close old_container" object.
		2668	if (object *closer = old_container->inv)
		2669	if (closer->type == CLOSE_CON)
		2670	closer->destroy ();
		2671	#endif
		2672
		2673	old_container->flag [FLAG_APPLIED] = 0;
		2674	container = 0;
		2675
		2676	esrv_update_item (UPD_FLAGS, this, old_container);
		2677	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2678	}
		2679
		2680	if (new_container)
		2681	{
		2682	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2683	return;
		2684
		2685	// TODO: this does not seem to serve any purpose anymore?
		2686	#if 0
		2687	// insert the "Close Container" object.
		2688	if (archetype *closer = new_container->other_arch)
		2689	{
		2690	object *closer = arch_to_object (new_container->other_arch);
		2691	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2692	new_container->insert (closer);
		2693	}
		2694	#endif
		2695
		2696	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2697
		2698	new_container->flag [FLAG_APPLIED] = 1;
		2699	container = new_container;
		2700
		2701	esrv_update_item (UPD_FLAGS, this, new_container);
		2702	esrv_send_inventory (this, new_container);
		2703	}
		2704	}
		2705
		2706

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines