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.74 by root, Wed Dec 20 09:14:21 2006 UTC vs.
Revision 1.107 by pippijn, Sat Jan 6 14:42:29 2007 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	CrossFire, A Multiplayer game for X-windows
3		3
		4	Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	Copyright (C) 2001 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	Copyright (C) 1992 Frank Tore Johansen
6		7
7	This program is free software; you can redistribute it and/or modify	8	This program is free software; you can redistribute it and/or modify
8	it under the terms of the GNU General Public License as published by	9	it under the terms of the GNU General Public License as published by
…		…
141	* objects with lists are rare, and lists stay short. If not, use a	142	* objects with lists are rare, and lists stay short. If not, use a
142	* different structure or at least keep the lists sorted...	143	* different structure or at least keep the lists sorted...
143	*/	144	*/
144		145
145	/* For each field in wants, */	146	/* For each field in wants, */
146	for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)	147	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)
147	{	148	{
148	key_value *has_field;	149	key_value *has_field;
149		150
150	/* Look for a field in has with the same key. */	151	/* Look for a field in has with the same key. */
151	has_field = get_ob_key_link (has, wants_field->key);	152	has_field = get_ob_key_link (has, wants_field->key);
…		…
190	* Check nrof variable *before* calling can_merge()	191	* Check nrof variable *before* calling can_merge()
191	*	192	*
192	* Improvements made with merge: Better checking on potion, and also	193	* Improvements made with merge: Better checking on potion, and also
193	* check weight	194	* check weight
194	*/	195	*/
195
196	bool object::can_merge_slow (object *ob1, object *ob2)	196	bool object::can_merge_slow (object *ob1, object *ob2)
197	{	197	{
198	/* A couple quicksanity checks */	198	/* A couple quicksanity checks */
199	if (ob1 == ob2	199	if (ob1 == ob2
200	|| ob1->type != ob2->type	200	|| ob1->type != ob2->type
…		…
221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
222		222
223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
225		225
226	if ((ob1->flags ^ ob2->flags).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	226	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
227	|| ob1->arch != ob2->arch	227	|| ob1->arch != ob2->arch
228	|| ob1->name != ob2->name	228	|| ob1->name != ob2->name
229	|| ob1->title != ob2->title	229	|| ob1->title != ob2->title
230	|| ob1->msg != ob2->msg	230	|| ob1->msg != ob2->msg
231	|| ob1->weight != ob2->weight	231	|| ob1->weight != ob2->weight
…		…
277		277
278	/* Note sure why the following is the case - either the object has to	278	/* 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	279	* be animated or have a very low speed. Is this an attempted monster
280	* check?	280	* check?
281	*/	281	*/
282	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	282	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
283	return 0;	283	return 0;
284		284
285	switch (ob1->type)	285	switch (ob1->type)
286	{	286	{
287	case SCROLL:	287	case SCROLL:
…		…
364	{	364	{
365	if (!op)	365	if (!op)
366	return strdup ("[NULLOBJ]");	366	return strdup ("[NULLOBJ]");
367		367
368	object_freezer freezer;	368	object_freezer freezer;
369	save_object (freezer, op, 3);	369	save_object (freezer, op, 1);
370	return freezer.as_string ();	370	return freezer.as_string ();
371	}	371	}
372		372
373	/*	373	/*
374	* get_nearest_part(multi-object, object 2) returns the part of the	374	* get_nearest_part(multi-object, object 2) returns the part of the
…		…
467	}	467	}
468		468
469	op->key_values = 0;	469	op->key_values = 0;
470	}	470	}
471		471
472	void object::clear ()
473	{
474	attachable_base::clear ();
475
476	free_key_values (this);
477
478	owner = 0;
479	name = 0;
480	name_pl = 0;
481	title = 0;
482	race = 0;
483	slaying = 0;
484	skill = 0;
485	msg = 0;
486	lore = 0;
487	custom_name = 0;
488	materialname = 0;
489	contr = 0;
490	below = 0;
491	above = 0;
492	inv = 0;
493	container = 0;
494	env = 0;
495	more = 0;
496	head = 0;
497	map = 0;
498	active_next = 0;
499	active_prev = 0;
500
501	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
502
503	SET_FLAG (this, FLAG_REMOVED);
504
505	/* What is not cleared is next, prev, and count */
506
507	expmul = 1.0;
508	face = blank_face;
509
510	if (settings.casting_time)
511	casting_time = -1;
512	}
513
514	/*	472	/*
515	* copy_to first frees everything allocated by the dst object,	473	* copy_to first frees everything allocated by the dst object,
516	* and then copies the contents of itself into the second	474	* and then copies the contents of itself into the second
517	* object, allocating what needs to be allocated. Basically, any	475	* object, allocating what needs to be allocated. Basically, any
518	* data that is malloc'd needs to be re-malloc/copied. Otherwise,	476	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
…		…
524	{	482	{
525	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	483	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
526	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	484	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
527		485
528	*(object_copy *)dst = *this;	486	*(object_copy *)dst = *this;
529	*(object_pod *)dst = *this;
530
531	if (self || cb)
532	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst));
533		487
534	if (is_freed)	488	if (is_freed)
535	SET_FLAG (dst, FLAG_FREED);	489	SET_FLAG (dst, FLAG_FREED);
536		490
537	if (is_removed)	491	if (is_removed)
…		…
568	tail = new_link;	522	tail = new_link;
569	}	523	}
570	}	524	}
571	}	525	}
572		526
573	update_ob_speed (dst);	527	dst->set_speed (dst->speed);
574	}	528	}
575		529
576	object *	530	object *
577	object::clone ()	531	object::clone ()
578	{	532	{
…		…
584	/*	538	/*
585	* If an object with the IS_TURNABLE() flag needs to be turned due	539	* If an object with the IS_TURNABLE() flag needs to be turned due
586	* to the closest player being on the other side, this function can	540	* to the closest player being on the other side, this function can
587	* be called to update the face variable, _and_ how it looks on the map.	541	* be called to update the face variable, _and_ how it looks on the map.
588	*/	542	*/
589
590	void	543	void
591	update_turn_face (object *op)	544	update_turn_face (object *op)
592	{	545	{
593	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	546	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
594	return;	547	return;
		548
595	SET_ANIMATION (op, op->direction);	549	SET_ANIMATION (op, op->direction);
596	update_object (op, UP_OBJ_FACE);	550	update_object (op, UP_OBJ_FACE);
597	}	551	}
598		552
599	/*	553	/*
600	* Updates the speed of an object. If the speed changes from 0 to another	554	* Updates the speed of an object. If the speed changes from 0 to another
601	* value, or vice versa, then add/remove the object from the active list.	555	* value, or vice versa, then add/remove the object from the active list.
602	* This function needs to be called whenever the speed of an object changes.	556	* This function needs to be called whenever the speed of an object changes.
603	*/	557	*/
604	void	558	void
605	update_ob_speed (object *op)	559	object::set_speed (float speed)
606	{	560	{
607	extern int arch_init;	561	if (flag [FLAG_FREED] && speed)
608
609	/* No reason putting the archetypes objects on the speed list,
610	* since they never really need to be updated.
611	*/
612
613	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
614	{	562	{
615	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	563	LOG (llevError, "Object %s is freed but has speed.\n", &name);
616	#ifdef MANY_CORES
617	abort ();
618	#else
619	op->speed = 0;	564	speed = 0;
620	#endif
621	}
622
623	if (arch_init)
624	return;
625
626	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
627	{	565	}
628	/* If already on active list, don't do anything */
629	if (op->active_next || op->active_prev || op == active_objects)
630	return;
631		566
632	/* process_events() expects us to insert the object at the beginning	567	this->speed = speed;
633	* of the list. */
634	op->active_next = active_objects;
635		568
636	if (op->active_next != NULL)	569	if (has_active_speed ())
637	op->active_next->active_prev = op;	570	activate ();
638
639	active_objects = op;
640	}
641	else	571	else
642	{	572	deactivate ();
643	/* If not on the active list, nothing needs to be done */
644	if (!op->active_next && !op->active_prev && op != active_objects)
645	return;
646
647	if (op->active_prev == NULL)
648	{
649	active_objects = op->active_next;
650
651	if (op->active_next != NULL)
652	op->active_next->active_prev = NULL;
653	}
654	else
655	{
656	op->active_prev->active_next = op->active_next;
657
658	if (op->active_next)
659	op->active_next->active_prev = op->active_prev;
660	}
661
662	op->active_next = NULL;
663	op->active_prev = NULL;
664	}
665	}	573	}
666		574
667	/* This function removes object 'op' from the list of active
668	* objects.
669	* This should only be used for style maps or other such
670	* reference maps where you don't want an object that isn't
671	* in play chewing up cpu time getting processed.
672	* The reverse of this is to call update_ob_speed, which
673	* will do the right thing based on the speed of the object.
674	*/
675	void
676	remove_from_active_list (object *op)
677	{
678	/* If not on the active list, nothing needs to be done */
679	if (!op->active_next && !op->active_prev && op != active_objects)
680	return;
681
682	if (op->active_prev == NULL)
683	{
684	active_objects = op->active_next;
685	if (op->active_next != NULL)
686	op->active_next->active_prev = NULL;
687	}
688	else
689	{
690	op->active_prev->active_next = op->active_next;
691	if (op->active_next)
692	op->active_next->active_prev = op->active_prev;
693	}
694	op->active_next = NULL;
695	op->active_prev = NULL;
696	}
697
698	/*	575	/*
699	* update_object() updates the array which represents the map.	576	* update_object() updates the the map.
700	* It takes into account invisible objects (and represent squares covered	577	* It takes into account invisible objects (and represent squares covered
701	* by invisible objects by whatever is below them (unless it's another	578	* by invisible objects by whatever is below them (unless it's another
702	* invisible object, etc...)	579	* invisible object, etc...)
703	* If the object being updated is beneath a player, the look-window	580	* If the object being updated is beneath a player, the look-window
704	* of that player is updated (this might be a suboptimal way of	581	* of that player is updated (this might be a suboptimal way of
705	* updating that window, though, since update_object() is called _often_)	582	* updating that window, though, since update_object() is called _often_)
706	*	583	*
707	* action is a hint of what the caller believes need to be done.	584	* action is a hint of what the caller believes need to be done.
708	* For example, if the only thing that has changed is the face (due to
709	* an animation), we don't need to call update_position until that actually
710	* comes into view of a player. OTOH, many other things, like addition/removal
711	* of walls or living creatures may need us to update the flags now.
712	* current action are:	585	* current action are:
713	* UP_OBJ_INSERT: op was inserted	586	* UP_OBJ_INSERT: op was inserted
714	* UP_OBJ_REMOVE: op was removed	587	* UP_OBJ_REMOVE: op was removed
715	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update	588	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
716	* as that is easier than trying to look at what may have changed.	589	* as that is easier than trying to look at what may have changed.
717	* UP_OBJ_FACE: only the objects face has changed.	590	* UP_OBJ_FACE: only the objects face has changed.
718	*/	591	*/
719
720	void	592	void
721	update_object (object *op, int action)	593	update_object (object *op, int action)
722	{	594	{
723	int update_now = 0, flags;
724	MoveType move_on, move_off, move_block, move_slow;	595	MoveType move_on, move_off, move_block, move_slow;
725		596
726	if (op == NULL)	597	if (op == NULL)
727	{	598	{
728	/* this should never happen */	599	/* this should never happen */
729	LOG (llevDebug, "update_object() called for NULL object.\n");	600	LOG (llevDebug, "update_object() called for NULL object.\n");
730	return;	601	return;
731	}	602	}
732		603
733	if (op->env != NULL)	604	if (op->env)
734	{	605	{
735	/* Animation is currently handled by client, so nothing	606	/* Animation is currently handled by client, so nothing
736	* to do in this case.	607	* to do in this case.
737	*/	608	*/
738	return;	609	return;
…		…
743	*/	614	*/
744	if (!op->map || op->map->in_memory == MAP_SAVING)	615	if (!op->map || op->map->in_memory == MAP_SAVING)
745	return;	616	return;
746		617
747	/* make sure the object is within map boundaries */	618	/* make sure the object is within map boundaries */
748	if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))	619	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
749	{	620	{
750	LOG (llevError, "update_object() called for object out of map!\n");	621	LOG (llevError, "update_object() called for object out of map!\n");
751	#ifdef MANY_CORES	622	#ifdef MANY_CORES
752	abort ();	623	abort ();
753	#endif	624	#endif
754	return;	625	return;
755	}	626	}
756		627
757	flags = GET_MAP_FLAGS (op->map, op->x, op->y);	628	mapspace &m = op->ms ();
758	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
759	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
760	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
761	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
762	move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
763		629
		630	if (!(m.flags_ & P_UPTODATE))
		631	/* nop */;
764	if (action == UP_OBJ_INSERT)	632	else if (action == UP_OBJ_INSERT)
765	{	633	{
		634	// this is likely overkill, TODO: revisit (schmorp)
766	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))	635	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
767	update_now = 1;
768
769	if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))	636	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
770	update_now = 1;	637	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))
771		638	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
		639	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
772	if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))	640	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
773	update_now = 1;
774
775	if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
776	update_now = 1;
777
778	if (op->type == SAFE_GROUND && !(flags & P_SAFE))
779	update_now = 1;
780
781	if ((move_on | op->move_on) != move_on)	641	|| (m.move_on | op->move_on ) != m.move_on
782	update_now = 1;
783
784	if ((move_off | op->move_off) != move_off)	642	|| (m.move_off | op->move_off ) != m.move_off
785	update_now = 1;	643	|| (m.move_slow | op->move_slow) != m.move_slow
786
787	/* This isn't perfect, but I don't expect a lot of objects to	644	/* This isn't perfect, but I don't expect a lot of objects to
788	* to have move_allow right now.	645	* to have move_allow right now.
789	*/	646	*/
790	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	647	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
791	update_now = 1;	648	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
792		649	m.flags_ = 0;
793	if ((move_slow | op->move_slow) != move_slow)
794	update_now = 1;
795	}	650	}
796
797	/* if the object is being removed, we can't make intelligent	651	/* if the object is being removed, we can't make intelligent
798	* decisions, because remove_ob can't really pass the object	652	* decisions, because remove_ob can't really pass the object
799	* that is being removed.	653	* that is being removed.
800	*/	654	*/
801	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	655	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
802	update_now = 1;	656	m.flags_ = 0;
803	else if (action == UP_OBJ_FACE)	657	else if (action == UP_OBJ_FACE)
804	/* Nothing to do for that case */ ;	658	/* Nothing to do for that case */ ;
805	else	659	else
806	LOG (llevError, "update_object called with invalid action: %d\n", action);	660	LOG (llevError, "update_object called with invalid action: %d\n", action);
807		661
808	if (update_now)
809	{
810	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
811	update_position (op->map, op->x, op->y);
812	}
813
814	if (op->more != NULL)	662	if (op->more)
815	update_object (op->more, action);	663	update_object (op->more, action);
816	}	664	}
817		665
818	object::vector object::mortals;
819	object::vector object::objects; // not yet used
820	object *object::first;	666	object *object::first;
821
822	void object::free_mortals ()
823	{
824	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
825	if ((*i)->refcnt)
826	++i; // further delay freeing
827	else
828	{
829	delete *i;
830	mortals.erase (i);
831	}
832	}
833		667
834	object::object ()	668	object::object ()
835	{	669	{
836	SET_FLAG (this, FLAG_REMOVED);	670	SET_FLAG (this, FLAG_REMOVED);
837		671
…		…
869		703
870	prev = 0;	704	prev = 0;
871	next = 0;	705	next = 0;
872	}	706	}
873		707
		708	bool
		709	object::active () const
		710	{
		711	return active_next || active_prev || this == active_objects;
		712	}
		713
		714	void
		715	object::activate ()
		716	{
		717	/* If already on active list, don't do anything */
		718	if (active ())
		719	return;
		720
		721	if (has_active_speed ())
		722	{
		723	/* process_events() expects us to insert the object at the beginning
		724	* of the list. */
		725	active_next = active_objects;
		726
		727	if (active_next)
		728	active_next->active_prev = this;
		729
		730	active_objects = this;
		731	}
		732	}
		733
		734	void
		735	object::activate_recursive ()
		736	{
		737	activate ();
		738
		739	for (object *op = inv; op; op = op->below)
		740	op->activate_recursive ();
		741	}
		742
		743	/* This function removes object 'op' from the list of active
		744	* objects.
		745	* This should only be used for style maps or other such
		746	* reference maps where you don't want an object that isn't
		747	* in play chewing up cpu time getting processed.
		748	* The reverse of this is to call update_ob_speed, which
		749	* will do the right thing based on the speed of the object.
		750	*/
		751	void
		752	object::deactivate ()
		753	{
		754	/* If not on the active list, nothing needs to be done */
		755	if (!active ())
		756	return;
		757
		758	if (active_prev == 0)
		759	{
		760	active_objects = active_next;
		761	if (active_next)
		762	active_next->active_prev = 0;
		763	}
		764	else
		765	{
		766	active_prev->active_next = active_next;
		767	if (active_next)
		768	active_next->active_prev = active_prev;
		769	}
		770
		771	active_next = 0;
		772	active_prev = 0;
		773	}
		774
		775	void
		776	object::deactivate_recursive ()
		777	{
		778	for (object *op = inv; op; op = op->below)
		779	op->deactivate_recursive ();
		780
		781	deactivate ();
		782	}
		783
		784	void
		785	object::set_flag_inv (int flag, int value)
		786	{
		787	for (object *op = inv; op; op = op->below)
		788	{
		789	op->flag [flag] = value;
		790	op->set_flag_inv (flag, value);
		791	}
		792	}
		793
		794	/*
		795	* Remove and free all objects in the inventory of the given object.
		796	* object.c ?
		797	*/
		798	void
		799	object::destroy_inv (bool drop_to_ground)
		800	{
		801	// need to check first, because the checks below might segfault
		802	// as we might be on an invalid mapspace and crossfire code
		803	// is too buggy to ensure that the inventory is empty.
		804	// corollary: if you create arrows etc. with stuff in tis inventory,
		805	// cf will crash below with off-map x and y
		806	if (!inv)
		807	return;
		808
		809	/* Only if the space blocks everything do we not process -
		810	* if some form of movement is allowed, let objects
		811	* drop on that space.
		812	*/
		813	if (!drop_to_ground
		814	|| !map
		815	|| map->in_memory != MAP_IN_MEMORY
		816	|| ms ().move_block == MOVE_ALL)
		817	{
		818	while (inv)
		819	{
		820	inv->destroy_inv (drop_to_ground);
		821	inv->destroy ();
		822	}
		823	}
		824	else
		825	{ /* Put objects in inventory onto this space */
		826	while (inv)
		827	{
		828	object *op = inv;
		829
		830	if (op->flag [FLAG_STARTEQUIP]
		831	|| op->flag [FLAG_NO_DROP]
		832	|| op->type == RUNE
		833	|| op->type == TRAP
		834	|| op->flag [FLAG_IS_A_TEMPLATE])
		835	op->destroy ();
		836	else
		837	map->insert (op, x, y);
		838	}
		839	}
		840	}
		841
