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.223 by root, Wed Apr 30 08:29:31 2008 UTC vs.
Revision 1.301 by root, Mon Nov 9 18:47:56 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,2008 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	#include <global.h>	25	#include <global.h>
…		…
32	#include <bitset>	33	#include <bitset>
33		34
34	UUID UUID::cur;	35	UUID UUID::cur;
35	static uint64_t seq_next_save;	36	static uint64_t seq_next_save;
36	static const uint64 UUID_GAP = 1<<19;	37	static const uint64 UUID_GAP = 1<<19;
		38	uint32_t mapspace::smellcount = 10000;
37		39
38	objectvec objects;	40	objectvec objects;
39	activevec actives;	41	activevec actives;
		42
		43	//+GPL
40		44
41	short freearr_x[SIZEOFFREE] = {	45	short freearr_x[SIZEOFFREE] = {
42	0,	46	0,
43	0, 1, 1, 1, 0, -1, -1, -1,	47	0, 1, 1, 1, 0, -1, -1, -1,
44	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	48	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
…		…
48	0,	52	0,
49	-1, -1, 0, 1, 1, 1, 0, -1,	53	-1, -1, 0, 1, 1, 1, 0, -1,
50	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	54	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
51	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	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
52	};	56	};
53	int maxfree[SIZEOFFREE] = {
54	0,
55	9, 10, 13, 14, 17, 18, 21, 22,
56	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
57	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
58	};
59	int freedir[SIZEOFFREE] = {	57	int freedir[SIZEOFFREE] = {
60	0,	58	0,
61	1, 2, 3, 4, 5, 6, 7, 8,	59	1, 2, 3, 4, 5, 6, 7, 8,
62	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	60	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
63	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	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
64	};	69	};
65		70
66	static void	71	static void
67	write_uuid (uval64 skip, bool sync)	72	write_uuid (uval64 skip, bool sync)
68	{	73	{
…		…
96		101
97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	102	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
98	_exit (1);	103	_exit (1);
99	}	104	}
100		105
101	UUID::BUF buf;	106	char buf [UUID::MAX_LEN];
102	buf[0] = 0;	107	buf[0] = 0;
103	fgets (buf, sizeof (buf), fp);	108	fgets (buf, sizeof (buf), fp);
104		109
105	if (!UUID::cur.parse (buf))	110	if (!UUID::cur.parse (buf))
106	{	111	{
…		…
133		138
134	void	139	void
135	UUID::init ()	140	UUID::init ()
136	{	141	{
137	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;
138	}	208	}
139		209
140	/* 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. */
141	static bool	211	static bool
142	compare_ob_value_lists_one (const object *wants, const object *has)	212	compare_ob_value_lists_one (const object *wants, const object *has)
143	{	213	{
144	key_value *wants_field;
145
146	/* 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
147	* 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
148	* different structure or at least keep the lists sorted...	216	* different structure or at least keep the lists sorted...
149	*/	217	*/
150		218
151	/* For each field in wants, */	219	/* For each field in wants, */
152	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)
153	{	221	if (has->kv_get (kv->key) != kv->value)
154	key_value *has_field;	222	return false;
155
156	/* Look for a field in has with the same key. */
157	has_field = get_ob_key_link (has, wants_field->key);
158
159	if (!has_field)
160	return 0; /* No field with that name. */
161
162	/* Found the matching field. */
163	if (has_field->value != wants_field->value)
164	return 0; /* Values don't match, so this half of the comparison is false. */
165
166	/* If we get here, we found a match. Now for the next field in wants. */
167	}
168		223
169	/* 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. */
170	return 1;	225	return true;
171	}	226	}
172		227
173	/* Returns TRUE if ob1 has the same key_values as ob2. */	228	/* Returns TRUE if ob1 has the same key_values as ob2. */
174	static bool	229	static bool
175	compare_ob_value_lists (const object *ob1, const object *ob2)	230	compare_ob_value_lists (const object *ob1, const object *ob2)
176	{	231	{
177	/* 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,
178	* so we need to run the comparison *twice*. :(	233	* so we need to run the comparison *twice*. :(
179	*/	234	*/
180	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);
181	}	237	}
182		238
183	/* 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
184	* they can be merged together.	240	* they can be merged together.
185	*	241	*
…		…
195	bool object::can_merge_slow (object *ob1, object *ob2)	251	bool object::can_merge_slow (object *ob1, object *ob2)
196	{	252	{
197	/* A couple quicksanity checks */	253	/* A couple quicksanity checks */
198	if (ob1 == ob2	254	if (ob1 == ob2
199	|| ob1->type != ob2->type	255	|| ob1->type != ob2->type
200	|| ob1->speed != ob2->speed	256	|| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED
201	|| ob1->value != ob2->value	257	|| ob1->value != ob2->value
202	|| ob1->name != ob2->name)	258	|| ob1->name != ob2->name)
203	return 0;	259	return 0;
204		260
205	/* Do not merge objects if nrof would overflow. First part checks	261	/* Do not merge objects if nrof would overflow, assume nrof
206	* for unsigned overflow (2c), second part checks whether the result	262	* is always 0 .. 2**31-1 */
207	* would fit into a 32 bit signed int, which is often used to hold	263	if (ob1->nrof > 0x7fffffff - ob2->nrof)
208	* nrof values.
209	*/
210	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
211	return 0;	264	return 0;
212		265
213	/* If the objects have been identified, set the BEEN_APPLIED flag.	266	/* If the objects have been identified, set the BEEN_APPLIED flag.
214	* This is to the comparison of the flags below will be OK. We	267	* This is to the comparison of the flags below will be OK. We
215	* just can't ignore the been applied or identified flags, as they	268	* just can't ignore the been applied or identified flags, as they
…		…
220	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	273	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
221		274
222	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	275	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
223	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	276	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
224		277
225	if (ob1->arch->name != ob2->arch->name	278	if (ob1->arch->archname != ob2->arch->archname
226	|| ob1->name != ob2->name	279	|| ob1->name != ob2->name
227	|| ob1->title != ob2->title	280	|| ob1->title != ob2->title
228	|| ob1->msg != ob2->msg	281	|| ob1->msg != ob2->msg
229	|| ob1->weight != ob2->weight	282	|| ob1->weight != ob2->weight
230	|| ob1->attacktype != ob2->attacktype	283	|| ob1->attacktype != ob2->attacktype
231	|| ob1->magic != ob2->magic	284	|| ob1->magic != ob2->magic
232	|| ob1->slaying != ob2->slaying	285	|| ob1->slaying != ob2->slaying
233	|| ob1->skill != ob2->skill	286	|| ob1->skill != ob2->skill
234	|| ob1->value != ob2->value	287	|| ob1->value != ob2->value
235	|| 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
236	|| ob1->client_type != ob2->client_type	290	|| ob1->client_type != ob2->client_type
237	|| ob1->materialname != ob2->materialname	291	|| ob1->materialname != ob2->materialname
238	|| ob1->lore != ob2->lore	292	|| ob1->lore != ob2->lore
239	|| ob1->subtype != ob2->subtype	293	|| ob1->subtype != ob2->subtype
240	|| ob1->move_type != ob2->move_type	294	|| ob1->move_type != ob2->move_type
241	|| ob1->move_block != ob2->move_block	295	|| ob1->move_block != ob2->move_block
242	|| ob1->move_allow != ob2->move_allow	296	|| ob1->move_allow != ob2->move_allow
243	|| ob1->move_on != ob2->move_on	297	|| ob1->move_on != ob2->move_on
244	|| ob1->move_off != ob2->move_off	298	|| ob1->move_off != ob2->move_off
245	|| ob1->move_slow != ob2->move_slow	299	|| ob1->move_slow != ob2->move_slow
246	|| ob1->move_slow_penalty != ob2->move_slow_penalty	300	|| fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
247	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))	301	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
248	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	302	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
249	return 0;	303	return 0;
250		304
251	if ((ob1->flag ^ ob2->flag)	305	if ((ob1->flag ^ ob2->flag)
252	.reset (FLAG_INV_LOCKED)	306	.reset (FLAG_INV_LOCKED)
253	.reset (FLAG_CLIENT_SENT)
254	.reset (FLAG_REMOVED)	307	.reset (FLAG_REMOVED)
255	.any ())	308	.any ())
256	return 0;	309	return 0;
257		310
258	/* This is really a spellbook check - we should in general	311	/* This is really a spellbook check - we should in general
…		…
340	{	393	{
341	// see if we are in a container of sorts	394	// see if we are in a container of sorts
342	if (env)	395	if (env)
343	{	396	{
344	// the player inventory itself is always visible	397	// the player inventory itself is always visible
345	if (env->type == PLAYER)	398	if (env->is_player ())
346	return env;	399	return env;
347		400
348	// else a player could have our env open	401	// else a player could have our env open
349	object *envest = env->outer_env ();	402	object *envest = env->outer_env_or_self ();
350		403
351	// the player itself is always on a map, so we will find him here	404	// the player itself is always on a map, so we will find him here
352	// even if our inv is in a player.	405	// even if our inv is in a player.
353	if (envest->is_on_map ())	406	if (envest->is_on_map ())
354	if (object *pl = envest->ms ().player ())	407	if (object *pl = envest->ms ().player ())
355	if (pl->container == env)	408	if (pl->container_ () == env)
356	return pl;	409	return pl;
357	}	410	}
358	else	411	else
359	{	412	{
360	// maybe there is a player standing on the same mapspace	413	// maybe there is a player standing on the same mapspace
361	// this will catch the case where "this" is a player	414	// this will catch the case where "this" is a player
362	if (object *pl = ms ().player ())	415	if (object *pl = ms ().player ())
363	if (!pl->container || this == pl->container)	416	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
		417	|| pl->container_ () == this)
364	return pl;	418	return pl;
365	}	419	}
366	}	420	}
367		421
368	return 0;	422	return 0;
369	}	423	}
370		424
371	// adjust weight per container type ("of holding")	425	// adjust weight per container type ("of holding")
372	static sint32	426	static sint32
373	weight_adjust (object *op, sint32 weight)	427	weight_adjust_for (object *op, sint32 weight)
374	{	428	{
375	return op->type == CONTAINER	429	return op->type == CONTAINER
376	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	430	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
377	: weight;	431	: weight;
378	}	432	}
…		…
384	static void	438	static void
385	adjust_weight (object *op, sint32 weight)	439	adjust_weight (object *op, sint32 weight)
386	{	440	{
387	while (op)	441	while (op)
388	{	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
389	weight = weight_adjust (op, weight);	445	weight = weight_adjust_for (op, op->carrying)
		446	- weight_adjust_for (op, op->carrying - weight);
390		447
391	if (!weight)	448	if (!weight)
392	return;	449	return;
393		450
394	op->carrying += weight;	451	op->carrying += weight;
…		…
417	op->update_weight ();	474	op->update_weight ();
418		475
419	sum += op->total_weight ();	476	sum += op->total_weight ();
420	}	477	}
421		478
422	sum = weight_adjust (this, sum);	479	sum = weight_adjust_for (this, sum);
423		480
424	if (sum != carrying)	481	if (sum != carrying)
425	{	482	{
426	carrying = sum;	483	carrying = sum;
427		484
…		…
443	object_freezer freezer;	500	object_freezer freezer;
444	op->write (freezer);	501	op->write (freezer);
445	return freezer.as_string ();	502	return freezer.as_string ();
446	}	503	}
447		504
448	/*	505	char *
449	* get_nearest_part(multi-object, object 2) returns the part of the	506	object::as_string ()
450	* multi-object 1 which is closest to the second object.
451	* If it's not a multi-object, it is returned.
452	*/
453	object *
454	get_nearest_part (object *op, const object *pl)
455	{	507	{
456	object *tmp, *closest;	508	return dump_object (this);
457	int last_dist, i;
458
459	if (!op->more)
460	return op;
461
462	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
463	tmp;
464	tmp = tmp->more)
465	if ((i = distance (tmp, pl)) < last_dist)
466	closest = tmp, last_dist = i;
467
468	return closest;
469	}	509	}
470		510
471	/*	511	/*
472	* 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.
473	* VERRRY slow.	513	* VERRRY slow.
…		…
489	*/	529	*/
490	object *	530	object *
491	find_object_name (const char *str)	531	find_object_name (const char *str)
492	{	532	{
493	shstr_cmp str_ (str);	533	shstr_cmp str_ (str);
494	object *op;
495		534
		535	if (str_)
496	for_all_objects (op)	536	for_all_objects (op)
497	if (op->name == str_)	537	if (op->name == str_)
498	break;	538	return op;
499		539
500	return op;	540	return 0;
501	}	541	}
502		542
503	/*	543	/*
504	* 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
505	* skill and experience objects.	545	* skill and experience objects.
…		…
567	update_stats ();	607	update_stats ();
568		608
569	new_draw_info_format (NDI_UNIQUE, 0, this,	609	new_draw_info_format (NDI_UNIQUE, 0, this,
570	"You try to balance all your items at once, "	610	"You try to balance all your items at once, "
571	"but the %s is just too much for your body. "	611	"but the %s is just too much for your body. "
572	"[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);
573	return false;	614	return false;
574	}	615	}
575		616
576	//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);
577	}	618	}
…		…
603	}	644	}
604		645
605	op->key_values = 0;	646	op->key_values = 0;
606	}	647	}
607		648
608	object &	649	/*
609	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)
610	{	659	{
611	bool is_freed = flag [FLAG_FREED];	660	dst->remove ();
612	bool is_removed = flag [FLAG_REMOVED];
613
614	*(object_copy *)this = src;	661	*(object_copy *)dst = *this;
615
616	flag [FLAG_FREED] = is_freed;
617	flag [FLAG_REMOVED] = is_removed;	662	dst->flag [FLAG_REMOVED] = true;
618		663
619	/* Copy over key_values, if any. */	664	/* Copy over key_values, if any. */
620	if (src.key_values)	665	if (key_values)
621	{	666	{
622	key_value *tail = 0;	667	key_value *tail = 0;
623	key_values = 0;	668	dst->key_values = 0;
624		669
625	for (key_value *i = src.key_values; i; i = i->next)	670	for (key_value *i = key_values; i; i = i->next)
626	{	671	{
627	key_value *new_link = new key_value;	672	key_value *new_link = new key_value;
628		673
629	new_link->next = 0;	674	new_link->next = 0;
630	new_link->key = i->key;	675	new_link->key = i->key;
631	new_link->value = i->value;	676	new_link->value = i->value;
632		677
633	/* Try and be clever here, too. */	678	/* Try and be clever here, too. */
634	if (!key_values)	679	if (!dst->key_values)
635	{	680	{
636	key_values = new_link;	681	dst->key_values = new_link;
637	tail = new_link;	682	tail = new_link;
638	}	683	}
639	else	684	else
640	{	685	{
641	tail->next = new_link;	686	tail->next = new_link;
642	tail = new_link;	687	tail = new_link;
643	}	688	}
644	}	689	}
645	}	690	}
646	}
647
648	/*
649	* copy_to first frees everything allocated by the dst object,
650	* and then copies the contents of itself into the second
651	* object, allocating what needs to be allocated. Basically, any
652	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
653	* if the first object is freed, the pointers in the new object
654	* will point at garbage.
655	*/
656	void
657	object::copy_to (object *dst)
658	{
659	*dst = *this;
660		691
661	if (speed < 0)	692	if (speed < 0)
662	dst->speed_left -= rndm ();	693	dst->speed_left -= rndm ();
663		694
664	dst->set_speed (dst->speed);	695	dst->activate ();
665	}	696	}
666		697
667	void	698	void
668	object::instantiate ()	699	object::instantiate ()
669	{	700	{
…		…
686	object *	717	object *
687	object::clone ()	718	object::clone ()
688	{	719	{
689	object *neu = create ();	720	object *neu = create ();
690	copy_to (neu);	721	copy_to (neu);
		722	neu->map = map; // not copied by copy_to
691	return neu;	723	return neu;
692	}	724	}
693		725
694	/*	726	/*
695	* 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
…		…
712	* 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.
713	*/	745	*/
714	void	746	void
715	object::set_speed (float speed)	747	object::set_speed (float speed)
716	{	748	{
717	if (flag [FLAG_FREED] && speed)
718	{
719	LOG (llevError, "Object %s is freed but has speed.\n", &name);
720	speed = 0;
721	}
722
723	this->speed = speed;	749	this->speed = speed;
724		750
725	if (has_active_speed ())	751	if (has_active_speed ())
726	activate ();	752	activate ();
727	else	753	else
…		…
777		803
778	if (!(m.flags_ & P_UPTODATE))	804	if (!(m.flags_ & P_UPTODATE))
779	/* nop */;	805	/* nop */;
780	else if (action == UP_OBJ_INSERT)	806	else if (action == UP_OBJ_INSERT)
781	{	807	{
		808	#if 0
782	// this is likely overkill, TODO: revisit (schmorp)	809	// this is likely overkill, TODO: revisit (schmorp)
783	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	810	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
784	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	811	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
785	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	812	|| (op->is_player () && !(m.flags_ & P_PLAYER))
786	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	813	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
787	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	814	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
788	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	815	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
789	|| (m.move_on | op->move_on ) != m.move_on	816	|| (m.move_on | op->move_on ) != m.move_on
790	|| (m.move_off | op->move_off ) != m.move_off	817	|| (m.move_off | op->move_off ) != m.move_off
791	|| (m.move_slow | op->move_slow) != m.move_slow	818	|| (m.move_slow | op->move_slow) != m.move_slow
792	/* 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
793	* to have move_allow right now.	820	* have move_allow right now.
794	*/	821	*/
795	|| ((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
796	|| 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)
797	m.flags_ = 0;	826	m.invalidate ();
		827	#endif
798	}	828	}
799	/* if the object is being removed, we can't make intelligent	829	/* if the object is being removed, we can't make intelligent
800	* decisions, because remove_ob can't really pass the object	830	* decisions, because remove_ob can't really pass the object
801	* that is being removed.	831	* that is being removed.
802	*/	832	*/
803	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	833	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
804	m.flags_ = 0;	834	m.invalidate ();
805	else if (action == UP_OBJ_FACE)	835	else if (action == UP_OBJ_FACE)
806	/* Nothing to do for that case */ ;	836	/* Nothing to do for that case */ ;
807	else	837	else
808	LOG (llevError, "update_object called with invalid action: %d\n", action);	838	LOG (llevError, "update_object called with invalid action: %d\n", action);
809		839
…		…
813		843
814	object::object ()	844	object::object ()
815	{	845	{
816	SET_FLAG (this, FLAG_REMOVED);	846	SET_FLAG (this, FLAG_REMOVED);
817		847
818	expmul = 1.0;	848	//expmul = 1.0; declared const for the time being
819	face = blank_face;	849	face = blank_face;
820	}	850	}
821		851
822	object::~object ()	852	object::~object ()
823	{	853	{
…		…
853	/* If already on active list, don't do anything */	883	/* If already on active list, don't do anything */
854	if (active)	884	if (active)
855	return;	885	return;
856		886
857	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
858	actives.insert (this);	892	actives.insert (this);
		893	}
859	}	894	}
860		895
861	void	896	void
862	object::activate_recursive ()	897	object::activate_recursive ()
863	{	898	{
…		…
924	* drop on that space.	959	* drop on that space.
925	*/	960	*/
926	if (!drop_to_ground	961	if (!drop_to_ground
927	|| !map	962	|| !map
928	|| map->in_memory != MAP_ACTIVE	963	|| map->in_memory != MAP_ACTIVE
929	|| map->nodrop	964	|| map->no_drop
930	|| ms ().move_block == MOVE_ALL)	965	|| ms ().move_block == MOVE_ALL)
931	{	966	{
932	while (inv)	967	while (inv)
933	{
934	inv->destroy_inv (false);
935	inv->destroy ();	968	inv->destroy ();
936	}
937	}	969	}
938	else	970	else
939	{ /* Put objects in inventory onto this space */	971	{ /* Put objects in inventory onto this space */
940	while (inv)	972	while (inv)
941	{	973	{
…		…
945	|| op->flag [FLAG_NO_DROP]	977	|| op->flag [FLAG_NO_DROP]
946	|| op->type == RUNE	978	|| op->type == RUNE
947	|| op->type == TRAP	979	|| op->type == TRAP
948	|| op->flag [FLAG_IS_A_TEMPLATE]	980	|| op->flag [FLAG_IS_A_TEMPLATE]
949	|| op->flag [FLAG_DESTROY_ON_DEATH])	981	|| op->flag [FLAG_DESTROY_ON_DEATH])
950	op->destroy (true);	982	op->destroy ();
951	else	983	else
952	map->insert (op, x, y);	984	map->insert (op, x, y);
953	}	985	}
954	}	986	}
955	}	987	}
…		…
963		995
964	static struct freed_map : maptile	996	static struct freed_map : maptile
965	{	997	{
966	freed_map ()	998	freed_map ()
967	{	999	{
968	path = "<freed objects map>";	1000	path = "<freed objects map>";
969	name = "/internal/freed_objects_map";	1001	name = "/internal/freed_objects_map";
970	width = 3;	1002	width = 3;
971	height = 3;	1003	height = 3;
972	nodrop = 1;	1004	no_drop = 1;
		1005	no_reset = 1;
973		1006
974	alloc ();	1007	alloc ();
975	in_memory = MAP_ACTIVE;	1008	in_memory = MAP_ACTIVE;
976	}	1009	}
		1010
		1011	~freed_map ()
		1012	{
		1013	destroy ();
		1014	}
977	} freed_map; // freed objects are moved here to avoid crashes	1015	} freed_map; // freed objects are moved here to avoid crashes
978		1016
979	void	1017	void
980	object::do_destroy ()	1018	object::do_destroy ()
981	{	1019	{
982	if (flag [FLAG_IS_LINKED])	1020	if (flag [FLAG_IS_LINKED])
983	remove_button_link (this);	1021	remove_link ();
984		1022
985	if (flag [FLAG_FRIENDLY])	1023	if (flag [FLAG_FRIENDLY])
986	remove_friendly_object (this);	1024	remove_friendly_object (this);
987		1025
988	remove ();	1026	remove ();
…		…
1013	attacked_by = 0;	1051	attacked_by = 0;
1014	current_weapon = 0;	1052	current_weapon = 0;
1015	}	1053	}
1016		1054
1017	void	1055	void
1018	object::destroy (bool destroy_inventory)	1056	object::destroy ()
1019	{	1057	{
1020	if (destroyed ())	1058	if (destroyed ())
1021	return;	1059	return;
1022		1060
1023	if (!is_head () && !head->destroyed ())	1061	if (!is_head () && !head->destroyed ())
1024	{	1062	{
1025	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");	1063	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1026	head->destroy (destroy_inventory);	1064	head->destroy ();
1027	return;	1065	return;
1028	}	1066	}
1029		1067
1030	destroy_inv (!destroy_inventory);	1068	destroy_inv (false);
1031		1069
1032	if (is_head ())	1070	if (is_head ())
1033	if (sound_destroy)	1071	if (sound_destroy)
1034	play_sound (sound_destroy);	1072	play_sound (sound_destroy);
1035	else if (flag [FLAG_MONSTER])	1073	else if (flag [FLAG_MONSTER])
…		…
1046	* the previous environment.	1084	* the previous environment.
1047	*/	1085	*/
1048	void	1086	void
1049	object::do_remove ()	1087	object::do_remove ()
1050	{	1088	{
1051	object *tmp, *last = 0;
1052	object *otmp;
1053
1054	if (flag [FLAG_REMOVED])	1089	if (flag [FLAG_REMOVED])
1055	return;	1090	return;
1056		1091
1057	INVOKE_OBJECT (REMOVE, this);	1092	INVOKE_OBJECT (REMOVE, this);
1058		1093
…		…
1072	esrv_del_item (pl->contr, count);	1107	esrv_del_item (pl->contr, count);
1073	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1108	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1074		1109
1075	adjust_weight (env, -total_weight ());	1110	adjust_weight (env, -total_weight ());
1076		1111
1077	*(above ? &above->below : &env->inv) = below;	1112	object *pl = in_player ();
1078
1079	if (below)
1080	below->above = above;
1081		1113
1082	/* we set up values so that it could be inserted into	1114	/* we set up values so that it could be inserted into
1083	* the map, but we don't actually do that - it is up	1115	* the map, but we don't actually do that - it is up
1084	* to the caller to decide what we want to do.	1116	* to the caller to decide what we want to do.
1085	*/	1117	*/
1086	map = env->map;	1118	map = env->map;
1087	x = env->x;	1119	x = env->x;
1088	y = env->y;	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
1089	above = 0;	1126	above = 0;
1090	below = 0;	1127	below = 0;
1091	env = 0;	1128	env = 0;
1092		1129
1093	/* 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
1094	* made to players inventory. If set, avoiding the call	1131	* made to players inventory. If set, avoiding the call
1095	* to save cpu time.	1132	* to save cpu time.
1096	*/	1133	*/
1097	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	{
1098	otmp->update_stats ();	1137	pl->update_stats ();
		1138
		1139	if (glow_radius && pl->is_on_map ())
		1140	update_all_los (pl->map, pl->x, pl->y);
		1141	}
1099	}	1142	}
1100	else if (map)	1143	else if (map)
1101	{	1144	{
1102	map->dirty = true;	1145	map->dirty = true;
1103	mapspace &ms = this->ms ();	1146	mapspace &ms = this->ms ();
1104		1147
1105	if (object *pl = ms.player ())	1148	if (object *pl = ms.player ())
1106	{	1149	{
1107	if (type == PLAYER) // this == pl(!)	1150	if (is_player ())
1108	{	1151	{
		1152	if (!flag [FLAG_WIZPASS])
		1153	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1154
1109	// leaving a spot always closes any open container on the ground	1155	// leaving a spot always closes any open container on the ground
1110	if (container && !container->env)	1156	if (container && !container->env)
1111	// this causes spurious floorbox updates, but it ensures	1157	// this causes spurious floorbox updates, but it ensures
1112	// that the CLOSE event is being sent.	1158	// that the CLOSE event is being sent.
1113	close_container ();	1159	close_container ();
1114		1160
1115	--map->players;	1161	--map->players;
1116	map->touch ();	1162	map->touch ();
1117	}	1163	}
1118	else if (pl->container == this)	1164	else if (pl->container_ () == this)
1119	{	1165	{
1120	// removing a container should close it	1166	// removing a container should close it
1121	close_container ();	1167	close_container ();
1122	}	1168	}
1123		1169
1124	esrv_del_item (pl->contr, count);	1170	esrv_del_item (pl->contr, count);
1125	}	1171	}
1126		1172
1127	/* link the object above us */	1173	/* link the object above us */
1128	if (above)	1174	// re-link, make sure compiler can easily use cmove
1129	above->below = below;	1175	*(above ? &above->below : &ms.top) = below;
1130	else	1176	*(below ? &below->above : &ms.bot) = above;
1131	ms.top = below; /* we were top, set new top */
1132
1133	/* Relink the object below us, if there is one */
1134	if (below)
1135	below->above = above;
1136	else
1137	{
1138	/* Nothing below, which means we need to relink map object for this space
1139	* use translated coordinates in case some oddness with map tiling is
1140	* evident
1141	*/
1142	if (GET_MAP_OB (map, x, y) != this)
1143	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 ());
1144
1145	ms.bot = above; /* goes on above it. */
1146	}
1147		1177
1148	above = 0;	1178	above = 0;
1149	below = 0;	1179	below = 0;
1150		1180
		1181	ms.invalidate ();
		1182
1151	if (map->in_memory == MAP_SAVING)	1183	if (map->in_memory == MAP_SAVING)
1152	return;	1184	return;
1153		1185
1154	int check_walk_off = !flag [FLAG_NO_APPLY];	1186	int check_walk_off = !flag [FLAG_NO_APPLY];
1155		1187
1156	if (object *pl = ms.player ())	1188	if (object *pl = ms.player ())
1157	{	1189	{
1158	if (pl->container == this)	1190	if (pl->container_ () == this)
1159	/* If a container that the player is currently using somehow gets	1191	/* If a container that the player is currently using somehow gets
1160	* removed (most likely destroyed), update the player view	1192	* removed (most likely destroyed), update the player view
1161	* appropriately.	1193	* appropriately.
1162	*/	1194	*/
1163	pl->close_container ();	1195	pl->close_container ();
1164		1196
1165	//TODO: the floorbox prev/next might need updating	1197	//TODO: the floorbox prev/next might need updating
1166	esrv_del_item (pl->contr, count);	1198	//esrv_del_item (pl->contr, count);
		1199	//TODO: update floorbox to preserve ordering
		1200	if (pl->contr->ns)
		1201	pl->contr->ns->floorbox_update ();
1167	}	1202	}
1168		1203
		1204	if (check_walk_off)
1169	for (tmp = ms.bot; tmp; tmp = tmp->above)	1205	for (object *above, *tmp = ms.bot; tmp; tmp = above)
1170	{	1206	{
		1207	above = tmp->above;
		1208
1171	/* 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
1172	* being removed.	1210	* being removed.
1173	*/	1211	*/
1174		1212
1175	/* See if object moving off should effect something */	1213	/* See if object moving off should effect something */
1176	if (check_walk_off
1177	&& ((move_type & tmp->move_off)	1214	if ((move_type & tmp->move_off)
1178	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1215	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1179	{
1180	move_apply (tmp, this, 0);	1216	move_apply (tmp, this, 0);
1181
1182	if (destroyed ())
1183	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1184	}	1217	}
1185		1218
1186	last = tmp;	1219	if (affects_los ())
1187	}
1188
1189	/* last == NULL if there are no objects on this space */
1190	//TODO: this makes little sense, why only update the topmost object?
1191	if (!last)
1192	map->at (x, y).flags_ = 0;
1193	else
1194	update_object (last, UP_OBJ_REMOVE);
1195
1196	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1197	update_all_los (map, x, y);	1220	update_all_los (map, x, y);
1198	}	1221	}
1199	}	1222	}
1200		1223
1201	/*	1224	/*
…		…
1225	esrv_update_item (UPD_NROF, pl, top);	1248	esrv_update_item (UPD_NROF, pl, top);
1226		1249
1227	op->weight = 0; // cancel the addition above	1250	op->weight = 0; // cancel the addition above
1228	op->carrying = 0; // must be 0 already	1251	op->carrying = 0; // must be 0 already
1229		1252
1230	op->destroy (1);	1253	op->destroy ();
1231		1254
1232	return top;	1255	return top;
1233	}	1256	}
1234		1257
1235	return 0;	1258	return 0;
…		…
1263	* job preparing multi-part monsters.	1286	* job preparing multi-part monsters.
1264	*/	1287	*/
1265	object *	1288	object *
1266	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)
1267	{	1290	{
		1291	op->remove ();
		1292
1268	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1293	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1269	{	1294	{
1270	tmp->x = x + tmp->arch->x;	1295	tmp->x = x + tmp->arch->x;
1271	tmp->y = y + tmp->arch->y;	1296	tmp->y = y + tmp->arch->y;
1272	}	1297	}
…		…
1295	* just 'op' otherwise	1320	* just 'op' otherwise
1296	*/	1321	*/
1297	object *	1322	object *
1298	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)
1299	{	1324	{
1300	assert (!op->flag [FLAG_FREED]);
1301
1302	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
1303		1331
1304	/* Ideally, the caller figures this out. However, it complicates a lot	1332	/* Ideally, the caller figures this out. However, it complicates a lot
1305	* 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
1306	* need extra work	1334	* need extra work
1307	*/	1335	*/
		1336	maptile *newmap = m;
1308	if (!xy_normalise (m, op->x, op->y))	1337	if (!xy_normalise (newmap, op->x, op->y))
1309	{	1338	{
1310	op->destroy (1);	1339	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1311	return 0;	1340	return 0;
1312	}	1341	}
1313		1342
1314	if (object *more = op->more)	1343	if (object *more = op->more)
1315	if (!insert_ob_in_map (more, m, originator, flag))	1344	if (!insert_ob_in_map (more, m, originator, flag))
1316	return 0;	1345	return 0;
1317		1346
1318	CLEAR_FLAG (op, FLAG_REMOVED);	1347	op->flag [FLAG_REMOVED] = false;
1319		1348	op->env = 0;
1320	op->map = m;	1349	op->map = newmap;
		1350
1321	mapspace &ms = op->ms ();	1351	mapspace &ms = op->ms ();
1322		1352
1323	/* this has to be done after we translate the coordinates.	1353	/* this has to be done after we translate the coordinates.
1324	*/	1354	*/
1325	if (op->nrof && !(flag & INS_NO_MERGE))	1355	if (op->nrof && !(flag & INS_NO_MERGE))
1326	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1356	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1327	if (object::can_merge (op, tmp))	1357	if (object::can_merge (op, tmp))
1328	{	1358	{
1329	// TODO: we atcually want to update tmp, not op,	1359	// TODO: we actually want to update tmp, not op,
1330	// but some caller surely breaks when we return tmp	1360	// but some caller surely breaks when we return tmp
1331	// from here :/	1361	// from here :/
1332	op->nrof += tmp->nrof;	1362	op->nrof += tmp->nrof;
1333	tmp->destroy (1);	1363	tmp->destroy ();
1334	}	1364	}
1335		1365
1336	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 */
1337	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1367	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1338		1368
…		…
1345	{	1375	{
1346	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");
1347	abort ();	1377	abort ();
1348	}	1378	}
1349		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
1350	op->above = originator;	1387	op->above = originator;
1351	op->below = originator->below;	1388	op->below = originator->below;
1352
1353	if (op->below)
1354	op->below->above = op;
1355	else
1356	ms.bot = op;
1357
1358	/* since *below* originator, no need to update top */
1359	originator->below = op;	1389	originator->below = op;
		1390
		1391	*(op->below ? &op->below->above : &ms.bot) = op;
1360	}	1392	}
1361	else	1393	else
1362	{	1394	{
1363	object *top, *floor = NULL;	1395	object *floor = 0;
1364		1396	object *top = ms.top;
1365	top = ms.bot;
1366		1397
1367	/* If there are other objects, then */	1398	/* If there are other objects, then */
1368	if (top)	1399	if (top)
1369	{	1400	{
1370	object *last = 0;
1371
1372	/*	1401	/*
1373	* 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.
1374	* We've already dealt with merging if appropriate.	1403	* We've already dealt with merging if appropriate.
1375	* 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
1376	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1405	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1379	* 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
1380	* 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
1381	* 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
1382	* that flying non pickable objects are spell objects.	1411	* that flying non pickable objects are spell objects.
1383	*/	1412	*/
1384	for (top = ms.bot; top; top = top->above)	1413	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1385	{	1414	{
1386	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))
1387	floor = top;	1416	floor = tmp;
1388		1417
1389	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))
1390	{	1419	{
1391	/* We insert above top, so we want this object below this */	1420	/* We insert above top, so we want this object below this */
1392	top = top->below;	1421	top = tmp->below;
1393	break;	1422	break;
1394	}	1423	}
1395		1424
1396	last = top;	1425	top = tmp;
1397	}	1426	}
1398
1399	/* Don't want top to be NULL, so set it to the last valid object */
1400	top = last;
1401		1427
1402	/* We let update_position deal with figuring out what the space	1428	/* We let update_position deal with figuring out what the space
1403	* looks like instead of lots of conditions here.	1429	* looks like instead of lots of conditions here.
1404	* makes things faster, and effectively the same result.	1430	* makes things faster, and effectively the same result.
1405	*/	1431	*/
…		…
1412	*/	1438	*/
1413	if (!(flag & INS_ON_TOP)	1439	if (!(flag & INS_ON_TOP)
1414	&& ms.flags () & P_BLOCKSVIEW	1440	&& ms.flags () & P_BLOCKSVIEW
1415	&& (op->face && !faces [op->face].visibility))	1441	&& (op->face && !faces [op->face].visibility))
1416	{	1442	{
		1443	object *last;
		1444
1417	for (last = top; last != floor; last = last->below)	1445	for (last = top; last != floor; last = last->below)
1418	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1446	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1419	break;	1447	break;
1420		1448
1421	/* Check to see if we found the object that blocks view,	1449	/* Check to see if we found the object that blocks view,
…		…
1429	} /* If objects on this space */	1457	} /* If objects on this space */
1430		1458
1431	if (flag & INS_ABOVE_FLOOR_ONLY)	1459	if (flag & INS_ABOVE_FLOOR_ONLY)
1432	top = floor;	1460	top = floor;
1433		1461
1434	/* 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
1435	*/
1436
1437	/* First object on this space */
1438	if (!top)	1463	if (!top)
1439	{	1464	{
		1465	op->below = 0;
1440	op->above = ms.bot;	1466	op->above = ms.bot;
1441
1442	if (op->above)
1443	op->above->below = op;
1444
1445	op->below = 0;
1446	ms.bot = op;	1467	ms.bot = op;
		1468
		1469	*(op->above ? &op->above->below : &ms.top) = op;
1447	}	1470	}
1448	else	1471	else
1449	{ /* get inserted into the stack above top */	1472	{
1450	op->above = top->above;	1473	op->above = top->above;
1451
1452	if (op->above)
1453	op->above->below = op;	1474	top->above = op;
1454		1475
1455	op->below = top;	1476	op->below = top;
1456	top->above = op;	1477	*(op->above ? &op->above->below : &ms.top) = op;
1457	}	1478	}
		1479	}
1458		1480
1459	if (!op->above)	1481	if (op->is_player ())
1460	ms.top = op;
1461	} /* else not INS_BELOW_ORIGINATOR */
1462
1463	if (op->type == PLAYER)
1464	{	1482	{
1465	op->contr->do_los = 1;	1483	op->contr->do_los = 1;
1466	++op->map->players;	1484	++op->map->players;
1467	op->map->touch ();	1485	op->map->touch ();
1468	}	1486	}
1469		1487
1470	op->map->dirty = true;	1488	op->map->dirty = true;
1471		1489
1472	if (object *pl = ms.player ())	1490	if (object *pl = ms.player ())
1473	//TODO: the floorbox prev/next might need updating	1491	//TODO: the floorbox prev/next might need updating
1474	esrv_send_item (pl, op);	1492	//esrv_send_item (pl, op);
		1493	//TODO: update floorbox to preserve ordering
		1494	if (pl->contr->ns)
		1495	pl->contr->ns->floorbox_update ();
1475		1496
1476	/* If this object glows, it may affect lighting conditions that are	1497	/* If this object glows, it may affect lighting conditions that are
1477	* 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
1478	* 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
1479	* on the map will get recalculated. The players could very well	1500	* on the map will get recalculated. The players could very well
1480	* 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 -
1481	* this should get redone to only look for players within range,	1502	* this should get redone to only look for players within range,
1482	* or just updating the P_UPTODATE for spaces within this area	1503	* or just updating the P_UPTODATE for spaces within this area
1483	* of effect may be sufficient.	1504	* of effect may be sufficient.
1484	*/	1505	*/
1485	if (op->map->darkness && (op->glow_radius != 0))	1506	if (op->affects_los ())
		1507	{
		1508	op->ms ().invalidate ();
1486	update_all_los (op->map, op->x, op->y);	1509	update_all_los (op->map, op->x, op->y);
		1510	}
1487		1511
1488	/* updates flags (blocked, alive, no magic, etc) for this map space */	1512	/* updates flags (blocked, alive, no magic, etc) for this map space */
1489	update_object (op, UP_OBJ_INSERT);	1513	update_object (op, UP_OBJ_INSERT);
1490		1514
1491	INVOKE_OBJECT (INSERT, op);	1515	INVOKE_OBJECT (INSERT, op);
…		…
1498	* blocked() and wall() work properly), and these flags are updated by	1522	* blocked() and wall() work properly), and these flags are updated by
1499	* update_object().	1523	* update_object().
1500	*/	1524	*/
1501		1525
1502	/* 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 */
1503	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1527	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1504	{	1528	{
1505	if (check_move_on (op, originator))	1529	if (check_move_on (op, originator))
1506	return 0;	1530	return 0;
1507		1531
1508	/* 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
…		…
1519	/* this function inserts an object in the map, but if it	1543	/* this function inserts an object in the map, but if it
1520	* 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.
1521	* 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.
1522	*/	1546	*/
1523	void	1547	void
1524	replace_insert_ob_in_map (const char *arch_string, object *op)	1548	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1525	{	1549	{
1526	/* first search for itself and remove any old instances */	1550	/* first search for itself and remove any old instances */
1527		1551
1528	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1552	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1529	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1553	if (tmp->arch->archname == archname) /* same archetype */
1530	tmp->destroy (1);	1554	tmp->destroy ();
1531		1555
1532	object *tmp = arch_to_object (archetype::find (arch_string));	1556	object *tmp = arch_to_object (archetype::find (archname));
1533		1557
1534	tmp->x = op->x;	1558	tmp->x = op->x;
1535	tmp->y = op->y;	1559	tmp->y = op->y;
1536		1560
1537	insert_ob_in_map (tmp, op->map, op, 0);	1561	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1542	{	1566	{
1543	if (where->env)	1567	if (where->env)
1544	return where->env->insert (this);	1568	return where->env->insert (this);
1545	else	1569	else
1546	return where->map->insert (this, where->x, where->y, originator, flags);	1570	return where->map->insert (this, where->x, where->y, originator, flags);
		1571	}
		1572
		1573	// check whether we can put this into the map, respect max_volume, max_items
		1574	bool
		1575	object::can_drop_at (maptile *m, int x, int y, object *originator)
		1576	{
		1577	mapspace &ms = m->at (x, y);
		1578
		1579	int items = ms.items ();
		1580
		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	return true;
		1585
		1586	if (originator && originator->is_player ())
		1587	originator->contr->failmsg (format (
		1588	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
		1589	query_name ()
		1590	));
		1591
		1592	return false;
1547	}	1593	}
1548		1594
1549	/*	1595	/*
1550	* decrease(object, number) decreases a specified number from	1596	* decrease(object, number) decreases a specified number from
1551	* the amount of an object. If the amount reaches 0, the object	1597	* the amount of an object. If the amount reaches 0, the object
…		…
1559	if (!nr)	1605	if (!nr)
1560	return true;	1606	return true;
1561		1607
1562	nr = min (nr, nrof);	1608	nr = min (nr, nrof);
1563		1609
		1610	if (nrof > nr)
		1611	{
1564	nrof -= nr;	1612	nrof -= nr;
1565
1566	if (nrof)
1567	{
1568	adjust_weight (env, -weight * nr); // carrying == 0	1613	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1569		1614
1570	if (object *pl = visible_to ())	1615	if (object *pl = visible_to ())
1571	esrv_update_item (UPD_NROF, pl, this);	1616	esrv_update_item (UPD_NROF, pl, this);
1572		1617
1573	return true;	1618	return true;
1574	}	1619	}
1575	else	1620	else
1576	{	1621	{
1577	destroy (1);	1622	destroy ();
1578	return false;	1623	return false;
1579	}	1624	}
1580	}	1625	}
1581		1626
1582	/*	1627	/*
…		…
1599	}	1644	}
1600	else	1645	else
1601	{	1646	{
1602	decrease (nr);	1647	decrease (nr);
1603		1648
1604	object *op = object_create_clone (this);	1649	object *op = deep_clone ();
1605	op->nrof = nr;	1650	op->nrof = nr;
1606	return op;	1651	return op;
1607	}	1652	}
1608	}	1653	}
1609		1654
…		…
1659	if (object *pl = tmp->visible_to ())	1704	if (object *pl = tmp->visible_to ())
1660	esrv_update_item (UPD_NROF, pl, tmp);	1705	esrv_update_item (UPD_NROF, pl, tmp);
1661		1706
1662	adjust_weight (this, op->total_weight ());	1707	adjust_weight (this, op->total_weight ());
1663		1708
1664	op->destroy (1);	1709	op->destroy ();
1665	op = tmp;	1710	op = tmp;
1666	goto inserted;	1711	goto inserted;
1667	}	1712	}
1668		1713
1669	op->owner = 0; // it's his/hers now. period.	1714	op->owner = 0; // it's his/hers now. period.
…		…
1687		1732
1688	adjust_weight (this, op->total_weight ());	1733	adjust_weight (this, op->total_weight ());
1689		1734
1690	inserted:	1735	inserted:
1691	/* reset the light list and los of the players on the map */	1736	/* reset the light list and los of the players on the map */
1692	if (op->glow_radius && map && map->darkness)	1737	if (op->glow_radius && is_on_map ())
		1738	{
		1739	update_stats ();
1693	update_all_los (map, x, y);	1740	update_all_los (map, x, y);
1694		1741	}
		1742	else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])
1695	// if this is a player's inventory, update stats	1743	// if this is a player's inventory, update stats
1696	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1697	update_stats ();	1744	update_stats ();
1698		1745
1699	INVOKE_OBJECT (INSERT, this);	1746	INVOKE_OBJECT (INSERT, this);
1700		1747
1701	return op;	1748	return op;
…		…
1722	* on top.	1769	* on top.
1723	*/	1770	*/
1724	int	1771	int
1725	check_move_on (object *op, object *originator)	1772	check_move_on (object *op, object *originator)
1726	{	1773	{
		1774	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1775	return 0;
		1776
1727	object *tmp;	1777	object *tmp;
1728	maptile *m = op->map;	1778	maptile *m = op->map;
1729	int x = op->x, y = op->y;	1779	int x = op->x, y = op->y;
1730		1780
1731	MoveType move_on, move_slow, move_block;	1781	mapspace &ms = m->at (x, y);
1732		1782
1733	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1783	ms.update ();
1734	return 0;
1735		1784
1736	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1785	MoveType move_on = ms.move_on;
1737	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1786	MoveType move_slow = ms.move_slow;
1738	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1787	MoveType move_block = ms.move_block;
1739		1788
1740	/* if nothing on this space will slow op down or be applied,	1789	/* if nothing on this space will slow op down or be applied,
1741	* no need to do checking below. have to make sure move_type	1790	* no need to do checking below. have to make sure move_type
1742	* is set, as lots of objects don't have it set - we treat that	1791	* is set, as lots of objects don't have it set - we treat that
1743	* as walking.	1792	* as walking.
…		…
1754	return 0;	1803	return 0;
1755		1804
1756	/* The objects have to be checked from top to bottom.	1805	/* The objects have to be checked from top to bottom.
1757	* Hence, we first go to the top:	1806	* Hence, we first go to the top:
1758	*/	1807	*/
1759		1808	for (object *next, *tmp = ms.top; tmp; tmp = next)
1760	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1761	{
1762	/* Trim the search when we find the first other spell effect
1763	* this helps performance so that if a space has 50 spell objects,
1764	* we don't need to check all of them.
1765	*/
1766	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1767	break;
1768	}	1809	{
		1810	next = tmp->below;
1769		1811
1770	for (; tmp; tmp = tmp->below)
1771	{
1772	if (tmp == op)	1812	if (tmp == op)
1773	continue; /* Can't apply yourself */	1813	continue; /* Can't apply yourself */
1774		1814
1775	/* Check to see if one of the movement types should be slowed down.	1815	/* Check to see if one of the movement types should be slowed down.
1776	* Second check makes sure that the movement types not being slowed	1816	* Second check makes sure that the movement types not being slowed
…		…
1781	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1821	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1782	{	1822	{
1783	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1823	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1784	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1824	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1785	{	1825	{
1786
1787	float
1788	diff = tmp->move_slow_penalty * fabs (op->speed);	1826	float diff = tmp->move_slow_penalty * fabs (op->speed);
1789		1827
1790	if (op->type == PLAYER)	1828	if (op->is_player ())
1791	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1829	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1792	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1830	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1793	diff /= 4.0;	1831	diff /= 4.0;
1794		1832
1795	op->speed_left -= diff;	1833	op->speed_left -= diff;
1796	}	1834	}
1797	}	1835	}
…		…
1830	LOG (llevError, "Present_arch called outside map.\n");	1868	LOG (llevError, "Present_arch called outside map.\n");
1831	return NULL;	1869	return NULL;
1832	}	1870	}
1833		1871
1834	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1872	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1835	if (tmp->arch == at)	1873	if (tmp->arch->archname == at->archname)
1836	return tmp;	1874	return tmp;
1837		1875
1838	return NULL;	1876	return NULL;
1839	}	1877	}
1840		1878
…		…
1904	* The first matching object is returned, or NULL if none.	1942	* The first matching object is returned, or NULL if none.
1905	*/	1943	*/
1906	object *	1944	object *
1907	present_arch_in_ob (const archetype *at, const object *op)	1945	present_arch_in_ob (const archetype *at, const object *op)
1908	{	1946	{
1909	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1947	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1910	if (tmp->arch == at)	1948	if (tmp->arch->archname == at->archname)
1911	return tmp;	1949	return tmp;
1912		1950
1913	return NULL;	1951	return NULL;
1914	}	1952	}
1915		1953
…		…
2003	* head of the object should correspond for the entire object.	2041	* head of the object should correspond for the entire object.
2004	*/	2042	*/
2005	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	2043	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
2006	continue;	2044	continue;
2007		2045
2008	if (ob->blocked (m, pos.x, pos.y))	2046	if (ob->blocked (pos.m, pos.x, pos.y))
2009	continue;	2047	continue;
2010		2048
2011	altern [index++] = i;	2049	altern [index++] = i;
2012	}	2050	}
2013		2051
…		…
2081	* there is capable of.	2119	* there is capable of.
2082	*/	2120	*/
2083	int	2121	int
2084	find_dir (maptile *m, int x, int y, object *exclude)	2122	find_dir (maptile *m, int x, int y, object *exclude)
2085	{	2123	{
2086	int i, max = SIZEOFFREE, mflags;	2124	int max = SIZEOFFREE, mflags;
2087
2088	sint16 nx, ny;
2089	object *tmp;
2090	maptile *mp;
2091
2092	MoveType blocked, move_type;	2125	MoveType move_type;
2093		2126
2094	if (exclude && exclude->head_ () != exclude)	2127	if (exclude && exclude->head_ () != exclude)
2095	{	2128	{
2096	exclude = exclude->head;	2129	exclude = exclude->head;
2097	move_type = exclude->move_type;	2130	move_type = exclude->move_type;
…		…
2100	{	2133	{
2101	/* If we don't have anything, presume it can use all movement types. */	2134	/* If we don't have anything, presume it can use all movement types. */
2102	move_type = MOVE_ALL;	2135	move_type = MOVE_ALL;
2103	}	2136	}
2104		2137
2105	for (i = 1; i < max; i++)	2138	for (int i = 1; i < max; i++)
2106	{	2139	{
2107	mp = m;	2140	mapxy pos (m, x, y);
2108	nx = x + freearr_x[i];	2141	pos.move (i);
2109	ny = y + freearr_y[i];
2110		2142
2111	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2143	if (!pos.normalise ())
2112
2113	if (mflags & P_OUT_OF_MAP)
2114	max = maxfree[i];	2144	max = maxfree[i];
2115	else	2145	else
2116	{	2146	{
2117	mapspace &ms = mp->at (nx, ny);	2147	mapspace &ms = *pos;
2118		2148
2119	blocked = ms.move_block;
2120
2121	if ((move_type & blocked) == move_type)	2149	if ((move_type & ms.move_block) == move_type)
2122	max = maxfree[i];	2150	max = maxfree [i];
2123	else if (mflags & P_IS_ALIVE)	2151	else if (ms.flags () & P_IS_ALIVE)
2124	{	2152	{
2125	for (tmp = ms.bot; tmp; tmp = tmp->above)	2153	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2126	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2154	if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2127	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2155	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2128	break;
2129
2130	if (tmp)
2131	return freedir[i];	2156	return freedir [i];
2132	}	2157	}
2133	}	2158	}
2134	}	2159	}
2135		2160
2136	return 0;	2161	return 0;
…		…
2211	* This basically means that if direction is 15, then it could either go	2236	* This basically means that if direction is 15, then it could either go
2212	* direction 4, 14, or 16 to get back to where we are.	2237	* direction 4, 14, or 16 to get back to where we are.
2213	* Moved from spell_util.c to object.c with the other related direction	2238	* Moved from spell_util.c to object.c with the other related direction
2214	* functions.	2239	* functions.
2215	*/	2240	*/
2216	int reduction_dir[SIZEOFFREE][3] = {	2241	static const int reduction_dir[SIZEOFFREE][3] = {
2217	{0, 0, 0}, /* 0 */	2242	{0, 0, 0}, /* 0 */
2218	{0, 0, 0}, /* 1 */	2243	{0, 0, 0}, /* 1 */
2219	{0, 0, 0}, /* 2 */	2244	{0, 0, 0}, /* 2 */
2220	{0, 0, 0}, /* 3 */	2245	{0, 0, 0}, /* 3 */
2221	{0, 0, 0}, /* 4 */	2246	{0, 0, 0}, /* 4 */
…		…
2317	int	2342	int
2318	can_pick (const object *who, const object *item)	2343	can_pick (const object *who, const object *item)
2319	{	2344	{
2320	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2345	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2321	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2346	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2322	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2347	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2323	}	2348	}
2324		2349
2325	/*	2350	/*
2326	* create clone from object to another	2351	* create clone from object to another
2327	*/	2352	*/
2328	object *	2353	object *
2329	object_create_clone (object *asrc)	2354	object::deep_clone ()
2330	{	2355	{
2331	object *dst = 0, *tmp, *src, *prev, *item;	2356	assert (("deep_clone called on non-head object", is_head ()));
2332		2357
2333	if (!asrc)	2358	object *dst = clone ();
2334	return 0;
2335		2359
2336	src = asrc->head_ ();	2360	object *prev = dst;
2337
2338	prev = 0;
2339	for (object *part = src; part; part = part->more)	2361	for (object *part = this->more; part; part = part->more)
2340	{	2362	{
2341	tmp = part->clone ();	2363	object *tmp = part->clone ();
2342	tmp->x -= src->x;
2343	tmp->y -= src->y;
2344
2345	if (!part->head)
2346	{
2347	dst = tmp;
2348	tmp->head = 0;
2349	}
2350	else
2351	tmp->head = dst;	2364	tmp->head = dst;
2352
2353	tmp->more = 0;
2354
2355	if (prev)
2356	prev->more = tmp;	2365	prev->more = tmp;
2357
2358	prev = tmp;	2366	prev = tmp;
2359	}	2367	}
2360		2368
2361	for (item = src->inv; item; item = item->below)	2369	for (object *item = inv; item; item = item->below)
2362	insert_ob_in_ob (object_create_clone (item), dst);	2370	insert_ob_in_ob (item->deep_clone (), dst);
2363		2371
2364	return dst;	2372	return dst;
2365	}	2373	}
2366		2374
2367	/* This returns the first object in who's inventory that	2375	/* This returns the first object in who's inventory that
…		…
2376	return tmp;	2384	return tmp;
2377		2385
2378	return 0;	2386	return 0;
2379	}	2387	}
2380		2388
2381	/* If ob has a field named key, return the link from the list,	2389	shstr_tmp
2382	* otherwise return NULL.	2390	object::kv_get (shstr_tmp key) const
2383	*
2384	* key must be a passed in shared string - otherwise, this won't
2385	* do the desired thing.
2386	*/
2387	key_value *
2388	get_ob_key_link (const object *ob, const char *key)
2389	{	2391	{
2390	for (key_value *link = ob->key_values; link; link = link->next)	2392	for (key_value *kv = key_values; kv; kv = kv->next)
2391	if (link->key == key)	2393	if (kv->key == key)
2392	return link;
2393
2394	return 0;
2395	}
2396
2397	/*
2398	* Returns the value of op has an extra_field for key, or NULL.
2399	*
2400	* The argument doesn't need to be a shared string.
2401	*
2402	* The returned string is shared.
2403	*/
2404	const char *
2405	get_ob_key_value (const object *op, const char *const key)
2406	{
2407	key_value *link;
2408	shstr_cmp canonical_key (key);
2409
2410	if (!canonical_key)
2411	{
2412	/* 1. There being a field named key on any object
2413	* implies there'd be a shared string to find.
2414	* 2. Since there isn't, no object has this field.
2415	* 3. Therefore, *this* object doesn't have this field.
2416	*/
2417	return 0;
2418	}
2419
2420	/* This is copied from get_ob_key_link() above -
2421	* only 4 lines, and saves the function call overhead.
2422	*/
2423	for (link = op->key_values; link; link = link->next)
2424	if (link->key == canonical_key)
2425	return link->value;	2394	return kv->value;
2426		2395
2427	return 0;	2396	return shstr ();
2428	}	2397	}
2429		2398
2430	/*	2399	void
2431	* Updates the canonical_key in op to value.	2400	object::kv_set (shstr_tmp key, shstr_tmp value)
2432	*
2433	* canonical_key is a shared string (value doesn't have to be).
2434	*
2435	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2436	* keys.
2437	*
2438	* Returns TRUE on success.
2439	*/
2440	int
2441	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2442	{	2401	{
2443	key_value *field = NULL, *last = NULL;	2402	for (key_value *kv = key_values; kv; kv = kv->next)
2444		2403	if (kv->key == key)
2445	for (field = op->key_values; field != NULL; field = field->next)
2446	{
2447	if (field->key != canonical_key)
2448	{	2404	{
2449	last = field;	2405	kv->value = value;
2450	continue;	2406	return;
2451	}	2407	}
2452		2408
2453	if (value)	2409	key_value *kv = new key_value;
2454	field->value = value;	2410
2455	else	2411	kv->next = key_values;
		2412	kv->key = key;
		2413	kv->value = value;
		2414
		2415	key_values = kv;
		2416	}
		2417
		2418	void
		2419	object::kv_del (shstr_tmp key)
		2420	{
		2421	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2422	if ((*kvp)->key == key)
2456	{	2423	{
2457	/* Basically, if the archetype has this key set,	2424	key_value *kv = *kvp;
2458	* we need to store the null value so when we save	2425	*kvp = (*kvp)->next;
2459	* it, we save the empty value so that when we load,	2426	delete kv;
2460	* we get this value back again.	2427	return;
2461	*/
2462	if (get_ob_key_link (op->arch, canonical_key))
2463	field->value = 0;
2464	else
2465	{
2466	if (last)
2467	last->next = field->next;
2468	else
2469	op->key_values = field->next;
2470
2471	delete field;
2472	}
2473	}	2428	}
2474	return TRUE;
2475	}
2476	/* IF we get here, key doesn't exist */
2477
2478	/* No field, we'll have to add it. */
2479
2480	if (!add_key)
2481	return FALSE;
2482
2483	/* There isn't any good reason to store a null
2484	* value in the key/value list. If the archetype has
2485	* this key, then we should also have it, so shouldn't
2486	* be here. If user wants to store empty strings,
2487	* should pass in ""
2488	*/
2489	if (value == NULL)
2490	return TRUE;
2491
2492	field = new key_value;
2493
2494	field->key = canonical_key;
2495	field->value = value;
2496	/* Usual prepend-addition. */
2497	field->next = op->key_values;
2498	op->key_values = field;
2499
2500	return TRUE;
2501	}
2502
2503	/*
2504	* Updates the key in op to value.
2505	*
2506	* If add_key is FALSE, this will only update existing keys,
2507	* and not add new ones.
2508	* In general, should be little reason FALSE is ever passed in for add_key
2509	*
2510	* Returns TRUE on success.
2511	*/
2512	int
2513	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2514	{
2515	shstr key_ (key);
2516
2517	return set_ob_key_value_s (op, key_, value, add_key);
2518	}	2429	}
2519		2430
2520	object::depth_iterator::depth_iterator (object *container)	2431	object::depth_iterator::depth_iterator (object *container)
2521	: iterator_base (container)	2432	: iterator_base (container)
2522	{	2433	{
…		…
2572	{	2483	{
2573	char flagdesc[512];	2484	char flagdesc[512];
2574	char info2[256 * 4];	2485	char info2[256 * 4];
2575	char *p = info;	2486	char *p = info;
2576		2487
2577	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2488	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2578	count,	2489	count,
2579	uuid.c_str (),	2490	uuid.c_str (),
2580	&name,	2491	&name,
2581	title ? "\",title:\"" : "",	2492	title ? ",title:\"" : "",
2582	title ? (const char *)title : "",	2493	title ? (const char *)title : "",
		2494	title ? "\"" : "",
2583	flag_desc (flagdesc, 512), type);	2495	flag_desc (flagdesc, 512), type);
2584		2496
2585	if (!flag[FLAG_REMOVED] && env)	2497	if (!flag[FLAG_REMOVED] && env)
2586	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2498	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2587		2499
…		…
2643	container = 0;	2555	container = 0;
2644		2556
2645	// client needs item update to make it work, client bug requires this to be separate	2557	// client needs item update to make it work, client bug requires this to be separate
2646	esrv_update_item (UPD_FLAGS, this, old_container);	2558	esrv_update_item (UPD_FLAGS, this, old_container);
2647		2559
2648	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2560	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2649	play_sound (sound_find ("chest_close"));	2561	play_sound (sound_find ("chest_close"));
2650	}	2562	}
2651		2563
2652	if (new_container)	2564	if (new_container)
2653	{	2565	{
…		…
2663	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2575	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2664	new_container->insert (closer);	2576	new_container->insert (closer);
2665	}	2577	}
2666	#endif	2578	#endif
2667		2579
2668	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2580	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2669		2581
2670	// make sure the container is available, client bug requires this to be separate	2582	// make sure the container is available, client bug requires this to be separate
2671	esrv_send_item (this, new_container);	2583	esrv_send_item (this, new_container);
2672		2584
2673	new_container->flag [FLAG_APPLIED] = true;	2585	new_container->flag [FLAG_APPLIED] = true;
…		…
2681	// else if (!old_container->env && contr && contr->ns)	2593	// else if (!old_container->env && contr && contr->ns)
2682	// contr->ns->floorbox_reset ();	2594	// contr->ns->floorbox_reset ();
2683	}	2595	}
2684		2596
2685	object *	2597	object *
2686	object::force_find (const shstr name)	2598	object::force_find (shstr_tmp name)
2687	{	2599	{
2688	/* cycle through his inventory to look for the MARK we want to	2600	/* cycle through his inventory to look for the MARK we want to
2689	* place	2601	* place
2690	*/	2602	*/
2691	for (object *tmp = inv; tmp; tmp = tmp->below)	2603	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2693	return splay (tmp);	2605	return splay (tmp);
2694		2606
2695	return 0;	2607	return 0;
2696	}	2608	}
2697		2609
		2610	//-GPL
		2611
2698	void	2612	void
		2613	object::force_set_timer (int duration)
		2614	{
		2615	this->duration = 1;
		2616	this->speed_left = -1.f;
		2617
		2618	this->set_speed (duration ? 1.f / duration : 0.f);
		2619	}
		2620
		2621	object *
2699	object::force_add (const shstr name, int duration)	2622	object::force_add (shstr_tmp name, int duration)
2700	{	2623	{
2701	if (object *force = force_find (name))	2624	if (object *force = force_find (name))
2702	force->destroy ();	2625	force->destroy ();
2703		2626
2704	object *force = get_archetype (FORCE_NAME);	2627	object *force = get_archetype (FORCE_NAME);
2705		2628
2706	force->slaying = name;	2629	force->slaying = name;
2707	force->stats.food = 1;	2630	force->force_set_timer (duration);
2708	force->speed_left = -1.f;
2709
2710	force->set_speed (duration ? 1.f / duration : 0.f);
2711	force->flag [FLAG_IS_USED_UP] = true;
2712	force->flag [FLAG_APPLIED] = true;	2631	force->flag [FLAG_APPLIED] = true;
2713		2632
2714	insert (force);	2633	return insert (force);
2715	}	2634	}
2716		2635
2717	void	2636	void
2718	object::play_sound (faceidx sound)	2637	object::play_sound (faceidx sound) const
2719	{	2638	{
2720	if (!sound)	2639	if (!sound)
2721	return;	2640	return;
2722		2641
2723	if (flag [FLAG_REMOVED])	2642	if (is_on_map ())
		2643	map->play_sound (sound, x, y);
		2644	else if (object *pl = in_player ())
		2645	pl->contr->play_sound (sound);
		2646	}
		2647
		2648	void
		2649	object::say_msg (const char *msg) const
		2650	{
		2651	if (is_on_map ())
		2652	map->say_msg (msg, x, y);
		2653	else if (object *pl = in_player ())
		2654	pl->contr->play_sound (sound);
		2655	}
		2656
		2657	void
		2658	object::make_noise ()
		2659	{
		2660	// we do not model noise in the map, so instead put
		2661	// a temporary light into the noise source
		2662	// could use the map instead, but that's less reliable for our
		2663	// goal, which is to make invisibility a bit harder to exploit
		2664
		2665	// currently only works sensibly for players
		2666	if (!is_player ())
2724	return;	2667	return;
2725		2668
2726	if (env)	2669	// find old force, or create new one
2727	{	2670	object *force = force_find (shstr_noise_force);
2728	if (object *pl = in_player ())	2671
2729	pl->contr->play_sound (sound);	2672	if (force)
2730	}	2673	force->speed_left = -1.f; // patch old speed up
2731	else	2674	else
2732	map->play_sound (sound, x, y);	2675	{
2733	}	2676	force = archetype::get (shstr_noise_force);
2734		2677
		2678	force->slaying = shstr_noise_force;
		2679	force->stats.food = 1;
		2680	force->speed_left = -1.f;
		2681
		2682	force->set_speed (1.f / 4.f);
		2683	force->flag [FLAG_IS_USED_UP] = true;
		2684	force->flag [FLAG_APPLIED] = true;
		2685
		2686	insert (force);
		2687	}
		2688	}
		2689

Diff Legend

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