ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.206 by root, Tue Apr 15 14:21:04 2008 UTC vs.
Revision 1.320 by root, Wed Apr 7 19:54:44 2010 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992 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	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying
26	variable. */
27	#include <global.h>	25	#include <global.h>
28	#include <stdio.h>	26	#include <stdio.h>
29	#include <sys/types.h>	27	#include <sys/types.h>
30	#include <sys/uio.h>	28	#include <sys/uio.h>
31	#include <object.h>	29	#include <object.h>
32	#include <funcpoint.h>
33	#include <sproto.h>	30	#include <sproto.h>
34	#include <loader.h>
35		31
36	#include <bitset>	32	#include <bitset>
37		33
38	UUID UUID::cur;	34	UUID UUID::cur;
39	static uint64_t seq_next_save;	35	static uint64_t seq_next_save;
40	static const uint64 UUID_GAP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
		37	uint32_t mapspace::smellcount = 10000;
41		38
42	objectvec objects;	39	objectvec objects;
43	activevec actives;	40	activevec actives;
		41
		42	//+GPL
44		43
45	short freearr_x[SIZEOFFREE] = {	44	short freearr_x[SIZEOFFREE] = {
46	0,	45	0,
47	0, 1, 1, 1, 0, -1, -1, -1,	46	0, 1, 1, 1, 0, -1, -1, -1,
48	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	47	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
…		…
52	0,	51	0,
53	-1, -1, 0, 1, 1, 1, 0, -1,	52	-1, -1, 0, 1, 1, 1, 0, -1,
54	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	53	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
55	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	54	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
56	};	55	};
57	int maxfree[SIZEOFFREE] = {
58	0,
59	9, 10, 13, 14, 17, 18, 21, 22,
60	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
61	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
62	};
63	int freedir[SIZEOFFREE] = {	56	int freedir[SIZEOFFREE] = {
64	0,	57	0,
65	1, 2, 3, 4, 5, 6, 7, 8,	58	1, 2, 3, 4, 5, 6, 7, 8,
66	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	59	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
67	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	60	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
68	};	61	};
69		62
		63	static int maxfree[SIZEOFFREE] = {
		64	0,
		65	9, 10, 13, 14, 17, 18, 21, 22,
		66	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
		67	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
		68	};
		69
70	static void	70	static void
71	write_uuid (uval64 skip, bool sync)	71	write_uuid (uval64 skip, bool sync)
72	{	72	{
73	CALL_BEGIN (2);	73	CALL_BEGIN (2);
74	CALL_ARG_SV (newSVval64 (skip));	74	CALL_ARG_SV (newSVval64 (skip));
…		…
76	CALL_CALL ("cf::write_uuid", G_DISCARD);	76	CALL_CALL ("cf::write_uuid", G_DISCARD);
77	CALL_END;	77	CALL_END;
78	}	78	}
79		79
80	static void	80	static void
81	read_uuid (void)	81	read_uuid ()
82	{	82	{
83	char filename[MAX_BUF];	83	char filename[MAX_BUF];
84		84
85	sprintf (filename, "%s/uuid", settings.localdir);	85	sprintf (filename, "%s/uuid", settings.localdir);
86		86
…		…
100		100
101	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	101	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
102	_exit (1);	102	_exit (1);
103	}	103	}
104		104
105	UUID::BUF buf;	105	char buf [UUID::MAX_LEN];
106	buf[0] = 0;	106	buf[0] = 0;
107	fgets (buf, sizeof (buf), fp);	107	fgets (buf, sizeof (buf), fp);
108		108
109	if (!UUID::cur.parse (buf))	109	if (!UUID::cur.parse (buf))
110	{	110	{
…		…
137		137
138	void	138	void
139	UUID::init ()	139	UUID::init ()
140	{	140	{
141	read_uuid ();	141	read_uuid ();
		142	}
		143
		144	bool
		145	UUID::parse (const char *s)
		146	{
		147	if (*s++ != '<' || *s++ != '1' || *s++ != '.')
		148	return false;
		149
		150	seq = 0;
		151
		152	while (*s != '>')
		153	{
		154	if (*s < '0')
		155	return false;
		156
		157	// this gives nice branchless code with gcc
		158	assert ('0' < 'a' && '0' == 48 && 'a' == 97);
		159	int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
		160
		161	seq = (seq << 4) | digit;
		162
		163	++s;
		164	}
		165
		166	return true;
		167	}
		168
		169	char *
		170	UUID::append (char *buf) const
		171	{
		172	*buf++ = '<';
		173	*buf++ = '1';
		174	*buf++ = '.';
		175
		176	uint64_t seq = this->seq;
		177	const int bits = 64;
		178	char nz = 0;
		179	static const char tohex [] = "0123456789abcdef";
		180
		181	// assert (len >= 3 + bits / 4 + 1 + 1);
		182	for (int i = bits / 4; --i; )
		183	{
		184	uint8_t digit = seq >> (bits - 4);
		185
		186	*buf = tohex [digit];
		187	nz |= digit;
		188	buf += nz ? 1 : 0;
		189	seq <<= 4;
		190	}
		191
		192	// last digit is special - always emit
		193	uint8_t digit = seq >> (bits - 4);
		194	*buf++ = tohex [digit];
		195
		196	*buf++ = '>';
		197
		198	return buf;
		199	}
		200
		201	char *
		202	UUID::c_str () const
		203	{
		204	static char buf [MAX_LEN];
		205	*append (buf) = 0;
		206	return buf;
142	}	207	}
143		208
144	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	209	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
145	static bool	210	static bool
146	compare_ob_value_lists_one (const object *wants, const object *has)	211	compare_ob_value_lists_one (const object *wants, const object *has)
147	{	212	{
148	key_value *wants_field;
149
150	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	213	/* n-squared behaviour (see kv_get), but I'm hoping both
151	* objects with lists are rare, and lists stay short. If not, use a	214	* objects with lists are rare, and lists stay short. If not, use a
152	* different structure or at least keep the lists sorted...	215	* different structure or at least keep the lists sorted...
153	*/	216	*/
154		217
155	/* For each field in wants, */	218	/* For each field in wants, */
156	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)	219	for (key_value *kv = wants->key_values; kv; kv = kv->next)
157	{	220	if (has->kv_get (kv->key) != kv->value)
158	key_value *has_field;	221	return false;
159
160	/* Look for a field in has with the same key. */
161	has_field = get_ob_key_link (has, wants_field->key);
162
163	if (!has_field)
164	return 0; /* No field with that name. */
165
166	/* Found the matching field. */
167	if (has_field->value != wants_field->value)
168	return 0; /* Values don't match, so this half of the comparison is false. */
169
170	/* If we get here, we found a match. Now for the next field in wants. */
171	}
172		222
173	/* If we get here, every field in wants has a matching field in has. */	223	/* If we get here, every field in wants has a matching field in has. */
174	return 1;	224	return true;
175	}	225	}
176		226
177	/* Returns TRUE if ob1 has the same key_values as ob2. */	227	/* Returns TRUE if ob1 has the same key_values as ob2. */
178	static bool	228	static bool
179	compare_ob_value_lists (const object *ob1, const object *ob2)	229	compare_ob_value_lists (const object *ob1, const object *ob2)
180	{	230	{
181	/* However, there may be fields in has which aren't partnered in wants,	231	/* However, there may be fields in has which aren't partnered in wants,
182	* so we need to run the comparison *twice*. :(	232	* so we need to run the comparison *twice*. :(
183	*/	233	*/
184	return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1);	234	return compare_ob_value_lists_one (ob1, ob2)
		235	&& compare_ob_value_lists_one (ob2, ob1);
185	}	236	}
186		237
187	/* Function examines the 2 objects given to it, and returns true if	238	/* Function examines the 2 objects given to it, and returns true if
188	* they can be merged together.	239	* they can be merged together.
189	*	240	*
…		…
196	* Improvements made with merge: Better checking on potion, and also	247	* Improvements made with merge: Better checking on potion, and also
197	* check weight	248	* check weight
198	*/	249	*/
199	bool object::can_merge_slow (object *ob1, object *ob2)	250	bool object::can_merge_slow (object *ob1, object *ob2)
200	{	251	{
201	/* A couple quicksanity checks */	252	/* A couple quick sanity checks */
202	if (ob1 == ob2	253	if (ob1 == ob2
203	|| ob1->type != ob2->type	254	|| ob1->type != ob2->type
204	|| ob1->speed != ob2->speed
205	|| ob1->value != ob2->value	255	|| ob1->value != ob2->value
206	|| ob1->name != ob2->name)	256	|| ob1->name != ob2->name
		257	|| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
207	return 0;	258	return 0;
208		259
209	/* Do not merge objects if nrof would overflow. First part checks	260	/* Do not merge objects if nrof would overflow, assume nrof
210	* for unsigned overflow (2c), second part checks wether the result	261	* is always 0 .. 2**31-1 */
211	* would fit into a 32 bit signed int, which is often used to hold	262	if (ob1->nrof > 0x7fffffff - ob2->nrof)
212	* nrof values.
213	*/
214	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
215	return 0;	263	return 0;
216		264
217	/* If the objects have been identified, set the BEEN_APPLIED flag.	265	/* If the objects have been identified, set the BEEN_APPLIED flag.
218	* This is to the comparison of the flags below will be OK. We	266	* This is to the comparison of the flags below will be OK. We
219	* just can't ignore the been applied or identified flags, as they	267	* just can't ignore the been applied or identified flags, as they
…		…
224	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	272	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
225		273
226	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	274	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
227	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	275	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
228		276
229	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	277	if (ob1->arch->archname != ob2->arch->archname
230	|| ob1->arch != ob2->arch
231	|| ob1->name != ob2->name	278	|| ob1->name != ob2->name
232	|| ob1->title != ob2->title	279	|| ob1->title != ob2->title
233	|| ob1->msg != ob2->msg	280	|| ob1->msg != ob2->msg
234	|| ob1->weight != ob2->weight	281	|| ob1->weight != ob2->weight
235	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
236	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
237	|| ob1->attacktype != ob2->attacktype	282	|| ob1->attacktype != ob2->attacktype
238	|| ob1->magic != ob2->magic	283	|| ob1->magic != ob2->magic
239	|| ob1->slaying != ob2->slaying	284	|| ob1->slaying != ob2->slaying
240	|| ob1->skill != ob2->skill	285	|| ob1->skill != ob2->skill
241	|| ob1->value != ob2->value	286	|| ob1->value != ob2->value
242	|| ob1->animation_id != ob2->animation_id	287	|| ob1->animation_id != ob2->animation_id
		288	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
243	|| ob1->client_type != ob2->client_type	289	|| ob1->client_type != ob2->client_type
244	|| ob1->materialname != ob2->materialname	290	|| ob1->material != ob2->material
245	|| ob1->lore != ob2->lore	291	|| ob1->lore != ob2->lore
246	|| ob1->subtype != ob2->subtype	292	|| ob1->subtype != ob2->subtype
247	|| ob1->move_type != ob2->move_type	293	|| ob1->move_type != ob2->move_type
248	|| ob1->move_block != ob2->move_block	294	|| ob1->move_block != ob2->move_block
249	|| ob1->move_allow != ob2->move_allow	295	|| ob1->move_allow != ob2->move_allow
250	|| ob1->move_on != ob2->move_on	296	|| ob1->move_on != ob2->move_on
251	|| ob1->move_off != ob2->move_off	297	|| ob1->move_off != ob2->move_off
252	|| ob1->move_slow != ob2->move_slow	298	|| ob1->move_slow != ob2->move_slow
253	|| ob1->move_slow_penalty != ob2->move_slow_penalty)	299	|| fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
		300	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
		301	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
		302	return 0;
		303
		304	if ((ob1->flag ^ ob2->flag)
		305	.reset (FLAG_INV_LOCKED)
		306	.reset (FLAG_REMOVED)
		307	.any ())
254	return 0;	308	return 0;
255		309
256	/* This is really a spellbook check - we should in general	310	/* This is really a spellbook check - we should in general
257	* not merge objects with real inventories, as splitting them	311	* not merge objects with real inventories, as splitting them
258	* is hard.	312	* is hard.
…		…
297		351
298	if (ob1->key_values || ob2->key_values)	352	if (ob1->key_values || ob2->key_values)
299	{	353	{
300	/* At least one of these has key_values. */	354	/* At least one of these has key_values. */
301	if ((!ob1->key_values) != (!ob2->key_values))	355	if ((!ob1->key_values) != (!ob2->key_values))
302	/* One has fields, but the other one doesn't. */	356	return 0; /* One has fields, but the other one doesn't. */
303	return 0;	357
304	else if (!compare_ob_value_lists (ob1, ob2))	358	if (!compare_ob_value_lists (ob1, ob2))
305	return 0;	359	return 0;
306	}	360	}
307		361
308	if (ob1->self || ob2->self)	362	if (ob1->self || ob2->self)
309	{	363	{
…		…
315	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;	369	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
316	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;	370	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
317		371
318	if (k1 != k2)	372	if (k1 != k2)
319	return 0;	373	return 0;
		374
320	else if (k1 == 0)	375	if (k1 == 0)
321	return 1;	376	return 1;
		377
322	else if (!cfperl_can_merge (ob1, ob2))	378	if (!cfperl_can_merge (ob1, ob2))
323	return 0;	379	return 0;
324	}	380	}
325	}	381	}
326		382
327	/* Everything passes, must be OK. */	383	/* Everything passes, must be OK. */
328	return 1;	384	return 1;
329	}	385	}
330		386
		387	// find player who can see this object
		388	object *
		389	object::visible_to () const
		390	{
		391	if (client_visible () && !flag [FLAG_REMOVED])
		392	{
		393	// see if we are in a container of sorts
		394	if (env)
		395	{
		396	// the player inventory itself is always visible
		397	if (env->is_player ())
		398	return env;
		399
		400	// else a player could have our env open
		401	object *envest = env->outer_env_or_self ();
		402
		403	// the player itself is always on a map, so we will find him here
		404	// even if our inv is in a player.
		405	if (envest->is_on_map ())
		406	if (object *pl = envest->ms ().player ())
		407	if (pl->container_ () == env)
		408	return pl;
		409	}
		410	else
		411	{
		412	// maybe there is a player standing on the same mapspace
		413	// this will catch the case where "this" is a player
		414	if (object *pl = ms ().player ())
		415	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
		416	|| pl->container_ () == this)
		417	return pl;
		418	}
		419	}
		420
		421	return 0;
		422	}
		423
		424	// adjust weight per container type ("of holding")
		425	static sint32
		426	weight_adjust_for (object *op, sint32 weight)
		427	{
		428	return op->type == CONTAINER
		429	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		430	: weight;
		431	}
		432
