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.63 by root, Tue Dec 12 20:53:02 2006 UTC vs.
Revision 1.160 by root, Tue Jun 5 13:05:02 2007 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3		3	*
		4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* Crossfire TRT is free software; you can redistribute it and/or modify it
8	it under the terms of the GNU General Public License as published by	9	* under the terms of the GNU General Public License as published by the Free
9	the Free Software Foundation; either version 2 of the License, or	10	* Software Foundation; either version 2 of the License, or (at your option)
10	(at your option) any later version.	11	* any later version.
11		12	*
12	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, but
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15	GNU General Public License for more details.	16	* for more details.
16		17	*
17	You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License along
18	along with this program; if not, write to the Free Software	19	* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20		21	*
21	The authors can be reached via e-mail at <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <crossfire@schmorp.de>
22	*/	23	*/
23		24
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying	26	sub/add_weight will transcend the environment updating the carrying
26	variable. */	27	variable. */
27	#include <global.h>	28	#include <global.h>
28	#include <stdio.h>	29	#include <stdio.h>
29	#include <sys/types.h>	30	#include <sys/types.h>
30	#include <sys/uio.h>	31	#include <sys/uio.h>
31	#include <object.h>	32	#include <object.h>
32	#include <funcpoint.h>	33	#include <funcpoint.h>
		34	#include <sproto.h>
33	#include <loader.h>	35	#include <loader.h>
		36
		37	#include <bitset>
34		38
35	int nrofallocobjects = 0;	39	int nrofallocobjects = 0;
36	static UUID uuid;	40	static UUID uuid;
37	const uint64 UUID_SKIP = 1<<19;	41	const uint64 UUID_SKIP = 1<<19;
38		42
39	object *active_objects; /* List of active objects that need to be processed */	43	objectvec objects;
		44	activevec actives;
