[ViewVC] Diff of: cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.86 by root, Tue Dec 26 08:17:58 2006 UTC vs.
Revision 1.118 by root, Thu Jan 18 19:42:09 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,
…		…
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:
…		…
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	}
…		…
490		489
491	if (is_removed)	490	if (is_removed)
492	SET_FLAG (dst, FLAG_REMOVED);	491	SET_FLAG (dst, FLAG_REMOVED);
493		492
494	if (speed < 0)	493	if (speed < 0)
495	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;	494	dst->speed_left = speed_left - rndm ();
496		495
497	/* Copy over key_values, if any. */	496	/* Copy over key_values, if any. */
498	if (key_values)	497	if (key_values)
499	{	498	{
500	key_value *tail = 0;	499	key_value *tail = 0;
…		…
522	tail = new_link;	521	tail = new_link;
523	}	522	}
524	}	523	}
525	}	524	}
526		525
527	update_ob_speed (dst);	526	dst->set_speed (dst->speed);
528	}	527	}
529		528
530	object *	529	object *
531	object::clone ()	530	object::clone ()
532	{	531	{
…		…
538	/*	537	/*
539	* 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
540	* 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
541	* 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.
542	*/	541	*/
543
544	void	542	void
545	update_turn_face (object *op)	543	update_turn_face (object *op)
546	{	544	{
547	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) \|\| op->arch == NULL)	545	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) \|\| !op->arch)
548	return;	546	return;
		547
