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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.275 by root, Sun Dec 28 15:28:47 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>
36	static const uint64 UUID_GAP = 1<<19;	37	static const uint64 UUID_GAP = 1<<19;
37	uint32_t mapspace::smellcount = 10000;	38	uint32_t mapspace::smellcount = 10000;
38		39
39	objectvec objects;	40	objectvec objects;
40	activevec actives;	41	activevec actives;
		42
		43	//+GPL
41		44
42	short freearr_x[SIZEOFFREE] = {	45	short freearr_x[SIZEOFFREE] = {
43	0,	46	0,
44	0, 1, 1, 1, 0, -1, -1, -1,	47	0, 1, 1, 1, 0, -1, -1, -1,
45	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,
…		…
328	// the player inventory itself is always visible	331	// the player inventory itself is always visible
329	if (env->is_player ())	332	if (env->is_player ())
330	return env;	333	return env;
331		334
332	// else a player could have our env open	335	// else a player could have our env open
333	object *envest = env->outer_env ();	336	object *envest = env->outer_env_or_self ();
334		337
335	// 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
336	// even if our inv is in a player.	339	// even if our inv is in a player.
337	if (envest->is_on_map ())	340	if (envest->is_on_map ())
338	if (object *pl = envest->ms ().player ())	341	if (object *pl = envest->ms ().player ())
339	if (pl->container == env)	342	if (pl->container_ () == env)
340	return pl;	343	return pl;
341	}	344	}
342	else	345	else
343	{	346	{
344	// maybe there is a player standing on the same mapspace	347	// maybe there is a player standing on the same mapspace
345	// this will catch the case where "this" is a player	348	// this will catch the case where "this" is a player
346	if (object *pl = ms ().player ())	349	if (object *pl = ms ().player ())
347	if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look)	350	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
348	\|\| this == pl->container)	351	\|\| pl->container_ () == this)
349	return pl;	352	return pl;
350	}	353	}
351	}	354	}
352		355
353	return 0;	356	return 0;
…		…
429	return strdup ("[NULLOBJ]");	432	return strdup ("[NULLOBJ]");
430		433
431	object_freezer freezer;	434	object_freezer freezer;
432	op->write (freezer);	435	op->write (freezer);
433	return freezer.as_string ();	436	return freezer.as_string ();
		437	}
		438
		439	char *
		440	object::as_string ()
		441	{
		442	return dump_object (this);
434	}	443	}
435		444
436	/*	445	/*
437	* 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
438	* multi-object 1 which is closest to the second object.	447	* multi-object 1 which is closest to the second object.
…		…
555	update_stats ();	564	update_stats ();
556		565
557	new_draw_info_format (NDI_UNIQUE, 0, this,	566	new_draw_info_format (NDI_UNIQUE, 0, this,
558	"You try to balance all your items at once, "	567	"You try to balance all your items at once, "
559	"but the %s is just too much for your body. "	568	"but the %s is just too much for your body. "
560	"[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);
561	return false;	571	return false;
562	}	572	}
563		573
564	//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);
565	}	575	}
…		…
792		802
793	object::object ()	803	object::object ()
794	{	804	{
795	SET_FLAG (this, FLAG_REMOVED);	805	SET_FLAG (this, FLAG_REMOVED);
796		806
797	expmul = 1.0;	807	//expmul = 1.0; declared const for the time being
798	face = blank_face;	808	face = blank_face;
799	}	809	}
800		810
801	object::~object ()	811	object::~object ()
802	{	812	{
…		…
831	{	841	{
832	/* If already on active list, don't do anything */	842	/* If already on active list, don't do anything */
833	if (active)	843	if (active)
834	return;	844	return;
835		845
836	if (has_active_speed () && flag [FLAG_FREED]) LOG (llevError \| logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
837	if (has_active_speed () && flag [FLAG_DEBUG]) LOG (llevError \| logBacktrace, "BUG: tried to activate DEBUG object %s\n", debug_desc ());//D temp
838
839	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
840	actives.insert (this);	851	actives.insert (this);
		852	}
