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.92 by root, Tue Dec 26 17:39:29 2006 UTC vs.
Revision 1.154 by root, Thu May 17 21:11: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	int
		456	object::slottype () const
		457	{
		458	if (type == SKILL)
		459	{
		460	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		461	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		462	}
		463	else
		464	{
		465	if (slot [body_combat].info) return slot_combat;
		466	if (slot [body_range ].info) return slot_ranged;
		467	}
		468
		469	return slot_none;
		470	}
		471
		472	bool
		473	object::change_weapon (object *ob)
		474	{
		475	if (current_weapon == ob)
		476	return true;
		477
		478	if (chosen_skill)
		479	chosen_skill->flag [FLAG_APPLIED] = false;
		480
		481	current_weapon = ob;
		482	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		483
		484	if (chosen_skill)
		485	chosen_skill->flag [FLAG_APPLIED] = true;
		486
		487	update_stats ();
		488
		489	if (ob)
		490	{
		491	// now check wether any body locations became invalid, in which case
		492	// we cannot apply the weapon at the moment.
		493	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		494	if (slot[i].used < 0)
		495	{
		496	current_weapon = chosen_skill = 0;
		497	update_stats ();
		498
		499	new_draw_info_format (NDI_UNIQUE, 0, this,
		500	"You try to balance your applied items all at once, but the %s is too much. "
		501	"You need to unapply some items first.", &ob->name);
		502	return false;
		503	}
		504
		505	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		506	}
		507	else
		508	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		509
		510	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		511	{
		512	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		513	&name, ob->debug_desc ());
		514	return false;
		515	}
		516
		517	return true;
		518	}
		519