40		45
41	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	46	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
42	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	47	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
43	};	48	};
44	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	49	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
…		…
139	* objects with lists are rare, and lists stay short. If not, use a	144	* objects with lists are rare, and lists stay short. If not, use a
140	* different structure or at least keep the lists sorted...	145	* different structure or at least keep the lists sorted...
141	*/	146	*/
142		147
143	/* For each field in wants, */	148	/* For each field in wants, */
144	for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)	149	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)
145	{	150	{
146	key_value *has_field;	151	key_value *has_field;
147		152
148	/* Look for a field in has with the same key. */	153	/* Look for a field in has with the same key. */
149	has_field = get_ob_key_link (has, wants_field->key);	154	has_field = get_ob_key_link (has, wants_field->key);
…		…
183	*	188	*
184	* Note that this function appears a lot longer than the macro it	189	* Note that this function appears a lot longer than the macro it
185	* replaces - this is mostly for clarity - a decent compiler should hopefully	190	* replaces - this is mostly for clarity - a decent compiler should hopefully
186	* reduce this to the same efficiency.	191	* reduce this to the same efficiency.
187	*	192	*
188	* Check nrof variable *before* calling CAN_MERGE()	193	* Check nrof variable *before* calling can_merge()
189	*	194	*
190	* Improvements made with merge: Better checking on potion, and also	195	* Improvements made with merge: Better checking on potion, and also
191	* check weight	196	* check weight
192	*/	197	*/
193
194	bool object::can_merge (object *ob1, object *ob2)	198	bool object::can_merge_slow (object *ob1, object *ob2)
195	{	199	{
196	/* A couple quicksanity checks */	200	/* A couple quicksanity checks */
197	if ((ob1 == ob2) || (ob1->type != ob2->type))	201	if (ob1 == ob2
		202	|| ob1->type != ob2->type
		203	|| ob1->speed != ob2->speed
		204	|| ob1->value != ob2->value
		205	|| ob1->name != ob2->name)
198	return 0;	206	return 0;
199		207
200	if (ob1->speed != ob2->speed)	208	//TODO: this ain't working well, use nicer and correct overflow check
201	return 0;
202
203	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	209	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that
204	* value could not be stored in a sint32 (which unfortunately sometimes is	210	* value could not be stored in a sint32 (which unfortunately sometimes is
205	* used to store nrof).	211	* used to store nrof).
206	*/	212	*/
207	if (ob1->nrof + ob2->nrof >= 1UL << 31)	213	if (ob1->nrof + ob2->nrof >= 1UL << 31)
…		…
217	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	223	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
218		224
219	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	225	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
220	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	226	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
221		227
222		228	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
223	/* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something	229	|| ob1->arch != ob2->arch
224	* being locked in inventory should prevent merging.
225	* 0x4 in flags3 is CLIENT_SENT
226	*/
227	if ((ob1->arch != ob2->arch) ||
228	(ob1->flags[0] != ob2->flags[0]) ||
229	(ob1->flags[1] != ob2->flags[1]) ||
230	((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) ||
231	((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
232	(ob1->name != ob2->name) ||	230	|| ob1->name != ob2->name
233	(ob1->title != ob2->title) ||	231	|| ob1->title != ob2->title
234	(ob1->msg != ob2->msg) ||	232	|| ob1->msg != ob2->msg
235	(ob1->weight != ob2->weight) ||	233	|| ob1->weight != ob2->weight
236	(memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) ||	234	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
237	(memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) ||	235	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
238	(ob1->attacktype != ob2->attacktype) ||	236	|| ob1->attacktype != ob2->attacktype
239	(ob1->magic != ob2->magic) ||	237	|| ob1->magic != ob2->magic
240	(ob1->slaying != ob2->slaying) ||	238	|| ob1->slaying != ob2->slaying
241	(ob1->skill != ob2->skill) ||	239	|| ob1->skill != ob2->skill
242	(ob1->value != ob2->value) ||	240	|| ob1->value != ob2->value
243	(ob1->animation_id != ob2->animation_id) ||	241	|| ob1->animation_id != ob2->animation_id
244	(ob1->client_type != ob2->client_type) ||	242	|| ob1->client_type != ob2->client_type
245	(ob1->materialname != ob2->materialname) ||	243	|| ob1->materialname != ob2->materialname
246	(ob1->lore != ob2->lore) ||	244	|| ob1->lore != ob2->lore
247	(ob1->subtype != ob2->subtype) ||	245	|| ob1->subtype != ob2->subtype
248	(ob1->move_type != ob2->move_type) ||	246	|| ob1->move_type != ob2->move_type
249	(ob1->move_block != ob2->move_block) ||	247	|| ob1->move_block != ob2->move_block
250	(ob1->move_allow != ob2->move_allow) ||	248	|| ob1->move_allow != ob2->move_allow
251	(ob1->move_on != ob2->move_on) ||	249	|| ob1->move_on != ob2->move_on
252	(ob1->move_off != ob2->move_off) || (ob1->move_slow != ob2->move_slow) || (ob1->move_slow_penalty != ob2->move_slow_penalty))	250	|| ob1->move_off != ob2->move_off
		251	|| ob1->move_slow != ob2->move_slow
		252	|| ob1->move_slow_penalty != ob2->move_slow_penalty)
253	return 0;	253	return 0;
254		254
255	/* This is really a spellbook check - really, we should	255	/* This is really a spellbook check - really, we should
256	* check all objects in the inventory.	256	* check all objects in the inventory.
257	*/	257	*/
…		…
260	/* if one object has inventory but the other doesn't, not equiv */	260	/* if one object has inventory but the other doesn't, not equiv */
261	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	261	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))
262	return 0;	262	return 0;
263		263
264	/* Now check to see if the two inventory objects could merge */	264	/* Now check to see if the two inventory objects could merge */
265	if (!CAN_MERGE (ob1->inv, ob2->inv))	265	if (!object::can_merge (ob1->inv, ob2->inv))
266	return 0;	266	return 0;
267		267
268	/* inventory ok - still need to check rest of this object to see	268	/* inventory ok - still need to check rest of this object to see
269	* if it is valid.	269	* if it is valid.
270	*/	270	*/
…		…
279		279
280	/* Note sure why the following is the case - either the object has to	280	/* Note sure why the following is the case - either the object has to
281	* be animated or have a very low speed. Is this an attempted monster	281	* be animated or have a very low speed. Is this an attempted monster
282	* check?	282	* check?
283	*/	283	*/
284	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	284	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
285	return 0;	285	return 0;
286		286
287	switch (ob1->type)	287	switch (ob1->type)
288	{	288	{
289	case SCROLL:	289	case SCROLL:
…		…
325	sum_weight (object *op)	325	sum_weight (object *op)
326	{	326	{
327	long sum;	327	long sum;
328	object *inv;	328	object *inv;
329		329
330	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	330	for (sum = 0, inv = op->inv; inv; inv = inv->below)
331	{	331	{
332	if (inv->inv)	332	if (inv->inv)
333	sum_weight (inv);	333	sum_weight (inv);
		334
334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	335	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
335	}	336	}
336		337
337	if (op->type == CONTAINER && op->stats.Str)	338	if (op->type == CONTAINER && op->stats.Str)
338	sum = (sum * (100 - op->stats.Str)) / 100;	339	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
354	op = op->env;	355	op = op->env;
355	return op;	356	return op;
356	}	357	}
357		358
358	/*	359	/*
359	* Eneq(@csd.uu.se): Since we can have items buried in a character we need
360	* a better check. We basically keeping traversing up until we can't
361	* or find a player.
362	*/
363
364	object *
365	is_player_inv (object *op)
366	{
367	for (; op != NULL && op->type != PLAYER; op = op->env)
368	if (op->env == op)
369	op->env = NULL;
370	return op;
371	}
372
373	/*
374	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	360	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
375	* Some error messages.	361	* Some error messages.
376	* The result of the dump is stored in the static global errmsg array.	362	* The result of the dump is stored in the static global errmsg array.
377	*/	363	*/
378
379	char *	364	char *
380	dump_object (object *op)	365	dump_object (object *op)
381	{	366	{
382	if (!op)	367	if (!op)
383	return strdup ("[NULLOBJ]");	368	return strdup ("[NULLOBJ]");
384		369
385	object_freezer freezer;	370	object_freezer freezer;
386	save_object (freezer, op, 3);	371	op->write (freezer);
387	return freezer.as_string ();	372	return freezer.as_string ();
388	}	373	}
389		374
390	/*	375	/*
391	* get_nearest_part(multi-object, object 2) returns the part of the	376	* get_nearest_part(multi-object, object 2) returns the part of the
…		…
408	}	393	}
409		394
410	/*	395	/*
411	* Returns the object which has the count-variable equal to the argument.	396	* Returns the object which has the count-variable equal to the argument.
412	*/	397	*/
413
414	object *	398	object *
415	find_object (tag_t i)	399	find_object (tag_t i)
416	{	400	{
417	for (object *op = object::first; op; op = op->next)	401	for_all_objects (op)
418	if (op->count == i)	402	if (op->count == i)
419	return op;	403	return op;
420		404
421	return 0;	405	return 0;
422	}	406	}
423		407
424	/*	408	/*
425	* Returns the first object which has a name equal to the argument.	409	* Returns the first object which has a name equal to the argument.
426	* Used only by the patch command, but not all that useful.	410	* Used only by the patch command, but not all that useful.
427	* Enables features like "patch <name-of-other-player> food 999"	411	* Enables features like "patch <name-of-other-player> food 999"
428	*/	412	*/
429
430	object *	413	object *
431	find_object_name (const char *str)	414	find_object_name (const char *str)
432	{	415	{
433	shstr_cmp str_ (str);	416	shstr_cmp str_ (str);
434	object *op;	417	object *op;
435		418
436	for (op = object::first; op != NULL; op = op->next)	419	for_all_objects (op)
437	if (op->name == str_)	420	if (op->name == str_)
438	break;	421	break;
439		422
440	return op;	423	return op;
441	}	424	}
…		…
467	owner = owner->owner;	450	owner = owner->owner;
468		451
469	this->owner = owner;	452	this->owner = owner;
470	}	453	}
471		454
		455	int
		456	object::slottype () const
		457	{
		458	if (type == SKILL)
		459	{
		460	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		461	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		462	}
		463	else
		464	{
		465	if (slot [body_combat].info) return slot_combat;
		466	if (slot [body_range ].info) return slot_ranged;
		467	}
		468
		469	return slot_none;
		470	}
		471
		472	bool
		473	object::change_weapon (object *ob)
		474	{
		475	if (current_weapon == ob)
		476	return true;
		477
		478	if (chosen_skill)
		479	chosen_skill->flag [FLAG_APPLIED] = false;
		480
		481	current_weapon = ob;
		482	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		483
		484	if (chosen_skill)
		485	chosen_skill->flag [FLAG_APPLIED] = true;
		486
		487	update_stats ();
		488
		489	if (ob)
		490	{
		491	// now check wether any body locations became invalid, in which case
		492	// we cannot apply the weapon at the moment.
		493	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		494	if (slot[i].used < 0)
		495	{
		496	current_weapon = chosen_skill = 0;
		497	update_stats ();
		498
		499	new_draw_info_format (NDI_UNIQUE, 0, this,
		500	"You try to balance all your items at once, "
		501	"but the %s is just too much for your body. "
		502	"[You need to unapply some items first.]", &ob->name);
		503	return false;
		504	}
		505
		506	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		507	}
		508	else
		509	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		510
		511	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		512	{
		513	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		514	&name, ob->debug_desc ());
		515	return false;
		516	}
		517
		518	return true;
		519	}
		520
472	/* Zero the key_values on op, decrementing the shared-string	521	/* Zero the key_values on op, decrementing the shared-string
473	* refcounts and freeing the links.	522	* refcounts and freeing the links.
474	*/	523	*/
475	static void	524	static void
476	free_key_values (object *op)	525	free_key_values (object *op)
477	{	526	{
478	for (key_value *i = op->key_values; i != 0;)	527	for (key_value *i = op->key_values; i; )
479	{	528	{
480	key_value *next = i->next;	529	key_value *next = i->next;
481	delete i;	530	delete i;
482		531
483	i = next;	532	i = next;
484	}	533	}
485		534
486	op->key_values = 0;	535	op->key_values = 0;
487	}	536	}
488		537
489	void object::clear ()	538	object &
		539	object::operator =(const object &src)
490	{	540	{
491	attachable_base::clear ();	541	bool is_freed = flag [FLAG_FREED];
		542	bool is_removed = flag [FLAG_REMOVED];
492		543
493	free_key_values (this);	544	*(object_copy *)this = src;
494		545
495	owner = 0;	546	flag [FLAG_FREED] = is_freed;
496	name = 0;	547	flag [FLAG_REMOVED] = is_removed;
497	name_pl = 0;
498	title = 0;
499	race = 0;
500	slaying = 0;
501	skill = 0;
502	msg = 0;
503	lore = 0;
504	custom_name = 0;
505	materialname = 0;
506	contr = 0;
507	below = 0;
508	above = 0;
509	inv = 0;
510	container = 0;
511	env = 0;
512	more = 0;
513	head = 0;
514	map = 0;
515	active_next = 0;
516	active_prev = 0;
517
518	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
519
520	SET_FLAG (this, FLAG_REMOVED);
521
522	/* What is not cleared is next, prev, and count */
523
524	expmul = 1.0;
525	face = blank_face;
526
527	if (settings.casting_time)
528	casting_time = -1;
529	}
530
531	void object::clone (object *destination)
532	{
533	*(object_copy *)destination = *this;
534	*(object_pod *)destination = *this;
535
536	if (self || cb)
537	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
538	}
539
540	/*
541	* copy object first frees everything allocated by the second object,
542	* and then copies the contends of the first object into the second
543	* object, allocating what needs to be allocated. Basically, any
544	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
545	* if the first object is freed, the pointers in the new object
546	* will point at garbage.
547	*/
548	void
549	copy_object (object *op2, object *op)
550	{
551	bool is_freed = QUERY_FLAG (op, FLAG_FREED);
552	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);
553
554	op2->clone (op);
555
556	if (is_freed)
557	SET_FLAG (op, FLAG_FREED);
558
559	if (is_removed)
560	SET_FLAG (op, FLAG_REMOVED);
561
562	if (op2->speed < 0)
563	op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0;
564		548
565	/* Copy over key_values, if any. */	549	/* Copy over key_values, if any. */
566	if (op2->key_values)	550	if (src.key_values)
567	{	551	{
568	key_value *tail = 0;	552	key_value *tail = 0;
569	key_value *i;
570
571	op->key_values = 0;	553	key_values = 0;
572		554
573	for (i = op2->key_values; i; i = i->next)	555	for (key_value *i = src.key_values; i; i = i->next)
574	{	556	{
575	key_value *new_link = new key_value;	557	key_value *new_link = new key_value;
576		558
577	new_link->next = 0;	559	new_link->next = 0;
578	new_link->key = i->key;	560	new_link->key = i->key;
579	new_link->value = i->value;	561	new_link->value = i->value;
580		562
581	/* Try and be clever here, too. */	563	/* Try and be clever here, too. */
582	if (!op->key_values)	564	if (!key_values)
583	{	565	{
584	op->key_values = new_link;	566	key_values = new_link;
585	tail = new_link;	567	tail = new_link;
586	}	568	}
587	else	569	else
588	{	570	{
589	tail->next = new_link;	571	tail->next = new_link;
590	tail = new_link;	572	tail = new_link;
591	}	573	}
592	}	574	}
593	}	575	}
		576	}
594		577
595	update_ob_speed (op);	578	/*
		579	* copy_to first frees everything allocated by the dst object,
		580	* and then copies the contents of itself into the second
		581	* object, allocating what needs to be allocated. Basically, any
		582	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		583	* if the first object is freed, the pointers in the new object
		584	* will point at garbage.
		585	*/
		586	void
		587	object::copy_to (object *dst)
		588	{
		589	*dst = *this;
		590
		591	if (speed < 0)
		592	dst->speed_left = speed_left - rndm ();
		593
		594	dst->set_speed (dst->speed);
		595	}
		596
		597	void
		598	object::instantiate ()
		599	{
		600	if (!uuid.seq) // HACK
		601	uuid = gen_uuid ();
		602
		603	speed_left = -0.1f;
		604	/* copy the body_info to the body_used - this is only really
		605	* need for monsters, but doesn't hurt to do it for everything.
		606	* by doing so, when a monster is created, it has good starting
		607	* values for the body_used info, so when items are created
		608	* for it, they can be properly equipped.
		609	*/
		610	for (int i = NUM_BODY_LOCATIONS; i--; )
		611	slot[i].used = slot[i].info;
		612
		613	attachable::instantiate ();
		614	}
		615
		616	object *
		617	object::clone ()
		618	{
		619	object *neu = create ();
		620	copy_to (neu);
		621	return neu;
596	}	622	}
597		623
598	/*	624	/*
599	* If an object with the IS_TURNABLE() flag needs to be turned due	625	* If an object with the IS_TURNABLE() flag needs to be turned due
600	* to the closest player being on the other side, this function can	626	* to the closest player being on the other side, this function can
601	* be called to update the face variable, _and_ how it looks on the map.	627	* be called to update the face variable, _and_ how it looks on the map.
602	*/	628	*/
603
604	void	629	void
605	update_turn_face (object *op)	630	update_turn_face (object *op)
606	{	631	{
607	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	632	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
608	return;	633	return;
		634
609	SET_ANIMATION (op, op->direction);	635	SET_ANIMATION (op, op->direction);
610	update_object (op, UP_OBJ_FACE);	636	update_object (op, UP_OBJ_FACE);
611	}	637	}
612		638
613	/*	639	/*
614	* Updates the speed of an object. If the speed changes from 0 to another	640	* Updates the speed of an object. If the speed changes from 0 to another
615	* value, or vice versa, then add/remove the object from the active list.	641	* value, or vice versa, then add/remove the object from the active list.
616	* This function needs to be called whenever the speed of an object changes.	642	* This function needs to be called whenever the speed of an object changes.
617	*/	643	*/
618	void	644	void
619	update_ob_speed (object *op)	645	object::set_speed (float speed)
620	{	646	{
621	extern int arch_init;	647	if (flag [FLAG_FREED] && speed)
622
623	/* No reason putting the archetypes objects on the speed list,
624	* since they never really need to be updated.
625	*/
626
627	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
628	{	648	{
629	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	649	LOG (llevError, "Object %s is freed but has speed.\n", &name);
630	#ifdef MANY_CORES
631	abort ();
632	#else
633	op->speed = 0;	650	speed = 0;
634	#endif
635	}
636
637	if (arch_init)
638	return;
639
640	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
641	{	651	}
642	/* If already on active list, don't do anything */
643	if (op->active_next || op->active_prev || op == active_objects)
644	return;
645		652
646	/* process_events() expects us to insert the object at the beginning	653	this->speed = speed;
647	* of the list. */
648	op->active_next = active_objects;
649		654
650	if (op->active_next != NULL)	655	if (has_active_speed ())
651	op->active_next->active_prev = op;	656	activate ();
652
653	active_objects = op;
654	}
655	else	657	else
656	{	658	deactivate ();
657	/* If not on the active list, nothing needs to be done */
658	if (!op->active_next && !op->active_prev && op != active_objects)
659	return;
660
661	if (op->active_prev == NULL)
662	{
663	active_objects = op->active_next;
664
665	if (op->active_next != NULL)
666	op->active_next->active_prev = NULL;
667	}
668	else
669	{
670	op->active_prev->active_next = op->active_next;
671
672	if (op->active_next)
673	op->active_next->active_prev = op->active_prev;
674	}
675
676	op->active_next = NULL;
677	op->active_prev = NULL;
678	}
679	}	659	}
680		660
681	/* This function removes object 'op' from the list of active
682	* objects.
683	* This should only be used for style maps or other such
684	* reference maps where you don't want an object that isn't
685	* in play chewing up cpu time getting processed.
686	* The reverse of this is to call update_ob_speed, which
687	* will do the right thing based on the speed of the object.
688	*/
689	void
690	remove_from_active_list (object *op)
691	{
692	/* If not on the active list, nothing needs to be done */
693	if (!op->active_next && !op->active_prev && op != active_objects)
694	return;
695
696	if (op->active_prev == NULL)
697	{
698	active_objects = op->active_next;
699	if (op->active_next != NULL)
700	op->active_next->active_prev = NULL;
701	}
702	else
703	{
704	op->active_prev->active_next = op->active_next;
705	if (op->active_next)
706	op->active_next->active_prev = op->active_prev;
707	}
708	op->active_next = NULL;
709	op->active_prev = NULL;
710	}
711
712	/*	661	/*
713	* update_object() updates the array which represents the map.	662	* update_object() updates the the map.
714	* It takes into account invisible objects (and represent squares covered	663	* It takes into account invisible objects (and represent squares covered
715	* by invisible objects by whatever is below them (unless it's another	664	* by invisible objects by whatever is below them (unless it's another
716	* invisible object, etc...)	665	* invisible object, etc...)
717	* If the object being updated is beneath a player, the look-window	666	* If the object being updated is beneath a player, the look-window
718	* of that player is updated (this might be a suboptimal way of	667	* of that player is updated (this might be a suboptimal way of
719	* updating that window, though, since update_object() is called _often_)	668	* updating that window, though, since update_object() is called _often_)
720	*	669	*
721	* action is a hint of what the caller believes need to be done.	670	* action is a hint of what the caller believes need to be done.
722	* For example, if the only thing that has changed is the face (due to
723	* an animation), we don't need to call update_position until that actually
724	* comes into view of a player. OTOH, many other things, like addition/removal
725	* of walls or living creatures may need us to update the flags now.
726	* current action are:	671	* current action are:
727	* UP_OBJ_INSERT: op was inserted	672	* UP_OBJ_INSERT: op was inserted
728	* UP_OBJ_REMOVE: op was removed	673	* UP_OBJ_REMOVE: op was removed
729	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update	674	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
730	* as that is easier than trying to look at what may have changed.	675	* as that is easier than trying to look at what may have changed.
731	* UP_OBJ_FACE: only the objects face has changed.	676	* UP_OBJ_FACE: only the objects face has changed.
732	*/	677	*/
733
734	void	678	void
735	update_object (object *op, int action)	679	update_object (object *op, int action)
736	{	680	{
737	int update_now = 0, flags;
738	MoveType move_on, move_off, move_block, move_slow;
739
740	if (op == NULL)	681	if (op == NULL)
741	{	682	{
742	/* this should never happen */	683	/* this should never happen */
743	LOG (llevDebug, "update_object() called for NULL object.\n");	684	LOG (llevDebug, "update_object() called for NULL object.\n");
744	return;	685	return;
745	}	686	}
746		687
747	if (op->env != NULL)	688	if (op->env)
748	{	689	{
749	/* Animation is currently handled by client, so nothing	690	/* Animation is currently handled by client, so nothing
750	* to do in this case.	691	* to do in this case.
751	*/	692	*/
752	return;	693	return;
…		…
757	*/	698	*/
758	if (!op->map || op->map->in_memory == MAP_SAVING)	699	if (!op->map || op->map->in_memory == MAP_SAVING)
759	return;	700	return;
760		701
761	/* make sure the object is within map boundaries */	702	/* make sure the object is within map boundaries */
762	if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))	703	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
763	{	704	{
764	LOG (llevError, "update_object() called for object out of map!\n");	705	LOG (llevError, "update_object() called for object out of map!\n");
765	#ifdef MANY_CORES	706	#ifdef MANY_CORES
766	abort ();	707	abort ();
767	#endif	708	#endif
768	return;	709	return;
769	}	710	}
770		711
771	flags = GET_MAP_FLAGS (op->map, op->x, op->y);	712	mapspace &m = op->ms ();
772	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
773	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
774	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
775	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
776	move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
777		713
		714	if (!(m.flags_ & P_UPTODATE))
		715	/* nop */;
778	if (action == UP_OBJ_INSERT)	716	else if (action == UP_OBJ_INSERT)
779	{	717	{
		718	// this is likely overkill, TODO: revisit (schmorp)
780	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))	719	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
781	update_now = 1;
782
783	if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))	720	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
784	update_now = 1;	721	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))
785		722	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
		723	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
