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.124 by root, Sat Jan 27 02:19:36 2007 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* CrossFire, A Multiplayer game for X-windows
3		3	*
		4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (C) 2001 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (C) 1992 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* This program is free software; you can redistribute it and/or modify
8	it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation; either version 2 of the License, or
10	(at your option) any later version.	11	* (at your option) 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,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License 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
18	along with this program; if not, write to the Free Software	19	* along with this program; if not, write to the Free Software
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, 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 at <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>
…		…
36		37
37	int nrofallocobjects = 0;	38	int nrofallocobjects = 0;
38	static UUID uuid;	39	static UUID uuid;
39	const uint64 UUID_SKIP = 1<<19;	40	const uint64 UUID_SKIP = 1<<19;
40		41
41	object *active_objects; /* List of active objects that need to be processed */	42	objectvec objects;
		43	activevec actives;
42		44
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,	45	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	46	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	};	47	};
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,	48	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	143	* objects with lists are rare, and lists stay short. If not, use a
142	* different structure or at least keep the lists sorted...	144	* different structure or at least keep the lists sorted...
143	*/	145	*/
144		146
145	/* For each field in wants, */	147	/* For each field in wants, */
146	for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)	148	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)
147	{	149	{
148	key_value *has_field;	150	key_value *has_field;
149		151
150	/* Look for a field in has with the same key. */	152	/* Look for a field in has with the same key. */
151	has_field = get_ob_key_link (has, wants_field->key);	153	has_field = get_ob_key_link (has, wants_field->key);
…		…
190	* Check nrof variable *before* calling can_merge()	192	* Check nrof variable *before* calling can_merge()
191	*	193	*
192	* Improvements made with merge: Better checking on potion, and also	194	* Improvements made with merge: Better checking on potion, and also
193	* check weight	195	* check weight
194	*/	196	*/
195
196	bool object::can_merge_slow (object *ob1, object *ob2)	197	bool object::can_merge_slow (object *ob1, object *ob2)
197	{	198	{
198	/* A couple quicksanity checks */	199	/* A couple quicksanity checks */
199	if (ob1 == ob2	200	if (ob1 == ob2
200	|| ob1->type != ob2->type	201	|| ob1->type != ob2->type
…		…
221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	222	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
222		223
223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	224	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	225	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
225		226
226	if ((ob1->flags ^ ob2->flags).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	227	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
227	|| ob1->arch != ob2->arch	228	|| ob1->arch != ob2->arch
228	|| ob1->name != ob2->name	229	|| ob1->name != ob2->name
229	|| ob1->title != ob2->title	230	|| ob1->title != ob2->title
230	|| ob1->msg != ob2->msg	231	|| ob1->msg != ob2->msg
231	|| ob1->weight != ob2->weight	232	|| ob1->weight != ob2->weight
…		…
277		278
278	/* Note sure why the following is the case - either the object has to	279	/* 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	280	* be animated or have a very low speed. Is this an attempted monster
280	* check?	281	* check?
281	*/	282	*/
282	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	283	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
283	return 0;	284	return 0;
284		285
285	switch (ob1->type)	286	switch (ob1->type)
286	{	287	{
287	case SCROLL:	288	case SCROLL:
…		…
364	{	365	{
365	if (!op)	366	if (!op)
366	return strdup ("[NULLOBJ]");	367	return strdup ("[NULLOBJ]");
367		368
368	object_freezer freezer;	369	object_freezer freezer;
369	save_object (freezer, op, 3);	370	save_object (freezer, op, 1);
370	return freezer.as_string ();	371	return freezer.as_string ();
371	}	372	}
372		373
373	/*	374	/*
374	* get_nearest_part(multi-object, object 2) returns the part of the	375	* get_nearest_part(multi-object, object 2) returns the part of the
…		…
391	}	392	}
392		393
393	/*	394	/*
394	* Returns the object which has the count-variable equal to the argument.	395	* Returns the object which has the count-variable equal to the argument.
395	*/	396	*/
396
397	object *	397	object *
398	find_object (tag_t i)	398	find_object (tag_t i)
399	{	399	{
400	for (object *op = object::first; op; op = op->next)	400	for_all_objects (op)
401	if (op->count == i)	401	if (op->count == i)
402	return op;	402	return op;
403		403
404	return 0;	404	return 0;
405	}	405	}
406		406
407	/*	407	/*
408	* Returns the first object which has a name equal to the argument.	408	* Returns the first object which has a name equal to the argument.
409	* Used only by the patch command, but not all that useful.	409	* Used only by the patch command, but not all that useful.
410	* Enables features like "patch <name-of-other-player> food 999"	410	* Enables features like "patch <name-of-other-player> food 999"
411	*/	411	*/
412
413	object *	412	object *
414	find_object_name (const char *str)	413	find_object_name (const char *str)
415	{	414	{
416	shstr_cmp str_ (str);	415	shstr_cmp str_ (str);
417	object *op;	416	object *op;
418		417
419	for (op = object::first; op != NULL; op = op->next)	418	for_all_objects (op)
420	if (op->name == str_)	419	if (op->name == str_)
421	break;	420	break;
422		421
423	return op;	422	return op;
424	}	423	}
…		…
467	}	466	}
468		467
469	op->key_values = 0;	468	op->key_values = 0;
470	}	469	}
471		470
472	void object::clear ()
473	{
474	attachable_base::clear ();
475
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	/*	471	/*
515	* copy_to first frees everything allocated by the dst object,	472	* copy_to first frees everything allocated by the dst object,
516	* and then copies the contents of itself into the second	473	* and then copies the contents of itself into the second
517	* object, allocating what needs to be allocated. Basically, any	474	* object, allocating what needs to be allocated. Basically, any
518	* data that is malloc'd needs to be re-malloc/copied. Otherwise,	475	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
…		…
524	{	481	{
525	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
526	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
527		484
528	*(object_copy *)dst = *this;	485	*(object_copy *)dst = *this;
529	*(object_pod *)dst = *this;
530
531	if (self || cb)
532	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst));
533		486
534	if (is_freed)	487	if (is_freed)
535	SET_FLAG (dst, FLAG_FREED);	488	SET_FLAG (dst, FLAG_FREED);
536		489
537	if (is_removed)	490	if (is_removed)
538	SET_FLAG (dst, FLAG_REMOVED);	491	SET_FLAG (dst, FLAG_REMOVED);
539		492
540	if (speed < 0)	493	if (speed < 0)
541	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;	494	dst->speed_left = speed_left - rndm ();
542		495
543	/* Copy over key_values, if any. */	496	/* Copy over key_values, if any. */
544	if (key_values)	497	if (key_values)
545	{	498	{
546	key_value *tail = 0;	499	key_value *tail = 0;
…		…
568	tail = new_link;	521	tail = new_link;
569	}	522	}
570	}	523	}
571	}	524	}
572		525
573	update_ob_speed (dst);	526	dst->set_speed (dst->speed);
574	}	527	}
575		528
576	object *	529	object *
577	object::clone ()	530	object::clone ()
578	{	531	{
…		…
584	/*	537	/*
585	* If an object with the IS_TURNABLE() flag needs to be turned due	538	* 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	539	* 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.	540	* be called to update the face variable, _and_ how it looks on the map.
588	*/	541	*/
589
590	void	542	void
591	update_turn_face (object *op)	543	update_turn_face (object *op)
592	{	544	{
593	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	545	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
594	return;	546	return;
		547
595	SET_ANIMATION (op, op->direction);	548	SET_ANIMATION (op, op->direction);
596	update_object (op, UP_OBJ_FACE);	549	update_object (op, UP_OBJ_FACE);
597	}	550	}
598		551
599	/*	552	/*
600	* Updates the speed of an object. If the speed changes from 0 to another	553	* 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.	554	* 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.	555	* This function needs to be called whenever the speed of an object changes.
603	*/	556	*/
604	void	557	void
605	update_ob_speed (object *op)	558	object::set_speed (float speed)
606	{	559	{
607	extern int arch_init;	560	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	{	561	{
615	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	562	LOG (llevError, "Object %s is freed but has speed.\n", &name);
616	#ifdef MANY_CORES
617	abort ();
618	#else
619	op->speed = 0;	563	speed = 0;
620	#endif
621	}
622
623	if (arch_init)
624	return;
625
626	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
627	{	564	}
628	/* If already on active list, don't do anything */
629	if (op->active_next || op->active_prev || op == active_objects)
630	return;
631		565
632	/* process_events() expects us to insert the object at the beginning	566	this->speed = speed;
633	* of the list. */
634	op->active_next = active_objects;
635		567
636	if (op->active_next != NULL)	568	if (has_active_speed ())
637	op->active_next->active_prev = op;	569	activate ();
638
639	active_objects = op;
640	}
641	else	570	else
642	{	571	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	}	572	}
666		573
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	/*	574	/*
699	* update_object() updates the array which represents the map.	575	* update_object() updates the the map.
700	* It takes into account invisible objects (and represent squares covered	576	* It takes into account invisible objects (and represent squares covered
701	* by invisible objects by whatever is below them (unless it's another	577	* by invisible objects by whatever is below them (unless it's another
702	* invisible object, etc...)	578	* invisible object, etc...)
703	* If the object being updated is beneath a player, the look-window	579	* 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	580	* of that player is updated (this might be a suboptimal way of
705	* updating that window, though, since update_object() is called _often_)	581	* updating that window, though, since update_object() is called _often_)
706	*	582	*
707	* action is a hint of what the caller believes need to be done.	583	* 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:	584	* current action are:
713	* UP_OBJ_INSERT: op was inserted	585	* UP_OBJ_INSERT: op was inserted
714	* UP_OBJ_REMOVE: op was removed	586	* UP_OBJ_REMOVE: op was removed
715	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update	587	* 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.	588	* as that is easier than trying to look at what may have changed.
717	* UP_OBJ_FACE: only the objects face has changed.	589	* UP_OBJ_FACE: only the objects face has changed.
718	*/	590	*/
719
720	void	591	void
721	update_object (object *op, int action)	592	update_object (object *op, int action)
722	{	593	{
723	int update_now = 0, flags;
724	MoveType move_on, move_off, move_block, move_slow;	594	MoveType move_on, move_off, move_block, move_slow;
725		595
726	if (op == NULL)	596	if (op == NULL)
727	{	597	{
728	/* this should never happen */	598	/* this should never happen */
729	LOG (llevDebug, "update_object() called for NULL object.\n");	599	LOG (llevDebug, "update_object() called for NULL object.\n");
730	return;	600	return;
731	}	601	}
732		602
733	if (op->env != NULL)	603	if (op->env)
734	{	604	{
735	/* Animation is currently handled by client, so nothing	605	/* Animation is currently handled by client, so nothing
736	* to do in this case.	606	* to do in this case.
737	*/	607	*/
738	return;	608	return;
…		…
743	*/	613	*/
744	if (!op->map || op->map->in_memory == MAP_SAVING)	614	if (!op->map || op->map->in_memory == MAP_SAVING)
745	return;	615	return;
746		616
747	/* make sure the object is within map boundaries */	617	/* 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))	618	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
749	{	619	{
750	LOG (llevError, "update_object() called for object out of map!\n");	620	LOG (llevError, "update_object() called for object out of map!\n");
751	#ifdef MANY_CORES	621	#ifdef MANY_CORES
752	abort ();	622	abort ();
753	#endif	623	#endif
754	return;	624	return;
755	}	625	}
756		626
757	flags = GET_MAP_FLAGS (op->map, op->x, op->y);	627	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		628
		629	if (!(m.flags_ & P_UPTODATE))
		630	/* nop */;
764	if (action == UP_OBJ_INSERT)	631	else if (action == UP_OBJ_INSERT)
765	{	632	{
		633	// this is likely overkill, TODO: revisit (schmorp)
766	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))	634	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))	635	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
770	update_now = 1;	636	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))
771		637	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
		638	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
772	if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))	639	|| (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)	640	|| (m.move_on | op->move_on ) != m.move_on
782	update_now = 1;
783
784	if ((move_off | op->move_off) != move_off)	641	|| (m.move_off | op->move_off ) != m.move_off
785	update_now = 1;	642	|| (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	643	/* This isn't perfect, but I don't expect a lot of objects to
788	* to have move_allow right now.	644	* to have move_allow right now.
789	*/	645	*/
790	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	646	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
791	update_now = 1;	647	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
792		648	m.flags_ = 0;
793	if ((move_slow | op->move_slow) != move_slow)
794	update_now = 1;
795	}	649	}
796
797	/* if the object is being removed, we can't make intelligent	650	/* if the object is being removed, we can't make intelligent
798	* decisions, because remove_ob can't really pass the object	651	* decisions, because remove_ob can't really pass the object
799	* that is being removed.	652	* that is being removed.
800	*/	653	*/
801	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	654	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
802	update_now = 1;	655	m.flags_ = 0;
803	else if (action == UP_OBJ_FACE)	656	else if (action == UP_OBJ_FACE)
804	/* Nothing to do for that case */ ;	657	/* Nothing to do for that case */ ;
805	else	658	else
806	LOG (llevError, "update_object called with invalid action: %d\n", action);	659	LOG (llevError, "update_object called with invalid action: %d\n", action);
807		660
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)	661	if (op->more)
815	update_object (op->more, action);	662	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	}	663	}
833		664
834	object::object ()	665	object::object ()
835	{	666	{
836	SET_FLAG (this, FLAG_REMOVED);	667	SET_FLAG (this, FLAG_REMOVED);
…		…
839	face = blank_face;	670	face = blank_face;
840	}	671	}
841		672
842	object::~object ()	673	object::~object ()
843	{	674	{
		675	unlink ();
		676
844	free_key_values (this);	677	free_key_values (this);
845	}	678	}
846		679
		680	static int object_count;
		681