331	/*	433	/*
		434	* adjust_weight(object, weight) adds the specified weight to an object,
		435	* and also updates how much the environment(s) is/are carrying.
		436	*/
		437	static void
		438	adjust_weight (object *op, sint32 weight)
		439	{
		440	while (op)
		441	{
		442	// adjust by actual difference to account for rounding errors
		443	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
		444	weight = weight_adjust_for (op, op->carrying)
		445	- weight_adjust_for (op, op->carrying - weight);
		446
		447	if (!weight)
		448	return;
		449
		450	op->carrying += weight;
		451
		452	if (object *pl = op->visible_to ())
		453	if (pl != op) // player is handled lazily
		454	esrv_update_item (UPD_WEIGHT, pl, op);
		455
		456	op = op->env;
		457	}
		458	}
		459
		460	/*
332	* sum_weight() is a recursive function which calculates the weight	461	* this is a recursive function which calculates the weight
333	* an object is carrying. It goes through in figures out how much	462	* an object is carrying. It goes through op and figures out how much
334	* containers are carrying, and sums it up.	463	* containers are carrying, and sums it up.
335	*/	464	*/
336	long	465	void
337	sum_weight (object *op)	466	object::update_weight ()
338	{	467	{
339	long sum;	468	sint32 sum = 0;
340	object *inv;
341		469
342	for (sum = 0, inv = op->inv; inv; inv = inv->below)	470	for (object *op = inv; op; op = op->below)
343	{	471	{
344	if (inv->inv)	472	if (op->inv)
345	sum_weight (inv);	473	op->update_weight ();
346		474
347	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	475	sum += op->total_weight ();
		476	}
		477
		478	sum = weight_adjust_for (this, sum);
		479
		480	if (sum != carrying)
348	}	481	{
349
350	if (op->type == CONTAINER && op->stats.Str)
351	sum = (sum * (100 - op->stats.Str)) / 100;
352
353	if (op->carrying != sum)
354	op->carrying = sum;	482	carrying = sum;
355		483
356	return sum;	484	if (object *pl = visible_to ())
		485	if (pl != this) // player is handled lazily
		486	esrv_update_item (UPD_WEIGHT, pl, this);
		487	}
357	}	488	}
358		489
359	/**	490	/*
360	* Return the outermost environment object for a given object.	491	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
361	*/
362
363	object *
364	object_get_env_recursive (object *op)
365	{
366	while (op->env != NULL)
367	op = op->env;
368	return op;
369	}
370
371	/*
372	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
373	* Some error messages.
374	* The result of the dump is stored in the static global errmsg array.
375	*/	492	*/
376	char *	493	char *
377	dump_object (object *op)	494	dump_object (object *op)
378	{	495	{
379	if (!op)	496	if (!op)
…		…
382	object_freezer freezer;	499	object_freezer freezer;
383	op->write (freezer);	500	op->write (freezer);
384	return freezer.as_string ();	501	return freezer.as_string ();
385	}	502	}
386		503
387	/*	504	char *
388	* get_nearest_part(multi-object, object 2) returns the part of the	505	object::as_string ()
389	* multi-object 1 which is closest to the second object.
390	* If it's not a multi-object, it is returned.
391	*/
392	object *
393	get_nearest_part (object *op, const object *pl)
394	{	506	{
395	object *tmp, *closest;	507	return dump_object (this);
396	int last_dist, i;
397
398	if (op->more == NULL)
399	return op;
400	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)
401	if ((i = distance (tmp, pl)) < last_dist)
402	closest = tmp, last_dist = i;
403	return closest;
404	}	508	}
405		509
406	/*	510	/*
407	* Returns the object which has the count-variable equal to the argument.	511	* Returns the object which has the count-variable equal to the argument.
		512	* VERRRY slow.
408	*/	513	*/
409	object *	514	object *
410	find_object (tag_t i)	515	find_object (tag_t i)
411	{	516	{
412	for_all_objects (op)	517	for_all_objects (op)
…		…
415		520
416	return 0;	521	return 0;
417	}	522	}
418		523
419	/*	524	/*
		525	* Returns the object which has the uuid equal to the argument.
		526	* MOAR VERRRY slow.
		527	*/
		528
		529	object *
		530	find_object_uuid (UUID i)
		531	{
		532	for_all_objects (op)
		533	if (op->uuid == i)
		534	return op;
		535
		536	return 0;
		537	}
		538
		539	/*
420	* Returns the first object which has a name equal to the argument.	540	* Returns the first object which has a name equal to the argument.
421	* Used only by the patch command, but not all that useful.	541	* Used only by the patch command, but not all that useful.
422	* Enables features like "patch <name-of-other-player> food 999"	542	* Enables features like "patch <name-of-other-player> food 999"
423	*/	543	*/
424	object *	544	object *
425	find_object_name (const char *str)	545	find_object_name (const char *str)
426	{	546	{
427	shstr_cmp str_ (str);	547	shstr_cmp str_ (str);
428	object *op;
429		548
		549	if (str_)
430	for_all_objects (op)	550	for_all_objects (op)
431	if (op->name == str_)	551	if (op->name == str_)
432	break;	552	return op;
433		553
434	return op;	554	return 0;
435	}	555	}
436		556
437	/*	557	/*
438	* Sets the owner and sets the skill and exp pointers to owner's current	558	* Sets the owner and sets the skill and exp pointers to owner's current
439	* skill and experience objects.	559	* skill and experience objects.
…		…
454	}	574	}
455		575
456	this->owner = owner;	576	this->owner = owner;
457	}	577	}
458		578
459	int
460	object::slottype () const
461	{
462	if (type == SKILL)
463	{
464	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
465	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
466	}
467	else
468	{
469	if (slot [body_combat].info) return slot_combat;
470	if (slot [body_range ].info) return slot_ranged;
471	}
472
473	return slot_none;
474	}
475
476	bool
477	object::change_weapon (object *ob)
478	{
479	if (current_weapon == ob)
480	return true;
481
482	if (chosen_skill)
483	chosen_skill->flag [FLAG_APPLIED] = false;
484
485	current_weapon = ob;
486	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
487
488	if (chosen_skill)
489	chosen_skill->flag [FLAG_APPLIED] = true;
490
491	update_stats ();
492
493	if (ob)
494	{
495	// now check wether any body locations became invalid, in which case
496	// we cannot apply the weapon at the moment.
497	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
498	if (slot[i].used < 0)
499	{
500	current_weapon = chosen_skill = 0;
501	update_stats ();
502
503	new_draw_info_format (NDI_UNIQUE, 0, this,
504	"You try to balance all your items at once, "
505	"but the %s is just too much for your body. "
506	"[You need to unapply some items first.]", &ob->name);
507	return false;
508	}
509
510	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
511	}
512	else
513	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
514
515	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
516	{
517	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
518	&name, ob->debug_desc ());
519	return false;
520	}
521
522	return true;
523	}
524
525	/* Zero the key_values on op, decrementing the shared-string	579	/* Zero the key_values on op, decrementing the shared-string
526	* refcounts and freeing the links.	580	* refcounts and freeing the links.
527	*/	581	*/
528	static void	582	static void
529	free_key_values (object *op)	583	free_key_values (object *op)
…		…
537	}	591	}
538		592
539	op->key_values = 0;	593	op->key_values = 0;
540	}	594	}
541		595
542	object &	596	/*
543	object::operator =(const object &src)	597	* copy_to first frees everything allocated by the dst object,
		598	* and then copies the contents of itself into the second
		599	* object, allocating what needs to be allocated. Basically, any
		600	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		601	* if the first object is freed, the pointers in the new object
		602	* will point at garbage.
		603	*/
		604	void
		605	object::copy_to (object *dst)
