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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.270 by root, Sat Dec 27 02:31:19 2008 UTC vs.
Revision 1.294 by root, Thu Nov 5 15:43:21 2009 UTC

…		…
1	/*	1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Deliantra is free software: you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation, either version 3 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* 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 Affero GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
20	*	21	*
21	* The authors can be reached via e-mail to <support@deliantra.net>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
23		24
24	#include <global.h>	25	#include <global.h>
32	#include <bitset>	33	#include <bitset>
33		34
34	UUID UUID::cur;	35	UUID UUID::cur;
35	static uint64_t seq_next_save;	36	static uint64_t seq_next_save;
36	static const uint64 UUID_GAP = 1<<19;	37	static const uint64 UUID_GAP = 1<<19;
		38	uint32_t mapspace::smellcount = 10000;
37		39
38	objectvec objects;	40	objectvec objects;
39	activevec actives;	41	activevec actives;
		42
		43	//+GPL
40		44
41	short freearr_x[SIZEOFFREE] = {	45	short freearr_x[SIZEOFFREE] = {
42	0,	46	0,
43	0, 1, 1, 1, 0, -1, -1, -1,	47	0, 1, 1, 1, 0, -1, -1, -1,
44	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	48	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
…		…
327	// the player inventory itself is always visible	331	// the player inventory itself is always visible
328	if (env->is_player ())	332	if (env->is_player ())
329	return env;	333	return env;
330		334
331	// else a player could have our env open	335	// else a player could have our env open
332	object *envest = env->outer_env ();	336	object *envest = env->outer_env_or_self ();
333		337
334	// the player itself is always on a map, so we will find him here	338	// the player itself is always on a map, so we will find him here
335	// even if our inv is in a player.	339	// even if our inv is in a player.
336	if (envest->is_on_map ())	340	if (envest->is_on_map ())
337	if (object *pl = envest->ms ().player ())	341	if (object *pl = envest->ms ().player ())
338	if (pl->container == env)	342	if (pl->container_ () == env)
339	return pl;	343	return pl;
340	}	344	}
341	else	345	else
342	{	346	{
343	// maybe there is a player standing on the same mapspace	347	// maybe there is a player standing on the same mapspace
344	// this will catch the case where "this" is a player	348	// this will catch the case where "this" is a player
345	if (object *pl = ms ().player ())	349	if (object *pl = ms ().player ())
346	if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look)	350	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
347	\|\| this == pl->container)	351	\|\| pl->container_ () == this)
348	return pl;	352	return pl;
349	}	353	}
350	}	354	}
351		355
352	return 0;	356	return 0;
…		…
428	return strdup ("[NULLOBJ]");	432	return strdup ("[NULLOBJ]");
429		433
430	object_freezer freezer;	434	object_freezer freezer;
431	op->write (freezer);	435	op->write (freezer);
432	return freezer.as_string ();	436	return freezer.as_string ();
		437	}
		438
		439	char *
		440	object::as_string ()
		441	{
		442	return dump_object (this);
433	}	443	}
434		444
435	/*	445	/*
436	* get_nearest_part(multi-object, object 2) returns the part of the	446	* get_nearest_part(multi-object, object 2) returns the part of the
437	* multi-object 1 which is closest to the second object.	447	* multi-object 1 which is closest to the second object.
…		…
554	update_stats ();	564	update_stats ();
555		565
556	new_draw_info_format (NDI_UNIQUE, 0, this,	566	new_draw_info_format (NDI_UNIQUE, 0, this,
557	"You try to balance all your items at once, "	567	"You try to balance all your items at once, "
558	"but the %s is just too much for your body. "	568	"but the %s is just too much for your body. "
559	"[You need to unapply some items first.]", &ob->name);	569	"[You need to unapply some items first - use the 'body' command to see "
		570	"how many items you cna wera on a specific body part.]", &ob->name);
560	return false;	571	return false;
561	}	572	}
562		573
563	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);	574	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
564	}	575	}
…		…
791		802
792	object::object ()	803	object::object ()
793	{	804	{
794	SET_FLAG (this, FLAG_REMOVED);	805	SET_FLAG (this, FLAG_REMOVED);
795		806
796	expmul = 1.0;	807	//expmul = 1.0; declared const for the time being
797	face = blank_face;	808	face = blank_face;
798	}	809	}
799		810
800	object::~object ()	811	object::~object ()
801	{	812	{
…		…
830	{	841	{
831	/* If already on active list, don't do anything */	842	/* If already on active list, don't do anything */
832	if (active)	843	if (active)
833	return;	844	return;
834		845
835	if (has_active_speed () && flag [FLAG_FREED]) LOG (llevError \| logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
836	if (has_active_speed () && flag [FLAG_DEBUG]) LOG (llevError \| logBacktrace, "BUG: tried to activate DEBUG object %s\n", debug_desc ());//D temp
837
838	if (has_active_speed ())	846	if (has_active_speed ())
		847	{
		848	if (flag [FLAG_FREED])
		849	LOG (llevError \| logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		850
839	actives.insert (this);	851	actives.insert (this);
		852	}
840	}	853	}
841		854
842	void	855	void
843	object::activate_recursive ()	856	object::activate_recursive ()
844	{	857	{
…		…
962		975
963	void	976	void
964	object::do_destroy ()	977	object::do_destroy ()
965	{	978	{
966	if (flag [FLAG_IS_LINKED])	979	if (flag [FLAG_IS_LINKED])
967	remove_button_link (this);	980	remove_link ();
968		981
969	if (flag [FLAG_FRIENDLY])	982	if (flag [FLAG_FRIENDLY])
970	remove_friendly_object (this);	983	remove_friendly_object (this);
971		984
972	remove ();	985	remove ();
…		…
1030	* the previous environment.	1043	* the previous environment.
1031	*/	1044	*/
1032	void	1045	void
1033	object::do_remove ()	1046	object::do_remove ()
1034	{	1047	{
1035	object tmp, last = 0;
1036	object *otmp;
1037
1038	if (flag [FLAG_REMOVED])	1048	if (flag [FLAG_REMOVED])
1039	return;	1049	return;
1040		1050
1041	INVOKE_OBJECT (REMOVE, this);	1051	INVOKE_OBJECT (REMOVE, this);
1042		1052
…		…
1096		1106
1097	if (object *pl = ms.player ())	1107	if (object *pl = ms.player ())
1098	{	1108	{
1099	if (is_player ())	1109	if (is_player ())
1100	{	1110	{
		1111	if (!flag [FLAG_WIZPASS])
1101	ms.smell = pticks; // remember the smell of the player	1112	ms.smell = ++mapspace::smellcount; // remember the smell of the player
1102		1113
1103	// leaving a spot always closes any open container on the ground	1114	// leaving a spot always closes any open container on the ground
1104	if (container && !container->env)	1115	if (container && !container->env)
1105	// this causes spurious floorbox updates, but it ensures	1116	// this causes spurious floorbox updates, but it ensures
1106	// that the CLOSE event is being sent.	1117	// that the CLOSE event is being sent.
1107	close_container ();	1118	close_container ();
1108		1119
1109	--map->players;	1120	--map->players;
1110	map->touch ();	1121	map->touch ();
1111	}	1122	}
1112	else if (pl->container == this)	1123	else if (pl->container_ () == this)
1113	{	1124	{
1114	// removing a container should close it	1125	// removing a container should close it
1115	close_container ();	1126	close_container ();
1116	}	1127	}
1117		1128
…		…
1133		1144
1134	int check_walk_off = !flag [FLAG_NO_APPLY];	1145	int check_walk_off = !flag [FLAG_NO_APPLY];
1135		1146
1136	if (object *pl = ms.player ())	1147	if (object *pl = ms.player ())
1137	{	1148	{
1138	if (pl->container == this)	1149	if (pl->container_ () == this)
1139	/* If a container that the player is currently using somehow gets	1150	/* If a container that the player is currently using somehow gets
1140	* removed (most likely destroyed), update the player view	1151	* removed (most likely destroyed), update the player view
1141	* appropriately.	1152	* appropriately.
1142	*/	1153	*/
1143	pl->close_container ();	1154	pl->close_container ();
…		…
1147	//TODO: update floorbox to preserve ordering	1158	//TODO: update floorbox to preserve ordering
1148	if (pl->contr->ns)	1159	if (pl->contr->ns)
1149	pl->contr->ns->floorbox_update ();	1160	pl->contr->ns->floorbox_update ();
1150	}	1161	}
1151		1162
		1163	if (check_walk_off)
1152	for (tmp = ms.bot; tmp; tmp = tmp->above)	1164	for (object above, tmp = ms.bot; tmp; tmp = above)
1153	{	1165	{
		1166	above = tmp->above;
		1167
1154	/* No point updating the players look faces if he is the object	1168	/* No point updating the players look faces if he is the object
1155	* being removed.	1169	* being removed.
1156	*/	1170	*/
1157		1171
1158	/* See if object moving off should effect something */	1172	/* See if object moving off should effect something */
1159	if (check_walk_off
1160	&& ((move_type & tmp->move_off)	1173	if ((move_type & tmp->move_off)
1161	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1174	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1162	{
1163	move_apply (tmp, this, 0);	1175	move_apply (tmp, this, 0);
1164
1165	if (destroyed ())
1166	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1167	}	1176	}
1168
1169	last = tmp;
1170	}
1171		1177
1172	if (affects_los ())	1178	if (affects_los ())
1173	update_all_los (map, x, y);	1179	update_all_los (map, x, y);
1174	}	1180	}
1175	}	1181	}
…		…
1284		1290
1285	/* Ideally, the caller figures this out. However, it complicates a lot	1291	/* Ideally, the caller figures this out. However, it complicates a lot
1286	* of areas of callers (eg, anything that uses find_free_spot would now	1292	* of areas of callers (eg, anything that uses find_free_spot would now
1287	* need extra work	1293	* need extra work
1288	*/	1294	*/
		1295	maptile *newmap = m;
1289	if (!xy_normalise (m, op->x, op->y))	1296	if (!xy_normalise (newmap, op->x, op->y))
1290	{	1297	{
1291	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found	1298	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1292	return 0;	1299	return 0;
1293	}	1300	}
1294		1301
1295	if (object *more = op->more)	1302	if (object *more = op->more)
1296	if (!insert_ob_in_map (more, m, originator, flag))	1303	if (!insert_ob_in_map (more, m, originator, flag))
1297	return 0;	1304	return 0;
1298		1305
1299	CLEAR_FLAG (op, FLAG_REMOVED);	1306	op->flag [FLAG_REMOVED] = false;
1300		1307	op->env = 0;
1301	op->map = m;	1308	op->map = newmap;
		1309
1302	mapspace &ms = op->ms ();	1310	mapspace &ms = op->ms ();
1303		1311
1304	/* this has to be done after we translate the coordinates.	1312	/* this has to be done after we translate the coordinates.
1305	*/	1313	*/
1306	if (op->nrof && !(flag & INS_NO_MERGE))	1314	if (op->nrof && !(flag & INS_NO_MERGE))
…		…
1327	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1335	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1328	abort ();	1336	abort ();
1329	}	1337	}
1330		1338
1331	if (!originator->is_on_map ())	1339	if (!originator->is_on_map ())
		1340	{
1332	LOG (llevDebug \| logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",	1341	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
1333	op->debug_desc (), originator->debug_desc ());	1342	op->debug_desc (), originator->debug_desc ());
		1343	abort ();
		1344	}
1334		1345
1335	op->above = originator;	1346	op->above = originator;
1336	op->below = originator->below;	1347	op->below = originator->below;
1337	originator->below = op;	1348	originator->below = op;
1338		1349
…		…
1470	* blocked() and wall() work properly), and these flags are updated by	1481	* blocked() and wall() work properly), and these flags are updated by
1471	* update_object().	1482	* update_object().
1472	*/	1483	*/
1473		1484
1474	/* if this is not the head or flag has been passed, don't check walk on status */	1485	/* if this is not the head or flag has been passed, don't check walk on status */
1475	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1486	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1476	{	1487	{
1477	if (check_move_on (op, originator))	1488	if (check_move_on (op, originator))
1478	return 0;	1489	return 0;
1479		1490
1480	/* If we are a multi part object, lets work our way through the check	1491	/* If we are a multi part object, lets work our way through the check
…		…
1491	/* this function inserts an object in the map, but if it	1502	/* this function inserts an object in the map, but if it
1492	* finds an object of its own type, it'll remove that one first.	1503	* finds an object of its own type, it'll remove that one first.
1493	* op is the object to insert it under: supplies x and the map.	1504	* op is the object to insert it under: supplies x and the map.
1494	*/	1505	*/
1495	void	1506	void
1496	replace_insert_ob_in_map (const char arch_string, object op)	1507	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1497	{	1508	{
1498	/* first search for itself and remove any old instances */	1509	/* first search for itself and remove any old instances */
1499		1510
1500	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1511	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1501	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1512	if (tmp->arch->archname == archname) /* same archetype */
1502	tmp->destroy ();	1513	tmp->destroy ();
1503		1514
1504	object *tmp = arch_to_object (archetype::find (arch_string));	1515	object *tmp = arch_to_object (archetype::find (archname));
1505		1516
1506	tmp->x = op->x;	1517	tmp->x = op->x;
1507	tmp->y = op->y;	1518	tmp->y = op->y;
1508		1519
1509	insert_ob_in_map (tmp, op->map, op, 0);	1520	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1695	* on top.	1706	* on top.
1696	*/	1707	*/
1697	int	1708	int
1698	check_move_on (object op, object originator)	1709	check_move_on (object op, object originator)
1699	{	1710	{
		1711	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1712	return 0;
		1713
1700	object *tmp;	1714	object *tmp;
1701	maptile *m = op->map;	1715	maptile *m = op->map;
1702	int x = op->x, y = op->y;	1716	int x = op->x, y = op->y;
1703		1717
1704	MoveType move_on, move_slow, move_block;	1718	mapspace &ms = m->at (x, y);
1705		1719
1706	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1720	ms.update ();
1707	return 0;
1708		1721
1709	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1722	MoveType move_on = ms.move_on;
1710	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1723	MoveType move_slow = ms.move_slow;
1711	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1724	MoveType move_block = ms.move_block;
1712		1725
1713	/* if nothing on this space will slow op down or be applied,	1726	/* if nothing on this space will slow op down or be applied,
1714	* no need to do checking below. have to make sure move_type	1727	* no need to do checking below. have to make sure move_type
1715	* is set, as lots of objects don't have it set - we treat that	1728	* is set, as lots of objects don't have it set - we treat that
1716	* as walking.	1729	* as walking.
…		…
1727	return 0;	1740	return 0;
1728		1741
1729	/* The objects have to be checked from top to bottom.	1742	/* The objects have to be checked from top to bottom.
1730	* Hence, we first go to the top:	1743	* Hence, we first go to the top:
1731	*/	1744	*/
1732		1745	for (object next, tmp = ms.top; tmp; tmp = next)
1733	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1734	{
1735	/* Trim the search when we find the first other spell effect
1736	* this helps performance so that if a space has 50 spell objects,
1737	* we don't need to check all of them.
1738	*/
1739	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1740	break;
1741	}	1746	{
		1747	next = tmp->below;
1742		1748
1743	for (; tmp; tmp = tmp->below)
1744	{
1745	if (tmp == op)	1749	if (tmp == op)
1746	continue; /* Can't apply yourself */	1750	continue; /* Can't apply yourself */
1747		1751
1748	/* Check to see if one of the movement types should be slowed down.	1752	/* Check to see if one of the movement types should be slowed down.
1749	* Second check makes sure that the movement types not being slowed	1753	* Second check makes sure that the movement types not being slowed
…		…
1754	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1758	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1755	{	1759	{
1756	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1760	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1757	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1761	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1758	{	1762	{
1759
1760	float
1761	diff = tmp->move_slow_penalty * fabs (op->speed);	1763	float diff = tmp->move_slow_penalty * fabs (op->speed);
1762		1764
1763	if (op->is_player ())	1765	if (op->is_player ())
1764	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1766	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) \|\|
1765	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1767	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1766	diff /= 4.0;	1768	diff /= 4.0;
1767		1769
1768	op->speed_left -= diff;	1770	op->speed_left -= diff;
1769	}	1771	}
1770	}	1772	}
…		…
2054	* there is capable of.	2056	* there is capable of.
2055	*/	2057	*/
2056	int	2058	int
2057	find_dir (maptile m, int x, int y, object exclude)	2059	find_dir (maptile m, int x, int y, object exclude)
2058	{	2060	{
2059	int i, max = SIZEOFFREE, mflags;	2061	int max = SIZEOFFREE, mflags;
2060
2061	sint16 nx, ny;
2062	object *tmp;
2063	maptile *mp;
2064
2065	MoveType blocked, move_type;	2062	MoveType move_type;
2066		2063
2067	if (exclude && exclude->head_ () != exclude)	2064	if (exclude && exclude->head_ () != exclude)
2068	{	2065	{
2069	exclude = exclude->head;	2066	exclude = exclude->head;
2070	move_type = exclude->move_type;	2067	move_type = exclude->move_type;
…		…
2073	{	2070	{
2074	/* If we don't have anything, presume it can use all movement types. */	2071	/* If we don't have anything, presume it can use all movement types. */
2075	move_type = MOVE_ALL;	2072	move_type = MOVE_ALL;
2076	}	2073	}
2077		2074
2078	for (i = 1; i < max; i++)	2075	for (int i = 1; i < max; i++)
2079	{	2076	{
2080	mp = m;	2077	mapxy pos (m, x, y);
2081	nx = x + freearr_x[i];	2078	pos.move (i);
2082	ny = y + freearr_y[i];
2083		2079
2084	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2080	if (!pos.normalise ())
2085
2086	if (mflags & P_OUT_OF_MAP)
2087	max = maxfree[i];	2081	max = maxfree[i];
2088	else	2082	else
2089	{	2083	{
2090	mapspace &ms = mp->at (nx, ny);	2084	mapspace &ms = *pos;
2091		2085
2092	blocked = ms.move_block;
2093
2094	if ((move_type & blocked) == move_type)	2086	if ((move_type & ms.move_block) == move_type)
2095	max = maxfree[i];	2087	max = maxfree [i];
2096	else if (mflags & P_IS_ALIVE)	2088	else if (ms.flags () & P_IS_ALIVE)
2097	{	2089	{
2098	for (tmp = ms.bot; tmp; tmp = tmp->above)	2090	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2099	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->is_player ())	2091	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->is_player ())
2100	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2092	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2101	break;
2102
2103	if (tmp)
2104	return freedir[i];	2093	return freedir [i];
2105	}	2094	}
2106	}	2095	}
2107	}	2096	}
2108		2097
2109	return 0;	2098	return 0;
…		…
2184	* This basically means that if direction is 15, then it could either go	2173	* This basically means that if direction is 15, then it could either go
2185	* direction 4, 14, or 16 to get back to where we are.	2174	* direction 4, 14, or 16 to get back to where we are.
2186	* Moved from spell_util.c to object.c with the other related direction	2175	* Moved from spell_util.c to object.c with the other related direction
2187	* functions.	2176	* functions.
2188	*/	2177	*/
2189	int reduction_dir[SIZEOFFREE][3] = {	2178	const int reduction_dir[SIZEOFFREE][3] = {
2190	{0, 0, 0}, /* 0 */	2179	{0, 0, 0}, /* 0 */
2191	{0, 0, 0}, /* 1 */	2180	{0, 0, 0}, /* 1 */
2192	{0, 0, 0}, /* 2 */	2181	{0, 0, 0}, /* 2 */
2193	{0, 0, 0}, /* 3 */	2182	{0, 0, 0}, /* 3 */
2194	{0, 0, 0}, /* 4 */	2183	{0, 0, 0}, /* 4 */
…		…
2332	return tmp;	2321	return tmp;
2333		2322
2334	return 0;	2323	return 0;
2335	}	2324	}
2336		2325
2337	const shstr &	2326	shstr_tmp
2338	object::kv_get (const shstr &key) const	2327	object::kv_get (shstr_tmp key) const
2339	{	2328	{
2340	for (key_value *kv = key_values; kv; kv = kv->next)	2329	for (key_value *kv = key_values; kv; kv = kv->next)
2341	if (kv->key == key)	2330	if (kv->key == key)
2342	return kv->value;	2331	return kv->value;
2343		2332
2344	return shstr_null;	2333	return shstr ();
2345	}	2334	}
2346		2335
2347	void	2336	void
2348	object::kv_set (const shstr &key, const shstr &value)	2337	object::kv_set (shstr_tmp key, shstr_tmp value)
2349	{	2338	{
2350	for (key_value *kv = key_values; kv; kv = kv->next)	2339	for (key_value *kv = key_values; kv; kv = kv->next)
2351	if (kv->key == key)	2340	if (kv->key == key)
2352	{	2341	{
2353	kv->value = value;	2342	kv->value = value;
…		…
2362		2351
2363	key_values = kv;	2352	key_values = kv;
2364	}	2353	}
2365		2354
2366	void	2355	void
2367	object::kv_del (const shstr &key)	2356	object::kv_del (shstr_tmp key)
2368	{	2357	{
2369	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)	2358	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)
2370	if ((*kvp)->key == key)	2359	if ((*kvp)->key == key)
2371	{	2360	{
2372	key_value kv = kvp;	2361	key_value kv = kvp;
…		…
2503	container = 0;	2492	container = 0;
2504		2493
2505	// client needs item update to make it work, client bug requires this to be separate	2494	// client needs item update to make it work, client bug requires this to be separate
2506	esrv_update_item (UPD_FLAGS, this, old_container);	2495	esrv_update_item (UPD_FLAGS, this, old_container);
2507		2496
2508	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2497	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2509	play_sound (sound_find ("chest_close"));	2498	play_sound (sound_find ("chest_close"));
2510	}	2499	}
2511		2500
2512	if (new_container)	2501	if (new_container)
2513	{	2502	{
…		…
2523	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2512	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2524	new_container->insert (closer);	2513	new_container->insert (closer);
2525	}	2514	}
2526	#endif	2515	#endif
2527		2516
2528	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2517	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2529		2518
2530	// make sure the container is available, client bug requires this to be separate	2519	// make sure the container is available, client bug requires this to be separate
2531	esrv_send_item (this, new_container);	2520	esrv_send_item (this, new_container);
2532		2521
2533	new_container->flag [FLAG_APPLIED] = true;	2522	new_container->flag [FLAG_APPLIED] = true;
…		…
2541	// else if (!old_container->env && contr && contr->ns)	2530	// else if (!old_container->env && contr && contr->ns)
2542	// contr->ns->floorbox_reset ();	2531	// contr->ns->floorbox_reset ();
2543	}	2532	}
2544		2533
2545	object *	2534	object *
2546	object::force_find (const shstr name)	2535	object::force_find (shstr_tmp name)
2547	{	2536	{
2548	/* cycle through his inventory to look for the MARK we want to	2537	/* cycle through his inventory to look for the MARK we want to
2549	* place	2538	* place
2550	*/	2539	*/
2551	for (object *tmp = inv; tmp; tmp = tmp->below)	2540	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2553	return splay (tmp);	2542	return splay (tmp);
2554		2543
2555	return 0;	2544	return 0;
2556	}	2545	}
2557		2546
		2547	//-GPL
		2548
		2549	void
		2550	object::force_set_timer (int duration)
		2551	{
		2552	this->duration = 1;
		2553	this->speed_left = -1.f;
		2554
		2555	this->set_speed (duration ? 1.f / duration : 0.f);
		2556	}
		2557
2558	object *	2558	object *
2559	object::force_add (const shstr name, int duration)	2559	object::force_add (shstr_tmp name, int duration)
2560	{	2560	{
2561	if (object *force = force_find (name))	2561	if (object *force = force_find (name))
2562	force->destroy ();	2562	force->destroy ();
2563		2563
2564	object *force = get_archetype (FORCE_NAME);	2564	object *force = get_archetype (FORCE_NAME);
2565		2565
2566	force->slaying = name;	2566	force->slaying = name;
2567	force->stats.food = 1;	2567	force->force_set_timer (duration);
2568	force->speed_left = -1.f;
2569
2570	force->set_speed (duration ? 1.f / duration : 0.f);
2571	force->flag [FLAG_IS_USED_UP] = true;
2572	force->flag [FLAG_APPLIED] = true;	2568	force->flag [FLAG_APPLIED] = true;
2573		2569
2574	return insert (force);	2570	return insert (force);
2575	}	2571	}
2576		2572
2577	void	2573	void
2578	object::play_sound (faceidx sound)	2574	object::play_sound (faceidx sound) const
2579	{	2575	{
2580	if (!sound)	2576	if (!sound)
2581	return;	2577	return;
2582		2578
2583	if (flag [FLAG_REMOVED])	2579	if (is_on_map ())
2584	return;
2585
2586	if (env)
2587	{
2588	if (object *pl = in_player ())
2589	pl->contr->play_sound (sound);
2590	}
2591	else
2592	map->play_sound (sound, x, y);	2580	map->play_sound (sound, x, y);
		2581	else if (object *pl = in_player ())
		2582	pl->contr->play_sound (sound);
		2583	}
		2584
		2585	void
		2586	object::say_msg (const char *msg) const
		2587	{
		2588	if (is_on_map ())
		2589	map->say_msg (msg, x, y);
		2590	else if (object *pl = in_player ())
		2591	pl->contr->play_sound (sound);
2593	}	2592	}
2594		2593
2595	void	2594	void
2596	object::make_noise ()	2595	object::make_noise ()
2597	{	2596	{

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.270 by root, Sat Dec 27 02:31:19 2008 UTC vs. Revision 1.294 by root, Thu Nov 5 15:43:21 2009 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.270 by root, Sat Dec 27 02:31:19 2008 UTC vs.
Revision 1.294 by root, Thu Nov 5 15:43:21 2009 UTC