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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.96 by root, Sat Dec 30 10:16:10 2006 UTC vs.
Revision 1.143 by root, Tue May 1 05:48:20 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>
36		37
37	int nrofallocobjects = 0;	38	int nrofallocobjects = 0;
38	static UUID uuid;	39	static UUID uuid;
39	const uint64 UUID_SKIP = 1<<19;	40	const uint64 UUID_SKIP = 1<<19;
40		41
41	object active_objects; / List of active objects that need to be processed */	42	objectvec objects;
		43	activevec actives;
42		44
43	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	45	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
44	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	46	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
45	};	47	};
46	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	48	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
…		…
276		278
277	/* Note sure why the following is the case - either the object has to	279	/* Note sure why the following is the case - either the object has to
278	* be animated or have a very low speed. Is this an attempted monster	280	* be animated or have a very low speed. Is this an attempted monster
279	* check?	281	* check?
280	*/	282	*/
281	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	283	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
282	return 0;	284	return 0;
283		285
284	switch (ob1->type)	286	switch (ob1->type)
285	{	287	{
286	case SCROLL:	288	case SCROLL:
…		…
322	sum_weight (object *op)	324	sum_weight (object *op)
323	{	325	{
324	long sum;	326	long sum;
325	object *inv;	327	object *inv;
326		328
327	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	329	for (sum = 0, inv = op->inv; inv; inv = inv->below)
328	{	330	{
329	if (inv->inv)	331	if (inv->inv)
330	sum_weight (inv);	332	sum_weight (inv);
		333
331	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
332	}	335	}
333		336
334	if (op->type == CONTAINER && op->stats.Str)	337	if (op->type == CONTAINER && op->stats.Str)
335	sum = (sum * (100 - op->stats.Str)) / 100;	338	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
355	/*	358	/*
356	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	359	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
357	* Some error messages.	360	* Some error messages.
358	* 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.
359	*/	362	*/
360
361	char *	363	char *
362	dump_object (object *op)	364	dump_object (object *op)
363	{	365	{
364	if (!op)	366	if (!op)
365	return strdup ("[NULLOBJ]");	367	return strdup ("[NULLOBJ]");
366		368
367	object_freezer freezer;	369	object_freezer freezer;
368	save_object (freezer, op, 1);	370	op->write (freezer);
369	return freezer.as_string ();	371	return freezer.as_string ();
370	}	372	}
371		373
372	/*	374	/*
373	* 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
…		…
390	}	392	}
391		393
392	/*	394	/*
393	* Returns the object which has the count-variable equal to the argument.	395	* Returns the object which has the count-variable equal to the argument.
394	*/	396	*/
395
396	object *	397	object *
397	find_object (tag_t i)	398	find_object (tag_t i)
398	{	399	{
399	for (object *op = object::first; op; op = op->next)	400	for_all_objects (op)
400	if (op->count == i)	401	if (op->count == i)
401	return op;	402	return op;
402		403
403	return 0;	404	return 0;
404	}	405	}
405		406
406	/*	407	/*
407	* Returns the first object which has a name equal to the argument.	408	* Returns the first object which has a name equal to the argument.
408	* Used only by the patch command, but not all that useful.	409	* Used only by the patch command, but not all that useful.
409	* Enables features like "patch <name-of-other-player> food 999"	410	* Enables features like "patch <name-of-other-player> food 999"
410	*/	411	*/
411
412	object *	412	object *
413	find_object_name (const char *str)	413	find_object_name (const char *str)
414	{	414	{
415	shstr_cmp str_ (str);	415	shstr_cmp str_ (str);
416	object *op;	416	object *op;
417		417
418	for (op = object::first; op != NULL; op = op->next)	418	for_all_objects (op)
419	if (op->name == str_)	419	if (op->name == str_)
420	break;	420	break;
421		421
422	return op;	422	return op;
423	}	423	}
…		…
455	* refcounts and freeing the links.	455	* refcounts and freeing the links.
456	*/	456	*/
457	static void	457	static void
458	free_key_values (object *op)	458	free_key_values (object *op)
459	{	459	{
460	for (key_value *i = op->key_values; i != 0;)	460	for (key_value *i = op->key_values; i; )
461	{	461	{
462	key_value *next = i->next;	462	key_value *next = i->next;
463	delete i;	463	delete i;
464		464
465	i = next;	465	i = next;
466	}	466	}
467		467
468	op->key_values = 0;	468	op->key_values = 0;
469	}	469	}
470		470
471	/*	471	object &
472	* copy_to first frees everything allocated by the dst object,	472	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	{	473	{
482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	474	bool is_freed = flag [FLAG_FREED];
483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	475	bool is_removed = flag [FLAG_REMOVED];
484		476
485	(object_copy )dst = *this;	477	(object_copy )this = src;
486		478
487	if (is_freed)	479	flag [FLAG_FREED] = is_freed;
488	SET_FLAG (dst, FLAG_FREED);	480	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		481
496	/* Copy over key_values, if any. */	482	/* Copy over key_values, if any. */
497	if (key_values)	483	if (src.key_values)
498	{	484	{
499	key_value *tail = 0;	485	key_value *tail = 0;
500	key_value *i;
501
502	dst->key_values = 0;	486	key_values = 0;
503		487
504	for (i = key_values; i; i = i->next)	488	for (key_value *i = src.key_values; i; i = i->next)
505	{	489	{
506	key_value *new_link = new key_value;	490	key_value *new_link = new key_value;
507		491
508	new_link->next = 0;	492	new_link->next = 0;
509	new_link->key = i->key;	493	new_link->key = i->key;
510	new_link->value = i->value;	494	new_link->value = i->value;
511		495
512	/* Try and be clever here, too. */	496	/* Try and be clever here, too. */
513	if (!dst->key_values)	497	if (!key_values)
514	{	498	{
515	dst->key_values = new_link;	499	key_values = new_link;
516	tail = new_link;	500	tail = new_link;
517	}	501	}
518	else	502	else
519	{	503	{
520	tail->next = new_link;	504	tail->next = new_link;
521	tail = new_link;	505	tail = new_link;
522	}	506	}
523	}	507	}
524	}	508	}
		509	}
		510
		511	/*
		512	* copy_to first frees everything allocated by the dst object,
		513	* and then copies the contents of itself into the second
		514	* object, allocating what needs to be allocated. Basically, any
		515	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		516	* if the first object is freed, the pointers in the new object
		517	* will point at garbage.
		518	*/
		519	void
		520	object::copy_to (object *dst)
		521	{
		522	dst = this;
		523
		524	if (speed < 0)
		525	dst->speed_left = speed_left - rndm ();
525		526
526	dst->set_speed (dst->speed);	527	dst->set_speed (dst->speed);
		528	}
		529
		530	void
		531	object::instantiate ()
		532	{
		533	if (!uuid.seq) // HACK
		534	uuid = gen_uuid ();
		535
		536	speed_left = -0.1f;
		537	/* copy the body_info to the body_used - this is only really
		538	* need for monsters, but doesn't hurt to do it for everything.
		539	* by doing so, when a monster is created, it has good starting
		540	* values for the body_used info, so when items are created
		541	* for it, they can be properly equipped.
		542	*/
		543	memcpy (body_used, body_info, sizeof (body_used));
		544
		545	attachable::instantiate ();
527	}	546	}
528		547
529	object *	548	object *
530	object::clone ()	549	object::clone ()
531	{	550	{
…		…
563	speed = 0;	582	speed = 0;
564	}	583	}
565		584
566	this->speed = speed;	585	this->speed = speed;
567		586
568	if (FABS (speed) > MIN_ACTIVE_SPEED)	587	if (has_active_speed ())
569	{	588	activate ();
570	/* If already on active list, don't do anything */
571	if (active_next \|\| active_prev \|\| this == active_objects)
572	return;
573
574	/* process_events() expects us to insert the object at the beginning
575	* of the list. */
576	active_next = active_objects;
577
578	if (active_next)
579	active_next->active_prev = this;
580
581	active_objects = this;
582	}
583	else	589	else
584	{	590	deactivate ();
585	/* If not on the active list, nothing needs to be done */
586	if (!active_next && !active_prev && this != active_objects)
587	return;
588
589	if (!active_prev)
590	{
591	active_objects = active_next;
592
593	if (active_next)
594	active_next->active_prev = 0;
595	}
596	else
597	{
598	active_prev->active_next = active_next;
599
600	if (active_next)
601	active_next->active_prev = active_prev;
602	}
603
604	active_next = 0;
605	active_prev = 0;
606	}
607	}	591	}
608		592
609	/*	593	/*
610	* update_object() updates the the map.	594	* update_object() updates the the map.
611	* It takes into account invisible objects (and represent squares covered	595	* It takes into account invisible objects (and represent squares covered
…		…
624	* UP_OBJ_FACE: only the objects face has changed.	608	* UP_OBJ_FACE: only the objects face has changed.
625	*/	609	*/
626	void	610	void
627	update_object (object *op, int action)	611	update_object (object *op, int action)
628	{	612	{
629	MoveType move_on, move_off, move_block, move_slow;
630
631	if (op == NULL)	613	if (op == NULL)
632	{	614	{
633	/* this should never happen */	615	/* this should never happen */
634	LOG (llevDebug, "update_object() called for NULL object.\n");	616	LOG (llevDebug, "update_object() called for NULL object.\n");
635	return;	617	return;
…		…
659	return;	641	return;
660	}	642	}
661		643
662	mapspace &m = op->ms ();	644	mapspace &m = op->ms ();
663		645
664	if (m.flags_ & P_NEED_UPDATE)	646	if (!(m.flags_ & P_UPTODATE))
665	/* nop */;	647	/* nop */;
666	else if (action == UP_OBJ_INSERT)	648	else if (action == UP_OBJ_INSERT)
667	{	649	{
668	// this is likely overkill, TODO: revisit (schmorp)	650	// this is likely overkill, TODO: revisit (schmorp)
669	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	651	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
…		…
678	/* This isn't perfect, but I don't expect a lot of objects to	660	/* This isn't perfect, but I don't expect a lot of objects to
679	* to have move_allow right now.	661	* to have move_allow right now.
680	*/	662	*/
681	\|\| ((m.move_block \| op->move_block) & ~op->move_allow) != m.move_block	663	\|\| ((m.move_block \| op->move_block) & ~op->move_allow) != m.move_block
682	\|\| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	664	\|\| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
683	m.flags_ = P_NEED_UPDATE;	665	m.flags_ = 0;
684	}	666	}
685	/* if the object is being removed, we can't make intelligent	667	/* if the object is being removed, we can't make intelligent
686	* decisions, because remove_ob can't really pass the object	668	* decisions, because remove_ob can't really pass the object
687	* that is being removed.	669	* that is being removed.
688	*/	670	*/
689	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)	671	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)
690	m.flags_ = P_NEED_UPDATE;	672	m.flags_ = 0;
691	else if (action == UP_OBJ_FACE)	673	else if (action == UP_OBJ_FACE)
692	/* Nothing to do for that case */ ;	674	/* Nothing to do for that case */ ;
693	else	675	else
694	LOG (llevError, "update_object called with invalid action: %d\n", action);	676	LOG (llevError, "update_object called with invalid action: %d\n", action);
695		677
696	if (op->more)	678	if (op->more)
697	update_object (op->more, action);	679	update_object (op->more, action);
698	}	680	}
699		681
700	object::vector object::objects; // not yet used
701	object *object::first;
702
703	object::object ()	682	object::object ()
704	{	683	{
705	SET_FLAG (this, FLAG_REMOVED);	684	SET_FLAG (this, FLAG_REMOVED);
706		685
707	expmul = 1.0;	686	expmul = 1.0;
708	face = blank_face;	687	face = blank_face;
709	}	688	}
710		689
711	object::~object ()	690	object::~object ()
712	{	691	{
		692	unlink ();
		693
713	free_key_values (this);	694	free_key_values (this);
714	}	695	}
715		696
		697	static int object_count;
		698
