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.239 by root, Wed May 7 13:38:16 2008 UTC vs.
Revision 1.345 by root, Sun May 1 16:58:15 2011 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,2011 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
		76	const char *wall_suffix[16] = {
		77	"0",
		78	"1_3",
		79	"1_4",
		80	"2_1_2",
		81	"1_2",
		82	"2_2_4",
		83	"2_2_1",
		84	"3_1",
		85	"1_1",
		86	"2_2_3",
		87	"2_2_2",
		88	"3_3",
		89	"2_1_1",
		90	"3_4",
		91	"3_2",
		92	"4"
		93	};
		94
66	static void	95	static void
67	write_uuid (uval64 skip, bool sync)	96	write_uuid (uval64 skip, bool sync)
68	{	97	{
69	CALL_BEGIN (2);	98	CALL_BEGIN (2);
70	CALL_ARG_SV (newSVval64 (skip));	99	CALL_ARG_SV (newSVval64 (skip));
…		…
72	CALL_CALL ("cf::write_uuid", G_DISCARD);	101	CALL_CALL ("cf::write_uuid", G_DISCARD);
73	CALL_END;	102	CALL_END;
74	}	103	}
75		104
76	static void	105	static void
77	read_uuid (void)	106	read_uuid ()
78	{	107	{
79	char filename[MAX_BUF];	108	char filename[MAX_BUF];
80		109
81	sprintf (filename, "%s/uuid", settings.localdir);	110	sprintf (filename, "%s/uuid", settings.localdir);
82		111
…		…
96		125
97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	126	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
98	_exit (1);	127	_exit (1);
99	}	128	}
100		129
101	UUID::BUF buf;	130	char buf [UUID::MAX_LEN];
102	buf[0] = 0;	131	buf[0] = 0;
103	fgets (buf, sizeof (buf), fp);	132	fgets (buf, sizeof (buf), fp);
104		133
105	if (!UUID::cur.parse (buf))	134	if (!UUID::cur.parse (buf))
106	{	135	{
…		…
133		162
134	void	163	void
135	UUID::init ()	164	UUID::init ()
136	{	165	{
137	read_uuid ();	166	read_uuid ();
		167	}
		168
		169	bool
		170	UUID::parse (const char *s)
		171	{
		172	if (*s++ != '<' || *s++ != '1' || *s++ != '.')
		173	return false;
		174
		175	seq = 0;
		176
		177	while (*s != '>')
		178	{
		179	if (*s < '0')
		180	return false;
		181
		182	// this gives nice branchless code with gcc
		183	assert ('0' < 'a' && '0' == 48 && 'a' == 97);
		184	int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
		185
		186	seq = (seq << 4) | digit;
		187
		188	++s;
		189	}
		190
		191	return true;
		192	}
		193
		194	char *
		195	UUID::append (char *buf) const
		196	{
		197	*buf++ = '<';
		198	*buf++ = '1';
		199	*buf++ = '.';
		200
		201	uint64_t seq = this->seq;
		202	const int bits = 64;
		203	char nz = 0;
		204	static const char tohex [] = "0123456789abcdef";
		205
		206	// assert (len >= 3 + bits / 4 + 1 + 1);
		207	for (int i = bits / 4; --i; )
		208	{
		209	uint8_t digit = seq >> (bits - 4);
		210
		211	*buf = tohex [digit];
		212	nz |= digit;
		213	buf += nz ? 1 : 0;
		214	seq <<= 4;
		215	}
		216
		217	// last digit is special - always emit
		218	uint8_t digit = seq >> (bits - 4);
		219	*buf++ = tohex [digit];
		220
		221	*buf++ = '>';
		222
		223	return buf;
		224	}
		225
		226	char *
		227	UUID::c_str () const
		228	{
		229	static char buf [MAX_LEN];
		230	*append (buf) = 0;
		231	return buf;
138	}	232	}
139		233
140	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	234	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
141	static bool	235	static bool
142	compare_ob_value_lists_one (const object *wants, const object *has)	236	compare_ob_value_lists_one (const object *wants, const object *has)
143	{	237	{
144	/* n-squared behaviour (see kv_get), but I'm hoping both	238	/* n-squared behaviour (see kv.get), but I'm hoping both
145	* objects with lists are rare, and lists stay short. If not, use a	239	* objects with lists are rare, and lists stay short. If not, use a
146	* different structure or at least keep the lists sorted...	240	* different structure or at least keep the lists sorted...
147	*/	241	*/
148		242
149	/* For each field in wants, */	243	/* For each field in wants, */
150	for (key_value *kv = wants->key_values; kv; kv = kv->next)	244	for (key_value *kv = wants->kv.first; kv; kv = kv->next)
151	if (has->kv_get (kv->key) != kv->value)	245	if (has->kv.get (kv->key) != kv->value)
152	return false;	246	return false;
153		247
154	/* If we get here, every field in wants has a matching field in has. */	248	/* If we get here, every field in wants has a matching field in has. */
155	return true;	249	return true;
156	}	250	}
…		…
178	* Improvements made with merge: Better checking on potion, and also	272	* Improvements made with merge: Better checking on potion, and also
179	* check weight	273	* check weight
180	*/	274	*/
181	bool object::can_merge_slow (object *ob1, object *ob2)	275	bool object::can_merge_slow (object *ob1, object *ob2)
182	{	276	{
183	/* A couple quicksanity checks */	277	/* A couple quick sanity checks */
184	if (ob1 == ob2	278	if (ob1 == ob2
185	|| ob1->type != ob2->type	279	|| ob1->type != ob2->type
186	|| ob1->speed != ob2->speed
187	|| ob1->value != ob2->value	280	|| ob1->value != ob2->value
188	|| ob1->name != ob2->name)	281	|| ob1->name != ob2->name
		282	|| ob1->custom_name != ob2->custom_name
		283	|| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
189	return 0;	284	return 0;
190		285
191	/* Do not merge objects if nrof would overflow. First part checks	286	/* Do not merge objects if nrof would overflow, assume nrof
192	* for unsigned overflow (2c), second part checks whether the result	287	* is always 0 .. 2**31-1 */
193	* would fit into a 32 bit signed int, which is often used to hold	288	if (ob1->nrof > 0x7fffffff - ob2->nrof)
194	* nrof values.
195	*/
196	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
197	return 0;	289	return 0;
198		290
199	/* If the objects have been identified, set the BEEN_APPLIED flag.	291	/* If the objects have been identified, set the BEEN_APPLIED flag.
200	* This is to the comparison of the flags below will be OK. We	292	* This is to the comparison of the flags below will be OK. We
201	* just can't ignore the been applied or identified flags, as they	293	* just can't ignore the been applied or identified flags, as they
202	* are not equal - just if it has been identified, the been_applied	294	* are not equal - just if it has been identified, the been_applied
203	* flags lose any meaning.	295	* flags lose any meaning.
204	*/	296	*/
205	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	297	if (ob1->flag [FLAG_IDENTIFIED])
206	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	298	ob1->set_flag (FLAG_BEEN_APPLIED);
207		299
208	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	300	if (ob2->flag [FLAG_IDENTIFIED])
209	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	301	ob2->set_flag (FLAG_BEEN_APPLIED);
210		302
211	if (ob1->arch->name != ob2->arch->name	303	if (ob1->arch->archname != ob2->arch->archname
212	|| ob1->name != ob2->name	304	|| ob1->name != ob2->name
213	|| ob1->title != ob2->title	305	|| ob1->title != ob2->title
214	|| ob1->msg != ob2->msg	306	|| ob1->msg != ob2->msg
215	|| ob1->weight != ob2->weight	307	|| ob1->weight != ob2->weight
216	|| ob1->attacktype != ob2->attacktype	308	|| ob1->attacktype != ob2->attacktype
217	|| ob1->magic != ob2->magic	309	|| ob1->magic != ob2->magic
218	|| ob1->slaying != ob2->slaying	310	|| ob1->slaying != ob2->slaying
219	|| ob1->skill != ob2->skill	311	|| ob1->skill != ob2->skill
220	|| ob1->value != ob2->value	312	|| ob1->value != ob2->value
221	|| ob1->animation_id != ob2->animation_id	313	|| ob1->animation_id != ob2->animation_id
		314	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
222	|| ob1->client_type != ob2->client_type	315	|| ob1->client_type != ob2->client_type
223	|| ob1->materialname != ob2->materialname	316	|| ob1->material != ob2->material
224	|| ob1->lore != ob2->lore	317	|| ob1->lore != ob2->lore
225	|| ob1->subtype != ob2->subtype	318	|| ob1->subtype != ob2->subtype
226	|| ob1->move_type != ob2->move_type	319	|| ob1->move_type != ob2->move_type
227	|| ob1->move_block != ob2->move_block	320	|| ob1->move_block != ob2->move_block
228	|| ob1->move_allow != ob2->move_allow	321	|| ob1->move_allow != ob2->move_allow
229	|| ob1->move_on != ob2->move_on	322	|| ob1->move_on != ob2->move_on
230	|| ob1->move_off != ob2->move_off	323	|| ob1->move_off != ob2->move_off
231	|| ob1->move_slow != ob2->move_slow	324	|| ob1->move_slow != ob2->move_slow
232	|| ob1->move_slow_penalty != ob2->move_slow_penalty	325	|| fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
233	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))	326	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
234	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	327	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
235	return 0;	328	return 0;
236		329
237	if ((ob1->flag ^ ob2->flag)	330	if ((ob1->flag ^ ob2->flag)
238	.reset (FLAG_INV_LOCKED)	331	.reset (FLAG_INV_LOCKED)
239	.reset (FLAG_CLIENT_SENT)
240	.reset (FLAG_REMOVED)	332	.reset (FLAG_REMOVED)
241	.any ())	333	.any ())
242	return 0;	334	return 0;
243		335
244	/* This is really a spellbook check - we should in general	336	/* This is really a spellbook check - we should in general
…		…
263		355
264	/* Don't merge objects that are applied. With the new 'body' code,	356	/* Don't merge objects that are applied. With the new 'body' code,
265	* it is possible for most any character to have more than one of	357	* it is possible for most any character to have more than one of
266	* some items equipped, and we don't want those to merge.	358	* some items equipped, and we don't want those to merge.
267	*/	359	*/
268	if (QUERY_FLAG (ob1, FLAG_APPLIED) || QUERY_FLAG (ob2, FLAG_APPLIED))	360	if (ob1->flag [FLAG_APPLIED] || ob2->flag [FLAG_APPLIED])
269	return 0;	361	return 0;
270		362
271	/* Note sure why the following is the case - either the object has to	363	/* Note sure why the following is the case - either the object has to
272	* be animated or have a very low speed. Is this an attempted monster	364	* be animated or have a very low speed. Is this an attempted monster
273	* check?	365	* check?
274	*/	366	*/
275	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())	367	if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ())
276	return 0;	368	return 0;
277		369
278	switch (ob1->type)	370	switch (ob1->type)
279	{	371	{
280	case SCROLL:	372	case SCROLL:
281	if (ob1->level != ob2->level)	373	if (ob1->level != ob2->level)
282	return 0;	374	return 0;
283	break;	375	break;
284	}	376	}
285		377
286	if (ob1->key_values || ob2->key_values)	378	if (!ob1->kv.empty () || !ob2->kv.empty ())
287	{	379	{
288	/* At least one of these has key_values. */	380	/* At least one of these has key_values. */
289	if ((!ob1->key_values) != (!ob2->key_values))	381	if (ob1->kv.empty () != ob2->kv.empty ())
290	return 0; /* One has fields, but the other one doesn't. */	382	return 0; /* One has fields, but the other one doesn't. */
291		383
292	if (!compare_ob_value_lists (ob1, ob2))	384	if (!compare_ob_value_lists (ob1, ob2))
293	return 0;	385	return 0;
294	}	386	}
…		…
326	{	418	{
327	// see if we are in a container of sorts	419	// see if we are in a container of sorts
328	if (env)	420	if (env)
329	{	421	{
330	// the player inventory itself is always visible	422	// the player inventory itself is always visible
331	if (env->type == PLAYER)	423	if (env->is_player ())
332	return env;	424	return env;
333		425
334	// else a player could have our env open	426	// else a player could have our env open
335	object *envest = env->outer_env ();	427	object *envest = env->outer_env_or_self ();
336		428
337	// the player itself is always on a map, so we will find him here	429	// the player itself is always on a map, so we will find him here
338	// even if our inv is in a player.	430	// even if our inv is in a player.
339	if (envest->is_on_map ())	431	if (envest->is_on_map ())
340	if (object *pl = envest->ms ().player ())	432	if (object *pl = envest->ms ().player ())
341	if (pl->container == env)	433	if (pl->container_ () == env)
342	return pl;	434	return pl;
343	}	435	}
344	else	436	else
345	{	437	{
346	// maybe there is a player standing on the same mapspace	438	// maybe there is a player standing on the same mapspace
347	// this will catch the case where "this" is a player	439	// this will catch the case where "this" is a player
348	if (object *pl = ms ().player ())	440	if (object *pl = ms ().player ())
349	if (!pl->container || this == pl->container)	441	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
		442	|| pl->container_ () == this)
350	return pl;	443	return pl;
351	}	444	}
352	}	445	}
353		446
354	return 0;	447	return 0;
355	}	448	}
356		449
357	// adjust weight per container type ("of holding")	450	// adjust weight per container type ("of holding")
358	static sint32	451	static uint32
359	weight_adjust_for (object *op, sint32 weight)	452	weight_adjust_for (object *op, uint32 weight)
360	{	453	{
361	return op->type == CONTAINER	454	return op->type == CONTAINER
362	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	455	? weight - weight * op->stats.Str / 100
363	: weight;	456	: weight;
364	}	457	}
365		458
366	/*	459	/*
367	* adjust_weight(object, weight) adds the specified weight to an object,	460	* subtracts, then adds, the specified weight to an object,
368	* and also updates how much the environment(s) is/are carrying.	461	* and also updates how much the environment(s) is/are carrying.
369	*/	462	*/
370	static void	463	static void
371	adjust_weight (object *op, sint32 weight)	464	adjust_weight (object *op, sint32 sub, sint32 add)
372	{	465	{
373	while (op)	466	while (op)
374	{	467	{
375	// adjust by actual difference to account for rounding errors	468	sint32 ocarrying = op->carrying;
376	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
377	weight = weight_adjust_for (op, op->carrying)
378	- weight_adjust_for (op, op->carrying - weight);
379		469
380	if (!weight)	470	op->carrying -= weight_adjust_for (op, sub);
381	return;	471	op->carrying += weight_adjust_for (op, add);
382
383	op->carrying += weight;
384		472
385	if (object *pl = op->visible_to ())	473	if (object *pl = op->visible_to ())
386	if (pl != op) // player is handled lazily	474	if (pl != op) // player is handled lazily
387	esrv_update_item (UPD_WEIGHT, pl, op);	475	esrv_update_item (UPD_WEIGHT, pl, op);
388		476
		477	sub = ocarrying;
		478	add = op->carrying;
		479
389	op = op->env;	480	op = op->env;
390	}	481	}
391	}	482	}
392		483
393	/*	484	/*
…		…
400	{	491	{
401	sint32 sum = 0;	492	sint32 sum = 0;
402		493
403	for (object *op = inv; op; op = op->below)	494	for (object *op = inv; op; op = op->below)
404	{	495	{
405	if (op->inv)
406	op->update_weight ();	496	op->update_weight ();
407		497
408	sum += op->total_weight ();	498	sum += weight_adjust_for (this, op->total_weight ());
409	}	499	}
410
411	sum = weight_adjust_for (this, sum);
412		500
413	if (sum != carrying)	501	if (sum != carrying)
414	{	502	{
		503	if (carrying != sum && carrying)//D
		504	LOG (llevDebug, "updating carrying got %ld, expected %ld (%s)\n",
		505	(long long)sum, (long long)carrying, debug_desc ());
		506
415	carrying = sum;	507	carrying = sum;
416		508
417	if (object *pl = visible_to ())	509	if (object *pl = visible_to ())
418	if (pl != this) // player is handled lazily	510	if (pl != this) // player is handled lazily
419	esrv_update_item (UPD_WEIGHT, pl, this);	511	esrv_update_item (UPD_WEIGHT, pl, this);
…		…
432	object_freezer freezer;	524	object_freezer freezer;
433	op->write (freezer);	525	op->write (freezer);
434	return freezer.as_string ();	526	return freezer.as_string ();
435	}	527	}
436		528
437	/*	529	char *
438	* get_nearest_part(multi-object, object 2) returns the part of the	530	object::as_string ()
439	* multi-object 1 which is closest to the second object.
440	* If it's not a multi-object, it is returned.
441	*/
442	object *
443	get_nearest_part (object *op, const object *pl)
444	{	531	{
445	object *tmp, *closest;	532	return dump_object (this);
446	int last_dist, i;
447
448	if (!op->more)
449	return op;
450
451	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
452	tmp;
453	tmp = tmp->more)
454	if ((i = distance (tmp, pl)) < last_dist)
455	closest = tmp, last_dist = i;
456
457	return closest;
458	}	533	}
459		534
460	/*	535	/*
461	* Returns the object which has the count-variable equal to the argument.	536	* Returns the object which has the count-variable equal to the argument.
462	* VERRRY slow.	537	* VERRRY slow.
…		…
470		545
471	return 0;	546	return 0;
472	}	547	}
473		548
474	/*	549	/*
		550	* Returns the object which has the uuid equal to the argument.
		551	* MOAR VERRRY slow.
		552	*/
		553
		554	object *
		555	find_object_uuid (UUID i)
		556	{
		557	for_all_objects (op)
		558	if (op->uuid == i)
		559	return op;
		560
		561	return 0;
		562	}
		563
		564	/*
475	* Returns the first object which has a name equal to the argument.	565	* Returns the first object which has a name equal to the argument.
476	* Used only by the patch command, but not all that useful.	566	* Used only by the patch command, but not all that useful.
477	* Enables features like "patch <name-of-other-player> food 999"	567	* Enables features like "patch <name-of-other-player> food 999"
478	*/	568	*/
479	object *	569	object *
480	find_object_name (const char *str)	570	find_object_name (const char *str)
481	{	571	{
482	shstr_cmp str_ (str);	572	shstr_cmp str_ (str);
483	object *op;
484		573
		574	if (str_)
485	for_all_objects (op)	575	for_all_objects (op)
486	if (op->name == str_)	576	if (op->name == str_)
487	break;	577	return op;
488		578
489	return op;	579	return 0;
490	}	580	}
491		581
492	/*	582	/*
493	* Sets the owner and sets the skill and exp pointers to owner's current	583	* Sets the owner and sets the skill and exp pointers to owner's current
494	* skill and experience objects.	584	* skill and experience objects.
…		…
507	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());	597	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
508	return;	598	return;
509	}	599	}
510		600
511	this->owner = owner;	601	this->owner = owner;
512	}
513
514	int
515	object::slottype () const
516	{
517	if (type == SKILL)
518	{
519	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
520	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
521	}
522	else
523	{
524	if (slot [body_combat].info) return slot_combat;
525	if (slot [body_range ].info) return slot_ranged;
526	}
527
528	return slot_none;
529	}
530
531	bool
532	object::change_weapon (object *ob)
533	{
534	if (current_weapon == ob)
535	return true;
536
537	if (chosen_skill)
538	chosen_skill->flag [FLAG_APPLIED] = false;
539
540	current_weapon = ob;
541	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
542
543	if (chosen_skill)
544	chosen_skill->flag [FLAG_APPLIED] = true;
545
546	update_stats ();
547
548	if (ob)
549	{
550	// now check wether any body locations became invalid, in which case
551	// we cannot apply the weapon at the moment.
552	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
553	if (slot[i].used < 0)
554	{
555	current_weapon = chosen_skill = 0;
556	update_stats ();
557
558	new_draw_info_format (NDI_UNIQUE, 0, this,
559	"You try to balance all your items at once, "
560	"but the %s is just too much for your body. "
561	"[You need to unapply some items first.]", &ob->name);
562	return false;
563	}
564
565	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
566	}
567	else
568	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
569
570	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
571	{
572	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
573	&name, ob->debug_desc ());
574	return false;
575	}
576
577	return true;
578	}
579
580	/* Zero the key_values on op, decrementing the shared-string
581	* refcounts and freeing the links.
582	*/
583	static void
584	free_key_values (object *op)
585	{
586	for (key_value *i = op->key_values; i; )
587	{
588	key_value *next = i->next;
589	delete i;
590
591	i = next;
592	}
593
594	op->key_values = 0;
595	}	602	}
596		603
597	/*	604	/*
598	* copy_to first frees everything allocated by the dst object,	605	* copy_to first frees everything allocated by the dst object,
599	* and then copies the contents of itself into the second	606	* and then copies the contents of itself into the second
…		…
605	void	612	void
606	object::copy_to (object *dst)	613	object::copy_to (object *dst)
607	{	614	{
608	dst->remove ();	615	dst->remove ();
609	*(object_copy *)dst = *this;	616	*(object_copy *)dst = *this;
		617
		618	// maybe move to object_copy?
		619	dst->kv = kv;
		620
610	dst->flag [FLAG_REMOVED] = true;	621	dst->flag [FLAG_REMOVED] = true;
611		622	dst->activate ();
612	/* Copy over key_values, if any. */
613	if (key_values)
614	{
615	key_value *tail = 0;
616	dst->key_values = 0;
617
618	for (key_value *i = key_values; i; i = i->next)
619	{
620	key_value *new_link = new key_value;
621
622	new_link->next = 0;
623	new_link->key = i->key;
624	new_link->value = i->value;
625
626	/* Try and be clever here, too. */
627	if (!dst->key_values)
628	{
629	dst->key_values = new_link;
630	tail = new_link;
631	}
632	else
633	{
634	tail->next = new_link;
635	tail = new_link;
636	}
637	}
638	}
639
640	if (speed < 0)
641	dst->speed_left -= rndm ();
642
643	dst->set_speed (dst->speed);
644	}	623	}
645		624
646	void	625	void
647	object::instantiate ()	626	object::instantiate ()
648	{	627	{
649	if (!uuid.seq) // HACK	628	if (!uuid.seq) // HACK
650	uuid = UUID::gen ();	629	uuid = UUID::gen ();
651		630
		631	// TODO: unclean state changes, should not be done in copy_to AND instantiate
		632	if (flag [FLAG_RANDOM_SPEED] && speed)
		633	speed_left = - speed - rndm (); // TODO animation
		634	else
652	speed_left = -0.1f;	635	speed_left = -1.;
		636
653	/* copy the body_info to the body_used - this is only really	637	/* copy the body_info to the body_used - this is only really
654	* need for monsters, but doesn't hurt to do it for everything.	638	* need for monsters, but doesn't hurt to do it for everything.
655	* by doing so, when a monster is created, it has good starting	639	* by doing so, when a monster is created, it has good starting
656	* values for the body_used info, so when items are created	640	* values for the body_used info, so when items are created
657	* for it, they can be properly equipped.	641	* for it, they can be properly equipped.
…		…
665	object *	649	object *
666	object::clone ()	650	object::clone ()
667	{	651	{
668	object *neu = create ();	652	object *neu = create ();
669	copy_to (neu);	653	copy_to (neu);
		654
		655	// TODO: unclean state changes, should not be done in clone AND instantiate
		656	if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
		657	neu->speed_left = - neu->speed - rndm (); // TODO animation
		658
670	neu->map = map; // not copied by copy_to	659	neu->map = map; // not copied by copy_to
671	return neu;	660	return neu;
672	}	661	}
673		662
674	/*	663	/*
…		…
677	* be called to update the face variable, _and_ how it looks on the map.	666	* be called to update the face variable, _and_ how it looks on the map.
678	*/	667	*/
679	void	668	void
680	update_turn_face (object *op)	669	update_turn_face (object *op)
681	{	670	{
682	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)	671	if (!op->flag [FLAG_IS_TURNABLE] || !op->arch)
683	return;	672	return;
684		673
685	SET_ANIMATION (op, op->direction);	674	SET_ANIMATION (op, op->direction);
686	update_object (op, UP_OBJ_FACE);	675	update_object (op, UP_OBJ_FACE);
687	}	676	}
…		…
692	* This function needs to be called whenever the speed of an object changes.	681	* This function needs to be called whenever the speed of an object changes.
693	*/	682	*/
694	void	683	void
695	object::set_speed (float speed)	684	object::set_speed (float speed)
696	{	685	{
697	if (flag [FLAG_FREED] && speed)
698	{
699	LOG (llevError, "Object %s is freed but has speed.\n", &name);
700	speed = 0;
701	}
702
703	this->speed = speed;	686	this->speed = speed;
704		687
705	if (has_active_speed ())	688	if (has_active_speed ())
706	activate ();	689	activate ();
707	else	690	else
…		…
757		740
758	if (!(m.flags_ & P_UPTODATE))	741	if (!(m.flags_ & P_UPTODATE))
759	/* nop */;	742	/* nop */;
760	else if (action == UP_OBJ_INSERT)	743	else if (action == UP_OBJ_INSERT)
761	{	744	{
		745	#if 0
762	// this is likely overkill, TODO: revisit (schmorp)	746	// this is likely overkill, TODO: revisit (schmorp)
763	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	747	if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW))
764	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	748	|| (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC))
765	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	749	|| (op->is_player () && !(m.flags_ & P_PLAYER))
766	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	750	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
767	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	751	|| (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE))
768	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	752	|| (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC))
769	|| (m.move_on | op->move_on ) != m.move_on	753	|| (m.move_on | op->move_on ) != m.move_on
770	|| (m.move_off | op->move_off ) != m.move_off	754	|| (m.move_off | op->move_off ) != m.move_off
771	|| (m.move_slow | op->move_slow) != m.move_slow	755	|| (m.move_slow | op->move_slow) != m.move_slow
772	/* This isn't perfect, but I don't expect a lot of objects to	756	/* This isn't perfect, but I don't expect a lot of objects to
773	* to have move_allow right now.	757	* have move_allow right now.
774	*/	758	*/
775	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	759	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
		760	m.invalidate ();
		761	#else