874	object *object::create ()	842	object *object::create ()
875	{	843	{
876	object *op = new object;	844	object *op = new object;
877	op->link ();	845	op->link ();
878	return op;	846	return op;
879	}	847	}
880		848
881	/*	849	void
882	* free_object() frees everything allocated by an object, removes	850	object::do_destroy ()
883	* it from the list of used objects, and puts it on the list of
884	* free objects. The IS_FREED() flag is set in the object.
885	* The object must have been removed by remove_ob() first for
886	* this function to succeed.
887	*
888	* If destroy_inventory is set, free inventory as well. Else drop items in
889	* inventory to the ground.
890	*/
891	void object::destroy (bool destroy_inventory)
892	{	851	{
893	if (QUERY_FLAG (this, FLAG_FREED))	852	if (flag [FLAG_IS_LINKED])
		853	remove_button_link (this);
		854
		855	if (flag [FLAG_FRIENDLY])
		856	remove_friendly_object (this);
		857
		858	if (!flag [FLAG_REMOVED])
		859	remove ();
		860
		861	if (flag [FLAG_FREED])
894	return;	862	return;
895		863
896	if (QUERY_FLAG (this, FLAG_FRIENDLY))	864	set_speed (0);
897	remove_friendly_object (this);
898		865
899	if (!QUERY_FLAG (this, FLAG_REMOVED))	866	flag [FLAG_FREED] = 1;
900	remove ();
901		867
902	SET_FLAG (this, FLAG_FREED);	868	attachable::do_destroy ();
903		869
904	if (more)	870	destroy_inv (true);
905	{	871	unlink ();
906	more->destroy (destroy_inventory);
907	more = 0;
908	}
909
910	if (inv)
911	{
912	/* Only if the space blocks everything do we not process -
913	* if some form of movement is allowed, let objects
914	* drop on that space.
915	*/
916	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
917	{
918	object *op = inv;
919
920	while (op)
921	{
922	object *tmp = op->below;
923	op->destroy (destroy_inventory);
924	op = tmp;
925	}
926	}
927	else
928	{ /* Put objects in inventory onto this space */
929	object *op = inv;
930
931	while (op)
932	{
933	object *tmp = op->below;
934
935	op->remove ();
936
937	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
938	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
939	op->destroy ();
940	else
941	{
942	op->x = x;
943	op->y = y;
944	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
945	}
946
947	op = tmp;
948	}
949	}
950	}
951		872
952	// hack to ensure that freed objects still have a valid map	873	// hack to ensure that freed objects still have a valid map
953	{	874	{
954	static maptile *freed_map; // freed objects are moved here to avoid crashes	875	static maptile *freed_map; // freed objects are moved here to avoid crashes
955		876
…		…
959		880
960	freed_map->name = "/internal/freed_objects_map";	881	freed_map->name = "/internal/freed_objects_map";
961	freed_map->width = 3;	882	freed_map->width = 3;
962	freed_map->height = 3;	883	freed_map->height = 3;
963		884
964	freed_map->allocate ();	885	freed_map->alloc ();
		886	freed_map->in_memory = MAP_IN_MEMORY;
965	}	887	}
966		888
967	map = freed_map;	889	map = freed_map;
968	x = 1;	890	x = 1;
969	y = 1;	891	y = 1;
970	}	892	}
971		893
		894	head = 0;
		895
		896	if (more)
		897	{
		898	more->destroy ();
		899	more = 0;
		900	}
		901
