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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.111 by root, Mon Jan 8 01:19:02 2007 UTC vs.
Revision 1.190 by root, Sat Sep 15 15:58:06 2007 UTC

…		…
1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3		3	*
4	Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7		7	*
8	This program is free software; you can redistribute it and/or modify	8	* Crossfire TRT is free software: you can redistribute it and/or modify
9	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
10	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	(at your option) any later version.	11	* (at your option) any later version.
12		12	*
13	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,
14	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	GNU General Public License for more details.	16	* GNU General Public License for more details.
17		17	*
18	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
19	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
21
22	The authors can be reached via e-mail at <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <crossfire@schmorp.de>
23	*/	22	*/
24		23
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
27	variable. */	26	variable. */
28	#include <global.h>	27	#include <global.h>
29	#include <stdio.h>	28	#include <stdio.h>
30	#include <sys/types.h>	29	#include <sys/types.h>
31	#include <sys/uio.h>	30	#include <sys/uio.h>
32	#include <object.h>	31	#include <object.h>
33	#include <funcpoint.h>	32	#include <funcpoint.h>
		33	#include <sproto.h>
34	#include <loader.h>	34	#include <loader.h>
35		35
36	#include <bitset>	36	#include <bitset>
37		37
38	int nrofallocobjects = 0;	38	int nrofallocobjects = 0;
299	return 0;	299	return 0;
300	else if (!compare_ob_value_lists (ob1, ob2))	300	else if (!compare_ob_value_lists (ob1, ob2))
301	return 0;	301	return 0;
302	}	302	}
303		303
304	//TODO: generate an event or call into perl for additional checks
305	if (ob1->self \|\| ob2->self)	304	if (ob1->self \|\| ob2->self)
306	{	305	{
307	ob1->optimise ();	306	ob1->optimise ();
308	ob2->optimise ();	307	ob2->optimise ();
309		308
310	if (ob1->self \|\| ob2->self)	309	if (ob1->self \|\| ob2->self)
		310	if (!cfperl_can_merge (ob1, ob2))
311	return 0;	311	return 0;
312	}	312	}
313		313
314	/* Everything passes, must be OK. */	314	/* Everything passes, must be OK. */
315	return 1;	315	return 1;
316	}	316	}
…		…
324	sum_weight (object *op)	324	sum_weight (object *op)
325	{	325	{
326	long sum;	326	long sum;
327	object *inv;	327	object *inv;
328		328
329	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	329	for (sum = 0, inv = op->inv; inv; inv = inv->below)
330	{	330	{
331	if (inv->inv)	331	if (inv->inv)
332	sum_weight (inv);	332	sum_weight (inv);
		333
333	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
334	}	335	}
335		336
336	if (op->type == CONTAINER && op->stats.Str)	337	if (op->type == CONTAINER && op->stats.Str)
337	sum = (sum * (100 - op->stats.Str)) / 100;	338	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
357	/*	358	/*
358	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	359	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
359	* Some error messages.	360	* Some error messages.
360	* The result of the dump is stored in the static global errmsg array.	361	* The result of the dump is stored in the static global errmsg array.
361	*/	362	*/
362
363	char *	363	char *
364	dump_object (object *op)	364	dump_object (object *op)
365	{	365	{
366	if (!op)	366	if (!op)
367	return strdup ("[NULLOBJ]");	367	return strdup ("[NULLOBJ]");
368		368
369	object_freezer freezer;	369	object_freezer freezer;
370	save_object (freezer, op, 1);	370	op->write (freezer);
371	return freezer.as_string ();	371	return freezer.as_string ();
372	}	372	}
373		373
374	/*	374	/*
375	* get_nearest_part(multi-object, object 2) returns the part of the	375	* get_nearest_part(multi-object, object 2) returns the part of the
376	* multi-object 1 which is closest to the second object.	376	* multi-object 1 which is closest to the second object.
377	* If it's not a multi-object, it is returned.	377	* If it's not a multi-object, it is returned.
378	*/	378	*/
379
380	object *	379	object *
381	get_nearest_part (object op, const object pl)	380	get_nearest_part (object op, const object pl)
382	{	381	{
383	object tmp, closest;	382	object tmp, closest;
384	int last_dist, i;	383	int last_dist, i;
…		…
395	* Returns the object which has the count-variable equal to the argument.	394	* Returns the object which has the count-variable equal to the argument.
396	*/	395	*/
397	object *	396	object *
398	find_object (tag_t i)	397	find_object (tag_t i)
399	{	398	{
400	return ((unsigned int)i) < objects.size ()	399	for_all_objects (op)
401	? objects [i]	400	if (op->count == i)
402	: 0;	401	return op;
		402
		403	return 0;
403	}	404	}
404		405
405	/*	406	/*
406	* Returns the first object which has a name equal to the argument.	407	* Returns the first object which has a name equal to the argument.
407	* Used only by the patch command, but not all that useful.	408	* Used only by the patch command, but not all that useful.
…		…
427	}	428	}
428		429
429	/*	430	/*
430	* Sets the owner and sets the skill and exp pointers to owner's current	431	* Sets the owner and sets the skill and exp pointers to owner's current
431	* skill and experience objects.	432	* skill and experience objects.
		433	* ACTUALLY NO! investigate! TODO
432	*/	434	*/
433	void	435	void
434	object::set_owner (object *owner)	436	object::set_owner (object *owner)
435	{	437	{
		438	// allow objects which own objects
436	if (!owner)	439	if (owner)
437	return;
438
439	/* next line added to allow objects which own objects */
440	/* Add a check for ownercounts in here, as I got into an endless loop
441	* with the fireball owning a poison cloud which then owned the
442	* fireball. I believe that was caused by one of the objects getting
443	* freed and then another object replacing it. Since the ownercounts
444	* didn't match, this check is valid and I believe that cause is valid.
445	*/
446	while (owner->owner)	440	while (owner->owner)
447	owner = owner->owner;	441	owner = owner->owner;
448		442
449	this->owner = owner;	443	this->owner = owner;
		444	}
		445
		446	int
		447	object::slottype () const
		448	{
		449	if (type == SKILL)
		450	{
		451	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		452	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		453	}
		454	else
		455	{
		456	if (slot [body_combat].info) return slot_combat;
		457	if (slot [body_range ].info) return slot_ranged;
		458	}
		459
		460	return slot_none;
		461	}
		462
		463	bool
		464	object::change_weapon (object *ob)
		465	{
		466	if (current_weapon == ob)
		467	return true;
		468
		469	if (chosen_skill)
		470	chosen_skill->flag [FLAG_APPLIED] = false;
		471
		472	current_weapon = ob;
		473	chosen_skill = !ob \|\| ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		474
		475	if (chosen_skill)
		476	chosen_skill->flag [FLAG_APPLIED] = true;
		477
		478	update_stats ();
		479
		480	if (ob)
		481	{
		482	// now check wether any body locations became invalid, in which case
		483	// we cannot apply the weapon at the moment.
		484	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		485	if (slot[i].used < 0)
		486	{
		487	current_weapon = chosen_skill = 0;
		488	update_stats ();
		489
		490	new_draw_info_format (NDI_UNIQUE, 0, this,
		491	"You try to balance all your items at once, "
		492	"but the %s is just too much for your body. "
		493	"[You need to unapply some items first.]", &ob->name);
		494	return false;
		495	}
		496
		497	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		498	}
		499	else
		500	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		501
		502	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		503	{
		504	LOG (llevError \| logBacktrace, "%s changed to unapplied weapon %s",
		505	&name, ob->debug_desc ());
		506	return false;
		507	}
		508
		509	return true;
450	}	510	}
451		511
452	/* Zero the key_values on op, decrementing the shared-string	512	/* Zero the key_values on op, decrementing the shared-string
453	* refcounts and freeing the links.	513	* refcounts and freeing the links.
454	*/	514	*/
455	static void	515	static void
456	free_key_values (object *op)	516	free_key_values (object *op)
457	{	517	{
458	for (key_value *i = op->key_values; i != 0;)	518	for (key_value *i = op->key_values; i; )
459	{	519	{
460	key_value *next = i->next;	520	key_value *next = i->next;
461	delete i;	521	delete i;
462		522
463	i = next;	523	i = next;
464	}	524	}
465		525
466	op->key_values = 0;	526	op->key_values = 0;
467	}	527	}
468		528
469	/*	529	object &
470	* copy_to first frees everything allocated by the dst object,	530	object::operator =(const object &src)
471	* and then copies the contents of itself into the second
472	* object, allocating what needs to be allocated. Basically, any
473	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
474	* if the first object is freed, the pointers in the new object
475	* will point at garbage.
476	*/
477	void
478	object::copy_to (object *dst)
479	{	531	{
480	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	532	bool is_freed = flag [FLAG_FREED];
481	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	533	bool is_removed = flag [FLAG_REMOVED];
482		534
483	(object_copy )dst = *this;	535	(object_copy )this = src;
484		536
485	if (is_freed)	537	flag [FLAG_FREED] = is_freed;
486	SET_FLAG (dst, FLAG_FREED);	538	flag [FLAG_REMOVED] = is_removed;
487
488	if (is_removed)
489	SET_FLAG (dst, FLAG_REMOVED);
490
491	if (speed < 0)
492	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
493		539
494	/* Copy over key_values, if any. */	540	/* Copy over key_values, if any. */
495	if (key_values)	541	if (src.key_values)
496	{	542	{
497	key_value *tail = 0;	543	key_value *tail = 0;
498	key_value *i;
499
500	dst->key_values = 0;	544	key_values = 0;
501		545
502	for (i = key_values; i; i = i->next)	546	for (key_value *i = src.key_values; i; i = i->next)
503	{	547	{
504	key_value *new_link = new key_value;	548	key_value *new_link = new key_value;
505		549
506	new_link->next = 0;	550	new_link->next = 0;
507	new_link->key = i->key;	551	new_link->key = i->key;
508	new_link->value = i->value;	552	new_link->value = i->value;
509		553
510	/* Try and be clever here, too. */	554	/* Try and be clever here, too. */
511	if (!dst->key_values)	555	if (!key_values)
512	{	556	{
513	dst->key_values = new_link;	557	key_values = new_link;
514	tail = new_link;	558	tail = new_link;
515	}	559	}
516	else	560	else
517	{	561	{
518	tail->next = new_link;	562	tail->next = new_link;
519	tail = new_link;	563	tail = new_link;
520	}	564	}
521	}	565	}
522	}	566	}
		567	}
		568
		569	/*
		570	* copy_to first frees everything allocated by the dst object,
		571	* and then copies the contents of itself into the second
		572	* object, allocating what needs to be allocated. Basically, any
		573	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		574	* if the first object is freed, the pointers in the new object
		575	* will point at garbage.
		576	*/
		577	void
		578	object::copy_to (object *dst)
		579	{
		580	dst = this;
		581
		582	if (speed < 0)
		583	dst->speed_left -= rndm ();
523		584
524	dst->set_speed (dst->speed);	585	dst->set_speed (dst->speed);
		586	}
		587
		588	void
		589	object::instantiate ()
		590	{
		591	if (!uuid.seq) // HACK
		592	uuid = gen_uuid ();
		593
		594	speed_left = -0.1f;
		595	/* copy the body_info to the body_used - this is only really
		596	* need for monsters, but doesn't hurt to do it for everything.
		597	* by doing so, when a monster is created, it has good starting
		598	* values for the body_used info, so when items are created
		599	* for it, they can be properly equipped.
		600	*/
		601	for (int i = NUM_BODY_LOCATIONS; i--; )
		602	slot[i].used = slot[i].info;
		603
		604	attachable::instantiate ();
525	}	605	}
526		606
527	object *	607	object *
528	object::clone ()	608	object::clone ()
529	{	609	{
…		…
587	* UP_OBJ_FACE: only the objects face has changed.	667	* UP_OBJ_FACE: only the objects face has changed.
588	*/	668	*/
589	void	669	void
590	update_object (object *op, int action)	670	update_object (object *op, int action)
591	{	671	{
592	MoveType move_on, move_off, move_block, move_slow;
593
594	if (op == NULL)	672	if (op == NULL)
595	{	673	{
596	/* this should never happen */	674	/* this should never happen */
597	LOG (llevDebug, "update_object() called for NULL object.\n");	675	LOG (llevDebug, "update_object() called for NULL object.\n");
598	return;	676	return;
…		…
658		736
659	if (op->more)	737	if (op->more)
660	update_object (op->more, action);	738	update_object (op->more, action);
661	}	739	}
662		740
663	object *object::first;
664
665	object::object ()	741	object::object ()
666	{	742	{
667	SET_FLAG (this, FLAG_REMOVED);	743	SET_FLAG (this, FLAG_REMOVED);
668		744
669	expmul = 1.0;	745	expmul = 1.0;
670	face = blank_face;	746	face = blank_face;
671	}	747	}
672		748
673	object::~object ()	749	object::~object ()
674	{	750	{
		751	unlink ();
		752
675	free_key_values (this);	753	free_key_values (this);
676	}	754	}
677		755
		756	static int object_count;
		757
678	void object::link ()	758	void object::link ()
679	{	759	{
680	assert (!count);//D	760	assert (!index);//D
681	uuid = gen_uuid ();	761	uuid = gen_uuid ();
		762	count = ++object_count;
682		763
683	refcnt_inc ();	764	refcnt_inc ();
684	objects.insert (this);	765	objects.insert (this);
685	}	766	}
686		767
687	void object::unlink ()	768	void object::unlink ()
688	{	769	{
689	assert (count);//D	770	if (!index)
		771	return;
		772
690	objects.erase (this);	773	objects.erase (this);
691	refcnt_dec ();	774	refcnt_dec ();
692	}	775	}
693		776
694	void	777	void
…		…
768	* drop on that space.	851	* drop on that space.
769	*/	852	*/
770	if (!drop_to_ground	853	if (!drop_to_ground
771	\|\| !map	854	\|\| !map
772	\|\| map->in_memory != MAP_IN_MEMORY	855	\|\| map->in_memory != MAP_IN_MEMORY
		856	\|\| map->nodrop
773	\|\| ms ().move_block == MOVE_ALL)	857	\|\| ms ().move_block == MOVE_ALL)
774	{	858	{
775	while (inv)	859	while (inv)
776	{	860	{
777	inv->destroy_inv (drop_to_ground);	861	inv->destroy_inv (drop_to_ground);
…		…
805	}	889	}
806		890
807	void	891	void
808	object::do_destroy ()	892	object::do_destroy ()
809	{	893	{
		894	attachable::do_destroy ();
		895
810	if (flag [FLAG_IS_LINKED])	896	if (flag [FLAG_IS_LINKED])
811	remove_button_link (this);	897	remove_button_link (this);
812		898
813	if (flag [FLAG_FRIENDLY])	899	if (flag [FLAG_FRIENDLY])
814	remove_friendly_object (this);	900	remove_friendly_object (this);
815		901
816	if (!flag [FLAG_REMOVED])	902	if (!flag [FLAG_REMOVED])
817	remove ();	903	remove ();
818		904
819	if (flag [FLAG_FREED])	905	destroy_inv (true);
820	return;
821		906
822	set_speed (0);	907	deactivate ();
		908	unlink ();
823		909
824	flag [FLAG_FREED] = 1;	910	flag [FLAG_FREED] = 1;
825
826	attachable::do_destroy ();
827
828	destroy_inv (true);
829	unlink ();
830		911
831	// hack to ensure that freed objects still have a valid map	912	// hack to ensure that freed objects still have a valid map
832	{	913	{
833	static maptile *freed_map; // freed objects are moved here to avoid crashes	914	static maptile *freed_map; // freed objects are moved here to avoid crashes
834		915
835	if (!freed_map)	916	if (!freed_map)
836	{	917	{
837	freed_map = new maptile;	918	freed_map = new maptile;
838		919
		920	freed_map->path = "<freed objects map>";
839	freed_map->name = "/internal/freed_objects_map";	921	freed_map->name = "/internal/freed_objects_map";
840	freed_map->width = 3;	922	freed_map->width = 3;
841	freed_map->height = 3;	923	freed_map->height = 3;
842		924
843	freed_map->alloc ();	925	freed_map->alloc ();
…		…
847	map = freed_map;	929	map = freed_map;
848	x = 1;	930	x = 1;
849	y = 1;	931	y = 1;
850	}	932	}
851		933
852	head = 0;
853
854	if (more)	934	if (more)
855	{	935	{
856	more->destroy ();	936	more->destroy ();
857	more = 0;	937	more = 0;
858	}	938	}
859		939
		940	head = 0;
		941
860	// clear those pointers that likely might have circular references to us	942	// clear those pointers that likely might cause circular references
861	owner = 0;	943	owner = 0;
862	enemy = 0;	944	enemy = 0;
863	attacked_by = 0;	945	attacked_by = 0;
		946	current_weapon = 0;
864	}	947	}
865		948
866	void	949	void
867	object::destroy (bool destroy_inventory)	950	object::destroy (bool destroy_inventory)
868	{	951	{
869	if (destroyed ())	952	if (destroyed ())
870	return;	953	return;
871		954
872	if (destroy_inventory)	955	if (destroy_inventory)
873	destroy_inv (false);	956	destroy_inv (false);
		957
		958	if (is_head ())
		959	if (sound_destroy)
		960	play_sound (sound_destroy);
		961	else if (flag [FLAG_MONSTER])
		962	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
874		963
875	attachable::destroy ();	964	attachable::destroy ();
876	}	965	}
877		966
878	/*	967	/*
…		…
896	* This function removes the object op from the linked list of objects	985	* This function removes the object op from the linked list of objects
897	* which it is currently tied to. When this function is done, the	986	* which it is currently tied to. When this function is done, the
898	* object will have no environment. If the object previously had an	987	* object will have no environment. If the object previously had an
899	* environment, the x and y coordinates will be updated to	988	* environment, the x and y coordinates will be updated to
900	* the previous environment.	989	* the previous environment.
901	* Beware: This function is called from the editor as well!
902	*/	990	*/
903	void	991	void
904	object::remove ()	992	object::do_remove ()
905	{	993	{
906	object tmp, last = 0;	994	object tmp, last = 0;
907	object *otmp;	995	object *otmp;
908		996
909	if (QUERY_FLAG (this, FLAG_REMOVED))	997	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
952	}	1040	}
953	else if (map)	1041	else if (map)
954	{	1042	{
955	if (type == PLAYER)	1043	if (type == PLAYER)
956	{	1044	{
		1045	// leaving a spot always closes any open container on the ground
		1046	if (container && !container->env)
		1047	// this causes spurious floorbox updates, but it ensures
		1048	// that the CLOSE event is being sent.
		1049	close_container ();
		1050
957	--map->players;	1051	--map->players;
958	map->touch ();	1052	map->touch ();
959	}	1053	}
960		1054
961	map->dirty = true;	1055	map->dirty = true;
		1056	mapspace &ms = this->ms ();
962		1057
963	/* link the object above us */	1058	/* link the object above us */
964	if (above)	1059	if (above)
965	above->below = below;	1060	above->below = below;
966	else	1061	else
967	map->at (x, y).top = below; /* we were top, set new top */	1062	ms.top = below; /* we were top, set new top */
968		1063
969	/* Relink the object below us, if there is one */	1064	/* Relink the object below us, if there is one */
970	if (below)	1065	if (below)
971	below->above = above;	1066	below->above = above;
972	else	1067	else
…		…
974	/* Nothing below, which means we need to relink map object for this space	1069	/* Nothing below, which means we need to relink map object for this space
975	* use translated coordinates in case some oddness with map tiling is	1070	* use translated coordinates in case some oddness with map tiling is
976	* evident	1071	* evident
977	*/	1072	*/
978	if (GET_MAP_OB (map, x, y) != this)	1073	if (GET_MAP_OB (map, x, y) != this)
979	{
980	char *dump = dump_object (this);
981	LOG (llevError,
982	"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);	1074	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 ());
983	free (dump);
984	dump = dump_object (GET_MAP_OB (map, x, y));
985	LOG (llevError, "%s\n", dump);
986	free (dump);
987	}
988		1075
989	map->at (x, y).bot = above; /* goes on above it. */	1076	ms.bot = above; /* goes on above it. */
990	}	1077	}
991		1078
992	above = 0;	1079	above = 0;
993	below = 0;	1080	below = 0;
994		1081
995	if (map->in_memory == MAP_SAVING)	1082	if (map->in_memory == MAP_SAVING)
996	return;	1083	return;
997		1084
998	int check_walk_off = !flag [FLAG_NO_APPLY];	1085	int check_walk_off = !flag [FLAG_NO_APPLY];
999		1086
		1087	if (object *pl = ms.player ())
		1088	{
		1089	if (pl->container == this)
		1090	/* If a container that the player is currently using somehow gets
		1091	* removed (most likely destroyed), update the player view
		1092	* appropriately.
		1093	*/
		1094	pl->close_container ();
		1095
		1096	pl->contr->ns->floorbox_update ();
		1097	}
		1098
1000	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1099	for (tmp = ms.bot; tmp; tmp = tmp->above)
1001	{	1100	{
1002	/* No point updating the players look faces if he is the object	1101	/* No point updating the players look faces if he is the object
1003	* being removed.	1102	* being removed.
1004	*/	1103	*/
1005
1006	if (tmp->type == PLAYER && tmp != this)
1007	{
1008	/* If a container that the player is currently using somehow gets
1009	* removed (most likely destroyed), update the player view
1010	* appropriately.
1011	*/
1012	if (tmp->container == this)
1013	{
1014	flag [FLAG_APPLIED] = 0;
1015	tmp->container = 0;
1016	}
1017
1018	if (tmp->contr->ns)
1019	tmp->contr->ns->floorbox_update ();
1020	}
1021		1104
1022	/* See if object moving off should effect something */	1105	/* See if object moving off should effect something */
1023	if (check_walk_off	1106	if (check_walk_off
1024	&& ((move_type & tmp->move_off)	1107	&& ((move_type & tmp->move_off)
1025	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1108	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1028		1111
1029	if (destroyed ())	1112	if (destroyed ())
1030	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1113	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1031	}	1114	}
1032		1115
1033	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1034	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1035	if (tmp->above == tmp)
1036	tmp->above = 0;
1037
1038	last = tmp;	1116	last = tmp;
1039	}	1117	}
1040		1118
1041	/* last == NULL if there are no objects on this space */	1119	/* last == NULL if there are no objects on this space */
1042	//TODO: this makes little sense, why only update the topmost object?	1120	//TODO: this makes little sense, why only update the topmost object?
…		…
1085	}	1163	}
1086		1164
1087	return 0;	1165	return 0;
1088	}	1166	}
1089		1167
		1168	void
		1169	object::expand_tail ()
		1170	{
		1171	if (more)
		1172	return;
		1173
		1174	object *prev = this;
		1175
		1176	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)
		1177	{
		1178	object *op = arch_to_object (at);
		1179
		1180	op->name = name;
		1181	op->name_pl = name_pl;
		1182	op->title = title;
		1183
		1184	op->head = this;
		1185	prev->more = op;
		1186
		1187	prev = op;
		1188	}
		1189	}
		1190
1090	/*	1191	/*
1091	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1192	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1092	* job preparing multi-part monsters	1193	* job preparing multi-part monsters.
1093	*/	1194	*/
1094	object *	1195	object *
1095	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1196	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1096	{	1197	{
1097	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1198	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1098	{	1199	{
1099	tmp->x = x + tmp->arch->clone.x;	1200	tmp->x = x + tmp->arch->x;
1100	tmp->y = y + tmp->arch->clone.y;	1201	tmp->y = y + tmp->arch->y;
1101	}	1202	}
1102		1203
1103	return insert_ob_in_map (op, m, originator, flag);	1204	return insert_ob_in_map (op, m, originator, flag);
1104	}	1205	}
1105		1206
…		…
1124	* just 'op' otherwise	1225	* just 'op' otherwise
1125	*/	1226	*/
1126	object *	1227	object *
1127	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1228	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1128	{	1229	{
		1230	assert (!op->flag [FLAG_FREED]);
		1231
1129	object tmp, top, *floor = NULL;	1232	object top, floor = NULL;
1130	sint16 x, y;
1131		1233
1132	if (QUERY_FLAG (op, FLAG_FREED))	1234	op->remove ();
1133	{
1134	LOG (llevError, "Trying to insert freed object!\n");
1135	return NULL;
1136	}
1137
1138	if (!m)
1139	{
1140	char *dump = dump_object (op);
1141	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1142	free (dump);
1143	return op;
1144	}
1145
1146	if (out_of_map (m, op->x, op->y))
1147	{
1148	char *dump = dump_object (op);
1149	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1150	#ifdef MANY_CORES
1151	/* Better to catch this here, as otherwise the next use of this object
1152	* is likely to cause a crash. Better to find out where it is getting
1153	* improperly inserted.
1154	*/
1155	abort ();
1156	#endif
1157	free (dump);
1158	return op;
1159	}
1160
1161	if (!QUERY_FLAG (op, FLAG_REMOVED))
1162	{
1163	char *dump = dump_object (op);
1164	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1165	free (dump);
1166	return op;
1167	}
1168
1169	if (op->more)
1170	{
1171	/* The part may be on a different map. */
1172
1173	object *more = op->more;
1174
1175	/* We really need the caller to normalise coordinates - if
1176	* we set the map, that doesn't work if the location is within
1177	* a map and this is straddling an edge. So only if coordinate
1178	* is clear wrong do we normalise it.
1179	*/
1180	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1181	more->map = get_map_from_coord (m, &more->x, &more->y);
1182	else if (!more->map)
1183	{
1184	/* For backwards compatibility - when not dealing with tiled maps,
1185	* more->map should always point to the parent.
1186	*/
1187	more->map = m;
1188	}
1189
1190	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1191	{
1192	if (!op->head)
1193	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1194
1195	return 0;
1196	}
1197	}
1198
1199	CLEAR_FLAG (op, FLAG_REMOVED);
1200		1235
1201	/* Ideally, the caller figures this out. However, it complicates a lot	1236	/* Ideally, the caller figures this out. However, it complicates a lot
1202	* of areas of callers (eg, anything that uses find_free_spot would now	1237	* of areas of callers (eg, anything that uses find_free_spot would now
1203	* need extra work	1238	* need extra work
1204	*/	1239	*/
1205	op->map = get_map_from_coord (m, &op->x, &op->y);	1240	if (!xy_normalise (m, op->x, op->y))
1206	x = op->x;	1241	{
1207	y = op->y;	1242	op->destroy ();
		1243	return 0;
		1244	}
		1245
		1246	if (object *more = op->more)
		1247	if (!insert_ob_in_map (more, m, originator, flag))
		1248	return 0;
		1249
		1250	CLEAR_FLAG (op, FLAG_REMOVED);
		1251
		1252	op->map = m;
		1253	mapspace &ms = op->ms ();
1208		1254
1209	/* this has to be done after we translate the coordinates.	1255	/* this has to be done after we translate the coordinates.
1210	*/	1256	*/
1211	if (op->nrof && !(flag & INS_NO_MERGE))	1257	if (op->nrof && !(flag & INS_NO_MERGE))
1212	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1258	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1213	if (object::can_merge (op, tmp))	1259	if (object::can_merge (op, tmp))
1214	{	1260	{
1215	op->nrof += tmp->nrof;	1261	op->nrof += tmp->nrof;
1216	tmp->destroy ();	1262	tmp->destroy ();
1217	}	1263	}
…		…
1234	op->below = originator->below;	1280	op->below = originator->below;
1235		1281
1236	if (op->below)	1282	if (op->below)
1237	op->below->above = op;	1283	op->below->above = op;
1238	else	1284	else
1239	op->ms ().bot = op;	1285	ms.bot = op;
1240		1286
1241	/* since below originator, no need to update top */	1287	/* since below originator, no need to update top */
1242	originator->below = op;	1288	originator->below = op;
1243	}	1289	}
1244	else	1290	else
1245	{	1291	{
		1292	top = ms.bot;
		1293
1246	/* If there are other objects, then */	1294	/* If there are other objects, then */
1247	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1295	if ((!(flag & INS_MAP_LOAD)) && top)
1248	{	1296	{
1249	object *last = 0;	1297	object *last = 0;
1250		1298
1251	/*	1299	/*
1252	* If there are multiple objects on this space, we do some trickier handling.	1300	* If there are multiple objects on this space, we do some trickier handling.
…		…
1258	* once we get to them. This reduces the need to traverse over all of	1306	* once we get to them. This reduces the need to traverse over all of
1259	* them when adding another one - this saves quite a bit of cpu time	1307	* them when adding another one - this saves quite a bit of cpu time
1260	* when lots of spells are cast in one area. Currently, it is presumed	1308	* when lots of spells are cast in one area. Currently, it is presumed
1261	* that flying non pickable objects are spell objects.	1309	* that flying non pickable objects are spell objects.
1262	*/	1310	*/
1263	while (top)	1311	for (top = ms.bot; top; top = top->above)
1264	{	1312	{
1265	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1313	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1266	floor = top;	1314	floor = top;
1267		1315
1268	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1316	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1271	top = top->below;	1319	top = top->below;
1272	break;	1320	break;
1273	}	1321	}
1274		1322
1275	last = top;	1323	last = top;
1276	top = top->above;
1277	}	1324	}
1278		1325
1279	/* Don't want top to be NULL, so set it to the last valid object */	1326	/* Don't want top to be NULL, so set it to the last valid object */
1280	top = last;	1327	top = last;
1281		1328
…		…
1283	* looks like instead of lots of conditions here.	1330	* looks like instead of lots of conditions here.
1284	* makes things faster, and effectively the same result.	1331	* makes things faster, and effectively the same result.
1285	*/	1332	*/
1286		1333
1287	/* Have object 'fall below' other objects that block view.	1334	/* Have object 'fall below' other objects that block view.
1288	* Unless those objects are exits, type 66	1335	* Unless those objects are exits.
1289	* If INS_ON_TOP is used, don't do this processing	1336	* If INS_ON_TOP is used, don't do this processing
1290	* Need to find the object that in fact blocks view, otherwise	1337	* Need to find the object that in fact blocks view, otherwise
1291	* stacking is a bit odd.	1338	* stacking is a bit odd.
1292	*/	1339	*/
1293	if (!(flag & INS_ON_TOP) &&	1340	if (!(flag & INS_ON_TOP)
1294	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1341	&& ms.flags () & P_BLOCKSVIEW
		1342	&& (op->face && !faces [op->face].visibility))
1295	{	1343	{
1296	for (last = top; last != floor; last = last->below)	1344	for (last = top; last != floor; last = last->below)
1297	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1345	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1298	break;	1346	break;
		1347
1299	/* Check to see if we found the object that blocks view,	1348	/* Check to see if we found the object that blocks view,
1300	* and make sure we have a below pointer for it so that	1349	* and make sure we have a below pointer for it so that
1301	* we can get inserted below this one, which requires we	1350	* we can get inserted below this one, which requires we
1302	* set top to the object below us.	1351	* set top to the object below us.
1303	*/	1352	*/
1304	if (last && last->below && last != floor)	1353	if (last && last->below && last != floor)
1305	top = last->below;	1354	top = last->below;
1306	}	1355	}
1307	} /* If objects on this space */	1356	} /* If objects on this space */
1308
1309	if (flag & INS_MAP_LOAD)	1357	if (flag & INS_MAP_LOAD)
1310	top = GET_MAP_TOP (op->map, op->x, op->y);	1358	top = ms.top;
1311		1359
1312	if (flag & INS_ABOVE_FLOOR_ONLY)	1360	if (flag & INS_ABOVE_FLOOR_ONLY)
1313	top = floor;	1361	top = floor;
1314		1362
1315	/* Top is the object that our object (op) is going to get inserted above.	1363	/* Top is the object that our object (op) is going to get inserted above.
1316	*/	1364	*/
1317		1365
1318	/* First object on this space */	1366	/* First object on this space */
1319	if (!top)	1367	if (!top)
1320	{	1368	{
1321	op->above = GET_MAP_OB (op->map, op->x, op->y);	1369	op->above = ms.bot;
1322		1370
1323	if (op->above)	1371	if (op->above)
1324	op->above->below = op;	1372	op->above->below = op;
1325		1373
1326	op->below = 0;	1374	op->below = 0;
1327	op->ms ().bot = op;	1375	ms.bot = op;
1328	}	1376	}
1329	else	1377	else
1330	{ /* get inserted into the stack above top */	1378	{ /* get inserted into the stack above top */
1331	op->above = top->above;	1379	op->above = top->above;
1332		1380
…		…
1336	op->below = top;	1384	op->below = top;
1337	top->above = op;	1385	top->above = op;
1338	}	1386	}
1339		1387
1340	if (!op->above)	1388	if (!op->above)
1341	op->ms ().top = op;	1389	ms.top = op;
1342	} /* else not INS_BELOW_ORIGINATOR */	1390	} /* else not INS_BELOW_ORIGINATOR */
1343		1391
1344	if (op->type == PLAYER)	1392	if (op->type == PLAYER)
1345	{	1393	{
1346	op->contr->do_los = 1;	1394	op->contr->do_los = 1;
…		…
1348	op->map->touch ();	1396	op->map->touch ();
1349	}	1397	}
1350		1398
1351	op->map->dirty = true;	1399	op->map->dirty = true;
1352		1400
1353	/* If we have a floor, we know the player, if any, will be above
1354	* it, so save a few ticks and start from there.
1355	*/
1356	if (!(flag & INS_MAP_LOAD))	1401	if (!(flag & INS_MAP_LOAD))
1357	if (object *pl = op->ms ().player ())	1402	if (object *pl = ms.player ())
1358	if (pl->contr->ns)
1359	pl->contr->ns->floorbox_update ();	1403	pl->contr->ns->floorbox_update ();
1360		1404
1361	/* If this object glows, it may affect lighting conditions that are	1405	/* If this object glows, it may affect lighting conditions that are
1362	* visible to others on this map. But update_all_los is really	1406	* visible to others on this map. But update_all_los is really
1363	* an inefficient way to do this, as it means los for all players	1407	* an inefficient way to do this, as it means los for all players
1364	* on the map will get recalculated. The players could very well	1408	* on the map will get recalculated. The players could very well
…		…
1383	* blocked() and wall() work properly), and these flags are updated by	1427	* blocked() and wall() work properly), and these flags are updated by
1384	* update_object().	1428	* update_object().
1385	*/	1429	*/
1386		1430
1387	/* if this is not the head or flag has been passed, don't check walk on status */	1431	/* if this is not the head or flag has been passed, don't check walk on status */
1388	if (!(flag & INS_NO_WALK_ON) && !op->head)	1432	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1389	{	1433	{
1390	if (check_move_on (op, originator))	1434	if (check_move_on (op, originator))
1391	return 0;	1435	return 0;
1392		1436
1393	/* If we are a multi part object, lets work our way through the check	1437	/* If we are a multi part object, lets work our way through the check
1394	* walk on's.	1438	* walk on's.
1395	*/	1439	*/
1396	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1440	for (object *tmp = op->more; tmp; tmp = tmp->more)
1397	if (check_move_on (tmp, originator))	1441	if (check_move_on (tmp, originator))
1398	return 0;	1442	return 0;
1399	}	1443	}
1400		1444
1401	return op;	1445	return op;
…		…
1411	object tmp, tmp1;	1455	object tmp, tmp1;
1412		1456
1413	/* first search for itself and remove any old instances */	1457	/* first search for itself and remove any old instances */
1414		1458
1415	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1459	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1416	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1460	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1417	tmp->destroy ();	1461	tmp->destroy ();
1418		1462
1419	tmp1 = arch_to_object (archetype::find (arch_string));	1463	tmp1 = arch_to_object (archetype::find (arch_string));
1420		1464
1421	tmp1->x = op->x;	1465	tmp1->x = op->x;
…		…
1424	}	1468	}
1425		1469
1426	object *	1470	object *
1427	object::insert_at (object where, object originator, int flags)	1471	object::insert_at (object where, object originator, int flags)
1428	{	1472	{
1429	where->map->insert (this, where->x, where->y, originator, flags);	1473	return where->map->insert (this, where->x, where->y, originator, flags);
1430	}	1474	}
1431		1475
1432	/*	1476	/*
1433	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1477	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1434	* is returned contains nr objects, and the remaining parts contains	1478	* is returned contains nr objects, and the remaining parts contains
…		…
1474	* the amount of an object. If the amount reaches 0, the object	1518	* the amount of an object. If the amount reaches 0, the object
1475	* is subsequently removed and freed.	1519	* is subsequently removed and freed.
1476	*	1520	*
1477	* Return value: 'op' if something is left, NULL if the amount reached 0	1521	* Return value: 'op' if something is left, NULL if the amount reached 0
1478	*/	1522	*/
1479
1480	object *	1523	object *
1481	decrease_ob_nr (object *op, uint32 i)	1524	decrease_ob_nr (object *op, uint32 i)
1482	{	1525	{
1483	object *tmp;	1526	object *tmp;
1484		1527
…		…
1559		1602
1560	/*	1603	/*
1561	* add_weight(object, weight) adds the specified weight to an object,	1604	* add_weight(object, weight) adds the specified weight to an object,
1562	* and also updates how much the environment(s) is/are carrying.	1605	* and also updates how much the environment(s) is/are carrying.
1563	*/	1606	*/
1564
1565	void	1607	void
1566	add_weight (object *op, signed long weight)	1608	add_weight (object *op, signed long weight)
1567	{	1609	{
1568	while (op != NULL)	1610	while (op != NULL)
1569	{	1611	{
…		…
1584	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1626	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1585	free (dump);	1627	free (dump);
1586	return op;	1628	return op;
1587	}	1629	}
1588		1630
1589	if (where->head)	1631	if (where->head_ () != where)
1590	{	1632	{
1591	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1633	LOG (llevError \| logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1592	where = where->head;	1634	where = where->head;
1593	}	1635	}
1594		1636
1595	return where->insert (op);	1637	return where->insert (op);
1596	}	1638	}
…		…
1601	* inside the object environment.	1643	* inside the object environment.
1602	*	1644	*
1603	* The function returns now pointer to inserted item, and return value can	1645	* The function returns now pointer to inserted item, and return value can
1604	* be != op, if items are merged. -Tero	1646	* be != op, if items are merged. -Tero
1605	*/	1647	*/
1606
1607	object *	1648	object *
1608	object::insert (object *op)	1649	object::insert (object *op)
1609	{	1650	{
1610	object tmp, otmp;
1611
1612	if (!QUERY_FLAG (op, FLAG_REMOVED))	1651	if (!QUERY_FLAG (op, FLAG_REMOVED))
1613	op->remove ();	1652	op->remove ();
1614		1653
1615	if (op->more)	1654	if (op->more)
1616	{	1655	{
…		…
1618	return op;	1657	return op;
1619	}	1658	}
1620		1659
1621	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1660	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1622	CLEAR_FLAG (op, FLAG_REMOVED);	1661	CLEAR_FLAG (op, FLAG_REMOVED);
		1662
1623	if (op->nrof)	1663	if (op->nrof)
1624	{	1664	{
1625	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1665	for (object *tmp = inv; tmp; tmp = tmp->below)
1626	if (object::can_merge (tmp, op))	1666	if (object::can_merge (tmp, op))
1627	{	1667	{
1628	/* return the original object and remove inserted object	1668	/* return the original object and remove inserted object
1629	(client needs the original object) */	1669	(client needs the original object) */
1630	tmp->nrof += op->nrof;	1670	tmp->nrof += op->nrof;
…		…
1649	add_weight (this, op->weight * op->nrof);	1689	add_weight (this, op->weight * op->nrof);
1650	}	1690	}
1651	else	1691	else
1652	add_weight (this, (op->weight + op->carrying));	1692	add_weight (this, (op->weight + op->carrying));
1653		1693
1654	otmp = this->in_player ();	1694	if (object *otmp = this->in_player ())
1655	if (otmp && otmp->contr)
1656	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1695	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1657	otmp->update_stats ();	1696	otmp->update_stats ();
1658		1697
		1698	op->owner = 0; // its his/hers now. period.
1659	op->map = 0;	1699	op->map = 0;
1660	op->env = this;	1700	op->env = this;
1661	op->above = 0;	1701	op->above = 0;
1662	op->below = 0;	1702	op->below = 0;
1663	op->x = 0, op->y = 0;	1703	op->x = op->y = 0;
1664		1704
1665	/* reset the light list and los of the players on the map */	1705	/* reset the light list and los of the players on the map */
1666	if ((op->glow_radius != 0) && map)	1706	if (op->glow_radius && map)
1667	{	1707	{
1668	#ifdef DEBUG_LIGHTS	1708	#ifdef DEBUG_LIGHTS
1669	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1709	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1670	#endif /* DEBUG_LIGHTS */	1710	#endif /* DEBUG_LIGHTS */
1671	if (map->darkness)	1711	if (map->darkness)
…		…
1771	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1811	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1772	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1812	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1773	{	1813	{
1774		1814
1775	float	1815	float
1776	diff = tmp->move_slow_penalty * FABS (op->speed);	1816	diff = tmp->move_slow_penalty * fabs (op->speed);
1777		1817
1778	if (op->type == PLAYER)	1818	if (op->type == PLAYER)
1779	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1819	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|
1780	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1820	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1781	diff /= 4.0;	1821	diff /= 4.0;
…		…
1925	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1965	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1926	{	1966	{
1927	CLEAR_FLAG (tmp, flag);	1967	CLEAR_FLAG (tmp, flag);
1928	unflag_inv (tmp, flag);	1968	unflag_inv (tmp, flag);
1929	}	1969	}
1930	}
1931
1932	/*
1933	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1934	* all it's inventory (recursively).
1935	* If checksums are used, a player will get set_cheat called for
1936	* him/her-self and all object carried by a call to this function.
1937	*/
1938	void
1939	set_cheat (object *op)
1940	{
1941	SET_FLAG (op, FLAG_WAS_WIZ);
1942	flag_inv (op, FLAG_WAS_WIZ);
1943	}	1970	}
1944		1971
1945	/*	1972	/*
1946	* find_free_spot(object, map, x, y, start, stop) will search for	1973	* find_free_spot(object, map, x, y, start, stop) will search for
1947	* a spot at the given map and coordinates which will be able to contain	1974	* a spot at the given map and coordinates which will be able to contain
…		…
1964	* customized, changed states, etc.	1991	* customized, changed states, etc.
1965	*/	1992	*/
1966	int	1993	int
1967	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)	1994	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)
1968	{	1995	{
		1996	int altern[SIZEOFFREE];
1969	int index = 0, flag;	1997	int index = 0, flag;
1970	int altern[SIZEOFFREE];
1971		1998
1972	for (int i = start; i < stop; i++)	1999	for (int i = start; i < stop; i++)
1973	{	2000	{
1974	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2001	mapxy pos (m, x, y); pos.move (i);
1975	if (!flag)	2002
		2003	if (!pos.normalise ())
		2004	continue;
		2005
		2006	mapspace &ms = *pos;
		2007
		2008	if (ms.flags () & P_IS_ALIVE)
		2009	continue;
		2010
		2011	/* However, often
		2012	* ob doesn't have any move type (when used to place exits)
		2013	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2014	*/
		2015	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2016	{
1976	altern [index++] = i;	2017	altern [index++] = i;
		2018	continue;
		2019	}
1977		2020
1978	/* Basically, if we find a wall on a space, we cut down the search size.	2021	/* Basically, if we find a wall on a space, we cut down the search size.
1979	* In this way, we won't return spaces that are on another side of a wall.	2022	* In this way, we won't return spaces that are on another side of a wall.
1980	* This mostly work, but it cuts down the search size in all directions -	2023	* This mostly work, but it cuts down the search size in all directions -
1981	* if the space being examined only has a wall to the north and empty	2024	* if the space being examined only has a wall to the north and empty
1982	* spaces in all the other directions, this will reduce the search space	2025	* spaces in all the other directions, this will reduce the search space
1983	* to only the spaces immediately surrounding the target area, and	2026	* to only the spaces immediately surrounding the target area, and
1984	* won't look 2 spaces south of the target space.	2027	* won't look 2 spaces south of the target space.
1985	*/	2028	*/
1986	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2029	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2030	{
1987	stop = maxfree[i];	2031	stop = maxfree[i];
		2032	continue;
		2033	}
		2034
		2035	/* Note it is intentional that we check ob - the movement type of the
		2036	* head of the object should correspond for the entire object.
		2037	*/
		2038	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2039	continue;
		2040
		2041	altern [index++] = i;
1988	}	2042	}
1989		2043
1990	if (!index)	2044	if (!index)
1991	return -1;	2045	return -1;
1992		2046
1993	return altern[RANDOM () % index];	2047	return altern [rndm (index)];
1994	}	2048	}
1995		2049
1996	/*	2050	/*
1997	* find_first_free_spot(archetype, maptile, x, y) works like	2051	* find_first_free_spot(archetype, maptile, x, y) works like
1998	* find_free_spot(), but it will search max number of squares.	2052	* find_free_spot(), but it will search max number of squares.
…		…
2001	*/	2055	*/
2002	int	2056	int
2003	find_first_free_spot (const object ob, maptile m, int x, int y)	2057	find_first_free_spot (const object ob, maptile m, int x, int y)
2004	{	2058	{
2005	for (int i = 0; i < SIZEOFFREE; i++)	2059	for (int i = 0; i < SIZEOFFREE; i++)
2006	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2060	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2007	return i;	2061	return i;
2008		2062
2009	return -1;	2063	return -1;
2010	}	2064	}
2011		2065
…		…
2019	{	2073	{
2020	arr += begin;	2074	arr += begin;
2021	end -= begin;	2075	end -= begin;
2022		2076
2023	while (--end)	2077	while (--end)
2024	swap (arr [end], arr [RANDOM () % (end + 1)]);	2078	swap (arr [end], arr [rndm (end + 1)]);
2025	}	2079	}
2026		2080
2027	/* new function to make monster searching more efficient, and effective!	2081	/* new function to make monster searching more efficient, and effective!
2028	* This basically returns a randomized array (in the passed pointer) of	2082	* This basically returns a randomized array (in the passed pointer) of
2029	* the spaces to find monsters. In this way, it won't always look for	2083	* the spaces to find monsters. In this way, it won't always look for
…		…
2065	object *tmp;	2119	object *tmp;
2066	maptile *mp;	2120	maptile *mp;
2067		2121
2068	MoveType blocked, move_type;	2122	MoveType blocked, move_type;
2069		2123
2070	if (exclude && exclude->head)	2124	if (exclude && exclude->head_ () != exclude)
2071	{	2125	{
2072	exclude = exclude->head;	2126	exclude = exclude->head;
2073	move_type = exclude->move_type;	2127	move_type = exclude->move_type;
2074	}	2128	}
2075	else	2129	else
…		…
2098	max = maxfree[i];	2152	max = maxfree[i];
2099	else if (mflags & P_IS_ALIVE)	2153	else if (mflags & P_IS_ALIVE)
2100	{	2154	{
2101	for (tmp = ms.bot; tmp; tmp = tmp->above)	2155	for (tmp = ms.bot; tmp; tmp = tmp->above)
2102	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)	2156	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)
2103	&& (tmp != exclude \|\| (tmp->head && tmp->head != exclude)))	2157	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2104	break;	2158	break;
2105		2159
2106	if (tmp)	2160	if (tmp)
2107	return freedir[i];	2161	return freedir[i];
2108	}	2162	}
…		…
2163		2217
2164	return 3;	2218	return 3;
2165	}	2219	}
2166		2220
2167	/*	2221	/*
2168	* absdir(int): Returns a number between 1 and 8, which represent
2169	* the "absolute" direction of a number (it actually takes care of
2170	* "overflow" in previous calculations of a direction).
2171	*/
2172
2173	int
2174	absdir (int d)
2175	{
2176	while (d < 1)
2177	d += 8;
2178
2179	while (d > 8)
2180	d -= 8;
2181
2182	return d;
2183	}
2184
2185	/*
2186	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2222	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2187	* between two directions (which are expected to be absolute (see absdir())	2223	* between two directions (which are expected to be absolute (see absdir())
2188	*/	2224	*/
2189
2190	int	2225	int
2191	dirdiff (int dir1, int dir2)	2226	dirdiff (int dir1, int dir2)
2192	{	2227	{
2193	int d;	2228	int d;
2194		2229
…		…
2307	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2342	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2308	* core dumps if they do.	2343	* core dumps if they do.
2309	*	2344	*
2310	* Add a check so we can't pick up invisible objects (0.93.8)	2345	* Add a check so we can't pick up invisible objects (0.93.8)
2311	*/	2346	*/
2312
2313	int	2347	int
2314	can_pick (const object who, const object item)	2348	can_pick (const object who, const object item)
2315	{	2349	{
2316	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2350	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /
2317	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2351	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2322	* create clone from object to another	2356	* create clone from object to another
2323	*/	2357	*/
2324	object *	2358	object *
2325	object_create_clone (object *asrc)	2359	object_create_clone (object *asrc)
2326	{	2360	{
2327	object dst = 0, tmp, src, part, prev, item;	2361	object dst = 0, tmp, src, prev, *item;
2328		2362
2329	if (!asrc)	2363	if (!asrc)
2330	return 0;	2364	return 0;
2331		2365
2332	src = asrc;
2333	if (src->head)
2334	src = src->head;	2366	src = asrc->head_ ();
2335		2367
2336	prev = 0;	2368	prev = 0;
2337	for (part = src; part; part = part->more)	2369	for (object *part = src; part; part = part->more)
2338	{	2370	{
2339	tmp = part->clone ();	2371	tmp = part->clone ();
2340	tmp->x -= src->x;	2372	tmp->x -= src->x;
2341	tmp->y -= src->y;	2373	tmp->y -= src->y;
2342		2374
…		…
2358		2390
2359	for (item = src->inv; item; item = item->below)	2391	for (item = src->inv; item; item = item->below)
2360	insert_ob_in_ob (object_create_clone (item), dst);	2392	insert_ob_in_ob (object_create_clone (item), dst);
2361		2393
2362	return dst;	2394	return dst;
2363	}
2364
2365	/* GROS - Creates an object using a string representing its content. */
2366	/* Basically, we save the content of the string to a temp file, then call */
2367	/* load_object on it. I admit it is a highly inefficient way to make things, */
2368	/* but it was simple to make and allows reusing the load_object function. */
2369	/* Remember not to use load_object_str in a time-critical situation. */
2370	/* Also remember that multiparts objects are not supported for now. */
2371	object *
2372	load_object_str (const char *obstr)
2373	{
2374	object *op;
2375	char filename[MAX_BUF];
2376
2377	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2378
2379	FILE *tempfile = fopen (filename, "w");
2380
2381	if (tempfile == NULL)
2382	{
2383	LOG (llevError, "Error - Unable to access load object temp file\n");
2384	return NULL;
2385	}
2386
2387	fprintf (tempfile, obstr);
2388	fclose (tempfile);
2389
2390	op = object::create ();
2391
2392	object_thawer thawer (filename);
2393
2394	if (thawer)
2395	load_object (thawer, op, 0);
2396
2397	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2398	CLEAR_FLAG (op, FLAG_REMOVED);
2399
2400	return op;
2401	}	2395	}
2402		2396
2403	/* This returns the first object in who's inventory that	2397	/* This returns the first object in who's inventory that
2404	* has the same type and subtype match.	2398	* has the same type and subtype match.
2405	* returns NULL if no match.	2399	* returns NULL if no match.
…		…
2460	if (link->key == canonical_key)	2454	if (link->key == canonical_key)
2461	return link->value;	2455	return link->value;
2462		2456
2463	return 0;	2457	return 0;
2464	}	2458	}
2465
2466		2459
2467	/*	2460	/*
2468	* Updates the canonical_key in op to value.	2461	* Updates the canonical_key in op to value.
2469	*	2462	*
2470	* canonical_key is a shared string (value doesn't have to be).	2463	* canonical_key is a shared string (value doesn't have to be).
…		…
2494	/* Basically, if the archetype has this key set,	2487	/* Basically, if the archetype has this key set,
2495	* we need to store the null value so when we save	2488	* we need to store the null value so when we save
2496	* it, we save the empty value so that when we load,	2489	* it, we save the empty value so that when we load,
2497	* we get this value back again.	2490	* we get this value back again.
2498	*/	2491	*/
2499	if (get_ob_key_link (&op->arch->clone, canonical_key))	2492	if (get_ob_key_link (op->arch, canonical_key))
2500	field->value = 0;	2493	field->value = 0;
2501	else	2494	else
2502	{	2495	{
2503	if (last)	2496	if (last)
2504	last->next = field->next;	2497	last->next = field->next;
…		…
2573	}	2566	}
2574	else	2567	else
2575	item = item->env;	2568	item = item->env;
2576	}	2569	}
2577		2570
2578
2579	const char *	2571	const char *
2580	object::flag_desc (char *desc, int len) const	2572	object::flag_desc (char *desc, int len) const
2581	{	2573	{
2582	char *p = desc;	2574	char *p = desc;
2583	bool first = true;	2575	bool first = true;
…		…
2610	{	2602	{
2611	char flagdesc[512];	2603	char flagdesc[512];
2612	char info2[256 * 4];	2604	char info2[256 * 4];
2613	char *p = info;	2605	char *p = info;
2614		2606
2615	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",	2607	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2616	count, uuid.seq,	2608	count, uuid.seq,
2617	&name,	2609	&name,
2618	title ? "\",title:" : "",	2610	title ? "\",title:\"" : "",
2619	title ? (const char *)title : "",	2611	title ? (const char *)title : "",
2620	flag_desc (flagdesc, 512), type);	2612	flag_desc (flagdesc, 512), type);
2621		2613
2622	if (env)	2614	if (!this->flag[FLAG_REMOVED] && env)
2623	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2615	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2624		2616
2625	if (map)	2617	if (map)
2626	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2618	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2627		2619
…		…
2629	}	2621	}
2630		2622
2631	const char *	2623	const char *
2632	object::debug_desc () const	2624	object::debug_desc () const
2633	{	2625	{
2634	static char info[256 * 4];	2626	static char info[3][256 * 4];
		2627	static int info_idx;
		2628
2635	return debug_desc (info);	2629	return debug_desc (info [++info_idx % 3]);
2636	}	2630	}
2637		2631
		2632	struct region *
		2633	object::region () const
		2634	{
		2635	return map ? map->region (x, y)
		2636	: region::default_region ();
		2637	}
		2638
		2639	const materialtype_t *
		2640	object::dominant_material () const
		2641	{
		2642	if (materialtype_t *mt = name_to_material (materialname))
		2643	return mt;
		2644
		2645	return name_to_material (shstr_unknown);
		2646	}
		2647
		2648	void
		2649	object::open_container (object *new_container)
		2650	{
		2651	if (container == new_container)
		2652	return;
		2653
		2654	if (object *old_container = container)
		2655	{
		2656	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2657	return;
		2658
		2659	#if 0
		2660	// remove the "Close old_container" object.
		2661	if (object *closer = old_container->inv)
		2662	if (closer->type == CLOSE_CON)
		2663	closer->destroy ();
		2664	#endif
		2665
		2666	old_container->flag [FLAG_APPLIED] = 0;
		2667	container = 0;
		2668
		2669	esrv_update_item (UPD_FLAGS, this, old_container);
		2670	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2671	play_sound (sound_find ("chest_close"));
		2672	}
		2673
		2674	if (new_container)
		2675	{
		2676	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2677	return;
		2678
		2679	// TODO: this does not seem to serve any purpose anymore?
		2680	#if 0
		2681	// insert the "Close Container" object.
		2682	if (archetype *closer = new_container->other_arch)
		2683	{
		2684	object *closer = arch_to_object (new_container->other_arch);
		2685	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2686	new_container->insert (closer);
		2687	}
		2688	#endif
		2689
		2690	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2691
		2692	new_container->flag [FLAG_APPLIED] = 1;
		2693	container = new_container;
		2694
		2695	esrv_update_item (UPD_FLAGS, this, new_container);
		2696	esrv_send_inventory (this, new_container);
		2697	play_sound (sound_find ("chest_open"));
		2698	}
		2699	}
		2700
		2701	object *
		2702	object::force_find (const shstr name)
		2703	{
		2704	/* cycle through his inventory to look for the MARK we want to
		2705	* place
		2706	*/
		2707	for (object *tmp = inv; tmp; tmp = tmp->below)
		2708	if (tmp->type == FORCE && tmp->slaying == name)
		2709	return splay (tmp);
		2710
		2711	return 0;
		2712	}
		2713
		2714	void
		2715	object::force_add (const shstr name, int duration)
		2716	{
		2717	if (object *force = force_find (name))
		2718	force->destroy ();
		2719
		2720	object *force = get_archetype (FORCE_NAME);
		2721
		2722	force->slaying = name;
		2723	force->stats.food = 1;
		2724	force->speed_left = -1.f;
		2725
		2726	force->set_speed (duration ? 1.f / duration : 0.f);
		2727	force->flag [FLAG_IS_USED_UP] = true;
		2728	force->flag [FLAG_APPLIED] = true;
		2729
		2730	insert (force);
		2731	}
		2732
		2733	void
		2734	object::play_sound (faceidx sound) const
		2735	{
		2736	if (!sound)
		2737	return;
		2738
		2739	if (flag [FLAG_REMOVED])
		2740	return;
		2741
		2742	if (env)
		2743	{
		2744	if (object *pl = in_player ())
		2745	pl->contr->play_sound (sound);
		2746	}
		2747	else
		2748	map->play_sound (sound, x, y);
		2749	}
		2750

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.111 by root, Mon Jan 8 01:19:02 2007 UTC vs. Revision 1.190 by root, Sat Sep 15 15:58:06 2007 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.111 by root, Mon Jan 8 01:19:02 2007 UTC vs.
Revision 1.190 by root, Sat Sep 15 15:58:06 2007 UTC