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.221 by root, Thu Apr 24 12:06:01 2008 UTC vs.
Revision 1.305 by root, Wed Nov 11 04:45:22 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->material != ob2->material
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
…		…
746	* UP_OBJ_FACE: only the objects face has changed.	772	* UP_OBJ_FACE: only the objects face has changed.
747	*/	773	*/
748	void	774	void
749	update_object (object *op, int action)	775	update_object (object *op, int action)
750	{	776	{
751	if (op == NULL)	777	if (!op)
752	{	778	{
753	/* this should never happen */	779	/* this should never happen */
754	LOG (llevDebug, "update_object() called for NULL object.\n");	780	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
755	return;	781	return;
756	}	782	}
757		783
758	if (op->env)	784	if (!op->is_on_map ())
759	{	785	{
760	/* Animation is currently handled by client, so nothing	786	/* Animation is currently handled by client, so nothing
761	* to do in this case.	787	* to do in this case.
762	*/	788	*/
763	return;	789	return;
764	}	790	}
765
766	/* If the map is saving, don't do anything as everything is
767	* going to get freed anyways.
768	*/
769	if (!op->map || op->map->in_memory == MAP_SAVING)
770	return;
771		791
772	/* make sure the object is within map boundaries */	792	/* make sure the object is within map boundaries */
773	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)
774	{	794	{
775	LOG (llevError, "update_object() called for object out of map!\n");	795	LOG (llevError, "update_object() called for object out of map!\n");
…		…
783		803
784	if (!(m.flags_ & P_UPTODATE))	804	if (!(m.flags_ & P_UPTODATE))
785	/* nop */;	805	/* nop */;
786	else if (action == UP_OBJ_INSERT)	806	else if (action == UP_OBJ_INSERT)
787	{	807	{
		808	#if 0
788	// this is likely overkill, TODO: revisit (schmorp)	809	// this is likely overkill, TODO: revisit (schmorp)
789	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	810	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
790	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	811	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
791	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	812	|| (op->is_player () && !(m.flags_ & P_PLAYER))
792	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	813	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
793	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	814	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
794	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	815	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
795	|| (m.move_on | op->move_on ) != m.move_on	816	|| (m.move_on | op->move_on ) != m.move_on
796	|| (m.move_off | op->move_off ) != m.move_off	817	|| (m.move_off | op->move_off ) != m.move_off
797	|| (m.move_slow | op->move_slow) != m.move_slow	818	|| (m.move_slow | op->move_slow) != m.move_slow
798	/* 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
799	* to have move_allow right now.	820	* have move_allow right now.
800	*/	821	*/
801	|| ((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
802	|| 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)
803	m.flags_ = 0;	826	m.invalidate ();
		827	#endif
804	}	828	}
805	/* if the object is being removed, we can't make intelligent	829	/* if the object is being removed, we can't make intelligent
806	* decisions, because remove_ob can't really pass the object	830	* decisions, because remove_ob can't really pass the object
807	* that is being removed.	831	* that is being removed.
808	*/	832	*/
809	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	833	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
810	m.flags_ = 0;	834	m.invalidate ();
811	else if (action == UP_OBJ_FACE)	835	else if (action == UP_OBJ_FACE)
812	/* Nothing to do for that case */ ;	836	/* Nothing to do for that case */ ;
813	else	837	else
814	LOG (llevError, "update_object called with invalid action: %d\n", action);	838	LOG (llevError, "update_object called with invalid action: %d\n", action);
815		839
…		…
819		843
820	object::object ()	844	object::object ()
821	{	845	{
822	SET_FLAG (this, FLAG_REMOVED);	846	SET_FLAG (this, FLAG_REMOVED);
823		847
824	expmul = 1.0;	848	//expmul = 1.0; declared const for the time being
825	face = blank_face;	849	face = blank_face;
		850	material = MATERIAL_NULL;
826	}	851	}
827		852
828	object::~object ()	853	object::~object ()
829	{	854	{
830	unlink ();	855	unlink ();
…		…
859	/* If already on active list, don't do anything */	884	/* If already on active list, don't do anything */
860	if (active)	885	if (active)
861	return;	886	return;
862		887
863	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
864	actives.insert (this);	893	actives.insert (this);
		894	}
865	}	895	}
866		896
867	void	897	void
868	object::activate_recursive ()	898	object::activate_recursive ()
869	{	899	{
…		…
930	* drop on that space.	960	* drop on that space.
931	*/	961	*/
932	if (!drop_to_ground	962	if (!drop_to_ground
933	|| !map	963	|| !map
934	|| map->in_memory != MAP_ACTIVE	964	|| map->in_memory != MAP_ACTIVE
935	|| map->nodrop	965	|| map->no_drop
936	|| ms ().move_block == MOVE_ALL)	966	|| ms ().move_block == MOVE_ALL)
937	{	967	{
938	while (inv)	968	while (inv)
939	{
940	inv->destroy_inv (false);
941	inv->destroy ();	969	inv->destroy ();
942	}
943	}	970	}
944	else	971	else
945	{ /* Put objects in inventory onto this space */	972	{ /* Put objects in inventory onto this space */
946	while (inv)	973	while (inv)
947	{	974	{
…		…
951	|| op->flag [FLAG_NO_DROP]	978	|| op->flag [FLAG_NO_DROP]
952	|| op->type == RUNE	979	|| op->type == RUNE
953	|| op->type == TRAP	980	|| op->type == TRAP
954	|| op->flag [FLAG_IS_A_TEMPLATE]	981	|| op->flag [FLAG_IS_A_TEMPLATE]
955	|| op->flag [FLAG_DESTROY_ON_DEATH])	982	|| op->flag [FLAG_DESTROY_ON_DEATH])
956	op->destroy (true);	983	op->destroy ();
957	else	984	else
958	map->insert (op, x, y);	985	map->insert (op, x, y);
959	}	986	}
960	}	987	}
961	}	988	}
…		…
965	object *op = new object;	992	object *op = new object;
966	op->link ();	993	op->link ();
967	return op;	994	return op;
968	}	995	}
969		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
970	void	1018	void
971	object::do_destroy ()	1019	object::do_destroy ()
972	{	1020	{
973	if (flag [FLAG_IS_LINKED])	1021	if (flag [FLAG_IS_LINKED])
974	remove_button_link (this);	1022	remove_link ();
975		1023
976	if (flag [FLAG_FRIENDLY])	1024	if (flag [FLAG_FRIENDLY])
977	remove_friendly_object (this);	1025	remove_friendly_object (this);
978		1026
979	remove ();	1027	remove ();
…		…
984	unlink ();	1032	unlink ();
985		1033
986	flag [FLAG_FREED] = 1;	1034	flag [FLAG_FREED] = 1;
987		1035
988	// hack to ensure that freed objects still have a valid map	1036	// hack to ensure that freed objects still have a valid map
989	{
990	static maptile *freed_map; // freed objects are moved here to avoid crashes
991
992	if (!freed_map)
993	{
994	freed_map = new maptile;
995
996	freed_map->path = "<freed objects map>";
997	freed_map->name = "/internal/freed_objects_map";
998	freed_map->width = 3;
999	freed_map->height = 3;
1000	freed_map->nodrop = 1;
1001
1002	freed_map->alloc ();
1003	freed_map->in_memory = MAP_ACTIVE;
1004	}
1005
1006	map = freed_map;	1037	map = &freed_map;
1007	x = 1;	1038	x = 1;
1008	y = 1;	1039	y = 1;
1009	}
1010		1040
1011	if (more)	1041	if (more)
1012	{	1042	{
1013	more->destroy ();	1043	more->destroy ();
1014	more = 0;	1044	more = 0;
…		…
1022	attacked_by = 0;	1052	attacked_by = 0;
1023	current_weapon = 0;	1053	current_weapon = 0;
1024	}	1054	}
1025		1055
1026	void	1056	void
1027	object::destroy (bool destroy_inventory)	1057	object::destroy ()
1028	{	1058	{
1029	if (destroyed ())	1059	if (destroyed ())
1030	return;	1060	return;
1031		1061
1032	if (!is_head () && !head->destroyed ())	1062	if (!is_head () && !head->destroyed ())
1033	{	1063	{
1034	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");	1064	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1035	head->destroy (destroy_inventory);	1065	head->destroy ();
		1066	return;
1036	}	1067	}
1037		1068
1038	destroy_inv (!destroy_inventory);	1069	destroy_inv (false);
1039		1070
1040	if (is_head ())	1071	if (is_head ())
1041	if (sound_destroy)	1072	if (sound_destroy)
1042	play_sound (sound_destroy);	1073	play_sound (sound_destroy);
1043	else if (flag [FLAG_MONSTER])	1074	else if (flag [FLAG_MONSTER])
…		…
1054	* the previous environment.	1085	* the previous environment.
1055	*/	1086	*/
1056	void	1087	void
1057	object::do_remove ()	1088	object::do_remove ()
1058	{	1089	{
1059	object *tmp, *last = 0;
1060	object *otmp;
1061
1062	if (flag [FLAG_REMOVED])	1090	if (flag [FLAG_REMOVED])
1063	return;	1091	return;
1064		1092
1065	INVOKE_OBJECT (REMOVE, this);	1093	INVOKE_OBJECT (REMOVE, this);
1066		1094
…		…
1080	esrv_del_item (pl->contr, count);	1108	esrv_del_item (pl->contr, count);
1081	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1109	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1082		1110
1083	adjust_weight (env, -total_weight ());	1111	adjust_weight (env, -total_weight ());
1084		1112
1085	*(above ? &above->below : &env->inv) = below;	1113	object *pl = in_player ();
1086
1087	if (below)
1088	below->above = above;
1089		1114
1090	/* we set up values so that it could be inserted into	1115	/* we set up values so that it could be inserted into
1091	* the map, but we don't actually do that - it is up	1116	* the map, but we don't actually do that - it is up
1092	* to the caller to decide what we want to do.	1117	* to the caller to decide what we want to do.
1093	*/	1118	*/
1094	map = env->map;	1119	map = env->map;
1095	x = env->x;	1120	x = env->x;
1096	y = env->y;	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
1097	above = 0;	1127	above = 0;
1098	below = 0;	1128	below = 0;
1099	env = 0;	1129	env = 0;
1100		1130
1101	/* NO_FIX_PLAYER is set when a great many changes are being	1131	if (pl && pl->is_player ())
1102	* made to players inventory. If set, avoiding the call
1103	* to save cpu time.
1104	*/	1132	{
1105	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1133	pl->contr->queue_stats_update ();
1106	otmp->update_stats ();	1134
		1135	if (glow_radius && pl->is_on_map ())
		1136	update_all_los (pl->map, pl->x, pl->y);
		1137	}
1107	}	1138	}
1108	else if (map)	1139	else if (map)
1109	{	1140	{
1110	map->dirty = true;	1141	map->dirty = true;
1111	mapspace &ms = this->ms ();	1142	mapspace &ms = this->ms ();
1112		1143
1113	if (object *pl = ms.player ())	1144	if (object *pl = ms.player ())
1114	{	1145	{
1115	if (type == PLAYER) // this == pl(!)	1146	if (is_player ())
1116	{	1147	{
		1148	if (!flag [FLAG_WIZPASS])
		1149	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1150
1117	// leaving a spot always closes any open container on the ground	1151	// leaving a spot always closes any open container on the ground
1118	if (container && !container->env)	1152	if (container && !container->env)
1119	// this causes spurious floorbox updates, but it ensures	1153	// this causes spurious floorbox updates, but it ensures
1120	// that the CLOSE event is being sent.	1154	// that the CLOSE event is being sent.
1121	close_container ();	1155	close_container ();
1122		1156
1123	--map->players;	1157	--map->players;
1124	map->touch ();	1158	map->touch ();
1125	}	1159	}
1126	else if (pl->container == this)	1160	else if (pl->container_ () == this)
1127	{	1161	{
1128	// removing a container should close it	1162	// removing a container should close it
1129	close_container ();	1163	close_container ();
1130	}	1164	}
1131		1165
1132	esrv_del_item (pl->contr, count);	1166	esrv_del_item (pl->contr, count);
1133	}	1167	}
1134		1168
1135	/* link the object above us */	1169	/* link the object above us */
1136	if (above)	1170	// re-link, make sure compiler can easily use cmove
1137	above->below = below;	1171	*(above ? &above->below : &ms.top) = below;
1138	else	1172	*(below ? &below->above : &ms.bot) = above;
1139	ms.top = below; /* we were top, set new top */
1140
1141	/* Relink the object below us, if there is one */
1142	if (below)
1143	below->above = above;
1144	else
1145	{
1146	/* Nothing below, which means we need to relink map object for this space
1147	* use translated coordinates in case some oddness with map tiling is
1148	* evident
1149	*/
1150	if (GET_MAP_OB (map, x, y) != this)
1151	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 ());
1152
1153	ms.bot = above; /* goes on above it. */
1154	}
1155		1173
1156	above = 0;	1174	above = 0;
1157	below = 0;	1175	below = 0;
1158		1176
		1177	ms.invalidate ();
		1178
1159	if (map->in_memory == MAP_SAVING)	1179	if (map->in_memory == MAP_SAVING)
1160	return;	1180	return;
1161		1181
1162	int check_walk_off = !flag [FLAG_NO_APPLY];	1182	int check_walk_off = !flag [FLAG_NO_APPLY];
1163		1183
1164	if (object *pl = ms.player ())	1184	if (object *pl = ms.player ())
1165	{	1185	{
1166	if (pl->container == this)	1186	if (pl->container_ () == this)
1167	/* If a container that the player is currently using somehow gets	1187	/* If a container that the player is currently using somehow gets
1168	* removed (most likely destroyed), update the player view	1188	* removed (most likely destroyed), update the player view
1169	* appropriately.	1189	* appropriately.
1170	*/	1190	*/
1171	pl->close_container ();	1191	pl->close_container ();
1172		1192
1173	//TODO: the floorbox prev/next might need updating	1193	//TODO: the floorbox prev/next might need updating
1174	esrv_del_item (pl->contr, count);	1194	//esrv_del_item (pl->contr, count);
		1195	//TODO: update floorbox to preserve ordering
		1196	if (pl->contr->ns)
		1197	pl->contr->ns->floorbox_update ();
1175	}	1198	}
1176		1199
		1200	if (check_walk_off)
1177	for (tmp = ms.bot; tmp; tmp = tmp->above)	1201	for (object *above, *tmp = ms.bot; tmp; tmp = above)
1178	{	1202	{
		1203	above = tmp->above;
		1204
1179	/* No point updating the players look faces if he is the object	1205	/* No point updating the players look faces if he is the object
1180	* being removed.	1206	* being removed.
1181	*/	1207	*/
1182		1208
1183	/* See if object moving off should effect something */	1209	/* See if object moving off should effect something */
1184	if (check_walk_off
1185	&& ((move_type & tmp->move_off)	1210	if ((move_type & tmp->move_off)
1186	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1211	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1187	{
1188	move_apply (tmp, this, 0);	1212	move_apply (tmp, this, 0);
1189
1190	if (destroyed ())
1191	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1192	}	1213	}
1193		1214
1194	last = tmp;	1215	if (affects_los ())
1195	}
1196
1197	/* last == NULL if there are no objects on this space */
1198	//TODO: this makes little sense, why only update the topmost object?
1199	if (!last)
1200	map->at (x, y).flags_ = 0;
1201	else
1202	update_object (last, UP_OBJ_REMOVE);
1203
1204	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1205	update_all_los (map, x, y);	1216	update_all_los (map, x, y);
1206	}	1217	}
1207	}	1218	}
1208		1219
1209	/*	1220	/*
…		…
1233	esrv_update_item (UPD_NROF, pl, top);	1244	esrv_update_item (UPD_NROF, pl, top);
1234		1245
1235	op->weight = 0; // cancel the addition above	1246	op->weight = 0; // cancel the addition above
1236	op->carrying = 0; // must be 0 already	1247	op->carrying = 0; // must be 0 already
1237		1248
1238	op->destroy (1);	1249	op->destroy ();
1239		1250
1240	return top;	1251	return top;
1241	}	1252	}
1242		1253
1243	return 0;	1254	return 0;
…		…
1271	* job preparing multi-part monsters.	1282	* job preparing multi-part monsters.
1272	*/	1283	*/
1273	object *	1284	object *
1274	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1285	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1275	{	1286	{
		1287	op->remove ();
		1288
1276	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1289	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1277	{	1290	{
1278	tmp->x = x + tmp->arch->x;	1291	tmp->x = x + tmp->arch->x;
1279	tmp->y = y + tmp->arch->y;	1292	tmp->y = y + tmp->arch->y;
1280	}	1293	}
…		…
1303	* just 'op' otherwise	1316	* just 'op' otherwise
1304	*/	1317	*/
1305	object *	1318	object *
1306	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1319	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1307	{	1320	{
1308	assert (!op->flag [FLAG_FREED]);
1309
1310	op->remove ();	1321	op->remove ();
		1322
		1323	if (m == &freed_map)//D TODO: remove soon
		1324	{//D
		1325	LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
		1326	}//D
1311		1327
1312	/* Ideally, the caller figures this out. However, it complicates a lot	1328	/* Ideally, the caller figures this out. However, it complicates a lot
1313	* of areas of callers (eg, anything that uses find_free_spot would now	1329	* of areas of callers (eg, anything that uses find_free_spot would now
1314	* need extra work	1330	* need extra work
1315	*/	1331	*/
		1332	maptile *newmap = m;
1316	if (!xy_normalise (m, op->x, op->y))	1333	if (!xy_normalise (newmap, op->x, op->y))
1317	{	1334	{
1318	op->destroy (1);	1335	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1319	return 0;	1336	return 0;
1320	}	1337	}
1321		1338
1322	if (object *more = op->more)	1339	if (object *more = op->more)
1323	if (!insert_ob_in_map (more, m, originator, flag))	1340	if (!insert_ob_in_map (more, m, originator, flag))
1324	return 0;	1341	return 0;
1325		1342
1326	CLEAR_FLAG (op, FLAG_REMOVED);	1343	op->flag [FLAG_REMOVED] = false;
1327		1344	op->env = 0;
1328	op->map = m;	1345	op->map = newmap;
		1346
1329	mapspace &ms = op->ms ();	1347	mapspace &ms = op->ms ();
1330		1348
1331	/* this has to be done after we translate the coordinates.	1349	/* this has to be done after we translate the coordinates.
1332	*/	1350	*/
1333	if (op->nrof && !(flag & INS_NO_MERGE))	1351	if (op->nrof && !(flag & INS_NO_MERGE))
1334	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1352	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1335	if (object::can_merge (op, tmp))	1353	if (object::can_merge (op, tmp))
1336	{	1354	{
1337	// TODO: we atcually want to update tmp, not op,	1355	// TODO: we actually want to update tmp, not op,
1338	// but some caller surely breaks when we return tmp	1356	// but some caller surely breaks when we return tmp
1339	// from here :/	1357	// from here :/
1340	op->nrof += tmp->nrof;	1358	op->nrof += tmp->nrof;
1341	tmp->destroy (1);	1359	tmp->destroy ();
1342	}	1360	}
1343		1361
1344	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1362	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1345	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1363	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1346		1364
…		…
1353	{	1371	{
1354	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1372	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1355	abort ();	1373	abort ();
1356	}	1374	}
1357		1375
		1376	if (!originator->is_on_map ())
		1377	{
		1378	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1379	op->debug_desc (), originator->debug_desc ());
		1380	abort ();
		1381	}
		1382
1358	op->above = originator;	1383	op->above = originator;
1359	op->below = originator->below;	1384	op->below = originator->below;
1360
1361	if (op->below)
1362	op->below->above = op;
1363	else
1364	ms.bot = op;
1365
1366	/* since *below* originator, no need to update top */
1367	originator->below = op;	1385	originator->below = op;
		1386
		1387	*(op->below ? &op->below->above : &ms.bot) = op;
1368	}	1388	}
1369	else	1389	else
1370	{	1390	{
1371	object *top, *floor = NULL;	1391	object *floor = 0;
1372		1392	object *top = ms.top;
1373	top = ms.bot;
1374		1393
1375	/* If there are other objects, then */	1394	/* If there are other objects, then */
1376	if (top)	1395	if (top)
1377	{	1396	{
1378	object *last = 0;
1379
1380	/*	1397	/*
1381	* If there are multiple objects on this space, we do some trickier handling.	1398	* If there are multiple objects on this space, we do some trickier handling.
1382	* We've already dealt with merging if appropriate.	1399	* We've already dealt with merging if appropriate.
1383	* Generally, we want to put the new object on top. But if	1400	* Generally, we want to put the new object on top. But if
1384	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1401	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1387	* once we get to them. This reduces the need to traverse over all of	1404	* once we get to them. This reduces the need to traverse over all of
1388	* them when adding another one - this saves quite a bit of cpu time	1405	* them when adding another one - this saves quite a bit of cpu time
1389	* when lots of spells are cast in one area. Currently, it is presumed	1406	* when lots of spells are cast in one area. Currently, it is presumed
1390	* that flying non pickable objects are spell objects.	1407	* that flying non pickable objects are spell objects.
1391	*/	1408	*/
1392	for (top = ms.bot; top; top = top->above)	1409	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1393	{	1410	{
1394	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1411	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1395	floor = top;	1412	floor = tmp;
1396		1413
1397	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1414	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1398	{	1415	{
1399	/* We insert above top, so we want this object below this */	1416	/* We insert above top, so we want this object below this */
1400	top = top->below;	1417	top = tmp->below;
1401	break;	1418	break;
1402	}	1419	}
1403		1420
1404	last = top;	1421	top = tmp;
1405	}	1422	}
1406
1407	/* Don't want top to be NULL, so set it to the last valid object */
1408	top = last;
1409		1423
1410	/* We let update_position deal with figuring out what the space	1424	/* We let update_position deal with figuring out what the space
1411	* looks like instead of lots of conditions here.	1425	* looks like instead of lots of conditions here.
1412	* makes things faster, and effectively the same result.	1426	* makes things faster, and effectively the same result.
1413	*/	1427	*/
…		…
1420	*/	1434	*/
1421	if (!(flag & INS_ON_TOP)	1435	if (!(flag & INS_ON_TOP)
1422	&& ms.flags () & P_BLOCKSVIEW	1436	&& ms.flags () & P_BLOCKSVIEW
1423	&& (op->face && !faces [op->face].visibility))	1437	&& (op->face && !faces [op->face].visibility))
1424	{	1438	{
		1439	object *last;
		1440
1425	for (last = top; last != floor; last = last->below)	1441	for (last = top; last != floor; last = last->below)
1426	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1442	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1427	break;	1443	break;
1428		1444
1429	/* Check to see if we found the object that blocks view,	1445	/* Check to see if we found the object that blocks view,
…		…
1437	} /* If objects on this space */	1453	} /* If objects on this space */
1438		1454
1439	if (flag & INS_ABOVE_FLOOR_ONLY)	1455	if (flag & INS_ABOVE_FLOOR_ONLY)
1440	top = floor;	1456	top = floor;
1441		1457
1442	/* Top is the object that our object (op) is going to get inserted above.	1458	// insert object above top, or bottom-most if top = 0
1443	*/
1444
1445	/* First object on this space */
1446	if (!top)	1459	if (!top)
1447	{	1460	{
		1461	op->below = 0;
1448	op->above = ms.bot;	1462	op->above = ms.bot;
1449
1450	if (op->above)
1451	op->above->below = op;
1452
1453	op->below = 0;
1454	ms.bot = op;	1463	ms.bot = op;
		1464
		1465	*(op->above ? &op->above->below : &ms.top) = op;
1455	}	1466	}
1456	else	1467	else
1457	{ /* get inserted into the stack above top */	1468	{
1458	op->above = top->above;	1469	op->above = top->above;
1459
1460	if (op->above)
1461	op->above->below = op;	1470	top->above = op;
1462		1471
1463	op->below = top;	1472	op->below = top;
1464	top->above = op;	1473	*(op->above ? &op->above->below : &ms.top) = op;
1465	}	1474	}
		1475	}
1466		1476
1467	if (!op->above)	1477	if (op->is_player ())
1468	ms.top = op;
1469	} /* else not INS_BELOW_ORIGINATOR */
1470
1471	if (op->type == PLAYER)
1472	{	1478	{
1473	op->contr->do_los = 1;	1479	op->contr->do_los = 1;
1474	++op->map->players;	1480	++op->map->players;
1475	op->map->touch ();	1481	op->map->touch ();
1476	}	1482	}
1477		1483
1478	op->map->dirty = true;	1484	op->map->dirty = true;
1479		1485
1480	if (object *pl = ms.player ())	1486	if (object *pl = ms.player ())
1481	//TODO: the floorbox prev/next might need updating	1487	//TODO: the floorbox prev/next might need updating
1482	esrv_send_item (pl, op);	1488	//esrv_send_item (pl, op);
		1489	//TODO: update floorbox to preserve ordering
		1490	if (pl->contr->ns)
		1491	pl->contr->ns->floorbox_update ();
1483		1492
1484	/* If this object glows, it may affect lighting conditions that are	1493	/* If this object glows, it may affect lighting conditions that are
1485	* visible to others on this map. But update_all_los is really	1494	* visible to others on this map. But update_all_los is really
1486	* an inefficient way to do this, as it means los for all players	1495	* an inefficient way to do this, as it means los for all players
1487	* on the map will get recalculated. The players could very well	1496	* on the map will get recalculated. The players could very well
1488	* be far away from this change and not affected in any way -	1497	* be far away from this change and not affected in any way -
1489	* this should get redone to only look for players within range,	1498	* this should get redone to only look for players within range,
1490	* or just updating the P_UPTODATE for spaces within this area	1499	* or just updating the P_UPTODATE for spaces within this area
1491	* of effect may be sufficient.	1500	* of effect may be sufficient.
1492	*/	1501	*/
1493	if (op->map->darkness && (op->glow_radius != 0))	1502	if (op->affects_los ())
		1503	{
		1504	op->ms ().invalidate ();
1494	update_all_los (op->map, op->x, op->y);	1505	update_all_los (op->map, op->x, op->y);
		1506	}
1495		1507
1496	/* updates flags (blocked, alive, no magic, etc) for this map space */	1508	/* updates flags (blocked, alive, no magic, etc) for this map space */
1497	update_object (op, UP_OBJ_INSERT);	1509	update_object (op, UP_OBJ_INSERT);
1498		1510
1499	INVOKE_OBJECT (INSERT, op);	1511	INVOKE_OBJECT (INSERT, op);
…		…
1506	* blocked() and wall() work properly), and these flags are updated by	1518	* blocked() and wall() work properly), and these flags are updated by
1507	* update_object().	1519	* update_object().
1508	*/	1520	*/
1509		1521
1510	/* if this is not the head or flag has been passed, don't check walk on status */	1522	/* if this is not the head or flag has been passed, don't check walk on status */
1511	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1523	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1512	{	1524	{
1513	if (check_move_on (op, originator))	1525	if (check_move_on (op, originator))
1514	return 0;	1526	return 0;
1515		1527
1516	/* If we are a multi part object, lets work our way through the check	1528	/* If we are a multi part object, lets work our way through the check
…		…
1527	/* this function inserts an object in the map, but if it	1539	/* this function inserts an object in the map, but if it
1528	* finds an object of its own type, it'll remove that one first.	1540	* finds an object of its own type, it'll remove that one first.
1529	* op is the object to insert it under: supplies x and the map.	1541	* op is the object to insert it under: supplies x and the map.
1530	*/	1542	*/
1531	void	1543	void
1532	replace_insert_ob_in_map (const char *arch_string, object *op)	1544	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1533	{	1545	{
1534	/* first search for itself and remove any old instances */	1546	/* first search for itself and remove any old instances */
1535		1547
1536	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1548	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1537	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1549	if (tmp->arch->archname == archname) /* same archetype */
1538	tmp->destroy (1);	1550	tmp->destroy ();
1539		1551
1540	object *tmp = arch_to_object (archetype::find (arch_string));	1552	object *tmp = arch_to_object (archetype::find (archname));
1541		1553
1542	tmp->x = op->x;	1554	tmp->x = op->x;
1543	tmp->y = op->y;	1555	tmp->y = op->y;
1544		1556
1545	insert_ob_in_map (tmp, op->map, op, 0);	1557	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1550	{	1562	{
1551	if (where->env)	1563	if (where->env)
1552	return where->env->insert (this);	1564	return where->env->insert (this);
1553	else	1565	else
1554	return where->map->insert (this, where->x, where->y, originator, flags);	1566	return where->map->insert (this, where->x, where->y, originator, flags);
		1567	}
		1568
		1569	// check whether we can put this into the map, respect max_volume, max_items
		1570	bool
		1571	object::can_drop_at (maptile *m, int x, int y, object *originator)
		1572	{
		1573	mapspace &ms = m->at (x, y);
		1574
		1575	int items = ms.items ();
		1576
		1577	if (!items // testing !items ensures we can drop at least one item
		1578	|| (items < m->max_items
		1579	&& ms.volume () < m->max_volume))
		1580	return true;
		1581
		1582	if (originator && originator->is_player ())
		1583	originator->contr->failmsg (format (
		1584	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
		1585	query_name ()
		1586	));
		1587
		1588	return false;
1555	}	1589	}
1556		1590
1557	/*	1591	/*
1558	* decrease(object, number) decreases a specified number from	1592	* decrease(object, number) decreases a specified number from
1559	* the amount of an object. If the amount reaches 0, the object	1593	* the amount of an object. If the amount reaches 0, the object
…		…
1567	if (!nr)	1601	if (!nr)
1568	return true;	1602	return true;
1569		1603
1570	nr = min (nr, nrof);	1604	nr = min (nr, nrof);
1571		1605
		1606	if (nrof > nr)
		1607	{
1572	nrof -= nr;	1608	nrof -= nr;
1573
1574	if (nrof)
1575	{
1576	adjust_weight (env, -weight * nr); // carrying == 0	1609	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1577		1610
1578	if (object *pl = visible_to ())	1611	if (object *pl = visible_to ())
1579	esrv_update_item (UPD_NROF, pl, this);	1612	esrv_update_item (UPD_NROF, pl, this);
1580		1613
1581	return true;	1614	return true;
1582	}	1615	}
1583	else	1616	else
1584	{	1617	{
1585	destroy (1);	1618	destroy ();
1586	return false;	1619	return false;
1587	}	1620	}
1588	}	1621	}
1589		1622
1590	/*	1623	/*
…		…
1607	}	1640	}
1608	else	1641	else
1609	{	1642	{
1610	decrease (nr);	1643	decrease (nr);
1611		1644
1612	object *op = object_create_clone (this);	1645	object *op = deep_clone ();
1613	op->nrof = nr;	1646	op->nrof = nr;
1614	return op;	1647	return op;
1615	}	1648	}
1616	}	1649	}
1617		1650
…		…
1667	if (object *pl = tmp->visible_to ())	1700	if (object *pl = tmp->visible_to ())
1668	esrv_update_item (UPD_NROF, pl, tmp);	1701	esrv_update_item (UPD_NROF, pl, tmp);
1669		1702
1670	adjust_weight (this, op->total_weight ());	1703	adjust_weight (this, op->total_weight ());
1671		1704
1672	op->destroy (1);	1705	op->destroy ();
1673	op = tmp;	1706	op = tmp;
1674	goto inserted;	1707	goto inserted;
1675	}	1708	}
1676		1709
1677	op->owner = 0; // it's his/hers now. period.	1710	op->owner = 0; // it's his/hers now. period.
…		…
1695		1728
1696	adjust_weight (this, op->total_weight ());	1729	adjust_weight (this, op->total_weight ());
1697		1730
1698	inserted:	1731	inserted:
1699	/* reset the light list and los of the players on the map */	1732	/* reset the light list and los of the players on the map */
1700	if (op->glow_radius && map && map->darkness)	1733	if (op->glow_radius && is_on_map ())
		1734	{
		1735	update_stats ();
1701	update_all_los (map, x, y);	1736	update_all_los (map, x, y);
1702		1737	}
		1738	else if (is_player ())
1703	// if this is a player's inventory, update stats	1739	// if this is a player's inventory, update stats
1704	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])	1740	contr->queue_stats_update ();
1705	update_stats ();
1706		1741
1707	INVOKE_OBJECT (INSERT, this);	1742	INVOKE_OBJECT (INSERT, this);
1708		1743
1709	return op;	1744	return op;
1710	}	1745	}
…		…
1730	* on top.	1765	* on top.
1731	*/	1766	*/
1732	int	1767	int
1733	check_move_on (object *op, object *originator)	1768	check_move_on (object *op, object *originator)
1734	{	1769	{
		1770	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1771	return 0;
		1772
1735	object *tmp;	1773	object *tmp;
1736	maptile *m = op->map;	1774	maptile *m = op->map;
1737	int x = op->x, y = op->y;	1775	int x = op->x, y = op->y;
1738		1776
1739	MoveType move_on, move_slow, move_block;	1777	mapspace &ms = m->at (x, y);
1740		1778
1741	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1779	ms.update ();
1742	return 0;
1743		1780
1744	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1781	MoveType move_on = ms.move_on;
1745	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1782	MoveType move_slow = ms.move_slow;
1746	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1783	MoveType move_block = ms.move_block;
1747		1784
1748	/* if nothing on this space will slow op down or be applied,	1785	/* if nothing on this space will slow op down or be applied,
1749	* no need to do checking below. have to make sure move_type	1786	* no need to do checking below. have to make sure move_type
1750	* is set, as lots of objects don't have it set - we treat that	1787	* is set, as lots of objects don't have it set - we treat that
1751	* as walking.	1788	* as walking.
…		…
1762	return 0;	1799	return 0;
1763		1800
1764	/* The objects have to be checked from top to bottom.	1801	/* The objects have to be checked from top to bottom.
1765	* Hence, we first go to the top:	1802	* Hence, we first go to the top:
1766	*/	1803	*/
1767		1804	for (object *next, *tmp = ms.top; tmp; tmp = next)
1768	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1769	{
1770	/* Trim the search when we find the first other spell effect
1771	* this helps performance so that if a space has 50 spell objects,
1772	* we don't need to check all of them.
1773	*/
1774	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1775	break;
1776	}	1805	{
		1806	next = tmp->below;
1777		1807
1778	for (; tmp; tmp = tmp->below)
1779	{
1780	if (tmp == op)	1808	if (tmp == op)
1781	continue; /* Can't apply yourself */	1809	continue; /* Can't apply yourself */
1782		1810
1783	/* Check to see if one of the movement types should be slowed down.	1811	/* Check to see if one of the movement types should be slowed down.
1784	* Second check makes sure that the movement types not being slowed	1812	* Second check makes sure that the movement types not being slowed
…		…
1789	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1817	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1790	{	1818	{
1791	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1819	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1792	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1820	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1793	{	1821	{
1794
1795	float
1796	diff = tmp->move_slow_penalty * fabs (op->speed);	1822	float diff = tmp->move_slow_penalty * fabs (op->speed);
1797		1823
1798	if (op->type == PLAYER)	1824	if (op->is_player ())
1799	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1825	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1800	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1826	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1801	diff /= 4.0;	1827	diff /= 4.0;
1802		1828
1803	op->speed_left -= diff;	1829	op->speed_left -= diff;
1804	}	1830	}
1805	}	1831	}
…		…
1838	LOG (llevError, "Present_arch called outside map.\n");	1864	LOG (llevError, "Present_arch called outside map.\n");
1839	return NULL;	1865	return NULL;
1840	}	1866	}
1841		1867
1842	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1868	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1843	if (tmp->arch == at)	1869	if (tmp->arch->archname == at->archname)
1844	return tmp;	1870	return tmp;
1845		1871
1846	return NULL;	1872	return NULL;
1847	}	1873	}
1848		1874
…		…
1912	* The first matching object is returned, or NULL if none.	1938	* The first matching object is returned, or NULL if none.
1913	*/	1939	*/
1914	object *	1940	object *
1915	present_arch_in_ob (const archetype *at, const object *op)	1941	present_arch_in_ob (const archetype *at, const object *op)
1916	{	1942	{
1917	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1943	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1918	if (tmp->arch == at)	1944	if (tmp->arch->archname == at->archname)
1919	return tmp;	1945	return tmp;
1920		1946
1921	return NULL;	1947	return NULL;
1922	}	1948	}
1923		1949
…		…
2011	* head of the object should correspond for the entire object.	2037	* head of the object should correspond for the entire object.
2012	*/	2038	*/
2013	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	2039	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
2014	continue;	2040	continue;
2015		2041
2016	if (ob->blocked (m, pos.x, pos.y))	2042	if (ob->blocked (pos.m, pos.x, pos.y))
2017	continue;	2043	continue;
2018		2044
2019	altern [index++] = i;	2045	altern [index++] = i;
2020	}	2046	}
2021		2047
…		…
2089	* there is capable of.	2115	* there is capable of.
2090	*/	2116	*/
2091	int	2117	int
2092	find_dir (maptile *m, int x, int y, object *exclude)	2118	find_dir (maptile *m, int x, int y, object *exclude)
2093	{	2119	{
2094	int i, max = SIZEOFFREE, mflags;	2120	int max = SIZEOFFREE, mflags;
2095
2096	sint16 nx, ny;
2097	object *tmp;
2098	maptile *mp;
2099
2100	MoveType blocked, move_type;	2121	MoveType move_type;
2101		2122
2102	if (exclude && exclude->head_ () != exclude)	2123	if (exclude && exclude->head_ () != exclude)
2103	{	2124	{
2104	exclude = exclude->head;	2125	exclude = exclude->head;
2105	move_type = exclude->move_type;	2126	move_type = exclude->move_type;
…		…
2108	{	2129	{
2109	/* If we don't have anything, presume it can use all movement types. */	2130	/* If we don't have anything, presume it can use all movement types. */
2110	move_type = MOVE_ALL;	2131	move_type = MOVE_ALL;
2111	}	2132	}
2112		2133
2113	for (i = 1; i < max; i++)	2134	for (int i = 1; i < max; i++)
2114	{	2135	{
2115	mp = m;	2136	mapxy pos (m, x, y);
2116	nx = x + freearr_x[i];	2137	pos.move (i);
2117	ny = y + freearr_y[i];
2118		2138
2119	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2139	if (!pos.normalise ())
2120
2121	if (mflags & P_OUT_OF_MAP)
2122	max = maxfree[i];	2140	max = maxfree[i];
2123	else	2141	else
2124	{	2142	{
2125	mapspace &ms = mp->at (nx, ny);	2143	mapspace &ms = *pos;
2126		2144
2127	blocked = ms.move_block;
2128
2129	if ((move_type & blocked) == move_type)	2145	if ((move_type & ms.move_block) == move_type)
2130	max = maxfree[i];	2146	max = maxfree [i];
2131	else if (mflags & P_IS_ALIVE)	2147	else if (ms.flags () & P_IS_ALIVE)
2132	{	2148	{
2133	for (tmp = ms.bot; tmp; tmp = tmp->above)	2149	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2134	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2150	if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2135	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2151	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2136	break;
2137
2138	if (tmp)
2139	return freedir[i];	2152	return freedir [i];
2140	}	2153	}
2141	}	2154	}
2142	}	2155	}
2143		2156
2144	return 0;	2157	return 0;
…		…
2219	* This basically means that if direction is 15, then it could either go	2232	* This basically means that if direction is 15, then it could either go
2220	* direction 4, 14, or 16 to get back to where we are.	2233	* direction 4, 14, or 16 to get back to where we are.
2221	* Moved from spell_util.c to object.c with the other related direction	2234	* Moved from spell_util.c to object.c with the other related direction
2222	* functions.	2235	* functions.
2223	*/	2236	*/
2224	int reduction_dir[SIZEOFFREE][3] = {	2237	static const int reduction_dir[SIZEOFFREE][3] = {
2225	{0, 0, 0}, /* 0 */	2238	{0, 0, 0}, /* 0 */
2226	{0, 0, 0}, /* 1 */	2239	{0, 0, 0}, /* 1 */
2227	{0, 0, 0}, /* 2 */	2240	{0, 0, 0}, /* 2 */
2228	{0, 0, 0}, /* 3 */	2241	{0, 0, 0}, /* 3 */
2229	{0, 0, 0}, /* 4 */	2242	{0, 0, 0}, /* 4 */
…		…
2325	int	2338	int
2326	can_pick (const object *who, const object *item)	2339	can_pick (const object *who, const object *item)
2327	{	2340	{
2328	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2341	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2329	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2342	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2330	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2343	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2331	}	2344	}
2332		2345
2333	/*	2346	/*
2334	* create clone from object to another	2347	* create clone from object to another
2335	*/	2348	*/
2336	object *	2349	object *
2337	object_create_clone (object *asrc)	2350	object::deep_clone ()
2338	{	2351	{
2339	object *dst = 0, *tmp, *src, *prev, *item;	2352	assert (("deep_clone called on non-head object", is_head ()));
2340		2353
2341	if (!asrc)	2354	object *dst = clone ();
2342	return 0;
2343		2355
2344	src = asrc->head_ ();	2356	object *prev = dst;
2345
2346	prev = 0;
2347	for (object *part = src; part; part = part->more)	2357	for (object *part = this->more; part; part = part->more)
2348	{	2358	{
2349	tmp = part->clone ();	2359	object *tmp = part->clone ();
2350	tmp->x -= src->x;
2351	tmp->y -= src->y;
2352
2353	if (!part->head)
2354	{
2355	dst = tmp;
2356	tmp->head = 0;
2357	}
2358	else
2359	tmp->head = dst;	2360	tmp->head = dst;
2360
2361	tmp->more = 0;
2362
2363	if (prev)
2364	prev->more = tmp;	2361	prev->more = tmp;
2365
2366	prev = tmp;	2362	prev = tmp;
2367	}	2363	}
2368		2364
2369	for (item = src->inv; item; item = item->below)	2365	for (object *item = inv; item; item = item->below)
2370	insert_ob_in_ob (object_create_clone (item), dst);	2366	insert_ob_in_ob (item->deep_clone (), dst);
2371		2367
2372	return dst;	2368	return dst;
2373	}	2369	}
2374		2370
2375	/* This returns the first object in who's inventory that	2371	/* This returns the first object in who's inventory that
…		…
2384	return tmp;	2380	return tmp;
2385		2381
2386	return 0;	2382	return 0;
2387	}	2383	}
2388		2384
2389	/* If ob has a field named key, return the link from the list,	2385	shstr_tmp
2390	* otherwise return NULL.	2386	object::kv_get (shstr_tmp key) const
2391	*
2392	* key must be a passed in shared string - otherwise, this won't
2393	* do the desired thing.
2394	*/
2395	key_value *
2396	get_ob_key_link (const object *ob, const char *key)
2397	{	2387	{
2398	for (key_value *link = ob->key_values; link; link = link->next)	2388	for (key_value *kv = key_values; kv; kv = kv->next)
2399	if (link->key == key)	2389	if (kv->key == key)
2400	return link;
2401
2402	return 0;
2403	}
2404
2405	/*
2406	* Returns the value of op has an extra_field for key, or NULL.
2407	*
2408	* The argument doesn't need to be a shared string.
2409	*
2410	* The returned string is shared.
2411	*/
2412	const char *
2413	get_ob_key_value (const object *op, const char *const key)
2414	{
2415	key_value *link;
2416	shstr_cmp canonical_key (key);
2417
2418	if (!canonical_key)
2419	{
2420	/* 1. There being a field named key on any object
2421	* implies there'd be a shared string to find.
2422	* 2. Since there isn't, no object has this field.
2423	* 3. Therefore, *this* object doesn't have this field.
2424	*/
2425	return 0;
2426	}
2427
2428	/* This is copied from get_ob_key_link() above -
2429	* only 4 lines, and saves the function call overhead.
2430	*/
2431	for (link = op->key_values; link; link = link->next)
2432	if (link->key == canonical_key)
2433	return link->value;	2390	return kv->value;
2434		2391
2435	return 0;	2392	return shstr ();
2436	}	2393	}
2437		2394
2438	/*	2395	void
2439	* Updates the canonical_key in op to value.	2396	object::kv_set (shstr_tmp key, shstr_tmp value)
2440	*
2441	* canonical_key is a shared string (value doesn't have to be).
2442	*
2443	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2444	* keys.
2445	*
2446	* Returns TRUE on success.
2447	*/
2448	int
2449	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2450	{	2397	{
2451	key_value *field = NULL, *last = NULL;	2398	for (key_value *kv = key_values; kv; kv = kv->next)
2452		2399	if (kv->key == key)
2453	for (field = op->key_values; field != NULL; field = field->next)
2454	{
2455	if (field->key != canonical_key)
2456	{	2400	{
2457	last = field;	2401	kv->value = value;
2458	continue;	2402	return;
2459	}	2403	}
2460		2404
2461	if (value)	2405	key_value *kv = new key_value;
2462	field->value = value;	2406
2463	else	2407	kv->next = key_values;
		2408	kv->key = key;
		2409	kv->value = value;
		2410
		2411	key_values = kv;
		2412	}
		2413
		2414	void
		2415	object::kv_del (shstr_tmp key)
		2416	{
		2417	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2418	if ((*kvp)->key == key)
2464	{	2419	{
2465	/* Basically, if the archetype has this key set,	2420	key_value *kv = *kvp;
2466	* we need to store the null value so when we save	2421	*kvp = (*kvp)->next;
2467	* it, we save the empty value so that when we load,	2422	delete kv;
2468	* we get this value back again.	2423	return;
2469	*/
2470	if (get_ob_key_link (op->arch, canonical_key))
2471	field->value = 0;
2472	else
2473	{
2474	if (last)
2475	last->next = field->next;
2476	else
2477	op->key_values = field->next;
2478
2479	delete field;
2480	}
2481	}	2424	}
2482	return TRUE;
2483	}
2484	/* IF we get here, key doesn't exist */
2485
2486	/* No field, we'll have to add it. */
2487
2488	if (!add_key)
2489	return FALSE;
2490
2491	/* There isn't any good reason to store a null
2492	* value in the key/value list. If the archetype has
2493	* this key, then we should also have it, so shouldn't
2494	* be here. If user wants to store empty strings,
2495	* should pass in ""
2496	*/
2497	if (value == NULL)
2498	return TRUE;
2499
2500	field = new key_value;
2501
2502	field->key = canonical_key;
2503	field->value = value;
2504	/* Usual prepend-addition. */
2505	field->next = op->key_values;
2506	op->key_values = field;
2507
2508	return TRUE;
2509	}
2510
2511	/*
2512	* Updates the key in op to value.
2513	*
2514	* If add_key is FALSE, this will only update existing keys,
2515	* and not add new ones.
2516	* In general, should be little reason FALSE is ever passed in for add_key
2517	*
2518	* Returns TRUE on success.
2519	*/
2520	int
2521	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2522	{
2523	shstr key_ (key);
2524
2525	return set_ob_key_value_s (op, key_, value, add_key);
2526	}	2425	}
2527		2426
2528	object::depth_iterator::depth_iterator (object *container)	2427	object::depth_iterator::depth_iterator (object *container)
2529	: iterator_base (container)	2428	: iterator_base (container)
2530	{	2429	{
…		…
2580	{	2479	{
2581	char flagdesc[512];	2480	char flagdesc[512];
2582	char info2[256 * 4];	2481	char info2[256 * 4];
2583	char *p = info;	2482	char *p = info;
2584		2483
2585	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2484	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2586	count,	2485	count,
2587	uuid.c_str (),	2486	uuid.c_str (),
2588	&name,	2487	&name,
2589	title ? "\",title:\"" : "",	2488	title ? ",title:\"" : "",
2590	title ? (const char *)title : "",	2489	title ? (const char *)title : "",
		2490	title ? "\"" : "",
2591	flag_desc (flagdesc, 512), type);	2491	flag_desc (flagdesc, 512), type);
2592		2492
2593	if (!flag[FLAG_REMOVED] && env)	2493	if (!flag[FLAG_REMOVED] && env)
2594	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2494	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2595		2495
…		…
2611	struct region *	2511	struct region *
2612	object::region () const	2512	object::region () const
2613	{	2513	{
2614	return map ? map->region (x, y)	2514	return map ? map->region (x, y)
2615	: region::default_region ();	2515	: region::default_region ();
2616	}
2617
2618	const materialtype_t *
2619	object::dominant_material () const
2620	{
2621	if (materialtype_t *mt = name_to_material (materialname))
2622	return mt;
2623
2624	return name_to_material (shstr_unknown);
2625	}	2516	}
2626		2517
2627	void	2518	void
2628	object::open_container (object *new_container)	2519	object::open_container (object *new_container)
2629	{	2520	{
…		…
2651	container = 0;	2542	container = 0;
2652		2543
2653	// client needs item update to make it work, client bug requires this to be separate	2544	// client needs item update to make it work, client bug requires this to be separate
2654	esrv_update_item (UPD_FLAGS, this, old_container);	2545	esrv_update_item (UPD_FLAGS, this, old_container);
2655		2546
2656	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2547	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2657	play_sound (sound_find ("chest_close"));	2548	play_sound (sound_find ("chest_close"));
2658	}	2549	}
2659		2550
2660	if (new_container)	2551	if (new_container)
2661	{	2552	{
…		…
2671	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2562	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2672	new_container->insert (closer);	2563	new_container->insert (closer);
2673	}	2564	}
2674	#endif	2565	#endif
2675		2566
2676	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2567	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2677		2568
2678	// make sure the container is available, client bug requires this to be separate	2569	// make sure the container is available, client bug requires this to be separate
2679	esrv_send_item (this, new_container);	2570	esrv_send_item (this, new_container);
2680		2571
2681	new_container->flag [FLAG_APPLIED] = true;	2572	new_container->flag [FLAG_APPLIED] = true;
…		…
2689	// else if (!old_container->env && contr && contr->ns)	2580	// else if (!old_container->env && contr && contr->ns)
2690	// contr->ns->floorbox_reset ();	2581	// contr->ns->floorbox_reset ();
2691	}	2582	}
2692		2583
2693	object *	2584	object *
2694	object::force_find (const shstr name)	2585	object::force_find (shstr_tmp name)
2695	{	2586	{
2696	/* cycle through his inventory to look for the MARK we want to	2587	/* cycle through his inventory to look for the MARK we want to
2697	* place	2588	* place
2698	*/	2589	*/
2699	for (object *tmp = inv; tmp; tmp = tmp->below)	2590	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2701	return splay (tmp);	2592	return splay (tmp);
2702		2593
2703	return 0;	2594	return 0;
2704	}	2595	}
2705		2596
		2597	//-GPL
		2598
2706	void	2599	void
		2600	object::force_set_timer (int duration)
		2601	{
		2602	this->duration = 1;
		2603	this->speed_left = -1.f;
		2604
		2605	this->set_speed (duration ? 1.f / duration : 0.f);
		2606	}
		2607
		2608	object *
2707	object::force_add (const shstr name, int duration)	2609	object::force_add (shstr_tmp name, int duration)
2708	{	2610	{
2709	if (object *force = force_find (name))	2611	if (object *force = force_find (name))
2710	force->destroy ();	2612	force->destroy ();
2711		2613
2712	object *force = get_archetype (FORCE_NAME);	2614	object *force = get_archetype (FORCE_NAME);
2713		2615
2714	force->slaying = name;	2616	force->slaying = name;
2715	force->stats.food = 1;	2617	force->force_set_timer (duration);
2716	force->speed_left = -1.f;
2717
2718	force->set_speed (duration ? 1.f / duration : 0.f);
2719	force->flag [FLAG_IS_USED_UP] = true;
2720	force->flag [FLAG_APPLIED] = true;	2618	force->flag [FLAG_APPLIED] = true;
2721		2619
2722	insert (force);	2620	return insert (force);
2723	}	2621	}
2724		2622
2725	void	2623	void
2726	object::play_sound (faceidx sound)	2624	object::play_sound (faceidx sound) const
2727	{	2625	{
2728	if (!sound)	2626	if (!sound)
2729	return;	2627	return;
2730		2628
2731	if (flag [FLAG_REMOVED])	2629	if (is_on_map ())
		2630	map->play_sound (sound, x, y);
		2631	else if (object *pl = in_player ())
		2632	pl->contr->play_sound (sound);
		2633	}
		2634
		2635	void
		2636	object::say_msg (const char *msg) const
		2637	{
		2638	if (is_on_map ())
		2639	map->say_msg (msg, x, y);
		2640	else if (object *pl = in_player ())
		2641	pl->contr->play_sound (sound);
		2642	}
		2643
		2644	void
		2645	object::make_noise ()
		2646	{
		2647	// we do not model noise in the map, so instead put
		2648	// a temporary light into the noise source
		2649	// could use the map instead, but that's less reliable for our
		2650	// goal, which is to make invisibility a bit harder to exploit
		2651
		2652	// currently only works sensibly for players
		2653	if (!is_player ())
2732	return;	2654	return;
2733		2655
2734	if (env)	2656	// find old force, or create new one
2735	{	2657	object *force = force_find (shstr_noise_force);
2736	if (object *pl = in_player ())	2658
2737	pl->contr->play_sound (sound);	2659	if (force)
2738	}	2660	force->speed_left = -1.f; // patch old speed up
2739	else	2661	else
2740	map->play_sound (sound, x, y);	2662	{
2741	}	2663	force = archetype::get (shstr_noise_force);
2742		2664
		2665	force->slaying = shstr_noise_force;
		2666	force->stats.food = 1;
		2667	force->speed_left = -1.f;
		2668
		2669	force->set_speed (1.f / 4.f);
		2670	force->flag [FLAG_IS_USED_UP] = true;
		2671	force->flag [FLAG_APPLIED] = true;
		2672
		2673	insert (force);
		2674	}
		2675	}
		2676

Diff Legend

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