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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.38 by root, Wed Sep 13 01:09:24 2006 UTC vs.
Revision 1.56 by root, Sun Dec 3 02:04:57 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. */
…		…
32	#include <object.h>	31	#include <object.h>
33	#include <funcpoint.h>	32	#include <funcpoint.h>
34	#include <loader.h>	33	#include <loader.h>
35		34
36	int nrofallocobjects = 0;	35	int nrofallocobjects = 0;
		36	static UUID uuid;
		37	const uint64 UUID_SKIP = 1<<19;
37		38
38	object objects; / Pointer to the list of used objects */
39	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 */
40		40
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,	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,
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	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
43	};	43	};
…		…
49	};	49	};
50	int freedir[SIZEOFFREE] = {	50	int freedir[SIZEOFFREE] = {
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,	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,
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	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
53	};	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	}
54		131
55	/* 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. */
56	static int	133	static int
57	compare_ob_value_lists_one (const object wants, const object has)	134	compare_ob_value_lists_one (const object wants, const object has)
58	{	135	{
…		…
297	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	374	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
298	* Some error messages.	375	* Some error messages.
299	* 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.
300	*/	377	*/
301		378
302	void	379	char *
303	dump_object2 (object *op)
304	{
305	errmsg[0] = 0;
306	return;
307	//TODO//D#d#
308	#if 0
309	char *cp;
310
311	/* object tmp;/
312
313	if (op->arch != NULL)
314	{
315	strcat (errmsg, "arch ");
316	strcat (errmsg, op->arch->name ? op->arch->name : "(null)");
317	strcat (errmsg, "\n");
318	if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
319	strcat (errmsg, cp);
320	# if 0
321	/* Don't dump player diffs - they are too long, mostly meaningless, and
322	* will overflow the buffer.
323	* Changed so that we don't dump inventory either. This may
324	* also overflow the buffer.
325	*/
326	if (op->type != PLAYER && (cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
327	strcat (errmsg, cp);
328	for (tmp = op->inv; tmp; tmp = tmp->below)
329	dump_object2 (tmp);
330	# endif
331	strcat (errmsg, "end\n");
332	}
333	else
334	{
335	strcat (errmsg, "Object ");
336	if (op->name == NULL)
337	strcat (errmsg, "(null)");
338	else
339	strcat (errmsg, op->name);
340	strcat (errmsg, "\n");
341	# if 0
342	if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
343	strcat (errmsg, cp);
344	for (tmp = op->inv; tmp; tmp = tmp->below)
345	dump_object2 (tmp);
346	# endif
347	strcat (errmsg, "end\n");
348	}
349	#endif
350	}
351
352	/*
353	* Dumps an object. Returns output in the static global errmsg array.
354	*/
355
356	void
357	dump_object (object *op)	380	dump_object (object *op)
358	{	381	{
359	if (op == NULL)	382	if (!op)
360	{	383	return strdup ("[NULLOBJ]");
361	strcpy (errmsg, "[NULL pointer]");
362	return;
363	}
364	errmsg[0] = '\0';
365	dump_object2 (op);
366	}
367		384
368	void	385	object_freezer freezer;
369	dump_all_objects (void)	386	save_object (freezer, op, 3);
370	{	387	return freezer.as_string ();
371	object *op;
372
373	for (op = objects; op != NULL; op = op->next)
374	{
375	dump_object (op);
376	fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg);
377	}
378	}	388	}
379		389
380	/*	390	/*
381	* 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
382	* multi-object 1 which is closest to the second object.	392	* multi-object 1 which is closest to the second object.
…		…
402	*/	412	*/
403		413
404	object *	414	object *
405	find_object (tag_t i)	415	find_object (tag_t i)
406	{	416	{
407	object *op;	417	for (object *op = object::first; op; op = op->next)
408
409	for (op = objects; op != NULL; op = op->next)
410	if (op->count == i)	418	if (op->count == i)
411	break;	419	return op;
		420
412	return op;	421	return 0;
413	}	422	}
414		423
415	/*	424	/*
416	* 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.
417	* Used only by the patch command, but not all that useful.	426	* Used only by the patch command, but not all that useful.
…		…
422	find_object_name (const char *str)	431	find_object_name (const char *str)
423	{	432	{
424	shstr_cmp str_ (str);	433	shstr_cmp str_ (str);
425	object *op;	434	object *op;
426		435
427	for (op = objects; op != NULL; op = op->next)	436	for (op = object::first; op != NULL; op = op->next)
428	if (op->name == str_)	437	if (op->name == str_)
429	break;	438	break;
430		439
431	return op;	440	return op;
432	}	441	}
433		442
434	void	443	void
435	free_all_object_data ()	444	free_all_object_data ()
436	{	445	{
437	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);	446	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
438	}
439
440	/*
441	* Returns the object which this object marks as being the owner.
442	* A id-scheme is used to avoid pointing to objects which have been
443	* freed and are now reused. If this is detected, the owner is
444	* set to NULL, and NULL is returned.
445	* Changed 2004-02-12 - if the player is setting at the play again
446	* prompt, he is removed, and we don't want to treat him as an owner of
447	* anything, so check removed flag. I don't expect that this should break
448	* anything - once an object is removed, it is basically dead anyways.
449	*/
450	object *
451	object::get_owner ()
452	{
453	if (!owner
454	\|\| QUERY_FLAG (owner, FLAG_FREED)
455	\|\| QUERY_FLAG (owner, FLAG_REMOVED))
456	owner = 0;
457
458	return owner;
459	}	447	}
460		448
461	/*	449	/*
462	* 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
463	* skill and experience objects.	451	* skill and experience objects.
…		…
533		521
534	/* What is not cleared is next, prev, and count */	522	/* What is not cleared is next, prev, and count */
535		523
536	expmul = 1.0;	524	expmul = 1.0;
537	face = blank_face;	525	face = blank_face;
538	attacked_by_count = -1;
539		526
540	if (settings.casting_time)	527	if (settings.casting_time)
541	casting_time = -1;	528	casting_time = -1;
542	}	529	}
543		530
…		…
838		825
839	if (op->more != NULL)	826	if (op->more != NULL)
840	update_object (op->more, action);	827	update_object (op->more, action);
841	}	828	}
842		829
843	static unordered_vector<object *> mortals;	830	object::vector object::mortals;
844	static std::vector<object , slice_allocator <object > > freed;	831	object::vector object::objects; // not yet used
		832	object *object::first;