972	// clear those pointers that likely might have circular references to us	902	// clear those pointers that likely might have circular references to us
973	owner = 0;	903	owner = 0;
974	enemy = 0;	904	enemy = 0;
975	attacked_by = 0;	905	attacked_by = 0;
976		906
977	// only relevant for players(?), but make sure of it anyways	907	// only relevant for players(?), but make sure of it anyways
978	contr = 0;	908	contr = 0;
		909	}
979		910
980	/* Remove object from the active list */	911	void
981	speed = 0;	912	object::destroy (bool destroy_inventory)
982	update_ob_speed (this);	913	{
		914	if (destroyed ())
		915	return;
983		916
984	unlink ();	917	if (destroy_inventory)
		918	destroy_inv (false);
985		919
986	mortals.push_back (this);	920	attachable::destroy ();
987	}	921	}
988		922
989	/*	923	/*
990	* sub_weight() recursively (outwards) subtracts a number from the	924	* sub_weight() recursively (outwards) subtracts a number from the
991	* weight of an object (and what is carried by it's environment(s)).	925	* weight of an object (and what is carried by it's environment(s)).
…		…
1015	object::remove ()	949	object::remove ()
1016	{	950	{
1017	object *tmp, *last = 0;	951	object *tmp, *last = 0;
1018	object *otmp;	952	object *otmp;
1019		953
1020	int check_walk_off;
1021
1022	if (QUERY_FLAG (this, FLAG_REMOVED))	954	if (QUERY_FLAG (this, FLAG_REMOVED))
1023	return;	955	return;
1024		956
1025	SET_FLAG (this, FLAG_REMOVED);	957	SET_FLAG (this, FLAG_REMOVED);
		958	INVOKE_OBJECT (REMOVE, this);
1026		959
1027	if (more)	960	if (more)
1028	more->remove ();	961	more->remove ();
1029		962
1030	/*	963	/*
…		…
1041	/* NO_FIX_PLAYER is set when a great many changes are being	974	/* NO_FIX_PLAYER is set when a great many changes are being
1042	* made to players inventory. If set, avoiding the call	975	* made to players inventory. If set, avoiding the call
1043	* to save cpu time.	976	* to save cpu time.
1044	*/	977	*/
1045	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	978	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1046	fix_player (otmp);	979	otmp->update_stats ();
1047		980
1048	if (above != NULL)	981	if (above)
1049	above->below = below;	982	above->below = below;
1050	else	983	else
1051	env->inv = below;	984	env->inv = below;
1052		985
1053	if (below != NULL)	986	if (below)
1054	below->above = above;	987	below->above = above;
1055		988
1056	/* we set up values so that it could be inserted into	989	/* we set up values so that it could be inserted into
1057	* the map, but we don't actually do that - it is up	990	* the map, but we don't actually do that - it is up
1058	* to the caller to decide what we want to do.	991	* to the caller to decide what we want to do.
…		…
1062	above = 0, below = 0;	995	above = 0, below = 0;
1063	env = 0;	996	env = 0;
1064	}	997	}
1065	else if (map)	998	else if (map)
1066	{	999	{
1067	/* Re did the following section of code - it looks like it had	1000	if (type == PLAYER)
1068	* lots of logic for things we no longer care about
1069	*/	1001	{
		1002	--map->players;
		1003	map->touch ();
		1004	}
		1005
		1006	map->dirty = true;