786	if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))	724	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
787	update_now = 1;
788
789	if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
790	update_now = 1;
791
792	if (op->type == SAFE_GROUND && !(flags & P_SAFE))
793	update_now = 1;
794
795	if ((move_on | op->move_on) != move_on)	725	|| (m.move_on | op->move_on ) != m.move_on
796	update_now = 1;
797
798	if ((move_off | op->move_off) != move_off)	726	|| (m.move_off | op->move_off ) != m.move_off
799	update_now = 1;	727	|| (m.move_slow | op->move_slow) != m.move_slow
800
801	/* This isn't perfect, but I don't expect a lot of objects to	728	/* This isn't perfect, but I don't expect a lot of objects to
802	* to have move_allow right now.	729	* to have move_allow right now.
803	*/	730	*/
804	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	731	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
805	update_now = 1;	732	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
806		733	m.flags_ = 0;
807	if ((move_slow | op->move_slow) != move_slow)
808	update_now = 1;
809	}	734	}
810
811	/* if the object is being removed, we can't make intelligent	735	/* if the object is being removed, we can't make intelligent
812	* decisions, because remove_ob can't really pass the object	736	* decisions, because remove_ob can't really pass the object
813	* that is being removed.	737	* that is being removed.
814	*/	738	*/
815	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	739	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
816	update_now = 1;	740	m.flags_ = 0;
817	else if (action == UP_OBJ_FACE)	741	else if (action == UP_OBJ_FACE)
818	/* Nothing to do for that case */ ;	742	/* Nothing to do for that case */ ;
819	else	743	else
820	LOG (llevError, "update_object called with invalid action: %d\n", action);	744	LOG (llevError, "update_object called with invalid action: %d\n", action);
821		745
822	if (update_now)
823	{
824	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
825	update_position (op->map, op->x, op->y);
826	}
827
828	if (op->more != NULL)	746	if (op->more)
829	update_object (op->more, action);	747	update_object (op->more, action);
830	}
831
832	object::vector object::mortals;
833	object::vector object::objects; // not yet used
834	object *object::first;
835
836	void object::free_mortals ()
837	{
838	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
839	if ((*i)->refcnt)
840	++i; // further delay freeing
841	else
842	{
843	delete *i;
844	mortals.erase (i);
845	}
846	}	748	}
847		749
848	object::object ()	750	object::object ()
849	{	751	{
850	SET_FLAG (this, FLAG_REMOVED);	752	SET_FLAG (this, FLAG_REMOVED);
…		…
853	face = blank_face;	755	face = blank_face;
854	}	756	}
855		757
856	object::~object ()	758	object::~object ()
857	{	759	{
		760	unlink ();
		761
858	free_key_values (this);	762	free_key_values (this);
859	}	763	}
860		764
		765	static int object_count;
		766
861	void object::link ()	767	void object::link ()
862	{	768	{
863	count = ++ob_count;	769	assert (!index);//D
864	uuid = gen_uuid ();	770	uuid = gen_uuid ();
		771	count = ++object_count;
865		772
866	prev = 0;	773	refcnt_inc ();
867	next = object::first;	774	objects.insert (this);
868
869	if (object::first)
870	object::first->prev = this;
871
872	object::first = this;
873	}	775	}
874		776
875	void object::unlink ()	777	void object::unlink ()
876	{	778	{
877	if (this == object::first)	779	if (!index)
878	object::first = next;	780	return;
879		781
880	/* Remove this object from the list of used objects */	782	objects.erase (this);
881	if (prev) prev->next = next;	783	refcnt_dec ();
882	if (next) next->prev = prev;	784	}
883		785
884	prev = 0;	786	void
885	next = 0;	787	object::activate ()
		788	{
		789	/* If already on active list, don't do anything */
		790	if (active)
		791	return;
		792
		793	if (has_active_speed ())
		794	actives.insert (this);
		795	}
		796
		797	void
		798	object::activate_recursive ()
		799	{
		800	activate ();
		801
		802	for (object *op = inv; op; op = op->below)
		803	op->activate_recursive ();
		804	}
		805
		806	/* This function removes object 'op' from the list of active
		807	* objects.
		808	* This should only be used for style maps or other such
		809	* reference maps where you don't want an object that isn't
		810	* in play chewing up cpu time getting processed.
		811	* The reverse of this is to call update_ob_speed, which
		812	* will do the right thing based on the speed of the object.
		813	*/
		814	void
		815	object::deactivate ()
		816	{
		817	/* If not on the active list, nothing needs to be done */
		818	if (!active)
		819	return;
		820
		821	actives.erase (this);
		822	}
		823
		824	void
		825	object::deactivate_recursive ()
		826	{
		827	for (object *op = inv; op; op = op->below)
		828	op->deactivate_recursive ();
		829
		830	deactivate ();
		831	}
		832
		833	void
		834	object::set_flag_inv (int flag, int value)
		835	{
		836	for (object *op = inv; op; op = op->below)
		837	{
		838	op->flag [flag] = value;
		839	op->set_flag_inv (flag, value);
		840	}
		841	}
		842
		843	/*
		844	* Remove and free all objects in the inventory of the given object.
		845	* object.c ?
		846	*/
		847	void
		848	object::destroy_inv (bool drop_to_ground)
		849	{
		850	// need to check first, because the checks below might segfault
		851	// as we might be on an invalid mapspace and crossfire code
		852	// is too buggy to ensure that the inventory is empty.
		853	// corollary: if you create arrows etc. with stuff in tis inventory,
		854	// cf will crash below with off-map x and y
		855	if (!inv)
		856	return;
		857
		858	/* Only if the space blocks everything do we not process -
		859	* if some form of movement is allowed, let objects
		860	* drop on that space.
		861	*/
		862	if (!drop_to_ground
		863	|| !map
		864	|| map->in_memory != MAP_IN_MEMORY
		865	|| map->nodrop
		866	|| ms ().move_block == MOVE_ALL)
		867	{
		868	while (inv)
		869	{
		870	inv->destroy_inv (drop_to_ground);
		871	inv->destroy ();
		872	}
		873	}
		874	else
		875	{ /* Put objects in inventory onto this space */
		876	while (inv)
		877	{
		878	object *op = inv;
		879
		880	if (op->flag [FLAG_STARTEQUIP]
		881	|| op->flag [FLAG_NO_DROP]
		882	|| op->type == RUNE
		883	|| op->type == TRAP
		884	|| op->flag [FLAG_IS_A_TEMPLATE]
		885	|| op->flag [FLAG_DESTROY_ON_DEATH])
		886	op->destroy ();
		887	else
		888	map->insert (op, x, y);
		889	}
		890	}
886	}	891	}
887		892
888	object *object::create ()	893	object *object::create ()
889	{	894	{
890	object *op = new object;	895	object *op = new object;
891	op->link ();	896	op->link ();
892	return op;	897	return op;
893	}	898	}
894		899
895	/*	900	void
896	* free_object() frees everything allocated by an object, removes	901	object::do_destroy ()
897	* it from the list of used objects, and puts it on the list of
898	* free objects. The IS_FREED() flag is set in the object.
899	* The object must have been removed by remove_ob() first for
900	* this function to succeed.
901	*
902	* If destroy_inventory is set, free inventory as well. Else drop items in
903	* inventory to the ground.
904	*/
905	void object::destroy (bool destroy_inventory)
906	{	902	{
907	if (QUERY_FLAG (this, FLAG_FREED))	903	attachable::do_destroy ();
908	return;
909		904
910	if (QUERY_FLAG (this, FLAG_FRIENDLY))	905	if (flag [FLAG_IS_LINKED])
		906	remove_button_link (this);
		907
		908	if (flag [FLAG_FRIENDLY])
911	remove_friendly_object (this);	909	remove_friendly_object (this);
912		910
913	if (!QUERY_FLAG (this, FLAG_REMOVED))	911	if (!flag [FLAG_REMOVED])
914	remove ();	912	remove ();
915		913
916	SET_FLAG (this, FLAG_FREED);	914	destroy_inv (true);
917		915
918	if (more)	916	deactivate ();
919	{	917	unlink ();
920	more->destroy (destroy_inventory);
921	more = 0;
922	}
923		918
924	if (inv)	919	flag [FLAG_FREED] = 1;
925	{
926	/* Only if the space blocks everything do we not process -
927	* if some form of movement is allowed, let objects
928	* drop on that space.
929	*/
930	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
931	{
932	object *op = inv;
933
934	while (op)
935	{
936	object *tmp = op->below;
937	op->destroy (destroy_inventory);
938	op = tmp;
939	}
940	}
941	else
942	{ /* Put objects in inventory onto this space */
943	object *op = inv;
944
945	while (op)
946	{
947	object *tmp = op->below;
948
949	op->remove ();
950
951	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
952	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
953	op->destroy (0);
954	else
955	{
956	op->x = x;
957	op->y = y;
958	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
959	}
960
961	op = tmp;
962	}
963	}
964	}
965		920
966	// hack to ensure that freed objects still have a valid map	921	// hack to ensure that freed objects still have a valid map
967	{	922	{
968	static maptile *freed_map; // freed objects are moved here to avoid crashes	923	static maptile *freed_map; // freed objects are moved here to avoid crashes
969		924
…		…
973		928
974	freed_map->name = "/internal/freed_objects_map";	929	freed_map->name = "/internal/freed_objects_map";
975	freed_map->width = 3;	930	freed_map->width = 3;
976	freed_map->height = 3;	931	freed_map->height = 3;
977		932
978	freed_map->allocate ();	933	freed_map->alloc ();
		934	freed_map->in_memory = MAP_IN_MEMORY;
979	}	935	}
980		936
981	map = freed_map;	937	map = freed_map;
982	x = 1;	938	x = 1;
983	y = 1;	939	y = 1;
984	}	940	}
985		941
		942	head = 0;
		943
		944	if (more)
		945	{
		946	more->destroy ();
		947	more = 0;
		948	}
		949
986	// clear those pointers that likely might have circular references to us	950	// clear those pointers that likely might have circular references to us
987	owner = 0;	951	owner = 0;
988	enemy = 0;	952	enemy = 0;
989	attacked_by = 0;	953	attacked_by = 0;
		954	}
