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.78 by root, Fri Dec 22 16:34:00 2006 UTC vs.
Revision 1.125 by root, Sat Jan 27 23:59:29 2007 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* CrossFire, A Multiplayer game for X-windows
3		3	*
		4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (C) 2001 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (C) 1992 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* This program 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 2 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, write to the Free Software
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, 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 at <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>
…		…
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,
…		…
141	* objects with lists are rare, and lists stay short. If not, use a	143	* objects with lists are rare, and lists stay short. If not, use a
142	* different structure or at least keep the lists sorted...	144	* different structure or at least keep the lists sorted...
143	*/	145	*/
144		146
145	/* For each field in wants, */	147	/* For each field in wants, */
146	for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)	148	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)
147	{	149	{
148	key_value *has_field;	150	key_value *has_field;
149		151
150	/* Look for a field in has with the same key. */	152	/* Look for a field in has with the same key. */
151	has_field = get_ob_key_link (has, wants_field->key);	153	has_field = get_ob_key_link (has, wants_field->key);
…		…
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
…		…
221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	222	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
222		223
223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	224	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	225	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
225		226
226	if ((ob1->flags ^ ob2->flags).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	227	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
227	|| ob1->arch != ob2->arch	228	|| ob1->arch != ob2->arch
228	|| ob1->name != ob2->name	229	|| ob1->name != ob2->name
229	|| ob1->title != ob2->title	230	|| ob1->title != ob2->title
230	|| ob1->msg != ob2->msg	231	|| ob1->msg != ob2->msg
231	|| ob1->weight != ob2->weight	232	|| ob1->weight != ob2->weight
…		…
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:
…		…
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, 3);	370	save_object (freezer, op, 1);
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	}
…		…
482	{	481	{
483	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
484	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
485		484
486	*(object_copy *)dst = *this;	485	*(object_copy *)dst = *this;
487	*(object_pod *)dst = *this;
488
489	if (self || cb)
490	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst));
491		486
492	if (is_freed)	487	if (is_freed)
493	SET_FLAG (dst, FLAG_FREED);	488	SET_FLAG (dst, FLAG_FREED);
494		489
495	if (is_removed)	490	if (is_removed)
496	SET_FLAG (dst, FLAG_REMOVED);	491	SET_FLAG (dst, FLAG_REMOVED);
497		492
498	if (speed < 0)	493	if (speed < 0)
499	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;	494	dst->speed_left = speed_left - rndm ();
500		495
501	/* Copy over key_values, if any. */	496	/* Copy over key_values, if any. */
502	if (key_values)	497	if (key_values)
503	{	498	{
504	key_value *tail = 0;	499	key_value *tail = 0;
…		…
526	tail = new_link;	521	tail = new_link;
527	}	522	}
528	}	523	}
529	}	524	}
530		525
531	update_ob_speed (dst);	526	dst->set_speed (dst->speed);
532	}	527	}
533		528
534	object *	529	object *
535	object::clone ()	530	object::clone ()
536	{	531	{
…		…
542	/*	537	/*
543	* If an object with the IS_TURNABLE() flag needs to be turned due	538	* If an object with the IS_TURNABLE() flag needs to be turned due
544	* to the closest player being on the other side, this function can	539	* to the closest player being on the other side, this function can
545	* be called to update the face variable, _and_ how it looks on the map.	540	* be called to update the face variable, _and_ how it looks on the map.
546	*/	541	*/
547
548	void	542	void
549	update_turn_face (object *op)	543	update_turn_face (object *op)
550	{	544	{
551	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	545	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
552	return;	546	return;
		547
553	SET_ANIMATION (op, op->direction);	548	SET_ANIMATION (op, op->direction);
554	update_object (op, UP_OBJ_FACE);	549	update_object (op, UP_OBJ_FACE);
555	}	550	}
556		551
557	/*	552	/*
558	* Updates the speed of an object. If the speed changes from 0 to another	553	* Updates the speed of an object. If the speed changes from 0 to another
559	* value, or vice versa, then add/remove the object from the active list.	554	* value, or vice versa, then add/remove the object from the active list.
560	* This function needs to be called whenever the speed of an object changes.	555	* This function needs to be called whenever the speed of an object changes.
561	*/	556	*/
562	void	557	void
563	update_ob_speed (object *op)	558	object::set_speed (float speed)
564	{	559	{
565	extern int arch_init;	560	if (flag [FLAG_FREED] && speed)
566
567	/* No reason putting the archetypes objects on the speed list,
568	* since they never really need to be updated.
569	*/
570
571	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
572	{	561	{
573	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	562	LOG (llevError, "Object %s is freed but has speed.\n", &name);
574	#ifdef MANY_CORES
575	abort ();
576	#else
577	op->speed = 0;	563	speed = 0;
578	#endif
579	}
580
581	if (arch_init)
582	return;
583
584	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
585	{	564	}
586	/* If already on active list, don't do anything */
587	if (op->active_next || op->active_prev || op == active_objects)
588	return;
589		565
590	/* process_events() expects us to insert the object at the beginning	566	this->speed = speed;
591	* of the list. */
592	op->active_next = active_objects;
593		567
594	if (op->active_next != NULL)	568	if (has_active_speed ())
595	op->active_next->active_prev = op;	569	activate ();
596
597	active_objects = op;
598	}
599	else	570	else
600	{	571	deactivate ();
601	/* If not on the active list, nothing needs to be done */
602	if (!op->active_next && !op->active_prev && op != active_objects)
603	return;
604
605	if (op->active_prev == NULL)
606	{
607	active_objects = op->active_next;
608
609	if (op->active_next != NULL)
610	op->active_next->active_prev = NULL;
611	}
612	else
613	{
614	op->active_prev->active_next = op->active_next;
615
616	if (op->active_next)
617	op->active_next->active_prev = op->active_prev;
618	}
619
620	op->active_next = NULL;
621	op->active_prev = NULL;
622	}
623	}
624
625	/* This function removes object 'op' from the list of active
626	* objects.
627	* This should only be used for style maps or other such
628	* reference maps where you don't want an object that isn't
629	* in play chewing up cpu time getting processed.
630	* The reverse of this is to call update_ob_speed, which
631	* will do the right thing based on the speed of the object.
632	*/
633	void
634	remove_from_active_list (object *op)
635	{
636	/* If not on the active list, nothing needs to be done */
637	if (!op->active_next && !op->active_prev && op != active_objects)
638	return;
639
640	if (op->active_prev == NULL)
641	{
642	active_objects = op->active_next;
643	if (op->active_next != NULL)
644	op->active_next->active_prev = NULL;
645	}
646	else
647	{
648	op->active_prev->active_next = op->active_next;
649	if (op->active_next)
650	op->active_next->active_prev = op->active_prev;
651	}
652	op->active_next = NULL;
653	op->active_prev = NULL;
654	}	572	}
655		573
656	/*	574	/*
657	* update_object() updates the the map.	575	* update_object() updates the the map.
658	* It takes into account invisible objects (and represent squares covered	576	* It takes into account invisible objects (and represent squares covered
…		…
695	*/	613	*/
696	if (!op->map || op->map->in_memory == MAP_SAVING)	614	if (!op->map || op->map->in_memory == MAP_SAVING)
697	return;	615	return;
698		616
699	/* make sure the object is within map boundaries */	617	/* make sure the object is within map boundaries */
700	if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))	618	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
701	{	619	{
702	LOG (llevError, "update_object() called for object out of map!\n");	620	LOG (llevError, "update_object() called for object out of map!\n");
703	#ifdef MANY_CORES	621	#ifdef MANY_CORES
704	abort ();	622	abort ();
705	#endif	623	#endif
706	return;	624	return;
707	}	625	}
708		626
709	mapspace &m = op->ms ();	627	mapspace &m = op->ms ();
710		628
711	if (m.flags_ & P_NEED_UPDATE)	629	if (!(m.flags_ & P_UPTODATE))
712	/* nop */;	630	/* nop */;
713	else if (action == UP_OBJ_INSERT)	631	else if (action == UP_OBJ_INSERT)
714	{	632	{
715	// this is likely overkill, TODO: revisit (schmorp)	633	// this is likely overkill, TODO: revisit (schmorp)
716	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	634	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
…		…
725	/* This isn't perfect, but I don't expect a lot of objects to	643	/* This isn't perfect, but I don't expect a lot of objects to
726	* to have move_allow right now.	644	* to have move_allow right now.
727	*/	645	*/
728	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	646	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
729	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	647	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
730	m.flags_ = P_NEED_UPDATE;	648	m.flags_ = 0;
731	}	649	}
732	/* if the object is being removed, we can't make intelligent	650	/* if the object is being removed, we can't make intelligent
733	* decisions, because remove_ob can't really pass the object	651	* decisions, because remove_ob can't really pass the object
734	* that is being removed.	652	* that is being removed.
735	*/	653	*/
736	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	654	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
737	m.flags_ = P_NEED_UPDATE;	655	m.flags_ = 0;
738	else if (action == UP_OBJ_FACE)	656	else if (action == UP_OBJ_FACE)
739	/* Nothing to do for that case */ ;	657	/* Nothing to do for that case */ ;
740	else	658	else
741	LOG (llevError, "update_object called with invalid action: %d\n", action);	659	LOG (llevError, "update_object called with invalid action: %d\n", action);
742		660
743	if (op->more)	661	if (op->more)
744	update_object (op->more, action);	662	update_object (op->more, action);
745	}	663	}
746		664
747	object::vector object::mortals;
748	object::vector object::objects; // not yet used
749	object *object::first;
750
751	void object::free_mortals ()
752	{
753	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
754	if ((*i)->refcnt)
755	++i; // further delay freeing
756	else
757	{
758	delete *i;
759	mortals.erase (i);
760	}
761	}
762
763	object::object ()	665	object::object ()
764	{	666	{
765	SET_FLAG (this, FLAG_REMOVED);	667	SET_FLAG (this, FLAG_REMOVED);
766		668
767	expmul = 1.0;	669	expmul = 1.0;
768	face = blank_face;	670	face = blank_face;
769	}	671	}
770		672
771	object::~object ()	673	object::~object ()
772	{	674	{
		675	unlink ();
		676
773	free_key_values (this);	677	free_key_values (this);
774	}	678	}
775		679
		680	static int object_count;
		681
