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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.31 by root, Mon Sep 11 23:33:27 2006 UTC vs.
Revision 1.57 by root, Sun Dec 3 02:46:33 2006 UTC

…		…
1
2	/*	1	/*
3	CrossFire, A Multiplayer game for X-windows	2	CrossFire, A Multiplayer game for X-windows
4		3
5	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team
6	Copyright (C) 1992 Frank Tore Johansen	5	Copyright (C) 1992 Frank Tore Johansen
17		16
18	You should have received a copy of the GNU General Public License	17	You should have received a copy of the GNU General Public License
19	along with this program; if not, write to the Free Software	18	along with this program; if not, write to the Free Software
20	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21		20
22	The authors can be reached via e-mail at crossfire-devel@real-time.com	21	The authors can be reached via e-mail at <crossfire@schmorp.de>
23	*/	22	*/
24		23
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
27	variable. */	26	variable. */
…		…
29	#include <stdio.h>	28	#include <stdio.h>
30	#include <sys/types.h>	29	#include <sys/types.h>
31	#include <sys/uio.h>	30	#include <sys/uio.h>
32	#include <object.h>	31	#include <object.h>
33	#include <funcpoint.h>	32	#include <funcpoint.h>
34	#include <skills.h>
35	#include <loader.h>	33	#include <loader.h>
36		34
37	int nrofallocobjects = 0;	35	int nrofallocobjects = 0;
		36	static UUID uuid;
		37	const uint64 UUID_SKIP = 1<<19;
38		38
39	object objects; / Pointer to the list of used objects */
40	object active_objects; / List of active objects that need to be processed */	39	object active_objects; / List of active objects that need to be processed */
41		40
42	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,	41	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,
43	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	42	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
44	};	43	};
…		…
50	};	49	};
51	int freedir[SIZEOFFREE] = {	50	int freedir[SIZEOFFREE] = {
52	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	51	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
53	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	52	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
54	};	53	};
		54
		55	static void
		56	write_uuid (void)
		57	{
		58	char filename1[MAX_BUF], filename2[MAX_BUF];
		59
		60	sprintf (filename1, "%s/uuid", settings.localdir);
		61	sprintf (filename2, "%s/uuid~", settings.localdir);
		62
		63	FILE *fp;
		64
		65	if (!(fp = fopen (filename2, "w")))
		66	{
		67	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
		68	return;
		69	}
		70
		71	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
		72	fclose (fp);
		73	rename (filename2, filename1);
		74	}
		75
		76	static void
		77	read_uuid (void)
		78	{
		79	char filename[MAX_BUF];
		80
		81	sprintf (filename, "%s/uuid", settings.localdir);
		82
		83	FILE *fp;
		84
		85	if (!(fp = fopen (filename, "r")))
		86	{
		87	if (errno == ENOENT)
		88	{
		89	LOG (llevInfo, "RESET uid to 1\n");
		90	uuid.seq = 0;
		91	write_uuid ();
		92	return;
		93	}
		94
		95	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
		96	_exit (1);
		97	}
		98
		99	int version;
		100	unsigned long long uid;
		101	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) \|\| version != 1)
		102	{
		103	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);
		104	_exit (1);
		105	}
		106
		107	uuid.seq = uid;
		108	write_uuid ();
		109	LOG (llevDebug, "read UID: %lld\n", uid);
		110	fclose (fp);
		111	}
		112
		113	UUID
		114	gen_uuid ()
		115	{
		116	UUID uid;
		117
		118	uid.seq = ++uuid.seq;
		119
		120	if (!(uuid.seq & (UUID_SKIP - 1)))
		121	write_uuid ();
		122
		123	return uid;
		124	}
		125
		126	void
		127	init_uuid ()
		128	{
		129	read_uuid ();
		130	}
