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.88 by root, Tue Dec 26 09:37:00 2006 UTC vs.
Revision 1.165 by root, Tue Jul 10 07:31:19 2007 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
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
8	it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
10	(at your option) any later version.	11	* (at your option) 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,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License 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
18	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
20
21	The authors can be reached via e-mail at <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <crossfire@schmorp.de>
22	*/	22	*/
23		23
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
26	variable. */	26	variable. */
27	#include <global.h>	27	#include <global.h>
28	#include <stdio.h>	28	#include <stdio.h>
29	#include <sys/types.h>	29	#include <sys/types.h>
30	#include <sys/uio.h>	30	#include <sys/uio.h>
31	#include <object.h>	31	#include <object.h>
32	#include <funcpoint.h>	32	#include <funcpoint.h>
		33	#include <sproto.h>
33	#include <loader.h>	34	#include <loader.h>
34		35
35	#include <bitset>	36	#include <bitset>
36		37
37	int nrofallocobjects = 0;	38	int nrofallocobjects = 0;
38	static UUID uuid;	39	static UUID uuid;
39	const uint64 UUID_SKIP = 1<<19;	40	const uint64 UUID_SKIP = 1<<19;
40		41
41	object *active_objects; /* List of active objects that need to be processed */	42	objectvec objects;
		43	activevec actives;