776	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	762	// the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
777	m.flags_ = 0;	763	m.invalidate ();
		764	#endif
778	}	765	}
779	/* if the object is being removed, we can't make intelligent	766	/* if the object is being removed, we can't make intelligent
780	* decisions, because remove_ob can't really pass the object	767	* decisions, because remove_ob can't really pass the object
781	* that is being removed.	768	* that is being removed.
782	*/	769	*/
783	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	770	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
784	m.flags_ = 0;	771	m.invalidate ();
785	else if (action == UP_OBJ_FACE)	772	else if (action == UP_OBJ_FACE)
786	/* Nothing to do for that case */ ;	773	/* Nothing to do for that case */ ;
787	else	774	else
788	LOG (llevError, "update_object called with invalid action: %d\n", action);	775	LOG (llevError, "update_object called with invalid action: %d\n", action);
789		776
…		…
791	update_object (op->more, action);	778	update_object (op->more, action);
792	}	779	}
793		780
794	object::object ()	781	object::object ()
795	{	782	{
796	SET_FLAG (this, FLAG_REMOVED);	783	this->set_flag (FLAG_REMOVED);
797		784
798	expmul = 1.0;	785	//expmul = 1.0; declared const for the time being
799	face = blank_face;	786	face = blank_face;
		787	material = MATERIAL_NULL;
800	}	788	}
801		789
802	object::~object ()	790	object::~object ()
803	{	791	{
804	unlink ();	792	unlink ();
805		793
806	free_key_values (this);	794	kv.clear ();
807	}	795	}
808
809	static int object_count;
810		796
811	void object::link ()	797	void object::link ()
812	{	798	{
813	assert (!index);//D	799	assert (!index);//D
814	uuid = UUID::gen ();	800	uuid = UUID::gen ();
815	count = ++object_count;
816		801
817	refcnt_inc ();	802	refcnt_inc ();
818	objects.insert (this);	803	objects.insert (this);
		804
		805	++create_count;
		806
819	}	807	}
820		808
821	void object::unlink ()	809	void object::unlink ()
822	{	810	{
823	if (!index)	811	if (!index)
824	return;	812	return;
		813
		814	++destroy_count;
825		815
826	objects.erase (this);	816	objects.erase (this);
827	refcnt_dec ();	817	refcnt_dec ();
828	}	818	}
829		819
…		…
833	/* If already on active list, don't do anything */	823	/* If already on active list, don't do anything */
834	if (active)	824	if (active)
835	return;	825	return;
836		826
837	if (has_active_speed ())	827	if (has_active_speed ())
		828	{
		829	if (flag [FLAG_FREED])
		830	LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		831
838	actives.insert (this);	832	actives.insert (this);
		833	}
