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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.112 by root, Mon Jan 8 14:11:04 2007 UTC vs.
Revision 1.143 by root, Tue May 1 05:48:20 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>
324	sum_weight (object *op)	324	sum_weight (object *op)
325	{	325	{
326	long sum;	326	long sum;
327	object *inv;	327	object *inv;
328		328
329	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	329	for (sum = 0, inv = op->inv; inv; inv = inv->below)
330	{	330	{
331	if (inv->inv)	331	if (inv->inv)
332	sum_weight (inv);	332	sum_weight (inv);
		333
333	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
334	}	335	}
335		336
336	if (op->type == CONTAINER && op->stats.Str)	337	if (op->type == CONTAINER && op->stats.Str)
337	sum = (sum * (100 - op->stats.Str)) / 100;	338	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
357	/*	358	/*
358	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	359	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
359	* Some error messages.	360	* Some error messages.
360	* 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.
361	*/	362	*/
362
363	char *	363	char *
364	dump_object (object *op)	364	dump_object (object *op)
365	{	365	{
366	if (!op)	366	if (!op)
367	return strdup ("[NULLOBJ]");	367	return strdup ("[NULLOBJ]");
368		368
369	object_freezer freezer;	369	object_freezer freezer;
370	save_object (freezer, op, 1);	370	op->write (freezer);
371	return freezer.as_string ();	371	return freezer.as_string ();
372	}	372	}
373		373
374	/*	374	/*
375	* 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
…		…
455	* refcounts and freeing the links.	455	* refcounts and freeing the links.
456	*/	456	*/
457	static void	457	static void
458	free_key_values (object *op)	458	free_key_values (object *op)
459	{	459	{
460	for (key_value *i = op->key_values; i != 0;)	460	for (key_value *i = op->key_values; i; )
461	{	461	{
462	key_value *next = i->next;	462	key_value *next = i->next;
463	delete i;	463	delete i;
464		464
465	i = next;	465	i = next;
466	}	466	}
467		467
468	op->key_values = 0;	468	op->key_values = 0;
469	}	469	}
470		470
471	/*	471	object &
472	* copy_to first frees everything allocated by the dst object,	472	object::operator =(const object &src)
473	* and then copies the contents of itself into the second
474	* object, allocating what needs to be allocated. Basically, any
475	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
476	* if the first object is freed, the pointers in the new object
477	* will point at garbage.
478	*/
479	void
480	object::copy_to (object *dst)
481	{	473	{
482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	474	bool is_freed = flag [FLAG_FREED];
483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	475	bool is_removed = flag [FLAG_REMOVED];
484		476
485	(object_copy )dst = *this;	477	(object_copy )this = src;
486		478
487	if (is_freed)	479	flag [FLAG_FREED] = is_freed;
488	SET_FLAG (dst, FLAG_FREED);	480	flag [FLAG_REMOVED] = is_removed;
489
490	if (is_removed)
491	SET_FLAG (dst, FLAG_REMOVED);
492
493	if (speed < 0)
494	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
495		481
496	/* Copy over key_values, if any. */	482	/* Copy over key_values, if any. */
497	if (key_values)	483	if (src.key_values)
498	{	484	{
499	key_value *tail = 0;	485	key_value *tail = 0;
500	key_value *i;
501
502	dst->key_values = 0;	486	key_values = 0;
503		487
504	for (i = key_values; i; i = i->next)	488	for (key_value *i = src.key_values; i; i = i->next)
505	{	489	{
506	key_value *new_link = new key_value;	490	key_value *new_link = new key_value;
507		491
508	new_link->next = 0;	492	new_link->next = 0;
509	new_link->key = i->key;	493	new_link->key = i->key;
510	new_link->value = i->value;	494	new_link->value = i->value;
511		495
512	/* Try and be clever here, too. */	496	/* Try and be clever here, too. */
513	if (!dst->key_values)	497	if (!key_values)
514	{	498	{
515	dst->key_values = new_link;	499	key_values = new_link;
516	tail = new_link;	500	tail = new_link;
517	}	501	}
518	else	502	else
519	{	503	{
520	tail->next = new_link;	504	tail->next = new_link;
521	tail = new_link;	505	tail = new_link;
522	}	506	}
523	}	507	}
524	}	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 ();
525		526
526	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 ();
527	}	546	}
528		547
529	object *	548	object *
530	object::clone ()	549	object::clone ()
531	{	550	{
…		…
589	* UP_OBJ_FACE: only the objects face has changed.	608	* UP_OBJ_FACE: only the objects face has changed.
590	*/	609	*/
591	void	610	void
592	update_object (object *op, int action)	611	update_object (object *op, int action)
593	{	612	{
594	MoveType move_on, move_off, move_block, move_slow;
595
596	if (op == NULL)	613	if (op == NULL)
597	{	614	{
598	/* this should never happen */	615	/* this should never happen */
599	LOG (llevDebug, "update_object() called for NULL object.\n");	616	LOG (llevDebug, "update_object() called for NULL object.\n");
600	return;	617	return;
…		…
660		677
661	if (op->more)	678	if (op->more)
662	update_object (op->more, action);	679	update_object (op->more, action);
663	}	680	}
664		681
665	object *object::first;
666
667	object::object ()	682	object::object ()
668	{	683	{
669	SET_FLAG (this, FLAG_REMOVED);	684	SET_FLAG (this, FLAG_REMOVED);
670		685
671	expmul = 1.0;	686	expmul = 1.0;
672	face = blank_face;	687	face = blank_face;
673	}	688	}
674		689
675	object::~object ()	690	object::~object ()
676	{	691	{
		692	unlink ();
		693
677	free_key_values (this);	694	free_key_values (this);
678	}	695	}
679		696
680	static int object_count;	697	static int object_count;
681		698
…		…
689	objects.insert (this);	706	objects.insert (this);
690	}	707	}
691		708
692	void object::unlink ()	709	void object::unlink ()
693	{	710	{
694	assert (index);//D	711	if (!index)
		712	return;
		713
695	objects.erase (this);	714	objects.erase (this);
696	refcnt_dec ();	715	refcnt_dec ();
697	}	716	}
698		717
699	void	718	void
…		…
773	* drop on that space.	792	* drop on that space.
774	*/	793	*/
775	if (!drop_to_ground	794	if (!drop_to_ground
776	\|\| !map	795	\|\| !map
777	\|\| map->in_memory != MAP_IN_MEMORY	796	\|\| map->in_memory != MAP_IN_MEMORY
		797	\|\| map->nodrop
778	\|\| ms ().move_block == MOVE_ALL)	798	\|\| ms ().move_block == MOVE_ALL)
779	{	799	{
780	while (inv)	800	while (inv)
781	{	801	{
782	inv->destroy_inv (drop_to_ground);	802	inv->destroy_inv (drop_to_ground);
…		…
898	* 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
899	* 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
900	* object will have no environment. If the object previously had an	920	* object will have no environment. If the object previously had an
901	* environment, the x and y coordinates will be updated to	921	* environment, the x and y coordinates will be updated to
902	* the previous environment.	922	* the previous environment.
903	* Beware: This function is called from the editor as well!
904	*/	923	*/
905	void	924	void
906	object::remove ()	925	object::do_remove ()
907	{	926	{
908	object tmp, last = 0;	927	object tmp, last = 0;
909	object *otmp;	928	object *otmp;
910		929
911	if (QUERY_FLAG (this, FLAG_REMOVED))	930	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
954	}	973	}
955	else if (map)	974	else if (map)
956	{	975	{
957	if (type == PLAYER)	976	if (type == PLAYER)
958	{	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
959	--map->players;	984	--map->players;
960	map->touch ();	985	map->touch ();
961	}	986	}
962		987
963	map->dirty = true;	988	map->dirty = true;
		989	mapspace &ms = this->ms ();
964		990
965	/* link the object above us */	991	/* link the object above us */
966	if (above)	992	if (above)
967	above->below = below;	993	above->below = below;
968	else	994	else
969	map->at (x, y).top = below; /* we were top, set new top */	995	ms.top = below; /* we were top, set new top */
970		996
971	/* Relink the object below us, if there is one */	997	/* Relink the object below us, if there is one */
972	if (below)	998	if (below)
973	below->above = above;	999	below->above = above;
974	else	1000	else
…		…
976	/* 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
977	* use translated coordinates in case some oddness with map tiling is	1003	* use translated coordinates in case some oddness with map tiling is
978	* evident	1004	* evident
979	*/	1005	*/
980	if (GET_MAP_OB (map, x, y) != this)	1006	if (GET_MAP_OB (map, x, y) != this)
981	{
982	char *dump = dump_object (this);
983	LOG (llevError,
984	"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 ());
985	free (dump);
986	dump = dump_object (GET_MAP_OB (map, x, y));
987	LOG (llevError, "%s\n", dump);
988	free (dump);
989	}
990		1008
991	map->at (x, y).bot = above; /* goes on above it. */	1009	ms.bot = above; /* goes on above it. */
992	}	1010	}
993		1011
994	above = 0;	1012	above = 0;
995	below = 0;	1013	below = 0;
996		1014
997	if (map->in_memory == MAP_SAVING)	1015	if (map->in_memory == MAP_SAVING)
998	return;	1016	return;
999		1017
1000	int check_walk_off = !flag [FLAG_NO_APPLY];	1018	int check_walk_off = !flag [FLAG_NO_APPLY];
1001		1019
1002	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1020	for (tmp = ms.bot; tmp; tmp = tmp->above)
1003	{	1021	{
1004	/* 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
1005	* being removed.	1023	* being removed.
1006	*/	1024	*/
1007		1025
…		…
1087	}	1105	}
1088		1106
1089	return 0;	1107	return 0;
1090	}	1108	}
1091		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
1092	/*	1133	/*
1093	* 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
1094	* job preparing multi-part monsters	1135	* job preparing multi-part monsters.
1095	*/	1136	*/
1096	object *	1137	object *
1097	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)
1098	{	1139	{
1099	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1140	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
…		…
1126	* just 'op' otherwise	1167	* just 'op' otherwise
1127	*/	1168	*/
1128	object *	1169	object *
1129	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)
1130	{	1171	{
		1172	assert (!op->flag [FLAG_FREED]);
		1173
1131	object tmp, top, *floor = NULL;	1174	object tmp, top, *floor = NULL;
1132	sint16 x, y;
1133		1175
1134	if (QUERY_FLAG (op, FLAG_FREED))	1176	op->remove ();
1135	{
1136	LOG (llevError, "Trying to insert freed object!\n");
1137	return NULL;
1138	}
1139		1177
1140	if (!m)	1178	#if 0
1141	{	1179	if (!m->active != !op->active)
1142	char *dump = dump_object (op);	1180	if (m->active)
1143	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1181	op->activate_recursive ();
1144	free (dump);	1182	else
1145	return op;	1183	op->deactivate_recursive ();
1146	}	1184	#endif
1147		1185
1148	if (out_of_map (m, op->x, op->y))	1186	if (out_of_map (m, op->x, op->y))
1149	{	1187	{
1150	char *dump = dump_object (op);
1151	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 ());
1152	#ifdef MANY_CORES	1189	#ifdef MANY_CORES
1153	/* 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
1154	* 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
1155	* improperly inserted.	1192	* improperly inserted.
1156	*/	1193	*/
1157	abort ();	1194	abort ();
1158	#endif	1195	#endif
1159	free (dump);
1160	return op;	1196	return op;
1161	}	1197	}
1162		1198
1163	if (!QUERY_FLAG (op, FLAG_REMOVED))
1164	{
1165	char *dump = dump_object (op);
1166	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1167	free (dump);
1168	return op;
1169	}
1170
1171	if (op->more)
1172	{
1173	/* The part may be on a different map. */
1174
1175	object *more = op->more;	1199	if (object *more = op->more)
1176		1200	{
1177	/* We really need the caller to normalise coordinates - if
1178	* we set the map, that doesn't work if the location is within
1179	* a map and this is straddling an edge. So only if coordinate
1180	* is clear wrong do we normalise it.
1181	*/
1182	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1183	more->map = get_map_from_coord (m, &more->x, &more->y);
1184	else if (!more->map)
1185	{
1186	/* For backwards compatibility - when not dealing with tiled maps,
1187	* more->map should always point to the parent.
1188	*/
1189	more->map = m;
1190	}
1191
1192	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1201	if (!insert_ob_in_map (more, m, originator, flag))
1193	{	1202	{
1194	if (!op->head)	1203	if (!op->head)
1195	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");
1196		1205
1197	return 0;	1206	return 0;
…		…
1202		1211
1203	/* Ideally, the caller figures this out. However, it complicates a lot	1212	/* Ideally, the caller figures this out. However, it complicates a lot
1204	* 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
1205	* need extra work	1214	* need extra work
1206	*/	1215	*/
1207	op->map = get_map_from_coord (m, &op->x, &op->y);	1216	if (!xy_normalise (m, op->x, op->y))
1208	x = op->x;	1217	return 0;
1209	y = op->y;	1218
		1219	op->map = m;
		1220	mapspace &ms = op->ms ();
1210		1221
1211	/* this has to be done after we translate the coordinates.	1222	/* this has to be done after we translate the coordinates.
1212	*/	1223	*/
1213	if (op->nrof && !(flag & INS_NO_MERGE))	1224	if (op->nrof && !(flag & INS_NO_MERGE))
1214	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1225	for (tmp = ms.bot; tmp; tmp = tmp->above)
1215	if (object::can_merge (op, tmp))	1226	if (object::can_merge (op, tmp))
1216	{	1227	{
1217	op->nrof += tmp->nrof;	1228	op->nrof += tmp->nrof;
1218	tmp->destroy ();	1229	tmp->destroy ();
1219	}	1230	}
…		…
1236	op->below = originator->below;	1247	op->below = originator->below;
1237		1248
1238	if (op->below)	1249	if (op->below)
1239	op->below->above = op;	1250	op->below->above = op;
1240	else	1251	else
1241	op->ms ().bot = op;	1252	ms.bot = op;
1242		1253
1243	/* since below originator, no need to update top */	1254	/* since below originator, no need to update top */
1244	originator->below = op;	1255	originator->below = op;
1245	}	1256	}
1246	else	1257	else
1247	{	1258	{
		1259	top = ms.bot;
		1260
1248	/* If there are other objects, then */	1261	/* If there are other objects, then */
1249	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1262	if ((!(flag & INS_MAP_LOAD)) && top)
1250	{	1263	{
1251	object *last = 0;	1264	object *last = 0;
1252		1265
1253	/*	1266	/*
1254	* 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.
…		…
1260	* 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
1261	* 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
1262	* 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
1263	* that flying non pickable objects are spell objects.	1276	* that flying non pickable objects are spell objects.
1264	*/	1277	*/
1265	while (top)	1278	for (top = ms.bot; top; top = top->above)
1266	{	1279	{
1267	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))
1268	floor = top;	1281	floor = top;
1269		1282
1270	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))
…		…
1273	top = top->below;	1286	top = top->below;
1274	break;	1287	break;
1275	}	1288	}
1276		1289
1277	last = top;	1290	last = top;
1278	top = top->above;
1279	}	1291	}
1280		1292
1281	/* 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 */
1282	top = last;	1294	top = last;
1283		1295
…		…
1285	* looks like instead of lots of conditions here.	1297	* looks like instead of lots of conditions here.
1286	* makes things faster, and effectively the same result.	1298	* makes things faster, and effectively the same result.
1287	*/	1299	*/
1288		1300
1289	/* Have object 'fall below' other objects that block view.	1301	/* Have object 'fall below' other objects that block view.
1290	* Unless those objects are exits, type 66	1302	* Unless those objects are exits.
1291	* If INS_ON_TOP is used, don't do this processing	1303	* If INS_ON_TOP is used, don't do this processing
1292	* Need to find the object that in fact blocks view, otherwise	1304	* Need to find the object that in fact blocks view, otherwise
1293	* stacking is a bit odd.	1305	* stacking is a bit odd.
1294	*/	1306	*/
1295	if (!(flag & INS_ON_TOP) &&	1307	if (!(flag & INS_ON_TOP)
1296	(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))
1297	{	1310	{
1298	for (last = top; last != floor; last = last->below)	1311	for (last = top; last != floor; last = last->below)
1299	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1312	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1300	break;	1313	break;
		1314
1301	/* Check to see if we found the object that blocks view,	1315	/* Check to see if we found the object that blocks view,
1302	* 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
1303	* we can get inserted below this one, which requires we	1317	* we can get inserted below this one, which requires we
1304	* set top to the object below us.	1318	* set top to the object below us.
1305	*/	1319	*/
…		…
1307	top = last->below;	1321	top = last->below;
1308	}	1322	}
1309	} /* If objects on this space */	1323	} /* If objects on this space */
1310		1324
1311	if (flag & INS_MAP_LOAD)	1325	if (flag & INS_MAP_LOAD)
1312	top = GET_MAP_TOP (op->map, op->x, op->y);	1326	top = ms.top;
1313		1327
1314	if (flag & INS_ABOVE_FLOOR_ONLY)	1328	if (flag & INS_ABOVE_FLOOR_ONLY)
1315	top = floor;	1329	top = floor;
1316		1330
1317	/* 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.
1318	*/	1332	*/
1319		1333
1320	/* First object on this space */	1334	/* First object on this space */
1321	if (!top)	1335	if (!top)
1322	{	1336	{
1323	op->above = GET_MAP_OB (op->map, op->x, op->y);	1337	op->above = ms.bot;
1324		1338
1325	if (op->above)	1339	if (op->above)
1326	op->above->below = op;	1340	op->above->below = op;
1327		1341
1328	op->below = 0;	1342	op->below = 0;
1329	op->ms ().bot = op;	1343	ms.bot = op;
1330	}	1344	}
1331	else	1345	else
1332	{ /* get inserted into the stack above top */	1346	{ /* get inserted into the stack above top */
1333	op->above = top->above;	1347	op->above = top->above;
1334		1348
…		…
1338	op->below = top;	1352	op->below = top;
1339	top->above = op;	1353	top->above = op;
1340	}	1354	}
1341		1355
1342	if (!op->above)	1356	if (!op->above)
1343	op->ms ().top = op;	1357	ms.top = op;
1344	} /* else not INS_BELOW_ORIGINATOR */	1358	} /* else not INS_BELOW_ORIGINATOR */
1345		1359
1346	if (op->type == PLAYER)	1360	if (op->type == PLAYER)
1347	{	1361	{
1348	op->contr->do_los = 1;	1362	op->contr->do_los = 1;
…		…
1354		1368
1355	/* 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
1356	* it, so save a few ticks and start from there.	1370	* it, so save a few ticks and start from there.
1357	*/	1371	*/
1358	if (!(flag & INS_MAP_LOAD))	1372	if (!(flag & INS_MAP_LOAD))
1359	if (object *pl = op->ms ().player ())	1373	if (object *pl = ms.player ())
1360	if (pl->contr->ns)	1374	if (pl->contr->ns)
1361	pl->contr->ns->floorbox_update ();	1375	pl->contr->ns->floorbox_update ();
1362		1376
1363	/* If this object glows, it may affect lighting conditions that are	1377	/* If this object glows, it may affect lighting conditions that are
1364	* 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
…		…
1426	}	1440	}
1427		1441
1428	object *	1442	object *
1429	object::insert_at (object where, object originator, int flags)	1443	object::insert_at (object where, object originator, int flags)
1430	{	1444	{
1431	where->map->insert (this, where->x, where->y, originator, flags);	1445	return where->map->insert (this, where->x, where->y, originator, flags);
1432	}	1446	}
1433		1447
1434	/*	1448	/*
1435	* 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
1436	* is returned contains nr objects, and the remaining parts contains	1450	* is returned contains nr objects, and the remaining parts contains
…		…
1476	* 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
1477	* is subsequently removed and freed.	1491	* is subsequently removed and freed.
1478	*	1492	*
1479	* 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
1480	*/	1494	*/
1481
1482	object *	1495	object *
1483	decrease_ob_nr (object *op, uint32 i)	1496	decrease_ob_nr (object *op, uint32 i)
1484	{	1497	{
1485	object *tmp;	1498	object *tmp;
1486		1499
…		…
1561		1574
1562	/*	1575	/*
1563	* add_weight(object, weight) adds the specified weight to an object,	1576	* add_weight(object, weight) adds the specified weight to an object,
1564	* and also updates how much the environment(s) is/are carrying.	1577	* and also updates how much the environment(s) is/are carrying.
1565	*/	1578	*/
1566
1567	void	1579	void
1568	add_weight (object *op, signed long weight)	1580	add_weight (object *op, signed long weight)
1569	{	1581	{
1570	while (op != NULL)	1582	while (op != NULL)
1571	{	1583	{
…		…
1603	* inside the object environment.	1615	* inside the object environment.
1604	*	1616	*
1605	* 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
1606	* be != op, if items are merged. -Tero	1618	* be != op, if items are merged. -Tero
1607	*/	1619	*/
1608
1609	object *	1620	object *
1610	object::insert (object *op)	1621	object::insert (object *op)
1611	{	1622	{
1612	object tmp, otmp;	1623	object tmp, otmp;
1613		1624
…		…
1773	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1784	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1774	((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))
1775	{	1786	{
1776		1787
1777	float	1788	float
1778	diff = tmp->move_slow_penalty * FABS (op->speed);	1789	diff = tmp->move_slow_penalty * fabs (op->speed);
1779		1790
1780	if (op->type == PLAYER)	1791	if (op->type == PLAYER)
1781	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)) \|\|
1782	(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)))
1783	diff /= 4.0;	1794	diff /= 4.0;
…		…
1990	}	2001	}
1991		2002
1992	if (!index)	2003	if (!index)
1993	return -1;	2004	return -1;
1994		2005
1995	return altern[RANDOM () % index];	2006	return altern [rndm (index)];
1996	}	2007	}
1997		2008
1998	/*	2009	/*
1999	* find_first_free_spot(archetype, maptile, x, y) works like	2010	* find_first_free_spot(archetype, maptile, x, y) works like
2000	* find_free_spot(), but it will search max number of squares.	2011	* find_free_spot(), but it will search max number of squares.
…		…
2021	{	2032	{
2022	arr += begin;	2033	arr += begin;
2023	end -= begin;	2034	end -= begin;
2024		2035
2025	while (--end)	2036	while (--end)
2026	swap (arr [end], arr [RANDOM () % (end + 1)]);	2037	swap (arr [end], arr [rndm (end + 1)]);
2027	}	2038	}
2028		2039
2029	/* new function to make monster searching more efficient, and effective!	2040	/* new function to make monster searching more efficient, and effective!
2030	* This basically returns a randomized array (in the passed pointer) of	2041	* This basically returns a randomized array (in the passed pointer) of
2031	* 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
…		…
2165		2176
2166	return 3;	2177	return 3;
2167	}	2178	}
2168		2179
2169	/*	2180	/*
2170	* absdir(int): Returns a number between 1 and 8, which represent
2171	* the "absolute" direction of a number (it actually takes care of
2172	* "overflow" in previous calculations of a direction).
2173	*/
2174
2175	int
2176	absdir (int d)
2177	{
2178	while (d < 1)
2179	d += 8;
2180
2181	while (d > 8)
2182	d -= 8;
2183
2184	return d;
2185	}
2186
2187	/*
2188	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2181	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2189	* between two directions (which are expected to be absolute (see absdir())	2182	* between two directions (which are expected to be absolute (see absdir())
2190	*/	2183	*/
2191
2192	int	2184	int
2193	dirdiff (int dir1, int dir2)	2185	dirdiff (int dir1, int dir2)
2194	{	2186	{
2195	int d;	2187	int d;
2196		2188
…		…
2362	insert_ob_in_ob (object_create_clone (item), dst);	2354	insert_ob_in_ob (object_create_clone (item), dst);
2363		2355
2364	return dst;	2356	return dst;
2365	}	2357	}
2366		2358
2367	/* GROS - Creates an object using a string representing its content. */
2368	/* Basically, we save the content of the string to a temp file, then call */
2369	/* load_object on it. I admit it is a highly inefficient way to make things, */
2370	/* but it was simple to make and allows reusing the load_object function. */
2371	/* Remember not to use load_object_str in a time-critical situation. */
2372	/* Also remember that multiparts objects are not supported for now. */
2373	object *
2374	load_object_str (const char *obstr)
2375	{
2376	object *op;
2377	char filename[MAX_BUF];
2378
2379	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2380
2381	FILE *tempfile = fopen (filename, "w");
2382
2383	if (tempfile == NULL)
2384	{
2385	LOG (llevError, "Error - Unable to access load object temp file\n");
2386	return NULL;
2387	}
2388
2389	fprintf (tempfile, obstr);
2390	fclose (tempfile);
2391
2392	op = object::create ();
2393
2394	object_thawer thawer (filename);
2395
2396	if (thawer)
2397	load_object (thawer, op, 0);
2398
2399	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2400	CLEAR_FLAG (op, FLAG_REMOVED);
2401
2402	return op;
2403	}
2404
2405	/* This returns the first object in who's inventory that	2359	/* This returns the first object in who's inventory that
2406	* has the same type and subtype match.	2360	* has the same type and subtype match.
2407	* returns NULL if no match.	2361	* returns NULL if no match.
2408	*/	2362	*/
2409	object *	2363	object *
…		…
2462	if (link->key == canonical_key)	2416	if (link->key == canonical_key)
2463	return link->value;	2417	return link->value;
2464		2418
2465	return 0;	2419	return 0;
2466	}	2420	}
2467
2468		2421
2469	/*	2422	/*
2470	* Updates the canonical_key in op to value.	2423	* Updates the canonical_key in op to value.
2471	*	2424	*
2472	* 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).
…		…
2612	{	2565	{
2613	char flagdesc[512];	2566	char flagdesc[512];
2614	char info2[256 * 4];	2567	char info2[256 * 4];
2615	char *p = info;	2568	char *p = info;
2616		2569
2617	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}",
2618	count, uuid.seq,	2571	count, uuid.seq,
2619	&name,	2572	&name,
2620	title ? "\",title:" : "",	2573	title ? "\",title:\"" : "",
2621	title ? (const char *)title : "",	2574	title ? (const char *)title : "",
2622	flag_desc (flagdesc, 512), type);	2575	flag_desc (flagdesc, 512), type);
2623		2576
2624	if (env)	2577	if (env)
2625	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2578	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
…		…
2631	}	2584	}
2632		2585
2633	const char *	2586	const char *
2634	object::debug_desc () const	2587	object::debug_desc () const
2635	{	2588	{
2636	static char info[256 * 4];	2589	static char info[3][256 * 4];
		2590	static int info_idx;
		2591
2637	return debug_desc (info);	2592	return debug_desc (info [++info_idx % 3]);
2638	}	2593	}
2639		2594
		2595	struct region *
		2596	object::region () const
		2597	{
		2598	return map ? map->region (x, y)
		2599	: region::default_region ();
		2600	}
		2601
		2602	const materialtype_t *
		2603	object::dominant_material () const
		2604	{
		2605	if (materialtype_t *mat = name_to_material (materialname))
		2606	return mat;
		2607
		2608	// omfg this is slow, this has to be temporary :)
		2609	shstr unknown ("unknown");
		2610
		2611	return name_to_material (unknown);
		2612	}
		2613
		2614	void
		2615	object::open_container (object *new_container)
		2616	{
		2617	if (container == new_container)
		2618	return;
		2619
		2620	if (object *old_container = container)
		2621	{
		2622	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2623	return;
		2624
		2625	#if 0
		2626	// remove the "Close old_container" object.
		2627	if (object *closer = old_container->inv)
		2628	if (closer->type == CLOSE_CON)
		2629	closer->destroy ();
		2630	#endif
		2631
		2632	old_container->flag [FLAG_APPLIED] = 0;
		2633	container = 0;
		2634
		2635	esrv_update_item (UPD_FLAGS, this, old_container);
		2636	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2637	}
		2638
		2639	if (new_container)
		2640	{
		2641	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2642	return;
		2643
		2644	// TODO: this does not seem to serve any purpose anymore?
		2645	#if 0
		2646	// insert the "Close Container" object.
		2647	if (archetype *closer = new_container->other_arch)
		2648	{
		2649	object *closer = arch_to_object (new_container->other_arch);
		2650	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2651	new_container->insert (closer);
		2652	}
		2653	#endif
		2654
		2655	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2656
		2657	new_container->flag [FLAG_APPLIED] = 1;
		2658	container = new_container;
		2659
		2660	esrv_update_item (UPD_FLAGS, this, new_container);
		2661	esrv_send_inventory (this, new_container);
		2662	}
		2663	}
		2664
		2665

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.112 by root, Mon Jan 8 14:11:04 2007 UTC vs. Revision 1.143 by root, Tue May 1 05:48:20 2007 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.112 by root, Mon Jan 8 14:11:04 2007 UTC vs.
Revision 1.143 by root, Tue May 1 05:48:20 2007 UTC