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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.99 by root, Sun Dec 31 18:10:40 2006 UTC vs.
Revision 1.147 by root, Sat May 12 16:06:42 2007 UTC

…		…
1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* CrossFire, A Multiplayer game
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>
28	#include <stdio.h>	29	#include <stdio.h>
29	#include <sys/types.h>	30	#include <sys/types.h>
30	#include <sys/uio.h>	31	#include <sys/uio.h>
31	#include <object.h>	32	#include <object.h>
32	#include <funcpoint.h>	33	#include <funcpoint.h>
		34	#include <sproto.h>
33	#include <loader.h>	35	#include <loader.h>
34		36
35	#include <bitset>	37	#include <bitset>
36		38
37	int nrofallocobjects = 0;	39	int nrofallocobjects = 0;
38	static UUID uuid;	40	static UUID uuid;
39	const uint64 UUID_SKIP = 1<<19;	41	const uint64 UUID_SKIP = 1<<19;
40		42
41	object active_objects; / List of active objects that need to be processed */	43	objectvec objects;
		44	activevec actives;
42		45
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,	46	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
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	47	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
45	};	48	};
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,	49	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
322	sum_weight (object *op)	325	sum_weight (object *op)
323	{	326	{
324	long sum;	327	long sum;
325	object *inv;	328	object *inv;
326		329
327	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	330	for (sum = 0, inv = op->inv; inv; inv = inv->below)
328	{	331	{
329	if (inv->inv)	332	if (inv->inv)
330	sum_weight (inv);	333	sum_weight (inv);
		334
331	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	335	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
332	}	336	}
333		337
334	if (op->type == CONTAINER && op->stats.Str)	338	if (op->type == CONTAINER && op->stats.Str)
335	sum = (sum * (100 - op->stats.Str)) / 100;	339	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
355	/*	359	/*
356	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	360	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
357	* Some error messages.	361	* Some error messages.
358	* The result of the dump is stored in the static global errmsg array.	362	* The result of the dump is stored in the static global errmsg array.
359	*/	363	*/
360
361	char *	364	char *
362	dump_object (object *op)	365	dump_object (object *op)
363	{	366	{
364	if (!op)	367	if (!op)
365	return strdup ("[NULLOBJ]");	368	return strdup ("[NULLOBJ]");
366		369
367	object_freezer freezer;	370	object_freezer freezer;
368	save_object (freezer, op, 1);	371	op->write (freezer);
369	return freezer.as_string ();	372	return freezer.as_string ();
370	}	373	}
371		374
372	/*	375	/*
373	* get_nearest_part(multi-object, object 2) returns the part of the	376	* get_nearest_part(multi-object, object 2) returns the part of the
…		…
390	}	393	}
391		394
392	/*	395	/*
393	* Returns the object which has the count-variable equal to the argument.	396	* Returns the object which has the count-variable equal to the argument.
394	*/	397	*/
395
396	object *	398	object *
397	find_object (tag_t i)	399	find_object (tag_t i)
398	{	400	{
399	for (object *op = object::first; op; op = op->next)	401	for_all_objects (op)
400	if (op->count == i)	402	if (op->count == i)
401	return op;	403	return op;
402		404
403	return 0;	405	return 0;
404	}	406	}
405		407
406	/*	408	/*
407	* Returns the first object which has a name equal to the argument.	409	* Returns the first object which has a name equal to the argument.
408	* Used only by the patch command, but not all that useful.	410	* Used only by the patch command, but not all that useful.
409	* Enables features like "patch <name-of-other-player> food 999"	411	* Enables features like "patch <name-of-other-player> food 999"
410	*/	412	*/
411
412	object *	413	object *
413	find_object_name (const char *str)	414	find_object_name (const char *str)
414	{	415	{
415	shstr_cmp str_ (str);	416	shstr_cmp str_ (str);
416	object *op;	417	object *op;
417		418
418	for (op = object::first; op != NULL; op = op->next)	419	for_all_objects (op)
419	if (op->name == str_)	420	if (op->name == str_)
420	break;	421	break;
421		422
422	return op;	423	return op;
423	}	424	}
…		…
449	owner = owner->owner;	450	owner = owner->owner;
450		451
451	this->owner = owner;	452	this->owner = owner;
452	}	453	}
453		454
		455	bool
		456	object::change_weapon (object *ob)
		457	{
		458	if (current_weapon == ob)
		459	return true;
		460
		461	if (chosen_skill)
		462	chosen_skill->flag [FLAG_APPLIED] = false;
		463
		464	current_weapon = ob;
		465	chosen_skill = !ob \|\| ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		466
		467	if (chosen_skill)
		468	chosen_skill->flag [FLAG_APPLIED] = true;
		469
		470	update_stats ();
		471
		472	if (ob)
		473	{
		474	// now check wether any body locations became invalid, in which case
		475	// we cannot apply the weapon at the moment.
		476	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		477	if (slot[i].used < 0)
		478	{
		479	current_weapon = chosen_skill = 0;
		480	update_stats ();
		481
		482	new_draw_info_format (NDI_UNIQUE, 0, this,
		483	"You try to balance your applied items all at once, but the %s is too much. "
		484	"You need to unapply some items first.", &ob->name);
		485	return false;
		486	}
		487
		488	new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		489	}
		490	else
		491	new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		492
		493	return true;
		494	}
		495
