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.224 by root, Fri May 2 20:16:24 2008 UTC vs.
Revision 1.325 by root, Wed Apr 14 21:36:31 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,2008 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	#include <global.h>	25	#include <global.h>
25	#include <stdio.h>	26	#include <stdio.h>
26	#include <sys/types.h>	27	#include <sys/types.h>
27	#include <sys/uio.h>	28	#include <sys/uio.h>
28	#include <object.h>	29	#include <object.h>
29	#include <sproto.h>	30	#include <sproto.h>
30	#include <loader.h>
31		31
32	#include <bitset>	32	#include <bitset>
33		33
34	UUID UUID::cur;	34	UUID UUID::cur;
35	static uint64_t seq_next_save;	35	static uint64_t seq_next_save;
36	static const uint64 UUID_GAP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
		37	uint32_t mapspace::smellcount = 10000;
37		38
38	objectvec objects;	39	objectvec objects;
39	activevec actives;	40	activevec actives;
		41
		42	freelist_item *object::freelist;
		43	uint32_t object::object_count;
		44	uint32_t object::free_count;
		45	uint32_t object::create_count;
		46	uint32_t object::destroy_count;
		47
		48	//+GPL
40		49
41	short freearr_x[SIZEOFFREE] = {	50	short freearr_x[SIZEOFFREE] = {
42	0,	51	0,
43	0, 1, 1, 1, 0, -1, -1, -1,	52	0, 1, 1, 1, 0, -1, -1, -1,
44	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	53	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
…		…
48	0,	57	0,
49	-1, -1, 0, 1, 1, 1, 0, -1,	58	-1, -1, 0, 1, 1, 1, 0, -1,
50	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	59	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
51	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	60	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
52	};	61	};
53	int maxfree[SIZEOFFREE] = {
54	0,
55	9, 10, 13, 14, 17, 18, 21, 22,
56	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
57	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
58	};
59	int freedir[SIZEOFFREE] = {	62	int freedir[SIZEOFFREE] = {
60	0,	63	0,
61	1, 2, 3, 4, 5, 6, 7, 8,	64	1, 2, 3, 4, 5, 6, 7, 8,
62	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	65	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
63	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	66	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
64	};	67	};
65		68
		69	static int maxfree[SIZEOFFREE] = {
		70	0,
		71	9, 10, 13, 14, 17, 18, 21, 22,
		72	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
		73	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
		74	};
		75