847	void object::link ()	682	void object::link ()
848	{	683	{
849	count = ++ob_count;	684	assert (!index);//D
850	uuid = gen_uuid ();	685	uuid = gen_uuid ();
		686	count = ++object_count;
851		687
852	prev = 0;	688	refcnt_inc ();
853	next = object::first;	689	objects.insert (this);
854
855	if (object::first)
856	object::first->prev = this;
857
858	object::first = this;
859	}	690	}
860		691
861	void object::unlink ()	692	void object::unlink ()
862	{	693	{
863	if (this == object::first)	694	if (!index)
864	object::first = next;	695	return;
865		696
866	/* Remove this object from the list of used objects */	697	objects.erase (this);
867	if (prev) prev->next = next;	698	refcnt_dec ();
868	if (next) next->prev = prev;	699	}
869		700
870	prev = 0;	701	void
871	next = 0;	702	object::activate ()
		703	{
		704	/* If already on active list, don't do anything */
		705	if (active)
		706	return;
		707
		708	if (has_active_speed ())
		709	actives.insert (this);
		710	}
		711
		712	void
		713	object::activate_recursive ()
		714	{
		715	activate ();
		716
		717	for (object *op = inv; op; op = op->below)
		718	op->activate_recursive ();
		719	}
		720
		721	/* This function removes object 'op' from the list of active
		722	* objects.
		723	* This should only be used for style maps or other such
		724	* reference maps where you don't want an object that isn't
		725	* in play chewing up cpu time getting processed.
		726	* The reverse of this is to call update_ob_speed, which
		727	* will do the right thing based on the speed of the object.
		728	*/
		729	void
		730	object::deactivate ()
		731	{
		732	/* If not on the active list, nothing needs to be done */
		733	if (!active)
		734	return;
		735
		736	actives.erase (this);
		737	}
		738
		739	void
		740	object::deactivate_recursive ()
		741	{
		742	for (object *op = inv; op; op = op->below)
		743	op->deactivate_recursive ();
		744
		745	deactivate ();
		746	}
		747
		748	void
		749	object::set_flag_inv (int flag, int value)
		750	{
		751	for (object *op = inv; op; op = op->below)
		752	{
		753	op->flag [flag] = value;
		754	op->set_flag_inv (flag, value);
		755	}
		756	}
		757
		758	/*
		759	* Remove and free all objects in the inventory of the given object.
		760	* object.c ?
		761	*/
		762	void
		763	object::destroy_inv (bool drop_to_ground)
		764	{
		765	// need to check first, because the checks below might segfault
		766	// as we might be on an invalid mapspace and crossfire code
		767	// is too buggy to ensure that the inventory is empty.
		768	// corollary: if you create arrows etc. with stuff in tis inventory,
		769	// cf will crash below with off-map x and y
		770	if (!inv)
		771	return;
		772
		773	/* Only if the space blocks everything do we not process -
		774	* if some form of movement is allowed, let objects
		775	* drop on that space.
		776	*/
		777	if (!drop_to_ground
		778	|| !map
		779	|| map->in_memory != MAP_IN_MEMORY
		780	|| map->nodrop
		781	|| ms ().move_block == MOVE_ALL)
		782	{
		783	while (inv)
		784	{
		785	inv->destroy_inv (drop_to_ground);
		786	inv->destroy ();
		787	}
		788	}
		789	else
		790	{ /* Put objects in inventory onto this space */
		791	while (inv)
		792	{
		793	object *op = inv;
		794
		795	if (op->flag [FLAG_STARTEQUIP]
		796	|| op->flag [FLAG_NO_DROP]
		797	|| op->type == RUNE
		798	|| op->type == TRAP
		799	|| op->flag [FLAG_IS_A_TEMPLATE]
		800	|| op->flag [FLAG_DESTROY_ON_DEATH])
		801	op->destroy ();
		802	else
		803	map->insert (op, x, y);
		804	}
		805	}
872	}	806	}
873		807
874	object *object::create ()	808	object *object::create ()
875	{	809	{
876	object *op = new object;	810	object *op = new object;
877	op->link ();	811	op->link ();
878	return op;	812	return op;
879	}	813	}
880		814
881	/*	815	void
882	* free_object() frees everything allocated by an object, removes	816	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	{	817	{
893	if (QUERY_FLAG (this, FLAG_FREED))	818	attachable::do_destroy ();
894	return;
895		819
896	if (QUERY_FLAG (this, FLAG_FRIENDLY))	820	if (flag [FLAG_IS_LINKED])
		821	remove_button_link (this);
		822
		823	if (flag [FLAG_FRIENDLY])
897	remove_friendly_object (this);	824	remove_friendly_object (this);
898		825
899	if (!QUERY_FLAG (this, FLAG_REMOVED))	826	if (!flag [FLAG_REMOVED])
900	remove ();	827	remove ();
901		828
902	SET_FLAG (this, FLAG_FREED);	829	destroy_inv (true);
903		830
904	if (more)	831	deactivate ();
905	{	832	unlink ();
906	more->destroy (destroy_inventory);
907	more = 0;
908	}
909		833
910	if (inv)	834	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		835
952	// hack to ensure that freed objects still have a valid map	836	// hack to ensure that freed objects still have a valid map
953	{	837	{
954	static maptile *freed_map; // freed objects are moved here to avoid crashes	838	static maptile *freed_map; // freed objects are moved here to avoid crashes
955		839
…		…
959		843
960	freed_map->name = "/internal/freed_objects_map";	844	freed_map->name = "/internal/freed_objects_map";
961	freed_map->width = 3;	845	freed_map->width = 3;
962	freed_map->height = 3;	846	freed_map->height = 3;
963		847
964	freed_map->allocate ();	848	freed_map->alloc ();
		849	freed_map->in_memory = MAP_IN_MEMORY;
965	}	850	}
966		851
967	map = freed_map;	852	map = freed_map;
968	x = 1;	853	x = 1;
969	y = 1;	854	y = 1;
970	}	855	}
971		856
		857	head = 0;
		858
		859	if (more)
		860	{
		861	more->destroy ();
		862	more = 0;
		863	}
		864
972	// clear those pointers that likely might have circular references to us	865	// clear those pointers that likely might have circular references to us
973	owner = 0;	866	owner = 0;
974	enemy = 0;	867	enemy = 0;
975	attacked_by = 0;	868	attacked_by = 0;
		869	}
976		870
977	// only relevant for players(?), but make sure of it anyways	871	void
978	contr = 0;	872	object::destroy (bool destroy_inventory)
		873	{
		874	if (destroyed ())
		875	return;
979		876
980	/* Remove object from the active list */	877	if (destroy_inventory)
981	speed = 0;	878	destroy_inv (false);
982	update_ob_speed (this);
983		879
984	unlink ();	880	attachable::destroy ();
985
986	mortals.push_back (this);
987	}	881	}
988		882
989	/*	883	/*
990	* sub_weight() recursively (outwards) subtracts a number from the	884	* sub_weight() recursively (outwards) subtracts a number from the
991	* weight of an object (and what is carried by it's environment(s)).	885	* 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	901	* 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	902	* which it is currently tied to. When this function is done, the
1009	* object will have no environment. If the object previously had an	903	* object will have no environment. If the object previously had an
1010	* environment, the x and y coordinates will be updated to	904	* environment, the x and y coordinates will be updated to
1011	* the previous environment.	905	* the previous environment.
1012	* Beware: This function is called from the editor as well!
1013	*/	906	*/
1014	void	907	void
1015	object::remove ()	908	object::remove_slow ()
1016	{	909	{
1017	object *tmp, *last = 0;	910	object *tmp, *last = 0;
1018	object *otmp;	911	object *otmp;
1019		912
1020	int check_walk_off;
1021
1022	if (QUERY_FLAG (this, FLAG_REMOVED))	913	if (QUERY_FLAG (this, FLAG_REMOVED))
1023	return;	914	return;
1024		915
1025	SET_FLAG (this, FLAG_REMOVED);	916	SET_FLAG (this, FLAG_REMOVED);
		917	INVOKE_OBJECT (REMOVE, this);
1026		918
1027	if (more)	919	if (more)
1028	more->remove ();	920	more->remove ();
1029		921
1030	/*	922	/*
…		…
1041	/* NO_FIX_PLAYER is set when a great many changes are being	933	/* NO_FIX_PLAYER is set when a great many changes are being
1042	* made to players inventory. If set, avoiding the call	934	* made to players inventory. If set, avoiding the call
1043	* to save cpu time.	935	* to save cpu time.
1044	*/	936	*/
1045	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	937	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1046	fix_player (otmp);	938	otmp->update_stats ();
1047		939
1048	if (above != NULL)	940	if (above)
1049	above->below = below;	941	above->below = below;
1050	else	942	else
1051	env->inv = below;	943	env->inv = below;
1052		944
1053	if (below != NULL)	945	if (below)
1054	below->above = above;	946	below->above = above;
1055		947
1056	/* we set up values so that it could be inserted into	948	/* we set up values so that it could be inserted into
1057	* the map, but we don't actually do that - it is up	949	* the map, but we don't actually do that - it is up
1058	* to the caller to decide what we want to do.	950	* to the caller to decide what we want to do.
…		…
1062	above = 0, below = 0;	954	above = 0, below = 0;
1063	env = 0;	955	env = 0;
1064	}	956	}
1065	else if (map)	957	else if (map)
1066	{	958	{
1067	/* Re did the following section of code - it looks like it had	959	if (type == PLAYER)
1068	* lots of logic for things we no longer care about
1069	*/	960	{
		961	--map->players;
		962	map->touch ();
		963	}
		964
		965	map->dirty = true;
		966	mapspace &ms = this->ms ();
1070		967
1071	/* link the object above us */	968	/* link the object above us */
1072	if (above)	969	if (above)
1073	above->below = below;	970	above->below = below;
1074	else	971	else
1075	SET_MAP_TOP (map, x, y, below); /* we were top, set new top */	972	ms.top = below; /* we were top, set new top */
1076		973
1077	/* Relink the object below us, if there is one */	974	/* Relink the object below us, if there is one */
1078	if (below)	975	if (below)
1079	below->above = above;	976	below->above = above;
1080	else	977	else
…		…
1082	/* Nothing below, which means we need to relink map object for this space	979	/* 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	980	* use translated coordinates in case some oddness with map tiling is
1084	* evident	981	* evident
1085	*/	982	*/
1086	if (GET_MAP_OB (map, x, y) != this)	983	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);	984	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		985
1097	SET_MAP_OB (map, x, y, above); /* goes on above it. */	986	ms.bot = above; /* goes on above it. */
1098	}	987	}
1099		988
1100	above = 0;	989	above = 0;
1101	below = 0;	990	below = 0;
1102		991
1103	if (map->in_memory == MAP_SAVING)	992	if (map->in_memory == MAP_SAVING)
1104	return;	993	return;
1105		994
1106	check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);	995	int check_walk_off = !flag [FLAG_NO_APPLY];
1107		996
1108	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	997	for (tmp = ms.bot; tmp; tmp = tmp->above)
1109	{	998	{
1110	/* No point updating the players look faces if he is the object	999	/* No point updating the players look faces if he is the object
1111	* being removed.	1000	* being removed.
1112	*/	1001	*/
1113		1002
…		…
1117	* removed (most likely destroyed), update the player view	1006	* removed (most likely destroyed), update the player view
1118	* appropriately.	1007	* appropriately.
1119	*/	1008	*/
1120	if (tmp->container == this)	1009	if (tmp->container == this)
1121	{	1010	{
1122	CLEAR_FLAG (this, FLAG_APPLIED);	1011	flag [FLAG_APPLIED] = 0;
1123	tmp->container = 0;	1012	tmp->container = 0;
1124	}	1013	}
1125		1014
		1015	if (tmp->contr->ns)
1126	tmp->contr->socket->floorbox_update ();	1016	tmp->contr->ns->floorbox_update ();
1127	}	1017	}
1128		1018
1129	/* See if player moving off should effect something */	1019	/* See if object moving off should effect something */
1130	if (check_walk_off	1020	if (check_walk_off
1131	&& ((move_type & tmp->move_off)	1021	&& ((move_type & tmp->move_off)
1132	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1022	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1133	{	1023	{
1134	move_apply (tmp, this, 0);	1024	move_apply (tmp, this, 0);
…		…
1136	if (destroyed ())	1026	if (destroyed ())
1137	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1027	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1138	}	1028	}
1139		1029
1140	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1030	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1141		1031	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1142	if (tmp->above == tmp)	1032	if (tmp->above == tmp)
1143	tmp->above = 0;	1033	tmp->above = 0;
1144		1034
1145	last = tmp;	1035	last = tmp;
1146	}	1036	}
1147		1037
1148	/* last == NULL of there are no objects on this space */	1038	/* last == NULL if there are no objects on this space */
		1039	//TODO: this makes little sense, why only update the topmost object?
1149	if (!last)	1040	if (!last)
1150	{	1041	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	1042	else
1160	update_object (last, UP_OBJ_REMOVE);	1043	update_object (last, UP_OBJ_REMOVE);
1161		1044
1162	if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)	1045	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1163	update_all_los (map, x, y);	1046	update_all_los (map, x, y);
1164	}	1047	}
1165	}	1048	}
1166		1049
1167	/*	1050	/*
…		…
1176	merge_ob (object *op, object *top)	1059	merge_ob (object *op, object *top)
1177	{	1060	{
1178	if (!op->nrof)	1061	if (!op->nrof)
1179	return 0;	1062	return 0;
1180		1063
1181	if (top == NULL)	1064	if (top)
1182	for (top = op; top != NULL && top->above != NULL; top = top->above);	1065	for (top = op; top && top->above; top = top->above)
		1066	;
1183		1067
1184	for (; top != NULL; top = top->below)	1068	for (; top; top = top->below)
1185	{	1069	{
1186	if (top == op)	1070	if (top == op)
1187	continue;	1071	continue;
1188		1072
1189	if (object::can_merge (op, top))	1073	if (object::can_merge (op, top))
…		…
1199		1083
1200	return 0;	1084	return 0;
1201	}	1085	}
1202		1086
1203	/*	1087	/*
1204	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1088	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1205	* job preparing multi-part monsters	1089	* job preparing multi-part monsters.
1206	*/	1090	*/
1207	object *	1091	object *
1208	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1092	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1209	{	1093	{
1210	object *tmp;
1211
1212	if (op->head)
1213	op = op->head;
1214
1215	for (tmp = op; tmp; tmp = tmp->more)	1094	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1216	{	1095	{
1217	tmp->x = x + tmp->arch->clone.x;	1096	tmp->x = x + tmp->arch->clone.x;
1218	tmp->y = y + tmp->arch->clone.y;	1097	tmp->y = y + tmp->arch->clone.y;
1219	}	1098	}
1220		1099
…		…
1239	* Return value:	1118	* Return value:
1240	* new object if 'op' was merged with other object	1119	* new object if 'op' was merged with other object
1241	* NULL if 'op' was destroyed	1120	* NULL if 'op' was destroyed
1242	* just 'op' otherwise	1121	* just 'op' otherwise
1243	*/	1122	*/
1244
1245	object *	1123	object *
1246	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1124	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1247	{	1125	{
1248	object *tmp, *top, *floor = NULL;	1126	object *tmp, *top, *floor = NULL;
1249	sint16 x, y;
1250		1127
1251	if (QUERY_FLAG (op, FLAG_FREED))	1128	if (QUERY_FLAG (op, FLAG_FREED))
1252	{	1129	{
1253	LOG (llevError, "Trying to insert freed object!\n");	1130	LOG (llevError, "Trying to insert freed object!\n");
1254	return NULL;	1131	return NULL;
1255	}	1132	}
1256		1133
1257	if (m == NULL)	1134	if (!QUERY_FLAG (op, FLAG_REMOVED))
		1135	LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
		1136
		1137	op->remove ();
		1138
		1139	if (!m)
1258	{	1140	{
1259	char *dump = dump_object (op);	1141	char *dump = dump_object (op);
1260	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1142	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1261	free (dump);	1143	free (dump);
1262	return op;	1144	return op;
…		…
1275	#endif	1157	#endif
1276	free (dump);	1158	free (dump);
1277	return op;	1159	return op;
1278	}	1160	}
1279		1161
1280	if (!QUERY_FLAG (op, FLAG_REMOVED))
1281	{
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;
1286	}
1287
1288	if (op->more != NULL)
1289	{
1290	/* The part may be on a different map. */
1291
1292	object *more = op->more;	1162	if (object *more = op->more)
1293		1163	{
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)	1164	if (!insert_ob_in_map (more, m, originator, flag))
1310	{	1165	{
1311	if (!op->head)	1166	if (!op->head)
1312	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1167	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1313		1168
1314	return NULL;	1169	return 0;
1315	}	1170	}
1316	}	1171	}
1317		1172
1318	CLEAR_FLAG (op, FLAG_REMOVED);	1173	CLEAR_FLAG (op, FLAG_REMOVED);
1319		1174
1320	/* Ideally, the caller figures this out. However, it complicates a lot	1175	/* 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	1176	* of areas of callers (eg, anything that uses find_free_spot would now
1322	* need extra work	1177	* need extra work
1323	*/	1178	*/
1324	op->map = get_map_from_coord (m, &op->x, &op->y);	1179	if (!xy_normalise (m, op->x, op->y))
1325	x = op->x;	1180	return 0;
1326	y = op->y;	1181
		1182	op->map = m;
		1183	mapspace &ms = op->ms ();
1327		1184
1328	/* this has to be done after we translate the coordinates.	1185	/* this has to be done after we translate the coordinates.
1329	*/	1186	*/
1330	if (op->nrof && !(flag & INS_NO_MERGE))	1187	if (op->nrof && !(flag & INS_NO_MERGE))
1331	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1188	for (tmp = ms.bot; tmp; tmp = tmp->above)
1332	if (object::can_merge (op, tmp))	1189	if (object::can_merge (op, tmp))
1333	{	1190	{
1334	op->nrof += tmp->nrof;	1191	op->nrof += tmp->nrof;
1335	tmp->destroy ();	1192	tmp->destroy ();
1336	}	1193	}
…		…
1353	op->below = originator->below;	1210	op->below = originator->below;
1354		1211
1355	if (op->below)	1212	if (op->below)
1356	op->below->above = op;	1213	op->below->above = op;
1357	else	1214	else
1358	SET_MAP_OB (op->map, op->x, op->y, op);	1215	ms.bot = op;
1359		1216
1360	/* since *below* originator, no need to update top */	1217	/* since *below* originator, no need to update top */
1361	originator->below = op;	1218	originator->below = op;
1362	}	1219	}
1363	else	1220	else
1364	{	1221	{
		1222	top = ms.bot;
		1223
1365	/* If there are other objects, then */	1224	/* If there are other objects, then */
1366	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1225	if ((!(flag & INS_MAP_LOAD)) && top)
1367	{	1226	{
1368	object *last = NULL;	1227	object *last = 0;
1369		1228
1370	/*	1229	/*
1371	* If there are multiple objects on this space, we do some trickier handling.	1230	* If there are multiple objects on this space, we do some trickier handling.
1372	* We've already dealt with merging if appropriate.	1231	* We've already dealt with merging if appropriate.
1373	* Generally, we want to put the new object on top. But if	1232	* 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	1236	* 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	1237	* 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	1238	* when lots of spells are cast in one area. Currently, it is presumed
1380	* that flying non pickable objects are spell objects.	1239	* that flying non pickable objects are spell objects.
1381	*/	1240	*/
1382		1241	for (top = ms.bot; top; top = top->above)
1383	while (top != NULL)
1384	{	1242	{
1385	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1243	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1386	floor = top;	1244	floor = top;
1387		1245
1388	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1246	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;	1249	top = top->below;
1392	break;	1250	break;
1393	}	1251	}
1394		1252
1395	last = top;	1253	last = top;
1396	top = top->above;
1397	}	1254	}
1398		1255
1399	/* Don't want top to be NULL, so set it to the last valid object */	1256	/* Don't want top to be NULL, so set it to the last valid object */
1400	top = last;	1257	top = last;
1401		1258
…		…
1408	* Unless those objects are exits, type 66	1265	* Unless those objects are exits, type 66
1409	* If INS_ON_TOP is used, don't do this processing	1266	* If INS_ON_TOP is used, don't do this processing
1410	* Need to find the object that in fact blocks view, otherwise	1267	* Need to find the object that in fact blocks view, otherwise
1411	* stacking is a bit odd.	1268	* stacking is a bit odd.
1412	*/	1269	*/
1413	if (!(flag & INS_ON_TOP) &&	1270	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))	1271	&& ms.flags () & P_BLOCKSVIEW
		1272	&& (op->face && !op->face->visibility))
1415	{	1273	{
1416	for (last = top; last != floor; last = last->below)	1274	for (last = top; last != floor; last = last->below)
1417	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1275	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1418	break;	1276	break;
		1277
1419	/* Check to see if we found the object that blocks view,	1278	/* Check to see if we found the object that blocks view,
1420	* and make sure we have a below pointer for it so that	1279	* and make sure we have a below pointer for it so that
1421	* we can get inserted below this one, which requires we	1280	* we can get inserted below this one, which requires we
1422	* set top to the object below us.	1281	* set top to the object below us.
1423	*/	1282	*/
…		…
1425	top = last->below;	1284	top = last->below;
1426	}	1285	}
1427	} /* If objects on this space */	1286	} /* If objects on this space */
1428		1287
1429	if (flag & INS_MAP_LOAD)	1288	if (flag & INS_MAP_LOAD)
1430	top = GET_MAP_TOP (op->map, op->x, op->y);	1289	top = ms.top;
1431		1290
1432	if (flag & INS_ABOVE_FLOOR_ONLY)	1291	if (flag & INS_ABOVE_FLOOR_ONLY)
1433	top = floor;	1292	top = floor;
1434		1293
1435	/* Top is the object that our object (op) is going to get inserted above.	1294	/* Top is the object that our object (op) is going to get inserted above.
1436	*/	1295	*/
1437		1296
1438	/* First object on this space */	1297	/* First object on this space */
1439	if (!top)	1298	if (!top)
1440	{	1299	{
1441	op->above = GET_MAP_OB (op->map, op->x, op->y);	1300	op->above = ms.bot;
1442		1301
1443	if (op->above)	1302	if (op->above)
1444	op->above->below = op;	1303	op->above->below = op;
1445		1304
1446	op->below = NULL;	1305	op->below = 0;
1447	SET_MAP_OB (op->map, op->x, op->y, op);	1306	ms.bot = op;
1448	}	1307	}
1449	else	1308	else
1450	{ /* get inserted into the stack above top */	1309	{ /* get inserted into the stack above top */
1451	op->above = top->above;	1310	op->above = top->above;
1452		1311
…		…
1455		1314
1456	op->below = top;	1315	op->below = top;
1457	top->above = op;	1316	top->above = op;
1458	}	1317	}
1459		1318
1460	if (op->above == NULL)	1319	if (!op->above)
1461	SET_MAP_TOP (op->map, op->x, op->y, op);	1320	ms.top = op;
1462	} /* else not INS_BELOW_ORIGINATOR */	1321	} /* else not INS_BELOW_ORIGINATOR */
1463		1322
1464	if (op->type == PLAYER)	1323	if (op->type == PLAYER)
		1324	{
1465	op->contr->do_los = 1;	1325	op->contr->do_los = 1;
		1326	++op->map->players;
		1327	op->map->touch ();
		1328	}
		1329
		1330	op->map->dirty = true;