845		833
846	void object::free_mortals ()	834	void object::free_mortals ()
847	{	835	{
848	for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end ();)	836	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
849	if ((*i)->refcnt)	837	if ((*i)->refcnt)
850	++i; // further delay freeing	838	++i; // further delay freeing
851	else	839	else
852	{	840	{
853	freed.push_back (*i);//D
854	//delete *i;	841	delete *i;
855	mortals.erase (i);	842	mortals.erase (i);
856	}	843	}
857		844
858	if (mortals.size() && 0)//D	845	static int lastmortals = 0;//D
		846
		847	if (mortals.size() != lastmortals && lastmortals > 100)//D
		848	{
		849	lastmortals = mortals.size ();//D
859	LOG (llevDebug, "%d objects in mortal queue\n", mortals.size());//D	850	LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
		851	}
860	}	852	}
861		853
862	object::object ()	854	object::object ()
863	{	855	{
864	SET_FLAG (this, FLAG_REMOVED);	856	SET_FLAG (this, FLAG_REMOVED);
865		857
866	expmul = 1.0;	858	expmul = 1.0;
867	face = blank_face;	859	face = blank_face;
868	attacked_by_count = -1;
869	}	860	}
870		861
871	object::~object ()	862	object::~object ()
872	{	863	{
873	free_key_values (this);	864	free_key_values (this);
874	}	865	}
875		866
876	void object::link ()	867	void object::link ()
877	{	868	{
878	count = ++ob_count;	869	count = ++ob_count;
		870	uuid = gen_uuid ();
879		871
880	prev = 0;	872	prev = 0;
881	next = objects;	873	next = object::first;
882		874
883	if (objects)	875	if (object::first)
884	objects->prev = this;	876	object::first->prev = this;
885		877
886	objects = this;	878	object::first = this;
887	}	879	}
888		880
889	void object::unlink ()	881	void object::unlink ()
890	{	882	{
891	count = 0;
892
893	if (this == objects)	883	if (this == object::first)
894	objects = next;	884	object::first = next;
895		885
896	/* Remove this object from the list of used objects */	886	/* Remove this object from the list of used objects */
897	if (prev)
898	{
899	prev->next = next;	887	if (prev) prev->next = next;
		888	if (next) next->prev = prev;
		889
900	prev = 0;	890	prev = 0;
901	}
902
903	if (next)
904	{
905	next->prev = prev;
906	next = 0;	891	next = 0;
907	}
908	}	892	}
909		893
910	object *object::create ()	894	object *object::create ()
911	{	895	{
912	object *op;
913
914	if (freed.empty ())
915	op = new object;	896	object *op = new object;
916	else
917	{
918	// highly annoying, but the only way to get it stable right now
919	op = freed.back ();
920	freed.pop_back ();
921	op->~object ();
922	new ((void *) op) object;
923	}
924
925	op->link ();	897	op->link ();
926	return op;	898	return op;
927	}	899	}
928		900
929	/*	901	/*
…		…
931	* 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
932	* free objects. The IS_FREED() flag is set in the object.	904	* free objects. The IS_FREED() flag is set in the object.
933	* The object must have been removed by remove_ob() first for	905	* The object must have been removed by remove_ob() first for
934	* this function to succeed.	906	* this function to succeed.
935	*	907	*
936	* 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
937	* inventory to the ground.	909	* inventory to the ground.
938	*/	910	*/
939	void object::free (bool free_inventory)	911	void object::destroy (bool destroy_inventory)
940	{	912	{
941	if (QUERY_FLAG (this, FLAG_FREED))	913	if (QUERY_FLAG (this, FLAG_FREED))
942	return;	914	return;
943		915
944	if (QUERY_FLAG (this, FLAG_FRIENDLY))	916	if (QUERY_FLAG (this, FLAG_FRIENDLY))
…		…
947	if (!QUERY_FLAG (this, FLAG_REMOVED))	919	if (!QUERY_FLAG (this, FLAG_REMOVED))
948	remove_ob (this);	920	remove_ob (this);
949		921
950	SET_FLAG (this, FLAG_FREED);	922	SET_FLAG (this, FLAG_FREED);
951		923
		924	// hack to ensure that freed objects still have a valid map
		925	{
		926	static maptile *freed_map; // freed objects are moved here to avoid crashes
		927
		928	if (!freed_map)
		929	{
		930	freed_map = new maptile;
		931
		932	freed_map->name = "/internal/freed_objects_map";
		933	freed_map->width = 3;
		934	freed_map->height = 3;
		935
		936	freed_map->allocate ();
		937	}
		938
		939	map = freed_map;
		940	x = 1;
		941	y = 1;
		942	}
		943
952	if (more)	944	if (more)
953	{	945	{
954	more->free (free_inventory);	946	more->destroy (destroy_inventory);
955	more = 0;	947	more = 0;
956	}	948	}
957		949
958	if (inv)	950	if (inv)
959	{	951	{
960	/* Only if the space blocks everything do we not process -	952	/* Only if the space blocks everything do we not process -
961	* if some form of movement is allowed, let objects	953	* if some form of movement is allowed, let objects
962	* drop on that space.	954	* drop on that space.
963	*/	955	*/
964	if (free_inventory \|\| !map \|\| map->in_memory != MAP_IN_MEMORY \|\| GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)	956	if (destroy_inventory \|\| !map \|\| map->in_memory != MAP_IN_MEMORY \|\| GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
965	{	957	{
966	object *op = inv;	958	object *op = inv;
967		959
968	while (op)	960	while (op)
969	{	961	{
970	object *tmp = op->below;	962	object *tmp = op->below;
971	op->free (free_inventory);	963	op->destroy (destroy_inventory);
972	op = tmp;	964	op = tmp;
973	}	965	}
974	}	966	}
975	else	967	else
976	{ /* Put objects in inventory onto this space */	968	{ /* Put objects in inventory onto this space */
…		…
995	op = tmp;	987	op = tmp;
996	}	988	}
997	}	989	}
998	}	990	}
999		991
		992	// clear those pointers that likely might have circular references to us
1000	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;
1001		999
1002	/* Remove object from the active list */	1000	/* Remove object from the active list */
1003	speed = 0;	1001	speed = 0;
1004	update_ob_speed (this);	1002	update_ob_speed (this);
1005		1003
…		…
1017	sub_weight (object *op, signed long weight)	1015	sub_weight (object *op, signed long weight)
1018	{	1016	{
1019	while (op != NULL)	1017	while (op != NULL)
1020	{	1018	{
1021	if (op->type == CONTAINER)	1019	if (op->type == CONTAINER)
1022	{
1023	weight = (signed long) (weight * (100 - op->stats.Str) / 100);	1020	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1024	}	1021
1025	op->carrying -= weight;	1022	op->carrying -= weight;
1026	op = op->env;	1023	op = op->env;
1027	}	1024	}
1028	}	1025	}
1029		1026
…		…
1037	*/	1034	*/
1038		1035
1039	void	1036	void
1040	remove_ob (object *op)	1037	remove_ob (object *op)
1041	{	1038	{
		1039	object tmp, last = 0;
1042	object *	1040	object *otmp;
1043	tmp, *
1044	last = NULL;
1045	object *
1046	otmp;
1047		1041
1048	tag_t
1049	tag;
1050	int
1051	check_walk_off;	1042	int check_walk_off;
1052	mapstruct *	1043	maptile *m;
1053	m;
1054		1044
1055	sint16	1045	sint16 x, y;
1056	x,
1057	y;
1058		1046
1059	if (QUERY_FLAG (op, FLAG_REMOVED))	1047	if (QUERY_FLAG (op, FLAG_REMOVED))
1060	return;	1048	return;
1061		1049
1062	SET_FLAG (op, FLAG_REMOVED);	1050	SET_FLAG (op, FLAG_REMOVED);
…		…
1139	* use translated coordinates in case some oddness with map tiling is	1127	* use translated coordinates in case some oddness with map tiling is
1140	* evident	1128	* evident
1141	*/	1129	*/
1142	if (GET_MAP_OB (m, x, y) != op)	1130	if (GET_MAP_OB (m, x, y) != op)
1143	{	1131	{
1144	dump_object (op);	1132	char *dump = dump_object (op);
1145	LOG (llevError,	1133	LOG (llevError,
1146	"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);
1147	dump_object (GET_MAP_OB (m, x, y));	1136	dump = dump_object (GET_MAP_OB (m, x, y));
1148	LOG (llevError, "%s\n", errmsg);	1137	LOG (llevError, "%s\n", dump);
		1138	free (dump);
1149	}	1139	}
1150		1140
1151	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. */
1152	}	1142	}
1153		1143
…		…
1155	op->below = 0;	1145	op->below = 0;
1156		1146
1157	if (op->map->in_memory == MAP_SAVING)	1147	if (op->map->in_memory == MAP_SAVING)
1158	return;	1148	return;
1159		1149
1160	tag = op->count;
1161	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);	1150	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1162		1151
1163	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)
1164	{	1153	{
1165	/* 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
…		…
1180		1169
1181	tmp->contr->socket.update_look = 1;	1170	tmp->contr->socket.update_look = 1;
1182	}	1171	}
1183		1172
1184	/* See if player moving off should effect something */	1173	/* See if player moving off should effect something */
1185	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))
1186	{	1177	{
1187	move_apply (tmp, op, NULL);	1178	move_apply (tmp, op, NULL);
1188		1179
1189	if (was_destroyed (op, tag))	1180	if (op->destroyed ())
1190	{
1191	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 ());
1192	}
1193	}	1182	}
1194		1183
1195	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1184	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1196		1185
1197	if (tmp->above == tmp)	1186	if (tmp->above == tmp)
…		…
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	/*

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.38 by root, Wed Sep 13 01:09:24 2006 UTC vs. Revision 1.56 by root, Sun Dec 3 02:04:57 2006 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.38 by root, Wed Sep 13 01:09:24 2006 UTC vs.
Revision 1.56 by root, Sun Dec 3 02:04:57 2006 UTC