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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.107 by pippijn, Sat Jan 6 14:42:29 2007 UTC vs.
Revision 1.146 by root, Fri May 11 21:07:13 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) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (C) 2001 Mark Wedel & Crossfire Development Team
6	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (C) 1992 Frank Tore Johansen
7		7	*
8	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
9	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
10	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation; either version 2 of the License, or
11	(at your option) any later version.	11	* (at your option) any later version.
12		12	*
13	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,
14	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	GNU General Public License for more details.	16	* GNU General Public License for more details.
17		17	*
18	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
19	along with this program; if not, write to the Free Software	19	* along with this program; if not, write to the Free Software
20	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21		21	*
22	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>
23	*/	23	*/
24		24
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying	26	sub/add_weight will transcend the environment updating the carrying
27	variable. */	27	variable. */
28	#include <global.h>	28	#include <global.h>
29	#include <stdio.h>	29	#include <stdio.h>
30	#include <sys/types.h>	30	#include <sys/types.h>
31	#include <sys/uio.h>	31	#include <sys/uio.h>
32	#include <object.h>	32	#include <object.h>
33	#include <funcpoint.h>	33	#include <funcpoint.h>
		34	#include <sproto.h>
34	#include <loader.h>	35	#include <loader.h>
35		36
36	#include <bitset>	37	#include <bitset>
37		38
38	int nrofallocobjects = 0;	39	int nrofallocobjects = 0;
39	static UUID uuid;	40	static UUID uuid;
40	const uint64 UUID_SKIP = 1<<19;	41	const uint64 UUID_SKIP = 1<<19;
41		42
42	object active_objects; / List of active objects that need to be processed */	43	objectvec objects;
		44	activevec actives;
43		45
44	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	46	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
45	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	47	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
46	};	48	};
47	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	49	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
323	sum_weight (object *op)	325	sum_weight (object *op)
324	{	326	{
325	long sum;	327	long sum;
326	object *inv;	328	object *inv;
327		329
328	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	330	for (sum = 0, inv = op->inv; inv; inv = inv->below)
329	{	331	{
330	if (inv->inv)	332	if (inv->inv)
331	sum_weight (inv);	333	sum_weight (inv);
		334
332	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	335	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
333	}	336	}
334		337
335	if (op->type == CONTAINER && op->stats.Str)	338	if (op->type == CONTAINER && op->stats.Str)
336	sum = (sum * (100 - op->stats.Str)) / 100;	339	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
356	/*	359	/*
357	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	360	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
358	* Some error messages.	361	* Some error messages.
359	* The result of the dump is stored in the static global errmsg array.	362	* The result of the dump is stored in the static global errmsg array.
360	*/	363	*/
361
362	char *	364	char *
363	dump_object (object *op)	365	dump_object (object *op)
364	{	366	{
365	if (!op)	367	if (!op)
366	return strdup ("[NULLOBJ]");	368	return strdup ("[NULLOBJ]");
367		369
368	object_freezer freezer;	370	object_freezer freezer;
369	save_object (freezer, op, 1);	371	op->write (freezer);
370	return freezer.as_string ();	372	return freezer.as_string ();
371	}	373	}
372		374
373	/*	375	/*
374	* get_nearest_part(multi-object, object 2) returns the part of the	376	* get_nearest_part(multi-object, object 2) returns the part of the
…		…
391	}	393	}
392		394
393	/*	395	/*
394	* Returns the object which has the count-variable equal to the argument.	396	* Returns the object which has the count-variable equal to the argument.
395	*/	397	*/
396
397	object *	398	object *
398	find_object (tag_t i)	399	find_object (tag_t i)
399	{	400	{
400	for (object *op = object::first; op; op = op->next)	401	for_all_objects (op)
401	if (op->count == i)	402	if (op->count == i)
402	return op;	403	return op;
403		404
404	return 0;	405	return 0;
405	}	406	}
406		407
407	/*	408	/*
408	* Returns the first object which has a name equal to the argument.	409	* Returns the first object which has a name equal to the argument.
409	* Used only by the patch command, but not all that useful.	410	* Used only by the patch command, but not all that useful.
410	* Enables features like "patch <name-of-other-player> food 999"	411	* Enables features like "patch <name-of-other-player> food 999"
411	*/	412	*/
412
413	object *	413	object *
414	find_object_name (const char *str)	414	find_object_name (const char *str)
415	{	415	{
416	shstr_cmp str_ (str);	416	shstr_cmp str_ (str);
417	object *op;	417	object *op;
418		418
419	for (op = object::first; op != NULL; op = op->next)	419	for_all_objects (op)
420	if (op->name == str_)	420	if (op->name == str_)
421	break;	421	break;
422		422
423	return op;	423	return op;
424	}	424	}
…		…
450	owner = owner->owner;	450	owner = owner->owner;
451		451
452	this->owner = owner;	452	this->owner = owner;
453	}	453	}
454		454
		455	void
		456	object::set_weapon (object *ob)
		457	{
		458	if (current_weapon == ob)
		459	return;
		460
		461	new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		462
		463	if (chosen_skill)
		464	chosen_skill->flag [FLAG_APPLIED] = false;
		465
		466	current_weapon = ob;
		467	chosen_skill = ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		468
		469	if (chosen_skill)
		470	chosen_skill->flag [FLAG_APPLIED] = true;
		471
		472	update_stats ();
		473	}
		474