716	void object::link ()	699	void object::link ()
717	{	700	{
718	count = ++ob_count;	701	assert (!index);//D
719	uuid = gen_uuid ();	702	uuid = gen_uuid ();
		703	count = ++object_count;
720		704
721	prev = 0;	705	refcnt_inc ();
722	next = object::first;	706	objects.insert (this);
723
724	if (object::first)
725	object::first->prev = this;
726
727	object::first = this;
728	}	707	}
729		708
730	void object::unlink ()	709	void object::unlink ()
731	{	710	{
732	if (this == object::first)	711	if (!index)
733	object::first = next;	712	return;
734		713
735	/* Remove this object from the list of used objects */	714	objects.erase (this);
736	if (prev) prev->next = next;	715	refcnt_dec ();
737	if (next) next->prev = prev;
738
739	prev = 0;
740	next = 0;
741	}	716	}
742		717
743	void	718	void
		719	object::activate ()
		720	{
		721	/* If already on active list, don't do anything */
		722	if (active)
		723	return;
		724
		725	if (has_active_speed ())
		726	actives.insert (this);
		727	}
		728
		729	void
744	object::activate (bool recursive)	730	object::activate_recursive ()
745	{	731	{
746	// uh, hack	732	activate ();
747	set_speed (speed);
748		733
749	if (recursive)
750	for (object *op = inv; op; op = op->above)	734	for (object *op = inv; op; op = op->below)
751	op->activate (1);	735	op->activate_recursive ();
752	}	736	}
753		737
754	/* This function removes object 'op' from the list of active	738	/* This function removes object 'op' from the list of active
755	* objects.	739	* objects.
756	* This should only be used for style maps or other such	740	* This should only be used for style maps or other such
…		…
758	* in play chewing up cpu time getting processed.	742	* in play chewing up cpu time getting processed.
759	* The reverse of this is to call update_ob_speed, which	743	* The reverse of this is to call update_ob_speed, which
760	* will do the right thing based on the speed of the object.	744	* will do the right thing based on the speed of the object.
761	*/	745	*/
762	void	746	void
763	object::deactivate (bool recursive)	747	object::deactivate ()
764	{	748	{
765	/* If not on the active list, nothing needs to be done */	749	/* If not on the active list, nothing needs to be done */
766	if (!active_next && !active_prev && this != active_objects)	750	if (!active)
767	return;	751	return;
768		752
769	if (active_prev == 0)	753	actives.erase (this);
770	{	754	}
771	active_objects = active_next;
772	if (active_next)
773	active_next->active_prev = 0;
774	}
775	else
776	{
777	active_prev->active_next = active_next;
778	if (active_next)
779	active_next->active_prev = active_prev;
780	}
781		755
782	active_next = 0;	756	void
783	active_prev = 0;	757	object::deactivate_recursive ()
784		758	{
785	if (recursive)
786	for (object *op = inv; op; op = op->above)	759	for (object *op = inv; op; op = op->below)
		760	op->deactivate_recursive ();
		761
787	op->deactivate (1);	762	deactivate ();
		763	}
		764
		765	void
		766	object::set_flag_inv (int flag, int value)
		767	{
		768	for (object *op = inv; op; op = op->below)
		769	{
		770	op->flag [flag] = value;
		771	op->set_flag_inv (flag, value);
		772	}
788	}	773	}
789		774
790	/*	775	/*
791	* Remove and free all objects in the inventory of the given object.	776	* Remove and free all objects in the inventory of the given object.
792	* object.c ?	777	* object.c ?
…		…
807	* drop on that space.	792	* drop on that space.
808	*/	793	*/
809	if (!drop_to_ground	794	if (!drop_to_ground
810	\|\| !map	795	\|\| !map
811	\|\| map->in_memory != MAP_IN_MEMORY	796	\|\| map->in_memory != MAP_IN_MEMORY
		797	\|\| map->nodrop
812	\|\| ms ().move_block == MOVE_ALL)	798	\|\| ms ().move_block == MOVE_ALL)
813	{	799	{
814	while (inv)	800	while (inv)
815	{	801	{
816	inv->destroy_inv (drop_to_ground);	802	inv->destroy_inv (drop_to_ground);
…		…
825		811
826	if (op->flag [FLAG_STARTEQUIP]	812	if (op->flag [FLAG_STARTEQUIP]
827	\|\| op->flag [FLAG_NO_DROP]	813	\|\| op->flag [FLAG_NO_DROP]
828	\|\| op->type == RUNE	814	\|\| op->type == RUNE
829	\|\| op->type == TRAP	815	\|\| op->type == TRAP
830	\|\| op->flag [FLAG_IS_A_TEMPLATE])	816	\|\| op->flag [FLAG_IS_A_TEMPLATE]
		817	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
831	op->destroy ();	818	op->destroy ();
832	else	819	else
833	map->insert (op, x, y);	820	map->insert (op, x, y);
834	}	821	}
835	}	822	}
…		…
843	}	830	}
844		831
845	void	832	void
846	object::do_destroy ()	833	object::do_destroy ()
847	{	834	{
		835	attachable::do_destroy ();
		836
848	if (flag [FLAG_IS_LINKED])	837	if (flag [FLAG_IS_LINKED])
849	remove_button_link (this);	838	remove_button_link (this);
850		839
851	if (flag [FLAG_FRIENDLY])	840	if (flag [FLAG_FRIENDLY])
852	remove_friendly_object (this);	841	remove_friendly_object (this);
853		842
854	if (!flag [FLAG_REMOVED])	843	if (!flag [FLAG_REMOVED])
855	remove ();	844	remove ();
856		845
857	if (flag [FLAG_FREED])	846	destroy_inv (true);
858	return;
859		847
860	set_speed (0);	848	deactivate ();
		849	unlink ();
861		850
862	flag [FLAG_FREED] = 1;	851	flag [FLAG_FREED] = 1;
863
864	attachable::do_destroy ();
865
866	destroy_inv (true);
867	unlink ();
868		852
869	// hack to ensure that freed objects still have a valid map	853	// hack to ensure that freed objects still have a valid map
870	{	854	{
871	static maptile *freed_map; // freed objects are moved here to avoid crashes	855	static maptile *freed_map; // freed objects are moved here to avoid crashes
872		856
…		…
877	freed_map->name = "/internal/freed_objects_map";	861	freed_map->name = "/internal/freed_objects_map";
878	freed_map->width = 3;	862	freed_map->width = 3;
879	freed_map->height = 3;	863	freed_map->height = 3;
880		864
881	freed_map->alloc ();	865	freed_map->alloc ();
		866	freed_map->in_memory = MAP_IN_MEMORY;
882	}	867	}
883		868
884	map = freed_map;	869	map = freed_map;
885	x = 1;	870	x = 1;
886	y = 1;	871	y = 1;
…		…
896		881
897	// clear those pointers that likely might have circular references to us	882	// clear those pointers that likely might have circular references to us
898	owner = 0;	883	owner = 0;
899	enemy = 0;	884	enemy = 0;
900	attacked_by = 0;	885	attacked_by = 0;
901
902	// only relevant for players(?), but make sure of it anyways
903	contr = 0;
904	}	886	}
905		887
906	void	888	void
907	object::destroy (bool destroy_inventory)	889	object::destroy (bool destroy_inventory)
908	{	890	{
…		…
936	* This function removes the object op from the linked list of objects	918	* This function removes the object op from the linked list of objects
937	* which it is currently tied to. When this function is done, the	919	* which it is currently tied to. When this function is done, the
938	* object will have no environment. If the object previously had an	920	* object will have no environment. If the object previously had an
939	* environment, the x and y coordinates will be updated to	921	* environment, the x and y coordinates will be updated to
940	* the previous environment.	922	* the previous environment.
941	* Beware: This function is called from the editor as well!
942	*/	923	*/
943	void	924	void
944	object::remove ()	925	object::do_remove ()
945	{	926	{
946	object tmp, last = 0;	927	object tmp, last = 0;
947	object *otmp;	928	object *otmp;
948		929
949	if (QUERY_FLAG (this, FLAG_REMOVED))	930	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
992	}	973	}
993	else if (map)	974	else if (map)
994	{	975	{
995	if (type == PLAYER)	976	if (type == PLAYER)
996	{	977	{
		978	// leaving a spot always closes any open container on the ground
		979	if (container && !container->env)
		980	// this causes spurious floorbox updates, but it ensures
		981	// that the CLOSE event is being sent.
		982	close_container ();
		983
997	--map->players;	984	--map->players;
998	map->last_access = runtime;	985	map->touch ();
999	}	986	}
1000		987
		988	map->dirty = true;
		989	mapspace &ms = this->ms ();
1001		990
1002	/* link the object above us */	991	/* link the object above us */
1003	if (above)	992	if (above)
1004	above->below = below;	993	above->below = below;
1005	else	994	else
1006	map->at (x, y).top = below; /* we were top, set new top */	995	ms.top = below; /* we were top, set new top */
1007		996
1008	/* Relink the object below us, if there is one */	997	/* Relink the object below us, if there is one */
1009	if (below)	998	if (below)
1010	below->above = above;	999	below->above = above;
1011	else	1000	else
…		…
1013	/* Nothing below, which means we need to relink map object for this space	1002	/* Nothing below, which means we need to relink map object for this space
1014	* use translated coordinates in case some oddness with map tiling is	1003	* use translated coordinates in case some oddness with map tiling is
1015	* evident	1004	* evident
1016	*/	1005	*/
1017	if (GET_MAP_OB (map, x, y) != this)	1006	if (GET_MAP_OB (map, x, y) != this)
1018	{
1019	char *dump = dump_object (this);
1020	LOG (llevError,
1021	"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);	1007	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 ());
1022	free (dump);
1023	dump = dump_object (GET_MAP_OB (map, x, y));
1024	LOG (llevError, "%s\n", dump);
1025	free (dump);
1026	}
1027		1008
1028	map->at (x, y).bot = above; /* goes on above it. */	1009	ms.bot = above; /* goes on above it. */
1029	}	1010	}
1030		1011
1031	above = 0;	1012	above = 0;
1032	below = 0;	1013	below = 0;
1033		1014
1034	if (map->in_memory == MAP_SAVING)	1015	if (map->in_memory == MAP_SAVING)
1035	return;	1016	return;
1036		1017
1037	int check_walk_off = !flag [FLAG_NO_APPLY];	1018	int check_walk_off = !flag [FLAG_NO_APPLY];
1038		1019
1039	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1020	for (tmp = ms.bot; tmp; tmp = tmp->above)
1040	{	1021	{
1041	/* No point updating the players look faces if he is the object	1022	/* No point updating the players look faces if he is the object
1042	* being removed.	1023	* being removed.
1043	*/	1024	*/
1044		1025
…		…
1078	}	1059	}
1079		1060
1080	/* last == NULL if there are no objects on this space */	1061	/* last == NULL if there are no objects on this space */
1081	//TODO: this makes little sense, why only update the topmost object?	1062	//TODO: this makes little sense, why only update the topmost object?
1082	if (!last)	1063	if (!last)
1083	map->at (x, y).flags_ = P_NEED_UPDATE;	1064	map->at (x, y).flags_ = 0;
1084	else	1065	else
1085	update_object (last, UP_OBJ_REMOVE);	1066	update_object (last, UP_OBJ_REMOVE);
1086		1067
1087	if (flag [FLAG_BLOCKSVIEW] \|\| glow_radius)	1068	if (flag [FLAG_BLOCKSVIEW] \|\| glow_radius)
1088	update_all_los (map, x, y);	1069	update_all_los (map, x, y);
…		…
1124	}	1105	}
1125		1106
1126	return 0;	1107	return 0;
1127	}	1108	}
1128		1109
		1110	void
		1111	object::expand_tail ()
		1112	{
		1113	if (more)
		1114	return;
		1115
		1116	object *prev = this;
		1117
		1118	for (archetype *at = arch->more; at; at = at->more)
		1119	{
		1120	object *op = arch_to_object (at);
		1121
		1122	op->name = name;
		1123	op->name_pl = name_pl;
		1124	op->title = title;
		1125
		1126	op->head = this;
		1127	prev->more = op;
		1128
		1129	prev = op;
		1130	}
		1131	}
		1132
