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.221 by root, Thu Apr 24 12:06:01 2008 UTC vs.
Revision 1.324 by root, Mon Apr 12 05:22:37 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	bool is_freed = flag [FLAG_FREED];	613	dst->remove ();
612	bool is_removed = flag [FLAG_REMOVED];
613
614	*(object_copy *)this = src;	614	*(object_copy *)dst = *this;
615
616	flag [FLAG_FREED] = is_freed;
617	flag [FLAG_REMOVED] = is_removed;	615	dst->flag [FLAG_REMOVED] = true;
618		616
619	/* Copy over key_values, if any. */	617	/* Copy over key_values, if any. */
620	if (src.key_values)	618	if (key_values)
621	{	619	{
622	key_value *tail = 0;	620	key_value *tail = 0;
623	key_values = 0;	621	dst->key_values = 0;
624		622
625	for (key_value *i = src.key_values; i; i = i->next)	623	for (key_value *i = key_values; i; i = i->next)
626	{	624	{
627	key_value *new_link = new key_value;	625	key_value *new_link = new key_value;
628		626
629	new_link->next = 0;	627	new_link->next = 0;
630	new_link->key = i->key;	628	new_link->key = i->key;
631	new_link->value = i->value;	629	new_link->value = i->value;
632		630
633	/* Try and be clever here, too. */	631	/* Try and be clever here, too. */
634	if (!key_values)	632	if (!dst->key_values)
635	{	633	{
636	key_values = new_link;	634	dst->key_values = new_link;
637	tail = new_link;	635	tail = new_link;
638	}	636	}
639	else	637	else
640	{	638	{
641	tail->next = new_link;	639	tail->next = new_link;
642	tail = new_link;	640	tail = new_link;
643	}	641	}
644	}	642	}
645	}	643	}
646	}
647		644
648	/*	645	dst->activate ();
649	* copy_to first frees everything allocated by the dst object,
650	* and then copies the contents of itself into the second
651	* object, allocating what needs to be allocated. Basically, any
652	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
653	* if the first object is freed, the pointers in the new object
654	* will point at garbage.
655	*/
656	void
657	object::copy_to (object *dst)
658	{
659	*dst = *this;
660
661	if (speed < 0)
662	dst->speed_left -= rndm ();
663
664	dst->set_speed (dst->speed);
665	}	646	}
666		647
667	void	648	void
668	object::instantiate ()	649	object::instantiate ()
669	{	650	{
670	if (!uuid.seq) // HACK	651	if (!uuid.seq) // HACK
671	uuid = UUID::gen ();	652	uuid = UUID::gen ();
672		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
673	speed_left = -0.1f;	658	speed_left = -1.;
		659
674	/* 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
675	* 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.
676	* 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
677	* values for the body_used info, so when items are created	663	* values for the body_used info, so when items are created
678	* for it, they can be properly equipped.	664	* for it, they can be properly equipped.
…		…
686	object *	672	object *
687	object::clone ()	673	object::clone ()
688	{	674	{
689	object *neu = create ();	675	object *neu = create ();
690	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
691	return neu;	683	return neu;
692	}	684	}
693		685
694	/*	686	/*
695	* 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
…		…
697	* 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.
698	*/	690	*/
699	void	691	void
700	update_turn_face (object *op)	692	update_turn_face (object *op)
701	{	693	{
702	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)	694	if (!op->flag [FLAG_IS_TURNABLE] || !op->arch)
703	return;	695	return;
704		696
705	SET_ANIMATION (op, op->direction);	697	SET_ANIMATION (op, op->direction);
706	update_object (op, UP_OBJ_FACE);	698	update_object (op, UP_OBJ_FACE);
707	}	699	}
…		…
712	* 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.
713	*/	705	*/
714	void	706	void
715	object::set_speed (float speed)	707	object::set_speed (float speed)
716	{	708	{
717	if (flag [FLAG_FREED] && speed)
718	{
719	LOG (llevError, "Object %s is freed but has speed.\n", &name);
720	speed = 0;
721	}
722
723	this->speed = speed;	709	this->speed = speed;
724		710
725	if (has_active_speed ())	711	if (has_active_speed ())
726	activate ();	712	activate ();
727	else	713	else
…		…
746	* UP_OBJ_FACE: only the objects face has changed.	732	* UP_OBJ_FACE: only the objects face has changed.
747	*/	733	*/
748	void	734	void
749	update_object (object *op, int action)	735	update_object (object *op, int action)
750	{	736	{
751	if (op == NULL)	737	if (!op)
752	{	738	{
753	/* this should never happen */	739	/* this should never happen */
754	LOG (llevDebug, "update_object() called for NULL object.\n");	740	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
755	return;	741	return;
756	}	742	}
757		743
758	if (op->env)	744	if (!op->is_on_map ())
759	{	745	{
760	/* Animation is currently handled by client, so nothing	746	/* Animation is currently handled by client, so nothing
761	* to do in this case.	747	* to do in this case.
762	*/	748	*/
763	return;	749	return;
764	}	750	}
765
766	/* If the map is saving, don't do anything as everything is
767	* going to get freed anyways.
768	*/
769	if (!op->map || op->map->in_memory == MAP_SAVING)
770	return;
771		751
772	/* make sure the object is within map boundaries */	752	/* make sure the object is within map boundaries */
773	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)	753	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
774	{	754	{
775	LOG (llevError, "update_object() called for object out of map!\n");	755	LOG (llevError, "update_object() called for object out of map!\n");
…		…
783		763
784	if (!(m.flags_ & P_UPTODATE))	764	if (!(m.flags_ & P_UPTODATE))
785	/* nop */;	765	/* nop */;
786	else if (action == UP_OBJ_INSERT)	766	else if (action == UP_OBJ_INSERT)
787	{	767	{
		768	#if 0
788	// this is likely overkill, TODO: revisit (schmorp)	769	// this is likely overkill, TODO: revisit (schmorp)
789	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	770	if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW))
790	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	771	|| (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC))
791	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	772	|| (op->is_player () && !(m.flags_ & P_PLAYER))
792	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	773	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
793	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	774	|| (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE))
794	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	775	|| (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC))
795	|| (m.move_on | op->move_on ) != m.move_on	776	|| (m.move_on | op->move_on ) != m.move_on
796	|| (m.move_off | op->move_off ) != m.move_off	777	|| (m.move_off | op->move_off ) != m.move_off
797	|| (m.move_slow | op->move_slow) != m.move_slow	778	|| (m.move_slow | op->move_slow) != m.move_slow
798	/* 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
799	* to have move_allow right now.	780	* have move_allow right now.
800	*/	781	*/
801	|| ((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
802	|| 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)
803	m.flags_ = 0;	786	m.invalidate ();
		787	#endif
804	}	788	}
805	/* if the object is being removed, we can't make intelligent	789	/* if the object is being removed, we can't make intelligent
806	* decisions, because remove_ob can't really pass the object	790	* decisions, because remove_ob can't really pass the object
807	* that is being removed.	791	* that is being removed.
808	*/	792	*/
809	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	793	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
810	m.flags_ = 0;	794	m.invalidate ();
811	else if (action == UP_OBJ_FACE)	795	else if (action == UP_OBJ_FACE)
812	/* Nothing to do for that case */ ;	796	/* Nothing to do for that case */ ;
813	else	797	else
814	LOG (llevError, "update_object called with invalid action: %d\n", action);	798	LOG (llevError, "update_object called with invalid action: %d\n", action);
815		799
…		…
817	update_object (op->more, action);	801	update_object (op->more, action);
818	}	802	}
819		803
820	object::object ()	804	object::object ()
821	{	805	{
822	SET_FLAG (this, FLAG_REMOVED);	806	this->set_flag (FLAG_REMOVED);
823		807
824	expmul = 1.0;	808	//expmul = 1.0; declared const for the time being
825	face = blank_face;	809	face = blank_face;
		810	material = MATERIAL_NULL;
826	}	811	}
827		812
828	object::~object ()	813	object::~object ()
829	{	814	{
830	unlink ();	815	unlink ();
831		816
832	free_key_values (this);	817	free_key_values (this);
833	}	818	}
834
835	static int object_count;
836		819
837	void object::link ()	820	void object::link ()
838	{	821	{
839	assert (!index);//D	822	assert (!index);//D
840	uuid = UUID::gen ();	823	uuid = UUID::gen ();
841	count = ++object_count;
842		824
843	refcnt_inc ();	825	refcnt_inc ();
844	objects.insert (this);	826	objects.insert (this);
		827
		828	++create_count;
		829
845	}	830	}
846		831
847	void object::unlink ()	832	void object::unlink ()
848	{	833	{
849	if (!index)	834	if (!index)
850	return;	835	return;
		836
		837	++destroy_count;
851		838
852	objects.erase (this);	839	objects.erase (this);
853	refcnt_dec ();	840	refcnt_dec ();
854	}	841	}
855		842
…		…
859	/* If already on active list, don't do anything */	846	/* If already on active list, don't do anything */
860	if (active)	847	if (active)
861	return;	848	return;
862		849
863	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
864	actives.insert (this);	855	actives.insert (this);
		856	}
