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

Diff Legend

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