454	/* Zero the key_values on op, decrementing the shared-string	496	/* Zero the key_values on op, decrementing the shared-string
455	* refcounts and freeing the links.	497	* refcounts and freeing the links.
456	*/	498	*/
457	static void	499	static void
458	free_key_values (object *op)	500	free_key_values (object *op)
459	{	501	{
460	for (key_value *i = op->key_values; i != 0;)	502	for (key_value *i = op->key_values; i; )
461	{	503	{
462	key_value *next = i->next;	504	key_value *next = i->next;
463	delete i;	505	delete i;
464		506
465	i = next;	507	i = next;
466	}	508	}
467		509
468	op->key_values = 0;	510	op->key_values = 0;
469	}	511	}
470		512
471	/*	513	object &
472	* copy_to first frees everything allocated by the dst object,	514	object::operator =(const object &src)
473	* and then copies the contents of itself into the second
474	* object, allocating what needs to be allocated. Basically, any
475	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
476	* if the first object is freed, the pointers in the new object
477	* will point at garbage.
478	*/
479	void
480	object::copy_to (object *dst)
481	{	515	{
482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	516	bool is_freed = flag [FLAG_FREED];
483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	517	bool is_removed = flag [FLAG_REMOVED];
484		518
485	(object_copy )dst = *this;	519	(object_copy )this = src;
486		520
487	if (is_freed)	521	flag [FLAG_FREED] = is_freed;
488	SET_FLAG (dst, FLAG_FREED);	522	flag [FLAG_REMOVED] = is_removed;
489
490	if (is_removed)
491	SET_FLAG (dst, FLAG_REMOVED);
492
493	if (speed < 0)
494	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
495		523
496	/* Copy over key_values, if any. */	524	/* Copy over key_values, if any. */
497	if (key_values)	525	if (src.key_values)
498	{	526	{
499	key_value *tail = 0;	527	key_value *tail = 0;
500	key_value *i;
501
502	dst->key_values = 0;	528	key_values = 0;
503		529
504	for (i = key_values; i; i = i->next)	530	for (key_value *i = src.key_values; i; i = i->next)
505	{	531	{
506	key_value *new_link = new key_value;	532	key_value *new_link = new key_value;
507		533
508	new_link->next = 0;	534	new_link->next = 0;
509	new_link->key = i->key;	535	new_link->key = i->key;
510	new_link->value = i->value;	536	new_link->value = i->value;
511		537
512	/* Try and be clever here, too. */	538	/* Try and be clever here, too. */
513	if (!dst->key_values)	539	if (!key_values)
514	{	540	{
515	dst->key_values = new_link;	541	key_values = new_link;
516	tail = new_link;	542	tail = new_link;
517	}	543	}
518	else	544	else
519	{	545	{
520	tail->next = new_link;	546	tail->next = new_link;
521	tail = new_link;	547	tail = new_link;
522	}	548	}
523	}	549	}
524	}	550	}
		551	}
		552
		553	/*
		554	* copy_to first frees everything allocated by the dst object,
		555	* and then copies the contents of itself into the second
		556	* object, allocating what needs to be allocated. Basically, any
		557	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		558	* if the first object is freed, the pointers in the new object
		559	* will point at garbage.
		560	*/
		561	void
		562	object::copy_to (object *dst)
		563	{
		564	dst = this;
		565
		566	if (speed < 0)
		567	dst->speed_left = speed_left - rndm ();
525		568
526	dst->set_speed (dst->speed);	569	dst->set_speed (dst->speed);
		570	}
		571
		572	void
		573	object::instantiate ()
		574	{
		575	if (!uuid.seq) // HACK
		576	uuid = gen_uuid ();
		577
		578	speed_left = -0.1f;
		579	/* copy the body_info to the body_used - this is only really
		580	* need for monsters, but doesn't hurt to do it for everything.
		581	* by doing so, when a monster is created, it has good starting
		582	* values for the body_used info, so when items are created
		583	* for it, they can be properly equipped.
		584	*/
		585	for (int i = NUM_BODY_LOCATIONS; i--; )
		586	slot[i].used = slot[i].info;
		587
		588	attachable::instantiate ();
527	}	589	}
528		590
529	object *	591	object *
530	object::clone ()	592	object::clone ()
531	{	593	{
…		…
589	* UP_OBJ_FACE: only the objects face has changed.	651	* UP_OBJ_FACE: only the objects face has changed.
590	*/	652	*/
591	void	653	void
592	update_object (object *op, int action)	654	update_object (object *op, int action)
593	{	655	{
594	MoveType move_on, move_off, move_block, move_slow;
595
596	if (op == NULL)	656	if (op == NULL)
597	{	657	{
598	/* this should never happen */	658	/* this should never happen */
599	LOG (llevDebug, "update_object() called for NULL object.\n");	659	LOG (llevDebug, "update_object() called for NULL object.\n");
600	return;	660	return;
…		…
660		720
661	if (op->more)	721	if (op->more)
662	update_object (op->more, action);	722	update_object (op->more, action);
663	}	723	}
664		724
665	object *object::first;
666
667	object::object ()	725	object::object ()
668	{	726	{
669	SET_FLAG (this, FLAG_REMOVED);	727	SET_FLAG (this, FLAG_REMOVED);
670		728
671	expmul = 1.0;	729	expmul = 1.0;
672	face = blank_face;	730	face = blank_face;
673	}	731	}
674		732
675	object::~object ()	733	object::~object ()
676	{	734	{
		735	unlink ();
		736
677	free_key_values (this);	737	free_key_values (this);
678	}	738	}
679		739
		740	static int object_count;
		741
680	void object::link ()	742	void object::link ()
681	{	743	{
682	count = ++ob_count;	744	assert (!index);//D
683	uuid = gen_uuid ();	745	uuid = gen_uuid ();
		746	count = ++object_count;
684		747
685	prev = 0;	748	refcnt_inc ();
686	next = object::first;	749	objects.insert (this);
687
688	if (object::first)
689	object::first->prev = this;
690
691	object::first = this;
692	}	750	}
693		751
694	void object::unlink ()	752	void object::unlink ()
695	{	753	{
696	if (this == object::first)	754	if (!index)
697	object::first = next;	755	return;
698		756
699	/* Remove this object from the list of used objects */	757	objects.erase (this);
700	if (prev) prev->next = next;	758	refcnt_dec ();
701	if (next) next->prev = prev;
702
703	prev = 0;
704	next = 0;
705	}
706
707	bool
708	object::active () const
709	{
710	return active_next \|\| active_prev \|\| this == active_objects;
711	}	759	}
712		760
713	void	761	void
714	object::activate ()	762	object::activate ()
715	{	763	{
716	/* If already on active list, don't do anything */	764	/* If already on active list, don't do anything */
717	if (active ())	765	if (active)
718	return;	766	return;
719		767
720	if (has_active_speed ())	768	if (has_active_speed ())
721	{	769	actives.insert (this);
722	/* process_events() expects us to insert the object at the beginning
723	* of the list. */
724	active_next = active_objects;
725
726	if (active_next)
727	active_next->active_prev = this;
728
729	active_objects = this;
730	}
731	}	770	}
732		771
733	void	772	void
734	object::activate_recursive ()	773	object::activate_recursive ()
735	{	774	{
736	activate ();	775	activate ();
737		776
738	for (object *op = inv; op; op = op->above)	777	for (object *op = inv; op; op = op->below)
739	op->activate_recursive ();	778	op->activate_recursive ();
740	}	779	}
741		780
742	/* This function removes object 'op' from the list of active	781	/* This function removes object 'op' from the list of active
743	* objects.	782	* objects.
…		…
749	*/	788	*/
750	void	789	void
751	object::deactivate ()	790	object::deactivate ()
752	{	791	{
753	/* If not on the active list, nothing needs to be done */	792	/* If not on the active list, nothing needs to be done */
754	if (!active ())	793	if (!active)
755	return;	794	return;
756		795
757	if (active_prev == 0)	796	actives.erase (this);
758	{
759	active_objects = active_next;
760	if (active_next)
761	active_next->active_prev = 0;
762	}
763	else
764	{
765	active_prev->active_next = active_next;
766	if (active_next)
767	active_next->active_prev = active_prev;
768	}
769
770	active_next = 0;
771	active_prev = 0;
772	}	797	}
773		798
774	void	799	void
775	object::deactivate_recursive ()	800	object::deactivate_recursive ()
776	{	801	{
777	for (object *op = inv; op; op = op->above)	802	for (object *op = inv; op; op = op->below)
778	op->deactivate_recursive ();	803	op->deactivate_recursive ();
779		804
780	deactivate ();	805	deactivate ();
		806	}
		807
		808	void
		809	object::set_flag_inv (int flag, int value)
		810	{
		811	for (object *op = inv; op; op = op->below)
		812	{
		813	op->flag [flag] = value;
		814	op->set_flag_inv (flag, value);
		815	}
781	}	816	}
782		817
783	/*	818	/*
784	* Remove and free all objects in the inventory of the given object.	819	* Remove and free all objects in the inventory of the given object.
785	* object.c ?	820	* object.c ?
…		…
800	* drop on that space.	835	* drop on that space.
801	*/	836	*/
802	if (!drop_to_ground	837	if (!drop_to_ground
803	\|\| !map	838	\|\| !map
804	\|\| map->in_memory != MAP_IN_MEMORY	839	\|\| map->in_memory != MAP_IN_MEMORY
		840	\|\| map->nodrop
805	\|\| ms ().move_block == MOVE_ALL)	841	\|\| ms ().move_block == MOVE_ALL)
806	{	842	{
807	while (inv)	843	while (inv)
808	{	844	{
809	inv->destroy_inv (drop_to_ground);	845	inv->destroy_inv (drop_to_ground);
…		…
818		854
819	if (op->flag [FLAG_STARTEQUIP]	855	if (op->flag [FLAG_STARTEQUIP]
820	\|\| op->flag [FLAG_NO_DROP]	856	\|\| op->flag [FLAG_NO_DROP]
821	\|\| op->type == RUNE	857	\|\| op->type == RUNE
822	\|\| op->type == TRAP	858	\|\| op->type == TRAP
823	\|\| op->flag [FLAG_IS_A_TEMPLATE])	859	\|\| op->flag [FLAG_IS_A_TEMPLATE]
		860	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
824	op->destroy ();	861	op->destroy ();
825	else	862	else
826	map->insert (op, x, y);	863	map->insert (op, x, y);
827	}	864	}
828	}	865	}
…		…
836	}	873	}
837		874
838	void	875	void
839	object::do_destroy ()	876	object::do_destroy ()
840	{	877	{
		878	attachable::do_destroy ();
		879
841	if (flag [FLAG_IS_LINKED])	880	if (flag [FLAG_IS_LINKED])
842	remove_button_link (this);	881	remove_button_link (this);
843		882
844	if (flag [FLAG_FRIENDLY])	883	if (flag [FLAG_FRIENDLY])
845	remove_friendly_object (this);	884	remove_friendly_object (this);
846		885
847	if (!flag [FLAG_REMOVED])	886	if (!flag [FLAG_REMOVED])
848	remove ();	887	remove ();
849		888
850	if (flag [FLAG_FREED])	889	destroy_inv (true);
851	return;
852		890
853	set_speed (0);	891	deactivate ();
		892	unlink ();
854		893
855	flag [FLAG_FREED] = 1;	894	flag [FLAG_FREED] = 1;
856
857	attachable::do_destroy ();
858
859	destroy_inv (true);
860	unlink ();
861		895
862	// hack to ensure that freed objects still have a valid map	896	// hack to ensure that freed objects still have a valid map
863	{	897	{
864	static maptile *freed_map; // freed objects are moved here to avoid crashes	898	static maptile *freed_map; // freed objects are moved here to avoid crashes
865		899
…		…
870	freed_map->name = "/internal/freed_objects_map";	904	freed_map->name = "/internal/freed_objects_map";
871	freed_map->width = 3;	905	freed_map->width = 3;
872	freed_map->height = 3;	906	freed_map->height = 3;
873		907
874	freed_map->alloc ();	908	freed_map->alloc ();
		909	freed_map->in_memory = MAP_IN_MEMORY;
875	}	910	}
876		911
877	map = freed_map;	912	map = freed_map;
878	x = 1;	913	x = 1;
879	y = 1;	914	y = 1;
…		…
889		924
890	// clear those pointers that likely might have circular references to us	925	// clear those pointers that likely might have circular references to us
891	owner = 0;	926	owner = 0;
892	enemy = 0;	927	enemy = 0;
893	attacked_by = 0;	928	attacked_by = 0;
894
895	// only relevant for players(?), but make sure of it anyways
896	contr = 0;
897	}	929	}
898		930
899	void	931	void
900	object::destroy (bool destroy_inventory)	932	object::destroy (bool destroy_inventory)
901	{	933	{
…		…
929	* This function removes the object op from the linked list of objects	961	* This function removes the object op from the linked list of objects
930	* which it is currently tied to. When this function is done, the	962	* which it is currently tied to. When this function is done, the
931	* object will have no environment. If the object previously had an	963	* object will have no environment. If the object previously had an
932	* environment, the x and y coordinates will be updated to	964	* environment, the x and y coordinates will be updated to
933	* the previous environment.	965	* the previous environment.
934	* Beware: This function is called from the editor as well!
935	*/	966	*/
936	void	967	void
937	object::remove ()	968	object::do_remove ()
938	{	969	{
939	object tmp, last = 0;	970	object tmp, last = 0;
940	object *otmp;	971	object *otmp;
941		972
942	if (QUERY_FLAG (this, FLAG_REMOVED))	973	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
985	}	1016	}
986	else if (map)	1017	else if (map)
987	{	1018	{
988	if (type == PLAYER)	1019	if (type == PLAYER)
989	{	1020	{
		1021	// leaving a spot always closes any open container on the ground
		1022	if (container && !container->env)
		1023	// this causes spurious floorbox updates, but it ensures
		1024	// that the CLOSE event is being sent.
		1025	close_container ();
		1026
990	--map->players;	1027	--map->players;
991	map->last_access = runtime;	1028	map->touch ();
992	}	1029	}
993		1030
994	map->dirty = true;	1031	map->dirty = true;
		1032	mapspace &ms = this->ms ();
995		1033
996	/* link the object above us */	1034	/* link the object above us */
997	if (above)	1035	if (above)
998	above->below = below;	1036	above->below = below;
999	else	1037	else
1000	map->at (x, y).top = below; /* we were top, set new top */	1038	ms.top = below; /* we were top, set new top */
1001		1039
1002	/* Relink the object below us, if there is one */	1040	/* Relink the object below us, if there is one */
1003	if (below)	1041	if (below)
1004	below->above = above;	1042	below->above = above;
1005	else	1043	else
…		…
1007	/* Nothing below, which means we need to relink map object for this space	1045	/* Nothing below, which means we need to relink map object for this space
1008	* use translated coordinates in case some oddness with map tiling is	1046	* use translated coordinates in case some oddness with map tiling is
1009	* evident	1047	* evident
1010	*/	1048	*/
1011	if (GET_MAP_OB (map, x, y) != this)	1049	if (GET_MAP_OB (map, x, y) != this)
1012	{
1013	char *dump = dump_object (this);
1014	LOG (llevError,
1015	"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);	1050	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 ());
1016	free (dump);
1017	dump = dump_object (GET_MAP_OB (map, x, y));
1018	LOG (llevError, "%s\n", dump);
1019	free (dump);
1020	}
1021		1051
1022	map->at (x, y).bot = above; /* goes on above it. */	1052	ms.bot = above; /* goes on above it. */
1023	}	1053	}
1024		1054
1025	above = 0;	1055	above = 0;
1026	below = 0;	1056	below = 0;
1027		1057
1028	if (map->in_memory == MAP_SAVING)	1058	if (map->in_memory == MAP_SAVING)
1029	return;	1059	return;
1030		1060
1031	int check_walk_off = !flag [FLAG_NO_APPLY];	1061	int check_walk_off = !flag [FLAG_NO_APPLY];
1032		1062
1033	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1063	for (tmp = ms.bot; tmp; tmp = tmp->above)
1034	{	1064	{
1035	/* No point updating the players look faces if he is the object	1065	/* No point updating the players look faces if he is the object
1036	* being removed.	1066	* being removed.
1037	*/	1067	*/
1038		1068
…		…
1118	}	1148	}
1119		1149
1120	return 0;	1150	return 0;
1121	}	1151	}
1122		1152
		1153	void
		1154	object::expand_tail ()
		1155	{
		1156	if (more)
		1157	return;
		1158
		1159	object *prev = this;
		1160
		1161	for (archetype *at = arch->more; at; at = at->more)
		1162	{
		1163	object *op = arch_to_object (at);
		1164
		1165	op->name = name;
		1166	op->name_pl = name_pl;
		1167	op->title = title;
		1168
		1169	op->head = this;
		1170	prev->more = op;
		1171
		1172	prev = op;
		1173	}
		1174	}
		1175
1123	/*	1176	/*
1124	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1177	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1125	* job preparing multi-part monsters	1178	* job preparing multi-part monsters.
1126	*/	1179	*/
1127	object *	1180	object *
1128	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1181	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1129	{	1182	{
1130	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1183	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
…		…
1157	* just 'op' otherwise	1210	* just 'op' otherwise
1158	*/	1211	*/
1159	object *	1212	object *
1160	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1213	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1161	{	1214	{
		1215	assert (!op->flag [FLAG_FREED]);
		1216
1162	object tmp, top, *floor = NULL;	1217	object tmp, top, *floor = NULL;
1163	sint16 x, y;
1164		1218
1165	if (QUERY_FLAG (op, FLAG_FREED))	1219	op->remove ();
1166	{
1167	LOG (llevError, "Trying to insert freed object!\n");
1168	return NULL;
1169	}
1170		1220
1171	if (!m)	1221	#if 0
1172	{	1222	if (!m->active != !op->active)
1173	char *dump = dump_object (op);	1223	if (m->active)
1174	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1224	op->activate_recursive ();
1175	free (dump);	1225	else
1176	return op;	1226	op->deactivate_recursive ();
1177	}	1227	#endif
1178		1228
1179	if (out_of_map (m, op->x, op->y))	1229	if (out_of_map (m, op->x, op->y))
1180	{	1230	{
1181	char *dump = dump_object (op);
1182	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);	1231	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1183	#ifdef MANY_CORES	1232	#ifdef MANY_CORES
1184	/* Better to catch this here, as otherwise the next use of this object	1233	/* Better to catch this here, as otherwise the next use of this object
1185	* is likely to cause a crash. Better to find out where it is getting	1234	* is likely to cause a crash. Better to find out where it is getting
1186	* improperly inserted.	1235	* improperly inserted.
1187	*/	1236	*/
1188	abort ();	1237	abort ();
1189	#endif	1238	#endif
1190	free (dump);
1191	return op;	1239	return op;
1192	}	1240	}
1193		1241
1194	if (!QUERY_FLAG (op, FLAG_REMOVED))
1195	{
1196	char *dump = dump_object (op);
1197	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1198	free (dump);
1199	return op;
1200	}
1201
1202	if (op->more)
1203	{
1204	/* The part may be on a different map. */
1205
1206	object *more = op->more;	1242	if (object *more = op->more)
1207		1243	{
1208	/* We really need the caller to normalize coordinates - if
1209	* we set the map, that doesn't work if the location is within
1210	* a map and this is straddling an edge. So only if coordinate
1211	* is clear wrong do we normalize it.
1212	*/
1213	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1214	more->map = get_map_from_coord (m, &more->x, &more->y);
1215	else if (!more->map)
1216	{
1217	/* For backwards compatibility - when not dealing with tiled maps,
1218	* more->map should always point to the parent.
1219	*/
1220	more->map = m;
1221	}
1222
1223	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1244	if (!insert_ob_in_map (more, m, originator, flag))
1224	{	1245	{
1225	if (!op->head)	1246	if (!op->head)
1226	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1247	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1227		1248
1228	return 0;	1249	return 0;
…		…
1233		1254
1234	/* Ideally, the caller figures this out. However, it complicates a lot	1255	/* Ideally, the caller figures this out. However, it complicates a lot
1235	* of areas of callers (eg, anything that uses find_free_spot would now	1256	* of areas of callers (eg, anything that uses find_free_spot would now
1236	* need extra work	1257	* need extra work
1237	*/	1258	*/
1238	op->map = get_map_from_coord (m, &op->x, &op->y);	1259	if (!xy_normalise (m, op->x, op->y))
1239	x = op->x;	1260	return 0;
1240	y = op->y;	1261
		1262	op->map = m;
		1263	mapspace &ms = op->ms ();
1241		1264
1242	/* this has to be done after we translate the coordinates.	1265	/* this has to be done after we translate the coordinates.
1243	*/	1266	*/
1244	if (op->nrof && !(flag & INS_NO_MERGE))	1267	if (op->nrof && !(flag & INS_NO_MERGE))
1245	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1268	for (tmp = ms.bot; tmp; tmp = tmp->above)
1246	if (object::can_merge (op, tmp))	1269	if (object::can_merge (op, tmp))
1247	{	1270	{
1248	op->nrof += tmp->nrof;	1271	op->nrof += tmp->nrof;
1249	tmp->destroy ();	1272	tmp->destroy ();
1250	}	1273	}
…		…
1267	op->below = originator->below;	1290	op->below = originator->below;
1268		1291
1269	if (op->below)	1292	if (op->below)
1270	op->below->above = op;	1293	op->below->above = op;
1271	else	1294	else
1272	op->ms ().bot = op;	1295	ms.bot = op;
1273		1296
1274	/* since below originator, no need to update top */	1297	/* since below originator, no need to update top */
1275	originator->below = op;	1298	originator->below = op;
1276	}	1299	}
1277	else	1300	else
1278	{	1301	{
		1302	top = ms.bot;
		1303
1279	/* If there are other objects, then */	1304	/* If there are other objects, then */
1280	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1305	if ((!(flag & INS_MAP_LOAD)) && top)
1281	{	1306	{
1282	object *last = 0;	1307	object *last = 0;
1283		1308
1284	/*	1309	/*
1285	* If there are multiple objects on this space, we do some trickier handling.	1310	* If there are multiple objects on this space, we do some trickier handling.
…		…
1291	* once we get to them. This reduces the need to traverse over all of	1316	* once we get to them. This reduces the need to traverse over all of
1292	* them when adding another one - this saves quite a bit of cpu time	1317	* them when adding another one - this saves quite a bit of cpu time
1293	* when lots of spells are cast in one area. Currently, it is presumed	1318	* when lots of spells are cast in one area. Currently, it is presumed
1294	* that flying non pickable objects are spell objects.	1319	* that flying non pickable objects are spell objects.
1295	*/	1320	*/
1296	while (top)	1321	for (top = ms.bot; top; top = top->above)
1297	{	1322	{
1298	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1323	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1299	floor = top;	1324	floor = top;
1300		1325
1301	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1326	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1304	top = top->below;	1329	top = top->below;
1305	break;	1330	break;
1306	}	1331	}
1307		1332
1308	last = top;	1333	last = top;
1309	top = top->above;
1310	}	1334	}
1311		1335
1312	/* Don't want top to be NULL, so set it to the last valid object */	1336	/* Don't want top to be NULL, so set it to the last valid object */
1313	top = last;	1337	top = last;
1314		1338
…		…
1316	* looks like instead of lots of conditions here.	1340	* looks like instead of lots of conditions here.
1317	* makes things faster, and effectively the same result.	1341	* makes things faster, and effectively the same result.
1318	*/	1342	*/
1319		1343
1320	/* Have object 'fall below' other objects that block view.	1344	/* Have object 'fall below' other objects that block view.
1321	* Unless those objects are exits, type 66	1345	* Unless those objects are exits.
1322	* If INS_ON_TOP is used, don't do this processing	1346	* If INS_ON_TOP is used, don't do this processing
1323	* Need to find the object that in fact blocks view, otherwise	1347	* Need to find the object that in fact blocks view, otherwise
1324	* stacking is a bit odd.	1348	* stacking is a bit odd.
1325	*/	1349	*/
1326	if (!(flag & INS_ON_TOP) &&	1350	if (!(flag & INS_ON_TOP)
1327	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1351	&& ms.flags () & P_BLOCKSVIEW
		1352	&& (op->face && !faces [op->face].visibility))
1328	{	1353	{
1329	for (last = top; last != floor; last = last->below)	1354	for (last = top; last != floor; last = last->below)
1330	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1355	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1331	break;	1356	break;
		1357
1332	/* Check to see if we found the object that blocks view,	1358	/* Check to see if we found the object that blocks view,
1333	* and make sure we have a below pointer for it so that	1359	* and make sure we have a below pointer for it so that
1334	* we can get inserted below this one, which requires we	1360	* we can get inserted below this one, which requires we
1335	* set top to the object below us.	1361	* set top to the object below us.
1336	*/	1362	*/
…		…
1338	top = last->below;	1364	top = last->below;
1339	}	1365	}
1340	} /* If objects on this space */	1366	} /* If objects on this space */
1341		1367
1342	if (flag & INS_MAP_LOAD)	1368	if (flag & INS_MAP_LOAD)
1343	top = GET_MAP_TOP (op->map, op->x, op->y);	1369	top = ms.top;
1344		1370
1345	if (flag & INS_ABOVE_FLOOR_ONLY)	1371	if (flag & INS_ABOVE_FLOOR_ONLY)
1346	top = floor;	1372	top = floor;
1347		1373
1348	/* Top is the object that our object (op) is going to get inserted above.	1374	/* Top is the object that our object (op) is going to get inserted above.
1349	*/	1375	*/
1350		1376
1351	/* First object on this space */	1377	/* First object on this space */
1352	if (!top)	1378	if (!top)
1353	{	1379	{
1354	op->above = GET_MAP_OB (op->map, op->x, op->y);	1380	op->above = ms.bot;
1355		1381
1356	if (op->above)	1382	if (op->above)
1357	op->above->below = op;	1383	op->above->below = op;
1358		1384
1359	op->below = 0;	1385	op->below = 0;
1360	op->ms ().bot = op;	1386	ms.bot = op;
1361	}	1387	}
1362	else	1388	else
1363	{ /* get inserted into the stack above top */	1389	{ /* get inserted into the stack above top */
1364	op->above = top->above;	1390	op->above = top->above;
1365		1391
…		…
1369	op->below = top;	1395	op->below = top;
1370	top->above = op;	1396	top->above = op;
1371	}	1397	}
1372		1398
1373	if (!op->above)	1399	if (!op->above)
1374	op->ms ().top = op;	1400	ms.top = op;
1375	} /* else not INS_BELOW_ORIGINATOR */	1401	} /* else not INS_BELOW_ORIGINATOR */
1376		1402
1377	if (op->type == PLAYER)	1403	if (op->type == PLAYER)
1378	{	1404	{
1379	op->contr->do_los = 1;	1405	op->contr->do_los = 1;
1380	++op->map->players;	1406	++op->map->players;
1381	op->map->last_access = runtime;	1407	op->map->touch ();
1382	}	1408	}
1383		1409
1384	op->map->dirty = true;	1410	op->map->dirty = true;
1385		1411
1386	/* If we have a floor, we know the player, if any, will be above	1412	/* If we have a floor, we know the player, if any, will be above
1387	* it, so save a few ticks and start from there.	1413	* it, so save a few ticks and start from there.
1388	*/	1414	*/
1389	if (!(flag & INS_MAP_LOAD))	1415	if (!(flag & INS_MAP_LOAD))
1390	if (object *pl = op->ms ().player ())	1416	if (object *pl = ms.player ())
1391	if (pl->contr->ns)	1417	if (pl->contr->ns)
1392	pl->contr->ns->floorbox_update ();	1418	pl->contr->ns->floorbox_update ();
1393		1419
1394	/* If this object glows, it may affect lighting conditions that are	1420	/* If this object glows, it may affect lighting conditions that are
1395	* visible to others on this map. But update_all_los is really	1421	* visible to others on this map. But update_all_los is really
…		…
1443	{	1469	{
1444	object tmp, tmp1;	1470	object tmp, tmp1;
1445		1471
1446	/* first search for itself and remove any old instances */	1472	/* first search for itself and remove any old instances */
1447		1473
1448	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1474	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1449	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1475	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1450	tmp->destroy ();	1476	tmp->destroy ();
1451		1477
1452	tmp1 = arch_to_object (archetype::find (arch_string));	1478	tmp1 = arch_to_object (archetype::find (arch_string));
1453		1479
…		…
1457	}	1483	}
1458		1484
1459	object *	1485	object *
1460	object::insert_at (object where, object originator, int flags)	1486	object::insert_at (object where, object originator, int flags)
1461	{	1487	{
1462	where->map->insert (this, where->x, where->y, originator, flags);	1488	return where->map->insert (this, where->x, where->y, originator, flags);
1463	}	1489	}
1464		1490
1465	/*	1491	/*
1466	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1492	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1467	* is returned contains nr objects, and the remaining parts contains	1493	* is returned contains nr objects, and the remaining parts contains
…		…
1507	* the amount of an object. If the amount reaches 0, the object	1533	* the amount of an object. If the amount reaches 0, the object
1508	* is subsequently removed and freed.	1534	* is subsequently removed and freed.
1509	*	1535	*
1510	* Return value: 'op' if something is left, NULL if the amount reached 0	1536	* Return value: 'op' if something is left, NULL if the amount reached 0
1511	*/	1537	*/
1512
1513	object *	1538	object *
1514	decrease_ob_nr (object *op, uint32 i)	1539	decrease_ob_nr (object *op, uint32 i)
1515	{	1540	{
1516	object *tmp;	1541	object *tmp;
1517		1542
…		…
1592		1617
1593	/*	1618	/*
1594	* add_weight(object, weight) adds the specified weight to an object,	1619	* add_weight(object, weight) adds the specified weight to an object,
1595	* and also updates how much the environment(s) is/are carrying.	1620	* and also updates how much the environment(s) is/are carrying.
1596	*/	1621	*/
1597
1598	void	1622	void
1599	add_weight (object *op, signed long weight)	1623	add_weight (object *op, signed long weight)
1600	{	1624	{
1601	while (op != NULL)	1625	while (op != NULL)
1602	{	1626	{
…		…
1634	* inside the object environment.	1658	* inside the object environment.
1635	*	1659	*
1636	* The function returns now pointer to inserted item, and return value can	1660	* The function returns now pointer to inserted item, and return value can
1637	* be != op, if items are merged. -Tero	1661	* be != op, if items are merged. -Tero
1638	*/	1662	*/
1639
1640	object *	1663	object *
1641	object::insert (object *op)	1664	object::insert (object *op)
1642	{	1665	{
1643	object tmp, otmp;	1666	object tmp, otmp;
1644		1667
…		…
1776		1799
1777	/* The objects have to be checked from top to bottom.	1800	/* The objects have to be checked from top to bottom.
1778	* Hence, we first go to the top:	1801	* Hence, we first go to the top:
1779	*/	1802	*/
1780		1803
1781	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above)	1804	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1782	{	1805	{
1783	/* Trim the search when we find the first other spell effect	1806	/* Trim the search when we find the first other spell effect
1784	* this helps performance so that if a space has 50 spell objects,	1807	* this helps performance so that if a space has 50 spell objects,
1785	* we don't need to check all of them.	1808	* we don't need to check all of them.
1786	*/	1809	*/
…		…
1804	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1827	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1805	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1828	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1806	{	1829	{
1807		1830
1808	float	1831	float
1809	diff = tmp->move_slow_penalty * FABS (op->speed);	1832	diff = tmp->move_slow_penalty * fabs (op->speed);
1810		1833
1811	if (op->type == PLAYER)	1834	if (op->type == PLAYER)
1812	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1835	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|
1813	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1836	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1814	diff /= 4.0;	1837	diff /= 4.0;
…		…
1844	* The first matching object is returned, or NULL if none.	1867	* The first matching object is returned, or NULL if none.
1845	*/	1868	*/
1846	object *	1869	object *
1847	present_arch (const archetype at, maptile m, int x, int y)	1870	present_arch (const archetype at, maptile m, int x, int y)
1848	{	1871	{
1849	if (m == NULL \|\| out_of_map (m, x, y))	1872	if (!m \|\| out_of_map (m, x, y))
1850	{	1873	{
1851	LOG (llevError, "Present_arch called outside map.\n");	1874	LOG (llevError, "Present_arch called outside map.\n");
1852	return NULL;	1875	return NULL;
1853	}	1876	}
1854		1877
1855	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1878	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1856	if (tmp->arch == at)	1879	if (tmp->arch == at)
1857	return tmp;	1880	return tmp;
1858		1881
1859	return NULL;	1882	return NULL;
1860	}	1883	}
…		…
1871	{	1894	{
1872	LOG (llevError, "Present called outside map.\n");	1895	LOG (llevError, "Present called outside map.\n");
1873	return NULL;	1896	return NULL;
1874	}	1897	}
1875		1898
1876	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1899	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1877	if (tmp->type == type)	1900	if (tmp->type == type)
1878	return tmp;	1901	return tmp;
1879		1902
1880	return NULL;	1903	return NULL;
1881	}	1904	}
…		…
2021	}	2044	}
2022		2045
2023	if (!index)	2046	if (!index)
2024	return -1;	2047	return -1;
2025		2048
2026	return altern[RANDOM () % index];	2049	return altern [rndm (index)];
2027	}	2050	}
2028		2051
2029	/*	2052	/*
2030	* find_first_free_spot(archetype, maptile, x, y) works like	2053	* find_first_free_spot(archetype, maptile, x, y) works like
2031	* find_free_spot(), but it will search max number of squares.	2054	* find_free_spot(), but it will search max number of squares.
…		…
2052	{	2075	{
2053	arr += begin;	2076	arr += begin;
2054	end -= begin;	2077	end -= begin;
2055		2078
2056	while (--end)	2079	while (--end)
2057	swap (arr [end], arr [RANDOM () % (end + 1)]);	2080	swap (arr [end], arr [rndm (end + 1)]);
2058	}	2081	}
2059		2082
2060	/* new function to make monster searching more efficient, and effective!	2083	/* new function to make monster searching more efficient, and effective!
2061	* This basically returns a randomized array (in the passed pointer) of	2084	* This basically returns a randomized array (in the passed pointer) of
2062	* the spaces to find monsters. In this way, it won't always look for	2085	* the spaces to find monsters. In this way, it won't always look for
…		…
2196		2219
2197	return 3;	2220	return 3;
2198	}	2221	}
2199		2222
2200	/*	2223	/*
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	2224	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2220	* between two directions (which are expected to be absolute (see absdir())	2225	* between two directions (which are expected to be absolute (see absdir())
2221	*/	2226	*/
2222
2223	int	2227	int
2224	dirdiff (int dir1, int dir2)	2228	dirdiff (int dir1, int dir2)
2225	{	2229	{
2226	int d;	2230	int d;
2227		2231
…		…
2393	insert_ob_in_ob (object_create_clone (item), dst);	2397	insert_ob_in_ob (object_create_clone (item), dst);
2394		2398
2395	return dst;	2399	return dst;
2396	}	2400	}
2397		2401
2398	/* GROS - Creates an object using a string representing its content. */
2399	/* Basically, we save the content of the string to a temp file, then call */
2400	/* load_object on it. I admit it is a highly inefficient way to make things, */
2401	/* but it was simple to make and allows reusing the load_object function. */
2402	/* Remember not to use load_object_str in a time-critical situation. */
2403	/* Also remember that multiparts objects are not supported for now. */
2404	object *
2405	load_object_str (const char *obstr)
2406	{
2407	object *op;
2408	char filename[MAX_BUF];
2409
2410	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2411
2412	FILE *tempfile = fopen (filename, "w");
2413
2414	if (tempfile == NULL)
2415	{
2416	LOG (llevError, "Error - Unable to access load object temp file\n");
2417	return NULL;
2418	}
2419
2420	fprintf (tempfile, obstr);
2421	fclose (tempfile);
2422
2423	op = object::create ();
2424
2425	object_thawer thawer (filename);
2426
2427	if (thawer)
2428	load_object (thawer, op, 0);
2429
2430	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2431	CLEAR_FLAG (op, FLAG_REMOVED);
2432
2433	return op;
2434	}
2435
2436	/* This returns the first object in who's inventory that	2402	/* This returns the first object in who's inventory that
2437	* has the same type and subtype match.	2403	* has the same type and subtype match.
2438	* returns NULL if no match.	2404	* returns NULL if no match.
2439	*/	2405	*/
2440	object *	2406	object *
…		…
2493	if (link->key == canonical_key)	2459	if (link->key == canonical_key)
2494	return link->value;	2460	return link->value;
2495		2461
2496	return 0;	2462	return 0;
2497	}	2463	}
2498
2499		2464
2500	/*	2465	/*
2501	* Updates the canonical_key in op to value.	2466	* Updates the canonical_key in op to value.
2502	*	2467	*
2503	* canonical_key is a shared string (value doesn't have to be).	2468	* canonical_key is a shared string (value doesn't have to be).
…		…
2613	object::flag_desc (char *desc, int len) const	2578	object::flag_desc (char *desc, int len) const
2614	{	2579	{
2615	char *p = desc;	2580	char *p = desc;
2616	bool first = true;	2581	bool first = true;
2617		2582
		2583	*p = 0;
		2584
2618	for (int i = 0; i < NUM_FLAGS; i++)	2585	for (int i = 0; i < NUM_FLAGS; i++)
2619	{	2586	{
2620	if (len <= 10) // magic constant!	2587	if (len <= 10) // magic constant!
2621	{	2588	{
2622	snprintf (p, len, ",...");	2589	snprintf (p, len, ",...");
2623	break;	2590	break;
2624	}	2591	}
2625		2592
2626	if (flag[i])	2593	if (flag [i])
2627	{	2594	{
2628	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);	2595	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
2629	len -= cnt;	2596	len -= cnt;
2630	p += cnt;	2597	p += cnt;
2631	first = false;	2598	first = false;
…		…
2633	}	2600	}
2634		2601
2635	return desc;	2602	return desc;
2636	}	2603	}
2637		2604
2638	// return a suitable string describing an objetc in enough detail to find it	2605	// return a suitable string describing an object in enough detail to find it
2639	const char *	2606	const char *
2640	object::debug_desc (char *info) const	2607	object::debug_desc (char *info) const
2641	{	2608	{
2642	char flagdesc[512];	2609	char flagdesc[512];
2643	char info2[256 * 4];	2610	char info2[256 * 4];
2644	char *p = info;	2611	char *p = info;
2645		2612
2646	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",	2613	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2647	count, uuid.seq,	2614	count, uuid.seq,
2648	&name,	2615	&name,
2649	title ? "\",title:" : "",	2616	title ? "\",title:\"" : "",
2650	title ? (const char *)title : "",	2617	title ? (const char *)title : "",
2651	flag_desc (flagdesc, 512), type);	2618	flag_desc (flagdesc, 512), type);
2652		2619
2653	if (env)	2620	if (env)
2654	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2621	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
…		…
2660	}	2627	}
2661		2628
2662	const char *	2629	const char *
2663	object::debug_desc () const	2630	object::debug_desc () const
2664	{	2631	{
2665	static char info[256 * 3];	2632	static char info[3][256 * 4];
		2633	static int info_idx;
		2634
2666	return debug_desc (info);	2635	return debug_desc (info [++info_idx % 3]);
2667	}	2636	}
2668		2637
		2638	struct region *
		2639	object::region () const
		2640	{
		2641	return map ? map->region (x, y)
		2642	: region::default_region ();
		2643	}
		2644
		2645	const materialtype_t *
		2646	object::dominant_material () const
		2647	{
		2648	if (materialtype_t *mat = name_to_material (materialname))
		2649	return mat;
		2650
		2651	// omfg this is slow, this has to be temporary :)
		2652	shstr unknown ("unknown");
		2653
		2654	return name_to_material (unknown);
		2655	}
		2656
		2657	void
		2658	object::open_container (object *new_container)
		2659	{
		2660	if (container == new_container)
		2661	return;
		2662
		2663	if (object *old_container = container)
		2664	{
		2665	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2666	return;
		2667
		2668	#if 0
		2669	// remove the "Close old_container" object.
		2670	if (object *closer = old_container->inv)
		2671	if (closer->type == CLOSE_CON)
		2672	closer->destroy ();
		2673	#endif
		2674
		2675	old_container->flag [FLAG_APPLIED] = 0;
		2676	container = 0;
		2677
		2678	esrv_update_item (UPD_FLAGS, this, old_container);
		2679	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2680	}
		2681
		2682	if (new_container)
		2683	{
		2684	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2685	return;
		2686
		2687	// TODO: this does not seem to serve any purpose anymore?
		2688	#if 0
		2689	// insert the "Close Container" object.
		2690	if (archetype *closer = new_container->other_arch)
		2691	{
		2692	object *closer = arch_to_object (new_container->other_arch);
		2693	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2694	new_container->insert (closer);
		2695	}
		2696	#endif
		2697
		2698	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2699
		2700	new_container->flag [FLAG_APPLIED] = 1;
		2701	container = new_container;
		2702
		2703	esrv_update_item (UPD_FLAGS, this, new_container);
		2704	esrv_send_inventory (this, new_container);
		2705	}
		2706	}
		2707
		2708

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.99 by root, Sun Dec 31 18:10:40 2006 UTC vs. Revision 1.147 by root, Sat May 12 16:06:42 2007 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.99 by root, Sun Dec 31 18:10:40 2006 UTC vs.
Revision 1.147 by root, Sat May 12 16:06:42 2007 UTC