839	}	834	}
840		835
841	void	836	void
842	object::activate_recursive ()	837	object::activate_recursive ()
843	{	838	{
…		…
908	|| map->in_memory != MAP_ACTIVE	903	|| map->in_memory != MAP_ACTIVE
909	|| map->no_drop	904	|| map->no_drop
910	|| ms ().move_block == MOVE_ALL)	905	|| ms ().move_block == MOVE_ALL)
911	{	906	{
912	while (inv)	907	while (inv)
913	{
914	inv->destroy_inv (false);
915	inv->destroy ();	908	inv->destroy ();
916	}
917	}	909	}
918	else	910	else
919	{ /* Put objects in inventory onto this space */	911	{ /* Put objects in inventory onto this space */
920	while (inv)	912	while (inv)
921	{	913	{
…		…
925	|| op->flag [FLAG_NO_DROP]	917	|| op->flag [FLAG_NO_DROP]
926	|| op->type == RUNE	918	|| op->type == RUNE
927	|| op->type == TRAP	919	|| op->type == TRAP
928	|| op->flag [FLAG_IS_A_TEMPLATE]	920	|| op->flag [FLAG_IS_A_TEMPLATE]
929	|| op->flag [FLAG_DESTROY_ON_DEATH])	921	|| op->flag [FLAG_DESTROY_ON_DEATH])
930	op->destroy (true);	922	op->destroy ();
931	else	923	else
932	map->insert (op, x, y);	924	map->insert (op, x, y);
933	}	925	}
934	}	926	}
935	}	927	}
936		928
		929	/*
		930	* Remove and free all objects in the inventory of the given object.
		931	* Unlike destroy_inv, this assumes the *this is destroyed as well
		932	* well, so we can (and have to!) take shortcuts.
		933	*/
		934	void
		935	object::destroy_inv_fast ()
		936	{
		937	while (object *op = inv)
		938	{
		939	// remove from object the fast way
		940	op->flag [FLAG_REMOVED] = true;
		941	op->env = 0;
		942	if ((inv = inv->below))
		943	inv->above = 0;
		944
		945	// then destroy
		946	op->destroy ();
		947	}
		948	}
		949
		950	void
		951	object::freelist_free (int count)
		952	{
		953	while (count-- && freelist)
		954	{
		955	freelist_item *next = freelist->next;
		956	// count is being "destroyed"
		957
		958	sfree ((char *)freelist, sizeof (object));
		959
		960	freelist = next;
		961	--free_count;
		962	}
		963	}
		964
		965	object *
937	object *object::create ()	966	object::create ()
938	{	967	{
939	object *op = new object;	968	object *op;
		969
		970	if (freelist)
		971	{
		972	freelist_item li = *freelist;
		973	memset (freelist, 0, sizeof (object));
		974
		975	op = new (freelist) object;
		976	op->count = li.count;
		977
		978	freelist = li.next;
		979	--free_count;
		980	}
		981	else
		982	{
		983	void *ni = salloc0<char> (sizeof (object));
		984
		985	op = new(ni) object;
		986
		987	op->count = ++object_count;
		988	}
		989
940	op->link ();	990	op->link ();
		991
941	return op;	992	return op;
942	}	993	}
943		994
		995	void
		996	object::do_delete ()
		997	{
		998	uint32_t count = this->count;
		999
		1000	this->~object ();
		1001
		1002	freelist_item *li = (freelist_item *)this;
		1003	li->next = freelist;
		1004	li->count = count;
		1005
		1006	freelist = li;
		1007	++free_count;
		1008	}
		1009