55		131
56	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	132	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
57	static int	133	static int
58	compare_ob_value_lists_one (const object wants, const object has)	134	compare_ob_value_lists_one (const object wants, const object has)
59	{	135	{
…		…
255	{	331	{
256	if (inv->inv)	332	if (inv->inv)
257	sum_weight (inv);	333	sum_weight (inv);
258	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
259	}	335	}
		336
260	if (op->type == CONTAINER && op->stats.Str)	337	if (op->type == CONTAINER && op->stats.Str)
261	sum = (sum * (100 - op->stats.Str)) / 100;	338	sum = (sum * (100 - op->stats.Str)) / 100;
		339
262	if (op->carrying != sum)	340	if (op->carrying != sum)
263	op->carrying = sum;	341	op->carrying = sum;
		342
264	return sum;	343	return sum;
265	}	344	}
266		345
267	/**	346	/**
268	* Return the outermost environment object for a given object.	347	* Return the outermost environment object for a given object.
…		…
295	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	374	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
296	* Some error messages.	375	* Some error messages.
297	* The result of the dump is stored in the static global errmsg array.	376	* The result of the dump is stored in the static global errmsg array.
298	*/	377	*/
299		378
300	void	379	char *
301	dump_object2 (object *op)
302	{
303	errmsg[0] = 0;
304	return;
305	//TODO//D#d#
306	#if 0
307	char *cp;
308
309	/* object tmp;/
310
311	if (op->arch != NULL)
312	{
313	strcat (errmsg, "arch ");
314	strcat (errmsg, op->arch->name ? op->arch->name : "(null)");
315	strcat (errmsg, "\n");
316	if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
317	strcat (errmsg, cp);
318	# if 0
319	/* Don't dump player diffs - they are too long, mostly meaningless, and
320	* will overflow the buffer.
321	* Changed so that we don't dump inventory either. This may
322	* also overflow the buffer.
323	*/
324	if (op->type != PLAYER && (cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
325	strcat (errmsg, cp);
326	for (tmp = op->inv; tmp; tmp = tmp->below)
327	dump_object2 (tmp);
328	# endif
329	strcat (errmsg, "end\n");
330	}
331	else
332	{
333	strcat (errmsg, "Object ");
334	if (op->name == NULL)
335	strcat (errmsg, "(null)");
336	else
337	strcat (errmsg, op->name);
338	strcat (errmsg, "\n");
339	# if 0
340	if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
341	strcat (errmsg, cp);
342	for (tmp = op->inv; tmp; tmp = tmp->below)
343	dump_object2 (tmp);
344	# endif
345	strcat (errmsg, "end\n");
346	}
347	#endif
348	}
349
350	/*
351	* Dumps an object. Returns output in the static global errmsg array.
352	*/
353
354	void
355	dump_object (object *op)	380	dump_object (object *op)
356	{	381	{
357	if (op == NULL)	382	if (!op)
358	{	383	return strdup ("[NULLOBJ]");
359	strcpy (errmsg, "[NULL pointer]");
360	return;
361	}
362	errmsg[0] = '\0';
363	dump_object2 (op);
364	}
365		384
366	void	385	object_freezer freezer;
367	dump_all_objects (void)	386	save_object (freezer, op, 3);
368	{	387	return freezer.as_string ();
369	object *op;
370
371	for (op = objects; op != NULL; op = op->next)
372	{
373	dump_object (op);
374	fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg);
375	}
376	}	388	}
377		389
378	/*	390	/*
379	* get_nearest_part(multi-object, object 2) returns the part of the	391	* get_nearest_part(multi-object, object 2) returns the part of the
380	* multi-object 1 which is closest to the second object.	392	* multi-object 1 which is closest to the second object.
…		…
400	*/	412	*/
401		413
402	object *	414	object *
403	find_object (tag_t i)	415	find_object (tag_t i)
404	{	416	{
405	object *op;	417	for (object *op = object::first; op; op = op->next)
406
407	for (op = objects; op != NULL; op = op->next)
408	if (op->count == i)	418	if (op->count == i)
409	break;	419	return op;
		420
410	return op;	421	return 0;
411	}	422	}
412		423
413	/*	424	/*
414	* Returns the first object which has a name equal to the argument.	425	* Returns the first object which has a name equal to the argument.
415	* Used only by the patch command, but not all that useful.	426	* Used only by the patch command, but not all that useful.
…		…
417	*/	428	*/
418		429
419	object *	430	object *
420	find_object_name (const char *str)	431	find_object_name (const char *str)
421	{	432	{
422	const char *name = shstr::find (str);	433	shstr_cmp str_ (str);
423	object *op;	434	object *op;
424		435
425	for (op = objects; op != NULL; op = op->next)	436	for (op = object::first; op != NULL; op = op->next)
426	if (&op->name == name)	437	if (op->name == str_)
427	break;	438	break;
428		439
429	return op;	440	return op;
430	}	441	}
431		442
432	void	443	void
433	free_all_object_data ()	444	free_all_object_data ()
434	{	445	{
435	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);	446	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
436	}
437
438	/*
439	* Returns the object which this object marks as being the owner.
440	* A id-scheme is used to avoid pointing to objects which have been
441	* freed and are now reused. If this is detected, the owner is
442	* set to NULL, and NULL is returned.
443	* Changed 2004-02-12 - if the player is setting at the play again
444	* prompt, he is removed, and we don't want to treat him as an owner of
445	* anything, so check removed flag. I don't expect that this should break
446	* anything - once an object is removed, it is basically dead anyways.
447	*/
448	object *
449	object::get_owner ()
450	{
451	if (!owner
452	\|\| QUERY_FLAG (owner, FLAG_FREED)
453	\|\| QUERY_FLAG (owner, FLAG_REMOVED))
454	owner = 0;
455
456	return owner;
457	}	447	}
458		448
459	/*	449	/*
460	* Sets the owner and sets the skill and exp pointers to owner's current	450	* Sets the owner and sets the skill and exp pointers to owner's current
461	* skill and experience objects.	451	* skill and experience objects.
…		…
531		521
532	/* What is not cleared is next, prev, and count */	522	/* What is not cleared is next, prev, and count */
533		523
534	expmul = 1.0;	524	expmul = 1.0;
535	face = blank_face;	525	face = blank_face;
536	attacked_by_count = -1;
537		526
538	if (settings.casting_time)	527	if (settings.casting_time)
539	casting_time = -1;	528	casting_time = -1;
540	}	529	}
541		530
…		…
836		825
837	if (op->more != NULL)	826	if (op->more != NULL)
838	update_object (op->more, action);	827	update_object (op->more, action);
839	}	828	}
840		829
841	static unordered_vector<object *> mortals;	830	object::vector object::mortals;
842	static std::vector<object *> freed;	831	object::vector object::objects; // not yet used
		832	object *object::first;
