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.212 by root, Mon Apr 21 23:35:24 2008 UTC vs.
Revision 1.297 by root, Sat Nov 7 18:30:05 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	{
…		…
139		144
140	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	145	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
141	static bool	146	static bool
142	compare_ob_value_lists_one (const object *wants, const object *has)	147	compare_ob_value_lists_one (const object *wants, const object *has)
143	{	148	{
144	key_value *wants_field;
145
146	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	149	/* 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	150	* objects with lists are rare, and lists stay short. If not, use a
148	* different structure or at least keep the lists sorted...	151	* different structure or at least keep the lists sorted...
149	*/	152	*/
150		153
151	/* For each field in wants, */	154	/* For each field in wants, */
152	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)	155	for (key_value *kv = wants->key_values; kv; kv = kv->next)
153	{	156	if (has->kv_get (kv->key) != kv->value)
154	key_value *has_field;	157	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		158
169	/* If we get here, every field in wants has a matching field in has. */	159	/* If we get here, every field in wants has a matching field in has. */
170	return 1;	160	return true;
171	}	161	}
172		162
173	/* Returns TRUE if ob1 has the same key_values as ob2. */	163	/* Returns TRUE if ob1 has the same key_values as ob2. */
174	static bool	164	static bool
175	compare_ob_value_lists (const object *ob1, const object *ob2)	165	compare_ob_value_lists (const object *ob1, const object *ob2)
176	{	166	{
177	/* However, there may be fields in has which aren't partnered in wants,	167	/* However, there may be fields in has which aren't partnered in wants,
178	* so we need to run the comparison *twice*. :(	168	* so we need to run the comparison *twice*. :(
179	*/	169	*/
180	return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1);	170	return compare_ob_value_lists_one (ob1, ob2)
		171	&& compare_ob_value_lists_one (ob2, ob1);
181	}	172	}
182		173
183	/* Function examines the 2 objects given to it, and returns true if	174	/* Function examines the 2 objects given to it, and returns true if
184	* they can be merged together.	175	* they can be merged together.
185	*	176	*
…		…
195	bool object::can_merge_slow (object *ob1, object *ob2)	186	bool object::can_merge_slow (object *ob1, object *ob2)
196	{	187	{
197	/* A couple quicksanity checks */	188	/* A couple quicksanity checks */
198	if (ob1 == ob2	189	if (ob1 == ob2
199	|| ob1->type != ob2->type	190	|| ob1->type != ob2->type
200	|| ob1->speed != ob2->speed	191	|| fabs (ob1->speed - ob2->speed) < MIN_ACTIVE_SPEED
201	|| ob1->value != ob2->value	192	|| ob1->value != ob2->value
202	|| ob1->name != ob2->name)	193	|| ob1->name != ob2->name)
203	return 0;	194	return 0;
204		195
205	/* Do not merge objects if nrof would overflow. First part checks	196	/* Do not merge objects if nrof would overflow, assume nrof
206	* for unsigned overflow (2c), second part checks whether the result	197	* is always 0 .. 2**31-1 */
207	* would fit into a 32 bit signed int, which is often used to hold	198	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;	199	return 0;
212		200
213	/* If the objects have been identified, set the BEEN_APPLIED flag.	201	/* 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	202	* 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	203	* just can't ignore the been applied or identified flags, as they
…		…
220	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	208	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
221		209
222	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	210	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
223	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	211	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
224		212
225	if (ob1->arch->name != ob2->arch->name	213	if (ob1->arch->archname != ob2->arch->archname
226	|| ob1->name != ob2->name	214	|| ob1->name != ob2->name
227	|| ob1->title != ob2->title	215	|| ob1->title != ob2->title
228	|| ob1->msg != ob2->msg	216	|| ob1->msg != ob2->msg
229	|| ob1->weight != ob2->weight	217	|| ob1->weight != ob2->weight
230	|| ob1->attacktype != ob2->attacktype	218	|| ob1->attacktype != ob2->attacktype
231	|| ob1->magic != ob2->magic	219	|| ob1->magic != ob2->magic
232	|| ob1->slaying != ob2->slaying	220	|| ob1->slaying != ob2->slaying
233	|| ob1->skill != ob2->skill	221	|| ob1->skill != ob2->skill
234	|| ob1->value != ob2->value	222	|| ob1->value != ob2->value
235	|| ob1->animation_id != ob2->animation_id	223	|| ob1->animation_id != ob2->animation_id
		224	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
236	|| ob1->client_type != ob2->client_type	225	|| ob1->client_type != ob2->client_type
237	|| ob1->materialname != ob2->materialname	226	|| ob1->materialname != ob2->materialname
238	|| ob1->lore != ob2->lore	227	|| ob1->lore != ob2->lore
239	|| ob1->subtype != ob2->subtype	228	|| ob1->subtype != ob2->subtype
240	|| ob1->move_type != ob2->move_type	229	|| ob1->move_type != ob2->move_type
241	|| ob1->move_block != ob2->move_block	230	|| ob1->move_block != ob2->move_block
242	|| ob1->move_allow != ob2->move_allow	231	|| ob1->move_allow != ob2->move_allow
243	|| ob1->move_on != ob2->move_on	232	|| ob1->move_on != ob2->move_on
244	|| ob1->move_off != ob2->move_off	233	|| ob1->move_off != ob2->move_off
245	|| ob1->move_slow != ob2->move_slow	234	|| ob1->move_slow != ob2->move_slow
246	|| ob1->move_slow_penalty != ob2->move_slow_penalty	235	|| fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) < (1.f / 1024.f)
247	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))	236	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
248	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	237	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
249	return 0;	238	return 0;
250		239
251	if ((ob1->flag ^ ob2->flag)	240	if ((ob1->flag ^ ob2->flag)
252	.reset (FLAG_INV_LOCKED)	241	.reset (FLAG_INV_LOCKED)
253	.reset (FLAG_CLIENT_SENT)
254	.reset (FLAG_REMOVED)	242	.reset (FLAG_REMOVED)
255	.any ())	243	.any ())
256	return 0;	244	return 0;
257		245
258	/* This is really a spellbook check - we should in general	246	/* This is really a spellbook check - we should in general
…		…
330		318
331	/* Everything passes, must be OK. */	319	/* Everything passes, must be OK. */
332	return 1;	320	return 1;
333	}	321	}
334		322
		323	// find player who can see this object
		324	object *
		325	object::visible_to () const
		326	{
		327	if (client_visible () && !flag [FLAG_REMOVED])
		328	{
		329	// see if we are in a container of sorts
		330	if (env)
		331	{
		332	// the player inventory itself is always visible
		333	if (env->is_player ())
		334	return env;
		335
		336	// else a player could have our env open
		337	object *envest = env->outer_env_or_self ();
		338
		339	// the player itself is always on a map, so we will find him here
		340	// even if our inv is in a player.
		341	if (envest->is_on_map ())
		342	if (object *pl = envest->ms ().player ())
		343	if (pl->container_ () == env)
		344	return pl;
		345	}
		346	else
		347	{
		348	// maybe there is a player standing on the same mapspace
		349	// this will catch the case where "this" is a player
		350	if (object *pl = ms ().player ())
		351	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
		352	|| pl->container_ () == this)
		353	return pl;
		354	}
		355	}
		356
		357	return 0;
		358	}
		359