66	static void	76	static void
67	write_uuid (uval64 skip, bool sync)	77	write_uuid (uval64 skip, bool sync)
68	{	78	{
69	CALL_BEGIN (2);	79	CALL_BEGIN (2);
70	CALL_ARG_SV (newSVval64 (skip));	80	CALL_ARG_SV (newSVval64 (skip));
…		…
72	CALL_CALL ("cf::write_uuid", G_DISCARD);	82	CALL_CALL ("cf::write_uuid", G_DISCARD);
73	CALL_END;	83	CALL_END;
74	}	84	}
75		85
76	static void	86	static void
77	read_uuid (void)	87	read_uuid ()
78	{	88	{
79	char filename[MAX_BUF];	89	char filename[MAX_BUF];
80		90
81	sprintf (filename, "%s/uuid", settings.localdir);	91	sprintf (filename, "%s/uuid", settings.localdir);
82		92
…		…
96		106
97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	107	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
98	_exit (1);	108	_exit (1);
99	}	109	}
100		110
101	UUID::BUF buf;	111	char buf [UUID::MAX_LEN];
102	buf[0] = 0;	112	buf[0] = 0;
103	fgets (buf, sizeof (buf), fp);	113	fgets (buf, sizeof (buf), fp);
104		114
105	if (!UUID::cur.parse (buf))	115	if (!UUID::cur.parse (buf))
106	{	116	{
…		…
133		143
134	void	144	void
135	UUID::init ()	145	UUID::init ()
136	{	146	{
137	read_uuid ();	147	read_uuid ();
		148	}
		149
		150	bool
		151	UUID::parse (const char *s)
		152	{
		153	if (*s++ != '<' || *s++ != '1' || *s++ != '.')
		154	return false;
		155
		156	seq = 0;
		157
		158	while (*s != '>')
		159	{
		160	if (*s < '0')
		161	return false;
		162
		163	// this gives nice branchless code with gcc
		164	assert ('0' < 'a' && '0' == 48 && 'a' == 97);
		165	int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
		166
		167	seq = (seq << 4) | digit;
		168
		169	++s;
		170	}
		171
		172	return true;
		173	}
		174
		175	char *
		176	UUID::append (char *buf) const
		177	{
		178	*buf++ = '<';
		179	*buf++ = '1';
		180	*buf++ = '.';
		181
		182	uint64_t seq = this->seq;
		183	const int bits = 64;
		184	char nz = 0;
		185	static const char tohex [] = "0123456789abcdef";
		186
		187	// assert (len >= 3 + bits / 4 + 1 + 1);
		188	for (int i = bits / 4; --i; )
		189	{
		190	uint8_t digit = seq >> (bits - 4);
		191
		192	*buf = tohex [digit];
		193	nz |= digit;
		194	buf += nz ? 1 : 0;
		195	seq <<= 4;
		196	}
		197
		198	// last digit is special - always emit
		199	uint8_t digit = seq >> (bits - 4);
		200	*buf++ = tohex [digit];
		201
		202	*buf++ = '>';
		203
		204	return buf;
		205	}
		206
		207	char *
		208	UUID::c_str () const
		209	{
		210	static char buf [MAX_LEN];
		211	*append (buf) = 0;
		212	return buf;
138	}	213	}
139		214
140	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	215	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
141	static bool	216	static bool
142	compare_ob_value_lists_one (const object *wants, const object *has)	217	compare_ob_value_lists_one (const object *wants, const object *has)
143	{	218	{
144	key_value *wants_field;
145
146	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	219	/* n-squared behaviour (see kv_get), but I'm hoping both
147	* objects with lists are rare, and lists stay short. If not, use a	220	* objects with lists are rare, and lists stay short. If not, use a
148	* different structure or at least keep the lists sorted...	221	* different structure or at least keep the lists sorted...
149	*/	222	*/
150		223
151	/* For each field in wants, */	224	/* For each field in wants, */
152	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)	225	for (key_value *kv = wants->key_values; kv; kv = kv->next)
153	{	226	if (has->kv_get (kv->key) != kv->value)
154	key_value *has_field;	227	return false;
155
156	/* Look for a field in has with the same key. */
157	has_field = get_ob_key_link (has, wants_field->key);
158
159	if (!has_field)
160	return 0; /* No field with that name. */
161
162	/* Found the matching field. */
163	if (has_field->value != wants_field->value)
164	return 0; /* Values don't match, so this half of the comparison is false. */
165
166	/* If we get here, we found a match. Now for the next field in wants. */
167	}
168		228
169	/* If we get here, every field in wants has a matching field in has. */	229	/* If we get here, every field in wants has a matching field in has. */
170	return 1;	230	return true;
171	}	231	}
172		232
173	/* Returns TRUE if ob1 has the same key_values as ob2. */	233	/* Returns TRUE if ob1 has the same key_values as ob2. */
174	static bool	234	static bool
175	compare_ob_value_lists (const object *ob1, const object *ob2)	235	compare_ob_value_lists (const object *ob1, const object *ob2)
176	{	236	{
177	/* However, there may be fields in has which aren't partnered in wants,	237	/* However, there may be fields in has which aren't partnered in wants,
178	* so we need to run the comparison *twice*. :(	238	* so we need to run the comparison *twice*. :(
179	*/	239	*/
180	return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1);	240	return compare_ob_value_lists_one (ob1, ob2)
		241	&& compare_ob_value_lists_one (ob2, ob1);
181	}	242	}
182		243
183	/* Function examines the 2 objects given to it, and returns true if	244	/* Function examines the 2 objects given to it, and returns true if
184	* they can be merged together.	245	* they can be merged together.
185	*	246	*
…		…
192	* Improvements made with merge: Better checking on potion, and also	253	* Improvements made with merge: Better checking on potion, and also
193	* check weight	254	* check weight
194	*/	255	*/
195	bool object::can_merge_slow (object *ob1, object *ob2)	256	bool object::can_merge_slow (object *ob1, object *ob2)
196	{	257	{
197	/* A couple quicksanity checks */	258	/* A couple quick sanity checks */
198	if (ob1 == ob2	259	if (ob1 == ob2
199	|| ob1->type != ob2->type	260	|| ob1->type != ob2->type
200	|| ob1->speed != ob2->speed
201	|| ob1->value != ob2->value	261	|| ob1->value != ob2->value
202	|| ob1->name != ob2->name)	262	|| ob1->name != ob2->name
		263	|| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
203	return 0;	264	return 0;
204		265
205	/* Do not merge objects if nrof would overflow. First part checks	266	/* Do not merge objects if nrof would overflow, assume nrof
206	* for unsigned overflow (2c), second part checks whether the result	267	* is always 0 .. 2**31-1 */
207	* would fit into a 32 bit signed int, which is often used to hold	268	if (ob1->nrof > 0x7fffffff - ob2->nrof)
208	* nrof values.
209	*/
210	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
211	return 0;	269	return 0;
212		270
213	/* If the objects have been identified, set the BEEN_APPLIED flag.	271	/* If the objects have been identified, set the BEEN_APPLIED flag.
214	* This is to the comparison of the flags below will be OK. We	272	* This is to the comparison of the flags below will be OK. We
215	* just can't ignore the been applied or identified flags, as they	273	* just can't ignore the been applied or identified flags, as they
216	* are not equal - just if it has been identified, the been_applied	274	* are not equal - just if it has been identified, the been_applied
217	* flags lose any meaning.	275	* flags lose any meaning.
218	*/	276	*/
219	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	277	if (ob1->flag [FLAG_IDENTIFIED])
220	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	278	ob1->set_flag (FLAG_BEEN_APPLIED);
221		279
222	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	280	if (ob2->flag [FLAG_IDENTIFIED])
223	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	281	ob2->set_flag (FLAG_BEEN_APPLIED);
224		282
225	if (ob1->arch->name != ob2->arch->name	283	if (ob1->arch->archname != ob2->arch->archname
226	|| ob1->name != ob2->name	284	|| ob1->name != ob2->name
227	|| ob1->title != ob2->title	285	|| ob1->title != ob2->title
228	|| ob1->msg != ob2->msg	286	|| ob1->msg != ob2->msg
229	|| ob1->weight != ob2->weight	287	|| ob1->weight != ob2->weight
230	|| ob1->attacktype != ob2->attacktype	288	|| ob1->attacktype != ob2->attacktype
231	|| ob1->magic != ob2->magic	289	|| ob1->magic != ob2->magic
232	|| ob1->slaying != ob2->slaying	290	|| ob1->slaying != ob2->slaying
233	|| ob1->skill != ob2->skill	291	|| ob1->skill != ob2->skill
234	|| ob1->value != ob2->value	292	|| ob1->value != ob2->value
235	|| ob1->animation_id != ob2->animation_id	293	|| ob1->animation_id != ob2->animation_id
		294	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
236	|| ob1->client_type != ob2->client_type	295	|| ob1->client_type != ob2->client_type
237	|| ob1->materialname != ob2->materialname	296	|| ob1->material != ob2->material
238	|| ob1->lore != ob2->lore	297	|| ob1->lore != ob2->lore
239	|| ob1->subtype != ob2->subtype	298	|| ob1->subtype != ob2->subtype
240	|| ob1->move_type != ob2->move_type	299	|| ob1->move_type != ob2->move_type
241	|| ob1->move_block != ob2->move_block	300	|| ob1->move_block != ob2->move_block
242	|| ob1->move_allow != ob2->move_allow	301	|| ob1->move_allow != ob2->move_allow
243	|| ob1->move_on != ob2->move_on	302	|| ob1->move_on != ob2->move_on
244	|| ob1->move_off != ob2->move_off	303	|| ob1->move_off != ob2->move_off
245	|| ob1->move_slow != ob2->move_slow	304	|| ob1->move_slow != ob2->move_slow
246	|| ob1->move_slow_penalty != ob2->move_slow_penalty	305	|| fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
247	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))	306	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
248	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	307	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
249	return 0;	308	return 0;
250		309
251	if ((ob1->flag ^ ob2->flag)	310	if ((ob1->flag ^ ob2->flag)
252	.reset (FLAG_INV_LOCKED)	311	.reset (FLAG_INV_LOCKED)
253	.reset (FLAG_CLIENT_SENT)
254	.reset (FLAG_REMOVED)	312	.reset (FLAG_REMOVED)
255	.any ())	313	.any ())
256	return 0;	314	return 0;
257		315
258	/* This is really a spellbook check - we should in general	316	/* This is really a spellbook check - we should in general
…		…
277		335
278	/* Don't merge objects that are applied. With the new 'body' code,	336	/* Don't merge objects that are applied. With the new 'body' code,
279	* it is possible for most any character to have more than one of	337	* it is possible for most any character to have more than one of
280	* some items equipped, and we don't want those to merge.	338	* some items equipped, and we don't want those to merge.
281	*/	339	*/
282	if (QUERY_FLAG (ob1, FLAG_APPLIED) || QUERY_FLAG (ob2, FLAG_APPLIED))	340	if (ob1->flag [FLAG_APPLIED] || ob2->flag [FLAG_APPLIED])
283	return 0;	341	return 0;
284		342
285	/* Note sure why the following is the case - either the object has to	343	/* Note sure why the following is the case - either the object has to
286	* be animated or have a very low speed. Is this an attempted monster	344	* be animated or have a very low speed. Is this an attempted monster
287	* check?	345	* check?
288	*/	346	*/
289	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())	347	if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ())
290	return 0;	348	return 0;
291		349
292	switch (ob1->type)	350	switch (ob1->type)
293	{	351	{
294	case SCROLL:	352	case SCROLL:
…		…
340	{	398	{
341	// see if we are in a container of sorts	399	// see if we are in a container of sorts
342	if (env)	400	if (env)
343	{	401	{
344	// the player inventory itself is always visible	402	// the player inventory itself is always visible
345	if (env->type == PLAYER)	403	if (env->is_player ())
346	return env;	404	return env;
347		405
348	// else a player could have our env open	406	// else a player could have our env open
349	object *envest = env->outer_env ();	407	object *envest = env->outer_env_or_self ();
350		408
351	// the player itself is always on a map, so we will find him here	409	// the player itself is always on a map, so we will find him here
352	// even if our inv is in a player.	410	// even if our inv is in a player.
353	if (envest->is_on_map ())	411	if (envest->is_on_map ())
354	if (object *pl = envest->ms ().player ())	412	if (object *pl = envest->ms ().player ())
355	if (pl->container == env)	413	if (pl->container_ () == env)
356	return pl;	414	return pl;
357	}	415	}
358	else	416	else
359	{	417	{
360	// maybe there is a player standing on the same mapspace	418	// maybe there is a player standing on the same mapspace
361	// this will catch the case where "this" is a player	419	// this will catch the case where "this" is a player
362	if (object *pl = ms ().player ())	420	if (object *pl = ms ().player ())
363	if (!pl->container || this == pl->container)	421	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
		422	|| pl->container_ () == this)
364	return pl;	423	return pl;
365	}	424	}
366	}	425	}
367		426
368	return 0;	427	return 0;
369	}	428	}
370		429
371	// adjust weight per container type ("of holding")	430	// adjust weight per container type ("of holding")
372	static sint32	431	static sint32
373	weight_adjust (object *op, sint32 weight)	432	weight_adjust_for (object *op, sint32 weight)
374	{	433	{
375	return op->type == CONTAINER	434	return op->type == CONTAINER
376	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	435	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
377	: weight;	436	: weight;
378	}	437	}
…		…
384	static void	443	static void
385	adjust_weight (object *op, sint32 weight)	444	adjust_weight (object *op, sint32 weight)
386	{	445	{
387	while (op)	446	while (op)
388	{	447	{
		448	// adjust by actual difference to account for rounding errors
		449	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
389	weight = weight_adjust (op, weight);	450	weight = weight_adjust_for (op, op->carrying)
		451	- weight_adjust_for (op, op->carrying - weight);
390		452
391	if (!weight)	453	if (!weight)
392	return;	454	return;
393		455
394	op->carrying += weight;	456	op->carrying += weight;
…		…
417	op->update_weight ();	479	op->update_weight ();
418		480
419	sum += op->total_weight ();	481	sum += op->total_weight ();
420	}	482	}
421		483
422	sum = weight_adjust (this, sum);	484	sum = weight_adjust_for (this, sum);
423		485
424	if (sum != carrying)	486	if (sum != carrying)
425	{	487	{
426	carrying = sum;	488	carrying = sum;
427		489
…		…
443	object_freezer freezer;	505	object_freezer freezer;
444	op->write (freezer);	506	op->write (freezer);
445	return freezer.as_string ();	507	return freezer.as_string ();
446	}	508	}
447		509
448	/*	510	char *
449	* get_nearest_part(multi-object, object 2) returns the part of the	511	object::as_string ()
450	* multi-object 1 which is closest to the second object.
451	* If it's not a multi-object, it is returned.
452	*/
453	object *
454	get_nearest_part (object *op, const object *pl)
455	{	512	{
456	object *tmp, *closest;	513	return dump_object (this);
457	int last_dist, i;
458
459	if (!op->more)
460	return op;
461
462	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
463	tmp;
464	tmp = tmp->more)
465	if ((i = distance (tmp, pl)) < last_dist)
466	closest = tmp, last_dist = i;
467
468	return closest;
469	}	514	}
470		515
471	/*	516	/*
472	* Returns the object which has the count-variable equal to the argument.	517	* Returns the object which has the count-variable equal to the argument.
473	* VERRRY slow.	518	* VERRRY slow.
…		…
481		526
482	return 0;	527	return 0;
483	}	528	}
484		529
485	/*	530	/*
		531	* Returns the object which has the uuid equal to the argument.
		532	* MOAR VERRRY slow.
		533	*/
		534
		535	object *
		536	find_object_uuid (UUID i)
		537	{
		538	for_all_objects (op)
		539	if (op->uuid == i)
		540	return op;
		541
		542	return 0;
		543	}
		544
		545	/*
486	* Returns the first object which has a name equal to the argument.	546	* Returns the first object which has a name equal to the argument.
487	* Used only by the patch command, but not all that useful.	547	* Used only by the patch command, but not all that useful.
488	* Enables features like "patch <name-of-other-player> food 999"	548	* Enables features like "patch <name-of-other-player> food 999"
489	*/	549	*/
490	object *	550	object *
491	find_object_name (const char *str)	551	find_object_name (const char *str)
492	{	552	{
493	shstr_cmp str_ (str);	553	shstr_cmp str_ (str);
494	object *op;
495		554
		555	if (str_)
496	for_all_objects (op)	556	for_all_objects (op)
497	if (op->name == str_)	557	if (op->name == str_)
498	break;	558	return op;
499		559
500	return op;	560	return 0;
501	}	561	}
502		562
503	/*	563	/*
504	* Sets the owner and sets the skill and exp pointers to owner's current	564	* Sets the owner and sets the skill and exp pointers to owner's current
505	* skill and experience objects.	565	* skill and experience objects.
…		…
520	}	580	}
521		581
522	this->owner = owner;	582	this->owner = owner;
523	}	583	}
524		584
525	int
526	object::slottype () const
527	{
528	if (type == SKILL)
529	{
530	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
531	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
532	}
533	else
534	{
535	if (slot [body_combat].info) return slot_combat;
536	if (slot [body_range ].info) return slot_ranged;
537	}
538
539	return slot_none;
540	}
541
542	bool
543	object::change_weapon (object *ob)
544	{
545	if (current_weapon == ob)
546	return true;
547
548	if (chosen_skill)
549	chosen_skill->flag [FLAG_APPLIED] = false;
550
551	current_weapon = ob;
552	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
553
554	if (chosen_skill)
555	chosen_skill->flag [FLAG_APPLIED] = true;
556
557	update_stats ();
558
559	if (ob)
560	{
561	// now check wether any body locations became invalid, in which case
562	// we cannot apply the weapon at the moment.
563	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
564	if (slot[i].used < 0)
565	{
566	current_weapon = chosen_skill = 0;
567	update_stats ();
568
569	new_draw_info_format (NDI_UNIQUE, 0, this,
570	"You try to balance all your items at once, "
571	"but the %s is just too much for your body. "
572	"[You need to unapply some items first.]", &ob->name);
573	return false;
574	}
575
576	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
577	}
578	else
579	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
580
581	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
582	{
583	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
584	&name, ob->debug_desc ());
585	return false;
586	}
587
588	return true;
589	}
590
591	/* Zero the key_values on op, decrementing the shared-string	585	/* Zero the key_values on op, decrementing the shared-string
592	* refcounts and freeing the links.	586	* refcounts and freeing the links.
593	*/	587	*/
594	static void	588	static void
595	free_key_values (object *op)	589	free_key_values (object *op)
…		…
603	}	597	}
604		598
605	op->key_values = 0;	599	op->key_values = 0;
606	}	600	}
607		601
608	object &	602	/*
609	object::operator =(const object &src)	603	* copy_to first frees everything allocated by the dst object,
		604	* and then copies the contents of itself into the second
		605	* object, allocating what needs to be allocated. Basically, any
		606	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		607	* if the first object is freed, the pointers in the new object
		608	* will point at garbage.
		609	*/
		610	void
		611	object::copy_to (object *dst)