455	/* Zero the key_values on op, decrementing the shared-string	520	/* Zero the key_values on op, decrementing the shared-string
456	* refcounts and freeing the links.	521	* refcounts and freeing the links.
457	*/	522	*/
458	static void	523	static void
459	free_key_values (object *op)	524	free_key_values (object *op)
460	{	525	{
461	for (key_value *i = op->key_values; i != 0;)	526	for (key_value *i = op->key_values; i; )
462	{	527	{
463	key_value *next = i->next;	528	key_value *next = i->next;
464	delete i;	529	delete i;
465		530
466	i = next;	531	i = next;
467	}	532	}
468		533
469	op->key_values = 0;	534	op->key_values = 0;
470	}	535	}
471		536
472	/*	537	object &
473	* copy_to first frees everything allocated by the dst object,	538	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	{	539	{
483	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	540	bool is_freed = flag [FLAG_FREED];
484	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	541	bool is_removed = flag [FLAG_REMOVED];
485		542
486	*(object_copy *)dst = *this;	543	*(object_copy *)this = src;
487		544
488	if (is_freed)	545	flag [FLAG_FREED] = is_freed;
489	SET_FLAG (dst, FLAG_FREED);	546	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		547
497	/* Copy over key_values, if any. */	548	/* Copy over key_values, if any. */
498	if (key_values)	549	if (src.key_values)
499	{	550	{
500	key_value *tail = 0;	551	key_value *tail = 0;
501	key_value *i;
502
503	dst->key_values = 0;	552	key_values = 0;
504		553
505	for (i = key_values; i; i = i->next)	554	for (key_value *i = src.key_values; i; i = i->next)
506	{	555	{
507	key_value *new_link = new key_value;	556	key_value *new_link = new key_value;
508		557
509	new_link->next = 0;	558	new_link->next = 0;
510	new_link->key = i->key;	559	new_link->key = i->key;
511	new_link->value = i->value;	560	new_link->value = i->value;
512		561
513	/* Try and be clever here, too. */	562	/* Try and be clever here, too. */
514	if (!dst->key_values)	563	if (!key_values)
515	{	564	{
516	dst->key_values = new_link;	565	key_values = new_link;
517	tail = new_link;	566	tail = new_link;
518	}	567	}
519	else	568	else
520	{	569	{
521	tail->next = new_link;	570	tail->next = new_link;
522	tail = new_link;	571	tail = new_link;
523	}	572	}
524	}	573	}
525	}	574	}
		575	}
		576
		577	/*
		578	* copy_to first frees everything allocated by the dst object,
		579	* and then copies the contents of itself into the second
		580	* object, allocating what needs to be allocated. Basically, any
		581	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		582	* if the first object is freed, the pointers in the new object
		583	* will point at garbage.
		584	*/
		585	void
		586	object::copy_to (object *dst)
		587	{
		588	*dst = *this;
		589
		590	if (speed < 0)
		591	dst->speed_left = speed_left - rndm ();
526		592
527	dst->set_speed (dst->speed);	593	dst->set_speed (dst->speed);
		594	}
		595
		596	void
		597	object::instantiate ()
		598	{
		599	if (!uuid.seq) // HACK
		600	uuid = gen_uuid ();
		601
		602	speed_left = -0.1f;
		603	/* copy the body_info to the body_used - this is only really
		604	* need for monsters, but doesn't hurt to do it for everything.
		605	* by doing so, when a monster is created, it has good starting
		606	* values for the body_used info, so when items are created
		607	* for it, they can be properly equipped.
		608	*/
		609	for (int i = NUM_BODY_LOCATIONS; i--; )
		610	slot[i].used = slot[i].info;
		611
		612	attachable::instantiate ();
528	}	613	}
529		614
530	object *	615	object *
531	object::clone ()	616	object::clone ()
532	{	617	{
…		…
538	/*	623	/*
539	* If an object with the IS_TURNABLE() flag needs to be turned due	624	* 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	625	* 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.	626	* be called to update the face variable, _and_ how it looks on the map.
542	*/	627	*/
543
544	void	628	void
545	update_turn_face (object *op)	629	update_turn_face (object *op)
546	{	630	{
547	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	631	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
548	return;	632	return;
		633
549	SET_ANIMATION (op, op->direction);	634	SET_ANIMATION (op, op->direction);
550	update_object (op, UP_OBJ_FACE);	635	update_object (op, UP_OBJ_FACE);
551	}	636	}
552		637
553	/*	638	/*
…		…
556	* This function needs to be called whenever the speed of an object changes.	641	* This function needs to be called whenever the speed of an object changes.
557	*/	642	*/
558	void	643	void
559	object::set_speed (float speed)	644	object::set_speed (float speed)
560	{	645	{
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)	646	if (flag [FLAG_FREED] && speed)
567	{	647	{
568	LOG (llevError, "Object %s is freed but has speed.\n", &name);	648	LOG (llevError, "Object %s is freed but has speed.\n", &name);
569	speed = 0;	649	speed = 0;
570	}	650	}
571		651
572	this->speed = speed;	652	this->speed = speed;
573		653
574	if (arch_init)	654	if (has_active_speed ())
575	return;	655	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	656	else
593	{	657	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	}	658	}
648		659
649	/*	660	/*
650	* update_object() updates the the map.	661	* update_object() updates the the map.
651	* It takes into account invisible objects (and represent squares covered	662	* It takes into account invisible objects (and represent squares covered
…		…
664	* UP_OBJ_FACE: only the objects face has changed.	675	* UP_OBJ_FACE: only the objects face has changed.
665	*/	676	*/
666	void	677	void
667	update_object (object *op, int action)	678	update_object (object *op, int action)
668	{	679	{
669	MoveType move_on, move_off, move_block, move_slow;
670
671	if (op == NULL)	680	if (op == NULL)
672	{	681	{
673	/* this should never happen */	682	/* this should never happen */
674	LOG (llevDebug, "update_object() called for NULL object.\n");	683	LOG (llevDebug, "update_object() called for NULL object.\n");
675	return;	684	return;
…		…
699	return;	708	return;
700	}	709	}
701		710
702	mapspace &m = op->ms ();	711	mapspace &m = op->ms ();
703		712
704	if (m.flags_ & P_NEED_UPDATE)	713	if (!(m.flags_ & P_UPTODATE))
705	/* nop */;	714	/* nop */;
706	else if (action == UP_OBJ_INSERT)	715	else if (action == UP_OBJ_INSERT)
707	{	716	{
708	// this is likely overkill, TODO: revisit (schmorp)	717	// this is likely overkill, TODO: revisit (schmorp)
709	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	718	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	727	/* This isn't perfect, but I don't expect a lot of objects to
719	* to have move_allow right now.	728	* to have move_allow right now.
720	*/	729	*/
721	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	730	|| ((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)	731	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
723	m.flags_ = P_NEED_UPDATE;	732	m.flags_ = 0;
724	}	733	}
725	/* if the object is being removed, we can't make intelligent	734	/* if the object is being removed, we can't make intelligent
726	* decisions, because remove_ob can't really pass the object	735	* decisions, because remove_ob can't really pass the object
727	* that is being removed.	736	* that is being removed.
728	*/	737	*/
729	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	738	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
730	m.flags_ = P_NEED_UPDATE;	739	m.flags_ = 0;
731	else if (action == UP_OBJ_FACE)	740	else if (action == UP_OBJ_FACE)
732	/* Nothing to do for that case */ ;	741	/* Nothing to do for that case */ ;
733	else	742	else
734	LOG (llevError, "update_object called with invalid action: %d\n", action);	743	LOG (llevError, "update_object called with invalid action: %d\n", action);
735		744
736	if (op->more)	745	if (op->more)
737	update_object (op->more, action);	746	update_object (op->more, action);
738	}	747	}
739		748
740	object::vector object::objects; // not yet used
741	object *object::first;
742
743	object::object ()	749	object::object ()
744	{	750	{
745	SET_FLAG (this, FLAG_REMOVED);	751	SET_FLAG (this, FLAG_REMOVED);
746		752
747	expmul = 1.0;	753	expmul = 1.0;
748	face = blank_face;	754	face = blank_face;
749	}	755	}
750		756
751	object::~object ()	757	object::~object ()
752	{	758	{
		759	unlink ();
		760
753	free_key_values (this);	761	free_key_values (this);
754	}	762	}
755		763
		764	static int object_count;
		765
756	void object::link ()	766	void object::link ()
757	{	767	{
758	count = ++ob_count;	768	assert (!index);//D
759	uuid = gen_uuid ();	769	uuid = gen_uuid ();
		770	count = ++object_count;
760		771
761	prev = 0;	772	refcnt_inc ();
762	next = object::first;	773	objects.insert (this);
763
764	if (object::first)
765	object::first->prev = this;
766
767	object::first = this;
768	}	774	}
769		775
770	void object::unlink ()	776	void object::unlink ()
771	{	777	{
772	if (this == object::first)	778	if (!index)
773	object::first = next;	779	return;
774		780
775	/* Remove this object from the list of used objects */	781	objects.erase (this);
776	if (prev) prev->next = next;	782	refcnt_dec ();
777	if (next) next->prev = prev;	783	}
778		784
779	prev = 0;	785	void
780	next = 0;	786	object::activate ()
		787	{
		788	/* If already on active list, don't do anything */
		789	if (active)
		790	return;
		791
		792	if (has_active_speed ())
		793	actives.insert (this);
		794	}
		795
		796	void
		797	object::activate_recursive ()
		798	{
		799	activate ();
		800
		801	for (object *op = inv; op; op = op->below)
		802	op->activate_recursive ();
		803	}
		804
		805	/* This function removes object 'op' from the list of active
		806	* objects.
		807	* This should only be used for style maps or other such
		808	* reference maps where you don't want an object that isn't
		809	* in play chewing up cpu time getting processed.
		810	* The reverse of this is to call update_ob_speed, which
		811	* will do the right thing based on the speed of the object.
		812	*/
		813	void
		814	object::deactivate ()
		815	{
		816	/* If not on the active list, nothing needs to be done */
		817	if (!active)
		818	return;
		819
		820	actives.erase (this);
		821	}
		822
		823	void
		824	object::deactivate_recursive ()
		825	{
		826	for (object *op = inv; op; op = op->below)
		827	op->deactivate_recursive ();
		828
		829	deactivate ();
		830	}
		831
		832	void
		833	object::set_flag_inv (int flag, int value)
		834	{
		835	for (object *op = inv; op; op = op->below)
		836	{
		837	op->flag [flag] = value;
		838	op->set_flag_inv (flag, value);
		839	}
781	}	840	}
782		841
783	/*	842	/*
784	* Remove and free all objects in the inventory of the given object.	843	* Remove and free all objects in the inventory of the given object.
785	* object.c ?	844	* object.c ?
786	*/	845	*/
787	void	846	void
788	object::destroy_inv (bool drop_to_ground)	847	object::destroy_inv (bool drop_to_ground)
789	{	848	{
		849	// need to check first, because the checks below might segfault
		850	// as we might be on an invalid mapspace and crossfire code
		851	// is too buggy to ensure that the inventory is empty.
		852	// corollary: if you create arrows etc. with stuff in tis inventory,
		853	// cf will crash below with off-map x and y
		854	if (!inv)
		855	return;
		856
790	/* Only if the space blocks everything do we not process -	857	/* Only if the space blocks everything do we not process -
791	* if some form of movement is allowed, let objects	858	* if some form of movement is allowed, let objects
792	* drop on that space.	859	* drop on that space.
793	*/	860	*/
794	if (!drop_to_ground	861	if (!drop_to_ground
795	|| !map	862	|| !map
796	|| map->in_memory != MAP_IN_MEMORY	863	|| map->in_memory != MAP_IN_MEMORY
		864	|| map->nodrop
797	|| map->at (x, y).move_block == MOVE_ALL)	865	|| ms ().move_block == MOVE_ALL)
798	{	866	{
799	while (inv)	867	while (inv)
800	{	868	{
801	inv->destroy_inv (drop_to_ground);	869	inv->destroy_inv (drop_to_ground);
802	inv->destroy ();	870	inv->destroy ();
…		…
810		878
811	if (op->flag [FLAG_STARTEQUIP]	879	if (op->flag [FLAG_STARTEQUIP]
812	|| op->flag [FLAG_NO_DROP]	880	|| op->flag [FLAG_NO_DROP]
813	|| op->type == RUNE	881	|| op->type == RUNE
814	|| op->type == TRAP	882	|| op->type == TRAP
815	|| op->flag [FLAG_IS_A_TEMPLATE])	883	|| op->flag [FLAG_IS_A_TEMPLATE]
		884	|| op->flag [FLAG_DESTROY_ON_DEATH])
816	op->destroy ();	885	op->destroy ();
817	else	886	else
818	{	887	map->insert (op, x, y);
819	op->remove ();
820	op->x = x;
821	op->y = y;
822	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
823	}
824	}	888	}
825	}	889	}
826	}	890	}
827		891
828	object *object::create ()	892	object *object::create ()
…		…
833	}	897	}
834		898
835	void	899	void
836	object::do_destroy ()	900	object::do_destroy ()
837	{	901	{
		902	attachable::do_destroy ();
		903
838	if (flag [FLAG_IS_LINKED])	904	if (flag [FLAG_IS_LINKED])
839	remove_button_link (this);	905	remove_button_link (this);
840		906
841	if (flag [FLAG_FRIENDLY])	907	if (flag [FLAG_FRIENDLY])
842	remove_friendly_object (this);	908	remove_friendly_object (this);
843		909
844	if (!flag [FLAG_REMOVED])	910	if (!flag [FLAG_REMOVED])
845	remove ();	911	remove ();
846		912
847	if (flag [FLAG_FREED])	913	destroy_inv (true);
848	return;
849		914
850	set_speed (0);	915	deactivate ();
		916	unlink ();
851		917
852	flag [FLAG_FREED] = 1;	918	flag [FLAG_FREED] = 1;
853
854	attachable::do_destroy ();
855
856	destroy_inv (true);
857	unlink ();
858		919
859	// hack to ensure that freed objects still have a valid map	920	// hack to ensure that freed objects still have a valid map
860	{	921	{
861	static maptile *freed_map; // freed objects are moved here to avoid crashes	922	static maptile *freed_map; // freed objects are moved here to avoid crashes
862		923
…		…
866		927
867	freed_map->name = "/internal/freed_objects_map";	928	freed_map->name = "/internal/freed_objects_map";
868	freed_map->width = 3;	929	freed_map->width = 3;
869	freed_map->height = 3;	930	freed_map->height = 3;
870		931
871	freed_map->allocate ();	932	freed_map->alloc ();
		933	freed_map->in_memory = MAP_IN_MEMORY;
872	}	934	}
873		935
874	map = freed_map;	936	map = freed_map;
875	x = 1;	937	x = 1;
876	y = 1;	938	y = 1;
…		…
886		948
887	// clear those pointers that likely might have circular references to us	949	// clear those pointers that likely might have circular references to us
888	owner = 0;	950	owner = 0;
889	enemy = 0;	951	enemy = 0;
890	attacked_by = 0;	952	attacked_by = 0;
891
892	// only relevant for players(?), but make sure of it anyways
893	contr = 0;
894	}	953	}
895		954
896	void	955	void
897	object::destroy (bool destroy_inventory)	956	object::destroy (bool destroy_inventory)
898	{	957	{
…		…
926	* This function removes the object op from the linked list of objects	985	* This function removes the object op from the linked list of objects
927	* which it is currently tied to. When this function is done, the	986	* which it is currently tied to. When this function is done, the
928	* object will have no environment. If the object previously had an	987	* object will have no environment. If the object previously had an
929	* environment, the x and y coordinates will be updated to	988	* environment, the x and y coordinates will be updated to
930	* the previous environment.	989	* the previous environment.
931	* Beware: This function is called from the editor as well!
932	*/	990	*/
933	void	991	void
934	object::remove ()	992	object::do_remove ()
935	{	993	{
936	object *tmp, *last = 0;	994	object *tmp, *last = 0;
937	object *otmp;	995	object *otmp;
938		996
939	if (QUERY_FLAG (this, FLAG_REMOVED))	997	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
961	* to save cpu time.	1019	* to save cpu time.
962	*/	1020	*/
963	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1021	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
964	otmp->update_stats ();	1022	otmp->update_stats ();
965		1023
966	if (above != NULL)	1024	if (above)
967	above->below = below;	1025	above->below = below;
968	else	1026	else
969	env->inv = below;	1027	env->inv = below;
970		1028
971	if (below != NULL)	1029	if (below)
972	below->above = above;	1030	below->above = above;
973		1031
974	/* we set up values so that it could be inserted into	1032	/* we set up values so that it could be inserted into
975	* the map, but we don't actually do that - it is up	1033	* the map, but we don't actually do that - it is up
976	* to the caller to decide what we want to do.	1034	* to the caller to decide what we want to do.
…		…
980	above = 0, below = 0;	1038	above = 0, below = 0;
981	env = 0;	1039	env = 0;
982	}	1040	}
983	else if (map)	1041	else if (map)
984	{	1042	{
985	/* Re did the following section of code - it looks like it had	1043	if (type == PLAYER)
986	* lots of logic for things we no longer care about
987	*/	1044	{
		1045	// leaving a spot always closes any open container on the ground
		1046	if (container && !container->env)
		1047	// this causes spurious floorbox updates, but it ensures
		1048	// that the CLOSE event is being sent.
		1049	close_container ();
		1050
		1051	--map->players;
		1052	map->touch ();
		1053	}
		1054
		1055	map->dirty = true;
		1056	mapspace &ms = this->ms ();
988		1057
989	/* link the object above us */	1058	/* link the object above us */
990	if (above)	1059	if (above)
991	above->below = below;	1060	above->below = below;
992	else	1061	else
993	map->at (x, y).top = below; /* we were top, set new top */	1062	ms.top = below; /* we were top, set new top */
994		1063
995	/* Relink the object below us, if there is one */	1064	/* Relink the object below us, if there is one */
996	if (below)	1065	if (below)
997	below->above = above;	1066	below->above = above;
998	else	1067	else
…		…
1000	/* Nothing below, which means we need to relink map object for this space	1069	/* Nothing below, which means we need to relink map object for this space
1001	* use translated coordinates in case some oddness with map tiling is	1070	* use translated coordinates in case some oddness with map tiling is
1002	* evident	1071	* evident
1003	*/	1072	*/
1004	if (GET_MAP_OB (map, x, y) != this)	1073	if (GET_MAP_OB (map, x, y) != this)
1005	{
1006	char *dump = dump_object (this);
1007	LOG (llevError,
1008	"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump);	1074	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1009	free (dump);
1010	dump = dump_object (GET_MAP_OB (map, x, y));
1011	LOG (llevError, "%s\n", dump);
1012	free (dump);
1013	}
1014		1075
1015	map->at (x, y).bot = above; /* goes on above it. */	1076	ms.bot = above; /* goes on above it. */
1016	}	1077	}
1017		1078
1018	above = 0;	1079	above = 0;
1019	below = 0;	1080	below = 0;
1020		1081
1021	if (map->in_memory == MAP_SAVING)	1082	if (map->in_memory == MAP_SAVING)
1022	return;	1083	return;
1023		1084
1024	int check_walk_off = !flag [FLAG_NO_APPLY];	1085	int check_walk_off = !flag [FLAG_NO_APPLY];
1025		1086
1026	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1087	for (tmp = ms.bot; tmp; tmp = tmp->above)
1027	{	1088	{
1028	/* No point updating the players look faces if he is the object	1089	/* No point updating the players look faces if he is the object
1029	* being removed.	1090	* being removed.
1030	*/	1091	*/
1031		1092
…		…
1043		1104
1044	if (tmp->contr->ns)	1105	if (tmp->contr->ns)
1045	tmp->contr->ns->floorbox_update ();	1106	tmp->contr->ns->floorbox_update ();
1046	}	1107	}
1047		1108
1048	/* See if player moving off should effect something */	1109	/* See if object moving off should effect something */
1049	if (check_walk_off	1110	if (check_walk_off
1050	&& ((move_type & tmp->move_off)	1111	&& ((move_type & tmp->move_off)
1051	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1112	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1052	{	1113	{
1053	move_apply (tmp, this, 0);	1114	move_apply (tmp, this, 0);
…		…
1055	if (destroyed ())	1116	if (destroyed ())
1056	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1117	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1057	}	1118	}
1058		1119
1059	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1120	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1060		1121	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1061	if (tmp->above == tmp)	1122	if (tmp->above == tmp)
1062	tmp->above = 0;	1123	tmp->above = 0;
1063		1124
1064	last = tmp;	1125	last = tmp;
1065	}	1126	}
1066		1127
1067	/* last == NULL of there are no objects on this space */	1128	/* last == NULL if there are no objects on this space */
		1129	//TODO: this makes little sense, why only update the topmost object?
1068	if (!last)	1130	if (!last)
1069	map->at (x, y).flags_ = P_NEED_UPDATE;	1131	map->at (x, y).flags_ = 0;
1070	else	1132	else
1071	update_object (last, UP_OBJ_REMOVE);	1133	update_object (last, UP_OBJ_REMOVE);
1072		1134
1073	if (flag [FLAG_BLOCKSVIEW] || glow_radius)	1135	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1074	update_all_los (map, x, y);	1136	update_all_los (map, x, y);
…		…
1110	}	1172	}
1111		1173
1112	return 0;	1174	return 0;
1113	}	1175	}
1114		1176
		1177	void
		1178	object::expand_tail ()
		1179	{
		1180	if (more)
		1181	return;
		1182
		1183	object *prev = this;
		1184
		1185	for (archetype *at = arch->more; at; at = at->more)
		1186	{
		1187	object *op = arch_to_object (at);
		1188
		1189	op->name = name;
		1190	op->name_pl = name_pl;
		1191	op->title = title;
		1192
		1193	op->head = this;
		1194	prev->more = op;
		1195
		1196	prev = op;
		1197	}
		1198	}
		1199
1115	/*	1200	/*
1116	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1201	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1117	* job preparing multi-part monsters	1202	* job preparing multi-part monsters.
1118	*/	1203	*/
1119	object *	1204	object *
1120	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1205	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1121	{	1206	{
1122	object *tmp;
1123
1124	if (op->head)
1125	op = op->head;
1126
1127	for (tmp = op; tmp; tmp = tmp->more)	1207	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1128	{	1208	{
1129	tmp->x = x + tmp->arch->clone.x;	1209	tmp->x = x + tmp->arch->clone.x;
1130	tmp->y = y + tmp->arch->clone.y;	1210	tmp->y = y + tmp->arch->clone.y;
1131	}	1211	}
1132		1212
…		…
1154	* just 'op' otherwise	1234	* just 'op' otherwise
1155	*/	1235	*/
1156	object *	1236	object *
1157	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1237	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1158	{	1238	{
		1239	assert (!op->flag [FLAG_FREED]);
		1240
1159	object *tmp, *top, *floor = NULL;	1241	object *tmp, *top, *floor = NULL;
1160	sint16 x, y;
1161		1242
1162	if (QUERY_FLAG (op, FLAG_FREED))	1243	op->remove ();
1163	{
1164	LOG (llevError, "Trying to insert freed object!\n");
1165	return NULL;
1166	}
1167		1244
1168	if (m == NULL)	1245	#if 0
1169	{	1246	if (!m->active != !op->active)
1170	char *dump = dump_object (op);	1247	if (m->active)
1171	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1248	op->activate_recursive ();
1172	free (dump);	1249	else
1173	return op;	1250	op->deactivate_recursive ();
1174	}	1251	#endif
1175		1252
1176	if (out_of_map (m, op->x, op->y))	1253	if (out_of_map (m, op->x, op->y))
1177	{	1254	{
1178	char *dump = dump_object (op);
1179	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);	1255	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1180	#ifdef MANY_CORES	1256	#ifdef MANY_CORES
1181	/* Better to catch this here, as otherwise the next use of this object	1257	/* Better to catch this here, as otherwise the next use of this object
1182	* is likely to cause a crash. Better to find out where it is getting	1258	* is likely to cause a crash. Better to find out where it is getting
1183	* improperly inserted.	1259	* improperly inserted.
1184	*/	1260	*/
1185	abort ();	1261	abort ();
1186	#endif	1262	#endif
1187	free (dump);
1188	return op;	1263	return op;
1189	}	1264	}
1190		1265
1191	if (!QUERY_FLAG (op, FLAG_REMOVED))
1192	{
1193	char *dump = dump_object (op);
1194	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1195	free (dump);
1196	return op;
1197	}
1198
1199	if (op->more)
1200	{
1201	/* The part may be on a different map. */
1202
1203	object *more = op->more;	1266	if (object *more = op->more)
1204		1267	{
1205	/* We really need the caller to normalize coordinates - if
1206	* we set the map, that doesn't work if the location is within
1207	* a map and this is straddling an edge. So only if coordinate
1208	* is clear wrong do we normalize it.
1209	*/
1210	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1211	more->map = get_map_from_coord (m, &more->x, &more->y);
1212	else if (!more->map)
1213	{
1214	/* For backwards compatibility - when not dealing with tiled maps,
1215	* more->map should always point to the parent.
1216	*/
1217	more->map = m;
1218	}
1219
1220	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1268	if (!insert_ob_in_map (more, m, originator, flag))
1221	{	1269	{
1222	if (!op->head)	1270	if (!op->head)
1223	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1271	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1224		1272
1225	return 0;	1273	return 0;
…		…
1230		1278
1231	/* Ideally, the caller figures this out. However, it complicates a lot	1279	/* Ideally, the caller figures this out. However, it complicates a lot
1232	* of areas of callers (eg, anything that uses find_free_spot would now	1280	* of areas of callers (eg, anything that uses find_free_spot would now
1233	* need extra work	1281	* need extra work
1234	*/	1282	*/
1235	op->map = get_map_from_coord (m, &op->x, &op->y);	1283	if (!xy_normalise (m, op->x, op->y))
1236	x = op->x;	1284	return 0;
1237	y = op->y;	1285
		1286	op->map = m;
		1287	mapspace &ms = op->ms ();
1238		1288
1239	/* this has to be done after we translate the coordinates.	1289	/* this has to be done after we translate the coordinates.
1240	*/	1290	*/
1241	if (op->nrof && !(flag & INS_NO_MERGE))	1291	if (op->nrof && !(flag & INS_NO_MERGE))
1242	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1292	for (tmp = ms.bot; tmp; tmp = tmp->above)
1243	if (object::can_merge (op, tmp))	1293	if (object::can_merge (op, tmp))
1244	{	1294	{
1245	op->nrof += tmp->nrof;	1295	op->nrof += tmp->nrof;
1246	tmp->destroy ();	1296	tmp->destroy ();
1247	}	1297	}
…		…
1264	op->below = originator->below;	1314	op->below = originator->below;
1265		1315
1266	if (op->below)	1316	if (op->below)
1267	op->below->above = op;	1317	op->below->above = op;
1268	else	1318	else
1269	op->ms ().bot = op;	1319	ms.bot = op;
1270		1320
1271	/* since *below* originator, no need to update top */	1321	/* since *below* originator, no need to update top */
1272	originator->below = op;	1322	originator->below = op;
1273	}	1323	}
1274	else	1324	else
1275	{	1325	{
		1326	top = ms.bot;
		1327
1276	/* If there are other objects, then */	1328	/* If there are other objects, then */
1277	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1329	if ((!(flag & INS_MAP_LOAD)) && top)
1278	{	1330	{
1279	object *last = NULL;	1331	object *last = 0;
1280		1332
1281	/*	1333	/*
1282	* If there are multiple objects on this space, we do some trickier handling.	1334	* If there are multiple objects on this space, we do some trickier handling.
1283	* We've already dealt with merging if appropriate.	1335	* We've already dealt with merging if appropriate.
1284	* Generally, we want to put the new object on top. But if	1336	* Generally, we want to put the new object on top. But if
…		…
1288	* once we get to them. This reduces the need to traverse over all of	1340	* once we get to them. This reduces the need to traverse over all of
1289	* them when adding another one - this saves quite a bit of cpu time	1341	* them when adding another one - this saves quite a bit of cpu time
1290	* when lots of spells are cast in one area. Currently, it is presumed	1342	* when lots of spells are cast in one area. Currently, it is presumed
1291	* that flying non pickable objects are spell objects.	1343	* that flying non pickable objects are spell objects.
1292	*/	1344	*/
1293		1345	for (top = ms.bot; top; top = top->above)
1294	while (top != NULL)
1295	{	1346	{
1296	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1347	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1297	floor = top;	1348	floor = top;
1298		1349
1299	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1350	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1302	top = top->below;	1353	top = top->below;
1303	break;	1354	break;
1304	}	1355	}
1305		1356
1306	last = top;	1357	last = top;
1307	top = top->above;
1308	}	1358	}
1309		1359
1310	/* Don't want top to be NULL, so set it to the last valid object */	1360	/* Don't want top to be NULL, so set it to the last valid object */
1311	top = last;	1361	top = last;
1312		1362
…		…
1314	* looks like instead of lots of conditions here.	1364	* looks like instead of lots of conditions here.
1315	* makes things faster, and effectively the same result.	1365	* makes things faster, and effectively the same result.
1316	*/	1366	*/
1317		1367
1318	/* Have object 'fall below' other objects that block view.	1368	/* Have object 'fall below' other objects that block view.
1319	* Unless those objects are exits, type 66	1369	* Unless those objects are exits.
1320	* If INS_ON_TOP is used, don't do this processing	1370	* If INS_ON_TOP is used, don't do this processing
1321	* Need to find the object that in fact blocks view, otherwise	1371	* Need to find the object that in fact blocks view, otherwise
1322	* stacking is a bit odd.	1372	* stacking is a bit odd.
1323	*/	1373	*/
1324	if (!(flag & INS_ON_TOP) &&	1374	if (!(flag & INS_ON_TOP)
1325	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1375	&& ms.flags () & P_BLOCKSVIEW
		1376	&& (op->face && !faces [op->face].visibility))
1326	{	1377	{
1327	for (last = top; last != floor; last = last->below)	1378	for (last = top; last != floor; last = last->below)
1328	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1379	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1329	break;	1380	break;
		1381
1330	/* Check to see if we found the object that blocks view,	1382	/* Check to see if we found the object that blocks view,
1331	* and make sure we have a below pointer for it so that	1383	* and make sure we have a below pointer for it so that
1332	* we can get inserted below this one, which requires we	1384	* we can get inserted below this one, which requires we
1333	* set top to the object below us.	1385	* set top to the object below us.
1334	*/	1386	*/
…		…
1336	top = last->below;	1388	top = last->below;
1337	}	1389	}
1338	} /* If objects on this space */	1390	} /* If objects on this space */
1339		1391
1340	if (flag & INS_MAP_LOAD)	1392	if (flag & INS_MAP_LOAD)
1341	top = GET_MAP_TOP (op->map, op->x, op->y);	1393	top = ms.top;
1342		1394
1343	if (flag & INS_ABOVE_FLOOR_ONLY)	1395	if (flag & INS_ABOVE_FLOOR_ONLY)
1344	top = floor;	1396	top = floor;
1345		1397
1346	/* Top is the object that our object (op) is going to get inserted above.	1398	/* Top is the object that our object (op) is going to get inserted above.
1347	*/	1399	*/
1348		1400
1349	/* First object on this space */	1401	/* First object on this space */
1350	if (!top)	1402	if (!top)
1351	{	1403	{
1352	op->above = GET_MAP_OB (op->map, op->x, op->y);	1404	op->above = ms.bot;
1353		1405
1354	if (op->above)	1406	if (op->above)
1355	op->above->below = op;	1407	op->above->below = op;
1356		1408
1357	op->below = NULL;	1409	op->below = 0;
1358	op->ms ().bot = op;	1410	ms.bot = op;
1359	}	1411	}
1360	else	1412	else
1361	{ /* get inserted into the stack above top */	1413	{ /* get inserted into the stack above top */
1362	op->above = top->above;	1414	op->above = top->above;
1363		1415
…		…
1366		1418
1367	op->below = top;	1419	op->below = top;
1368	top->above = op;	1420	top->above = op;
1369	}	1421	}
1370		1422
1371	if (op->above == NULL)	1423	if (!op->above)
1372	op->ms ().top = op;	1424	ms.top = op;
1373	} /* else not INS_BELOW_ORIGINATOR */	1425	} /* else not INS_BELOW_ORIGINATOR */
1374		1426
1375	if (op->type == PLAYER)	1427	if (op->type == PLAYER)
		1428	{
1376	op->contr->do_los = 1;	1429	op->contr->do_los = 1;
		1430	++op->map->players;
		1431	op->map->touch ();
		1432	}
		1433
		1434	op->map->dirty = true;
1377		1435
1378	/* If we have a floor, we know the player, if any, will be above	1436	/* If we have a floor, we know the player, if any, will be above
1379	* it, so save a few ticks and start from there.	1437	* it, so save a few ticks and start from there.
1380	*/	1438	*/
1381	if (!(flag & INS_MAP_LOAD))	1439	if (!(flag & INS_MAP_LOAD))
1382	if (object *pl = op->ms ().player ())	1440	if (object *pl = ms.player ())
1383	if (pl->contr->ns)	1441	if (pl->contr->ns)
1384	pl->contr->ns->floorbox_update ();	1442	pl->contr->ns->floorbox_update ();
1385		1443
1386	/* If this object glows, it may affect lighting conditions that are	1444	/* If this object glows, it may affect lighting conditions that are
1387	* visible to others on this map. But update_all_los is really	1445	* visible to others on this map. But update_all_los is really
1388	* an inefficient way to do this, as it means los for all players	1446	* an inefficient way to do this, as it means los for all players
1389	* on the map will get recalculated. The players could very well	1447	* on the map will get recalculated. The players could very well
1390	* be far away from this change and not affected in any way -	1448	* be far away from this change and not affected in any way -
1391	* this should get redone to only look for players within range,	1449	* this should get redone to only look for players within range,
1392	* or just updating the P_NEED_UPDATE for spaces within this area	1450	* or just updating the P_UPTODATE for spaces within this area
1393	* of effect may be sufficient.	1451	* of effect may be sufficient.
1394	*/	1452	*/
1395	if (op->map->darkness && (op->glow_radius != 0))	1453	if (op->map->darkness && (op->glow_radius != 0))
1396	update_all_los (op->map, op->x, op->y);	1454	update_all_los (op->map, op->x, op->y);
1397		1455
…		…
1435	{	1493	{
1436	object *tmp, *tmp1;	1494	object *tmp, *tmp1;
1437		1495
1438	/* first search for itself and remove any old instances */	1496	/* first search for itself and remove any old instances */
1439		1497
1440	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1498	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1441	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1499	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1442	tmp->destroy ();	1500	tmp->destroy ();
1443		1501
1444	tmp1 = arch_to_object (archetype::find (arch_string));	1502	tmp1 = arch_to_object (archetype::find (arch_string));
1445		1503
1446	tmp1->x = op->x;	1504	tmp1->x = op->x;
1447	tmp1->y = op->y;	1505	tmp1->y = op->y;
1448	insert_ob_in_map (tmp1, op->map, op, 0);	1506	insert_ob_in_map (tmp1, op->map, op, 0);
		1507	}
		1508
		1509	object *
		1510	object::insert_at (object *where, object *originator, int flags)
		1511	{
		1512	return where->map->insert (this, where->x, where->y, originator, flags);
1449	}	1513	}
1450		1514
1451	/*	1515	/*
1452	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1516	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1453	* is returned contains nr objects, and the remaining parts contains	1517	* is returned contains nr objects, and the remaining parts contains
1454	* the rest (or is removed and freed if that number is 0).	1518	* the rest (or is removed and freed if that number is 0).
1455	* On failure, NULL is returned, and the reason put into the	1519	* On failure, NULL is returned, and the reason put into the
1456	* global static errmsg array.	1520	* global static errmsg array.
1457	*/	1521	*/
1458
1459	object *	1522	object *
1460	get_split_ob (object *orig_ob, uint32 nr)	1523	get_split_ob (object *orig_ob, uint32 nr)
1461	{	1524	{
1462	object *newob;	1525	object *newob;
1463	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1526	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1494	* the amount of an object. If the amount reaches 0, the object	1557	* the amount of an object. If the amount reaches 0, the object
1495	* is subsequently removed and freed.	1558	* is subsequently removed and freed.
1496	*	1559	*
1497	* Return value: 'op' if something is left, NULL if the amount reached 0	1560	* Return value: 'op' if something is left, NULL if the amount reached 0
1498	*/	1561	*/
1499
1500	object *	1562	object *
1501	decrease_ob_nr (object *op, uint32 i)	1563	decrease_ob_nr (object *op, uint32 i)
1502	{	1564	{
1503	object *tmp;	1565	object *tmp;
1504		1566
…		…
1579		1641
1580	/*	1642	/*
1581	* add_weight(object, weight) adds the specified weight to an object,	1643	* add_weight(object, weight) adds the specified weight to an object,
1582	* and also updates how much the environment(s) is/are carrying.	1644	* and also updates how much the environment(s) is/are carrying.
1583	*/	1645	*/
1584
1585	void	1646	void
1586	add_weight (object *op, signed long weight)	1647	add_weight (object *op, signed long weight)
1587	{	1648	{
1588	while (op != NULL)	1649	while (op != NULL)
1589	{	1650	{
…		…
1604	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1665	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1605	free (dump);	1666	free (dump);
1606	return op;	1667	return op;
1607	}	1668	}
1608		1669
1609	if (where->head)	1670	if (where->head_ () != where)
1610	{	1671	{
1611	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1672	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1612	where = where->head;	1673	where = where->head;
1613	}	1674	}
1614		1675
1615	return where->insert (op);	1676	return where->insert (op);
1616	}	1677	}
…		…
1621	* inside the object environment.	1682	* inside the object environment.
1622	*	1683	*
1623	* The function returns now pointer to inserted item, and return value can	1684	* The function returns now pointer to inserted item, and return value can
1624	* be != op, if items are merged. -Tero	1685	* be != op, if items are merged. -Tero
1625	*/	1686	*/
1626
1627	object *	1687	object *
1628	object::insert (object *op)	1688	object::insert (object *op)
1629	{	1689	{
1630	object *tmp, *otmp;	1690	object *tmp, *otmp;
1631		1691
…		…
1727	*	1787	*
1728	* MSW 2001-07-08: Check all objects on space, not just those below	1788	* MSW 2001-07-08: Check all objects on space, not just those below
1729	* object being inserted. insert_ob_in_map may not put new objects	1789	* object being inserted. insert_ob_in_map may not put new objects
1730	* on top.	1790	* on top.
1731	*/	1791	*/
1732
1733	int	1792	int
1734	check_move_on (object *op, object *originator)	1793	check_move_on (object *op, object *originator)
1735	{	1794	{
1736	object *tmp;	1795	object *tmp;
1737	maptile *m = op->map;	1796	maptile *m = op->map;
…		…
1764		1823
1765	/* The objects have to be checked from top to bottom.	1824	/* The objects have to be checked from top to bottom.
1766	* Hence, we first go to the top:	1825	* Hence, we first go to the top:
1767	*/	1826	*/
1768		1827
1769	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above)	1828	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1770	{	1829	{
1771	/* Trim the search when we find the first other spell effect	1830	/* Trim the search when we find the first other spell effect
1772	* this helps performance so that if a space has 50 spell objects,	1831	* this helps performance so that if a space has 50 spell objects,
1773	* we don't need to check all of them.	1832	* we don't need to check all of them.
1774	*/	1833	*/
…		…
1792	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1851	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1793	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1852	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1794	{	1853	{
1795		1854
1796	float	1855	float
1797	diff = tmp->move_slow_penalty * FABS (op->speed);	1856	diff = tmp->move_slow_penalty * fabs (op->speed);
1798		1857
1799	if (op->type == PLAYER)	1858	if (op->type == PLAYER)
1800	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1859	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1801	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1860	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1802	diff /= 4.0;	1861	diff /= 4.0;
…		…
1832	* The first matching object is returned, or NULL if none.	1891	* The first matching object is returned, or NULL if none.
1833	*/	1892	*/
1834	object *	1893	object *
1835	present_arch (const archetype *at, maptile *m, int x, int y)	1894	present_arch (const archetype *at, maptile *m, int x, int y)
1836	{	1895	{
1837	if (m == NULL || out_of_map (m, x, y))	1896	if (!m || out_of_map (m, x, y))
1838	{	1897	{
1839	LOG (llevError, "Present_arch called outside map.\n");	1898	LOG (llevError, "Present_arch called outside map.\n");
1840	return NULL;	1899	return NULL;
1841	}	1900	}
1842		1901
1843	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1902	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1844	if (tmp->arch == at)	1903	if (tmp->arch == at)
1845	return tmp;	1904	return tmp;
1846		1905
1847	return NULL;	1906	return NULL;
1848	}	1907	}
…		…
1859	{	1918	{
1860	LOG (llevError, "Present called outside map.\n");	1919	LOG (llevError, "Present called outside map.\n");
1861	return NULL;	1920	return NULL;
1862	}	1921	}
1863		1922
1864	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1923	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1865	if (tmp->type == type)	1924	if (tmp->type == type)
1866	return tmp;	1925	return tmp;
1867		1926
1868	return NULL;	1927	return NULL;
1869	}	1928	}
…		…
1946	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	2005	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1947	{	2006	{
1948	CLEAR_FLAG (tmp, flag);	2007	CLEAR_FLAG (tmp, flag);
1949	unflag_inv (tmp, flag);	2008	unflag_inv (tmp, flag);
1950	}	2009	}
1951	}
1952
1953	/*
1954	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1955	* all it's inventory (recursively).
1956	* If checksums are used, a player will get set_cheat called for
1957	* him/her-self and all object carried by a call to this function.
1958	*/
1959	void
1960	set_cheat (object *op)
1961	{
1962	SET_FLAG (op, FLAG_WAS_WIZ);
1963	flag_inv (op, FLAG_WAS_WIZ);
1964	}	2010	}
1965		2011
1966	/*	2012	/*
1967	* find_free_spot(object, map, x, y, start, stop) will search for	2013	* find_free_spot(object, map, x, y, start, stop) will search for
1968	* a spot at the given map and coordinates which will be able to contain	2014	* a spot at the given map and coordinates which will be able to contain
…		…
2009	}	2055	}
2010		2056
2011	if (!index)	2057	if (!index)
2012	return -1;	2058	return -1;
2013		2059
2014	return altern[RANDOM () % index];	2060	return altern [rndm (index)];
2015	}	2061	}
2016		2062
2017	/*	2063	/*
2018	* find_first_free_spot(archetype, maptile, x, y) works like	2064	* find_first_free_spot(archetype, maptile, x, y) works like
2019	* find_free_spot(), but it will search max number of squares.	2065	* find_free_spot(), but it will search max number of squares.
…		…
2040	{	2086	{
2041	arr += begin;	2087	arr += begin;
2042	end -= begin;	2088	end -= begin;
2043		2089
2044	while (--end)	2090	while (--end)
2045	swap (arr [end], arr [RANDOM () % (end + 1)]);	2091	swap (arr [end], arr [rndm (end + 1)]);
2046	}	2092	}
2047		2093
2048	/* new function to make monster searching more efficient, and effective!	2094	/* new function to make monster searching more efficient, and effective!
2049	* This basically returns a randomized array (in the passed pointer) of	2095	* This basically returns a randomized array (in the passed pointer) of
2050	* the spaces to find monsters. In this way, it won't always look for	2096	* the spaces to find monsters. In this way, it won't always look for
…		…
2184		2230
2185	return 3;	2231	return 3;
2186	}	2232	}
2187		2233
2188	/*	2234	/*
2189	* absdir(int): Returns a number between 1 and 8, which represent
2190	* the "absolute" direction of a number (it actually takes care of
2191	* "overflow" in previous calculations of a direction).
2192	*/
2193
2194	int
2195	absdir (int d)
2196	{
2197	while (d < 1)
2198	d += 8;
2199
2200	while (d > 8)
2201	d -= 8;
2202
2203	return d;
2204	}
2205
2206	/*
2207	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2235	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2208	* between two directions (which are expected to be absolute (see absdir())	2236	* between two directions (which are expected to be absolute (see absdir())
2209	*/	2237	*/
2210
2211	int	2238	int
2212	dirdiff (int dir1, int dir2)	2239	dirdiff (int dir1, int dir2)
2213	{	2240	{
2214	int d;	2241	int d;
2215		2242
…		…
2381	insert_ob_in_ob (object_create_clone (item), dst);	2408	insert_ob_in_ob (object_create_clone (item), dst);
2382		2409
2383	return dst;	2410	return dst;
2384	}	2411	}
2385		2412
2386	/* GROS - Creates an object using a string representing its content. */
2387	/* Basically, we save the content of the string to a temp file, then call */
2388	/* load_object on it. I admit it is a highly inefficient way to make things, */
2389	/* but it was simple to make and allows reusing the load_object function. */
2390	/* Remember not to use load_object_str in a time-critical situation. */
2391	/* Also remember that multiparts objects are not supported for now. */
2392	object *
2393	load_object_str (const char *obstr)
2394	{
2395	object *op;
2396	char filename[MAX_BUF];
2397
2398	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2399
2400	FILE *tempfile = fopen (filename, "w");
2401
2402	if (tempfile == NULL)
2403	{
2404	LOG (llevError, "Error - Unable to access load object temp file\n");
2405	return NULL;
2406	}
2407
2408	fprintf (tempfile, obstr);
2409	fclose (tempfile);
2410
2411	op = object::create ();
2412
2413	object_thawer thawer (filename);
2414
2415	if (thawer)
2416	load_object (thawer, op, 0);
2417
2418	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2419	CLEAR_FLAG (op, FLAG_REMOVED);
2420
2421	return op;
2422	}
2423
2424	/* This returns the first object in who's inventory that	2413	/* This returns the first object in who's inventory that
2425	* has the same type and subtype match.	2414	* has the same type and subtype match.
2426	* returns NULL if no match.	2415	* returns NULL if no match.
2427	*/	2416	*/
2428	object *	2417	object *
…		…
2481	if (link->key == canonical_key)	2470	if (link->key == canonical_key)
2482	return link->value;	2471	return link->value;
2483		2472
2484	return 0;	2473	return 0;
2485	}	2474	}
2486
2487		2475
2488	/*	2476	/*
2489	* Updates the canonical_key in op to value.	2477	* Updates the canonical_key in op to value.
2490	*	2478	*
2491	* canonical_key is a shared string (value doesn't have to be).	2479	* canonical_key is a shared string (value doesn't have to be).
…		…
2594	}	2582	}
2595	else	2583	else
2596	item = item->env;	2584	item = item->env;
2597	}	2585	}
2598		2586
		2587
		2588	const char *
		2589	object::flag_desc (char *desc, int len) const
		2590	{
		2591	char *p = desc;
		2592	bool first = true;
		2593
		2594	*p = 0;
		2595
		2596	for (int i = 0; i < NUM_FLAGS; i++)
		2597	{
		2598	if (len <= 10) // magic constant!
		2599	{
		2600	snprintf (p, len, ",...");
		2601	break;
		2602	}
		2603
		2604	if (flag [i])
		2605	{
		2606	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2607	len -= cnt;
		2608	p += cnt;
		2609	first = false;
		2610	}
		2611	}
		2612
		2613	return desc;
		2614	}
		2615
2599	// return a suitable string describing an objetc in enough detail to find it	2616	// return a suitable string describing an object in enough detail to find it
2600	const char *	2617	const char *
2601	object::debug_desc (char *info) const	2618	object::debug_desc (char *info) const
2602	{	2619	{
		2620	char flagdesc[512];
2603	char info2[256 * 3];	2621	char info2[256 * 4];
2604	char *p = info;	2622	char *p = info;
2605		2623
2606	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2624	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2607	count,	2625	count, uuid.seq,
2608	&name,	2626	&name,
2609	title ? " " : "",	2627	title ? "\",title:\"" : "",
2610	title ? (const char *)title : "");	2628	title ? (const char *)title : "",
		2629	flag_desc (flagdesc, 512), type);
2611		2630
2612	if (env)	2631	if (env)
2613	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2632	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2614		2633
2615	if (map)	2634	if (map)
2616	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2635	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2617		2636
2618	return info;	2637	return info;
2619	}	2638	}
2620		2639
2621	const char *	2640	const char *
2622	object::debug_desc () const	2641	object::debug_desc () const
2623	{	2642	{
2624	static char info[256 * 3];	2643	static char info[3][256 * 4];
		2644	static int info_idx;
		2645
2625	return debug_desc (info);	2646	return debug_desc (info [++info_idx % 3]);
2626	}	2647	}
2627		2648
		2649	struct region *
		2650	object::region () const
		2651	{
		2652	return map ? map->region (x, y)
		2653	: region::default_region ();
		2654	}
		2655
		2656	const materialtype_t *
		2657	object::dominant_material () const
		2658	{
		2659	if (materialtype_t *mat = name_to_material (materialname))
		2660	return mat;
		2661
		2662	// omfg this is slow, this has to be temporary :)
		2663	shstr unknown ("unknown");
		2664
		2665	return name_to_material (unknown);
		2666	}
		2667
		2668	void
		2669	object::open_container (object *new_container)
		2670	{
		2671	if (container == new_container)
		2672	return;
		2673
		2674	if (object *old_container = container)
		2675	{
		2676	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2677	return;
		2678
		2679	#if 0
		2680	// remove the "Close old_container" object.
		2681	if (object *closer = old_container->inv)
		2682	if (closer->type == CLOSE_CON)
		2683	closer->destroy ();
		2684	#endif
		2685
		2686	old_container->flag [FLAG_APPLIED] = 0;
		2687	container = 0;
		2688
		2689	esrv_update_item (UPD_FLAGS, this, old_container);
		2690	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2691	}
		2692
		2693	if (new_container)
		2694	{
		2695	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2696	return;
		2697
		2698	// TODO: this does not seem to serve any purpose anymore?
		2699	#if 0
		2700	// insert the "Close Container" object.
		2701	if (archetype *closer = new_container->other_arch)
		2702	{
		2703	object *closer = arch_to_object (new_container->other_arch);
		2704	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2705	new_container->insert (closer);
		2706	}
		2707	#endif
		2708
		2709	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2710
		2711	new_container->flag [FLAG_APPLIED] = 1;
		2712	container = new_container;
		2713
		2714	esrv_update_item (UPD_FLAGS, this, new_container);
		2715	esrv_send_inventory (this, new_container);
		2716	}
		2717	}
		2718
		2719

Diff Legend

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