990		955
991	// only relevant for players(?), but make sure of it anyways	956	void
992	contr = 0;	957	object::destroy (bool destroy_inventory)
		958	{
		959	if (destroyed ())
		960	return;
993		961
994	/* Remove object from the active list */	962	if (destroy_inventory)
995	speed = 0;	963	destroy_inv (false);
996	update_ob_speed (this);
997		964
998	unlink ();	965	attachable::destroy ();
999
1000	mortals.push_back (this);
1001	}	966	}
1002		967
1003	/*	968	/*
1004	* sub_weight() recursively (outwards) subtracts a number from the	969	* sub_weight() recursively (outwards) subtracts a number from the
1005	* weight of an object (and what is carried by it's environment(s)).	970	* weight of an object (and what is carried by it's environment(s)).
…		…
1021	* This function removes the object op from the linked list of objects	986	* This function removes the object op from the linked list of objects
1022	* which it is currently tied to. When this function is done, the	987	* which it is currently tied to. When this function is done, the
1023	* object will have no environment. If the object previously had an	988	* object will have no environment. If the object previously had an
1024	* environment, the x and y coordinates will be updated to	989	* environment, the x and y coordinates will be updated to
1025	* the previous environment.	990	* the previous environment.
1026	* Beware: This function is called from the editor as well!
1027	*/	991	*/
1028	void	992	void
1029	object::remove ()	993	object::do_remove ()
1030	{	994	{
1031	object *tmp, *last = 0;	995	object *tmp, *last = 0;
1032	object *otmp;	996	object *otmp;
1033		997
1034	int check_walk_off;
1035
1036	if (QUERY_FLAG (this, FLAG_REMOVED))	998	if (QUERY_FLAG (this, FLAG_REMOVED))
1037	return;	999	return;
1038		1000
1039	SET_FLAG (this, FLAG_REMOVED);	1001	SET_FLAG (this, FLAG_REMOVED);
		1002	INVOKE_OBJECT (REMOVE, this);
1040		1003
1041	if (more)	1004	if (more)
1042	more->remove ();	1005	more->remove ();
1043		1006
1044	/*	1007	/*
…		…
1054		1017
1055	/* NO_FIX_PLAYER is set when a great many changes are being	1018	/* NO_FIX_PLAYER is set when a great many changes are being
1056	* made to players inventory. If set, avoiding the call	1019	* made to players inventory. If set, avoiding the call
1057	* to save cpu time.	1020	* to save cpu time.
1058	*/	1021	*/
1059	if ((otmp = is_player_inv (env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1022	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1060	fix_player (otmp);	1023	otmp->update_stats ();
1061		1024
1062	if (above != NULL)	1025	if (above)
1063	above->below = below;	1026	above->below = below;
1064	else	1027	else
1065	env->inv = below;	1028	env->inv = below;
1066		1029
1067	if (below != NULL)	1030	if (below)
1068	below->above = above;	1031	below->above = above;
1069		1032
1070	/* we set up values so that it could be inserted into	1033	/* we set up values so that it could be inserted into
1071	* the map, but we don't actually do that - it is up	1034	* the map, but we don't actually do that - it is up
1072	* to the caller to decide what we want to do.	1035	* to the caller to decide what we want to do.
…		…
1076	above = 0, below = 0;	1039	above = 0, below = 0;
1077	env = 0;	1040	env = 0;
1078	}	1041	}
1079	else if (map)	1042	else if (map)
1080	{	1043	{
1081	/* Re did the following section of code - it looks like it had	1044	if (type == PLAYER)
1082	* lots of logic for things we no longer care about
1083	*/	1045	{
		1046	// leaving a spot always closes any open container on the ground
		1047	if (container && !container->env)
		1048	// this causes spurious floorbox updates, but it ensures
		1049	// that the CLOSE event is being sent.
		1050	close_container ();
		1051
		1052	--map->players;
		1053	map->touch ();
		1054	}
		1055
		1056	map->dirty = true;
		1057	mapspace &ms = this->ms ();
1084		1058
1085	/* link the object above us */	1059	/* link the object above us */
1086	if (above)	1060	if (above)
1087	above->below = below;	1061	above->below = below;
1088	else	1062	else
1089	SET_MAP_TOP (map, x, y, below); /* we were top, set new top */	1063	ms.top = below; /* we were top, set new top */
1090		1064
1091	/* Relink the object below us, if there is one */	1065	/* Relink the object below us, if there is one */
1092	if (below)	1066	if (below)
1093	below->above = above;	1067	below->above = above;
1094	else	1068	else
…		…
1096	/* Nothing below, which means we need to relink map object for this space	1070	/* Nothing below, which means we need to relink map object for this space
1097	* use translated coordinates in case some oddness with map tiling is	1071	* use translated coordinates in case some oddness with map tiling is
1098	* evident	1072	* evident
1099	*/	1073	*/
1100	if (GET_MAP_OB (map, x, y) != this)	1074	if (GET_MAP_OB (map, x, y) != this)
1101	{
1102	char *dump = dump_object (this);
1103	LOG (llevError,
1104	"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump);	1075	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 ());
1105	free (dump);
1106	dump = dump_object (GET_MAP_OB (map, x, y));
1107	LOG (llevError, "%s\n", dump);
1108	free (dump);
1109	}
1110		1076
1111	SET_MAP_OB (map, x, y, above); /* goes on above it. */	1077	ms.bot = above; /* goes on above it. */
1112	}	1078	}
1113		1079
1114	above = 0;	1080	above = 0;
1115	below = 0;	1081	below = 0;
1116		1082
1117	if (map->in_memory == MAP_SAVING)	1083	if (map->in_memory == MAP_SAVING)
1118	return;	1084	return;
1119		1085
1120	check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);	1086	int check_walk_off = !flag [FLAG_NO_APPLY];
1121		1087
1122	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	1088	for (tmp = ms.bot; tmp; tmp = tmp->above)
1123	{	1089	{
1124	/* No point updating the players look faces if he is the object	1090	/* No point updating the players look faces if he is the object
1125	* being removed.	1091	* being removed.
1126	*/	1092	*/
1127		1093
…		…
1131	* removed (most likely destroyed), update the player view	1097	* removed (most likely destroyed), update the player view
1132	* appropriately.	1098	* appropriately.
1133	*/	1099	*/
1134	if (tmp->container == this)	1100	if (tmp->container == this)
1135	{	1101	{
1136	CLEAR_FLAG (this, FLAG_APPLIED);	1102	flag [FLAG_APPLIED] = 0;
1137	tmp->container = 0;	1103	tmp->container = 0;
1138	}	1104	}
1139		1105
1140	tmp->contr->socket.update_look = 1;	1106	if (tmp->contr->ns)
		1107	tmp->contr->ns->floorbox_update ();
1141	}	1108	}
1142		1109
1143	/* See if player moving off should effect something */	1110	/* See if object moving off should effect something */
1144	if (check_walk_off	1111	if (check_walk_off
1145	&& ((move_type & tmp->move_off)	1112	&& ((move_type & tmp->move_off)
1146	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1113	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1147	{	1114	{
1148	move_apply (tmp, this, 0);	1115	move_apply (tmp, this, 0);
…		…
1150	if (destroyed ())	1117	if (destroyed ())
1151	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1118	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1152	}	1119	}
1153		1120
1154	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1121	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1155		1122	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1156	if (tmp->above == tmp)	1123	if (tmp->above == tmp)
1157	tmp->above = 0;	1124	tmp->above = 0;
1158		1125
1159	last = tmp;	1126	last = tmp;
1160	}	1127	}
1161		1128
1162	/* last == NULL of there are no objects on this space */	1129	/* last == NULL if there are no objects on this space */
		1130	//TODO: this makes little sense, why only update the topmost object?
1163	if (!last)	1131	if (!last)
1164	{	1132	map->at (x, y).flags_ = 0;
1165	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1166	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1167	* those out anyways, and if there are any flags set right now, they won't
1168	* be correct anyways.
1169	*/
1170	SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE);
1171	update_position (map, x, y);
1172	}
1173	else	1133	else
1174	update_object (last, UP_OBJ_REMOVE);	1134	update_object (last, UP_OBJ_REMOVE);
1175		1135
1176	if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)	1136	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1177	update_all_los (map, x, y);	1137	update_all_los (map, x, y);
1178	}	1138	}
1179	}	1139	}
1180		1140
1181	/*	1141	/*
…		…
1190	merge_ob (object *op, object *top)	1150	merge_ob (object *op, object *top)
1191	{	1151	{
1192	if (!op->nrof)	1152	if (!op->nrof)
1193	return 0;	1153	return 0;
1194		1154
1195	if (top == NULL)	1155	if (top)
1196	for (top = op; top != NULL && top->above != NULL; top = top->above);	1156	for (top = op; top && top->above; top = top->above)
		1157	;
1197		1158
1198	for (; top != NULL; top = top->below)	1159	for (; top; top = top->below)
1199	{	1160	{
1200	if (top == op)	1161	if (top == op)
1201	continue;	1162	continue;
1202	if (CAN_MERGE (op, top))	1163
		1164	if (object::can_merge (op, top))
1203	{	1165	{
1204	top->nrof += op->nrof;	1166	top->nrof += op->nrof;
1205		1167
1206	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1168	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1207	op->weight = 0; /* Don't want any adjustements now */	1169	op->weight = 0; /* Don't want any adjustements now */
1208	op->remove ();
1209	op->destroy (0);	1170	op->destroy ();
1210	return top;	1171	return top;
1211	}	1172	}
1212	}	1173	}
1213		1174
1214	return 0;	1175	return 0;
1215	}	1176	}
1216		1177
		1178	void
		1179	object::expand_tail ()
		1180	{
		1181	if (more)
		1182	return;
		1183
		1184	object *prev = this;
		1185
		1186	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1187	{
		1188	object *op = arch_to_object (at);
		1189
		1190	op->name = name;
		1191	op->name_pl = name_pl;
		1192	op->title = title;
		1193
		1194	op->head = this;
		1195	prev->more = op;
		1196
		1197	prev = op;
		1198	}
		1199	}
		1200
1217	/*	1201	/*
1218	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1202	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1219	* job preparing multi-part monsters	1203	* job preparing multi-part monsters.
1220	*/	1204	*/
1221	object *	1205	object *
1222	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1206	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1223	{	1207	{
1224	object *tmp;
1225
1226	if (op->head)
1227	op = op->head;
1228
1229	for (tmp = op; tmp; tmp = tmp->more)	1208	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1230	{	1209	{
1231	tmp->x = x + tmp->arch->clone.x;	1210	tmp->x = x + tmp->arch->x;
1232	tmp->y = y + tmp->arch->clone.y;	1211	tmp->y = y + tmp->arch->y;
1233	}	1212	}
1234		1213
1235	return insert_ob_in_map (op, m, originator, flag);	1214	return insert_ob_in_map (op, m, originator, flag);
1236	}	1215	}
1237		1216
…		…
1253	* Return value:	1232	* Return value:
1254	* new object if 'op' was merged with other object	1233	* new object if 'op' was merged with other object
1255	* NULL if 'op' was destroyed	1234	* NULL if 'op' was destroyed
1256	* just 'op' otherwise	1235	* just 'op' otherwise
1257	*/	1236	*/
1258
1259	object *	1237	object *
1260	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1238	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1261	{	1239	{
		1240	assert (!op->flag [FLAG_FREED]);
		1241
1262	object *tmp, *top, *floor = NULL;	1242	object *top, *floor = NULL;
1263	sint16 x, y;
1264		1243
1265	if (QUERY_FLAG (op, FLAG_FREED))	1244	op->remove ();
1266	{
1267	LOG (llevError, "Trying to insert freed object!\n");
1268	return NULL;
1269	}
1270		1245
1271	if (m == NULL)	1246	#if 0
1272	{	1247	if (!m->active != !op->active)
1273	char *dump = dump_object (op);	1248	if (m->active)
1274	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1249	op->activate_recursive ();
1275	free (dump);	1250	else
1276	return op;	1251	op->deactivate_recursive ();
1277	}	1252	#endif
1278		1253
1279	if (out_of_map (m, op->x, op->y))	1254	if (out_of_map (m, op->x, op->y))
1280	{	1255	{
1281	char *dump = dump_object (op);
1282	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);	1256	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1283	#ifdef MANY_CORES	1257	#ifdef MANY_CORES
1284	/* Better to catch this here, as otherwise the next use of this object	1258	/* Better to catch this here, as otherwise the next use of this object
1285	* is likely to cause a crash. Better to find out where it is getting	1259	* is likely to cause a crash. Better to find out where it is getting
1286	* improperly inserted.	1260	* improperly inserted.
1287	*/	1261	*/
1288	abort ();	1262	abort ();
1289	#endif	1263	#endif
1290	free (dump);
1291	return op;	1264	return op;
1292	}	1265	}
1293		1266
1294	if (!QUERY_FLAG (op, FLAG_REMOVED))	1267	if (object *more = op->more)
1295	{	1268	if (!insert_ob_in_map (more, m, originator, flag))
1296	char *dump = dump_object (op);
1297	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1298	free (dump);
1299	return op;	1269	return 0;
1300	}
1301
1302	if (op->more != NULL)
1303	{
1304	/* The part may be on a different map. */
1305
1306	object *more = op->more;
1307
1308	/* We really need the caller to normalize coordinates - if
1309	* we set the map, that doesn't work if the location is within
1310	* a map and this is straddling an edge. So only if coordinate
1311	* is clear wrong do we normalize it.
1312	*/
1313	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1314	more->map = get_map_from_coord (m, &more->x, &more->y);
1315	else if (!more->map)
1316	{
1317	/* For backwards compatibility - when not dealing with tiled maps,
1318	* more->map should always point to the parent.
1319	*/
1320	more->map = m;
1321	}
1322
1323	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1324	{
1325	if (!op->head)
1326	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1327
1328	return NULL;
1329	}
1330	}
1331		1270
1332	CLEAR_FLAG (op, FLAG_REMOVED);	1271	CLEAR_FLAG (op, FLAG_REMOVED);
1333		1272
1334	/* Ideally, the caller figures this out. However, it complicates a lot	1273	/* Ideally, the caller figures this out. However, it complicates a lot
1335	* of areas of callers (eg, anything that uses find_free_spot would now	1274	* of areas of callers (eg, anything that uses find_free_spot would now
1336	* need extra work	1275	* need extra work
1337	*/	1276	*/
1338	op->map = get_map_from_coord (m, &op->x, &op->y);	1277	if (!xy_normalise (m, op->x, op->y))
1339	x = op->x;	1278	return 0;
1340	y = op->y;	1279
		1280	op->map = m;
		1281	mapspace &ms = op->ms ();
1341		1282
1342	/* this has to be done after we translate the coordinates.	1283	/* this has to be done after we translate the coordinates.
1343	*/	1284	*/
1344	if (op->nrof && !(flag & INS_NO_MERGE))	1285	if (op->nrof && !(flag & INS_NO_MERGE))
1345	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1286	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1346	if (CAN_MERGE (op, tmp))	1287	if (object::can_merge (op, tmp))
1347	{	1288	{
1348	op->nrof += tmp->nrof;	1289	op->nrof += tmp->nrof;
1349	tmp->remove ();
1350	tmp->destroy (0);	1290	tmp->destroy ();
1351	}	1291	}
1352		1292
1353	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1293	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1354	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1294	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1355		1295
…		…
1368	op->below = originator->below;	1308	op->below = originator->below;
1369		1309
1370	if (op->below)	1310	if (op->below)
1371	op->below->above = op;	1311	op->below->above = op;
1372	else	1312	else
1373	SET_MAP_OB (op->map, op->x, op->y, op);	1313	ms.bot = op;
1374		1314
1375	/* since *below* originator, no need to update top */	1315	/* since *below* originator, no need to update top */
1376	originator->below = op;	1316	originator->below = op;
1377	}	1317	}
1378	else	1318	else
1379	{	1319	{
		1320	top = ms.bot;
		1321
1380	/* If there are other objects, then */	1322	/* If there are other objects, then */
1381	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1323	if ((!(flag & INS_MAP_LOAD)) && top)
1382	{	1324	{
1383	object *last = NULL;	1325	object *last = 0;
1384		1326
1385	/*	1327	/*
1386	* If there are multiple objects on this space, we do some trickier handling.	1328	* If there are multiple objects on this space, we do some trickier handling.
1387	* We've already dealt with merging if appropriate.	1329	* We've already dealt with merging if appropriate.
1388	* Generally, we want to put the new object on top. But if	1330	* Generally, we want to put the new object on top. But if
…		…
1392	* once we get to them. This reduces the need to traverse over all of	1334	* once we get to them. This reduces the need to traverse over all of
1393	* them when adding another one - this saves quite a bit of cpu time	1335	* them when adding another one - this saves quite a bit of cpu time
1394	* when lots of spells are cast in one area. Currently, it is presumed	1336	* when lots of spells are cast in one area. Currently, it is presumed
1395	* that flying non pickable objects are spell objects.	1337	* that flying non pickable objects are spell objects.
1396	*/	1338	*/
1397		1339	for (top = ms.bot; top; top = top->above)
1398	while (top != NULL)
1399	{	1340	{
1400	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1341	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1401	floor = top;	1342	floor = top;
1402		1343
1403	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1344	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1406	top = top->below;	1347	top = top->below;
1407	break;	1348	break;
1408	}	1349	}
1409		1350
1410	last = top;	1351	last = top;
1411	top = top->above;
1412	}	1352	}
1413		1353
1414	/* Don't want top to be NULL, so set it to the last valid object */	1354	/* Don't want top to be NULL, so set it to the last valid object */
1415	top = last;	1355	top = last;
1416		1356
…		…
1418	* looks like instead of lots of conditions here.	1358	* looks like instead of lots of conditions here.
1419	* makes things faster, and effectively the same result.	1359	* makes things faster, and effectively the same result.
1420	*/	1360	*/
1421		1361
1422	/* Have object 'fall below' other objects that block view.	1362	/* Have object 'fall below' other objects that block view.
1423	* Unless those objects are exits, type 66	1363	* Unless those objects are exits.
1424	* If INS_ON_TOP is used, don't do this processing	1364	* If INS_ON_TOP is used, don't do this processing
1425	* Need to find the object that in fact blocks view, otherwise	1365	* Need to find the object that in fact blocks view, otherwise
1426	* stacking is a bit odd.	1366	* stacking is a bit odd.
1427	*/	1367	*/
1428	if (!(flag & INS_ON_TOP) &&	1368	if (!(flag & INS_ON_TOP)
1429	(get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1369	&& ms.flags () & P_BLOCKSVIEW
		1370	&& (op->face && !faces [op->face].visibility))
1430	{	1371	{
1431	for (last = top; last != floor; last = last->below)	1372	for (last = top; last != floor; last = last->below)
1432	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1373	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1433	break;	1374	break;
		1375
1434	/* Check to see if we found the object that blocks view,	1376	/* Check to see if we found the object that blocks view,
1435	* and make sure we have a below pointer for it so that	1377	* and make sure we have a below pointer for it so that
1436	* we can get inserted below this one, which requires we	1378	* we can get inserted below this one, which requires we
1437	* set top to the object below us.	1379	* set top to the object below us.
1438	*/	1380	*/
…		…
1440	top = last->below;	1382	top = last->below;
1441	}	1383	}
1442	} /* If objects on this space */	1384	} /* If objects on this space */
1443		1385
1444	if (flag & INS_MAP_LOAD)	1386	if (flag & INS_MAP_LOAD)
1445	top = GET_MAP_TOP (op->map, op->x, op->y);	1387	top = ms.top;
1446		1388
1447	if (flag & INS_ABOVE_FLOOR_ONLY)	1389	if (flag & INS_ABOVE_FLOOR_ONLY)
1448	top = floor;	1390	top = floor;
1449		1391
1450	/* Top is the object that our object (op) is going to get inserted above.	1392	/* Top is the object that our object (op) is going to get inserted above.
1451	*/	1393	*/
1452		1394
1453	/* First object on this space */	1395	/* First object on this space */
1454	if (!top)	1396	if (!top)
1455	{	1397	{
1456	op->above = GET_MAP_OB (op->map, op->x, op->y);	1398	op->above = ms.bot;
1457		1399
1458	if (op->above)	1400	if (op->above)
1459	op->above->below = op;	1401	op->above->below = op;
1460		1402
1461	op->below = NULL;	1403	op->below = 0;
1462	SET_MAP_OB (op->map, op->x, op->y, op);	1404	ms.bot = op;
1463	}	1405	}
1464	else	1406	else
1465	{ /* get inserted into the stack above top */	1407	{ /* get inserted into the stack above top */
1466	op->above = top->above;	1408	op->above = top->above;
1467		1409
…		…
1470		1412
1471	op->below = top;	1413	op->below = top;
1472	top->above = op;	1414	top->above = op;
1473	}	1415	}
1474		1416
1475	if (op->above == NULL)	1417	if (!op->above)
1476	SET_MAP_TOP (op->map, op->x, op->y, op);	1418	ms.top = op;
1477	} /* else not INS_BELOW_ORIGINATOR */	1419	} /* else not INS_BELOW_ORIGINATOR */
1478		1420
1479	if (op->type == PLAYER)	1421	if (op->type == PLAYER)
		1422	{
1480	op->contr->do_los = 1;	1423	op->contr->do_los = 1;
		1424	++op->map->players;
		1425	op->map->touch ();
		1426	}
		1427
		1428	op->map->dirty = true;