1129	/*	1133	/*
1130	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1134	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1131	* job preparing multi-part monsters	1135	* job preparing multi-part monsters.
1132	*/	1136	*/
1133	object *	1137	object *
1134	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1138	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1135	{	1139	{
1136	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1140	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
…		…
1163	* just 'op' otherwise	1167	* just 'op' otherwise
1164	*/	1168	*/
1165	object *	1169	object *
1166	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1170	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1167	{	1171	{
		1172	assert (!op->flag [FLAG_FREED]);
		1173
1168	object tmp, top, *floor = NULL;	1174	object tmp, top, *floor = NULL;
1169	sint16 x, y;
1170		1175
1171	if (QUERY_FLAG (op, FLAG_FREED))	1176	op->remove ();
1172	{
1173	LOG (llevError, "Trying to insert freed object!\n");
1174	return NULL;
1175	}
1176		1177
1177	if (!m)	1178	#if 0
1178	{	1179	if (!m->active != !op->active)
1179	char *dump = dump_object (op);	1180	if (m->active)
1180	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1181	op->activate_recursive ();
1181	free (dump);	1182	else
1182	return op;	1183	op->deactivate_recursive ();
1183	}	1184	#endif
1184		1185
1185	if (out_of_map (m, op->x, op->y))	1186	if (out_of_map (m, op->x, op->y))
1186	{	1187	{
1187	char *dump = dump_object (op);
1188	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);	1188	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1189	#ifdef MANY_CORES	1189	#ifdef MANY_CORES
1190	/* Better to catch this here, as otherwise the next use of this object	1190	/* Better to catch this here, as otherwise the next use of this object
1191	* is likely to cause a crash. Better to find out where it is getting	1191	* is likely to cause a crash. Better to find out where it is getting
1192	* improperly inserted.	1192	* improperly inserted.
1193	*/	1193	*/
1194	abort ();	1194	abort ();
1195	#endif	1195	#endif
1196	free (dump);
1197	return op;	1196	return op;
1198	}	1197	}
1199		1198
1200	if (!QUERY_FLAG (op, FLAG_REMOVED))
1201	{
1202	char *dump = dump_object (op);
1203	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1204	free (dump);
1205	return op;
1206	}
1207
1208	if (op->more)
1209	{
1210	/* The part may be on a different map. */
1211
1212	object *more = op->more;	1199	if (object *more = op->more)
1213		1200	{
1214	/* We really need the caller to normalize coordinates - if
1215	* we set the map, that doesn't work if the location is within
1216	* a map and this is straddling an edge. So only if coordinate
1217	* is clear wrong do we normalize it.
1218	*/
1219	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1220	more->map = get_map_from_coord (m, &more->x, &more->y);
1221	else if (!more->map)
1222	{
1223	/* For backwards compatibility - when not dealing with tiled maps,
1224	* more->map should always point to the parent.
1225	*/
1226	more->map = m;
1227	}
1228
1229	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1201	if (!insert_ob_in_map (more, m, originator, flag))
1230	{	1202	{
1231	if (!op->head)	1203	if (!op->head)
1232	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1204	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1233		1205
1234	return 0;	1206	return 0;
…		…
1239		1211
1240	/* Ideally, the caller figures this out. However, it complicates a lot	1212	/* Ideally, the caller figures this out. However, it complicates a lot
1241	* of areas of callers (eg, anything that uses find_free_spot would now	1213	* of areas of callers (eg, anything that uses find_free_spot would now
1242	* need extra work	1214	* need extra work
1243	*/	1215	*/
1244	op->map = get_map_from_coord (m, &op->x, &op->y);	1216	if (!xy_normalise (m, op->x, op->y))
1245	x = op->x;	1217	return 0;
1246	y = op->y;	1218
		1219	op->map = m;
		1220	mapspace &ms = op->ms ();
1247		1221
1248	/* this has to be done after we translate the coordinates.	1222	/* this has to be done after we translate the coordinates.
1249	*/	1223	*/
1250	if (op->nrof && !(flag & INS_NO_MERGE))	1224	if (op->nrof && !(flag & INS_NO_MERGE))
1251	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1225	for (tmp = ms.bot; tmp; tmp = tmp->above)
1252	if (object::can_merge (op, tmp))	1226	if (object::can_merge (op, tmp))
1253	{	1227	{
1254	op->nrof += tmp->nrof;	1228	op->nrof += tmp->nrof;
1255	tmp->destroy ();	1229	tmp->destroy ();
1256	}	1230	}
…		…
1273	op->below = originator->below;	1247	op->below = originator->below;
1274		1248
1275	if (op->below)	1249	if (op->below)
1276	op->below->above = op;	1250	op->below->above = op;
1277	else	1251	else
1278	op->ms ().bot = op;	1252	ms.bot = op;
1279		1253
1280	/* since below originator, no need to update top */	1254	/* since below originator, no need to update top */
1281	originator->below = op;	1255	originator->below = op;
1282	}	1256	}
1283	else	1257	else
1284	{	1258	{
		1259	top = ms.bot;
		1260
1285	/* If there are other objects, then */	1261	/* If there are other objects, then */
1286	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1262	if ((!(flag & INS_MAP_LOAD)) && top)
1287	{	1263	{
1288	object *last = 0;	1264	object *last = 0;
1289		1265
1290	/*	1266	/*
1291	* If there are multiple objects on this space, we do some trickier handling.	1267	* If there are multiple objects on this space, we do some trickier handling.
…		…
1297	* once we get to them. This reduces the need to traverse over all of	1273	* once we get to them. This reduces the need to traverse over all of
1298	* them when adding another one - this saves quite a bit of cpu time	1274	* them when adding another one - this saves quite a bit of cpu time
1299	* when lots of spells are cast in one area. Currently, it is presumed	1275	* when lots of spells are cast in one area. Currently, it is presumed
1300	* that flying non pickable objects are spell objects.	1276	* that flying non pickable objects are spell objects.
1301	*/	1277	*/
1302	while (top)	1278	for (top = ms.bot; top; top = top->above)
1303	{	1279	{
1304	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1280	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1305	floor = top;	1281	floor = top;
1306		1282
1307	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1283	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1310	top = top->below;	1286	top = top->below;
1311	break;	1287	break;
1312	}	1288	}
1313		1289
1314	last = top;	1290	last = top;
1315	top = top->above;
1316	}	1291	}
1317		1292
1318	/* Don't want top to be NULL, so set it to the last valid object */	1293	/* Don't want top to be NULL, so set it to the last valid object */
1319	top = last;	1294	top = last;
1320		1295
…		…
1322	* looks like instead of lots of conditions here.	1297	* looks like instead of lots of conditions here.
1323	* makes things faster, and effectively the same result.	1298	* makes things faster, and effectively the same result.
1324	*/	1299	*/
1325		1300
1326	/* Have object 'fall below' other objects that block view.	1301	/* Have object 'fall below' other objects that block view.
1327	* Unless those objects are exits, type 66	1302	* Unless those objects are exits.
1328	* If INS_ON_TOP is used, don't do this processing	1303	* If INS_ON_TOP is used, don't do this processing
1329	* Need to find the object that in fact blocks view, otherwise	1304	* Need to find the object that in fact blocks view, otherwise
1330	* stacking is a bit odd.	1305	* stacking is a bit odd.
1331	*/	1306	*/
1332	if (!(flag & INS_ON_TOP) &&	1307	if (!(flag & INS_ON_TOP)
1333	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1308	&& ms.flags () & P_BLOCKSVIEW
		1309	&& (op->face && !faces [op->face].visibility))
1334	{	1310	{
1335	for (last = top; last != floor; last = last->below)	1311	for (last = top; last != floor; last = last->below)
1336	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1312	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1337	break;	1313	break;
		1314
1338	/* Check to see if we found the object that blocks view,	1315	/* Check to see if we found the object that blocks view,
1339	* and make sure we have a below pointer for it so that	1316	* and make sure we have a below pointer for it so that
1340	* we can get inserted below this one, which requires we	1317	* we can get inserted below this one, which requires we
1341	* set top to the object below us.	1318	* set top to the object below us.
1342	*/	1319	*/
…		…
1344	top = last->below;	1321	top = last->below;
1345	}	1322	}
1346	} /* If objects on this space */	1323	} /* If objects on this space */
1347		1324
1348	if (flag & INS_MAP_LOAD)	1325	if (flag & INS_MAP_LOAD)
1349	top = GET_MAP_TOP (op->map, op->x, op->y);	1326	top = ms.top;
1350		1327
1351	if (flag & INS_ABOVE_FLOOR_ONLY)	1328	if (flag & INS_ABOVE_FLOOR_ONLY)
1352	top = floor;	1329	top = floor;
1353		1330
1354	/* Top is the object that our object (op) is going to get inserted above.	1331	/* Top is the object that our object (op) is going to get inserted above.
1355	*/	1332	*/
1356		1333
1357	/* First object on this space */	1334	/* First object on this space */
1358	if (!top)	1335	if (!top)
1359	{	1336	{
1360	op->above = GET_MAP_OB (op->map, op->x, op->y);	1337	op->above = ms.bot;
1361		1338
1362	if (op->above)	1339	if (op->above)
1363	op->above->below = op;	1340	op->above->below = op;
1364		1341
1365	op->below = 0;	1342	op->below = 0;
1366	op->ms ().bot = op;	1343	ms.bot = op;
1367	}	1344	}
1368	else	1345	else
1369	{ /* get inserted into the stack above top */	1346	{ /* get inserted into the stack above top */
1370	op->above = top->above;	1347	op->above = top->above;
1371		1348
…		…
1375	op->below = top;	1352	op->below = top;
1376	top->above = op;	1353	top->above = op;
1377	}	1354	}
1378		1355
1379	if (!op->above)	1356	if (!op->above)
1380	op->ms ().top = op;	1357	ms.top = op;
1381	} /* else not INS_BELOW_ORIGINATOR */	1358	} /* else not INS_BELOW_ORIGINATOR */
1382		1359
1383	if (op->type == PLAYER)	1360	if (op->type == PLAYER)
1384	{	1361	{
1385	op->contr->do_los = 1;	1362	op->contr->do_los = 1;
1386	++op->map->players;	1363	++op->map->players;
1387	op->map->last_access = runtime;	1364	op->map->touch ();
1388	}	1365	}
		1366
		1367	op->map->dirty = true;
1389		1368
1390	/* If we have a floor, we know the player, if any, will be above	1369	/* If we have a floor, we know the player, if any, will be above
1391	* it, so save a few ticks and start from there.	1370	* it, so save a few ticks and start from there.
1392	*/	1371	*/
1393	if (!(flag & INS_MAP_LOAD))	1372	if (!(flag & INS_MAP_LOAD))
1394	if (object *pl = op->ms ().player ())	1373	if (object *pl = ms.player ())
1395	if (pl->contr->ns)	1374	if (pl->contr->ns)
1396	pl->contr->ns->floorbox_update ();	1375	pl->contr->ns->floorbox_update ();
1397		1376
1398	/* If this object glows, it may affect lighting conditions that are	1377	/* If this object glows, it may affect lighting conditions that are
1399	* visible to others on this map. But update_all_los is really	1378	* visible to others on this map. But update_all_los is really
1400	* an inefficient way to do this, as it means los for all players	1379	* an inefficient way to do this, as it means los for all players
1401	* on the map will get recalculated. The players could very well	1380	* on the map will get recalculated. The players could very well
1402	* be far away from this change and not affected in any way -	1381	* be far away from this change and not affected in any way -
1403	* this should get redone to only look for players within range,	1382	* this should get redone to only look for players within range,
1404	* or just updating the P_NEED_UPDATE for spaces within this area	1383	* or just updating the P_UPTODATE for spaces within this area
1405	* of effect may be sufficient.	1384	* of effect may be sufficient.
1406	*/	1385	*/
1407	if (op->map->darkness && (op->glow_radius != 0))	1386	if (op->map->darkness && (op->glow_radius != 0))
1408	update_all_los (op->map, op->x, op->y);	1387	update_all_los (op->map, op->x, op->y);
1409		1388
…		…
1447	{	1426	{
1448	object tmp, tmp1;	1427	object tmp, tmp1;
1449		1428
1450	/* first search for itself and remove any old instances */	1429	/* first search for itself and remove any old instances */
1451		1430
1452	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1431	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1453	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1432	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1454	tmp->destroy ();	1433	tmp->destroy ();
1455		1434
1456	tmp1 = arch_to_object (archetype::find (arch_string));	1435	tmp1 = arch_to_object (archetype::find (arch_string));
1457		1436
…		…
1461	}	1440	}
1462		1441
1463	object *	1442	object *
1464	object::insert_at (object where, object originator, int flags)	1443	object::insert_at (object where, object originator, int flags)
1465	{	1444	{
1466	where->map->insert (this, where->x, where->y, originator, flags);	1445	return where->map->insert (this, where->x, where->y, originator, flags);
1467	}	1446	}
1468		1447
1469	/*	1448	/*
1470	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1449	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1471	* is returned contains nr objects, and the remaining parts contains	1450	* is returned contains nr objects, and the remaining parts contains
…		…
1511	* the amount of an object. If the amount reaches 0, the object	1490	* the amount of an object. If the amount reaches 0, the object
1512	* is subsequently removed and freed.	1491	* is subsequently removed and freed.
1513	*	1492	*
1514	* Return value: 'op' if something is left, NULL if the amount reached 0	1493	* Return value: 'op' if something is left, NULL if the amount reached 0
1515	*/	1494	*/
1516
1517	object *	1495	object *
1518	decrease_ob_nr (object *op, uint32 i)	1496	decrease_ob_nr (object *op, uint32 i)
1519	{	1497	{
1520	object *tmp;	1498	object *tmp;
1521		1499
…		…
1596		1574
1597	/*	1575	/*
1598	* add_weight(object, weight) adds the specified weight to an object,	1576	* add_weight(object, weight) adds the specified weight to an object,
1599	* and also updates how much the environment(s) is/are carrying.	1577	* and also updates how much the environment(s) is/are carrying.
1600	*/	1578	*/
1601
1602	void	1579	void
1603	add_weight (object *op, signed long weight)	1580	add_weight (object *op, signed long weight)
1604	{	1581	{
1605	while (op != NULL)	1582	while (op != NULL)
1606	{	1583	{
…		…
1638	* inside the object environment.	1615	* inside the object environment.
1639	*	1616	*
1640	* The function returns now pointer to inserted item, and return value can	1617	* The function returns now pointer to inserted item, and return value can
1641	* be != op, if items are merged. -Tero	1618	* be != op, if items are merged. -Tero
1642	*/	1619	*/
1643
1644	object *	1620	object *
1645	object::insert (object *op)	1621	object::insert (object *op)
1646	{	1622	{
1647	object tmp, otmp;	1623	object tmp, otmp;
1648		1624
…		…
1780		1756
1781	/* The objects have to be checked from top to bottom.	1757	/* The objects have to be checked from top to bottom.
1782	* Hence, we first go to the top:	1758	* Hence, we first go to the top:
1783	*/	1759	*/
1784		1760
1785	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above)	1761	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1786	{	1762	{
1787	/* Trim the search when we find the first other spell effect	1763	/* Trim the search when we find the first other spell effect
1788	* this helps performance so that if a space has 50 spell objects,	1764	* this helps performance so that if a space has 50 spell objects,
1789	* we don't need to check all of them.	1765	* we don't need to check all of them.
1790	*/	1766	*/
…		…
1808	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1784	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1809	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1785	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1810	{	1786	{
1811		1787
1812	float	1788	float
1813	diff = tmp->move_slow_penalty * FABS (op->speed);	1789	diff = tmp->move_slow_penalty * fabs (op->speed);
1814		1790
1815	if (op->type == PLAYER)	1791	if (op->type == PLAYER)
1816	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1792	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|
1817	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1793	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1818	diff /= 4.0;	1794	diff /= 4.0;
…		…
1848	* The first matching object is returned, or NULL if none.	1824	* The first matching object is returned, or NULL if none.
1849	*/	1825	*/
1850	object *	1826	object *
1851	present_arch (const archetype at, maptile m, int x, int y)	1827	present_arch (const archetype at, maptile m, int x, int y)
1852	{	1828	{
1853	if (m == NULL \|\| out_of_map (m, x, y))	1829	if (!m \|\| out_of_map (m, x, y))
1854	{	1830	{
1855	LOG (llevError, "Present_arch called outside map.\n");	1831	LOG (llevError, "Present_arch called outside map.\n");
1856	return NULL;	1832	return NULL;
1857	}	1833	}
1858		1834
1859	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1835	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1860	if (tmp->arch == at)	1836	if (tmp->arch == at)
1861	return tmp;	1837	return tmp;
1862		1838
1863	return NULL;	1839	return NULL;
1864	}	1840	}
…		…
1875	{	1851	{
1876	LOG (llevError, "Present called outside map.\n");	1852	LOG (llevError, "Present called outside map.\n");
1877	return NULL;	1853	return NULL;
1878	}	1854	}
1879		1855
1880	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1856	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1881	if (tmp->type == type)	1857	if (tmp->type == type)
1882	return tmp;	1858	return tmp;
1883		1859
1884	return NULL;	1860	return NULL;
1885	}	1861	}
…		…
2025	}	2001	}
2026		2002
2027	if (!index)	2003	if (!index)
2028	return -1;	2004	return -1;
2029		2005
2030	return altern[RANDOM () % index];	2006	return altern [rndm (index)];
2031	}	2007	}
2032		2008
2033	/*	2009	/*
2034	* find_first_free_spot(archetype, maptile, x, y) works like	2010	* find_first_free_spot(archetype, maptile, x, y) works like
2035	* find_free_spot(), but it will search max number of squares.	2011	* find_free_spot(), but it will search max number of squares.
…		…
2056	{	2032	{
2057	arr += begin;	2033	arr += begin;
2058	end -= begin;	2034	end -= begin;
2059		2035
2060	while (--end)	2036	while (--end)
2061	swap (arr [end], arr [RANDOM () % (end + 1)]);	2037	swap (arr [end], arr [rndm (end + 1)]);
2062	}	2038	}
2063		2039
2064	/* new function to make monster searching more efficient, and effective!	2040	/* new function to make monster searching more efficient, and effective!
2065	* This basically returns a randomized array (in the passed pointer) of	2041	* This basically returns a randomized array (in the passed pointer) of
2066	* the spaces to find monsters. In this way, it won't always look for	2042	* the spaces to find monsters. In this way, it won't always look for
…		…
2200		2176
2201	return 3;	2177	return 3;
2202	}	2178	}
2203		2179
2204	/*	2180	/*
2205	* absdir(int): Returns a number between 1 and 8, which represent
2206	* the "absolute" direction of a number (it actually takes care of
2207	* "overflow" in previous calculations of a direction).
2208	*/
2209
2210	int
2211	absdir (int d)
2212	{
2213	while (d < 1)
2214	d += 8;
2215
2216	while (d > 8)
2217	d -= 8;
2218
2219	return d;
2220	}
2221
2222	/*
2223	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2181	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2224	* between two directions (which are expected to be absolute (see absdir())	2182	* between two directions (which are expected to be absolute (see absdir())
2225	*/	2183	*/
2226
2227	int	2184	int
2228	dirdiff (int dir1, int dir2)	2185	dirdiff (int dir1, int dir2)
2229	{	2186	{
2230	int d;	2187	int d;
2231		2188
…		…
2397	insert_ob_in_ob (object_create_clone (item), dst);	2354	insert_ob_in_ob (object_create_clone (item), dst);
2398		2355
2399	return dst;	2356	return dst;
2400	}	2357	}
2401		2358
2402	/* GROS - Creates an object using a string representing its content. */
2403	/* Basically, we save the content of the string to a temp file, then call */
2404	/* load_object on it. I admit it is a highly inefficient way to make things, */
2405	/* but it was simple to make and allows reusing the load_object function. */
2406	/* Remember not to use load_object_str in a time-critical situation. */
2407	/* Also remember that multiparts objects are not supported for now. */
2408	object *
2409	load_object_str (const char *obstr)
2410	{
2411	object *op;
2412	char filename[MAX_BUF];
2413
2414	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2415
2416	FILE *tempfile = fopen (filename, "w");
2417
2418	if (tempfile == NULL)
2419	{
2420	LOG (llevError, "Error - Unable to access load object temp file\n");
2421	return NULL;
2422	}
2423
2424	fprintf (tempfile, obstr);
2425	fclose (tempfile);
2426
2427	op = object::create ();
2428
2429	object_thawer thawer (filename);
2430
2431	if (thawer)
2432	load_object (thawer, op, 0);
2433
2434	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2435	CLEAR_FLAG (op, FLAG_REMOVED);
2436
2437	return op;
2438	}
2439
2440	/* This returns the first object in who's inventory that	2359	/* This returns the first object in who's inventory that
2441	* has the same type and subtype match.	2360	* has the same type and subtype match.
2442	* returns NULL if no match.	2361	* returns NULL if no match.
2443	*/	2362	*/
2444	object *	2363	object *
…		…
2497	if (link->key == canonical_key)	2416	if (link->key == canonical_key)
2498	return link->value;	2417	return link->value;
2499		2418
2500	return 0;	2419	return 0;
2501	}	2420	}
2502
2503		2421
2504	/*	2422	/*
2505	* Updates the canonical_key in op to value.	2423	* Updates the canonical_key in op to value.
2506	*	2424	*
2507	* canonical_key is a shared string (value doesn't have to be).	2425	* canonical_key is a shared string (value doesn't have to be).
…		…
2610	}	2528	}
2611	else	2529	else
2612	item = item->env;	2530	item = item->env;
2613	}	2531	}
2614		2532
		2533
		2534	const char *
		2535	object::flag_desc (char *desc, int len) const
		2536	{
		2537	char *p = desc;
		2538	bool first = true;
		2539
		2540	*p = 0;
		2541
		2542	for (int i = 0; i < NUM_FLAGS; i++)
		2543	{
		2544	if (len <= 10) // magic constant!
		2545	{
		2546	snprintf (p, len, ",...");
		2547	break;
		2548	}
		2549
		2550	if (flag [i])
		2551	{
		2552	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2553	len -= cnt;
		2554	p += cnt;
		2555	first = false;
		2556	}
		2557	}
		2558
		2559	return desc;
		2560	}
		2561
2615	// return a suitable string describing an objetc in enough detail to find it	2562	// return a suitable string describing an object in enough detail to find it
2616	const char *	2563	const char *
2617	object::debug_desc (char *info) const	2564	object::debug_desc (char *info) const
2618	{	2565	{
		2566	char flagdesc[512];
2619	char info2[256 * 3];	2567	char info2[256 * 4];
2620	char *p = info;	2568	char *p = info;
2621		2569
2622	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2570	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2623	count,	2571	count, uuid.seq,
2624	&name,	2572	&name,
2625	title ? " " : "",	2573	title ? "\",title:\"" : "",
2626	title ? (const char *)title : "");	2574	title ? (const char *)title : "",
		2575	flag_desc (flagdesc, 512), type);
2627		2576
2628	if (env)	2577	if (env)
2629	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2578	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2630		2579
2631	if (map)	2580	if (map)
…		…
2635	}	2584	}
2636		2585
2637	const char *	2586	const char *
2638	object::debug_desc () const	2587	object::debug_desc () const
2639	{	2588	{
2640	static char info[256 * 3];	2589	static char info[3][256 * 4];
		2590	static int info_idx;
		2591
2641	return debug_desc (info);	2592	return debug_desc (info [++info_idx % 3]);
2642	}	2593	}
2643		2594
		2595	struct region *
		2596	object::region () const
		2597	{
		2598	return map ? map->region (x, y)
		2599	: region::default_region ();
		2600	}
		2601
		2602	const materialtype_t *
		2603	object::dominant_material () const
		2604	{
		2605	if (materialtype_t *mat = name_to_material (materialname))
		2606	return mat;
		2607
		2608	// omfg this is slow, this has to be temporary :)
		2609	shstr unknown ("unknown");
		2610
		2611	return name_to_material (unknown);
		2612	}
		2613
		2614	void
		2615	object::open_container (object *new_container)
		2616	{
		2617	if (container == new_container)
		2618	return;
		2619
		2620	if (object *old_container = container)
		2621	{
		2622	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2623	return;
		2624
		2625	#if 0
		2626	// remove the "Close old_container" object.
		2627	if (object *closer = old_container->inv)
		2628	if (closer->type == CLOSE_CON)
		2629	closer->destroy ();
		2630	#endif
		2631
		2632	old_container->flag [FLAG_APPLIED] = 0;
		2633	container = 0;
		2634
		2635	esrv_update_item (UPD_FLAGS, this, old_container);
		2636	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2637	}
		2638
		2639	if (new_container)
		2640	{
		2641	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2642	return;
		2643
		2644	// TODO: this does not seem to serve any purpose anymore?
		2645	#if 0
		2646	// insert the "Close Container" object.
		2647	if (archetype *closer = new_container->other_arch)
		2648	{
		2649	object *closer = arch_to_object (new_container->other_arch);
		2650	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2651	new_container->insert (closer);
		2652	}
		2653	#endif
		2654
		2655	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2656
		2657	new_container->flag [FLAG_APPLIED] = 1;
		2658	container = new_container;
		2659
		2660	esrv_update_item (UPD_FLAGS, this, new_container);
		2661	esrv_send_inventory (this, new_container);
		2662	}
		2663	}
		2664
		2665

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.96 by root, Sat Dec 30 10:16:10 2006 UTC vs. Revision 1.143 by root, Tue May 1 05:48:20 2007 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.96 by root, Sat Dec 30 10:16:10 2006 UTC vs.
Revision 1.143 by root, Tue May 1 05:48:20 2007 UTC