1070		1007
1071	/* link the object above us */	1008	/* link the object above us */
1072	if (above)	1009	if (above)
1073	above->below = below;	1010	above->below = below;
1074	else	1011	else
1075	SET_MAP_TOP (map, x, y, below); /* we were top, set new top */	1012	map->at (x, y).top = below; /* we were top, set new top */
1076		1013
1077	/* Relink the object below us, if there is one */	1014	/* Relink the object below us, if there is one */
1078	if (below)	1015	if (below)
1079	below->above = above;	1016	below->above = above;
1080	else	1017	else
…		…
1092	dump = dump_object (GET_MAP_OB (map, x, y));	1029	dump = dump_object (GET_MAP_OB (map, x, y));
1093	LOG (llevError, "%s\n", dump);	1030	LOG (llevError, "%s\n", dump);
1094	free (dump);	1031	free (dump);
1095	}	1032	}
1096		1033
1097	SET_MAP_OB (map, x, y, above); /* goes on above it. */	1034	map->at (x, y).bot = above; /* goes on above it. */
1098	}	1035	}
1099		1036
1100	above = 0;	1037	above = 0;
1101	below = 0;	1038	below = 0;
1102		1039
1103	if (map->in_memory == MAP_SAVING)	1040	if (map->in_memory == MAP_SAVING)
1104	return;	1041	return;
1105		1042
1106	check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);	1043	int check_walk_off = !flag [FLAG_NO_APPLY];
1107		1044
1108	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	1045	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)
1109	{	1046	{
1110	/* No point updating the players look faces if he is the object	1047	/* No point updating the players look faces if he is the object
1111	* being removed.	1048	* being removed.
1112	*/	1049	*/
1113		1050
…		…
1117	* removed (most likely destroyed), update the player view	1054	* removed (most likely destroyed), update the player view
1118	* appropriately.	1055	* appropriately.
1119	*/	1056	*/
1120	if (tmp->container == this)	1057	if (tmp->container == this)
1121	{	1058	{
1122	CLEAR_FLAG (this, FLAG_APPLIED);	1059	flag [FLAG_APPLIED] = 0;
1123	tmp->container = 0;	1060	tmp->container = 0;
1124	}	1061	}
1125		1062
		1063	if (tmp->contr->ns)
1126	tmp->contr->socket->floorbox_update ();	1064	tmp->contr->ns->floorbox_update ();
1127	}	1065	}
1128		1066
1129	/* See if player moving off should effect something */	1067	/* See if object moving off should effect something */
1130	if (check_walk_off	1068	if (check_walk_off
1131	&& ((move_type & tmp->move_off)	1069	&& ((move_type & tmp->move_off)
1132	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1070	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1133	{	1071	{
1134	move_apply (tmp, this, 0);	1072	move_apply (tmp, this, 0);
…		…
1136	if (destroyed ())	1074	if (destroyed ())
1137	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1075	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1138	}	1076	}
1139		1077
1140	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1078	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1141		1079	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1142	if (tmp->above == tmp)	1080	if (tmp->above == tmp)
1143	tmp->above = 0;	1081	tmp->above = 0;
1144		1082
1145	last = tmp;	1083	last = tmp;
1146	}	1084	}
1147		1085
1148	/* last == NULL of there are no objects on this space */	1086	/* last == NULL if there are no objects on this space */
		1087	//TODO: this makes little sense, why only update the topmost object?
1149	if (!last)	1088	if (!last)
1150	{	1089	map->at (x, y).flags_ = 0;
1151	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1152	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1153	* those out anyways, and if there are any flags set right now, they won't
1154	* be correct anyways.
1155	*/
1156	SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE);
1157	update_position (map, x, y);
1158	}
1159	else	1090	else
1160	update_object (last, UP_OBJ_REMOVE);	1091	update_object (last, UP_OBJ_REMOVE);
1161		1092
1162	if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)	1093	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1163	update_all_los (map, x, y);	1094	update_all_los (map, x, y);
1164	}	1095	}
1165	}	1096	}
1166		1097
1167	/*	1098	/*
…		…
1176	merge_ob (object *op, object *top)	1107	merge_ob (object *op, object *top)
1177	{	1108	{
1178	if (!op->nrof)	1109	if (!op->nrof)
1179	return 0;	1110	return 0;
1180		1111
1181	if (top == NULL)	1112	if (top)
1182	for (top = op; top != NULL && top->above != NULL; top = top->above);	1113	for (top = op; top && top->above; top = top->above)
		1114	;
1183		1115
1184	for (; top != NULL; top = top->below)	1116	for (; top; top = top->below)
1185	{	1117	{
1186	if (top == op)	1118	if (top == op)
1187	continue;	1119	continue;
1188		1120
1189	if (object::can_merge (op, top))	1121	if (object::can_merge (op, top))
…		…
1205	* job preparing multi-part monsters	1137	* job preparing multi-part monsters
1206	*/	1138	*/
1207	object *	1139	object *
1208	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1140	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1209	{	1141	{
1210	object *tmp;
1211
1212	if (op->head)
1213	op = op->head;
1214
1215	for (tmp = op; tmp; tmp = tmp->more)	1142	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1216	{	1143	{
1217	tmp->x = x + tmp->arch->clone.x;	1144	tmp->x = x + tmp->arch->clone.x;
1218	tmp->y = y + tmp->arch->clone.y;	1145	tmp->y = y + tmp->arch->clone.y;
1219	}	1146	}
1220		1147
…		…
1239	* Return value:	1166	* Return value:
1240	* new object if 'op' was merged with other object	1167	* new object if 'op' was merged with other object
1241	* NULL if 'op' was destroyed	1168	* NULL if 'op' was destroyed
1242	* just 'op' otherwise	1169	* just 'op' otherwise
1243	*/	1170	*/
1244
1245	object *	1171	object *
1246	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1172	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1247	{	1173	{
1248	object *tmp, *top, *floor = NULL;	1174	object *tmp, *top, *floor = NULL;
1249	sint16 x, y;	1175	sint16 x, y;
…		…
1252	{	1178	{
1253	LOG (llevError, "Trying to insert freed object!\n");	1179	LOG (llevError, "Trying to insert freed object!\n");
1254	return NULL;	1180	return NULL;
1255	}	1181	}
1256		1182
1257	if (m == NULL)	1183	if (!m)
1258	{	1184	{
1259	char *dump = dump_object (op);	1185	char *dump = dump_object (op);
1260	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1186	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1261	free (dump);	1187	free (dump);
1262	return op;	1188	return op;
…		…
1283	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);	1209	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1284	free (dump);	1210	free (dump);
1285	return op;	1211	return op;
1286	}	1212	}
1287		1213
1288	if (op->more != NULL)	1214	if (op->more)
1289	{	1215	{
1290	/* The part may be on a different map. */	1216	/* The part may be on a different map. */
1291		1217
1292	object *more = op->more;	1218	object *more = op->more;
1293		1219
1294	/* We really need the caller to normalize coordinates - if	1220	/* We really need the caller to normalise coordinates - if
1295	* we set the map, that doesn't work if the location is within	1221	* we set the map, that doesn't work if the location is within
1296	* a map and this is straddling an edge. So only if coordinate	1222	* a map and this is straddling an edge. So only if coordinate
1297	* is clear wrong do we normalize it.	1223	* is clear wrong do we normalise it.
1298	*/	1224	*/
1299	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))	1225	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1300	more->map = get_map_from_coord (m, &more->x, &more->y);	1226	more->map = get_map_from_coord (m, &more->x, &more->y);
1301	else if (!more->map)	1227	else if (!more->map)
1302	{	1228	{
…		…
1309	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1235	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1310	{	1236	{
1311	if (!op->head)	1237	if (!op->head)
1312	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1238	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1313		1239
1314	return NULL;	1240	return 0;
1315	}	1241	}
1316	}	1242	}
1317		1243
1318	CLEAR_FLAG (op, FLAG_REMOVED);	1244	CLEAR_FLAG (op, FLAG_REMOVED);
1319		1245
…		…
1326	y = op->y;	1252	y = op->y;
1327		1253
1328	/* this has to be done after we translate the coordinates.	1254	/* this has to be done after we translate the coordinates.
1329	*/	1255	*/
1330	if (op->nrof && !(flag & INS_NO_MERGE))	1256	if (op->nrof && !(flag & INS_NO_MERGE))
1331	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1257	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)
1332	if (object::can_merge (op, tmp))	1258	if (object::can_merge (op, tmp))
1333	{	1259	{
1334	op->nrof += tmp->nrof;	1260	op->nrof += tmp->nrof;
1335	tmp->destroy ();	1261	tmp->destroy ();
1336	}	1262	}
…		…
1353	op->below = originator->below;	1279	op->below = originator->below;
1354		1280
1355	if (op->below)	1281	if (op->below)
1356	op->below->above = op;	1282	op->below->above = op;
1357	else	1283	else
1358	SET_MAP_OB (op->map, op->x, op->y, op);	1284	op->ms ().bot = op;
1359		1285
1360	/* since *below* originator, no need to update top */	1286	/* since *below* originator, no need to update top */
1361	originator->below = op;	1287	originator->below = op;
1362	}	1288	}
1363	else	1289	else
1364	{	1290	{
1365	/* If there are other objects, then */	1291	/* If there are other objects, then */
1366	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1292	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))
1367	{	1293	{
1368	object *last = NULL;	1294	object *last = 0;
1369		1295
1370	/*	1296	/*
1371	* If there are multiple objects on this space, we do some trickier handling.	1297	* If there are multiple objects on this space, we do some trickier handling.
1372	* We've already dealt with merging if appropriate.	1298	* We've already dealt with merging if appropriate.
1373	* Generally, we want to put the new object on top. But if	1299	* Generally, we want to put the new object on top. But if
…		…
1377	* once we get to them. This reduces the need to traverse over all of	1303	* once we get to them. This reduces the need to traverse over all of
1378	* them when adding another one - this saves quite a bit of cpu time	1304	* them when adding another one - this saves quite a bit of cpu time
1379	* when lots of spells are cast in one area. Currently, it is presumed	1305	* when lots of spells are cast in one area. Currently, it is presumed
1380	* that flying non pickable objects are spell objects.	1306	* that flying non pickable objects are spell objects.
1381	*/	1307	*/
1382
1383	while (top != NULL)	1308	while (top)
1384	{	1309	{
1385	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1310	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1386	floor = top;	1311	floor = top;
1387		1312
1388	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1313	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1409	* If INS_ON_TOP is used, don't do this processing	1334	* If INS_ON_TOP is used, don't do this processing
1410	* Need to find the object that in fact blocks view, otherwise	1335	* Need to find the object that in fact blocks view, otherwise
1411	* stacking is a bit odd.	1336	* stacking is a bit odd.
1412	*/	1337	*/
1413	if (!(flag & INS_ON_TOP) &&	1338	if (!(flag & INS_ON_TOP) &&
1414	(get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1339	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))
1415	{	1340	{
1416	for (last = top; last != floor; last = last->below)	1341	for (last = top; last != floor; last = last->below)
1417	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1342	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1418	break;	1343	break;
1419	/* Check to see if we found the object that blocks view,	1344	/* Check to see if we found the object that blocks view,
…		…
1441	op->above = GET_MAP_OB (op->map, op->x, op->y);	1366	op->above = GET_MAP_OB (op->map, op->x, op->y);
1442		1367
1443	if (op->above)	1368	if (op->above)
1444	op->above->below = op;	1369	op->above->below = op;
1445		1370
1446	op->below = NULL;	1371	op->below = 0;
1447	SET_MAP_OB (op->map, op->x, op->y, op);	1372	op->ms ().bot = op;
1448	}	1373	}
1449	else	1374	else
1450	{ /* get inserted into the stack above top */	1375	{ /* get inserted into the stack above top */
1451	op->above = top->above;	1376	op->above = top->above;
1452		1377
…		…
1455		1380
1456	op->below = top;	1381	op->below = top;
1457	top->above = op;	1382	top->above = op;
1458	}	1383	}
1459		1384
1460	if (op->above == NULL)	1385	if (!op->above)
1461	SET_MAP_TOP (op->map, op->x, op->y, op);	1386	op->ms ().top = op;
1462	} /* else not INS_BELOW_ORIGINATOR */	1387	} /* else not INS_BELOW_ORIGINATOR */
1463		1388
1464	if (op->type == PLAYER)	1389	if (op->type == PLAYER)
		1390	{
1465	op->contr->do_los = 1;	1391	op->contr->do_los = 1;
		1392	++op->map->players;
		1393	op->map->touch ();
		1394	}
		1395
		1396	op->map->dirty = true;
1466		1397
1467	/* If we have a floor, we know the player, if any, will be above	1398	/* If we have a floor, we know the player, if any, will be above
1468	* it, so save a few ticks and start from there.	1399	* it, so save a few ticks and start from there.
1469	*/	1400	*/
1470	if (!(flag & INS_MAP_LOAD))	1401	if (!(flag & INS_MAP_LOAD))
1471	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1402	if (object *pl = op->ms ().player ())
1472	if (tmp->type == PLAYER)	1403	if (pl->contr->ns)
1473	tmp->contr->socket->floorbox_update ();	1404	pl->contr->ns->floorbox_update ();
1474		1405
1475	/* If this object glows, it may affect lighting conditions that are	1406	/* If this object glows, it may affect lighting conditions that are
1476	* visible to others on this map. But update_all_los is really	1407	* visible to others on this map. But update_all_los is really
1477	* an inefficient way to do this, as it means los for all players	1408	* an inefficient way to do this, as it means los for all players
1478	* on the map will get recalculated. The players could very well	1409	* on the map will get recalculated. The players could very well
1479	* be far away from this change and not affected in any way -	1410	* be far away from this change and not affected in any way -
1480	* this should get redone to only look for players within range,	1411	* this should get redone to only look for players within range,
1481	* or just updating the P_NEED_UPDATE for spaces within this area	1412	* or just updating the P_UPTODATE for spaces within this area
1482	* of effect may be sufficient.	1413	* of effect may be sufficient.
1483	*/	1414	*/
1484	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1415	if (op->map->darkness && (op->glow_radius != 0))
1485	update_all_los (op->map, op->x, op->y);	1416	update_all_los (op->map, op->x, op->y);
1486		1417
1487	/* updates flags (blocked, alive, no magic, etc) for this map space */	1418	/* updates flags (blocked, alive, no magic, etc) for this map space */
1488	update_object (op, UP_OBJ_INSERT);	1419	update_object (op, UP_OBJ_INSERT);
		1420
		1421	INVOKE_OBJECT (INSERT, op);
1489		1422
1490	/* Don't know if moving this to the end will break anything. However,	1423	/* Don't know if moving this to the end will break anything. However,
1491	* we want to have floorbox_update called before calling this.	1424	* we want to have floorbox_update called before calling this.
1492	*	1425	*
1493	* check_move_on() must be after this because code called from	1426	* check_move_on() must be after this because code called from
…		…
1498		1431
1499	/* if this is not the head or flag has been passed, don't check walk on status */	1432	/* if this is not the head or flag has been passed, don't check walk on status */
1500	if (!(flag & INS_NO_WALK_ON) && !op->head)	1433	if (!(flag & INS_NO_WALK_ON) && !op->head)
1501	{	1434	{
1502	if (check_move_on (op, originator))	1435	if (check_move_on (op, originator))
1503	return NULL;	1436	return 0;
1504		1437
1505	/* If we are a multi part object, lets work our way through the check	1438	/* If we are a multi part object, lets work our way through the check
1506	* walk on's.	1439	* walk on's.
1507	*/	1440	*/
1508	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1441	for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1509	if (check_move_on (tmp, originator))	1442	if (check_move_on (tmp, originator))
1510	return NULL;	1443	return 0;
1511	}	1444	}
1512		1445
1513	return op;	1446	return op;
1514	}	1447	}
1515		1448
1516	/* this function inserts an object in the map, but if it	1449	/* this function inserts an object in the map, but if it
1517	* finds an object of its own type, it'll remove that one first.	1450	* finds an object of its own type, it'll remove that one first.
1518	* op is the object to insert it under: supplies x and the map.	1451	* op is the object to insert it under: supplies x and the map.
1519	*/	1452	*/
1520	void	1453	void
1521	replace_insert_ob_in_map (const char *arch_string, object *op)	1454	replace_insert_ob_in_map (const char *arch_string, object *op)
1522	{	1455	{
1523	object *	1456	object *tmp, *tmp1;
1524	tmp;
1525	object *
1526	tmp1;
1527		1457
1528	/* first search for itself and remove any old instances */	1458	/* first search for itself and remove any old instances */
1529		1459
1530	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1460	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1531	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1461	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1532	tmp->destroy ();	1462	tmp->destroy ();
1533		1463
1534	tmp1 = arch_to_object (archetype::find (arch_string));	1464	tmp1 = arch_to_object (archetype::find (arch_string));
1535		1465
1536	tmp1->x = op->x;	1466	tmp1->x = op->x;
1537	tmp1->y = op->y;	1467	tmp1->y = op->y;
1538	insert_ob_in_map (tmp1, op->map, op, 0);	1468	insert_ob_in_map (tmp1, op->map, op, 0);
		1469	}
		1470
		1471	object *
		1472	object::insert_at (object *where, object *originator, int flags)
		1473	{
		1474	where->map->insert (this, where->x, where->y, originator, flags);
1539	}	1475	}
1540		1476
1541	/*	1477	/*
1542	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1478	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1543	* is returned contains nr objects, and the remaining parts contains	1479	* is returned contains nr objects, and the remaining parts contains
1544	* the rest (or is removed and freed if that number is 0).	1480	* the rest (or is removed and freed if that number is 0).
1545	* On failure, NULL is returned, and the reason put into the	1481	* On failure, NULL is returned, and the reason put into the
1546	* global static errmsg array.	1482	* global static errmsg array.
1547	*/	1483	*/
1548
1549	object *	1484	object *
1550	get_split_ob (object *orig_ob, uint32 nr)	1485	get_split_ob (object *orig_ob, uint32 nr)
1551	{	1486	{
1552	object *newob;	1487	object *newob;
1553	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1488	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1589		1524
1590	object *	1525	object *
1591	decrease_ob_nr (object *op, uint32 i)	1526	decrease_ob_nr (object *op, uint32 i)
1592	{	1527	{
1593	object *tmp;	1528	object *tmp;
1594	player *pl;
1595		1529
1596	if (i == 0) /* objects with op->nrof require this check */	1530	if (i == 0) /* objects with op->nrof require this check */
1597	return op;	1531	return op;
1598		1532
1599	if (i > op->nrof)	1533	if (i > op->nrof)
…		…
1612	* IMO, searching through all the players will mostly	1546	* IMO, searching through all the players will mostly
1613	* likely be quicker than following op->env to the map,	1547	* likely be quicker than following op->env to the map,
1614	* and then searching the map for a player.	1548	* and then searching the map for a player.
1615	*/	1549	*/
1616	if (!tmp)	1550	if (!tmp)
1617	{	1551	for_all_players (pl)
1618	for (pl = first_player; pl; pl = pl->next)
1619	if (pl->ob->container == op->env)	1552	if (pl->ob->container == op->env)
1620	{	1553	{
1621	tmp = pl->ob;	1554	tmp = pl->ob;
1622	break;	1555	break;
1623	}	1556	}
1624	}
1625		1557
1626	if (i < op->nrof)	1558	if (i < op->nrof)
1627	{	1559	{
1628	sub_weight (op->env, op->weight * i);	1560	sub_weight (op->env, op->weight * i);
1629	op->nrof -= i;	1561	op->nrof -= i;
…		…
1765	add_weight (this, (op->weight + op->carrying));	1697	add_weight (this, (op->weight + op->carrying));
1766		1698
1767	otmp = this->in_player ();	1699	otmp = this->in_player ();
1768	if (otmp && otmp->contr)	1700	if (otmp && otmp->contr)
1769	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1701	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1770	fix_player (otmp);	1702	otmp->update_stats ();
1771		1703
1772	op->map = 0;	1704	op->map = 0;
1773	op->env = this;	1705	op->env = this;
1774	op->above = 0;	1706	op->above = 0;
1775	op->below = 0;	1707	op->below = 0;
…		…
1779	if ((op->glow_radius != 0) && map)	1711	if ((op->glow_radius != 0) && map)
1780	{	1712	{
1781	#ifdef DEBUG_LIGHTS	1713	#ifdef DEBUG_LIGHTS
1782	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1714	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1783	#endif /* DEBUG_LIGHTS */	1715	#endif /* DEBUG_LIGHTS */
1784	if (MAP_DARKNESS (map))	1716	if (map->darkness)
1785	update_all_los (map, x, y);	1717	update_all_los (map, x, y);
1786	}	1718	}
1787		1719
1788	/* Client has no idea of ordering so lets not bother ordering it here.	1720	/* Client has no idea of ordering so lets not bother ordering it here.
1789	* It sure simplifies this function...	1721	* It sure simplifies this function...
…		…
1794	{	1726	{
1795	op->below = inv;	1727	op->below = inv;
1796	op->below->above = op;	1728	op->below->above = op;
1797	inv = op;	1729	inv = op;
1798	}	1730	}
		1731
		1732	INVOKE_OBJECT (INSERT, this);
1799		1733
1800	return op;	1734	return op;
1801	}	1735	}
1802		1736
1803	/*	1737	/*
…		…
1818	*	1752	*
1819	* MSW 2001-07-08: Check all objects on space, not just those below	1753	* MSW 2001-07-08: Check all objects on space, not just those below
1820	* object being inserted. insert_ob_in_map may not put new objects	1754	* object being inserted. insert_ob_in_map may not put new objects
1821	* on top.	1755	* on top.
1822	*/	1756	*/
1823
1824	int	1757	int
1825	check_move_on (object *op, object *originator)	1758	check_move_on (object *op, object *originator)
1826	{	1759	{
1827	object *tmp;	1760	object *tmp;
1828	maptile *m = op->map;	1761	maptile *m = op->map;
…		…
1855		1788
1856	/* The objects have to be checked from top to bottom.	1789	/* The objects have to be checked from top to bottom.
1857	* Hence, we first go to the top:	1790	* Hence, we first go to the top:
1858	*/	1791	*/
1859		1792
1860	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1793	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1861	{	1794	{
1862	/* Trim the search when we find the first other spell effect	1795	/* Trim the search when we find the first other spell effect
1863	* this helps performance so that if a space has 50 spell objects,	1796	* this helps performance so that if a space has 50 spell objects,
1864	* we don't need to check all of them.	1797	* we don't need to check all of them.
1865	*/	1798	*/
…		…
1920	/*	1853	/*
1921	* present_arch(arch, map, x, y) searches for any objects with	1854	* present_arch(arch, map, x, y) searches for any objects with
1922	* a matching archetype at the given map and coordinates.	1855	* a matching archetype at the given map and coordinates.
1923	* The first matching object is returned, or NULL if none.	1856	* The first matching object is returned, or NULL if none.
1924	*/	1857	*/
1925
1926	object *	1858	object *
1927	present_arch (const archetype *at, maptile *m, int x, int y)	1859	present_arch (const archetype *at, maptile *m, int x, int y)
1928	{	1860	{
1929	object *
1930	tmp;
1931
1932	if (m == NULL || out_of_map (m, x, y))	1861	if (!m || out_of_map (m, x, y))
1933	{	1862	{
1934	LOG (llevError, "Present_arch called outside map.\n");	1863	LOG (llevError, "Present_arch called outside map.\n");
1935	return NULL;	1864	return NULL;
1936	}	1865	}
1937	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1866
		1867	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1938	if (tmp->arch == at)	1868	if (tmp->arch == at)
1939	return tmp;	1869	return tmp;
		1870
1940	return NULL;	1871	return NULL;
1941	}	1872	}
1942		1873
1943	/*	1874	/*
1944	* present(type, map, x, y) searches for any objects with	1875	* present(type, map, x, y) searches for any objects with
1945	* a matching type variable at the given map and coordinates.	1876	* a matching type variable at the given map and coordinates.
1946	* The first matching object is returned, or NULL if none.	1877	* The first matching object is returned, or NULL if none.
1947	*/	1878	*/
1948
1949	object *	1879	object *
1950	present (unsigned char type, maptile *m, int x, int y)	1880	present (unsigned char type, maptile *m, int x, int y)
1951	{	1881	{
1952	object *
1953	tmp;
1954
1955	if (out_of_map (m, x, y))	1882	if (out_of_map (m, x, y))
1956	{	1883	{
1957	LOG (llevError, "Present called outside map.\n");	1884	LOG (llevError, "Present called outside map.\n");
1958	return NULL;	1885	return NULL;
1959	}	1886	}
1960	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1887
		1888	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1961	if (tmp->type == type)	1889	if (tmp->type == type)
1962	return tmp;	1890	return tmp;
		1891
1963	return NULL;	1892	return NULL;
1964	}	1893	}
1965		1894
1966	/*	1895	/*
1967	* present_in_ob(type, object) searches for any objects with	1896	* present_in_ob(type, object) searches for any objects with
1968	* a matching type variable in the inventory of the given object.	1897	* a matching type variable in the inventory of the given object.
1969	* The first matching object is returned, or NULL if none.	1898	* The first matching object is returned, or NULL if none.
1970	*/	1899	*/
1971
1972	object *	1900	object *
1973	present_in_ob (unsigned char type, const object *op)	1901	present_in_ob (unsigned char type, const object *op)
1974	{	1902	{
1975	object *
1976	tmp;
1977
1978	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1903	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1979	if (tmp->type == type)	1904	if (tmp->type == type)
1980	return tmp;	1905	return tmp;
		1906
1981	return NULL;	1907	return NULL;
1982	}	1908	}
1983		1909
1984	/*	1910	/*
1985	* present_in_ob (type, str, object) searches for any objects with	1911	* present_in_ob (type, str, object) searches for any objects with
…		…
1993	* str is the string to match against. Note that we match against	1919	* str is the string to match against. Note that we match against
1994	* the object name, not the archetype name. this is so that the	1920	* the object name, not the archetype name. this is so that the
1995	* spell code can use one object type (force), but change it's name	1921	* spell code can use one object type (force), but change it's name
1996	* to be unique.	1922	* to be unique.
1997	*/	1923	*/
1998
1999	object *	1924	object *
2000	present_in_ob_by_name (int type, const char *str, const object *op)	1925	present_in_ob_by_name (int type, const char *str, const object *op)
2001	{	1926	{
2002	object *
2003	tmp;
2004
2005	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1927	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2006	{
2007	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1928	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2008	return tmp;	1929	return tmp;
2009	}	1930
2010	return NULL;	1931	return 0;
2011	}	1932	}
2012		1933
2013	/*	1934	/*
2014	* present_arch_in_ob(archetype, object) searches for any objects with	1935	* present_arch_in_ob(archetype, object) searches for any objects with
2015	* a matching archetype in the inventory of the given object.	1936	* a matching archetype in the inventory of the given object.
2016	* The first matching object is returned, or NULL if none.	1937	* The first matching object is returned, or NULL if none.
2017	*/	1938	*/
2018
2019	object *	1939	object *
2020	present_arch_in_ob (const archetype *at, const object *op)	1940	present_arch_in_ob (const archetype *at, const object *op)
2021	{	1941	{
2022	object *
2023	tmp;
2024
2025	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1942	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2026	if (tmp->arch == at)	1943	if (tmp->arch == at)
2027	return tmp;	1944	return tmp;
		1945
2028	return NULL;	1946	return NULL;
2029	}	1947	}
2030		1948
2031	/*	1949	/*
2032	* activate recursively a flag on an object inventory	1950	* activate recursively a flag on an object inventory
2033	*/	1951	*/
2034	void	1952	void
2035	flag_inv (object *op, int flag)	1953	flag_inv (object *op, int flag)
2036	{	1954	{
2037	object *
2038	tmp;
2039
2040	if (op->inv)	1955	if (op->inv)
2041	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1956	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2042	{	1957	{
2043	SET_FLAG (tmp, flag);	1958	SET_FLAG (tmp, flag);
2044	flag_inv (tmp, flag);	1959	flag_inv (tmp, flag);
2045	}	1960	}
2046	} /*	1961	}
		1962
		1963	/*
2047	* desactivate recursively a flag on an object inventory	1964	* deactivate recursively a flag on an object inventory
2048	*/	1965	*/
2049	void	1966	void
2050	unflag_inv (object *op, int flag)	1967	unflag_inv (object *op, int flag)
2051	{	1968	{
2052	object *
2053	tmp;
2054
2055	if (op->inv)	1969	if (op->inv)
2056	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1970	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2057	{	1971	{
2058	CLEAR_FLAG (tmp, flag);	1972	CLEAR_FLAG (tmp, flag);
2059	unflag_inv (tmp, flag);	1973	unflag_inv (tmp, flag);
2060	}	1974	}
2061	}	1975	}
…		…
2064	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in	1978	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2065	* all it's inventory (recursively).	1979	* all it's inventory (recursively).
2066	* If checksums are used, a player will get set_cheat called for	1980	* If checksums are used, a player will get set_cheat called for
2067	* him/her-self and all object carried by a call to this function.	1981	* him/her-self and all object carried by a call to this function.
2068	*/	1982	*/
2069
2070	void	1983	void
2071	set_cheat (object *op)	1984	set_cheat (object *op)
2072	{	1985	{
2073	SET_FLAG (op, FLAG_WAS_WIZ);	1986	SET_FLAG (op, FLAG_WAS_WIZ);
2074	flag_inv (op, FLAG_WAS_WIZ);	1987	flag_inv (op, FLAG_WAS_WIZ);
…		…
2093	* because arch_blocked (now ob_blocked) needs to know the movement type	2006	* because arch_blocked (now ob_blocked) needs to know the movement type
2094	* to know if the space in question will block the object. We can't use	2007	* to know if the space in question will block the object. We can't use
2095	* the archetype because that isn't correct if the monster has been	2008	* the archetype because that isn't correct if the monster has been
2096	* customized, changed states, etc.	2009	* customized, changed states, etc.
2097	*/	2010	*/
2098
2099	int	2011	int
2100	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	2012	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2101	{	2013	{
2102	int
2103	i,
2104	index = 0, flag;	2014	int index = 0, flag;
2105	static int
2106	altern[SIZEOFFREE];	2015	int altern[SIZEOFFREE];
2107		2016
2108	for (i = start; i < stop; i++)	2017	for (int i = start; i < stop; i++)
2109	{	2018	{
2110	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2019	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2111	if (!flag)	2020	if (!flag)
2112	altern[index++] = i;	2021	altern [index++] = i;
2113		2022
2114	/* Basically, if we find a wall on a space, we cut down the search size.	2023	/* Basically, if we find a wall on a space, we cut down the search size.
2115	* In this way, we won't return spaces that are on another side of a wall.	2024	* In this way, we won't return spaces that are on another side of a wall.
2116	* This mostly work, but it cuts down the search size in all directions -	2025	* This mostly work, but it cuts down the search size in all directions -
2117	* if the space being examined only has a wall to the north and empty	2026	* if the space being examined only has a wall to the north and empty
…		…
2133	* find_first_free_spot(archetype, maptile, x, y) works like	2042	* find_first_free_spot(archetype, maptile, x, y) works like
2134	* find_free_spot(), but it will search max number of squares.	2043	* find_free_spot(), but it will search max number of squares.
2135	* But it will return the first available spot, not a random choice.	2044	* But it will return the first available spot, not a random choice.
2136	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2045	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2137	*/	2046	*/
2138
2139	int	2047	int
2140	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2048	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2141	{	2049	{
2142	int
2143	i;
2144
2145	for (i = 0; i < SIZEOFFREE; i++)	2050	for (int i = 0; i < SIZEOFFREE; i++)
2146	{
2147	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2051	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2148	return i;	2052	return i;
2149	}	2053
2150	return -1;	2054	return -1;
2151	}	2055	}
2152		2056
2153	/*	2057	/*
2154	* The function permute(arr, begin, end) randomly reorders the array	2058	* The function permute(arr, begin, end) randomly reorders the array
2155	* arr[begin..end-1].	2059	* arr[begin..end-1].
		2060	* now uses a fisher-yates shuffle, old permute was broken
2156	*/	2061	*/
2157	static void	2062	static void
2158	permute (int *arr, int begin, int end)	2063	permute (int *arr, int begin, int end)
2159	{	2064	{
2160	int	2065	arr += begin;
2161	i,
2162	j,
2163	tmp,
2164	len;
2165
2166	len = end - begin;	2066	end -= begin;
2167	for (i = begin; i < end; i++)
2168	{
2169	j = begin + RANDOM () % len;
2170		2067
2171	tmp = arr[i];	2068	while (--end)
2172	arr[i] = arr[j];	2069	swap (arr [end], arr [RANDOM () % (end + 1)]);
2173	arr[j] = tmp;
2174	}
2175	}	2070	}
2176		2071
2177	/* new function to make monster searching more efficient, and effective!	2072	/* new function to make monster searching more efficient, and effective!
2178	* This basically returns a randomized array (in the passed pointer) of	2073	* This basically returns a randomized array (in the passed pointer) of
2179	* the spaces to find monsters. In this way, it won't always look for	2074	* the spaces to find monsters. In this way, it won't always look for
…		…
2182	* the 3x3 area will be searched, just not in a predictable order.	2077	* the 3x3 area will be searched, just not in a predictable order.
2183	*/	2078	*/
2184	void	2079	void
2185	get_search_arr (int *search_arr)	2080	get_search_arr (int *search_arr)
2186	{	2081	{
2187	int	2082	int i;
2188	i;
2189		2083
2190	for (i = 0; i < SIZEOFFREE; i++)	2084	for (i = 0; i < SIZEOFFREE; i++)
2191	{
2192	search_arr[i] = i;	2085	search_arr[i] = i;
2193	}
2194		2086
2195	permute (search_arr, 1, SIZEOFFREE1 + 1);	2087	permute (search_arr, 1, SIZEOFFREE1 + 1);
2196	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2088	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2197	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2089	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2198	}	2090	}
…		…
2207	* Perhaps incorrectly, but I'm making the assumption that exclude	2099	* Perhaps incorrectly, but I'm making the assumption that exclude
2208	* is actually want is going to try and move there. We need this info	2100	* is actually want is going to try and move there. We need this info
2209	* because we have to know what movement the thing looking to move	2101	* because we have to know what movement the thing looking to move
2210	* there is capable of.	2102	* there is capable of.
2211	*/	2103	*/
2212
2213	int	2104	int
2214	find_dir (maptile *m, int x, int y, object *exclude)	2105	find_dir (maptile *m, int x, int y, object *exclude)
2215	{	2106	{
2216	int
2217	i,
2218	max = SIZEOFFREE, mflags;	2107	int i, max = SIZEOFFREE, mflags;
2219		2108
2220	sint16 nx, ny;	2109	sint16 nx, ny;
2221	object *	2110	object *tmp;
2222	tmp;
2223	maptile *	2111	maptile *mp;
2224	mp;
2225		2112
2226	MoveType blocked, move_type;	2113	MoveType blocked, move_type;
2227		2114
2228	if (exclude && exclude->head)	2115	if (exclude && exclude->head)
2229	{	2116	{
…		…
2241	mp = m;	2128	mp = m;
2242	nx = x + freearr_x[i];	2129	nx = x + freearr_x[i];
2243	ny = y + freearr_y[i];	2130	ny = y + freearr_y[i];
2244		2131
2245	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2132	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
		2133
2246	if (mflags & P_OUT_OF_MAP)	2134	if (mflags & P_OUT_OF_MAP)
2247	{
2248	max = maxfree[i];	2135	max = maxfree[i];
2249	}
2250	else	2136	else
2251	{	2137	{
2252	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2138	mapspace &ms = mp->at (nx, ny);
		2139
		2140	blocked = ms.move_block;
2253		2141
2254	if ((move_type & blocked) == move_type)	2142	if ((move_type & blocked) == move_type)
2255	{
2256	max = maxfree[i];	2143	max = maxfree[i];
2257	}
2258	else if (mflags & P_IS_ALIVE)	2144	else if (mflags & P_IS_ALIVE)
2259	{	2145	{
2260	for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)	2146	for (tmp = ms.bot; tmp; tmp = tmp->above)
2261	{	2147	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2262	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2148	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))
2263	{
2264	break;	2149	break;
2265	}	2150
2266	}
2267	if (tmp)	2151	if (tmp)
2268	{
2269	return freedir[i];	2152	return freedir[i];
2270	}
2271	}	2153	}
2272	}	2154	}
2273	}	2155	}
		2156
2274	return 0;	2157	return 0;
2275	}	2158	}
2276		2159
2277	/*	2160	/*
2278	* distance(object 1, object 2) will return the square of the	2161	* distance(object 1, object 2) will return the square of the
2279	* distance between the two given objects.	2162	* distance between the two given objects.
2280	*/	2163	*/
2281
2282	int	2164	int
2283	distance (const object *ob1, const object *ob2)	2165	distance (const object *ob1, const object *ob2)
2284	{	2166	{
2285	int
2286	i;
2287
2288	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2167	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2289	return i;
2290	}	2168	}
2291		2169
2292	/*	2170	/*
2293	* find_dir_2(delta-x,delta-y) will return a direction in which	2171	* find_dir_2(delta-x,delta-y) will return a direction in which
2294	* an object which has subtracted the x and y coordinates of another	2172	* an object which has subtracted the x and y coordinates of another
2295	* object, needs to travel toward it.	2173	* object, needs to travel toward it.
2296	*/	2174	*/
2297
2298	int	2175	int
2299	find_dir_2 (int x, int y)	2176	find_dir_2 (int x, int y)
2300	{	2177	{
2301	int	2178	int q;
2302	q;
2303		2179
2304	if (y)	2180	if (y)
2305	q = x * 100 / y;	2181	q = x * 100 / y;
2306	else if (x)	2182	else if (x)
2307	q = -300 * x;	2183	q = -300 * x;
…		…
2342	int	2218	int
2343	absdir (int d)	2219	absdir (int d)
2344	{	2220	{
2345	while (d < 1)	2221	while (d < 1)
2346	d += 8;	2222	d += 8;
		2223
2347	while (d > 8)	2224	while (d > 8)
2348	d -= 8;	2225	d -= 8;
		2226
2349	return d;	2227	return d;
2350	}	2228	}
2351		2229
2352	/*	2230	/*
2353	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2231	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
…		…
2355	*/	2233	*/
2356		2234
2357	int	2235	int
2358	dirdiff (int dir1, int dir2)	2236	dirdiff (int dir1, int dir2)
2359	{	2237	{
2360	int	2238	int d;
2361	d;
2362		2239
2363	d = abs (dir1 - dir2);	2240	d = abs (dir1 - dir2);
2364	if (d > 4)	2241	if (d > 4)
2365	d = 8 - d;	2242	d = 8 - d;
		2243
2366	return d;	2244	return d;
2367	}	2245	}
2368		2246
2369	/* peterm:	2247	/* peterm:
2370	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2248	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2373	* This basically means that if direction is 15, then it could either go	2251	* This basically means that if direction is 15, then it could either go
2374	* direction 4, 14, or 16 to get back to where we are.	2252	* direction 4, 14, or 16 to get back to where we are.
2375	* Moved from spell_util.c to object.c with the other related direction	2253	* Moved from spell_util.c to object.c with the other related direction
2376	* functions.	2254	* functions.
2377	*/	2255	*/
2378
2379	int
2380	reduction_dir[SIZEOFFREE][3] = {	2256	int reduction_dir[SIZEOFFREE][3] = {
2381	{0, 0, 0}, /* 0 */	2257	{0, 0, 0}, /* 0 */
2382	{0, 0, 0}, /* 1 */	2258	{0, 0, 0}, /* 1 */
2383	{0, 0, 0}, /* 2 */	2259	{0, 0, 0}, /* 2 */
2384	{0, 0, 0}, /* 3 */	2260	{0, 0, 0}, /* 3 */
2385	{0, 0, 0}, /* 4 */	2261	{0, 0, 0}, /* 4 */
…		…
2433	* find a path to that monster that we found. If not,	2309	* find a path to that monster that we found. If not,
2434	* we don't bother going toward it. Returns 1 if we	2310	* we don't bother going toward it. Returns 1 if we
2435	* can see a direct way to get it	2311	* can see a direct way to get it
2436	* Modified to be map tile aware -.MSW	2312	* Modified to be map tile aware -.MSW
2437	*/	2313	*/
2438
2439
2440	int	2314	int
2441	can_see_monsterP (maptile *m, int x, int y, int dir)	2315	can_see_monsterP (maptile *m, int x, int y, int dir)
2442	{	2316	{
2443	sint16 dx, dy;	2317	sint16 dx, dy;
2444	int
2445	mflags;	2318	int mflags;
2446		2319
2447	if (dir < 0)	2320	if (dir < 0)
2448	return 0; /* exit condition: invalid direction */	2321	return 0; /* exit condition: invalid direction */
2449		2322
2450	dx = x + freearr_x[dir];	2323	dx = x + freearr_x[dir];
…		…
2463	return 0;	2336	return 0;
2464		2337
2465	/* yes, can see. */	2338	/* yes, can see. */
2466	if (dir < 9)	2339	if (dir < 9)
2467	return 1;	2340	return 1;
		2341
2468	return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |	2342	return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2469	can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);	2343	| can_see_monsterP (m, x, y, reduction_dir[dir][1])
		2344	| can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2470	}	2345	}
2471
2472
2473		2346
2474	/*	2347	/*
2475	* can_pick(picker, item): finds out if an object is possible to be	2348	* can_pick(picker, item): finds out if an object is possible to be
2476	* picked up by the picker. Returnes 1 if it can be	2349	* picked up by the picker. Returnes 1 if it can be
2477	* picked up, otherwise 0.	2350	* picked up, otherwise 0.
…		…
2488	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2361	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2489	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2362	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2490	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2363	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2491	}	2364	}
2492		2365
2493
2494	/*	2366	/*
2495	* create clone from object to another	2367	* create clone from object to another
2496	*/	2368	*/
2497	object *	2369	object *
2498	object_create_clone (object *asrc)	2370	object_create_clone (object *asrc)
…		…
2517	{	2389	{
2518	dst = tmp;	2390	dst = tmp;
2519	tmp->head = 0;	2391	tmp->head = 0;
2520	}	2392	}
2521	else	2393	else
2522	{
2523	tmp->head = dst;	2394	tmp->head = dst;
2524	}
2525		2395
2526	tmp->more = 0;	2396	tmp->more = 0;
2527		2397
2528	if (prev)	2398	if (prev)
2529	prev->more = tmp;	2399	prev->more = tmp;
…		…
2541	/* Basically, we save the content of the string to a temp file, then call */	2411	/* Basically, we save the content of the string to a temp file, then call */
2542	/* load_object on it. I admit it is a highly inefficient way to make things, */	2412	/* load_object on it. I admit it is a highly inefficient way to make things, */
2543	/* but it was simple to make and allows reusing the load_object function. */	2413	/* but it was simple to make and allows reusing the load_object function. */
2544	/* Remember not to use load_object_str in a time-critical situation. */	2414	/* Remember not to use load_object_str in a time-critical situation. */
2545	/* Also remember that multiparts objects are not supported for now. */	2415	/* Also remember that multiparts objects are not supported for now. */
2546
2547	object *	2416	object *
2548	load_object_str (const char *obstr)	2417	load_object_str (const char *obstr)
2549	{	2418	{
2550	object *op;	2419	object *op;
2551	char filename[MAX_BUF];	2420	char filename[MAX_BUF];
…		…
2581	* returns NULL if no match.	2450	* returns NULL if no match.
2582	*/	2451	*/
2583	object *	2452	object *
2584	find_obj_by_type_subtype (const object *who, int type, int subtype)	2453	find_obj_by_type_subtype (const object *who, int type, int subtype)
2585	{	2454	{
2586	object *tmp;
2587
2588	for (tmp = who->inv; tmp; tmp = tmp->below)	2455	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2589	if (tmp->type == type && tmp->subtype == subtype)	2456	if (tmp->type == type && tmp->subtype == subtype)
2590	return tmp;	2457	return tmp;
2591		2458
2592	return NULL;	2459	return 0;
2593	}	2460	}
2594		2461
2595	/* If ob has a field named key, return the link from the list,	2462	/* If ob has a field named key, return the link from the list,
2596	* otherwise return NULL.	2463	* otherwise return NULL.
2597	*	2464	*
…		…
2599	* do the desired thing.	2466	* do the desired thing.
2600	*/	2467	*/
2601	key_value *	2468	key_value *
2602	get_ob_key_link (const object *ob, const char *key)	2469	get_ob_key_link (const object *ob, const char *key)
2603	{	2470	{
2604	key_value *link;
2605
2606	for (link = ob->key_values; link != NULL; link = link->next)	2471	for (key_value *link = ob->key_values; link; link = link->next)
2607	if (link->key == key)	2472	if (link->key == key)
2608	return link;	2473	return link;
2609		2474
2610	return NULL;	2475	return 0;
2611	}	2476	}
2612		2477
2613	/*	2478	/*
2614	* Returns the value of op has an extra_field for key, or NULL.	2479	* Returns the value of op has an extra_field for key, or NULL.
2615	*	2480	*
…		…
2655	* Returns TRUE on success.	2520	* Returns TRUE on success.
2656	*/	2521	*/
2657	int	2522	int
2658	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2523	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2659	{	2524	{
2660	key_value *
2661	field = NULL, *last = NULL;	2525	key_value *field = NULL, *last = NULL;
2662		2526
2663	for (field = op->key_values; field != NULL; field = field->next)	2527	for (field = op->key_values; field != NULL; field = field->next)
2664	{	2528	{
2665	if (field->key != canonical_key)	2529	if (field->key != canonical_key)
2666	{	2530	{
…		…
2694	/* IF we get here, key doesn't exist */	2558	/* IF we get here, key doesn't exist */
2695		2559
2696	/* No field, we'll have to add it. */	2560	/* No field, we'll have to add it. */
2697		2561
2698	if (!add_key)	2562	if (!add_key)
2699	{
2700	return FALSE;	2563	return FALSE;
2701	}	2564
2702	/* There isn't any good reason to store a null	2565	/* There isn't any good reason to store a null
2703	* value in the key/value list. If the archetype has	2566	* value in the key/value list. If the archetype has
2704	* this key, then we should also have it, so shouldn't	2567	* this key, then we should also have it, so shouldn't
2705	* be here. If user wants to store empty strings,	2568	* be here. If user wants to store empty strings,
2706	* should pass in ""	2569	* should pass in ""
…		…
2755	}	2618	}
2756	else	2619	else
2757	item = item->env;	2620	item = item->env;
2758	}	2621	}
2759		2622
		2623
		2624	const char *
		2625	object::flag_desc (char *desc, int len) const
		2626	{
		2627	char *p = desc;
		2628	bool first = true;
		2629
		2630	*p = 0;
		2631
		2632	for (int i = 0; i < NUM_FLAGS; i++)
		2633	{
		2634	if (len <= 10) // magic constant!
		2635	{
		2636	snprintf (p, len, ",...");
		2637	break;
		2638	}
		2639
		2640	if (flag [i])
		2641	{
		2642	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2643	len -= cnt;
		2644	p += cnt;
		2645	first = false;
		2646	}
		2647	}
		2648
		2649	return desc;
		2650	}
		2651
2760	// return a suitable string describing an objetc in enough detail to find it	2652	// return a suitable string describing an object in enough detail to find it
2761	const char *	2653	const char *
2762	object::debug_desc (char *info) const	2654	object::debug_desc (char *info) const
2763	{	2655	{
		2656	char flagdesc[512];
2764	char info2[256 * 3];	2657	char info2[256 * 4];
2765	char *p = info;	2658	char *p = info;
2766		2659
2767	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2660	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",
2768	count,	2661	count, uuid.seq,
2769	&name,	2662	&name,
2770	title ? " " : "",	2663	title ? "\",title:" : "",
2771	title ? (const char *)title : "");	2664	title ? (const char *)title : "",
		2665	flag_desc (flagdesc, 512), type);
2772		2666
2773	if (env)	2667	if (env)
2774	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2668	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2775		2669
2776	if (map)	2670	if (map)
2777	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2671	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2778		2672
2779	return info;	2673	return info;
2780	}	2674	}
2781		2675
2782	const char *	2676	const char *
2783	object::debug_desc () const	2677	object::debug_desc () const
2784	{	2678	{
2785	static char info[256 * 3];	2679	static char info[256 * 4];
2786	return debug_desc (info);	2680	return debug_desc (info);
2787	}	2681	}
2788		2682

Diff Legend

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