ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.88 by root, Tue Dec 26 09:37:00 2006 UTC vs.
Revision 1.139 by root, Sat Apr 21 17:34:22 2007 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* CrossFire, A Multiplayer game for X-windows
3		3	*
		4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (C) 2001 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (C) 1992 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* This program is free software; you can redistribute it and/or modify
8	it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation; either version 2 of the License, or
10	(at your option) any later version.	11	* (at your option) any later version.
11		12	*
12	This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
18	along with this program; if not, write to the Free Software	19	* along with this program; if not, write to the Free Software
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20		21	*
21	The authors can be reached via e-mail at <crossfire@schmorp.de>	22	* The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	23	*/
23		24
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying	26	sub/add_weight will transcend the environment updating the carrying
26	variable. */	27	variable. */
27	#include <global.h>	28	#include <global.h>
…		…
36		37
37	int nrofallocobjects = 0;	38	int nrofallocobjects = 0;
38	static UUID uuid;	39	static UUID uuid;
39	const uint64 UUID_SKIP = 1<<19;	40	const uint64 UUID_SKIP = 1<<19;
40		41
41	object *active_objects; /* List of active objects that need to be processed */	42	objectvec objects;
		43	activevec actives;
42		44
43	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	45	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
44	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	46	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
45	};	47	};
46	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	48	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
…		…
190	* Check nrof variable *before* calling can_merge()	192	* Check nrof variable *before* calling can_merge()
191	*	193	*
192	* Improvements made with merge: Better checking on potion, and also	194	* Improvements made with merge: Better checking on potion, and also
193	* check weight	195	* check weight
194	*/	196	*/
195
196	bool object::can_merge_slow (object *ob1, object *ob2)	197	bool object::can_merge_slow (object *ob1, object *ob2)
197	{	198	{
198	/* A couple quicksanity checks */	199	/* A couple quicksanity checks */
199	if (ob1 == ob2	200	if (ob1 == ob2
200	|| ob1->type != ob2->type	201	|| ob1->type != ob2->type
…		…
277		278
278	/* Note sure why the following is the case - either the object has to	279	/* Note sure why the following is the case - either the object has to
279	* be animated or have a very low speed. Is this an attempted monster	280	* be animated or have a very low speed. Is this an attempted monster
280	* check?	281	* check?
281	*/	282	*/
282	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	283	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
283	return 0;	284	return 0;
284		285
285	switch (ob1->type)	286	switch (ob1->type)
286	{	287	{
287	case SCROLL:	288	case SCROLL:
…		…
356	/*	357	/*
357	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	358	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
358	* Some error messages.	359	* Some error messages.
359	* The result of the dump is stored in the static global errmsg array.	360	* The result of the dump is stored in the static global errmsg array.
360	*/	361	*/
361
362	char *	362	char *
363	dump_object (object *op)	363	dump_object (object *op)
364	{	364	{
365	if (!op)	365	if (!op)
366	return strdup ("[NULLOBJ]");	366	return strdup ("[NULLOBJ]");
367		367
368	object_freezer freezer;	368	object_freezer freezer;
369	save_object (freezer, op, 1);	369	op->write (freezer);
370	return freezer.as_string ();	370	return freezer.as_string ();
371	}	371	}
372		372
373	/*	373	/*
374	* get_nearest_part(multi-object, object 2) returns the part of the	374	* get_nearest_part(multi-object, object 2) returns the part of the
…		…
391	}	391	}
392		392
393	/*	393	/*
394	* 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.
395	*/	395	*/
396
397	object *	396	object *
398	find_object (tag_t i)	397	find_object (tag_t i)
399	{	398	{
400	for (object *op = object::first; op; op = op->next)	399	for_all_objects (op)
401	if (op->count == i)	400	if (op->count == i)
402	return op;	401	return op;
403		402
404	return 0;	403	return 0;
405	}	404	}
406		405
407	/*	406	/*
408	* 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.
409	* Used only by the patch command, but not all that useful.	408	* Used only by the patch command, but not all that useful.
410	* Enables features like "patch <name-of-other-player> food 999"	409	* Enables features like "patch <name-of-other-player> food 999"
411	*/	410	*/
412
413	object *	411	object *
414	find_object_name (const char *str)	412	find_object_name (const char *str)
415	{	413	{
416	shstr_cmp str_ (str);	414	shstr_cmp str_ (str);
417	object *op;	415	object *op;
418		416
419	for (op = object::first; op != NULL; op = op->next)	417	for_all_objects (op)
420	if (op->name == str_)	418	if (op->name == str_)
421	break;	419	break;
422		420
423	return op;	421	return op;
424	}	422	}
…		…
456	* refcounts and freeing the links.	454	* refcounts and freeing the links.
457	*/	455	*/
458	static void	456	static void
459	free_key_values (object *op)	457	free_key_values (object *op)
460	{	458	{
461	for (key_value *i = op->key_values; i != 0;)	459	for (key_value *i = op->key_values; i; )
462	{	460	{
463	key_value *next = i->next;	461	key_value *next = i->next;
464	delete i;	462	delete i;
465		463
466	i = next;	464	i = next;
467	}	465	}
468		466
469	op->key_values = 0;	467	op->key_values = 0;
470	}	468	}
471		469
472	/*	470	object &
473	* copy_to first frees everything allocated by the dst object,	471	object::operator =(const object &src)
474	* and then copies the contents of itself into the second
475	* object, allocating what needs to be allocated. Basically, any
476	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
477	* if the first object is freed, the pointers in the new object
478	* will point at garbage.
479	*/
480	void
481	object::copy_to (object *dst)
482	{	472	{
483	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	473	bool is_freed = flag [FLAG_FREED];
484	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	474	bool is_removed = flag [FLAG_REMOVED];
485		475
486	*(object_copy *)dst = *this;	476	*(object_copy *)this = src;
487		477
488	if (is_freed)	478	flag [FLAG_FREED] = is_freed;
489	SET_FLAG (dst, FLAG_FREED);	479	flag [FLAG_REMOVED] = is_removed;
490
491	if (is_removed)
492	SET_FLAG (dst, FLAG_REMOVED);
493
494	if (speed < 0)
495	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
496		480
497	/* Copy over key_values, if any. */	481	/* Copy over key_values, if any. */
498	if (key_values)	482	if (src.key_values)
499	{	483	{
500	key_value *tail = 0;	484	key_value *tail = 0;
501	key_value *i;
502
503	dst->key_values = 0;	485	key_values = 0;
504		486
505	for (i = key_values; i; i = i->next)	487	for (key_value *i = src.key_values; i; i = i->next)
506	{	488	{
507	key_value *new_link = new key_value;	489	key_value *new_link = new key_value;
508		490
509	new_link->next = 0;	491	new_link->next = 0;
510	new_link->key = i->key;	492	new_link->key = i->key;
511	new_link->value = i->value;	493	new_link->value = i->value;
512		494
513	/* Try and be clever here, too. */	495	/* Try and be clever here, too. */
514	if (!dst->key_values)	496	if (!key_values)
515	{	497	{
516	dst->key_values = new_link;	498	key_values = new_link;
517	tail = new_link;	499	tail = new_link;
518	}	500	}
519	else	501	else
520	{	502	{
521	tail->next = new_link;	503	tail->next = new_link;
522	tail = new_link;	504	tail = new_link;
523	}	505	}
524	}	506	}
525	}	507	}
		508	}
		509
		510	/*
		511	* copy_to first frees everything allocated by the dst object,
		512	* and then copies the contents of itself into the second
		513	* object, allocating what needs to be allocated. Basically, any
		514	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		515	* if the first object is freed, the pointers in the new object
		516	* will point at garbage.
		517	*/
		518	void
		519	object::copy_to (object *dst)
		520	{
		521	*dst = *this;
		522
		523	if (speed < 0)
		524	dst->speed_left = speed_left - rndm ();
526		525
527	dst->set_speed (dst->speed);	526	dst->set_speed (dst->speed);
		527	}
		528
		529	void
		530	object::instantiate ()
		531	{
		532	if (!uuid.seq) // HACK
		533	uuid = gen_uuid ();
		534
		535	speed_left = -0.1f;
		536	/* copy the body_info to the body_used - this is only really
		537	* need for monsters, but doesn't hurt to do it for everything.
		538	* by doing so, when a monster is created, it has good starting
		539	* values for the body_used info, so when items are created
		540	* for it, they can be properly equipped.
		541	*/
		542	memcpy (body_used, body_info, sizeof (body_used));
		543
		544	attachable::instantiate ();
528	}	545	}
529		546
530	object *	547	object *
531	object::clone ()	548	object::clone ()
532	{	549	{
…		…
538	/*	555	/*
539	* If an object with the IS_TURNABLE() flag needs to be turned due	556	* If an object with the IS_TURNABLE() flag needs to be turned due
540	* to the closest player being on the other side, this function can	557	* to the closest player being on the other side, this function can
541	* be called to update the face variable, _and_ how it looks on the map.	558	* be called to update the face variable, _and_ how it looks on the map.
542	*/	559	*/
543
544	void	560	void
545	update_turn_face (object *op)	561	update_turn_face (object *op)
546	{	562	{
547	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	563	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
548	return;	564	return;
		565
549	SET_ANIMATION (op, op->direction);	566	SET_ANIMATION (op, op->direction);
550	update_object (op, UP_OBJ_FACE);	567	update_object (op, UP_OBJ_FACE);
551	}	568	}
552		569
553	/*	570	/*
…		…
556	* This function needs to be called whenever the speed of an object changes.	573	* This function needs to be called whenever the speed of an object changes.
557	*/	574	*/
558	void	575	void
559	object::set_speed (float speed)	576	object::set_speed (float speed)
560	{	577	{
561	extern int arch_init;
562
563	/* No reason putting the archetypes objects on the speed list,
564	* since they never really need to be updated.
565	*/
566	if (flag [FLAG_FREED] && speed)	578	if (flag [FLAG_FREED] && speed)
567	{	579	{
568	LOG (llevError, "Object %s is freed but has speed.\n", &name);	580	LOG (llevError, "Object %s is freed but has speed.\n", &name);
569	speed = 0;	581	speed = 0;
570	}	582	}
571		583
572	this->speed = speed;	584	this->speed = speed;
573		585
574	if (arch_init)	586	if (has_active_speed ())
575	return;	587	activate ();
576
577	if (FABS (speed) > MIN_ACTIVE_SPEED)
578	{
579	/* If already on active list, don't do anything */
580	if (active_next || active_prev || this == active_objects)
581	return;
582
583	/* process_events() expects us to insert the object at the beginning
584	* of the list. */
585	active_next = active_objects;
586
587	if (active_next)
588	active_next->active_prev = this;
589
590	active_objects = this;
591	}
592	else	588	else
593	{	589	deactivate ();
594	/* If not on the active list, nothing needs to be done */
595	if (!active_next && !active_prev && this != active_objects)
596	return;
597
598	if (!active_prev)
599	{
600	active_objects = active_next;
601
602	if (active_next)
603	active_next->active_prev = 0;
604	}
605	else
606	{
607	active_prev->active_next = active_next;
608
609	if (active_next)
610	active_next->active_prev = active_prev;
611	}
612
613	active_next = 0;
614	active_prev = 0;
615	}
616	}
617
618	/* This function removes object 'op' from the list of active
619	* objects.
620	* This should only be used for style maps or other such
621	* reference maps where you don't want an object that isn't
622	* in play chewing up cpu time getting processed.
623	* The reverse of this is to call update_ob_speed, which
624	* will do the right thing based on the speed of the object.
625	*/
626	void
627	remove_from_active_list (object *op)
628	{
629	/* If not on the active list, nothing needs to be done */
630	if (!op->active_next && !op->active_prev && op != active_objects)
631	return;
632
633	if (op->active_prev == NULL)
634	{
635	active_objects = op->active_next;
636	if (op->active_next != NULL)
637	op->active_next->active_prev = NULL;
638	}
639	else
640	{
641	op->active_prev->active_next = op->active_next;
642	if (op->active_next)
643	op->active_next->active_prev = op->active_prev;
644	}
645	op->active_next = NULL;
646	op->active_prev = NULL;
647	}	590	}
648		591
649	/*	592	/*
650	* update_object() updates the the map.	593	* update_object() updates the the map.
651	* It takes into account invisible objects (and represent squares covered	594	* It takes into account invisible objects (and represent squares covered
…		…
664	* UP_OBJ_FACE: only the objects face has changed.	607	* UP_OBJ_FACE: only the objects face has changed.
665	*/	608	*/
666	void	609	void
667	update_object (object *op, int action)	610	update_object (object *op, int action)
668	{	611	{
669	MoveType move_on, move_off, move_block, move_slow;
670
671	if (op == NULL)	612	if (op == NULL)
672	{	613	{
673	/* this should never happen */	614	/* this should never happen */
674	LOG (llevDebug, "update_object() called for NULL object.\n");	615	LOG (llevDebug, "update_object() called for NULL object.\n");
675	return;	616	return;
…		…
699	return;	640	return;
700	}	641	}
701		642
702	mapspace &m = op->ms ();	643	mapspace &m = op->ms ();
703		644
704	if (m.flags_ & P_NEED_UPDATE)	645	if (!(m.flags_ & P_UPTODATE))
705	/* nop */;	646	/* nop */;
706	else if (action == UP_OBJ_INSERT)	647	else if (action == UP_OBJ_INSERT)
707	{	648	{
708	// this is likely overkill, TODO: revisit (schmorp)	649	// this is likely overkill, TODO: revisit (schmorp)
709	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	650	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
…		…
718	/* This isn't perfect, but I don't expect a lot of objects to	659	/* This isn't perfect, but I don't expect a lot of objects to
719	* to have move_allow right now.	660	* to have move_allow right now.
720	*/	661	*/
721	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	662	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
722	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	663	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
723	m.flags_ = P_NEED_UPDATE;	664	m.flags_ = 0;
724	}	665	}
725	/* if the object is being removed, we can't make intelligent	666	/* if the object is being removed, we can't make intelligent
726	* decisions, because remove_ob can't really pass the object	667	* decisions, because remove_ob can't really pass the object
727	* that is being removed.	668	* that is being removed.
728	*/	669	*/
729	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	670	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
730	m.flags_ = P_NEED_UPDATE;	671	m.flags_ = 0;
731	else if (action == UP_OBJ_FACE)	672	else if (action == UP_OBJ_FACE)
732	/* Nothing to do for that case */ ;	673	/* Nothing to do for that case */ ;
733	else	674	else
734	LOG (llevError, "update_object called with invalid action: %d\n", action);	675	LOG (llevError, "update_object called with invalid action: %d\n", action);
735		676
736	if (op->more)	677	if (op->more)
737	update_object (op->more, action);	678	update_object (op->more, action);
738	}	679	}
739		680
740	object::vector object::objects; // not yet used
741	object *object::first;
742
743	object::object ()	681	object::object ()
744	{	682	{
745	SET_FLAG (this, FLAG_REMOVED);	683	SET_FLAG (this, FLAG_REMOVED);
746		684
747	expmul = 1.0;	685	expmul = 1.0;
748	face = blank_face;	686	face = blank_face;
749	}	687	}
750		688
751	object::~object ()	689	object::~object ()
752	{	690	{
		691	unlink ();
		692
753	free_key_values (this);	693	free_key_values (this);
754	}	694	}
755		695
		696	static int object_count;
		697
756	void object::link ()	698	void object::link ()
757	{	699	{
758	count = ++ob_count;	700	assert (!index);//D
759	uuid = gen_uuid ();	701	uuid = gen_uuid ();
		702	count = ++object_count;
760		703
761	prev = 0;	704	refcnt_inc ();
762	next = object::first;	705	objects.insert (this);
763
764	if (object::first)
765	object::first->prev = this;
766
767	object::first = this;
768	}	706	}
769		707
770	void object::unlink ()	708	void object::unlink ()
771	{	709	{
772	if (this == object::first)	710	if (!index)
773	object::first = next;	711	return;
774		712
775	/* Remove this object from the list of used objects */	713	objects.erase (this);
776	if (prev) prev->next = next;	714	refcnt_dec ();
777	if (next) next->prev = prev;	715	}
778		716
779	prev = 0;	717	void
780	next = 0;	718	object::activate ()
		719	{
		720	/* If already on active list, don't do anything */
		721	if (active)
		722	return;
		723
		724	if (has_active_speed ())
		725	actives.insert (this);
		726	}
		727
		728	void
		729	object::activate_recursive ()
		730	{
		731	activate ();
		732
		733	for (object *op = inv; op; op = op->below)
		734	op->activate_recursive ();
		735	}
		736
		737	/* This function removes object 'op' from the list of active
		738	* objects.
		739	* This should only be used for style maps or other such
		740	* reference maps where you don't want an object that isn't
		741	* in play chewing up cpu time getting processed.
		742	* The reverse of this is to call update_ob_speed, which
		743	* will do the right thing based on the speed of the object.
		744	*/
		745	void
		746	object::deactivate ()
		747	{
		748	/* If not on the active list, nothing needs to be done */
		749	if (!active)
		750	return;
		751
		752	actives.erase (this);
		753	}
		754
		755	void
		756	object::deactivate_recursive ()
		757	{
		758	for (object *op = inv; op; op = op->below)
		759	op->deactivate_recursive ();
		760
		761	deactivate ();
		762	}
		763
		764	void
		765	object::set_flag_inv (int flag, int value)
		766	{
		767	for (object *op = inv; op; op = op->below)
		768	{
		769	op->flag [flag] = value;
		770	op->set_flag_inv (flag, value);
		771	}
		772	}
		773
		774	/*
		775	* Remove and free all objects in the inventory of the given object.
		776	* object.c ?
		777	*/
		778	void
		779	object::destroy_inv (bool drop_to_ground)
		780	{
		781	// need to check first, because the checks below might segfault
		782	// as we might be on an invalid mapspace and crossfire code
		783	// is too buggy to ensure that the inventory is empty.
		784	// corollary: if you create arrows etc. with stuff in tis inventory,
		785	// cf will crash below with off-map x and y
		786	if (!inv)
		787	return;
		788
		789	/* Only if the space blocks everything do we not process -
		790	* if some form of movement is allowed, let objects
		791	* drop on that space.
		792	*/
		793	if (!drop_to_ground
		794	|| !map
		795	|| map->in_memory != MAP_IN_MEMORY
		796	|| map->nodrop
		797	|| ms ().move_block == MOVE_ALL)
		798	{
		799	while (inv)
		800	{
		801	inv->destroy_inv (drop_to_ground);
		802	inv->destroy ();
		803	}
		804	}
		805	else
		806	{ /* Put objects in inventory onto this space */
		807	while (inv)
		808	{
		809	object *op = inv;
		810
		811	if (op->flag [FLAG_STARTEQUIP]
		812	|| op->flag [FLAG_NO_DROP]
		813	|| op->type == RUNE
		814	|| op->type == TRAP
		815	|| op->flag [FLAG_IS_A_TEMPLATE]
		816	|| op->flag [FLAG_DESTROY_ON_DEATH])
		817	op->destroy ();
		818	else
		819	map->insert (op, x, y);
		820	}
		821	}
781	}	822	}
782		823
783	object *object::create ()	824	object *object::create ()
784	{	825	{
785	object *op = new object;	826	object *op = new object;
…		…
794		835
795	if (flag [FLAG_IS_LINKED])	836	if (flag [FLAG_IS_LINKED])
796	remove_button_link (this);	837	remove_button_link (this);
797		838
798	if (flag [FLAG_FRIENDLY])	839	if (flag [FLAG_FRIENDLY])
		840	{
799	remove_friendly_object (this);	841	remove_friendly_object (this);
		842
		843	if (type == GOLEM
		844	&& owner
		845	&& owner->type == PLAYER
		846	&& owner->contr->ranges[range_golem] == this)
		847	owner->contr->ranges[range_golem] = 0;
		848	}
800		849
801	if (!flag [FLAG_REMOVED])	850	if (!flag [FLAG_REMOVED])
802	remove ();	851	remove ();
803		852
804	if (flag [FLAG_FREED])	853	destroy_inv (true);
805	return;	854
		855	deactivate ();
		856	unlink ();
806		857
807	flag [FLAG_FREED] = 1;	858	flag [FLAG_FREED] = 1;
808
809	while (inv)
810	inv->destroy ();
811
812	set_speed (0);
813	unlink ();
814		859
815	// hack to ensure that freed objects still have a valid map	860	// hack to ensure that freed objects still have a valid map
816	{	861	{
817	static maptile *freed_map; // freed objects are moved here to avoid crashes	862	static maptile *freed_map; // freed objects are moved here to avoid crashes
818		863
…		…
822		867
823	freed_map->name = "/internal/freed_objects_map";	868	freed_map->name = "/internal/freed_objects_map";
824	freed_map->width = 3;	869	freed_map->width = 3;
825	freed_map->height = 3;	870	freed_map->height = 3;
826		871
827	freed_map->allocate ();	872	freed_map->alloc ();
		873	freed_map->in_memory = MAP_IN_MEMORY;
828	}	874	}
829		875
830	map = freed_map;	876	map = freed_map;
831	x = 1;	877	x = 1;
832	y = 1;	878	y = 1;
…		…
842		888
843	// clear those pointers that likely might have circular references to us	889	// clear those pointers that likely might have circular references to us
844	owner = 0;	890	owner = 0;
845	enemy = 0;	891	enemy = 0;
846	attacked_by = 0;	892	attacked_by = 0;
847
848	// only relevant for players(?), but make sure of it anyways
849	contr = 0;
850	}
851
852	/*
853	* Remove and free all objects in the inventory of the given object.
854	* object.c ?
855	*/
856	void
857	object::destroy_inv (bool drop_to_ground)
858	{
859	/* Only if the space blocks everything do we not process -
860	* if some form of movement is allowed, let objects
861	* drop on that space.
862	*/
863	if (!drop_to_ground || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
864	{
865	while (inv)
866	inv->destroy ();
867	}
868	else
869	{ /* Put objects in inventory onto this space */
870	while (inv)
871	{
872	object *op = inv;
873
874	if (op->flag [FLAG_STARTEQUIP]
875	|| op->flag [FLAG_NO_DROP]
876	|| op->type == RUNE
877	|| op->type == TRAP
878	|| op->flag [FLAG_IS_A_TEMPLATE])
879	op->destroy ();
880	else
881	{
882	op->remove ();
883	op->x = x;
884	op->y = y;
885	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
886	}
887	}
888	}
889	}	893	}
890		894
891	void	895	void
892	object::destroy (bool destroy_inventory)	896	object::destroy (bool destroy_inventory)
893	{	897	{
894	if (destroyed ())	898	if (destroyed ())
895	return;	899	return;
896		900
897	if (destroy_inventory)	901	if (destroy_inventory)
898	destroy_inv (true);	902	destroy_inv (false);
899		903
900	attachable::destroy ();	904	attachable::destroy ();
901	}	905	}
902		906
903	/*	907	/*
…		…
921	* This function removes the object op from the linked list of objects	925	* This function removes the object op from the linked list of objects
922	* which it is currently tied to. When this function is done, the	926	* which it is currently tied to. When this function is done, the
923	* object will have no environment. If the object previously had an	927	* object will have no environment. If the object previously had an
924	* environment, the x and y coordinates will be updated to	928	* environment, the x and y coordinates will be updated to
925	* the previous environment.	929	* the previous environment.
926	* Beware: This function is called from the editor as well!
927	*/	930	*/
928	void	931	void
929	object::remove ()	932	object::do_remove ()
930	{	933	{
931	object *tmp, *last = 0;	934	object *tmp, *last = 0;
932	object *otmp;	935	object *otmp;
933		936
934	if (QUERY_FLAG (this, FLAG_REMOVED))	937	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
956	* to save cpu time.	959	* to save cpu time.
957	*/	960	*/
958	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	961	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
959	otmp->update_stats ();	962	otmp->update_stats ();
960		963
961	if (above != NULL)	964	if (above)
962	above->below = below;	965	above->below = below;
963	else	966	else
964	env->inv = below;	967	env->inv = below;
965		968
966	if (below != NULL)	969	if (below)
967	below->above = above;	970	below->above = above;
968		971
969	/* we set up values so that it could be inserted into	972	/* we set up values so that it could be inserted into
970	* the map, but we don't actually do that - it is up	973	* the map, but we don't actually do that - it is up
971	* to the caller to decide what we want to do.	974	* to the caller to decide what we want to do.
…		…
975	above = 0, below = 0;	978	above = 0, below = 0;
976	env = 0;	979	env = 0;
977	}	980	}
978	else if (map)	981	else if (map)
979	{	982	{
980	/* Re did the following section of code - it looks like it had	983	if (type == PLAYER)
981	* lots of logic for things we no longer care about
982	*/	984	{
		985	// leaving a spot always closes any open container on the ground
		986	if (container && !container->env)
		987	// this causes spurious floorbox updates, but it ensures
		988	// that the CLOSE event is being sent.
		989	close_container ();
		990
		991	--map->players;
		992	map->touch ();
		993	}
		994
		995	map->dirty = true;
		996	mapspace &ms = this->ms ();
983		997
984	/* link the object above us */	998	/* link the object above us */
985	if (above)	999	if (above)
986	above->below = below;	1000	above->below = below;
987	else	1001	else
988	map->at (x, y).top = below; /* we were top, set new top */	1002	ms.top = below; /* we were top, set new top */
989		1003
990	/* Relink the object below us, if there is one */	1004	/* Relink the object below us, if there is one */
991	if (below)	1005	if (below)
992	below->above = above;	1006	below->above = above;
993	else	1007	else
…		…
995	/* Nothing below, which means we need to relink map object for this space	1009	/* Nothing below, which means we need to relink map object for this space
996	* use translated coordinates in case some oddness with map tiling is	1010	* use translated coordinates in case some oddness with map tiling is
997	* evident	1011	* evident
998	*/	1012	*/
999	if (GET_MAP_OB (map, x, y) != this)	1013	if (GET_MAP_OB (map, x, y) != this)
1000	{
1001	char *dump = dump_object (this);
1002	LOG (llevError,
1003	"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);	1014	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 ());
1004	free (dump);
1005	dump = dump_object (GET_MAP_OB (map, x, y));
1006	LOG (llevError, "%s\n", dump);
1007	free (dump);
1008	}
1009		1015
1010	map->at (x, y).bot = above; /* goes on above it. */	1016	ms.bot = above; /* goes on above it. */
1011	}	1017	}
1012		1018
1013	above = 0;	1019	above = 0;
1014	below = 0;	1020	below = 0;
1015		1021
1016	if (map->in_memory == MAP_SAVING)	1022	if (map->in_memory == MAP_SAVING)
1017	return;	1023	return;
1018		1024
1019	int check_walk_off = !flag [FLAG_NO_APPLY];	1025	int check_walk_off = !flag [FLAG_NO_APPLY];
1020		1026
1021	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	1027	for (tmp = ms.bot; tmp; tmp = tmp->above)
1022	{	1028	{
1023	/* No point updating the players look faces if he is the object	1029	/* No point updating the players look faces if he is the object
1024	* being removed.	1030	* being removed.
1025	*/	1031	*/
1026		1032
…		…
1038		1044
1039	if (tmp->contr->ns)	1045	if (tmp->contr->ns)
1040	tmp->contr->ns->floorbox_update ();	1046	tmp->contr->ns->floorbox_update ();
1041	}	1047	}
1042		1048
1043	/* See if player moving off should effect something */	1049	/* See if object moving off should effect something */
1044	if (check_walk_off	1050	if (check_walk_off
1045	&& ((move_type & tmp->move_off)	1051	&& ((move_type & tmp->move_off)
1046	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1052	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1047	{	1053	{
1048	move_apply (tmp, this, 0);	1054	move_apply (tmp, this, 0);
…		…
1050	if (destroyed ())	1056	if (destroyed ())
1051	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1057	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1052	}	1058	}
1053		1059
1054	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1060	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1055		1061	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1056	if (tmp->above == tmp)	1062	if (tmp->above == tmp)
1057	tmp->above = 0;	1063	tmp->above = 0;
1058		1064
1059	last = tmp;	1065	last = tmp;
1060	}	1066	}
1061		1067
1062	/* last == NULL of there are no objects on this space */	1068	/* last == NULL if there are no objects on this space */
		1069	//TODO: this makes little sense, why only update the topmost object?
1063	if (!last)	1070	if (!last)
1064	map->at (x, y).flags_ = P_NEED_UPDATE;	1071	map->at (x, y).flags_ = 0;
1065	else	1072	else
1066	update_object (last, UP_OBJ_REMOVE);	1073	update_object (last, UP_OBJ_REMOVE);
1067		1074
1068	if (flag [FLAG_BLOCKSVIEW] || glow_radius)	1075	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1069	update_all_los (map, x, y);	1076	update_all_los (map, x, y);
…		…
1105	}	1112	}
1106		1113
1107	return 0;	1114	return 0;
1108	}	1115	}
1109		1116
		1117	void
		1118	object::expand_tail ()
		1119	{
		1120	if (more)
		1121	return;
		1122
		1123	object *prev = this;
		1124
		1125	for (archetype *at = arch->more; at; at = at->more)
		1126	{
		1127	object *op = arch_to_object (at);
		1128
		1129	op->name = name;
		1130	op->name_pl = name_pl;
		1131	op->title = title;
		1132
		1133	op->head = this;
		1134	prev->more = op;
		1135
		1136	prev = op;
		1137	}
		1138	}
		1139
1110	/*	1140	/*
1111	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1141	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1112	* job preparing multi-part monsters	1142	* job preparing multi-part monsters.
1113	*/	1143	*/
1114	object *	1144	object *
1115	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1145	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1116	{	1146	{
1117	object *tmp;
1118
1119	if (op->head)
1120	op = op->head;
1121
1122	for (tmp = op; tmp; tmp = tmp->more)	1147	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1123	{	1148	{
1124	tmp->x = x + tmp->arch->clone.x;	1149	tmp->x = x + tmp->arch->clone.x;
1125	tmp->y = y + tmp->arch->clone.y;	1150	tmp->y = y + tmp->arch->clone.y;
1126	}	1151	}
1127		1152
…		…
1149	* just 'op' otherwise	1174	* just 'op' otherwise
1150	*/	1175	*/
1151	object *	1176	object *
1152	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1177	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1153	{	1178	{
		1179	assert (!op->flag [FLAG_FREED]);
		1180
1154	object *tmp, *top, *floor = NULL;	1181	object *tmp, *top, *floor = NULL;
1155	sint16 x, y;
1156		1182
1157	if (QUERY_FLAG (op, FLAG_FREED))	1183	op->remove ();
1158	{
1159	LOG (llevError, "Trying to insert freed object!\n");
1160	return NULL;
1161	}
1162		1184
1163	if (m == NULL)	1185	#if 0
1164	{	1186	if (!m->active != !op->active)
1165	char *dump = dump_object (op);	1187	if (m->active)
1166	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1188	op->activate_recursive ();
1167	free (dump);	1189	else
1168	return op;	1190	op->deactivate_recursive ();
1169	}	1191	#endif
1170		1192
1171	if (out_of_map (m, op->x, op->y))	1193	if (out_of_map (m, op->x, op->y))
1172	{	1194	{
1173	char *dump = dump_object (op);
1174	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);	1195	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1175	#ifdef MANY_CORES	1196	#ifdef MANY_CORES
1176	/* Better to catch this here, as otherwise the next use of this object	1197	/* Better to catch this here, as otherwise the next use of this object
1177	* is likely to cause a crash. Better to find out where it is getting	1198	* is likely to cause a crash. Better to find out where it is getting
1178	* improperly inserted.	1199	* improperly inserted.
1179	*/	1200	*/
1180	abort ();	1201	abort ();
1181	#endif	1202	#endif
1182	free (dump);
1183	return op;	1203	return op;
1184	}	1204	}
1185		1205
1186	if (!QUERY_FLAG (op, FLAG_REMOVED))
1187	{
1188	char *dump = dump_object (op);
1189	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1190	free (dump);
1191	return op;
1192	}
1193
1194	if (op->more)
1195	{
1196	/* The part may be on a different map. */
1197
1198	object *more = op->more;	1206	if (object *more = op->more)
1199		1207	{
1200	/* We really need the caller to normalize coordinates - if
1201	* we set the map, that doesn't work if the location is within
1202	* a map and this is straddling an edge. So only if coordinate
1203	* is clear wrong do we normalize it.
1204	*/
1205	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1206	more->map = get_map_from_coord (m, &more->x, &more->y);
1207	else if (!more->map)
1208	{
1209	/* For backwards compatibility - when not dealing with tiled maps,
1210	* more->map should always point to the parent.
1211	*/
1212	more->map = m;
1213	}
1214
1215	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1208	if (!insert_ob_in_map (more, m, originator, flag))
1216	{	1209	{
1217	if (!op->head)	1210	if (!op->head)
1218	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1211	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1219		1212
1220	return 0;	1213	return 0;
…		…
1225		1218
1226	/* Ideally, the caller figures this out. However, it complicates a lot	1219	/* Ideally, the caller figures this out. However, it complicates a lot
1227	* of areas of callers (eg, anything that uses find_free_spot would now	1220	* of areas of callers (eg, anything that uses find_free_spot would now
1228	* need extra work	1221	* need extra work
1229	*/	1222	*/
1230	op->map = get_map_from_coord (m, &op->x, &op->y);	1223	if (!xy_normalise (m, op->x, op->y))
1231	x = op->x;	1224	return 0;
1232	y = op->y;	1225
		1226	op->map = m;
		1227	mapspace &ms = op->ms ();
1233		1228
1234	/* this has to be done after we translate the coordinates.	1229	/* this has to be done after we translate the coordinates.
1235	*/	1230	*/
1236	if (op->nrof && !(flag & INS_NO_MERGE))	1231	if (op->nrof && !(flag & INS_NO_MERGE))
1237	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1232	for (tmp = ms.bot; tmp; tmp = tmp->above)
1238	if (object::can_merge (op, tmp))	1233	if (object::can_merge (op, tmp))
1239	{	1234	{
1240	op->nrof += tmp->nrof;	1235	op->nrof += tmp->nrof;
1241	tmp->destroy ();	1236	tmp->destroy ();
1242	}	1237	}
…		…
1259	op->below = originator->below;	1254	op->below = originator->below;
1260		1255
1261	if (op->below)	1256	if (op->below)
1262	op->below->above = op;	1257	op->below->above = op;
1263	else	1258	else
1264	op->ms ().bot = op;	1259	ms.bot = op;
1265		1260
1266	/* since *below* originator, no need to update top */	1261	/* since *below* originator, no need to update top */
1267	originator->below = op;	1262	originator->below = op;
1268	}	1263	}
1269	else	1264	else
1270	{	1265	{
		1266	top = ms.bot;
		1267
1271	/* If there are other objects, then */	1268	/* If there are other objects, then */
1272	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1269	if ((!(flag & INS_MAP_LOAD)) && top)
1273	{	1270	{
1274	object *last = NULL;	1271	object *last = 0;
1275		1272
1276	/*	1273	/*
1277	* If there are multiple objects on this space, we do some trickier handling.	1274	* If there are multiple objects on this space, we do some trickier handling.
1278	* We've already dealt with merging if appropriate.	1275	* We've already dealt with merging if appropriate.
1279	* Generally, we want to put the new object on top. But if	1276	* Generally, we want to put the new object on top. But if
…		…
1283	* once we get to them. This reduces the need to traverse over all of	1280	* once we get to them. This reduces the need to traverse over all of
1284	* them when adding another one - this saves quite a bit of cpu time	1281	* them when adding another one - this saves quite a bit of cpu time
1285	* when lots of spells are cast in one area. Currently, it is presumed	1282	* when lots of spells are cast in one area. Currently, it is presumed
1286	* that flying non pickable objects are spell objects.	1283	* that flying non pickable objects are spell objects.
1287	*/	1284	*/
1288		1285	for (top = ms.bot; top; top = top->above)
1289	while (top != NULL)
1290	{	1286	{
1291	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1287	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1292	floor = top;	1288	floor = top;
1293		1289
1294	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1290	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1297	top = top->below;	1293	top = top->below;
1298	break;	1294	break;
1299	}	1295	}
1300		1296
1301	last = top;	1297	last = top;
1302	top = top->above;
1303	}	1298	}
1304		1299
1305	/* Don't want top to be NULL, so set it to the last valid object */	1300	/* Don't want top to be NULL, so set it to the last valid object */
1306	top = last;	1301	top = last;
1307		1302
…		…
1309	* looks like instead of lots of conditions here.	1304	* looks like instead of lots of conditions here.
1310	* makes things faster, and effectively the same result.	1305	* makes things faster, and effectively the same result.
1311	*/	1306	*/
1312		1307
1313	/* Have object 'fall below' other objects that block view.	1308	/* Have object 'fall below' other objects that block view.
1314	* Unless those objects are exits, type 66	1309	* Unless those objects are exits.
1315	* If INS_ON_TOP is used, don't do this processing	1310	* If INS_ON_TOP is used, don't do this processing
1316	* Need to find the object that in fact blocks view, otherwise	1311	* Need to find the object that in fact blocks view, otherwise
1317	* stacking is a bit odd.	1312	* stacking is a bit odd.
1318	*/	1313	*/
1319	if (!(flag & INS_ON_TOP) &&	1314	if (!(flag & INS_ON_TOP)
1320	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1315	&& ms.flags () & P_BLOCKSVIEW
		1316	&& (op->face && !faces [op->face].visibility))
1321	{	1317	{
1322	for (last = top; last != floor; last = last->below)	1318	for (last = top; last != floor; last = last->below)
1323	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1319	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1324	break;	1320	break;
		1321
1325	/* Check to see if we found the object that blocks view,	1322	/* Check to see if we found the object that blocks view,
1326	* and make sure we have a below pointer for it so that	1323	* and make sure we have a below pointer for it so that
1327	* we can get inserted below this one, which requires we	1324	* we can get inserted below this one, which requires we
1328	* set top to the object below us.	1325	* set top to the object below us.
1329	*/	1326	*/
…		…
1331	top = last->below;	1328	top = last->below;
1332	}	1329	}
1333	} /* If objects on this space */	1330	} /* If objects on this space */
1334		1331
1335	if (flag & INS_MAP_LOAD)	1332	if (flag & INS_MAP_LOAD)
1336	top = GET_MAP_TOP (op->map, op->x, op->y);	1333	top = ms.top;
1337		1334
1338	if (flag & INS_ABOVE_FLOOR_ONLY)	1335	if (flag & INS_ABOVE_FLOOR_ONLY)
1339	top = floor;	1336	top = floor;
1340		1337
1341	/* Top is the object that our object (op) is going to get inserted above.	1338	/* Top is the object that our object (op) is going to get inserted above.
1342	*/	1339	*/
1343		1340
1344	/* First object on this space */	1341	/* First object on this space */
1345	if (!top)	1342	if (!top)
1346	{	1343	{
1347	op->above = GET_MAP_OB (op->map, op->x, op->y);	1344	op->above = ms.bot;
1348		1345
1349	if (op->above)	1346	if (op->above)
1350	op->above->below = op;	1347	op->above->below = op;
1351		1348
1352	op->below = NULL;	1349	op->below = 0;
1353	op->ms ().bot = op;	1350	ms.bot = op;
1354	}	1351	}
1355	else	1352	else
1356	{ /* get inserted into the stack above top */	1353	{ /* get inserted into the stack above top */
1357	op->above = top->above;	1354	op->above = top->above;
1358		1355
…		…
1361		1358
1362	op->below = top;	1359	op->below = top;
1363	top->above = op;	1360	top->above = op;
1364	}	1361	}
1365		1362
1366	if (op->above == NULL)	1363	if (!op->above)
1367	op->ms ().top = op;	1364	ms.top = op;
1368	} /* else not INS_BELOW_ORIGINATOR */	1365	} /* else not INS_BELOW_ORIGINATOR */
1369		1366
1370	if (op->type == PLAYER)	1367	if (op->type == PLAYER)
		1368	{
1371	op->contr->do_los = 1;	1369	op->contr->do_los = 1;
		1370	++op->map->players;
		1371	op->map->touch ();
		1372	}
		1373
		1374	op->map->dirty = true;
1372		1375
1373	/* If we have a floor, we know the player, if any, will be above	1376	/* If we have a floor, we know the player, if any, will be above
1374	* it, so save a few ticks and start from there.	1377	* it, so save a few ticks and start from there.
1375	*/	1378	*/
1376	if (!(flag & INS_MAP_LOAD))	1379	if (!(flag & INS_MAP_LOAD))
1377	if (object *pl = op->ms ().player ())	1380	if (object *pl = ms.player ())
1378	if (pl->contr->ns)	1381	if (pl->contr->ns)
1379	pl->contr->ns->floorbox_update ();	1382	pl->contr->ns->floorbox_update ();
1380		1383
1381	/* If this object glows, it may affect lighting conditions that are	1384	/* If this object glows, it may affect lighting conditions that are
1382	* visible to others on this map. But update_all_los is really	1385	* visible to others on this map. But update_all_los is really
1383	* an inefficient way to do this, as it means los for all players	1386	* an inefficient way to do this, as it means los for all players
1384	* on the map will get recalculated. The players could very well	1387	* on the map will get recalculated. The players could very well
1385	* be far away from this change and not affected in any way -	1388	* be far away from this change and not affected in any way -
1386	* this should get redone to only look for players within range,	1389	* this should get redone to only look for players within range,
1387	* or just updating the P_NEED_UPDATE for spaces within this area	1390	* or just updating the P_UPTODATE for spaces within this area
1388	* of effect may be sufficient.	1391	* of effect may be sufficient.
1389	*/	1392	*/
1390	if (op->map->darkness && (op->glow_radius != 0))	1393	if (op->map->darkness && (op->glow_radius != 0))
1391	update_all_los (op->map, op->x, op->y);	1394	update_all_los (op->map, op->x, op->y);
1392		1395
…		…
1430	{	1433	{
1431	object *tmp, *tmp1;	1434	object *tmp, *tmp1;
1432		1435
1433	/* first search for itself and remove any old instances */	1436	/* first search for itself and remove any old instances */
1434		1437
1435	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1438	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1436	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1439	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1437	tmp->destroy ();	1440	tmp->destroy ();
1438		1441
1439	tmp1 = arch_to_object (archetype::find (arch_string));	1442	tmp1 = arch_to_object (archetype::find (arch_string));
1440		1443
1441	tmp1->x = op->x;	1444	tmp1->x = op->x;
1442	tmp1->y = op->y;	1445	tmp1->y = op->y;
1443	insert_ob_in_map (tmp1, op->map, op, 0);	1446	insert_ob_in_map (tmp1, op->map, op, 0);
		1447	}
		1448
		1449	object *
		1450	object::insert_at (object *where, object *originator, int flags)
		1451	{
		1452	return where->map->insert (this, where->x, where->y, originator, flags);
1444	}	1453	}
1445		1454
1446	/*	1455	/*
1447	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1456	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1448	* is returned contains nr objects, and the remaining parts contains	1457	* is returned contains nr objects, and the remaining parts contains
1449	* the rest (or is removed and freed if that number is 0).	1458	* the rest (or is removed and freed if that number is 0).
1450	* On failure, NULL is returned, and the reason put into the	1459	* On failure, NULL is returned, and the reason put into the
1451	* global static errmsg array.	1460	* global static errmsg array.
1452	*/	1461	*/
1453
1454	object *	1462	object *
1455	get_split_ob (object *orig_ob, uint32 nr)	1463	get_split_ob (object *orig_ob, uint32 nr)
1456	{	1464	{
1457	object *newob;	1465	object *newob;
1458	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1466	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1489	* the amount of an object. If the amount reaches 0, the object	1497	* the amount of an object. If the amount reaches 0, the object
1490	* is subsequently removed and freed.	1498	* is subsequently removed and freed.
1491	*	1499	*
1492	* Return value: 'op' if something is left, NULL if the amount reached 0	1500	* Return value: 'op' if something is left, NULL if the amount reached 0
1493	*/	1501	*/
1494
1495	object *	1502	object *
1496	decrease_ob_nr (object *op, uint32 i)	1503	decrease_ob_nr (object *op, uint32 i)
1497	{	1504	{
1498	object *tmp;	1505	object *tmp;
1499		1506
…		…
1574		1581
1575	/*	1582	/*
1576	* add_weight(object, weight) adds the specified weight to an object,	1583	* add_weight(object, weight) adds the specified weight to an object,
1577	* and also updates how much the environment(s) is/are carrying.	1584	* and also updates how much the environment(s) is/are carrying.
1578	*/	1585	*/
1579
1580	void	1586	void
1581	add_weight (object *op, signed long weight)	1587	add_weight (object *op, signed long weight)
1582	{	1588	{
1583	while (op != NULL)	1589	while (op != NULL)
1584	{	1590	{
…		…
1616	* inside the object environment.	1622	* inside the object environment.
1617	*	1623	*
1618	* The function returns now pointer to inserted item, and return value can	1624	* The function returns now pointer to inserted item, and return value can
1619	* be != op, if items are merged. -Tero	1625	* be != op, if items are merged. -Tero
1620	*/	1626	*/
1621
1622	object *	1627	object *
1623	object::insert (object *op)	1628	object::insert (object *op)
1624	{	1629	{
1625	object *tmp, *otmp;	1630	object *tmp, *otmp;
1626		1631
…		…
1722	*	1727	*
1723	* MSW 2001-07-08: Check all objects on space, not just those below	1728	* MSW 2001-07-08: Check all objects on space, not just those below
1724	* object being inserted. insert_ob_in_map may not put new objects	1729	* object being inserted. insert_ob_in_map may not put new objects
1725	* on top.	1730	* on top.
1726	*/	1731	*/
1727
1728	int	1732	int
1729	check_move_on (object *op, object *originator)	1733	check_move_on (object *op, object *originator)
1730	{	1734	{
1731	object *tmp;	1735	object *tmp;
1732	maptile *m = op->map;	1736	maptile *m = op->map;
…		…
1759		1763
1760	/* The objects have to be checked from top to bottom.	1764	/* The objects have to be checked from top to bottom.
1761	* Hence, we first go to the top:	1765	* Hence, we first go to the top:
1762	*/	1766	*/
1763		1767
1764	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above)	1768	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1765	{	1769	{
1766	/* Trim the search when we find the first other spell effect	1770	/* Trim the search when we find the first other spell effect
1767	* this helps performance so that if a space has 50 spell objects,	1771	* this helps performance so that if a space has 50 spell objects,
1768	* we don't need to check all of them.	1772	* we don't need to check all of them.
1769	*/	1773	*/
…		…
1787	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1791	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1788	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1792	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1789	{	1793	{
1790		1794
1791	float	1795	float
1792	diff = tmp->move_slow_penalty * FABS (op->speed);	1796	diff = tmp->move_slow_penalty * fabs (op->speed);
1793		1797
1794	if (op->type == PLAYER)	1798	if (op->type == PLAYER)
1795	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1799	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1796	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1800	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1797	diff /= 4.0;	1801	diff /= 4.0;
…		…
1827	* The first matching object is returned, or NULL if none.	1831	* The first matching object is returned, or NULL if none.
1828	*/	1832	*/
1829	object *	1833	object *
1830	present_arch (const archetype *at, maptile *m, int x, int y)	1834	present_arch (const archetype *at, maptile *m, int x, int y)
1831	{	1835	{
1832	if (m == NULL || out_of_map (m, x, y))	1836	if (!m || out_of_map (m, x, y))
1833	{	1837	{
1834	LOG (llevError, "Present_arch called outside map.\n");	1838	LOG (llevError, "Present_arch called outside map.\n");
1835	return NULL;	1839	return NULL;
1836	}	1840	}
1837		1841
1838	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1842	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1839	if (tmp->arch == at)	1843	if (tmp->arch == at)
1840	return tmp;	1844	return tmp;
1841		1845
1842	return NULL;	1846	return NULL;
1843	}	1847	}
…		…
1854	{	1858	{
1855	LOG (llevError, "Present called outside map.\n");	1859	LOG (llevError, "Present called outside map.\n");
1856	return NULL;	1860	return NULL;
1857	}	1861	}
1858		1862
1859	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1863	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1860	if (tmp->type == type)	1864	if (tmp->type == type)
1861	return tmp;	1865	return tmp;
1862		1866
1863	return NULL;	1867	return NULL;
1864	}	1868	}
…		…
2004	}	2008	}
2005		2009
2006	if (!index)	2010	if (!index)
2007	return -1;	2011	return -1;
2008		2012
2009	return altern[RANDOM () % index];	2013	return altern [rndm (index)];
2010	}	2014	}
2011		2015
2012	/*	2016	/*
2013	* find_first_free_spot(archetype, maptile, x, y) works like	2017	* find_first_free_spot(archetype, maptile, x, y) works like
2014	* find_free_spot(), but it will search max number of squares.	2018	* find_free_spot(), but it will search max number of squares.
…		…
2035	{	2039	{
2036	arr += begin;	2040	arr += begin;
2037	end -= begin;	2041	end -= begin;
2038		2042
2039	while (--end)	2043	while (--end)
2040	swap (arr [end], arr [RANDOM () % (end + 1)]);	2044	swap (arr [end], arr [rndm (end + 1)]);
2041	}	2045	}
2042		2046
2043	/* new function to make monster searching more efficient, and effective!	2047	/* new function to make monster searching more efficient, and effective!
2044	* This basically returns a randomized array (in the passed pointer) of	2048	* This basically returns a randomized array (in the passed pointer) of
2045	* the spaces to find monsters. In this way, it won't always look for	2049	* the spaces to find monsters. In this way, it won't always look for
…		…
2179		2183
2180	return 3;	2184	return 3;
2181	}	2185	}
2182		2186
2183	/*	2187	/*
2184	* absdir(int): Returns a number between 1 and 8, which represent
2185	* the "absolute" direction of a number (it actually takes care of
2186	* "overflow" in previous calculations of a direction).
2187	*/
2188
2189	int
2190	absdir (int d)
2191	{
2192	while (d < 1)
2193	d += 8;
2194
2195	while (d > 8)
2196	d -= 8;
2197
2198	return d;
2199	}
2200
2201	/*
2202	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2188	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2203	* between two directions (which are expected to be absolute (see absdir())	2189	* between two directions (which are expected to be absolute (see absdir())
2204	*/	2190	*/
2205
2206	int	2191	int
2207	dirdiff (int dir1, int dir2)	2192	dirdiff (int dir1, int dir2)
2208	{	2193	{
2209	int d;	2194	int d;
2210		2195
…		…
2376	insert_ob_in_ob (object_create_clone (item), dst);	2361	insert_ob_in_ob (object_create_clone (item), dst);
2377		2362
2378	return dst;	2363	return dst;
2379	}	2364	}
2380		2365
2381	/* GROS - Creates an object using a string representing its content. */
2382	/* Basically, we save the content of the string to a temp file, then call */
2383	/* load_object on it. I admit it is a highly inefficient way to make things, */
2384	/* but it was simple to make and allows reusing the load_object function. */
2385	/* Remember not to use load_object_str in a time-critical situation. */
2386	/* Also remember that multiparts objects are not supported for now. */
2387	object *
2388	load_object_str (const char *obstr)
2389	{
2390	object *op;
2391	char filename[MAX_BUF];
2392
2393	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2394
2395	FILE *tempfile = fopen (filename, "w");
2396
2397	if (tempfile == NULL)
2398	{
2399	LOG (llevError, "Error - Unable to access load object temp file\n");
2400	return NULL;
2401	}
2402
2403	fprintf (tempfile, obstr);
2404	fclose (tempfile);
2405
2406	op = object::create ();
2407
2408	object_thawer thawer (filename);
2409
2410	if (thawer)
2411	load_object (thawer, op, 0);
2412
2413	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2414	CLEAR_FLAG (op, FLAG_REMOVED);
2415
2416	return op;
2417	}
2418
2419	/* This returns the first object in who's inventory that	2366	/* This returns the first object in who's inventory that
2420	* has the same type and subtype match.	2367	* has the same type and subtype match.
2421	* returns NULL if no match.	2368	* returns NULL if no match.
2422	*/	2369	*/
2423	object *	2370	object *
…		…
2476	if (link->key == canonical_key)	2423	if (link->key == canonical_key)
2477	return link->value;	2424	return link->value;
2478		2425
2479	return 0;	2426	return 0;
2480	}	2427	}
2481
2482		2428
2483	/*	2429	/*
2484	* Updates the canonical_key in op to value.	2430	* Updates the canonical_key in op to value.
2485	*	2431	*
2486	* canonical_key is a shared string (value doesn't have to be).	2432	* canonical_key is a shared string (value doesn't have to be).
…		…
2589	}	2535	}
2590	else	2536	else
2591	item = item->env;	2537	item = item->env;
2592	}	2538	}
2593		2539
		2540
		2541	const char *
		2542	object::flag_desc (char *desc, int len) const
		2543	{
		2544	char *p = desc;
		2545	bool first = true;
		2546
		2547	*p = 0;
		2548
		2549	for (int i = 0; i < NUM_FLAGS; i++)
		2550	{
		2551	if (len <= 10) // magic constant!
		2552	{
		2553	snprintf (p, len, ",...");
		2554	break;
		2555	}
		2556
		2557	if (flag [i])
		2558	{
		2559	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2560	len -= cnt;
		2561	p += cnt;
		2562	first = false;
		2563	}
		2564	}
		2565
		2566	return desc;
		2567	}
		2568
2594	// return a suitable string describing an objetc in enough detail to find it	2569	// return a suitable string describing an object in enough detail to find it
2595	const char *	2570	const char *
2596	object::debug_desc (char *info) const	2571	object::debug_desc (char *info) const
2597	{	2572	{
		2573	char flagdesc[512];
2598	char info2[256 * 3];	2574	char info2[256 * 4];
2599	char *p = info;	2575	char *p = info;
2600		2576
2601	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2577	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2602	count,	2578	count, uuid.seq,
2603	&name,	2579	&name,
2604	title ? " " : "",	2580	title ? "\",title:\"" : "",
2605	title ? (const char *)title : "");	2581	title ? (const char *)title : "",
		2582	flag_desc (flagdesc, 512), type);
2606		2583
2607	if (env)	2584	if (env)
2608	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2585	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2609		2586
2610	if (map)	2587	if (map)
2611	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2588	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2612		2589
2613	return info;	2590	return info;
2614	}	2591	}
2615		2592
2616	const char *	2593	const char *
2617	object::debug_desc () const	2594	object::debug_desc () const
2618	{	2595	{
2619	static char info[256 * 3];	2596	static char info[256 * 4];
2620	return debug_desc (info);	2597	return debug_desc (info);
2621	}	2598	}
2622		2599
		2600	const char *
		2601	object::debug_desc2 () const
		2602	{
		2603	static char info[256 * 4];
		2604	return debug_desc (info);
		2605	}
		2606
		2607	struct region *
		2608	object::region () const
		2609	{
		2610	return map ? map->region (x, y)
		2611	: region::default_region ();
		2612	}
		2613
		2614	const materialtype_t *
		2615	object::dominant_material () const
		2616	{
		2617	if (materialtype_t *mat = name_to_material (materialname))
		2618	return mat;
		2619
		2620	// omfg this is slow, this has to be temporary :)
		2621	shstr unknown ("unknown");
		2622
		2623	return name_to_material (unknown);
		2624	}
		2625
		2626	void
		2627	object::open_container (object *new_container)
		2628	{
		2629	if (container == new_container)
		2630	return;
		2631
		2632	if (object *old_container = container)
		2633	{
		2634	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2635	return;
		2636
		2637	#if 0
		2638	// remove the "Close old_container" object.
		2639	if (object *closer = old_container->inv)
		2640	if (closer->type == CLOSE_CON)
		2641	closer->destroy ();
		2642	#endif
		2643
		2644	old_container->flag [FLAG_APPLIED] = 0;
		2645	container = 0;
		2646
		2647	esrv_update_item (UPD_FLAGS, this, old_container);
		2648	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2649	}
		2650
		2651	if (new_container)
		2652	{
		2653	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2654	return;
		2655
		2656	// TODO: this does not seem to serve any purpose anymore?
		2657	#if 0
		2658	// insert the "Close Container" object.
		2659	if (archetype *closer = new_container->other_arch)
		2660	{
		2661	object *closer = arch_to_object (new_container->other_arch);
		2662	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2663	new_container->insert (closer);
		2664	}
		2665	#endif
		2666
		2667	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2668
		2669	new_container->flag [FLAG_APPLIED] = 1;
		2670	container = new_container;
		2671
		2672	esrv_update_item (UPD_FLAGS, this, new_container);
		2673	esrv_send_inventory (this, new_container);
		2674	}
		2675	}
		2676
		2677

Diff Legend

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