865	}	857	}
866		858
867	void	859	void
868	object::activate_recursive ()	860	object::activate_recursive ()
869	{	861	{
…		…
930	* drop on that space.	922	* drop on that space.
931	*/	923	*/
932	if (!drop_to_ground	924	if (!drop_to_ground
933	|| !map	925	|| !map
934	|| map->in_memory != MAP_ACTIVE	926	|| map->in_memory != MAP_ACTIVE
935	|| map->nodrop	927	|| map->no_drop
936	|| ms ().move_block == MOVE_ALL)	928	|| ms ().move_block == MOVE_ALL)
937	{	929	{
938	while (inv)	930	while (inv)
939	{
940	inv->destroy_inv (false);
941	inv->destroy ();	931	inv->destroy ();
942	}
943	}	932	}
944	else	933	else
945	{ /* Put objects in inventory onto this space */	934	{ /* Put objects in inventory onto this space */
946	while (inv)	935	while (inv)
947	{	936	{
…		…
951	|| op->flag [FLAG_NO_DROP]	940	|| op->flag [FLAG_NO_DROP]
952	|| op->type == RUNE	941	|| op->type == RUNE
953	|| op->type == TRAP	942	|| op->type == TRAP
954	|| op->flag [FLAG_IS_A_TEMPLATE]	943	|| op->flag [FLAG_IS_A_TEMPLATE]
955	|| op->flag [FLAG_DESTROY_ON_DEATH])	944	|| op->flag [FLAG_DESTROY_ON_DEATH])
956	op->destroy (true);	945	op->destroy ();
957	else	946	else
958	map->insert (op, x, y);	947	map->insert (op, x, y);
959	}	948	}
960	}	949	}
961	}	950	}
962		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 *
963	object *object::create ()	989	object::create ()
964	{	990	{
965	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
966	op->link ();	1013	op->link ();
		1014
967	return op;	1015	return op;
968	}	1016	}
969		1017
970	void	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;
		1031	}
		1032
		1033	static struct freed_map : maptile
		1034	{
		1035	freed_map ()
		1036	{
		1037	path = "<freed objects map>";
		1038	name = "/internal/freed_objects_map";
		1039	width = 3;
		1040	height = 3;
		1041	no_drop = 1;
		1042	no_reset = 1;
		1043
		1044	alloc ();
		1045	in_memory = MAP_ACTIVE;
		1046	}
		1047
		1048	~freed_map ()
		1049	{
		1050	destroy ();
		1051	}
		1052	} freed_map; // freed objects are moved here to avoid crashes
		1053
		1054	void
