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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.104 by root, Tue Jan 2 21:13:21 2007 UTC vs.
Revision 1.139 by root, Sat Apr 21 17:34:22 2007 UTC

…		…
1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* CrossFire, A Multiplayer game for X-windows
3		3	*
		4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (C) 2001 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (C) 1992 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* This program is free software; you can redistribute it and/or modify
8	it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation; either version 2 of the License, or
10	(at your option) any later version.	11	* (at your option) any later version.
11		12	*
12	This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
18	along with this program; if not, write to the Free Software	19	* along with this program; if not, write to the Free Software
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20		21	*
21	The authors can be reached via e-mail at <crossfire@schmorp.de>	22	* The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	23	*/
23		24
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying	26	sub/add_weight will transcend the environment updating the carrying
26	variable. */	27	variable. */
27	#include <global.h>	28	#include <global.h>
36		37
37	int nrofallocobjects = 0;	38	int nrofallocobjects = 0;
38	static UUID uuid;	39	static UUID uuid;
39	const uint64 UUID_SKIP = 1<<19;	40	const uint64 UUID_SKIP = 1<<19;
40		41
41	object active_objects; / List of active objects that need to be processed */	42	objectvec objects;
		43	activevec actives;
42		44
43	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	45	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
44	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	46	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
45	};	47	};
46	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	48	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
…		…
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	{
…		…
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->below)	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])
		840	{
845	remove_friendly_object (this);	841	remove_friendly_object (this);
		842
		843	if (type == GOLEM
		844	&& owner
		845	&& owner->type == PLAYER
		846	&& owner->contr->ranges[range_golem] == this)
		847	owner->contr->ranges[range_golem] = 0;
		848	}
846		849
847	if (!flag [FLAG_REMOVED])	850	if (!flag [FLAG_REMOVED])
848	remove ();	851	remove ();
849		852
850	if (flag [FLAG_FREED])	853	destroy_inv (true);
851	return;
852		854
853	set_speed (0);	855	deactivate ();
		856	unlink ();
