[ViewVC] Diff of: cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.100 by root, Mon Jan 1 12:28:45 2007 UTC vs.
Revision 1.140 by root, Tue Apr 24 12:32:14 2007 UTC

…		…
1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* CrossFire, A Multiplayer game
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,
…		…
355	/*	357	/*
356	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	358	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
357	* Some error messages.	359	* Some error messages.
358	* The result of the dump is stored in the static global errmsg array.	360	* The result of the dump is stored in the static global errmsg array.
359	*/	361	*/
360
361	char *	362	char *
362	dump_object (object *op)	363	dump_object (object *op)
363	{	364	{
364	if (!op)	365	if (!op)
365	return strdup ("[NULLOBJ]");	366	return strdup ("[NULLOBJ]");
366		367
367	object_freezer freezer;	368	object_freezer freezer;
368	save_object (freezer, op, 1);	369	op->write (freezer);
369	return freezer.as_string ();	370	return freezer.as_string ();
370	}	371	}
371		372
372	/*	373	/*
373	* get_nearest_part(multi-object, object 2) returns the part of the	374	* get_nearest_part(multi-object, object 2) returns the part of the
…		…
390	}	391	}
391		392
392	/*	393	/*
393	* Returns the object which has the count-variable equal to the argument.	394	* Returns the object which has the count-variable equal to the argument.
394	*/	395	*/
395
396	object *	396	object *
397	find_object (tag_t i)	397	find_object (tag_t i)
398	{	398	{
399	for (object *op = object::first; op; op = op->next)	399	for_all_objects (op)
400	if (op->count == i)	400	if (op->count == i)
401	return op;	401	return op;
402		402
403	return 0;	403	return 0;
404	}	404	}
405		405
406	/*	406	/*
407	* Returns the first object which has a name equal to the argument.	407	* Returns the first object which has a name equal to the argument.
408	* Used only by the patch command, but not all that useful.	408	* Used only by the patch command, but not all that useful.
409	* Enables features like "patch <name-of-other-player> food 999"	409	* Enables features like "patch <name-of-other-player> food 999"
410	*/	410	*/
411
412	object *	411	object *
413	find_object_name (const char *str)	412	find_object_name (const char *str)
414	{	413	{
415	shstr_cmp str_ (str);	414	shstr_cmp str_ (str);
416	object *op;	415	object *op;
417		416
418	for (op = object::first; op != NULL; op = op->next)	417	for_all_objects (op)
419	if (op->name == str_)	418	if (op->name == str_)
420	break;	419	break;
421		420
422	return op;	421	return op;
423	}	422	}
…		…
455	* refcounts and freeing the links.	454	* refcounts and freeing the links.
456	*/	455	*/
457	static void	456	static void
458	free_key_values (object *op)	457	free_key_values (object *op)
459	{	458	{
460	for (key_value *i = op->key_values; i != 0;)	459	for (key_value *i = op->key_values; i; )
461	{	460	{
462	key_value *next = i->next;	461	key_value *next = i->next;
463	delete i;	462	delete i;
464		463
465	i = next;	464	i = next;
466	}	465	}
467		466
468	op->key_values = 0;	467	op->key_values = 0;
469	}	468	}
470		469
471	/*	470	object &
472	* copy_to first frees everything allocated by the dst object,	471	object::operator =(const object &src)
473	* and then copies the contents of itself into the second
474	* object, allocating what needs to be allocated. Basically, any
475	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
476	* if the first object is freed, the pointers in the new object
477	* will point at garbage.
478	*/
479	void
480	object::copy_to (object *dst)
481	{	472	{
482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	473	bool is_freed = flag [FLAG_FREED];
483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	474	bool is_removed = flag [FLAG_REMOVED];
484		475
485	(object_copy )dst = *this;	476	(object_copy )this = src;
486		477
487	if (is_freed)	478	flag [FLAG_FREED] = is_freed;
488	SET_FLAG (dst, FLAG_FREED);	479	flag [FLAG_REMOVED] = is_removed;
489
490	if (is_removed)
491	SET_FLAG (dst, FLAG_REMOVED);
492
493	if (speed < 0)
494	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
495		480
496	/* Copy over key_values, if any. */	481	/* Copy over key_values, if any. */
497	if (key_values)	482	if (src.key_values)
498	{	483	{
499	key_value *tail = 0;	484	key_value *tail = 0;
500	key_value *i;
501
502	dst->key_values = 0;	485	key_values = 0;
503		486
504	for (i = key_values; i; i = i->next)	487	for (key_value *i = src.key_values; i; i = i->next)
505	{	488	{
506	key_value *new_link = new key_value;	489	key_value *new_link = new key_value;
507		490
508	new_link->next = 0;	491	new_link->next = 0;
509	new_link->key = i->key;	492	new_link->key = i->key;
510	new_link->value = i->value;	493	new_link->value = i->value;
511		494
512	/* Try and be clever here, too. */	495	/* Try and be clever here, too. */
513	if (!dst->key_values)	496	if (!key_values)
514	{	497	{
515	dst->key_values = new_link;	498	key_values = new_link;
516	tail = new_link;	499	tail = new_link;
517	}	500	}
518	else	501	else
519	{	502	{
520	tail->next = new_link;	503	tail->next = new_link;
521	tail = new_link;	504	tail = new_link;
522	}	505	}
523	}	506	}
524	}	507	}
		508	}
		509
		510	/*
		511	* copy_to first frees everything allocated by the dst object,
		512	* and then copies the contents of itself into the second
		513	* object, allocating what needs to be allocated. Basically, any
		514	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		515	* if the first object is freed, the pointers in the new object
		516	* will point at garbage.
		517	*/
		518	void
		519	object::copy_to (object *dst)
		520	{
		521	dst = this;
		522
		523	if (speed < 0)
		524	dst->speed_left = speed_left - rndm ();
525		525
526	dst->set_speed (dst->speed);	526	dst->set_speed (dst->speed);
		527	}
		528
		529	void
		530	object::instantiate ()
		531	{
		532	if (!uuid.seq) // HACK
		533	uuid = gen_uuid ();
		534
		535	speed_left = -0.1f;
		536	/* copy the body_info to the body_used - this is only really
		537	* need for monsters, but doesn't hurt to do it for everything.
		538	* by doing so, when a monster is created, it has good starting
		539	* values for the body_used info, so when items are created
		540	* for it, they can be properly equipped.
		541	*/
		542	memcpy (body_used, body_info, sizeof (body_used));
		543
		544	attachable::instantiate ();
527	}	545	}
528		546
529	object *	547	object *
530	object::clone ()	548	object::clone ()
531	{	549	{
…		…
589	* UP_OBJ_FACE: only the objects face has changed.	607	* UP_OBJ_FACE: only the objects face has changed.
590	*/	608	*/
591	void	609	void
592	update_object (object *op, int action)	610	update_object (object *op, int action)
593	{	611	{
594	MoveType move_on, move_off, move_block, move_slow;
595
596	if (op == NULL)	612	if (op == NULL)
597	{	613	{
598	/* this should never happen */	614	/* this should never happen */
599	LOG (llevDebug, "update_object() called for NULL object.\n");	615	LOG (llevDebug, "update_object() called for NULL object.\n");
600	return;	616	return;
…		…
660		676
661	if (op->more)	677	if (op->more)
662	update_object (op->more, action);	678	update_object (op->more, action);
663	}	679	}
664		680
665	object *object::first;
666
667	object::object ()	681	object::object ()
668	{	682	{
669	SET_FLAG (this, FLAG_REMOVED);	683	SET_FLAG (this, FLAG_REMOVED);
670		684
671	expmul = 1.0;	685	expmul = 1.0;
672	face = blank_face;	686	face = blank_face;
673	}	687	}
674		688
675	object::~object ()	689	object::~object ()
676	{	690	{
		691	unlink ();
		692
677	free_key_values (this);	693	free_key_values (this);
678	}	694	}
679		695
		696	static int object_count;
		697
680	void object::link ()	698	void object::link ()
681	{	699	{
682	count = ++ob_count;	700	assert (!index);//D
683	uuid = gen_uuid ();	701	uuid = gen_uuid ();
		702	count = ++object_count;
684		703
685	prev = 0;	704	refcnt_inc ();
686	next = object::first;	705	objects.insert (this);
687
688	if (object::first)
689	object::first->prev = this;
690
691	object::first = this;
692	}	706	}
693		707
694	void object::unlink ()	708	void object::unlink ()
695	{	709	{
696	if (this == object::first)	710	if (!index)
697	object::first = next;	711	return;
698		712
699	/* Remove this object from the list of used objects */	713	objects.erase (this);
700	if (prev) prev->next = next;	714	refcnt_dec ();
701	if (next) next->prev = prev;
702
703	prev = 0;
704	next = 0;
705	}
706
707	bool
708	object::active () const
709	{
710	return active_next \|\| active_prev \|\| this == active_objects;
711	}	715	}
712		716
713	void	717	void
714	object::activate ()	718	object::activate ()
715	{	719	{
716	/* If already on active list, don't do anything */	720	/* If already on active list, don't do anything */
717	if (active ())	721	if (active)
718	return;	722	return;
719		723
720	if (has_active_speed ())	724	if (has_active_speed ())
721	{	725	actives.insert (this);
722	/* process_events() expects us to insert the object at the beginning
723	* of the list. */
724	active_next = active_objects;
725
726	if (active_next)
727	active_next->active_prev = this;
728
729	active_objects = this;
730	}
731	}	726	}
732		727
733	void	728	void
734	object::activate_recursive ()	729	object::activate_recursive ()
735	{	730	{
736	activate ();	731	activate ();
737		732
738	for (object *op = inv; op; op = op->above)	733	for (object *op = inv; op; op = op->below)
739	op->activate_recursive ();	734	op->activate_recursive ();
740	}	735	}
741		736
742	/* This function removes object 'op' from the list of active	737	/* This function removes object 'op' from the list of active
743	* objects.	738	* objects.
…		…
749	*/	744	*/
750	void	745	void
751	object::deactivate ()	746	object::deactivate ()
752	{	747	{
753	/* If not on the active list, nothing needs to be done */	748	/* If not on the active list, nothing needs to be done */
754	if (!active ())	749	if (!active)
755	return;	750	return;
756		751
757	if (active_prev == 0)	752	actives.erase (this);
758	{
759	active_objects = active_next;
760	if (active_next)
761	active_next->active_prev = 0;
762	}
763	else
764	{
765	active_prev->active_next = active_next;
766	if (active_next)
767	active_next->active_prev = active_prev;
768	}
769
770	active_next = 0;
771	active_prev = 0;
772	}	753	}
773		754
774	void	755	void
775	object::deactivate_recursive ()	756	object::deactivate_recursive ()
776	{	757	{
777	for (object *op = inv; op; op = op->above)	758	for (object *op = inv; op; op = op->below)
778	op->deactivate_recursive ();	759	op->deactivate_recursive ();
779		760
780	deactivate ();	761	deactivate ();
		762	}
		763
		764	void
		765	object::set_flag_inv (int flag, int value)
		766	{
		767	for (object *op = inv; op; op = op->below)
		768	{
		769	op->flag [flag] = value;
		770	op->set_flag_inv (flag, value);
		771	}
781	}	772	}
782		773
783	/*	774	/*
784	* Remove and free all objects in the inventory of the given object.	775	* Remove and free all objects in the inventory of the given object.
785	* object.c ?	776	* object.c ?
…		…
800	* drop on that space.	791	* drop on that space.
801	*/	792	*/
802	if (!drop_to_ground	793	if (!drop_to_ground
803	\|\| !map	794	\|\| !map
804	\|\| map->in_memory != MAP_IN_MEMORY	795	\|\| map->in_memory != MAP_IN_MEMORY
		796	\|\| map->nodrop
805	\|\| ms ().move_block == MOVE_ALL)	797	\|\| ms ().move_block == MOVE_ALL)
806	{	798	{
807	while (inv)	799	while (inv)
808	{	800	{
809	inv->destroy_inv (drop_to_ground);	801	inv->destroy_inv (drop_to_ground);
…		…
818		810
819	if (op->flag [FLAG_STARTEQUIP]	811	if (op->flag [FLAG_STARTEQUIP]
820	\|\| op->flag [FLAG_NO_DROP]	812	\|\| op->flag [FLAG_NO_DROP]
821	\|\| op->type == RUNE	813	\|\| op->type == RUNE
822	\|\| op->type == TRAP	814	\|\| op->type == TRAP
823	\|\| op->flag [FLAG_IS_A_TEMPLATE])	815	\|\| op->flag [FLAG_IS_A_TEMPLATE]
		816	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
824	op->destroy ();	817	op->destroy ();
825	else	818	else
826	map->insert (op, x, y);	819	map->insert (op, x, y);
827	}	820	}
828	}	821	}
…		…
836	}	829	}
837		830
838	void	831	void
839	object::do_destroy ()	832	object::do_destroy ()
840	{	833	{
		834	attachable::do_destroy ();
		835
841	if (flag [FLAG_IS_LINKED])	836	if (flag [FLAG_IS_LINKED])
842	remove_button_link (this);	837	remove_button_link (this);
843		838
844	if (flag [FLAG_FRIENDLY])	839	if (flag [FLAG_FRIENDLY])
845	remove_friendly_object (this);	840	remove_friendly_object (this);
846		841
847	if (!flag [FLAG_REMOVED])	842	if (!flag [FLAG_REMOVED])
848	remove ();	843	remove ();
849		844
850	if (flag [FLAG_FREED])	845	destroy_inv (true);
851	return;
852		846
853	set_speed (0);	847	deactivate ();
		848	unlink ();
854		849
855	flag [FLAG_FREED] = 1;	850	flag [FLAG_FREED] = 1;
856
857	attachable::do_destroy ();
858
859	destroy_inv (true);
860	unlink ();
861		851
862	// hack to ensure that freed objects still have a valid map	852	// hack to ensure that freed objects still have a valid map
863	{	853	{
864	static maptile *freed_map; // freed objects are moved here to avoid crashes	854	static maptile *freed_map; // freed objects are moved here to avoid crashes
865		855
…		…
870	freed_map->name = "/internal/freed_objects_map";	860	freed_map->name = "/internal/freed_objects_map";
871	freed_map->width = 3;	861	freed_map->width = 3;
872	freed_map->height = 3;	862	freed_map->height = 3;
873		863
874	freed_map->alloc ();	864	freed_map->alloc ();
		865	freed_map->in_memory = MAP_IN_MEMORY;
875	}	866	}
876		867
877	map = freed_map;	868	map = freed_map;
878	x = 1;	869	x = 1;
879	y = 1;	870	y = 1;
…		…
889		880
890	// clear those pointers that likely might have circular references to us	881	// clear those pointers that likely might have circular references to us
891	owner = 0;	882	owner = 0;
892	enemy = 0;	883	enemy = 0;
893	attacked_by = 0;	884	attacked_by = 0;
894
895	// only relevant for players(?), but make sure of it anyways
896	contr = 0;
897	}	885	}
898		886
899	void	887	void
900	object::destroy (bool destroy_inventory)	888	object::destroy (bool destroy_inventory)
901	{	889	{
…		…
929	* This function removes the object op from the linked list of objects	917	* This function removes the object op from the linked list of objects
930	* which it is currently tied to. When this function is done, the	918	* which it is currently tied to. When this function is done, the
931	* object will have no environment. If the object previously had an	919	* object will have no environment. If the object previously had an
932	* environment, the x and y coordinates will be updated to	920	* environment, the x and y coordinates will be updated to
933	* the previous environment.	921	* the previous environment.
934	* Beware: This function is called from the editor as well!
935	*/	922	*/
936	void	923	void
937	object::remove ()	924	object::do_remove ()
938	{	925	{
939	object tmp, last = 0;	926	object tmp, last = 0;
940	object *otmp;	927	object *otmp;
941		928
942	if (QUERY_FLAG (this, FLAG_REMOVED))	929	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
985	}	972	}
986	else if (map)	973	else if (map)
987	{	974	{
988	if (type == PLAYER)	975	if (type == PLAYER)
989	{	976	{
		977	// leaving a spot always closes any open container on the ground
		978	if (container && !container->env)
		979	// this causes spurious floorbox updates, but it ensures
		980	// that the CLOSE event is being sent.
		981	close_container ();
		982
990	--map->players;	983	--map->players;
991	map->touch ();	984	map->touch ();
992	}	985	}
993		986
994	map->dirty = true;	987	map->dirty = true;
		988	mapspace &ms = this->ms ();
995		989
996	/* link the object above us */	990	/* link the object above us */
997	if (above)	991	if (above)
998	above->below = below;	992	above->below = below;
999	else	993	else
1000	map->at (x, y).top = below; /* we were top, set new top */	994	ms.top = below; /* we were top, set new top */
1001		995
1002	/* Relink the object below us, if there is one */	996	/* Relink the object below us, if there is one */
1003	if (below)	997	if (below)
1004	below->above = above;	998	below->above = above;
1005	else	999	else
…		…
1007	/* Nothing below, which means we need to relink map object for this space	1001	/* Nothing below, which means we need to relink map object for this space
1008	* use translated coordinates in case some oddness with map tiling is	1002	* use translated coordinates in case some oddness with map tiling is
1009	* evident	1003	* evident
1010	*/	1004	*/
1011	if (GET_MAP_OB (map, x, y) != this)	1005	if (GET_MAP_OB (map, x, y) != this)
1012	{
1013	char *dump = dump_object (this);
1014	LOG (llevError,
1015	"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);	1006	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 ());
1016	free (dump);
1017	dump = dump_object (GET_MAP_OB (map, x, y));
1018	LOG (llevError, "%s\n", dump);
1019	free (dump);
1020	}
1021		1007
1022	map->at (x, y).bot = above; /* goes on above it. */	1008	ms.bot = above; /* goes on above it. */
1023	}	1009	}
1024		1010
1025	above = 0;	1011	above = 0;
1026	below = 0;	1012	below = 0;
1027		1013
1028	if (map->in_memory == MAP_SAVING)	1014	if (map->in_memory == MAP_SAVING)
1029	return;	1015	return;
1030		1016
1031	int check_walk_off = !flag [FLAG_NO_APPLY];	1017	int check_walk_off = !flag [FLAG_NO_APPLY];
1032		1018
1033	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1019	for (tmp = ms.bot; tmp; tmp = tmp->above)
1034	{	1020	{
1035	/* No point updating the players look faces if he is the object	1021	/* No point updating the players look faces if he is the object
1036	* being removed.	1022	* being removed.
1037	*/	1023	*/
1038		1024
…		…
1118	}	1104	}
1119		1105
1120	return 0;	1106	return 0;
1121	}	1107	}
1122		1108
		1109	void
		1110	object::expand_tail ()
		1111	{
		1112	if (more)
		1113	return;
		1114
		1115	object *prev = this;
		1116
		1117	for (archetype *at = arch->more; at; at = at->more)
		1118	{
		1119	object *op = arch_to_object (at);
		1120
		1121	op->name = name;
		1122	op->name_pl = name_pl;
		1123	op->title = title;
		1124
		1125	op->head = this;
		1126	prev->more = op;
		1127
		1128	prev = op;
		1129	}
		1130	}
		1131
1123	/*	1132	/*
1124	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1133	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1125	* job preparing multi-part monsters	1134	* job preparing multi-part monsters.
1126	*/	1135	*/
1127	object *	1136	object *
1128	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1137	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1129	{	1138	{
1130	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1139	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
…		…
1157	* just 'op' otherwise	1166	* just 'op' otherwise
1158	*/	1167	*/
1159	object *	1168	object *
1160	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1169	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1161	{	1170	{
		1171	assert (!op->flag [FLAG_FREED]);
		1172
1162	object tmp, top, *floor = NULL;	1173	object tmp, top, *floor = NULL;
1163	sint16 x, y;
1164		1174
1165	if (QUERY_FLAG (op, FLAG_FREED))	1175	op->remove ();
1166	{
1167	LOG (llevError, "Trying to insert freed object!\n");
1168	return NULL;
1169	}
1170		1176
1171	if (!m)	1177	#if 0
1172	{	1178	if (!m->active != !op->active)
1173	char *dump = dump_object (op);	1179	if (m->active)
1174	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1180	op->activate_recursive ();
1175	free (dump);	1181	else
1176	return op;	1182	op->deactivate_recursive ();
1177	}	1183	#endif
1178		1184
1179	if (out_of_map (m, op->x, op->y))	1185	if (out_of_map (m, op->x, op->y))
1180	{	1186	{
1181	char *dump = dump_object (op);
1182	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);	1187	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1183	#ifdef MANY_CORES	1188	#ifdef MANY_CORES
1184	/* Better to catch this here, as otherwise the next use of this object	1189	/* Better to catch this here, as otherwise the next use of this object
1185	* is likely to cause a crash. Better to find out where it is getting	1190	* is likely to cause a crash. Better to find out where it is getting
1186	* improperly inserted.	1191	* improperly inserted.
1187	*/	1192	*/
1188	abort ();	1193	abort ();
1189	#endif	1194	#endif
1190	free (dump);
1191	return op;	1195	return op;
1192	}	1196	}
1193		1197
1194	if (!QUERY_FLAG (op, FLAG_REMOVED))
1195	{
1196	char *dump = dump_object (op);
1197	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1198	free (dump);
1199	return op;
1200	}
1201
1202	if (op->more)
1203	{
1204	/* The part may be on a different map. */
1205
1206	object *more = op->more;	1198	if (object *more = op->more)
1207		1199	{
1208	/* We really need the caller to normalize coordinates - if
1209	* we set the map, that doesn't work if the location is within
1210	* a map and this is straddling an edge. So only if coordinate
1211	* is clear wrong do we normalize it.
1212	*/
1213	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1214	more->map = get_map_from_coord (m, &more->x, &more->y);
1215	else if (!more->map)
1216	{
1217	/* For backwards compatibility - when not dealing with tiled maps,
1218	* more->map should always point to the parent.
1219	*/
1220	more->map = m;
1221	}
1222
1223	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1200	if (!insert_ob_in_map (more, m, originator, flag))
1224	{	1201	{
1225	if (!op->head)	1202	if (!op->head)
1226	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1203	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1227		1204
1228	return 0;	1205	return 0;
…		…
1233		1210
1234	/* Ideally, the caller figures this out. However, it complicates a lot	1211	/* Ideally, the caller figures this out. However, it complicates a lot
1235	* of areas of callers (eg, anything that uses find_free_spot would now	1212	* of areas of callers (eg, anything that uses find_free_spot would now
1236	* need extra work	1213	* need extra work
1237	*/	1214	*/
1238	op->map = get_map_from_coord (m, &op->x, &op->y);	1215	if (!xy_normalise (m, op->x, op->y))
1239	x = op->x;	1216	return 0;
1240	y = op->y;	1217
		1218	op->map = m;
		1219	mapspace &ms = op->ms ();
1241		1220
1242	/* this has to be done after we translate the coordinates.	1221	/* this has to be done after we translate the coordinates.
1243	*/	1222	*/
1244	if (op->nrof && !(flag & INS_NO_MERGE))	1223	if (op->nrof && !(flag & INS_NO_MERGE))
1245	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1224	for (tmp = ms.bot; tmp; tmp = tmp->above)
1246	if (object::can_merge (op, tmp))	1225	if (object::can_merge (op, tmp))
1247	{	1226	{
1248	op->nrof += tmp->nrof;	1227	op->nrof += tmp->nrof;
1249	tmp->destroy ();	1228	tmp->destroy ();
1250	}	1229	}
…		…
1267	op->below = originator->below;	1246	op->below = originator->below;
1268		1247
1269	if (op->below)	1248	if (op->below)
1270	op->below->above = op;	1249	op->below->above = op;
1271	else	1250	else
1272	op->ms ().bot = op;	1251	ms.bot = op;
1273		1252
1274	/* since below originator, no need to update top */	1253	/* since below originator, no need to update top */
1275	originator->below = op;	1254	originator->below = op;
1276	}	1255	}
1277	else	1256	else
1278	{	1257	{
		1258	top = ms.bot;
		1259
1279	/* If there are other objects, then */	1260	/* If there are other objects, then */
1280	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1261	if ((!(flag & INS_MAP_LOAD)) && top)
1281	{	1262	{
1282	object *last = 0;	1263	object *last = 0;
1283		1264
1284	/*	1265	/*
1285	* If there are multiple objects on this space, we do some trickier handling.	1266	* If there are multiple objects on this space, we do some trickier handling.
…		…
1291	* once we get to them. This reduces the need to traverse over all of	1272	* once we get to them. This reduces the need to traverse over all of
1292	* them when adding another one - this saves quite a bit of cpu time	1273	* them when adding another one - this saves quite a bit of cpu time
1293	* when lots of spells are cast in one area. Currently, it is presumed	1274	* when lots of spells are cast in one area. Currently, it is presumed
1294	* that flying non pickable objects are spell objects.	1275	* that flying non pickable objects are spell objects.
1295	*/	1276	*/
1296	while (top)	1277	for (top = ms.bot; top; top = top->above)
1297	{	1278	{
1298	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1279	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1299	floor = top;	1280	floor = top;
1300		1281
1301	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1282	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1304	top = top->below;	1285	top = top->below;
1305	break;	1286	break;
1306	}	1287	}
1307		1288
1308	last = top;	1289	last = top;
1309	top = top->above;
1310	}	1290	}
1311		1291
1312	/* Don't want top to be NULL, so set it to the last valid object */	1292	/* Don't want top to be NULL, so set it to the last valid object */
1313	top = last;	1293	top = last;
1314		1294
…		…
1316	* looks like instead of lots of conditions here.	1296	* looks like instead of lots of conditions here.
1317	* makes things faster, and effectively the same result.	1297	* makes things faster, and effectively the same result.
1318	*/	1298	*/
1319		1299
1320	/* Have object 'fall below' other objects that block view.	1300	/* Have object 'fall below' other objects that block view.
1321	* Unless those objects are exits, type 66	1301	* Unless those objects are exits.
1322	* If INS_ON_TOP is used, don't do this processing	1302	* If INS_ON_TOP is used, don't do this processing
1323	* Need to find the object that in fact blocks view, otherwise	1303	* Need to find the object that in fact blocks view, otherwise
1324	* stacking is a bit odd.	1304	* stacking is a bit odd.
1325	*/	1305	*/
1326	if (!(flag & INS_ON_TOP) &&	1306	if (!(flag & INS_ON_TOP)
1327	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1307	&& ms.flags () & P_BLOCKSVIEW
		1308	&& (op->face && !faces [op->face].visibility))
1328	{	1309	{
1329	for (last = top; last != floor; last = last->below)	1310	for (last = top; last != floor; last = last->below)
1330	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1311	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1331	break;	1312	break;
		1313
1332	/* Check to see if we found the object that blocks view,	1314	/* Check to see if we found the object that blocks view,
1333	* and make sure we have a below pointer for it so that	1315	* and make sure we have a below pointer for it so that
1334	* we can get inserted below this one, which requires we	1316	* we can get inserted below this one, which requires we
1335	* set top to the object below us.	1317	* set top to the object below us.
1336	*/	1318	*/
…		…
1338	top = last->below;	1320	top = last->below;
1339	}	1321	}
1340	} /* If objects on this space */	1322	} /* If objects on this space */
1341		1323
1342	if (flag & INS_MAP_LOAD)	1324	if (flag & INS_MAP_LOAD)
1343	top = GET_MAP_TOP (op->map, op->x, op->y);	1325	top = ms.top;
1344		1326
1345	if (flag & INS_ABOVE_FLOOR_ONLY)	1327	if (flag & INS_ABOVE_FLOOR_ONLY)
1346	top = floor;	1328	top = floor;
1347		1329
1348	/* Top is the object that our object (op) is going to get inserted above.	1330	/* Top is the object that our object (op) is going to get inserted above.
1349	*/	1331	*/
1350		1332
1351	/* First object on this space */	1333	/* First object on this space */
1352	if (!top)	1334	if (!top)
1353	{	1335	{
1354	op->above = GET_MAP_OB (op->map, op->x, op->y);	1336	op->above = ms.bot;
1355		1337
1356	if (op->above)	1338	if (op->above)
1357	op->above->below = op;	1339	op->above->below = op;
1358		1340
1359	op->below = 0;	1341	op->below = 0;
1360	op->ms ().bot = op;	1342	ms.bot = op;
1361	}	1343	}
1362	else	1344	else
1363	{ /* get inserted into the stack above top */	1345	{ /* get inserted into the stack above top */
1364	op->above = top->above;	1346	op->above = top->above;
1365		1347
…		…
1369	op->below = top;	1351	op->below = top;
1370	top->above = op;	1352	top->above = op;
1371	}	1353	}
1372		1354
1373	if (!op->above)	1355	if (!op->above)
1374	op->ms ().top = op;	1356	ms.top = op;
1375	} /* else not INS_BELOW_ORIGINATOR */	1357	} /* else not INS_BELOW_ORIGINATOR */
1376		1358
1377	if (op->type == PLAYER)	1359	if (op->type == PLAYER)
1378	{	1360	{
1379	op->contr->do_los = 1;	1361	op->contr->do_los = 1;
…		…
1385		1367
1386	/* If we have a floor, we know the player, if any, will be above	1368	/* If we have a floor, we know the player, if any, will be above
1387	* it, so save a few ticks and start from there.	1369	* it, so save a few ticks and start from there.
1388	*/	1370	*/
1389	if (!(flag & INS_MAP_LOAD))	1371	if (!(flag & INS_MAP_LOAD))
1390	if (object *pl = op->ms ().player ())	1372	if (object *pl = ms.player ())
1391	if (pl->contr->ns)	1373	if (pl->contr->ns)
1392	pl->contr->ns->floorbox_update ();	1374	pl->contr->ns->floorbox_update ();
1393		1375
1394	/* If this object glows, it may affect lighting conditions that are	1376	/* If this object glows, it may affect lighting conditions that are
1395	* visible to others on this map. But update_all_los is really	1377	* visible to others on this map. But update_all_los is really
…		…
1443	{	1425	{
1444	object tmp, tmp1;	1426	object tmp, tmp1;
1445		1427
1446	/* first search for itself and remove any old instances */	1428	/* first search for itself and remove any old instances */
1447		1429
1448	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1430	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1449	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1431	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1450	tmp->destroy ();	1432	tmp->destroy ();
1451		1433
1452	tmp1 = arch_to_object (archetype::find (arch_string));	1434	tmp1 = arch_to_object (archetype::find (arch_string));
1453		1435
…		…
1457	}	1439	}
1458		1440
1459	object *	1441	object *
1460	object::insert_at (object where, object originator, int flags)	1442	object::insert_at (object where, object originator, int flags)
1461	{	1443	{
1462	where->map->insert (this, where->x, where->y, originator, flags);	1444	return where->map->insert (this, where->x, where->y, originator, flags);
1463	}	1445	}
1464		1446
1465	/*	1447	/*
1466	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1448	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1467	* is returned contains nr objects, and the remaining parts contains	1449	* is returned contains nr objects, and the remaining parts contains
…		…
1507	* the amount of an object. If the amount reaches 0, the object	1489	* the amount of an object. If the amount reaches 0, the object
1508	* is subsequently removed and freed.	1490	* is subsequently removed and freed.
1509	*	1491	*
1510	* Return value: 'op' if something is left, NULL if the amount reached 0	1492	* Return value: 'op' if something is left, NULL if the amount reached 0
1511	*/	1493	*/
1512
1513	object *	1494	object *
1514	decrease_ob_nr (object *op, uint32 i)	1495	decrease_ob_nr (object *op, uint32 i)
1515	{	1496	{
1516	object *tmp;	1497	object *tmp;
1517		1498
…		…
1592		1573
1593	/*	1574	/*
1594	* add_weight(object, weight) adds the specified weight to an object,	1575	* add_weight(object, weight) adds the specified weight to an object,
1595	* and also updates how much the environment(s) is/are carrying.	1576	* and also updates how much the environment(s) is/are carrying.
1596	*/	1577	*/
1597
1598	void	1578	void
1599	add_weight (object *op, signed long weight)	1579	add_weight (object *op, signed long weight)
1600	{	1580	{
1601	while (op != NULL)	1581	while (op != NULL)
1602	{	1582	{
…		…
1634	* inside the object environment.	1614	* inside the object environment.
1635	*	1615	*
1636	* The function returns now pointer to inserted item, and return value can	1616	* The function returns now pointer to inserted item, and return value can
1637	* be != op, if items are merged. -Tero	1617	* be != op, if items are merged. -Tero
1638	*/	1618	*/
1639
1640	object *	1619	object *
1641	object::insert (object *op)	1620	object::insert (object *op)
1642	{	1621	{
1643	object tmp, otmp;	1622	object tmp, otmp;
1644		1623
…		…
1776		1755
1777	/* The objects have to be checked from top to bottom.	1756	/* The objects have to be checked from top to bottom.
1778	* Hence, we first go to the top:	1757	* Hence, we first go to the top:
1779	*/	1758	*/
1780		1759
1781	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above)	1760	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1782	{	1761	{
1783	/* Trim the search when we find the first other spell effect	1762	/* Trim the search when we find the first other spell effect
1784	* this helps performance so that if a space has 50 spell objects,	1763	* this helps performance so that if a space has 50 spell objects,
1785	* we don't need to check all of them.	1764	* we don't need to check all of them.
1786	*/	1765	*/
…		…
1804	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1783	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1805	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1784	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1806	{	1785	{
1807		1786
1808	float	1787	float
1809	diff = tmp->move_slow_penalty * FABS (op->speed);	1788	diff = tmp->move_slow_penalty * fabs (op->speed);
1810		1789
1811	if (op->type == PLAYER)	1790	if (op->type == PLAYER)
1812	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1791	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|
1813	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1792	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1814	diff /= 4.0;	1793	diff /= 4.0;
…		…
1844	* The first matching object is returned, or NULL if none.	1823	* The first matching object is returned, or NULL if none.
1845	*/	1824	*/
1846	object *	1825	object *
1847	present_arch (const archetype at, maptile m, int x, int y)	1826	present_arch (const archetype at, maptile m, int x, int y)
1848	{	1827	{
1849	if (m == NULL \|\| out_of_map (m, x, y))	1828	if (!m \|\| out_of_map (m, x, y))
1850	{	1829	{
1851	LOG (llevError, "Present_arch called outside map.\n");	1830	LOG (llevError, "Present_arch called outside map.\n");
1852	return NULL;	1831	return NULL;
1853	}	1832	}
1854		1833
1855	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1834	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1856	if (tmp->arch == at)	1835	if (tmp->arch == at)
1857	return tmp;	1836	return tmp;
1858		1837
1859	return NULL;	1838	return NULL;
1860	}	1839	}
…		…
1871	{	1850	{
1872	LOG (llevError, "Present called outside map.\n");	1851	LOG (llevError, "Present called outside map.\n");
1873	return NULL;	1852	return NULL;
1874	}	1853	}
1875		1854
1876	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1855	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1877	if (tmp->type == type)	1856	if (tmp->type == type)
1878	return tmp;	1857	return tmp;
1879		1858
1880	return NULL;	1859	return NULL;
1881	}	1860	}
…		…
2021	}	2000	}
2022		2001
2023	if (!index)	2002	if (!index)
2024	return -1;	2003	return -1;
2025		2004
2026	return altern[RANDOM () % index];	2005	return altern [rndm (index)];
2027	}	2006	}
2028		2007
2029	/*	2008	/*
2030	* find_first_free_spot(archetype, maptile, x, y) works like	2009	* find_first_free_spot(archetype, maptile, x, y) works like
2031	* find_free_spot(), but it will search max number of squares.	2010	* find_free_spot(), but it will search max number of squares.
…		…
2052	{	2031	{
2053	arr += begin;	2032	arr += begin;
2054	end -= begin;	2033	end -= begin;
2055		2034
2056	while (--end)	2035	while (--end)
2057	swap (arr [end], arr [RANDOM () % (end + 1)]);	2036	swap (arr [end], arr [rndm (end + 1)]);
2058	}	2037	}
2059		2038
2060	/* new function to make monster searching more efficient, and effective!	2039	/* new function to make monster searching more efficient, and effective!
2061	* This basically returns a randomized array (in the passed pointer) of	2040	* This basically returns a randomized array (in the passed pointer) of
2062	* the spaces to find monsters. In this way, it won't always look for	2041	* the spaces to find monsters. In this way, it won't always look for
…		…
2196		2175
2197	return 3;	2176	return 3;
2198	}	2177	}
2199		2178
2200	/*	2179	/*
2201	* absdir(int): Returns a number between 1 and 8, which represent
2202	* the "absolute" direction of a number (it actually takes care of
2203	* "overflow" in previous calculations of a direction).
2204	*/
2205
2206	int
2207	absdir (int d)
2208	{
2209	while (d < 1)
2210	d += 8;
2211
2212	while (d > 8)
2213	d -= 8;
2214
2215	return d;
2216	}
2217
2218	/*
2219	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2180	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2220	* between two directions (which are expected to be absolute (see absdir())	2181	* between two directions (which are expected to be absolute (see absdir())
2221	*/	2182	*/
2222
2223	int	2183	int
2224	dirdiff (int dir1, int dir2)	2184	dirdiff (int dir1, int dir2)
2225	{	2185	{
2226	int d;	2186	int d;
2227		2187
…		…
2393	insert_ob_in_ob (object_create_clone (item), dst);	2353	insert_ob_in_ob (object_create_clone (item), dst);
2394		2354
2395	return dst;	2355	return dst;
2396	}	2356	}
2397		2357
2398	/* GROS - Creates an object using a string representing its content. */
2399	/* Basically, we save the content of the string to a temp file, then call */
2400	/* load_object on it. I admit it is a highly inefficient way to make things, */
2401	/* but it was simple to make and allows reusing the load_object function. */
2402	/* Remember not to use load_object_str in a time-critical situation. */
2403	/* Also remember that multiparts objects are not supported for now. */
2404	object *
2405	load_object_str (const char *obstr)
2406	{
2407	object *op;
2408	char filename[MAX_BUF];
2409
2410	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2411
2412	FILE *tempfile = fopen (filename, "w");
2413
2414	if (tempfile == NULL)
2415	{
2416	LOG (llevError, "Error - Unable to access load object temp file\n");
2417	return NULL;
2418	}
2419
2420	fprintf (tempfile, obstr);
2421	fclose (tempfile);
2422
2423	op = object::create ();
2424
2425	object_thawer thawer (filename);
2426
2427	if (thawer)
2428	load_object (thawer, op, 0);
2429
2430	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2431	CLEAR_FLAG (op, FLAG_REMOVED);
2432
2433	return op;
2434	}
2435
2436	/* This returns the first object in who's inventory that	2358	/* This returns the first object in who's inventory that
2437	* has the same type and subtype match.	2359	* has the same type and subtype match.
2438	* returns NULL if no match.	2360	* returns NULL if no match.
2439	*/	2361	*/
2440	object *	2362	object *
…		…
2493	if (link->key == canonical_key)	2415	if (link->key == canonical_key)
2494	return link->value;	2416	return link->value;
2495		2417
2496	return 0;	2418	return 0;
2497	}	2419	}
2498
2499		2420
2500	/*	2421	/*
2501	* Updates the canonical_key in op to value.	2422	* Updates the canonical_key in op to value.
2502	*	2423	*
2503	* canonical_key is a shared string (value doesn't have to be).	2424	* canonical_key is a shared string (value doesn't have to be).
…		…
2613	object::flag_desc (char *desc, int len) const	2534	object::flag_desc (char *desc, int len) const
2614	{	2535	{
2615	char *p = desc;	2536	char *p = desc;
2616	bool first = true;	2537	bool first = true;
2617		2538
		2539	*p = 0;
		2540
2618	for (int i = 0; i < NUM_FLAGS; i++)	2541	for (int i = 0; i < NUM_FLAGS; i++)
2619	{	2542	{
2620	if (len <= 10) // magic constant!	2543	if (len <= 10) // magic constant!
2621	{	2544	{
2622	snprintf (p, len, ",...");	2545	snprintf (p, len, ",...");
2623	break;	2546	break;
2624	}	2547	}
2625		2548
2626	if (flag[i])	2549	if (flag [i])
2627	{	2550	{
2628	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);	2551	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
2629	len -= cnt;	2552	len -= cnt;
2630	p += cnt;	2553	p += cnt;
2631	first = false;	2554	first = false;
…		…
2633	}	2556	}
2634		2557
2635	return desc;	2558	return desc;
2636	}	2559	}
2637		2560
2638	// return a suitable string describing an objetc in enough detail to find it	2561	// return a suitable string describing an object in enough detail to find it
2639	const char *	2562	const char *
2640	object::debug_desc (char *info) const	2563	object::debug_desc (char *info) const
2641	{	2564	{
2642	char flagdesc[512];	2565	char flagdesc[512];
2643	char info2[256 * 4];	2566	char info2[256 * 4];
2644	char *p = info;	2567	char *p = info;
2645		2568
2646	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",	2569	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2647	count, uuid.seq,	2570	count, uuid.seq,
2648	&name,	2571	&name,
2649	title ? "\",title:" : "",	2572	title ? "\",title:\"" : "",
2650	title ? (const char *)title : "",	2573	title ? (const char *)title : "",
2651	flag_desc (flagdesc, 512), type);	2574	flag_desc (flagdesc, 512), type);
2652		2575
2653	if (env)	2576	if (env)
2654	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2577	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
…		…
2660	}	2583	}
2661		2584
2662	const char *	2585	const char *
2663	object::debug_desc () const	2586	object::debug_desc () const
2664	{	2587	{
2665	static char info[256 * 3];	2588	static char info[256 * 4];
2666	return debug_desc (info);	2589	return debug_desc (info);
2667	}	2590	}
2668		2591
		2592	const char *
		2593	object::debug_desc2 () const
		2594	{
		2595	static char info[256 * 4];
		2596	return debug_desc (info);
		2597	}
		2598
		2599	struct region *
		2600	object::region () const
		2601	{
		2602	return map ? map->region (x, y)
		2603	: region::default_region ();
		2604	}
		2605
		2606	const materialtype_t *
		2607	object::dominant_material () const
		2608	{
		2609	if (materialtype_t *mat = name_to_material (materialname))
		2610	return mat;
		2611
		2612	// omfg this is slow, this has to be temporary :)
		2613	shstr unknown ("unknown");
		2614
		2615	return name_to_material (unknown);
		2616	}
		2617
		2618	void
		2619	object::open_container (object *new_container)
		2620	{
		2621	if (container == new_container)
		2622	return;
		2623
		2624	if (object *old_container = container)
		2625	{
		2626	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2627	return;
		2628
		2629	#if 0
		2630	// remove the "Close old_container" object.
		2631	if (object *closer = old_container->inv)
		2632	if (closer->type == CLOSE_CON)
		2633	closer->destroy ();
		2634	#endif
		2635
		2636	old_container->flag [FLAG_APPLIED] = 0;
		2637	container = 0;
		2638
		2639	esrv_update_item (UPD_FLAGS, this, old_container);
		2640	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2641	}
		2642
		2643	if (new_container)
		2644	{
		2645	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2646	return;
		2647
		2648	// TODO: this does not seem to serve any purpose anymore?
		2649	#if 0
		2650	// insert the "Close Container" object.
		2651	if (archetype *closer = new_container->other_arch)
		2652	{
		2653	object *closer = arch_to_object (new_container->other_arch);
		2654	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2655	new_container->insert (closer);
		2656	}
		2657	#endif
		2658
		2659	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2660
		2661	new_container->flag [FLAG_APPLIED] = 1;
		2662	container = new_container;
		2663
		2664	esrv_update_item (UPD_FLAGS, this, new_container);
		2665	esrv_send_inventory (this, new_container);
		2666	}
		2667	}
		2668
		2669

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.100 by root, Mon Jan 1 12:28:45 2007 UTC vs. Revision 1.140 by root, Tue Apr 24 12:32:14 2007 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.100 by root, Mon Jan 1 12:28:45 2007 UTC vs.
Revision 1.140 by root, Tue Apr 24 12:32:14 2007 UTC