335	// adjust weight per container type ("of holding")	360	// adjust weight per container type ("of holding")
336	static sint32	361	static sint32
337	weight_adjust (object *op, sint32 weight)	362	weight_adjust_for (object *op, sint32 weight)
338	{	363	{
339	return op->type == CONTAINER	364	return op->type == CONTAINER
340	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	365	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
341	: weight;	366	: weight;
342	}	367	}
…		…
348	static void	373	static void
349	adjust_weight (object *op, sint32 weight)	374	adjust_weight (object *op, sint32 weight)
350	{	375	{
351	while (op)	376	while (op)
352	{	377	{
		378	// adjust by actual difference to account for rounding errors
		379	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
353	weight = weight_adjust (op, weight);	380	weight = weight_adjust_for (op, op->carrying)
		381	- weight_adjust_for (op, op->carrying - weight);
354		382
355	if (!weight)	383	if (!weight)
356	return;	384	return;
357		385
358	op->carrying += weight;	386	op->carrying += weight;
359		387
360	if (object *pl = op->visible_to ())	388	if (object *pl = op->visible_to ())
		389	if (pl != op) // player is handled lazily
361	esrv_update_item (UPD_WEIGHT, pl, op);	390	esrv_update_item (UPD_WEIGHT, pl, op);
362		391
363	op = op->env;	392	op = op->env;
364	}	393	}
365	}	394	}
366		395
…		…
380	op->update_weight ();	409	op->update_weight ();
381		410
382	sum += op->total_weight ();	411	sum += op->total_weight ();
383	}	412	}
384		413
385	sum = weight_adjust (this, sum);	414	sum = weight_adjust_for (this, sum);
386		415
387	if (sum != carrying)	416	if (sum != carrying)
388	{	417	{
389	carrying = sum;	418	carrying = sum;
390		419
391	if (object *pl = visible_to ())	420	if (object *pl = visible_to ())
		421	if (pl != this) // player is handled lazily
392	esrv_update_item (UPD_WEIGHT, pl, this);	422	esrv_update_item (UPD_WEIGHT, pl, this);
393	}	423	}
394	}	424	}
395		425
396	/*	426	/*
397	* Used by: Server DM commands: dumpbelow, dump. Some error messages.	427	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
…		…
405	object_freezer freezer;	435	object_freezer freezer;
406	op->write (freezer);	436	op->write (freezer);
407	return freezer.as_string ();	437	return freezer.as_string ();
408	}	438	}
409		439
410	/*	440	char *
411	* get_nearest_part(multi-object, object 2) returns the part of the	441	object::as_string ()
412	* multi-object 1 which is closest to the second object.
413	* If it's not a multi-object, it is returned.
414	*/
415	object *
416	get_nearest_part (object *op, const object *pl)
417	{	442	{
418	object *tmp, *closest;	443	return dump_object (this);
419	int last_dist, i;
420
421	if (!op->more)
422	return op;
423
424	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
425	tmp;
426	tmp = tmp->more)
427	if ((i = distance (tmp, pl)) < last_dist)
428	closest = tmp, last_dist = i;
429
430	return closest;
431	}	444	}
432		445
433	/*	446	/*
434	* Returns the object which has the count-variable equal to the argument.	447	* Returns the object which has the count-variable equal to the argument.
435	* VERRRY slow.	448	* VERRRY slow.
…		…
451	*/	464	*/
452	object *	465	object *
453	find_object_name (const char *str)	466	find_object_name (const char *str)
454	{	467	{
455	shstr_cmp str_ (str);	468	shstr_cmp str_ (str);
456	object *op;
457		469
		470	if (str_)
458	for_all_objects (op)	471	for_all_objects (op)
459	if (op->name == str_)	472	if (op->name == str_)
460	break;	473	return op;
461		474
462	return op;	475	return 0;
463	}	476	}
464		477
465	/*	478	/*
466	* Sets the owner and sets the skill and exp pointers to owner's current	479	* Sets the owner and sets the skill and exp pointers to owner's current
467	* skill and experience objects.	480	* skill and experience objects.
…		…
529	update_stats ();	542	update_stats ();
530		543
531	new_draw_info_format (NDI_UNIQUE, 0, this,	544	new_draw_info_format (NDI_UNIQUE, 0, this,
532	"You try to balance all your items at once, "	545	"You try to balance all your items at once, "
533	"but the %s is just too much for your body. "	546	"but the %s is just too much for your body. "
534	"[You need to unapply some items first.]", &ob->name);	547	"[You need to unapply some items first - use the 'body' command to see "
		548	"how many items you cna wera on a specific body part.]", &ob->name);
535	return false;	549	return false;
536	}	550	}
537		551
538	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);	552	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
539	}	553	}
…		…
565	}	579	}
566		580
567	op->key_values = 0;	581	op->key_values = 0;
568	}	582	}
569		583
570	object &	584	/*
571	object::operator =(const object &src)	585	* copy_to first frees everything allocated by the dst object,
		586	* and then copies the contents of itself into the second
		587	* object, allocating what needs to be allocated. Basically, any
		588	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		589	* if the first object is freed, the pointers in the new object
		590	* will point at garbage.
		591	*/
		592	void
		593	object::copy_to (object *dst)
