[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.142 by root, Mon Apr 30 04:25:29 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>
37		37
38	int nrofallocobjects = 0;	38	int nrofallocobjects = 0;
39	static UUID uuid;	39	static UUID uuid;
40	const uint64 UUID_SKIP = 1<<19;	40	const uint64 UUID_SKIP = 1<<19;
41		41
42	object active_objects; / List of active objects that need to be processed */	42	objectvec objects;
		43	activevec actives;
43		44
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,	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,
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	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
46	};	47	};
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,	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,
…		…
323	sum_weight (object *op)	324	sum_weight (object *op)
324	{	325	{
325	long sum;	326	long sum;
326	object *inv;	327	object *inv;
327		328
328	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	329	for (sum = 0, inv = op->inv; inv; inv = inv->below)
329	{	330	{
330	if (inv->inv)	331	if (inv->inv)
331	sum_weight (inv);	332	sum_weight (inv);
		333
332	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
333	}	335	}
334		336
335	if (op->type == CONTAINER && op->stats.Str)	337	if (op->type == CONTAINER && op->stats.Str)
336	sum = (sum * (100 - op->stats.Str)) / 100;	338	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
356	/*	358	/*
357	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	359	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
358	* Some error messages.	360	* Some error messages.
359	* The result of the dump is stored in the static global errmsg array.	361	* The result of the dump is stored in the static global errmsg array.
360	*/	362	*/
361
362	char *	363	char *
363	dump_object (object *op)	364	dump_object (object *op)
364	{	365	{
365	if (!op)	366	if (!op)
366	return strdup ("[NULLOBJ]");	367	return strdup ("[NULLOBJ]");
367		368
368	object_freezer freezer;	369	object_freezer freezer;
369	save_object (freezer, op, 1);	370	op->write (freezer);
370	return freezer.as_string ();	371	return freezer.as_string ();
371	}	372	}
372		373
373	/*	374	/*
374	* get_nearest_part(multi-object, object 2) returns the part of the	375	* get_nearest_part(multi-object, object 2) returns the part of the
…		…
391	}	392	}
392		393
393	/*	394	/*
394	* Returns the object which has the count-variable equal to the argument.	395	* Returns the object which has the count-variable equal to the argument.
395	*/	396	*/
396
397	object *	397	object *
398	find_object (tag_t i)	398	find_object (tag_t i)
399	{	399	{
400	for (object *op = object::first; op; op = op->next)	400	for_all_objects (op)
401	if (op->count == i)	401	if (op->count == i)
402	return op;	402	return op;
403		403
404	return 0;	404	return 0;
405	}	405	}
406		406
407	/*	407	/*
408	* Returns the first object which has a name equal to the argument.	408	* Returns the first object which has a name equal to the argument.
409	* Used only by the patch command, but not all that useful.	409	* Used only by the patch command, but not all that useful.
410	* Enables features like "patch <name-of-other-player> food 999"	410	* Enables features like "patch <name-of-other-player> food 999"
411	*/	411	*/
412
413	object *	412	object *
414	find_object_name (const char *str)	413	find_object_name (const char *str)
415	{	414	{
416	shstr_cmp str_ (str);	415	shstr_cmp str_ (str);
417	object *op;	416	object *op;
418		417
419	for (op = object::first; op != NULL; op = op->next)	418	for_all_objects (op)
420	if (op->name == str_)	419	if (op->name == str_)
421	break;	420	break;
422		421
423	return op;	422	return op;
424	}	423	}
…		…
456	* refcounts and freeing the links.	455	* refcounts and freeing the links.
457	*/	456	*/
458	static void	457	static void
459	free_key_values (object *op)	458	free_key_values (object *op)
460	{	459	{
461	for (key_value *i = op->key_values; i != 0;)	460	for (key_value *i = op->key_values; i; )
462	{	461	{
463	key_value *next = i->next;	462	key_value *next = i->next;
464	delete i;	463	delete i;
465		464
466	i = next;	465	i = next;
467	}	466	}
468		467
469	op->key_values = 0;	468	op->key_values = 0;
470	}	469	}
471		470
472	/*	471	object &
473	* copy_to first frees everything allocated by the dst object,	472	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	{	473	{
483	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	474	bool is_freed = flag [FLAG_FREED];
484	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	475	bool is_removed = flag [FLAG_REMOVED];
485		476
486	(object_copy )dst = *this;	477	(object_copy )this = src;
487		478
488	if (is_freed)	479	flag [FLAG_FREED] = is_freed;
489	SET_FLAG (dst, FLAG_FREED);	480	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		481
497	/* Copy over key_values, if any. */	482	/* Copy over key_values, if any. */
498	if (key_values)	483	if (src.key_values)
499	{	484	{
500	key_value *tail = 0;	485	key_value *tail = 0;
501	key_value *i;
502
503	dst->key_values = 0;	486	key_values = 0;
504		487
505	for (i = key_values; i; i = i->next)	488	for (key_value *i = src.key_values; i; i = i->next)
506	{	489	{
507	key_value *new_link = new key_value;	490	key_value *new_link = new key_value;
508		491
509	new_link->next = 0;	492	new_link->next = 0;
510	new_link->key = i->key;	493	new_link->key = i->key;
511	new_link->value = i->value;	494	new_link->value = i->value;
512		495
513	/* Try and be clever here, too. */	496	/* Try and be clever here, too. */
514	if (!dst->key_values)	497	if (!key_values)
515	{	498	{
516	dst->key_values = new_link;	499	key_values = new_link;
517	tail = new_link;	500	tail = new_link;
518	}	501	}
519	else	502	else
520	{	503	{
521	tail->next = new_link;	504	tail->next = new_link;
522	tail = new_link;	505	tail = new_link;
523	}	506	}
524	}	507	}
525	}	508	}
		509	}
		510
		511	/*
		512	* copy_to first frees everything allocated by the dst object,
		513	* and then copies the contents of itself into the second
		514	* object, allocating what needs to be allocated. Basically, any
		515	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		516	* if the first object is freed, the pointers in the new object
		517	* will point at garbage.
		518	*/
		519	void
		520	object::copy_to (object *dst)
		521	{
		522	dst = this;
		523
		524	if (speed < 0)
		525	dst->speed_left = speed_left - rndm ();
526		526
527	dst->set_speed (dst->speed);	527	dst->set_speed (dst->speed);
		528	}
		529
		530	void
		531	object::instantiate ()
		532	{
		533	if (!uuid.seq) // HACK
		534	uuid = gen_uuid ();
		535
		536	speed_left = -0.1f;
		537	/* copy the body_info to the body_used - this is only really
		538	* need for monsters, but doesn't hurt to do it for everything.
		539	* by doing so, when a monster is created, it has good starting
		540	* values for the body_used info, so when items are created
		541	* for it, they can be properly equipped.
		542	*/
		543	memcpy (body_used, body_info, sizeof (body_used));
		544
		545	attachable::instantiate ();
528	}	546	}
529		547
530	object *	548	object *
531	object::clone ()	549	object::clone ()
532	{	550	{
…		…
590	* UP_OBJ_FACE: only the objects face has changed.	608	* UP_OBJ_FACE: only the objects face has changed.
591	*/	609	*/
592	void	610	void
593	update_object (object *op, int action)	611	update_object (object *op, int action)
594	{	612	{
595	MoveType move_on, move_off, move_block, move_slow;
596
597	if (op == NULL)	613	if (op == NULL)
598	{	614	{
599	/* this should never happen */	615	/* this should never happen */
600	LOG (llevDebug, "update_object() called for NULL object.\n");	616	LOG (llevDebug, "update_object() called for NULL object.\n");
601	return;	617	return;
…		…
661		677
662	if (op->more)	678	if (op->more)
663	update_object (op->more, action);	679	update_object (op->more, action);
664	}	680	}
665		681
666	object *object::first;
667
668	object::object ()	682	object::object ()
669	{	683	{
670	SET_FLAG (this, FLAG_REMOVED);	684	SET_FLAG (this, FLAG_REMOVED);
671		685
672	expmul = 1.0;	686	expmul = 1.0;
673	face = blank_face;	687	face = blank_face;
674	}	688	}
675		689
676	object::~object ()	690	object::~object ()
677	{	691	{
		692	unlink ();
		693
678	free_key_values (this);	694	free_key_values (this);
679	}	695	}
680		696
		697	static int object_count;
		698
681	void object::link ()	699	void object::link ()
682	{	700	{
683	count = ++ob_count;	701	assert (!index);//D
684	uuid = gen_uuid ();	702	uuid = gen_uuid ();
		703	count = ++object_count;
685		704
686	prev = 0;	705	refcnt_inc ();
687	next = object::first;	706	objects.insert (this);
688
689	if (object::first)
690	object::first->prev = this;
691
692	object::first = this;
693	}	707	}
694		708
695	void object::unlink ()	709	void object::unlink ()
696	{	710	{
697	if (this == object::first)	711	if (!index)
698	object::first = next;	712	return;
699		713
700	/* Remove this object from the list of used objects */	714	objects.erase (this);
701	if (prev) prev->next = next;	715	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	}	716	}
713		717
714	void	718	void
715	object::activate ()	719	object::activate ()
716	{	720	{
717	/* If already on active list, don't do anything */	721	/* If already on active list, don't do anything */
718	if (active ())	722	if (active)
719	return;	723	return;
720		724
721	if (has_active_speed ())	725	if (has_active_speed ())
722	{	726	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	}	727	}
733		728
734	void	729	void
735	object::activate_recursive ()	730	object::activate_recursive ()
736	{	731	{
…		…
750	*/	745	*/
751	void	746	void
752	object::deactivate ()	747	object::deactivate ()
753	{	748	{
754	/* If not on the active list, nothing needs to be done */	749	/* If not on the active list, nothing needs to be done */
755	if (!active ())	750	if (!active)
756	return;	751	return;
757		752
758	if (active_prev == 0)	753	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	}	754	}
774		755
775	void	756	void
776	object::deactivate_recursive ()	757	object::deactivate_recursive ()
777	{	758	{
…		…
811	* drop on that space.	792	* drop on that space.
812	*/	793	*/
813	if (!drop_to_ground	794	if (!drop_to_ground
814	\|\| !map	795	\|\| !map
815	\|\| map->in_memory != MAP_IN_MEMORY	796	\|\| map->in_memory != MAP_IN_MEMORY
		797	\|\| map->nodrop
816	\|\| ms ().move_block == MOVE_ALL)	798	\|\| ms ().move_block == MOVE_ALL)
817	{	799	{
818	while (inv)	800	while (inv)
819	{	801	{
820	inv->destroy_inv (drop_to_ground);	802	inv->destroy_inv (drop_to_ground);
…		…
829		811
830	if (op->flag [FLAG_STARTEQUIP]	812	if (op->flag [FLAG_STARTEQUIP]
831	\|\| op->flag [FLAG_NO_DROP]	813	\|\| op->flag [FLAG_NO_DROP]
832	\|\| op->type == RUNE	814	\|\| op->type == RUNE
833	\|\| op->type == TRAP	815	\|\| op->type == TRAP
834	\|\| op->flag [FLAG_IS_A_TEMPLATE])	816	\|\| op->flag [FLAG_IS_A_TEMPLATE]
		817	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
835	op->destroy ();	818	op->destroy ();
836	else	819	else
837	map->insert (op, x, y);	820	map->insert (op, x, y);
838	}	821	}
839	}	822	}
…		…
847	}	830	}
848		831
849	void	832	void
850	object::do_destroy ()	833	object::do_destroy ()
851	{	834	{
		835	attachable::do_destroy ();
		836
852	if (flag [FLAG_IS_LINKED])	837	if (flag [FLAG_IS_LINKED])
853	remove_button_link (this);	838	remove_button_link (this);
854		839
855	if (flag [FLAG_FRIENDLY])	840	if (flag [FLAG_FRIENDLY])
856	remove_friendly_object (this);	841	remove_friendly_object (this);
857		842
858	if (!flag [FLAG_REMOVED])	843	if (!flag [FLAG_REMOVED])
859	remove ();	844	remove ();
860		845
861	if (flag [FLAG_FREED])	846	destroy_inv (true);
862	return;
863		847
864	set_speed (0);	848	deactivate ();
		849	unlink ();
865		850
866	flag [FLAG_FREED] = 1;	851	flag [FLAG_FREED] = 1;
867
868	attachable::do_destroy ();
869
870	destroy_inv (true);
871	unlink ();
872		852
873	// hack to ensure that freed objects still have a valid map	853	// hack to ensure that freed objects still have a valid map
874	{	854	{
875	static maptile *freed_map; // freed objects are moved here to avoid crashes	855	static maptile *freed_map; // freed objects are moved here to avoid crashes
876		856
…		…
901		881
902	// clear those pointers that likely might have circular references to us	882	// clear those pointers that likely might have circular references to us
903	owner = 0;	883	owner = 0;
904	enemy = 0;	884	enemy = 0;
905	attacked_by = 0;	885	attacked_by = 0;
906
907	// only relevant for players(?), but make sure of it anyways
908	contr = 0;
909	}	886	}
910		887
911	void	888	void
912	object::destroy (bool destroy_inventory)	889	object::destroy (bool destroy_inventory)
913	{	890	{
…		…
941	* This function removes the object op from the linked list of objects	918	* 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	919	* which it is currently tied to. When this function is done, the
943	* object will have no environment. If the object previously had an	920	* object will have no environment. If the object previously had an
944	* environment, the x and y coordinates will be updated to	921	* environment, the x and y coordinates will be updated to
945	* the previous environment.	922	* the previous environment.
946	* Beware: This function is called from the editor as well!
947	*/	923	*/
948	void	924	void
949	object::remove ()	925	object::do_remove ()
950	{	926	{
951	object tmp, last = 0;	927	object tmp, last = 0;
952	object *otmp;	928	object *otmp;
953		929
954	if (QUERY_FLAG (this, FLAG_REMOVED))	930	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
997	}	973	}
998	else if (map)	974	else if (map)
999	{	975	{
1000	if (type == PLAYER)	976	if (type == PLAYER)
1001	{	977	{
		978	// leaving a spot always closes any open container on the ground
		979	if (container && !container->env)
		980	// this causes spurious floorbox updates, but it ensures
		981	// that the CLOSE event is being sent.
		982	close_container ();
		983
1002	--map->players;	984	--map->players;
1003	map->touch ();	985	map->touch ();
1004	}	986	}
1005		987
1006	map->dirty = true;	988	map->dirty = true;
		989	mapspace &ms = this->ms ();
1007		990
1008	/* link the object above us */	991	/* link the object above us */
1009	if (above)	992	if (above)
1010	above->below = below;	993	above->below = below;
1011	else	994	else
1012	map->at (x, y).top = below; /* we were top, set new top */	995	ms.top = below; /* we were top, set new top */
1013		996
1014	/* Relink the object below us, if there is one */	997	/* Relink the object below us, if there is one */
1015	if (below)	998	if (below)
1016	below->above = above;	999	below->above = above;
1017	else	1000	else
…		…
1019	/* Nothing below, which means we need to relink map object for this space	1002	/* 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	1003	* use translated coordinates in case some oddness with map tiling is
1021	* evident	1004	* evident
1022	*/	1005	*/
1023	if (GET_MAP_OB (map, x, y) != this)	1006	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);	1007	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		1008
1034	map->at (x, y).bot = above; /* goes on above it. */	1009	ms.bot = above; /* goes on above it. */
1035	}	1010	}
1036		1011
1037	above = 0;	1012	above = 0;
1038	below = 0;	1013	below = 0;
1039		1014
1040	if (map->in_memory == MAP_SAVING)	1015	if (map->in_memory == MAP_SAVING)
1041	return;	1016	return;
1042		1017
1043	int check_walk_off = !flag [FLAG_NO_APPLY];	1018	int check_walk_off = !flag [FLAG_NO_APPLY];
1044		1019
1045	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1020	for (tmp = ms.bot; tmp; tmp = tmp->above)
1046	{	1021	{
1047	/* No point updating the players look faces if he is the object	1022	/* No point updating the players look faces if he is the object
1048	* being removed.	1023	* being removed.
1049	*/	1024	*/
1050		1025
…		…
1130	}	1105	}
1131		1106
1132	return 0;	1107	return 0;
1133	}	1108	}
1134		1109
		1110	void
		1111	object::expand_tail ()
		1112	{
		1113	if (more)
		1114	return;
		1115
		1116	object *prev = this;
		1117
		1118	for (archetype *at = arch->more; at; at = at->more)
		1119	{
		1120	object *op = arch_to_object (at);
		1121
		1122	op->name = name;
		1123	op->name_pl = name_pl;
		1124	op->title = title;
		1125
		1126	op->head = this;
		1127	prev->more = op;
		1128
		1129	prev = op;
		1130	}
		1131	}
		1132
1135	/*	1133	/*
1136	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1134	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1137	* job preparing multi-part monsters	1135	* job preparing multi-part monsters.
1138	*/	1136	*/
1139	object *	1137	object *
1140	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1138	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1141	{	1139	{
1142	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1140	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
…		…
1169	* just 'op' otherwise	1167	* just 'op' otherwise
1170	*/	1168	*/
1171	object *	1169	object *
1172	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1170	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1173	{	1171	{
		1172	assert (!op->flag [FLAG_FREED]);
		1173
1174	object tmp, top, *floor = NULL;	1174	object tmp, top, *floor = NULL;
1175	sint16 x, y;
1176		1175
1177	if (QUERY_FLAG (op, FLAG_FREED))	1176	op->remove ();
1178	{
1179	LOG (llevError, "Trying to insert freed object!\n");
1180	return NULL;
1181	}
1182		1177
1183	if (!m)	1178	#if 0
1184	{	1179	if (!m->active != !op->active)
1185	char *dump = dump_object (op);	1180	if (m->active)
1186	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1181	op->activate_recursive ();
1187	free (dump);	1182	else
1188	return op;	1183	op->deactivate_recursive ();
1189	}	1184	#endif
1190		1185
1191	if (out_of_map (m, op->x, op->y))	1186	if (out_of_map (m, op->x, op->y))
1192	{	1187	{
1193	char *dump = dump_object (op);
1194	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);	1188	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1195	#ifdef MANY_CORES	1189	#ifdef MANY_CORES
1196	/* Better to catch this here, as otherwise the next use of this object	1190	/* 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	1191	* is likely to cause a crash. Better to find out where it is getting
1198	* improperly inserted.	1192	* improperly inserted.
1199	*/	1193	*/
1200	abort ();	1194	abort ();
1201	#endif	1195	#endif
1202	free (dump);
1203	return op;	1196	return op;
1204	}	1197	}
1205		1198
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;	1199	if (object *more = op->more)
1219		1200	{
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)	1201	if (!insert_ob_in_map (more, m, originator, flag))
1236	{	1202	{
1237	if (!op->head)	1203	if (!op->head)
1238	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1204	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1239		1205
1240	return 0;	1206	return 0;
…		…
1245		1211
1246	/* Ideally, the caller figures this out. However, it complicates a lot	1212	/* 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	1213	* of areas of callers (eg, anything that uses find_free_spot would now
1248	* need extra work	1214	* need extra work
1249	*/	1215	*/
1250	op->map = get_map_from_coord (m, &op->x, &op->y);	1216	if (!xy_normalise (m, op->x, op->y))
1251	x = op->x;	1217	return 0;
1252	y = op->y;	1218
		1219	op->map = m;
		1220	mapspace &ms = op->ms ();
1253		1221
1254	/* this has to be done after we translate the coordinates.	1222	/* this has to be done after we translate the coordinates.
1255	*/	1223	*/
1256	if (op->nrof && !(flag & INS_NO_MERGE))	1224	if (op->nrof && !(flag & INS_NO_MERGE))
1257	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1225	for (tmp = ms.bot; tmp; tmp = tmp->above)
1258	if (object::can_merge (op, tmp))	1226	if (object::can_merge (op, tmp))
1259	{	1227	{
1260	op->nrof += tmp->nrof;	1228	op->nrof += tmp->nrof;
1261	tmp->destroy ();	1229	tmp->destroy ();
1262	}	1230	}
…		…
1279	op->below = originator->below;	1247	op->below = originator->below;
1280		1248
1281	if (op->below)	1249	if (op->below)
1282	op->below->above = op;	1250	op->below->above = op;
1283	else	1251	else
1284	op->ms ().bot = op;	1252	ms.bot = op;
1285		1253
1286	/* since below originator, no need to update top */	1254	/* since below originator, no need to update top */
1287	originator->below = op;	1255	originator->below = op;
1288	}	1256	}
1289	else	1257	else
1290	{	1258	{
		1259	top = ms.bot;
		1260
1291	/* If there are other objects, then */	1261	/* If there are other objects, then */
1292	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1262	if ((!(flag & INS_MAP_LOAD)) && top)
1293	{	1263	{
1294	object *last = 0;	1264	object *last = 0;
1295		1265
1296	/*	1266	/*
1297	* If there are multiple objects on this space, we do some trickier handling.	1267	* 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	1273	* 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	1274	* 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	1275	* when lots of spells are cast in one area. Currently, it is presumed
1306	* that flying non pickable objects are spell objects.	1276	* that flying non pickable objects are spell objects.
1307	*/	1277	*/
1308	while (top)	1278	for (top = ms.bot; top; top = top->above)
1309	{	1279	{
1310	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1280	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1311	floor = top;	1281	floor = top;
1312		1282
1313	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1283	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;	1286	top = top->below;
1317	break;	1287	break;
1318	}	1288	}
1319		1289
1320	last = top;	1290	last = top;
1321	top = top->above;
1322	}	1291	}
1323		1292
1324	/* Don't want top to be NULL, so set it to the last valid object */	1293	/* Don't want top to be NULL, so set it to the last valid object */
1325	top = last;	1294	top = last;
1326		1295
…		…
1328	* looks like instead of lots of conditions here.	1297	* looks like instead of lots of conditions here.
1329	* makes things faster, and effectively the same result.	1298	* makes things faster, and effectively the same result.
1330	*/	1299	*/
1331		1300
1332	/* Have object 'fall below' other objects that block view.	1301	/* Have object 'fall below' other objects that block view.
1333	* Unless those objects are exits, type 66	1302	* Unless those objects are exits.
1334	* If INS_ON_TOP is used, don't do this processing	1303	* If INS_ON_TOP is used, don't do this processing
1335	* Need to find the object that in fact blocks view, otherwise	1304	* Need to find the object that in fact blocks view, otherwise
1336	* stacking is a bit odd.	1305	* stacking is a bit odd.
1337	*/	1306	*/
1338	if (!(flag & INS_ON_TOP) &&	1307	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))	1308	&& ms.flags () & P_BLOCKSVIEW
		1309	&& (op->face && !faces [op->face].visibility))
1340	{	1310	{
1341	for (last = top; last != floor; last = last->below)	1311	for (last = top; last != floor; last = last->below)
1342	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1312	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1343	break;	1313	break;
		1314
1344	/* Check to see if we found the object that blocks view,	1315	/* Check to see if we found the object that blocks view,
1345	* and make sure we have a below pointer for it so that	1316	* and make sure we have a below pointer for it so that
1346	* we can get inserted below this one, which requires we	1317	* we can get inserted below this one, which requires we
1347	* set top to the object below us.	1318	* set top to the object below us.
1348	*/	1319	*/
…		…
1350	top = last->below;	1321	top = last->below;
1351	}	1322	}
1352	} /* If objects on this space */	1323	} /* If objects on this space */
1353		1324
1354	if (flag & INS_MAP_LOAD)	1325	if (flag & INS_MAP_LOAD)
1355	top = GET_MAP_TOP (op->map, op->x, op->y);	1326	top = ms.top;
1356		1327
1357	if (flag & INS_ABOVE_FLOOR_ONLY)	1328	if (flag & INS_ABOVE_FLOOR_ONLY)
1358	top = floor;	1329	top = floor;
1359		1330
1360	/* Top is the object that our object (op) is going to get inserted above.	1331	/* Top is the object that our object (op) is going to get inserted above.
1361	*/	1332	*/
1362		1333
1363	/* First object on this space */	1334	/* First object on this space */
1364	if (!top)	1335	if (!top)
1365	{	1336	{
1366	op->above = GET_MAP_OB (op->map, op->x, op->y);	1337	op->above = ms.bot;
1367		1338
1368	if (op->above)	1339	if (op->above)
1369	op->above->below = op;	1340	op->above->below = op;
1370		1341
1371	op->below = 0;	1342	op->below = 0;
1372	op->ms ().bot = op;	1343	ms.bot = op;
1373	}	1344	}
1374	else	1345	else
1375	{ /* get inserted into the stack above top */	1346	{ /* get inserted into the stack above top */
1376	op->above = top->above;	1347	op->above = top->above;
1377		1348
…		…
1381	op->below = top;	1352	op->below = top;
1382	top->above = op;	1353	top->above = op;
1383	}	1354	}
1384		1355
1385	if (!op->above)	1356	if (!op->above)
1386	op->ms ().top = op;	1357	ms.top = op;
1387	} /* else not INS_BELOW_ORIGINATOR */	1358	} /* else not INS_BELOW_ORIGINATOR */
1388		1359
1389	if (op->type == PLAYER)	1360	if (op->type == PLAYER)
1390	{	1361	{
1391	op->contr->do_los = 1;	1362	op->contr->do_los = 1;
…		…
1397		1368
1398	/* If we have a floor, we know the player, if any, will be above	1369	/* 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.	1370	* it, so save a few ticks and start from there.
1400	*/	1371	*/
1401	if (!(flag & INS_MAP_LOAD))	1372	if (!(flag & INS_MAP_LOAD))
1402	if (object *pl = op->ms ().player ())	1373	if (object *pl = ms.player ())
1403	if (pl->contr->ns)	1374	if (pl->contr->ns)
1404	pl->contr->ns->floorbox_update ();	1375	pl->contr->ns->floorbox_update ();
1405		1376
1406	/* If this object glows, it may affect lighting conditions that are	1377	/* If this object glows, it may affect lighting conditions that are
1407	* visible to others on this map. But update_all_los is really	1378	* visible to others on this map. But update_all_los is really
…		…
1469	}	1440	}
1470		1441
1471	object *	1442	object *
1472	object::insert_at (object where, object originator, int flags)	1443	object::insert_at (object where, object originator, int flags)
1473	{	1444	{
1474	where->map->insert (this, where->x, where->y, originator, flags);	1445	return where->map->insert (this, where->x, where->y, originator, flags);
1475	}	1446	}
1476		1447
1477	/*	1448	/*
1478	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1449	* 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	1450	* is returned contains nr objects, and the remaining parts contains
…		…
1519	* the amount of an object. If the amount reaches 0, the object	1490	* the amount of an object. If the amount reaches 0, the object
1520	* is subsequently removed and freed.	1491	* is subsequently removed and freed.
1521	*	1492	*
1522	* Return value: 'op' if something is left, NULL if the amount reached 0	1493	* Return value: 'op' if something is left, NULL if the amount reached 0
1523	*/	1494	*/
1524
1525	object *	1495	object *
1526	decrease_ob_nr (object *op, uint32 i)	1496	decrease_ob_nr (object *op, uint32 i)
1527	{	1497	{
1528	object *tmp;	1498	object *tmp;
1529		1499
…		…
1604		1574
1605	/*	1575	/*
1606	* add_weight(object, weight) adds the specified weight to an object,	1576	* add_weight(object, weight) adds the specified weight to an object,
1607	* and also updates how much the environment(s) is/are carrying.	1577	* and also updates how much the environment(s) is/are carrying.
1608	*/	1578	*/
1609
1610	void	1579	void
1611	add_weight (object *op, signed long weight)	1580	add_weight (object *op, signed long weight)
1612	{	1581	{
1613	while (op != NULL)	1582	while (op != NULL)
1614	{	1583	{
…		…
1646	* inside the object environment.	1615	* inside the object environment.
1647	*	1616	*
1648	* The function returns now pointer to inserted item, and return value can	1617	* The function returns now pointer to inserted item, and return value can
1649	* be != op, if items are merged. -Tero	1618	* be != op, if items are merged. -Tero
1650	*/	1619	*/
1651
1652	object *	1620	object *
1653	object::insert (object *op)	1621	object::insert (object *op)
1654	{	1622	{
1655	object tmp, otmp;	1623	object tmp, otmp;
1656		1624
…		…
1816	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1784	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))	1785	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1818	{	1786	{
1819		1787
1820	float	1788	float
1821	diff = tmp->move_slow_penalty * FABS (op->speed);	1789	diff = tmp->move_slow_penalty * fabs (op->speed);
1822		1790
1823	if (op->type == PLAYER)	1791	if (op->type == PLAYER)
1824	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1792	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)))	1793	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1826	diff /= 4.0;	1794	diff /= 4.0;
…		…
2033	}	2001	}
2034		2002
2035	if (!index)	2003	if (!index)
2036	return -1;	2004	return -1;
2037		2005
2038	return altern[RANDOM () % index];	2006	return altern [rndm (index)];
2039	}	2007	}
2040		2008
2041	/*	2009	/*
2042	* find_first_free_spot(archetype, maptile, x, y) works like	2010	* find_first_free_spot(archetype, maptile, x, y) works like
2043	* find_free_spot(), but it will search max number of squares.	2011	* find_free_spot(), but it will search max number of squares.
…		…
2064	{	2032	{
2065	arr += begin;	2033	arr += begin;
2066	end -= begin;	2034	end -= begin;
2067		2035
2068	while (--end)	2036	while (--end)
2069	swap (arr [end], arr [RANDOM () % (end + 1)]);	2037	swap (arr [end], arr [rndm (end + 1)]);
2070	}	2038	}
2071		2039
2072	/* new function to make monster searching more efficient, and effective!	2040	/* new function to make monster searching more efficient, and effective!
2073	* This basically returns a randomized array (in the passed pointer) of	2041	* 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	2042	* the spaces to find monsters. In this way, it won't always look for
…		…
2208		2176
2209	return 3;	2177	return 3;
2210	}	2178	}
2211		2179
2212	/*	2180	/*
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	2181	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2232	* between two directions (which are expected to be absolute (see absdir())	2182	* between two directions (which are expected to be absolute (see absdir())
2233	*/	2183	*/
2234
2235	int	2184	int
2236	dirdiff (int dir1, int dir2)	2185	dirdiff (int dir1, int dir2)
2237	{	2186	{
2238	int d;	2187	int d;
2239		2188
…		…
2405	insert_ob_in_ob (object_create_clone (item), dst);	2354	insert_ob_in_ob (object_create_clone (item), dst);
2406		2355
2407	return dst;	2356	return dst;
2408	}	2357	}
2409		2358
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	2359	/* This returns the first object in who's inventory that
2449	* has the same type and subtype match.	2360	* has the same type and subtype match.
2450	* returns NULL if no match.	2361	* returns NULL if no match.
2451	*/	2362	*/
2452	object *	2363	object *
…		…
2505	if (link->key == canonical_key)	2416	if (link->key == canonical_key)
2506	return link->value;	2417	return link->value;
2507		2418
2508	return 0;	2419	return 0;
2509	}	2420	}
2510
2511		2421
2512	/*	2422	/*
2513	* Updates the canonical_key in op to value.	2423	* Updates the canonical_key in op to value.
2514	*	2424	*
2515	* canonical_key is a shared string (value doesn't have to be).	2425	* canonical_key is a shared string (value doesn't have to be).
…		…
2655	{	2565	{
2656	char flagdesc[512];	2566	char flagdesc[512];
2657	char info2[256 * 4];	2567	char info2[256 * 4];
2658	char *p = info;	2568	char *p = info;
2659		2569
2660	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",	2570	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2661	count, uuid.seq,	2571	count, uuid.seq,
2662	&name,	2572	&name,
2663	title ? "\",title:" : "",	2573	title ? "\",title:\"" : "",
2664	title ? (const char *)title : "",	2574	title ? (const char *)title : "",
2665	flag_desc (flagdesc, 512), type);	2575	flag_desc (flagdesc, 512), type);
2666		2576
2667	if (env)	2577	if (env)
2668	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2578	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
…		…
2678	{	2588	{
2679	static char info[256 * 4];	2589	static char info[256 * 4];
2680	return debug_desc (info);	2590	return debug_desc (info);
2681	}	2591	}
2682		2592
		2593	const char *
		2594	object::debug_desc2 () const
		2595	{
		2596	static char info[256 * 4];
		2597	return debug_desc (info);
		2598	}
		2599
		2600	struct region *
		2601	object::region () const
		2602	{
		2603	return map ? map->region (x, y)
		2604	: region::default_region ();
		2605	}
		2606
		2607	const materialtype_t *
		2608	object::dominant_material () const
		2609	{
		2610	if (materialtype_t *mat = name_to_material (materialname))
		2611	return mat;
		2612
		2613	// omfg this is slow, this has to be temporary :)
		2614	shstr unknown ("unknown");
		2615
		2616	return name_to_material (unknown);
		2617	}
		2618
		2619	void
		2620	object::open_container (object *new_container)
		2621	{
		2622	if (container == new_container)
		2623	return;
		2624
		2625	if (object *old_container = container)
		2626	{
		2627	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2628	return;
		2629
		2630	#if 0
		2631	// remove the "Close old_container" object.
		2632	if (object *closer = old_container->inv)
		2633	if (closer->type == CLOSE_CON)
		2634	closer->destroy ();
		2635	#endif
		2636
		2637	old_container->flag [FLAG_APPLIED] = 0;
		2638	container = 0;
		2639
		2640	esrv_update_item (UPD_FLAGS, this, old_container);
		2641	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2642	}
		2643
		2644	if (new_container)
		2645	{
		2646	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2647	return;
		2648
		2649	// TODO: this does not seem to serve any purpose anymore?
		2650	#if 0
		2651	// insert the "Close Container" object.
		2652	if (archetype *closer = new_container->other_arch)
		2653	{
		2654	object *closer = arch_to_object (new_container->other_arch);
		2655	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2656	new_container->insert (closer);
		2657	}
		2658	#endif
		2659
		2660	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2661
		2662	new_container->flag [FLAG_APPLIED] = 1;
		2663	container = new_container;
		2664
		2665	esrv_update_item (UPD_FLAGS, this, new_container);
		2666	esrv_send_inventory (this, new_container);
		2667	}
		2668	}
		2669
		2670

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.142 by root, Mon Apr 30 04:25:29 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.142 by root, Mon Apr 30 04:25:29 2007 UTC