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.290 by sf-marcmagus, Sun Oct 11 05:43:35 2009 UTC vs.
Revision 1.350 by root, Sun May 8 12:40:41 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,2009 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	uint32_t mapspace::smellcount = 10000;
38		38
39	objectvec objects;	39	objectvec objects;
40	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
41		49
42	short freearr_x[SIZEOFFREE] = {	50	short freearr_x[SIZEOFFREE] = {
43	0,	51	0,
44	0, 1, 1, 1, 0, -1, -1, -1,	52	0, 1, 1, 1, 0, -1, -1, -1,
45	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	53	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
…		…
49	0,	57	0,
50	-1, -1, 0, 1, 1, 1, 0, -1,	58	-1, -1, 0, 1, 1, 1, 0, -1,
51	-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,
52	-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
53	};	61	};
54	int maxfree[SIZEOFFREE] = {
55	0,
56	9, 10, 13, 14, 17, 18, 21, 22,
57	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
58	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
59	};
60	int freedir[SIZEOFFREE] = {	62	int freedir[SIZEOFFREE] = {
61	0,	63	0,
62	1, 2, 3, 4, 5, 6, 7, 8,	64	1, 2, 3, 4, 5, 6, 7, 8,
63	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,
64	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
65	};	67	};
66		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
67	static void	95	static void
68	write_uuid (uval64 skip, bool sync)	96	write_uuid (uval64 skip, bool sync)
69	{	97	{
70	CALL_BEGIN (2);	98	CALL_BEGIN (2);
71	CALL_ARG_SV (newSVval64 (skip));	99	CALL_ARG_SV (newSVval64 (skip));
…		…
73	CALL_CALL ("cf::write_uuid", G_DISCARD);	101	CALL_CALL ("cf::write_uuid", G_DISCARD);
74	CALL_END;	102	CALL_END;
75	}	103	}
76		104
77	static void	105	static void
78	read_uuid (void)	106	read_uuid ()
79	{	107	{
80	char filename[MAX_BUF];	108	char filename[MAX_BUF];
81		109
82	sprintf (filename, "%s/uuid", settings.localdir);	110	sprintf (filename, "%s/uuid", settings.localdir);
83		111
…		…
97		125
98	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	126	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
99	_exit (1);	127	_exit (1);
100	}	128	}
101		129
102	UUID::BUF buf;	130	char buf [UUID::MAX_LEN];
103	buf[0] = 0;	131	buf[0] = 0;
104	fgets (buf, sizeof (buf), fp);	132	fgets (buf, sizeof (buf), fp);
105		133
106	if (!UUID::cur.parse (buf))	134	if (!UUID::cur.parse (buf))
107	{	135	{
…		…
134		162
135	void	163	void
136	UUID::init ()	164	UUID::init ()
137	{	165	{
138	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;
139	}	232	}
140		233
141	/* 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. */
142	static bool	235	static bool
143	compare_ob_value_lists_one (const object *wants, const object *has)	236	compare_ob_value_lists_one (const object *wants, const object *has)
144	{	237	{
145	/* n-squared behaviour (see kv_get), but I'm hoping both	238	/* n-squared behaviour (see kv.get), but I'm hoping both
146	* 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
147	* different structure or at least keep the lists sorted...	240	* different structure or at least keep the lists sorted...
148	*/	241	*/
149		242
150	/* For each field in wants, */	243	/* For each field in wants, */
151	for (key_value *kv = wants->key_values; kv; kv = kv->next)	244	for (key_value *kv = wants->kv.first; kv; kv = kv->next)
152	if (has->kv_get (kv->key) != kv->value)	245	if (has->kv.get (kv->key) != kv->value)
153	return false;	246	return false;
154		247
155	/* 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. */
156	return true;	249	return true;
157	}	250	}
…		…
179	* Improvements made with merge: Better checking on potion, and also	272	* Improvements made with merge: Better checking on potion, and also
180	* check weight	273	* check weight
181	*/	274	*/
182	bool object::can_merge_slow (object *ob1, object *ob2)	275	bool object::can_merge_slow (object *ob1, object *ob2)
183	{	276	{
184	/* A couple quicksanity checks */	277	/* A couple quick sanity checks */
185	if (ob1 == ob2	278	if (ob1 == ob2
186	|| ob1->type != ob2->type	279	|| ob1->type != ob2->type
187	|| ob1->speed != ob2->speed
188	|| ob1->value != ob2->value	280	|| ob1->value != ob2->value
189	|| 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)
190	return 0;	284	return 0;
191		285
192	/* Do not merge objects if nrof would overflow, assume nrof	286	/* Do not merge objects if nrof would overflow, assume nrof
193	* is always 0 .. 2**31-1 */	287	* is always 0 .. 2**31-1 */
194	if (ob1->nrof > 0x7fffffff - ob2->nrof)	288	if (ob1->nrof > 0x7fffffff - ob2->nrof)
…		…
198	* 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
199	* 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
200	* 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
201	* flags lose any meaning.	295	* flags lose any meaning.
202	*/	296	*/
203	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	297	if (ob1->flag [FLAG_IDENTIFIED])
204	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	298	ob1->set_flag (FLAG_BEEN_APPLIED);
205		299
206	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	300	if (ob2->flag [FLAG_IDENTIFIED])
207	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	301	ob2->set_flag (FLAG_BEEN_APPLIED);
208		302
209	if (ob1->arch->archname != ob2->arch->archname	303	if (ob1->arch->archname != ob2->arch->archname
210	|| ob1->name != ob2->name	304	|| ob1->name != ob2->name
211	|| ob1->title != ob2->title	305	|| ob1->title != ob2->title
212	|| ob1->msg != ob2->msg	306	|| ob1->msg != ob2->msg
…		…
215	|| ob1->magic != ob2->magic	309	|| ob1->magic != ob2->magic
216	|| ob1->slaying != ob2->slaying	310	|| ob1->slaying != ob2->slaying
217	|| ob1->skill != ob2->skill	311	|| ob1->skill != ob2->skill
218	|| ob1->value != ob2->value	312	|| ob1->value != ob2->value
219	|| ob1->animation_id != ob2->animation_id	313	|| ob1->animation_id != ob2->animation_id
220	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other	314	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
221	|| ob1->client_type != ob2->client_type	315	|| ob1->client_type != ob2->client_type
222	|| ob1->materialname != ob2->materialname	316	|| ob1->material != ob2->material
223	|| ob1->lore != ob2->lore	317	|| ob1->lore != ob2->lore
224	|| ob1->subtype != ob2->subtype	318	|| ob1->subtype != ob2->subtype
225	|| ob1->move_type != ob2->move_type	319	|| ob1->move_type != ob2->move_type
226	|| ob1->move_block != ob2->move_block	320	|| ob1->move_block != ob2->move_block
227	|| ob1->move_allow != ob2->move_allow	321	|| ob1->move_allow != ob2->move_allow
228	|| ob1->move_on != ob2->move_on	322	|| ob1->move_on != ob2->move_on
229	|| ob1->move_off != ob2->move_off	323	|| ob1->move_off != ob2->move_off
230	|| ob1->move_slow != ob2->move_slow	324	|| ob1->move_slow != ob2->move_slow
231	|| ob1->move_slow_penalty != ob2->move_slow_penalty	325	|| fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
232	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))	326	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
233	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	327	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
234	return 0;	328	return 0;
235		329
236	if ((ob1->flag ^ ob2->flag)	330	if ((ob1->flag ^ ob2->flag)
…		…
261		355
262	/* 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,
263	* 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
264	* some items equipped, and we don't want those to merge.	358	* some items equipped, and we don't want those to merge.
265	*/	359	*/
266	if (QUERY_FLAG (ob1, FLAG_APPLIED) || QUERY_FLAG (ob2, FLAG_APPLIED))	360	if (ob1->flag [FLAG_APPLIED] || ob2->flag [FLAG_APPLIED])
267	return 0;	361	return 0;
268		362
269	/* 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
270	* 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
271	* check?	365	* check?
272	*/	366	*/
273	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())	367	if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ())
274	return 0;	368	return 0;
275		369
276	switch (ob1->type)	370	switch (ob1->type)
277	{	371	{
278	case SCROLL:	372	case SCROLL:
279	if (ob1->level != ob2->level)	373	if (ob1->level != ob2->level)
280	return 0;	374	return 0;
281	break;	375	break;
282	}	376	}
283		377
284	if (ob1->key_values || ob2->key_values)	378	if (!ob1->kv.empty () || !ob2->kv.empty ())
285	{	379	{
286	/* At least one of these has key_values. */	380	/* At least one of these has key_values. */
287	if ((!ob1->key_values) != (!ob2->key_values))	381	if (ob1->kv.empty () != ob2->kv.empty ())
288	return 0; /* One has fields, but the other one doesn't. */	382	return 0; /* One has fields, but the other one doesn't. */
289		383
290	if (!compare_ob_value_lists (ob1, ob2))	384	if (!compare_ob_value_lists (ob1, ob2))
291	return 0;	385	return 0;
292	}	386	}
…		…
334		428
335	// 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
336	// even if our inv is in a player.	430	// even if our inv is in a player.
337	if (envest->is_on_map ())	431	if (envest->is_on_map ())
338	if (object *pl = envest->ms ().player ())	432	if (object *pl = envest->ms ().player ())
339	if (pl->container == env)	433	if (pl->container_ () == env)
340	return pl;	434	return pl;
341	}	435	}
342	else	436	else
343	{	437	{
344	// maybe there is a player standing on the same mapspace	438	// maybe there is a player standing on the same mapspace
345	// this will catch the case where "this" is a player	439	// this will catch the case where "this" is a player
346	if (object *pl = ms ().player ())	440	if (object *pl = ms ().player ())
347	if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look)	441	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
348	|| this == pl->container)	442	|| pl->container_ () == this)
349	return pl;	443	return pl;
350	}	444	}
351	}	445	}
352		446
353	return 0;	447	return 0;
354	}	448	}
355		449
356	// adjust weight per container type ("of holding")	450	// adjust weight per container type ("of holding")
357	static sint32	451	static uint32
358	weight_adjust_for (object *op, sint32 weight)	452	weight_adjust_for (object *op, uint32 weight)
359	{	453	{
360	return op->type == CONTAINER	454	return op->type == CONTAINER
361	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	455	? weight - weight * op->stats.Str / 100
362	: weight;	456	: weight;
363	}	457	}
364		458
365	/*	459	/*
366	* adjust_weight(object, weight) adds the specified weight to an object,	460	* subtracts, then adds, the specified weight to an object,
367	* and also updates how much the environment(s) is/are carrying.	461	* and also updates how much the environment(s) is/are carrying.
368	*/	462	*/
369	static void	463	static void
370	adjust_weight (object *op, sint32 weight)	464	adjust_weight (object *op, sint32 sub, sint32 add)
371	{	465	{
372	while (op)	466	while (op)
373	{	467	{
374	// adjust by actual difference to account for rounding errors	468	sint32 ocarrying = op->carrying;
375	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
376	weight = weight_adjust_for (op, op->carrying)
377	- weight_adjust_for (op, op->carrying - weight);
378		469
379	if (!weight)	470	op->carrying -= weight_adjust_for (op, sub);
380	return;	471	op->carrying += weight_adjust_for (op, add);
381
382	op->carrying += weight;
383		472
384	if (object *pl = op->visible_to ())	473	if (object *pl = op->visible_to ())
385	if (pl != op) // player is handled lazily	474	if (pl != op) // player is handled lazily
386	esrv_update_item (UPD_WEIGHT, pl, op);	475	esrv_update_item (UPD_WEIGHT, pl, op);
387		476
		477	sub = ocarrying;
		478	add = op->carrying;
		479
388	op = op->env;	480	op = op->env;
389	}	481	}
390	}	482	}
391		483
392	/*	484	/*
…		…
399	{	491	{
400	sint32 sum = 0;	492	sint32 sum = 0;
401		493
402	for (object *op = inv; op; op = op->below)	494	for (object *op = inv; op; op = op->below)
403	{	495	{
404	if (op->inv)
405	op->update_weight ();	496	op->update_weight ();
406		497
407	sum += op->total_weight ();	498	sum += weight_adjust_for (this, op->total_weight ());
408	}	499	}
409
410	sum = weight_adjust_for (this, sum);
411		500
412	if (sum != carrying)	501	if (sum != carrying)
413	{	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
414	carrying = sum;	507	carrying = sum;
415		508
416	if (object *pl = visible_to ())	509	if (object *pl = visible_to ())
417	if (pl != this) // player is handled lazily	510	if (pl != this) // player is handled lazily
418	esrv_update_item (UPD_WEIGHT, pl, this);	511	esrv_update_item (UPD_WEIGHT, pl, this);
…		…
438	{	531	{
439	return dump_object (this);	532	return dump_object (this);
440	}	533	}
441		534
442	/*	535	/*
443	* get_nearest_part(multi-object, object 2) returns the part of the
444	* multi-object 1 which is closest to the second object.
445	* If it's not a multi-object, it is returned.
446	*/
447	object *
448	get_nearest_part (object *op, const object *pl)
449	{
450	object *tmp, *closest;
451	int last_dist, i;
452
453	if (!op->more)
454	return op;
455
456	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
457	tmp;
458	tmp = tmp->more)
459	if ((i = distance (tmp, pl)) < last_dist)
460	closest = tmp, last_dist = i;
461
462	return closest;
463	}
464
465	/*
466	* 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.
467	* VERRRY slow.	537	* VERRRY slow.
468	*/	538	*/
469	object *	539	object *
470	find_object (tag_t i)	540	find_object (tag_t i)
471	{	541	{
472	for_all_objects (op)	542	for_all_objects (op)
473	if (op->count == i)	543	if (op->count == i)
		544	return op;
		545
		546	return 0;
		547	}
		548
		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)