544	{	606	{
545	bool is_freed = flag [FLAG_FREED];	607	dst->remove ();
546	bool is_removed = flag [FLAG_REMOVED];
547
548	*(object_copy *)this = src;	608	*(object_copy *)dst = *this;
549
550	flag [FLAG_FREED] = is_freed;
551	flag [FLAG_REMOVED] = is_removed;	609	dst->flag [FLAG_REMOVED] = true;
552		610
553	/* Copy over key_values, if any. */	611	/* Copy over key_values, if any. */
554	if (src.key_values)	612	if (key_values)
555	{	613	{
556	key_value *tail = 0;	614	key_value *tail = 0;
557	key_values = 0;	615	dst->key_values = 0;
558		616
559	for (key_value *i = src.key_values; i; i = i->next)	617	for (key_value *i = key_values; i; i = i->next)
560	{	618	{
561	key_value *new_link = new key_value;	619	key_value *new_link = new key_value;
562		620
563	new_link->next = 0;	621	new_link->next = 0;
564	new_link->key = i->key;	622	new_link->key = i->key;
565	new_link->value = i->value;	623	new_link->value = i->value;
566		624
567	/* Try and be clever here, too. */	625	/* Try and be clever here, too. */
568	if (!key_values)	626	if (!dst->key_values)
569	{	627	{
570	key_values = new_link;	628	dst->key_values = new_link;
571	tail = new_link;	629	tail = new_link;
572	}	630	}
573	else	631	else
574	{	632	{
575	tail->next = new_link;	633	tail->next = new_link;
576	tail = new_link;	634	tail = new_link;
577	}	635	}
578	}	636	}
579	}	637	}
580	}
581		638
582	/*	639	dst->activate ();
583	* copy_to first frees everything allocated by the dst object,
584	* and then copies the contents of itself into the second
585	* object, allocating what needs to be allocated. Basically, any
586	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
587	* if the first object is freed, the pointers in the new object
588	* will point at garbage.
589	*/
590	void
591	object::copy_to (object *dst)
592	{
593	*dst = *this;
594
595	if (speed < 0)
596	dst->speed_left -= rndm ();
597
598	dst->set_speed (dst->speed);
599	}	640	}
600		641
601	void	642	void
602	object::instantiate ()	643	object::instantiate ()
603	{	644	{
604	if (!uuid.seq) // HACK	645	if (!uuid.seq) // HACK
605	uuid = UUID::gen ();	646	uuid = UUID::gen ();
606		647
		648	// TODO: unclean state changes, should nt be done in copy_to AND instantiate
		649	if (flag [FLAG_RANDOM_SPEED] && speed)
		650	speed_left = - speed - rndm (); // TODO animation
		651	else
607	speed_left = -0.1f;	652	speed_left = -1.;
		653
608	/* copy the body_info to the body_used - this is only really	654	/* copy the body_info to the body_used - this is only really
609	* need for monsters, but doesn't hurt to do it for everything.	655	* need for monsters, but doesn't hurt to do it for everything.
610	* by doing so, when a monster is created, it has good starting	656	* by doing so, when a monster is created, it has good starting
611	* values for the body_used info, so when items are created	657	* values for the body_used info, so when items are created
612	* for it, they can be properly equipped.	658	* for it, they can be properly equipped.
…		…
620	object *	666	object *
621	object::clone ()	667	object::clone ()
622	{	668	{
623	object *neu = create ();	669	object *neu = create ();
624	copy_to (neu);	670	copy_to (neu);
		671
		672	// TODO: unclean state changes, should not be done in clone AND instantiate
		673	if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
		674	neu->speed_left = - neu->speed - rndm (); // TODO animation
		675
		676	neu->map = map; // not copied by copy_to
625	return neu;	677	return neu;
626	}	678	}
627		679
628	/*	680	/*
629	* If an object with the IS_TURNABLE() flag needs to be turned due	681	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
646	* This function needs to be called whenever the speed of an object changes.	698	* This function needs to be called whenever the speed of an object changes.
647	*/	699	*/
648	void	700	void
649	object::set_speed (float speed)	701	object::set_speed (float speed)
650	{	702	{
651	if (flag [FLAG_FREED] && speed)
652	{
653	LOG (llevError, "Object %s is freed but has speed.\n", &name);
654	speed = 0;
655	}
656
657	this->speed = speed;	703	this->speed = speed;
658		704
659	if (has_active_speed ())	705	if (has_active_speed ())
660	activate ();	706	activate ();
661	else	707	else
…		…
680	* UP_OBJ_FACE: only the objects face has changed.	726	* UP_OBJ_FACE: only the objects face has changed.
681	*/	727	*/
682	void	728	void
683	update_object (object *op, int action)	729	update_object (object *op, int action)
684	{	730	{
685	if (op == NULL)	731	if (!op)
686	{	732	{
687	/* this should never happen */	733	/* this should never happen */
688	LOG (llevDebug, "update_object() called for NULL object.\n");	734	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
689	return;	735	return;
690	}	736	}
691		737
692	if (op->env)	738	if (!op->is_on_map ())
693	{	739	{
694	/* Animation is currently handled by client, so nothing	740	/* Animation is currently handled by client, so nothing
695	* to do in this case.	741	* to do in this case.
696	*/	742	*/
697	return;	743	return;
698	}	744	}
699
700	/* If the map is saving, don't do anything as everything is
701	* going to get freed anyways.
702	*/
703	if (!op->map || op->map->in_memory == MAP_SAVING)
704	return;
705		745
706	/* make sure the object is within map boundaries */	746	/* make sure the object is within map boundaries */
707	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)	747	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
708	{	748	{
709	LOG (llevError, "update_object() called for object out of map!\n");	749	LOG (llevError, "update_object() called for object out of map!\n");
…		…
717		757
718	if (!(m.flags_ & P_UPTODATE))	758	if (!(m.flags_ & P_UPTODATE))
719	/* nop */;	759	/* nop */;
720	else if (action == UP_OBJ_INSERT)	760	else if (action == UP_OBJ_INSERT)
721	{	761	{
		762	#if 0
722	// this is likely overkill, TODO: revisit (schmorp)	763	// this is likely overkill, TODO: revisit (schmorp)
723	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	764	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
724	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	765	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
725	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	766	|| (op->is_player () && !(m.flags_ & P_PLAYER))
726	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	767	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
727	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	768	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
728	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	769	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
729	|| (m.move_on | op->move_on ) != m.move_on	770	|| (m.move_on | op->move_on ) != m.move_on
730	|| (m.move_off | op->move_off ) != m.move_off	771	|| (m.move_off | op->move_off ) != m.move_off
731	|| (m.move_slow | op->move_slow) != m.move_slow	772	|| (m.move_slow | op->move_slow) != m.move_slow
732	/* This isn't perfect, but I don't expect a lot of objects to	773	/* This isn't perfect, but I don't expect a lot of objects to
733	* to have move_allow right now.	774	* have move_allow right now.
734	*/	775	*/
735	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	776	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
		777	m.invalidate ();
		778	#else
736	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	779	// the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
737	m.flags_ = 0;	780	m.invalidate ();
		781	#endif
738	}	782	}
739	/* if the object is being removed, we can't make intelligent	783	/* if the object is being removed, we can't make intelligent
740	* decisions, because remove_ob can't really pass the object	784	* decisions, because remove_ob can't really pass the object
741	* that is being removed.	785	* that is being removed.
742	*/	786	*/
743	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	787	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
744	m.flags_ = 0;	788	m.invalidate ();
745	else if (action == UP_OBJ_FACE)	789	else if (action == UP_OBJ_FACE)
746	/* Nothing to do for that case */ ;	790	/* Nothing to do for that case */ ;
747	else	791	else
748	LOG (llevError, "update_object called with invalid action: %d\n", action);	792	LOG (llevError, "update_object called with invalid action: %d\n", action);
749		793
…		…
753		797
754	object::object ()	798	object::object ()
755	{	799	{
756	SET_FLAG (this, FLAG_REMOVED);	800	SET_FLAG (this, FLAG_REMOVED);
757		801
758	expmul = 1.0;	802	//expmul = 1.0; declared const for the time being
759	face = blank_face;	803	face = blank_face;
		804	material = MATERIAL_NULL;
760	}	805	}
761		806
762	object::~object ()	807	object::~object ()
763	{	808	{
764	unlink ();	809	unlink ();
…		…
793	/* If already on active list, don't do anything */	838	/* If already on active list, don't do anything */
794	if (active)	839	if (active)
795	return;	840	return;
796		841
797	if (has_active_speed ())	842	if (has_active_speed ())
		843	{
		844	if (flag [FLAG_FREED])
		845	LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		846
798	actives.insert (this);	847	actives.insert (this);
		848	}
799	}	849	}
800		850
801	void	851	void
802	object::activate_recursive ()	852	object::activate_recursive ()
803	{	853	{
…		…
852	object::destroy_inv (bool drop_to_ground)	902	object::destroy_inv (bool drop_to_ground)
853	{	903	{
854	// need to check first, because the checks below might segfault	904	// need to check first, because the checks below might segfault
855	// as we might be on an invalid mapspace and crossfire code	905	// as we might be on an invalid mapspace and crossfire code
856	// is too buggy to ensure that the inventory is empty.	906	// is too buggy to ensure that the inventory is empty.
857	// corollary: if you create arrows etc. with stuff in tis inventory,	907	// corollary: if you create arrows etc. with stuff in its inventory,
858	// cf will crash below with off-map x and y	908	// cf will crash below with off-map x and y
859	if (!inv)	909	if (!inv)
860	return;	910	return;
861		911
862	/* Only if the space blocks everything do we not process -	912	/* Only if the space blocks everything do we not process -
…		…
864	* drop on that space.	914	* drop on that space.
865	*/	915	*/
866	if (!drop_to_ground	916	if (!drop_to_ground
867	|| !map	917	|| !map
868	|| map->in_memory != MAP_ACTIVE	918	|| map->in_memory != MAP_ACTIVE
869	|| map->nodrop	919	|| map->no_drop
870	|| ms ().move_block == MOVE_ALL)	920	|| ms ().move_block == MOVE_ALL)
871	{	921	{
872	while (inv)	922	while (inv)
873	{
874	inv->destroy_inv (drop_to_ground);
875	inv->destroy ();	923	inv->destroy ();
876	}
877	}	924	}
878	else	925	else
879	{ /* Put objects in inventory onto this space */	926	{ /* Put objects in inventory onto this space */
880	while (inv)	927	while (inv)
881	{	928	{
…		…
892	map->insert (op, x, y);	939	map->insert (op, x, y);
893	}	940	}
894	}	941	}
895	}	942	}
896		943
		944	/*
		945	* Remove and free all objects in the inventory of the given object.
		946	* Unlike destroy_inv, this assumes the *this is destroyed as well
		947	* well, so we can (and have to!) take shortcuts.
		948	*/
		949	void
		950	object::destroy_inv_fast ()
		951	{
		952	while (object *op = inv)
		953	{
		954	// remove from object the fast way
		955	op->flag [FLAG_REMOVED] = true;
		956	op->env = 0;
		957	if ((inv = inv->below))
		958	inv->above = 0;
		959
		960	// then destroy
		961	op->destroy ();
		962	}
		963	}
		964
897	object *object::create ()	965	object *object::create ()
898	{	966	{
899	object *op = new object;	967	object *op = new object;
900	op->link ();	968	op->link ();
901	return op;	969	return op;
902	}	970	}
903		971
		972	static struct freed_map : maptile
		973	{
		974	freed_map ()
		975	{
		976	path = "<freed objects map>";
		977	name = "/internal/freed_objects_map";
		978	width = 3;
		979	height = 3;
		980	no_drop = 1;
		981	no_reset = 1;
		982
		983	alloc ();
		984	in_memory = MAP_ACTIVE;
		985	}
		986
		987	~freed_map ()
		988	{
		989	destroy ();
		990	}
		991	} freed_map; // freed objects are moved here to avoid crashes
		992
904	void	993	void
905	object::do_destroy ()	994	object::do_destroy ()
906	{	995	{
907	attachable::do_destroy ();
908
909	if (flag [FLAG_IS_LINKED])	996	if (flag [FLAG_IS_LINKED])
910	remove_button_link (this);	997	remove_link ();
911		998
912	if (flag [FLAG_FRIENDLY])	999	if (flag [FLAG_FRIENDLY])
913	remove_friendly_object (this);	1000	remove_friendly_object (this);
914		1001
915	if (!flag [FLAG_REMOVED])
916	remove ();	1002	remove ();
917		1003
918	destroy_inv (true);	1004	attachable::do_destroy ();
919		1005
920	deactivate ();	1006	deactivate ();
921	unlink ();	1007	unlink ();
922		1008
923	flag [FLAG_FREED] = 1;	1009	flag [FLAG_FREED] = 1;
924		1010
925	// hack to ensure that freed objects still have a valid map	1011	// hack to ensure that freed objects still have a valid map
926	{
927	static maptile *freed_map; // freed objects are moved here to avoid crashes
928
929	if (!freed_map)
930	{
931	freed_map = new maptile;
932
933	freed_map->path = "<freed objects map>";
934	freed_map->name = "/internal/freed_objects_map";
935	freed_map->width = 3;
936	freed_map->height = 3;
937	freed_map->nodrop = 1;
938
939	freed_map->alloc ();
940	freed_map->in_memory = MAP_ACTIVE;
941	}
942
943	map = freed_map;	1012	map = &freed_map;
944	x = 1;	1013	x = 1;
945	y = 1;	1014	y = 1;
946	}
947		1015
948	if (more)	1016	if (more)
949	{	1017	{
950	more->destroy ();	1018	more->destroy ();
951	more = 0;	1019	more = 0;
…		…
959	attacked_by = 0;	1027	attacked_by = 0;
960	current_weapon = 0;	1028	current_weapon = 0;
961	}	1029	}
962		1030
963	void	1031	void
964	object::destroy (bool destroy_inventory)	1032	object::destroy ()
965	{	1033	{
966	if (destroyed ())	1034	if (destroyed ())
967	return;	1035	return;
968		1036
969	if (destroy_inventory)	1037	if (!is_head () && !head->destroyed ())
		1038	{
		1039	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1040	head->destroy ();
		1041	return;
		1042	}
		1043
970	destroy_inv (false);	1044	destroy_inv_fast ();
971		1045
972	if (is_head ())	1046	if (is_head ())
973	if (sound_destroy)	1047	if (sound_destroy)
974	play_sound (sound_destroy);	1048	play_sound (sound_destroy);
975	else if (flag [FLAG_MONSTER])	1049	else if (flag [FLAG_MONSTER])
976	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism	1050	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
977		1051
978	attachable::destroy ();	1052	attachable::destroy ();
979	}
980
981	/*
982	* sub_weight() recursively (outwards) subtracts a number from the
983	* weight of an object (and what is carried by it's environment(s)).
984	*/
985	void
986	sub_weight (object *op, signed long weight)
987	{
988	while (op != NULL)
989	{
990	if (op->type == CONTAINER)
991	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
992
993	op->carrying -= weight;
994	op = op->env;
995	}
996	}	1053	}
997		1054
998	/* op->remove ():	1055	/* op->remove ():
999	* This function removes the object op from the linked list of objects	1056	* This function removes the object op from the linked list of objects
1000	* which it is currently tied to. When this function is done, the	1057	* which it is currently tied to. When this function is done, the
…		…
1003	* the previous environment.	1060	* the previous environment.
1004	*/	1061	*/
1005	void	1062	void
1006	object::do_remove ()	1063	object::do_remove ()
1007	{	1064	{
1008	object *tmp, *last = 0;	1065	if (flag [FLAG_REMOVED])
1009	object *otmp;
1010
1011	if (QUERY_FLAG (this, FLAG_REMOVED))
1012	return;	1066	return;
1013		1067
1014	SET_FLAG (this, FLAG_REMOVED);
1015	INVOKE_OBJECT (REMOVE, this);	1068	INVOKE_OBJECT (REMOVE, this);
		1069
		1070	flag [FLAG_REMOVED] = true;
1016		1071
1017	if (more)	1072	if (more)
1018	more->remove ();	1073	more->remove ();
1019		1074
1020	/*	1075	/*
1021	* In this case, the object to be removed is in someones	1076	* In this case, the object to be removed is in someones
1022	* inventory.	1077	* inventory.
1023	*/	1078	*/
1024	if (env)	1079	if (env)
1025	{	1080	{
1026	if (nrof)	1081	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1027	sub_weight (env, weight * nrof);	1082	if (object *pl = visible_to ())
1028	else	1083	esrv_del_item (pl->contr, count);
1029	sub_weight (env, weight + carrying);	1084	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1030		1085
1031	/* NO_FIX_PLAYER is set when a great many changes are being	1086	adjust_weight (env, -total_weight ());
1032	* made to players inventory. If set, avoiding the call
1033	* to save cpu time.
1034	*/
1035	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1036	otmp->update_stats ();
1037		1087
1038	if (above)	1088	object *pl = in_player ();
1039	above->below = below;
1040	else
1041	env->inv = below;
1042
1043	if (below)
1044	below->above = above;
1045		1089
1046	/* we set up values so that it could be inserted into	1090	/* we set up values so that it could be inserted into
1047	* the map, but we don't actually do that - it is up	1091	* the map, but we don't actually do that - it is up
1048	* to the caller to decide what we want to do.	1092	* to the caller to decide what we want to do.
1049	*/	1093	*/
1050	x = env->x, y = env->y;
1051	map = env->map;	1094	map = env->map;
1052	above = 0, below = 0;	1095	x = env->x;
		1096	y = env->y;
		1097
		1098	// make sure cmov optimisation is applicable
		1099	*(above ? &above->below : &env->inv) = below;
		1100	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1101
		1102	above = 0;
		1103	below = 0;
1053	env = 0;	1104	env = 0;
		1105
		1106	if (pl && pl->is_player ())
		1107	{
		1108	if (expect_false (pl->contr->combat_ob == this))
		1109	{
		1110	pl->apply (pl->contr->combat_ob, AP_UNAPPLY);
		1111	pl->contr->combat_ob = 0;
		1112	if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);
		1113	}
		1114
		1115	if (expect_false (pl->contr->ranged_ob == this))
		1116	{
		1117	pl->apply (pl->contr->ranged_ob, AP_UNAPPLY);
		1118	pl->contr->ranged_ob = 0;
		1119	if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);
		1120	}
		1121
		1122	pl->contr->queue_stats_update ();
		1123
		1124	if (expect_false (glow_radius) && pl->is_on_map ())
		1125	update_all_los (pl->map, pl->x, pl->y);
		1126	}
1054	}	1127	}
1055	else if (map)	1128	else if (map)
1056	{	1129	{
1057	if (type == PLAYER)
1058	{
1059	// leaving a spot always closes any open container on the ground
1060	if (container && !container->env)
1061	// this causes spurious floorbox updates, but it ensures
1062	// that the CLOSE event is being sent.
1063	close_container ();
1064
1065	--map->players;
1066	map->touch ();
1067	}
1068
1069	map->dirty = true;	1130	map->dirty = true;
1070	mapspace &ms = this->ms ();	1131	mapspace &ms = this->ms ();
1071		1132
		1133	if (object *pl = ms.player ())
		1134	{
		1135	if (is_player ())
		1136	{
		1137	if (!flag [FLAG_WIZPASS])
		1138	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1139
		1140	// leaving a spot always closes any open container on the ground
		1141	if (container && !container->env)
		1142	// this causes spurious floorbox updates, but it ensures
		1143	// that the CLOSE event is being sent.
		1144	close_container ();
		1145
		1146	--map->players;
		1147	map->touch ();
		1148	}
		1149	else if (pl->container_ () == this)
		1150	{
		1151	// removing a container should close it
		1152	close_container ();
		1153	}
		1154
		1155	esrv_del_item (pl->contr, count);
		1156	}
		1157
1072	/* link the object above us */	1158	/* link the object above us */
1073	if (above)	1159	// re-link, make sure compiler can easily use cmove
1074	above->below = below;	1160	*(above ? &above->below : &ms.top) = below;
1075	else	1161	*(below ? &below->above : &ms.bot) = above;
1076	ms.top = below; /* we were top, set new top */
1077
1078	/* Relink the object below us, if there is one */
1079	if (below)
1080	below->above = above;
1081	else
1082	{
1083	/* Nothing below, which means we need to relink map object for this space
1084	* use translated coordinates in case some oddness with map tiling is
1085	* evident
1086	*/
1087	if (GET_MAP_OB (map, x, y) != this)
1088	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 ());
1089
1090	ms.bot = above; /* goes on above it. */
1091	}
1092		1162
1093	above = 0;	1163	above = 0;
1094	below = 0;	1164	below = 0;
1095		1165
		1166	ms.invalidate ();
		1167
1096	if (map->in_memory == MAP_SAVING)	1168	if (map->in_memory == MAP_SAVING)
1097	return;	1169	return;
1098		1170
1099	int check_walk_off = !flag [FLAG_NO_APPLY];	1171	int check_walk_off = !flag [FLAG_NO_APPLY];
1100		1172
1101	if (object *pl = ms.player ())	1173	if (object *pl = ms.player ())
1102	{	1174	{
1103	if (pl->container == this)	1175	if (pl->container_ () == this)
1104	/* If a container that the player is currently using somehow gets	1176	/* If a container that the player is currently using somehow gets
1105	* removed (most likely destroyed), update the player view	1177	* removed (most likely destroyed), update the player view
1106	* appropriately.	1178	* appropriately.
1107	*/	1179	*/
1108	pl->close_container ();	1180	pl->close_container ();
1109		1181
		1182	//TODO: the floorbox prev/next might need updating
		1183	//esrv_del_item (pl->contr, count);
		1184	//TODO: update floorbox to preserve ordering
		1185	if (pl->contr->ns)
1110	pl->contr->ns->floorbox_update ();	1186	pl->contr->ns->floorbox_update ();
1111	}	1187	}
1112		1188
		1189	if (check_walk_off)
1113	for (tmp = ms.bot; tmp; tmp = tmp->above)	1190	for (object *above, *tmp = ms.bot; tmp; tmp = above)
1114	{	1191	{
		1192	above = tmp->above;
		1193
1115	/* No point updating the players look faces if he is the object	1194	/* No point updating the players look faces if he is the object
1116	* being removed.	1195	* being removed.
1117	*/	1196	*/
1118		1197
1119	/* See if object moving off should effect something */	1198	/* See if object moving off should effect something */
1120	if (check_walk_off
1121	&& ((move_type & tmp->move_off)	1199	if ((move_type & tmp->move_off)
1122	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1200	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1123	{
1124	move_apply (tmp, this, 0);	1201	move_apply (tmp, this, 0);
1125
1126	if (destroyed ())
1127	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1128	}	1202	}
1129		1203
1130	last = tmp;	1204	if (affects_los ())
1131	}
1132
1133	/* last == NULL if there are no objects on this space */
1134	//TODO: this makes little sense, why only update the topmost object?
1135	if (!last)
1136	map->at (x, y).flags_ = 0;
1137	else
1138	update_object (last, UP_OBJ_REMOVE);
1139
1140	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1141	update_all_los (map, x, y);	1205	update_all_los (map, x, y);
1142	}	1206	}
1143	}	1207	}
1144		1208
1145	/*	1209	/*
…		…
1159	if (!top)	1223	if (!top)
1160	for (top = op; top && top->above; top = top->above)	1224	for (top = op; top && top->above; top = top->above)
1161	;	1225	;
1162		1226
1163	for (; top; top = top->below)	1227	for (; top; top = top->below)
1164	{
1165	if (top == op)
1166	continue;
1167
1168	if (object::can_merge (op, top))	1228	if (object::can_merge (op, top))
1169	{	1229	{
1170	top->nrof += op->nrof;	1230	top->nrof += op->nrof;
1171		1231
1172	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1232	if (object *pl = top->visible_to ())
1173	op->weight = 0; /* Don't want any adjustements now */	1233	esrv_update_item (UPD_NROF, pl, top);
		1234
		1235	op->weight = 0; // cancel the addition above
		1236	op->carrying = 0; // must be 0 already
		1237
1174	op->destroy ();	1238	op->destroy ();
		1239
1175	return top;	1240	return top;
1176	}	1241	}
1177	}
1178		1242
1179	return 0;	1243	return 0;
1180	}	1244	}
1181		1245
1182	void	1246	void
…		…
1187		1251
1188	object *prev = this;	1252	object *prev = this;
1189		1253
1190	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)	1254	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1191	{	1255	{
1192	object *op = arch_to_object (at);	1256	object *op = at->instance ();
1193		1257
1194	op->name = name;	1258	op->name = name;
1195	op->name_pl = name_pl;	1259	op->name_pl = name_pl;
1196	op->title = title;	1260	op->title = title;
1197		1261
…		…
1207	* job preparing multi-part monsters.	1271	* job preparing multi-part monsters.
1208	*/	1272	*/
1209	object *	1273	object *
1210	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1274	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1211	{	1275	{
		1276	op->remove ();
		1277
1212	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1278	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1213	{	1279	{
1214	tmp->x = x + tmp->arch->x;	1280	tmp->x = x + tmp->arch->x;
1215	tmp->y = y + tmp->arch->y;	1281	tmp->y = y + tmp->arch->y;
1216	}	1282	}
…		…
1233	* Passing 0 for flag gives proper default values, so flag really only needs	1299	* Passing 0 for flag gives proper default values, so flag really only needs
1234	* to be set if special handling is needed.	1300	* to be set if special handling is needed.
1235	*	1301	*
1236	* Return value:	1302	* Return value:
1237	* new object if 'op' was merged with other object	1303	* new object if 'op' was merged with other object
1238	* NULL if 'op' was destroyed	1304	* NULL if there was an error (destroyed, blocked etc.)
1239	* just 'op' otherwise	1305	* just 'op' otherwise
1240	*/	1306	*/
1241	object *	1307	object *
1242	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1308	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1243	{	1309	{
1244	assert (!op->flag [FLAG_FREED]);
1245
1246	object *top, *floor = NULL;
1247
1248	op->remove ();	1310	op->remove ();
		1311
		1312	if (m == &freed_map)//D TODO: remove soon
		1313	{//D
		1314	LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
		1315	}//D
1249		1316
1250	/* Ideally, the caller figures this out. However, it complicates a lot	1317	/* Ideally, the caller figures this out. However, it complicates a lot
1251	* of areas of callers (eg, anything that uses find_free_spot would now	1318	* of areas of callers (eg, anything that uses find_free_spot would now
1252	* need extra work	1319	* need extra work
1253	*/	1320	*/
		1321	maptile *newmap = m;
1254	if (!xy_normalise (m, op->x, op->y))	1322	if (!xy_normalise (newmap, op->x, op->y))
1255	{	1323	{
1256	op->destroy ();	1324	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1257	return 0;	1325	return 0;
1258	}	1326	}
1259		1327
1260	if (object *more = op->more)	1328	if (object *more = op->more)
1261	if (!insert_ob_in_map (more, m, originator, flag))	1329	if (!insert_ob_in_map (more, m, originator, flag))
1262	return 0;	1330	return 0;
1263		1331
1264	CLEAR_FLAG (op, FLAG_REMOVED);	1332	op->flag [FLAG_REMOVED] = false;
1265		1333	op->env = 0;
1266	op->map = m;	1334	op->map = newmap;
		1335
1267	mapspace &ms = op->ms ();	1336	mapspace &ms = op->ms ();
1268		1337
1269	/* this has to be done after we translate the coordinates.	1338	/* this has to be done after we translate the coordinates.
1270	*/	1339	*/
1271	if (op->nrof && !(flag & INS_NO_MERGE))	1340	if (op->nrof && !(flag & INS_NO_MERGE))
1272	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1341	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1273	if (object::can_merge (op, tmp))	1342	if (object::can_merge (op, tmp))
1274	{	1343	{
		1344	// TODO: we actually want to update tmp, not op,
		1345	// but some caller surely breaks when we return tmp
		1346	// from here :/
1275	op->nrof += tmp->nrof;	1347	op->nrof += tmp->nrof;
1276	tmp->destroy ();	1348	tmp->destroy ();
1277	}	1349	}
1278		1350
1279	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1351	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
…		…
1288	{	1360	{
1289	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1361	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1290	abort ();	1362	abort ();
1291	}	1363	}
1292		1364
		1365	if (!originator->is_on_map ())
		1366	{
		1367	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1368	op->debug_desc (), originator->debug_desc ());
		1369	abort ();
		1370	}
		1371
1293	op->above = originator;	1372	op->above = originator;
1294	op->below = originator->below;	1373	op->below = originator->below;
1295
1296	if (op->below)
1297	op->below->above = op;
1298	else
1299	ms.bot = op;
1300
1301	/* since *below* originator, no need to update top */
1302	originator->below = op;	1374	originator->below = op;
		1375
		1376	*(op->below ? &op->below->above : &ms.bot) = op;
1303	}	1377	}
1304	else	1378	else
1305	{	1379	{
1306	top = ms.bot;	1380	object *floor = 0;
		1381	object *top = ms.top;
1307		1382
1308	/* If there are other objects, then */	1383	/* If there are other objects, then */
1309	if (top)	1384	if (top)
1310	{	1385	{
1311	object *last = 0;
1312
1313	/*	1386	/*
1314	* If there are multiple objects on this space, we do some trickier handling.	1387	* If there are multiple objects on this space, we do some trickier handling.
1315	* We've already dealt with merging if appropriate.	1388	* We've already dealt with merging if appropriate.
1316	* Generally, we want to put the new object on top. But if	1389	* Generally, we want to put the new object on top. But if
1317	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1390	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1320	* once we get to them. This reduces the need to traverse over all of	1393	* once we get to them. This reduces the need to traverse over all of
1321	* them when adding another one - this saves quite a bit of cpu time	1394	* them when adding another one - this saves quite a bit of cpu time
1322	* when lots of spells are cast in one area. Currently, it is presumed	1395	* when lots of spells are cast in one area. Currently, it is presumed
1323	* that flying non pickable objects are spell objects.	1396	* that flying non pickable objects are spell objects.
1324	*/	1397	*/
1325	for (top = ms.bot; top; top = top->above)	1398	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1326	{	1399	{
1327	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1400	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1328	floor = top;	1401	floor = tmp;
1329		1402
1330	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1403	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1331	{	1404	{
1332	/* We insert above top, so we want this object below this */	1405	/* We insert above top, so we want this object below this */
1333	top = top->below;	1406	top = tmp->below;
1334	break;	1407	break;
1335	}	1408	}
1336		1409
1337	last = top;	1410	top = tmp;
1338	}	1411	}
1339
1340	/* Don't want top to be NULL, so set it to the last valid object */
1341	top = last;
1342		1412
1343	/* We let update_position deal with figuring out what the space	1413	/* We let update_position deal with figuring out what the space
1344	* looks like instead of lots of conditions here.	1414	* looks like instead of lots of conditions here.
1345	* makes things faster, and effectively the same result.	1415	* makes things faster, and effectively the same result.
1346	*/	1416	*/
…		…
1353	*/	1423	*/
1354	if (!(flag & INS_ON_TOP)	1424	if (!(flag & INS_ON_TOP)
1355	&& ms.flags () & P_BLOCKSVIEW	1425	&& ms.flags () & P_BLOCKSVIEW
1356	&& (op->face && !faces [op->face].visibility))	1426	&& (op->face && !faces [op->face].visibility))
1357	{	1427	{
		1428	object *last;
		1429
1358	for (last = top; last != floor; last = last->below)	1430	for (last = top; last != floor; last = last->below)
1359	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1431	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1360	break;	1432	break;
1361		1433
1362	/* Check to see if we found the object that blocks view,	1434	/* Check to see if we found the object that blocks view,
…		…
1370	} /* If objects on this space */	1442	} /* If objects on this space */
1371		1443
1372	if (flag & INS_ABOVE_FLOOR_ONLY)	1444	if (flag & INS_ABOVE_FLOOR_ONLY)
1373	top = floor;	1445	top = floor;
1374		1446
1375	/* Top is the object that our object (op) is going to get inserted above.	1447	// insert object above top, or bottom-most if top = 0
1376	*/
1377
1378	/* First object on this space */
1379	if (!top)	1448	if (!top)
1380	{	1449	{
		1450	op->below = 0;
1381	op->above = ms.bot;	1451	op->above = ms.bot;
1382
1383	if (op->above)
1384	op->above->below = op;
1385
1386	op->below = 0;
1387	ms.bot = op;	1452	ms.bot = op;
		1453
		1454	*(op->above ? &op->above->below : &ms.top) = op;
1388	}	1455	}
1389	else	1456	else
1390	{ /* get inserted into the stack above top */	1457	{
1391	op->above = top->above;	1458	op->above = top->above;
1392
1393	if (op->above)
1394	op->above->below = op;	1459	top->above = op;
1395		1460
1396	op->below = top;	1461	op->below = top;
1397	top->above = op;	1462	*(op->above ? &op->above->below : &ms.top) = op;
1398	}	1463	}
		1464	}
1399		1465
1400	if (!op->above)	1466	if (op->is_player ())
1401	ms.top = op;
1402	} /* else not INS_BELOW_ORIGINATOR */
1403
1404	if (op->type == PLAYER)
1405	{	1467	{
1406	op->contr->do_los = 1;	1468	op->contr->do_los = 1;
1407	++op->map->players;	1469	++op->map->players;
1408	op->map->touch ();	1470	op->map->touch ();
1409	}	1471	}
1410		1472
1411	op->map->dirty = true;	1473	op->map->dirty = true;
1412		1474
1413	if (object *pl = ms.player ())	1475	if (object *pl = ms.player ())
		1476	//TODO: the floorbox prev/next might need updating
		1477	//esrv_send_item (pl, op);
		1478	//TODO: update floorbox to preserve ordering
		1479	if (pl->contr->ns)
1414	pl->contr->ns->floorbox_update ();	1480	pl->contr->ns->floorbox_update ();
1415		1481
1416	/* If this object glows, it may affect lighting conditions that are	1482	/* If this object glows, it may affect lighting conditions that are
1417	* visible to others on this map. But update_all_los is really	1483	* visible to others on this map. But update_all_los is really
1418	* an inefficient way to do this, as it means los for all players	1484	* an inefficient way to do this, as it means los for all players
1419	* on the map will get recalculated. The players could very well	1485	* on the map will get recalculated. The players could very well
1420	* be far away from this change and not affected in any way -	1486	* be far away from this change and not affected in any way -
1421	* this should get redone to only look for players within range,	1487	* this should get redone to only look for players within range,
1422	* or just updating the P_UPTODATE for spaces within this area	1488	* or just updating the P_UPTODATE for spaces within this area
1423	* of effect may be sufficient.	1489	* of effect may be sufficient.
1424	*/	1490	*/
1425	if (op->map->darkness && (op->glow_radius != 0))	1491	if (op->affects_los ())
		1492	{
		1493	op->ms ().invalidate ();
1426	update_all_los (op->map, op->x, op->y);	1494	update_all_los (op->map, op->x, op->y);
		1495	}
1427		1496
1428	/* updates flags (blocked, alive, no magic, etc) for this map space */	1497	/* updates flags (blocked, alive, no magic, etc) for this map space */
1429	update_object (op, UP_OBJ_INSERT);	1498	update_object (op, UP_OBJ_INSERT);
1430		1499
1431	INVOKE_OBJECT (INSERT, op);	1500	INVOKE_OBJECT (INSERT, op);
…		…
1438	* blocked() and wall() work properly), and these flags are updated by	1507	* blocked() and wall() work properly), and these flags are updated by
1439	* update_object().	1508	* update_object().
1440	*/	1509	*/
1441		1510
1442	/* if this is not the head or flag has been passed, don't check walk on status */	1511	/* if this is not the head or flag has been passed, don't check walk on status */
1443	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1512	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1444	{	1513	{
1445	if (check_move_on (op, originator))	1514	if (check_move_on (op, originator))
1446	return 0;	1515	return 0;
1447		1516
1448	/* If we are a multi part object, lets work our way through the check	1517	/* If we are a multi part object, lets work our way through the check
…		…
1459	/* this function inserts an object in the map, but if it	1528	/* this function inserts an object in the map, but if it
1460	* finds an object of its own type, it'll remove that one first.	1529	* finds an object of its own type, it'll remove that one first.
1461	* op is the object to insert it under: supplies x and the map.	1530	* op is the object to insert it under: supplies x and the map.
1462	*/	1531	*/
1463	void	1532	void
1464	replace_insert_ob_in_map (const char *arch_string, object *op)	1533	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1465	{	1534	{
1466	object *tmp, *tmp1;
1467
1468	/* first search for itself and remove any old instances */	1535	/* first search for itself and remove any old instances */
1469		1536
1470	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1537	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1471	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1538	if (tmp->arch->archname == archname) /* same archetype */
1472	tmp->destroy ();	1539	tmp->destroy ();
1473		1540
1474	tmp1 = arch_to_object (archetype::find (arch_string));	1541	object *tmp = archetype::find (archname)->instance ();
1475		1542
1476	tmp1->x = op->x;	1543	tmp->x = op->x;
1477	tmp1->y = op->y;	1544	tmp->y = op->y;
		1545
1478	insert_ob_in_map (tmp1, op->map, op, 0);	1546	insert_ob_in_map (tmp, op->map, op, 0);
1479	}	1547	}
1480		1548
1481	object *	1549	object *
1482	object::insert_at (object *where, object *originator, int flags)	1550	object::insert_at (object *where, object *originator, int flags)
1483	{	1551	{
…		…
1485	return where->env->insert (this);	1553	return where->env->insert (this);
1486	else	1554	else
1487	return where->map->insert (this, where->x, where->y, originator, flags);	1555	return where->map->insert (this, where->x, where->y, originator, flags);
1488	}	1556	}
1489		1557
1490	/*	1558	// check whether we can put this into the map, respect max_volume, max_items
1491	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1559	bool
1492	* is returned contains nr objects, and the remaining parts contains	1560	object::can_drop_at (maptile *m, int x, int y, object *originator)
1493	* the rest (or is removed and freed if that number is 0).
1494	* On failure, NULL is returned, and the reason put into the
1495	* global static errmsg array.
1496	*/
1497	object *
1498	get_split_ob (object *orig_ob, uint32 nr)
1499	{	1561	{
1500	object *newob;	1562	mapspace &ms = m->at (x, y);
1501	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1502		1563
1503	if (orig_ob->nrof < nr)	1564	int items = ms.items ();
1504	{
1505	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1506	return NULL;
1507	}
1508		1565
1509	newob = object_create_clone (orig_ob);	1566	if (!items // testing !items ensures we can drop at least one item
		1567	|| (items < m->max_items
		1568	&& ms.volume () < m->max_volume))
		1569	return true;
1510		1570
1511	if ((orig_ob->nrof -= nr) < 1)	1571	if (originator && originator->is_player ())
1512	orig_ob->destroy (1);	1572	originator->contr->failmsg (format (
1513	else if (!is_removed)	1573	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
1514	{	1574	query_name ()
1515	if (orig_ob->env != NULL)	1575	));
1516	sub_weight (orig_ob->env, orig_ob->weight * nr);
1517	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_ACTIVE)
1518	{
1519	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1520	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1521	return NULL;
1522	}
1523	}
1524		1576
1525	newob->nrof = nr;	1577	return false;
1526
1527	return newob;
1528	}	1578	}
1529		1579
1530	/*	1580	/*
1531	* decrease_ob_nr(object, number) decreases a specified number from	1581	* decrease(object, number) decreases a specified number from
1532	* the amount of an object. If the amount reaches 0, the object	1582	* the amount of an object. If the amount reaches 0, the object
1533	* is subsequently removed and freed.	1583	* is subsequently removed and freed.
1534	*	1584	*
1535	* Return value: 'op' if something is left, NULL if the amount reached 0	1585	* Return value: 'op' if something is left, NULL if the amount reached 0
1536	*/	1586	*/
		1587	bool
		1588	object::decrease (sint32 nr)
		1589	{
		1590	if (!nr)
		1591	return true;
		1592
		1593	nr = min (nr, nrof);
		1594
		1595	if (nrof > nr)
		1596	{
		1597	nrof -= nr;
		1598	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
		1599
		1600	if (object *pl = visible_to ())
		1601	esrv_update_item (UPD_NROF, pl, this);
		1602
		1603	return true;
		1604	}
		1605	else
		1606	{
		1607	destroy ();
		1608	return false;
		1609	}
		1610	}
		1611
		1612	/*
		1613	* split(ob,nr) splits up ob into two parts. The part which
		1614	* is returned contains nr objects, and the remaining parts contains
		1615	* the rest (or is removed and returned if that number is 0).
		1616	* On failure, NULL is returned.
		1617	*/
1537	object *	1618	object *
1538	decrease_ob_nr (object *op, uint32 i)	1619	object::split (sint32 nr)
1539	{	1620	{
1540	object *tmp;	1621	int have = number_of ();
1541		1622
1542	if (i == 0) /* objects with op->nrof require this check */	1623	if (have < nr)
1543	return op;	1624	return 0;
1544		1625	else if (have == nr)
1545	if (i > op->nrof)
1546	i = op->nrof;
1547
1548	if (QUERY_FLAG (op, FLAG_REMOVED))
1549	op->nrof -= i;
1550	else if (op->env)
1551	{	1626	{
1552	/* is this object in the players inventory, or sub container
1553	* therein?
1554	*/
1555	tmp = op->in_player ();
1556	/* nope. Is this a container the player has opened?
1557	* If so, set tmp to that player.
1558	* IMO, searching through all the players will mostly
1559	* likely be quicker than following op->env to the map,
1560	* and then searching the map for a player.
1561	*/
1562	if (!tmp)
1563	for_all_players (pl)
1564	if (pl->ob->container == op->env)
1565	{
1566	tmp = pl->ob;
1567	break;
1568	}
1569
1570	if (i < op->nrof)
1571	{
1572	sub_weight (op->env, op->weight * i);
1573	op->nrof -= i;
1574	if (tmp)
1575	esrv_send_item (tmp, op);
1576	}
1577	else
1578	{
1579	op->remove ();	1627	remove ();
1580	op->nrof = 0;	1628	return this;
1581	if (tmp)
1582	esrv_del_item (tmp->contr, op->count);
1583	}
1584	}	1629	}
1585	else	1630	else
1586	{	1631	{
1587	object *above = op->above;	1632	decrease (nr);
1588		1633
1589	if (i < op->nrof)	1634	object *op = deep_clone ();
1590	op->nrof -= i;	1635	op->nrof = nr;
1591	else
1592	{
1593	op->remove ();
1594	op->nrof = 0;
1595	}
1596
1597	/* Since we just removed op, op->above is null */
1598	for (tmp = above; tmp; tmp = tmp->above)
1599	if (tmp->type == PLAYER)
1600	{
1601	if (op->nrof)
1602	esrv_send_item (tmp, op);
1603	else
1604	esrv_del_item (tmp->contr, op->count);
1605	}
1606	}
1607
1608	if (op->nrof)
1609	return op;	1636	return op;
1610	else
1611	{
1612	op->destroy ();
1613	return 0;
1614	}
1615	}
1616
1617	/*
1618	* add_weight(object, weight) adds the specified weight to an object,
1619	* and also updates how much the environment(s) is/are carrying.
1620	*/
1621	void
1622	add_weight (object *op, signed long weight)
1623	{
1624	while (op != NULL)
1625	{
1626	if (op->type == CONTAINER)
1627	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1628
1629	op->carrying += weight;
1630	op = op->env;
1631	}	1637	}
1632	}	1638	}
1633		1639
1634	object *	1640	object *
1635	insert_ob_in_ob (object *op, object *where)	1641	insert_ob_in_ob (object *op, object *where)
…		…
1660	* be != op, if items are merged. -Tero	1666	* be != op, if items are merged. -Tero
1661	*/	1667	*/
1662	object *	1668	object *
1663	object::insert (object *op)	1669	object::insert (object *op)
1664	{	1670	{
1665	if (!QUERY_FLAG (op, FLAG_REMOVED))
1666	op->remove ();
1667
1668	if (op->more)	1671	if (op->more)
1669	{	1672	{
1670	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1673	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1671	return op;	1674	return op;
1672	}	1675	}
1673		1676
1674	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1677	op->remove ();
1675	CLEAR_FLAG (op, FLAG_REMOVED);	1678
		1679	op->flag [FLAG_OBJ_ORIGINAL] = 0;
1676		1680
1677	if (op->nrof)	1681	if (op->nrof)
1678	{
1679	for (object *tmp = inv; tmp; tmp = tmp->below)	1682	for (object *tmp = inv; tmp; tmp = tmp->below)
1680	if (object::can_merge (tmp, op))	1683	if (object::can_merge (tmp, op))
1681	{	1684	{
1682	/* return the original object and remove inserted object	1685	/* return the original object and remove inserted object
1683	(client needs the original object) */	1686	(client needs the original object) */
1684	tmp->nrof += op->nrof;	1687	tmp->nrof += op->nrof;
1685	/* Weight handling gets pretty funky. Since we are adding to	1688
1686	* tmp->nrof, we need to increase the weight.	1689	if (object *pl = tmp->visible_to ())
1687	*/	1690	esrv_update_item (UPD_NROF, pl, tmp);
		1691
1688	add_weight (this, op->weight * op->nrof);	1692	adjust_weight (this, op->total_weight ());
1689	SET_FLAG (op, FLAG_REMOVED);	1693
1690	op->destroy (); /* free the inserted object */	1694	op->destroy ();
1691	op = tmp;	1695	op = tmp;
1692	op->remove (); /* and fix old object's links */	1696	goto inserted;
1693	CLEAR_FLAG (op, FLAG_REMOVED);
1694	break;
1695	}	1697	}
1696		1698
1697	/* I assume combined objects have no inventory
1698	* We add the weight - this object could have just been removed
1699	* (if it was possible to merge). calling remove_ob will subtract
1700	* the weight, so we need to add it in again, since we actually do
1701	* the linking below
1702	*/
1703	add_weight (this, op->weight * op->nrof);
1704	}
1705	else
1706	add_weight (this, (op->weight + op->carrying));
1707
1708	if (object *otmp = this->in_player ())
1709	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1710	otmp->update_stats ();
1711
1712	op->owner = 0; // its his/hers now. period.	1699	op->owner = 0; // it's his/hers now. period.
1713	op->map = 0;	1700	op->map = 0;
		1701	op->x = 0;
		1702	op->y = 0;
		1703
		1704	op->above = 0;
		1705	op->below = inv;
1714	op->env = this;	1706	op->env = this;
1715	op->above = 0;
1716	op->below = 0;
1717	op->x = op->y = 0;
1718		1707
		1708	if (inv)
		1709	inv->above = op;
		1710
		1711	inv = op;
		1712
		1713	op->flag [FLAG_REMOVED] = 0;
		1714
		1715	if (object *pl = op->visible_to ())
		1716	esrv_send_item (pl, op);
		1717
		1718	adjust_weight (this, op->total_weight ());
		1719
		1720	inserted:
1719	/* reset the light list and los of the players on the map */	1721	/* reset the light list and los of the players on the map */
1720	if (op->glow_radius && map)	1722	if (op->glow_radius && is_on_map ())
1721	{	1723	{
1722	#ifdef DEBUG_LIGHTS	1724	update_stats ();
1723	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1724	#endif /* DEBUG_LIGHTS */
1725	if (map->darkness)
1726	update_all_los (map, x, y);	1725	update_all_los (map, x, y);
1727	}
1728
1729	/* Client has no idea of ordering so lets not bother ordering it here.
1730	* It sure simplifies this function...
1731	*/
1732	if (!inv)
1733	inv = op;
1734	else
1735	{	1726	}
1736	op->below = inv;	1727	else if (is_player ())
1737	op->below->above = op;	1728	// if this is a player's inventory, update stats
1738	inv = op;	1729	contr->queue_stats_update ();
1739	}
1740		1730
1741	INVOKE_OBJECT (INSERT, this);	1731	INVOKE_OBJECT (INSERT, this);
1742		1732
1743	return op;	1733	return op;
1744	}	1734	}
…		…
1764	* on top.	1754	* on top.
1765	*/	1755	*/
1766	int	1756	int
1767	check_move_on (object *op, object *originator)	1757	check_move_on (object *op, object *originator)
1768	{	1758	{
		1759	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1760	return 0;
		1761
1769	object *tmp;	1762	object *tmp;
1770	maptile *m = op->map;	1763	maptile *m = op->map;
1771	int x = op->x, y = op->y;	1764	int x = op->x, y = op->y;
1772		1765
1773	MoveType move_on, move_slow, move_block;	1766	mapspace &ms = m->at (x, y);
1774		1767
1775	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1768	ms.update ();
1776	return 0;
1777		1769
1778	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1770	MoveType move_on = ms.move_on;
1779	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1771	MoveType move_slow = ms.move_slow;
1780	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1772	MoveType move_block = ms.move_block;
1781		1773
1782	/* if nothing on this space will slow op down or be applied,	1774	/* if nothing on this space will slow op down or be applied,
1783	* no need to do checking below. have to make sure move_type	1775	* no need to do checking below. have to make sure move_type
1784	* is set, as lots of objects don't have it set - we treat that	1776	* is set, as lots of objects don't have it set - we treat that
1785	* as walking.	1777	* as walking.
…		…
1796	return 0;	1788	return 0;
1797		1789
1798	/* The objects have to be checked from top to bottom.	1790	/* The objects have to be checked from top to bottom.
1799	* Hence, we first go to the top:	1791	* Hence, we first go to the top:
1800	*/	1792	*/
1801		1793	for (object *next, *tmp = ms.top; tmp; tmp = next)
1802	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1803	{
1804	/* Trim the search when we find the first other spell effect
1805	* this helps performance so that if a space has 50 spell objects,
1806	* we don't need to check all of them.
1807	*/
1808	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1809	break;
1810	}	1794	{
		1795	next = tmp->below;
1811		1796
1812	for (; tmp; tmp = tmp->below)
1813	{
1814	if (tmp == op)	1797	if (tmp == op)
1815	continue; /* Can't apply yourself */	1798	continue; /* Can't apply yourself */
1816		1799
1817	/* Check to see if one of the movement types should be slowed down.	1800	/* Check to see if one of the movement types should be slowed down.
1818	* Second check makes sure that the movement types not being slowed	1801	* Second check makes sure that the movement types not being slowed
…		…
1823	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1806	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1824	{	1807	{
1825	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1808	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1826	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1809	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1827	{	1810	{
1828
1829	float
1830	diff = tmp->move_slow_penalty * fabs (op->speed);	1811	float diff = tmp->move_slow_penalty * fabs (op->speed);
1831		1812
1832	if (op->type == PLAYER)	1813	if (op->is_player ())
1833	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1814	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1834	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1815	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1835	diff /= 4.0;	1816	diff /= 4.0;
1836		1817
1837	op->speed_left -= diff;	1818	op->speed_left -= diff;
1838	}	1819	}
1839	}	1820	}
…		…
1872	LOG (llevError, "Present_arch called outside map.\n");	1853	LOG (llevError, "Present_arch called outside map.\n");
1873	return NULL;	1854	return NULL;
1874	}	1855	}
1875		1856
1876	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1857	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1877	if (tmp->arch == at)	1858	if (tmp->arch->archname == at->archname)
1878	return tmp;	1859	return tmp;
1879		1860
1880	return NULL;	1861	return NULL;
1881	}	1862	}
1882		1863
…		…
1946	* The first matching object is returned, or NULL if none.	1927	* The first matching object is returned, or NULL if none.
1947	*/	1928	*/
1948	object *	1929	object *
1949	present_arch_in_ob (const archetype *at, const object *op)	1930	present_arch_in_ob (const archetype *at, const object *op)
1950	{	1931	{
1951	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1932	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1952	if (tmp->arch == at)	1933	if (tmp->arch->archname == at->archname)
1953	return tmp;	1934	return tmp;
1954		1935
1955	return NULL;	1936	return NULL;
1956	}	1937	}
1957		1938
…		…
2045	* head of the object should correspond for the entire object.	2026	* head of the object should correspond for the entire object.
2046	*/	2027	*/
2047	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	2028	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
2048	continue;	2029	continue;
2049		2030
2050	if (ob->blocked (m, pos.x, pos.y))	2031	if (ob->blocked (pos.m, pos.x, pos.y))
2051	continue;	2032	continue;
2052		2033
2053	altern [index++] = i;	2034	altern [index++] = i;
2054	}	2035	}
2055		2036
…		…
2123	* there is capable of.	2104	* there is capable of.
2124	*/	2105	*/
2125	int	2106	int
2126	find_dir (maptile *m, int x, int y, object *exclude)	2107	find_dir (maptile *m, int x, int y, object *exclude)
2127	{	2108	{
2128	int i, max = SIZEOFFREE, mflags;	2109	int max = SIZEOFFREE, mflags;
2129
2130	sint16 nx, ny;
2131	object *tmp;
2132	maptile *mp;
2133
2134	MoveType blocked, move_type;	2110	MoveType move_type;
2135		2111
2136	if (exclude && exclude->head_ () != exclude)	2112	if (exclude && exclude->head_ () != exclude)
2137	{	2113	{
2138	exclude = exclude->head;	2114	exclude = exclude->head;
2139	move_type = exclude->move_type;	2115	move_type = exclude->move_type;
…		…
2142	{	2118	{
2143	/* If we don't have anything, presume it can use all movement types. */	2119	/* If we don't have anything, presume it can use all movement types. */
2144	move_type = MOVE_ALL;	2120	move_type = MOVE_ALL;
2145	}	2121	}
2146		2122
2147	for (i = 1; i < max; i++)	2123	for (int i = 1; i < max; i++)
2148	{	2124	{
2149	mp = m;	2125	mapxy pos (m, x, y);
2150	nx = x + freearr_x[i];	2126	pos.move (i);
2151	ny = y + freearr_y[i];
2152		2127
2153	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2128	if (!pos.normalise ())
2154
2155	if (mflags & P_OUT_OF_MAP)
2156	max = maxfree[i];	2129	max = maxfree[i];
2157	else	2130	else
2158	{	2131	{
2159	mapspace &ms = mp->at (nx, ny);	2132	mapspace &ms = *pos;
2160		2133
2161	blocked = ms.move_block;
2162
2163	if ((move_type & blocked) == move_type)	2134	if ((move_type & ms.move_block) == move_type)
2164	max = maxfree[i];	2135	max = maxfree [i];
2165	else if (mflags & P_IS_ALIVE)	2136	else if (ms.flags () & P_IS_ALIVE)
2166	{	2137	{
2167	for (tmp = ms.bot; tmp; tmp = tmp->above)	2138	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2168	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2139	if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2169	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2140	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2170	break;
2171
2172	if (tmp)
2173	return freedir[i];	2141	return freedir [i];
2174	}	2142	}
2175	}	2143	}
2176	}	2144	}
2177		2145
2178	return 0;	2146	return 0;
…		…
2253	* This basically means that if direction is 15, then it could either go	2221	* This basically means that if direction is 15, then it could either go
2254	* direction 4, 14, or 16 to get back to where we are.	2222	* direction 4, 14, or 16 to get back to where we are.
2255	* Moved from spell_util.c to object.c with the other related direction	2223	* Moved from spell_util.c to object.c with the other related direction
2256	* functions.	2224	* functions.
2257	*/	2225	*/
2258	int reduction_dir[SIZEOFFREE][3] = {	2226	static const int reduction_dir[SIZEOFFREE][3] = {
2259	{0, 0, 0}, /* 0 */	2227	{0, 0, 0}, /* 0 */
2260	{0, 0, 0}, /* 1 */	2228	{0, 0, 0}, /* 1 */
2261	{0, 0, 0}, /* 2 */	2229	{0, 0, 0}, /* 2 */
2262	{0, 0, 0}, /* 3 */	2230	{0, 0, 0}, /* 3 */
2263	{0, 0, 0}, /* 4 */	2231	{0, 0, 0}, /* 4 */
…		…
2359	int	2327	int
2360	can_pick (const object *who, const object *item)	2328	can_pick (const object *who, const object *item)
2361	{	2329	{
2362	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2330	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2363	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2331	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2364	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2332	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2365	}	2333	}
2366		2334
2367	/*	2335	/*
2368	* create clone from object to another	2336	* create clone from object to another
2369	*/	2337	*/
2370	object *	2338	object *
2371	object_create_clone (object *asrc)	2339	object::deep_clone ()
2372	{	2340	{
2373	object *dst = 0, *tmp, *src, *prev, *item;	2341	assert (("deep_clone called on non-head object", is_head ()));
2374		2342
2375	if (!asrc)	2343	object *dst = clone ();
2376	return 0;
2377		2344
2378	src = asrc->head_ ();	2345	object *prev = dst;
2379
2380	prev = 0;
2381	for (object *part = src; part; part = part->more)	2346	for (object *part = this->more; part; part = part->more)
2382	{	2347	{
2383	tmp = part->clone ();	2348	object *tmp = part->clone ();
2384	tmp->x -= src->x;
2385	tmp->y -= src->y;
2386
2387	if (!part->head)
2388	{
2389	dst = tmp;
2390	tmp->head = 0;
2391	}
2392	else
2393	tmp->head = dst;	2349	tmp->head = dst;
2394
2395	tmp->more = 0;
2396
2397	if (prev)
2398	prev->more = tmp;	2350	prev->more = tmp;
2399
2400	prev = tmp;	2351	prev = tmp;
2401	}	2352	}
2402		2353
2403	for (item = src->inv; item; item = item->below)	2354	for (object *item = inv; item; item = item->below)
2404	insert_ob_in_ob (object_create_clone (item), dst);	2355	insert_ob_in_ob (item->deep_clone (), dst);
2405		2356
2406	return dst;	2357	return dst;
2407	}	2358	}
2408		2359
2409	/* This returns the first object in who's inventory that	2360	/* This returns the first object in who's inventory that
…		…
2418	return tmp;	2369	return tmp;
2419		2370
2420	return 0;	2371	return 0;
2421	}	2372	}
2422		2373
2423	/* If ob has a field named key, return the link from the list,	2374	shstr_tmp
2424	* otherwise return NULL.	2375	object::kv_get (shstr_tmp key) const
2425	*
2426	* key must be a passed in shared string - otherwise, this won't
2427	* do the desired thing.
2428	*/
2429	key_value *
2430	get_ob_key_link (const object *ob, const char *key)
2431	{	2376	{
2432	for (key_value *link = ob->key_values; link; link = link->next)	2377	for (key_value *kv = key_values; kv; kv = kv->next)
2433	if (link->key == key)	2378	if (kv->key == key)
2434	return link;
2435
2436	return 0;
2437	}
2438
2439	/*
2440	* Returns the value of op has an extra_field for key, or NULL.
2441	*
2442	* The argument doesn't need to be a shared string.
2443	*
2444	* The returned string is shared.
2445	*/
2446	const char *
2447	get_ob_key_value (const object *op, const char *const key)
2448	{
2449	key_value *link;
2450	shstr_cmp canonical_key (key);
2451
2452	if (!canonical_key)
2453	{
2454	/* 1. There being a field named key on any object
2455	* implies there'd be a shared string to find.
2456	* 2. Since there isn't, no object has this field.
2457	* 3. Therefore, *this* object doesn't have this field.
2458	*/
2459	return 0;
2460	}
2461
2462	/* This is copied from get_ob_key_link() above -
2463	* only 4 lines, and saves the function call overhead.
2464	*/
2465	for (link = op->key_values; link; link = link->next)
2466	if (link->key == canonical_key)
2467	return link->value;	2379	return kv->value;
2468		2380
2469	return 0;	2381	return shstr ();
2470	}	2382	}
2471		2383
2472	/*	2384	void
2473	* Updates the canonical_key in op to value.	2385	object::kv_set (shstr_tmp key, shstr_tmp value)
2474	*
2475	* canonical_key is a shared string (value doesn't have to be).
2476	*
2477	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2478	* keys.
2479	*
2480	* Returns TRUE on success.
2481	*/
2482	int
2483	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2484	{	2386	{
2485	key_value *field = NULL, *last = NULL;	2387	for (key_value *kv = key_values; kv; kv = kv->next)
2486		2388	if (kv->key == key)
2487	for (field = op->key_values; field != NULL; field = field->next)
2488	{
2489	if (field->key != canonical_key)
2490	{	2389	{
2491	last = field;	2390	kv->value = value;
2492	continue;	2391	return;
2493	}	2392	}
2494		2393
2495	if (value)	2394	key_value *kv = new key_value;
2496	field->value = value;	2395
2497	else	2396	kv->next = key_values;
		2397	kv->key = key;
		2398	kv->value = value;
		2399
		2400	key_values = kv;
		2401	}
		2402
		2403	void
		2404	object::kv_del (shstr_tmp key)
		2405	{
		2406	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2407	if ((*kvp)->key == key)
2498	{	2408	{
2499	/* Basically, if the archetype has this key set,	2409	key_value *kv = *kvp;
2500	* we need to store the null value so when we save	2410	*kvp = (*kvp)->next;
2501	* it, we save the empty value so that when we load,	2411	delete kv;
2502	* we get this value back again.	2412	return;
2503	*/
2504	if (get_ob_key_link (op->arch, canonical_key))
2505	field->value = 0;
2506	else
2507	{
2508	if (last)
2509	last->next = field->next;
2510	else
2511	op->key_values = field->next;
2512
2513	delete field;
2514	}
2515	}	2413	}
2516	return TRUE;
2517	}
2518	/* IF we get here, key doesn't exist */
2519
2520	/* No field, we'll have to add it. */
2521
2522	if (!add_key)
2523	return FALSE;
2524
2525	/* There isn't any good reason to store a null
2526	* value in the key/value list. If the archetype has
2527	* this key, then we should also have it, so shouldn't
2528	* be here. If user wants to store empty strings,
2529	* should pass in ""
2530	*/
2531	if (value == NULL)
2532	return TRUE;
2533
2534	field = new key_value;
2535
2536	field->key = canonical_key;
2537	field->value = value;
2538	/* Usual prepend-addition. */
2539	field->next = op->key_values;
2540	op->key_values = field;
2541
2542	return TRUE;
2543	}
2544
2545	/*
2546	* Updates the key in op to value.
2547	*
2548	* If add_key is FALSE, this will only update existing keys,
2549	* and not add new ones.
2550	* In general, should be little reason FALSE is ever passed in for add_key
2551	*
2552	* Returns TRUE on success.
2553	*/
2554	int
2555	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2556	{
2557	shstr key_ (key);
2558
2559	return set_ob_key_value_s (op, key_, value, add_key);
2560	}	2414	}
2561		2415
2562	object::depth_iterator::depth_iterator (object *container)	2416	object::depth_iterator::depth_iterator (object *container)
2563	: iterator_base (container)	2417	: iterator_base (container)
2564	{	2418	{
…		…
2614	{	2468	{
2615	char flagdesc[512];	2469	char flagdesc[512];
2616	char info2[256 * 4];	2470	char info2[256 * 4];
2617	char *p = info;	2471	char *p = info;
2618		2472
2619	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2473	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2620	count,	2474	count,
2621	uuid.c_str (),	2475	uuid.c_str (),
2622	&name,	2476	&name,
2623	title ? "\",title:\"" : "",	2477	title ? ",title:\"" : "",
2624	title ? (const char *)title : "",	2478	title ? (const char *)title : "",
		2479	title ? "\"" : "",
2625	flag_desc (flagdesc, 512), type);	2480	flag_desc (flagdesc, 512), type);
2626		2481
2627	if (!this->flag[FLAG_REMOVED] && env)	2482	if (!flag[FLAG_REMOVED] && env)
2628	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2483	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2629		2484
2630	if (map)	2485	if (map)
2631	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2486	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2632		2487
…		…
2647	{	2502	{
2648	return map ? map->region (x, y)	2503	return map ? map->region (x, y)
2649	: region::default_region ();	2504	: region::default_region ();
2650	}	2505	}
2651		2506
2652	const materialtype_t *
2653	object::dominant_material () const
2654	{
2655	if (materialtype_t *mt = name_to_material (materialname))
2656	return mt;
2657
2658	return name_to_material (shstr_unknown);
2659	}
2660
2661	void	2507	void
2662	object::open_container (object *new_container)	2508	object::open_container (object *new_container)
2663	{	2509	{
2664	if (container == new_container)	2510	if (container == new_container)
2665	return;	2511	return;
2666		2512
2667	if (object *old_container = container)	2513	object *old_container = container;
		2514
		2515	if (old_container)
2668	{	2516	{
2669	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2517	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2670	return;	2518	return;
2671		2519
2672	#if 0	2520	#if 0
…		…
2674	if (object *closer = old_container->inv)	2522	if (object *closer = old_container->inv)
2675	if (closer->type == CLOSE_CON)	2523	if (closer->type == CLOSE_CON)
2676	closer->destroy ();	2524	closer->destroy ();
2677	#endif	2525	#endif
2678		2526
		2527	// make sure the container is available
		2528	esrv_send_item (this, old_container);
		2529
2679	old_container->flag [FLAG_APPLIED] = 0;	2530	old_container->flag [FLAG_APPLIED] = false;
2680	container = 0;	2531	container = 0;
2681		2532
		2533	// client needs item update to make it work, client bug requires this to be separate
2682	esrv_update_item (UPD_FLAGS, this, old_container);	2534	esrv_update_item (UPD_FLAGS, this, old_container);
		2535
2683	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2536	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2684	play_sound (sound_find ("chest_close"));	2537	play_sound (sound_find ("chest_close"));
2685	}	2538	}
2686		2539
2687	if (new_container)	2540	if (new_container)
2688	{	2541	{
…		…
2692	// TODO: this does not seem to serve any purpose anymore?	2545	// TODO: this does not seem to serve any purpose anymore?
2693	#if 0	2546	#if 0
2694	// insert the "Close Container" object.	2547	// insert the "Close Container" object.
2695	if (archetype *closer = new_container->other_arch)	2548	if (archetype *closer = new_container->other_arch)
2696	{	2549	{
2697	object *closer = arch_to_object (new_container->other_arch);	2550	object *closer = new_container->other_arch->instance ();
2698	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2551	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2699	new_container->insert (closer);	2552	new_container->insert (closer);
2700	}	2553	}
2701	#endif	2554	#endif
2702		2555
2703	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2556	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2704		2557
		2558	// make sure the container is available, client bug requires this to be separate
		2559	esrv_send_item (this, new_container);
		2560
2705	new_container->flag [FLAG_APPLIED] = 1;	2561	new_container->flag [FLAG_APPLIED] = true;
2706	container = new_container;	2562	container = new_container;
2707		2563
		2564	// client needs flag change
2708	esrv_update_item (UPD_FLAGS, this, new_container);	2565	esrv_update_item (UPD_FLAGS, this, new_container);
2709	esrv_send_inventory (this, new_container);	2566	esrv_send_inventory (this, new_container);
2710	play_sound (sound_find ("chest_open"));	2567	play_sound (sound_find ("chest_open"));
2711	}	2568	}
		2569	// else if (!old_container->env && contr && contr->ns)
		2570	// contr->ns->floorbox_reset ();
2712	}	2571	}
2713		2572
2714	object *	2573	object *
2715	object::force_find (const shstr name)	2574	object::force_find (shstr_tmp name)
2716	{	2575	{
2717	/* cycle through his inventory to look for the MARK we want to	2576	/* cycle through his inventory to look for the MARK we want to
2718	* place	2577	* place
2719	*/	2578	*/
2720	for (object *tmp = inv; tmp; tmp = tmp->below)	2579	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2722	return splay (tmp);	2581	return splay (tmp);
2723		2582
2724	return 0;	2583	return 0;
2725	}	2584	}
2726		2585
		2586	//-GPL
		2587
2727	void	2588	void
		2589	object::force_set_timer (int duration)
		2590	{
		2591	this->duration = 1;
		2592	this->speed_left = -1.f;
		2593
		2594	this->set_speed (duration ? 1.f / duration : 0.f);
		2595	}
		2596
		2597	object *
2728	object::force_add (const shstr name, int duration)	2598	object::force_add (shstr_tmp name, int duration)
2729	{	2599	{
2730	if (object *force = force_find (name))	2600	if (object *force = force_find (name))
2731	force->destroy ();	2601	force->destroy ();
2732		2602
2733	object *force = get_archetype (FORCE_NAME);	2603	object *force = get_archetype (FORCE_NAME);
2734		2604
2735	force->slaying = name;	2605	force->slaying = name;
2736	force->stats.food = 1;	2606	force->force_set_timer (duration);
2737	force->speed_left = -1.f;
2738
2739	force->set_speed (duration ? 1.f / duration : 0.f);
2740	force->flag [FLAG_IS_USED_UP] = true;
2741	force->flag [FLAG_APPLIED] = true;	2607	force->flag [FLAG_APPLIED] = true;
2742		2608
2743	insert (force);	2609	return insert (force);
2744	}	2610	}
2745		2611
2746	void	2612	void
2747	object::play_sound (faceidx sound) const	2613	object::play_sound (faceidx sound) const
2748	{	2614	{
2749	if (!sound)	2615	if (!sound)
2750	return;	2616	return;
2751		2617
2752	if (flag [FLAG_REMOVED])	2618	if (is_on_map ())
		2619	map->play_sound (sound, x, y);
		2620	else if (object *pl = in_player ())
		2621	pl->contr->play_sound (sound);
		2622	}
		2623
		2624	void
		2625	object::say_msg (const char *msg) const
		2626	{
		2627	if (is_on_map ())
		2628	map->say_msg (msg, x, y);
		2629	else if (object *pl = in_player ())
		2630	pl->contr->play_sound (sound);
		2631	}
		2632
		2633	void
		2634	object::make_noise ()
		2635	{
		2636	// we do not model noise in the map, so instead put
		2637	// a temporary light into the noise source
		2638	// could use the map instead, but that's less reliable for our
		2639	// goal, which is to make invisibility a bit harder to exploit
		2640
		2641	// currently only works sensibly for players
		2642	if (!is_player ())
2753	return;	2643	return;
2754		2644
2755	if (env)	2645	// find old force, or create new one
2756	{	2646	object *force = force_find (shstr_noise_force);
2757	if (object *pl = in_player ())	2647
2758	pl->contr->play_sound (sound);	2648	if (force)
2759	}	2649	force->speed_left = -1.f; // patch old speed up
2760	else	2650	else
2761	map->play_sound (sound, x, y);	2651	{
2762	}	2652	force = archetype::get (shstr_noise_force);
2763		2653
		2654	force->slaying = shstr_noise_force;
		2655	force->stats.food = 1;
		2656	force->speed_left = -1.f;
		2657
		2658	force->set_speed (1.f / 4.f);
		2659	force->flag [FLAG_IS_USED_UP] = true;
		2660	force->flag [FLAG_APPLIED] = true;
		2661
		2662	insert (force);
		2663	}
		2664	}
		2665
		2666	void object::change_move_type (MoveType mt)
		2667	{
		2668	if (move_type == mt)
		2669	return;
		2670
		2671	if (is_on_map ())
		2672	{
		2673	// we are on the map, so handle move_on/off effects
		2674	remove ();
		2675	move_type = mt;
		2676	map->insert (this, x, y, this);
		2677	}
		2678	else
		2679	move_type = mt;
		2680	}
		2681

Diff Legend

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