971	object::do_destroy ()	1055	object::do_destroy ()
972	{	1056	{
973	if (flag [FLAG_IS_LINKED])	1057	if (flag [FLAG_IS_LINKED])
974	remove_button_link (this);	1058	remove_link ();
975		1059
976	if (flag [FLAG_FRIENDLY])	1060	if (flag [FLAG_FRIENDLY])
977	remove_friendly_object (this);	1061	remove_friendly_object (this);
978		1062
979	remove ();	1063	remove ();
…		…
984	unlink ();	1068	unlink ();
985		1069
986	flag [FLAG_FREED] = 1;	1070	flag [FLAG_FREED] = 1;
987		1071
988	// hack to ensure that freed objects still have a valid map	1072	// hack to ensure that freed objects still have a valid map
989	{
990	static maptile *freed_map; // freed objects are moved here to avoid crashes
991
992	if (!freed_map)
993	{
994	freed_map = new maptile;
995
996	freed_map->path = "<freed objects map>";
997	freed_map->name = "/internal/freed_objects_map";
998	freed_map->width = 3;
999	freed_map->height = 3;
1000	freed_map->nodrop = 1;
1001
1002	freed_map->alloc ();
1003	freed_map->in_memory = MAP_ACTIVE;
1004	}
1005
1006	map = freed_map;	1073	map = &freed_map;
1007	x = 1;	1074	x = 1;
1008	y = 1;	1075	y = 1;
1009	}
1010		1076
1011	if (more)	1077	if (more)
1012	{	1078	{
1013	more->destroy ();	1079	more->destroy ();
1014	more = 0;	1080	more = 0;
…		…
1022	attacked_by = 0;	1088	attacked_by = 0;
1023	current_weapon = 0;	1089	current_weapon = 0;
1024	}	1090	}
1025		1091
1026	void	1092	void
1027	object::destroy (bool destroy_inventory)	1093	object::destroy ()
1028	{	1094	{
1029	if (destroyed ())	1095	if (destroyed ())
1030	return;	1096	return;
1031		1097
1032	if (!is_head () && !head->destroyed ())	1098	if (!is_head () && !head->destroyed ())
1033	{	1099	{
1034	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");	1100	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1035	head->destroy (destroy_inventory);	1101	head->destroy ();
		1102	return;
1036	}	1103	}
1037		1104
1038	destroy_inv (!destroy_inventory);	1105	destroy_inv_fast ();
1039		1106
1040	if (is_head ())	1107	if (is_head ())
1041	if (sound_destroy)	1108	if (sound_destroy)
1042	play_sound (sound_destroy);	1109	play_sound (sound_destroy);
1043	else if (flag [FLAG_MONSTER])	1110	else if (flag [FLAG_MONSTER])
…		…
1054	* the previous environment.	1121	* the previous environment.
1055	*/	1122	*/
1056	void	1123	void
1057	object::do_remove ()	1124	object::do_remove ()
1058	{	1125	{
1059	object *tmp, *last = 0;
1060	object *otmp;
1061
1062	if (flag [FLAG_REMOVED])	1126	if (flag [FLAG_REMOVED])
1063	return;	1127	return;
1064		1128
1065	INVOKE_OBJECT (REMOVE, this);	1129	INVOKE_OBJECT (REMOVE, this);
1066		1130
…		…
1080	esrv_del_item (pl->contr, count);	1144	esrv_del_item (pl->contr, count);
1081	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
1082		1146
1083	adjust_weight (env, -total_weight ());	1147	adjust_weight (env, -total_weight ());
1084		1148
1085	*(above ? &above->below : &env->inv) = below;	1149	object *pl = in_player ();
1086
1087	if (below)
1088	below->above = above;
1089		1150
1090	/* we set up values so that it could be inserted into	1151	/* we set up values so that it could be inserted into
1091	* 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
1092	* to the caller to decide what we want to do.	1153	* to the caller to decide what we want to do.
1093	*/	1154	*/
1094	map = env->map;	1155	map = env->map;
1095	x = env->x;	1156	x = env->x;
1096	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
1097	above = 0;	1163	above = 0;
1098	below = 0;	1164	below = 0;
1099	env = 0;	1165	env = 0;
1100		1166
1101	/* NO_FIX_PLAYER is set when a great many changes are being	1167	if (pl && pl->is_player ())
1102	* made to players inventory. If set, avoiding the call
1103	* to save cpu time.
1104	*/	1168	{
1105	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1169	if (expect_false (pl->contr->combat_ob == this))
1106	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	}
1107	}	1188	}
1108	else if (map)	1189	else if (map)
1109	{	1190	{
1110	map->dirty = true;	1191	map->dirty = true;
1111	mapspace &ms = this->ms ();	1192	mapspace &ms = this->ms ();
1112		1193
1113	if (object *pl = ms.player ())	1194	if (object *pl = ms.player ())
1114	{	1195	{
1115	if (type == PLAYER) // this == pl(!)	1196	if (is_player ())
1116	{	1197	{
		1198	if (!flag [FLAG_WIZPASS])
		1199	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1200
1117	// leaving a spot always closes any open container on the ground	1201	// leaving a spot always closes any open container on the ground
1118	if (container && !container->env)	1202	if (container && !container->env)
1119	// this causes spurious floorbox updates, but it ensures	1203	// this causes spurious floorbox updates, but it ensures
1120	// that the CLOSE event is being sent.	1204	// that the CLOSE event is being sent.
1121	close_container ();	1205	close_container ();
1122		1206
1123	--map->players;	1207	--map->players;
1124	map->touch ();	1208	map->touch ();
1125	}	1209	}
1126	else if (pl->container == this)	1210	else if (pl->container_ () == this)
1127	{	1211	{
1128	// removing a container should close it	1212	// removing a container should close it
1129	close_container ();	1213	close_container ();
1130	}	1214	}
1131		1215	else
1132	esrv_del_item (pl->contr, count);	1216	esrv_del_item (pl->contr, count);
1133	}	1217	}
1134		1218
1135	/* link the object above us */	1219	/* link the object above us */
1136	if (above)	1220	// re-link, make sure compiler can easily use cmove
1137	above->below = below;	1221	*(above ? &above->below : &ms.top) = below;
1138	else	1222	*(below ? &below->above : &ms.bot) = above;
1139	ms.top = below; /* we were top, set new top */
1140
1141	/* Relink the object below us, if there is one */
1142	if (below)
1143	below->above = above;
1144	else
1145	{
1146	/* Nothing below, which means we need to relink map object for this space
1147	* use translated coordinates in case some oddness with map tiling is
1148	* evident
1149	*/
1150	if (GET_MAP_OB (map, x, y) != this)
1151	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 ());
1152
1153	ms.bot = above; /* goes on above it. */
1154	}
1155		1223
1156	above = 0;	1224	above = 0;
1157	below = 0;	1225	below = 0;
1158		1226
		1227	ms.invalidate ();
		1228
1159	if (map->in_memory == MAP_SAVING)	1229	if (map->in_memory == MAP_SAVING)
1160	return;	1230	return;
1161		1231
1162	int check_walk_off = !flag [FLAG_NO_APPLY];	1232	int check_walk_off = !flag [FLAG_NO_APPLY];
1163		1233
1164	if (object *pl = ms.player ())	1234	if (object *pl = ms.player ())
1165	{	1235	{
1166	if (pl->container == this)	1236	if (pl->container_ () == this)
1167	/* If a container that the player is currently using somehow gets	1237	/* If a container that the player is currently using somehow gets
1168	* removed (most likely destroyed), update the player view	1238	* removed (most likely destroyed), update the player view
1169	* appropriately.	1239	* appropriately.
1170	*/	1240	*/
1171	pl->close_container ();	1241	pl->close_container ();
1172		1242
1173	//TODO: the floorbox prev/next might need updating	1243	//TODO: the floorbox prev/next might need updating
1174	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 ();
1175	}	1248	}
1176		1249
		1250	if (check_walk_off)
1177	for (tmp = ms.bot; tmp; tmp = tmp->above)	1251	for (object *above, *tmp = ms.bot; tmp; tmp = above)
1178	{	1252	{
		1253	above = tmp->above;
		1254
1179	/* 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
1180	* being removed.	1256	* being removed.
1181	*/	1257	*/
1182		1258
1183	/* See if object moving off should effect something */	1259	/* See if object moving off should effect something */
1184	if (check_walk_off
1185	&& ((move_type & tmp->move_off)	1260	if ((move_type & tmp->move_off)
1186	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1261	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1187	{
1188	move_apply (tmp, this, 0);	1262	move_apply (tmp, this, 0);
1189
1190	if (destroyed ())
1191	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1192	}	1263	}
1193		1264
1194	last = tmp;	1265	if (affects_los ())
1195	}
1196
1197	/* last == NULL if there are no objects on this space */
1198	//TODO: this makes little sense, why only update the topmost object?
1199	if (!last)
1200	map->at (x, y).flags_ = 0;
1201	else
1202	update_object (last, UP_OBJ_REMOVE);
1203
1204	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1205	update_all_los (map, x, y);	1266	update_all_los (map, x, y);
1206	}	1267	}
1207	}	1268	}
1208		1269
1209	/*	1270	/*
…		…
1233	esrv_update_item (UPD_NROF, pl, top);	1294	esrv_update_item (UPD_NROF, pl, top);
1234		1295
1235	op->weight = 0; // cancel the addition above	1296	op->weight = 0; // cancel the addition above
1236	op->carrying = 0; // must be 0 already	1297	op->carrying = 0; // must be 0 already
1237		1298
1238	op->destroy (1);	1299	op->destroy ();
1239		1300
1240	return top;	1301	return top;
1241	}	1302	}
1242		1303
1243	return 0;	1304	return 0;
…		…
1251		1312
1252	object *prev = this;	1313	object *prev = this;
1253		1314
1254	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)	1315	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1255	{	1316	{
1256	object *op = arch_to_object (at);	1317	object *op = at->instance ();
1257		1318
1258	op->name = name;	1319	op->name = name;
1259	op->name_pl = name_pl;	1320	op->name_pl = name_pl;
1260	op->title = title;	1321	op->title = title;
1261		1322
…		…
1271	* job preparing multi-part monsters.	1332	* job preparing multi-part monsters.
1272	*/	1333	*/
1273	object *	1334	object *
1274	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)
1275	{	1336	{
		1337	op->remove ();
		1338
1276	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1339	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1277	{	1340	{
1278	tmp->x = x + tmp->arch->x;	1341	tmp->x = x + tmp->arch->x;
1279	tmp->y = y + tmp->arch->y;	1342	tmp->y = y + tmp->arch->y;
1280	}	1343	}
…		…
1297	* 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
1298	* to be set if special handling is needed.	1361	* to be set if special handling is needed.
1299	*	1362	*
1300	* Return value:	1363	* Return value:
1301	* new object if 'op' was merged with other object	1364	* new object if 'op' was merged with other object
1302	* NULL if 'op' was destroyed	1365	* NULL if there was an error (destroyed, blocked etc.)
1303	* just 'op' otherwise	1366	* just 'op' otherwise
1304	*/	1367	*/
1305	object *	1368	object *
1306	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)
1307	{	1370	{
1308	assert (!op->flag [FLAG_FREED]);
1309
1310	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
1311		1377
1312	/* Ideally, the caller figures this out. However, it complicates a lot	1378	/* Ideally, the caller figures this out. However, it complicates a lot
1313	* 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
1314	* need extra work	1380	* need extra work
1315	*/	1381	*/
		1382	maptile *newmap = m;
1316	if (!xy_normalise (m, op->x, op->y))	1383	if (!xy_normalise (newmap, op->x, op->y))
1317	{	1384	{
1318	op->destroy (1);	1385	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1319	return 0;	1386	return 0;
1320	}	1387	}
1321		1388
1322	if (object *more = op->more)	1389	if (object *more = op->more)
1323	if (!insert_ob_in_map (more, m, originator, flag))	1390	if (!insert_ob_in_map (more, m, originator, flag))
1324	return 0;	1391	return 0;
1325		1392
1326	CLEAR_FLAG (op, FLAG_REMOVED);	1393	op->flag [FLAG_REMOVED] = false;
1327		1394	op->env = 0;
1328	op->map = m;	1395	op->map = newmap;
		1396
1329	mapspace &ms = op->ms ();	1397	mapspace &ms = op->ms ();
1330		1398
1331	/* this has to be done after we translate the coordinates.	1399	/* this has to be done after we translate the coordinates.
1332	*/	1400	*/
1333	if (op->nrof && !(flag & INS_NO_MERGE))	1401	if (op->nrof && !(flag & INS_NO_MERGE))
1334	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1402	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1335	if (object::can_merge (op, tmp))	1403	if (object::can_merge (op, tmp))
1336	{	1404	{
1337	// TODO: we atcually want to update tmp, not op,	1405	// TODO: we actually want to update tmp, not op,
1338	// but some caller surely breaks when we return tmp	1406	// but some caller surely breaks when we return tmp
1339	// from here :/	1407	// from here :/
1340	op->nrof += tmp->nrof;	1408	op->nrof += tmp->nrof;
1341	tmp->destroy (1);	1409	tmp->destroy ();
1342	}	1410	}
1343		1411
1344	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 */
1345	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1413	op->clr_flag (FLAG_INV_LOCKED);
1346		1414
1347	if (!QUERY_FLAG (op, FLAG_ALIVE))	1415	if (!op->flag [FLAG_ALIVE])
1348	CLEAR_FLAG (op, FLAG_NO_STEAL);	1416	op->clr_flag (FLAG_NO_STEAL);
1349		1417
1350	if (flag & INS_BELOW_ORIGINATOR)	1418	if (flag & INS_BELOW_ORIGINATOR)
1351	{	1419	{
1352	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)
1353	{	1421	{
1354	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");
1355	abort ();	1423	abort ();
1356	}	1424	}
1357		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
1358	op->above = originator;	1433	op->above = originator;
1359	op->below = originator->below;	1434	op->below = originator->below;
1360
1361	if (op->below)
1362	op->below->above = op;
1363	else
1364	ms.bot = op;
1365
1366	/* since *below* originator, no need to update top */
1367	originator->below = op;	1435	originator->below = op;
		1436
		1437	*(op->below ? &op->below->above : &ms.bot) = op;
1368	}	1438	}
1369	else	1439	else
1370	{	1440	{
1371	object *top, *floor = NULL;	1441	object *floor = 0;
1372		1442	object *top = ms.top;
1373	top = ms.bot;
1374		1443
1375	/* If there are other objects, then */	1444	/* If there are other objects, then */
1376	if (top)	1445	if (top)
1377	{	1446	{
1378	object *last = 0;
1379
1380	/*	1447	/*
1381	* 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.
1382	* We've already dealt with merging if appropriate.	1449	* We've already dealt with merging if appropriate.
1383	* 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
1384	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1451	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1387	* 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
1388	* 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
1389	* 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
1390	* that flying non pickable objects are spell objects.	1457	* that flying non pickable objects are spell objects.
1391	*/	1458	*/
1392	for (top = ms.bot; top; top = top->above)	1459	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1393	{	1460	{
1394	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])
1395	floor = top;	1462	floor = tmp;
1396		1463
1397	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])
1398	{	1465	{
1399	/* We insert above top, so we want this object below this */	1466	/* We insert above top, so we want this object below this */
1400	top = top->below;	1467	top = tmp->below;
1401	break;	1468	break;
1402	}	1469	}
1403		1470
1404	last = top;	1471	top = tmp;
1405	}	1472	}
1406
1407	/* Don't want top to be NULL, so set it to the last valid object */
1408	top = last;
1409		1473
1410	/* We let update_position deal with figuring out what the space	1474	/* We let update_position deal with figuring out what the space
1411	* looks like instead of lots of conditions here.	1475	* looks like instead of lots of conditions here.
1412	* makes things faster, and effectively the same result.	1476	* makes things faster, and effectively the same result.
1413	*/	1477	*/
…		…
1420	*/	1484	*/
1421	if (!(flag & INS_ON_TOP)	1485	if (!(flag & INS_ON_TOP)
1422	&& ms.flags () & P_BLOCKSVIEW	1486	&& ms.flags () & P_BLOCKSVIEW
1423	&& (op->face && !faces [op->face].visibility))	1487	&& (op->face && !faces [op->face].visibility))
1424	{	1488	{
		1489	object *last;
		1490
1425	for (last = top; last != floor; last = last->below)	1491	for (last = top; last != floor; last = last->below)
1426	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1492	if (last->flag [FLAG_BLOCKSVIEW] && (last->type != EXIT))
1427	break;	1493	break;
1428		1494
1429	/* Check to see if we found the object that blocks view,	1495	/* Check to see if we found the object that blocks view,
1430	* 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
1431	* we can get inserted below this one, which requires we	1497	* we can get inserted below this one, which requires we
…		…
1437	} /* If objects on this space */	1503	} /* If objects on this space */
1438		1504
1439	if (flag & INS_ABOVE_FLOOR_ONLY)	1505	if (flag & INS_ABOVE_FLOOR_ONLY)
1440	top = floor;	1506	top = floor;
1441		1507
1442	/* 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
1443	*/
1444
1445	/* First object on this space */
1446	if (!top)	1509	if (!top)
1447	{	1510	{
		1511	op->below = 0;
1448	op->above = ms.bot;	1512	op->above = ms.bot;
1449
1450	if (op->above)
1451	op->above->below = op;
1452
1453	op->below = 0;
1454	ms.bot = op;	1513	ms.bot = op;
		1514
		1515	*(op->above ? &op->above->below : &ms.top) = op;
1455	}	1516	}
1456	else	1517	else
1457	{ /* get inserted into the stack above top */	1518	{
1458	op->above = top->above;	1519	op->above = top->above;
1459
1460	if (op->above)
1461	op->above->below = op;	1520	top->above = op;
1462		1521
1463	op->below = top;	1522	op->below = top;
1464	top->above = op;	1523	*(op->above ? &op->above->below : &ms.top) = op;
1465	}	1524	}
		1525	}
1466		1526
1467	if (!op->above)	1527	if (op->is_player ())
1468	ms.top = op;
1469	} /* else not INS_BELOW_ORIGINATOR */
1470
1471	if (op->type == PLAYER)
1472	{	1528	{
1473	op->contr->do_los = 1;	1529	op->contr->do_los = 1;
1474	++op->map->players;	1530	++op->map->players;
1475	op->map->touch ();	1531	op->map->touch ();
1476	}	1532	}
1477		1533
1478	op->map->dirty = true;	1534	op->map->dirty = true;
1479		1535
1480	if (object *pl = ms.player ())	1536	if (object *pl = ms.player ())
1481	//TODO: the floorbox prev/next might need updating	1537	//TODO: the floorbox prev/next might need updating
1482	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 ();
1483		1542
1484	/* If this object glows, it may affect lighting conditions that are	1543	/* If this object glows, it may affect lighting conditions that are
1485	* 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
1486	* 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
1487	* on the map will get recalculated. The players could very well	1546	* on the map will get recalculated. The players could very well
1488	* 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 -
1489	* this should get redone to only look for players within range,	1548	* this should get redone to only look for players within range,
1490	* or just updating the P_UPTODATE for spaces within this area	1549	* or just updating the P_UPTODATE for spaces within this area
1491	* of effect may be sufficient.	1550	* of effect may be sufficient.
1492	*/	1551	*/
1493	if (op->map->darkness && (op->glow_radius != 0))	1552	if (op->affects_los ())
		1553	{
		1554	op->ms ().invalidate ();
1494	update_all_los (op->map, op->x, op->y);	1555	update_all_los (op->map, op->x, op->y);
		1556	}
1495		1557
1496	/* updates flags (blocked, alive, no magic, etc) for this map space */	1558	/* updates flags (blocked, alive, no magic, etc) for this map space */
1497	update_object (op, UP_OBJ_INSERT);	1559	update_object (op, UP_OBJ_INSERT);
1498		1560
1499	INVOKE_OBJECT (INSERT, op);	1561	INVOKE_OBJECT (INSERT, op);
…		…
1506	* blocked() and wall() work properly), and these flags are updated by	1568	* blocked() and wall() work properly), and these flags are updated by
1507	* update_object().	1569	* update_object().
1508	*/	1570	*/
1509		1571
1510	/* 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 */
1511	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1573	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1512	{	1574	{
1513	if (check_move_on (op, originator))	1575	if (check_move_on (op, originator))
1514	return 0;	1576	return 0;
1515		1577
1516	/* 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
…		…
1527	/* this function inserts an object in the map, but if it	1589	/* this function inserts an object in the map, but if it
1528	* 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.
1529	* 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.
1530	*/	1592	*/
1531	void	1593	void
1532	replace_insert_ob_in_map (const char *arch_string, object *op)	1594	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1533	{	1595	{
1534	/* first search for itself and remove any old instances */	1596	/* first search for itself and remove any old instances */
1535		1597
1536	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1598	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1537	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1599	if (tmp->arch->archname == archname) /* same archetype */
1538	tmp->destroy (1);	1600	tmp->destroy ();
1539		1601
1540	object *tmp = arch_to_object (archetype::find (arch_string));	1602	object *tmp = archetype::find (archname)->instance ();
1541		1603
1542	tmp->x = op->x;	1604	tmp->x = op->x;
1543	tmp->y = op->y;	1605	tmp->y = op->y;
1544		1606
1545	insert_ob_in_map (tmp, op->map, op, 0);	1607	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1550	{	1612	{
1551	if (where->env)	1613	if (where->env)
1552	return where->env->insert (this);	1614	return where->env->insert (this);
1553	else	1615	else
1554	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;
1555	}	1639	}
1556		1640
1557	/*	1641	/*
1558	* decrease(object, number) decreases a specified number from	1642	* decrease(object, number) decreases a specified number from
1559	* 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
…		…
1567	if (!nr)	1651	if (!nr)
1568	return true;	1652	return true;
1569		1653
1570	nr = min (nr, nrof);	1654	nr = min (nr, nrof);
1571		1655
		1656	if (nrof > nr)
		1657	{
1572	nrof -= nr;	1658	nrof -= nr;
1573
1574	if (nrof)
1575	{
1576	adjust_weight (env, -weight * nr); // carrying == 0	1659	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1577		1660
1578	if (object *pl = visible_to ())	1661	if (object *pl = visible_to ())
1579	esrv_update_item (UPD_NROF, pl, this);	1662	esrv_update_item (UPD_NROF, pl, this);
1580		1663
1581	return true;	1664	return true;
1582	}	1665	}
1583	else	1666	else
1584	{	1667	{
1585	destroy (1);	1668	destroy ();
1586	return false;	1669	return false;
1587	}	1670	}
1588	}	1671	}
1589		1672
1590	/*	1673	/*
…		…
1607	}	1690	}
1608	else	1691	else
1609	{	1692	{
1610	decrease (nr);	1693	decrease (nr);
1611		1694
1612	object *op = object_create_clone (this);	1695	object *op = deep_clone ();
1613	op->nrof = nr;	1696	op->nrof = nr;
1614	return op;	1697	return op;
1615	}	1698	}
1616	}	1699	}
1617		1700
…		…
1667	if (object *pl = tmp->visible_to ())	1750	if (object *pl = tmp->visible_to ())
1668	esrv_update_item (UPD_NROF, pl, tmp);	1751	esrv_update_item (UPD_NROF, pl, tmp);
1669		1752
1670	adjust_weight (this, op->total_weight ());	1753	adjust_weight (this, op->total_weight ());
1671		1754
1672	op->destroy (1);	1755	op->destroy ();
1673	op = tmp;	1756	op = tmp;
1674	goto inserted;	1757	goto inserted;
1675	}	1758	}
1676		1759
1677	op->owner = 0; // it's his/hers now. period.	1760	op->owner = 0; // it's his/hers now. period.
…		…
1695		1778
1696	adjust_weight (this, op->total_weight ());	1779	adjust_weight (this, op->total_weight ());
1697		1780
1698	inserted:	1781	inserted:
1699	/* 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 */
1700	if (op->glow_radius && map && map->darkness)	1783	if (op->glow_radius && is_on_map ())
		1784	{
		1785	update_stats ();
1701	update_all_los (map, x, y);	1786	update_all_los (map, x, y);
1702		1787	}
		1788	else if (is_player ())
1703	// if this is a player's inventory, update stats	1789	// if this is a player's inventory, update stats
1704	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])	1790	contr->queue_stats_update ();
1705	update_stats ();
1706		1791
1707	INVOKE_OBJECT (INSERT, this);	1792	INVOKE_OBJECT (INSERT, this);
1708		1793
1709	return op;	1794	return op;
1710	}	1795	}
…		…
1730	* on top.	1815	* on top.
1731	*/	1816	*/
1732	int	1817	int
1733	check_move_on (object *op, object *originator)	1818	check_move_on (object *op, object *originator)
1734	{	1819	{
		1820	if (op->flag [FLAG_NO_APPLY])
		1821	return 0;
		1822
1735	object *tmp;	1823	object *tmp;
1736	maptile *m = op->map;	1824	maptile *m = op->map;
1737	int x = op->x, y = op->y;	1825	int x = op->x, y = op->y;
1738		1826
1739	MoveType move_on, move_slow, move_block;	1827	mapspace &ms = m->at (x, y);
1740		1828
1741	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1829	ms.update ();
1742	return 0;
1743		1830
1744	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1831	MoveType move_on = ms.move_on;
1745	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1832	MoveType move_slow = ms.move_slow;
1746	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1833	MoveType move_block = ms.move_block;
1747		1834
1748	/* 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,
1749	* 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
1750	* 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
1751	* as walking.	1838	* as walking.
…		…
1762	return 0;	1849	return 0;
1763		1850
1764	/* The objects have to be checked from top to bottom.	1851	/* The objects have to be checked from top to bottom.
1765	* Hence, we first go to the top:	1852	* Hence, we first go to the top:
1766	*/	1853	*/
1767		1854	for (object *next, *tmp = ms.top; tmp; tmp = next)
1768	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1769	{
1770	/* Trim the search when we find the first other spell effect
1771	* this helps performance so that if a space has 50 spell objects,
1772	* we don't need to check all of them.
1773	*/
1774	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1775	break;
1776	}	1855	{
		1856	next = tmp->below;
1777		1857
1778	for (; tmp; tmp = tmp->below)
1779	{
1780	if (tmp == op)	1858	if (tmp == op)
1781	continue; /* Can't apply yourself */	1859	continue; /* Can't apply yourself */
1782		1860
1783	/* 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.
1784	* Second check makes sure that the movement types not being slowed	1862	* Second check makes sure that the movement types not being slowed
1785	* (~slow_move) is not blocked on this space - just because the	1863	* (~slow_move) is not blocked on this space - just because the
1786	* 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
1787	* 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.
1788	*/	1866	*/
1789	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1867	if (!op->flag [FLAG_WIZPASS])
1790	{	1868	{
1791	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1869	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1792	((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))
1793	{	1871	{
1794
1795	float
1796	diff = tmp->move_slow_penalty * fabs (op->speed);	1872	float diff = tmp->move_slow_penalty * fabs (op->speed);
1797		1873
1798	if (op->type == PLAYER)	1874	if (op->is_player ())
1799	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)) ||
1800	(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)))
1801	diff /= 4.0;	1877	diff /= 4.0;
1802		1878
1803	op->speed_left -= diff;	1879	op->speed_left -= diff;
1804	}	1880	}
1805	}	1881	}
…		…
1838	LOG (llevError, "Present_arch called outside map.\n");	1914	LOG (llevError, "Present_arch called outside map.\n");
1839	return NULL;	1915	return NULL;
1840	}	1916	}
1841		1917
1842	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)
1843	if (tmp->arch == at)	1919	if (tmp->arch->archname == at->archname)
1844	return tmp;	1920	return tmp;
1845		1921
1846	return NULL;	1922	return NULL;
1847	}	1923	}
1848		1924
…		…
1912	* The first matching object is returned, or NULL if none.	1988	* The first matching object is returned, or NULL if none.
1913	*/	1989	*/
1914	object *	1990	object *
1915	present_arch_in_ob (const archetype *at, const object *op)	1991	present_arch_in_ob (const archetype *at, const object *op)
1916	{	1992	{
1917	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1993	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1918	if (tmp->arch == at)	1994	if (tmp->arch->archname == at->archname)
1919	return tmp;	1995	return tmp;
1920		1996
1921	return NULL;	1997	return NULL;
1922	}	1998	}
1923		1999
…		…
1927	void	2003	void
1928	flag_inv (object *op, int flag)	2004	flag_inv (object *op, int flag)
1929	{	2005	{
1930	for (object *tmp = op->inv; tmp; tmp = tmp->below)	2006	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1931	{	2007	{
1932	SET_FLAG (tmp, flag);	2008	tmp->set_flag (flag);
1933	flag_inv (tmp, flag);	2009	flag_inv (tmp, flag);
1934	}	2010	}
1935	}	2011	}
1936		2012
1937	/*	2013	/*
…		…
1940	void	2016	void
1941	unflag_inv (object *op, int flag)	2017	unflag_inv (object *op, int flag)
1942	{	2018	{
1943	for (object *tmp = op->inv; tmp; tmp = tmp->below)	2019	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1944	{	2020	{
1945	CLEAR_FLAG (tmp, flag);	2021	tmp->clr_flag (flag);
1946	unflag_inv (tmp, flag);	2022	unflag_inv (tmp, flag);
1947	}	2023	}
1948	}	2024	}
1949		2025
1950	/*	2026	/*
…		…
2011	* head of the object should correspond for the entire object.	2087	* head of the object should correspond for the entire object.
2012	*/	2088	*/
2013	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	2089	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
2014	continue;	2090	continue;
2015		2091
2016	if (ob->blocked (m, pos.x, pos.y))	2092	if (ob->blocked (pos.m, pos.x, pos.y))
2017	continue;	2093	continue;
2018		2094
2019	altern [index++] = i;	2095	altern [index++] = i;
2020	}	2096	}
2021		2097
…		…
2089	* there is capable of.	2165	* there is capable of.
2090	*/	2166	*/
2091	int	2167	int
2092	find_dir (maptile *m, int x, int y, object *exclude)	2168	find_dir (maptile *m, int x, int y, object *exclude)
2093	{	2169	{
2094	int i, max = SIZEOFFREE, mflags;	2170	int max = SIZEOFFREE, mflags;
2095
2096	sint16 nx, ny;
2097	object *tmp;
2098	maptile *mp;
2099
2100	MoveType blocked, move_type;	2171	MoveType move_type;
2101		2172
2102	if (exclude && exclude->head_ () != exclude)	2173	if (exclude && exclude->head_ () != exclude)
2103	{	2174	{
2104	exclude = exclude->head;	2175	exclude = exclude->head;
2105	move_type = exclude->move_type;	2176	move_type = exclude->move_type;
…		…
2108	{	2179	{
2109	/* 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. */
2110	move_type = MOVE_ALL;	2181	move_type = MOVE_ALL;
2111	}	2182	}
2112		2183
2113	for (i = 1; i < max; i++)	2184	for (int i = 1; i < max; i++)
2114	{	2185	{
2115	mp = m;	2186	mapxy pos (m, x, y);
2116	nx = x + freearr_x[i];	2187	pos.move (i);
2117	ny = y + freearr_y[i];
2118		2188
2119	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2189	if (!pos.normalise ())
2120
2121	if (mflags & P_OUT_OF_MAP)
2122	max = maxfree[i];	2190	max = maxfree[i];
2123	else	2191	else
2124	{	2192	{
2125	mapspace &ms = mp->at (nx, ny);	2193	mapspace &ms = *pos;
2126		2194
2127	blocked = ms.move_block;
2128
2129	if ((move_type & blocked) == move_type)	2195	if ((move_type & ms.move_block) == move_type)
2130	max = maxfree[i];	2196	max = maxfree [i];
2131	else if (mflags & P_IS_ALIVE)	2197	else if (ms.flags () & P_IS_ALIVE)
2132	{	2198	{
2133	for (tmp = ms.bot; tmp; tmp = tmp->above)	2199	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2134	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2200	if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2135	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2201	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2136	break;
2137
2138	if (tmp)
2139	return freedir[i];	2202	return freedir [i];
2140	}	2203	}
2141	}	2204	}
2142	}	2205	}
2143		2206
2144	return 0;	2207	return 0;
…		…
2219	* 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
2220	* 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.
2221	* 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
2222	* functions.	2285	* functions.
2223	*/	2286	*/
2224	int reduction_dir[SIZEOFFREE][3] = {	2287	static const int reduction_dir[SIZEOFFREE][3] = {
2225	{0, 0, 0}, /* 0 */	2288	{0, 0, 0}, /* 0 */
2226	{0, 0, 0}, /* 1 */	2289	{0, 0, 0}, /* 1 */
2227	{0, 0, 0}, /* 2 */	2290	{0, 0, 0}, /* 2 */
2228	{0, 0, 0}, /* 3 */	2291	{0, 0, 0}, /* 3 */
2229	{0, 0, 0}, /* 4 */	2292	{0, 0, 0}, /* 4 */
…		…
2323	* 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)
2324	*/	2387	*/
2325	int	2388	int
2326	can_pick (const object *who, const object *item)	2389	can_pick (const object *who, const object *item)
2327	{	2390	{
2328	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2391	return /*who->flag [FLAG_WIZ]|| */
2329	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2392	(item->weight > 0 && !item->flag [FLAG_NO_PICK] &&
2330	!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));
2331	}	2394	}
2332		2395
2333	/*	2396	/*
2334	* create clone from object to another	2397	* create clone from object to another
2335	*/	2398	*/
2336	object *	2399	object *
2337	object_create_clone (object *asrc)	2400	object::deep_clone ()
2338	{	2401	{
2339	object *dst = 0, *tmp, *src, *prev, *item;	2402	assert (("deep_clone called on non-head object", is_head ()));
2340		2403
2341	if (!asrc)	2404	object *dst = clone ();
2342	return 0;
2343		2405
2344	src = asrc->head_ ();	2406	object *prev = dst;
2345
2346	prev = 0;
2347	for (object *part = src; part; part = part->more)	2407	for (object *part = this->more; part; part = part->more)
2348	{	2408	{
2349	tmp = part->clone ();	2409	object *tmp = part->clone ();
2350	tmp->x -= src->x;
2351	tmp->y -= src->y;
2352
2353	if (!part->head)
2354	{
2355	dst = tmp;
2356	tmp->head = 0;
2357	}
2358	else
2359	tmp->head = dst;	2410	tmp->head = dst;
2360
2361	tmp->more = 0;
2362
2363	if (prev)
2364	prev->more = tmp;	2411	prev->more = tmp;
2365
2366	prev = tmp;	2412	prev = tmp;
2367	}	2413	}
2368		2414
2369	for (item = src->inv; item; item = item->below)	2415	for (object *item = inv; item; item = item->below)
2370	insert_ob_in_ob (object_create_clone (item), dst);	2416	insert_ob_in_ob (item->deep_clone (), dst);
2371		2417
2372	return dst;	2418	return dst;
2373	}	2419	}
2374		2420
2375	/* This returns the first object in who's inventory that	2421	/* This returns the first object in who's inventory that
…		…
2384	return tmp;	2430	return tmp;
2385		2431
2386	return 0;	2432	return 0;
2387	}	2433	}
2388		2434
2389	/* If ob has a field named key, return the link from the list,	2435	shstr_tmp
2390	* otherwise return NULL.	2436	object::kv_get (shstr_tmp key) const
2391	*
2392	* key must be a passed in shared string - otherwise, this won't
2393	* do the desired thing.
2394	*/
2395	key_value *
2396	get_ob_key_link (const object *ob, const char *key)
2397	{	2437	{
2398	for (key_value *link = ob->key_values; link; link = link->next)	2438	for (key_value *kv = key_values; kv; kv = kv->next)
2399	if (link->key == key)	2439	if (kv->key == key)
2400	return link;
2401
2402	return 0;
2403	}
2404
2405	/*
2406	* Returns the value of op has an extra_field for key, or NULL.
2407	*
2408	* The argument doesn't need to be a shared string.
2409	*
2410	* The returned string is shared.
2411	*/
2412	const char *
2413	get_ob_key_value (const object *op, const char *const key)
2414	{
2415	key_value *link;
2416	shstr_cmp canonical_key (key);
2417
2418	if (!canonical_key)
2419	{
2420	/* 1. There being a field named key on any object
2421	* implies there'd be a shared string to find.
2422	* 2. Since there isn't, no object has this field.
2423	* 3. Therefore, *this* object doesn't have this field.
2424	*/
2425	return 0;
2426	}
2427
2428	/* This is copied from get_ob_key_link() above -
2429	* only 4 lines, and saves the function call overhead.
2430	*/
2431	for (link = op->key_values; link; link = link->next)
2432	if (link->key == canonical_key)
2433	return link->value;	2440	return kv->value;
2434		2441
2435	return 0;	2442	return shstr ();
2436	}	2443	}
2437		2444
2438	/*	2445	void
2439	* Updates the canonical_key in op to value.	2446	object::kv_set (shstr_tmp key, shstr_tmp value)
2440	*
2441	* canonical_key is a shared string (value doesn't have to be).
2442	*
2443	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2444	* keys.
2445	*
2446	* Returns TRUE on success.
2447	*/
2448	int
2449	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2450	{	2447	{
2451	key_value *field = NULL, *last = NULL;	2448	for (key_value *kv = key_values; kv; kv = kv->next)
2452		2449	if (kv->key == key)
2453	for (field = op->key_values; field != NULL; field = field->next)
2454	{
2455	if (field->key != canonical_key)
2456	{	2450	{
2457	last = field;	2451	kv->value = value;
2458	continue;	2452	return;
2459	}	2453	}
2460		2454
2461	if (value)	2455	key_value *kv = new key_value;
2462	field->value = value;	2456
2463	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)
2464	{	2469	{
2465	/* Basically, if the archetype has this key set,	2470	key_value *kv = *kvp;
2466	* we need to store the null value so when we save	2471	*kvp = (*kvp)->next;
2467	* it, we save the empty value so that when we load,	2472	delete kv;
2468	* we get this value back again.	2473	return;
2469	*/
2470	if (get_ob_key_link (op->arch, canonical_key))
2471	field->value = 0;
2472	else
2473	{
2474	if (last)
2475	last->next = field->next;
2476	else
2477	op->key_values = field->next;
2478
2479	delete field;
2480	}
2481	}	2474	}
2482	return TRUE;
2483	}
2484	/* IF we get here, key doesn't exist */
2485
2486	/* No field, we'll have to add it. */
2487
2488	if (!add_key)
2489	return FALSE;
2490
2491	/* There isn't any good reason to store a null
2492	* value in the key/value list. If the archetype has
2493	* this key, then we should also have it, so shouldn't
2494	* be here. If user wants to store empty strings,
2495	* should pass in ""
2496	*/
2497	if (value == NULL)
2498	return TRUE;
2499
2500	field = new key_value;
2501
2502	field->key = canonical_key;
2503	field->value = value;
2504	/* Usual prepend-addition. */
2505	field->next = op->key_values;
2506	op->key_values = field;
2507
2508	return TRUE;
2509	}
2510
2511	/*
2512	* Updates the key in op to value.
2513	*
2514	* If add_key is FALSE, this will only update existing keys,
2515	* and not add new ones.
2516	* In general, should be little reason FALSE is ever passed in for add_key
2517	*
2518	* Returns TRUE on success.
2519	*/
2520	int
2521	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2522	{
2523	shstr key_ (key);
2524
2525	return set_ob_key_value_s (op, key_, value, add_key);
2526	}	2475	}
2527		2476
2528	object::depth_iterator::depth_iterator (object *container)	2477	object::depth_iterator::depth_iterator (object *container)
2529	: iterator_base (container)	2478	: iterator_base (container)
2530	{	2479	{
…		…
2580	{	2529	{
2581	char flagdesc[512];	2530	char flagdesc[512];
2582	char info2[256 * 4];	2531	char info2[256 * 4];
2583	char *p = info;	2532	char *p = info;
2584		2533
2585	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}",
2586	count,	2535	count,
2587	uuid.c_str (),	2536	uuid.c_str (),
2588	&name,	2537	&name,
2589	title ? "\",title:\"" : "",	2538	title ? ",title:\"" : "",
2590	title ? (const char *)title : "",	2539	title ? (const char *)title : "",
		2540	title ? "\"" : "",
2591	flag_desc (flagdesc, 512), type);	2541	flag_desc (flagdesc, 512), type);
2592		2542
2593	if (!flag[FLAG_REMOVED] && env)	2543	if (!flag[FLAG_REMOVED] && env)
2594	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2544	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2595		2545
…		…
2611	struct region *	2561	struct region *
2612	object::region () const	2562	object::region () const
2613	{	2563	{
2614	return map ? map->region (x, y)	2564	return map ? map->region (x, y)
2615	: region::default_region ();	2565	: region::default_region ();
2616	}
2617
2618	const materialtype_t *
2619	object::dominant_material () const
2620	{
2621	if (materialtype_t *mt = name_to_material (materialname))
2622	return mt;
2623
2624	return name_to_material (shstr_unknown);
2625	}	2566	}
2626		2567
2627	void	2568	void
2628	object::open_container (object *new_container)	2569	object::open_container (object *new_container)
2629	{	2570	{
…		…
2651	container = 0;	2592	container = 0;
2652		2593
2653	// 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
2654	esrv_update_item (UPD_FLAGS, this, old_container);	2595	esrv_update_item (UPD_FLAGS, this, old_container);
2655		2596
2656	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 ());
2657	play_sound (sound_find ("chest_close"));	2598	play_sound (sound_find ("chest_close"));
2658	}	2599	}
2659		2600
2660	if (new_container)	2601	if (new_container)
2661	{	2602	{
…		…
2665	// TODO: this does not seem to serve any purpose anymore?	2606	// TODO: this does not seem to serve any purpose anymore?
2666	#if 0	2607	#if 0
2667	// insert the "Close Container" object.	2608	// insert the "Close Container" object.
2668	if (archetype *closer = new_container->other_arch)	2609	if (archetype *closer = new_container->other_arch)
2669	{	2610	{
2670	object *closer = arch_to_object (new_container->other_arch);	2611	object *closer = new_container->other_arch->instance ();
2671	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2612	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2672	new_container->insert (closer);	2613	new_container->insert (closer);
2673	}	2614	}
2674	#endif	2615	#endif
2675		2616
2676	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 ());
2677		2618
2678	// 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
2679	esrv_send_item (this, new_container);	2620	esrv_send_item (this, new_container);
2680		2621
2681	new_container->flag [FLAG_APPLIED] = true;	2622	new_container->flag [FLAG_APPLIED] = true;
…		…
2689	// else if (!old_container->env && contr && contr->ns)	2630	// else if (!old_container->env && contr && contr->ns)
2690	// contr->ns->floorbox_reset ();	2631	// contr->ns->floorbox_reset ();
2691	}	2632	}
2692		2633
2693	object *	2634	object *
2694	object::force_find (const shstr name)	2635	object::force_find (shstr_tmp name)
2695	{	2636	{
2696	/* 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
2697	* place	2638	* place
2698	*/	2639	*/
2699	for (object *tmp = inv; tmp; tmp = tmp->below)	2640	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2701	return splay (tmp);	2642	return splay (tmp);
2702		2643
2703	return 0;	2644	return 0;
2704	}	2645	}
2705		2646
		2647	//-GPL
		2648
2706	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 *
2707	object::force_add (const shstr name, int duration)	2659	object::force_add (shstr_tmp name, int duration)
2708	{	2660	{
2709	if (object *force = force_find (name))	2661	if (object *force = force_find (name))
2710	force->destroy ();	2662	force->destroy ();
2711		2663
2712	object *force = get_archetype (FORCE_NAME);	2664	object *force = get_archetype (FORCE_NAME);
2713		2665
2714	force->slaying = name;	2666	force->slaying = name;
2715	force->stats.food = 1;	2667	force->force_set_timer (duration);
2716	force->speed_left = -1.f;
2717
2718	force->set_speed (duration ? 1.f / duration : 0.f);
2719	force->flag [FLAG_IS_USED_UP] = true;
2720	force->flag [FLAG_APPLIED] = true;	2668	force->flag [FLAG_APPLIED] = true;
2721		2669
2722	insert (force);	2670	return insert (force);
2723	}	2671	}
2724		2672
2725	void	2673	void
2726	object::play_sound (faceidx sound)	2674	object::play_sound (faceidx sound) const
2727	{	2675	{
2728	if (!sound)	2676	if (!sound)
2729	return;	2677	return;
2730		2678
2731	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 ())
2732	return;	2704	return;
2733		2705
2734	if (env)	2706	// find old force, or create new one
2735	{	2707	object *force = force_find (shstr_noise_force);
2736	if (object *pl = in_player ())	2708
2737	pl->contr->play_sound (sound);	2709	if (force)
2738	}	2710	force->speed_left = -1.f; // patch old speed up
2739	else	2711	else
2740	map->play_sound (sound, x, y);	2712	{
2741	}	2713	force = archetype::get (shstr_noise_force);
2742		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

Diff Legend

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