474	return op;	559	return op;
475		560
476	return 0;	561	return 0;
477	}	562	}
478		563
…		…
512	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 ());
513	return;	598	return;
514	}	599	}
515		600
516	this->owner = owner;	601	this->owner = owner;
517	}
518
519	int
520	object::slottype () const
521	{
522	if (type == SKILL)
523	{
524	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
525	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
526	}
527	else
528	{
529	if (slot [body_combat].info) return slot_combat;
530	if (slot [body_range ].info) return slot_ranged;
531	}
532
533	return slot_none;
534	}
535
536	bool
537	object::change_weapon (object *ob)
538	{
539	if (current_weapon == ob)
540	return true;
541
542	if (chosen_skill)
543	chosen_skill->flag [FLAG_APPLIED] = false;
544
545	current_weapon = ob;
546	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
547
548	if (chosen_skill)
549	chosen_skill->flag [FLAG_APPLIED] = true;
550
551	update_stats ();
552
553	if (ob)
554	{
555	// now check wether any body locations became invalid, in which case
556	// we cannot apply the weapon at the moment.
557	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
558	if (slot[i].used < 0)
559	{
560	current_weapon = chosen_skill = 0;
561	update_stats ();
562
563	new_draw_info_format (NDI_UNIQUE, 0, this,
564	"You try to balance all your items at once, "
565	"but the %s is just too much for your body. "
566	"[You need to unapply some items first - use the 'body' command to see "
567	"how many items you cna wera on a specific body part.]", &ob->name);
568	return false;
569	}
570
571	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
572	}
573	else
574	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
575
576	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
577	{
578	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
579	&name, ob->debug_desc ());
580	return false;
581	}
582
583	return true;
584	}
585
586	/* Zero the key_values on op, decrementing the shared-string
587	* refcounts and freeing the links.
588	*/
589	static void
590	free_key_values (object *op)
591	{
592	for (key_value *i = op->key_values; i; )
593	{
594	key_value *next = i->next;
595	delete i;
596
597	i = next;
598	}
599
600	op->key_values = 0;
601	}	602	}
602		603
603	/*	604	/*
604	* copy_to first frees everything allocated by the dst object,	605	* copy_to first frees everything allocated by the dst object,
605	* and then copies the contents of itself into the second	606	* and then copies the contents of itself into the second
…		…
611	void	612	void
612	object::copy_to (object *dst)	613	object::copy_to (object *dst)
613	{	614	{
614	dst->remove ();	615	dst->remove ();
615	*(object_copy *)dst = *this;	616	*(object_copy *)dst = *this;
		617
		618	// maybe move to object_copy?
		619	dst->kv = kv;
		620
616	dst->flag [FLAG_REMOVED] = true;	621	dst->flag [FLAG_REMOVED] = true;
617
618	/* Copy over key_values, if any. */
619	if (key_values)
620	{
621	key_value *tail = 0;
622	dst->key_values = 0;
623
624	for (key_value *i = key_values; i; i = i->next)
625	{
626	key_value *new_link = new key_value;
627
628	new_link->next = 0;
629	new_link->key = i->key;
630	new_link->value = i->value;
631
632	/* Try and be clever here, too. */
633	if (!dst->key_values)
634	{
635	dst->key_values = new_link;
636	tail = new_link;
637	}
638	else
639	{
640	tail->next = new_link;
641	tail = new_link;
642	}
643	}
644	}
645
646	if (speed < 0)
647	dst->speed_left -= rndm ();
648
649	dst->activate ();	622	dst->activate ();
650	}	623	}
651		624
652	void	625	void
653	object::instantiate ()	626	object::instantiate ()
654	{	627	{
655	if (!uuid.seq) // HACK	628	if (!uuid.seq) // HACK
656	uuid = UUID::gen ();	629	uuid = UUID::gen ();
657		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
658	speed_left = -0.1f;	635	speed_left = -1.;
		636
659	/* 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
660	* 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.
661	* 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
662	* values for the body_used info, so when items are created	640	* values for the body_used info, so when items are created
663	* for it, they can be properly equipped.	641	* for it, they can be properly equipped.
…		…
671	object *	649	object *
672	object::clone ()	650	object::clone ()
673	{	651	{
674	object *neu = create ();	652	object *neu = create ();
675	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
676	neu->map = map; // not copied by copy_to	659	neu->map = map; // not copied by copy_to
677	return neu;	660	return neu;
678	}	661	}
679		662
680	/*	663	/*
…		…
683	* 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.
684	*/	667	*/
685	void	668	void
686	update_turn_face (object *op)	669	update_turn_face (object *op)
687	{	670	{
688	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)	671	if (!op->flag [FLAG_IS_TURNABLE] || !op->arch)
689	return;	672	return;
690		673
691	SET_ANIMATION (op, op->direction);	674	SET_ANIMATION (op, op->direction);
692	update_object (op, UP_OBJ_FACE);	675	update_object (op, UP_OBJ_FACE);
693	}	676	}
…		…
698	* 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.
699	*/	682	*/
700	void	683	void
701	object::set_speed (float speed)	684	object::set_speed (float speed)
702	{	685	{
703	if (flag [FLAG_FREED] && speed)
704	{
705	LOG (llevError, "Object %s is freed but has speed.\n", &name);
706	speed = 0;
707	}
708
709	this->speed = speed;	686	this->speed = speed;
710		687
711	if (has_active_speed ())	688	if (has_active_speed ())
712	activate ();	689	activate ();
713	else	690	else
…		…
760	}	737	}
761		738
762	mapspace &m = op->ms ();	739	mapspace &m = op->ms ();
763		740
764	if (!(m.flags_ & P_UPTODATE))	741	if (!(m.flags_ & P_UPTODATE))
765	/* nop */;	742	m.update_up (); // nothing to do except copy up
766	else if (action == UP_OBJ_INSERT)	743	else if (action == UP_OBJ_INSERT)
767	{	744	{
		745	#if 0
768	// this is likely overkill, TODO: revisit (schmorp)	746	// this is likely overkill, TODO: revisit (schmorp)
769	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	747	if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW))
770	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	748	|| (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC))
771	|| (op->is_player () && !(m.flags_ & P_PLAYER))	749	|| (op->is_player () && !(m.flags_ & P_PLAYER))
772	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	750	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
773	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	751	|| (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE))
774	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	752	|| (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC))
775	|| (m.move_on | op->move_on ) != m.move_on	753	|| (m.move_on | op->move_on ) != m.move_on
776	|| (m.move_off | op->move_off ) != m.move_off	754	|| (m.move_off | op->move_off ) != m.move_off
777	|| (m.move_slow | op->move_slow) != m.move_slow	755	|| (m.move_slow | op->move_slow) != m.move_slow
778	/* 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
779	* have move_allow right now.	757	* have move_allow right now.
780	*/	758	*/
781	|| ((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
782	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
783	m.invalidate ();	760	m.invalidate ();
		761	#else
		762	// the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
		763	m.invalidate ();
		764	#endif
784	}	765	}
785	/* if the object is being removed, we can't make intelligent	766	/* if the object is being removed, we can't make intelligent
786	* decisions, because remove_ob can't really pass the object	767	* decisions, because remove_ob can't really pass the object
787	* that is being removed.	768	* that is being removed.
788	*/	769	*/
789	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	770	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
790	m.invalidate ();	771	m.invalidate ();
791	else if (action == UP_OBJ_FACE)	772	else if (action == UP_OBJ_FACE)
792	/* Nothing to do for that case */ ;	773	m.update_up (); // nothing to do for that case, except copy up
793	else	774	else
794	LOG (llevError, "update_object called with invalid action: %d\n", action);	775	LOG (llevError, "update_object called with invalid action: %d\n", action);
795		776
796	if (op->more)	777	if (op->more)
797	update_object (op->more, action);	778	update_object (op->more, action);
798	}	779	}
799		780
800	object::object ()	781	object::object ()
801	{	782	{
802	SET_FLAG (this, FLAG_REMOVED);	783	this->set_flag (FLAG_REMOVED);
803		784
804	//expmul = 1.0; declared const for the time being	785	//expmul = 1.0; declared const for the time being
805	face = blank_face;	786	face = blank_face;
		787	material = MATERIAL_NULL;
806	}	788	}
807		789
808	object::~object ()	790	object::~object ()
809	{	791	{
810	unlink ();	792	unlink ();
811		793
812	free_key_values (this);	794	kv.clear ();
813	}	795	}
814
815	static int object_count;
816		796
817	void object::link ()	797	void object::link ()
818	{	798	{
819	assert (!index);//D	799	assert (!index);//D
820	uuid = UUID::gen ();	800	uuid = UUID::gen ();
821	count = ++object_count;
822		801
823	refcnt_inc ();	802	refcnt_inc ();
824	objects.insert (this);	803	objects.insert (this);
		804
		805	++create_count;
		806
825	}	807	}
826		808
827	void object::unlink ()	809	void object::unlink ()
828	{	810	{
829	if (!index)	811	if (!index)
830	return;	812	return;
		813
		814	++destroy_count;
831		815
832	objects.erase (this);	816	objects.erase (this);
833	refcnt_dec ();	817	refcnt_dec ();
834	}	818	}
835		819
…		…
914	* if some form of movement is allowed, let objects	898	* if some form of movement is allowed, let objects
915	* drop on that space.	899	* drop on that space.
916	*/	900	*/
917	if (!drop_to_ground	901	if (!drop_to_ground
918	|| !map	902	|| !map
919	|| map->in_memory != MAP_ACTIVE	903	|| !map->linkable ()
920	|| map->no_drop	904	|| map->no_drop
921	|| ms ().move_block == MOVE_ALL)	905	|| ms ().move_block == MOVE_ALL)
922	{	906	{
923	while (inv)	907	while (inv)
924	inv->destroy ();	908	inv->destroy ();
…		…
940	map->insert (op, x, y);	924	map->insert (op, x, y);
941	}	925	}
942	}	926	}
943	}	927	}
944		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 *
945	object *object::create ()	966	object::create ()
946	{	967	{
947	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
948	op->link ();	990	op->link ();
		991
949	return op;	992	return op;
950	}	993	}
951		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
		1010	// special "grave" map used to store all removed objects
		1011	// till they can be destroyed - saves a lot of checks in the rest
		1012	// of the code