841	}	853	}
842		854
843	void	855	void
844	object::activate_recursive ()	856	object::activate_recursive ()
845	{	857	{
…		…
963		975
964	void	976	void
965	object::do_destroy ()	977	object::do_destroy ()
966	{	978	{
967	if (flag [FLAG_IS_LINKED])	979	if (flag [FLAG_IS_LINKED])
968	remove_button_link (this);	980	remove_link ();
969		981
970	if (flag [FLAG_FRIENDLY])	982	if (flag [FLAG_FRIENDLY])
971	remove_friendly_object (this);	983	remove_friendly_object (this);
972		984
973	remove ();	985	remove ();
…		…
1031	* the previous environment.	1043	* the previous environment.
1032	*/	1044	*/
1033	void	1045	void
1034	object::do_remove ()	1046	object::do_remove ()
1035	{	1047	{
1036	object tmp, last = 0;
1037	object *otmp;
1038
1039	if (flag [FLAG_REMOVED])	1048	if (flag [FLAG_REMOVED])
1040	return;	1049	return;
1041		1050
1042	INVOKE_OBJECT (REMOVE, this);	1051	INVOKE_OBJECT (REMOVE, this);
1043		1052
…		…
1109	close_container ();	1118	close_container ();
1110		1119
1111	--map->players;	1120	--map->players;
1112	map->touch ();	1121	map->touch ();
1113	}	1122	}
1114	else if (pl->container == this)	1123	else if (pl->container_ () == this)
1115	{	1124	{
1116	// removing a container should close it	1125	// removing a container should close it
1117	close_container ();	1126	close_container ();
1118	}	1127	}
1119		1128
…		…
1135		1144
1136	int check_walk_off = !flag [FLAG_NO_APPLY];	1145	int check_walk_off = !flag [FLAG_NO_APPLY];
1137		1146
1138	if (object *pl = ms.player ())	1147	if (object *pl = ms.player ())
1139	{	1148	{
1140	if (pl->container == this)	1149	if (pl->container_ () == this)
1141	/* If a container that the player is currently using somehow gets	1150	/* If a container that the player is currently using somehow gets
1142	* removed (most likely destroyed), update the player view	1151	* removed (most likely destroyed), update the player view
1143	* appropriately.	1152	* appropriately.
1144	*/	1153	*/
1145	pl->close_container ();	1154	pl->close_container ();
…		…
1149	//TODO: update floorbox to preserve ordering	1158	//TODO: update floorbox to preserve ordering
1150	if (pl->contr->ns)	1159	if (pl->contr->ns)
1151	pl->contr->ns->floorbox_update ();	1160	pl->contr->ns->floorbox_update ();
1152	}	1161	}
1153		1162
		1163	if (check_walk_off)
1154	for (tmp = ms.bot; tmp; tmp = tmp->above)	1164	for (object above, tmp = ms.bot; tmp; tmp = above)
1155	{	1165	{
		1166	above = tmp->above;
		1167
1156	/* 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
1157	* being removed.	1169	* being removed.
1158	*/	1170	*/
1159		1171
1160	/* See if object moving off should effect something */	1172	/* See if object moving off should effect something */
1161	if (check_walk_off
1162	&& ((move_type & tmp->move_off)	1173	if ((move_type & tmp->move_off)
1163	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1174	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1164	{
1165	move_apply (tmp, this, 0);	1175	move_apply (tmp, this, 0);
1166
1167	if (destroyed ())
1168	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1169	}	1176	}
1170
1171	last = tmp;
1172	}
1173		1177
1174	if (affects_los ())	1178	if (affects_los ())
1175	update_all_los (map, x, y);	1179	update_all_los (map, x, y);
1176	}	1180	}
1177	}	1181	}
…		…
1297		1301
1298	if (object *more = op->more)	1302	if (object *more = op->more)
1299	if (!insert_ob_in_map (more, m, originator, flag))	1303	if (!insert_ob_in_map (more, m, originator, flag))
1300	return 0;	1304	return 0;
1301		1305
1302	CLEAR_FLAG (op, FLAG_REMOVED);	1306	op->flag [FLAG_REMOVED] = false;
1303		1307	op->env = 0;
1304	op->map = newmap;	1308	op->map = newmap;
		1309
1305	mapspace &ms = op->ms ();	1310	mapspace &ms = op->ms ();
1306		1311
1307	/* this has to be done after we translate the coordinates.	1312	/* this has to be done after we translate the coordinates.
1308	*/	1313	*/
1309	if (op->nrof && !(flag & INS_NO_MERGE))	1314	if (op->nrof && !(flag & INS_NO_MERGE))
…		…
1330	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");
1331	abort ();	1336	abort ();
1332	}	1337	}
1333		1338
1334	if (!originator->is_on_map ())	1339	if (!originator->is_on_map ())
		1340	{
1335	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",
1336	op->debug_desc (), originator->debug_desc ());	1342	op->debug_desc (), originator->debug_desc ());
		1343	abort ();
		1344	}