610	{	612	{
611	remove ();	613	dst->remove ();
612
613	*(object_copy *)this = src;	614	*(object_copy *)dst = *this;
614
615	flag [FLAG_REMOVED] = true;	615	dst->flag [FLAG_REMOVED] = true;
616		616
617	/* Copy over key_values, if any. */	617	/* Copy over key_values, if any. */
618	if (src.key_values)	618	if (key_values)
619	{	619	{
620	key_value *tail = 0;	620	key_value *tail = 0;
621	key_values = 0;	621	dst->key_values = 0;
622		622
623	for (key_value *i = src.key_values; i; i = i->next)	623	for (key_value *i = key_values; i; i = i->next)
624	{	624	{
625	key_value *new_link = new key_value;	625	key_value *new_link = new key_value;
626		626
627	new_link->next = 0;	627	new_link->next = 0;
628	new_link->key = i->key;	628	new_link->key = i->key;
629	new_link->value = i->value;	629	new_link->value = i->value;
630		630
631	/* Try and be clever here, too. */	631	/* Try and be clever here, too. */
632	if (!key_values)	632	if (!dst->key_values)
633	{	633	{
634	key_values = new_link;	634	dst->key_values = new_link;
635	tail = new_link;	635	tail = new_link;
636	}	636	}
637	else	637	else
638	{	638	{
639	tail->next = new_link;	639	tail->next = new_link;
640	tail = new_link;	640	tail = new_link;
641	}	641	}
642	}	642	}
643	}	643	}
644	}
645		644
646	/*	645	dst->activate ();
647	* copy_to first frees everything allocated by the dst object,
648	* and then copies the contents of itself into the second
649	* object, allocating what needs to be allocated. Basically, any
650	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
651	* if the first object is freed, the pointers in the new object
652	* will point at garbage.
653	*/
654	void
655	object::copy_to (object *dst)
656	{
657	*dst = *this;
658
659	if (speed < 0)
660	dst->speed_left -= rndm ();
661
662	dst->set_speed (dst->speed);
663	}	646	}
664		647
665	void	648	void
666	object::instantiate ()	649	object::instantiate ()
667	{	650	{
668	if (!uuid.seq) // HACK	651	if (!uuid.seq) // HACK
669	uuid = UUID::gen ();	652	uuid = UUID::gen ();
670		653
		654	// TODO: unclean state changes, should nt be done in copy_to AND instantiate
		655	if (flag [FLAG_RANDOM_SPEED] && speed)
		656	speed_left = - speed - rndm (); // TODO animation
		657	else
671	speed_left = -0.1f;	658	speed_left = -1.;
		659
672	/* copy the body_info to the body_used - this is only really	660	/* copy the body_info to the body_used - this is only really
673	* need for monsters, but doesn't hurt to do it for everything.	661	* need for monsters, but doesn't hurt to do it for everything.
674	* by doing so, when a monster is created, it has good starting	662	* by doing so, when a monster is created, it has good starting
675	* values for the body_used info, so when items are created	663	* values for the body_used info, so when items are created
676	* for it, they can be properly equipped.	664	* for it, they can be properly equipped.
…		…
684	object *	672	object *
685	object::clone ()	673	object::clone ()
686	{	674	{
687	object *neu = create ();	675	object *neu = create ();
688	copy_to (neu);	676	copy_to (neu);
		677
		678	// TODO: unclean state changes, should not be done in clone AND instantiate
		679	if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
		680	neu->speed_left = - neu->speed - rndm (); // TODO animation
		681
		682	neu->map = map; // not copied by copy_to
689	return neu;	683	return neu;
690	}	684	}
691		685
692	/*	686	/*
693	* If an object with the IS_TURNABLE() flag needs to be turned due	687	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
695	* be called to update the face variable, _and_ how it looks on the map.	689	* be called to update the face variable, _and_ how it looks on the map.
696	*/	690	*/
697	void	691	void
698	update_turn_face (object *op)	692	update_turn_face (object *op)
699	{	693	{
700	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)	694	if (!op->flag [FLAG_IS_TURNABLE] || !op->arch)
701	return;	695	return;
702		696
703	SET_ANIMATION (op, op->direction);	697	SET_ANIMATION (op, op->direction);
704	update_object (op, UP_OBJ_FACE);	698	update_object (op, UP_OBJ_FACE);
705	}	699	}
…		…
710	* This function needs to be called whenever the speed of an object changes.	704	* This function needs to be called whenever the speed of an object changes.
711	*/	705	*/
712	void	706	void
713	object::set_speed (float speed)	707	object::set_speed (float speed)
714	{	708	{
715	if (flag [FLAG_FREED] && speed)
716	{
717	LOG (llevError, "Object %s is freed but has speed.\n", &name);
718	speed = 0;
719	}
720
721	this->speed = speed;	709	this->speed = speed;
722		710
723	if (has_active_speed ())	711	if (has_active_speed ())
724	activate ();	712	activate ();
725	else	713	else
…		…
775		763
776	if (!(m.flags_ & P_UPTODATE))	764	if (!(m.flags_ & P_UPTODATE))
777	/* nop */;	765	/* nop */;
778	else if (action == UP_OBJ_INSERT)	766	else if (action == UP_OBJ_INSERT)
779	{	767	{
		768	#if 0
780	// this is likely overkill, TODO: revisit (schmorp)	769	// this is likely overkill, TODO: revisit (schmorp)
781	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	770	if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW))
782	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	771	|| (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC))
783	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	772	|| (op->is_player () && !(m.flags_ & P_PLAYER))
784	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	773	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
785	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	774	|| (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE))
786	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	775	|| (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC))
787	|| (m.move_on | op->move_on ) != m.move_on	776	|| (m.move_on | op->move_on ) != m.move_on
788	|| (m.move_off | op->move_off ) != m.move_off	777	|| (m.move_off | op->move_off ) != m.move_off
789	|| (m.move_slow | op->move_slow) != m.move_slow	778	|| (m.move_slow | op->move_slow) != m.move_slow
790	/* This isn't perfect, but I don't expect a lot of objects to	779	/* This isn't perfect, but I don't expect a lot of objects to
791	* to have move_allow right now.	780	* have move_allow right now.
792	*/	781	*/
793	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	782	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
		783	m.invalidate ();
		784	#else
794	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	785	// the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
795	m.flags_ = 0;	786	m.invalidate ();
		787	#endif
796	}	788	}
797	/* if the object is being removed, we can't make intelligent	789	/* if the object is being removed, we can't make intelligent
798	* decisions, because remove_ob can't really pass the object	790	* decisions, because remove_ob can't really pass the object
799	* that is being removed.	791	* that is being removed.
800	*/	792	*/
801	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	793	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
802	m.flags_ = 0;	794	m.invalidate ();
803	else if (action == UP_OBJ_FACE)	795	else if (action == UP_OBJ_FACE)
804	/* Nothing to do for that case */ ;	796	/* Nothing to do for that case */ ;
805	else	797	else
806	LOG (llevError, "update_object called with invalid action: %d\n", action);	798	LOG (llevError, "update_object called with invalid action: %d\n", action);
807		799
…		…
809	update_object (op->more, action);	801	update_object (op->more, action);
810	}	802	}
811		803
812	object::object ()	804	object::object ()
813	{	805	{
814	SET_FLAG (this, FLAG_REMOVED);	806	this->set_flag (FLAG_REMOVED);
815		807
816	expmul = 1.0;	808	//expmul = 1.0; declared const for the time being
817	face = blank_face;	809	face = blank_face;
		810	material = MATERIAL_NULL;
818	}	811	}
819		812
820	object::~object ()	813	object::~object ()
821	{	814	{
822	unlink ();	815	unlink ();
823		816
824	free_key_values (this);	817	free_key_values (this);
825	}	818	}
826
827	static int object_count;
828		819
829	void object::link ()	820	void object::link ()
830	{	821	{
831	assert (!index);//D	822	assert (!index);//D
832	uuid = UUID::gen ();	823	uuid = UUID::gen ();
833	count = ++object_count;
834		824
835	refcnt_inc ();	825	refcnt_inc ();
836	objects.insert (this);	826	objects.insert (this);
		827
		828	++create_count;
		829
837	}	830	}
838		831
839	void object::unlink ()	832	void object::unlink ()
840	{	833	{
841	if (!index)	834	if (!index)
842	return;	835	return;
		836
		837	++destroy_count;
843		838
844	objects.erase (this);	839	objects.erase (this);
845	refcnt_dec ();	840	refcnt_dec ();
846	}	841	}
847		842
…		…
851	/* If already on active list, don't do anything */	846	/* If already on active list, don't do anything */
852	if (active)	847	if (active)
853	return;	848	return;
854		849
855	if (has_active_speed ())	850	if (has_active_speed ())
		851	{
		852	if (flag [FLAG_FREED])
		853	LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		854
856	actives.insert (this);	855	actives.insert (this);
		856	}
857	}	857	}
858		858
859	void	859	void
860	object::activate_recursive ()	860	object::activate_recursive ()
861	{	861	{
…		…
922	* drop on that space.	922	* drop on that space.
923	*/	923	*/
924	if (!drop_to_ground	924	if (!drop_to_ground
925	|| !map	925	|| !map
926	|| map->in_memory != MAP_ACTIVE	926	|| map->in_memory != MAP_ACTIVE
927	|| map->nodrop	927	|| map->no_drop
928	|| ms ().move_block == MOVE_ALL)	928	|| ms ().move_block == MOVE_ALL)
929	{	929	{
930	while (inv)	930	while (inv)
931	{
932	inv->destroy_inv (false);
933	inv->destroy ();	931	inv->destroy ();
934	}
935	}	932	}
936	else	933	else
937	{ /* Put objects in inventory onto this space */	934	{ /* Put objects in inventory onto this space */
938	while (inv)	935	while (inv)
939	{	936	{
…		…
943	|| op->flag [FLAG_NO_DROP]	940	|| op->flag [FLAG_NO_DROP]
944	|| op->type == RUNE	941	|| op->type == RUNE
945	|| op->type == TRAP	942	|| op->type == TRAP
946	|| op->flag [FLAG_IS_A_TEMPLATE]	943	|| op->flag [FLAG_IS_A_TEMPLATE]
947	|| op->flag [FLAG_DESTROY_ON_DEATH])	944	|| op->flag [FLAG_DESTROY_ON_DEATH])
948	op->destroy (true);	945	op->destroy ();
949	else	946	else
950	map->insert (op, x, y);	947	map->insert (op, x, y);
951	}	948	}
952	}	949	}
953	}	950	}
954		951
		952	/*
		953	* Remove and free all objects in the inventory of the given object.
		954	* Unlike destroy_inv, this assumes the *this is destroyed as well
		955	* well, so we can (and have to!) take shortcuts.
		956	*/
		957	void
		958	object::destroy_inv_fast ()
		959	{
		960	while (object *op = inv)
		961	{
		962	// remove from object the fast way
		963	op->flag [FLAG_REMOVED] = true;
		964	op->env = 0;
		965	if ((inv = inv->below))
		966	inv->above = 0;
		967
		968	// then destroy
		969	op->destroy ();
		970	}
		971	}
		972
		973	void
		974	object::freelist_free (int count)
		975	{
		976	while (count-- && freelist)
		977	{
		978	freelist_item *next = freelist->next;
		979	// count is being "destroyed"
		980
		981	sfree ((char *)freelist, sizeof (object));
		982
		983	freelist = next;
		984	--free_count;
		985	}
		986	}
		987
		988	object *