952	static struct freed_map : maptile	1013	static struct freed_map
		1014	: maptile
953	{	1015	{
954	freed_map ()	1016	freed_map ()
		1017	: maptile (3, 3)
955	{	1018	{
956	path = "<freed objects map>";	1019	path = "<freed objects map>";
957	name = "/internal/freed_objects_map";	1020	name = "/internal/freed_objects_map";
958	width = 3;
959	height = 3;
960	no_drop = 1;	1021	no_drop = 1;
961	no_reset = 1;	1022	no_reset = 1;
962		1023
963	alloc ();
964	in_memory = MAP_ACTIVE;	1024	state = MAP_ACTIVE;
965	}	1025	}
966		1026
967	~freed_map ()	1027	~freed_map ()
968	{	1028	{
969	destroy ();	1029	destroy ();
…		…
1019	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");	1079	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1020	head->destroy ();	1080	head->destroy ();
1021	return;	1081	return;
1022	}	1082	}
1023		1083
1024	destroy_inv (false);	1084	destroy_inv_fast ();
1025		1085
1026	if (is_head ())	1086	if (is_head ())
1027	if (sound_destroy)	1087	if (sound_destroy)
1028	play_sound (sound_destroy);	1088	play_sound (sound_destroy);
1029	else if (flag [FLAG_MONSTER])	1089	else if (flag [FLAG_MONSTER])
…		…
1040	* the previous environment.	1100	* the previous environment.
1041	*/	1101	*/
1042	void	1102	void
1043	object::do_remove ()	1103	object::do_remove ()
1044	{	1104	{
1045	object *tmp, *last = 0;
1046	object *otmp;
1047
1048	if (flag [FLAG_REMOVED])	1105	if (flag [FLAG_REMOVED])
1049	return;	1106	return;
1050		1107
1051	INVOKE_OBJECT (REMOVE, this);	1108	INVOKE_OBJECT (REMOVE, this);
1052		1109
…		…
1064	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed	1121	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1065	if (object *pl = visible_to ())	1122	if (object *pl = visible_to ())
1066	esrv_del_item (pl->contr, count);	1123	esrv_del_item (pl->contr, count);
1067	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1124	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1068		1125
1069	adjust_weight (env, -total_weight ());	1126	adjust_weight (env, total_weight (), 0);
1070		1127
1071	object *pl = in_player ();	1128	object *pl = in_player ();
1072		1129
1073	/* we set up values so that it could be inserted into	1130	/* we set up values so that it could be inserted into
1074	* the map, but we don't actually do that - it is up	1131	* the map, but we don't actually do that - it is up
…		…
1084		1141
1085	above = 0;	1142	above = 0;
1086	below = 0;	1143	below = 0;
1087	env = 0;	1144	env = 0;
1088		1145
1089	/* NO_FIX_PLAYER is set when a great many changes are being	1146	if (pl && pl->is_player ())
1090	* made to players inventory. If set, avoiding the call
1091	* to save cpu time.
1092	*/	1147	{
1093	if (pl)	1148	if (expect_false (pl->contr->combat_ob == this))
1094	if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
1095	{	1149	{
1096	pl->update_stats ();	1150	pl->apply (pl->contr->combat_ob, AP_UNAPPLY | AP_IGNORE_CURSE);
		1151	pl->contr->combat_ob = 0;
		1152	if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);
		1153	}
1097		1154
		1155	if (expect_false (pl->contr->ranged_ob == this))
		1156	{
		1157	pl->apply (pl->contr->ranged_ob, AP_UNAPPLY | AP_IGNORE_CURSE);
		1158	pl->contr->ranged_ob = 0;
		1159	if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);
		1160	}
		1161
		1162	pl->contr->queue_stats_update ();
		1163
1098	if (glow_radius && pl->is_on_map ())	1164	if (expect_false (glow_radius) && pl->is_on_map ())
1099	update_all_los (pl->map, pl->x, pl->y);	1165	update_all_los (pl->map, pl->x, pl->y);
1100	}	1166	}
1101	}	1167	}
1102	else if (map)	1168	else if (map)
1103	{	1169	{
1104	map->dirty = true;	1170	map->dirty = true;
1105	mapspace &ms = this->ms ();	1171	mapspace &ms = this->ms ();
…		…
1118	close_container ();	1184	close_container ();
1119		1185
1120	--map->players;	1186	--map->players;
1121	map->touch ();	1187	map->touch ();
1122	}	1188	}
1123	else if (pl->container == this)	1189	else if (pl->container_ () == this)
1124	{	1190	{
1125	// removing a container should close it	1191	// removing a container should close it
1126	close_container ();	1192	close_container ();
1127	}	1193	}
1128		1194	else
1129	esrv_del_item (pl->contr, count);	1195	esrv_del_item (pl->contr, count);
1130	}	1196	}
1131		1197
1132	/* link the object above us */	1198	/* link the object above us */
1133	// re-link, make sure compiler can easily use cmove	1199	// re-link, make sure compiler can easily use cmove
1134	*(above ? &above->below : &ms.top) = below;	1200	*(above ? &above->below : &ms.top) = below;
…		…
1137	above = 0;	1203	above = 0;
1138	below = 0;	1204	below = 0;
1139		1205
1140	ms.invalidate ();	1206	ms.invalidate ();
1141		1207
1142	if (map->in_memory == MAP_SAVING)
1143	return;
1144
1145	int check_walk_off = !flag [FLAG_NO_APPLY];	1208	int check_walk_off = !flag [FLAG_NO_APPLY];
1146		1209
1147	if (object *pl = ms.player ())	1210	if (object *pl = ms.player ())
1148	{	1211	{
1149	if (pl->container == this)	1212	if (pl->container_ () == this)
1150	/* If a container that the player is currently using somehow gets	1213	/* If a container that the player is currently using somehow gets
1151	* removed (most likely destroyed), update the player view	1214	* removed (most likely destroyed), update the player view
1152	* appropriately.	1215	* appropriately.
1153	*/	1216	*/
1154	pl->close_container ();	1217	pl->close_container ();
…		…
1158	//TODO: update floorbox to preserve ordering	1221	//TODO: update floorbox to preserve ordering
1159	if (pl->contr->ns)	1222	if (pl->contr->ns)
1160	pl->contr->ns->floorbox_update ();	1223	pl->contr->ns->floorbox_update ();
1161	}	1224	}
1162		1225
		1226	if (check_walk_off)