776	void object::link ()	682	void object::link ()
777	{	683	{
778	count = ++ob_count;	684	assert (!index);//D
779	uuid = gen_uuid ();	685	uuid = gen_uuid ();
		686	count = ++object_count;
780		687
781	prev = 0;	688	refcnt_inc ();
782	next = object::first;	689	objects.insert (this);
783
784	if (object::first)
785	object::first->prev = this;
786
787	object::first = this;
788	}	690	}
789		691
790	void object::unlink ()	692	void object::unlink ()
791	{	693	{
792	if (this == object::first)	694	if (!index)
793	object::first = next;	695	return;
794		696
795	/* Remove this object from the list of used objects */	697	objects.erase (this);
796	if (prev) prev->next = next;	698	refcnt_dec ();
797	if (next) next->prev = prev;	699	}
798		700
799	prev = 0;	701	void
800	next = 0;	702	object::activate ()
		703	{
		704	/* If already on active list, don't do anything */
		705	if (active)
		706	return;
		707
		708	if (has_active_speed ())
		709	actives.insert (this);
		710	}
		711
		712	void
		713	object::activate_recursive ()
		714	{
		715	activate ();
		716
		717	for (object *op = inv; op; op = op->below)
		718	op->activate_recursive ();
		719	}
		720
		721	/* This function removes object 'op' from the list of active
		722	* objects.
		723	* This should only be used for style maps or other such
		724	* reference maps where you don't want an object that isn't
		725	* in play chewing up cpu time getting processed.
		726	* The reverse of this is to call update_ob_speed, which
		727	* will do the right thing based on the speed of the object.
		728	*/
		729	void
		730	object::deactivate ()
		731	{
		732	/* If not on the active list, nothing needs to be done */
		733	if (!active)
		734	return;
		735
		736	actives.erase (this);
		737	}
		738
		739	void
		740	object::deactivate_recursive ()
		741	{
		742	for (object *op = inv; op; op = op->below)
		743	op->deactivate_recursive ();
		744
		745	deactivate ();
		746	}
		747
		748	void
		749	object::set_flag_inv (int flag, int value)
		750	{
		751	for (object *op = inv; op; op = op->below)
		752	{
		753	op->flag [flag] = value;
		754	op->set_flag_inv (flag, value);
		755	}
		756	}
		757
		758	/*
		759	* Remove and free all objects in the inventory of the given object.
		760	* object.c ?
		761	*/
		762	void
		763	object::destroy_inv (bool drop_to_ground)
		764	{
		765	// need to check first, because the checks below might segfault
		766	// as we might be on an invalid mapspace and crossfire code
		767	// is too buggy to ensure that the inventory is empty.
		768	// corollary: if you create arrows etc. with stuff in tis inventory,
		769	// cf will crash below with off-map x and y
		770	if (!inv)
		771	return;
		772
		773	/* Only if the space blocks everything do we not process -
		774	* if some form of movement is allowed, let objects
		775	* drop on that space.
		776	*/
		777	if (!drop_to_ground
		778	|| !map
		779	|| map->in_memory != MAP_IN_MEMORY
		780	|| map->nodrop
		781	|| ms ().move_block == MOVE_ALL)
		782	{
		783	while (inv)
		784	{
		785	inv->destroy_inv (drop_to_ground);
		786	inv->destroy ();
		787	}
		788	}
		789	else
		790	{ /* Put objects in inventory onto this space */
		791	while (inv)
		792	{
		793	object *op = inv;
		794
		795	if (op->flag [FLAG_STARTEQUIP]
		796	|| op->flag [FLAG_NO_DROP]
		797	|| op->type == RUNE
		798	|| op->type == TRAP
		799	|| op->flag [FLAG_IS_A_TEMPLATE]
		800	|| op->flag [FLAG_DESTROY_ON_DEATH])
		801	op->destroy ();
		802	else
		803	map->insert (op, x, y);
		804	}
		805	}
801	}	806	}
802		807
803	object *object::create ()	808	object *object::create ()
804	{	809	{
805	object *op = new object;	810	object *op = new object;
806	op->link ();	811	op->link ();
807	return op;	812	return op;
808	}	813	}
809		814
810	/*	815	void
811	* free_object() frees everything allocated by an object, removes	816	object::do_destroy ()
812	* it from the list of used objects, and puts it on the list of
813	* free objects. The IS_FREED() flag is set in the object.
814	* The object must have been removed by remove_ob() first for
815	* this function to succeed.
816	*
817	* If destroy_inventory is set, free inventory as well. Else drop items in
818	* inventory to the ground.
819	*/
820	void object::destroy (bool destroy_inventory)
821	{	817	{
822	if (QUERY_FLAG (this, FLAG_FREED))	818	attachable::do_destroy ();
823	return;
824		819
825	if (QUERY_FLAG (this, FLAG_FRIENDLY))	820	if (flag [FLAG_IS_LINKED])
		821	remove_button_link (this);
		822
		823	if (flag [FLAG_FRIENDLY])
826	remove_friendly_object (this);	824	remove_friendly_object (this);
827		825
828	if (!QUERY_FLAG (this, FLAG_REMOVED))	826	if (!flag [FLAG_REMOVED])
829	remove ();	827	remove ();
830		828
831	SET_FLAG (this, FLAG_FREED);	829	destroy_inv (true);
832		830
833	if (more)	831	deactivate ();
834	{	832	unlink ();
835	more->destroy (destroy_inventory);
836	more = 0;
837	}
838		833
839	if (inv)	834	flag [FLAG_FREED] = 1;
840	{
841	/* Only if the space blocks everything do we not process -
842	* if some form of movement is allowed, let objects
843	* drop on that space.
844	*/
845	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
846	{
847	object *op = inv;
848
849	while (op)
850	{
851	object *tmp = op->below;
852	op->destroy (destroy_inventory);
853	op = tmp;
854	}
855	}
856	else
857	{ /* Put objects in inventory onto this space */
858	object *op = inv;
859
860	while (op)
861	{
862	object *tmp = op->below;
863
864	op->remove ();
865
866	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
867	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
868	op->destroy ();
869	else
870	{
871	op->x = x;
872	op->y = y;
873	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
874	}
875
876	op = tmp;
877	}
878	}
879	}
880		835
881	// hack to ensure that freed objects still have a valid map	836	// hack to ensure that freed objects still have a valid map
882	{	837	{
883	static maptile *freed_map; // freed objects are moved here to avoid crashes	838	static maptile *freed_map; // freed objects are moved here to avoid crashes
884		839
…		…
888		843
889	freed_map->name = "/internal/freed_objects_map";	844	freed_map->name = "/internal/freed_objects_map";
890	freed_map->width = 3;	845	freed_map->width = 3;
891	freed_map->height = 3;	846	freed_map->height = 3;
892		847
893	freed_map->allocate ();	848	freed_map->alloc ();
		849	freed_map->in_memory = MAP_IN_MEMORY;
894	}	850	}
895		851
896	map = freed_map;	852	map = freed_map;
897	x = 1;	853	x = 1;
898	y = 1;	854	y = 1;
899	}	855	}
900		856
		857	head = 0;
		858
		859	if (more)
		860	{
		861	more->destroy ();
		862	more = 0;
		863	}
		864