1466		1331
1467	/* If we have a floor, we know the player, if any, will be above	1332	/* 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.	1333	* it, so save a few ticks and start from there.
1469	*/	1334	*/
1470	if (!(flag & INS_MAP_LOAD))	1335	if (!(flag & INS_MAP_LOAD))
1471	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1336	if (object *pl = ms.player ())
1472	if (tmp->type == PLAYER)	1337	if (pl->contr->ns)
1473	tmp->contr->socket->floorbox_update ();	1338	pl->contr->ns->floorbox_update ();
1474		1339
1475	/* If this object glows, it may affect lighting conditions that are	1340	/* If this object glows, it may affect lighting conditions that are
1476	* visible to others on this map. But update_all_los is really	1341	* 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	1342	* 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	1343	* on the map will get recalculated. The players could very well
1479	* be far away from this change and not affected in any way -	1344	* be far away from this change and not affected in any way -
1480	* this should get redone to only look for players within range,	1345	* this should get redone to only look for players within range,
1481	* or just updating the P_NEED_UPDATE for spaces within this area	1346	* or just updating the P_UPTODATE for spaces within this area
1482	* of effect may be sufficient.	1347	* of effect may be sufficient.
1483	*/	1348	*/
1484	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1349	if (op->map->darkness && (op->glow_radius != 0))
1485	update_all_los (op->map, op->x, op->y);	1350	update_all_los (op->map, op->x, op->y);
1486		1351
1487	/* updates flags (blocked, alive, no magic, etc) for this map space */	1352	/* updates flags (blocked, alive, no magic, etc) for this map space */
1488	update_object (op, UP_OBJ_INSERT);	1353	update_object (op, UP_OBJ_INSERT);
		1354
		1355	INVOKE_OBJECT (INSERT, op);
