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.87 by root, Tue Dec 26 08:54:59 2006 UTC vs.
Revision 1.147 by root, Sat May 12 16:06:42 2007 UTC

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

Diff Legend

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