572	{	594	{
573	bool is_freed = flag [FLAG_FREED];	595	dst->remove ();
574	bool is_removed = flag [FLAG_REMOVED];
575
576	*(object_copy *)this = src;	596	*(object_copy *)dst = *this;
577
578	flag [FLAG_FREED] = is_freed;
579	flag [FLAG_REMOVED] = is_removed;	597	dst->flag [FLAG_REMOVED] = true;
580		598
581	/* Copy over key_values, if any. */	599	/* Copy over key_values, if any. */
582	if (src.key_values)	600	if (key_values)
583	{	601	{
584	key_value *tail = 0;	602	key_value *tail = 0;
585	key_values = 0;	603	dst->key_values = 0;
586		604
587	for (key_value *i = src.key_values; i; i = i->next)	605	for (key_value *i = key_values; i; i = i->next)
588	{	606	{
589	key_value *new_link = new key_value;	607	key_value *new_link = new key_value;
590		608
591	new_link->next = 0;	609	new_link->next = 0;
592	new_link->key = i->key;	610	new_link->key = i->key;
593	new_link->value = i->value;	611	new_link->value = i->value;
594		612
595	/* Try and be clever here, too. */	613	/* Try and be clever here, too. */
596	if (!key_values)	614	if (!dst->key_values)
597	{	615	{
598	key_values = new_link;	616	dst->key_values = new_link;
599	tail = new_link;	617	tail = new_link;
600	}	618	}
601	else	619	else
602	{	620	{
603	tail->next = new_link;	621	tail->next = new_link;
604	tail = new_link;	622	tail = new_link;
605	}	623	}
606	}	624	}
607	}	625	}
608	}
609
610	/*
611	* copy_to first frees everything allocated by the dst object,
612	* and then copies the contents of itself into the second
613	* object, allocating what needs to be allocated. Basically, any
614	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
615	* if the first object is freed, the pointers in the new object
616	* will point at garbage.
617	*/
618	void
619	object::copy_to (object *dst)
620	{
621	*dst = *this;
622		626
623	if (speed < 0)	627	if (speed < 0)
624	dst->speed_left -= rndm ();	628	dst->speed_left -= rndm ();
625		629
626	dst->set_speed (dst->speed);	630	dst->activate ();
627	}	631	}
628		632
629	void	633	void
630	object::instantiate ()	634	object::instantiate ()
631	{	635	{
…		…
648	object *	652	object *
649	object::clone ()	653	object::clone ()
650	{	654	{
651	object *neu = create ();	655	object *neu = create ();
652	copy_to (neu);	656	copy_to (neu);
		657	neu->map = map; // not copied by copy_to
653	return neu;	658	return neu;
654	}	659	}
655		660
656	/*	661	/*
657	* If an object with the IS_TURNABLE() flag needs to be turned due	662	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
674	* This function needs to be called whenever the speed of an object changes.	679	* This function needs to be called whenever the speed of an object changes.
675	*/	680	*/
676	void	681	void
677	object::set_speed (float speed)	682	object::set_speed (float speed)
678	{	683	{
679	if (flag [FLAG_FREED] && speed)
680	{
681	LOG (llevError, "Object %s is freed but has speed.\n", &name);
682	speed = 0;
683	}
684
685	this->speed = speed;	684	this->speed = speed;
686		685
687	if (has_active_speed ())	686	if (has_active_speed ())
688	activate ();	687	activate ();
689	else	688	else
…		…
708	* UP_OBJ_FACE: only the objects face has changed.	707	* UP_OBJ_FACE: only the objects face has changed.
709	*/	708	*/
710	void	709	void
711	update_object (object *op, int action)	710	update_object (object *op, int action)
712	{	711	{
713	if (op == NULL)	712	if (!op)
714	{	713	{
715	/* this should never happen */	714	/* this should never happen */
716	LOG (llevDebug, "update_object() called for NULL object.\n");	715	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
717	return;	716	return;
718	}	717	}
719		718
720	if (op->env)	719	if (!op->is_on_map ())
721	{	720	{
722	/* Animation is currently handled by client, so nothing	721	/* Animation is currently handled by client, so nothing
723	* to do in this case.	722	* to do in this case.
724	*/	723	*/
725	return;	724	return;
726	}	725	}
727
728	/* If the map is saving, don't do anything as everything is
729	* going to get freed anyways.
730	*/
731	if (!op->map || op->map->in_memory == MAP_SAVING)
732	return;
733		726
734	/* make sure the object is within map boundaries */	727	/* make sure the object is within map boundaries */
735	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)	728	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
736	{	729	{
737	LOG (llevError, "update_object() called for object out of map!\n");	730	LOG (llevError, "update_object() called for object out of map!\n");
…		…
745		738
746	if (!(m.flags_ & P_UPTODATE))	739	if (!(m.flags_ & P_UPTODATE))
747	/* nop */;	740	/* nop */;
748	else if (action == UP_OBJ_INSERT)	741	else if (action == UP_OBJ_INSERT)
749	{	742	{
		743	#if 0
750	// this is likely overkill, TODO: revisit (schmorp)	744	// this is likely overkill, TODO: revisit (schmorp)
751	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	745	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
752	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	746	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
753	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	747	|| (op->is_player () && !(m.flags_ & P_PLAYER))
754	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	748	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
755	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	749	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
756	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	750	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
757	|| (m.move_on | op->move_on ) != m.move_on	751	|| (m.move_on | op->move_on ) != m.move_on
758	|| (m.move_off | op->move_off ) != m.move_off	752	|| (m.move_off | op->move_off ) != m.move_off
759	|| (m.move_slow | op->move_slow) != m.move_slow	753	|| (m.move_slow | op->move_slow) != m.move_slow
760	/* This isn't perfect, but I don't expect a lot of objects to	754	/* This isn't perfect, but I don't expect a lot of objects to
761	* to have move_allow right now.	755	* have move_allow right now.
762	*/	756	*/
763	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	757	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
		758	m.invalidate ();
		759	#else
764	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	760	// the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
765	m.flags_ = 0;	761	m.invalidate ();
		762	#endif
766	}	763	}
767	/* if the object is being removed, we can't make intelligent	764	/* if the object is being removed, we can't make intelligent
768	* decisions, because remove_ob can't really pass the object	765	* decisions, because remove_ob can't really pass the object
769	* that is being removed.	766	* that is being removed.
770	*/	767	*/
771	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	768	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
772	m.flags_ = 0;	769	m.invalidate ();
773	else if (action == UP_OBJ_FACE)	770	else if (action == UP_OBJ_FACE)
774	/* Nothing to do for that case */ ;	771	/* Nothing to do for that case */ ;
775	else	772	else
776	LOG (llevError, "update_object called with invalid action: %d\n", action);	773	LOG (llevError, "update_object called with invalid action: %d\n", action);
777		774
…		…
781		778
782	object::object ()	779	object::object ()
783	{	780	{
784	SET_FLAG (this, FLAG_REMOVED);	781	SET_FLAG (this, FLAG_REMOVED);
785		782
786	expmul = 1.0;	783	//expmul = 1.0; declared const for the time being
787	face = blank_face;	784	face = blank_face;
788	}	785	}
789		786
790	object::~object ()	787	object::~object ()
791	{	788	{
…		…
821	/* If already on active list, don't do anything */	818	/* If already on active list, don't do anything */
822	if (active)	819	if (active)
823	return;	820	return;
824		821
825	if (has_active_speed ())	822	if (has_active_speed ())
		823	{
		824	if (flag [FLAG_FREED])
		825	LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		826
826	actives.insert (this);	827	actives.insert (this);
		828	}
827	}	829	}
828		830
829	void	831	void
830	object::activate_recursive ()	832	object::activate_recursive ()
831	{	833	{
…		…
880	object::destroy_inv (bool drop_to_ground)	882	object::destroy_inv (bool drop_to_ground)
881	{	883	{
882	// need to check first, because the checks below might segfault	884	// need to check first, because the checks below might segfault
883	// as we might be on an invalid mapspace and crossfire code	885	// as we might be on an invalid mapspace and crossfire code
884	// is too buggy to ensure that the inventory is empty.	886	// is too buggy to ensure that the inventory is empty.
885	// corollary: if you create arrows etc. with stuff in tis inventory,	887	// corollary: if you create arrows etc. with stuff in its inventory,
886	// cf will crash below with off-map x and y	888	// cf will crash below with off-map x and y
887	if (!inv)	889	if (!inv)
888	return;	890	return;
889		891
890	/* Only if the space blocks everything do we not process -	892	/* Only if the space blocks everything do we not process -
…		…
892	* drop on that space.	894	* drop on that space.
893	*/	895	*/
894	if (!drop_to_ground	896	if (!drop_to_ground
895	|| !map	897	|| !map
896	|| map->in_memory != MAP_ACTIVE	898	|| map->in_memory != MAP_ACTIVE
897	|| map->nodrop	899	|| map->no_drop
898	|| ms ().move_block == MOVE_ALL)	900	|| ms ().move_block == MOVE_ALL)
899	{	901	{
900	while (inv)	902	while (inv)
901	{
902	inv->destroy_inv (drop_to_ground);
903	inv->destroy ();	903	inv->destroy ();
904	}
905	}	904	}
906	else	905	else
907	{ /* Put objects in inventory onto this space */	906	{ /* Put objects in inventory onto this space */
908	while (inv)	907	while (inv)
909	{	908	{
…		…
927	object *op = new object;	926	object *op = new object;
928	op->link ();	927	op->link ();
929	return op;	928	return op;
930	}	929	}
931		930
		931	static struct freed_map : maptile
		932	{
		933	freed_map ()
		934	{
		935	path = "<freed objects map>";
		936	name = "/internal/freed_objects_map";
		937	width = 3;
		938	height = 3;
		939	no_drop = 1;
		940	no_reset = 1;
		941
		942	alloc ();
		943	in_memory = MAP_ACTIVE;
		944	}
		945
		946	~freed_map ()
		947	{
		948	destroy ();
		949	}
		950	} freed_map; // freed objects are moved here to avoid crashes
		951
932	void	952	void
933	object::do_destroy ()	953	object::do_destroy ()
934	{	954	{
935	if (object *pl = visible_to ())
936	esrv_del_item (pl->contr, count);
937
938	attachable::do_destroy ();
939
940	if (flag [FLAG_IS_LINKED])	955	if (flag [FLAG_IS_LINKED])
941	remove_button_link (this);	956	remove_link ();
942		957
943	if (flag [FLAG_FRIENDLY])	958	if (flag [FLAG_FRIENDLY])
944	remove_friendly_object (this);	959	remove_friendly_object (this);
945		960
946	if (!flag [FLAG_REMOVED])
947	remove ();	961	remove ();
948		962
949	destroy_inv (true);	963	attachable::do_destroy ();
950		964
951	deactivate ();	965	deactivate ();
952	unlink ();	966	unlink ();
953		967
954	flag [FLAG_FREED] = 1;	968	flag [FLAG_FREED] = 1;
955		969
956	// hack to ensure that freed objects still have a valid map	970	// hack to ensure that freed objects still have a valid map
957	{
958	static maptile *freed_map; // freed objects are moved here to avoid crashes
959
960	if (!freed_map)
961	{
962	freed_map = new maptile;
963
964	freed_map->path = "<freed objects map>";
965	freed_map->name = "/internal/freed_objects_map";
966	freed_map->width = 3;
967	freed_map->height = 3;
968	freed_map->nodrop = 1;
969
970	freed_map->alloc ();
971	freed_map->in_memory = MAP_ACTIVE;
972	}
973
974	map = freed_map;	971	map = &freed_map;
975	x = 1;	972	x = 1;
976	y = 1;	973	y = 1;
977	}
978		974
979	if (more)	975	if (more)
980	{	976	{
981	more->destroy ();	977	more->destroy ();
982	more = 0;	978	more = 0;
…		…
990	attacked_by = 0;	986	attacked_by = 0;
991	current_weapon = 0;	987	current_weapon = 0;
992	}	988	}
993		989
994	void	990	void
995	object::destroy (bool destroy_inventory)	991	object::destroy ()
996	{	992	{
997	if (destroyed ())	993	if (destroyed ())
998	return;	994	return;
999		995
1000	if (destroy_inventory)	996	if (!is_head () && !head->destroyed ())
		997	{
		998	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		999	head->destroy ();
		1000	return;
		1001	}
		1002
1001	destroy_inv (false);	1003	destroy_inv (false);
1002		1004
1003	if (is_head ())	1005	if (is_head ())
1004	if (sound_destroy)	1006	if (sound_destroy)
1005	play_sound (sound_destroy);	1007	play_sound (sound_destroy);
1006	else if (flag [FLAG_MONSTER])	1008	else if (flag [FLAG_MONSTER])
…		…
1017	* the previous environment.	1019	* the previous environment.
1018	*/	1020	*/
1019	void	1021	void
1020	object::do_remove ()	1022	object::do_remove ()
1021	{	1023	{
1022	object *tmp, *last = 0;	1024	if (flag [FLAG_REMOVED])
1023	object *otmp;
1024
1025	if (QUERY_FLAG (this, FLAG_REMOVED))
1026	return;	1025	return;
1027		1026
1028	SET_FLAG (this, FLAG_REMOVED);
1029	INVOKE_OBJECT (REMOVE, this);	1027	INVOKE_OBJECT (REMOVE, this);
		1028
		1029	flag [FLAG_REMOVED] = true;
1030		1030
1031	if (more)	1031	if (more)
1032	more->remove ();	1032	more->remove ();
1033		1033
1034	/*	1034	/*
1035	* In this case, the object to be removed is in someones	1035	* In this case, the object to be removed is in someones
1036	* inventory.	1036	* inventory.
1037	*/	1037	*/
1038	if (env)	1038	if (env)
1039	{	1039	{
		1040	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
		1041	if (object *pl = visible_to ())
		1042	esrv_del_item (pl->contr, count);
		1043	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1044
1040	adjust_weight (env, -total_weight ());	1045	adjust_weight (env, -total_weight ());
1041		1046
1042	*(above ? &above->below : &env->inv) = below;	1047	object *pl = in_player ();
1043
1044	if (below)
1045	below->above = above;
1046		1048
1047	/* we set up values so that it could be inserted into	1049	/* we set up values so that it could be inserted into
1048	* the map, but we don't actually do that - it is up	1050	* the map, but we don't actually do that - it is up
1049	* to the caller to decide what we want to do.	1051	* to the caller to decide what we want to do.
1050	*/	1052	*/
1051	map = env->map;	1053	map = env->map;
1052	x = env->x;	1054	x = env->x;
1053	y = env->y;	1055	y = env->y;
		1056
		1057	// make sure cmov optimisation is applicable
		1058	*(above ? &above->below : &env->inv) = below;
		1059	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1060
1054	above = 0;	1061	above = 0;
1055	below = 0;	1062	below = 0;
1056	env = 0;	1063	env = 0;
1057		1064
1058	/* NO_FIX_PLAYER is set when a great many changes are being	1065	/* NO_FIX_PLAYER is set when a great many changes are being
1059	* made to players inventory. If set, avoiding the call	1066	* made to players inventory. If set, avoiding the call
1060	* to save cpu time.	1067	* to save cpu time.
1061	*/	1068	*/
1062	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1069	if (pl)
		1070	if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
		1071	{
1063	otmp->update_stats ();	1072	pl->update_stats ();
		1073
		1074	if (glow_radius && pl->is_on_map ())
		1075	update_all_los (pl->map, pl->x, pl->y);
		1076	}
1064	}	1077	}
1065	else if (map)	1078	else if (map)
1066	{	1079	{
1067	if (type == PLAYER)
1068	{
1069	// leaving a spot always closes any open container on the ground
1070	if (container && !container->env)
1071	// this causes spurious floorbox updates, but it ensures
1072	// that the CLOSE event is being sent.
1073	close_container ();
1074
1075	--map->players;
1076	map->touch ();
1077	}
1078
1079	map->dirty = true;	1080	map->dirty = true;
1080	mapspace &ms = this->ms ();	1081	mapspace &ms = this->ms ();
1081		1082
		1083	if (object *pl = ms.player ())
		1084	{
		1085	if (is_player ())
		1086	{
		1087	if (!flag [FLAG_WIZPASS])
		1088	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1089
		1090	// leaving a spot always closes any open container on the ground
		1091	if (container && !container->env)
		1092	// this causes spurious floorbox updates, but it ensures
		1093	// that the CLOSE event is being sent.
		1094	close_container ();
		1095
		1096	--map->players;
		1097	map->touch ();
		1098	}
		1099	else if (pl->container_ () == this)
		1100	{
		1101	// removing a container should close it
		1102	close_container ();
		1103	}
		1104
		1105	esrv_del_item (pl->contr, count);
		1106	}
		1107
1082	/* link the object above us */	1108	/* link the object above us */
1083	if (above)	1109	// re-link, make sure compiler can easily use cmove
1084	above->below = below;	1110	*(above ? &above->below : &ms.top) = below;
1085	else	1111	*(below ? &below->above : &ms.bot) = above;
1086	ms.top = below; /* we were top, set new top */
1087
1088	/* Relink the object below us, if there is one */
1089	if (below)
1090	below->above = above;
1091	else
1092	{
1093	/* Nothing below, which means we need to relink map object for this space
1094	* use translated coordinates in case some oddness with map tiling is
1095	* evident
1096	*/
1097	if (GET_MAP_OB (map, x, y) != this)
1098	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 ());
1099
1100	ms.bot = above; /* goes on above it. */
1101	}
1102		1112
1103	above = 0;	1113	above = 0;
1104	below = 0;	1114	below = 0;
1105		1115
		1116	ms.invalidate ();
		1117
1106	if (map->in_memory == MAP_SAVING)	1118	if (map->in_memory == MAP_SAVING)
1107	return;	1119	return;
1108		1120
1109	int check_walk_off = !flag [FLAG_NO_APPLY];	1121	int check_walk_off = !flag [FLAG_NO_APPLY];
1110		1122
1111	if (object *pl = ms.player ())	1123	if (object *pl = ms.player ())
1112	{	1124	{
1113	if (pl->container == this)	1125	if (pl->container_ () == this)
1114	/* If a container that the player is currently using somehow gets	1126	/* If a container that the player is currently using somehow gets
1115	* removed (most likely destroyed), update the player view	1127	* removed (most likely destroyed), update the player view
1116	* appropriately.	1128	* appropriately.
1117	*/	1129	*/
1118	pl->close_container ();	1130	pl->close_container ();
1119		1131
		1132	//TODO: the floorbox prev/next might need updating
		1133	//esrv_del_item (pl->contr, count);
		1134	//TODO: update floorbox to preserve ordering
		1135	if (pl->contr->ns)
1120	pl->contr->ns->floorbox_update ();	1136	pl->contr->ns->floorbox_update ();
1121	}	1137	}
1122		1138
		1139	if (check_walk_off)
1123	for (tmp = ms.bot; tmp; tmp = tmp->above)	1140	for (object *above, *tmp = ms.bot; tmp; tmp = above)
1124	{	1141	{
		1142	above = tmp->above;
		1143
1125	/* No point updating the players look faces if he is the object	1144	/* No point updating the players look faces if he is the object
1126	* being removed.	1145	* being removed.
1127	*/	1146	*/
1128		1147
1129	/* See if object moving off should effect something */	1148	/* See if object moving off should effect something */
1130	if (check_walk_off
1131	&& ((move_type & tmp->move_off)	1149	if ((move_type & tmp->move_off)
1132	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1150	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1133	{
1134	move_apply (tmp, this, 0);	1151	move_apply (tmp, this, 0);
1135
1136	if (destroyed ())
1137	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1138	}	1152	}
1139		1153
1140	last = tmp;	1154	if (affects_los ())
1141	}
1142
1143	/* last == NULL if there are no objects on this space */
1144	//TODO: this makes little sense, why only update the topmost object?
1145	if (!last)
1146	map->at (x, y).flags_ = 0;
1147	else
1148	update_object (last, UP_OBJ_REMOVE);
1149
1150	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1151	update_all_los (map, x, y);	1155	update_all_los (map, x, y);
1152	}	1156	}
1153	}	1157	}
1154		1158
1155	/*	1159	/*
…		…
1169	if (!top)	1173	if (!top)
1170	for (top = op; top && top->above; top = top->above)	1174	for (top = op; top && top->above; top = top->above)
1171	;	1175	;
1172		1176
1173	for (; top; top = top->below)	1177	for (; top; top = top->below)
1174	{
1175	if (top == op)
1176	continue;
1177
1178	if (object::can_merge (op, top))	1178	if (object::can_merge (op, top))
1179	{	1179	{
1180	top->nrof += op->nrof;	1180	top->nrof += op->nrof;
1181		1181
1182	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1182	if (object *pl = top->visible_to ())
1183	op->weight = 0; /* Don't want any adjustements now */	1183	esrv_update_item (UPD_NROF, pl, top);
		1184
		1185	op->weight = 0; // cancel the addition above
		1186	op->carrying = 0; // must be 0 already
		1187
1184	op->destroy ();	1188	op->destroy ();
		1189
1185	return top;	1190	return top;
1186	}	1191	}
1187	}
1188		1192
1189	return 0;	1193	return 0;
1190	}	1194	}
1191		1195
1192	void	1196	void
…		…
1217	* job preparing multi-part monsters.	1221	* job preparing multi-part monsters.
1218	*/	1222	*/
1219	object *	1223	object *
1220	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1224	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1221	{	1225	{
		1226	op->remove ();
		1227
1222	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1228	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1223	{	1229	{
1224	tmp->x = x + tmp->arch->x;	1230	tmp->x = x + tmp->arch->x;
1225	tmp->y = y + tmp->arch->y;	1231	tmp->y = y + tmp->arch->y;
1226	}	1232	}
…		…
1249	* just 'op' otherwise	1255	* just 'op' otherwise
1250	*/	1256	*/
1251	object *	1257	object *
1252	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1258	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1253	{	1259	{
1254	assert (!op->flag [FLAG_FREED]);
1255
1256	object *top, *floor = NULL;
1257
1258	op->remove ();	1260	op->remove ();
		1261
		1262	if (m == &freed_map)//D TODO: remove soon
		1263	{//D
		1264	LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
		1265	}//D
1259		1266
1260	/* Ideally, the caller figures this out. However, it complicates a lot	1267	/* Ideally, the caller figures this out. However, it complicates a lot
1261	* of areas of callers (eg, anything that uses find_free_spot would now	1268	* of areas of callers (eg, anything that uses find_free_spot would now
1262	* need extra work	1269	* need extra work
1263	*/	1270	*/
		1271	maptile *newmap = m;
1264	if (!xy_normalise (m, op->x, op->y))	1272	if (!xy_normalise (newmap, op->x, op->y))
1265	{	1273	{
1266	op->destroy ();	1274	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1267	return 0;	1275	return 0;
1268	}	1276	}
1269		1277
1270	if (object *more = op->more)	1278	if (object *more = op->more)
1271	if (!insert_ob_in_map (more, m, originator, flag))	1279	if (!insert_ob_in_map (more, m, originator, flag))
1272	return 0;	1280	return 0;
1273		1281
1274	CLEAR_FLAG (op, FLAG_REMOVED);	1282	op->flag [FLAG_REMOVED] = false;
1275		1283	op->env = 0;
1276	op->map = m;	1284	op->map = newmap;
		1285
1277	mapspace &ms = op->ms ();	1286	mapspace &ms = op->ms ();
1278		1287
1279	/* this has to be done after we translate the coordinates.	1288	/* this has to be done after we translate the coordinates.
1280	*/	1289	*/
1281	if (op->nrof && !(flag & INS_NO_MERGE))	1290	if (op->nrof && !(flag & INS_NO_MERGE))
1282	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1291	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1283	if (object::can_merge (op, tmp))	1292	if (object::can_merge (op, tmp))
1284	{	1293	{
		1294	// TODO: we actually want to update tmp, not op,
		1295	// but some caller surely breaks when we return tmp
		1296	// from here :/
1285	op->nrof += tmp->nrof;	1297	op->nrof += tmp->nrof;
1286	tmp->destroy (1);	1298	tmp->destroy ();
1287	}	1299	}
1288		1300
1289	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1301	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1290	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1302	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1291		1303
…		…
1298	{	1310	{
1299	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1311	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1300	abort ();	1312	abort ();
1301	}	1313	}
1302		1314
		1315	if (!originator->is_on_map ())
		1316	{
		1317	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1318	op->debug_desc (), originator->debug_desc ());
		1319	abort ();
		1320	}
		1321
1303	op->above = originator;	1322	op->above = originator;
1304	op->below = originator->below;	1323	op->below = originator->below;
1305
1306	if (op->below)
1307	op->below->above = op;
1308	else
1309	ms.bot = op;
1310
1311	/* since *below* originator, no need to update top */
1312	originator->below = op;	1324	originator->below = op;
		1325
		1326	*(op->below ? &op->below->above : &ms.bot) = op;
1313	}	1327	}
1314	else	1328	else
1315	{	1329	{
1316	top = ms.bot;	1330	object *floor = 0;
		1331	object *top = ms.top;
1317		1332
1318	/* If there are other objects, then */	1333	/* If there are other objects, then */
1319	if (top)	1334	if (top)
1320	{	1335	{
1321	object *last = 0;
1322
1323	/*	1336	/*
1324	* If there are multiple objects on this space, we do some trickier handling.	1337	* If there are multiple objects on this space, we do some trickier handling.
1325	* We've already dealt with merging if appropriate.	1338	* We've already dealt with merging if appropriate.
1326	* Generally, we want to put the new object on top. But if	1339	* Generally, we want to put the new object on top. But if
1327	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1340	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1330	* once we get to them. This reduces the need to traverse over all of	1343	* once we get to them. This reduces the need to traverse over all of
1331	* them when adding another one - this saves quite a bit of cpu time	1344	* them when adding another one - this saves quite a bit of cpu time
1332	* when lots of spells are cast in one area. Currently, it is presumed	1345	* when lots of spells are cast in one area. Currently, it is presumed
1333	* that flying non pickable objects are spell objects.	1346	* that flying non pickable objects are spell objects.
1334	*/	1347	*/
1335	for (top = ms.bot; top; top = top->above)	1348	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1336	{	1349	{
1337	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1350	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1338	floor = top;	1351	floor = tmp;
1339		1352
1340	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1353	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1341	{	1354	{
1342	/* We insert above top, so we want this object below this */	1355	/* We insert above top, so we want this object below this */
1343	top = top->below;	1356	top = tmp->below;
1344	break;	1357	break;
1345	}	1358	}
1346		1359
1347	last = top;	1360	top = tmp;
1348	}	1361	}
1349
1350	/* Don't want top to be NULL, so set it to the last valid object */
1351	top = last;
1352		1362
1353	/* We let update_position deal with figuring out what the space	1363	/* We let update_position deal with figuring out what the space
1354	* looks like instead of lots of conditions here.	1364	* looks like instead of lots of conditions here.
1355	* makes things faster, and effectively the same result.	1365	* makes things faster, and effectively the same result.
1356	*/	1366	*/
…		…
1363	*/	1373	*/
1364	if (!(flag & INS_ON_TOP)	1374	if (!(flag & INS_ON_TOP)
1365	&& ms.flags () & P_BLOCKSVIEW	1375	&& ms.flags () & P_BLOCKSVIEW
1366	&& (op->face && !faces [op->face].visibility))	1376	&& (op->face && !faces [op->face].visibility))
1367	{	1377	{
		1378	object *last;
		1379
1368	for (last = top; last != floor; last = last->below)	1380	for (last = top; last != floor; last = last->below)
1369	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1381	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1370	break;	1382	break;
1371		1383
1372	/* Check to see if we found the object that blocks view,	1384	/* Check to see if we found the object that blocks view,
…		…
1380	} /* If objects on this space */	1392	} /* If objects on this space */
1381		1393
1382	if (flag & INS_ABOVE_FLOOR_ONLY)	1394	if (flag & INS_ABOVE_FLOOR_ONLY)
1383	top = floor;	1395	top = floor;
1384		1396
1385	/* Top is the object that our object (op) is going to get inserted above.	1397	// insert object above top, or bottom-most if top = 0
1386	*/
1387
1388	/* First object on this space */
1389	if (!top)	1398	if (!top)
1390	{	1399	{
		1400	op->below = 0;
1391	op->above = ms.bot;	1401	op->above = ms.bot;
1392
1393	if (op->above)
1394	op->above->below = op;
1395
1396	op->below = 0;
1397	ms.bot = op;	1402	ms.bot = op;
		1403
		1404	*(op->above ? &op->above->below : &ms.top) = op;
1398	}	1405	}
1399	else	1406	else
1400	{ /* get inserted into the stack above top */	1407	{
1401	op->above = top->above;	1408	op->above = top->above;
1402
1403	if (op->above)
1404	op->above->below = op;	1409	top->above = op;
1405		1410
1406	op->below = top;	1411	op->below = top;
1407	top->above = op;	1412	*(op->above ? &op->above->below : &ms.top) = op;
1408	}	1413	}
		1414	}
1409		1415
1410	if (!op->above)	1416	if (op->is_player ())
1411	ms.top = op;
1412	} /* else not INS_BELOW_ORIGINATOR */
1413
1414	if (op->type == PLAYER)
1415	{	1417	{
1416	op->contr->do_los = 1;	1418	op->contr->do_los = 1;
1417	++op->map->players;	1419	++op->map->players;
1418	op->map->touch ();	1420	op->map->touch ();
1419	}	1421	}
1420		1422
1421	op->map->dirty = true;	1423	op->map->dirty = true;
1422		1424
1423	if (object *pl = ms.player ())	1425	if (object *pl = ms.player ())
		1426	//TODO: the floorbox prev/next might need updating
		1427	//esrv_send_item (pl, op);
		1428	//TODO: update floorbox to preserve ordering
		1429	if (pl->contr->ns)
1424	pl->contr->ns->floorbox_update ();	1430	pl->contr->ns->floorbox_update ();
1425		1431
1426	/* If this object glows, it may affect lighting conditions that are	1432	/* If this object glows, it may affect lighting conditions that are
1427	* visible to others on this map. But update_all_los is really	1433	* visible to others on this map. But update_all_los is really
1428	* an inefficient way to do this, as it means los for all players	1434	* an inefficient way to do this, as it means los for all players
1429	* on the map will get recalculated. The players could very well	1435	* on the map will get recalculated. The players could very well
1430	* be far away from this change and not affected in any way -	1436	* be far away from this change and not affected in any way -
1431	* this should get redone to only look for players within range,	1437	* this should get redone to only look for players within range,
1432	* or just updating the P_UPTODATE for spaces within this area	1438	* or just updating the P_UPTODATE for spaces within this area
1433	* of effect may be sufficient.	1439	* of effect may be sufficient.
1434	*/	1440	*/
1435	if (op->map->darkness && (op->glow_radius != 0))	1441	if (op->affects_los ())
		1442	{
		1443	op->ms ().invalidate ();
1436	update_all_los (op->map, op->x, op->y);	1444	update_all_los (op->map, op->x, op->y);
		1445	}
1437		1446
1438	/* updates flags (blocked, alive, no magic, etc) for this map space */	1447	/* updates flags (blocked, alive, no magic, etc) for this map space */
1439	update_object (op, UP_OBJ_INSERT);	1448	update_object (op, UP_OBJ_INSERT);
1440		1449
1441	INVOKE_OBJECT (INSERT, op);	1450	INVOKE_OBJECT (INSERT, op);
…		…
1448	* blocked() and wall() work properly), and these flags are updated by	1457	* blocked() and wall() work properly), and these flags are updated by
1449	* update_object().	1458	* update_object().
1450	*/	1459	*/
1451		1460
1452	/* if this is not the head or flag has been passed, don't check walk on status */	1461	/* if this is not the head or flag has been passed, don't check walk on status */
1453	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1462	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1454	{	1463	{
1455	if (check_move_on (op, originator))	1464	if (check_move_on (op, originator))
1456	return 0;	1465	return 0;
1457		1466
1458	/* If we are a multi part object, lets work our way through the check	1467	/* If we are a multi part object, lets work our way through the check
…		…
1469	/* this function inserts an object in the map, but if it	1478	/* this function inserts an object in the map, but if it
1470	* finds an object of its own type, it'll remove that one first.	1479	* finds an object of its own type, it'll remove that one first.
1471	* op is the object to insert it under: supplies x and the map.	1480	* op is the object to insert it under: supplies x and the map.
1472	*/	1481	*/
1473	void	1482	void
1474	replace_insert_ob_in_map (const char *arch_string, object *op)	1483	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1475	{	1484	{
1476	/* first search for itself and remove any old instances */	1485	/* first search for itself and remove any old instances */
1477		1486
1478	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1487	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1479	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1488	if (tmp->arch->archname == archname) /* same archetype */
1480	tmp->destroy (1);	1489	tmp->destroy ();
1481		1490
1482	object *tmp = arch_to_object (archetype::find (arch_string));	1491	object *tmp = arch_to_object (archetype::find (archname));
1483		1492
1484	tmp->x = op->x;	1493	tmp->x = op->x;
1485	tmp->y = op->y;	1494	tmp->y = op->y;
1486		1495
1487	insert_ob_in_map (tmp, op->map, op, 0);	1496	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1492	{	1501	{
1493	if (where->env)	1502	if (where->env)
1494	return where->env->insert (this);	1503	return where->env->insert (this);
1495	else	1504	else
1496	return where->map->insert (this, where->x, where->y, originator, flags);	1505	return where->map->insert (this, where->x, where->y, originator, flags);
1497	}
1498
1499	// find player who can see this object
1500	object *
1501	object::visible_to () const
1502	{
1503	if (!flag [FLAG_REMOVED])
1504	{
1505	// see if we are in a container of sorts
1506	if (env)
1507	{
1508	// the player inventory itself is always visible
1509	if (env->type == PLAYER)
1510	return env;
1511
1512	// else a player could have our env open
1513	object *envest = env->outer_env ();
1514
1515	// the player itself is always on a map, so we will find him here
1516	// even if our inv is in a player.
1517	if (envest->is_on_map ())
1518	if (object *pl = envest->ms ().player ())
1519	if (pl->container == env)
1520	return pl;
1521	}
1522	else
1523	{
1524	// maybe there is a player standing on the same mapspace
1525	// this will catch the case where "this" is a player
1526	if (object *pl = ms ().player ())
1527	return pl;
1528	}
1529	}
1530
1531	return 0;
1532	}	1506	}
1533		1507
1534	/*	1508	/*
1535	* decrease(object, number) decreases a specified number from	1509	* decrease(object, number) decreases a specified number from
1536	* the amount of an object. If the amount reaches 0, the object	1510	* the amount of an object. If the amount reaches 0, the object
…		…
1544	if (!nr)	1518	if (!nr)
1545	return true;	1519	return true;
1546		1520
1547	nr = min (nr, nrof);	1521	nr = min (nr, nrof);
1548		1522
		1523	if (nrof > nr)
		1524	{
1549	nrof -= nr;	1525	nrof -= nr;
1550
1551	if (nrof)
1552	{
1553	adjust_weight (env, -weight * nr); // carrying == 0	1526	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1554		1527
1555	if (object *pl = visible_to ())	1528	if (object *pl = visible_to ())
1556	esrv_update_item (UPD_NROF, pl, this);	1529	esrv_update_item (UPD_NROF, pl, this);
1557		1530
1558	return true;	1531	return true;
1559	}	1532	}
1560	else	1533	else
1561	{	1534	{
1562	destroy (1);	1535	destroy ();
1563	return false;	1536	return false;
1564	}	1537	}
1565	}	1538	}
1566		1539
1567	/*	1540	/*
…		…
1584	}	1557	}
1585	else	1558	else
1586	{	1559	{
1587	decrease (nr);	1560	decrease (nr);
1588		1561
1589	object *op = object_create_clone (this);	1562	object *op = deep_clone ();
1590	op->nrof = nr;	1563	op->nrof = nr;
1591	return op;	1564	return op;
1592	}	1565	}
1593	}	1566	}
1594		1567
…		…
1638	if (object::can_merge (tmp, op))	1611	if (object::can_merge (tmp, op))
1639	{	1612	{
1640	/* return the original object and remove inserted object	1613	/* return the original object and remove inserted object
1641	(client needs the original object) */	1614	(client needs the original object) */
1642	tmp->nrof += op->nrof;	1615	tmp->nrof += op->nrof;
		1616
		1617	if (object *pl = tmp->visible_to ())
		1618	esrv_update_item (UPD_NROF, pl, tmp);
		1619
1643	adjust_weight (this, op->total_weight ());	1620	adjust_weight (this, op->total_weight ());
1644		1621
1645	op->destroy (1);	1622	op->destroy ();
1646	op = tmp;	1623	op = tmp;
1647	goto inserted;	1624	goto inserted;
1648	}	1625	}
1649		1626
1650	op->owner = 0; // it's his/hers now. period.	1627	op->owner = 0; // it's his/hers now. period.
…		…
1661		1638
1662	inv = op;	1639	inv = op;
1663		1640
1664	op->flag [FLAG_REMOVED] = 0;	1641	op->flag [FLAG_REMOVED] = 0;
1665		1642
		1643	if (object *pl = op->visible_to ())
		1644	esrv_send_item (pl, op);
		1645
1666	adjust_weight (this, op->total_weight ());	1646	adjust_weight (this, op->total_weight ());
1667		1647
1668	inserted:	1648	inserted:
1669	/* reset the light list and los of the players on the map */	1649	/* reset the light list and los of the players on the map */
1670	if (op->glow_radius && map && map->darkness)	1650	if (op->glow_radius && is_on_map ())
		1651	{
		1652	update_stats ();
1671	update_all_los (map, x, y);	1653	update_all_los (map, x, y);
1672		1654	}
1673	if (object *otmp = in_player ())	1655	else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])
1674	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1656	// if this is a player's inventory, update stats
1675	otmp->update_stats ();	1657	update_stats ();
1676		1658
1677	INVOKE_OBJECT (INSERT, this);	1659	INVOKE_OBJECT (INSERT, this);
1678		1660
1679	return op;	1661	return op;
1680	}	1662	}
…		…
1700	* on top.	1682	* on top.
1701	*/	1683	*/
1702	int	1684	int
1703	check_move_on (object *op, object *originator)	1685	check_move_on (object *op, object *originator)
1704	{	1686	{
		1687	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1688	return 0;
		1689
1705	object *tmp;	1690	object *tmp;
1706	maptile *m = op->map;	1691	maptile *m = op->map;
1707	int x = op->x, y = op->y;	1692	int x = op->x, y = op->y;
1708		1693
1709	MoveType move_on, move_slow, move_block;	1694	mapspace &ms = m->at (x, y);
1710		1695
1711	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1696	ms.update ();
1712	return 0;
1713		1697
1714	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1698	MoveType move_on = ms.move_on;
1715	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1699	MoveType move_slow = ms.move_slow;
1716	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1700	MoveType move_block = ms.move_block;
1717		1701
1718	/* if nothing on this space will slow op down or be applied,	1702	/* if nothing on this space will slow op down or be applied,
1719	* no need to do checking below. have to make sure move_type	1703	* no need to do checking below. have to make sure move_type
1720	* is set, as lots of objects don't have it set - we treat that	1704	* is set, as lots of objects don't have it set - we treat that
1721	* as walking.	1705	* as walking.
…		…
1732	return 0;	1716	return 0;
1733		1717
1734	/* The objects have to be checked from top to bottom.	1718	/* The objects have to be checked from top to bottom.
1735	* Hence, we first go to the top:	1719	* Hence, we first go to the top:
1736	*/	1720	*/
1737		1721	for (object *next, *tmp = ms.top; tmp; tmp = next)
1738	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1739	{
1740	/* Trim the search when we find the first other spell effect
1741	* this helps performance so that if a space has 50 spell objects,
1742	* we don't need to check all of them.
1743	*/
1744	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1745	break;
1746	}	1722	{
		1723	next = tmp->below;
1747		1724
1748	for (; tmp; tmp = tmp->below)
1749	{
1750	if (tmp == op)	1725	if (tmp == op)
1751	continue; /* Can't apply yourself */	1726	continue; /* Can't apply yourself */
1752		1727
1753	/* Check to see if one of the movement types should be slowed down.	1728	/* Check to see if one of the movement types should be slowed down.
1754	* Second check makes sure that the movement types not being slowed	1729	* Second check makes sure that the movement types not being slowed
…		…
1759	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1734	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1760	{	1735	{
1761	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1736	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1762	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1737	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1763	{	1738	{
1764
1765	float
1766	diff = tmp->move_slow_penalty * fabs (op->speed);	1739	float diff = tmp->move_slow_penalty * fabs (op->speed);
1767		1740
1768	if (op->type == PLAYER)	1741	if (op->is_player ())
1769	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1742	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1770	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1743	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1771	diff /= 4.0;	1744	diff /= 4.0;
1772		1745
1773	op->speed_left -= diff;	1746	op->speed_left -= diff;
1774	}	1747	}
1775	}	1748	}
…		…
1808	LOG (llevError, "Present_arch called outside map.\n");	1781	LOG (llevError, "Present_arch called outside map.\n");
1809	return NULL;	1782	return NULL;
1810	}	1783	}
1811		1784
1812	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1785	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1813	if (tmp->arch == at)	1786	if (tmp->arch->archname == at->archname)
1814	return tmp;	1787	return tmp;
1815		1788
1816	return NULL;	1789	return NULL;
1817	}	1790	}
1818		1791
…		…
1882	* The first matching object is returned, or NULL if none.	1855	* The first matching object is returned, or NULL if none.
1883	*/	1856	*/
1884	object *	1857	object *
1885	present_arch_in_ob (const archetype *at, const object *op)	1858	present_arch_in_ob (const archetype *at, const object *op)
1886	{	1859	{
1887	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1860	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1888	if (tmp->arch == at)	1861	if (tmp->arch->archname == at->archname)
1889	return tmp;	1862	return tmp;
1890		1863
1891	return NULL;	1864	return NULL;
1892	}	1865	}
1893		1866
…		…
1981	* head of the object should correspond for the entire object.	1954	* head of the object should correspond for the entire object.
1982	*/	1955	*/
1983	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	1956	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
1984	continue;	1957	continue;
1985		1958
1986	if (ob->blocked (m, pos.x, pos.y))	1959	if (ob->blocked (pos.m, pos.x, pos.y))
1987	continue;	1960	continue;
1988		1961
1989	altern [index++] = i;	1962	altern [index++] = i;
1990	}	1963	}
1991		1964
…		…
2059	* there is capable of.	2032	* there is capable of.
2060	*/	2033	*/
2061	int	2034	int
2062	find_dir (maptile *m, int x, int y, object *exclude)	2035	find_dir (maptile *m, int x, int y, object *exclude)
2063	{	2036	{
2064	int i, max = SIZEOFFREE, mflags;	2037	int max = SIZEOFFREE, mflags;
2065
2066	sint16 nx, ny;
2067	object *tmp;
2068	maptile *mp;
2069
2070	MoveType blocked, move_type;	2038	MoveType move_type;
2071		2039
2072	if (exclude && exclude->head_ () != exclude)	2040	if (exclude && exclude->head_ () != exclude)
2073	{	2041	{
2074	exclude = exclude->head;	2042	exclude = exclude->head;
2075	move_type = exclude->move_type;	2043	move_type = exclude->move_type;
…		…
2078	{	2046	{
2079	/* If we don't have anything, presume it can use all movement types. */	2047	/* If we don't have anything, presume it can use all movement types. */
2080	move_type = MOVE_ALL;	2048	move_type = MOVE_ALL;
2081	}	2049	}
2082		2050
2083	for (i = 1; i < max; i++)	2051	for (int i = 1; i < max; i++)
2084	{	2052	{
2085	mp = m;	2053	mapxy pos (m, x, y);
2086	nx = x + freearr_x[i];	2054	pos.move (i);
2087	ny = y + freearr_y[i];
2088		2055
2089	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2056	if (!pos.normalise ())
2090
2091	if (mflags & P_OUT_OF_MAP)
2092	max = maxfree[i];	2057	max = maxfree[i];
2093	else	2058	else
2094	{	2059	{
2095	mapspace &ms = mp->at (nx, ny);	2060	mapspace &ms = *pos;
2096		2061
2097	blocked = ms.move_block;
2098
2099	if ((move_type & blocked) == move_type)	2062	if ((move_type & ms.move_block) == move_type)
2100	max = maxfree[i];	2063	max = maxfree [i];
2101	else if (mflags & P_IS_ALIVE)	2064	else if (ms.flags () & P_IS_ALIVE)
2102	{	2065	{
2103	for (tmp = ms.bot; tmp; tmp = tmp->above)	2066	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2104	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2067	if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2105	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2068	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2106	break;
2107
2108	if (tmp)
2109	return freedir[i];	2069	return freedir [i];
2110	}	2070	}
2111	}	2071	}
2112	}	2072	}
2113		2073
2114	return 0;	2074	return 0;
…		…
2189	* This basically means that if direction is 15, then it could either go	2149	* This basically means that if direction is 15, then it could either go
2190	* direction 4, 14, or 16 to get back to where we are.	2150	* direction 4, 14, or 16 to get back to where we are.
2191	* Moved from spell_util.c to object.c with the other related direction	2151	* Moved from spell_util.c to object.c with the other related direction
2192	* functions.	2152	* functions.
2193	*/	2153	*/
2194	int reduction_dir[SIZEOFFREE][3] = {	2154	static const int reduction_dir[SIZEOFFREE][3] = {
2195	{0, 0, 0}, /* 0 */	2155	{0, 0, 0}, /* 0 */
2196	{0, 0, 0}, /* 1 */	2156	{0, 0, 0}, /* 1 */
2197	{0, 0, 0}, /* 2 */	2157	{0, 0, 0}, /* 2 */
2198	{0, 0, 0}, /* 3 */	2158	{0, 0, 0}, /* 3 */
2199	{0, 0, 0}, /* 4 */	2159	{0, 0, 0}, /* 4 */
…		…
2295	int	2255	int
2296	can_pick (const object *who, const object *item)	2256	can_pick (const object *who, const object *item)
2297	{	2257	{
2298	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2258	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2299	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2259	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2300	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2260	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2301	}	2261	}
2302		2262
2303	/*	2263	/*
2304	* create clone from object to another	2264	* create clone from object to another
2305	*/	2265	*/
2306	object *	2266	object *
2307	object_create_clone (object *asrc)	2267	object::deep_clone ()
2308	{	2268	{
2309	object *dst = 0, *tmp, *src, *prev, *item;	2269	assert (("deep_clone called on non-head object", is_head ()));
2310		2270
2311	if (!asrc)	2271	object *dst = clone ();
2312	return 0;
2313		2272
2314	src = asrc->head_ ();	2273	object *prev = dst;
2315
2316	prev = 0;
2317	for (object *part = src; part; part = part->more)	2274	for (object *part = this->more; part; part = part->more)
2318	{	2275	{
2319	tmp = part->clone ();	2276	object *tmp = part->clone ();
2320	tmp->x -= src->x;
2321	tmp->y -= src->y;
2322
2323	if (!part->head)
2324	{
2325	dst = tmp;
2326	tmp->head = 0;
2327	}
2328	else
2329	tmp->head = dst;	2277	tmp->head = dst;
2330
2331	tmp->more = 0;
2332
2333	if (prev)
2334	prev->more = tmp;	2278	prev->more = tmp;
2335
2336	prev = tmp;	2279	prev = tmp;
2337	}	2280	}
2338		2281
2339	for (item = src->inv; item; item = item->below)	2282	for (object *item = inv; item; item = item->below)
2340	insert_ob_in_ob (object_create_clone (item), dst);	2283	insert_ob_in_ob (item->deep_clone (), dst);
2341		2284
2342	return dst;	2285	return dst;
2343	}	2286	}
2344		2287
2345	/* This returns the first object in who's inventory that	2288	/* This returns the first object in who's inventory that
…		…
2354	return tmp;	2297	return tmp;
2355		2298
2356	return 0;	2299	return 0;
2357	}	2300	}
2358		2301
2359	/* If ob has a field named key, return the link from the list,	2302	shstr_tmp
2360	* otherwise return NULL.	2303	object::kv_get (shstr_tmp key) const
2361	*
2362	* key must be a passed in shared string - otherwise, this won't
2363	* do the desired thing.
2364	*/
2365	key_value *
2366	get_ob_key_link (const object *ob, const char *key)
2367	{	2304	{
2368	for (key_value *link = ob->key_values; link; link = link->next)	2305	for (key_value *kv = key_values; kv; kv = kv->next)
2369	if (link->key == key)	2306	if (kv->key == key)
2370	return link;
2371
2372	return 0;
2373	}
2374
2375	/*
2376	* Returns the value of op has an extra_field for key, or NULL.
2377	*
2378	* The argument doesn't need to be a shared string.
2379	*
2380	* The returned string is shared.
2381	*/
2382	const char *
2383	get_ob_key_value (const object *op, const char *const key)
2384	{
2385	key_value *link;
2386	shstr_cmp canonical_key (key);
2387
2388	if (!canonical_key)
2389	{
2390	/* 1. There being a field named key on any object
2391	* implies there'd be a shared string to find.
2392	* 2. Since there isn't, no object has this field.
2393	* 3. Therefore, *this* object doesn't have this field.
2394	*/
2395	return 0;
2396	}
2397
2398	/* This is copied from get_ob_key_link() above -
2399	* only 4 lines, and saves the function call overhead.
2400	*/
2401	for (link = op->key_values; link; link = link->next)
2402	if (link->key == canonical_key)
2403	return link->value;	2307	return kv->value;
2404		2308
2405	return 0;	2309	return shstr ();
2406	}	2310	}
2407		2311
2408	/*	2312	void
2409	* Updates the canonical_key in op to value.	2313	object::kv_set (shstr_tmp key, shstr_tmp value)
2410	*
2411	* canonical_key is a shared string (value doesn't have to be).
2412	*
2413	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2414	* keys.
2415	*
2416	* Returns TRUE on success.
2417	*/
2418	int
2419	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2420	{	2314	{
2421	key_value *field = NULL, *last = NULL;	2315	for (key_value *kv = key_values; kv; kv = kv->next)
2422		2316	if (kv->key == key)
2423	for (field = op->key_values; field != NULL; field = field->next)
2424	{
2425	if (field->key != canonical_key)
2426	{	2317	{
2427	last = field;	2318	kv->value = value;
2428	continue;	2319	return;
2429	}	2320	}
2430		2321
2431	if (value)	2322	key_value *kv = new key_value;
2432	field->value = value;	2323
2433	else	2324	kv->next = key_values;
		2325	kv->key = key;
		2326	kv->value = value;
		2327
		2328	key_values = kv;
		2329	}
		2330
		2331	void
		2332	object::kv_del (shstr_tmp key)
		2333	{
		2334	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2335	if ((*kvp)->key == key)
2434	{	2336	{
2435	/* Basically, if the archetype has this key set,	2337	key_value *kv = *kvp;
2436	* we need to store the null value so when we save	2338	*kvp = (*kvp)->next;
2437	* it, we save the empty value so that when we load,	2339	delete kv;
2438	* we get this value back again.	2340	return;
2439	*/
2440	if (get_ob_key_link (op->arch, canonical_key))
2441	field->value = 0;
2442	else
2443	{
2444	if (last)
2445	last->next = field->next;
2446	else
2447	op->key_values = field->next;
2448
2449	delete field;
2450	}
2451	}	2341	}
2452	return TRUE;
2453	}
2454	/* IF we get here, key doesn't exist */
2455
2456	/* No field, we'll have to add it. */
2457
2458	if (!add_key)
2459	return FALSE;
2460
2461	/* There isn't any good reason to store a null
2462	* value in the key/value list. If the archetype has
2463	* this key, then we should also have it, so shouldn't
2464	* be here. If user wants to store empty strings,
2465	* should pass in ""
2466	*/
2467	if (value == NULL)
2468	return TRUE;
2469
2470	field = new key_value;
2471
2472	field->key = canonical_key;
2473	field->value = value;
2474	/* Usual prepend-addition. */
2475	field->next = op->key_values;
2476	op->key_values = field;
2477
2478	return TRUE;
2479	}
2480
2481	/*
2482	* Updates the key in op to value.
2483	*
2484	* If add_key is FALSE, this will only update existing keys,
2485	* and not add new ones.
2486	* In general, should be little reason FALSE is ever passed in for add_key
2487	*
2488	* Returns TRUE on success.
2489	*/
2490	int
2491	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2492	{
2493	shstr key_ (key);
2494
2495	return set_ob_key_value_s (op, key_, value, add_key);
2496	}	2342	}
2497		2343
2498	object::depth_iterator::depth_iterator (object *container)	2344	object::depth_iterator::depth_iterator (object *container)
2499	: iterator_base (container)	2345	: iterator_base (container)
2500	{	2346	{
…		…
2550	{	2396	{
2551	char flagdesc[512];	2397	char flagdesc[512];
2552	char info2[256 * 4];	2398	char info2[256 * 4];
2553	char *p = info;	2399	char *p = info;
2554		2400
2555	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2401	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2556	count,	2402	count,
2557	uuid.c_str (),	2403	uuid.c_str (),
2558	&name,	2404	&name,
2559	title ? "\",title:\"" : "",	2405	title ? ",title:\"" : "",
2560	title ? (const char *)title : "",	2406	title ? (const char *)title : "",
		2407	title ? "\"" : "",
2561	flag_desc (flagdesc, 512), type);	2408	flag_desc (flagdesc, 512), type);
2562		2409
2563	if (!this->flag[FLAG_REMOVED] && env)	2410	if (!flag[FLAG_REMOVED] && env)
2564	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2411	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2565		2412
2566	if (map)	2413	if (map)
2567	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2414	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2568		2415
…		…
2598	object::open_container (object *new_container)	2445	object::open_container (object *new_container)
2599	{	2446	{
2600	if (container == new_container)	2447	if (container == new_container)
2601	return;	2448	return;
2602		2449
2603	if (object *old_container = container)	2450	object *old_container = container;
		2451
		2452	if (old_container)
2604	{	2453	{
2605	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2454	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2606	return;	2455	return;
2607		2456
2608	#if 0	2457	#if 0
…		…
2610	if (object *closer = old_container->inv)	2459	if (object *closer = old_container->inv)
2611	if (closer->type == CLOSE_CON)	2460	if (closer->type == CLOSE_CON)
2612	closer->destroy ();	2461	closer->destroy ();
2613	#endif	2462	#endif
2614		2463
		2464	// make sure the container is available
		2465	esrv_send_item (this, old_container);
		2466
2615	old_container->flag [FLAG_APPLIED] = 0;	2467	old_container->flag [FLAG_APPLIED] = false;
2616	container = 0;	2468	container = 0;
2617		2469
		2470	// client needs item update to make it work, client bug requires this to be separate
2618	esrv_update_item (UPD_FLAGS, this, old_container);	2471	esrv_update_item (UPD_FLAGS, this, old_container);
		2472
2619	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2473	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2620	play_sound (sound_find ("chest_close"));	2474	play_sound (sound_find ("chest_close"));
2621	}	2475	}
2622		2476
2623	if (new_container)	2477	if (new_container)
2624	{	2478	{
…		…
2634	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2488	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2635	new_container->insert (closer);	2489	new_container->insert (closer);
2636	}	2490	}
2637	#endif	2491	#endif
2638		2492
2639	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2493	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2640		2494
		2495	// make sure the container is available, client bug requires this to be separate
		2496	esrv_send_item (this, new_container);
		2497
2641	new_container->flag [FLAG_APPLIED] = 1;	2498	new_container->flag [FLAG_APPLIED] = true;
2642	container = new_container;	2499	container = new_container;
2643		2500
		2501	// client needs flag change
2644	esrv_update_item (UPD_FLAGS, this, new_container);	2502	esrv_update_item (UPD_FLAGS, this, new_container);
2645	esrv_send_inventory (this, new_container);	2503	esrv_send_inventory (this, new_container);
2646	play_sound (sound_find ("chest_open"));	2504	play_sound (sound_find ("chest_open"));
2647	}	2505	}
		2506	// else if (!old_container->env && contr && contr->ns)
		2507	// contr->ns->floorbox_reset ();
2648	}	2508	}
2649		2509
2650	object *	2510	object *
2651	object::force_find (const shstr name)	2511	object::force_find (shstr_tmp name)
2652	{	2512	{
2653	/* cycle through his inventory to look for the MARK we want to	2513	/* cycle through his inventory to look for the MARK we want to
2654	* place	2514	* place
2655	*/	2515	*/
2656	for (object *tmp = inv; tmp; tmp = tmp->below)	2516	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2658	return splay (tmp);	2518	return splay (tmp);
2659		2519
2660	return 0;	2520	return 0;
2661	}	2521	}
2662		2522
		2523	//-GPL
		2524
2663	void	2525	void
		2526	object::force_set_timer (int duration)
		2527	{
		2528	this->duration = 1;
		2529	this->speed_left = -1.f;
		2530
		2531	this->set_speed (duration ? 1.f / duration : 0.f);
		2532	}
		2533
		2534	object *
2664	object::force_add (const shstr name, int duration)	2535	object::force_add (shstr_tmp name, int duration)
2665	{	2536	{
2666	if (object *force = force_find (name))	2537	if (object *force = force_find (name))
2667	force->destroy ();	2538	force->destroy ();
2668		2539
2669	object *force = get_archetype (FORCE_NAME);	2540	object *force = get_archetype (FORCE_NAME);
2670		2541
2671	force->slaying = name;	2542	force->slaying = name;
2672	force->stats.food = 1;	2543	force->force_set_timer (duration);
2673	force->speed_left = -1.f;
2674
2675	force->set_speed (duration ? 1.f / duration : 0.f);
2676	force->flag [FLAG_IS_USED_UP] = true;
2677	force->flag [FLAG_APPLIED] = true;	2544	force->flag [FLAG_APPLIED] = true;
2678		2545
2679	insert (force);	2546	return insert (force);
2680	}	2547	}
2681		2548
2682	void	2549	void
2683	object::play_sound (faceidx sound)	2550	object::play_sound (faceidx sound) const
2684	{	2551	{
2685	if (!sound)	2552	if (!sound)
2686	return;	2553	return;
2687		2554
2688	if (flag [FLAG_REMOVED])	2555	if (is_on_map ())
		2556	map->play_sound (sound, x, y);
		2557	else if (object *pl = in_player ())
		2558	pl->contr->play_sound (sound);
		2559	}
		2560
		2561	void
		2562	object::say_msg (const char *msg) const
		2563	{
		2564	if (is_on_map ())
		2565	map->say_msg (msg, x, y);
		2566	else if (object *pl = in_player ())
		2567	pl->contr->play_sound (sound);
		2568	}
		2569
		2570	void
		2571	object::make_noise ()
		2572	{
		2573	// we do not model noise in the map, so instead put
		2574	// a temporary light into the noise source
		2575	// could use the map instead, but that's less reliable for our
		2576	// goal, which is to make invisibility a bit harder to exploit
		2577
		2578	// currently only works sensibly for players
		2579	if (!is_player ())
2689	return;	2580	return;
2690		2581
2691	if (env)	2582	// find old force, or create new one
2692	{	2583	object *force = force_find (shstr_noise_force);
2693	if (object *pl = in_player ())	2584
2694	pl->contr->play_sound (sound);	2585	if (force)
2695	}	2586	force->speed_left = -1.f; // patch old speed up
2696	else	2587	else
2697	map->play_sound (sound, x, y);	2588	{
2698	}	2589	force = archetype::get (shstr_noise_force);
2699		2590
		2591	force->slaying = shstr_noise_force;
		2592	force->stats.food = 1;
		2593	force->speed_left = -1.f;
		2594
		2595	force->set_speed (1.f / 4.f);
		2596	force->flag [FLAG_IS_USED_UP] = true;
		2597	force->flag [FLAG_APPLIED] = true;
		2598
		2599	insert (force);
		2600	}
		2601	}
		2602

Diff Legend

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