1489		1356
1490	/* Don't know if moving this to the end will break anything. However,	1357	/* Don't know if moving this to the end will break anything. However,
1491	* we want to have floorbox_update called before calling this.	1358	* we want to have floorbox_update called before calling this.
1492	*	1359	*
1493	* check_move_on() must be after this because code called from	1360	* check_move_on() must be after this because code called from
…		…
1498		1365
1499	/* if this is not the head or flag has been passed, don't check walk on status */	1366	/* 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)	1367	if (!(flag & INS_NO_WALK_ON) && !op->head)
1501	{	1368	{
1502	if (check_move_on (op, originator))	1369	if (check_move_on (op, originator))
1503	return NULL;	1370	return 0;
1504		1371
1505	/* If we are a multi part object, lets work our way through the check	1372	/* If we are a multi part object, lets work our way through the check
1506	* walk on's.	1373	* walk on's.
1507	*/	1374	*/
1508	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1375	for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1509	if (check_move_on (tmp, originator))	1376	if (check_move_on (tmp, originator))
1510	return NULL;	1377	return 0;
1511	}	1378	}
1512		1379
1513	return op;	1380	return op;
1514	}	1381	}
1515		1382
1516	/* this function inserts an object in the map, but if it	1383	/* 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.	1384	* 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.	1385	* op is the object to insert it under: supplies x and the map.
1519	*/	1386	*/
1520	void	1387	void
1521	replace_insert_ob_in_map (const char *arch_string, object *op)	1388	replace_insert_ob_in_map (const char *arch_string, object *op)
1522	{	1389	{
1523	object *	1390	object *tmp, *tmp1;
1524	tmp;
1525	object *
1526	tmp1;
1527		1391
1528	/* first search for itself and remove any old instances */	1392	/* first search for itself and remove any old instances */
1529		1393
1530	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1394	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1531	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1395	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1532	tmp->destroy ();	1396	tmp->destroy ();
1533		1397
1534	tmp1 = arch_to_object (archetype::find (arch_string));	1398	tmp1 = arch_to_object (archetype::find (arch_string));
1535		1399
1536	tmp1->x = op->x;	1400	tmp1->x = op->x;
1537	tmp1->y = op->y;	1401	tmp1->y = op->y;
1538	insert_ob_in_map (tmp1, op->map, op, 0);	1402	insert_ob_in_map (tmp1, op->map, op, 0);
		1403	}
		1404
		1405	object *
		1406	object::insert_at (object *where, object *originator, int flags)
		1407	{
		1408	where->map->insert (this, where->x, where->y, originator, flags);
1539	}	1409	}
1540		1410
1541	/*	1411	/*
1542	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1412	* 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	1413	* is returned contains nr objects, and the remaining parts contains
1544	* the rest (or is removed and freed if that number is 0).	1414	* the rest (or is removed and freed if that number is 0).
1545	* On failure, NULL is returned, and the reason put into the	1415	* On failure, NULL is returned, and the reason put into the
1546	* global static errmsg array.	1416	* global static errmsg array.
1547	*/	1417	*/
1548
1549	object *	1418	object *
1550	get_split_ob (object *orig_ob, uint32 nr)	1419	get_split_ob (object *orig_ob, uint32 nr)
1551	{	1420	{
1552	object *newob;	1421	object *newob;
1553	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1422	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1589		1458
1590	object *	1459	object *
1591	decrease_ob_nr (object *op, uint32 i)	1460	decrease_ob_nr (object *op, uint32 i)
1592	{	1461	{
1593	object *tmp;	1462	object *tmp;
1594	player *pl;
1595		1463
1596	if (i == 0) /* objects with op->nrof require this check */	1464	if (i == 0) /* objects with op->nrof require this check */
1597	return op;	1465	return op;
1598		1466
1599	if (i > op->nrof)	1467	if (i > op->nrof)
…		…
1612	* IMO, searching through all the players will mostly	1480	* IMO, searching through all the players will mostly
1613	* likely be quicker than following op->env to the map,	1481	* likely be quicker than following op->env to the map,
1614	* and then searching the map for a player.	1482	* and then searching the map for a player.
1615	*/	1483	*/
1616	if (!tmp)	1484	if (!tmp)
1617	{	1485	for_all_players (pl)
1618	for (pl = first_player; pl; pl = pl->next)
1619	if (pl->ob->container == op->env)	1486	if (pl->ob->container == op->env)
1620	{	1487	{
1621	tmp = pl->ob;	1488	tmp = pl->ob;
1622	break;	1489	break;
1623	}	1490	}
1624	}
1625		1491
1626	if (i < op->nrof)	1492	if (i < op->nrof)
1627	{	1493	{
1628	sub_weight (op->env, op->weight * i);	1494	sub_weight (op->env, op->weight * i);
1629	op->nrof -= i;	1495	op->nrof -= i;
…		…
1765	add_weight (this, (op->weight + op->carrying));	1631	add_weight (this, (op->weight + op->carrying));
1766		1632
1767	otmp = this->in_player ();	1633	otmp = this->in_player ();
1768	if (otmp && otmp->contr)	1634	if (otmp && otmp->contr)
1769	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1635	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1770	fix_player (otmp);	1636	otmp->update_stats ();
1771		1637
1772	op->map = 0;	1638	op->map = 0;
1773	op->env = this;	1639	op->env = this;
1774	op->above = 0;	1640	op->above = 0;
1775	op->below = 0;	1641	op->below = 0;
…		…
1779	if ((op->glow_radius != 0) && map)	1645	if ((op->glow_radius != 0) && map)
1780	{	1646	{
1781	#ifdef DEBUG_LIGHTS	1647	#ifdef DEBUG_LIGHTS
1782	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1648	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1783	#endif /* DEBUG_LIGHTS */	1649	#endif /* DEBUG_LIGHTS */
1784	if (MAP_DARKNESS (map))	1650	if (map->darkness)
1785	update_all_los (map, x, y);	1651	update_all_los (map, x, y);
1786	}	1652	}
1787		1653
1788	/* Client has no idea of ordering so lets not bother ordering it here.	1654	/* Client has no idea of ordering so lets not bother ordering it here.
1789	* It sure simplifies this function...	1655	* It sure simplifies this function...
…		…
1794	{	1660	{
1795	op->below = inv;	1661	op->below = inv;
1796	op->below->above = op;	1662	op->below->above = op;
1797	inv = op;	1663	inv = op;
1798	}	1664	}
		1665
		1666	INVOKE_OBJECT (INSERT, this);
1799		1667
1800	return op;	1668	return op;
1801	}	1669	}
1802		1670
1803	/*	1671	/*
…		…
1818	*	1686	*
1819	* MSW 2001-07-08: Check all objects on space, not just those below	1687	* 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	1688	* object being inserted. insert_ob_in_map may not put new objects
1821	* on top.	1689	* on top.
1822	*/	1690	*/
1823
1824	int	1691	int
1825	check_move_on (object *op, object *originator)	1692	check_move_on (object *op, object *originator)
1826	{	1693	{
1827	object *tmp;	1694	object *tmp;
1828	maptile *m = op->map;	1695	maptile *m = op->map;
…		…
1855		1722
1856	/* The objects have to be checked from top to bottom.	1723	/* The objects have to be checked from top to bottom.
1857	* Hence, we first go to the top:	1724	* Hence, we first go to the top:
1858	*/	1725	*/
1859		1726
1860	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1727	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1861	{	1728	{
1862	/* Trim the search when we find the first other spell effect	1729	/* Trim the search when we find the first other spell effect
1863	* this helps performance so that if a space has 50 spell objects,	1730	* this helps performance so that if a space has 50 spell objects,
1864	* we don't need to check all of them.	1731	* we don't need to check all of them.
1865	*/	1732	*/
…		…
1883	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1750	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))	1751	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1885	{	1752	{
1886		1753
1887	float	1754	float
1888	diff = tmp->move_slow_penalty * FABS (op->speed);	1755	diff = tmp->move_slow_penalty * fabs (op->speed);
1889		1756
1890	if (op->type == PLAYER)	1757	if (op->type == PLAYER)
1891	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1758	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)))	1759	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1893	diff /= 4.0;	1760	diff /= 4.0;
…		…
1920	/*	1787	/*
1921	* present_arch(arch, map, x, y) searches for any objects with	1788	* present_arch(arch, map, x, y) searches for any objects with
1922	* a matching archetype at the given map and coordinates.	1789	* a matching archetype at the given map and coordinates.
1923	* The first matching object is returned, or NULL if none.	1790	* The first matching object is returned, or NULL if none.
1924	*/	1791	*/
1925
1926	object *	1792	object *
1927	present_arch (const archetype *at, maptile *m, int x, int y)	1793	present_arch (const archetype *at, maptile *m, int x, int y)
1928	{	1794	{
1929	object *
1930	tmp;
1931
1932	if (m == NULL || out_of_map (m, x, y))	1795	if (!m || out_of_map (m, x, y))
1933	{	1796	{
1934	LOG (llevError, "Present_arch called outside map.\n");	1797	LOG (llevError, "Present_arch called outside map.\n");
1935	return NULL;	1798	return NULL;
1936	}	1799	}
1937	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1800
		1801	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1938	if (tmp->arch == at)	1802	if (tmp->arch == at)
1939	return tmp;	1803	return tmp;
		1804
1940	return NULL;	1805	return NULL;
1941	}	1806	}
1942		1807
1943	/*	1808	/*
1944	* present(type, map, x, y) searches for any objects with	1809	* present(type, map, x, y) searches for any objects with
1945	* a matching type variable at the given map and coordinates.	1810	* a matching type variable at the given map and coordinates.
1946	* The first matching object is returned, or NULL if none.	1811	* The first matching object is returned, or NULL if none.
1947	*/	1812	*/
1948
1949	object *	1813	object *
1950	present (unsigned char type, maptile *m, int x, int y)	1814	present (unsigned char type, maptile *m, int x, int y)
1951	{	1815	{
1952	object *
1953	tmp;
1954
1955	if (out_of_map (m, x, y))	1816	if (out_of_map (m, x, y))
1956	{	1817	{
1957	LOG (llevError, "Present called outside map.\n");	1818	LOG (llevError, "Present called outside map.\n");
1958	return NULL;	1819	return NULL;
1959	}	1820	}
1960	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1821
		1822	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1961	if (tmp->type == type)	1823	if (tmp->type == type)
1962	return tmp;	1824	return tmp;
		1825
1963	return NULL;	1826	return NULL;
1964	}	1827	}
1965		1828
1966	/*	1829	/*
1967	* present_in_ob(type, object) searches for any objects with	1830	* present_in_ob(type, object) searches for any objects with
1968	* a matching type variable in the inventory of the given object.	1831	* a matching type variable in the inventory of the given object.
1969	* The first matching object is returned, or NULL if none.	1832	* The first matching object is returned, or NULL if none.
1970	*/	1833	*/
1971
1972	object *	1834	object *
1973	present_in_ob (unsigned char type, const object *op)	1835	present_in_ob (unsigned char type, const object *op)
1974	{	1836	{
1975	object *
1976	tmp;
1977
1978	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1837	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1979	if (tmp->type == type)	1838	if (tmp->type == type)
1980	return tmp;	1839	return tmp;
		1840
1981	return NULL;	1841	return NULL;
1982	}	1842	}
1983		1843
1984	/*	1844	/*
1985	* present_in_ob (type, str, object) searches for any objects with	1845	* present_in_ob (type, str, object) searches for any objects with
…		…
1993	* str is the string to match against. Note that we match against	1853	* 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	1854	* 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	1855	* spell code can use one object type (force), but change it's name
1996	* to be unique.	1856	* to be unique.
1997	*/	1857	*/
1998
1999	object *	1858	object *
2000	present_in_ob_by_name (int type, const char *str, const object *op)	1859	present_in_ob_by_name (int type, const char *str, const object *op)
2001	{	1860	{
2002	object *
2003	tmp;
2004
2005	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1861	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2006	{
2007	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1862	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2008	return tmp;	1863	return tmp;
2009	}	1864
2010	return NULL;	1865	return 0;
2011	}	1866	}
2012		1867
2013	/*	1868	/*
2014	* present_arch_in_ob(archetype, object) searches for any objects with	1869	* present_arch_in_ob(archetype, object) searches for any objects with
2015	* a matching archetype in the inventory of the given object.	1870	* a matching archetype in the inventory of the given object.
2016	* The first matching object is returned, or NULL if none.	1871	* The first matching object is returned, or NULL if none.
2017	*/	1872	*/
2018
2019	object *	1873	object *
2020	present_arch_in_ob (const archetype *at, const object *op)	1874	present_arch_in_ob (const archetype *at, const object *op)
2021	{	1875	{
2022	object *
2023	tmp;
2024
2025	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1876	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2026	if (tmp->arch == at)	1877	if (tmp->arch == at)
2027	return tmp;	1878	return tmp;
		1879
2028	return NULL;	1880	return NULL;
2029	}	1881	}
2030		1882
2031	/*	1883	/*
2032	* activate recursively a flag on an object inventory	1884	* activate recursively a flag on an object inventory
2033	*/	1885	*/
2034	void	1886	void
2035	flag_inv (object *op, int flag)	1887	flag_inv (object *op, int flag)
2036	{	1888	{
2037	object *
2038	tmp;
2039
2040	if (op->inv)	1889	if (op->inv)
2041	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1890	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2042	{	1891	{
2043	SET_FLAG (tmp, flag);	1892	SET_FLAG (tmp, flag);
2044	flag_inv (tmp, flag);	1893	flag_inv (tmp, flag);
2045	}	1894	}
2046	} /*	1895	}
		1896
		1897	/*
2047	* desactivate recursively a flag on an object inventory	1898	* deactivate recursively a flag on an object inventory
2048	*/	1899	*/
2049	void	1900	void
2050	unflag_inv (object *op, int flag)	1901	unflag_inv (object *op, int flag)
2051	{	1902	{
2052	object *
2053	tmp;
2054
2055	if (op->inv)	1903	if (op->inv)
2056	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1904	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2057	{	1905	{
2058	CLEAR_FLAG (tmp, flag);	1906	CLEAR_FLAG (tmp, flag);
2059	unflag_inv (tmp, flag);	1907	unflag_inv (tmp, flag);
2060	}	1908	}
2061	}	1909	}
…		…
2064	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in	1912	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2065	* all it's inventory (recursively).	1913	* all it's inventory (recursively).
2066	* If checksums are used, a player will get set_cheat called for	1914	* 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.	1915	* him/her-self and all object carried by a call to this function.
2068	*/	1916	*/
2069
2070	void	1917	void
2071	set_cheat (object *op)	1918	set_cheat (object *op)
2072	{	1919	{
2073	SET_FLAG (op, FLAG_WAS_WIZ);	1920	SET_FLAG (op, FLAG_WAS_WIZ);
2074	flag_inv (op, FLAG_WAS_WIZ);	1921	flag_inv (op, FLAG_WAS_WIZ);
…		…
2093	* because arch_blocked (now ob_blocked) needs to know the movement type	1940	* 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	1941	* 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	1942	* the archetype because that isn't correct if the monster has been
2096	* customized, changed states, etc.	1943	* customized, changed states, etc.
2097	*/	1944	*/
2098
2099	int	1945	int
2100	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1946	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2101	{	1947	{
2102	int
2103	i,
2104	index = 0, flag;	1948	int index = 0, flag;
2105	static int
2106	altern[SIZEOFFREE];	1949	int altern[SIZEOFFREE];
2107		1950
2108	for (i = start; i < stop; i++)	1951	for (int i = start; i < stop; i++)
2109	{	1952	{
2110	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1953	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2111	if (!flag)	1954	if (!flag)
2112	altern[index++] = i;	1955	altern [index++] = i;
2113		1956
2114	/* Basically, if we find a wall on a space, we cut down the search size.	1957	/* 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.	1958	* 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 -	1959	* 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	1960	* if the space being examined only has a wall to the north and empty
…		…
2124	}	1967	}
2125		1968
2126	if (!index)	1969	if (!index)
2127	return -1;	1970	return -1;
2128		1971
2129	return altern[RANDOM () % index];	1972	return altern [rndm (index)];
2130	}	1973	}
2131		1974
2132	/*	1975	/*
2133	* find_first_free_spot(archetype, maptile, x, y) works like	1976	* find_first_free_spot(archetype, maptile, x, y) works like
2134	* find_free_spot(), but it will search max number of squares.	1977	* find_free_spot(), but it will search max number of squares.
2135	* But it will return the first available spot, not a random choice.	1978	* 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.	1979	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2137	*/	1980	*/
2138
2139	int	1981	int
2140	find_first_free_spot (const object *ob, maptile *m, int x, int y)	1982	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2141	{	1983	{
2142	int
2143	i;
2144
2145	for (i = 0; i < SIZEOFFREE; i++)	1984	for (int i = 0; i < SIZEOFFREE; i++)
2146	{
2147	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	1985	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2148	return i;	1986	return i;
2149	}	1987
2150	return -1;	1988	return -1;
2151	}	1989	}
2152		1990
2153	/*	1991	/*
2154	* The function permute(arr, begin, end) randomly reorders the array	1992	* The function permute(arr, begin, end) randomly reorders the array
2155	* arr[begin..end-1].	1993	* arr[begin..end-1].
		1994	* now uses a fisher-yates shuffle, old permute was broken
2156	*/	1995	*/
2157	static void	1996	static void
2158	permute (int *arr, int begin, int end)	1997	permute (int *arr, int begin, int end)
2159	{	1998	{
2160	int	1999	arr += begin;
2161	i,
2162	j,
2163	tmp,
2164	len;
2165
2166	len = end - begin;	2000	end -= begin;
2167	for (i = begin; i < end; i++)
2168	{
2169	j = begin + RANDOM () % len;
2170		2001
2171	tmp = arr[i];	2002	while (--end)
2172	arr[i] = arr[j];	2003	swap (arr [end], arr [rndm (end + 1)]);
2173	arr[j] = tmp;
2174	}
2175	}	2004	}
2176		2005
2177	/* new function to make monster searching more efficient, and effective!	2006	/* new function to make monster searching more efficient, and effective!
2178	* This basically returns a randomized array (in the passed pointer) of	2007	* 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	2008	* 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.	2011	* the 3x3 area will be searched, just not in a predictable order.
2183	*/	2012	*/
2184	void	2013	void
2185	get_search_arr (int *search_arr)	2014	get_search_arr (int *search_arr)
2186	{	2015	{
2187	int	2016	int i;
2188	i;
2189		2017
2190	for (i = 0; i < SIZEOFFREE; i++)	2018	for (i = 0; i < SIZEOFFREE; i++)
2191	{
2192	search_arr[i] = i;	2019	search_arr[i] = i;
2193	}
2194		2020
2195	permute (search_arr, 1, SIZEOFFREE1 + 1);	2021	permute (search_arr, 1, SIZEOFFREE1 + 1);
2196	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2022	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2197	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2023	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2198	}	2024	}
…		…
2207	* Perhaps incorrectly, but I'm making the assumption that exclude	2033	* 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	2034	* 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	2035	* because we have to know what movement the thing looking to move
2210	* there is capable of.	2036	* there is capable of.
2211	*/	2037	*/
2212
2213	int	2038	int
2214	find_dir (maptile *m, int x, int y, object *exclude)	2039	find_dir (maptile *m, int x, int y, object *exclude)
2215	{	2040	{
2216	int
2217	i,
2218	max = SIZEOFFREE, mflags;	2041	int i, max = SIZEOFFREE, mflags;
2219		2042
2220	sint16 nx, ny;	2043	sint16 nx, ny;
2221	object *	2044	object *tmp;
2222	tmp;
2223	maptile *	2045	maptile *mp;
2224	mp;
2225		2046
2226	MoveType blocked, move_type;	2047	MoveType blocked, move_type;
2227		2048
2228	if (exclude && exclude->head)	2049	if (exclude && exclude->head)
2229	{	2050	{
…		…
2241	mp = m;	2062	mp = m;
2242	nx = x + freearr_x[i];	2063	nx = x + freearr_x[i];
2243	ny = y + freearr_y[i];	2064	ny = y + freearr_y[i];
2244		2065
2245	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2066	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
		2067
2246	if (mflags & P_OUT_OF_MAP)	2068	if (mflags & P_OUT_OF_MAP)
2247	{
2248	max = maxfree[i];	2069	max = maxfree[i];
2249	}
2250	else	2070	else
2251	{	2071	{
2252	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2072	mapspace &ms = mp->at (nx, ny);
		2073
		2074	blocked = ms.move_block;
2253		2075
2254	if ((move_type & blocked) == move_type)	2076	if ((move_type & blocked) == move_type)
2255	{
2256	max = maxfree[i];	2077	max = maxfree[i];
2257	}
2258	else if (mflags & P_IS_ALIVE)	2078	else if (mflags & P_IS_ALIVE)
2259	{	2079	{
2260	for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)	2080	for (tmp = ms.bot; tmp; tmp = tmp->above)
2261	{	2081	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)))	2082	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))
2263	{
2264	break;	2083	break;
2265	}	2084
2266	}
2267	if (tmp)	2085	if (tmp)
2268	{
2269	return freedir[i];	2086	return freedir[i];
2270	}
2271	}	2087	}
2272	}	2088	}
2273	}	2089	}
		2090
2274	return 0;	2091	return 0;
2275	}	2092	}
2276		2093
2277	/*	2094	/*
2278	* distance(object 1, object 2) will return the square of the	2095	* distance(object 1, object 2) will return the square of the
2279	* distance between the two given objects.	2096	* distance between the two given objects.
2280	*/	2097	*/
2281
2282	int	2098	int
2283	distance (const object *ob1, const object *ob2)	2099	distance (const object *ob1, const object *ob2)
2284	{	2100	{
2285	int
2286	i;
2287
2288	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2101	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2289	return i;
2290	}	2102	}
2291		2103
2292	/*	2104	/*
2293	* find_dir_2(delta-x,delta-y) will return a direction in which	2105	* 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	2106	* an object which has subtracted the x and y coordinates of another
2295	* object, needs to travel toward it.	2107	* object, needs to travel toward it.
2296	*/	2108	*/
2297
2298	int	2109	int
2299	find_dir_2 (int x, int y)	2110	find_dir_2 (int x, int y)
2300	{	2111	{
2301	int	2112	int q;
2302	q;
2303		2113
2304	if (y)	2114	if (y)
2305	q = x * 100 / y;	2115	q = x * 100 / y;
2306	else if (x)	2116	else if (x)
2307	q = -300 * x;	2117	q = -300 * x;
…		…
2332		2142
2333	return 3;	2143	return 3;
2334	}	2144	}
2335		2145
2336	/*	2146	/*
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	2147	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2354	* between two directions (which are expected to be absolute (see absdir())	2148	* between two directions (which are expected to be absolute (see absdir())
2355	*/	2149	*/
2356
2357	int	2150	int
2358	dirdiff (int dir1, int dir2)	2151	dirdiff (int dir1, int dir2)
2359	{	2152	{
2360	int	2153	int d;
2361	d;
2362		2154
2363	d = abs (dir1 - dir2);	2155	d = abs (dir1 - dir2);
2364	if (d > 4)	2156	if (d > 4)
2365	d = 8 - d;	2157	d = 8 - d;
		2158
2366	return d;	2159	return d;
2367	}	2160	}
2368		2161
2369	/* peterm:	2162	/* peterm:
2370	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2163	* 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	2166	* 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.	2167	* 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	2168	* Moved from spell_util.c to object.c with the other related direction
2376	* functions.	2169	* functions.
2377	*/	2170	*/
2378
2379	int
2380	reduction_dir[SIZEOFFREE][3] = {	2171	int reduction_dir[SIZEOFFREE][3] = {
2381	{0, 0, 0}, /* 0 */	2172	{0, 0, 0}, /* 0 */
2382	{0, 0, 0}, /* 1 */	2173	{0, 0, 0}, /* 1 */
2383	{0, 0, 0}, /* 2 */	2174	{0, 0, 0}, /* 2 */
2384	{0, 0, 0}, /* 3 */	2175	{0, 0, 0}, /* 3 */
2385	{0, 0, 0}, /* 4 */	2176	{0, 0, 0}, /* 4 */
…		…
2433	* find a path to that monster that we found. If not,	2224	* find a path to that monster that we found. If not,
2434	* we don't bother going toward it. Returns 1 if we	2225	* we don't bother going toward it. Returns 1 if we
2435	* can see a direct way to get it	2226	* can see a direct way to get it
2436	* Modified to be map tile aware -.MSW	2227	* Modified to be map tile aware -.MSW
2437	*/	2228	*/
2438
2439
2440	int	2229	int
2441	can_see_monsterP (maptile *m, int x, int y, int dir)	2230	can_see_monsterP (maptile *m, int x, int y, int dir)
2442	{	2231	{
2443	sint16 dx, dy;	2232	sint16 dx, dy;
2444	int
2445	mflags;	2233	int mflags;
2446		2234
2447	if (dir < 0)	2235	if (dir < 0)
2448	return 0; /* exit condition: invalid direction */	2236	return 0; /* exit condition: invalid direction */
2449		2237
2450	dx = x + freearr_x[dir];	2238	dx = x + freearr_x[dir];
…		…
2463	return 0;	2251	return 0;
2464		2252
2465	/* yes, can see. */	2253	/* yes, can see. */
2466	if (dir < 9)	2254	if (dir < 9)
2467	return 1;	2255	return 1;
		2256
2468	return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |	2257	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]);	2258	| can_see_monsterP (m, x, y, reduction_dir[dir][1])
		2259	| can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2470	}	2260	}
2471
2472
2473		2261
2474	/*	2262	/*
2475	* can_pick(picker, item): finds out if an object is possible to be	2263	* 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	2264	* picked up by the picker. Returnes 1 if it can be
2477	* picked up, otherwise 0.	2265	* picked up, otherwise 0.
…		…
2488	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2276	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2489	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2277	(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));	2278	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2491	}	2279	}
2492		2280
2493
2494	/*	2281	/*
2495	* create clone from object to another	2282	* create clone from object to another
2496	*/	2283	*/
2497	object *	2284	object *
2498	object_create_clone (object *asrc)	2285	object_create_clone (object *asrc)
…		…
2517	{	2304	{
2518	dst = tmp;	2305	dst = tmp;
2519	tmp->head = 0;	2306	tmp->head = 0;
2520	}	2307	}
2521	else	2308	else
2522	{
2523	tmp->head = dst;	2309	tmp->head = dst;
2524	}
2525		2310
2526	tmp->more = 0;	2311	tmp->more = 0;
2527		2312
2528	if (prev)	2313	if (prev)
2529	prev->more = tmp;	2314	prev->more = tmp;
…		…
2541	/* Basically, we save the content of the string to a temp file, then call */	2326	/* 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, */	2327	/* 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. */	2328	/* 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. */	2329	/* Remember not to use load_object_str in a time-critical situation. */
2545	/* Also remember that multiparts objects are not supported for now. */	2330	/* Also remember that multiparts objects are not supported for now. */
2546
2547	object *	2331	object *
2548	load_object_str (const char *obstr)	2332	load_object_str (const char *obstr)
2549	{	2333	{
2550	object *op;	2334	object *op;
2551	char filename[MAX_BUF];	2335	char filename[MAX_BUF];
…		…
2581	* returns NULL if no match.	2365	* returns NULL if no match.
2582	*/	2366	*/
2583	object *	2367	object *
2584	find_obj_by_type_subtype (const object *who, int type, int subtype)	2368	find_obj_by_type_subtype (const object *who, int type, int subtype)
2585	{	2369	{
2586	object *tmp;
2587
2588	for (tmp = who->inv; tmp; tmp = tmp->below)	2370	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2589	if (tmp->type == type && tmp->subtype == subtype)	2371	if (tmp->type == type && tmp->subtype == subtype)
2590	return tmp;	2372	return tmp;
2591		2373
2592	return NULL;	2374	return 0;
2593	}	2375	}
2594		2376
2595	/* If ob has a field named key, return the link from the list,	2377	/* If ob has a field named key, return the link from the list,
2596	* otherwise return NULL.	2378	* otherwise return NULL.
2597	*	2379	*
…		…
2599	* do the desired thing.	2381	* do the desired thing.
2600	*/	2382	*/
2601	key_value *	2383	key_value *
2602	get_ob_key_link (const object *ob, const char *key)	2384	get_ob_key_link (const object *ob, const char *key)
2603	{	2385	{
2604	key_value *link;
2605
2606	for (link = ob->key_values; link != NULL; link = link->next)	2386	for (key_value *link = ob->key_values; link; link = link->next)
2607	if (link->key == key)	2387	if (link->key == key)
2608	return link;	2388	return link;
2609		2389
2610	return NULL;	2390	return 0;
2611	}	2391	}
2612		2392
2613	/*	2393	/*
2614	* Returns the value of op has an extra_field for key, or NULL.	2394	* Returns the value of op has an extra_field for key, or NULL.
2615	*	2395	*
…		…
2655	* Returns TRUE on success.	2435	* Returns TRUE on success.
2656	*/	2436	*/
2657	int	2437	int
2658	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2438	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2659	{	2439	{
2660	key_value *
2661	field = NULL, *last = NULL;	2440	key_value *field = NULL, *last = NULL;
2662		2441
2663	for (field = op->key_values; field != NULL; field = field->next)	2442	for (field = op->key_values; field != NULL; field = field->next)
2664	{	2443	{
2665	if (field->key != canonical_key)	2444	if (field->key != canonical_key)
2666	{	2445	{
…		…
2694	/* IF we get here, key doesn't exist */	2473	/* IF we get here, key doesn't exist */
2695		2474
2696	/* No field, we'll have to add it. */	2475	/* No field, we'll have to add it. */
2697		2476
2698	if (!add_key)	2477	if (!add_key)
2699	{
2700	return FALSE;	2478	return FALSE;
2701	}	2479
2702	/* There isn't any good reason to store a null	2480	/* There isn't any good reason to store a null
2703	* value in the key/value list. If the archetype has	2481	* value in the key/value list. If the archetype has
2704	* this key, then we should also have it, so shouldn't	2482	* this key, then we should also have it, so shouldn't
2705	* be here. If user wants to store empty strings,	2483	* be here. If user wants to store empty strings,
2706	* should pass in ""	2484	* should pass in ""
…		…
2755	}	2533	}
2756	else	2534	else
2757	item = item->env;	2535	item = item->env;
2758	}	2536	}
2759		2537
		2538
		2539	const char *
		2540	object::flag_desc (char *desc, int len) const
		2541	{
		2542	char *p = desc;
		2543	bool first = true;
		2544
		2545	*p = 0;
		2546
		2547	for (int i = 0; i < NUM_FLAGS; i++)
		2548	{
		2549	if (len <= 10) // magic constant!
		2550	{
		2551	snprintf (p, len, ",...");
		2552	break;
		2553	}
		2554
		2555	if (flag [i])
		2556	{
		2557	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2558	len -= cnt;
		2559	p += cnt;
		2560	first = false;
		2561	}
		2562	}
		2563
		2564	return desc;
		2565	}
		2566
2760	// return a suitable string describing an objetc in enough detail to find it	2567	// return a suitable string describing an object in enough detail to find it
2761	const char *	2568	const char *
2762	object::debug_desc (char *info) const	2569	object::debug_desc (char *info) const
2763	{	2570	{
		2571	char flagdesc[512];
2764	char info2[256 * 3];	2572	char info2[256 * 4];
2765	char *p = info;	2573	char *p = info;
2766		2574
2767	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2575	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2768	count,	2576	count, uuid.seq,
2769	&name,	2577	&name,
2770	title ? " " : "",	2578	title ? "\",title:\"" : "",
2771	title ? (const char *)title : "");	2579	title ? (const char *)title : "",
		2580	flag_desc (flagdesc, 512), type);
2772		2581
2773	if (env)	2582	if (env)
2774	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2583	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2775		2584
2776	if (map)	2585	if (map)
2777	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2586	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2778		2587
2779	return info;	2588	return info;
2780	}	2589	}
2781		2590
2782	const char *	2591	const char *
2783	object::debug_desc () const	2592	object::debug_desc () const
2784	{	2593	{
2785	static char info[256 * 3];	2594	static char info[256 * 4];
2786	return debug_desc (info);	2595	return debug_desc (info);
2787	}	2596	}
2788		2597
		2598	const char *
		2599	object::debug_desc2 () const
		2600	{
		2601	static char info[256 * 4];
		2602	return debug_desc (info);
		2603	}
		2604

Diff Legend

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