955	object *object::create ()	989	object::create ()
956	{	990	{
957	object *op = new object;	991	object *op;
		992
		993	if (freelist)
		994	{
		995	freelist_item li = *freelist;
		996	memset (freelist, 0, sizeof (object));
		997
		998	op = new (freelist) object;
		999	op->count = li.count;
		1000
		1001	freelist = li.next;
		1002	--free_count;
		1003	}
		1004	else
		1005	{
		1006	void *ni = salloc0<char> (sizeof (object));
		1007
		1008	op = new(ni) object;
		1009
		1010	op->count = ++object_count;
		1011	}
		1012
958	op->link ();	1013	op->link ();
		1014
959	return op;	1015	return op;
		1016	}
		1017
		1018	void
		1019	object::do_delete ()
		1020	{
		1021	uint32_t count = this->count;
		1022
		1023	this->~object ();
		1024
		1025	freelist_item *li = (freelist_item *)this;
		1026	li->next = freelist;
		1027	li->count = count;
		1028
		1029	freelist = li;
		1030	++free_count;
960	}	1031	}
961		1032
962	static struct freed_map : maptile	1033	static struct freed_map : maptile
963	{	1034	{
964	freed_map ()	1035	freed_map ()
965	{	1036	{
966	path = "<freed objects map>";	1037	path = "<freed objects map>";
967	name = "/internal/freed_objects_map";	1038	name = "/internal/freed_objects_map";
968	width = 3;	1039	width = 3;
969	height = 3;	1040	height = 3;
970	nodrop = 1;	1041	no_drop = 1;
		1042	no_reset = 1;
971		1043
972	alloc ();	1044	alloc ();
973	in_memory = MAP_ACTIVE;	1045	in_memory = MAP_ACTIVE;
974	}	1046	}
		1047
		1048	~freed_map ()
		1049	{
		1050	destroy ();
		1051	}
975	} freed_map; // freed objects are moved here to avoid crashes	1052	} freed_map; // freed objects are moved here to avoid crashes
976		1053
977	void	1054	void
978	object::do_destroy ()	1055	object::do_destroy ()
979	{	1056	{
980	if (flag [FLAG_IS_LINKED])	1057	if (flag [FLAG_IS_LINKED])
981	remove_button_link (this);	1058	remove_link ();
982		1059
983	if (flag [FLAG_FRIENDLY])	1060	if (flag [FLAG_FRIENDLY])
984	remove_friendly_object (this);	1061	remove_friendly_object (this);
985		1062
986	remove ();	1063	remove ();
…		…
1011	attacked_by = 0;	1088	attacked_by = 0;
1012	current_weapon = 0;	1089	current_weapon = 0;
1013	}	1090	}
1014		1091
1015	void	1092	void
1016	object::destroy (bool destroy_inventory)	1093	object::destroy ()
1017	{	1094	{
1018	if (destroyed ())	1095	if (destroyed ())
1019	return;	1096	return;
1020		1097
1021	if (!is_head () && !head->destroyed ())	1098	if (!is_head () && !head->destroyed ())
1022	{	1099	{
1023	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");	1100	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1024	head->destroy (destroy_inventory);	1101	head->destroy ();
1025	return;	1102	return;
1026	}	1103	}
1027		1104
1028	destroy_inv (!destroy_inventory);	1105	destroy_inv_fast ();
1029		1106
1030	if (is_head ())	1107	if (is_head ())
1031	if (sound_destroy)	1108	if (sound_destroy)
1032	play_sound (sound_destroy);	1109	play_sound (sound_destroy);
1033	else if (flag [FLAG_MONSTER])	1110	else if (flag [FLAG_MONSTER])
…		…
1044	* the previous environment.	1121	* the previous environment.
1045	*/	1122	*/
1046	void	1123	void
1047	object::do_remove ()	1124	object::do_remove ()
1048	{	1125	{
1049	object *tmp, *last = 0;
1050	object *otmp;
1051
1052	if (flag [FLAG_REMOVED])	1126	if (flag [FLAG_REMOVED])
1053	return;	1127	return;
1054		1128
1055	INVOKE_OBJECT (REMOVE, this);	1129	INVOKE_OBJECT (REMOVE, this);
1056		1130
…		…
1070	esrv_del_item (pl->contr, count);	1144	esrv_del_item (pl->contr, count);
1071	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1145	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1072		1146
1073	adjust_weight (env, -total_weight ());	1147	adjust_weight (env, -total_weight ());
1074		1148
1075	*(above ? &above->below : &env->inv) = below;	1149	object *pl = in_player ();
1076
1077	if (below)
1078	below->above = above;
1079		1150
1080	/* we set up values so that it could be inserted into	1151	/* we set up values so that it could be inserted into
1081	* the map, but we don't actually do that - it is up	1152	* the map, but we don't actually do that - it is up
1082	* to the caller to decide what we want to do.	1153	* to the caller to decide what we want to do.
1083	*/	1154	*/
1084	map = env->map;	1155	map = env->map;
1085	x = env->x;	1156	x = env->x;
1086	y = env->y;	1157	y = env->y;
		1158
		1159	// make sure cmov optimisation is applicable
		1160	*(above ? &above->below : &env->inv) = below;
		1161	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1162
1087	above = 0;	1163	above = 0;
1088	below = 0;	1164	below = 0;
1089	env = 0;	1165	env = 0;
1090		1166
1091	/* NO_FIX_PLAYER is set when a great many changes are being	1167	if (pl && pl->is_player ())
1092	* made to players inventory. If set, avoiding the call
1093	* to save cpu time.
1094	*/	1168	{
1095	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1169	if (expect_false (pl->contr->combat_ob == this))
1096	otmp->update_stats ();	1170	{
		1171	pl->apply (pl->contr->combat_ob, AP_UNAPPLY);
		1172	pl->contr->combat_ob = 0;
		1173	if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);
		1174	}
		1175
		1176	if (expect_false (pl->contr->ranged_ob == this))
		1177	{
		1178	pl->apply (pl->contr->ranged_ob, AP_UNAPPLY);
		1179	pl->contr->ranged_ob = 0;
		1180	if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);
		1181	}
		1182
		1183	pl->contr->queue_stats_update ();
		1184
		1185	if (expect_false (glow_radius) && pl->is_on_map ())
		1186	update_all_los (pl->map, pl->x, pl->y);
		1187	}
1097	}	1188	}
1098	else if (map)	1189	else if (map)
1099	{	1190	{
1100	map->dirty = true;	1191	map->dirty = true;
1101	mapspace &ms = this->ms ();	1192	mapspace &ms = this->ms ();
1102		1193
1103	if (object *pl = ms.player ())	1194	if (object *pl = ms.player ())
1104	{	1195	{
1105	if (type == PLAYER) // this == pl(!)	1196	if (is_player ())
1106	{	1197	{
		1198	if (!flag [FLAG_WIZPASS])
		1199	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1200
1107	// leaving a spot always closes any open container on the ground	1201	// leaving a spot always closes any open container on the ground
1108	if (container && !container->env)	1202	if (container && !container->env)
1109	// this causes spurious floorbox updates, but it ensures	1203	// this causes spurious floorbox updates, but it ensures
1110	// that the CLOSE event is being sent.	1204	// that the CLOSE event is being sent.
1111	close_container ();	1205	close_container ();
1112		1206
1113	--map->players;	1207	--map->players;
1114	map->touch ();	1208	map->touch ();
1115	}	1209	}
1116	else if (pl->container == this)	1210	else if (pl->container_ () == this)
1117	{	1211	{
1118	// removing a container should close it	1212	// removing a container should close it
1119	close_container ();	1213	close_container ();
1120	}	1214	}
1121		1215	else
1122	esrv_del_item (pl->contr, count);	1216	esrv_del_item (pl->contr, count);
1123	}	1217	}
1124		1218
1125	/* link the object above us */	1219	/* link the object above us */
1126	if (above)	1220	// re-link, make sure compiler can easily use cmove
1127	above->below = below;	1221	*(above ? &above->below : &ms.top) = below;
1128	else	1222	*(below ? &below->above : &ms.bot) = above;
1129	ms.top = below; /* we were top, set new top */
1130
1131	/* Relink the object below us, if there is one */
1132	if (below)
1133	below->above = above;
1134	else
1135	{
1136	/* Nothing below, which means we need to relink map object for this space
1137	* use translated coordinates in case some oddness with map tiling is
1138	* evident
1139	*/
1140	if (GET_MAP_OB (map, x, y) != this)
1141	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 ());
1142
1143	ms.bot = above; /* goes on above it. */
1144	}
1145		1223
1146	above = 0;	1224	above = 0;
1147	below = 0;	1225	below = 0;
1148		1226
		1227	ms.invalidate ();
		1228
1149	if (map->in_memory == MAP_SAVING)	1229	if (map->in_memory == MAP_SAVING)
1150	return;	1230	return;
1151		1231
1152	int check_walk_off = !flag [FLAG_NO_APPLY];	1232	int check_walk_off = !flag [FLAG_NO_APPLY];
1153		1233
1154	if (object *pl = ms.player ())	1234	if (object *pl = ms.player ())
1155	{	1235	{
1156	if (pl->container == this)	1236	if (pl->container_ () == this)
1157	/* If a container that the player is currently using somehow gets	1237	/* If a container that the player is currently using somehow gets
1158	* removed (most likely destroyed), update the player view	1238	* removed (most likely destroyed), update the player view
1159	* appropriately.	1239	* appropriately.
1160	*/	1240	*/
1161	pl->close_container ();	1241	pl->close_container ();
1162		1242
1163	//TODO: the floorbox prev/next might need updating	1243	//TODO: the floorbox prev/next might need updating
1164	esrv_del_item (pl->contr, count);	1244	//esrv_del_item (pl->contr, count);
		1245	//TODO: update floorbox to preserve ordering
		1246	if (pl->contr->ns)
		1247	pl->contr->ns->floorbox_update ();
1165	}	1248	}
1166		1249
		1250	if (check_walk_off)
1167	for (tmp = ms.bot; tmp; tmp = tmp->above)	1251	for (object *above, *tmp = ms.bot; tmp; tmp = above)
1168	{	1252	{
		1253	above = tmp->above;
		1254
1169	/* No point updating the players look faces if he is the object	1255	/* No point updating the players look faces if he is the object
1170	* being removed.	1256	* being removed.
1171	*/	1257	*/
1172		1258
1173	/* See if object moving off should effect something */	1259	/* See if object moving off should effect something */
1174	if (check_walk_off
1175	&& ((move_type & tmp->move_off)	1260	if ((move_type & tmp->move_off)
1176	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1261	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1177	{
1178	move_apply (tmp, this, 0);	1262	move_apply (tmp, this, 0);
1179
1180	if (destroyed ())
1181	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1182	}	1263	}
1183		1264
1184	last = tmp;	1265	if (affects_los ())
1185	}
1186
1187	/* last == NULL if there are no objects on this space */
1188	//TODO: this makes little sense, why only update the topmost object?
1189	if (!last)
1190	map->at (x, y).flags_ = 0;
1191	else
1192	update_object (last, UP_OBJ_REMOVE);
1193
1194	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1195	update_all_los (map, x, y);	1266	update_all_los (map, x, y);
1196	}	1267	}
1197	}	1268	}
1198		1269
1199	/*	1270	/*
…		…
1223	esrv_update_item (UPD_NROF, pl, top);	1294	esrv_update_item (UPD_NROF, pl, top);
1224		1295
1225	op->weight = 0; // cancel the addition above	1296	op->weight = 0; // cancel the addition above
1226	op->carrying = 0; // must be 0 already	1297	op->carrying = 0; // must be 0 already
1227		1298
1228	op->destroy (1);	1299	op->destroy ();
1229		1300
1230	return top;	1301	return top;
1231	}	1302	}
1232		1303
1233	return 0;	1304	return 0;
…		…
1241		1312
1242	object *prev = this;	1313	object *prev = this;
1243		1314
1244	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)	1315	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1245	{	1316	{
1246	object *op = arch_to_object (at);	1317	object *op = at->instance ();
1247		1318
1248	op->name = name;	1319	op->name = name;
1249	op->name_pl = name_pl;	1320	op->name_pl = name_pl;
1250	op->title = title;	1321	op->title = title;
1251		1322
…		…
1261	* job preparing multi-part monsters.	1332	* job preparing multi-part monsters.
1262	*/	1333	*/
1263	object *	1334	object *
1264	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1335	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1265	{	1336	{
		1337	op->remove ();
		1338
1266	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1339	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1267	{	1340	{
1268	tmp->x = x + tmp->arch->x;	1341	tmp->x = x + tmp->arch->x;
1269	tmp->y = y + tmp->arch->y;	1342	tmp->y = y + tmp->arch->y;
1270	}	1343	}
…		…
1287	* Passing 0 for flag gives proper default values, so flag really only needs	1360	* Passing 0 for flag gives proper default values, so flag really only needs
1288	* to be set if special handling is needed.	1361	* to be set if special handling is needed.
1289	*	1362	*
1290	* Return value:	1363	* Return value:
1291	* new object if 'op' was merged with other object	1364	* new object if 'op' was merged with other object
1292	* NULL if 'op' was destroyed	1365	* NULL if there was an error (destroyed, blocked etc.)
1293	* just 'op' otherwise	1366	* just 'op' otherwise
1294	*/	1367	*/
1295	object *	1368	object *
1296	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1369	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1297	{	1370	{
1298	assert (!op->flag [FLAG_FREED]);
1299
1300	op->remove ();	1371	op->remove ();
		1372
		1373	if (m == &freed_map)//D TODO: remove soon
		1374	{//D
		1375	LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
		1376	}//D
1301		1377
1302	/* Ideally, the caller figures this out. However, it complicates a lot	1378	/* Ideally, the caller figures this out. However, it complicates a lot
1303	* of areas of callers (eg, anything that uses find_free_spot would now	1379	* of areas of callers (eg, anything that uses find_free_spot would now
1304	* need extra work	1380	* need extra work
1305	*/	1381	*/
		1382	maptile *newmap = m;
1306	if (!xy_normalise (m, op->x, op->y))	1383	if (!xy_normalise (newmap, op->x, op->y))
1307	{	1384	{
1308	op->destroy (1);	1385	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1309	return 0;	1386	return 0;
1310	}	1387	}
1311		1388
1312	if (object *more = op->more)	1389	if (object *more = op->more)
1313	if (!insert_ob_in_map (more, m, originator, flag))	1390	if (!insert_ob_in_map (more, m, originator, flag))
1314	return 0;	1391	return 0;
1315		1392
1316	CLEAR_FLAG (op, FLAG_REMOVED);	1393	op->flag [FLAG_REMOVED] = false;
1317		1394	op->env = 0;
1318	op->map = m;	1395	op->map = newmap;
		1396
1319	mapspace &ms = op->ms ();	1397	mapspace &ms = op->ms ();
1320		1398
1321	/* this has to be done after we translate the coordinates.	1399	/* this has to be done after we translate the coordinates.
1322	*/	1400	*/
1323	if (op->nrof && !(flag & INS_NO_MERGE))	1401	if (op->nrof && !(flag & INS_NO_MERGE))
1324	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1402	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1325	if (object::can_merge (op, tmp))	1403	if (object::can_merge (op, tmp))
1326	{	1404	{
1327	// TODO: we atcually want to update tmp, not op,	1405	// TODO: we actually want to update tmp, not op,
1328	// but some caller surely breaks when we return tmp	1406	// but some caller surely breaks when we return tmp
1329	// from here :/	1407	// from here :/
1330	op->nrof += tmp->nrof;	1408	op->nrof += tmp->nrof;
1331	tmp->destroy (1);	1409	tmp->destroy ();
1332	}	1410	}
1333		1411
1334	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1412	op->clr_flag (FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1335	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1413	op->clr_flag (FLAG_INV_LOCKED);
1336		1414
1337	if (!QUERY_FLAG (op, FLAG_ALIVE))	1415	if (!op->flag [FLAG_ALIVE])
1338	CLEAR_FLAG (op, FLAG_NO_STEAL);	1416	op->clr_flag (FLAG_NO_STEAL);
1339		1417
1340	if (flag & INS_BELOW_ORIGINATOR)	1418	if (flag & INS_BELOW_ORIGINATOR)
1341	{	1419	{
1342	if (originator->map != op->map || originator->x != op->x || originator->y != op->y)	1420	if (originator->map != op->map || originator->x != op->x || originator->y != op->y)
1343	{	1421	{
1344	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1422	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1345	abort ();	1423	abort ();
1346	}	1424	}
1347		1425
		1426	if (!originator->is_on_map ())
		1427	{
		1428	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1429	op->debug_desc (), originator->debug_desc ());
		1430	abort ();
		1431	}
		1432
1348	op->above = originator;	1433	op->above = originator;
1349	op->below = originator->below;	1434	op->below = originator->below;
1350
1351	if (op->below)
1352	op->below->above = op;
1353	else
1354	ms.bot = op;
1355
1356	/* since *below* originator, no need to update top */
1357	originator->below = op;	1435	originator->below = op;
		1436
		1437	*(op->below ? &op->below->above : &ms.bot) = op;
1358	}	1438	}
1359	else	1439	else
1360	{	1440	{
1361	object *top, *floor = NULL;	1441	object *floor = 0;
1362		1442	object *top = ms.top;
1363	top = ms.bot;
1364		1443
1365	/* If there are other objects, then */	1444	/* If there are other objects, then */
1366	if (top)	1445	if (top)
1367	{	1446	{
1368	object *last = 0;
1369
1370	/*	1447	/*
1371	* If there are multiple objects on this space, we do some trickier handling.	1448	* If there are multiple objects on this space, we do some trickier handling.
1372	* We've already dealt with merging if appropriate.	1449	* We've already dealt with merging if appropriate.
1373	* Generally, we want to put the new object on top. But if	1450	* Generally, we want to put the new object on top. But if
1374	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1451	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1377	* once we get to them. This reduces the need to traverse over all of	1454	* once we get to them. This reduces the need to traverse over all of
1378	* them when adding another one - this saves quite a bit of cpu time	1455	* them when adding another one - this saves quite a bit of cpu time
1379	* when lots of spells are cast in one area. Currently, it is presumed	1456	* when lots of spells are cast in one area. Currently, it is presumed
1380	* that flying non pickable objects are spell objects.	1457	* that flying non pickable objects are spell objects.
1381	*/	1458	*/
1382	for (top = ms.bot; top; top = top->above)	1459	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1383	{	1460	{
1384	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1461	if (tmp->flag [FLAG_IS_FLOOR] || tmp->flag [FLAG_OVERLAY_FLOOR])
1385	floor = top;	1462	floor = tmp;
1386		1463
1387	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1464	if (tmp->flag [FLAG_NO_PICK] && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !tmp->flag [FLAG_IS_FLOOR])
1388	{	1465	{
1389	/* We insert above top, so we want this object below this */	1466	/* We insert above top, so we want this object below this */
1390	top = top->below;	1467	top = tmp->below;
1391	break;	1468	break;
1392	}	1469	}
1393		1470
1394	last = top;	1471	top = tmp;
1395	}	1472	}
1396
1397	/* Don't want top to be NULL, so set it to the last valid object */
1398	top = last;
1399		1473
1400	/* We let update_position deal with figuring out what the space	1474	/* We let update_position deal with figuring out what the space
1401	* looks like instead of lots of conditions here.	1475	* looks like instead of lots of conditions here.
1402	* makes things faster, and effectively the same result.	1476	* makes things faster, and effectively the same result.
1403	*/	1477	*/
…		…
1410	*/	1484	*/
1411	if (!(flag & INS_ON_TOP)	1485	if (!(flag & INS_ON_TOP)
1412	&& ms.flags () & P_BLOCKSVIEW	1486	&& ms.flags () & P_BLOCKSVIEW
1413	&& (op->face && !faces [op->face].visibility))	1487	&& (op->face && !faces [op->face].visibility))
1414	{	1488	{
		1489	object *last;
		1490
1415	for (last = top; last != floor; last = last->below)	1491	for (last = top; last != floor; last = last->below)
1416	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1492	if (last->flag [FLAG_BLOCKSVIEW] && (last->type != EXIT))
1417	break;	1493	break;
1418		1494
1419	/* Check to see if we found the object that blocks view,	1495	/* Check to see if we found the object that blocks view,
1420	* and make sure we have a below pointer for it so that	1496	* and make sure we have a below pointer for it so that
1421	* we can get inserted below this one, which requires we	1497	* we can get inserted below this one, which requires we
…		…
1427	} /* If objects on this space */	1503	} /* If objects on this space */
1428		1504
1429	if (flag & INS_ABOVE_FLOOR_ONLY)	1505	if (flag & INS_ABOVE_FLOOR_ONLY)
1430	top = floor;	1506	top = floor;
1431		1507
1432	/* Top is the object that our object (op) is going to get inserted above.	1508	// insert object above top, or bottom-most if top = 0
1433	*/
1434
1435	/* First object on this space */
1436	if (!top)	1509	if (!top)
1437	{	1510	{
		1511	op->below = 0;
1438	op->above = ms.bot;	1512	op->above = ms.bot;
1439
1440	if (op->above)
1441	op->above->below = op;
1442
1443	op->below = 0;
1444	ms.bot = op;	1513	ms.bot = op;
		1514
		1515	*(op->above ? &op->above->below : &ms.top) = op;
1445	}	1516	}
1446	else	1517	else
1447	{ /* get inserted into the stack above top */	1518	{
1448	op->above = top->above;	1519	op->above = top->above;
1449
1450	if (op->above)
1451	op->above->below = op;	1520	top->above = op;
1452		1521
1453	op->below = top;	1522	op->below = top;
1454	top->above = op;	1523	*(op->above ? &op->above->below : &ms.top) = op;
1455	}	1524	}
		1525	}
1456		1526
1457	if (!op->above)	1527	if (op->is_player ())
1458	ms.top = op;
1459	} /* else not INS_BELOW_ORIGINATOR */
1460
1461	if (op->type == PLAYER)
1462	{	1528	{
1463	op->contr->do_los = 1;	1529	op->contr->do_los = 1;
1464	++op->map->players;	1530	++op->map->players;
1465	op->map->touch ();	1531	op->map->touch ();
1466	}	1532	}
1467		1533
1468	op->map->dirty = true;	1534	op->map->dirty = true;
1469		1535
1470	if (object *pl = ms.player ())	1536	if (object *pl = ms.player ())
1471	//TODO: the floorbox prev/next might need updating	1537	//TODO: the floorbox prev/next might need updating
1472	esrv_send_item (pl, op);	1538	//esrv_send_item (pl, op);
		1539	//TODO: update floorbox to preserve ordering
		1540	if (pl->contr->ns)
		1541	pl->contr->ns->floorbox_update ();
1473		1542
1474	/* If this object glows, it may affect lighting conditions that are	1543	/* If this object glows, it may affect lighting conditions that are
1475	* visible to others on this map. But update_all_los is really	1544	* visible to others on this map. But update_all_los is really
1476	* an inefficient way to do this, as it means los for all players	1545	* an inefficient way to do this, as it means los for all players
1477	* on the map will get recalculated. The players could very well	1546	* on the map will get recalculated. The players could very well
1478	* be far away from this change and not affected in any way -	1547	* be far away from this change and not affected in any way -
1479	* this should get redone to only look for players within range,	1548	* this should get redone to only look for players within range,
1480	* or just updating the P_UPTODATE for spaces within this area	1549	* or just updating the P_UPTODATE for spaces within this area
1481	* of effect may be sufficient.	1550	* of effect may be sufficient.
1482	*/	1551	*/
1483	if (op->map->darkness && (op->glow_radius != 0))	1552	if (op->affects_los ())
		1553	{
		1554	op->ms ().invalidate ();
1484	update_all_los (op->map, op->x, op->y);	1555	update_all_los (op->map, op->x, op->y);
		1556	}
1485		1557
1486	/* updates flags (blocked, alive, no magic, etc) for this map space */	1558	/* updates flags (blocked, alive, no magic, etc) for this map space */
1487	update_object (op, UP_OBJ_INSERT);	1559	update_object (op, UP_OBJ_INSERT);
1488		1560
1489	INVOKE_OBJECT (INSERT, op);	1561	INVOKE_OBJECT (INSERT, op);
…		…
1496	* blocked() and wall() work properly), and these flags are updated by	1568	* blocked() and wall() work properly), and these flags are updated by
1497	* update_object().	1569	* update_object().
1498	*/	1570	*/
1499		1571
1500	/* if this is not the head or flag has been passed, don't check walk on status */	1572	/* if this is not the head or flag has been passed, don't check walk on status */
1501	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1573	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1502	{	1574	{
1503	if (check_move_on (op, originator))	1575	if (check_move_on (op, originator))
1504	return 0;	1576	return 0;
1505		1577
1506	/* If we are a multi part object, lets work our way through the check	1578	/* If we are a multi part object, lets work our way through the check
…		…
1517	/* this function inserts an object in the map, but if it	1589	/* this function inserts an object in the map, but if it
1518	* finds an object of its own type, it'll remove that one first.	1590	* finds an object of its own type, it'll remove that one first.
1519	* op is the object to insert it under: supplies x and the map.	1591	* op is the object to insert it under: supplies x and the map.
1520	*/	1592	*/
1521	void	1593	void
1522	replace_insert_ob_in_map (const char *arch_string, object *op)	1594	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1523	{	1595	{
1524	/* first search for itself and remove any old instances */	1596	/* first search for itself and remove any old instances */
1525		1597
1526	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1598	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1527	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1599	if (tmp->arch->archname == archname) /* same archetype */
1528	tmp->destroy (1);	1600	tmp->destroy ();
1529		1601
1530	object *tmp = arch_to_object (archetype::find (arch_string));	1602	object *tmp = archetype::find (archname)->instance ();
1531		1603
1532	tmp->x = op->x;	1604	tmp->x = op->x;
1533	tmp->y = op->y;	1605	tmp->y = op->y;
1534		1606
1535	insert_ob_in_map (tmp, op->map, op, 0);	1607	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1540	{	1612	{
1541	if (where->env)	1613	if (where->env)
1542	return where->env->insert (this);	1614	return where->env->insert (this);
1543	else	1615	else
1544	return where->map->insert (this, where->x, where->y, originator, flags);	1616	return where->map->insert (this, where->x, where->y, originator, flags);
		1617	}
		1618
		1619	// check whether we can put this into the map, respect max_volume, max_items
		1620	bool
		1621	object::can_drop_at (maptile *m, int x, int y, object *originator)
		1622	{
		1623	mapspace &ms = m->at (x, y);
		1624
		1625	int items = ms.items ();
		1626
		1627	if (!items // testing !items ensures we can drop at least one item
		1628	|| (items < m->max_items
		1629	&& ms.volume () < m->max_volume))
		1630	return true;
		1631
		1632	if (originator && originator->is_player ())
		1633	originator->contr->failmsgf (
		1634	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
		1635	query_name ()
		1636	);
		1637
		1638	return false;
1545	}	1639	}
1546		1640
1547	/*	1641	/*
1548	* decrease(object, number) decreases a specified number from	1642	* decrease(object, number) decreases a specified number from
1549	* the amount of an object. If the amount reaches 0, the object	1643	* the amount of an object. If the amount reaches 0, the object
…		…
1557	if (!nr)	1651	if (!nr)
1558	return true;	1652	return true;
1559		1653
1560	nr = min (nr, nrof);	1654	nr = min (nr, nrof);
1561		1655
		1656	if (nrof > nr)
		1657	{
1562	nrof -= nr;	1658	nrof -= nr;
1563
1564	if (nrof)
1565	{
1566	adjust_weight (env, -weight * nr); // carrying == 0	1659	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1567		1660
1568	if (object *pl = visible_to ())	1661	if (object *pl = visible_to ())
1569	esrv_update_item (UPD_NROF, pl, this);	1662	esrv_update_item (UPD_NROF, pl, this);
1570		1663
1571	return true;	1664	return true;
1572	}	1665	}
1573	else	1666	else
1574	{	1667	{
1575	destroy (1);	1668	destroy ();
1576	return false;	1669	return false;
1577	}	1670	}
1578	}	1671	}
1579		1672
1580	/*	1673	/*
…		…
1597	}	1690	}
1598	else	1691	else
1599	{	1692	{
1600	decrease (nr);	1693	decrease (nr);
1601		1694
1602	object *op = object_create_clone (this);	1695	object *op = deep_clone ();
1603	op->nrof = nr;	1696	op->nrof = nr;
1604	return op;	1697	return op;
1605	}	1698	}
1606	}	1699	}
1607		1700
…		…
1657	if (object *pl = tmp->visible_to ())	1750	if (object *pl = tmp->visible_to ())
1658	esrv_update_item (UPD_NROF, pl, tmp);	1751	esrv_update_item (UPD_NROF, pl, tmp);
1659		1752
1660	adjust_weight (this, op->total_weight ());	1753	adjust_weight (this, op->total_weight ());
1661		1754
1662	op->destroy (1);	1755	op->destroy ();
1663	op = tmp;	1756	op = tmp;
1664	goto inserted;	1757	goto inserted;
1665	}	1758	}
1666		1759
1667	op->owner = 0; // it's his/hers now. period.	1760	op->owner = 0; // it's his/hers now. period.
…		…
1685		1778
1686	adjust_weight (this, op->total_weight ());	1779	adjust_weight (this, op->total_weight ());
1687		1780
1688	inserted:	1781	inserted:
1689	/* reset the light list and los of the players on the map */	1782	/* reset the light list and los of the players on the map */
1690	if (op->glow_radius && map && map->darkness)	1783	if (op->glow_radius && is_on_map ())
		1784	{
		1785	update_stats ();
1691	update_all_los (map, x, y);	1786	update_all_los (map, x, y);
1692		1787	}
		1788	else if (is_player ())
1693	// if this is a player's inventory, update stats	1789	// if this is a player's inventory, update stats
1694	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])	1790	contr->queue_stats_update ();
1695	update_stats ();
1696		1791
1697	INVOKE_OBJECT (INSERT, this);	1792	INVOKE_OBJECT (INSERT, this);
1698		1793
1699	return op;	1794	return op;
1700	}	1795	}
…		…
1720	* on top.	1815	* on top.
1721	*/	1816	*/
1722	int	1817	int
1723	check_move_on (object *op, object *originator)	1818	check_move_on (object *op, object *originator)
1724	{	1819	{
		1820	if (op->flag [FLAG_NO_APPLY])
		1821	return 0;
		1822
1725	object *tmp;	1823	object *tmp;
1726	maptile *m = op->map;	1824	maptile *m = op->map;
1727	int x = op->x, y = op->y;	1825	int x = op->x, y = op->y;
1728		1826
1729	MoveType move_on, move_slow, move_block;	1827	mapspace &ms = m->at (x, y);
1730		1828
1731	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1829	ms.update ();
1732	return 0;
1733		1830
1734	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1831	MoveType move_on = ms.move_on;
1735	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1832	MoveType move_slow = ms.move_slow;
1736	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1833	MoveType move_block = ms.move_block;
1737		1834
1738	/* if nothing on this space will slow op down or be applied,	1835	/* if nothing on this space will slow op down or be applied,
1739	* no need to do checking below. have to make sure move_type	1836	* no need to do checking below. have to make sure move_type
1740	* is set, as lots of objects don't have it set - we treat that	1837	* is set, as lots of objects don't have it set - we treat that
1741	* as walking.	1838	* as walking.
…		…
1752	return 0;	1849	return 0;
1753		1850
1754	/* The objects have to be checked from top to bottom.	1851	/* The objects have to be checked from top to bottom.
1755	* Hence, we first go to the top:	1852	* Hence, we first go to the top:
1756	*/	1853	*/
1757		1854	for (object *next, *tmp = ms.top; tmp; tmp = next)
1758	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1759	{
1760	/* Trim the search when we find the first other spell effect
1761	* this helps performance so that if a space has 50 spell objects,
1762	* we don't need to check all of them.
1763	*/
1764	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1765	break;
1766	}	1855	{
		1856	next = tmp->below;
1767		1857
1768	for (; tmp; tmp = tmp->below)
1769	{
1770	if (tmp == op)	1858	if (tmp == op)
1771	continue; /* Can't apply yourself */	1859	continue; /* Can't apply yourself */
1772		1860
1773	/* Check to see if one of the movement types should be slowed down.	1861	/* Check to see if one of the movement types should be slowed down.
1774	* Second check makes sure that the movement types not being slowed	1862	* Second check makes sure that the movement types not being slowed
1775	* (~slow_move) is not blocked on this space - just because the	1863	* (~slow_move) is not blocked on this space - just because the
1776	* space doesn't slow down swimming (for example), if you can't actually	1864	* space doesn't slow down swimming (for example), if you can't actually
1777	* swim on that space, can't use it to avoid the penalty.	1865	* swim on that space, can't use it to avoid the penalty.
1778	*/	1866	*/
1779	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1867	if (!op->flag [FLAG_WIZPASS])
1780	{	1868	{
1781	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1869	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1782	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1870	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1783	{	1871	{
1784
1785	float
1786	diff = tmp->move_slow_penalty * fabs (op->speed);	1872	float diff = tmp->move_slow_penalty * fabs (op->speed);
1787		1873
1788	if (op->type == PLAYER)	1874	if (op->is_player ())
1789	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1875	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1790	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1876	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1791	diff /= 4.0;	1877	diff /= 4.0;
1792		1878
1793	op->speed_left -= diff;	1879	op->speed_left -= diff;
1794	}	1880	}
1795	}	1881	}
…		…
1828	LOG (llevError, "Present_arch called outside map.\n");	1914	LOG (llevError, "Present_arch called outside map.\n");
1829	return NULL;	1915	return NULL;
1830	}	1916	}
1831		1917
1832	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1918	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1833	if (tmp->arch == at)	1919	if (tmp->arch->archname == at->archname)
1834	return tmp;	1920	return tmp;
1835		1921
1836	return NULL;	1922	return NULL;
1837	}	1923	}
1838		1924
…		…
1902	* The first matching object is returned, or NULL if none.	1988	* The first matching object is returned, or NULL if none.
1903	*/	1989	*/
1904	object *	1990	object *
1905	present_arch_in_ob (const archetype *at, const object *op)	1991	present_arch_in_ob (const archetype *at, const object *op)
1906	{	1992	{
1907	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1993	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1908	if (tmp->arch == at)	1994	if (tmp->arch->archname == at->archname)
1909	return tmp;	1995	return tmp;
1910		1996
1911	return NULL;	1997	return NULL;
1912	}	1998	}
1913		1999
…		…
1917	void	2003	void
1918	flag_inv (object *op, int flag)	2004	flag_inv (object *op, int flag)
1919	{	2005	{
1920	for (object *tmp = op->inv; tmp; tmp = tmp->below)	2006	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1921	{	2007	{
1922	SET_FLAG (tmp, flag);	2008	tmp->set_flag (flag);
1923	flag_inv (tmp, flag);	2009	flag_inv (tmp, flag);
1924	}	2010	}
1925	}	2011	}
1926		2012
1927	/*	2013	/*
…		…
1930	void	2016	void
1931	unflag_inv (object *op, int flag)	2017	unflag_inv (object *op, int flag)
1932	{	2018	{
1933	for (object *tmp = op->inv; tmp; tmp = tmp->below)	2019	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1934	{	2020	{
1935	CLEAR_FLAG (tmp, flag);	2021	tmp->clr_flag (flag);
1936	unflag_inv (tmp, flag);	2022	unflag_inv (tmp, flag);
1937	}	2023	}
1938	}	2024	}
1939		2025
1940	/*	2026	/*
…		…
2001	* head of the object should correspond for the entire object.	2087	* head of the object should correspond for the entire object.
2002	*/	2088	*/
2003	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	2089	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
2004	continue;	2090	continue;
2005		2091
2006	if (ob->blocked (m, pos.x, pos.y))	2092	if (ob->blocked (pos.m, pos.x, pos.y))
2007	continue;	2093	continue;
2008		2094
2009	altern [index++] = i;	2095	altern [index++] = i;
2010	}	2096	}
2011		2097
…		…
2079	* there is capable of.	2165	* there is capable of.
2080	*/	2166	*/
2081	int	2167	int
2082	find_dir (maptile *m, int x, int y, object *exclude)	2168	find_dir (maptile *m, int x, int y, object *exclude)
2083	{	2169	{
2084	int i, max = SIZEOFFREE, mflags;	2170	int max = SIZEOFFREE, mflags;
2085
2086	sint16 nx, ny;
2087	object *tmp;
2088	maptile *mp;
2089
2090	MoveType blocked, move_type;	2171	MoveType move_type;
2091		2172
2092	if (exclude && exclude->head_ () != exclude)	2173	if (exclude && exclude->head_ () != exclude)
2093	{	2174	{
2094	exclude = exclude->head;	2175	exclude = exclude->head;
2095	move_type = exclude->move_type;	2176	move_type = exclude->move_type;
…		…
2098	{	2179	{
2099	/* If we don't have anything, presume it can use all movement types. */	2180	/* If we don't have anything, presume it can use all movement types. */
2100	move_type = MOVE_ALL;	2181	move_type = MOVE_ALL;
2101	}	2182	}
2102		2183
2103	for (i = 1; i < max; i++)	2184	for (int i = 1; i < max; i++)
2104	{	2185	{
2105	mp = m;	2186	mapxy pos (m, x, y);
2106	nx = x + freearr_x[i];	2187	pos.move (i);
2107	ny = y + freearr_y[i];
2108		2188
2109	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2189	if (!pos.normalise ())
2110
2111	if (mflags & P_OUT_OF_MAP)
2112	max = maxfree[i];	2190	max = maxfree[i];
2113	else	2191	else
2114	{	2192	{
2115	mapspace &ms = mp->at (nx, ny);	2193	mapspace &ms = *pos;
2116		2194
2117	blocked = ms.move_block;
2118
2119	if ((move_type & blocked) == move_type)	2195	if ((move_type & ms.move_block) == move_type)
2120	max = maxfree[i];	2196	max = maxfree [i];
2121	else if (mflags & P_IS_ALIVE)	2197	else if (ms.flags () & P_IS_ALIVE)
2122	{	2198	{
2123	for (tmp = ms.bot; tmp; tmp = tmp->above)	2199	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2124	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2200	if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2125	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2201	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2126	break;
2127
2128	if (tmp)
2129	return freedir[i];	2202	return freedir [i];
2130	}	2203	}
2131	}	2204	}
2132	}	2205	}
2133		2206
2134	return 0;	2207	return 0;
…		…
2209	* This basically means that if direction is 15, then it could either go	2282	* This basically means that if direction is 15, then it could either go
2210	* direction 4, 14, or 16 to get back to where we are.	2283	* direction 4, 14, or 16 to get back to where we are.
2211	* Moved from spell_util.c to object.c with the other related direction	2284	* Moved from spell_util.c to object.c with the other related direction
2212	* functions.	2285	* functions.
2213	*/	2286	*/
2214	int reduction_dir[SIZEOFFREE][3] = {	2287	static const int reduction_dir[SIZEOFFREE][3] = {
2215	{0, 0, 0}, /* 0 */	2288	{0, 0, 0}, /* 0 */
2216	{0, 0, 0}, /* 1 */	2289	{0, 0, 0}, /* 1 */
2217	{0, 0, 0}, /* 2 */	2290	{0, 0, 0}, /* 2 */
2218	{0, 0, 0}, /* 3 */	2291	{0, 0, 0}, /* 3 */
2219	{0, 0, 0}, /* 4 */	2292	{0, 0, 0}, /* 4 */
…		…
2313	* Add a check so we can't pick up invisible objects (0.93.8)	2386	* Add a check so we can't pick up invisible objects (0.93.8)
2314	*/	2387	*/
2315	int	2388	int
2316	can_pick (const object *who, const object *item)	2389	can_pick (const object *who, const object *item)
2317	{	2390	{
2318	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2391	return /*who->flag [FLAG_WIZ]|| */
2319	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2392	(item->weight > 0 && !item->flag [FLAG_NO_PICK] &&
2320	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2393	!item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2321	}	2394	}
2322		2395
2323	/*	2396	/*
2324	* create clone from object to another	2397	* create clone from object to another
2325	*/	2398	*/
2326	object *	2399	object *
2327	object_create_clone (object *asrc)	2400	object::deep_clone ()
2328	{	2401	{
		2402	assert (("deep_clone called on non-head object", is_head ()));
		2403
2329	object *dst = 0;	2404	object *dst = clone ();
2330		2405
2331	if (!asrc)
2332	return 0;
2333
2334	object *src = asrc->head_ ();
2335
2336	object *prev = 0;	2406	object *prev = dst;
2337	for (object *part = src; part; part = part->more)	2407	for (object *part = this->more; part; part = part->more)
2338	{	2408	{
2339	object *tmp = part->clone ();	2409	object *tmp = part->clone ();
2340
2341	tmp->x -= src->x;
2342	tmp->y -= src->y;
2343
2344	if (!part->head)
2345	{
2346	dst = tmp;
2347	tmp->head = 0;
2348	}
2349	else
2350	tmp->head = dst;	2410	tmp->head = dst;
2351
2352	tmp->more = 0;
2353
2354	if (prev)
2355	prev->more = tmp;	2411	prev->more = tmp;
2356
2357	prev = tmp;	2412	prev = tmp;
2358	}	2413	}
2359		2414
2360	for (object *item = src->inv; item; item = item->below)	2415	for (object *item = inv; item; item = item->below)
2361	insert_ob_in_ob (object_create_clone (item), dst);	2416	insert_ob_in_ob (item->deep_clone (), dst);
2362		2417
2363	return dst;	2418	return dst;
2364	}	2419	}
2365		2420
2366	/* This returns the first object in who's inventory that	2421	/* This returns the first object in who's inventory that
…		…
2375	return tmp;	2430	return tmp;
2376		2431
2377	return 0;	2432	return 0;
2378	}	2433	}
2379		2434
2380	/* If ob has a field named key, return the link from the list,	2435	shstr_tmp
2381	* otherwise return NULL.	2436	object::kv_get (shstr_tmp key) const
2382	*
2383	* key must be a passed in shared string - otherwise, this won't
2384	* do the desired thing.
2385	*/
2386	key_value *
2387	get_ob_key_link (const object *ob, const char *key)
2388	{	2437	{
2389	for (key_value *link = ob->key_values; link; link = link->next)	2438	for (key_value *kv = key_values; kv; kv = kv->next)
2390	if (link->key == key)	2439	if (kv->key == key)
2391	return link;
2392
2393	return 0;
2394	}
2395
2396	/*
2397	* Returns the value of op has an extra_field for key, or NULL.
2398	*
2399	* The argument doesn't need to be a shared string.
2400	*
2401	* The returned string is shared.
2402	*/
2403	const char *
2404	get_ob_key_value (const object *op, const char *const key)
2405	{
2406	key_value *link;
2407	shstr_cmp canonical_key (key);
2408
2409	if (!canonical_key)
2410	{
2411	/* 1. There being a field named key on any object
2412	* implies there'd be a shared string to find.
2413	* 2. Since there isn't, no object has this field.
2414	* 3. Therefore, *this* object doesn't have this field.
2415	*/
2416	return 0;
2417	}
2418
2419	/* This is copied from get_ob_key_link() above -
2420	* only 4 lines, and saves the function call overhead.
2421	*/
2422	for (link = op->key_values; link; link = link->next)
2423	if (link->key == canonical_key)
2424	return link->value;	2440	return kv->value;
2425		2441
2426	return 0;	2442	return shstr ();
2427	}	2443	}
2428		2444
2429	/*	2445	void
2430	* Updates the canonical_key in op to value.	2446	object::kv_set (shstr_tmp key, shstr_tmp value)
2431	*
2432	* canonical_key is a shared string (value doesn't have to be).
2433	*
2434	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2435	* keys.
2436	*
2437	* Returns TRUE on success.
2438	*/
2439	int
2440	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2441	{	2447	{
2442	key_value *field = NULL, *last = NULL;	2448	for (key_value *kv = key_values; kv; kv = kv->next)
2443		2449	if (kv->key == key)
2444	for (field = op->key_values; field != NULL; field = field->next)
2445	{
2446	if (field->key != canonical_key)
2447	{	2450	{
2448	last = field;	2451	kv->value = value;
2449	continue;	2452	return;
2450	}	2453	}
2451		2454
2452	if (value)	2455	key_value *kv = new key_value;
2453	field->value = value;	2456
2454	else	2457	kv->next = key_values;
		2458	kv->key = key;
		2459	kv->value = value;
		2460
		2461	key_values = kv;
		2462	}
		2463
		2464	void
		2465	object::kv_del (shstr_tmp key)
		2466	{
		2467	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2468	if ((*kvp)->key == key)
2455	{	2469	{
2456	/* Basically, if the archetype has this key set,	2470	key_value *kv = *kvp;
2457	* we need to store the null value so when we save	2471	*kvp = (*kvp)->next;
2458	* it, we save the empty value so that when we load,	2472	delete kv;
2459	* we get this value back again.	2473	return;
2460	*/
2461	if (get_ob_key_link (op->arch, canonical_key))
2462	field->value = 0;
2463	else
2464	{
2465	if (last)
2466	last->next = field->next;
2467	else
2468	op->key_values = field->next;
2469
2470	delete field;
2471	}
2472	}	2474	}
2473	return TRUE;
2474	}
2475	/* IF we get here, key doesn't exist */
2476
2477	/* No field, we'll have to add it. */
2478
2479	if (!add_key)
2480	return FALSE;
2481
2482	/* There isn't any good reason to store a null
2483	* value in the key/value list. If the archetype has
2484	* this key, then we should also have it, so shouldn't
2485	* be here. If user wants to store empty strings,
2486	* should pass in ""
2487	*/
2488	if (value == NULL)
2489	return TRUE;
2490
2491	field = new key_value;
2492
2493	field->key = canonical_key;
2494	field->value = value;
2495	/* Usual prepend-addition. */
2496	field->next = op->key_values;
2497	op->key_values = field;
2498
2499	return TRUE;
2500	}
2501
2502	/*
2503	* Updates the key in op to value.
2504	*
2505	* If add_key is FALSE, this will only update existing keys,
2506	* and not add new ones.
2507	* In general, should be little reason FALSE is ever passed in for add_key
2508	*
2509	* Returns TRUE on success.
2510	*/
2511	int
2512	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2513	{
2514	shstr key_ (key);
2515
2516	return set_ob_key_value_s (op, key_, value, add_key);
2517	}	2475	}
2518		2476
2519	object::depth_iterator::depth_iterator (object *container)	2477	object::depth_iterator::depth_iterator (object *container)
2520	: iterator_base (container)	2478	: iterator_base (container)
2521	{	2479	{
…		…
2571	{	2529	{
2572	char flagdesc[512];	2530	char flagdesc[512];
2573	char info2[256 * 4];	2531	char info2[256 * 4];
2574	char *p = info;	2532	char *p = info;
2575		2533
2576	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2534	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2577	count,	2535	count,
2578	uuid.c_str (),	2536	uuid.c_str (),
2579	&name,	2537	&name,
2580	title ? "\",title:\"" : "",	2538	title ? ",title:\"" : "",
2581	title ? (const char *)title : "",	2539	title ? (const char *)title : "",
		2540	title ? "\"" : "",
2582	flag_desc (flagdesc, 512), type);	2541	flag_desc (flagdesc, 512), type);
2583		2542
2584	if (!flag[FLAG_REMOVED] && env)	2543	if (!flag[FLAG_REMOVED] && env)
2585	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2544	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2586		2545
…		…
2602	struct region *	2561	struct region *
2603	object::region () const	2562	object::region () const
2604	{	2563	{
2605	return map ? map->region (x, y)	2564	return map ? map->region (x, y)
2606	: region::default_region ();	2565	: region::default_region ();
2607	}
2608
2609	const materialtype_t *
2610	object::dominant_material () const
2611	{
2612	if (materialtype_t *mt = name_to_material (materialname))
2613	return mt;
2614
2615	return name_to_material (shstr_unknown);
2616	}	2566	}
2617		2567
2618	void	2568	void
2619	object::open_container (object *new_container)	2569	object::open_container (object *new_container)
2620	{	2570	{
…		…
2642	container = 0;	2592	container = 0;
2643		2593
2644	// client needs item update to make it work, client bug requires this to be separate	2594	// client needs item update to make it work, client bug requires this to be separate
2645	esrv_update_item (UPD_FLAGS, this, old_container);	2595	esrv_update_item (UPD_FLAGS, this, old_container);
2646		2596
2647	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2597	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2648	play_sound (sound_find ("chest_close"));	2598	play_sound (sound_find ("chest_close"));
2649	}	2599	}
2650		2600
2651	if (new_container)	2601	if (new_container)
2652	{	2602	{
…		…
2656	// TODO: this does not seem to serve any purpose anymore?	2606	// TODO: this does not seem to serve any purpose anymore?
2657	#if 0	2607	#if 0
2658	// insert the "Close Container" object.	2608	// insert the "Close Container" object.
2659	if (archetype *closer = new_container->other_arch)	2609	if (archetype *closer = new_container->other_arch)
2660	{	2610	{
2661	object *closer = arch_to_object (new_container->other_arch);	2611	object *closer = new_container->other_arch->instance ();
2662	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2612	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2663	new_container->insert (closer);	2613	new_container->insert (closer);
2664	}	2614	}
2665	#endif	2615	#endif
2666		2616
2667	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2617	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2668		2618
2669	// make sure the container is available, client bug requires this to be separate	2619	// make sure the container is available, client bug requires this to be separate
2670	esrv_send_item (this, new_container);	2620	esrv_send_item (this, new_container);
2671		2621
2672	new_container->flag [FLAG_APPLIED] = true;	2622	new_container->flag [FLAG_APPLIED] = true;
…		…
2680	// else if (!old_container->env && contr && contr->ns)	2630	// else if (!old_container->env && contr && contr->ns)
2681	// contr->ns->floorbox_reset ();	2631	// contr->ns->floorbox_reset ();
2682	}	2632	}
2683		2633
2684	object *	2634	object *
2685	object::force_find (const shstr name)	2635	object::force_find (shstr_tmp name)
2686	{	2636	{
2687	/* cycle through his inventory to look for the MARK we want to	2637	/* cycle through his inventory to look for the MARK we want to
2688	* place	2638	* place
2689	*/	2639	*/
2690	for (object *tmp = inv; tmp; tmp = tmp->below)	2640	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2692	return splay (tmp);	2642	return splay (tmp);
2693		2643
2694	return 0;	2644	return 0;
2695	}	2645	}
2696		2646
		2647	//-GPL
		2648
2697	void	2649	void
		2650	object::force_set_timer (int duration)
		2651	{
		2652	this->duration = 1;
		2653	this->speed_left = -1.f;
		2654
		2655	this->set_speed (duration ? 1.f / duration : 0.f);
		2656	}
		2657
		2658	object *
2698	object::force_add (const shstr name, int duration)	2659	object::force_add (shstr_tmp name, int duration)
2699	{	2660	{
2700	if (object *force = force_find (name))	2661	if (object *force = force_find (name))
2701	force->destroy ();	2662	force->destroy ();
2702		2663
2703	object *force = get_archetype (FORCE_NAME);	2664	object *force = get_archetype (FORCE_NAME);
2704		2665
2705	force->slaying = name;	2666	force->slaying = name;
2706	force->stats.food = 1;	2667	force->force_set_timer (duration);
2707	force->speed_left = -1.f;
2708
2709	force->set_speed (duration ? 1.f / duration : 0.f);
2710	force->flag [FLAG_IS_USED_UP] = true;
2711	force->flag [FLAG_APPLIED] = true;	2668	force->flag [FLAG_APPLIED] = true;
2712		2669
2713	insert (force);	2670	return insert (force);
2714	}	2671	}
2715		2672
2716	void	2673	void
2717	object::play_sound (faceidx sound)	2674	object::play_sound (faceidx sound) const
2718	{	2675	{
2719	if (!sound)	2676	if (!sound)
2720	return;	2677	return;
2721		2678
2722	if (flag [FLAG_REMOVED])	2679	if (is_on_map ())
		2680	map->play_sound (sound, x, y);
		2681	else if (object *pl = in_player ())
		2682	pl->contr->play_sound (sound);
		2683	}
		2684
		2685	void
		2686	object::say_msg (const char *msg) const
		2687	{
		2688	if (is_on_map ())
		2689	map->say_msg (msg, x, y);
		2690	else if (object *pl = in_player ())
		2691	pl->contr->play_sound (sound);
		2692	}
		2693
		2694	void
		2695	object::make_noise ()
		2696	{
		2697	// we do not model noise in the map, so instead put
		2698	// a temporary light into the noise source
		2699	// could use the map instead, but that's less reliable for our
		2700	// goal, which is to make invisibility a bit harder to exploit
		2701
		2702	// currently only works sensibly for players
		2703	if (!is_player ())
2723	return;	2704	return;
2724		2705
2725	if (env)	2706	// find old force, or create new one
2726	{	2707	object *force = force_find (shstr_noise_force);
2727	if (object *pl = in_player ())	2708
2728	pl->contr->play_sound (sound);	2709	if (force)
2729	}	2710	force->speed_left = -1.f; // patch old speed up
2730	else	2711	else
2731	map->play_sound (sound, x, y);	2712	{
2732	}	2713	force = archetype::get (shstr_noise_force);
2733		2714
		2715	force->slaying = shstr_noise_force;
		2716	force->stats.food = 1;
		2717	force->speed_left = -1.f;
		2718
		2719	force->set_speed (1.f / 4.f);
		2720	force->flag [FLAG_IS_USED_UP] = true;
		2721	force->flag [FLAG_APPLIED] = true;
		2722
		2723	insert (force);
		2724	}
		2725	}
		2726
		2727	void object::change_move_type (MoveType mt)
		2728	{
		2729	if (move_type == mt)
		2730	return;
		2731
		2732	if (is_on_map ())
		2733	{
		2734	// we are on the map, so handle move_on/off effects
		2735	remove ();
		2736	move_type = mt;
		2737	map->insert (this, x, y, this);
		2738	}
		2739	else
		2740	move_type = mt;
		2741	}
		2742
		2743	/* object should be a player.
		2744	* we return the object the player has marked with the 'mark' command
		2745	* below. If no match is found (or object has changed), we return
		2746	* NULL. We leave it up to the calling function to print messages if
		2747	* nothing is found.
		2748	*/
		2749	object *
		2750	object::mark () const
		2751	{
		2752	if (contr && contr->mark && contr->mark->env == this)
		2753	return contr->mark;
		2754	else
		2755	return 0;
		2756	}
		2757

Diff Legend

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