1481		1429
1482	/* If we have a floor, we know the player, if any, will be above	1430	/* If we have a floor, we know the player, if any, will be above
1483	* it, so save a few ticks and start from there.	1431	* it, so save a few ticks and start from there.
1484	*/	1432	*/
1485	if (!(flag & INS_MAP_LOAD))	1433	if (!(flag & INS_MAP_LOAD))
1486	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1434	if (object *pl = ms.player ())
1487	if (tmp->type == PLAYER)	1435	if (pl->contr->ns)
1488	tmp->contr->socket.update_look = 1;	1436	pl->contr->ns->floorbox_update ();
1489		1437
1490	/* If this object glows, it may affect lighting conditions that are	1438	/* If this object glows, it may affect lighting conditions that are
1491	* visible to others on this map. But update_all_los is really	1439	* visible to others on this map. But update_all_los is really
1492	* an inefficient way to do this, as it means los for all players	1440	* an inefficient way to do this, as it means los for all players
1493	* on the map will get recalculated. The players could very well	1441	* on the map will get recalculated. The players could very well
1494	* be far away from this change and not affected in any way -	1442	* be far away from this change and not affected in any way -
1495	* this should get redone to only look for players within range,	1443	* this should get redone to only look for players within range,
1496	* or just updating the P_NEED_UPDATE for spaces within this area	1444	* or just updating the P_UPTODATE for spaces within this area
1497	* of effect may be sufficient.	1445	* of effect may be sufficient.
1498	*/	1446	*/
1499	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1447	if (op->map->darkness && (op->glow_radius != 0))
1500	update_all_los (op->map, op->x, op->y);	1448	update_all_los (op->map, op->x, op->y);
1501		1449
1502	/* updates flags (blocked, alive, no magic, etc) for this map space */	1450	/* updates flags (blocked, alive, no magic, etc) for this map space */
1503	update_object (op, UP_OBJ_INSERT);	1451	update_object (op, UP_OBJ_INSERT);
1504		1452
		1453	INVOKE_OBJECT (INSERT, op);
		1454