1337		1345
1338	op->above = originator;	1346	op->above = originator;
1339	op->below = originator->below;	1347	op->below = originator->below;
1340	originator->below = op;	1348	originator->below = op;
1341		1349
…		…
1473	* blocked() and wall() work properly), and these flags are updated by	1481	* blocked() and wall() work properly), and these flags are updated by
1474	* update_object().	1482	* update_object().
1475	*/	1483	*/
1476		1484
1477	/* 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 */
1478	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1486	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1479	{	1487	{
1480	if (check_move_on (op, originator))	1488	if (check_move_on (op, originator))
1481	return 0;	1489	return 0;
1482		1490
1483	/* 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
…		…
1494	/* this function inserts an object in the map, but if it	1502	/* this function inserts an object in the map, but if it
1495	* 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.
1496	* 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.
1497	*/	1505	*/
1498	void	1506	void
1499	replace_insert_ob_in_map (const char arch_string, object op)	1507	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1500	{	1508	{
1501	/* first search for itself and remove any old instances */	1509	/* first search for itself and remove any old instances */
1502		1510
1503	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1511	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1504	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1512	if (tmp->arch->archname == archname) /* same archetype */
1505	tmp->destroy ();	1513	tmp->destroy ();
1506		1514
1507	object *tmp = arch_to_object (archetype::find (arch_string));	1515	object *tmp = arch_to_object (archetype::find (archname));
1508		1516
1509	tmp->x = op->x;	1517	tmp->x = op->x;
1510	tmp->y = op->y;	1518	tmp->y = op->y;
1511		1519
1512	insert_ob_in_map (tmp, op->map, op, 0);	1520	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1698	* on top.	1706	* on top.
1699	*/	1707	*/
1700	int	1708	int
1701	check_move_on (object op, object originator)	1709	check_move_on (object op, object originator)
1702	{	1710	{
		1711	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1712	return 0;
		1713
1703	object *tmp;	1714	object *tmp;
1704	maptile *m = op->map;	1715	maptile *m = op->map;
1705	int x = op->x, y = op->y;	1716	int x = op->x, y = op->y;
1706		1717
1707	MoveType move_on, move_slow, move_block;	1718	mapspace &ms = m->at (x, y);
1708		1719
1709	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1720	ms.update ();
1710	return 0;
1711		1721
1712	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1722	MoveType move_on = ms.move_on;
1713	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1723	MoveType move_slow = ms.move_slow;
1714	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1724	MoveType move_block = ms.move_block;
1715		1725
1716	/* 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,
1717	* 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
1718	* 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
1719	* as walking.	1729	* as walking.
…		…
1730	return 0;	1740	return 0;
1731		1741
1732	/* The objects have to be checked from top to bottom.	1742	/* The objects have to be checked from top to bottom.
1733	* Hence, we first go to the top:	1743	* Hence, we first go to the top:
1734	*/	1744	*/
1735		1745	for (object next, tmp = ms.top; tmp; tmp = next)
1736	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1737	{
1738	/* Trim the search when we find the first other spell effect
1739	* this helps performance so that if a space has 50 spell objects,
1740	* we don't need to check all of them.
1741	*/
1742	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1743	break;
1744	}	1746	{
		1747	next = tmp->below;
1745		1748
1746	for (; tmp; tmp = tmp->below)
1747	{
1748	if (tmp == op)	1749	if (tmp == op)
1749	continue; /* Can't apply yourself */	1750	continue; /* Can't apply yourself */
1750		1751
1751	/* 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.
1752	* Second check makes sure that the movement types not being slowed	1753	* Second check makes sure that the movement types not being slowed
…		…
1757	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1758	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1758	{	1759	{
1759	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1760	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1760	((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))
1761	{	1762	{
1762
1763	float
1764	diff = tmp->move_slow_penalty * fabs (op->speed);	1763	float diff = tmp->move_slow_penalty * fabs (op->speed);
1765		1764
1766	if (op->is_player ())	1765	if (op->is_player ())
1767	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)) \|\|
1768	(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)))
1769	diff /= 4.0;	1768	diff /= 4.0;
1770		1769
1771	op->speed_left -= diff;	1770	op->speed_left -= diff;
1772	}	1771	}
1773	}	1772	}
…		…
2174	* 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
2175	* 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.
2176	* 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
2177	* functions.	2176	* functions.
2178	*/	2177	*/
2179	int reduction_dir[SIZEOFFREE][3] = {	2178	const int reduction_dir[SIZEOFFREE][3] = {
2180	{0, 0, 0}, /* 0 */	2179	{0, 0, 0}, /* 0 */
2181	{0, 0, 0}, /* 1 */	2180	{0, 0, 0}, /* 1 */
2182	{0, 0, 0}, /* 2 */	2181	{0, 0, 0}, /* 2 */
2183	{0, 0, 0}, /* 3 */	2182	{0, 0, 0}, /* 3 */
2184	{0, 0, 0}, /* 4 */	2183	{0, 0, 0}, /* 4 */
…		…
2322	return tmp;	2321	return tmp;
2323		2322
2324	return 0;	2323	return 0;
2325	}	2324	}
2326		2325
2327	const shstr &	2326	shstr_tmp
2328	object::kv_get (const shstr &key) const	2327	object::kv_get (shstr_tmp key) const
2329	{	2328	{
2330	for (key_value *kv = key_values; kv; kv = kv->next)	2329	for (key_value *kv = key_values; kv; kv = kv->next)
2331	if (kv->key == key)	2330	if (kv->key == key)
2332	return kv->value;	2331	return kv->value;
2333		2332
2334	return shstr_null;	2333	return shstr ();
2335	}	2334	}
2336		2335
2337	void	2336	void
2338	object::kv_set (const shstr &key, const shstr &value)	2337	object::kv_set (shstr_tmp key, shstr_tmp value)
2339	{	2338	{
2340	for (key_value *kv = key_values; kv; kv = kv->next)	2339	for (key_value *kv = key_values; kv; kv = kv->next)
2341	if (kv->key == key)	2340	if (kv->key == key)
2342	{	2341	{
2343	kv->value = value;	2342	kv->value = value;
…		…
2352		2351
2353	key_values = kv;	2352	key_values = kv;
2354	}	2353	}
2355		2354
2356	void	2355	void
2357	object::kv_del (const shstr &key)	2356	object::kv_del (shstr_tmp key)
2358	{	2357	{
2359	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)	2358	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)
2360	if ((*kvp)->key == key)	2359	if ((*kvp)->key == key)
2361	{	2360	{
2362	key_value kv = kvp;	2361	key_value kv = kvp;
…		…
2493	container = 0;	2492	container = 0;
2494		2493
2495	// 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
2496	esrv_update_item (UPD_FLAGS, this, old_container);	2495	esrv_update_item (UPD_FLAGS, this, old_container);
2497		2496
2498	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 ());
2499	play_sound (sound_find ("chest_close"));	2498	play_sound (sound_find ("chest_close"));
2500	}	2499	}
2501		2500
2502	if (new_container)	2501	if (new_container)
2503	{	2502	{
…		…
2513	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2512	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2514	new_container->insert (closer);	2513	new_container->insert (closer);
2515	}	2514	}
2516	#endif	2515	#endif
2517		2516
2518	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 ());
2519		2518
2520	// 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
2521	esrv_send_item (this, new_container);	2520	esrv_send_item (this, new_container);
2522		2521
2523	new_container->flag [FLAG_APPLIED] = true;	2522	new_container->flag [FLAG_APPLIED] = true;
…		…
2531	// else if (!old_container->env && contr && contr->ns)	2530	// else if (!old_container->env && contr && contr->ns)
2532	// contr->ns->floorbox_reset ();	2531	// contr->ns->floorbox_reset ();
2533	}	2532	}
2534		2533
2535	object *	2534	object *
2536	object::force_find (const shstr name)	2535	object::force_find (shstr_tmp name)
2537	{	2536	{
2538	/* 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
2539	* place	2538	* place
2540	*/	2539	*/
2541	for (object *tmp = inv; tmp; tmp = tmp->below)	2540	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2543	return splay (tmp);	2542	return splay (tmp);
2544		2543
2545	return 0;	2544	return 0;
2546	}	2545	}
2547		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
2548	object *	2558	object *
2549	object::force_add (const shstr name, int duration)	2559	object::force_add (shstr_tmp name, int duration)
2550	{	2560	{
2551	if (object *force = force_find (name))	2561	if (object *force = force_find (name))
2552	force->destroy ();	2562	force->destroy ();
2553		2563
2554	object *force = get_archetype (FORCE_NAME);	2564	object *force = get_archetype (FORCE_NAME);
2555		2565
2556	force->slaying = name;	2566	force->slaying = name;
2557	force->stats.food = 1;	2567	force->force_set_timer (duration);
2558	force->speed_left = -1.f;
2559
2560	force->set_speed (duration ? 1.f / duration : 0.f);
2561	force->flag [FLAG_IS_USED_UP] = true;
2562	force->flag [FLAG_APPLIED] = true;	2568	force->flag [FLAG_APPLIED] = true;
2563		2569
2564	return insert (force);	2570	return insert (force);
2565	}	2571	}
2566		2572
2567	void	2573	void
2568	object::play_sound (faceidx sound)	2574	object::play_sound (faceidx sound) const
2569	{	2575	{
2570	if (!sound)	2576	if (!sound)
2571	return;	2577	return;
2572		2578
2573	if (flag [FLAG_REMOVED])	2579	if (is_on_map ())
2574	return;
2575
2576	if (env)
2577	{
2578	if (object *pl = in_player ())
2579	pl->contr->play_sound (sound);
2580	}
2581	else
2582	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);
2583	}	2592	}
2584		2593
2585	void	2594	void
2586	object::make_noise ()	2595	object::make_noise ()
2587	{	2596	{

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.275 by root, Sun Dec 28 15:28:47 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.275 by root, Sun Dec 28 15:28:47 2008 UTC vs.
Revision 1.294 by root, Thu Nov 5 15:43:21 2009 UTC