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.204 by root, Fri Apr 11 17:01:52 2008 UTC vs.
Revision 1.300 by root, Mon Nov 9 03:08:23 2009 UTC

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

Diff Legend

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