854		857
855	flag [FLAG_FREED] = 1;	858	flag [FLAG_FREED] = 1;
856
857	attachable::do_destroy ();
858
859	destroy_inv (true);
860	unlink ();
861		859
862	// hack to ensure that freed objects still have a valid map	860	// hack to ensure that freed objects still have a valid map
863	{	861	{
864	static maptile *freed_map; // freed objects are moved here to avoid crashes	862	static maptile *freed_map; // freed objects are moved here to avoid crashes
865		863
…		…
890		888
891	// clear those pointers that likely might have circular references to us	889	// clear those pointers that likely might have circular references to us
892	owner = 0;	890	owner = 0;
893	enemy = 0;	891	enemy = 0;
894	attacked_by = 0;	892	attacked_by = 0;
895
896	// only relevant for players(?), but make sure of it anyways
897	contr = 0;
898	}	893	}
899		894
900	void	895	void
901	object::destroy (bool destroy_inventory)	896	object::destroy (bool destroy_inventory)
902	{	897	{
…		…
930	* This function removes the object op from the linked list of objects	925	* This function removes the object op from the linked list of objects
931	* which it is currently tied to. When this function is done, the	926	* which it is currently tied to. When this function is done, the
932	* object will have no environment. If the object previously had an	927	* object will have no environment. If the object previously had an
933	* environment, the x and y coordinates will be updated to	928	* environment, the x and y coordinates will be updated to
934	* the previous environment.	929	* the previous environment.
935	* Beware: This function is called from the editor as well!
936	*/	930	*/
937	void	931	void
938	object::remove ()	932	object::do_remove ()
939	{	933	{
940	object tmp, last = 0;	934	object tmp, last = 0;
941	object *otmp;	935	object *otmp;
942		936
943	if (QUERY_FLAG (this, FLAG_REMOVED))	937	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
986	}	980	}
987	else if (map)	981	else if (map)
988	{	982	{
989	if (type == PLAYER)	983	if (type == PLAYER)
990	{	984	{
		985	// leaving a spot always closes any open container on the ground
		986	if (container && !container->env)
		987	// this causes spurious floorbox updates, but it ensures
		988	// that the CLOSE event is being sent.
		989	close_container ();
		990
991	--map->players;	991	--map->players;
992	map->touch ();	992	map->touch ();
993	}	993	}
994		994
995	map->dirty = true;	995	map->dirty = true;
		996	mapspace &ms = this->ms ();
996		997
997	/* link the object above us */	998	/* link the object above us */
998	if (above)	999	if (above)
999	above->below = below;	1000	above->below = below;
1000	else	1001	else
1001	map->at (x, y).top = below; /* we were top, set new top */	1002	ms.top = below; /* we were top, set new top */
1002		1003
1003	/* Relink the object below us, if there is one */	1004	/* Relink the object below us, if there is one */
1004	if (below)	1005	if (below)
1005	below->above = above;	1006	below->above = above;
1006	else	1007	else
…		…
1008	/* Nothing below, which means we need to relink map object for this space	1009	/* Nothing below, which means we need to relink map object for this space
1009	* use translated coordinates in case some oddness with map tiling is	1010	* use translated coordinates in case some oddness with map tiling is
1010	* evident	1011	* evident
1011	*/	1012	*/
1012	if (GET_MAP_OB (map, x, y) != this)	1013	if (GET_MAP_OB (map, x, y) != this)
1013	{
1014	char *dump = dump_object (this);
1015	LOG (llevError,
1016	"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);	1014	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 ());
1017	free (dump);
1018	dump = dump_object (GET_MAP_OB (map, x, y));
1019	LOG (llevError, "%s\n", dump);
1020	free (dump);
1021	}
1022		1015
1023	map->at (x, y).bot = above; /* goes on above it. */	1016	ms.bot = above; /* goes on above it. */
1024	}	1017	}
1025		1018
1026	above = 0;	1019	above = 0;
1027	below = 0;	1020	below = 0;
1028		1021
1029	if (map->in_memory == MAP_SAVING)	1022	if (map->in_memory == MAP_SAVING)
1030	return;	1023	return;
1031		1024
1032	int check_walk_off = !flag [FLAG_NO_APPLY];	1025	int check_walk_off = !flag [FLAG_NO_APPLY];
1033		1026
1034	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1027	for (tmp = ms.bot; tmp; tmp = tmp->above)
1035	{	1028	{
1036	/* No point updating the players look faces if he is the object	1029	/* No point updating the players look faces if he is the object
1037	* being removed.	1030	* being removed.
1038	*/	1031	*/
1039		1032
…		…
1119	}	1112	}
1120		1113
1121	return 0;	1114	return 0;
1122	}	1115	}
1123		1116
		1117	void
		1118	object::expand_tail ()
		1119	{
		1120	if (more)
		1121	return;
		1122
		1123	object *prev = this;
		1124
		1125	for (archetype *at = arch->more; at; at = at->more)
		1126	{
		1127	object *op = arch_to_object (at);
		1128
		1129	op->name = name;
		1130	op->name_pl = name_pl;
		1131	op->title = title;
		1132
		1133	op->head = this;
		1134	prev->more = op;
		1135
		1136	prev = op;
		1137	}
		1138	}
		1139
1124	/*	1140	/*
1125	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1141	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1126	* job preparing multi-part monsters	1142	* job preparing multi-part monsters.
1127	*/	1143	*/
1128	object *	1144	object *
1129	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1145	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1130	{	1146	{
1131	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1147	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
…		…
1158	* just 'op' otherwise	1174	* just 'op' otherwise
1159	*/	1175	*/
1160	object *	1176	object *
1161	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1177	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1162	{	1178	{
		1179	assert (!op->flag [FLAG_FREED]);
		1180
1163	object tmp, top, *floor = NULL;	1181	object tmp, top, *floor = NULL;
1164	sint16 x, y;
1165		1182
1166	if (QUERY_FLAG (op, FLAG_FREED))	1183	op->remove ();
1167	{
1168	LOG (llevError, "Trying to insert freed object!\n");
1169	return NULL;
1170	}
1171		1184
1172	if (!m)	1185	#if 0
1173	{	1186	if (!m->active != !op->active)
1174	char *dump = dump_object (op);	1187	if (m->active)
1175	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1188	op->activate_recursive ();
1176	free (dump);	1189	else
1177	return op;	1190	op->deactivate_recursive ();
1178	}	1191	#endif
1179		1192
1180	if (out_of_map (m, op->x, op->y))	1193	if (out_of_map (m, op->x, op->y))
1181	{	1194	{
1182	char *dump = dump_object (op);
1183	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);	1195	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1184	#ifdef MANY_CORES	1196	#ifdef MANY_CORES
1185	/* Better to catch this here, as otherwise the next use of this object	1197	/* Better to catch this here, as otherwise the next use of this object
1186	* is likely to cause a crash. Better to find out where it is getting	1198	* is likely to cause a crash. Better to find out where it is getting
1187	* improperly inserted.	1199	* improperly inserted.
1188	*/	1200	*/
1189	abort ();	1201	abort ();
1190	#endif	1202	#endif
1191	free (dump);
1192	return op;	1203	return op;
1193	}	1204	}
1194		1205
1195	if (!QUERY_FLAG (op, FLAG_REMOVED))
1196	{
1197	char *dump = dump_object (op);
1198	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1199	free (dump);
1200	return op;
1201	}
1202
1203	if (op->more)
1204	{
1205	/* The part may be on a different map. */
1206
1207	object *more = op->more;	1206	if (object *more = op->more)
1208		1207	{
1209	/* We really need the caller to normalize coordinates - if
1210	* we set the map, that doesn't work if the location is within
1211	* a map and this is straddling an edge. So only if coordinate
1212	* is clear wrong do we normalize it.
1213	*/
1214	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1215	more->map = get_map_from_coord (m, &more->x, &more->y);
1216	else if (!more->map)
1217	{
1218	/* For backwards compatibility - when not dealing with tiled maps,
1219	* more->map should always point to the parent.
1220	*/
1221	more->map = m;
1222	}
1223
1224	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1208	if (!insert_ob_in_map (more, m, originator, flag))
1225	{	1209	{
1226	if (!op->head)	1210	if (!op->head)
1227	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1211	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1228		1212
1229	return 0;	1213	return 0;
…		…
1234		1218
1235	/* Ideally, the caller figures this out. However, it complicates a lot	1219	/* Ideally, the caller figures this out. However, it complicates a lot
1236	* of areas of callers (eg, anything that uses find_free_spot would now	1220	* of areas of callers (eg, anything that uses find_free_spot would now
1237	* need extra work	1221	* need extra work
1238	*/	1222	*/
1239	op->map = get_map_from_coord (m, &op->x, &op->y);	1223	if (!xy_normalise (m, op->x, op->y))
1240	x = op->x;	1224	return 0;
1241	y = op->y;	1225
		1226	op->map = m;
		1227	mapspace &ms = op->ms ();
1242		1228
1243	/* this has to be done after we translate the coordinates.	1229	/* this has to be done after we translate the coordinates.
1244	*/	1230	*/
1245	if (op->nrof && !(flag & INS_NO_MERGE))	1231	if (op->nrof && !(flag & INS_NO_MERGE))
1246	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1232	for (tmp = ms.bot; tmp; tmp = tmp->above)
1247	if (object::can_merge (op, tmp))	1233	if (object::can_merge (op, tmp))
1248	{	1234	{
1249	op->nrof += tmp->nrof;	1235	op->nrof += tmp->nrof;
1250	tmp->destroy ();	1236	tmp->destroy ();
1251	}	1237	}
…		…
1268	op->below = originator->below;	1254	op->below = originator->below;
1269		1255
1270	if (op->below)	1256	if (op->below)
1271	op->below->above = op;	1257	op->below->above = op;
1272	else	1258	else
1273	op->ms ().bot = op;	1259	ms.bot = op;
1274		1260
1275	/* since below originator, no need to update top */	1261	/* since below originator, no need to update top */
1276	originator->below = op;	1262	originator->below = op;
1277	}	1263	}
1278	else	1264	else
1279	{	1265	{
		1266	top = ms.bot;
		1267
1280	/* If there are other objects, then */	1268	/* If there are other objects, then */
1281	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1269	if ((!(flag & INS_MAP_LOAD)) && top)
1282	{	1270	{
1283	object *last = 0;	1271	object *last = 0;
1284		1272
1285	/*	1273	/*
1286	* If there are multiple objects on this space, we do some trickier handling.	1274	* If there are multiple objects on this space, we do some trickier handling.
…		…
1292	* once we get to them. This reduces the need to traverse over all of	1280	* once we get to them. This reduces the need to traverse over all of
1293	* them when adding another one - this saves quite a bit of cpu time	1281	* them when adding another one - this saves quite a bit of cpu time
1294	* when lots of spells are cast in one area. Currently, it is presumed	1282	* when lots of spells are cast in one area. Currently, it is presumed
1295	* that flying non pickable objects are spell objects.	1283	* that flying non pickable objects are spell objects.
1296	*/	1284	*/
1297	while (top)	1285	for (top = ms.bot; top; top = top->above)
1298	{	1286	{
1299	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1287	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1300	floor = top;	1288	floor = top;
1301		1289
1302	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1290	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1305	top = top->below;	1293	top = top->below;
1306	break;	1294	break;
1307	}	1295	}
1308		1296
1309	last = top;	1297	last = top;
1310	top = top->above;
1311	}	1298	}
1312		1299
1313	/* Don't want top to be NULL, so set it to the last valid object */	1300	/* Don't want top to be NULL, so set it to the last valid object */
1314	top = last;	1301	top = last;
1315		1302
…		…
1317	* looks like instead of lots of conditions here.	1304	* looks like instead of lots of conditions here.
1318	* makes things faster, and effectively the same result.	1305	* makes things faster, and effectively the same result.
1319	*/	1306	*/
1320		1307
1321	/* Have object 'fall below' other objects that block view.	1308	/* Have object 'fall below' other objects that block view.
1322	* Unless those objects are exits, type 66	1309	* Unless those objects are exits.
1323	* If INS_ON_TOP is used, don't do this processing	1310	* If INS_ON_TOP is used, don't do this processing
1324	* Need to find the object that in fact blocks view, otherwise	1311	* Need to find the object that in fact blocks view, otherwise
1325	* stacking is a bit odd.	1312	* stacking is a bit odd.
1326	*/	1313	*/
1327	if (!(flag & INS_ON_TOP) &&	1314	if (!(flag & INS_ON_TOP)
1328	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1315	&& ms.flags () & P_BLOCKSVIEW
		1316	&& (op->face && !faces [op->face].visibility))
1329	{	1317	{
1330	for (last = top; last != floor; last = last->below)	1318	for (last = top; last != floor; last = last->below)
1331	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1319	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1332	break;	1320	break;
		1321
1333	/* Check to see if we found the object that blocks view,	1322	/* Check to see if we found the object that blocks view,
1334	* and make sure we have a below pointer for it so that	1323	* and make sure we have a below pointer for it so that
1335	* we can get inserted below this one, which requires we	1324	* we can get inserted below this one, which requires we
1336	* set top to the object below us.	1325	* set top to the object below us.
1337	*/	1326	*/
…		…
1339	top = last->below;	1328	top = last->below;
1340	}	1329	}
1341	} /* If objects on this space */	1330	} /* If objects on this space */
1342		1331
1343	if (flag & INS_MAP_LOAD)	1332	if (flag & INS_MAP_LOAD)
1344	top = GET_MAP_TOP (op->map, op->x, op->y);	1333	top = ms.top;
1345		1334
1346	if (flag & INS_ABOVE_FLOOR_ONLY)	1335	if (flag & INS_ABOVE_FLOOR_ONLY)
1347	top = floor;	1336	top = floor;
1348		1337
1349	/* Top is the object that our object (op) is going to get inserted above.	1338	/* Top is the object that our object (op) is going to get inserted above.
1350	*/	1339	*/
1351		1340
1352	/* First object on this space */	1341	/* First object on this space */
1353	if (!top)	1342	if (!top)
1354	{	1343	{
1355	op->above = GET_MAP_OB (op->map, op->x, op->y);	1344	op->above = ms.bot;
1356		1345
1357	if (op->above)	1346	if (op->above)
1358	op->above->below = op;	1347	op->above->below = op;
1359		1348
1360	op->below = 0;	1349	op->below = 0;
1361	op->ms ().bot = op;	1350	ms.bot = op;
1362	}	1351	}
1363	else	1352	else
1364	{ /* get inserted into the stack above top */	1353	{ /* get inserted into the stack above top */
1365	op->above = top->above;	1354	op->above = top->above;
1366		1355
…		…
1370	op->below = top;	1359	op->below = top;
1371	top->above = op;	1360	top->above = op;
1372	}	1361	}
1373		1362
1374	if (!op->above)	1363	if (!op->above)
1375	op->ms ().top = op;	1364	ms.top = op;
1376	} /* else not INS_BELOW_ORIGINATOR */	1365	} /* else not INS_BELOW_ORIGINATOR */
1377		1366
1378	if (op->type == PLAYER)	1367	if (op->type == PLAYER)
1379	{	1368	{
1380	op->contr->do_los = 1;	1369	op->contr->do_los = 1;
…		…
1386		1375
1387	/* If we have a floor, we know the player, if any, will be above	1376	/* If we have a floor, we know the player, if any, will be above
1388	* it, so save a few ticks and start from there.	1377	* it, so save a few ticks and start from there.
1389	*/	1378	*/
1390	if (!(flag & INS_MAP_LOAD))	1379	if (!(flag & INS_MAP_LOAD))
1391	if (object *pl = op->ms ().player ())	1380	if (object *pl = ms.player ())
1392	if (pl->contr->ns)	1381	if (pl->contr->ns)
1393	pl->contr->ns->floorbox_update ();	1382	pl->contr->ns->floorbox_update ();
1394		1383
1395	/* If this object glows, it may affect lighting conditions that are	1384	/* If this object glows, it may affect lighting conditions that are
1396	* visible to others on this map. But update_all_los is really	1385	* visible to others on this map. But update_all_los is really
…		…
1458	}	1447	}
1459		1448
1460	object *	1449	object *
1461	object::insert_at (object where, object originator, int flags)	1450	object::insert_at (object where, object originator, int flags)
1462	{	1451	{
1463	where->map->insert (this, where->x, where->y, originator, flags);	1452	return where->map->insert (this, where->x, where->y, originator, flags);
1464	}	1453	}
1465		1454
1466	/*	1455	/*
1467	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1456	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1468	* is returned contains nr objects, and the remaining parts contains	1457	* is returned contains nr objects, and the remaining parts contains
…		…
1508	* the amount of an object. If the amount reaches 0, the object	1497	* the amount of an object. If the amount reaches 0, the object
1509	* is subsequently removed and freed.	1498	* is subsequently removed and freed.
1510	*	1499	*
1511	* Return value: 'op' if something is left, NULL if the amount reached 0	1500	* Return value: 'op' if something is left, NULL if the amount reached 0
1512	*/	1501	*/
1513
1514	object *	1502	object *
1515	decrease_ob_nr (object *op, uint32 i)	1503	decrease_ob_nr (object *op, uint32 i)
1516	{	1504	{
1517	object *tmp;	1505	object *tmp;
1518		1506
…		…
1593		1581
1594	/*	1582	/*
1595	* add_weight(object, weight) adds the specified weight to an object,	1583	* add_weight(object, weight) adds the specified weight to an object,
1596	* and also updates how much the environment(s) is/are carrying.	1584	* and also updates how much the environment(s) is/are carrying.
1597	*/	1585	*/
1598
1599	void	1586	void
1600	add_weight (object *op, signed long weight)	1587	add_weight (object *op, signed long weight)
1601	{	1588	{
1602	while (op != NULL)	1589	while (op != NULL)
1603	{	1590	{
…		…
1635	* inside the object environment.	1622	* inside the object environment.
1636	*	1623	*
1637	* The function returns now pointer to inserted item, and return value can	1624	* The function returns now pointer to inserted item, and return value can
1638	* be != op, if items are merged. -Tero	1625	* be != op, if items are merged. -Tero
1639	*/	1626	*/
1640
1641	object *	1627	object *
1642	object::insert (object *op)	1628	object::insert (object *op)
1643	{	1629	{
1644	object tmp, otmp;	1630	object tmp, otmp;
1645		1631
…		…
1805	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1791	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1806	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1792	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1807	{	1793	{
1808		1794
1809	float	1795	float
1810	diff = tmp->move_slow_penalty * FABS (op->speed);	1796	diff = tmp->move_slow_penalty * fabs (op->speed);
1811		1797
1812	if (op->type == PLAYER)	1798	if (op->type == PLAYER)
1813	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1799	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|
1814	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1800	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1815	diff /= 4.0;	1801	diff /= 4.0;
…		…
2022	}	2008	}
2023		2009
2024	if (!index)	2010	if (!index)
2025	return -1;	2011	return -1;
2026		2012
2027	return altern[RANDOM () % index];	2013	return altern [rndm (index)];
2028	}	2014	}
2029		2015
2030	/*	2016	/*
2031	* find_first_free_spot(archetype, maptile, x, y) works like	2017	* find_first_free_spot(archetype, maptile, x, y) works like
2032	* find_free_spot(), but it will search max number of squares.	2018	* find_free_spot(), but it will search max number of squares.
…		…
2053	{	2039	{
2054	arr += begin;	2040	arr += begin;
2055	end -= begin;	2041	end -= begin;
2056		2042
2057	while (--end)	2043	while (--end)
2058	swap (arr [end], arr [RANDOM () % (end + 1)]);	2044	swap (arr [end], arr [rndm (end + 1)]);
2059	}	2045	}
2060		2046
2061	/* new function to make monster searching more efficient, and effective!	2047	/* new function to make monster searching more efficient, and effective!
2062	* This basically returns a randomized array (in the passed pointer) of	2048	* This basically returns a randomized array (in the passed pointer) of
2063	* the spaces to find monsters. In this way, it won't always look for	2049	* the spaces to find monsters. In this way, it won't always look for
…		…
2197		2183
2198	return 3;	2184	return 3;
2199	}	2185	}
2200		2186
2201	/*	2187	/*
2202	* absdir(int): Returns a number between 1 and 8, which represent
2203	* the "absolute" direction of a number (it actually takes care of
2204	* "overflow" in previous calculations of a direction).
2205	*/
2206
2207	int
2208	absdir (int d)
2209	{
2210	while (d < 1)
2211	d += 8;
2212
2213	while (d > 8)
2214	d -= 8;
2215
2216	return d;
2217	}
2218
2219	/*
2220	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2188	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2221	* between two directions (which are expected to be absolute (see absdir())	2189	* between two directions (which are expected to be absolute (see absdir())
2222	*/	2190	*/
2223
2224	int	2191	int
2225	dirdiff (int dir1, int dir2)	2192	dirdiff (int dir1, int dir2)
2226	{	2193	{
2227	int d;	2194	int d;
2228		2195
…		…
2394	insert_ob_in_ob (object_create_clone (item), dst);	2361	insert_ob_in_ob (object_create_clone (item), dst);
2395		2362
2396	return dst;	2363	return dst;
2397	}	2364	}
2398		2365
2399	/* GROS - Creates an object using a string representing its content. */
2400	/* Basically, we save the content of the string to a temp file, then call */
2401	/* load_object on it. I admit it is a highly inefficient way to make things, */
2402	/* but it was simple to make and allows reusing the load_object function. */
2403	/* Remember not to use load_object_str in a time-critical situation. */
2404	/* Also remember that multiparts objects are not supported for now. */
2405	object *
2406	load_object_str (const char *obstr)
2407	{
2408	object *op;
2409	char filename[MAX_BUF];
2410
2411	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2412
2413	FILE *tempfile = fopen (filename, "w");
2414
2415	if (tempfile == NULL)
2416	{
2417	LOG (llevError, "Error - Unable to access load object temp file\n");
2418	return NULL;
2419	}
2420
2421	fprintf (tempfile, obstr);
2422	fclose (tempfile);
2423
2424	op = object::create ();
2425
2426	object_thawer thawer (filename);
2427
2428	if (thawer)
2429	load_object (thawer, op, 0);
2430
2431	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2432	CLEAR_FLAG (op, FLAG_REMOVED);
2433
2434	return op;
2435	}
2436
2437	/* This returns the first object in who's inventory that	2366	/* This returns the first object in who's inventory that
2438	* has the same type and subtype match.	2367	* has the same type and subtype match.
2439	* returns NULL if no match.	2368	* returns NULL if no match.
2440	*/	2369	*/
2441	object *	2370	object *
…		…
2494	if (link->key == canonical_key)	2423	if (link->key == canonical_key)
2495	return link->value;	2424	return link->value;
2496		2425
2497	return 0;	2426	return 0;
2498	}	2427	}
2499
2500		2428
2501	/*	2429	/*
2502	* Updates the canonical_key in op to value.	2430	* Updates the canonical_key in op to value.
2503	*	2431	*
2504	* canonical_key is a shared string (value doesn't have to be).	2432	* canonical_key is a shared string (value doesn't have to be).
…		…
2644	{	2572	{
2645	char flagdesc[512];	2573	char flagdesc[512];
2646	char info2[256 * 4];	2574	char info2[256 * 4];
2647	char *p = info;	2575	char *p = info;
2648		2576
2649	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",	2577	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2650	count, uuid.seq,	2578	count, uuid.seq,
2651	&name,	2579	&name,
2652	title ? "\",title:" : "",	2580	title ? "\",title:\"" : "",
2653	title ? (const char *)title : "",	2581	title ? (const char *)title : "",
2654	flag_desc (flagdesc, 512), type);	2582	flag_desc (flagdesc, 512), type);
2655		2583
2656	if (env)	2584	if (env)
2657	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2585	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
…		…
2667	{	2595	{
2668	static char info[256 * 4];	2596	static char info[256 * 4];
2669	return debug_desc (info);	2597	return debug_desc (info);
2670	}	2598	}
2671		2599
		2600	const char *
		2601	object::debug_desc2 () const
		2602	{
		2603	static char info[256 * 4];
		2604	return debug_desc (info);
		2605	}
		2606
		2607	struct region *
		2608	object::region () const
		2609	{
		2610	return map ? map->region (x, y)
		2611	: region::default_region ();
		2612	}
		2613
		2614	const materialtype_t *
		2615	object::dominant_material () const
		2616	{
		2617	if (materialtype_t *mat = name_to_material (materialname))
		2618	return mat;
		2619
		2620	// omfg this is slow, this has to be temporary :)
		2621	shstr unknown ("unknown");
		2622
		2623	return name_to_material (unknown);
		2624	}
		2625
		2626	void
		2627	object::open_container (object *new_container)
		2628	{
		2629	if (container == new_container)
		2630	return;
		2631
		2632	if (object *old_container = container)
		2633	{
		2634	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2635	return;
		2636
		2637	#if 0
		2638	// remove the "Close old_container" object.
		2639	if (object *closer = old_container->inv)
		2640	if (closer->type == CLOSE_CON)
		2641	closer->destroy ();
		2642	#endif
		2643
		2644	old_container->flag [FLAG_APPLIED] = 0;
		2645	container = 0;
		2646
		2647	esrv_update_item (UPD_FLAGS, this, old_container);
		2648	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2649	}
		2650
		2651	if (new_container)
		2652	{
		2653	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2654	return;
		2655
		2656	// TODO: this does not seem to serve any purpose anymore?
		2657	#if 0
		2658	// insert the "Close Container" object.
		2659	if (archetype *closer = new_container->other_arch)
		2660	{
		2661	object *closer = arch_to_object (new_container->other_arch);
		2662	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2663	new_container->insert (closer);
		2664	}
		2665	#endif
		2666
		2667	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2668
		2669	new_container->flag [FLAG_APPLIED] = 1;
		2670	container = new_container;
		2671
		2672	esrv_update_item (UPD_FLAGS, this, new_container);
		2673	esrv_send_inventory (this, new_container);
		2674	}
		2675	}
		2676
		2677

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.104 by root, Tue Jan 2 21:13:21 2007 UTC vs. Revision 1.139 by root, Sat Apr 21 17:34:22 2007 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.104 by root, Tue Jan 2 21:13:21 2007 UTC vs.
Revision 1.139 by root, Sat Apr 21 17:34:22 2007 UTC