1505	/* Don't know if moving this to the end will break anything. However,	1455	/* Don't know if moving this to the end will break anything. However,
1506	* we want to have update_look set above before calling this.	1456	* we want to have floorbox_update called before calling this.
1507	*	1457	*
1508	* check_move_on() must be after this because code called from	1458	* check_move_on() must be after this because code called from
1509	* check_move_on() depends on correct map flags (so functions like	1459	* check_move_on() depends on correct map flags (so functions like
1510	* blocked() and wall() work properly), and these flags are updated by	1460	* blocked() and wall() work properly), and these flags are updated by
1511	* update_object().	1461	* update_object().
1512	*/	1462	*/
1513		1463
1514	/* if this is not the head or flag has been passed, don't check walk on status */	1464	/* if this is not the head or flag has been passed, don't check walk on status */
1515	if (!(flag & INS_NO_WALK_ON) && !op->head)	1465	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1516	{	1466	{
1517	if (check_move_on (op, originator))	1467	if (check_move_on (op, originator))
1518	return NULL;	1468	return 0;
1519		1469
1520	/* If we are a multi part object, lets work our way through the check	1470	/* If we are a multi part object, lets work our way through the check
1521	* walk on's.	1471	* walk on's.
1522	*/	1472	*/
1523	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1473	for (object *tmp = op->more; tmp; tmp = tmp->more)
1524	if (check_move_on (tmp, originator))	1474	if (check_move_on (tmp, originator))
1525	return NULL;	1475	return 0;
1526	}	1476	}
1527		1477
1528	return op;	1478	return op;
1529	}	1479	}
1530		1480
1531	/* this function inserts an object in the map, but if it	1481	/* this function inserts an object in the map, but if it
1532	* finds an object of its own type, it'll remove that one first.	1482	* finds an object of its own type, it'll remove that one first.
1533	* op is the object to insert it under: supplies x and the map.	1483	* op is the object to insert it under: supplies x and the map.
1534	*/	1484	*/
1535	void	1485	void
1536	replace_insert_ob_in_map (const char *arch_string, object *op)	1486	replace_insert_ob_in_map (const char *arch_string, object *op)
1537	{	1487	{
1538	object *	1488	object *tmp, *tmp1;
1539	tmp;
1540	object *
1541	tmp1;
1542		1489
1543	/* first search for itself and remove any old instances */	1490	/* first search for itself and remove any old instances */
1544		1491
1545	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1492	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1546	{
1547	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1493	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1548	{
1549	tmp->remove ();
1550	tmp->destroy (0);	1494	tmp->destroy ();
1551	}
1552	}
1553		1495
1554	tmp1 = arch_to_object (archetype::find (arch_string));	1496	tmp1 = arch_to_object (archetype::find (arch_string));
1555		1497
1556	tmp1->x = op->x;	1498	tmp1->x = op->x;
1557	tmp1->y = op->y;	1499	tmp1->y = op->y;
1558	insert_ob_in_map (tmp1, op->map, op, 0);	1500	insert_ob_in_map (tmp1, op->map, op, 0);
		1501	}
		1502
		1503	object *
		1504	object::insert_at (object *where, object *originator, int flags)
		1505	{
		1506	return where->map->insert (this, where->x, where->y, originator, flags);
1559	}	1507	}
1560		1508
1561	/*	1509	/*
1562	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1510	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1563	* is returned contains nr objects, and the remaining parts contains	1511	* is returned contains nr objects, and the remaining parts contains
1564	* the rest (or is removed and freed if that number is 0).	1512	* the rest (or is removed and freed if that number is 0).
1565	* On failure, NULL is returned, and the reason put into the	1513	* On failure, NULL is returned, and the reason put into the
1566	* global static errmsg array.	1514	* global static errmsg array.
1567	*/	1515	*/
1568
1569	object *	1516	object *
1570	get_split_ob (object *orig_ob, uint32 nr)	1517	get_split_ob (object *orig_ob, uint32 nr)
1571	{	1518	{
1572	object *	1519	object *newob;
1573	newob;
1574	int
1575	is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1520	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1576		1521
1577	if (orig_ob->nrof < nr)	1522	if (orig_ob->nrof < nr)
1578	{	1523	{
1579	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);	1524	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1580	return NULL;	1525	return NULL;
…		…
1606	* the amount of an object. If the amount reaches 0, the object	1551	* the amount of an object. If the amount reaches 0, the object
1607	* is subsequently removed and freed.	1552	* is subsequently removed and freed.
1608	*	1553	*
1609	* Return value: 'op' if something is left, NULL if the amount reached 0	1554	* Return value: 'op' if something is left, NULL if the amount reached 0
1610	*/	1555	*/
1611
1612	object *	1556	object *
1613	decrease_ob_nr (object *op, uint32 i)	1557	decrease_ob_nr (object *op, uint32 i)
1614	{	1558	{
1615	object *tmp;	1559	object *tmp;
1616	player *pl;
1617		1560
1618	if (i == 0) /* objects with op->nrof require this check */	1561	if (i == 0) /* objects with op->nrof require this check */
1619	return op;	1562	return op;
1620		1563
1621	if (i > op->nrof)	1564	if (i > op->nrof)
1622	i = op->nrof;	1565	i = op->nrof;
1623		1566
1624	if (QUERY_FLAG (op, FLAG_REMOVED))	1567	if (QUERY_FLAG (op, FLAG_REMOVED))
1625	op->nrof -= i;	1568	op->nrof -= i;
1626	else if (op->env != NULL)	1569	else if (op->env)
1627	{	1570	{
1628	/* is this object in the players inventory, or sub container	1571	/* is this object in the players inventory, or sub container
1629	* therein?	1572	* therein?
1630	*/	1573	*/
1631	tmp = is_player_inv (op->env);	1574	tmp = op->in_player ();
1632	/* nope. Is this a container the player has opened?	1575	/* nope. Is this a container the player has opened?
1633	* If so, set tmp to that player.	1576	* If so, set tmp to that player.
1634	* IMO, searching through all the players will mostly	1577	* IMO, searching through all the players will mostly
1635	* likely be quicker than following op->env to the map,	1578	* likely be quicker than following op->env to the map,
1636	* and then searching the map for a player.	1579	* and then searching the map for a player.
1637	*/	1580	*/
1638	if (!tmp)	1581	if (!tmp)
1639	{	1582	for_all_players (pl)
1640	for (pl = first_player; pl; pl = pl->next)
1641	if (pl->ob->container == op->env)	1583	if (pl->ob->container == op->env)
		1584	{
		1585	tmp = pl->ob;
1642	break;	1586	break;
1643	if (pl)
1644	tmp = pl->ob;
1645	else
1646	tmp = NULL;
1647	}	1587	}
1648		1588
1649	if (i < op->nrof)	1589	if (i < op->nrof)
1650	{	1590	{
1651	sub_weight (op->env, op->weight * i);	1591	sub_weight (op->env, op->weight * i);
1652	op->nrof -= i;	1592	op->nrof -= i;
1653	if (tmp)	1593	if (tmp)
1654	{
1655	esrv_send_item (tmp, op);	1594	esrv_send_item (tmp, op);
1656	}
1657	}	1595	}
1658	else	1596	else
1659	{	1597	{
1660	op->remove ();	1598	op->remove ();
1661	op->nrof = 0;	1599	op->nrof = 0;
1662	if (tmp)	1600	if (tmp)
1663	{
1664	esrv_del_item (tmp->contr, op->count);	1601	esrv_del_item (tmp->contr, op->count);
1665	}
1666	}	1602	}
1667	}	1603	}
1668	else	1604	else
1669	{	1605	{
1670	object *above = op->above;	1606	object *above = op->above;
…		…
1676	op->remove ();	1612	op->remove ();
1677	op->nrof = 0;	1613	op->nrof = 0;
1678	}	1614	}
1679		1615
1680	/* Since we just removed op, op->above is null */	1616	/* Since we just removed op, op->above is null */
1681	for (tmp = above; tmp != NULL; tmp = tmp->above)	1617	for (tmp = above; tmp; tmp = tmp->above)
1682	if (tmp->type == PLAYER)	1618	if (tmp->type == PLAYER)
1683	{	1619	{
1684	if (op->nrof)	1620	if (op->nrof)
1685	esrv_send_item (tmp, op);	1621	esrv_send_item (tmp, op);
1686	else	1622	else
…		…
1690		1626
1691	if (op->nrof)	1627	if (op->nrof)
1692	return op;	1628	return op;
1693	else	1629	else
1694	{	1630	{
1695	op->destroy (0);	1631	op->destroy ();
1696	return NULL;	1632	return 0;
1697	}	1633	}
1698	}	1634	}
1699		1635
1700	/*	1636	/*
1701	* add_weight(object, weight) adds the specified weight to an object,	1637	* add_weight(object, weight) adds the specified weight to an object,
1702	* and also updates how much the environment(s) is/are carrying.	1638	* and also updates how much the environment(s) is/are carrying.
1703	*/	1639	*/
1704
1705	void	1640	void
1706	add_weight (object *op, signed long weight)	1641	add_weight (object *op, signed long weight)
1707	{	1642	{
1708	while (op != NULL)	1643	while (op != NULL)
1709	{	1644	{
…		…
1724	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1659	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1725	free (dump);	1660	free (dump);
1726	return op;	1661	return op;
1727	}	1662	}
1728		1663
1729	if (where->head)	1664	if (where->head_ () != where)
1730	{	1665	{
1731	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1666	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1732	where = where->head;	1667	where = where->head;
1733	}	1668	}
1734		1669
1735	return where->insert (op);	1670	return where->insert (op);
1736	}	1671	}
…		…
1741	* inside the object environment.	1676	* inside the object environment.
1742	*	1677	*
1743	* The function returns now pointer to inserted item, and return value can	1678	* The function returns now pointer to inserted item, and return value can
1744	* be != op, if items are merged. -Tero	1679	* be != op, if items are merged. -Tero
1745	*/	1680	*/
1746
1747	object *	1681	object *
1748	object::insert (object *op)	1682	object::insert (object *op)
1749	{	1683	{
1750	object *tmp, *otmp;	1684	object *tmp, *otmp;
1751		1685
…		…
1761	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1695	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1762	CLEAR_FLAG (op, FLAG_REMOVED);	1696	CLEAR_FLAG (op, FLAG_REMOVED);
1763	if (op->nrof)	1697	if (op->nrof)
1764	{	1698	{
1765	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1699	for (tmp = inv; tmp != NULL; tmp = tmp->below)
1766	if (CAN_MERGE (tmp, op))	1700	if (object::can_merge (tmp, op))
1767	{	1701	{
1768	/* return the original object and remove inserted object	1702	/* return the original object and remove inserted object
1769	(client needs the original object) */	1703	(client needs the original object) */
1770	tmp->nrof += op->nrof;	1704	tmp->nrof += op->nrof;
1771	/* Weight handling gets pretty funky. Since we are adding to	1705	/* Weight handling gets pretty funky. Since we are adding to
…		…
1789	add_weight (this, op->weight * op->nrof);	1723	add_weight (this, op->weight * op->nrof);
1790	}	1724	}
1791	else	1725	else
1792	add_weight (this, (op->weight + op->carrying));	1726	add_weight (this, (op->weight + op->carrying));
1793		1727
1794	otmp = is_player_inv (this);	1728	otmp = this->in_player ();
1795	if (otmp && otmp->contr)	1729	if (otmp && otmp->contr)
1796	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1730	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1797	fix_player (otmp);	1731	otmp->update_stats ();
1798		1732
1799	op->map = NULL;	1733	op->map = 0;
1800	op->env = this;	1734	op->env = this;
1801	op->above = NULL;	1735	op->above = 0;
1802	op->below = NULL;	1736	op->below = 0;
1803	op->x = 0, op->y = 0;	1737	op->x = 0, op->y = 0;
1804		1738
1805	/* reset the light list and los of the players on the map */	1739	/* reset the light list and los of the players on the map */
1806	if ((op->glow_radius != 0) && map)	1740	if ((op->glow_radius != 0) && map)
1807	{	1741	{
1808	#ifdef DEBUG_LIGHTS	1742	#ifdef DEBUG_LIGHTS
1809	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1743	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1810	#endif /* DEBUG_LIGHTS */	1744	#endif /* DEBUG_LIGHTS */
1811	if (MAP_DARKNESS (map))	1745	if (map->darkness)
1812	update_all_los (map, x, y);	1746	update_all_los (map, x, y);
1813	}	1747	}
1814		1748
1815	/* Client has no idea of ordering so lets not bother ordering it here.	1749	/* Client has no idea of ordering so lets not bother ordering it here.
1816	* It sure simplifies this function...	1750	* It sure simplifies this function...
…		…
1821	{	1755	{
1822	op->below = inv;	1756	op->below = inv;
1823	op->below->above = op;	1757	op->below->above = op;
1824	inv = op;	1758	inv = op;
1825	}	1759	}
		1760
		1761	INVOKE_OBJECT (INSERT, this);
1826		1762
1827	return op;	1763	return op;
1828	}	1764	}
1829		1765
1830	/*	1766	/*
…		…
1845	*	1781	*
1846	* MSW 2001-07-08: Check all objects on space, not just those below	1782	* MSW 2001-07-08: Check all objects on space, not just those below
1847	* object being inserted. insert_ob_in_map may not put new objects	1783	* object being inserted. insert_ob_in_map may not put new objects
1848	* on top.	1784	* on top.
1849	*/	1785	*/
1850
1851	int	1786	int
1852	check_move_on (object *op, object *originator)	1787	check_move_on (object *op, object *originator)
1853	{	1788	{
1854	object *tmp;	1789	object *tmp;
1855	maptile *m = op->map;	1790	maptile *m = op->map;
…		…
1882		1817
1883	/* The objects have to be checked from top to bottom.	1818	/* The objects have to be checked from top to bottom.
1884	* Hence, we first go to the top:	1819	* Hence, we first go to the top:
1885	*/	1820	*/
1886		1821
1887	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1822	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1888	{	1823	{
1889	/* Trim the search when we find the first other spell effect	1824	/* Trim the search when we find the first other spell effect
1890	* this helps performance so that if a space has 50 spell objects,	1825	* this helps performance so that if a space has 50 spell objects,
1891	* we don't need to check all of them.	1826	* we don't need to check all of them.
1892	*/	1827	*/
…		…
1910	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1845	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1911	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1846	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1912	{	1847	{
1913		1848
1914	float	1849	float
1915	diff = tmp->move_slow_penalty * FABS (op->speed);	1850	diff = tmp->move_slow_penalty * fabs (op->speed);
1916		1851
1917	if (op->type == PLAYER)	1852	if (op->type == PLAYER)
1918	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1853	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1919	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1854	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1920	diff /= 4.0;	1855	diff /= 4.0;
…		…
1947	/*	1882	/*
1948	* present_arch(arch, map, x, y) searches for any objects with	1883	* present_arch(arch, map, x, y) searches for any objects with
1949	* a matching archetype at the given map and coordinates.	1884	* a matching archetype at the given map and coordinates.
1950	* The first matching object is returned, or NULL if none.	1885	* The first matching object is returned, or NULL if none.
1951	*/	1886	*/
1952
1953	object *	1887	object *
1954	present_arch (const archetype *at, maptile *m, int x, int y)	1888	present_arch (const archetype *at, maptile *m, int x, int y)
1955	{	1889	{
1956	object *
1957	tmp;
1958
1959	if (m == NULL || out_of_map (m, x, y))	1890	if (!m || out_of_map (m, x, y))
1960	{	1891	{
1961	LOG (llevError, "Present_arch called outside map.\n");	1892	LOG (llevError, "Present_arch called outside map.\n");
1962	return NULL;	1893	return NULL;
1963	}	1894	}
1964	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1895
		1896	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1965	if (tmp->arch == at)	1897	if (tmp->arch == at)
1966	return tmp;	1898	return tmp;
		1899
1967	return NULL;	1900	return NULL;
1968	}	1901	}
1969		1902
1970	/*	1903	/*
1971	* present(type, map, x, y) searches for any objects with	1904	* present(type, map, x, y) searches for any objects with
1972	* a matching type variable at the given map and coordinates.	1905	* a matching type variable at the given map and coordinates.
1973	* The first matching object is returned, or NULL if none.	1906	* The first matching object is returned, or NULL if none.
1974	*/	1907	*/
1975
1976	object *	1908	object *
1977	present (unsigned char type, maptile *m, int x, int y)	1909	present (unsigned char type, maptile *m, int x, int y)
1978	{	1910	{
1979	object *
1980	tmp;
1981
1982	if (out_of_map (m, x, y))	1911	if (out_of_map (m, x, y))
1983	{	1912	{
1984	LOG (llevError, "Present called outside map.\n");	1913	LOG (llevError, "Present called outside map.\n");
1985	return NULL;	1914	return NULL;
1986	}	1915	}
1987	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1916
		1917	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1988	if (tmp->type == type)	1918	if (tmp->type == type)
1989	return tmp;	1919	return tmp;
		1920
1990	return NULL;	1921	return NULL;
1991	}	1922	}
1992		1923
1993	/*	1924	/*
1994	* present_in_ob(type, object) searches for any objects with	1925	* present_in_ob(type, object) searches for any objects with
1995	* a matching type variable in the inventory of the given object.	1926	* a matching type variable in the inventory of the given object.
1996	* The first matching object is returned, or NULL if none.	1927	* The first matching object is returned, or NULL if none.
1997	*/	1928	*/
1998
1999	object *	1929	object *
2000	present_in_ob (unsigned char type, const object *op)	1930	present_in_ob (unsigned char type, const object *op)
2001	{	1931	{
2002	object *
2003	tmp;
2004
2005	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1932	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2006	if (tmp->type == type)	1933	if (tmp->type == type)
2007	return tmp;	1934	return tmp;
		1935
2008	return NULL;	1936	return NULL;
2009	}	1937	}
2010		1938
2011	/*	1939	/*
2012	* present_in_ob (type, str, object) searches for any objects with	1940	* present_in_ob (type, str, object) searches for any objects with
…		…
2020	* str is the string to match against. Note that we match against	1948	* str is the string to match against. Note that we match against
2021	* the object name, not the archetype name. this is so that the	1949	* the object name, not the archetype name. this is so that the
2022	* spell code can use one object type (force), but change it's name	1950	* spell code can use one object type (force), but change it's name
2023	* to be unique.	1951	* to be unique.
2024	*/	1952	*/
2025
2026	object *	1953	object *
2027	present_in_ob_by_name (int type, const char *str, const object *op)	1954	present_in_ob_by_name (int type, const char *str, const object *op)
2028	{	1955	{
2029	object *
2030	tmp;
2031
2032	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1956	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2033	{
2034	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1957	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2035	return tmp;	1958	return tmp;
2036	}	1959
2037	return NULL;	1960	return 0;
2038	}	1961	}
2039		1962
2040	/*	1963	/*
2041	* present_arch_in_ob(archetype, object) searches for any objects with	1964	* present_arch_in_ob(archetype, object) searches for any objects with
2042	* a matching archetype in the inventory of the given object.	1965	* a matching archetype in the inventory of the given object.
2043	* The first matching object is returned, or NULL if none.	1966	* The first matching object is returned, or NULL if none.
2044	*/	1967	*/
2045
2046	object *	1968	object *
2047	present_arch_in_ob (const archetype *at, const object *op)	1969	present_arch_in_ob (const archetype *at, const object *op)
2048	{	1970	{
2049	object *
2050	tmp;
2051
2052	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1971	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2053	if (tmp->arch == at)	1972	if (tmp->arch == at)
2054	return tmp;	1973	return tmp;
		1974
2055	return NULL;	1975	return NULL;
2056	}	1976	}
2057		1977
2058	/*	1978	/*
2059	* activate recursively a flag on an object inventory	1979	* activate recursively a flag on an object inventory
2060	*/	1980	*/
2061	void	1981	void
2062	flag_inv (object *op, int flag)	1982	flag_inv (object *op, int flag)
2063	{	1983	{
2064	object *
2065	tmp;
2066
2067	if (op->inv)	1984	if (op->inv)
2068	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1985	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2069	{	1986	{
2070	SET_FLAG (tmp, flag);	1987	SET_FLAG (tmp, flag);
2071	flag_inv (tmp, flag);	1988	flag_inv (tmp, flag);
2072	}	1989	}
2073	} /*	1990	}
		1991
		1992	/*
2074	* desactivate recursively a flag on an object inventory	1993	* deactivate recursively a flag on an object inventory
2075	*/	1994	*/
2076	void	1995	void
2077	unflag_inv (object *op, int flag)	1996	unflag_inv (object *op, int flag)
2078	{	1997	{
2079	object *
2080	tmp;
2081
2082	if (op->inv)	1998	if (op->inv)
2083	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1999	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2084	{	2000	{
2085	CLEAR_FLAG (tmp, flag);	2001	CLEAR_FLAG (tmp, flag);
2086	unflag_inv (tmp, flag);	2002	unflag_inv (tmp, flag);
2087	}	2003	}
2088	}
2089
2090	/*
2091	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2092	* all it's inventory (recursively).
2093	* If checksums are used, a player will get set_cheat called for
2094	* him/her-self and all object carried by a call to this function.
2095	*/
2096
2097	void
2098	set_cheat (object *op)
2099	{
2100	SET_FLAG (op, FLAG_WAS_WIZ);
2101	flag_inv (op, FLAG_WAS_WIZ);
2102	}	2004	}
2103		2005
2104	/*	2006	/*
2105	* find_free_spot(object, map, x, y, start, stop) will search for	2007	* find_free_spot(object, map, x, y, start, stop) will search for
2106	* a spot at the given map and coordinates which will be able to contain	2008	* a spot at the given map and coordinates which will be able to contain
…		…
2120	* because arch_blocked (now ob_blocked) needs to know the movement type	2022	* because arch_blocked (now ob_blocked) needs to know the movement type
2121	* to know if the space in question will block the object. We can't use	2023	* to know if the space in question will block the object. We can't use
2122	* the archetype because that isn't correct if the monster has been	2024	* the archetype because that isn't correct if the monster has been
2123	* customized, changed states, etc.	2025	* customized, changed states, etc.
2124	*/	2026	*/
2125
2126	int	2027	int
2127	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	2028	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2128	{	2029	{
2129	int
2130	i,
2131	index = 0, flag;	2030	int index = 0, flag;
2132	static int
2133	altern[SIZEOFFREE];	2031	int altern[SIZEOFFREE];
2134		2032
2135	for (i = start; i < stop; i++)	2033	for (int i = start; i < stop; i++)
2136	{	2034	{
2137	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2035	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2138	if (!flag)	2036	if (!flag)
2139	altern[index++] = i;	2037	altern [index++] = i;
2140		2038
2141	/* Basically, if we find a wall on a space, we cut down the search size.	2039	/* Basically, if we find a wall on a space, we cut down the search size.
2142	* In this way, we won't return spaces that are on another side of a wall.	2040	* In this way, we won't return spaces that are on another side of a wall.
2143	* This mostly work, but it cuts down the search size in all directions -	2041	* This mostly work, but it cuts down the search size in all directions -
2144	* if the space being examined only has a wall to the north and empty	2042	* if the space being examined only has a wall to the north and empty
2145	* spaces in all the other directions, this will reduce the search space	2043	* spaces in all the other directions, this will reduce the search space
2146	* to only the spaces immediately surrounding the target area, and	2044	* to only the spaces immediately surrounding the target area, and
2147	* won't look 2 spaces south of the target space.	2045	* won't look 2 spaces south of the target space.
2148	*/	2046	*/
2149	else if ((flag & AB_NO_PASS) && maxfree[i] < stop)	2047	else if ((flag & P_NO_PASS) && maxfree[i] < stop)
2150	stop = maxfree[i];	2048	stop = maxfree[i];
2151	}	2049	}
		2050
2152	if (!index)	2051	if (!index)
2153	return -1;	2052	return -1;
		2053
2154	return altern[RANDOM () % index];	2054	return altern [rndm (index)];
2155	}	2055	}
2156		2056
2157	/*	2057	/*
2158	* find_first_free_spot(archetype, maptile, x, y) works like	2058	* find_first_free_spot(archetype, maptile, x, y) works like
2159	* find_free_spot(), but it will search max number of squares.	2059	* find_free_spot(), but it will search max number of squares.
2160	* But it will return the first available spot, not a random choice.	2060	* But it will return the first available spot, not a random choice.
2161	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2061	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2162	*/	2062	*/
2163
2164	int	2063	int
2165	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2064	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2166	{	2065	{
2167	int
2168	i;
2169
2170	for (i = 0; i < SIZEOFFREE; i++)	2066	for (int i = 0; i < SIZEOFFREE; i++)
2171	{
2172	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2067	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2173	return i;	2068	return i;
2174	}	2069
2175	return -1;	2070	return -1;
2176	}	2071	}
2177		2072
2178	/*	2073	/*
2179	* The function permute(arr, begin, end) randomly reorders the array	2074	* The function permute(arr, begin, end) randomly reorders the array
2180	* arr[begin..end-1].	2075	* arr[begin..end-1].
		2076	* now uses a fisher-yates shuffle, old permute was broken
2181	*/	2077	*/
2182	static void	2078	static void
2183	permute (int *arr, int begin, int end)	2079	permute (int *arr, int begin, int end)
2184	{	2080	{
2185	int	2081	arr += begin;
2186	i,
2187	j,
2188	tmp,
2189	len;
2190
2191	len = end - begin;	2082	end -= begin;
2192	for (i = begin; i < end; i++)
2193	{
2194	j = begin + RANDOM () % len;
2195		2083
2196	tmp = arr[i];	2084	while (--end)
2197	arr[i] = arr[j];	2085	swap (arr [end], arr [rndm (end + 1)]);
2198	arr[j] = tmp;
2199	}
2200	}	2086	}
2201		2087
2202	/* new function to make monster searching more efficient, and effective!	2088	/* new function to make monster searching more efficient, and effective!
2203	* This basically returns a randomized array (in the passed pointer) of	2089	* This basically returns a randomized array (in the passed pointer) of
2204	* the spaces to find monsters. In this way, it won't always look for	2090	* the spaces to find monsters. In this way, it won't always look for
…		…
2207	* the 3x3 area will be searched, just not in a predictable order.	2093	* the 3x3 area will be searched, just not in a predictable order.
2208	*/	2094	*/
2209	void	2095	void
2210	get_search_arr (int *search_arr)	2096	get_search_arr (int *search_arr)
2211	{	2097	{
2212	int	2098	int i;
2213	i;
2214		2099
2215	for (i = 0; i < SIZEOFFREE; i++)	2100	for (i = 0; i < SIZEOFFREE; i++)
2216	{
2217	search_arr[i] = i;	2101	search_arr[i] = i;
2218	}
2219		2102
2220	permute (search_arr, 1, SIZEOFFREE1 + 1);	2103	permute (search_arr, 1, SIZEOFFREE1 + 1);
2221	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2104	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2222	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2105	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2223	}	2106	}
…		…
2232	* Perhaps incorrectly, but I'm making the assumption that exclude	2115	* Perhaps incorrectly, but I'm making the assumption that exclude
2233	* is actually want is going to try and move there. We need this info	2116	* is actually want is going to try and move there. We need this info
2234	* because we have to know what movement the thing looking to move	2117	* because we have to know what movement the thing looking to move
2235	* there is capable of.	2118	* there is capable of.
2236	*/	2119	*/
2237
2238	int	2120	int
2239	find_dir (maptile *m, int x, int y, object *exclude)	2121	find_dir (maptile *m, int x, int y, object *exclude)
2240	{	2122	{
2241	int
2242	i,
2243	max = SIZEOFFREE, mflags;	2123	int i, max = SIZEOFFREE, mflags;
2244		2124
2245	sint16 nx, ny;	2125	sint16 nx, ny;
2246	object *	2126	object *tmp;
2247	tmp;
2248	maptile *	2127	maptile *mp;
2249	mp;
2250		2128
2251	MoveType blocked, move_type;	2129	MoveType blocked, move_type;
2252		2130
2253	if (exclude && exclude->head)	2131	if (exclude && exclude->head_ () != exclude)
2254	{	2132	{
2255	exclude = exclude->head;	2133	exclude = exclude->head;
2256	move_type = exclude->move_type;	2134	move_type = exclude->move_type;
2257	}	2135	}
2258	else	2136	else
…		…
2266	mp = m;	2144	mp = m;
2267	nx = x + freearr_x[i];	2145	nx = x + freearr_x[i];
2268	ny = y + freearr_y[i];	2146	ny = y + freearr_y[i];
2269		2147
2270	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2148	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
		2149
2271	if (mflags & P_OUT_OF_MAP)	2150	if (mflags & P_OUT_OF_MAP)
2272	{
2273	max = maxfree[i];	2151	max = maxfree[i];
2274	}
2275	else	2152	else
2276	{	2153	{
2277	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2154	mapspace &ms = mp->at (nx, ny);
		2155
		2156	blocked = ms.move_block;
2278		2157
2279	if ((move_type & blocked) == move_type)	2158	if ((move_type & blocked) == move_type)
2280	{
2281	max = maxfree[i];	2159	max = maxfree[i];
2282	}
2283	else if (mflags & P_IS_ALIVE)	2160	else if (mflags & P_IS_ALIVE)
2284	{	2161	{
2285	for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)	2162	for (tmp = ms.bot; tmp; tmp = tmp->above)
2286	{	2163	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2287	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2164	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2288	{
2289	break;	2165	break;
2290	}	2166
2291	}
2292	if (tmp)	2167	if (tmp)
2293	{
2294	return freedir[i];	2168	return freedir[i];
2295	}
2296	}	2169	}
2297	}	2170	}
2298	}	2171	}
		2172
2299	return 0;	2173	return 0;
2300	}	2174	}
2301		2175
2302	/*	2176	/*
2303	* distance(object 1, object 2) will return the square of the	2177	* distance(object 1, object 2) will return the square of the
2304	* distance between the two given objects.	2178	* distance between the two given objects.
2305	*/	2179	*/
2306
2307	int	2180	int
2308	distance (const object *ob1, const object *ob2)	2181	distance (const object *ob1, const object *ob2)
2309	{	2182	{
2310	int
2311	i;
2312
2313	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2183	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2314	return i;
2315	}	2184	}
2316		2185
2317	/*	2186	/*
2318	* find_dir_2(delta-x,delta-y) will return a direction in which	2187	* find_dir_2(delta-x,delta-y) will return a direction in which
2319	* an object which has subtracted the x and y coordinates of another	2188	* an object which has subtracted the x and y coordinates of another
2320	* object, needs to travel toward it.	2189	* object, needs to travel toward it.
2321	*/	2190	*/
2322
2323	int	2191	int
2324	find_dir_2 (int x, int y)	2192	find_dir_2 (int x, int y)
2325	{	2193	{
2326	int	2194	int q;
2327	q;
2328		2195
2329	if (y)	2196	if (y)
2330	q = x * 100 / y;	2197	q = x * 100 / y;
2331	else if (x)	2198	else if (x)
2332	q = -300 * x;	2199	q = -300 * x;
…		…
2357		2224
2358	return 3;	2225	return 3;
2359	}	2226	}
2360		2227
2361	/*	2228	/*
2362	* absdir(int): Returns a number between 1 and 8, which represent
2363	* the "absolute" direction of a number (it actually takes care of
2364	* "overflow" in previous calculations of a direction).
2365	*/
2366
2367	int
2368	absdir (int d)
2369	{
2370	while (d < 1)
2371	d += 8;
2372	while (d > 8)
2373	d -= 8;
2374	return d;
2375	}
2376
2377	/*
2378	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2229	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2379	* between two directions (which are expected to be absolute (see absdir())	2230	* between two directions (which are expected to be absolute (see absdir())
2380	*/	2231	*/
2381
2382	int	2232	int
2383	dirdiff (int dir1, int dir2)	2233	dirdiff (int dir1, int dir2)
2384	{	2234	{
2385	int	2235	int d;
2386	d;
2387		2236
2388	d = abs (dir1 - dir2);	2237	d = abs (dir1 - dir2);
2389	if (d > 4)	2238	if (d > 4)
2390	d = 8 - d;	2239	d = 8 - d;
		2240
2391	return d;	2241	return d;
2392	}	2242	}
2393		2243
2394	/* peterm:	2244	/* peterm:
2395	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2245	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2398	* This basically means that if direction is 15, then it could either go	2248	* This basically means that if direction is 15, then it could either go
2399	* direction 4, 14, or 16 to get back to where we are.	2249	* direction 4, 14, or 16 to get back to where we are.
2400	* Moved from spell_util.c to object.c with the other related direction	2250	* Moved from spell_util.c to object.c with the other related direction
2401	* functions.	2251	* functions.
2402	*/	2252	*/
2403
2404	int
2405	reduction_dir[SIZEOFFREE][3] = {	2253	int reduction_dir[SIZEOFFREE][3] = {
2406	{0, 0, 0}, /* 0 */	2254	{0, 0, 0}, /* 0 */
2407	{0, 0, 0}, /* 1 */	2255	{0, 0, 0}, /* 1 */
2408	{0, 0, 0}, /* 2 */	2256	{0, 0, 0}, /* 2 */
2409	{0, 0, 0}, /* 3 */	2257	{0, 0, 0}, /* 3 */
2410	{0, 0, 0}, /* 4 */	2258	{0, 0, 0}, /* 4 */
…		…
2458	* find a path to that monster that we found. If not,	2306	* find a path to that monster that we found. If not,
2459	* we don't bother going toward it. Returns 1 if we	2307	* we don't bother going toward it. Returns 1 if we
2460	* can see a direct way to get it	2308	* can see a direct way to get it
2461	* Modified to be map tile aware -.MSW	2309	* Modified to be map tile aware -.MSW
2462	*/	2310	*/
2463
2464
2465	int	2311	int
2466	can_see_monsterP (maptile *m, int x, int y, int dir)	2312	can_see_monsterP (maptile *m, int x, int y, int dir)
2467	{	2313	{
2468	sint16 dx, dy;	2314	sint16 dx, dy;
2469	int
2470	mflags;	2315	int mflags;
2471		2316
2472	if (dir < 0)	2317	if (dir < 0)
2473	return 0; /* exit condition: invalid direction */	2318	return 0; /* exit condition: invalid direction */
2474		2319
2475	dx = x + freearr_x[dir];	2320	dx = x + freearr_x[dir];
…		…
2488	return 0;	2333	return 0;
2489		2334
2490	/* yes, can see. */	2335	/* yes, can see. */
2491	if (dir < 9)	2336	if (dir < 9)
2492	return 1;	2337	return 1;
		2338
2493	return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |	2339	return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2494	can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);	2340	| can_see_monsterP (m, x, y, reduction_dir[dir][1])
		2341	| can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2495	}	2342	}
2496
2497
2498		2343
2499	/*	2344	/*
2500	* can_pick(picker, item): finds out if an object is possible to be	2345	* can_pick(picker, item): finds out if an object is possible to be
2501	* picked up by the picker. Returnes 1 if it can be	2346	* picked up by the picker. Returnes 1 if it can be
2502	* picked up, otherwise 0.	2347	* picked up, otherwise 0.
…		…
2513	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2358	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2514	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2359	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2515	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2360	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2516	}	2361	}
2517		2362
2518
2519	/*	2363	/*
2520	* create clone from object to another	2364	* create clone from object to another
2521	*/	2365	*/
2522	object *	2366	object *
2523	object_create_clone (object *asrc)	2367	object_create_clone (object *asrc)
2524	{	2368	{
2525	object *dst = 0, *tmp, *src, *part, *prev, *item;	2369	object *dst = 0, *tmp, *src, *prev, *item;
2526		2370
2527	if (!asrc)	2371	if (!asrc)
2528	return 0;	2372	return 0;
2529		2373
2530	src = asrc;
2531	if (src->head)
2532	src = src->head;	2374	src = asrc->head_ ();
2533		2375
2534	prev = 0;	2376	prev = 0;
2535	for (part = src; part; part = part->more)	2377	for (object *part = src; part; part = part->more)
2536	{	2378	{
2537	tmp = get_object ();	2379	tmp = part->clone ();
2538	copy_object (part, tmp);
2539	tmp->x -= src->x;	2380	tmp->x -= src->x;
2540	tmp->y -= src->y;	2381	tmp->y -= src->y;
2541		2382
2542	if (!part->head)	2383	if (!part->head)
2543	{	2384	{
2544	dst = tmp;	2385	dst = tmp;
2545	tmp->head = 0;	2386	tmp->head = 0;
2546	}	2387	}
2547	else	2388	else
2548	{
2549	tmp->head = dst;	2389	tmp->head = dst;
2550	}
2551		2390
2552	tmp->more = 0;	2391	tmp->more = 0;
2553		2392
2554	if (prev)	2393	if (prev)
2555	prev->more = tmp;	2394	prev->more = tmp;
…		…
2559		2398
2560	for (item = src->inv; item; item = item->below)	2399	for (item = src->inv; item; item = item->below)
2561	insert_ob_in_ob (object_create_clone (item), dst);	2400	insert_ob_in_ob (object_create_clone (item), dst);
2562		2401
2563	return dst;	2402	return dst;
2564	}
2565
2566	/* GROS - Creates an object using a string representing its content. */
2567	/* Basically, we save the content of the string to a temp file, then call */
2568	/* load_object on it. I admit it is a highly inefficient way to make things, */
2569	/* but it was simple to make and allows reusing the load_object function. */
2570	/* Remember not to use load_object_str in a time-critical situation. */
2571	/* Also remember that multiparts objects are not supported for now. */
2572
2573	object *
2574	load_object_str (const char *obstr)
2575	{
2576	object *op;
2577	char filename[MAX_BUF];
2578
2579	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2580
2581	FILE *tempfile = fopen (filename, "w");
2582
2583	if (tempfile == NULL)
2584	{
2585	LOG (llevError, "Error - Unable to access load object temp file\n");
2586	return NULL;
2587	}
2588
2589	fprintf (tempfile, obstr);
2590	fclose (tempfile);
2591
2592	op = get_object ();
2593
2594	object_thawer thawer (filename);
2595
2596	if (thawer)
2597	load_object (thawer, op, 0);
2598
2599	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2600	CLEAR_FLAG (op, FLAG_REMOVED);
2601
2602	return op;
2603	}	2403	}
2604		2404
2605	/* This returns the first object in who's inventory that	2405	/* This returns the first object in who's inventory that
2606	* has the same type and subtype match.	2406	* has the same type and subtype match.
2607	* returns NULL if no match.	2407	* returns NULL if no match.
2608	*/	2408	*/
2609	object *	2409	object *
2610	find_obj_by_type_subtype (const object *who, int type, int subtype)	2410	find_obj_by_type_subtype (const object *who, int type, int subtype)
2611	{	2411	{
2612	object *tmp;
2613
2614	for (tmp = who->inv; tmp; tmp = tmp->below)	2412	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2615	if (tmp->type == type && tmp->subtype == subtype)	2413	if (tmp->type == type && tmp->subtype == subtype)
2616	return tmp;	2414	return tmp;
2617		2415
2618	return NULL;	2416	return 0;
2619	}	2417	}
2620		2418
2621	/* If ob has a field named key, return the link from the list,	2419	/* If ob has a field named key, return the link from the list,
2622	* otherwise return NULL.	2420	* otherwise return NULL.
2623	*	2421	*
…		…
2625	* do the desired thing.	2423	* do the desired thing.
2626	*/	2424	*/
2627	key_value *	2425	key_value *
2628	get_ob_key_link (const object *ob, const char *key)	2426	get_ob_key_link (const object *ob, const char *key)
2629	{	2427	{
2630	key_value *link;
2631
2632	for (link = ob->key_values; link != NULL; link = link->next)	2428	for (key_value *link = ob->key_values; link; link = link->next)
2633	if (link->key == key)	2429	if (link->key == key)
2634	return link;	2430	return link;
2635		2431
2636	return NULL;	2432	return 0;
2637	}	2433	}
2638		2434
2639	/*	2435	/*
2640	* Returns the value of op has an extra_field for key, or NULL.	2436	* Returns the value of op has an extra_field for key, or NULL.
2641	*	2437	*
…		…
2666	if (link->key == canonical_key)	2462	if (link->key == canonical_key)
2667	return link->value;	2463	return link->value;
2668		2464
2669	return 0;	2465	return 0;
2670	}	2466	}
2671
2672		2467
2673	/*	2468	/*
2674	* Updates the canonical_key in op to value.	2469	* Updates the canonical_key in op to value.
2675	*	2470	*
2676	* canonical_key is a shared string (value doesn't have to be).	2471	* canonical_key is a shared string (value doesn't have to be).
…		…
2681	* Returns TRUE on success.	2476	* Returns TRUE on success.
2682	*/	2477	*/
2683	int	2478	int
2684	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2479	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2685	{	2480	{
2686	key_value *
2687	field = NULL, *last = NULL;	2481	key_value *field = NULL, *last = NULL;
2688		2482
2689	for (field = op->key_values; field != NULL; field = field->next)	2483	for (field = op->key_values; field != NULL; field = field->next)
2690	{	2484	{
2691	if (field->key != canonical_key)	2485	if (field->key != canonical_key)
2692	{	2486	{
…		…
2701	/* Basically, if the archetype has this key set,	2495	/* Basically, if the archetype has this key set,
2702	* we need to store the null value so when we save	2496	* we need to store the null value so when we save
2703	* it, we save the empty value so that when we load,	2497	* it, we save the empty value so that when we load,
2704	* we get this value back again.	2498	* we get this value back again.
2705	*/	2499	*/
2706	if (get_ob_key_link (&op->arch->clone, canonical_key))	2500	if (get_ob_key_link (op->arch, canonical_key))
2707	field->value = 0;	2501	field->value = 0;
2708	else	2502	else
2709	{	2503	{
2710	if (last)	2504	if (last)
2711	last->next = field->next;	2505	last->next = field->next;
…		…
2720	/* IF we get here, key doesn't exist */	2514	/* IF we get here, key doesn't exist */
2721		2515
2722	/* No field, we'll have to add it. */	2516	/* No field, we'll have to add it. */
2723		2517
2724	if (!add_key)	2518	if (!add_key)
2725	{
2726	return FALSE;	2519	return FALSE;
2727	}	2520
2728	/* There isn't any good reason to store a null	2521	/* There isn't any good reason to store a null
2729	* value in the key/value list. If the archetype has	2522	* value in the key/value list. If the archetype has
2730	* this key, then we should also have it, so shouldn't	2523	* this key, then we should also have it, so shouldn't
2731	* be here. If user wants to store empty strings,	2524	* be here. If user wants to store empty strings,
2732	* should pass in ""	2525	* should pass in ""
…		…
2781	}	2574	}
2782	else	2575	else
2783	item = item->env;	2576	item = item->env;
2784	}	2577	}
2785		2578
		2579
		2580	const char *
		2581	object::flag_desc (char *desc, int len) const
		2582	{
		2583	char *p = desc;
		2584	bool first = true;
		2585
		2586	*p = 0;
		2587
		2588	for (int i = 0; i < NUM_FLAGS; i++)
		2589	{
		2590	if (len <= 10) // magic constant!
		2591	{
		2592	snprintf (p, len, ",...");
		2593	break;
		2594	}
		2595
		2596	if (flag [i])
		2597	{
		2598	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2599	len -= cnt;
		2600	p += cnt;
		2601	first = false;
		2602	}
		2603	}
		2604
		2605	return desc;
		2606	}
		2607
2786	// return a suitable string describing an objetc in enough detail to find it	2608	// return a suitable string describing an object in enough detail to find it
2787	const char *	2609	const char *
2788	object::debug_desc (char *info) const	2610	object::debug_desc (char *info) const
2789	{	2611	{
		2612	char flagdesc[512];
2790	char info2[256 * 3];	2613	char info2[256 * 4];
2791	char *p = info;	2614	char *p = info;
2792		2615
2793	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2616	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2794	count,	2617	count, uuid.seq,
2795	&name,	2618	&name,
2796	title ? " " : "",	2619	title ? "\",title:\"" : "",
2797	title ? (const char *)title : "");	2620	title ? (const char *)title : "",
		2621	flag_desc (flagdesc, 512), type);
2798		2622
2799	if (env)	2623	if (env)
2800	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2624	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2801		2625
2802	if (map)	2626	if (map)
2803	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2627	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2804		2628
2805	return info;	2629	return info;
2806	}	2630	}
2807		2631
2808	const char *	2632	const char *
2809	object::debug_desc () const	2633	object::debug_desc () const
2810	{	2634	{
2811	static char info[256 * 3];	2635	static char info[3][256 * 4];
		2636	static int info_idx;
		2637
2812	return debug_desc (info);	2638	return debug_desc (info [++info_idx % 3]);
2813	}	2639	}
2814		2640
		2641	struct region *
		2642	object::region () const
		2643	{
		2644	return map ? map->region (x, y)
		2645	: region::default_region ();
		2646	}
		2647
		2648	const materialtype_t *
		2649	object::dominant_material () const
		2650	{
		2651	if (materialtype_t *mat = name_to_material (materialname))
		2652	return mat;
		2653
		2654	// omfg this is slow, this has to be temporary :)
		2655	shstr unknown ("unknown");
		2656
		2657	return name_to_material (unknown);
		2658	}
		2659
		2660	void
		2661	object::open_container (object *new_container)
		2662	{
		2663	if (container == new_container)
		2664	return;
		2665
		2666	if (object *old_container = container)
		2667	{
		2668	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2669	return;
		2670
		2671	#if 0
		2672	// remove the "Close old_container" object.
		2673	if (object *closer = old_container->inv)
		2674	if (closer->type == CLOSE_CON)
		2675	closer->destroy ();
		2676	#endif
		2677
		2678	old_container->flag [FLAG_APPLIED] = 0;
		2679	container = 0;
		2680
		2681	esrv_update_item (UPD_FLAGS, this, old_container);
		2682	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2683	}
		2684
		2685	if (new_container)
		2686	{
		2687	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2688	return;
		2689
		2690	// TODO: this does not seem to serve any purpose anymore?
		2691	#if 0
		2692	// insert the "Close Container" object.
		2693	if (archetype *closer = new_container->other_arch)
		2694	{
		2695	object *closer = arch_to_object (new_container->other_arch);
		2696	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2697	new_container->insert (closer);
		2698	}
		2699	#endif
		2700
		2701	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2702
		2703	new_container->flag [FLAG_APPLIED] = 1;
		2704	container = new_container;
		2705
		2706	esrv_update_item (UPD_FLAGS, this, new_container);
		2707	esrv_send_inventory (this, new_container);
		2708	}
		2709	}
		2710
		2711

Diff Legend

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