42		44
43	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,	45	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,
44	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	46	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
45	};	47	};
46	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,	48	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,
…		…
190	* Check nrof variable *before* calling can_merge()	192	* Check nrof variable *before* calling can_merge()
191	*	193	*
192	* Improvements made with merge: Better checking on potion, and also	194	* Improvements made with merge: Better checking on potion, and also
193	* check weight	195	* check weight
194	*/	196	*/
195
196	bool object::can_merge_slow (object *ob1, object *ob2)	197	bool object::can_merge_slow (object *ob1, object *ob2)
197	{	198	{
198	/* A couple quicksanity checks */	199	/* A couple quicksanity checks */
199	if (ob1 == ob2	200	if (ob1 == ob2
200	|| ob1->type != ob2->type	201	|| ob1->type != ob2->type
…		…
277		278
278	/* Note sure why the following is the case - either the object has to	279	/* Note sure why the following is the case - either the object has to
279	* be animated or have a very low speed. Is this an attempted monster	280	* be animated or have a very low speed. Is this an attempted monster
280	* check?	281	* check?
281	*/	282	*/
282	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	283	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
283	return 0;	284	return 0;
284		285
285	switch (ob1->type)	286	switch (ob1->type)
286	{	287	{
287	case SCROLL:	288	case SCROLL:
…		…
323	sum_weight (object *op)	324	sum_weight (object *op)
324	{	325	{
325	long sum;	326	long sum;
326	object *inv;	327	object *inv;
327		328
328	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	329	for (sum = 0, inv = op->inv; inv; inv = inv->below)
329	{	330	{
330	if (inv->inv)	331	if (inv->inv)
331	sum_weight (inv);	332	sum_weight (inv);
		333
332	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
333	}	335	}
334		336
335	if (op->type == CONTAINER && op->stats.Str)	337	if (op->type == CONTAINER && op->stats.Str)
336	sum = (sum * (100 - op->stats.Str)) / 100;	338	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
356	/*	358	/*
357	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	359	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
358	* Some error messages.	360	* Some error messages.
359	* The result of the dump is stored in the static global errmsg array.	361	* The result of the dump is stored in the static global errmsg array.
360	*/	362	*/
361
362	char *	363	char *
363	dump_object (object *op)	364	dump_object (object *op)
364	{	365	{
365	if (!op)	366	if (!op)
366	return strdup ("[NULLOBJ]");	367	return strdup ("[NULLOBJ]");
367		368
368	object_freezer freezer;	369	object_freezer freezer;
369	save_object (freezer, op, 1);	370	op->write (freezer);
370	return freezer.as_string ();	371	return freezer.as_string ();
371	}	372	}
372		373
373	/*	374	/*
374	* get_nearest_part(multi-object, object 2) returns the part of the	375	* get_nearest_part(multi-object, object 2) returns the part of the
…		…
391	}	392	}
392		393
393	/*	394	/*
394	* Returns the object which has the count-variable equal to the argument.	395	* Returns the object which has the count-variable equal to the argument.
395	*/	396	*/
396
397	object *	397	object *
398	find_object (tag_t i)	398	find_object (tag_t i)
399	{	399	{
400	for (object *op = object::first; op; op = op->next)	400	for_all_objects (op)
401	if (op->count == i)	401	if (op->count == i)
402	return op;	402	return op;
403		403
404	return 0;	404	return 0;
405	}	405	}
406		406
407	/*	407	/*
408	* Returns the first object which has a name equal to the argument.	408	* Returns the first object which has a name equal to the argument.
409	* Used only by the patch command, but not all that useful.	409	* Used only by the patch command, but not all that useful.
410	* Enables features like "patch <name-of-other-player> food 999"	410	* Enables features like "patch <name-of-other-player> food 999"
411	*/	411	*/
412
413	object *	412	object *
414	find_object_name (const char *str)	413	find_object_name (const char *str)
415	{	414	{
416	shstr_cmp str_ (str);	415	shstr_cmp str_ (str);
417	object *op;	416	object *op;
418		417
419	for (op = object::first; op != NULL; op = op->next)	418	for_all_objects (op)
420	if (op->name == str_)	419	if (op->name == str_)
421	break;	420	break;
422		421
423	return op;	422	return op;
424	}	423	}
…		…
450	owner = owner->owner;	449	owner = owner->owner;
451		450
452	this->owner = owner;	451	this->owner = owner;
453	}	452	}
454		453
		454	int
		455	object::slottype () const
		456	{
		457	if (type == SKILL)
		458	{
		459	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		460	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		461	}
		462	else
		463	{
		464	if (slot [body_combat].info) return slot_combat;
		465	if (slot [body_range ].info) return slot_ranged;
		466	}
		467
		468	return slot_none;
		469	}
		470
		471	bool
		472	object::change_weapon (object *ob)
		473	{
		474	if (current_weapon == ob)
		475	return true;
		476
		477	if (chosen_skill)
		478	chosen_skill->flag [FLAG_APPLIED] = false;
		479
		480	current_weapon = ob;
		481	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		482
		483	if (chosen_skill)
		484	chosen_skill->flag [FLAG_APPLIED] = true;
		485
		486	update_stats ();
		487
		488	if (ob)
		489	{
		490	// now check wether any body locations became invalid, in which case
		491	// we cannot apply the weapon at the moment.
		492	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		493	if (slot[i].used < 0)
		494	{
		495	current_weapon = chosen_skill = 0;
		496	update_stats ();
		497
		498	new_draw_info_format (NDI_UNIQUE, 0, this,
		499	"You try to balance all your items at once, "
		500	"but the %s is just too much for your body. "
		501	"[You need to unapply some items first.]", &ob->name);
		502	return false;
		503	}
		504
		505	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		506	}
		507	else
		508	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		509
		510	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		511	{
		512	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		513	&name, ob->debug_desc ());
		514	return false;
		515	}
		516
		517	return true;
		518	}
		519
455	/* Zero the key_values on op, decrementing the shared-string	520	/* Zero the key_values on op, decrementing the shared-string
456	* refcounts and freeing the links.	521	* refcounts and freeing the links.
457	*/	522	*/
458	static void	523	static void
459	free_key_values (object *op)	524	free_key_values (object *op)
460	{	525	{
461	for (key_value *i = op->key_values; i != 0;)	526	for (key_value *i = op->key_values; i; )
462	{	527	{
463	key_value *next = i->next;	528	key_value *next = i->next;
464	delete i;	529	delete i;
465		530
466	i = next;	531	i = next;
467	}	532	}
468		533
469	op->key_values = 0;	534	op->key_values = 0;
470	}	535	}
471		536
472	/*	537	object &
473	* copy_to first frees everything allocated by the dst object,	538	object::operator =(const object &src)
474	* and then copies the contents of itself into the second
475	* object, allocating what needs to be allocated. Basically, any
476	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
477	* if the first object is freed, the pointers in the new object
478	* will point at garbage.
479	*/
480	void
481	object::copy_to (object *dst)
482	{	539	{
483	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	540	bool is_freed = flag [FLAG_FREED];
484	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	541	bool is_removed = flag [FLAG_REMOVED];
485		542
486	*(object_copy *)dst = *this;	543	*(object_copy *)this = src;
487		544
488	if (is_freed)	545	flag [FLAG_FREED] = is_freed;
489	SET_FLAG (dst, FLAG_FREED);	546	flag [FLAG_REMOVED] = is_removed;
490
491	if (is_removed)
492	SET_FLAG (dst, FLAG_REMOVED);
493
494	if (speed < 0)
495	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
496		547
497	/* Copy over key_values, if any. */	548	/* Copy over key_values, if any. */
498	if (key_values)	549	if (src.key_values)
499	{	550	{
500	key_value *tail = 0;	551	key_value *tail = 0;
501	key_value *i;
502
503	dst->key_values = 0;	552	key_values = 0;
504		553
505	for (i = key_values; i; i = i->next)	554	for (key_value *i = src.key_values; i; i = i->next)
506	{	555	{
507	key_value *new_link = new key_value;	556	key_value *new_link = new key_value;
508		557
509	new_link->next = 0;	558	new_link->next = 0;
510	new_link->key = i->key;	559	new_link->key = i->key;
511	new_link->value = i->value;	560	new_link->value = i->value;
512		561
513	/* Try and be clever here, too. */	562	/* Try and be clever here, too. */
514	if (!dst->key_values)	563	if (!key_values)
515	{	564	{
516	dst->key_values = new_link;	565	key_values = new_link;
517	tail = new_link;	566	tail = new_link;
518	}	567	}
519	else	568	else
520	{	569	{
521	tail->next = new_link;	570	tail->next = new_link;
522	tail = new_link;	571	tail = new_link;
523	}	572	}
524	}	573	}
525	}	574	}
		575	}
		576
		577	/*
		578	* copy_to first frees everything allocated by the dst object,
		579	* and then copies the contents of itself into the second
		580	* object, allocating what needs to be allocated. Basically, any
		581	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		582	* if the first object is freed, the pointers in the new object
		583	* will point at garbage.
		584	*/
		585	void
		586	object::copy_to (object *dst)
		587	{
		588	*dst = *this;
		589
		590	if (speed < 0)
		591	dst->speed_left = speed_left - rndm ();
526		592
527	dst->set_speed (dst->speed);	593	dst->set_speed (dst->speed);
		594	}
		595
		596	void
		597	object::instantiate ()
		598	{
		599	if (!uuid.seq) // HACK
		600	uuid = gen_uuid ();
		601
		602	speed_left = -0.1f;
		603	/* copy the body_info to the body_used - this is only really
		604	* need for monsters, but doesn't hurt to do it for everything.
		605	* by doing so, when a monster is created, it has good starting
		606	* values for the body_used info, so when items are created
		607	* for it, they can be properly equipped.
		608	*/
		609	for (int i = NUM_BODY_LOCATIONS; i--; )
		610	slot[i].used = slot[i].info;
		611
		612	attachable::instantiate ();
528	}	613	}
529		614
530	object *	615	object *
531	object::clone ()	616	object::clone ()
532	{	617	{
…		…
538	/*	623	/*
539	* If an object with the IS_TURNABLE() flag needs to be turned due	624	* If an object with the IS_TURNABLE() flag needs to be turned due
540	* to the closest player being on the other side, this function can	625	* to the closest player being on the other side, this function can
541	* be called to update the face variable, _and_ how it looks on the map.	626	* be called to update the face variable, _and_ how it looks on the map.
542	*/	627	*/
543
544	void	628	void
545	update_turn_face (object *op)	629	update_turn_face (object *op)
546	{	630	{
547	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	631	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
548	return;	632	return;
		633
549	SET_ANIMATION (op, op->direction);	634	SET_ANIMATION (op, op->direction);
550	update_object (op, UP_OBJ_FACE);	635	update_object (op, UP_OBJ_FACE);
551	}	636	}
552		637
553	/*	638	/*
…		…
556	* This function needs to be called whenever the speed of an object changes.	641	* This function needs to be called whenever the speed of an object changes.
557	*/	642	*/
558	void	643	void
559	object::set_speed (float speed)	644	object::set_speed (float speed)
560	{	645	{
561	extern int arch_init;
562
563	/* No reason putting the archetypes objects on the speed list,
564	* since they never really need to be updated.
565	*/
566	if (flag [FLAG_FREED] && speed)	646	if (flag [FLAG_FREED] && speed)
567	{	647	{
568	LOG (llevError, "Object %s is freed but has speed.\n", &name);	648	LOG (llevError, "Object %s is freed but has speed.\n", &name);
569	speed = 0;	649	speed = 0;
570	}	650	}
571		651
572	this->speed = speed;	652	this->speed = speed;
573		653
574	if (arch_init)	654	if (has_active_speed ())
575	return;	655	activate ();
576
577	if (FABS (speed) > MIN_ACTIVE_SPEED)
578	{
579	/* If already on active list, don't do anything */
580	if (active_next || active_prev || this == active_objects)
581	return;
582
583	/* process_events() expects us to insert the object at the beginning
584	* of the list. */
585	active_next = active_objects;
586
587	if (active_next)
588	active_next->active_prev = this;
589
590	active_objects = this;
591	}
592	else	656	else
593	{	657	deactivate ();
594	/* If not on the active list, nothing needs to be done */
595	if (!active_next && !active_prev && this != active_objects)
596	return;
597
598	if (!active_prev)
599	{
600	active_objects = active_next;
601
602	if (active_next)
603	active_next->active_prev = 0;
604	}
605	else
606	{
607	active_prev->active_next = active_next;
608
609	if (active_next)
610	active_next->active_prev = active_prev;
611	}
612
613	active_next = 0;
614	active_prev = 0;
615	}
616	}
617
618	/* This function removes object 'op' from the list of active
619	* objects.
620	* This should only be used for style maps or other such
621	* reference maps where you don't want an object that isn't
622	* in play chewing up cpu time getting processed.
623	* The reverse of this is to call update_ob_speed, which
624	* will do the right thing based on the speed of the object.
625	*/
626	void
627	remove_from_active_list (object *op)
628	{
629	/* If not on the active list, nothing needs to be done */
630	if (!op->active_next && !op->active_prev && op != active_objects)
631	return;
632
633	if (op->active_prev == NULL)
634	{
635	active_objects = op->active_next;
636	if (op->active_next != NULL)
637	op->active_next->active_prev = NULL;
638	}
639	else
640	{
641	op->active_prev->active_next = op->active_next;
642	if (op->active_next)
643	op->active_next->active_prev = op->active_prev;
644	}
645	op->active_next = NULL;
646	op->active_prev = NULL;
647	}	658	}
648		659
649	/*	660	/*
650	* update_object() updates the the map.	661	* update_object() updates the the map.
651	* It takes into account invisible objects (and represent squares covered	662	* It takes into account invisible objects (and represent squares covered
…		…
664	* UP_OBJ_FACE: only the objects face has changed.	675	* UP_OBJ_FACE: only the objects face has changed.
665	*/	676	*/
666	void	677	void
667	update_object (object *op, int action)	678	update_object (object *op, int action)
668	{	679	{
669	MoveType move_on, move_off, move_block, move_slow;
670
671	if (op == NULL)	680	if (op == NULL)
672	{	681	{
673	/* this should never happen */	682	/* this should never happen */
674	LOG (llevDebug, "update_object() called for NULL object.\n");	683	LOG (llevDebug, "update_object() called for NULL object.\n");
675	return;	684	return;
…		…
699	return;	708	return;
700	}	709	}
701		710
702	mapspace &m = op->ms ();	711	mapspace &m = op->ms ();
703		712
704	if (m.flags_ & P_NEED_UPDATE)	713	if (!(m.flags_ & P_UPTODATE))
705	/* nop */;	714	/* nop */;
706	else if (action == UP_OBJ_INSERT)	715	else if (action == UP_OBJ_INSERT)
707	{	716	{
708	// this is likely overkill, TODO: revisit (schmorp)	717	// this is likely overkill, TODO: revisit (schmorp)
709	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	718	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
…		…
718	/* This isn't perfect, but I don't expect a lot of objects to	727	/* This isn't perfect, but I don't expect a lot of objects to
719	* to have move_allow right now.	728	* to have move_allow right now.
720	*/	729	*/
721	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	730	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
722	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	731	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
723	m.flags_ = P_NEED_UPDATE;	732	m.flags_ = 0;
724	}	733	}
725	/* if the object is being removed, we can't make intelligent	734	/* if the object is being removed, we can't make intelligent
726	* decisions, because remove_ob can't really pass the object	735	* decisions, because remove_ob can't really pass the object
727	* that is being removed.	736	* that is being removed.
728	*/	737	*/
729	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	738	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
730	m.flags_ = P_NEED_UPDATE;	739	m.flags_ = 0;
731	else if (action == UP_OBJ_FACE)	740	else if (action == UP_OBJ_FACE)
732	/* Nothing to do for that case */ ;	741	/* Nothing to do for that case */ ;
733	else	742	else
734	LOG (llevError, "update_object called with invalid action: %d\n", action);	743	LOG (llevError, "update_object called with invalid action: %d\n", action);
735		744
736	if (op->more)	745	if (op->more)
737	update_object (op->more, action);	746	update_object (op->more, action);
738	}	747	}
739		748
740	object::vector object::objects; // not yet used
741	object *object::first;
742
743	object::object ()	749	object::object ()
744	{	750	{
745	SET_FLAG (this, FLAG_REMOVED);	751	SET_FLAG (this, FLAG_REMOVED);
746		752
747	expmul = 1.0;	753	expmul = 1.0;
748	face = blank_face;	754	face = blank_face;
749	}	755	}
750		756
751	object::~object ()	757	object::~object ()
752	{	758	{
		759	unlink ();
		760
753	free_key_values (this);	761	free_key_values (this);
754	}	762	}
755		763
		764	static int object_count;
		765
756	void object::link ()	766	void object::link ()
757	{	767	{
758	count = ++ob_count;	768	assert (!index);//D
759	uuid = gen_uuid ();	769	uuid = gen_uuid ();
		770	count = ++object_count;
760		771
761	prev = 0;	772	refcnt_inc ();
762	next = object::first;	773	objects.insert (this);
763
764	if (object::first)
765	object::first->prev = this;
766
767	object::first = this;
768	}	774	}
769		775
770	void object::unlink ()	776	void object::unlink ()
771	{	777	{
772	if (this == object::first)	778	if (!index)
773	object::first = next;
774
775	/* Remove this object from the list of used objects */
776	if (prev) prev->next = next;
777	if (next) next->prev = prev;
778
779	prev = 0;
780	next = 0;
781	}
782
783	object *object::create ()
784	{
785	object *op = new object;
786	op->link ();
787	return op;	779	return;
		780
		781	objects.erase (this);
		782	refcnt_dec ();
788	}	783	}
789		784
790	void	785	void
791	object::do_destroy ()	786	object::activate ()
792	{	787	{
793	attachable::do_destroy ();	788	/* If already on active list, don't do anything */
794		789	if (active)
795	if (flag [FLAG_IS_LINKED])
796	remove_button_link (this);
797
798	if (flag [FLAG_FRIENDLY])
799	remove_friendly_object (this);
800
801	if (!flag [FLAG_REMOVED])
802	remove ();
803
804	if (flag [FLAG_FREED])
805	return;	790	return;
806		791
807	flag [FLAG_FREED] = 1;	792	if (has_active_speed ())
		793	actives.insert (this);
		794	}
808		795
809	while (inv)	796	void
810	inv->destroy ();	797	object::activate_recursive ()
		798	{
		799	activate ();
811		800
812	set_speed (0);	801	for (object *op = inv; op; op = op->below)
813	unlink ();	802	op->activate_recursive ();
		803	}
814		804
815	// hack to ensure that freed objects still have a valid map	805	/* This function removes object 'op' from the list of active
816	{	806	* objects.
817	static maptile *freed_map; // freed objects are moved here to avoid crashes	807	* This should only be used for style maps or other such
		808	* reference maps where you don't want an object that isn't
		809	* in play chewing up cpu time getting processed.
		810	* The reverse of this is to call update_ob_speed, which
		811	* will do the right thing based on the speed of the object.
		812	*/
		813	void
		814	object::deactivate ()
		815	{
		816	/* If not on the active list, nothing needs to be done */
		817	if (!active)
		818	return;
818		819
819	if (!freed_map)	820	actives.erase (this);
		821	}
		822
		823	void
		824	object::deactivate_recursive ()
		825	{
		826	for (object *op = inv; op; op = op->below)
		827	op->deactivate_recursive ();
		828
		829	deactivate ();
		830	}
		831
		832	void
		833	object::set_flag_inv (int flag, int value)
		834	{
		835	for (object *op = inv; op; op = op->below)
820	{	836	{
821	freed_map = new maptile;	837	op->flag [flag] = value;
822		838	op->set_flag_inv (flag, value);
823	freed_map->name = "/internal/freed_objects_map";
824	freed_map->width = 3;
825	freed_map->height = 3;
826
827	freed_map->allocate ();
828	}	839	}
829
830	map = freed_map;
831	x = 1;
832	y = 1;
833	}
834
835	head = 0;
836
837	if (more)
838	{
839	more->destroy ();
840	more = 0;
841	}
842
843	// clear those pointers that likely might have circular references to us
844	owner = 0;
845	enemy = 0;
846	attacked_by = 0;
847
848	// only relevant for players(?), but make sure of it anyways
849	contr = 0;
850	}	840	}
851		841
852	/*	842	/*
853	* Remove and free all objects in the inventory of the given object.	843	* Remove and free all objects in the inventory of the given object.
854	* object.c ?	844	* object.c ?
855	*/	845	*/
856	void	846	void
857	object::destroy_inv (bool drop_to_ground)	847	object::destroy_inv (bool drop_to_ground)
858	{	848	{
		849	// need to check first, because the checks below might segfault
		850	// as we might be on an invalid mapspace and crossfire code
		851	// is too buggy to ensure that the inventory is empty.
		852	// corollary: if you create arrows etc. with stuff in tis inventory,
		853	// cf will crash below with off-map x and y
		854	if (!inv)
		855	return;
		856
859	/* Only if the space blocks everything do we not process -	857	/* Only if the space blocks everything do we not process -
860	* if some form of movement is allowed, let objects	858	* if some form of movement is allowed, let objects
861	* drop on that space.	859	* drop on that space.
862	*/	860	*/
863	if (!drop_to_ground || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)	861	if (!drop_to_ground
		862	|| !map
		863	|| map->in_memory != MAP_IN_MEMORY
		864	|| map->nodrop
		865	|| ms ().move_block == MOVE_ALL)
864	{	866	{
865	while (inv)	867	while (inv)
		868	{
		869	inv->destroy_inv (drop_to_ground);
866	inv->destroy ();	870	inv->destroy ();
		871	}
867	}	872	}
868	else	873	else
869	{ /* Put objects in inventory onto this space */	874	{ /* Put objects in inventory onto this space */
870	while (inv)	875	while (inv)
871	{	876	{
…		…
873		878
874	if (op->flag [FLAG_STARTEQUIP]	879	if (op->flag [FLAG_STARTEQUIP]
875	|| op->flag [FLAG_NO_DROP]	880	|| op->flag [FLAG_NO_DROP]
876	|| op->type == RUNE	881	|| op->type == RUNE
877	|| op->type == TRAP	882	|| op->type == TRAP
878	|| op->flag [FLAG_IS_A_TEMPLATE])	883	|| op->flag [FLAG_IS_A_TEMPLATE]
		884	|| op->flag [FLAG_DESTROY_ON_DEATH])
879	op->destroy ();	885	op->destroy ();
880	else	886	else
881	{	887	map->insert (op, x, y);
882	op->remove ();
883	op->x = x;
884	op->y = y;
885	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
886	}
887	}	888	}
888	}	889	}
		890	}
		891
		892	object *object::create ()
		893	{
		894	object *op = new object;
		895	op->link ();
		896	return op;
		897	}
		898
		899	void
		900	object::do_destroy ()
		901	{
		902	attachable::do_destroy ();
		903
		904	if (flag [FLAG_IS_LINKED])
		905	remove_button_link (this);
		906
		907	if (flag [FLAG_FRIENDLY])
		908	remove_friendly_object (this);
		909
		910	if (!flag [FLAG_REMOVED])
		911	remove ();
		912
		913	destroy_inv (true);
		914
		915	deactivate ();
		916	unlink ();
		917
		918	flag [FLAG_FREED] = 1;
		919
		920	// hack to ensure that freed objects still have a valid map
		921	{
		922	static maptile *freed_map; // freed objects are moved here to avoid crashes
		923
		924	if (!freed_map)
		925	{
		926	freed_map = new maptile;
		927
		928	freed_map->name = "/internal/freed_objects_map";
		929	freed_map->width = 3;
		930	freed_map->height = 3;
		931
		932	freed_map->alloc ();
		933	freed_map->in_memory = MAP_IN_MEMORY;
		934	}
		935
		936	map = freed_map;
		937	x = 1;
		938	y = 1;
		939	}
		940
		941	if (more)
		942	{
		943	more->destroy ();
		944	more = 0;
		945	}
		946
		947	head = 0;
		948
		949	// clear those pointers that likely might cause circular references
		950	owner = 0;
		951	enemy = 0;
		952	attacked_by = 0;
		953	current_weapon = 0;
889	}	954	}
890		955
891	void	956	void
892	object::destroy (bool destroy_inventory)	957	object::destroy (bool destroy_inventory)
893	{	958	{
894	if (destroyed ())	959	if (destroyed ())
895	return;	960	return;
896		961
897	if (destroy_inventory)	962	if (destroy_inventory)
898	destroy_inv (true);	963	destroy_inv (false);
899		964
900	attachable::destroy ();	965	attachable::destroy ();
901	}	966	}
902		967
903	/*	968	/*
…		…
921	* 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
922	* 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
923	* object will have no environment. If the object previously had an	988	* object will have no environment. If the object previously had an
924	* environment, the x and y coordinates will be updated to	989	* environment, the x and y coordinates will be updated to
925	* the previous environment.	990	* the previous environment.
926	* Beware: This function is called from the editor as well!
927	*/	991	*/
928	void	992	void
929	object::remove ()	993	object::do_remove ()
930	{	994	{
931	object *tmp, *last = 0;	995	object *tmp, *last = 0;
932	object *otmp;	996	object *otmp;
933		997
934	if (QUERY_FLAG (this, FLAG_REMOVED))	998	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
956	* to save cpu time.	1020	* to save cpu time.
957	*/	1021	*/
958	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1022	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
959	otmp->update_stats ();	1023	otmp->update_stats ();
960		1024
961	if (above != NULL)	1025	if (above)
962	above->below = below;	1026	above->below = below;
963	else	1027	else
964	env->inv = below;	1028	env->inv = below;
965		1029
966	if (below != NULL)	1030	if (below)
967	below->above = above;	1031	below->above = above;
968		1032
969	/* we set up values so that it could be inserted into	1033	/* we set up values so that it could be inserted into
970	* 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
971	* to the caller to decide what we want to do.	1035	* to the caller to decide what we want to do.
…		…
975	above = 0, below = 0;	1039	above = 0, below = 0;
976	env = 0;	1040	env = 0;
977	}	1041	}
978	else if (map)	1042	else if (map)
979	{	1043	{
980	/* Re did the following section of code - it looks like it had	1044	if (type == PLAYER)
981	* lots of logic for things we no longer care about
982	*/	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 ();
983		1058
984	/* link the object above us */	1059	/* link the object above us */
985	if (above)	1060	if (above)
986	above->below = below;	1061	above->below = below;
987	else	1062	else
988	map->at (x, y).top = below; /* we were top, set new top */	1063	ms.top = below; /* we were top, set new top */
989		1064
990	/* Relink the object below us, if there is one */	1065	/* Relink the object below us, if there is one */
991	if (below)	1066	if (below)
992	below->above = above;	1067	below->above = above;
993	else	1068	else
…		…
995	/* 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
996	* use translated coordinates in case some oddness with map tiling is	1071	* use translated coordinates in case some oddness with map tiling is
997	* evident	1072	* evident
998	*/	1073	*/
999	if (GET_MAP_OB (map, x, y) != this)	1074	if (GET_MAP_OB (map, x, y) != this)
1000	{
1001	char *dump = dump_object (this);
1002	LOG (llevError,
1003	"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 ());
1004	free (dump);
1005	dump = dump_object (GET_MAP_OB (map, x, y));
1006	LOG (llevError, "%s\n", dump);
1007	free (dump);
1008	}
1009		1076
1010	map->at (x, y).bot = above; /* goes on above it. */	1077	ms.bot = above; /* goes on above it. */
1011	}	1078	}
1012		1079
1013	above = 0;	1080	above = 0;
1014	below = 0;	1081	below = 0;
1015		1082
1016	if (map->in_memory == MAP_SAVING)	1083	if (map->in_memory == MAP_SAVING)
1017	return;	1084	return;
1018		1085
1019	int check_walk_off = !flag [FLAG_NO_APPLY];	1086	int check_walk_off = !flag [FLAG_NO_APPLY];
1020		1087
1021	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	1088	for (tmp = ms.bot; tmp; tmp = tmp->above)
1022	{	1089	{
1023	/* 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
1024	* being removed.	1091	* being removed.
1025	*/	1092	*/
1026		1093
…		…
1038		1105
1039	if (tmp->contr->ns)	1106	if (tmp->contr->ns)
1040	tmp->contr->ns->floorbox_update ();	1107	tmp->contr->ns->floorbox_update ();
1041	}	1108	}
1042		1109
1043	/* See if player moving off should effect something */	1110	/* See if object moving off should effect something */
1044	if (check_walk_off	1111	if (check_walk_off
1045	&& ((move_type & tmp->move_off)	1112	&& ((move_type & tmp->move_off)
1046	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1113	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1047	{	1114	{
1048	move_apply (tmp, this, 0);	1115	move_apply (tmp, this, 0);
1049		1116
1050	if (destroyed ())	1117	if (destroyed ())
1051	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 ());
1052	}	1119	}
1053		1120
1054	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1055
1056	if (tmp->above == tmp)
1057	tmp->above = 0;
1058
1059	last = tmp;	1121	last = tmp;
1060	}	1122	}
1061		1123
1062	/* last == NULL of there are no objects on this space */	1124	/* last == NULL if there are no objects on this space */
		1125	//TODO: this makes little sense, why only update the topmost object?
1063	if (!last)	1126	if (!last)
1064	map->at (x, y).flags_ = P_NEED_UPDATE;	1127	map->at (x, y).flags_ = 0;
1065	else	1128	else
1066	update_object (last, UP_OBJ_REMOVE);	1129	update_object (last, UP_OBJ_REMOVE);
1067		1130
1068	if (flag [FLAG_BLOCKSVIEW] || glow_radius)	1131	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1069	update_all_los (map, x, y);	1132	update_all_los (map, x, y);
…		…
1105	}	1168	}
1106		1169
1107	return 0;	1170	return 0;
1108	}	1171	}
1109		1172
		1173	void
		1174	object::expand_tail ()
		1175	{
		1176	if (more)
		1177	return;
		1178
		1179	object *prev = this;
		1180
		1181	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1182	{
		1183	object *op = arch_to_object (at);
		1184
		1185	op->name = name;
		1186	op->name_pl = name_pl;
		1187	op->title = title;
		1188
		1189	op->head = this;
		1190	prev->more = op;
		1191
		1192	prev = op;
		1193	}
		1194	}
		1195
1110	/*	1196	/*
1111	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1197	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1112	* job preparing multi-part monsters	1198	* job preparing multi-part monsters.
1113	*/	1199	*/
1114	object *	1200	object *
1115	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1201	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1116	{	1202	{
1117	object *tmp;
1118
1119	if (op->head)
1120	op = op->head;
1121
1122	for (tmp = op; tmp; tmp = tmp->more)	1203	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1123	{	1204	{
1124	tmp->x = x + tmp->arch->clone.x;	1205	tmp->x = x + tmp->arch->x;
1125	tmp->y = y + tmp->arch->clone.y;	1206	tmp->y = y + tmp->arch->y;
1126	}	1207	}
1127		1208
1128	return insert_ob_in_map (op, m, originator, flag);	1209	return insert_ob_in_map (op, m, originator, flag);
1129	}	1210	}
1130		1211
…		…
1149	* just 'op' otherwise	1230	* just 'op' otherwise
1150	*/	1231	*/
1151	object *	1232	object *
1152	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1233	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1153	{	1234	{
		1235	assert (!op->flag [FLAG_FREED]);
		1236
1154	object *tmp, *top, *floor = NULL;	1237	object *top, *floor = NULL;
1155	sint16 x, y;
1156		1238
1157	if (QUERY_FLAG (op, FLAG_FREED))	1239	op->remove ();
1158	{
1159	LOG (llevError, "Trying to insert freed object!\n");
1160	return NULL;
1161	}
1162		1240
1163	if (m == NULL)	1241	#if 0
1164	{	1242	if (!m->active != !op->active)
1165	char *dump = dump_object (op);	1243	if (m->active)
1166	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1244	op->activate_recursive ();
1167	free (dump);	1245	else
1168	return op;	1246	op->deactivate_recursive ();
1169	}	1247	#endif
1170		1248
1171	if (out_of_map (m, op->x, op->y))	1249	if (out_of_map (m, op->x, op->y))
1172	{	1250	{
1173	char *dump = dump_object (op);
1174	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);	1251	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1175	#ifdef MANY_CORES	1252	#ifdef MANY_CORES
1176	/* Better to catch this here, as otherwise the next use of this object	1253	/* Better to catch this here, as otherwise the next use of this object
1177	* is likely to cause a crash. Better to find out where it is getting	1254	* is likely to cause a crash. Better to find out where it is getting
1178	* improperly inserted.	1255	* improperly inserted.
1179	*/	1256	*/
1180	abort ();	1257	abort ();
1181	#endif	1258	#endif
1182	free (dump);
1183	return op;	1259	return op;
1184	}	1260	}
1185		1261
1186	if (!QUERY_FLAG (op, FLAG_REMOVED))	1262	if (object *more = op->more)
1187	{	1263	if (!insert_ob_in_map (more, m, originator, flag))
1188	char *dump = dump_object (op);
1189	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1190	free (dump);
1191	return op;	1264	return 0;
1192	}
1193
1194	if (op->more)
1195	{
1196	/* The part may be on a different map. */
1197
1198	object *more = op->more;
1199
1200	/* We really need the caller to normalize coordinates - if
1201	* we set the map, that doesn't work if the location is within
1202	* a map and this is straddling an edge. So only if coordinate
1203	* is clear wrong do we normalize it.
1204	*/
1205	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1206	more->map = get_map_from_coord (m, &more->x, &more->y);
1207	else if (!more->map)
1208	{
1209	/* For backwards compatibility - when not dealing with tiled maps,
1210	* more->map should always point to the parent.
1211	*/
1212	more->map = m;
1213	}
1214
1215	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1216	{
1217	if (!op->head)
1218	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1219
1220	return 0;
1221	}
1222	}
1223		1265
1224	CLEAR_FLAG (op, FLAG_REMOVED);	1266	CLEAR_FLAG (op, FLAG_REMOVED);
1225		1267
1226	/* Ideally, the caller figures this out. However, it complicates a lot	1268	/* Ideally, the caller figures this out. However, it complicates a lot
1227	* of areas of callers (eg, anything that uses find_free_spot would now	1269	* of areas of callers (eg, anything that uses find_free_spot would now
1228	* need extra work	1270	* need extra work
1229	*/	1271	*/
1230	op->map = get_map_from_coord (m, &op->x, &op->y);	1272	if (!xy_normalise (m, op->x, op->y))
1231	x = op->x;	1273	return 0;
1232	y = op->y;	1274
		1275	op->map = m;
		1276	mapspace &ms = op->ms ();
1233		1277
1234	/* this has to be done after we translate the coordinates.	1278	/* this has to be done after we translate the coordinates.
1235	*/	1279	*/
1236	if (op->nrof && !(flag & INS_NO_MERGE))	1280	if (op->nrof && !(flag & INS_NO_MERGE))
1237	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1281	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1238	if (object::can_merge (op, tmp))	1282	if (object::can_merge (op, tmp))
1239	{	1283	{
1240	op->nrof += tmp->nrof;	1284	op->nrof += tmp->nrof;
1241	tmp->destroy ();	1285	tmp->destroy ();
1242	}	1286	}
…		…
1259	op->below = originator->below;	1303	op->below = originator->below;
1260		1304
1261	if (op->below)	1305	if (op->below)
1262	op->below->above = op;	1306	op->below->above = op;
1263	else	1307	else
1264	op->ms ().bot = op;	1308	ms.bot = op;
1265		1309
1266	/* since *below* originator, no need to update top */	1310	/* since *below* originator, no need to update top */
1267	originator->below = op;	1311	originator->below = op;
1268	}	1312	}
1269	else	1313	else
1270	{	1314	{
		1315	top = ms.bot;
		1316
1271	/* If there are other objects, then */	1317	/* If there are other objects, then */
1272	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1318	if ((!(flag & INS_MAP_LOAD)) && top)
1273	{	1319	{
1274	object *last = NULL;	1320	object *last = 0;
1275		1321
1276	/*	1322	/*
1277	* If there are multiple objects on this space, we do some trickier handling.	1323	* If there are multiple objects on this space, we do some trickier handling.
1278	* We've already dealt with merging if appropriate.	1324	* We've already dealt with merging if appropriate.
1279	* Generally, we want to put the new object on top. But if	1325	* Generally, we want to put the new object on top. But if
…		…
1283	* once we get to them. This reduces the need to traverse over all of	1329	* once we get to them. This reduces the need to traverse over all of
1284	* them when adding another one - this saves quite a bit of cpu time	1330	* them when adding another one - this saves quite a bit of cpu time
1285	* when lots of spells are cast in one area. Currently, it is presumed	1331	* when lots of spells are cast in one area. Currently, it is presumed
1286	* that flying non pickable objects are spell objects.	1332	* that flying non pickable objects are spell objects.
1287	*/	1333	*/
1288		1334	for (top = ms.bot; top; top = top->above)
1289	while (top != NULL)
1290	{	1335	{
1291	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1336	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1292	floor = top;	1337	floor = top;
1293		1338
1294	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1339	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1297	top = top->below;	1342	top = top->below;
1298	break;	1343	break;
1299	}	1344	}
1300		1345
1301	last = top;	1346	last = top;
1302	top = top->above;
1303	}	1347	}
1304		1348
1305	/* Don't want top to be NULL, so set it to the last valid object */	1349	/* Don't want top to be NULL, so set it to the last valid object */
1306	top = last;	1350	top = last;
1307		1351
…		…
1309	* looks like instead of lots of conditions here.	1353	* looks like instead of lots of conditions here.
1310	* makes things faster, and effectively the same result.	1354	* makes things faster, and effectively the same result.
1311	*/	1355	*/
1312		1356
1313	/* Have object 'fall below' other objects that block view.	1357	/* Have object 'fall below' other objects that block view.
1314	* Unless those objects are exits, type 66	1358	* Unless those objects are exits.
1315	* If INS_ON_TOP is used, don't do this processing	1359	* If INS_ON_TOP is used, don't do this processing
1316	* Need to find the object that in fact blocks view, otherwise	1360	* Need to find the object that in fact blocks view, otherwise
1317	* stacking is a bit odd.	1361	* stacking is a bit odd.
1318	*/	1362	*/
1319	if (!(flag & INS_ON_TOP) &&	1363	if (!(flag & INS_ON_TOP)
1320	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1364	&& ms.flags () & P_BLOCKSVIEW
		1365	&& (op->face && !faces [op->face].visibility))
1321	{	1366	{
1322	for (last = top; last != floor; last = last->below)	1367	for (last = top; last != floor; last = last->below)
1323	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1368	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1324	break;	1369	break;
		1370
1325	/* Check to see if we found the object that blocks view,	1371	/* Check to see if we found the object that blocks view,
1326	* and make sure we have a below pointer for it so that	1372	* and make sure we have a below pointer for it so that
1327	* we can get inserted below this one, which requires we	1373	* we can get inserted below this one, which requires we
1328	* set top to the object below us.	1374	* set top to the object below us.
1329	*/	1375	*/
…		…
1331	top = last->below;	1377	top = last->below;
1332	}	1378	}
1333	} /* If objects on this space */	1379	} /* If objects on this space */
1334		1380
1335	if (flag & INS_MAP_LOAD)	1381	if (flag & INS_MAP_LOAD)
1336	top = GET_MAP_TOP (op->map, op->x, op->y);	1382	top = ms.top;
1337		1383
1338	if (flag & INS_ABOVE_FLOOR_ONLY)	1384	if (flag & INS_ABOVE_FLOOR_ONLY)
1339	top = floor;	1385	top = floor;
1340		1386
1341	/* Top is the object that our object (op) is going to get inserted above.	1387	/* Top is the object that our object (op) is going to get inserted above.
1342	*/	1388	*/
1343		1389
1344	/* First object on this space */	1390	/* First object on this space */
1345	if (!top)	1391	if (!top)
1346	{	1392	{
1347	op->above = GET_MAP_OB (op->map, op->x, op->y);	1393	op->above = ms.bot;
1348		1394
1349	if (op->above)	1395	if (op->above)
1350	op->above->below = op;	1396	op->above->below = op;
1351		1397
1352	op->below = NULL;	1398	op->below = 0;
1353	op->ms ().bot = op;	1399	ms.bot = op;
1354	}	1400	}
1355	else	1401	else
1356	{ /* get inserted into the stack above top */	1402	{ /* get inserted into the stack above top */
1357	op->above = top->above;	1403	op->above = top->above;
1358		1404
…		…
1361		1407
1362	op->below = top;	1408	op->below = top;
1363	top->above = op;	1409	top->above = op;
1364	}	1410	}
1365		1411
1366	if (op->above == NULL)	1412	if (!op->above)
1367	op->ms ().top = op;	1413	ms.top = op;
1368	} /* else not INS_BELOW_ORIGINATOR */	1414	} /* else not INS_BELOW_ORIGINATOR */
1369		1415
1370	if (op->type == PLAYER)	1416	if (op->type == PLAYER)
		1417	{
1371	op->contr->do_los = 1;	1418	op->contr->do_los = 1;
		1419	++op->map->players;
		1420	op->map->touch ();
		1421	}
		1422
		1423	op->map->dirty = true;
1372		1424
1373	/* If we have a floor, we know the player, if any, will be above	1425	/* If we have a floor, we know the player, if any, will be above
1374	* it, so save a few ticks and start from there.	1426	* it, so save a few ticks and start from there.
1375	*/	1427	*/
1376	if (!(flag & INS_MAP_LOAD))	1428	if (!(flag & INS_MAP_LOAD))
1377	if (object *pl = op->ms ().player ())	1429	if (object *pl = ms.player ())
1378	if (pl->contr->ns)	1430	if (pl->contr->ns)
1379	pl->contr->ns->floorbox_update ();	1431	pl->contr->ns->floorbox_update ();
1380		1432
1381	/* If this object glows, it may affect lighting conditions that are	1433	/* If this object glows, it may affect lighting conditions that are
1382	* visible to others on this map. But update_all_los is really	1434	* visible to others on this map. But update_all_los is really
1383	* an inefficient way to do this, as it means los for all players	1435	* an inefficient way to do this, as it means los for all players
1384	* on the map will get recalculated. The players could very well	1436	* on the map will get recalculated. The players could very well
1385	* be far away from this change and not affected in any way -	1437	* be far away from this change and not affected in any way -
1386	* this should get redone to only look for players within range,	1438	* this should get redone to only look for players within range,
1387	* or just updating the P_NEED_UPDATE for spaces within this area	1439	* or just updating the P_UPTODATE for spaces within this area
1388	* of effect may be sufficient.	1440	* of effect may be sufficient.
1389	*/	1441	*/
1390	if (op->map->darkness && (op->glow_radius != 0))	1442	if (op->map->darkness && (op->glow_radius != 0))
1391	update_all_los (op->map, op->x, op->y);	1443	update_all_los (op->map, op->x, op->y);
1392		1444
…		…
1403	* blocked() and wall() work properly), and these flags are updated by	1455	* blocked() and wall() work properly), and these flags are updated by
1404	* update_object().	1456	* update_object().
1405	*/	1457	*/
1406		1458
1407	/* if this is not the head or flag has been passed, don't check walk on status */	1459	/* if this is not the head or flag has been passed, don't check walk on status */
1408	if (!(flag & INS_NO_WALK_ON) && !op->head)	1460	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1409	{	1461	{
1410	if (check_move_on (op, originator))	1462	if (check_move_on (op, originator))
1411	return 0;	1463	return 0;
1412		1464
1413	/* If we are a multi part object, lets work our way through the check	1465	/* If we are a multi part object, lets work our way through the check
1414	* walk on's.	1466	* walk on's.
1415	*/	1467	*/
1416	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1468	for (object *tmp = op->more; tmp; tmp = tmp->more)
1417	if (check_move_on (tmp, originator))	1469	if (check_move_on (tmp, originator))
1418	return 0;	1470	return 0;
1419	}	1471	}
1420		1472
1421	return op;	1473	return op;
…		…
1430	{	1482	{
1431	object *tmp, *tmp1;	1483	object *tmp, *tmp1;
1432		1484
1433	/* first search for itself and remove any old instances */	1485	/* first search for itself and remove any old instances */
1434		1486
1435	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1487	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1436	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1488	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1437	tmp->destroy ();	1489	tmp->destroy ();
1438		1490
1439	tmp1 = arch_to_object (archetype::find (arch_string));	1491	tmp1 = arch_to_object (archetype::find (arch_string));
1440		1492
1441	tmp1->x = op->x;	1493	tmp1->x = op->x;
1442	tmp1->y = op->y;	1494	tmp1->y = op->y;
1443	insert_ob_in_map (tmp1, op->map, op, 0);	1495	insert_ob_in_map (tmp1, op->map, op, 0);
		1496	}
		1497
		1498	object *
		1499	object::insert_at (object *where, object *originator, int flags)
		1500	{
		1501	return where->map->insert (this, where->x, where->y, originator, flags);
1444	}	1502	}
1445		1503
1446	/*	1504	/*
1447	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1505	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1448	* is returned contains nr objects, and the remaining parts contains	1506	* is returned contains nr objects, and the remaining parts contains
1449	* the rest (or is removed and freed if that number is 0).	1507	* the rest (or is removed and freed if that number is 0).
1450	* On failure, NULL is returned, and the reason put into the	1508	* On failure, NULL is returned, and the reason put into the
1451	* global static errmsg array.	1509	* global static errmsg array.
1452	*/	1510	*/
1453
1454	object *	1511	object *
1455	get_split_ob (object *orig_ob, uint32 nr)	1512	get_split_ob (object *orig_ob, uint32 nr)
1456	{	1513	{
1457	object *newob;	1514	object *newob;
1458	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1515	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1489	* the amount of an object. If the amount reaches 0, the object	1546	* the amount of an object. If the amount reaches 0, the object
1490	* is subsequently removed and freed.	1547	* is subsequently removed and freed.
1491	*	1548	*
1492	* Return value: 'op' if something is left, NULL if the amount reached 0	1549	* Return value: 'op' if something is left, NULL if the amount reached 0
1493	*/	1550	*/
1494
1495	object *	1551	object *
1496	decrease_ob_nr (object *op, uint32 i)	1552	decrease_ob_nr (object *op, uint32 i)
1497	{	1553	{
1498	object *tmp;	1554	object *tmp;
1499		1555
…		…
1574		1630
1575	/*	1631	/*
1576	* add_weight(object, weight) adds the specified weight to an object,	1632	* add_weight(object, weight) adds the specified weight to an object,
1577	* and also updates how much the environment(s) is/are carrying.	1633	* and also updates how much the environment(s) is/are carrying.
1578	*/	1634	*/
1579
1580	void	1635	void
1581	add_weight (object *op, signed long weight)	1636	add_weight (object *op, signed long weight)
1582	{	1637	{
1583	while (op != NULL)	1638	while (op != NULL)
1584	{	1639	{
…		…
1599	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1654	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1600	free (dump);	1655	free (dump);
1601	return op;	1656	return op;
1602	}	1657	}
1603		1658
1604	if (where->head)	1659	if (where->head_ () != where)
1605	{	1660	{
1606	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1661	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1607	where = where->head;	1662	where = where->head;
1608	}	1663	}
1609		1664
1610	return where->insert (op);	1665	return where->insert (op);
1611	}	1666	}
…		…
1616	* inside the object environment.	1671	* inside the object environment.
1617	*	1672	*
1618	* The function returns now pointer to inserted item, and return value can	1673	* The function returns now pointer to inserted item, and return value can
1619	* be != op, if items are merged. -Tero	1674	* be != op, if items are merged. -Tero
1620	*/	1675	*/
1621
1622	object *	1676	object *
1623	object::insert (object *op)	1677	object::insert (object *op)
1624	{	1678	{
1625	object *tmp, *otmp;	1679	object *tmp, *otmp;
1626		1680
…		…
1722	*	1776	*
1723	* MSW 2001-07-08: Check all objects on space, not just those below	1777	* MSW 2001-07-08: Check all objects on space, not just those below
1724	* object being inserted. insert_ob_in_map may not put new objects	1778	* object being inserted. insert_ob_in_map may not put new objects
1725	* on top.	1779	* on top.
1726	*/	1780	*/
1727
1728	int	1781	int
1729	check_move_on (object *op, object *originator)	1782	check_move_on (object *op, object *originator)
1730	{	1783	{
1731	object *tmp;	1784	object *tmp;
1732	maptile *m = op->map;	1785	maptile *m = op->map;
…		…
1759		1812
1760	/* The objects have to be checked from top to bottom.	1813	/* The objects have to be checked from top to bottom.
1761	* Hence, we first go to the top:	1814	* Hence, we first go to the top:
1762	*/	1815	*/
1763		1816
1764	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above)	1817	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1765	{	1818	{
1766	/* Trim the search when we find the first other spell effect	1819	/* Trim the search when we find the first other spell effect
1767	* this helps performance so that if a space has 50 spell objects,	1820	* this helps performance so that if a space has 50 spell objects,
1768	* we don't need to check all of them.	1821	* we don't need to check all of them.
1769	*/	1822	*/
…		…
1787	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1840	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1788	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1841	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1789	{	1842	{
1790		1843
1791	float	1844	float
1792	diff = tmp->move_slow_penalty * FABS (op->speed);	1845	diff = tmp->move_slow_penalty * fabs (op->speed);
1793		1846
1794	if (op->type == PLAYER)	1847	if (op->type == PLAYER)
1795	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1848	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1796	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1849	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1797	diff /= 4.0;	1850	diff /= 4.0;
…		…
1827	* The first matching object is returned, or NULL if none.	1880	* The first matching object is returned, or NULL if none.
1828	*/	1881	*/
1829	object *	1882	object *
1830	present_arch (const archetype *at, maptile *m, int x, int y)	1883	present_arch (const archetype *at, maptile *m, int x, int y)
1831	{	1884	{
1832	if (m == NULL || out_of_map (m, x, y))	1885	if (!m || out_of_map (m, x, y))
1833	{	1886	{
1834	LOG (llevError, "Present_arch called outside map.\n");	1887	LOG (llevError, "Present_arch called outside map.\n");
1835	return NULL;	1888	return NULL;
1836	}	1889	}
1837		1890
1838	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1891	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1839	if (tmp->arch == at)	1892	if (tmp->arch == at)
1840	return tmp;	1893	return tmp;
1841		1894
1842	return NULL;	1895	return NULL;
1843	}	1896	}
…		…
1854	{	1907	{
1855	LOG (llevError, "Present called outside map.\n");	1908	LOG (llevError, "Present called outside map.\n");
1856	return NULL;	1909	return NULL;
1857	}	1910	}
1858		1911
1859	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1912	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1860	if (tmp->type == type)	1913	if (tmp->type == type)
1861	return tmp;	1914	return tmp;
1862		1915
1863	return NULL;	1916	return NULL;
1864	}	1917	}
…		…
1941	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1994	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1942	{	1995	{
1943	CLEAR_FLAG (tmp, flag);	1996	CLEAR_FLAG (tmp, flag);
1944	unflag_inv (tmp, flag);	1997	unflag_inv (tmp, flag);
1945	}	1998	}
1946	}
1947
1948	/*
1949	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1950	* all it's inventory (recursively).
1951	* If checksums are used, a player will get set_cheat called for
1952	* him/her-self and all object carried by a call to this function.
1953	*/
1954	void
1955	set_cheat (object *op)
1956	{
1957	SET_FLAG (op, FLAG_WAS_WIZ);
1958	flag_inv (op, FLAG_WAS_WIZ);
1959	}	1999	}
1960		2000
1961	/*	2001	/*
1962	* find_free_spot(object, map, x, y, start, stop) will search for	2002	* find_free_spot(object, map, x, y, start, stop) will search for
1963	* a spot at the given map and coordinates which will be able to contain	2003	* a spot at the given map and coordinates which will be able to contain
…		…
2004	}	2044	}
2005		2045
2006	if (!index)	2046	if (!index)
2007	return -1;	2047	return -1;
2008		2048
2009	return altern[RANDOM () % index];	2049	return altern [rndm (index)];
2010	}	2050	}
2011		2051
2012	/*	2052	/*
2013	* find_first_free_spot(archetype, maptile, x, y) works like	2053	* find_first_free_spot(archetype, maptile, x, y) works like
2014	* find_free_spot(), but it will search max number of squares.	2054	* find_free_spot(), but it will search max number of squares.
…		…
2035	{	2075	{
2036	arr += begin;	2076	arr += begin;
2037	end -= begin;	2077	end -= begin;
2038		2078
2039	while (--end)	2079	while (--end)
2040	swap (arr [end], arr [RANDOM () % (end + 1)]);	2080	swap (arr [end], arr [rndm (end + 1)]);
2041	}	2081	}
2042		2082
2043	/* new function to make monster searching more efficient, and effective!	2083	/* new function to make monster searching more efficient, and effective!
2044	* This basically returns a randomized array (in the passed pointer) of	2084	* This basically returns a randomized array (in the passed pointer) of
2045	* the spaces to find monsters. In this way, it won't always look for	2085	* the spaces to find monsters. In this way, it won't always look for
…		…
2081	object *tmp;	2121	object *tmp;
2082	maptile *mp;	2122	maptile *mp;
2083		2123
2084	MoveType blocked, move_type;	2124	MoveType blocked, move_type;
2085		2125
2086	if (exclude && exclude->head)	2126	if (exclude && exclude->head_ () != exclude)
2087	{	2127	{
2088	exclude = exclude->head;	2128	exclude = exclude->head;
2089	move_type = exclude->move_type;	2129	move_type = exclude->move_type;
2090	}	2130	}
2091	else	2131	else
…		…
2114	max = maxfree[i];	2154	max = maxfree[i];
2115	else if (mflags & P_IS_ALIVE)	2155	else if (mflags & P_IS_ALIVE)
2116	{	2156	{
2117	for (tmp = ms.bot; tmp; tmp = tmp->above)	2157	for (tmp = ms.bot; tmp; tmp = tmp->above)
2118	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2158	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2119	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2159	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2120	break;	2160	break;
2121		2161
2122	if (tmp)	2162	if (tmp)
2123	return freedir[i];	2163	return freedir[i];
2124	}	2164	}
…		…
2179		2219
2180	return 3;	2220	return 3;
2181	}	2221	}
2182		2222
2183	/*	2223	/*
2184	* absdir(int): Returns a number between 1 and 8, which represent
2185	* the "absolute" direction of a number (it actually takes care of
2186	* "overflow" in previous calculations of a direction).
2187	*/
2188
2189	int
2190	absdir (int d)
2191	{
2192	while (d < 1)
2193	d += 8;
2194
2195	while (d > 8)
2196	d -= 8;
2197
2198	return d;
2199	}
2200
2201	/*
2202	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2224	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2203	* between two directions (which are expected to be absolute (see absdir())	2225	* between two directions (which are expected to be absolute (see absdir())
2204	*/	2226	*/
2205
2206	int	2227	int
2207	dirdiff (int dir1, int dir2)	2228	dirdiff (int dir1, int dir2)
2208	{	2229	{
2209	int d;	2230	int d;
2210		2231
…		…
2338	* create clone from object to another	2359	* create clone from object to another
2339	*/	2360	*/
2340	object *	2361	object *
2341	object_create_clone (object *asrc)	2362	object_create_clone (object *asrc)
2342	{	2363	{
2343	object *dst = 0, *tmp, *src, *part, *prev, *item;	2364	object *dst = 0, *tmp, *src, *prev, *item;
2344		2365
2345	if (!asrc)	2366	if (!asrc)
2346	return 0;	2367	return 0;
2347		2368
2348	src = asrc;
2349	if (src->head)
2350	src = src->head;	2369	src = asrc->head_ ();
2351		2370
2352	prev = 0;	2371	prev = 0;
2353	for (part = src; part; part = part->more)	2372	for (object *part = src; part; part = part->more)
2354	{	2373	{
2355	tmp = part->clone ();	2374	tmp = part->clone ();
2356	tmp->x -= src->x;	2375	tmp->x -= src->x;
2357	tmp->y -= src->y;	2376	tmp->y -= src->y;
2358		2377
…		…
2376	insert_ob_in_ob (object_create_clone (item), dst);	2395	insert_ob_in_ob (object_create_clone (item), dst);
2377		2396
2378	return dst;	2397	return dst;
2379	}	2398	}
2380		2399
2381	/* GROS - Creates an object using a string representing its content. */
2382	/* Basically, we save the content of the string to a temp file, then call */
2383	/* load_object on it. I admit it is a highly inefficient way to make things, */
2384	/* but it was simple to make and allows reusing the load_object function. */
2385	/* Remember not to use load_object_str in a time-critical situation. */
2386	/* Also remember that multiparts objects are not supported for now. */
2387	object *
2388	load_object_str (const char *obstr)
2389	{
2390	object *op;
2391	char filename[MAX_BUF];
2392
2393	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2394
2395	FILE *tempfile = fopen (filename, "w");
2396
2397	if (tempfile == NULL)
2398	{
2399	LOG (llevError, "Error - Unable to access load object temp file\n");
2400	return NULL;
2401	}
2402
2403	fprintf (tempfile, obstr);
2404	fclose (tempfile);
2405
2406	op = object::create ();
2407
2408	object_thawer thawer (filename);
2409
2410	if (thawer)
2411	load_object (thawer, op, 0);
2412
2413	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2414	CLEAR_FLAG (op, FLAG_REMOVED);
2415
2416	return op;
2417	}
2418
2419	/* This returns the first object in who's inventory that	2400	/* This returns the first object in who's inventory that
2420	* has the same type and subtype match.	2401	* has the same type and subtype match.
2421	* returns NULL if no match.	2402	* returns NULL if no match.
2422	*/	2403	*/
2423	object *	2404	object *
…		…
2476	if (link->key == canonical_key)	2457	if (link->key == canonical_key)
2477	return link->value;	2458	return link->value;
2478		2459
2479	return 0;	2460	return 0;
2480	}	2461	}
2481
2482		2462
2483	/*	2463	/*
2484	* Updates the canonical_key in op to value.	2464	* Updates the canonical_key in op to value.
2485	*	2465	*
2486	* canonical_key is a shared string (value doesn't have to be).	2466	* canonical_key is a shared string (value doesn't have to be).
…		…
2510	/* Basically, if the archetype has this key set,	2490	/* Basically, if the archetype has this key set,
2511	* we need to store the null value so when we save	2491	* we need to store the null value so when we save
2512	* it, we save the empty value so that when we load,	2492	* it, we save the empty value so that when we load,
2513	* we get this value back again.	2493	* we get this value back again.
2514	*/	2494	*/
2515	if (get_ob_key_link (&op->arch->clone, canonical_key))	2495	if (get_ob_key_link (op->arch, canonical_key))
2516	field->value = 0;	2496	field->value = 0;
2517	else	2497	else
2518	{	2498	{
2519	if (last)	2499	if (last)
2520	last->next = field->next;	2500	last->next = field->next;
…		…
2589	}	2569	}
2590	else	2570	else
2591	item = item->env;	2571	item = item->env;
2592	}	2572	}
2593		2573
		2574	const char *
		2575	object::flag_desc (char *desc, int len) const
		2576	{
		2577	char *p = desc;
		2578	bool first = true;
		2579
		2580	*p = 0;
		2581
		2582	for (int i = 0; i < NUM_FLAGS; i++)
		2583	{
		2584	if (len <= 10) // magic constant!
		2585	{
		2586	snprintf (p, len, ",...");
		2587	break;
		2588	}
		2589
		2590	if (flag [i])
		2591	{
		2592	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2593	len -= cnt;
		2594	p += cnt;
		2595	first = false;
		2596	}
		2597	}
		2598
		2599	return desc;
		2600	}
		2601
2594	// return a suitable string describing an objetc in enough detail to find it	2602	// return a suitable string describing an object in enough detail to find it
2595	const char *	2603	const char *
2596	object::debug_desc (char *info) const	2604	object::debug_desc (char *info) const
2597	{	2605	{
		2606	char flagdesc[512];
2598	char info2[256 * 3];	2607	char info2[256 * 4];
2599	char *p = info;	2608	char *p = info;
2600		2609
2601	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2610	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2602	count,	2611	count, uuid.seq,
2603	&name,	2612	&name,
2604	title ? " " : "",	2613	title ? "\",title:\"" : "",
2605	title ? (const char *)title : "");	2614	title ? (const char *)title : "",
		2615	flag_desc (flagdesc, 512), type);
2606		2616
2607	if (env)	2617	if (env)
2608	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2618	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2609		2619
2610	if (map)	2620	if (map)
2611	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2621	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2612		2622
2613	return info;	2623	return info;
2614	}	2624	}
2615		2625
2616	const char *	2626	const char *
2617	object::debug_desc () const	2627	object::debug_desc () const
2618	{	2628	{
2619	static char info[256 * 3];	2629	static char info[3][256 * 4];
		2630	static int info_idx;
		2631
2620	return debug_desc (info);	2632	return debug_desc (info [++info_idx % 3]);
2621	}	2633	}
2622		2634
		2635	struct region *
		2636	object::region () const
		2637	{
		2638	return map ? map->region (x, y)
		2639	: region::default_region ();
		2640	}
		2641
		2642	const materialtype_t *
		2643	object::dominant_material () const
		2644	{
		2645	if (materialtype_t *mt = name_to_material (materialname))
		2646	return mt;
		2647
		2648	return name_to_material (shstr_unknown);
		2649	}
		2650
		2651	void
		2652	object::open_container (object *new_container)
		2653	{
		2654	if (container == new_container)
		2655	return;
		2656
		2657	if (object *old_container = container)
		2658	{
		2659	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2660	return;
		2661
		2662	#if 0
		2663	// remove the "Close old_container" object.
		2664	if (object *closer = old_container->inv)
		2665	if (closer->type == CLOSE_CON)
		2666	closer->destroy ();
		2667	#endif
		2668
		2669	old_container->flag [FLAG_APPLIED] = 0;
		2670	container = 0;
		2671
		2672	esrv_update_item (UPD_FLAGS, this, old_container);
		2673	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2674	}
		2675
		2676	if (new_container)
		2677	{
		2678	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2679	return;
		2680
		2681	// TODO: this does not seem to serve any purpose anymore?
		2682	#if 0
		2683	// insert the "Close Container" object.
		2684	if (archetype *closer = new_container->other_arch)
		2685	{
		2686	object *closer = arch_to_object (new_container->other_arch);
		2687	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2688	new_container->insert (closer);
		2689	}
		2690	#endif
		2691
		2692	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2693
		2694	new_container->flag [FLAG_APPLIED] = 1;
		2695	container = new_container;
		2696
		2697	esrv_update_item (UPD_FLAGS, this, new_container);
		2698	esrv_send_inventory (this, new_container);
		2699	}
		2700	}
		2701
		2702	object *
		2703	object::force_find (const shstr name)
		2704	{
		2705	/* cycle through his inventory to look for the MARK we want to
		2706	* place
		2707	*/
		2708	for (object *tmp = inv; tmp; tmp = tmp->below)
		2709	if (tmp->type == FORCE && tmp->slaying == name)
		2710	return splay (tmp);
		2711
		2712	return 0;
		2713	}
		2714
		2715	void
		2716	object::force_add (const shstr name, int duration)
		2717	{
		2718	if (object *force = force_find (name))
		2719	force->destroy ();
		2720
		2721	object *force = get_archetype (FORCE_NAME);
		2722
		2723	force->slaying = name;
		2724	force->stats.food = 1;
		2725	force->speed_left = -1.f;
		2726
		2727	force->set_speed (duration ? 1.f / duration : 0.f);
		2728	force->flag [FLAG_IS_USED_UP] = true;
		2729	force->flag [FLAG_APPLIED] = true;
		2730
		2731	insert (force);
		2732	}
		2733
		2734

Diff Legend

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