455	/* Zero the key_values on op, decrementing the shared-string	475	/* Zero the key_values on op, decrementing the shared-string
456	* refcounts and freeing the links.	476	* refcounts and freeing the links.
457	*/	477	*/
458	static void	478	static void
459	free_key_values (object *op)	479	free_key_values (object *op)
460	{	480	{
461	for (key_value *i = op->key_values; i != 0;)	481	for (key_value *i = op->key_values; i; )
462	{	482	{
463	key_value *next = i->next;	483	key_value *next = i->next;
464	delete i;	484	delete i;
465		485
466	i = next;	486	i = next;
467	}	487	}
468		488
469	op->key_values = 0;	489	op->key_values = 0;
470	}	490	}
471		491
472	/*	492	object &
473	* copy_to first frees everything allocated by the dst object,	493	object::operator =(const object &src)
474	* and then copies the contents of itself into the second
475	* object, allocating what needs to be allocated. Basically, any
476	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
477	* if the first object is freed, the pointers in the new object
478	* will point at garbage.
479	*/
480	void
481	object::copy_to (object *dst)
482	{	494	{
483	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	495	bool is_freed = flag [FLAG_FREED];
484	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	496	bool is_removed = flag [FLAG_REMOVED];
485		497
486	(object_copy )dst = *this;	498	(object_copy )this = src;
487		499
488	if (is_freed)	500	flag [FLAG_FREED] = is_freed;
489	SET_FLAG (dst, FLAG_FREED);	501	flag [FLAG_REMOVED] = is_removed;
490
491	if (is_removed)
492	SET_FLAG (dst, FLAG_REMOVED);
493
494	if (speed < 0)
495	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
496		502
497	/* Copy over key_values, if any. */	503	/* Copy over key_values, if any. */
498	if (key_values)	504	if (src.key_values)
499	{	505	{
500	key_value *tail = 0;	506	key_value *tail = 0;
501	key_value *i;
502
503	dst->key_values = 0;	507	key_values = 0;
504		508
505	for (i = key_values; i; i = i->next)	509	for (key_value *i = src.key_values; i; i = i->next)
506	{	510	{
507	key_value *new_link = new key_value;	511	key_value *new_link = new key_value;
508		512
509	new_link->next = 0;	513	new_link->next = 0;
510	new_link->key = i->key;	514	new_link->key = i->key;
511	new_link->value = i->value;	515	new_link->value = i->value;
512		516
513	/* Try and be clever here, too. */	517	/* Try and be clever here, too. */
514	if (!dst->key_values)	518	if (!key_values)
515	{	519	{
516	dst->key_values = new_link;	520	key_values = new_link;
517	tail = new_link;	521	tail = new_link;
518	}	522	}
519	else	523	else
520	{	524	{
521	tail->next = new_link;	525	tail->next = new_link;
522	tail = new_link;	526	tail = new_link;
523	}	527	}
524	}	528	}
525	}	529	}
		530	}
		531
		532	/*
		533	* copy_to first frees everything allocated by the dst object,
		534	* and then copies the contents of itself into the second
		535	* object, allocating what needs to be allocated. Basically, any
		536	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		537	* if the first object is freed, the pointers in the new object
		538	* will point at garbage.
		539	*/
		540	void
		541	object::copy_to (object *dst)
		542	{
		543	dst = this;
		544
		545	if (speed < 0)
		546	dst->speed_left = speed_left - rndm ();
526		547
527	dst->set_speed (dst->speed);	548	dst->set_speed (dst->speed);
		549	}
		550
		551	void
		552	object::instantiate ()
		553	{
		554	if (!uuid.seq) // HACK
		555	uuid = gen_uuid ();
		556
		557	speed_left = -0.1f;
		558	/* copy the body_info to the body_used - this is only really
		559	* need for monsters, but doesn't hurt to do it for everything.
		560	* by doing so, when a monster is created, it has good starting
		561	* values for the body_used info, so when items are created
		562	* for it, they can be properly equipped.
		563	*/
		564	for (int i = NUM_BODY_LOCATIONS; i--; )
		565	slot[i].used = slot[i].info;
		566
		567	attachable::instantiate ();
528	}	568	}
529		569
530	object *	570	object *
531	object::clone ()	571	object::clone ()
532	{	572	{
…		…
590	* UP_OBJ_FACE: only the objects face has changed.	630	* UP_OBJ_FACE: only the objects face has changed.
591	*/	631	*/
592	void	632	void
593	update_object (object *op, int action)	633	update_object (object *op, int action)
594	{	634	{
595	MoveType move_on, move_off, move_block, move_slow;
596
597	if (op == NULL)	635	if (op == NULL)
598	{	636	{
599	/* this should never happen */	637	/* this should never happen */
600	LOG (llevDebug, "update_object() called for NULL object.\n");	638	LOG (llevDebug, "update_object() called for NULL object.\n");
601	return;	639	return;
…		…
661		699
662	if (op->more)	700	if (op->more)
663	update_object (op->more, action);	701	update_object (op->more, action);
664	}	702	}
665		703
666	object *object::first;
667
668	object::object ()	704	object::object ()
669	{	705	{
670	SET_FLAG (this, FLAG_REMOVED);	706	SET_FLAG (this, FLAG_REMOVED);
671		707
672	expmul = 1.0;	708	expmul = 1.0;
673	face = blank_face;	709	face = blank_face;
674	}	710	}
675		711
676	object::~object ()	712	object::~object ()
677	{	713	{
		714	unlink ();
		715
678	free_key_values (this);	716	free_key_values (this);
679	}	717	}
680		718
		719	static int object_count;
		720
681	void object::link ()	721	void object::link ()
682	{	722	{
683	count = ++ob_count;	723	assert (!index);//D
684	uuid = gen_uuid ();	724	uuid = gen_uuid ();
		725	count = ++object_count;
685		726
686	prev = 0;	727	refcnt_inc ();
687	next = object::first;	728	objects.insert (this);
688
689	if (object::first)
690	object::first->prev = this;
691
692	object::first = this;
693	}	729	}
694		730
695	void object::unlink ()	731	void object::unlink ()
696	{	732	{
697	if (this == object::first)	733	if (!index)
698	object::first = next;	734	return;
699		735
700	/* Remove this object from the list of used objects */	736	objects.erase (this);
701	if (prev) prev->next = next;	737	refcnt_dec ();
702	if (next) next->prev = prev;
703
704	prev = 0;
705	next = 0;
706	}
707
708	bool
709	object::active () const
710	{
711	return active_next \|\| active_prev \|\| this == active_objects;
712	}	738	}
713		739
714	void	740	void
715	object::activate ()	741	object::activate ()
716	{	742	{
717	/* If already on active list, don't do anything */	743	/* If already on active list, don't do anything */
718	if (active ())	744	if (active)
719	return;	745	return;
720		746
721	if (has_active_speed ())	747	if (has_active_speed ())
722	{	748	actives.insert (this);
723	/* process_events() expects us to insert the object at the beginning
724	* of the list. */
725	active_next = active_objects;
726
727	if (active_next)
728	active_next->active_prev = this;
729
730	active_objects = this;
731	}
732	}	749	}
733		750
734	void	751	void
735	object::activate_recursive ()	752	object::activate_recursive ()
736	{	753	{
…		…
750	*/	767	*/
751	void	768	void
752	object::deactivate ()	769	object::deactivate ()
753	{	770	{
754	/* If not on the active list, nothing needs to be done */	771	/* If not on the active list, nothing needs to be done */
755	if (!active ())	772	if (!active)
756	return;	773	return;
757		774
758	if (active_prev == 0)	775	actives.erase (this);
759	{
760	active_objects = active_next;
761	if (active_next)
762	active_next->active_prev = 0;
763	}
764	else
765	{
766	active_prev->active_next = active_next;
767	if (active_next)
768	active_next->active_prev = active_prev;
769	}
770
771	active_next = 0;
772	active_prev = 0;
773	}	776	}
774		777
775	void	778	void
776	object::deactivate_recursive ()	779	object::deactivate_recursive ()
777	{	780	{
…		…
811	* drop on that space.	814	* drop on that space.
812	*/	815	*/
813	if (!drop_to_ground	816	if (!drop_to_ground
814	\|\| !map	817	\|\| !map
815	\|\| map->in_memory != MAP_IN_MEMORY	818	\|\| map->in_memory != MAP_IN_MEMORY
		819	\|\| map->nodrop
816	\|\| ms ().move_block == MOVE_ALL)	820	\|\| ms ().move_block == MOVE_ALL)
817	{	821	{
818	while (inv)	822	while (inv)
819	{	823	{
820	inv->destroy_inv (drop_to_ground);	824	inv->destroy_inv (drop_to_ground);
…		…
829		833
830	if (op->flag [FLAG_STARTEQUIP]	834	if (op->flag [FLAG_STARTEQUIP]
831	\|\| op->flag [FLAG_NO_DROP]	835	\|\| op->flag [FLAG_NO_DROP]
832	\|\| op->type == RUNE	836	\|\| op->type == RUNE
833	\|\| op->type == TRAP	837	\|\| op->type == TRAP
834	\|\| op->flag [FLAG_IS_A_TEMPLATE])	838	\|\| op->flag [FLAG_IS_A_TEMPLATE]
		839	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
835	op->destroy ();	840	op->destroy ();
836	else	841	else
837	map->insert (op, x, y);	842	map->insert (op, x, y);
838	}	843	}
839	}	844	}
…		…
847	}	852	}
848		853
849	void	854	void
850	object::do_destroy ()	855	object::do_destroy ()
851	{	856	{
		857	attachable::do_destroy ();
		858
852	if (flag [FLAG_IS_LINKED])	859	if (flag [FLAG_IS_LINKED])
853	remove_button_link (this);	860	remove_button_link (this);
854		861
855	if (flag [FLAG_FRIENDLY])	862	if (flag [FLAG_FRIENDLY])
856	remove_friendly_object (this);	863	remove_friendly_object (this);
857		864
858	if (!flag [FLAG_REMOVED])	865	if (!flag [FLAG_REMOVED])
859	remove ();	866	remove ();
860		867
861	if (flag [FLAG_FREED])	868	destroy_inv (true);
862	return;
863		869
864	set_speed (0);	870	deactivate ();
		871	unlink ();
865		872
866	flag [FLAG_FREED] = 1;	873	flag [FLAG_FREED] = 1;
867
868	attachable::do_destroy ();
869
870	destroy_inv (true);
871	unlink ();
872		874
873	// hack to ensure that freed objects still have a valid map	875	// hack to ensure that freed objects still have a valid map
874	{	876	{
875	static maptile *freed_map; // freed objects are moved here to avoid crashes	877	static maptile *freed_map; // freed objects are moved here to avoid crashes
876		878
…		…
901		903
902	// clear those pointers that likely might have circular references to us	904	// clear those pointers that likely might have circular references to us
903	owner = 0;	905	owner = 0;
904	enemy = 0;	906	enemy = 0;
905	attacked_by = 0;	907	attacked_by = 0;
906
907	// only relevant for players(?), but make sure of it anyways
908	contr = 0;
909	}	908	}
910		909
911	void	910	void
912	object::destroy (bool destroy_inventory)	911	object::destroy (bool destroy_inventory)
913	{	912	{
…		…
941	* This function removes the object op from the linked list of objects	940	* This function removes the object op from the linked list of objects
942	* which it is currently tied to. When this function is done, the	941	* which it is currently tied to. When this function is done, the
943	* object will have no environment. If the object previously had an	942	* object will have no environment. If the object previously had an
944	* environment, the x and y coordinates will be updated to	943	* environment, the x and y coordinates will be updated to
945	* the previous environment.	944	* the previous environment.
946	* Beware: This function is called from the editor as well!
947	*/	945	*/
948	void	946	void
949	object::remove ()	947	object::do_remove ()
950	{	948	{
951	object tmp, last = 0;	949	object tmp, last = 0;
952	object *otmp;	950	object *otmp;
953		951
954	if (QUERY_FLAG (this, FLAG_REMOVED))	952	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
997	}	995	}
998	else if (map)	996	else if (map)
999	{	997	{
1000	if (type == PLAYER)	998	if (type == PLAYER)
1001	{	999	{
		1000	// leaving a spot always closes any open container on the ground
		1001	if (container && !container->env)
		1002	// this causes spurious floorbox updates, but it ensures
		1003	// that the CLOSE event is being sent.
		1004	close_container ();
		1005
1002	--map->players;	1006	--map->players;
1003	map->touch ();	1007	map->touch ();
1004	}	1008	}
1005		1009
1006	map->dirty = true;	1010	map->dirty = true;
		1011	mapspace &ms = this->ms ();
1007		1012
1008	/* link the object above us */	1013	/* link the object above us */
1009	if (above)	1014	if (above)
1010	above->below = below;	1015	above->below = below;
1011	else	1016	else
1012	map->at (x, y).top = below; /* we were top, set new top */	1017	ms.top = below; /* we were top, set new top */
1013		1018
1014	/* Relink the object below us, if there is one */	1019	/* Relink the object below us, if there is one */
1015	if (below)	1020	if (below)
1016	below->above = above;	1021	below->above = above;
1017	else	1022	else
…		…
1019	/* Nothing below, which means we need to relink map object for this space	1024	/* Nothing below, which means we need to relink map object for this space
1020	* use translated coordinates in case some oddness with map tiling is	1025	* use translated coordinates in case some oddness with map tiling is
1021	* evident	1026	* evident
1022	*/	1027	*/
1023	if (GET_MAP_OB (map, x, y) != this)	1028	if (GET_MAP_OB (map, x, y) != this)
1024	{
1025	char *dump = dump_object (this);
1026	LOG (llevError,
1027	"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);	1029	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 ());
1028	free (dump);
1029	dump = dump_object (GET_MAP_OB (map, x, y));
1030	LOG (llevError, "%s\n", dump);
1031	free (dump);
1032	}
1033		1030
1034	map->at (x, y).bot = above; /* goes on above it. */	1031	ms.bot = above; /* goes on above it. */
1035	}	1032	}
1036		1033
1037	above = 0;	1034	above = 0;
1038	below = 0;	1035	below = 0;
1039		1036
1040	if (map->in_memory == MAP_SAVING)	1037	if (map->in_memory == MAP_SAVING)
1041	return;	1038	return;
1042		1039
1043	int check_walk_off = !flag [FLAG_NO_APPLY];	1040	int check_walk_off = !flag [FLAG_NO_APPLY];
1044		1041
1045	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1042	for (tmp = ms.bot; tmp; tmp = tmp->above)
1046	{	1043	{
1047	/* No point updating the players look faces if he is the object	1044	/* No point updating the players look faces if he is the object
1048	* being removed.	1045	* being removed.
1049	*/	1046	*/
1050		1047
…		…
1130	}	1127	}
1131		1128
1132	return 0;	1129	return 0;
1133	}	1130	}
1134		1131
		1132	void
		1133	object::expand_tail ()
		1134	{
		1135	if (more)
		1136	return;
		1137
		1138	object *prev = this;
		1139
		1140	for (archetype *at = arch->more; at; at = at->more)
		1141	{
		1142	object *op = arch_to_object (at);
		1143
		1144	op->name = name;
		1145	op->name_pl = name_pl;
		1146	op->title = title;
		1147
		1148	op->head = this;
		1149	prev->more = op;
		1150
		1151	prev = op;
		1152	}
		1153	}
		1154
1135	/*	1155	/*
1136	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1156	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1137	* job preparing multi-part monsters	1157	* job preparing multi-part monsters.
1138	*/	1158	*/
1139	object *	1159	object *
1140	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1160	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1141	{	1161	{
1142	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1162	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
…		…
1169	* just 'op' otherwise	1189	* just 'op' otherwise
1170	*/	1190	*/
1171	object *	1191	object *
1172	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1192	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1173	{	1193	{
		1194	assert (!op->flag [FLAG_FREED]);
		1195
1174	object tmp, top, *floor = NULL;	1196	object tmp, top, *floor = NULL;
1175	sint16 x, y;
1176		1197
1177	if (QUERY_FLAG (op, FLAG_FREED))	1198	op->remove ();
1178	{
1179	LOG (llevError, "Trying to insert freed object!\n");
1180	return NULL;
1181	}
1182		1199
1183	if (!m)	1200	#if 0
1184	{	1201	if (!m->active != !op->active)
1185	char *dump = dump_object (op);	1202	if (m->active)
1186	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1203	op->activate_recursive ();
1187	free (dump);	1204	else
1188	return op;	1205	op->deactivate_recursive ();
1189	}	1206	#endif
1190		1207
1191	if (out_of_map (m, op->x, op->y))	1208	if (out_of_map (m, op->x, op->y))
1192	{	1209	{
1193	char *dump = dump_object (op);
1194	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);	1210	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1195	#ifdef MANY_CORES	1211	#ifdef MANY_CORES
1196	/* Better to catch this here, as otherwise the next use of this object	1212	/* Better to catch this here, as otherwise the next use of this object
1197	* is likely to cause a crash. Better to find out where it is getting	1213	* is likely to cause a crash. Better to find out where it is getting
1198	* improperly inserted.	1214	* improperly inserted.
1199	*/	1215	*/
1200	abort ();	1216	abort ();
1201	#endif	1217	#endif
1202	free (dump);
1203	return op;	1218	return op;
1204	}	1219	}
1205		1220
1206	if (!QUERY_FLAG (op, FLAG_REMOVED))
1207	{
1208	char *dump = dump_object (op);
1209	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1210	free (dump);
1211	return op;
1212	}
1213
1214	if (op->more)
1215	{
1216	/* The part may be on a different map. */
1217
1218	object *more = op->more;	1221	if (object *more = op->more)
1219		1222	{
1220	/* We really need the caller to normalise coordinates - if
1221	* we set the map, that doesn't work if the location is within
1222	* a map and this is straddling an edge. So only if coordinate
1223	* is clear wrong do we normalise it.
1224	*/
1225	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1226	more->map = get_map_from_coord (m, &more->x, &more->y);
1227	else if (!more->map)
1228	{
1229	/* For backwards compatibility - when not dealing with tiled maps,
1230	* more->map should always point to the parent.
1231	*/
1232	more->map = m;
1233	}
1234
1235	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1223	if (!insert_ob_in_map (more, m, originator, flag))
1236	{	1224	{
1237	if (!op->head)	1225	if (!op->head)
1238	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1226	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1239		1227
1240	return 0;	1228	return 0;
…		…
1245		1233
1246	/* Ideally, the caller figures this out. However, it complicates a lot	1234	/* Ideally, the caller figures this out. However, it complicates a lot
1247	* of areas of callers (eg, anything that uses find_free_spot would now	1235	* of areas of callers (eg, anything that uses find_free_spot would now
1248	* need extra work	1236	* need extra work
1249	*/	1237	*/
1250	op->map = get_map_from_coord (m, &op->x, &op->y);	1238	if (!xy_normalise (m, op->x, op->y))
1251	x = op->x;	1239	return 0;
1252	y = op->y;	1240
		1241	op->map = m;
		1242	mapspace &ms = op->ms ();
1253		1243
1254	/* this has to be done after we translate the coordinates.	1244	/* this has to be done after we translate the coordinates.
1255	*/	1245	*/
1256	if (op->nrof && !(flag & INS_NO_MERGE))	1246	if (op->nrof && !(flag & INS_NO_MERGE))
1257	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1247	for (tmp = ms.bot; tmp; tmp = tmp->above)
1258	if (object::can_merge (op, tmp))	1248	if (object::can_merge (op, tmp))
1259	{	1249	{
1260	op->nrof += tmp->nrof;	1250	op->nrof += tmp->nrof;
1261	tmp->destroy ();	1251	tmp->destroy ();
1262	}	1252	}
…		…
1279	op->below = originator->below;	1269	op->below = originator->below;
1280		1270
1281	if (op->below)	1271	if (op->below)
1282	op->below->above = op;	1272	op->below->above = op;
1283	else	1273	else
1284	op->ms ().bot = op;	1274	ms.bot = op;
1285		1275
1286	/* since below originator, no need to update top */	1276	/* since below originator, no need to update top */
1287	originator->below = op;	1277	originator->below = op;
1288	}	1278	}
1289	else	1279	else
1290	{	1280	{
		1281	top = ms.bot;
		1282
1291	/* If there are other objects, then */	1283	/* If there are other objects, then */
1292	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1284	if ((!(flag & INS_MAP_LOAD)) && top)
1293	{	1285	{
1294	object *last = 0;	1286	object *last = 0;
1295		1287
1296	/*	1288	/*
1297	* If there are multiple objects on this space, we do some trickier handling.	1289	* If there are multiple objects on this space, we do some trickier handling.
…		…
1303	* once we get to them. This reduces the need to traverse over all of	1295	* once we get to them. This reduces the need to traverse over all of
1304	* them when adding another one - this saves quite a bit of cpu time	1296	* them when adding another one - this saves quite a bit of cpu time
1305	* when lots of spells are cast in one area. Currently, it is presumed	1297	* when lots of spells are cast in one area. Currently, it is presumed
1306	* that flying non pickable objects are spell objects.	1298	* that flying non pickable objects are spell objects.
1307	*/	1299	*/
1308	while (top)	1300	for (top = ms.bot; top; top = top->above)
1309	{	1301	{
1310	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1302	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1311	floor = top;	1303	floor = top;
1312		1304
1313	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1305	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1316	top = top->below;	1308	top = top->below;
1317	break;	1309	break;
1318	}	1310	}
1319		1311
1320	last = top;	1312	last = top;
1321	top = top->above;
1322	}	1313	}
1323		1314
1324	/* Don't want top to be NULL, so set it to the last valid object */	1315	/* Don't want top to be NULL, so set it to the last valid object */
1325	top = last;	1316	top = last;
1326		1317
…		…
1328	* looks like instead of lots of conditions here.	1319	* looks like instead of lots of conditions here.
1329	* makes things faster, and effectively the same result.	1320	* makes things faster, and effectively the same result.
1330	*/	1321	*/
1331		1322
1332	/* Have object 'fall below' other objects that block view.	1323	/* Have object 'fall below' other objects that block view.
1333	* Unless those objects are exits, type 66	1324	* Unless those objects are exits.
1334	* If INS_ON_TOP is used, don't do this processing	1325	* If INS_ON_TOP is used, don't do this processing
1335	* Need to find the object that in fact blocks view, otherwise	1326	* Need to find the object that in fact blocks view, otherwise
1336	* stacking is a bit odd.	1327	* stacking is a bit odd.
1337	*/	1328	*/
1338	if (!(flag & INS_ON_TOP) &&	1329	if (!(flag & INS_ON_TOP)
1339	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1330	&& ms.flags () & P_BLOCKSVIEW
		1331	&& (op->face && !faces [op->face].visibility))
1340	{	1332	{
1341	for (last = top; last != floor; last = last->below)	1333	for (last = top; last != floor; last = last->below)
1342	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1334	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1343	break;	1335	break;
		1336
1344	/* Check to see if we found the object that blocks view,	1337	/* Check to see if we found the object that blocks view,
1345	* and make sure we have a below pointer for it so that	1338	* and make sure we have a below pointer for it so that
1346	* we can get inserted below this one, which requires we	1339	* we can get inserted below this one, which requires we
1347	* set top to the object below us.	1340	* set top to the object below us.
1348	*/	1341	*/
…		…
1350	top = last->below;	1343	top = last->below;
1351	}	1344	}
1352	} /* If objects on this space */	1345	} /* If objects on this space */
1353		1346
1354	if (flag & INS_MAP_LOAD)	1347	if (flag & INS_MAP_LOAD)
1355	top = GET_MAP_TOP (op->map, op->x, op->y);	1348	top = ms.top;
1356		1349
1357	if (flag & INS_ABOVE_FLOOR_ONLY)	1350	if (flag & INS_ABOVE_FLOOR_ONLY)
1358	top = floor;	1351	top = floor;
1359		1352
1360	/* Top is the object that our object (op) is going to get inserted above.	1353	/* Top is the object that our object (op) is going to get inserted above.
1361	*/	1354	*/
1362		1355
1363	/* First object on this space */	1356	/* First object on this space */
1364	if (!top)	1357	if (!top)
1365	{	1358	{
1366	op->above = GET_MAP_OB (op->map, op->x, op->y);	1359	op->above = ms.bot;
1367		1360
1368	if (op->above)	1361	if (op->above)
1369	op->above->below = op;	1362	op->above->below = op;
1370		1363
1371	op->below = 0;	1364	op->below = 0;
1372	op->ms ().bot = op;	1365	ms.bot = op;
1373	}	1366	}
1374	else	1367	else
1375	{ /* get inserted into the stack above top */	1368	{ /* get inserted into the stack above top */
1376	op->above = top->above;	1369	op->above = top->above;
1377		1370
…		…
1381	op->below = top;	1374	op->below = top;
1382	top->above = op;	1375	top->above = op;
1383	}	1376	}
1384		1377
1385	if (!op->above)	1378	if (!op->above)
1386	op->ms ().top = op;	1379	ms.top = op;
1387	} /* else not INS_BELOW_ORIGINATOR */	1380	} /* else not INS_BELOW_ORIGINATOR */
1388		1381
1389	if (op->type == PLAYER)	1382	if (op->type == PLAYER)
1390	{	1383	{
1391	op->contr->do_los = 1;	1384	op->contr->do_los = 1;
…		…
1397		1390
1398	/* If we have a floor, we know the player, if any, will be above	1391	/* If we have a floor, we know the player, if any, will be above
1399	* it, so save a few ticks and start from there.	1392	* it, so save a few ticks and start from there.
1400	*/	1393	*/
1401	if (!(flag & INS_MAP_LOAD))	1394	if (!(flag & INS_MAP_LOAD))
1402	if (object *pl = op->ms ().player ())	1395	if (object *pl = ms.player ())
1403	if (pl->contr->ns)	1396	if (pl->contr->ns)
1404	pl->contr->ns->floorbox_update ();	1397	pl->contr->ns->floorbox_update ();
1405		1398
1406	/* If this object glows, it may affect lighting conditions that are	1399	/* If this object glows, it may affect lighting conditions that are
1407	* visible to others on this map. But update_all_los is really	1400	* visible to others on this map. But update_all_los is really
…		…
1469	}	1462	}
1470		1463
1471	object *	1464	object *
1472	object::insert_at (object where, object originator, int flags)	1465	object::insert_at (object where, object originator, int flags)
1473	{	1466	{
1474	where->map->insert (this, where->x, where->y, originator, flags);	1467	return where->map->insert (this, where->x, where->y, originator, flags);
1475	}	1468	}
1476		1469
1477	/*	1470	/*
1478	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1471	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1479	* is returned contains nr objects, and the remaining parts contains	1472	* is returned contains nr objects, and the remaining parts contains
…		…
1519	* the amount of an object. If the amount reaches 0, the object	1512	* the amount of an object. If the amount reaches 0, the object
1520	* is subsequently removed and freed.	1513	* is subsequently removed and freed.
1521	*	1514	*
1522	* Return value: 'op' if something is left, NULL if the amount reached 0	1515	* Return value: 'op' if something is left, NULL if the amount reached 0
1523	*/	1516	*/
1524
1525	object *	1517	object *
1526	decrease_ob_nr (object *op, uint32 i)	1518	decrease_ob_nr (object *op, uint32 i)
1527	{	1519	{
1528	object *tmp;	1520	object *tmp;
1529		1521
…		…
1604		1596
1605	/*	1597	/*
1606	* add_weight(object, weight) adds the specified weight to an object,	1598	* add_weight(object, weight) adds the specified weight to an object,
1607	* and also updates how much the environment(s) is/are carrying.	1599	* and also updates how much the environment(s) is/are carrying.
1608	*/	1600	*/
1609
1610	void	1601	void
1611	add_weight (object *op, signed long weight)	1602	add_weight (object *op, signed long weight)
1612	{	1603	{
1613	while (op != NULL)	1604	while (op != NULL)
1614	{	1605	{
…		…
1646	* inside the object environment.	1637	* inside the object environment.
1647	*	1638	*
1648	* The function returns now pointer to inserted item, and return value can	1639	* The function returns now pointer to inserted item, and return value can
1649	* be != op, if items are merged. -Tero	1640	* be != op, if items are merged. -Tero
1650	*/	1641	*/
1651
1652	object *	1642	object *
1653	object::insert (object *op)	1643	object::insert (object *op)
1654	{	1644	{
1655	object tmp, otmp;	1645	object tmp, otmp;
1656		1646
…		…
1816	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1806	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1817	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1807	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1818	{	1808	{
1819		1809
1820	float	1810	float
1821	diff = tmp->move_slow_penalty * FABS (op->speed);	1811	diff = tmp->move_slow_penalty * fabs (op->speed);
1822		1812
1823	if (op->type == PLAYER)	1813	if (op->type == PLAYER)
1824	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1814	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|
1825	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1815	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1826	diff /= 4.0;	1816	diff /= 4.0;
…		…
2033	}	2023	}
2034		2024
2035	if (!index)	2025	if (!index)
2036	return -1;	2026	return -1;
2037		2027
2038	return altern[RANDOM () % index];	2028	return altern [rndm (index)];
2039	}	2029	}
2040		2030
2041	/*	2031	/*
2042	* find_first_free_spot(archetype, maptile, x, y) works like	2032	* find_first_free_spot(archetype, maptile, x, y) works like
2043	* find_free_spot(), but it will search max number of squares.	2033	* find_free_spot(), but it will search max number of squares.
…		…
2064	{	2054	{
2065	arr += begin;	2055	arr += begin;
2066	end -= begin;	2056	end -= begin;
2067		2057
2068	while (--end)	2058	while (--end)
2069	swap (arr [end], arr [RANDOM () % (end + 1)]);	2059	swap (arr [end], arr [rndm (end + 1)]);
2070	}	2060	}
2071		2061
2072	/* new function to make monster searching more efficient, and effective!	2062	/* new function to make monster searching more efficient, and effective!
2073	* This basically returns a randomized array (in the passed pointer) of	2063	* This basically returns a randomized array (in the passed pointer) of
2074	* the spaces to find monsters. In this way, it won't always look for	2064	* the spaces to find monsters. In this way, it won't always look for
…		…
2208		2198
2209	return 3;	2199	return 3;
2210	}	2200	}
2211		2201
2212	/*	2202	/*
2213	* absdir(int): Returns a number between 1 and 8, which represent
2214	* the "absolute" direction of a number (it actually takes care of
2215	* "overflow" in previous calculations of a direction).
2216	*/
2217
2218	int
2219	absdir (int d)
2220	{
2221	while (d < 1)
2222	d += 8;
2223
2224	while (d > 8)
2225	d -= 8;
2226
2227	return d;
2228	}
2229
2230	/*
2231	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2203	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2232	* between two directions (which are expected to be absolute (see absdir())	2204	* between two directions (which are expected to be absolute (see absdir())
2233	*/	2205	*/
2234
2235	int	2206	int
2236	dirdiff (int dir1, int dir2)	2207	dirdiff (int dir1, int dir2)
2237	{	2208	{
2238	int d;	2209	int d;
2239		2210
…		…
2405	insert_ob_in_ob (object_create_clone (item), dst);	2376	insert_ob_in_ob (object_create_clone (item), dst);
2406		2377
2407	return dst;	2378	return dst;
2408	}	2379	}
2409		2380
2410	/* GROS - Creates an object using a string representing its content. */
2411	/* Basically, we save the content of the string to a temp file, then call */
2412	/* load_object on it. I admit it is a highly inefficient way to make things, */
2413	/* but it was simple to make and allows reusing the load_object function. */
2414	/* Remember not to use load_object_str in a time-critical situation. */
2415	/* Also remember that multiparts objects are not supported for now. */
2416	object *
2417	load_object_str (const char *obstr)
2418	{
2419	object *op;
2420	char filename[MAX_BUF];
2421
2422	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2423
2424	FILE *tempfile = fopen (filename, "w");
2425
2426	if (tempfile == NULL)
2427	{
2428	LOG (llevError, "Error - Unable to access load object temp file\n");
2429	return NULL;
2430	}
2431
2432	fprintf (tempfile, obstr);
2433	fclose (tempfile);
2434
2435	op = object::create ();
2436
2437	object_thawer thawer (filename);
2438
2439	if (thawer)
2440	load_object (thawer, op, 0);
2441
2442	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2443	CLEAR_FLAG (op, FLAG_REMOVED);
2444
2445	return op;
2446	}
2447
2448	/* This returns the first object in who's inventory that	2381	/* This returns the first object in who's inventory that
2449	* has the same type and subtype match.	2382	* has the same type and subtype match.
2450	* returns NULL if no match.	2383	* returns NULL if no match.
2451	*/	2384	*/
2452	object *	2385	object *
…		…
2505	if (link->key == canonical_key)	2438	if (link->key == canonical_key)
2506	return link->value;	2439	return link->value;
2507		2440
2508	return 0;	2441	return 0;
2509	}	2442	}
2510
2511		2443
2512	/*	2444	/*
2513	* Updates the canonical_key in op to value.	2445	* Updates the canonical_key in op to value.
2514	*	2446	*
2515	* canonical_key is a shared string (value doesn't have to be).	2447	* canonical_key is a shared string (value doesn't have to be).
…		…
2655	{	2587	{
2656	char flagdesc[512];	2588	char flagdesc[512];
2657	char info2[256 * 4];	2589	char info2[256 * 4];
2658	char *p = info;	2590	char *p = info;
2659		2591
2660	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",	2592	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2661	count, uuid.seq,	2593	count, uuid.seq,
2662	&name,	2594	&name,
2663	title ? "\",title:" : "",	2595	title ? "\",title:\"" : "",
2664	title ? (const char *)title : "",	2596	title ? (const char *)title : "",
2665	flag_desc (flagdesc, 512), type);	2597	flag_desc (flagdesc, 512), type);
2666		2598
2667	if (env)	2599	if (env)
2668	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2600	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
…		…
2674	}	2606	}
2675		2607
2676	const char *	2608	const char *
2677	object::debug_desc () const	2609	object::debug_desc () const
2678	{	2610	{
2679	static char info[256 * 4];	2611	static char info[3][256 * 4];
		2612	static int info_idx;
		2613
2680	return debug_desc (info);	2614	return debug_desc (info [++info_idx % 3]);
2681	}	2615	}
2682		2616
		2617	struct region *
		2618	object::region () const
		2619	{
		2620	return map ? map->region (x, y)
		2621	: region::default_region ();
		2622	}
		2623
		2624	const materialtype_t *
		2625	object::dominant_material () const
		2626	{
		2627	if (materialtype_t *mat = name_to_material (materialname))
		2628	return mat;
		2629
		2630	// omfg this is slow, this has to be temporary :)
		2631	shstr unknown ("unknown");
		2632
		2633	return name_to_material (unknown);
		2634	}
		2635
		2636	void
		2637	object::open_container (object *new_container)
		2638	{
		2639	if (container == new_container)
		2640	return;
		2641
		2642	if (object *old_container = container)
		2643	{
		2644	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2645	return;
		2646
		2647	#if 0
		2648	// remove the "Close old_container" object.
		2649	if (object *closer = old_container->inv)
		2650	if (closer->type == CLOSE_CON)
		2651	closer->destroy ();
		2652	#endif
		2653
		2654	old_container->flag [FLAG_APPLIED] = 0;
		2655	container = 0;
		2656
		2657	esrv_update_item (UPD_FLAGS, this, old_container);
		2658	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2659	}
		2660
		2661	if (new_container)
		2662	{
		2663	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2664	return;
		2665
		2666	// TODO: this does not seem to serve any purpose anymore?
		2667	#if 0
		2668	// insert the "Close Container" object.
		2669	if (archetype *closer = new_container->other_arch)
		2670	{
		2671	object *closer = arch_to_object (new_container->other_arch);
		2672	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2673	new_container->insert (closer);
		2674	}
		2675	#endif
		2676
		2677	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2678
		2679	new_container->flag [FLAG_APPLIED] = 1;
		2680	container = new_container;
		2681
		2682	esrv_update_item (UPD_FLAGS, this, new_container);
		2683	esrv_send_inventory (this, new_container);
		2684	}
		2685	}
		2686
		2687

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.107 by pippijn, Sat Jan 6 14:42:29 2007 UTC vs. Revision 1.146 by root, Fri May 11 21:07:13 2007 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.107 by pippijn, Sat Jan 6 14:42:29 2007 UTC vs.
Revision 1.146 by root, Fri May 11 21:07:13 2007 UTC