843		833
844	void object::free_mortals ()	834	void object::free_mortals ()
845	{	835	{
846	for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end ();)	836	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
847	if ((*i)->refcnt)	837	if ((*i)->refcnt)
848	++i; // further delay freeing	838	++i; // further delay freeing
849	else	839	else
850	{	840	{
851	freed.push_back (*i);//D
852	//delete *i;	841	delete *i;
853	mortals.erase (i);	842	mortals.erase (i);
854	}	843	}
855		844
856	if (mortals.size())//D	845	static int lastmortals = 0;//D
		846
		847	if (mortals.size() != lastmortals && lastmortals > 100)//D
		848	{
		849	lastmortals = mortals.size ();//D
857	LOG (llevDebug, "%d objects in mortal queue\n", mortals.size());//D	850	LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
		851	}
858	}	852	}
859		853
860	object::object ()	854	object::object ()
861	{	855	{
862	SET_FLAG (this, FLAG_REMOVED);	856	SET_FLAG (this, FLAG_REMOVED);
863		857
864	expmul = 1.0;	858	expmul = 1.0;
865	face = blank_face;	859	face = blank_face;
866	attacked_by_count = -1;
867	}	860	}
868		861
869	object::~object ()	862	object::~object ()
870	{	863	{
871	free_key_values (this);	864	free_key_values (this);
872	}	865	}
873		866
874	void object::link ()	867	void object::link ()
875	{	868	{
876	count = ++ob_count;	869	count = ++ob_count;
		870	uuid = gen_uuid ();
877		871
878	prev = 0;	872	prev = 0;
879	next = objects;	873	next = object::first;
880		874
881	if (objects)	875	if (object::first)
882	objects->prev = this;	876	object::first->prev = this;
883		877
884	objects = this;	878	object::first = this;
885	}	879	}
886		880
887	void object::unlink ()	881	void object::unlink ()
888	{	882	{
889	count = 0;	883	if (this == object::first)
		884	object::first = next;
890		885
891	/* Remove this object from the list of used objects */	886	/* Remove this object from the list of used objects */
892	if (prev)
893	{
894	prev->next = next;	887	if (prev) prev->next = next;
		888	if (next) next->prev = prev;
		889
895	prev = 0;	890	prev = 0;
896	}
897
898	if (next)
899	{
900	next->prev = prev;
901	next = 0;	891	next = 0;
902	}
903
904	if (this == objects)
905	objects = next;
906	}	892	}
907		893
908	object *object::create ()	894	object *object::create ()
909	{	895	{
910	object *
911	op;
912
913	if (freed.empty ())
914	op = new object;	896	object *op = new object;
915	else
916	{
917	// highly annoying, but the only way to get it stable right now
918	op = freed.back ();
919	freed.pop_back ();
920	op->~object ();
921	new ((void *) op) object;
922	}
923
924	op->link ();	897	op->link ();
925	return op;	898	return op;
926	}	899	}
927		900
928	/*	901	/*
…		…
930	* it from the list of used objects, and puts it on the list of	903	* it from the list of used objects, and puts it on the list of
931	* free objects. The IS_FREED() flag is set in the object.	904	* free objects. The IS_FREED() flag is set in the object.
932	* The object must have been removed by remove_ob() first for	905	* The object must have been removed by remove_ob() first for
933	* this function to succeed.	906	* this function to succeed.
934	*	907	*
935	* If free_inventory is set, free inventory as well. Else drop items in	908	* If destroy_inventory is set, free inventory as well. Else drop items in
936	* inventory to the ground.	909	* inventory to the ground.
937	*/	910	*/
938	void object::free (bool free_inventory)	911	void object::destroy (bool destroy_inventory)
939	{	912	{
940	if (QUERY_FLAG (this, FLAG_FREED))	913	if (QUERY_FLAG (this, FLAG_FREED))
941	return;	914	return;
942		915
		916	if (QUERY_FLAG (this, FLAG_FRIENDLY))
		917	remove_friendly_object (this);
		918
943	if (!QUERY_FLAG (this, FLAG_REMOVED))	919	if (!QUERY_FLAG (this, FLAG_REMOVED))
944	remove_ob (this);	920	remove_ob (this);
945		921
946	if (QUERY_FLAG (this, FLAG_FRIENDLY))
947	remove_friendly_object (this);
948
949	SET_FLAG (this, FLAG_FREED);	922	SET_FLAG (this, FLAG_FREED);
950		923
951	if (more)	924	if (more)
952	{	925	{
953	more->free (free_inventory);	926	more->destroy (destroy_inventory);
954	more = 0;	927	more = 0;
955	}	928	}
956		929
957	if (inv)	930	if (inv)
958	{	931	{
959	/* Only if the space blocks everything do we not process -	932	/* Only if the space blocks everything do we not process -
960	* if some form of movement is allowed, let objects	933	* if some form of movement is allowed, let objects
961	* drop on that space.	934	* drop on that space.
962	*/	935	*/
963	if (free_inventory \|\| !map \|\| map->in_memory != MAP_IN_MEMORY \|\| (GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL))	936	if (destroy_inventory \|\| !map \|\| map->in_memory != MAP_IN_MEMORY \|\| GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
964	{	937	{
965	object *op = inv;	938	object *op = inv;
966		939
967	while (op)	940	while (op)
968	{	941	{
969	object *tmp = op->below;	942	object *tmp = op->below;
970	op->free (free_inventory);	943	op->destroy (destroy_inventory);
971	op = tmp;	944	op = tmp;
972	}	945	}
973	}	946	}
974	else	947	else
975	{ /* Put objects in inventory onto this space */	948	{ /* Put objects in inventory onto this space */
…		…
994	op = tmp;	967	op = tmp;
995	}	968	}
996	}	969	}
997	}	970	}
998		971
		972	// hack to ensure that freed objects still have a valid map
		973	{
		974	static maptile *freed_map; // freed objects are moved here to avoid crashes
		975
		976	if (!freed_map)
		977	{
		978	freed_map = new maptile;
		979
		980	freed_map->name = "/internal/freed_objects_map";
		981	freed_map->width = 3;
		982	freed_map->height = 3;
		983
		984	freed_map->allocate ();
		985	}
		986
		987	map = freed_map;
		988	x = 1;
		989	y = 1;
		990	}
		991
		992	// clear those pointers that likely might have circular references to us
999	owner = 0;	993	owner = 0;
		994	enemy = 0;
		995	attacked_by = 0;
		996
		997	// only relevant for players(?), but make sure of it anyways
		998	contr = 0;
1000		999
1001	/* Remove object from the active list */	1000	/* Remove object from the active list */
1002	speed = 0;	1001	speed = 0;
1003	update_ob_speed (this);	1002	update_ob_speed (this);
1004		1003
…		…
1016	sub_weight (object *op, signed long weight)	1015	sub_weight (object *op, signed long weight)
1017	{	1016	{
1018	while (op != NULL)	1017	while (op != NULL)
1019	{	1018	{
1020	if (op->type == CONTAINER)	1019	if (op->type == CONTAINER)
1021	{
1022	weight = (signed long) (weight * (100 - op->stats.Str) / 100);	1020	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1023	}	1021
1024	op->carrying -= weight;	1022	op->carrying -= weight;
1025	op = op->env;	1023	op = op->env;
1026	}	1024	}
1027	}	1025	}
1028		1026
…		…
1036	*/	1034	*/
1037		1035
1038	void	1036	void
1039	remove_ob (object *op)	1037	remove_ob (object *op)
1040	{	1038	{
		1039	object tmp, last = 0;
1041	object *	1040	object *otmp;
1042	tmp, *
1043	last = NULL;
1044	object *
1045	otmp;
1046		1041
1047	tag_t
1048	tag;
1049	int
1050	check_walk_off;	1042	int check_walk_off;
1051	mapstruct *	1043	maptile *m;
1052	m;
1053		1044
1054	sint16	1045	sint16 x, y;
1055	x,
1056	y;
1057		1046
1058	if (QUERY_FLAG (op, FLAG_REMOVED))	1047	if (QUERY_FLAG (op, FLAG_REMOVED))
1059	return;	1048	return;
1060		1049
1061	SET_FLAG (op, FLAG_REMOVED);	1050	SET_FLAG (op, FLAG_REMOVED);
…		…
1138	* use translated coordinates in case some oddness with map tiling is	1127	* use translated coordinates in case some oddness with map tiling is
1139	* evident	1128	* evident
1140	*/	1129	*/
1141	if (GET_MAP_OB (m, x, y) != op)	1130	if (GET_MAP_OB (m, x, y) != op)
1142	{	1131	{
1143	dump_object (op);	1132	char *dump = dump_object (op);
1144	LOG (llevError,	1133	LOG (llevError,
1145	"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg);	1134	"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);
		1135	free (dump);
1146	dump_object (GET_MAP_OB (m, x, y));	1136	dump = dump_object (GET_MAP_OB (m, x, y));
1147	LOG (llevError, "%s\n", errmsg);	1137	LOG (llevError, "%s\n", dump);
		1138	free (dump);
1148	}	1139	}
1149		1140
1150	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */	1141	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1151	}	1142	}
1152		1143
…		…
1154	op->below = 0;	1145	op->below = 0;
1155		1146
1156	if (op->map->in_memory == MAP_SAVING)	1147	if (op->map->in_memory == MAP_SAVING)
1157	return;	1148	return;
1158		1149
1159	tag = op->count;
1160	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);	1150	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1161		1151
1162	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1152	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1163	{	1153	{
1164	/* No point updating the players look faces if he is the object	1154	/* No point updating the players look faces if he is the object
…		…
1179		1169
1180	tmp->contr->socket.update_look = 1;	1170	tmp->contr->socket.update_look = 1;
1181	}	1171	}
1182		1172
1183	/* See if player moving off should effect something */	1173	/* See if player moving off should effect something */
1184	if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1174	if (check_walk_off
		1175	&& ((op->move_type & tmp->move_off)
		1176	&& (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1185	{	1177	{
1186	move_apply (tmp, op, NULL);	1178	move_apply (tmp, op, NULL);
1187		1179
1188	if (was_destroyed (op, tag))	1180	if (op->destroyed ())
1189	{
1190	LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name);	1181	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1191	}
1192	}	1182	}
1193		1183
1194	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1184	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1195		1185
1196	if (tmp->above == tmp)	1186	if (tmp->above == tmp)
…		…
1224	* This function goes through all objects below and including top, and	1214	* This function goes through all objects below and including top, and
1225	* merges op to the first matching object.	1215	* merges op to the first matching object.
1226	* If top is NULL, it is calculated.	1216	* If top is NULL, it is calculated.
1227	* Returns pointer to object if it succeded in the merge, otherwise NULL	1217	* Returns pointer to object if it succeded in the merge, otherwise NULL
1228	*/	1218	*/
1229
1230	object *	1219	object *
1231	merge_ob (object op, object top)	1220	merge_ob (object op, object top)
1232	{	1221	{
1233	if (!op->nrof)	1222	if (!op->nrof)
1234	return 0;	1223	return 0;
…		…
1250	free_object (op);	1239	free_object (op);
1251	return top;	1240	return top;
1252	}	1241	}
1253	}	1242	}
1254		1243
1255	return NULL;	1244	return 0;
1256	}	1245	}
1257		1246
1258	/*	1247	/*
1259	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1248	* same as insert_ob_in_map except it handle separate coordinates and do a clean
1260	* job preparing multi-part monsters	1249	* job preparing multi-part monsters
1261	*/	1250	*/
1262	object *	1251	object *
1263	insert_ob_in_map_at (object op, mapstruct m, object *originator, int flag, int x, int y)	1252	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1264	{	1253	{
1265	object *tmp;	1254	object *tmp;
1266		1255
1267	if (op->head)	1256	if (op->head)
1268	op = op->head;	1257	op = op->head;
…		…
1296	* NULL if 'op' was destroyed	1285	* NULL if 'op' was destroyed
1297	* just 'op' otherwise	1286	* just 'op' otherwise
1298	*/	1287	*/
1299		1288
1300	object *	1289	object *
1301	insert_ob_in_map (object op, mapstruct m, object *originator, int flag)	1290	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1302	{	1291	{
1303	object tmp, top, *floor = NULL;	1292	object tmp, top, *floor = NULL;
1304	sint16 x, y;	1293	sint16 x, y;
1305		1294
1306	if (QUERY_FLAG (op, FLAG_FREED))	1295	if (QUERY_FLAG (op, FLAG_FREED))
…		…
1309	return NULL;	1298	return NULL;
1310	}	1299	}
1311		1300
1312	if (m == NULL)	1301	if (m == NULL)
1313	{	1302	{
1314	dump_object (op);	1303	char *dump = dump_object (op);
1315	LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg);	1304	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
		1305	free (dump);
1316	return op;	1306	return op;
1317	}	1307	}
1318		1308
1319	if (out_of_map (m, op->x, op->y))	1309	if (out_of_map (m, op->x, op->y))
1320	{	1310	{
1321	dump_object (op);	1311	char *dump = dump_object (op);
1322	LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg);	1312	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1323	#ifdef MANY_CORES	1313	#ifdef MANY_CORES
1324	/* Better to catch this here, as otherwise the next use of this object	1314	/* Better to catch this here, as otherwise the next use of this object
1325	* is likely to cause a crash. Better to find out where it is getting	1315	* is likely to cause a crash. Better to find out where it is getting
1326	* improperly inserted.	1316	* improperly inserted.
1327	*/	1317	*/
1328	abort ();	1318	abort ();
1329	#endif	1319	#endif
		1320	free (dump);
1330	return op;	1321	return op;
1331	}	1322	}
1332		1323
1333	if (!QUERY_FLAG (op, FLAG_REMOVED))	1324	if (!QUERY_FLAG (op, FLAG_REMOVED))
1334	{	1325	{
1335	dump_object (op);	1326	char *dump = dump_object (op);
1336	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg);	1327	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
		1328	free (dump);
1337	return op;	1329	return op;
1338	}	1330	}
1339		1331
1340	if (op->more != NULL)	1332	if (op->more != NULL)
1341	{	1333	{
…		…
1587	remove_ob (tmp);	1579	remove_ob (tmp);
1588	free_object (tmp);	1580	free_object (tmp);
1589	}	1581	}
1590	}	1582	}
1591		1583
1592	tmp1 = arch_to_object (find_archetype (arch_string));	1584	tmp1 = arch_to_object (archetype::find (arch_string));
1593		1585
1594	tmp1->x = op->x;	1586	tmp1->x = op->x;
1595	tmp1->y = op->y;	1587	tmp1->y = op->y;
1596	insert_ob_in_map (tmp1, op->map, op, 0);	1588	insert_ob_in_map (tmp1, op->map, op, 0);
1597	}	1589	}
…		…
1778	tmp, *	1770	tmp, *
1779	otmp;	1771	otmp;
1780		1772
1781	if (!QUERY_FLAG (op, FLAG_REMOVED))	1773	if (!QUERY_FLAG (op, FLAG_REMOVED))
1782	{	1774	{
1783	dump_object (op);	1775	char *dump = dump_object (op);
1784	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);	1776	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", dump);
		1777	free (dump);
1785	return op;	1778	return op;
1786	}	1779	}
1787		1780
1788	if (where == NULL)	1781	if (where == NULL)
1789	{	1782	{
1790	dump_object (op);	1783	char *dump = dump_object (op);
1791	LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);	1784	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
		1785	free (dump);
1792	return op;	1786	return op;
1793	}	1787	}
1794		1788
1795	if (where->head)	1789	if (where->head)
1796	{	1790	{
…		…
1896	*/	1890	*/
1897		1891
1898	int	1892	int
1899	check_move_on (object op, object originator)	1893	check_move_on (object op, object originator)
1900	{	1894	{
1901	object *	1895	object *tmp;
1902	tmp;	1896	maptile *m = op->map;
1903	tag_t
1904	tag;
1905	mapstruct *
1906	m = op->map;
1907	int
1908	x = op->x, y = op->y;	1897	int x = op->x, y = op->y;
1909		1898
1910	MoveType	1899	MoveType move_on, move_slow, move_block;
1911	move_on,
1912	move_slow,
1913	move_block;
1914		1900
1915	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1901	if (QUERY_FLAG (op, FLAG_NO_APPLY))
1916	return 0;	1902	return 0;
1917
1918	tag = op->count;
1919		1903
1920	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1904	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
1921	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1905	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
1922	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1906	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1923		1907
…		…
1984	if ((!op->move_type && tmp->move_on & MOVE_WALK) \|\|	1968	if ((!op->move_type && tmp->move_on & MOVE_WALK) \|\|
1985	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))	1969	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
1986	{	1970	{
1987	move_apply (tmp, op, originator);	1971	move_apply (tmp, op, originator);
1988		1972
1989	if (was_destroyed (op, tag))	1973	if (op->destroyed ())
1990	return 1;	1974	return 1;
1991		1975
1992	/* what the person/creature stepped onto has moved the object	1976	/* what the person/creature stepped onto has moved the object
1993	* someplace new. Don't process any further - if we did,	1977	* someplace new. Don't process any further - if we did,
1994	* have a feeling strange problems would result.	1978	* have a feeling strange problems would result.
…		…
2006	* a matching archetype at the given map and coordinates.	1990	* a matching archetype at the given map and coordinates.
2007	* The first matching object is returned, or NULL if none.	1991	* The first matching object is returned, or NULL if none.
2008	*/	1992	*/
2009		1993
2010	object *	1994	object *
2011	present_arch (const archetype at, mapstruct m, int x, int y)	1995	present_arch (const archetype at, maptile m, int x, int y)
2012	{	1996	{
2013	object *	1997	object *
2014	tmp;	1998	tmp;
2015		1999
2016	if (m == NULL \|\| out_of_map (m, x, y))	2000	if (m == NULL \|\| out_of_map (m, x, y))
…		…
2029	* a matching type variable at the given map and coordinates.	2013	* a matching type variable at the given map and coordinates.
2030	* The first matching object is returned, or NULL if none.	2014	* The first matching object is returned, or NULL if none.
2031	*/	2015	*/
2032		2016
2033	object *	2017	object *
2034	present (unsigned char type, mapstruct *m, int x, int y)	2018	present (unsigned char type, maptile *m, int x, int y)
2035	{	2019	{
2036	object *	2020	object *
2037	tmp;	2021	tmp;
2038		2022
2039	if (out_of_map (m, x, y))	2023	if (out_of_map (m, x, y))
…		…
2179	* the archetype because that isn't correct if the monster has been	2163	* the archetype because that isn't correct if the monster has been
2180	* customized, changed states, etc.	2164	* customized, changed states, etc.
2181	*/	2165	*/
2182		2166
2183	int	2167	int
2184	find_free_spot (const object ob, mapstruct m, int x, int y, int start, int stop)	2168	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)
2185	{	2169	{
2186	int	2170	int
2187	i,	2171	i,
2188	index = 0, flag;	2172	index = 0, flag;
2189	static int	2173	static int
…		…
2210	return -1;	2194	return -1;
2211	return altern[RANDOM () % index];	2195	return altern[RANDOM () % index];
2212	}	2196	}
2213		2197
2214	/*	2198	/*
2215	* find_first_free_spot(archetype, mapstruct, x, y) works like	2199	* find_first_free_spot(archetype, maptile, x, y) works like
2216	* find_free_spot(), but it will search max number of squares.	2200	* find_free_spot(), but it will search max number of squares.
2217	* But it will return the first available spot, not a random choice.	2201	* But it will return the first available spot, not a random choice.
2218	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2202	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2219	*/	2203	*/
2220		2204
2221	int	2205	int
2222	find_first_free_spot (const object ob, mapstruct m, int x, int y)	2206	find_first_free_spot (const object ob, maptile m, int x, int y)
2223	{	2207	{
2224	int	2208	int
2225	i;	2209	i;
2226		2210
2227	for (i = 0; i < SIZEOFFREE; i++)	2211	for (i = 0; i < SIZEOFFREE; i++)
…		…
2291	* because we have to know what movement the thing looking to move	2275	* because we have to know what movement the thing looking to move
2292	* there is capable of.	2276	* there is capable of.
2293	*/	2277	*/
2294		2278
2295	int	2279	int
2296	find_dir (mapstruct m, int x, int y, object exclude)	2280	find_dir (maptile m, int x, int y, object exclude)
2297	{	2281	{
2298	int	2282	int
2299	i,	2283	i,
2300	max = SIZEOFFREE, mflags;	2284	max = SIZEOFFREE, mflags;
2301		2285
2302	sint16 nx, ny;	2286	sint16 nx, ny;
2303	object *	2287	object *
2304	tmp;	2288	tmp;
2305	mapstruct *	2289	maptile *
2306	mp;	2290	mp;
2307		2291
2308	MoveType blocked, move_type;	2292	MoveType blocked, move_type;
2309		2293
2310	if (exclude && exclude->head)	2294	if (exclude && exclude->head)
…		…
2518	* Modified to be map tile aware -.MSW	2502	* Modified to be map tile aware -.MSW
2519	*/	2503	*/
2520		2504
2521		2505
2522	int	2506	int
2523	can_see_monsterP (mapstruct *m, int x, int y, int dir)	2507	can_see_monsterP (maptile *m, int x, int y, int dir)
2524	{	2508	{
2525	sint16 dx, dy;	2509	sint16 dx, dy;
2526	int	2510	int
2527	mflags;	2511	mflags;
2528		2512
…		…
2608	if (prev)	2592	if (prev)
2609	prev->more = tmp;	2593	prev->more = tmp;
2610	prev = tmp;	2594	prev = tmp;
2611	}	2595	}
2612		2596
2613	/* copy inventory */
2614	for (item = src->inv; item; item = item->below)	2597	for (item = src->inv; item; item = item->below)
2615	{
2616	(void) insert_ob_in_ob (object_create_clone (item), dst);	2598	insert_ob_in_ob (object_create_clone (item), dst);
2617	}
2618		2599
2619	return dst;	2600	return dst;
2620	}	2601	}
2621		2602
2622	/* return true if the object was destroyed, 0 otherwise */
2623	int
2624	was_destroyed (const object *op, tag_t old_tag)
2625	{
2626	/* checking for FLAG_FREED isn't necessary, but makes this function more
2627	* robust */
2628	return op->count != old_tag \|\| QUERY_FLAG (op, FLAG_FREED);
2629	}
2630
2631	/* GROS - Creates an object using a string representing its content. */	2603	/* GROS - Creates an object using a string representing its content. */
2632
2633	/* Basically, we save the content of the string to a temp file, then call */	2604	/* Basically, we save the content of the string to a temp file, then call */
2634
2635	/* load_object on it. I admit it is a highly inefficient way to make things, */	2605	/* load_object on it. I admit it is a highly inefficient way to make things, */
2636
2637	/* but it was simple to make and allows reusing the load_object function. */	2606	/* but it was simple to make and allows reusing the load_object function. */
2638
2639	/* Remember not to use load_object_str in a time-critical situation. */	2607	/* Remember not to use load_object_str in a time-critical situation. */
2640
2641	/* Also remember that multiparts objects are not supported for now. */	2608	/* Also remember that multiparts objects are not supported for now. */
2642		2609
2643	object *	2610	object *
2644	load_object_str (const char *obstr)	2611	load_object_str (const char *obstr)
2645	{	2612	{
2646	object *	2613	object *op;
2647	op;
2648	char
2649	filename[MAX_BUF];	2614	char filename[MAX_BUF];
2650		2615
2651	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);	2616	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2652		2617
2653	FILE *
2654	tempfile = fopen (filename, "w");	2618	FILE *tempfile = fopen (filename, "w");
2655		2619
2656	if (tempfile == NULL)	2620	if (tempfile == NULL)
2657	{	2621	{
2658	LOG (llevError, "Error - Unable to access load object temp file\n");	2622	LOG (llevError, "Error - Unable to access load object temp file\n");
2659	return NULL;	2623	return NULL;
2660	};	2624	}
		2625
2661	fprintf (tempfile, obstr);	2626	fprintf (tempfile, obstr);
2662	fclose (tempfile);	2627	fclose (tempfile);
2663		2628
2664	op = get_object ();	2629	op = get_object ();
2665		2630
…		…
2679	* returns NULL if no match.	2644	* returns NULL if no match.
2680	*/	2645	*/
2681	object *	2646	object *
2682	find_obj_by_type_subtype (const object *who, int type, int subtype)	2647	find_obj_by_type_subtype (const object *who, int type, int subtype)
2683	{	2648	{
2684	object *	2649	object *tmp;
2685	tmp;
2686		2650
2687	for (tmp = who->inv; tmp; tmp = tmp->below)	2651	for (tmp = who->inv; tmp; tmp = tmp->below)
2688	if (tmp->type == type && tmp->subtype == subtype)	2652	if (tmp->type == type && tmp->subtype == subtype)
2689	return tmp;	2653	return tmp;
2690		2654
…		…
2698	* do the desired thing.	2662	* do the desired thing.
2699	*/	2663	*/
2700	key_value *	2664	key_value *
2701	get_ob_key_link (const object ob, const char key)	2665	get_ob_key_link (const object ob, const char key)
2702	{	2666	{
2703	key_value *	2667	key_value *link;
2704	link;
2705		2668
2706	for (link = ob->key_values; link != NULL; link = link->next)	2669	for (link = ob->key_values; link != NULL; link = link->next)
2707	{
2708	if (link->key == key)	2670	if (link->key == key)
2709	{
2710	return link;	2671	return link;
2711	}
2712	}
2713		2672
2714	return NULL;	2673	return NULL;
2715	}	2674	}
2716		2675
2717	/*	2676	/*
…		…
2722	* The returned string is shared.	2681	* The returned string is shared.
2723	*/	2682	*/
2724	const char *	2683	const char *
2725	get_ob_key_value (const object op, const char const key)	2684	get_ob_key_value (const object op, const char const key)
2726	{	2685	{
2727	key_value *	2686	key_value *link;
2728	link;	2687	shstr_cmp canonical_key (key);
2729	const char *
2730	canonical_key;
2731		2688
2732	canonical_key = shstr::find (key);
2733
2734	if (canonical_key == NULL)	2689	if (!canonical_key)
2735	{	2690	{
2736	/* 1. There being a field named key on any object	2691	/* 1. There being a field named key on any object
2737	* implies there'd be a shared string to find.	2692	* implies there'd be a shared string to find.
2738	* 2. Since there isn't, no object has this field.	2693	* 2. Since there isn't, no object has this field.
2739	* 3. Therefore, this object doesn't have this field.	2694	* 3. Therefore, this object doesn't have this field.
2740	*/	2695	*/
2741	return NULL;	2696	return 0;
2742	}	2697	}
2743		2698
2744	/* This is copied from get_ob_key_link() above -	2699	/* This is copied from get_ob_key_link() above -
2745	* only 4 lines, and saves the function call overhead.	2700	* only 4 lines, and saves the function call overhead.
2746	*/	2701	*/
2747	for (link = op->key_values; link != NULL; link = link->next)	2702	for (link = op->key_values; link; link = link->next)
2748	{
2749	if (link->key == canonical_key)	2703	if (link->key == canonical_key)
2750	{
2751	return link->value;	2704	return link->value;
2752	}	2705
2753	}
2754	return NULL;	2706	return 0;
2755	}	2707	}
2756		2708
2757		2709
2758	/*	2710	/*
2759	* Updates the canonical_key in op to value.	2711	* Updates the canonical_key in op to value.
…		…
2845	shstr key_ (key);	2797	shstr key_ (key);
2846		2798
2847	return set_ob_key_value_s (op, key_, value, add_key);	2799	return set_ob_key_value_s (op, key_, value, add_key);
2848	}	2800	}
2849		2801
		2802	object::depth_iterator::depth_iterator (object *container)
		2803	: iterator_base (container)
		2804	{
		2805	while (item->inv)
		2806	item = item->inv;
		2807	}
		2808
2850	void	2809	void
2851	object::deep_iterator::next ()	2810	object::depth_iterator::next ()
2852	{	2811	{
2853	if (item->inv)
2854	item = item->inv;
2855	else if (item->below)	2812	if (item->below)
		2813	{
2856	item = item->below;	2814	item = item->below;
		2815
		2816	while (item->inv)
		2817	item = item->inv;
		2818	}
2857	else	2819	else
2858	item = item->env->below;	2820	item = item->env;
2859	}	2821	}
		2822
		2823	// return a suitable string describing an objetc in enough detail to find it
		2824	const char *
		2825	object::debug_desc (char *info) const
		2826	{
		2827	char info2[256 * 3];
		2828	char *p = info;
		2829
		2830	p += snprintf (p, 256, "%d=\"%s%s%s\"",
		2831	count,
		2832	&name,
		2833	title ? " " : "",
		2834	title ? (const char *)title : "");
		2835
		2836	if (env)
		2837	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
		2838
		2839	if (map)
		2840	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);
		2841
		2842	return info;
		2843	}
		2844
		2845	const char *
		2846	object::debug_desc () const
		2847	{
		2848	static char info[256 * 3];
		2849	return debug_desc (info);
		2850	}
		2851

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.31 by root, Mon Sep 11 23:33:27 2006 UTC vs. Revision 1.57 by root, Sun Dec 3 02:46:33 2006 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.31 by root, Mon Sep 11 23:33:27 2006 UTC vs.
Revision 1.57 by root, Sun Dec 3 02:46:33 2006 UTC