944	static struct freed_map : maptile	1010	static struct freed_map : maptile
945	{	1011	{
946	freed_map ()	1012	freed_map ()
		1013	: maptile (3, 3)
947	{	1014	{
948	path = "<freed objects map>";	1015	path = "<freed objects map>";
949	name = "/internal/freed_objects_map";	1016	name = "/internal/freed_objects_map";
950	width = 3;
951	height = 3;
952	no_drop = 1;	1017	no_drop = 1;
953	no_reset = 1;	1018	no_reset = 1;
954		1019
955	alloc ();
956	in_memory = MAP_ACTIVE;	1020	in_memory = MAP_ACTIVE;
957	}	1021	}
958		1022
959	~freed_map ()	1023	~freed_map ()
960	{	1024	{
…		…
964		1028
965	void	1029	void
966	object::do_destroy ()	1030	object::do_destroy ()
967	{	1031	{
968	if (flag [FLAG_IS_LINKED])	1032	if (flag [FLAG_IS_LINKED])
969	remove_button_link (this);	1033	remove_link ();
970		1034
971	if (flag [FLAG_FRIENDLY])	1035	if (flag [FLAG_FRIENDLY])
972	remove_friendly_object (this);	1036	remove_friendly_object (this);
973		1037
974	remove ();	1038	remove ();
…		…
999	attacked_by = 0;	1063	attacked_by = 0;
1000	current_weapon = 0;	1064	current_weapon = 0;
1001	}	1065	}
1002		1066
1003	void	1067	void
1004	object::destroy (bool destroy_inventory)	1068	object::destroy ()
1005	{	1069	{
1006	if (destroyed ())	1070	if (destroyed ())
1007	return;	1071	return;
1008		1072
1009	if (!is_head () && !head->destroyed ())	1073	if (!is_head () && !head->destroyed ())
1010	{	1074	{
1011	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");	1075	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1012	head->destroy (destroy_inventory);	1076	head->destroy ();
1013	return;	1077	return;
1014	}	1078	}
1015		1079
1016	destroy_inv (!destroy_inventory);	1080	destroy_inv_fast ();
1017		1081
1018	if (is_head ())	1082	if (is_head ())
1019	if (sound_destroy)	1083	if (sound_destroy)
1020	play_sound (sound_destroy);	1084	play_sound (sound_destroy);
1021	else if (flag [FLAG_MONSTER])	1085	else if (flag [FLAG_MONSTER])
…		…
1032	* the previous environment.	1096	* the previous environment.
1033	*/	1097	*/
1034	void	1098	void
1035	object::do_remove ()	1099	object::do_remove ()
1036	{	1100	{
1037	object *tmp, *last = 0;
1038	object *otmp;
1039
1040	if (flag [FLAG_REMOVED])	1101	if (flag [FLAG_REMOVED])
1041	return;	1102	return;
1042		1103
1043	INVOKE_OBJECT (REMOVE, this);	1104	INVOKE_OBJECT (REMOVE, this);
1044		1105
…		…
1056	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed	1117	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1057	if (object *pl = visible_to ())	1118	if (object *pl = visible_to ())
1058	esrv_del_item (pl->contr, count);	1119	esrv_del_item (pl->contr, count);
1059	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1120	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1060		1121
1061	adjust_weight (env, -total_weight ());	1122	adjust_weight (env, total_weight (), 0);
		1123
		1124	object *pl = in_player ();
1062		1125
1063	/* we set up values so that it could be inserted into	1126	/* we set up values so that it could be inserted into
1064	* the map, but we don't actually do that - it is up	1127	* the map, but we don't actually do that - it is up
1065	* to the caller to decide what we want to do.	1128	* to the caller to decide what we want to do.
1066	*/	1129	*/
…		…
1074		1137
1075	above = 0;	1138	above = 0;
1076	below = 0;	1139	below = 0;
1077	env = 0;	1140	env = 0;
1078		1141
1079	/* NO_FIX_PLAYER is set when a great many changes are being	1142	if (pl && pl->is_player ())
1080	* made to players inventory. If set, avoiding the call
1081	* to save cpu time.
1082	*/	1143	{
1083	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1144	if (expect_false (pl->contr->combat_ob == this))
1084	otmp->update_stats ();	1145	{
		1146	pl->apply (pl->contr->combat_ob, AP_UNAPPLY | AP_IGNORE_CURSE);
		1147	pl->contr->combat_ob = 0;
		1148	if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);
		1149	}
		1150
		1151	if (expect_false (pl->contr->ranged_ob == this))
		1152	{
		1153	pl->apply (pl->contr->ranged_ob, AP_UNAPPLY | AP_IGNORE_CURSE);
		1154	pl->contr->ranged_ob = 0;
		1155	if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);
		1156	}
		1157
		1158	pl->contr->queue_stats_update ();
		1159
		1160	if (expect_false (glow_radius) && pl->is_on_map ())
		1161	update_all_los (pl->map, pl->x, pl->y);
		1162	}
1085	}	1163	}
1086	else if (map)	1164	else if (map)
1087	{	1165	{
1088	map->dirty = true;	1166	map->dirty = true;
1089	mapspace &ms = this->ms ();	1167	mapspace &ms = this->ms ();
1090		1168
1091	if (object *pl = ms.player ())	1169	if (object *pl = ms.player ())
1092	{	1170	{
1093	if (type == PLAYER) // this == pl(!)	1171	if (is_player ())
1094	{	1172	{
		1173	if (!flag [FLAG_WIZPASS])
		1174	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1175
1095	// leaving a spot always closes any open container on the ground	1176	// leaving a spot always closes any open container on the ground
1096	if (container && !container->env)	1177	if (container && !container->env)
1097	// this causes spurious floorbox updates, but it ensures	1178	// this causes spurious floorbox updates, but it ensures
1098	// that the CLOSE event is being sent.	1179	// that the CLOSE event is being sent.
1099	close_container ();	1180	close_container ();
1100		1181
1101	--map->players;	1182	--map->players;
1102	map->touch ();	1183	map->touch ();
1103	}	1184	}
1104	else if (pl->container == this)	1185	else if (pl->container_ () == this)
1105	{	1186	{
1106	// removing a container should close it	1187	// removing a container should close it
1107	close_container ();	1188	close_container ();
1108	}	1189	}
1109		1190	else
1110	esrv_del_item (pl->contr, count);	1191	esrv_del_item (pl->contr, count);
1111	}	1192	}
1112		1193
1113	/* link the object above us */	1194	/* link the object above us */
1114	// re-link, make sure compiler can easily use cmove	1195	// re-link, make sure compiler can easily use cmove
1115	*(above ? &above->below : &ms.top) = below;	1196	*(above ? &above->below : &ms.top) = below;
1116	*(below ? &below->above : &ms.bot) = above;	1197	*(below ? &below->above : &ms.bot) = above;
1117		1198
1118	above = 0;	1199	above = 0;
1119	below = 0;	1200	below = 0;
1120		1201
		1202	ms.invalidate ();
		1203
1121	if (map->in_memory == MAP_SAVING)	1204	if (map->in_memory == MAP_SAVING)
1122	return;	1205	return;
1123		1206
1124	int check_walk_off = !flag [FLAG_NO_APPLY];	1207	int check_walk_off = !flag [FLAG_NO_APPLY];
1125		1208
1126	if (object *pl = ms.player ())	1209	if (object *pl = ms.player ())
1127	{	1210	{
1128	if (pl->container == this)	1211	if (pl->container_ () == this)
1129	/* If a container that the player is currently using somehow gets	1212	/* If a container that the player is currently using somehow gets
1130	* removed (most likely destroyed), update the player view	1213	* removed (most likely destroyed), update the player view
1131	* appropriately.	1214	* appropriately.
1132	*/	1215	*/
1133	pl->close_container ();	1216	pl->close_container ();
…		…
1137	//TODO: update floorbox to preserve ordering	1220	//TODO: update floorbox to preserve ordering
1138	if (pl->contr->ns)	1221	if (pl->contr->ns)
1139	pl->contr->ns->floorbox_update ();	1222	pl->contr->ns->floorbox_update ();
1140	}	1223	}
1141		1224
		1225	if (check_walk_off)
1142	for (tmp = ms.bot; tmp; tmp = tmp->above)	1226	for (object *above, *tmp = ms.bot; tmp; tmp = above)
1143	{	1227	{
		1228	above = tmp->above;
		1229
1144	/* No point updating the players look faces if he is the object	1230	/* No point updating the players look faces if he is the object
1145	* being removed.	1231	* being removed.
1146	*/	1232	*/
1147		1233
1148	/* See if object moving off should effect something */	1234	/* See if object moving off should effect something */
1149	if (check_walk_off
1150	&& ((move_type & tmp->move_off)	1235	if ((move_type & tmp->move_off)
1151	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1236	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1152	{
1153	move_apply (tmp, this, 0);	1237	move_apply (tmp, this, 0);
1154
1155	if (destroyed ())
1156	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1157	}	1238	}
1158		1239
1159	last = tmp;	1240	if (affects_los ())
1160	}
1161
1162	/* last == NULL if there are no objects on this space */
1163	//TODO: this makes little sense, why only update the topmost object?
1164	if (!last)
1165	map->at (x, y).flags_ = 0;
1166	else
1167	update_object (last, UP_OBJ_REMOVE);
1168
1169	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1170	update_all_los (map, x, y);	1241	update_all_los (map, x, y);
1171	}	1242	}
1172	}	1243	}
1173		1244
1174	/*	1245	/*
…		…
1198	esrv_update_item (UPD_NROF, pl, top);	1269	esrv_update_item (UPD_NROF, pl, top);
1199		1270
1200	op->weight = 0; // cancel the addition above	1271	op->weight = 0; // cancel the addition above
1201	op->carrying = 0; // must be 0 already	1272	op->carrying = 0; // must be 0 already
1202		1273
1203	op->destroy (1);	1274	op->destroy ();
1204		1275
1205	return top;	1276	return top;
1206	}	1277	}
1207		1278
1208	return 0;	1279	return 0;
…		…
1216		1287
1217	object *prev = this;	1288	object *prev = this;
1218		1289
1219	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)	1290	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1220	{	1291	{
1221	object *op = arch_to_object (at);	1292	object *op = at->instance ();
1222		1293
1223	op->name = name;	1294	op->name = name;
1224	op->name_pl = name_pl;	1295	op->name_pl = name_pl;
1225	op->title = title;	1296	op->title = title;
1226		1297
…		…
1236	* job preparing multi-part monsters.	1307	* job preparing multi-part monsters.
1237	*/	1308	*/
1238	object *	1309	object *
1239	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1310	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1240	{	1311	{
		1312	op->remove ();
		1313
1241	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1314	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1242	{	1315	{
1243	tmp->x = x + tmp->arch->x;	1316	tmp->x = x + tmp->arch->x;
1244	tmp->y = y + tmp->arch->y;	1317	tmp->y = y + tmp->arch->y;
1245	}	1318	}
…		…
1262	* Passing 0 for flag gives proper default values, so flag really only needs	1335	* Passing 0 for flag gives proper default values, so flag really only needs
1263	* to be set if special handling is needed.	1336	* to be set if special handling is needed.
1264	*	1337	*
1265	* Return value:	1338	* Return value:
1266	* new object if 'op' was merged with other object	1339	* new object if 'op' was merged with other object
1267	* NULL if 'op' was destroyed	1340	* NULL if there was an error (destroyed, blocked etc.)
1268	* just 'op' otherwise	1341	* just 'op' otherwise
1269	*/	1342	*/
1270	object *	1343	object *
1271	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1344	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1272	{	1345	{
1273	op->remove ();	1346	op->remove ();
		1347
		1348	if (m == &freed_map)//D TODO: remove soon
		1349	{//D
		1350	LOG (llevError | logBacktrace, "tries to insert object on freed objects map: %s", op->debug_desc ());//D
		1351	}//D
1274		1352
1275	/* Ideally, the caller figures this out. However, it complicates a lot	1353	/* Ideally, the caller figures this out. However, it complicates a lot
1276	* of areas of callers (eg, anything that uses find_free_spot would now	1354	* of areas of callers (eg, anything that uses find_free_spot would now
1277	* need extra work	1355	* need extra work
1278	*/	1356	*/
		1357	maptile *newmap = m;
1279	if (!xy_normalise (m, op->x, op->y))	1358	if (!xy_normalise (newmap, op->x, op->y))
1280	{	1359	{
1281	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found	1360	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1282	return 0;	1361	return 0;
1283	}	1362	}
1284		1363
1285	if (object *more = op->more)	1364	if (object *more = op->more)
1286	if (!insert_ob_in_map (more, m, originator, flag))	1365	if (!insert_ob_in_map (more, m, originator, flag))
1287	return 0;	1366	return 0;
1288		1367
1289	CLEAR_FLAG (op, FLAG_REMOVED);	1368	op->flag [FLAG_REMOVED] = false;
1290		1369	op->env = 0;
1291	op->map = m;	1370	op->map = newmap;
		1371
1292	mapspace &ms = op->ms ();	1372	mapspace &ms = op->ms ();
1293		1373
1294	/* this has to be done after we translate the coordinates.	1374	/* this has to be done after we translate the coordinates.
1295	*/	1375	*/
1296	if (op->nrof && !(flag & INS_NO_MERGE))	1376	if (op->nrof && !(flag & INS_NO_MERGE))
…		…
1299	{	1379	{
1300	// TODO: we actually want to update tmp, not op,	1380	// TODO: we actually want to update tmp, not op,
1301	// but some caller surely breaks when we return tmp	1381	// but some caller surely breaks when we return tmp
1302	// from here :/	1382	// from here :/
1303	op->nrof += tmp->nrof;	1383	op->nrof += tmp->nrof;
1304	tmp->destroy (1);	1384	tmp->destroy ();
1305	}	1385	}
1306		1386
1307	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1387	op->clr_flag (FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1308	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1388	op->clr_flag (FLAG_INV_LOCKED);
1309		1389
1310	if (!QUERY_FLAG (op, FLAG_ALIVE))	1390	if (!op->flag [FLAG_ALIVE])
1311	CLEAR_FLAG (op, FLAG_NO_STEAL);	1391	op->clr_flag (FLAG_NO_STEAL);
1312		1392
1313	if (flag & INS_BELOW_ORIGINATOR)	1393	if (flag & INS_BELOW_ORIGINATOR)
1314	{	1394	{
1315	if (originator->map != op->map || originator->x != op->x || originator->y != op->y || !originator->is_on_map ())	1395	if (originator->map != op->map || originator->x != op->x || originator->y != op->y)
1316	{	1396	{
1317	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1397	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
		1398	abort ();
		1399	}
		1400
		1401	if (!originator->is_on_map ())
		1402	{
		1403	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1404	op->debug_desc (), originator->debug_desc ());
1318	abort ();	1405	abort ();
1319	}	1406	}
1320		1407
1321	op->above = originator;	1408	op->above = originator;
1322	op->below = originator->below;	1409	op->below = originator->below;
…		…
1344	* when lots of spells are cast in one area. Currently, it is presumed	1431	* when lots of spells are cast in one area. Currently, it is presumed
1345	* that flying non pickable objects are spell objects.	1432	* that flying non pickable objects are spell objects.
1346	*/	1433	*/
1347	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1434	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1348	{	1435	{
1349	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))	1436	if (tmp->flag [FLAG_IS_FLOOR] || tmp->flag [FLAG_OVERLAY_FLOOR])
1350	floor = tmp;	1437	floor = tmp;
1351		1438
1352	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1439	if (tmp->flag [FLAG_NO_PICK] && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !tmp->flag [FLAG_IS_FLOOR])
1353	{	1440	{
1354	/* We insert above top, so we want this object below this */	1441	/* We insert above top, so we want this object below this */
1355	top = tmp->below;	1442	top = tmp->below;
1356	break;	1443	break;
1357	}	1444	}
…		…
1375	&& (op->face && !faces [op->face].visibility))	1462	&& (op->face && !faces [op->face].visibility))
1376	{	1463	{
1377	object *last;	1464	object *last;
1378		1465
1379	for (last = top; last != floor; last = last->below)	1466	for (last = top; last != floor; last = last->below)
1380	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1467	if (last->flag [FLAG_BLOCKSVIEW] && (last->type != EXIT))
1381	break;	1468	break;
1382		1469
1383	/* Check to see if we found the object that blocks view,	1470	/* Check to see if we found the object that blocks view,
1384	* and make sure we have a below pointer for it so that	1471	* and make sure we have a below pointer for it so that
1385	* we can get inserted below this one, which requires we	1472	* we can get inserted below this one, which requires we
…		…
1391	} /* If objects on this space */	1478	} /* If objects on this space */
1392		1479
1393	if (flag & INS_ABOVE_FLOOR_ONLY)	1480	if (flag & INS_ABOVE_FLOOR_ONLY)
1394	top = floor;	1481	top = floor;
1395		1482
1396	/* Top is the object that our object (op) is going to get inserted above.	1483	// insert object above top, or bottom-most if top = 0
1397	*/
1398
1399	/* no top found, insert at bottom */
1400	if (!top)	1484	if (!top)
1401	{	1485	{
1402	op->below = 0;	1486	op->below = 0;
1403	op->above = ms.bot;	1487	op->above = ms.bot;
1404	ms.bot = op;	1488	ms.bot = op;
1405		1489
1406	*(op->above ? &op->above->below : &ms.top) = op;	1490	*(op->above ? &op->above->below : &ms.top) = op;
1407	}	1491	}
1408	else	1492	else
1409	{ /* get inserted into the stack above top */	1493	{
1410	op->above = top->above;	1494	op->above = top->above;
1411	top->above = op;	1495	top->above = op;
1412		1496
1413	op->below = top;	1497	op->below = top;
1414	*(op->above ? &op->above->below : &ms.top) = op;	1498	*(op->above ? &op->above->below : &ms.top) = op;
1415	}	1499	}
1416	} /* else not INS_BELOW_ORIGINATOR */	1500	}
1417		1501
1418	if (op->type == PLAYER)	1502	if (op->is_player ())
1419	{	1503	{
1420	op->contr->do_los = 1;	1504	op->contr->do_los = 1;
1421	++op->map->players;	1505	++op->map->players;
1422	op->map->touch ();	1506	op->map->touch ();
1423	}	1507	}
…		…
1438	* be far away from this change and not affected in any way -	1522	* be far away from this change and not affected in any way -
1439	* this should get redone to only look for players within range,	1523	* this should get redone to only look for players within range,
1440	* or just updating the P_UPTODATE for spaces within this area	1524	* or just updating the P_UPTODATE for spaces within this area
1441	* of effect may be sufficient.	1525	* of effect may be sufficient.
1442	*/	1526	*/
1443	if (op->map->darkness && (op->glow_radius != 0))	1527	if (op->affects_los ())
		1528	{
		1529	op->ms ().invalidate ();
1444	update_all_los (op->map, op->x, op->y);	1530	update_all_los (op->map, op->x, op->y);
		1531	}
1445		1532
1446	/* updates flags (blocked, alive, no magic, etc) for this map space */	1533	/* updates flags (blocked, alive, no magic, etc) for this map space */
1447	update_object (op, UP_OBJ_INSERT);	1534	update_object (op, UP_OBJ_INSERT);
1448		1535
1449	INVOKE_OBJECT (INSERT, op);	1536	INVOKE_OBJECT (INSERT, op);
…		…
1456	* blocked() and wall() work properly), and these flags are updated by	1543	* blocked() and wall() work properly), and these flags are updated by
1457	* update_object().	1544	* update_object().
1458	*/	1545	*/
1459		1546
1460	/* if this is not the head or flag has been passed, don't check walk on status */	1547	/* if this is not the head or flag has been passed, don't check walk on status */
1461	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1548	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1462	{	1549	{
1463	if (check_move_on (op, originator))	1550	if (check_move_on (op, originator, flag))
1464	return 0;	1551	return 0;
1465		1552
1466	/* If we are a multi part object, lets work our way through the check	1553	/* If we are a multi part object, let's work our way through the check
1467	* walk on's.	1554	* walk on's.
1468	*/	1555	*/
1469	for (object *tmp = op->more; tmp; tmp = tmp->more)	1556	for (object *tmp = op->more; tmp; tmp = tmp->more)
1470	if (check_move_on (tmp, originator))	1557	if (check_move_on (tmp, originator, flag))
1471	return 0;	1558	return 0;
1472	}	1559	}
1473		1560
1474	return op;	1561	return op;
1475	}	1562	}
…		…
1477	/* this function inserts an object in the map, but if it	1564	/* this function inserts an object in the map, but if it
1478	* finds an object of its own type, it'll remove that one first.	1565	* finds an object of its own type, it'll remove that one first.
1479	* op is the object to insert it under: supplies x and the map.	1566	* op is the object to insert it under: supplies x and the map.
1480	*/	1567	*/
1481	void	1568	void
1482	replace_insert_ob_in_map (const char *arch_string, object *op)	1569	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1483	{	1570	{
1484	/* first search for itself and remove any old instances */	1571	/* first search for itself and remove any old instances */
1485		1572
1486	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1573	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1487	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1574	if (tmp->arch->archname == archname) /* same archetype */
1488	tmp->destroy (1);	1575	tmp->destroy ();
1489		1576
1490	object *tmp = arch_to_object (archetype::find (arch_string));	1577	object *tmp = archetype::find (archname)->instance ();
1491		1578
1492	tmp->x = op->x;	1579	tmp->x = op->x;
1493	tmp->y = op->y;	1580	tmp->y = op->y;
1494		1581
1495	insert_ob_in_map (tmp, op->map, op, 0);	1582	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1500	{	1587	{
1501	if (where->env)	1588	if (where->env)
1502	return where->env->insert (this);	1589	return where->env->insert (this);
1503	else	1590	else
1504	return where->map->insert (this, where->x, where->y, originator, flags);	1591	return where->map->insert (this, where->x, where->y, originator, flags);
		1592	}
		1593
		1594	// check whether we can put this into the map, respect max_volume, max_items
		1595	bool
		1596	object::can_drop_at (maptile *m, int x, int y, object *originator)
		1597	{
		1598	mapspace &ms = m->at (x, y);
		1599
		1600	int items = ms.items ();
		1601
		1602	if (!items // testing !items ensures we can drop at least one item
		1603	|| (items < m->max_items
		1604	&& ms.volume () < m->max_volume))
		1605	return true;
		1606
		1607	if (originator && originator->is_player ())
		1608	originator->contr->failmsgf (
		1609	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
		1610	query_name ()
		1611	);
		1612
		1613	return false;
1505	}	1614	}
1506		1615
1507	/*	1616	/*
1508	* decrease(object, number) decreases a specified number from	1617	* decrease(object, number) decreases a specified number from
1509	* the amount of an object. If the amount reaches 0, the object	1618	* the amount of an object. If the amount reaches 0, the object
…		…
1517	if (!nr)	1626	if (!nr)
1518	return true;	1627	return true;
1519		1628
1520	nr = min (nr, nrof);	1629	nr = min (nr, nrof);
1521		1630
		1631	if (nrof > nr)
		1632	{
		1633	sint64 oweight = total_weight ();
		1634
1522	nrof -= nr;	1635	nrof -= nr;
1523
1524	if (nrof)
1525	{
1526	adjust_weight (env, -weight * nr); // carrying == 0
1527		1636
1528	if (object *pl = visible_to ())	1637	if (object *pl = visible_to ())
1529	esrv_update_item (UPD_NROF, pl, this);	1638	esrv_update_item (UPD_NROF, pl, this);
1530		1639
		1640	adjust_weight (env, oweight, total_weight ());
		1641
1531	return true;	1642	return true;
1532	}	1643	}
1533	else	1644	else
1534	{	1645	{
1535	destroy (1);	1646	destroy ();
1536	return false;	1647	return false;
1537	}	1648	}
1538	}	1649	}
1539		1650
1540	/*	1651	/*
…		…
1609	if (op->nrof)	1720	if (op->nrof)
1610	for (object *tmp = inv; tmp; tmp = tmp->below)	1721	for (object *tmp = inv; tmp; tmp = tmp->below)
1611	if (object::can_merge (tmp, op))	1722	if (object::can_merge (tmp, op))
1612	{	1723	{
1613	/* return the original object and remove inserted object	1724	/* return the original object and remove inserted object
1614	(client needs the original object) */	1725	(client prefers the original object) */
		1726
		1727	// carring must be 0 for mergable objects
		1728	sint64 oweight = tmp->weight * tmp->nrof;
		1729
1615	tmp->nrof += op->nrof;	1730	tmp->nrof += op->nrof;
1616		1731
1617	if (object *pl = tmp->visible_to ())	1732	if (object *pl = tmp->visible_to ())
1618	esrv_update_item (UPD_NROF, pl, tmp);	1733	esrv_update_item (UPD_NROF, pl, tmp);
1619		1734
1620	adjust_weight (this, op->total_weight ());	1735	adjust_weight (this, oweight, tmp->weight * tmp->nrof);
1621		1736
1622	op->destroy (1);	1737	op->destroy ();
1623	op = tmp;	1738	op = tmp;
1624	goto inserted;	1739	goto inserted;
1625	}	1740	}
1626		1741
1627	op->owner = 0; // it's his/hers now. period.	1742	op->owner = 0; // it's his/hers now. period.
…		…
1641	op->flag [FLAG_REMOVED] = 0;	1756	op->flag [FLAG_REMOVED] = 0;
1642		1757
1643	if (object *pl = op->visible_to ())	1758	if (object *pl = op->visible_to ())
1644	esrv_send_item (pl, op);	1759	esrv_send_item (pl, op);
1645		1760
1646	adjust_weight (this, op->total_weight ());	1761	adjust_weight (this, 0, op->total_weight ());
1647		1762
1648	inserted:	1763	inserted:
1649	/* reset the light list and los of the players on the map */	1764	/* reset the light list and los of the players on the map */
1650	if (op->glow_radius && map && map->darkness)	1765	if (op->glow_radius && is_on_map ())
		1766	{
		1767	update_stats ();
1651	update_all_los (map, x, y);	1768	update_all_los (map, x, y);
1652		1769	}
		1770	else if (is_player ())
1653	// if this is a player's inventory, update stats	1771	// if this is a player's inventory, update stats
1654	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])	1772	contr->queue_stats_update ();
1655	update_stats ();
1656		1773
1657	INVOKE_OBJECT (INSERT, this);	1774	INVOKE_OBJECT (INSERT, this);
1658		1775
1659	return op;	1776	return op;
1660	}	1777	}
…		…
1678	* MSW 2001-07-08: Check all objects on space, not just those below	1795	* MSW 2001-07-08: Check all objects on space, not just those below
1679	* object being inserted. insert_ob_in_map may not put new objects	1796	* object being inserted. insert_ob_in_map may not put new objects
1680	* on top.	1797	* on top.
1681	*/	1798	*/
1682	int	1799	int
1683	check_move_on (object *op, object *originator)	1800	check_move_on (object *op, object *originator, int flags)
1684	{	1801	{
		1802	if (op->flag [FLAG_NO_APPLY])
		1803	return 0;
		1804
1685	object *tmp;	1805	object *tmp;
1686	maptile *m = op->map;	1806	maptile *m = op->map;
1687	int x = op->x, y = op->y;	1807	int x = op->x, y = op->y;
1688		1808
1689	MoveType move_on, move_slow, move_block;	1809	mapspace &ms = m->at (x, y);
1690		1810
1691	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1811	ms.update ();
1692	return 0;
1693		1812
1694	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1813	MoveType move_on = ms.move_on;
1695	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1814	MoveType move_slow = ms.move_slow;
1696	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1815	MoveType move_block = ms.move_block;
1697		1816
1698	/* if nothing on this space will slow op down or be applied,	1817	/* if nothing on this space will slow op down or be applied,
1699	* no need to do checking below. have to make sure move_type	1818	* no need to do checking below. have to make sure move_type
1700	* is set, as lots of objects don't have it set - we treat that	1819	* is set, as lots of objects don't have it set - we treat that
1701	* as walking.	1820	* as walking.
…		…
1712	return 0;	1831	return 0;
1713		1832
1714	/* The objects have to be checked from top to bottom.	1833	/* The objects have to be checked from top to bottom.
1715	* Hence, we first go to the top:	1834	* Hence, we first go to the top:
1716	*/	1835	*/
1717		1836	for (object *next, *tmp = ms.top; tmp; tmp = next)
1718	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1719	{
1720	/* Trim the search when we find the first other spell effect
1721	* this helps performance so that if a space has 50 spell objects,
1722	* we don't need to check all of them.
1723	*/
1724	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1725	break;
1726	}	1837	{
		1838	next = tmp->below;
1727		1839
1728	for (; tmp; tmp = tmp->below)
1729	{
1730	if (tmp == op)	1840	if (tmp == op)
1731	continue; /* Can't apply yourself */	1841	continue; /* Can't apply yourself */
1732		1842
1733	/* Check to see if one of the movement types should be slowed down.	1843	/* Check to see if one of the movement types should be slowed down.
1734	* Second check makes sure that the movement types not being slowed	1844	* Second check makes sure that the movement types not being slowed
1735	* (~slow_move) is not blocked on this space - just because the	1845	* (~slow_move) is not blocked on this space - just because the
1736	* space doesn't slow down swimming (for example), if you can't actually	1846	* space doesn't slow down swimming (for example), if you can't actually
1737	* swim on that space, can't use it to avoid the penalty.	1847	* swim on that space, can't use it to avoid the penalty.
1738	*/	1848	*/
1739	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1849	if (!op->flag [FLAG_WIZPASS])
1740	{	1850	{
1741	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1851	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1742	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1852	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1743	{	1853	{
1744
1745	float
1746	diff = tmp->move_slow_penalty * fabs (op->speed);	1854	float diff = tmp->move_slow_penalty * fabs (op->speed);
1747		1855
1748	if (op->type == PLAYER)	1856	if (op->is_player ())
1749	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1857	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1750	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1858	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1751	diff /= 4.0;	1859	diff /= 4.0;
1752		1860
1753	op->speed_left -= diff;	1861	op->speed_left -= diff;
1754	}	1862	}
1755	}	1863	}
1756		1864
1757	/* Basically same logic as above, except now for actual apply. */	1865	/* Basically same logic as above, except now for actual apply. */
1758	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||	1866	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
1759	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))	1867	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
1760	{	1868	{
		1869	if ((flags & INS_NO_AUTO_EXIT)
		1870	&& (tmp->type == EXIT || tmp->type == TELEPORTER
		1871	|| tmp->type == HOLE || tmp->type == TRAPDOOR)) //TODO: temporary, fix exits instead
		1872	continue;
		1873
1761	move_apply (tmp, op, originator);	1874	move_apply (tmp, op, originator);
1762		1875
1763	if (op->destroyed ())	1876	if (op->destroyed ())
1764	return 1;	1877	return 1;
1765		1878
…		…
1877	void	1990	void
1878	flag_inv (object *op, int flag)	1991	flag_inv (object *op, int flag)
1879	{	1992	{
1880	for (object *tmp = op->inv; tmp; tmp = tmp->below)	1993	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1881	{	1994	{
1882	SET_FLAG (tmp, flag);	1995	tmp->set_flag (flag);
1883	flag_inv (tmp, flag);	1996	flag_inv (tmp, flag);
1884	}	1997	}
1885	}	1998	}
1886		1999
1887	/*	2000	/*
…		…
1890	void	2003	void
1891	unflag_inv (object *op, int flag)	2004	unflag_inv (object *op, int flag)
1892	{	2005	{
1893	for (object *tmp = op->inv; tmp; tmp = tmp->below)	2006	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1894	{	2007	{
1895	CLEAR_FLAG (tmp, flag);	2008	tmp->clr_flag (flag);
1896	unflag_inv (tmp, flag);	2009	unflag_inv (tmp, flag);
1897	}	2010	}
1898	}	2011	}
1899		2012
1900	/*	2013	/*
…		…
1961	* head of the object should correspond for the entire object.	2074	* head of the object should correspond for the entire object.
1962	*/	2075	*/
1963	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	2076	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
1964	continue;	2077	continue;
1965		2078
1966	if (ob->blocked (m, pos.x, pos.y))	2079	if (ob->blocked (pos.m, pos.x, pos.y))
1967	continue;	2080	continue;
1968		2081
1969	altern [index++] = i;	2082	altern [index++] = i;
1970	}	2083	}
1971		2084
…		…
2039	* there is capable of.	2152	* there is capable of.
2040	*/	2153	*/
2041	int	2154	int
2042	find_dir (maptile *m, int x, int y, object *exclude)	2155	find_dir (maptile *m, int x, int y, object *exclude)
2043	{	2156	{
2044	int i, max = SIZEOFFREE, mflags;	2157	int max = SIZEOFFREE, mflags;
2045
2046	sint16 nx, ny;
2047	object *tmp;
2048	maptile *mp;
2049
2050	MoveType blocked, move_type;	2158	MoveType move_type;
2051		2159
2052	if (exclude && exclude->head_ () != exclude)	2160	if (exclude && exclude->head_ () != exclude)
2053	{	2161	{
2054	exclude = exclude->head;	2162	exclude = exclude->head;
2055	move_type = exclude->move_type;	2163	move_type = exclude->move_type;
…		…
2058	{	2166	{
2059	/* If we don't have anything, presume it can use all movement types. */	2167	/* If we don't have anything, presume it can use all movement types. */
2060	move_type = MOVE_ALL;	2168	move_type = MOVE_ALL;
2061	}	2169	}
2062		2170
2063	for (i = 1; i < max; i++)	2171	for (int i = 1; i < max; i++)
2064	{	2172	{
2065	mp = m;	2173	mapxy pos (m, x, y);
2066	nx = x + freearr_x[i];	2174	pos.move (i);
2067	ny = y + freearr_y[i];
2068		2175
2069	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2176	if (!pos.normalise ())
2070
2071	if (mflags & P_OUT_OF_MAP)
2072	max = maxfree[i];	2177	max = maxfree[i];
2073	else	2178	else
2074	{	2179	{
2075	mapspace &ms = mp->at (nx, ny);	2180	mapspace &ms = *pos;
2076		2181
2077	blocked = ms.move_block;
2078
2079	if ((move_type & blocked) == move_type)	2182	if ((move_type & ms.move_block) == move_type)
2080	max = maxfree[i];	2183	max = maxfree [i];
2081	else if (mflags & P_IS_ALIVE)	2184	else if (ms.flags () & P_IS_ALIVE)
2082	{	2185	{
2083	for (tmp = ms.bot; tmp; tmp = tmp->above)	2186	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2084	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2187	if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2085	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2188	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2086	break;
2087
2088	if (tmp)
2089	return freedir[i];	2189	return freedir [i];
2090	}	2190	}
2091	}	2191	}
2092	}	2192	}
2093		2193
2094	return 0;	2194	return 0;
…		…
2103	{	2203	{
2104	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2204	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2105	}	2205	}
2106		2206
2107	/*	2207	/*
2108	* find_dir_2(delta-x,delta-y) will return a direction in which	2208	* find_dir_2(delta-x,delta-y) will return a direction value
2109	* an object which has subtracted the x and y coordinates of another	2209	* for running into direct [dx, dy].
2110	* object, needs to travel toward it.	2210	* (the opposite of crossfire's find_dir_2!)
2111	*/	2211	*/
2112	int	2212	int
2113	find_dir_2 (int x, int y)	2213	find_dir_2 (int x, int y)
2114	{	2214	{
		2215	#if 1 // new algorithm
		2216	// this works by putting x, y into 16 sectors, which
		2217	// are not equal sized, but are a better approximation
		2218	// then the old algorithm, and then using a mapping
		2219	// table to map it into a direction value.
		2220	// basically, it maps these comparisons to each bit
		2221	// bit #3: x < 0
		2222	// bit #2: y < 0
		2223	// bit #1: x > y
		2224	// bit #0: x > 2y
		2225
		2226	static const uint8 dir[16] = {
		2227	4, 5, 4, 3,
		2228	2, 1, 2, 3,
		2229	6, 5, 6, 7,
		2230	8, 1, 8, 7,
		2231	};
		2232	int sector = 0;
		2233
		2234	// this is a bit ugly, but more likely to result in branchless code
		2235	sector |= x < 0 ? 8 : 0;
		2236	x = x < 0 ? -x : x; // abs
		2237
		2238	sector |= y < 0 ? 4 : 0;
		2239	y = y < 0 ? -y : y; // abs
		2240
		2241	if (x > y)
		2242	{
		2243	sector |= 2;
		2244
		2245	if (x > y * 2)
		2246	sector |= 1;
		2247	}
		2248	else
		2249	{
		2250	if (y > x * 2)
		2251	sector |= 1;
		2252	else if (!y)
		2253	return 0; // x == 0 here
		2254	}
		2255
		2256	return dir [sector];
		2257	#else // old algorithm
2115	int q;	2258	int q;
2116		2259
2117	if (y)	2260	if (y)
2118	q = x * 100 / y;	2261	q = 128 * x / y;
2119	else if (x)	2262	else if (x)
2120	q = -300 * x;	2263	q = -512 * x; // to make it > 309
2121	else	2264	else
2122	return 0;	2265	return 0;
2123		2266
2124	if (y > 0)	2267	if (y > 0)
2125	{	2268	{
2126	if (q < -242)	2269	if (q < -309) return 7;
		2270	if (q < -52) return 6;
		2271	if (q < 52) return 5;
		2272	if (q < 309) return 4;
		2273
2127	return 3;	2274	return 3;
2128	if (q < -41)	2275	}
2129	return 2;	2276	else
2130	if (q < 41)	2277	{
2131	return 1;	2278	if (q < -309) return 3;
2132	if (q < 242)	2279	if (q < -52) return 2;
2133	return 8;	2280	if (q < 52) return 1;
		2281	if (q < 309) return 8;
		2282
2134	return 7;	2283	return 7;
2135	}	2284	}
2136		2285	#endif
2137	if (q < -242)
2138	return 7;
2139	if (q < -41)
2140	return 6;
2141	if (q < 41)
2142	return 5;
2143	if (q < 242)
2144	return 4;
2145
2146	return 3;
2147	}	2286	}
2148		2287
2149	/*	2288	/*
2150	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2289	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2151	* between two directions (which are expected to be absolute (see absdir())	2290	* between two directions (which are expected to be absolute (see absdir())
2152	*/	2291	*/
2153	int	2292	int
2154	dirdiff (int dir1, int dir2)	2293	dirdiff (int dir1, int dir2)
2155	{	2294	{
2156	int d;
2157
2158	d = abs (dir1 - dir2);	2295	int d = abs (dir1 - dir2);
2159	if (d > 4)
2160	d = 8 - d;
2161		2296
2162	return d;	2297	return d > 4 ? 8 - d : d;
2163	}	2298	}
2164		2299
2165	/* peterm:	2300	/* peterm:
2166	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2301	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
2167	* Basically, this is a table of directions, and what directions	2302	* Basically, this is a table of directions, and what directions
…		…
2169	* This basically means that if direction is 15, then it could either go	2304	* This basically means that if direction is 15, then it could either go
2170	* direction 4, 14, or 16 to get back to where we are.	2305	* direction 4, 14, or 16 to get back to where we are.
2171	* Moved from spell_util.c to object.c with the other related direction	2306	* Moved from spell_util.c to object.c with the other related direction
2172	* functions.	2307	* functions.
2173	*/	2308	*/
2174	int reduction_dir[SIZEOFFREE][3] = {	2309	static const int reduction_dir[SIZEOFFREE][3] = {
2175	{0, 0, 0}, /* 0 */	2310	{0, 0, 0}, /* 0 */
2176	{0, 0, 0}, /* 1 */	2311	{0, 0, 0}, /* 1 */
2177	{0, 0, 0}, /* 2 */	2312	{0, 0, 0}, /* 2 */
2178	{0, 0, 0}, /* 3 */	2313	{0, 0, 0}, /* 3 */
2179	{0, 0, 0}, /* 4 */	2314	{0, 0, 0}, /* 4 */
…		…
2273	* Add a check so we can't pick up invisible objects (0.93.8)	2408	* Add a check so we can't pick up invisible objects (0.93.8)
2274	*/	2409	*/
2275	int	2410	int
2276	can_pick (const object *who, const object *item)	2411	can_pick (const object *who, const object *item)
2277	{	2412	{
2278	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2413	return /*who->flag [FLAG_WIZ]|| */
2279	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2414	(item->weight > 0 && !item->flag [FLAG_NO_PICK] &&
2280	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2415	!item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2281	}	2416	}
2282		2417
2283	/*	2418	/*
2284	* create clone from object to another	2419	* create clone from object to another
2285	*/	2420	*/
…		…
2317	return tmp;	2452	return tmp;
2318		2453
2319	return 0;	2454	return 0;
2320	}	2455	}
2321		2456
2322	const shstr &	2457	/* Zero the key_values on op, decrementing the shared-string
2323	object::kv_get (const shstr &key) const	2458	* refcounts and freeing the links.
		2459	*/
		2460	void
		2461	key_values::clear ()
2324	{	2462	{
		2463	for (key_value *kvp = first; kvp; )
		2464	{
		2465	key_value *next = kvp->next;
		2466	delete kvp;
		2467	kvp = next;
		2468	}
		2469
		2470	first = 0;
		2471	}
		2472
		2473	shstr_tmp
		2474	key_values::get (shstr_tmp key) const
		2475	{
2325	for (key_value *kv = key_values; kv; kv = kv->next)	2476	for (key_value *kv = first; kv; kv = kv->next)
2326	if (kv->key == key)	2477	if (kv->key == key)
2327	return kv->value;	2478	return kv->value;
2328		2479
2329	return shstr_null;	2480	return shstr ();
2330	}	2481	}
2331		2482
2332	void	2483	void
2333	object::kv_set (const shstr &key, const shstr &value)	2484	key_values::add (shstr_tmp key, shstr_tmp value)
2334	{	2485	{
		2486	key_value *kv = new key_value;
		2487
		2488	kv->next = first;
		2489	kv->key = key;
		2490	kv->value = value;
		2491
		2492	first = kv;
		2493	}
		2494
		2495	void
		2496	key_values::set (shstr_tmp key, shstr_tmp value)
		2497	{
2335	for (key_value *kv = key_values; kv; kv = kv->next)	2498	for (key_value *kv = first; kv; kv = kv->next)
2336	if (kv->key == key)	2499	if (kv->key == key)
2337	{	2500	{
2338	kv->value = value;	2501	kv->value = value;
2339	return;	2502	return;
2340	}	2503	}
2341		2504
2342	key_value *kv = new key_value;	2505	add (key, value);
2343
2344	kv->next = key_values;
2345	kv->key = key;
2346	kv->value = value;
2347
2348	key_values = kv;
2349	}	2506	}
2350		2507
2351	void	2508	void
2352	object::kv_del (const shstr &key)	2509	key_values::del (shstr_tmp key)
2353	{	2510	{
2354	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)	2511	for (key_value **kvp = &first; *kvp; kvp = &(*kvp)->next)
2355	if ((*kvp)->key == key)	2512	if ((*kvp)->key == key)
2356	{	2513	{
2357	key_value *kv = *kvp;	2514	key_value *kv = *kvp;
2358	*kvp = (*kvp)->next;	2515	*kvp = (*kvp)->next;
2359	delete kv;	2516	delete kv;
2360	return;	2517	return;
2361	}	2518	}
2362	}	2519	}
2363		2520
		2521	void
		2522	key_values::reverse ()
		2523	{
		2524	key_value *prev = 0;
		2525	key_value *head = first;
		2526
		2527	while (head)
		2528	{
		2529	key_value *node = head;
		2530	head = head->next;
		2531	node->next = prev;
		2532	prev = node;
		2533	}
		2534
		2535	first = prev;
		2536	}
		2537
		2538	key_values &
		2539	key_values::operator =(const key_values &kv)
		2540	{
		2541	clear ();
		2542
		2543	for (key_value *kvp = kv.first; kvp; kvp = kvp->next)
		2544	add (kvp->key, kvp->value);
		2545
		2546	reverse ();
		2547	}
		2548
2364	object::depth_iterator::depth_iterator (object *container)	2549	object::depth_iterator::depth_iterator (object *container)
2365	: iterator_base (container)	2550	: iterator_base (container)
2366	{	2551	{
2367	while (item->inv)	2552	while (item->inv)
2368	item = item->inv;	2553	item = item->inv;
…		…
2416	{	2601	{
2417	char flagdesc[512];	2602	char flagdesc[512];
2418	char info2[256 * 4];	2603	char info2[256 * 4];
2419	char *p = info;	2604	char *p = info;
2420		2605
2421	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2606	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2422	count,	2607	count,
2423	uuid.c_str (),	2608	uuid.c_str (),
2424	&name,	2609	&name,
2425	title ? "\",title:\"" : "",	2610	title ? ",title:\"" : "",
2426	title ? (const char *)title : "",	2611	title ? (const char *)title : "",
		2612	title ? "\"" : "",
2427	flag_desc (flagdesc, 512), type);	2613	flag_desc (flagdesc, 512), type);
2428		2614
2429	if (!flag[FLAG_REMOVED] && env)	2615	if (!flag[FLAG_REMOVED] && env)
2430	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2616	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2431		2617
…		…
2447	struct region *	2633	struct region *
2448	object::region () const	2634	object::region () const
2449	{	2635	{
2450	return map ? map->region (x, y)	2636	return map ? map->region (x, y)
2451	: region::default_region ();	2637	: region::default_region ();
2452	}
2453
2454	const materialtype_t *
2455	object::dominant_material () const
2456	{
2457	if (materialtype_t *mt = name_to_material (materialname))
2458	return mt;
2459
2460	return name_to_material (shstr_unknown);
2461	}	2638	}
2462		2639
2463	void	2640	void
2464	object::open_container (object *new_container)	2641	object::open_container (object *new_container)
2465	{	2642	{
…		…
2487	container = 0;	2664	container = 0;
2488		2665
2489	// client needs item update to make it work, client bug requires this to be separate	2666	// client needs item update to make it work, client bug requires this to be separate
2490	esrv_update_item (UPD_FLAGS, this, old_container);	2667	esrv_update_item (UPD_FLAGS, this, old_container);
2491		2668
2492	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2669	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2493	play_sound (sound_find ("chest_close"));	2670	play_sound (sound_find ("chest_close"));
2494	}	2671	}
2495		2672
2496	if (new_container)	2673	if (new_container)
2497	{	2674	{
…		…
2501	// TODO: this does not seem to serve any purpose anymore?	2678	// TODO: this does not seem to serve any purpose anymore?
2502	#if 0	2679	#if 0
2503	// insert the "Close Container" object.	2680	// insert the "Close Container" object.
2504	if (archetype *closer = new_container->other_arch)	2681	if (archetype *closer = new_container->other_arch)
2505	{	2682	{
2506	object *closer = arch_to_object (new_container->other_arch);	2683	object *closer = new_container->other_arch->instance ();
2507	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2684	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2508	new_container->insert (closer);	2685	new_container->insert (closer);
2509	}	2686	}
2510	#endif	2687	#endif
2511		2688
2512	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2689	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2513		2690
2514	// make sure the container is available, client bug requires this to be separate	2691	// make sure the container is available, client bug requires this to be separate
2515	esrv_send_item (this, new_container);	2692	esrv_send_item (this, new_container);
2516		2693
2517	new_container->flag [FLAG_APPLIED] = true;	2694	new_container->flag [FLAG_APPLIED] = true;
…		…
2525	// else if (!old_container->env && contr && contr->ns)	2702	// else if (!old_container->env && contr && contr->ns)
2526	// contr->ns->floorbox_reset ();	2703	// contr->ns->floorbox_reset ();
2527	}	2704	}
2528		2705
2529	object *	2706	object *
2530	object::force_find (const shstr name)	2707	object::force_find (shstr_tmp name)
2531	{	2708	{
2532	/* cycle through his inventory to look for the MARK we want to	2709	/* cycle through his inventory to look for the MARK we want to
2533	* place	2710	* place
2534	*/	2711	*/
2535	for (object *tmp = inv; tmp; tmp = tmp->below)	2712	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2537	return splay (tmp);	2714	return splay (tmp);
2538		2715
2539	return 0;	2716	return 0;
2540	}	2717	}
2541		2718
		2719	//-GPL
		2720
2542	void	2721	void
		2722	object::force_set_timer (int duration)
		2723	{
		2724	this->duration = 1;
		2725	this->speed_left = -1.f;
		2726
		2727	this->set_speed (duration ? 1.f / duration : 0.f);
		2728	}
		2729
		2730	object *
2543	object::force_add (const shstr name, int duration)	2731	object::force_add (shstr_tmp name, int duration)
2544	{	2732	{
2545	if (object *force = force_find (name))	2733	if (object *force = force_find (name))
2546	force->destroy ();	2734	force->destroy ();
2547		2735
2548	object *force = get_archetype (FORCE_NAME);	2736	object *force = archetype::get (FORCE_NAME);
2549		2737
2550	force->slaying = name;	2738	force->slaying = name;
2551	force->stats.food = 1;	2739	force->force_set_timer (duration);
2552	force->speed_left = -1.f;
2553
2554	force->set_speed (duration ? 1.f / duration : 0.f);
2555	force->flag [FLAG_IS_USED_UP] = true;
2556	force->flag [FLAG_APPLIED] = true;	2740	force->flag [FLAG_APPLIED] = true;
2557		2741
2558	insert (force);	2742	return insert (force);
2559	}	2743	}
2560		2744
2561	void	2745	void
2562	object::play_sound (faceidx sound)	2746	object::play_sound (faceidx sound) const
2563	{	2747	{
2564	if (!sound)	2748	if (!sound)
2565	return;	2749	return;
2566		2750
2567	if (flag [FLAG_REMOVED])	2751	if (is_on_map ())
		2752	map->play_sound (sound, x, y);
		2753	else if (object *pl = in_player ())
		2754	pl->contr->play_sound (sound);
		2755	}
		2756
		2757	void
		2758	object::say_msg (const char *msg) const
		2759	{
		2760	if (is_on_map ())
		2761	map->say_msg (msg, x, y);
		2762	else if (object *pl = in_player ())
		2763	pl->contr->play_sound (sound);
		2764	}
		2765
		2766	void
		2767	object::make_noise ()
		2768	{
		2769	// we do not model noise in the map, so instead put
		2770	// a temporary light into the noise source
		2771	// could use the map instead, but that's less reliable for our
		2772	// goal, which is to make invisibility a bit harder to exploit
		2773
		2774	// currently only works sensibly for players
		2775	if (!is_player ())
2568	return;	2776	return;
2569		2777
2570	if (env)	2778	// find old force, or create new one
2571	{	2779	object *force = force_find (shstr_noise_force);
2572	if (object *pl = in_player ())	2780
2573	pl->contr->play_sound (sound);	2781	if (force)
2574	}	2782	force->speed_left = -1.f; // patch old speed up
2575	else	2783	else
2576	map->play_sound (sound, x, y);	2784	{
2577	}	2785	force = archetype::get (shstr_noise_force);
2578		2786
		2787	force->slaying = shstr_noise_force;
		2788	force->stats.food = 1;
		2789	force->speed_left = -1.f;
		2790
		2791	force->set_speed (1.f / 4.f);
		2792	force->flag [FLAG_IS_USED_UP] = true;
		2793	force->flag [FLAG_APPLIED] = true;
		2794
		2795	insert (force);
		2796	}
		2797	}
		2798
		2799	void object::change_move_type (MoveType mt)
		2800	{
		2801	if (move_type == mt)
		2802	return;
		2803
		2804	if (is_on_map ())
		2805	{
		2806	// we are on the map, so handle move_on/off effects
		2807	remove ();
		2808	move_type = mt;
		2809	map->insert (this, x, y, this);
		2810	}
		2811	else
		2812	move_type = mt;
		2813	}
		2814
		2815	/* object should be a player.
		2816	* we return the object the player has marked with the 'mark' command
		2817	* below. If no match is found (or object has changed), we return
		2818	* NULL. We leave it up to the calling function to print messages if
		2819	* nothing is found.
		2820	*/
		2821	object *
		2822	object::mark () const
		2823	{
		2824	if (contr && contr->mark && contr->mark->env == this)
		2825	return contr->mark;
		2826	else
		2827	return 0;
		2828	}
		2829
		2830	// put marked object first in the inventory
		2831	// this is used by identify-like spells so players can influence
		2832	// the order a bit.
		2833	void
		2834	object::splay_marked ()
		2835	{
		2836	if (object *marked = mark ())
		2837	splay (marked);
		2838	}
		2839

Diff Legend

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