1163	for (tmp = ms.bot; tmp; tmp = tmp->above)	1227	for (object *above, *tmp = ms.bot; tmp; tmp = above)
1164	{	1228	{
		1229	above = tmp->above;
		1230
1165	/* No point updating the players look faces if he is the object	1231	/* No point updating the players look faces if he is the object
1166	* being removed.	1232	* being removed.
1167	*/	1233	*/
1168		1234
1169	/* See if object moving off should effect something */	1235	/* See if object moving off should effect something */
1170	if (check_walk_off
1171	&& ((move_type & tmp->move_off)	1236	if ((move_type & tmp->move_off)
1172	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1237	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1173	{
1174	move_apply (tmp, this, 0);	1238	move_apply (tmp, this, 0);
1175
1176	if (destroyed ())
1177	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1178	}	1239	}
1179
1180	last = tmp;
1181	}
1182		1240
1183	if (affects_los ())	1241	if (affects_los ())
1184	update_all_los (map, x, y);	1242	update_all_los (map, x, y);
1185	}	1243	}
1186	}	1244	}
…		…
1230		1288
1231	object *prev = this;	1289	object *prev = this;
1232		1290
1233	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)	1291	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1234	{	1292	{
1235	object *op = arch_to_object (at);	1293	object *op = at->instance ();
1236		1294
1237	op->name = name;	1295	op->name = name;
1238	op->name_pl = name_pl;	1296	op->name_pl = name_pl;
1239	op->title = title;	1297	op->title = title;
1240		1298
…		…
1278	* Passing 0 for flag gives proper default values, so flag really only needs	1336	* Passing 0 for flag gives proper default values, so flag really only needs
1279	* to be set if special handling is needed.	1337	* to be set if special handling is needed.
1280	*	1338	*
1281	* Return value:	1339	* Return value:
1282	* new object if 'op' was merged with other object	1340	* new object if 'op' was merged with other object
1283	* NULL if 'op' was destroyed	1341	* NULL if there was an error (destroyed, blocked etc.)
1284	* just 'op' otherwise	1342	* just 'op' otherwise
1285	*/	1343	*/
1286	object *	1344	object *
1287	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1345	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1288	{	1346	{
1289	op->remove ();	1347	op->remove ();
1290		1348
1291	if (m == &freed_map)//D TODO: remove soon	1349	if (m == &freed_map)//D TODO: remove soon
1292	{//D	1350	{//D
1293	LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D	1351	LOG (llevError | logBacktrace, "tries to insert object on freed objects map: %s", op->debug_desc ());//D
1294	}//D	1352	}//D
1295		1353
1296	/* Ideally, the caller figures this out. However, it complicates a lot	1354	/* Ideally, the caller figures this out. However, it complicates a lot
1297	* of areas of callers (eg, anything that uses find_free_spot would now	1355	* of areas of callers (eg, anything that uses find_free_spot would now
1298	* need extra work	1356	* need extra work
…		…
1325	// from here :/	1383	// from here :/
1326	op->nrof += tmp->nrof;	1384	op->nrof += tmp->nrof;
1327	tmp->destroy ();	1385	tmp->destroy ();
1328	}	1386	}
1329		1387
1330	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1388	op->clr_flag (FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1331	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1389	op->clr_flag (FLAG_INV_LOCKED);
1332		1390
1333	if (!QUERY_FLAG (op, FLAG_ALIVE))	1391	if (!op->flag [FLAG_ALIVE])
1334	CLEAR_FLAG (op, FLAG_NO_STEAL);	1392	op->clr_flag (FLAG_NO_STEAL);
1335		1393
1336	if (flag & INS_BELOW_ORIGINATOR)	1394	if (flag & INS_BELOW_ORIGINATOR)
1337	{	1395	{
1338	if (originator->map != op->map || originator->x != op->x || originator->y != op->y)	1396	if (originator->map != op->map || originator->x != op->x || originator->y != op->y)
1339	{	1397	{
…		…
1374	* when lots of spells are cast in one area. Currently, it is presumed	1432	* when lots of spells are cast in one area. Currently, it is presumed
1375	* that flying non pickable objects are spell objects.	1433	* that flying non pickable objects are spell objects.
1376	*/	1434	*/
1377	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1435	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1378	{	1436	{
1379	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))	1437	if (tmp->flag [FLAG_IS_FLOOR] || tmp->flag [FLAG_OVERLAY_FLOOR])
1380	floor = tmp;	1438	floor = tmp;
1381		1439
1382	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1440	if (tmp->flag [FLAG_NO_PICK] && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !tmp->flag [FLAG_IS_FLOOR])
1383	{	1441	{
1384	/* We insert above top, so we want this object below this */	1442	/* We insert above top, so we want this object below this */
1385	top = tmp->below;	1443	top = tmp->below;
1386	break;	1444	break;
1387	}	1445	}
…		…
1405	&& (op->face && !faces [op->face].visibility))	1463	&& (op->face && !faces [op->face].visibility))
1406	{	1464	{
1407	object *last;	1465	object *last;
1408		1466
1409	for (last = top; last != floor; last = last->below)	1467	for (last = top; last != floor; last = last->below)
1410	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1468	if (last->flag [FLAG_BLOCKSVIEW] && (last->type != EXIT))
1411	break;	1469	break;
1412		1470
1413	/* Check to see if we found the object that blocks view,	1471	/* Check to see if we found the object that blocks view,
1414	* and make sure we have a below pointer for it so that	1472	* and make sure we have a below pointer for it so that
1415	* we can get inserted below this one, which requires we	1473	* we can get inserted below this one, which requires we
…		…
1488	*/	1546	*/
1489		1547
1490	/* if this is not the head or flag has been passed, don't check walk on status */	1548	/* if this is not the head or flag has been passed, don't check walk on status */
1491	if (!(flag & INS_NO_WALK_ON) && op->is_head ())	1549	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1492	{	1550	{
1493	if (check_move_on (op, originator))	1551	if (check_move_on (op, originator, flag))
1494	return 0;	1552	return 0;
1495		1553
1496	/* If we are a multi part object, lets work our way through the check	1554	/* If we are a multi part object, let's work our way through the check
1497	* walk on's.	1555	* walk on's.
1498	*/	1556	*/
1499	for (object *tmp = op->more; tmp; tmp = tmp->more)	1557	for (object *tmp = op->more; tmp; tmp = tmp->more)
1500	if (check_move_on (tmp, originator))	1558	if (check_move_on (tmp, originator, flag))
1501	return 0;	1559	return 0;
1502	}	1560	}
1503		1561
1504	return op;	1562	return op;
1505	}	1563	}
…		…
1515		1573
1516	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1574	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1517	if (tmp->arch->archname == archname) /* same archetype */	1575	if (tmp->arch->archname == archname) /* same archetype */
1518	tmp->destroy ();	1576	tmp->destroy ();
1519		1577
1520	object *tmp = arch_to_object (archetype::find (archname));	1578	object *tmp = archetype::find (archname)->instance ();
1521		1579
1522	tmp->x = op->x;	1580	tmp->x = op->x;
1523	tmp->y = op->y;	1581	tmp->y = op->y;
1524		1582
1525	insert_ob_in_map (tmp, op->map, op, 0);	1583	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1530	{	1588	{
1531	if (where->env)	1589	if (where->env)
1532	return where->env->insert (this);	1590	return where->env->insert (this);
1533	else	1591	else
1534	return where->map->insert (this, where->x, where->y, originator, flags);	1592	return where->map->insert (this, where->x, where->y, originator, flags);
		1593	}
		1594
		1595	// check whether we can put this into the map, respect max_volume, max_items
		1596	bool
		1597	object::can_drop_at (maptile *m, int x, int y, object *originator)
		1598	{
		1599	mapspace &ms = m->at (x, y);
		1600
		1601	int items = ms.items ();
		1602
		1603	if (!items // testing !items ensures we can drop at least one item
		1604	|| (items < m->max_items
		1605	&& ms.volume () < m->max_volume))
		1606	return true;
		1607
		1608	if (originator && originator->is_player ())
		1609	originator->contr->failmsgf (
		1610	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
		1611	query_name ()
		1612	);
		1613
		1614	return false;
1535	}	1615	}
1536		1616
1537	/*	1617	/*
1538	* decrease(object, number) decreases a specified number from	1618	* decrease(object, number) decreases a specified number from
1539	* the amount of an object. If the amount reaches 0, the object	1619	* the amount of an object. If the amount reaches 0, the object
…		…
1549		1629
1550	nr = min (nr, nrof);	1630	nr = min (nr, nrof);
1551		1631
1552	if (nrof > nr)	1632	if (nrof > nr)
1553	{	1633	{
		1634	sint64 oweight = total_weight ();
		1635
1554	nrof -= nr;	1636	nrof -= nr;
1555	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1556		1637
1557	if (object *pl = visible_to ())	1638	if (object *pl = visible_to ())
1558	esrv_update_item (UPD_NROF, pl, this);	1639	esrv_update_item (UPD_NROF, pl, this);
		1640
		1641	adjust_weight (env, oweight, total_weight ());
1559		1642
1560	return true;	1643	return true;
1561	}	1644	}
1562	else	1645	else
1563	{	1646	{
…		…
1638	if (op->nrof)	1721	if (op->nrof)
1639	for (object *tmp = inv; tmp; tmp = tmp->below)	1722	for (object *tmp = inv; tmp; tmp = tmp->below)
1640	if (object::can_merge (tmp, op))	1723	if (object::can_merge (tmp, op))
1641	{	1724	{
1642	/* return the original object and remove inserted object	1725	/* return the original object and remove inserted object
1643	(client needs the original object) */	1726	(client prefers the original object) */
		1727
		1728	// carring must be 0 for mergable objects
		1729	sint64 oweight = tmp->weight * tmp->nrof;
		1730
1644	tmp->nrof += op->nrof;	1731	tmp->nrof += op->nrof;
1645		1732
1646	if (object *pl = tmp->visible_to ())	1733	if (object *pl = tmp->visible_to ())
1647	esrv_update_item (UPD_NROF, pl, tmp);	1734	esrv_update_item (UPD_NROF, pl, tmp);
1648		1735
1649	adjust_weight (this, op->total_weight ());	1736	adjust_weight (this, oweight, tmp->weight * tmp->nrof);
1650		1737
1651	op->destroy ();	1738	op->destroy ();
1652	op = tmp;	1739	op = tmp;
1653	goto inserted;	1740	goto inserted;
1654	}	1741	}
…		…
1670	op->flag [FLAG_REMOVED] = 0;	1757	op->flag [FLAG_REMOVED] = 0;
1671		1758
1672	if (object *pl = op->visible_to ())	1759	if (object *pl = op->visible_to ())
1673	esrv_send_item (pl, op);	1760	esrv_send_item (pl, op);
1674		1761
1675	adjust_weight (this, op->total_weight ());	1762	adjust_weight (this, 0, op->total_weight ());
1676		1763
1677	inserted:	1764	inserted:
1678	/* reset the light list and los of the players on the map */	1765	/* reset the light list and los of the players on the map */
1679	if (op->glow_radius && is_on_map ())	1766	if (op->glow_radius && is_on_map ())
1680	{	1767	{
1681	update_stats ();	1768	update_stats ();
1682	update_all_los (map, x, y);	1769	update_all_los (map, x, y);
1683	}	1770	}
1684	else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])	1771	else if (is_player ())
1685	// if this is a player's inventory, update stats	1772	// if this is a player's inventory, update stats
1686	update_stats ();	1773	contr->queue_stats_update ();
1687		1774
1688	INVOKE_OBJECT (INSERT, this);	1775	INVOKE_OBJECT (INSERT, this);
1689		1776
1690	return op;	1777	return op;
1691	}	1778	}
…		…
1709	* MSW 2001-07-08: Check all objects on space, not just those below	1796	* MSW 2001-07-08: Check all objects on space, not just those below
1710	* object being inserted. insert_ob_in_map may not put new objects	1797	* object being inserted. insert_ob_in_map may not put new objects
1711	* on top.	1798	* on top.
1712	*/	1799	*/
1713	int	1800	int
1714	check_move_on (object *op, object *originator)	1801	check_move_on (object *op, object *originator, int flags)
1715	{	1802	{
1716	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1803	if (op->flag [FLAG_NO_APPLY])
1717	return 0;	1804	return 0;
1718		1805
1719	object *tmp;	1806	object *tmp;
1720	maptile *m = op->map;	1807	maptile *m = op->map;
1721	int x = op->x, y = op->y;	1808	int x = op->x, y = op->y;
…		…
1758	* Second check makes sure that the movement types not being slowed	1845	* Second check makes sure that the movement types not being slowed
1759	* (~slow_move) is not blocked on this space - just because the	1846	* (~slow_move) is not blocked on this space - just because the
1760	* space doesn't slow down swimming (for example), if you can't actually	1847	* space doesn't slow down swimming (for example), if you can't actually
1761	* swim on that space, can't use it to avoid the penalty.	1848	* swim on that space, can't use it to avoid the penalty.
1762	*/	1849	*/
1763	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1850	if (!op->flag [FLAG_WIZPASS])
1764	{	1851	{
1765	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1852	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1766	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1853	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1767	{	1854	{
1768	float diff = tmp->move_slow_penalty * fabs (op->speed);	1855	float diff = tmp->move_slow_penalty * fabs (op->speed);
…		…
1778		1865
1779	/* Basically same logic as above, except now for actual apply. */	1866	/* Basically same logic as above, except now for actual apply. */
1780	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||	1867	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
1781	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))	1868	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
1782	{	1869	{
		1870	if ((flags & INS_NO_AUTO_EXIT)
		1871	&& (tmp->type == EXIT || tmp->type == TELEPORTER
		1872	|| tmp->type == HOLE || tmp->type == TRAPDOOR)) //TODO: temporary, fix exits instead
		1873	continue;
		1874
1783	move_apply (tmp, op, originator);	1875	move_apply (tmp, op, originator);
1784		1876
1785	if (op->destroyed ())	1877	if (op->destroyed ())
1786	return 1;	1878	return 1;
1787		1879
…		…
1899	void	1991	void
1900	flag_inv (object *op, int flag)	1992	flag_inv (object *op, int flag)
1901	{	1993	{
1902	for (object *tmp = op->inv; tmp; tmp = tmp->below)	1994	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1903	{	1995	{
1904	SET_FLAG (tmp, flag);	1996	tmp->set_flag (flag);
1905	flag_inv (tmp, flag);	1997	flag_inv (tmp, flag);
1906	}	1998	}
1907	}	1999	}
1908		2000
1909	/*	2001	/*
…		…
1912	void	2004	void
1913	unflag_inv (object *op, int flag)	2005	unflag_inv (object *op, int flag)
1914	{	2006	{
1915	for (object *tmp = op->inv; tmp; tmp = tmp->below)	2007	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1916	{	2008	{
1917	CLEAR_FLAG (tmp, flag);	2009	tmp->clr_flag (flag);
1918	unflag_inv (tmp, flag);	2010	unflag_inv (tmp, flag);
1919	}	2011	}
1920	}	2012	}
1921		2013
1922	/*	2014	/*
…		…
2112	{	2204	{
2113	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2205	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2114	}	2206	}
2115		2207
2116	/*	2208	/*
2117	* find_dir_2(delta-x,delta-y) will return a direction in which	2209	* find_dir_2(delta-x,delta-y) will return a direction value
2118	* an object which has subtracted the x and y coordinates of another	2210	* for running into direct [dx, dy].
2119	* object, needs to travel toward it.	2211	* (the opposite of crossfire's find_dir_2!)
2120	*/	2212	*/
2121	int	2213	int
2122	find_dir_2 (int x, int y)	2214	find_dir_2 (int x, int y)
2123	{	2215	{
		2216	#if 1 // new algorithm
		2217	// this works by putting x, y into 16 sectors, which
		2218	// are not equal sized, but are a better approximation
		2219	// then the old algorithm, and then using a mapping
		2220	// table to map it into a direction value.
		2221	// basically, it maps these comparisons to each bit
		2222	// bit #3: x < 0
		2223	// bit #2: y < 0
		2224	// bit #1: x > y
		2225	// bit #0: x > 2y
		2226
		2227	static const uint8 dir[16] = {
		2228	4, 5, 4, 3,
		2229	2, 1, 2, 3,
		2230	6, 5, 6, 7,
		2231	8, 1, 8, 7,
		2232	};
		2233	int sector = 0;
		2234
		2235	// this is a bit ugly, but more likely to result in branchless code
		2236	sector |= x < 0 ? 8 : 0;
		2237	x = x < 0 ? -x : x; // abs
		2238
		2239	sector |= y < 0 ? 4 : 0;
		2240	y = y < 0 ? -y : y; // abs
		2241
		2242	if (x > y)
		2243	{
		2244	sector |= 2;
		2245
		2246	if (x > y * 2)
		2247	sector |= 1;
		2248	}
		2249	else
		2250	{
		2251	if (y > x * 2)
		2252	sector |= 1;
		2253	else if (!y)
		2254	return 0; // x == 0 here
		2255	}
		2256
		2257	return dir [sector];
		2258	#else // old algorithm
2124	int q;	2259	int q;
2125		2260
2126	if (y)	2261	if (y)
2127	q = x * 100 / y;	2262	q = 128 * x / y;
2128	else if (x)	2263	else if (x)
2129	q = -300 * x;	2264	q = -512 * x; // to make it > 309
2130	else	2265	else
2131	return 0;	2266	return 0;
2132		2267
2133	if (y > 0)	2268	if (y > 0)
2134	{	2269	{
2135	if (q < -242)	2270	if (q < -309) return 7;
		2271	if (q < -52) return 6;
		2272	if (q < 52) return 5;
		2273	if (q < 309) return 4;
		2274
2136	return 3;	2275	return 3;
2137	if (q < -41)	2276	}
2138	return 2;	2277	else
2139	if (q < 41)	2278	{
2140	return 1;	2279	if (q < -309) return 3;
2141	if (q < 242)	2280	if (q < -52) return 2;
2142	return 8;	2281	if (q < 52) return 1;
		2282	if (q < 309) return 8;
		2283
2143	return 7;	2284	return 7;
2144	}	2285	}
2145		2286	#endif
2146	if (q < -242)
2147	return 7;
2148	if (q < -41)
2149	return 6;
2150	if (q < 41)
2151	return 5;
2152	if (q < 242)
2153	return 4;
2154
2155	return 3;
2156	}	2287	}
2157		2288
2158	/*	2289	/*
2159	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2290	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2160	* between two directions (which are expected to be absolute (see absdir())	2291	* between two directions (which are expected to be absolute (see absdir())
2161	*/	2292	*/
2162	int	2293	int
2163	dirdiff (int dir1, int dir2)	2294	dirdiff (int dir1, int dir2)
2164	{	2295	{
2165	int d;
2166
2167	d = abs (dir1 - dir2);	2296	int d = abs (dir1 - dir2);
2168	if (d > 4)
2169	d = 8 - d;
2170		2297
2171	return d;	2298	return d > 4 ? 8 - d : d;
2172	}	2299	}
2173		2300
2174	/* peterm:	2301	/* peterm:
2175	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2302	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
2176	* Basically, this is a table of directions, and what directions	2303	* Basically, this is a table of directions, and what directions
…		…
2178	* This basically means that if direction is 15, then it could either go	2305	* This basically means that if direction is 15, then it could either go
2179	* direction 4, 14, or 16 to get back to where we are.	2306	* direction 4, 14, or 16 to get back to where we are.
2180	* Moved from spell_util.c to object.c with the other related direction	2307	* Moved from spell_util.c to object.c with the other related direction
2181	* functions.	2308	* functions.
2182	*/	2309	*/
2183	const int reduction_dir[SIZEOFFREE][3] = {	2310	static const int reduction_dir[SIZEOFFREE][3] = {
2184	{0, 0, 0}, /* 0 */	2311	{0, 0, 0}, /* 0 */
2185	{0, 0, 0}, /* 1 */	2312	{0, 0, 0}, /* 1 */
2186	{0, 0, 0}, /* 2 */	2313	{0, 0, 0}, /* 2 */
2187	{0, 0, 0}, /* 3 */	2314	{0, 0, 0}, /* 3 */
2188	{0, 0, 0}, /* 4 */	2315	{0, 0, 0}, /* 4 */
…		…
2282	* Add a check so we can't pick up invisible objects (0.93.8)	2409	* Add a check so we can't pick up invisible objects (0.93.8)
2283	*/	2410	*/
2284	int	2411	int
2285	can_pick (const object *who, const object *item)	2412	can_pick (const object *who, const object *item)
2286	{	2413	{
2287	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2414	return /*who->flag [FLAG_WIZ]|| */
2288	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2415	(item->weight > 0 && !item->flag [FLAG_NO_PICK] &&
2289	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));	2416	!item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2290	}	2417	}
		2418
		2419	//-GPL
2291		2420
2292	/*	2421	/*
2293	* create clone from object to another	2422	* create clone from object to another
2294	*/	2423	*/
2295	object *	2424	object *
…		…
2326	return tmp;	2455	return tmp;
2327		2456
2328	return 0;	2457	return 0;
2329	}	2458	}
2330		2459
		2460	/* Zero the key_values on op, decrementing the shared-string
		2461	* refcounts and freeing the links.
		2462	*/
		2463	void
		2464	key_values::clear ()
		2465	{
		2466	for (key_value *kvp = first; kvp; )
		2467	{
		2468	key_value *next = kvp->next;
		2469	delete kvp;
		2470	kvp = next;
		2471	}
		2472
		2473	first = 0;
		2474	}
		2475
2331	shstr_tmp	2476	shstr_tmp
2332	object::kv_get (shstr_tmp key) const	2477	key_values::get (shstr_tmp key) const
2333	{	2478	{
2334	for (key_value *kv = key_values; kv; kv = kv->next)	2479	for (key_value *kv = first; kv; kv = kv->next)
2335	if (kv->key == key)	2480	if (kv->key == key)
2336	return kv->value;	2481	return kv->value;
2337		2482
2338	return shstr ();	2483	return shstr ();
2339	}	2484	}
2340		2485
2341	void	2486	void
		2487	key_values::add (shstr_tmp key, shstr_tmp value)
		2488	{
		2489	key_value *kv = new key_value;
		2490
		2491	kv->next = first;
		2492	kv->key = key;
		2493	kv->value = value;
		2494
		2495	first = kv;
		2496	}
		2497
		2498	void
2342	object::kv_set (shstr_tmp key, shstr_tmp value)	2499	key_values::set (shstr_tmp key, shstr_tmp value)
2343	{	2500	{
2344	for (key_value *kv = key_values; kv; kv = kv->next)	2501	for (key_value *kv = first; kv; kv = kv->next)
2345	if (kv->key == key)	2502	if (kv->key == key)
2346	{	2503	{
2347	kv->value = value;	2504	kv->value = value;
2348	return;	2505	return;
2349	}	2506	}
2350		2507
2351	key_value *kv = new key_value;	2508	add (key, value);
2352
2353	kv->next = key_values;
2354	kv->key = key;
2355	kv->value = value;
2356
2357	key_values = kv;
2358	}	2509	}
2359		2510
2360	void	2511	void
2361	object::kv_del (shstr_tmp key)	2512	key_values::del (shstr_tmp key)
2362	{	2513	{
2363	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)	2514	for (key_value **kvp = &first; *kvp; kvp = &(*kvp)->next)
2364	if ((*kvp)->key == key)	2515	if ((*kvp)->key == key)
2365	{	2516	{
2366	key_value *kv = *kvp;	2517	key_value *kv = *kvp;
2367	*kvp = (*kvp)->next;	2518	*kvp = (*kvp)->next;
2368	delete kv;	2519	delete kv;
2369	return;	2520	return;
2370	}	2521	}
		2522	}
		2523
		2524	void
		2525	key_values::reverse ()
		2526	{
		2527	key_value *prev = 0;
		2528	key_value *head = first;
		2529
		2530	while (head)
		2531	{
		2532	key_value *node = head;
		2533	head = head->next;
		2534	node->next = prev;
		2535	prev = node;
		2536	}
		2537
		2538	first = prev;
		2539	}
		2540
		2541	key_values &
		2542	key_values::operator =(const key_values &kv)
		2543	{
		2544	clear ();
		2545
		2546	for (key_value *kvp = kv.first; kvp; kvp = kvp->next)
		2547	add (kvp->key, kvp->value);
		2548
		2549	reverse ();
2371	}	2550	}
2372		2551
2373	object::depth_iterator::depth_iterator (object *container)	2552	object::depth_iterator::depth_iterator (object *container)
2374	: iterator_base (container)	2553	: iterator_base (container)
2375	{	2554	{
…		…
2459	{	2638	{
2460	return map ? map->region (x, y)	2639	return map ? map->region (x, y)
2461	: region::default_region ();	2640	: region::default_region ();
2462	}	2641	}
2463		2642
2464	const materialtype_t *	2643	//+GPL
2465	object::dominant_material () const
2466	{
2467	if (materialtype_t *mt = name_to_material (materialname))
2468	return mt;
2469
2470	return name_to_material (shstr_unknown);
2471	}
2472		2644
2473	void	2645	void
2474	object::open_container (object *new_container)	2646	object::open_container (object *new_container)
2475	{	2647	{
2476	if (container == new_container)	2648	if (container == new_container)
…		…
2511	// TODO: this does not seem to serve any purpose anymore?	2683	// TODO: this does not seem to serve any purpose anymore?
2512	#if 0	2684	#if 0
2513	// insert the "Close Container" object.	2685	// insert the "Close Container" object.
2514	if (archetype *closer = new_container->other_arch)	2686	if (archetype *closer = new_container->other_arch)
2515	{	2687	{
2516	object *closer = arch_to_object (new_container->other_arch);	2688	object *closer = new_container->other_arch->instance ();
2517	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2689	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2518	new_container->insert (closer);	2690	new_container->insert (closer);
2519	}	2691	}
2520	#endif	2692	#endif
2521		2693
…		…
2533	play_sound (sound_find ("chest_open"));	2705	play_sound (sound_find ("chest_open"));
2534	}	2706	}
2535	// else if (!old_container->env && contr && contr->ns)	2707	// else if (!old_container->env && contr && contr->ns)
2536	// contr->ns->floorbox_reset ();	2708	// contr->ns->floorbox_reset ();
2537	}	2709	}
		2710
		2711	//-GPL
		2712
		2713	// prefetch some flat area around the player
		2714	static void
		2715	prefetch_surrounding_area (object *op, maptile *map, int range)
		2716	{
		2717	for (maprect *rect = map->split_to_tiles (mapwalk_buf,
		2718	op->x - range , op->y - range ,
		2719	op->x + range + 1, op->y + range + 1);
		2720	rect->m;
		2721	++rect)
		2722	{
		2723	rect->m->touch ();
		2724	rect->m->activate ();
		2725	}
		2726	}
		2727
		2728	// prefetch a generous area around the player, also up and down
		2729	void
		2730	object::prefetch_surrounding_maps ()
		2731	{
		2732	prefetch_surrounding_area (this, map, 40);
		2733
		2734	if (maptile *m = map->tile_available (TILE_DOWN))
		2735	prefetch_surrounding_area (this, m, 20);
		2736
		2737	if (maptile *m = map->tile_available (TILE_UP))
		2738	prefetch_surrounding_area (this, m, 20);
		2739	}
		2740
		2741	//+GPL
2538		2742
2539	object *	2743	object *
2540	object::force_find (shstr_tmp name)	2744	object::force_find (shstr_tmp name)
2541	{	2745	{
2542	/* cycle through his inventory to look for the MARK we want to	2746	/* cycle through his inventory to look for the MARK we want to
…		…
2562	object::force_add (shstr_tmp name, int duration)	2766	object::force_add (shstr_tmp name, int duration)
2563	{	2767	{
2564	if (object *force = force_find (name))	2768	if (object *force = force_find (name))
2565	force->destroy ();	2769	force->destroy ();
2566		2770
2567	object *force = get_archetype (FORCE_NAME);	2771	object *force = archetype::get (FORCE_NAME);
2568		2772
2569	force->slaying = name;	2773	force->slaying = name;
2570
2571	force->force_set_timer (duration);	2774	force->force_set_timer (duration);
2572
2573	force->flag [FLAG_APPLIED] = true;	2775	force->flag [FLAG_APPLIED] = true;
2574		2776
2575	return insert (force);	2777	return insert (force);
2576	}	2778	}
2577		2779
2578	void	2780	void
…		…
2627		2829
2628	insert (force);	2830	insert (force);
2629	}	2831	}
2630	}	2832	}
2631		2833
		2834	void object::change_move_type (MoveType mt)
		2835	{
		2836	if (move_type == mt)
		2837	return;
		2838
		2839	if (is_on_map ())
		2840	{
		2841	// we are on the map, so handle move_on/off effects
		2842	remove ();
		2843	move_type = mt;
		2844	map->insert (this, x, y, this);
		2845	}
		2846	else
		2847	move_type = mt;
		2848	}
		2849
		2850	/* object should be a player.
		2851	* we return the object the player has marked with the 'mark' command
		2852	* below. If no match is found (or object has changed), we return
		2853	* NULL. We leave it up to the calling function to print messages if
		2854	* nothing is found.
		2855	*/
		2856	object *
		2857	object::mark () const
		2858	{
		2859	if (contr && contr->mark && contr->mark->env == this)
		2860	return contr->mark;
		2861	else
		2862	return 0;
		2863	}
		2864
		2865	// put marked object first in the inventory
		2866	// this is used by identify-like spells so players can influence
		2867	// the order a bit.
		2868	void
		2869	object::splay_marked ()
		2870	{
		2871	if (object *marked = mark ())
		2872	splay (marked);
		2873	}
		2874

Diff Legend

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