549	SET_ANIMATION (op, op->direction);	548	SET_ANIMATION (op, op->direction);
550	update_object (op, UP_OBJ_FACE);	549	update_object (op, UP_OBJ_FACE);
551	}	550	}
552		551
553	/*	552	/*
554	* 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
555	* 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.
556	* 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.
557	*/	556	*/
558	void	557	void
559	update_ob_speed (object *op)	558	object::set_speed (float speed)
560	{	559	{
561	extern int arch_init;	560	if (flag [FLAG_FREED] && speed)
562
563	/* No reason putting the archetypes objects on the speed list,
564	* since they never really need to be updated.
565	*/
566	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
567	{	561	{
568	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	562	LOG (llevError, "Object %s is freed but has speed.\n", &name);
569	op->speed = 0;	563	speed = 0;
570	}
571
572	if (arch_init)
573	return;
574
575	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
576	{	564	}
577	/* If already on active list, don't do anything */
578	if (op->active_next \|\| op->active_prev \|\| op == active_objects)
579	return;
580		565
581	/* process_events() expects us to insert the object at the beginning	566	this->speed = speed;
582	* of the list. */
583	op->active_next = active_objects;
584		567
585	if (op->active_next != NULL)	568	if (has_active_speed ())
586	op->active_next->active_prev = op;	569	activate ();
587
588	active_objects = op;
589	}
590	else	570	else
591	{	571	deactivate ();
592	/* If not on the active list, nothing needs to be done */
593	if (!op->active_next && !op->active_prev && op != active_objects)
594	return;
595
596	if (op->active_prev == NULL)
597	{
598	active_objects = op->active_next;
599
600	if (op->active_next != NULL)
601	op->active_next->active_prev = NULL;
602	}
603	else
604	{
605	op->active_prev->active_next = op->active_next;
606
607	if (op->active_next)
608	op->active_next->active_prev = op->active_prev;
609	}
610
611	op->active_next = NULL;
612	op->active_prev = NULL;
613	}
614	}
615
616	/* This function removes object 'op' from the list of active
617	* objects.
618	* This should only be used for style maps or other such
619	* reference maps where you don't want an object that isn't
620	* in play chewing up cpu time getting processed.
621	* The reverse of this is to call update_ob_speed, which
622	* will do the right thing based on the speed of the object.
623	*/
624	void
625	remove_from_active_list (object *op)
626	{
627	/* If not on the active list, nothing needs to be done */
628	if (!op->active_next && !op->active_prev && op != active_objects)
629	return;
630
631	if (op->active_prev == NULL)
632	{
633	active_objects = op->active_next;
634	if (op->active_next != NULL)
635	op->active_next->active_prev = NULL;
636	}
637	else
638	{
639	op->active_prev->active_next = op->active_next;
640	if (op->active_next)
641	op->active_next->active_prev = op->active_prev;
642	}
643	op->active_next = NULL;
644	op->active_prev = NULL;
645	}	572	}
646		573
647	/*	574	/*
648	* update_object() updates the the map.	575	* update_object() updates the the map.
649	* It takes into account invisible objects (and represent squares covered	576	* It takes into account invisible objects (and represent squares covered
…		…
697	return;	624	return;
698	}	625	}
699		626
700	mapspace &m = op->ms ();	627	mapspace &m = op->ms ();
701		628
702	if (m.flags_ & P_NEED_UPDATE)	629	if (!(m.flags_ & P_UPTODATE))
703	/* nop */;	630	/* nop */;
704	else if (action == UP_OBJ_INSERT)	631	else if (action == UP_OBJ_INSERT)
705	{	632	{
706	// this is likely overkill, TODO: revisit (schmorp)	633	// this is likely overkill, TODO: revisit (schmorp)
707	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	634	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
…		…
716	/* 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
717	* to have move_allow right now.	644	* to have move_allow right now.
718	*/	645	*/
719	\|\| ((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
720	\|\| 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)
721	m.flags_ = P_NEED_UPDATE;	648	m.flags_ = 0;
722	}	649	}
723	/* if the object is being removed, we can't make intelligent	650	/* if the object is being removed, we can't make intelligent
724	* decisions, because remove_ob can't really pass the object	651	* decisions, because remove_ob can't really pass the object
725	* that is being removed.	652	* that is being removed.
726	*/	653	*/
727	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)	654	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)
728	m.flags_ = P_NEED_UPDATE;	655	m.flags_ = 0;
729	else if (action == UP_OBJ_FACE)	656	else if (action == UP_OBJ_FACE)
730	/* Nothing to do for that case */ ;	657	/* Nothing to do for that case */ ;
731	else	658	else
732	LOG (llevError, "update_object called with invalid action: %d\n", action);	659	LOG (llevError, "update_object called with invalid action: %d\n", action);
733		660
734	if (op->more)	661	if (op->more)
735	update_object (op->more, action);	662	update_object (op->more, action);
736	}	663	}
737		664
738	object::vector object::objects; // not yet used
739	object *object::first;
740
741	object::object ()	665	object::object ()
742	{	666	{
743	SET_FLAG (this, FLAG_REMOVED);	667	SET_FLAG (this, FLAG_REMOVED);
744		668
745	expmul = 1.0;	669	expmul = 1.0;
…		…
749	object::~object ()	673	object::~object ()
750	{	674	{
751	free_key_values (this);	675	free_key_values (this);
752	}	676	}
753		677
		678	static int object_count;
		679
754	void object::link ()	680	void object::link ()
755	{	681	{
756	count = ++ob_count;	682	assert (!index);//D
757	uuid = gen_uuid ();	683	uuid = gen_uuid ();
		684	count = ++object_count;
758		685
759	prev = 0;	686	refcnt_inc ();
760	next = object::first;	687	objects.insert (this);
761
762	if (object::first)
763	object::first->prev = this;
764
765	object::first = this;
766	}	688	}
767		689
768	void object::unlink ()	690	void object::unlink ()
769	{	691	{
770	if (this == object::first)	692	assert (index);//D
771	object::first = next;	693	objects.erase (this);
772		694	refcnt_dec ();
773	/* Remove this object from the list of used objects */
774	if (prev) prev->next = next;
775	if (next) next->prev = prev;
776
777	prev = 0;
778	next = 0;
779	}	695	}
780		696
781	object *object::create ()
782	{
783	object *op = new object;
784	op->link ();
785	return op;
786	}
787
788	/*
789	* free_object() frees everything allocated by an object, removes
790	* it from the list of used objects, and puts it on the list of
791	* free objects. The IS_FREED() flag is set in the object.
792	* The object must have been removed by remove_ob() first for
793	* this function to succeed.
794	*
795	* If destroy_inventory is set, free inventory as well. Else drop items in
796	* inventory to the ground.
797	*/
798	void	697	void
799	object::do_destroy ()	698	object::activate ()
800	{	699	{
801	attachable::do_destroy ();	700	/* If already on active list, don't do anything */
802		701	if (active)
803	if (flag [FLAG_IS_LINKED])
804	remove_button_link (this);
805
806	if (flag [FLAG_FRIENDLY])
807	remove_friendly_object (this);
808
809	if (!flag [FLAG_REMOVED])
810	remove ();
811
812	if (flag [FLAG_FREED])
813	return;	702	return;
814		703
815	flag [FLAG_FREED] = 1;	704	if (has_active_speed ())
		705	actives.insert (this);
		706	}
816		707
817	// hack to ensure that freed objects still have a valid map	708	void
818	{	709	object::activate_recursive ()
819	static maptile *freed_map; // freed objects are moved here to avoid crashes	710	{
		711	activate ();
820		712
821	if (!freed_map)	713	for (object *op = inv; op; op = op->below)
		714	op->activate_recursive ();
		715	}
		716
		717	/* This function removes object 'op' from the list of active
		718	* objects.
		719	* This should only be used for style maps or other such
		720	* reference maps where you don't want an object that isn't
		721	* in play chewing up cpu time getting processed.
		722	* The reverse of this is to call update_ob_speed, which
		723	* will do the right thing based on the speed of the object.
		724	*/
		725	void
		726	object::deactivate ()
		727	{
		728	/* If not on the active list, nothing needs to be done */
		729	if (!active)
		730	return;
		731
		732	actives.erase (this);
		733	}
		734
		735	void
		736	object::deactivate_recursive ()
		737	{
		738	for (object *op = inv; op; op = op->below)
		739	op->deactivate_recursive ();
		740
		741	deactivate ();
		742	}
		743
		744	void
		745	object::set_flag_inv (int flag, int value)
		746	{
		747	for (object *op = inv; op; op = op->below)
822	{	748	{
823	freed_map = new maptile;	749	op->flag [flag] = value;
824		750	op->set_flag_inv (flag, value);
825	freed_map->name = "/internal/freed_objects_map";
826	freed_map->width = 3;
827	freed_map->height = 3;
828
829	freed_map->allocate ();
830	}	751	}
831
832	map = freed_map;
833	x = 1;
834	y = 1;
835	}
836
837	more = 0;
838	head = 0;
839	inv = 0;
840
841	// clear those pointers that likely might have circular references to us
842	owner = 0;
843	enemy = 0;
844	attacked_by = 0;
845
846	// only relevant for players(?), but make sure of it anyways
847	contr = 0;
848
849	/* Remove object from the active list */
850	speed = 0;
851	update_ob_speed (this);
852
853	unlink ();
854	}	752	}
855		753
856	/*	754	/*
857	* Remove and free all objects in the inventory of the given object.	755	* Remove and free all objects in the inventory of the given object.
858	* object.c ?	756	* object.c ?
859	*/	757	*/
860	void	758	void
861	object::destroy_inv (bool drop_to_ground)	759	object::destroy_inv (bool drop_to_ground)
862	{	760	{
		761	// need to check first, because the checks below might segfault
		762	// as we might be on an invalid mapspace and crossfire code
		763	// is too buggy to ensure that the inventory is empty.
		764	// corollary: if you create arrows etc. with stuff in tis inventory,
		765	// cf will crash below with off-map x and y
863	if (!inv)	766	if (!inv)
864	return;	767	return;
865		768
866	/* Only if the space blocks everything do we not process -	769	/* Only if the space blocks everything do we not process -
867	* if some form of movement is allowed, let objects	770	* if some form of movement is allowed, let objects
868	* drop on that space.	771	* drop on that space.
869	*/	772	*/
870	if (!drop_to_ground \|\| !map \|\| map->in_memory != MAP_IN_MEMORY \|\| GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)	773	if (!drop_to_ground
		774	\|\| !map
		775	\|\| map->in_memory != MAP_IN_MEMORY
		776	\|\| ms ().move_block == MOVE_ALL)
871	{	777	{
872	while (inv)	778	while (inv)
873	{	779	{
874	inv->destroy_inv (drop_to_ground);	780	inv->destroy_inv (drop_to_ground);
875	inv->destroy ();	781	inv->destroy ();
…		…
883		789
884	if (op->flag [FLAG_STARTEQUIP]	790	if (op->flag [FLAG_STARTEQUIP]
885	\|\| op->flag [FLAG_NO_DROP]	791	\|\| op->flag [FLAG_NO_DROP]
886	\|\| op->type == RUNE	792	\|\| op->type == RUNE
887	\|\| op->type == TRAP	793	\|\| op->type == TRAP
888	\|\| op->flag [FLAG_IS_A_TEMPLATE])	794	\|\| op->flag [FLAG_IS_A_TEMPLATE]
		795	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
889	op->destroy ();	796	op->destroy ();
890	else	797	else
891	{	798	map->insert (op, x, y);
892	op->remove ();
893	op->x = x;
894	op->y = y;
895	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
896	}
897	}	799	}
898	}	800	}
		801	}
		802
		803	object *object::create ()
		804	{
		805	object *op = new object;
		806	op->link ();
		807	return op;
		808	}
		809
		810	void
		811	object::do_destroy ()
		812	{
		813	attachable::do_destroy ();
		814
		815	if (flag [FLAG_IS_LINKED])
		816	remove_button_link (this);
		817
		818	if (flag [FLAG_FRIENDLY])
		819	remove_friendly_object (this);
		820
		821	if (!flag [FLAG_REMOVED])
		822	remove ();
		823
		824	destroy_inv (true);
		825
		826	deactivate ();
		827	unlink ();
		828
		829	flag [FLAG_FREED] = 1;
		830
		831	// hack to ensure that freed objects still have a valid map
		832	{
		833	static maptile *freed_map; // freed objects are moved here to avoid crashes
		834
		835	if (!freed_map)
		836	{
		837	freed_map = new maptile;
		838
		839	freed_map->name = "/internal/freed_objects_map";
		840	freed_map->width = 3;
		841	freed_map->height = 3;
		842
		843	freed_map->alloc ();
		844	freed_map->in_memory = MAP_IN_MEMORY;
		845	}
		846
		847	map = freed_map;
		848	x = 1;
		849	y = 1;
		850	}
		851
		852	head = 0;
		853
		854	if (more)
		855	{
		856	more->destroy ();
		857	more = 0;
		858	}
		859
		860	// clear those pointers that likely might have circular references to us
		861	owner = 0;
		862	enemy = 0;
		863	attacked_by = 0;
899	}	864	}
900		865
901	void	866	void
902	object::destroy (bool destroy_inventory)	867	object::destroy (bool destroy_inventory)
903	{	868	{
904	if (destroyed ())	869	if (destroyed ())
905	return;	870	return;
906		871
907	if (more)
908	{
909	//TODO: non-head objects must not have inventory
910	more->destroy (destroy_inventory);
911	more = 0;
912	}
913
914	if (destroy_inventory)	872	if (destroy_inventory)
915	destroy_inv (true);	873	destroy_inv (false);
916		874
917	attachable::destroy ();	875	attachable::destroy ();
918	}	876	}
919		877
920	/*	878	/*
…		…
941	* environment, the x and y coordinates will be updated to	899	* environment, the x and y coordinates will be updated to
942	* the previous environment.	900	* the previous environment.
943	* Beware: This function is called from the editor as well!	901	* Beware: This function is called from the editor as well!
944	*/	902	*/
945	void	903	void
946	object::remove ()	904	object::remove_slow ()
947	{	905	{
948	object tmp, last = 0;	906	object tmp, last = 0;
949	object *otmp;	907	object *otmp;
950		908
951	if (QUERY_FLAG (this, FLAG_REMOVED))	909	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
973	* to save cpu time.	931	* to save cpu time.
974	*/	932	*/
975	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	933	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
976	otmp->update_stats ();	934	otmp->update_stats ();
977		935
978	if (above != NULL)	936	if (above)
979	above->below = below;	937	above->below = below;
980	else	938	else
981	env->inv = below;	939	env->inv = below;
982		940
983	if (below != NULL)	941	if (below)
984	below->above = above;	942	below->above = above;
985		943
986	/* we set up values so that it could be inserted into	944	/* we set up values so that it could be inserted into
987	* the map, but we don't actually do that - it is up	945	* the map, but we don't actually do that - it is up
988	* to the caller to decide what we want to do.	946	* to the caller to decide what we want to do.
…		…
992	above = 0, below = 0;	950	above = 0, below = 0;
993	env = 0;	951	env = 0;
994	}	952	}
995	else if (map)	953	else if (map)
996	{	954	{
997	/* Re did the following section of code - it looks like it had	955	if (type == PLAYER)
998	* lots of logic for things we no longer care about
999	*/	956	{
		957	--map->players;
		958	map->touch ();
		959	}
		960
		961	map->dirty = true;
		962	mapspace &ms = this->ms ();
1000		963
1001	/* link the object above us */	964	/* link the object above us */
1002	if (above)	965	if (above)
1003	above->below = below;	966	above->below = below;
1004	else	967	else
1005	map->at (x, y).top = below; /* we were top, set new top */	968	ms.top = below; /* we were top, set new top */
1006		969
1007	/* Relink the object below us, if there is one */	970	/* Relink the object below us, if there is one */
1008	if (below)	971	if (below)
1009	below->above = above;	972	below->above = above;
1010	else	973	else
…		…
1012	/* Nothing below, which means we need to relink map object for this space	975	/* Nothing below, which means we need to relink map object for this space
1013	* use translated coordinates in case some oddness with map tiling is	976	* use translated coordinates in case some oddness with map tiling is
1014	* evident	977	* evident
1015	*/	978	*/
1016	if (GET_MAP_OB (map, x, y) != this)	979	if (GET_MAP_OB (map, x, y) != this)
1017	{
1018	char *dump = dump_object (this);
1019	LOG (llevError,
1020	"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);	980	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 ());
1021	free (dump);
1022	dump = dump_object (GET_MAP_OB (map, x, y));
1023	LOG (llevError, "%s\n", dump);
1024	free (dump);
1025	}
1026		981
1027	map->at (x, y).bot = above; /* goes on above it. */	982	ms.bot = above; /* goes on above it. */
1028	}	983	}
1029		984
1030	above = 0;	985	above = 0;
1031	below = 0;	986	below = 0;
1032		987
1033	if (map->in_memory == MAP_SAVING)	988	if (map->in_memory == MAP_SAVING)
1034	return;	989	return;
1035		990
1036	int check_walk_off = !flag [FLAG_NO_APPLY];	991	int check_walk_off = !flag [FLAG_NO_APPLY];
1037		992
1038	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	993	for (tmp = ms.bot; tmp; tmp = tmp->above)
1039	{	994	{
1040	/* No point updating the players look faces if he is the object	995	/* No point updating the players look faces if he is the object
1041	* being removed.	996	* being removed.
1042	*/	997	*/
1043		998
…		…
1055		1010
1056	if (tmp->contr->ns)	1011	if (tmp->contr->ns)
1057	tmp->contr->ns->floorbox_update ();	1012	tmp->contr->ns->floorbox_update ();
1058	}	1013	}
1059		1014
1060	/* See if player moving off should effect something */	1015	/* See if object moving off should effect something */
1061	if (check_walk_off	1016	if (check_walk_off
1062	&& ((move_type & tmp->move_off)	1017	&& ((move_type & tmp->move_off)
1063	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1018	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1064	{	1019	{
1065	move_apply (tmp, this, 0);	1020	move_apply (tmp, this, 0);
…		…
1067	if (destroyed ())	1022	if (destroyed ())
1068	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1023	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1069	}	1024	}
1070		1025
1071	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1026	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1072		1027	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1073	if (tmp->above == tmp)	1028	if (tmp->above == tmp)
1074	tmp->above = 0;	1029	tmp->above = 0;
1075		1030
1076	last = tmp;	1031	last = tmp;
1077	}	1032	}
1078		1033
1079	/* last == NULL of there are no objects on this space */	1034	/* last == NULL if there are no objects on this space */
		1035	//TODO: this makes little sense, why only update the topmost object?
1080	if (!last)	1036	if (!last)
1081	map->at (x, y).flags_ = P_NEED_UPDATE;	1037	map->at (x, y).flags_ = 0;
1082	else	1038	else
1083	update_object (last, UP_OBJ_REMOVE);	1039	update_object (last, UP_OBJ_REMOVE);
1084		1040
1085	if (flag [FLAG_BLOCKSVIEW] \|\| glow_radius)	1041	if (flag [FLAG_BLOCKSVIEW] \|\| glow_radius)
1086	update_all_los (map, x, y);	1042	update_all_los (map, x, y);
…		…
1123		1079
1124	return 0;	1080	return 0;
1125	}	1081	}
1126		1082
1127	/*	1083	/*
1128	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1084	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1129	* job preparing multi-part monsters	1085	* job preparing multi-part monsters.
1130	*/	1086	*/
1131	object *	1087	object *
1132	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1088	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1133	{	1089	{
1134	object *tmp;
1135
1136	if (op->head)
1137	op = op->head;
1138
1139	for (tmp = op; tmp; tmp = tmp->more)	1090	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1140	{	1091	{
1141	tmp->x = x + tmp->arch->clone.x;	1092	tmp->x = x + tmp->arch->clone.x;
1142	tmp->y = y + tmp->arch->clone.y;	1093	tmp->y = y + tmp->arch->clone.y;
1143	}	1094	}
1144		1095
…		…
1167	*/	1118	*/
1168	object *	1119	object *
1169	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1120	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1170	{	1121	{
1171	object tmp, top, *floor = NULL;	1122	object tmp, top, *floor = NULL;
1172	sint16 x, y;
1173		1123
1174	if (QUERY_FLAG (op, FLAG_FREED))	1124	if (QUERY_FLAG (op, FLAG_FREED))
1175	{	1125	{
1176	LOG (llevError, "Trying to insert freed object!\n");	1126	LOG (llevError, "Trying to insert freed object!\n");
1177	return NULL;	1127	return NULL;
1178	}	1128	}
1179		1129
1180	if (m == NULL)	1130	if (!QUERY_FLAG (op, FLAG_REMOVED))
		1131	LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
		1132
		1133	op->remove ();
		1134
		1135	if (!m)
1181	{	1136	{
1182	char *dump = dump_object (op);	1137	char *dump = dump_object (op);
1183	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1138	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1184	free (dump);	1139	free (dump);
1185	return op;	1140	return op;
…		…
1198	#endif	1153	#endif
1199	free (dump);	1154	free (dump);
1200	return op;	1155	return op;
1201	}	1156	}
1202		1157
1203	if (!QUERY_FLAG (op, FLAG_REMOVED))
1204	{
1205	char *dump = dump_object (op);
1206	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1207	free (dump);
1208	return op;
1209	}
1210
1211	if (op->more)
1212	{
1213	/* The part may be on a different map. */
1214
1215	object *more = op->more;	1158	if (object *more = op->more)
1216		1159	{
1217	/* We really need the caller to normalize coordinates - if
1218	* we set the map, that doesn't work if the location is within
1219	* a map and this is straddling an edge. So only if coordinate
1220	* is clear wrong do we normalize it.
1221	*/
1222	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1223	more->map = get_map_from_coord (m, &more->x, &more->y);
1224	else if (!more->map)
1225	{
1226	/* For backwards compatibility - when not dealing with tiled maps,
1227	* more->map should always point to the parent.
1228	*/
1229	more->map = m;
1230	}
1231
1232	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1160	if (!insert_ob_in_map (more, m, originator, flag))
1233	{	1161	{
1234	if (!op->head)	1162	if (!op->head)
1235	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1163	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1236		1164
1237	return 0;	1165	return 0;
…		…
1242		1170
1243	/* Ideally, the caller figures this out. However, it complicates a lot	1171	/* Ideally, the caller figures this out. However, it complicates a lot
1244	* of areas of callers (eg, anything that uses find_free_spot would now	1172	* of areas of callers (eg, anything that uses find_free_spot would now
1245	* need extra work	1173	* need extra work
1246	*/	1174	*/
1247	op->map = get_map_from_coord (m, &op->x, &op->y);	1175	if (!xy_normalise (m, op->x, op->y))
1248	x = op->x;	1176	return 0;
1249	y = op->y;	1177
		1178	op->map = m;
		1179	mapspace &ms = op->ms ();
1250		1180
1251	/* this has to be done after we translate the coordinates.	1181	/* this has to be done after we translate the coordinates.
1252	*/	1182	*/
1253	if (op->nrof && !(flag & INS_NO_MERGE))	1183	if (op->nrof && !(flag & INS_NO_MERGE))
1254	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1184	for (tmp = ms.bot; tmp; tmp = tmp->above)
1255	if (object::can_merge (op, tmp))	1185	if (object::can_merge (op, tmp))
1256	{	1186	{
1257	op->nrof += tmp->nrof;	1187	op->nrof += tmp->nrof;
1258	tmp->destroy ();	1188	tmp->destroy ();
1259	}	1189	}
…		…
1276	op->below = originator->below;	1206	op->below = originator->below;
1277		1207
1278	if (op->below)	1208	if (op->below)
1279	op->below->above = op;	1209	op->below->above = op;
1280	else	1210	else
1281	op->ms ().bot = op;	1211	ms.bot = op;
1282		1212
1283	/* since below originator, no need to update top */	1213	/* since below originator, no need to update top */
1284	originator->below = op;	1214	originator->below = op;
1285	}	1215	}
1286	else	1216	else
1287	{	1217	{
		1218	top = ms.bot;
		1219
1288	/* If there are other objects, then */	1220	/* If there are other objects, then */
1289	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1221	if ((!(flag & INS_MAP_LOAD)) && top)
1290	{	1222	{
1291	object *last = NULL;	1223	object *last = 0;
1292		1224
1293	/*	1225	/*
1294	* If there are multiple objects on this space, we do some trickier handling.	1226	* If there are multiple objects on this space, we do some trickier handling.
1295	* We've already dealt with merging if appropriate.	1227	* We've already dealt with merging if appropriate.
1296	* Generally, we want to put the new object on top. But if	1228	* Generally, we want to put the new object on top. But if
…		…
1300	* once we get to them. This reduces the need to traverse over all of	1232	* once we get to them. This reduces the need to traverse over all of
1301	* them when adding another one - this saves quite a bit of cpu time	1233	* them when adding another one - this saves quite a bit of cpu time
1302	* when lots of spells are cast in one area. Currently, it is presumed	1234	* when lots of spells are cast in one area. Currently, it is presumed
1303	* that flying non pickable objects are spell objects.	1235	* that flying non pickable objects are spell objects.
1304	*/	1236	*/
1305		1237	for (top = ms.bot; top; top = top->above)
1306	while (top != NULL)
1307	{	1238	{
1308	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1239	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1309	floor = top;	1240	floor = top;
1310		1241
1311	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1242	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1314	top = top->below;	1245	top = top->below;
1315	break;	1246	break;
1316	}	1247	}
1317		1248
1318	last = top;	1249	last = top;
1319	top = top->above;
1320	}	1250	}
1321		1251
1322	/* Don't want top to be NULL, so set it to the last valid object */	1252	/* Don't want top to be NULL, so set it to the last valid object */
1323	top = last;	1253	top = last;
1324		1254
…		…
1331	* Unless those objects are exits, type 66	1261	* Unless those objects are exits, type 66
1332	* If INS_ON_TOP is used, don't do this processing	1262	* If INS_ON_TOP is used, don't do this processing
1333	* Need to find the object that in fact blocks view, otherwise	1263	* Need to find the object that in fact blocks view, otherwise
1334	* stacking is a bit odd.	1264	* stacking is a bit odd.
1335	*/	1265	*/
1336	if (!(flag & INS_ON_TOP) &&	1266	if (!(flag & INS_ON_TOP)
1337	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1267	&& ms.flags () & P_BLOCKSVIEW
		1268	&& (op->face && !op->face->visibility))
1338	{	1269	{
1339	for (last = top; last != floor; last = last->below)	1270	for (last = top; last != floor; last = last->below)
1340	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1271	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1341	break;	1272	break;
		1273
1342	/* Check to see if we found the object that blocks view,	1274	/* Check to see if we found the object that blocks view,
1343	* and make sure we have a below pointer for it so that	1275	* and make sure we have a below pointer for it so that
1344	* we can get inserted below this one, which requires we	1276	* we can get inserted below this one, which requires we
1345	* set top to the object below us.	1277	* set top to the object below us.
1346	*/	1278	*/
…		…
1348	top = last->below;	1280	top = last->below;
1349	}	1281	}
1350	} /* If objects on this space */	1282	} /* If objects on this space */
1351		1283
1352	if (flag & INS_MAP_LOAD)	1284	if (flag & INS_MAP_LOAD)
1353	top = GET_MAP_TOP (op->map, op->x, op->y);	1285	top = ms.top;
1354		1286
1355	if (flag & INS_ABOVE_FLOOR_ONLY)	1287	if (flag & INS_ABOVE_FLOOR_ONLY)
1356	top = floor;	1288	top = floor;
1357		1289
1358	/* Top is the object that our object (op) is going to get inserted above.	1290	/* Top is the object that our object (op) is going to get inserted above.
1359	*/	1291	*/
1360		1292
1361	/* First object on this space */	1293	/* First object on this space */
1362	if (!top)	1294	if (!top)
1363	{	1295	{
1364	op->above = GET_MAP_OB (op->map, op->x, op->y);	1296	op->above = ms.bot;
1365		1297
1366	if (op->above)	1298	if (op->above)
1367	op->above->below = op;	1299	op->above->below = op;
1368		1300
1369	op->below = NULL;	1301	op->below = 0;
1370	op->ms ().bot = op;	1302	ms.bot = op;
1371	}	1303	}
1372	else	1304	else
1373	{ /* get inserted into the stack above top */	1305	{ /* get inserted into the stack above top */
1374	op->above = top->above;	1306	op->above = top->above;
1375		1307
…		…
1378		1310
1379	op->below = top;	1311	op->below = top;
1380	top->above = op;	1312	top->above = op;
1381	}	1313	}
1382		1314
1383	if (op->above == NULL)	1315	if (!op->above)
1384	op->ms ().top = op;	1316	ms.top = op;
1385	} /* else not INS_BELOW_ORIGINATOR */	1317	} /* else not INS_BELOW_ORIGINATOR */
1386		1318
1387	if (op->type == PLAYER)	1319	if (op->type == PLAYER)
		1320	{
1388	op->contr->do_los = 1;	1321	op->contr->do_los = 1;
		1322	++op->map->players;
		1323	op->map->touch ();
		1324	}
		1325
		1326	op->map->dirty = true;
1389		1327
1390	/* If we have a floor, we know the player, if any, will be above	1328	/* If we have a floor, we know the player, if any, will be above
1391	* it, so save a few ticks and start from there.	1329	* it, so save a few ticks and start from there.
1392	*/	1330	*/
1393	if (!(flag & INS_MAP_LOAD))	1331	if (!(flag & INS_MAP_LOAD))
1394	if (object *pl = op->ms ().player ())	1332	if (object *pl = ms.player ())
1395	if (pl->contr->ns)	1333	if (pl->contr->ns)
1396	pl->contr->ns->floorbox_update ();	1334	pl->contr->ns->floorbox_update ();
1397		1335
1398	/* If this object glows, it may affect lighting conditions that are	1336	/* If this object glows, it may affect lighting conditions that are
1399	* visible to others on this map. But update_all_los is really	1337	* visible to others on this map. But update_all_los is really
1400	* an inefficient way to do this, as it means los for all players	1338	* an inefficient way to do this, as it means los for all players
1401	* on the map will get recalculated. The players could very well	1339	* on the map will get recalculated. The players could very well
1402	* be far away from this change and not affected in any way -	1340	* be far away from this change and not affected in any way -
1403	* this should get redone to only look for players within range,	1341	* this should get redone to only look for players within range,
1404	* or just updating the P_NEED_UPDATE for spaces within this area	1342	* or just updating the P_UPTODATE for spaces within this area
1405	* of effect may be sufficient.	1343	* of effect may be sufficient.
1406	*/	1344	*/
1407	if (op->map->darkness && (op->glow_radius != 0))	1345	if (op->map->darkness && (op->glow_radius != 0))
1408	update_all_los (op->map, op->x, op->y);	1346	update_all_los (op->map, op->x, op->y);
1409		1347
…		…
1447	{	1385	{
1448	object tmp, tmp1;	1386	object tmp, tmp1;
1449		1387
1450	/* first search for itself and remove any old instances */	1388	/* first search for itself and remove any old instances */
1451		1389
1452	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1390	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1453	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1391	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1454	tmp->destroy ();	1392	tmp->destroy ();
1455		1393
1456	tmp1 = arch_to_object (archetype::find (arch_string));	1394	tmp1 = arch_to_object (archetype::find (arch_string));
1457		1395
1458	tmp1->x = op->x;	1396	tmp1->x = op->x;
1459	tmp1->y = op->y;	1397	tmp1->y = op->y;
1460	insert_ob_in_map (tmp1, op->map, op, 0);	1398	insert_ob_in_map (tmp1, op->map, op, 0);
		1399	}
		1400
		1401	object *
		1402	object::insert_at (object where, object originator, int flags)
		1403	{
		1404	where->map->insert (this, where->x, where->y, originator, flags);
1461	}	1405	}
1462		1406
1463	/*	1407	/*
1464	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1408	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1465	* is returned contains nr objects, and the remaining parts contains	1409	* is returned contains nr objects, and the remaining parts contains
1466	* the rest (or is removed and freed if that number is 0).	1410	* the rest (or is removed and freed if that number is 0).
1467	* On failure, NULL is returned, and the reason put into the	1411	* On failure, NULL is returned, and the reason put into the
1468	* global static errmsg array.	1412	* global static errmsg array.
1469	*/	1413	*/
1470
1471	object *	1414	object *
1472	get_split_ob (object *orig_ob, uint32 nr)	1415	get_split_ob (object *orig_ob, uint32 nr)
1473	{	1416	{
1474	object *newob;	1417	object *newob;
1475	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1418	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1739	*	1682	*
1740	* MSW 2001-07-08: Check all objects on space, not just those below	1683	* MSW 2001-07-08: Check all objects on space, not just those below
1741	* object being inserted. insert_ob_in_map may not put new objects	1684	* object being inserted. insert_ob_in_map may not put new objects
1742	* on top.	1685	* on top.
1743	*/	1686	*/
1744
1745	int	1687	int
1746	check_move_on (object op, object originator)	1688	check_move_on (object op, object originator)
1747	{	1689	{
1748	object *tmp;	1690	object *tmp;
1749	maptile *m = op->map;	1691	maptile *m = op->map;
…		…
1776		1718
1777	/* The objects have to be checked from top to bottom.	1719	/* The objects have to be checked from top to bottom.
1778	* Hence, we first go to the top:	1720	* Hence, we first go to the top:
1779	*/	1721	*/
1780		1722
1781	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above)	1723	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1782	{	1724	{
1783	/* Trim the search when we find the first other spell effect	1725	/* Trim the search when we find the first other spell effect
1784	* this helps performance so that if a space has 50 spell objects,	1726	* this helps performance so that if a space has 50 spell objects,
1785	* we don't need to check all of them.	1727	* we don't need to check all of them.
1786	*/	1728	*/
…		…
1844	* The first matching object is returned, or NULL if none.	1786	* The first matching object is returned, or NULL if none.
1845	*/	1787	*/
1846	object *	1788	object *
1847	present_arch (const archetype at, maptile m, int x, int y)	1789	present_arch (const archetype at, maptile m, int x, int y)
1848	{	1790	{
1849	if (m == NULL \|\| out_of_map (m, x, y))	1791	if (!m \|\| out_of_map (m, x, y))
1850	{	1792	{
1851	LOG (llevError, "Present_arch called outside map.\n");	1793	LOG (llevError, "Present_arch called outside map.\n");
1852	return NULL;	1794	return NULL;
1853	}	1795	}
1854		1796
1855	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1797	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1856	if (tmp->arch == at)	1798	if (tmp->arch == at)
1857	return tmp;	1799	return tmp;
1858		1800
1859	return NULL;	1801	return NULL;
1860	}	1802	}
…		…
1871	{	1813	{
1872	LOG (llevError, "Present called outside map.\n");	1814	LOG (llevError, "Present called outside map.\n");
1873	return NULL;	1815	return NULL;
1874	}	1816	}
1875		1817
1876	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1818	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1877	if (tmp->type == type)	1819	if (tmp->type == type)
1878	return tmp;	1820	return tmp;
1879		1821
1880	return NULL;	1822	return NULL;
1881	}	1823	}
…		…
2196		2138
2197	return 3;	2139	return 3;
2198	}	2140	}
2199		2141
2200	/*	2142	/*
2201	* absdir(int): Returns a number between 1 and 8, which represent
2202	* the "absolute" direction of a number (it actually takes care of
2203	* "overflow" in previous calculations of a direction).
2204	*/
2205
2206	int
2207	absdir (int d)
2208	{
2209	while (d < 1)
2210	d += 8;
2211
2212	while (d > 8)
2213	d -= 8;
2214
2215	return d;
2216	}
2217
2218	/*
2219	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2143	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2220	* between two directions (which are expected to be absolute (see absdir())	2144	* between two directions (which are expected to be absolute (see absdir())
2221	*/	2145	*/
2222
2223	int	2146	int
2224	dirdiff (int dir1, int dir2)	2147	dirdiff (int dir1, int dir2)
2225	{	2148	{
2226	int d;	2149	int d;
2227		2150
…		…
2606	}	2529	}
2607	else	2530	else
2608	item = item->env;	2531	item = item->env;
2609	}	2532	}
2610		2533
		2534
		2535	const char *
		2536	object::flag_desc (char *desc, int len) const
		2537	{
		2538	char *p = desc;
		2539	bool first = true;
		2540
		2541	*p = 0;
		2542
		2543	for (int i = 0; i < NUM_FLAGS; i++)
		2544	{
		2545	if (len <= 10) // magic constant!
		2546	{
		2547	snprintf (p, len, ",...");
		2548	break;
		2549	}
		2550
		2551	if (flag [i])
		2552	{
		2553	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2554	len -= cnt;
		2555	p += cnt;
		2556	first = false;
		2557	}
		2558	}
		2559
		2560	return desc;
		2561	}
		2562
2611	// return a suitable string describing an objetc in enough detail to find it	2563	// return a suitable string describing an object in enough detail to find it
2612	const char *	2564	const char *
2613	object::debug_desc (char *info) const	2565	object::debug_desc (char *info) const
2614	{	2566	{
		2567	char flagdesc[512];
2615	char info2[256 * 3];	2568	char info2[256 * 4];
2616	char *p = info;	2569	char *p = info;
2617		2570
2618	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2571	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2619	count,	2572	count, uuid.seq,
2620	&name,	2573	&name,
2621	title ? " " : "",	2574	title ? "\",title:\"" : "",
2622	title ? (const char *)title : "");	2575	title ? (const char *)title : "",
		2576	flag_desc (flagdesc, 512), type);
2623		2577
2624	if (env)	2578	if (env)
2625	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2579	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2626		2580
2627	if (map)	2581	if (map)
2628	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2582	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2629		2583
2630	return info;	2584	return info;
2631	}	2585	}
2632		2586
2633	const char *	2587	const char *
2634	object::debug_desc () const	2588	object::debug_desc () const
2635	{	2589	{
2636	static char info[256 * 3];	2590	static char info[256 * 4];
2637	return debug_desc (info);	2591	return debug_desc (info);
2638	}	2592	}
2639		2593
		2594	const char *
		2595	object::debug_desc2 () const
		2596	{
		2597	static char info[256 * 4];
		2598	return debug_desc (info);
		2599	}
		2600

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.86 by root, Tue Dec 26 08:17:58 2006 UTC vs. Revision 1.118 by root, Thu Jan 18 19:42:09 2007 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.86 by root, Tue Dec 26 08:17:58 2006 UTC vs.
Revision 1.118 by root, Thu Jan 18 19:42:09 2007 UTC