901	// clear those pointers that likely might have circular references to us	865	// clear those pointers that likely might have circular references to us
902	owner = 0;	866	owner = 0;
903	enemy = 0;	867	enemy = 0;
904	attacked_by = 0;	868	attacked_by = 0;
		869	}
905		870
906	// only relevant for players(?), but make sure of it anyways	871	void
907	contr = 0;	872	object::destroy (bool destroy_inventory)
		873	{
		874	if (destroyed ())
		875	return;
908		876
909	/* Remove object from the active list */	877	if (destroy_inventory)
910	speed = 0;	878	destroy_inv (false);
911	update_ob_speed (this);
912		879
913	unlink ();	880	attachable::destroy ();
914
915	mortals.push_back (this);
916	}	881	}
917		882
918	/*	883	/*
919	* sub_weight() recursively (outwards) subtracts a number from the	884	* sub_weight() recursively (outwards) subtracts a number from the
920	* weight of an object (and what is carried by it's environment(s)).	885	* weight of an object (and what is carried by it's environment(s)).
…		…
936	* This function removes the object op from the linked list of objects	901	* This function removes the object op from the linked list of objects
937	* which it is currently tied to. When this function is done, the	902	* which it is currently tied to. When this function is done, the
938	* object will have no environment. If the object previously had an	903	* object will have no environment. If the object previously had an
939	* environment, the x and y coordinates will be updated to	904	* environment, the x and y coordinates will be updated to
940	* the previous environment.	905	* the previous environment.
941	* Beware: This function is called from the editor as well!
942	*/	906	*/
943	void	907	void
944	object::remove ()	908	object::remove_slow ()
945	{	909	{
946	object *tmp, *last = 0;	910	object *tmp, *last = 0;
947	object *otmp;	911	object *otmp;
948		912
949	int check_walk_off;
950
951	if (QUERY_FLAG (this, FLAG_REMOVED))	913	if (QUERY_FLAG (this, FLAG_REMOVED))
952	return;	914	return;
953		915
954	SET_FLAG (this, FLAG_REMOVED);	916	SET_FLAG (this, FLAG_REMOVED);
		917	INVOKE_OBJECT (REMOVE, this);
955		918
956	if (more)	919	if (more)
957	more->remove ();	920	more->remove ();
958		921
959	/*	922	/*
…		…
972	* to save cpu time.	935	* to save cpu time.
973	*/	936	*/
974	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	937	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
975	otmp->update_stats ();	938	otmp->update_stats ();
976		939
977	if (above != NULL)	940	if (above)
978	above->below = below;	941	above->below = below;
979	else	942	else
980	env->inv = below;	943	env->inv = below;
981		944
982	if (below != NULL)	945	if (below)
983	below->above = above;	946	below->above = above;
984		947
985	/* we set up values so that it could be inserted into	948	/* we set up values so that it could be inserted into
986	* the map, but we don't actually do that - it is up	949	* the map, but we don't actually do that - it is up
987	* to the caller to decide what we want to do.	950	* to the caller to decide what we want to do.
…		…
991	above = 0, below = 0;	954	above = 0, below = 0;
992	env = 0;	955	env = 0;
993	}	956	}
994	else if (map)	957	else if (map)
995	{	958	{
996	/* Re did the following section of code - it looks like it had	959	if (type == PLAYER)
997	* lots of logic for things we no longer care about
998	*/	960	{
		961	--map->players;
		962	map->touch ();
		963	}
		964
		965	map->dirty = true;
		966	mapspace &ms = this->ms ();
999		967
1000	/* link the object above us */	968	/* link the object above us */
1001	if (above)	969	if (above)
1002	above->below = below;	970	above->below = below;
1003	else	971	else
1004	map->at (x, y).top = below; /* we were top, set new top */	972	ms.top = below; /* we were top, set new top */
1005		973
1006	/* Relink the object below us, if there is one */	974	/* Relink the object below us, if there is one */
1007	if (below)	975	if (below)
1008	below->above = above;	976	below->above = above;
1009	else	977	else
…		…
1011	/* Nothing below, which means we need to relink map object for this space	979	/* Nothing below, which means we need to relink map object for this space
1012	* use translated coordinates in case some oddness with map tiling is	980	* use translated coordinates in case some oddness with map tiling is
1013	* evident	981	* evident
1014	*/	982	*/
1015	if (GET_MAP_OB (map, x, y) != this)	983	if (GET_MAP_OB (map, x, y) != this)
1016	{
1017	char *dump = dump_object (this);
1018	LOG (llevError,
1019	"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);	984	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 ());
1020	free (dump);
1021	dump = dump_object (GET_MAP_OB (map, x, y));
1022	LOG (llevError, "%s\n", dump);
1023	free (dump);
1024	}
1025		985
1026	map->at (x, y).bottom = above; /* goes on above it. */	986	ms.bot = above; /* goes on above it. */
1027	}	987	}
1028		988
1029	above = 0;	989	above = 0;
1030	below = 0;	990	below = 0;
1031		991
1032	if (map->in_memory == MAP_SAVING)	992	if (map->in_memory == MAP_SAVING)
1033	return;	993	return;
1034		994
1035	check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);	995	int check_walk_off = !flag [FLAG_NO_APPLY];
1036		996
1037	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	997	for (tmp = ms.bot; tmp; tmp = tmp->above)
1038	{	998	{
1039	/* No point updating the players look faces if he is the object	999	/* No point updating the players look faces if he is the object
1040	* being removed.	1000	* being removed.
1041	*/	1001	*/
1042		1002
…		…
1046	* removed (most likely destroyed), update the player view	1006	* removed (most likely destroyed), update the player view
1047	* appropriately.	1007	* appropriately.
1048	*/	1008	*/
1049	if (tmp->container == this)	1009	if (tmp->container == this)
1050	{	1010	{
1051	CLEAR_FLAG (this, FLAG_APPLIED);	1011	flag [FLAG_APPLIED] = 0;
1052	tmp->container = 0;	1012	tmp->container = 0;
1053	}	1013	}
1054		1014
		1015	if (tmp->contr->ns)
1055	tmp->contr->ns->floorbox_update ();	1016	tmp->contr->ns->floorbox_update ();
1056	}	1017	}
1057		1018
1058	/* See if player moving off should effect something */	1019	/* See if object moving off should effect something */
1059	if (check_walk_off	1020	if (check_walk_off
1060	&& ((move_type & tmp->move_off)	1021	&& ((move_type & tmp->move_off)
1061	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1022	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1062	{	1023	{
1063	move_apply (tmp, this, 0);	1024	move_apply (tmp, this, 0);
…		…
1065	if (destroyed ())	1026	if (destroyed ())
1066	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1027	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1067	}	1028	}
1068		1029
1069	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1030	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1070		1031	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1071	if (tmp->above == tmp)	1032	if (tmp->above == tmp)
1072	tmp->above = 0;	1033	tmp->above = 0;
1073		1034
1074	last = tmp;	1035	last = tmp;
1075	}	1036	}
1076		1037
1077	/* last == NULL of there are no objects on this space */	1038	/* last == NULL if there are no objects on this space */
		1039	//TODO: this makes little sense, why only update the topmost object?
1078	if (!last)	1040	if (!last)
1079	map->at (x, y).flags_ = P_NEED_UPDATE;	1041	map->at (x, y).flags_ = 0;
1080	else	1042	else
1081	update_object (last, UP_OBJ_REMOVE);	1043	update_object (last, UP_OBJ_REMOVE);
1082		1044
1083	if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)	1045	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1084	update_all_los (map, x, y);	1046	update_all_los (map, x, y);
1085	}	1047	}
1086	}	1048	}
1087		1049
1088	/*	1050	/*
…		…
1097	merge_ob (object *op, object *top)	1059	merge_ob (object *op, object *top)
1098	{	1060	{
1099	if (!op->nrof)	1061	if (!op->nrof)
1100	return 0;	1062	return 0;
1101		1063
1102	if (top == NULL)	1064	if (top)
1103	for (top = op; top != NULL && top->above != NULL; top = top->above);	1065	for (top = op; top && top->above; top = top->above)
		1066	;
1104		1067
1105	for (; top != NULL; top = top->below)	1068	for (; top; top = top->below)
1106	{	1069	{
1107	if (top == op)	1070	if (top == op)
1108	continue;	1071	continue;
1109		1072
1110	if (object::can_merge (op, top))	1073	if (object::can_merge (op, top))
…		…
1120		1083
1121	return 0;	1084	return 0;
1122	}	1085	}
1123		1086
1124	/*	1087	/*
1125	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1088	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1126	* job preparing multi-part monsters	1089	* job preparing multi-part monsters.
1127	*/	1090	*/
1128	object *	1091	object *
1129	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1092	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1130	{	1093	{
1131	object *tmp;
1132
1133	if (op->head)
1134	op = op->head;
1135
1136	for (tmp = op; tmp; tmp = tmp->more)	1094	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1137	{	1095	{
1138	tmp->x = x + tmp->arch->clone.x;	1096	tmp->x = x + tmp->arch->clone.x;
1139	tmp->y = y + tmp->arch->clone.y;	1097	tmp->y = y + tmp->arch->clone.y;
1140	}	1098	}
1141		1099
…		…
1160	* Return value:	1118	* Return value:
1161	* new object if 'op' was merged with other object	1119	* new object if 'op' was merged with other object
1162	* NULL if 'op' was destroyed	1120	* NULL if 'op' was destroyed
1163	* just 'op' otherwise	1121	* just 'op' otherwise
1164	*/	1122	*/
1165
1166	object *	1123	object *
1167	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1124	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1168	{	1125	{
1169	object *tmp, *top, *floor = NULL;	1126	object *tmp, *top, *floor = NULL;
1170	sint16 x, y;
1171		1127
1172	if (QUERY_FLAG (op, FLAG_FREED))	1128	if (QUERY_FLAG (op, FLAG_FREED))
1173	{	1129	{
1174	LOG (llevError, "Trying to insert freed object!\n");	1130	LOG (llevError, "Trying to insert freed object!\n");
1175	return NULL;	1131	return NULL;
1176	}	1132	}
1177		1133
1178	if (m == NULL)	1134	if (!QUERY_FLAG (op, FLAG_REMOVED))
		1135	LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
		1136
		1137	op->remove ();
		1138
		1139	if (!m)
1179	{	1140	{
1180	char *dump = dump_object (op);	1141	char *dump = dump_object (op);
1181	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1142	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1182	free (dump);	1143	free (dump);
1183	return op;	1144	return op;
…		…
1196	#endif	1157	#endif
1197	free (dump);	1158	free (dump);
1198	return op;	1159	return op;
1199	}	1160	}
1200		1161
1201	if (!QUERY_FLAG (op, FLAG_REMOVED))
1202	{
1203	char *dump = dump_object (op);
1204	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1205	free (dump);
1206	return op;
1207	}
1208
1209	if (op->more != NULL)
1210	{
1211	/* The part may be on a different map. */
1212
1213	object *more = op->more;	1162	if (object *more = op->more)
1214		1163	{
1215	/* We really need the caller to normalize coordinates - if
1216	* we set the map, that doesn't work if the location is within
1217	* a map and this is straddling an edge. So only if coordinate
1218	* is clear wrong do we normalize it.
1219	*/
1220	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1221	more->map = get_map_from_coord (m, &more->x, &more->y);
1222	else if (!more->map)
1223	{
1224	/* For backwards compatibility - when not dealing with tiled maps,
1225	* more->map should always point to the parent.
1226	*/
1227	more->map = m;
1228	}
1229
1230	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1164	if (!insert_ob_in_map (more, m, originator, flag))
1231	{	1165	{
1232	if (!op->head)	1166	if (!op->head)
1233	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1167	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1234		1168
1235	return NULL;	1169	return 0;
1236	}	1170	}
1237	}	1171	}
1238		1172
1239	CLEAR_FLAG (op, FLAG_REMOVED);	1173	CLEAR_FLAG (op, FLAG_REMOVED);
1240		1174
1241	/* Ideally, the caller figures this out. However, it complicates a lot	1175	/* Ideally, the caller figures this out. However, it complicates a lot
1242	* of areas of callers (eg, anything that uses find_free_spot would now	1176	* of areas of callers (eg, anything that uses find_free_spot would now
1243	* need extra work	1177	* need extra work
1244	*/	1178	*/
1245	op->map = get_map_from_coord (m, &op->x, &op->y);	1179	if (!xy_normalise (m, op->x, op->y))
1246	x = op->x;	1180	return 0;
1247	y = op->y;	1181
		1182	op->map = m;
		1183	mapspace &ms = op->ms ();
1248		1184
1249	/* this has to be done after we translate the coordinates.	1185	/* this has to be done after we translate the coordinates.
1250	*/	1186	*/
1251	if (op->nrof && !(flag & INS_NO_MERGE))	1187	if (op->nrof && !(flag & INS_NO_MERGE))
1252	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1188	for (tmp = ms.bot; tmp; tmp = tmp->above)
1253	if (object::can_merge (op, tmp))	1189	if (object::can_merge (op, tmp))
1254	{	1190	{
1255	op->nrof += tmp->nrof;	1191	op->nrof += tmp->nrof;
1256	tmp->destroy ();	1192	tmp->destroy ();
1257	}	1193	}
…		…
1274	op->below = originator->below;	1210	op->below = originator->below;
1275		1211
1276	if (op->below)	1212	if (op->below)
1277	op->below->above = op;	1213	op->below->above = op;
1278	else	1214	else
1279	op->ms ().bottom = op;	1215	ms.bot = op;
1280		1216
1281	/* since *below* originator, no need to update top */	1217	/* since *below* originator, no need to update top */
1282	originator->below = op;	1218	originator->below = op;
1283	}	1219	}
1284	else	1220	else
1285	{	1221	{
		1222	top = ms.bot;
		1223
1286	/* If there are other objects, then */	1224	/* If there are other objects, then */
1287	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1225	if ((!(flag & INS_MAP_LOAD)) && top)
1288	{	1226	{
1289	object *last = NULL;	1227	object *last = 0;
1290		1228
1291	/*	1229	/*
1292	* If there are multiple objects on this space, we do some trickier handling.	1230	* If there are multiple objects on this space, we do some trickier handling.
1293	* We've already dealt with merging if appropriate.	1231	* We've already dealt with merging if appropriate.
1294	* Generally, we want to put the new object on top. But if	1232	* Generally, we want to put the new object on top. But if
…		…
1298	* once we get to them. This reduces the need to traverse over all of	1236	* once we get to them. This reduces the need to traverse over all of
1299	* them when adding another one - this saves quite a bit of cpu time	1237	* them when adding another one - this saves quite a bit of cpu time
1300	* when lots of spells are cast in one area. Currently, it is presumed	1238	* when lots of spells are cast in one area. Currently, it is presumed
1301	* that flying non pickable objects are spell objects.	1239	* that flying non pickable objects are spell objects.
1302	*/	1240	*/
1303		1241	for (top = ms.bot; top; top = top->above)
1304	while (top != NULL)
1305	{	1242	{
1306	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1243	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1307	floor = top;	1244	floor = top;
1308		1245
1309	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1246	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1312	top = top->below;	1249	top = top->below;
1313	break;	1250	break;
1314	}	1251	}
1315		1252
1316	last = top;	1253	last = top;
1317	top = top->above;
1318	}	1254	}
1319		1255
1320	/* Don't want top to be NULL, so set it to the last valid object */	1256	/* Don't want top to be NULL, so set it to the last valid object */
1321	top = last;	1257	top = last;
1322		1258
…		…
1329	* Unless those objects are exits, type 66	1265	* Unless those objects are exits, type 66
1330	* If INS_ON_TOP is used, don't do this processing	1266	* If INS_ON_TOP is used, don't do this processing
1331	* Need to find the object that in fact blocks view, otherwise	1267	* Need to find the object that in fact blocks view, otherwise
1332	* stacking is a bit odd.	1268	* stacking is a bit odd.
1333	*/	1269	*/
1334	if (!(flag & INS_ON_TOP) &&	1270	if (!(flag & INS_ON_TOP)
1335	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1271	&& ms.flags () & P_BLOCKSVIEW
		1272	&& (op->face && !op->face->visibility))
1336	{	1273	{
1337	for (last = top; last != floor; last = last->below)	1274	for (last = top; last != floor; last = last->below)
1338	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1275	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1339	break;	1276	break;
		1277
1340	/* Check to see if we found the object that blocks view,	1278	/* Check to see if we found the object that blocks view,
1341	* and make sure we have a below pointer for it so that	1279	* and make sure we have a below pointer for it so that
1342	* we can get inserted below this one, which requires we	1280	* we can get inserted below this one, which requires we
1343	* set top to the object below us.	1281	* set top to the object below us.
1344	*/	1282	*/
…		…
1346	top = last->below;	1284	top = last->below;
1347	}	1285	}
1348	} /* If objects on this space */	1286	} /* If objects on this space */
1349		1287
1350	if (flag & INS_MAP_LOAD)	1288	if (flag & INS_MAP_LOAD)
1351	top = GET_MAP_TOP (op->map, op->x, op->y);	1289	top = ms.top;
1352		1290
1353	if (flag & INS_ABOVE_FLOOR_ONLY)	1291	if (flag & INS_ABOVE_FLOOR_ONLY)
1354	top = floor;	1292	top = floor;
1355		1293
1356	/* Top is the object that our object (op) is going to get inserted above.	1294	/* Top is the object that our object (op) is going to get inserted above.
1357	*/	1295	*/
1358		1296
1359	/* First object on this space */	1297	/* First object on this space */
1360	if (!top)	1298	if (!top)
1361	{	1299	{
1362	op->above = GET_MAP_OB (op->map, op->x, op->y);	1300	op->above = ms.bot;
1363		1301
1364	if (op->above)	1302	if (op->above)
1365	op->above->below = op;	1303	op->above->below = op;
1366		1304
1367	op->below = NULL;	1305	op->below = 0;
1368	op->ms ().bottom = op;	1306	ms.bot = op;
1369	}	1307	}
1370	else	1308	else
1371	{ /* get inserted into the stack above top */	1309	{ /* get inserted into the stack above top */
1372	op->above = top->above;	1310	op->above = top->above;
1373		1311
…		…
1376		1314
1377	op->below = top;	1315	op->below = top;
1378	top->above = op;	1316	top->above = op;
1379	}	1317	}
1380		1318
1381	if (op->above == NULL)	1319	if (!op->above)
1382	op->ms ().top = op;	1320	ms.top = op;
1383	} /* else not INS_BELOW_ORIGINATOR */	1321	} /* else not INS_BELOW_ORIGINATOR */
1384		1322
1385	if (op->type == PLAYER)	1323	if (op->type == PLAYER)
		1324	{
1386	op->contr->do_los = 1;	1325	op->contr->do_los = 1;
		1326	++op->map->players;
		1327	op->map->touch ();
		1328	}
		1329
		1330	op->map->dirty = true;
1387		1331
1388	/* If we have a floor, we know the player, if any, will be above	1332	/* If we have a floor, we know the player, if any, will be above
1389	* it, so save a few ticks and start from there.	1333	* it, so save a few ticks and start from there.
1390	*/	1334	*/
1391	if (!(flag & INS_MAP_LOAD))	1335	if (!(flag & INS_MAP_LOAD))
1392	if (object *pl = op->ms ().player ())	1336	if (object *pl = ms.player ())
		1337	if (pl->contr->ns)
1393	pl->contr->ns->floorbox_update ();	1338	pl->contr->ns->floorbox_update ();
1394		1339
1395	/* If this object glows, it may affect lighting conditions that are	1340	/* If this object glows, it may affect lighting conditions that are
1396	* visible to others on this map. But update_all_los is really	1341	* visible to others on this map. But update_all_los is really
1397	* an inefficient way to do this, as it means los for all players	1342	* an inefficient way to do this, as it means los for all players
1398	* on the map will get recalculated. The players could very well	1343	* on the map will get recalculated. The players could very well
1399	* be far away from this change and not affected in any way -	1344	* be far away from this change and not affected in any way -
1400	* this should get redone to only look for players within range,	1345	* this should get redone to only look for players within range,
1401	* or just updating the P_NEED_UPDATE for spaces within this area	1346	* or just updating the P_UPTODATE for spaces within this area
1402	* of effect may be sufficient.	1347	* of effect may be sufficient.
1403	*/	1348	*/
1404	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1349	if (op->map->darkness && (op->glow_radius != 0))
1405	update_all_los (op->map, op->x, op->y);	1350	update_all_los (op->map, op->x, op->y);
1406		1351
1407	/* updates flags (blocked, alive, no magic, etc) for this map space */	1352	/* updates flags (blocked, alive, no magic, etc) for this map space */
1408	update_object (op, UP_OBJ_INSERT);	1353	update_object (op, UP_OBJ_INSERT);
		1354
		1355	INVOKE_OBJECT (INSERT, op);
1409		1356
1410	/* Don't know if moving this to the end will break anything. However,	1357	/* Don't know if moving this to the end will break anything. However,
1411	* we want to have floorbox_update called before calling this.	1358	* we want to have floorbox_update called before calling this.
1412	*	1359	*
1413	* check_move_on() must be after this because code called from	1360	* check_move_on() must be after this because code called from
…		…
1418		1365
1419	/* if this is not the head or flag has been passed, don't check walk on status */	1366	/* if this is not the head or flag has been passed, don't check walk on status */
1420	if (!(flag & INS_NO_WALK_ON) && !op->head)	1367	if (!(flag & INS_NO_WALK_ON) && !op->head)
1421	{	1368	{
1422	if (check_move_on (op, originator))	1369	if (check_move_on (op, originator))
1423	return NULL;	1370	return 0;
1424		1371
1425	/* If we are a multi part object, lets work our way through the check	1372	/* If we are a multi part object, lets work our way through the check
1426	* walk on's.	1373	* walk on's.
1427	*/	1374	*/
1428	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1375	for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1429	if (check_move_on (tmp, originator))	1376	if (check_move_on (tmp, originator))
1430	return NULL;	1377	return 0;
1431	}	1378	}
1432		1379
1433	return op;	1380	return op;
1434	}	1381	}
1435		1382
…		…
1442	{	1389	{
1443	object *tmp, *tmp1;	1390	object *tmp, *tmp1;
1444		1391
1445	/* first search for itself and remove any old instances */	1392	/* first search for itself and remove any old instances */
1446		1393
1447	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1394	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1448	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1395	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1449	tmp->destroy ();	1396	tmp->destroy ();
1450		1397
1451	tmp1 = arch_to_object (archetype::find (arch_string));	1398	tmp1 = arch_to_object (archetype::find (arch_string));
1452		1399
1453	tmp1->x = op->x;	1400	tmp1->x = op->x;
1454	tmp1->y = op->y;	1401	tmp1->y = op->y;
1455	insert_ob_in_map (tmp1, op->map, op, 0);	1402	insert_ob_in_map (tmp1, op->map, op, 0);
		1403	}
		1404
		1405	object *
		1406	object::insert_at (object *where, object *originator, int flags)
		1407	{
		1408	where->map->insert (this, where->x, where->y, originator, flags);
1456	}	1409	}
1457		1410
1458	/*	1411	/*
1459	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1412	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1460	* is returned contains nr objects, and the remaining parts contains	1413	* is returned contains nr objects, and the remaining parts contains
1461	* the rest (or is removed and freed if that number is 0).	1414	* the rest (or is removed and freed if that number is 0).
1462	* On failure, NULL is returned, and the reason put into the	1415	* On failure, NULL is returned, and the reason put into the
1463	* global static errmsg array.	1416	* global static errmsg array.
1464	*/	1417	*/
1465
1466	object *	1418	object *
1467	get_split_ob (object *orig_ob, uint32 nr)	1419	get_split_ob (object *orig_ob, uint32 nr)
1468	{	1420	{
1469	object *newob;	1421	object *newob;
1470	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1422	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1506		1458
1507	object *	1459	object *
1508	decrease_ob_nr (object *op, uint32 i)	1460	decrease_ob_nr (object *op, uint32 i)
1509	{	1461	{
1510	object *tmp;	1462	object *tmp;
1511	player *pl;
1512		1463
1513	if (i == 0) /* objects with op->nrof require this check */	1464	if (i == 0) /* objects with op->nrof require this check */
1514	return op;	1465	return op;
1515		1466
1516	if (i > op->nrof)	1467	if (i > op->nrof)
…		…
1529	* IMO, searching through all the players will mostly	1480	* IMO, searching through all the players will mostly
1530	* likely be quicker than following op->env to the map,	1481	* likely be quicker than following op->env to the map,
1531	* and then searching the map for a player.	1482	* and then searching the map for a player.
1532	*/	1483	*/
1533	if (!tmp)	1484	if (!tmp)
1534	{	1485	for_all_players (pl)
1535	for (pl = first_player; pl; pl = pl->next)
1536	if (pl->ob->container == op->env)	1486	if (pl->ob->container == op->env)
1537	{	1487	{
1538	tmp = pl->ob;	1488	tmp = pl->ob;
1539	break;	1489	break;
1540	}	1490	}
1541	}
1542		1491
1543	if (i < op->nrof)	1492	if (i < op->nrof)
1544	{	1493	{
1545	sub_weight (op->env, op->weight * i);	1494	sub_weight (op->env, op->weight * i);
1546	op->nrof -= i;	1495	op->nrof -= i;
…		…
1696	if ((op->glow_radius != 0) && map)	1645	if ((op->glow_radius != 0) && map)
1697	{	1646	{
1698	#ifdef DEBUG_LIGHTS	1647	#ifdef DEBUG_LIGHTS
1699	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1648	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1700	#endif /* DEBUG_LIGHTS */	1649	#endif /* DEBUG_LIGHTS */
1701	if (MAP_DARKNESS (map))	1650	if (map->darkness)
1702	update_all_los (map, x, y);	1651	update_all_los (map, x, y);
1703	}	1652	}
1704		1653
1705	/* Client has no idea of ordering so lets not bother ordering it here.	1654	/* Client has no idea of ordering so lets not bother ordering it here.
1706	* It sure simplifies this function...	1655	* It sure simplifies this function...
…		…
1711	{	1660	{
1712	op->below = inv;	1661	op->below = inv;
1713	op->below->above = op;	1662	op->below->above = op;
1714	inv = op;	1663	inv = op;
1715	}	1664	}
		1665
		1666	INVOKE_OBJECT (INSERT, this);
1716		1667
1717	return op;	1668	return op;
1718	}	1669	}
1719		1670
1720	/*	1671	/*
…		…
1735	*	1686	*
1736	* MSW 2001-07-08: Check all objects on space, not just those below	1687	* MSW 2001-07-08: Check all objects on space, not just those below
1737	* object being inserted. insert_ob_in_map may not put new objects	1688	* object being inserted. insert_ob_in_map may not put new objects
1738	* on top.	1689	* on top.
1739	*/	1690	*/
1740
1741	int	1691	int
1742	check_move_on (object *op, object *originator)	1692	check_move_on (object *op, object *originator)
1743	{	1693	{
1744	object *tmp;	1694	object *tmp;
1745	maptile *m = op->map;	1695	maptile *m = op->map;
…		…
1772		1722
1773	/* The objects have to be checked from top to bottom.	1723	/* The objects have to be checked from top to bottom.
1774	* Hence, we first go to the top:	1724	* Hence, we first go to the top:
1775	*/	1725	*/
1776		1726
1777	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1727	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1778	{	1728	{
1779	/* Trim the search when we find the first other spell effect	1729	/* Trim the search when we find the first other spell effect
1780	* this helps performance so that if a space has 50 spell objects,	1730	* this helps performance so that if a space has 50 spell objects,
1781	* we don't need to check all of them.	1731	* we don't need to check all of them.
1782	*/	1732	*/
…		…
1800	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1750	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1801	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1751	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1802	{	1752	{
1803		1753
1804	float	1754	float
1805	diff = tmp->move_slow_penalty * FABS (op->speed);	1755	diff = tmp->move_slow_penalty * fabs (op->speed);
1806		1756
1807	if (op->type == PLAYER)	1757	if (op->type == PLAYER)
1808	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1758	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1809	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1759	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1810	diff /= 4.0;	1760	diff /= 4.0;
…		…
1837	/*	1787	/*
1838	* present_arch(arch, map, x, y) searches for any objects with	1788	* present_arch(arch, map, x, y) searches for any objects with
1839	* a matching archetype at the given map and coordinates.	1789	* a matching archetype at the given map and coordinates.
1840	* The first matching object is returned, or NULL if none.	1790	* The first matching object is returned, or NULL if none.
1841	*/	1791	*/
1842
1843	object *	1792	object *
1844	present_arch (const archetype *at, maptile *m, int x, int y)	1793	present_arch (const archetype *at, maptile *m, int x, int y)
1845	{	1794	{
1846	object *
1847	tmp;
1848
1849	if (m == NULL || out_of_map (m, x, y))	1795	if (!m || out_of_map (m, x, y))
1850	{	1796	{
1851	LOG (llevError, "Present_arch called outside map.\n");	1797	LOG (llevError, "Present_arch called outside map.\n");
1852	return NULL;	1798	return NULL;
1853	}	1799	}
1854	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1800
		1801	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1855	if (tmp->arch == at)	1802	if (tmp->arch == at)
1856	return tmp;	1803	return tmp;
		1804
1857	return NULL;	1805	return NULL;
1858	}	1806	}
1859		1807
1860	/*	1808	/*
1861	* present(type, map, x, y) searches for any objects with	1809	* present(type, map, x, y) searches for any objects with
1862	* a matching type variable at the given map and coordinates.	1810	* a matching type variable at the given map and coordinates.
1863	* The first matching object is returned, or NULL if none.	1811	* The first matching object is returned, or NULL if none.
1864	*/	1812	*/
1865
1866	object *	1813	object *
1867	present (unsigned char type, maptile *m, int x, int y)	1814	present (unsigned char type, maptile *m, int x, int y)
1868	{	1815	{
1869	object *
1870	tmp;
1871
1872	if (out_of_map (m, x, y))	1816	if (out_of_map (m, x, y))
1873	{	1817	{
1874	LOG (llevError, "Present called outside map.\n");	1818	LOG (llevError, "Present called outside map.\n");
1875	return NULL;	1819	return NULL;
1876	}	1820	}
1877	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1821
		1822	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1878	if (tmp->type == type)	1823	if (tmp->type == type)
1879	return tmp;	1824	return tmp;
		1825
1880	return NULL;	1826	return NULL;
1881	}	1827	}
1882		1828
1883	/*	1829	/*
1884	* present_in_ob(type, object) searches for any objects with	1830	* present_in_ob(type, object) searches for any objects with
1885	* a matching type variable in the inventory of the given object.	1831	* a matching type variable in the inventory of the given object.
1886	* The first matching object is returned, or NULL if none.	1832	* The first matching object is returned, or NULL if none.
1887	*/	1833	*/
1888
1889	object *	1834	object *
1890	present_in_ob (unsigned char type, const object *op)	1835	present_in_ob (unsigned char type, const object *op)
1891	{	1836	{
1892	object *
1893	tmp;
1894
1895	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1837	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1896	if (tmp->type == type)	1838	if (tmp->type == type)
1897	return tmp;	1839	return tmp;
		1840
1898	return NULL;	1841	return NULL;
1899	}	1842	}
1900		1843
1901	/*	1844	/*
1902	* present_in_ob (type, str, object) searches for any objects with	1845	* present_in_ob (type, str, object) searches for any objects with
…		…
1910	* str is the string to match against. Note that we match against	1853	* str is the string to match against. Note that we match against
1911	* the object name, not the archetype name. this is so that the	1854	* the object name, not the archetype name. this is so that the
1912	* spell code can use one object type (force), but change it's name	1855	* spell code can use one object type (force), but change it's name
1913	* to be unique.	1856	* to be unique.
1914	*/	1857	*/
1915
1916	object *	1858	object *
1917	present_in_ob_by_name (int type, const char *str, const object *op)	1859	present_in_ob_by_name (int type, const char *str, const object *op)
1918	{	1860	{
1919	object *
1920	tmp;
1921
1922	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1861	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1923	{
1924	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1862	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
1925	return tmp;	1863	return tmp;
1926	}	1864
1927	return NULL;	1865	return 0;
1928	}	1866	}
1929		1867
1930	/*	1868	/*
1931	* present_arch_in_ob(archetype, object) searches for any objects with	1869	* present_arch_in_ob(archetype, object) searches for any objects with
1932	* a matching archetype in the inventory of the given object.	1870	* a matching archetype in the inventory of the given object.
1933	* The first matching object is returned, or NULL if none.	1871	* The first matching object is returned, or NULL if none.
1934	*/	1872	*/
1935
1936	object *	1873	object *
1937	present_arch_in_ob (const archetype *at, const object *op)	1874	present_arch_in_ob (const archetype *at, const object *op)
1938	{	1875	{
1939	object *
1940	tmp;
1941
1942	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1876	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1943	if (tmp->arch == at)	1877	if (tmp->arch == at)
1944	return tmp;	1878	return tmp;
		1879
1945	return NULL;	1880	return NULL;
1946	}	1881	}
1947		1882
1948	/*	1883	/*
1949	* activate recursively a flag on an object inventory	1884	* activate recursively a flag on an object inventory
1950	*/	1885	*/
1951	void	1886	void
1952	flag_inv (object *op, int flag)	1887	flag_inv (object *op, int flag)
1953	{	1888	{
1954	object *
1955	tmp;
1956
1957	if (op->inv)	1889	if (op->inv)
1958	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1890	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1959	{	1891	{
1960	SET_FLAG (tmp, flag);	1892	SET_FLAG (tmp, flag);
1961	flag_inv (tmp, flag);	1893	flag_inv (tmp, flag);
1962	}	1894	}
1963	} /*	1895	}
		1896
		1897	/*
1964	* desactivate recursively a flag on an object inventory	1898	* deactivate recursively a flag on an object inventory
1965	*/	1899	*/
1966	void	1900	void
1967	unflag_inv (object *op, int flag)	1901	unflag_inv (object *op, int flag)
1968	{	1902	{
1969	object *
1970	tmp;
1971
1972	if (op->inv)	1903	if (op->inv)
1973	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1904	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1974	{	1905	{
1975	CLEAR_FLAG (tmp, flag);	1906	CLEAR_FLAG (tmp, flag);
1976	unflag_inv (tmp, flag);	1907	unflag_inv (tmp, flag);
1977	}	1908	}
1978	}	1909	}
…		…
1981	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in	1912	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1982	* all it's inventory (recursively).	1913	* all it's inventory (recursively).
1983	* If checksums are used, a player will get set_cheat called for	1914	* If checksums are used, a player will get set_cheat called for
1984	* him/her-self and all object carried by a call to this function.	1915	* him/her-self and all object carried by a call to this function.
1985	*/	1916	*/
1986
1987	void	1917	void
1988	set_cheat (object *op)	1918	set_cheat (object *op)
1989	{	1919	{
1990	SET_FLAG (op, FLAG_WAS_WIZ);	1920	SET_FLAG (op, FLAG_WAS_WIZ);
1991	flag_inv (op, FLAG_WAS_WIZ);	1921	flag_inv (op, FLAG_WAS_WIZ);
…		…
2010	* because arch_blocked (now ob_blocked) needs to know the movement type	1940	* because arch_blocked (now ob_blocked) needs to know the movement type
2011	* to know if the space in question will block the object. We can't use	1941	* to know if the space in question will block the object. We can't use
2012	* the archetype because that isn't correct if the monster has been	1942	* the archetype because that isn't correct if the monster has been
2013	* customized, changed states, etc.	1943	* customized, changed states, etc.
2014	*/	1944	*/
2015
2016	int	1945	int
2017	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1946	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2018	{	1947	{
2019	int
2020	i,
2021	index = 0, flag;	1948	int index = 0, flag;
2022	static int
2023	altern[SIZEOFFREE];	1949	int altern[SIZEOFFREE];
2024		1950
2025	for (i = start; i < stop; i++)	1951	for (int i = start; i < stop; i++)
2026	{	1952	{
2027	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1953	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2028	if (!flag)	1954	if (!flag)
2029	altern[index++] = i;	1955	altern [index++] = i;
2030		1956
2031	/* Basically, if we find a wall on a space, we cut down the search size.	1957	/* Basically, if we find a wall on a space, we cut down the search size.
2032	* In this way, we won't return spaces that are on another side of a wall.	1958	* In this way, we won't return spaces that are on another side of a wall.
2033	* This mostly work, but it cuts down the search size in all directions -	1959	* This mostly work, but it cuts down the search size in all directions -
2034	* if the space being examined only has a wall to the north and empty	1960	* if the space being examined only has a wall to the north and empty
…		…
2041	}	1967	}
2042		1968
2043	if (!index)	1969	if (!index)
2044	return -1;	1970	return -1;
2045		1971
2046	return altern[RANDOM () % index];	1972	return altern [rndm (index)];
2047	}	1973	}
2048		1974
2049	/*	1975	/*
2050	* find_first_free_spot(archetype, maptile, x, y) works like	1976	* find_first_free_spot(archetype, maptile, x, y) works like
2051	* find_free_spot(), but it will search max number of squares.	1977	* find_free_spot(), but it will search max number of squares.
2052	* But it will return the first available spot, not a random choice.	1978	* But it will return the first available spot, not a random choice.
2053	* Changed 0.93.2: Have it return -1 if there is no free spot available.	1979	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2054	*/	1980	*/
2055
2056	int	1981	int
2057	find_first_free_spot (const object *ob, maptile *m, int x, int y)	1982	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2058	{	1983	{
2059	int
2060	i;
2061
2062	for (i = 0; i < SIZEOFFREE; i++)	1984	for (int i = 0; i < SIZEOFFREE; i++)
2063	{
2064	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	1985	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2065	return i;	1986	return i;
2066	}	1987
2067	return -1;	1988	return -1;
2068	}	1989	}
2069		1990
2070	/*	1991	/*
2071	* The function permute(arr, begin, end) randomly reorders the array	1992	* The function permute(arr, begin, end) randomly reorders the array
2072	* arr[begin..end-1].	1993	* arr[begin..end-1].
		1994	* now uses a fisher-yates shuffle, old permute was broken
2073	*/	1995	*/
2074	static void	1996	static void
2075	permute (int *arr, int begin, int end)	1997	permute (int *arr, int begin, int end)
2076	{	1998	{
2077	int	1999	arr += begin;
2078	i,
2079	j,
2080	tmp,
2081	len;
2082
2083	len = end - begin;	2000	end -= begin;
2084	for (i = begin; i < end; i++)
2085	{
2086	j = begin + RANDOM () % len;
2087		2001
2088	tmp = arr[i];	2002	while (--end)
2089	arr[i] = arr[j];	2003	swap (arr [end], arr [rndm (end + 1)]);
2090	arr[j] = tmp;
2091	}
2092	}	2004	}
2093		2005
2094	/* new function to make monster searching more efficient, and effective!	2006	/* new function to make monster searching more efficient, and effective!
2095	* This basically returns a randomized array (in the passed pointer) of	2007	* This basically returns a randomized array (in the passed pointer) of
2096	* the spaces to find monsters. In this way, it won't always look for	2008	* the spaces to find monsters. In this way, it won't always look for
…		…
2099	* the 3x3 area will be searched, just not in a predictable order.	2011	* the 3x3 area will be searched, just not in a predictable order.
2100	*/	2012	*/
2101	void	2013	void
2102	get_search_arr (int *search_arr)	2014	get_search_arr (int *search_arr)
2103	{	2015	{
2104	int	2016	int i;
2105	i;
2106		2017
2107	for (i = 0; i < SIZEOFFREE; i++)	2018	for (i = 0; i < SIZEOFFREE; i++)
2108	{
2109	search_arr[i] = i;	2019	search_arr[i] = i;
2110	}
2111		2020
2112	permute (search_arr, 1, SIZEOFFREE1 + 1);	2021	permute (search_arr, 1, SIZEOFFREE1 + 1);
2113	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2022	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2114	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2023	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2115	}	2024	}
…		…
2124	* Perhaps incorrectly, but I'm making the assumption that exclude	2033	* Perhaps incorrectly, but I'm making the assumption that exclude
2125	* is actually want is going to try and move there. We need this info	2034	* is actually want is going to try and move there. We need this info
2126	* because we have to know what movement the thing looking to move	2035	* because we have to know what movement the thing looking to move
2127	* there is capable of.	2036	* there is capable of.
2128	*/	2037	*/
2129
2130	int	2038	int
2131	find_dir (maptile *m, int x, int y, object *exclude)	2039	find_dir (maptile *m, int x, int y, object *exclude)
2132	{	2040	{
2133	int
2134	i,
2135	max = SIZEOFFREE, mflags;	2041	int i, max = SIZEOFFREE, mflags;
2136		2042
2137	sint16 nx, ny;	2043	sint16 nx, ny;
2138	object *	2044	object *tmp;
2139	tmp;
2140	maptile *	2045	maptile *mp;
2141	mp;
2142		2046
2143	MoveType blocked, move_type;	2047	MoveType blocked, move_type;
2144		2048
2145	if (exclude && exclude->head)	2049	if (exclude && exclude->head)
2146	{	2050	{
…		…
2163		2067
2164	if (mflags & P_OUT_OF_MAP)	2068	if (mflags & P_OUT_OF_MAP)
2165	max = maxfree[i];	2069	max = maxfree[i];
2166	else	2070	else
2167	{	2071	{
2168	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2072	mapspace &ms = mp->at (nx, ny);
		2073
		2074	blocked = ms.move_block;
2169		2075
2170	if ((move_type & blocked) == move_type)	2076	if ((move_type & blocked) == move_type)
2171	max = maxfree[i];	2077	max = maxfree[i];
2172	else if (mflags & P_IS_ALIVE)	2078	else if (mflags & P_IS_ALIVE)
2173	{	2079	{
2174	for (tmp = GET_MAP_OB (mp, nx, ny); tmp; tmp = tmp->above)	2080	for (tmp = ms.bot; tmp; tmp = tmp->above)
2175	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2081	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
		2082	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))
2176	break;	2083	break;
2177		2084
2178	if (tmp)	2085	if (tmp)
2179	return freedir[i];	2086	return freedir[i];
2180	}	2087	}
…		…
2186		2093
2187	/*	2094	/*
2188	* distance(object 1, object 2) will return the square of the	2095	* distance(object 1, object 2) will return the square of the
2189	* distance between the two given objects.	2096	* distance between the two given objects.
2190	*/	2097	*/
2191
2192	int	2098	int
2193	distance (const object *ob1, const object *ob2)	2099	distance (const object *ob1, const object *ob2)
2194	{	2100	{
2195	int i;
2196
2197	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2101	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2198	return i;
2199	}	2102	}
2200		2103
2201	/*	2104	/*
2202	* find_dir_2(delta-x,delta-y) will return a direction in which	2105	* find_dir_2(delta-x,delta-y) will return a direction in which
2203	* an object which has subtracted the x and y coordinates of another	2106	* an object which has subtracted the x and y coordinates of another
2204	* object, needs to travel toward it.	2107	* object, needs to travel toward it.
2205	*/	2108	*/
2206
2207	int	2109	int
2208	find_dir_2 (int x, int y)	2110	find_dir_2 (int x, int y)
2209	{	2111	{
2210	int q;	2112	int q;
2211		2113
…		…
2240		2142
2241	return 3;	2143	return 3;
2242	}	2144	}
2243		2145
2244	/*	2146	/*
2245	* absdir(int): Returns a number between 1 and 8, which represent
2246	* the "absolute" direction of a number (it actually takes care of
2247	* "overflow" in previous calculations of a direction).
2248	*/
2249
2250	int
2251	absdir (int d)
2252	{
2253	while (d < 1)
2254	d += 8;
2255	while (d > 8)
2256	d -= 8;
2257	return d;
2258	}
2259
2260	/*
2261	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2147	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2262	* between two directions (which are expected to be absolute (see absdir())	2148	* between two directions (which are expected to be absolute (see absdir())
2263	*/	2149	*/
2264
2265	int	2150	int
2266	dirdiff (int dir1, int dir2)	2151	dirdiff (int dir1, int dir2)
2267	{	2152	{
2268	int	2153	int d;
2269	d;
2270		2154
2271	d = abs (dir1 - dir2);	2155	d = abs (dir1 - dir2);
2272	if (d > 4)	2156	if (d > 4)
2273	d = 8 - d;	2157	d = 8 - d;
		2158
2274	return d;	2159	return d;
2275	}	2160	}
2276		2161
2277	/* peterm:	2162	/* peterm:
2278	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2163	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2281	* This basically means that if direction is 15, then it could either go	2166	* This basically means that if direction is 15, then it could either go
2282	* direction 4, 14, or 16 to get back to where we are.	2167	* direction 4, 14, or 16 to get back to where we are.
2283	* Moved from spell_util.c to object.c with the other related direction	2168	* Moved from spell_util.c to object.c with the other related direction
2284	* functions.	2169	* functions.
2285	*/	2170	*/
2286
2287	int
2288	reduction_dir[SIZEOFFREE][3] = {	2171	int reduction_dir[SIZEOFFREE][3] = {
2289	{0, 0, 0}, /* 0 */	2172	{0, 0, 0}, /* 0 */
2290	{0, 0, 0}, /* 1 */	2173	{0, 0, 0}, /* 1 */
2291	{0, 0, 0}, /* 2 */	2174	{0, 0, 0}, /* 2 */
2292	{0, 0, 0}, /* 3 */	2175	{0, 0, 0}, /* 3 */
2293	{0, 0, 0}, /* 4 */	2176	{0, 0, 0}, /* 4 */
…		…
2443	/* Basically, we save the content of the string to a temp file, then call */	2326	/* Basically, we save the content of the string to a temp file, then call */
2444	/* load_object on it. I admit it is a highly inefficient way to make things, */	2327	/* load_object on it. I admit it is a highly inefficient way to make things, */
2445	/* but it was simple to make and allows reusing the load_object function. */	2328	/* but it was simple to make and allows reusing the load_object function. */
2446	/* Remember not to use load_object_str in a time-critical situation. */	2329	/* Remember not to use load_object_str in a time-critical situation. */
2447	/* Also remember that multiparts objects are not supported for now. */	2330	/* Also remember that multiparts objects are not supported for now. */
2448
2449	object *	2331	object *
2450	load_object_str (const char *obstr)	2332	load_object_str (const char *obstr)
2451	{	2333	{
2452	object *op;	2334	object *op;
2453	char filename[MAX_BUF];	2335	char filename[MAX_BUF];
…		…
2483	* returns NULL if no match.	2365	* returns NULL if no match.
2484	*/	2366	*/
2485	object *	2367	object *
2486	find_obj_by_type_subtype (const object *who, int type, int subtype)	2368	find_obj_by_type_subtype (const object *who, int type, int subtype)
2487	{	2369	{
2488	object *tmp;
2489
2490	for (tmp = who->inv; tmp; tmp = tmp->below)	2370	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2491	if (tmp->type == type && tmp->subtype == subtype)	2371	if (tmp->type == type && tmp->subtype == subtype)
2492	return tmp;	2372	return tmp;
2493		2373
2494	return NULL;	2374	return 0;
2495	}	2375	}
2496		2376
2497	/* If ob has a field named key, return the link from the list,	2377	/* If ob has a field named key, return the link from the list,
2498	* otherwise return NULL.	2378	* otherwise return NULL.
2499	*	2379	*
…		…
2501	* do the desired thing.	2381	* do the desired thing.
2502	*/	2382	*/
2503	key_value *	2383	key_value *
2504	get_ob_key_link (const object *ob, const char *key)	2384	get_ob_key_link (const object *ob, const char *key)
2505	{	2385	{
2506	key_value *link;
2507
2508	for (link = ob->key_values; link != NULL; link = link->next)	2386	for (key_value *link = ob->key_values; link; link = link->next)
2509	if (link->key == key)	2387	if (link->key == key)
2510	return link;	2388	return link;
2511		2389
2512	return NULL;	2390	return 0;
2513	}	2391	}
2514		2392
2515	/*	2393	/*
2516	* Returns the value of op has an extra_field for key, or NULL.	2394	* Returns the value of op has an extra_field for key, or NULL.
2517	*	2395	*
…		…
2557	* Returns TRUE on success.	2435	* Returns TRUE on success.
2558	*/	2436	*/
2559	int	2437	int
2560	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2438	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2561	{	2439	{
2562	key_value *
2563	field = NULL, *last = NULL;	2440	key_value *field = NULL, *last = NULL;
2564		2441
2565	for (field = op->key_values; field != NULL; field = field->next)	2442	for (field = op->key_values; field != NULL; field = field->next)
2566	{	2443	{
2567	if (field->key != canonical_key)	2444	if (field->key != canonical_key)
2568	{	2445	{
…		…
2596	/* IF we get here, key doesn't exist */	2473	/* IF we get here, key doesn't exist */
2597		2474
2598	/* No field, we'll have to add it. */	2475	/* No field, we'll have to add it. */
2599		2476
2600	if (!add_key)	2477	if (!add_key)
2601	{
2602	return FALSE;	2478	return FALSE;
2603	}	2479
2604	/* There isn't any good reason to store a null	2480	/* There isn't any good reason to store a null
2605	* value in the key/value list. If the archetype has	2481	* value in the key/value list. If the archetype has
2606	* this key, then we should also have it, so shouldn't	2482	* this key, then we should also have it, so shouldn't
2607	* be here. If user wants to store empty strings,	2483	* be here. If user wants to store empty strings,
2608	* should pass in ""	2484	* should pass in ""
…		…
2657	}	2533	}
2658	else	2534	else
2659	item = item->env;	2535	item = item->env;
2660	}	2536	}
2661		2537
		2538
		2539	const char *
		2540	object::flag_desc (char *desc, int len) const
		2541	{
		2542	char *p = desc;
		2543	bool first = true;
		2544
		2545	*p = 0;
		2546
		2547	for (int i = 0; i < NUM_FLAGS; i++)
		2548	{
		2549	if (len <= 10) // magic constant!
		2550	{
		2551	snprintf (p, len, ",...");
		2552	break;
		2553	}
		2554
		2555	if (flag [i])
		2556	{
		2557	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2558	len -= cnt;
		2559	p += cnt;
		2560	first = false;
		2561	}
		2562	}
		2563
		2564	return desc;
		2565	}
		2566
2662	// return a suitable string describing an objetc in enough detail to find it	2567	// return a suitable string describing an object in enough detail to find it
2663	const char *	2568	const char *
2664	object::debug_desc (char *info) const	2569	object::debug_desc (char *info) const
2665	{	2570	{
		2571	char flagdesc[512];
2666	char info2[256 * 3];	2572	char info2[256 * 4];
2667	char *p = info;	2573	char *p = info;
2668		2574
2669	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2575	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2670	count,	2576	count, uuid.seq,
2671	&name,	2577	&name,
2672	title ? " " : "",	2578	title ? "\",title:\"" : "",
2673	title ? (const char *)title : "");	2579	title ? (const char *)title : "",
		2580	flag_desc (flagdesc, 512), type);
2674		2581
2675	if (env)	2582	if (env)
2676	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2583	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2677		2584
2678	if (map)	2585	if (map)
2679	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2586	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2680		2587
2681	return info;	2588	return info;
2682	}	2589	}
2683		2590
2684	const char *	2591	const char *
2685	object::debug_desc () const	2592	object::debug_desc () const
2686	{	2593	{
2687	static char info[256 * 3];	2594	static char info[256 * 4];
2688	return debug_desc (info);	2595	return debug_desc (info);
2689	}	2596	}
2690		2597
		2598	const char *
		2599	object::debug_desc2 () const
		2600	{
		2601	static char info[256 * 4];
		2602	return debug_desc (info);
		2603	}
		2604
		2605	struct region *
		2606	object::region () const
		2607	{
		2608	return map ? map->region (x, y)
		2609	: region::default_region ();
		2610	}
		2611

Diff Legend

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