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.73 by root, Wed Dec 20 01:19:11 2006 UTC vs.
Revision 1.137 by root, Mon Apr 16 06:23:40 2007 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* CrossFire, A Multiplayer game for X-windows
3		3	*
		4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (C) 2001 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (C) 1992 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* This program is free software; you can redistribute it and/or modify
8	it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation; either version 2 of the License, or
10	(at your option) any later version.	11	* (at your option) any later version.
11		12	*
12	This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
18	along with this program; if not, write to the Free Software	19	* along with this program; if not, write to the Free Software
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20		21	*
21	The authors can be reached via e-mail at <crossfire@schmorp.de>	22	* The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	23	*/
23		24
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying	26	sub/add_weight will transcend the environment updating the carrying
26	variable. */	27	variable. */
27	#include <global.h>	28	#include <global.h>
…		…
36		37
37	int nrofallocobjects = 0;	38	int nrofallocobjects = 0;
38	static UUID uuid;	39	static UUID uuid;
39	const uint64 UUID_SKIP = 1<<19;	40	const uint64 UUID_SKIP = 1<<19;
40		41
41	object *active_objects; /* List of active objects that need to be processed */	42	objectvec objects;
		43	activevec actives;
42		44
43	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	45	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
44	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	46	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
45	};	47	};
46	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	48	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
…		…
141	* objects with lists are rare, and lists stay short. If not, use a	143	* objects with lists are rare, and lists stay short. If not, use a
142	* different structure or at least keep the lists sorted...	144	* different structure or at least keep the lists sorted...
143	*/	145	*/
144		146
145	/* For each field in wants, */	147	/* For each field in wants, */
146	for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)	148	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)
147	{	149	{
148	key_value *has_field;	150	key_value *has_field;
149		151
150	/* Look for a field in has with the same key. */	152	/* Look for a field in has with the same key. */
151	has_field = get_ob_key_link (has, wants_field->key);	153	has_field = get_ob_key_link (has, wants_field->key);
…		…
190	* Check nrof variable *before* calling can_merge()	192	* Check nrof variable *before* calling can_merge()
191	*	193	*
192	* Improvements made with merge: Better checking on potion, and also	194	* Improvements made with merge: Better checking on potion, and also
193	* check weight	195	* check weight
194	*/	196	*/
195
196	bool object::can_merge_slow (object *ob1, object *ob2)	197	bool object::can_merge_slow (object *ob1, object *ob2)
197	{	198	{
198	/* A couple quicksanity checks */	199	/* A couple quicksanity checks */
199	if (ob1 == ob2	200	if (ob1 == ob2
200	|| ob1->type != ob2->type	201	|| ob1->type != ob2->type
…		…
221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	222	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
222		223
223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	224	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	225	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
225		226
226	if ((ob1->flags ^ ob2->flags).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	227	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
227	|| ob1->arch != ob2->arch	228	|| ob1->arch != ob2->arch
228	|| ob1->name != ob2->name	229	|| ob1->name != ob2->name
229	|| ob1->title != ob2->title	230	|| ob1->title != ob2->title
230	|| ob1->msg != ob2->msg	231	|| ob1->msg != ob2->msg
231	|| ob1->weight != ob2->weight	232	|| ob1->weight != ob2->weight
…		…
277		278
278	/* Note sure why the following is the case - either the object has to	279	/* Note sure why the following is the case - either the object has to
279	* be animated or have a very low speed. Is this an attempted monster	280	* be animated or have a very low speed. Is this an attempted monster
280	* check?	281	* check?
281	*/	282	*/
282	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	283	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
283	return 0;	284	return 0;
284		285
285	switch (ob1->type)	286	switch (ob1->type)
286	{	287	{
287	case SCROLL:	288	case SCROLL:
…		…
352	op = op->env;	353	op = op->env;
353	return op;	354	return op;
354	}	355	}
355		356
356	/*	357	/*
357	* Eneq(@csd.uu.se): Since we can have items buried in a character we need
358	* a better check. We basically keeping traversing up until we can't
359	* or find a player.
360	*/
361
362	object *
363	is_player_inv (object *op)
364	{
365	for (; op != NULL && op->type != PLAYER; op = op->env)
366	if (op->env == op)
367	op->env = NULL;
368	return op;
369	}
370
371	/*
372	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	358	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
373	* Some error messages.	359	* Some error messages.
374	* The result of the dump is stored in the static global errmsg array.	360	* The result of the dump is stored in the static global errmsg array.
375	*/	361	*/
376
377	char *	362	char *
378	dump_object (object *op)	363	dump_object (object *op)
379	{	364	{
380	if (!op)	365	if (!op)
381	return strdup ("[NULLOBJ]");	366	return strdup ("[NULLOBJ]");
382		367
383	object_freezer freezer;	368	object_freezer freezer;
384	save_object (freezer, op, 3);	369	op->write (freezer);
385	return freezer.as_string ();	370	return freezer.as_string ();
386	}	371	}
387		372
388	/*	373	/*
389	* 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
…		…
406	}	391	}
407		392
408	/*	393	/*
409	* Returns the object which has the count-variable equal to the argument.	394	* Returns the object which has the count-variable equal to the argument.
410	*/	395	*/
411
412	object *	396	object *
413	find_object (tag_t i)	397	find_object (tag_t i)
414	{	398	{
415	for (object *op = object::first; op; op = op->next)	399	for_all_objects (op)
416	if (op->count == i)	400	if (op->count == i)
417	return op;	401	return op;
418		402
419	return 0;	403	return 0;
420	}	404	}
421		405
422	/*	406	/*
423	* Returns the first object which has a name equal to the argument.	407	* Returns the first object which has a name equal to the argument.
424	* Used only by the patch command, but not all that useful.	408	* Used only by the patch command, but not all that useful.
425	* Enables features like "patch <name-of-other-player> food 999"	409	* Enables features like "patch <name-of-other-player> food 999"
426	*/	410	*/
427
428	object *	411	object *
429	find_object_name (const char *str)	412	find_object_name (const char *str)
430	{	413	{
431	shstr_cmp str_ (str);	414	shstr_cmp str_ (str);
432	object *op;	415	object *op;
433		416
434	for (op = object::first; op != NULL; op = op->next)	417	for_all_objects (op)
435	if (op->name == str_)	418	if (op->name == str_)
436	break;	419	break;
437		420
438	return op;	421	return op;
439	}	422	}
…		…
471	* refcounts and freeing the links.	454	* refcounts and freeing the links.
472	*/	455	*/
473	static void	456	static void
474	free_key_values (object *op)	457	free_key_values (object *op)
475	{	458	{
476	for (key_value *i = op->key_values; i != 0;)	459	for (key_value *i = op->key_values; i; )
477	{	460	{
478	key_value *next = i->next;	461	key_value *next = i->next;
479	delete i;	462	delete i;
480		463
481	i = next;	464	i = next;
482	}	465	}
483		466
484	op->key_values = 0;	467	op->key_values = 0;
485	}	468	}
486		469
487	void object::clear ()	470	object &
		471	object::operator =(const object &src)
488	{	472	{
489	attachable_base::clear ();	473	bool is_freed = flag [FLAG_FREED];
		474	bool is_removed = flag [FLAG_REMOVED];
490		475
491	free_key_values (this);
492
493	owner = 0;
494	name = 0;
495	name_pl = 0;
496	title = 0;
497	race = 0;
498	slaying = 0;
499	skill = 0;
500	msg = 0;
501	lore = 0;
502	custom_name = 0;
503	materialname = 0;
504	contr = 0;
505	below = 0;
506	above = 0;
507	inv = 0;
508	container = 0;
509	env = 0;
510	more = 0;
511	head = 0;
512	map = 0;
513	active_next = 0;
514	active_prev = 0;
515
516	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
517
518	SET_FLAG (this, FLAG_REMOVED);
519
520	/* What is not cleared is next, prev, and count */
521
522	expmul = 1.0;
523	face = blank_face;
524
525	if (settings.casting_time)
526	casting_time = -1;
527	}
528
529	/*
530	* copy_to first frees everything allocated by the dst object,
531	* and then copies the contents of itself into the second
532	* object, allocating what needs to be allocated. Basically, any
533	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
534	* if the first object is freed, the pointers in the new object
535	* will point at garbage.
536	*/
537	void
538	object::copy_to (object *dst)
539	{
540	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
541	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
542
543	*(object_copy *)dst = *this;	476	*(object_copy *)this = src;
544	*(object_pod *)dst = *this;
545		477
546	if (self || cb)	478	flag [FLAG_FREED] = is_freed;
547	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst));	479	flag [FLAG_REMOVED] = is_removed;
548
549	if (is_freed)
550	SET_FLAG (dst, FLAG_FREED);
551
552	if (is_removed)
553	SET_FLAG (dst, FLAG_REMOVED);
554
555	if (speed < 0)
556	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
557		480
558	/* Copy over key_values, if any. */	481	/* Copy over key_values, if any. */
559	if (key_values)	482	if (src.key_values)
560	{	483	{
561	key_value *tail = 0;	484	key_value *tail = 0;
562	key_value *i;
563
564	dst->key_values = 0;	485	key_values = 0;
565		486
566	for (i = key_values; i; i = i->next)	487	for (key_value *i = src.key_values; i; i = i->next)
567	{	488	{
568	key_value *new_link = new key_value;	489	key_value *new_link = new key_value;
569		490
570	new_link->next = 0;	491	new_link->next = 0;
571	new_link->key = i->key;	492	new_link->key = i->key;
572	new_link->value = i->value;	493	new_link->value = i->value;
573		494
574	/* Try and be clever here, too. */	495	/* Try and be clever here, too. */
575	if (!dst->key_values)	496	if (!key_values)
576	{	497	{
577	dst->key_values = new_link;	498	key_values = new_link;
578	tail = new_link;	499	tail = new_link;
579	}	500	}
580	else	501	else
581	{	502	{
582	tail->next = new_link;	503	tail->next = new_link;
583	tail = new_link;	504	tail = new_link;
584	}	505	}
585	}	506	}
586	}	507	}
		508	}
587		509
588	update_ob_speed (dst);	510	/*
		511	* copy_to first frees everything allocated by the dst object,
		512	* and then copies the contents of itself into the second
		513	* object, allocating what needs to be allocated. Basically, any
		514	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		515	* if the first object is freed, the pointers in the new object
		516	* will point at garbage.
		517	*/
		518	void
		519	object::copy_to (object *dst)
		520	{
		521	*dst = *this;
		522
		523	if (speed < 0)
		524	dst->speed_left = speed_left - rndm ();
		525
		526	dst->set_speed (dst->speed);
		527	}
		528
		529	void
		530	object::instantiate ()
		531	{
		532	if (!uuid.seq) // HACK
		533	uuid = gen_uuid ();
		534
		535	speed_left = -0.1f;
		536	/* copy the body_info to the body_used - this is only really
		537	* need for monsters, but doesn't hurt to do it for everything.
		538	* by doing so, when a monster is created, it has good starting
		539	* values for the body_used info, so when items are created
		540	* for it, they can be properly equipped.
		541	*/
		542	memcpy (body_used, body_info, sizeof (body_used));
		543
		544	attachable::instantiate ();
589	}	545	}
590		546
591	object *	547	object *
592	object::clone ()	548	object::clone ()
593	{	549	{
…		…
599	/*	555	/*
600	* If an object with the IS_TURNABLE() flag needs to be turned due	556	* If an object with the IS_TURNABLE() flag needs to be turned due
601	* to the closest player being on the other side, this function can	557	* to the closest player being on the other side, this function can
602	* be called to update the face variable, _and_ how it looks on the map.	558	* be called to update the face variable, _and_ how it looks on the map.
603	*/	559	*/
604
605	void	560	void
606	update_turn_face (object *op)	561	update_turn_face (object *op)
607	{	562	{
608	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	563	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
609	return;	564	return;
		565
610	SET_ANIMATION (op, op->direction);	566	SET_ANIMATION (op, op->direction);
611	update_object (op, UP_OBJ_FACE);	567	update_object (op, UP_OBJ_FACE);
612	}	568	}
613		569
614	/*	570	/*
615	* Updates the speed of an object. If the speed changes from 0 to another	571	* Updates the speed of an object. If the speed changes from 0 to another
616	* value, or vice versa, then add/remove the object from the active list.	572	* value, or vice versa, then add/remove the object from the active list.
617	* This function needs to be called whenever the speed of an object changes.	573	* This function needs to be called whenever the speed of an object changes.
618	*/	574	*/
619	void	575	void
620	update_ob_speed (object *op)	576	object::set_speed (float speed)
621	{	577	{
622	extern int arch_init;	578	if (flag [FLAG_FREED] && speed)
623
624	/* No reason putting the archetypes objects on the speed list,
625	* since they never really need to be updated.
626	*/
627
628	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
629	{	579	{
630	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	580	LOG (llevError, "Object %s is freed but has speed.\n", &name);
631	#ifdef MANY_CORES
632	abort ();
633	#else
634	op->speed = 0;	581	speed = 0;
635	#endif
636	}
637
638	if (arch_init)
639	return;
640
641	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
642	{	582	}
643	/* If already on active list, don't do anything */
644	if (op->active_next || op->active_prev || op == active_objects)
645	return;
646		583
647	/* process_events() expects us to insert the object at the beginning	584	this->speed = speed;
648	* of the list. */
649	op->active_next = active_objects;
650		585
651	if (op->active_next != NULL)	586	if (has_active_speed ())
652	op->active_next->active_prev = op;	587	activate ();
653
654	active_objects = op;
655	}
656	else	588	else
657	{	589	deactivate ();
658	/* If not on the active list, nothing needs to be done */
659	if (!op->active_next && !op->active_prev && op != active_objects)
660	return;
661
662	if (op->active_prev == NULL)
663	{
664	active_objects = op->active_next;
665
666	if (op->active_next != NULL)
667	op->active_next->active_prev = NULL;
668	}
669	else
670	{
671	op->active_prev->active_next = op->active_next;
672
673	if (op->active_next)
674	op->active_next->active_prev = op->active_prev;
675	}
676
677	op->active_next = NULL;
678	op->active_prev = NULL;
679	}
680	}	590	}
681		591
682	/* This function removes object 'op' from the list of active
683	* objects.
684	* This should only be used for style maps or other such
685	* reference maps where you don't want an object that isn't
686	* in play chewing up cpu time getting processed.
687	* The reverse of this is to call update_ob_speed, which
688	* will do the right thing based on the speed of the object.
689	*/
690	void
691	remove_from_active_list (object *op)
692	{
693	/* If not on the active list, nothing needs to be done */
694	if (!op->active_next && !op->active_prev && op != active_objects)
695	return;
696
697	if (op->active_prev == NULL)
698	{
699	active_objects = op->active_next;
700	if (op->active_next != NULL)
701	op->active_next->active_prev = NULL;
702	}
703	else
704	{
705	op->active_prev->active_next = op->active_next;
706	if (op->active_next)
707	op->active_next->active_prev = op->active_prev;
708	}
709	op->active_next = NULL;
710	op->active_prev = NULL;
711	}
712
713	/*	592	/*
714	* update_object() updates the array which represents the map.	593	* update_object() updates the the map.
715	* It takes into account invisible objects (and represent squares covered	594	* It takes into account invisible objects (and represent squares covered
716	* by invisible objects by whatever is below them (unless it's another	595	* by invisible objects by whatever is below them (unless it's another
717	* invisible object, etc...)	596	* invisible object, etc...)
718	* If the object being updated is beneath a player, the look-window	597	* If the object being updated is beneath a player, the look-window
719	* of that player is updated (this might be a suboptimal way of	598	* of that player is updated (this might be a suboptimal way of
720	* updating that window, though, since update_object() is called _often_)	599	* updating that window, though, since update_object() is called _often_)
721	*	600	*
722	* action is a hint of what the caller believes need to be done.	601	* action is a hint of what the caller believes need to be done.
723	* For example, if the only thing that has changed is the face (due to
724	* an animation), we don't need to call update_position until that actually
725	* comes into view of a player. OTOH, many other things, like addition/removal
726	* of walls or living creatures may need us to update the flags now.
727	* current action are:	602	* current action are:
728	* UP_OBJ_INSERT: op was inserted	603	* UP_OBJ_INSERT: op was inserted
729	* UP_OBJ_REMOVE: op was removed	604	* UP_OBJ_REMOVE: op was removed
730	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update	605	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
731	* as that is easier than trying to look at what may have changed.	606	* as that is easier than trying to look at what may have changed.
732	* UP_OBJ_FACE: only the objects face has changed.	607	* UP_OBJ_FACE: only the objects face has changed.
733	*/	608	*/
734
735	void	609	void
736	update_object (object *op, int action)	610	update_object (object *op, int action)
737	{	611	{
738	int update_now = 0, flags;
739	MoveType move_on, move_off, move_block, move_slow;
740
741	if (op == NULL)	612	if (op == NULL)
742	{	613	{
743	/* this should never happen */	614	/* this should never happen */
744	LOG (llevDebug, "update_object() called for NULL object.\n");	615	LOG (llevDebug, "update_object() called for NULL object.\n");
745	return;	616	return;
746	}	617	}
747		618
748	if (op->env != NULL)	619	if (op->env)
749	{	620	{
750	/* Animation is currently handled by client, so nothing	621	/* Animation is currently handled by client, so nothing
751	* to do in this case.	622	* to do in this case.
752	*/	623	*/
753	return;	624	return;
…		…
758	*/	629	*/
759	if (!op->map || op->map->in_memory == MAP_SAVING)	630	if (!op->map || op->map->in_memory == MAP_SAVING)
760	return;	631	return;
761		632
762	/* make sure the object is within map boundaries */	633	/* make sure the object is within map boundaries */
763	if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))	634	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
764	{	635	{
765	LOG (llevError, "update_object() called for object out of map!\n");	636	LOG (llevError, "update_object() called for object out of map!\n");
766	#ifdef MANY_CORES	637	#ifdef MANY_CORES
767	abort ();	638	abort ();
768	#endif	639	#endif
769	return;	640	return;
770	}	641	}
771		642
772	flags = GET_MAP_FLAGS (op->map, op->x, op->y);	643	mapspace &m = op->ms ();
773	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
774	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
775	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
776	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
777	move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
778		644
		645	if (!(m.flags_ & P_UPTODATE))
		646	/* nop */;
779	if (action == UP_OBJ_INSERT)	647	else if (action == UP_OBJ_INSERT)
780	{	648	{
		649	// this is likely overkill, TODO: revisit (schmorp)
781	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))	650	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
782	update_now = 1;
783
784	if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))	651	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
785	update_now = 1;	652	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))
786		653	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
		654	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
787	if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))	655	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
788	update_now = 1;
789
790	if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
791	update_now = 1;
792
793	if (op->type == SAFE_GROUND && !(flags & P_SAFE))
794	update_now = 1;
795
796	if ((move_on | op->move_on) != move_on)	656	|| (m.move_on | op->move_on ) != m.move_on
797	update_now = 1;
798
799	if ((move_off | op->move_off) != move_off)	657	|| (m.move_off | op->move_off ) != m.move_off
800	update_now = 1;	658	|| (m.move_slow | op->move_slow) != m.move_slow
801
802	/* This isn't perfect, but I don't expect a lot of objects to	659	/* This isn't perfect, but I don't expect a lot of objects to
803	* to have move_allow right now.	660	* to have move_allow right now.
804	*/	661	*/
805	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	662	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
806	update_now = 1;	663	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
807		664	m.flags_ = 0;
808	if ((move_slow | op->move_slow) != move_slow)
809	update_now = 1;
810	}	665	}
811
812	/* if the object is being removed, we can't make intelligent	666	/* if the object is being removed, we can't make intelligent
813	* decisions, because remove_ob can't really pass the object	667	* decisions, because remove_ob can't really pass the object
814	* that is being removed.	668	* that is being removed.
815	*/	669	*/
816	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	670	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
817	update_now = 1;	671	m.flags_ = 0;
818	else if (action == UP_OBJ_FACE)	672	else if (action == UP_OBJ_FACE)
819	/* Nothing to do for that case */ ;	673	/* Nothing to do for that case */ ;
820	else	674	else
821	LOG (llevError, "update_object called with invalid action: %d\n", action);	675	LOG (llevError, "update_object called with invalid action: %d\n", action);
822		676
823	if (update_now)
824	{
825	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
826	update_position (op->map, op->x, op->y);
827	}
828
829	if (op->more != NULL)	677	if (op->more)
830	update_object (op->more, action);	678	update_object (op->more, action);
831	}
832
833	object::vector object::mortals;
834	object::vector object::objects; // not yet used
835	object *object::first;
836
837	void object::free_mortals ()
838	{
839	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
840	if ((*i)->refcnt)
841	++i; // further delay freeing
842	else
843	{
844	delete *i;
845	mortals.erase (i);
846	}
847	}	679	}
848		680
849	object::object ()	681	object::object ()
850	{	682	{
851	SET_FLAG (this, FLAG_REMOVED);	683	SET_FLAG (this, FLAG_REMOVED);
…		…
854	face = blank_face;	686	face = blank_face;
855	}	687	}
856		688
857	object::~object ()	689	object::~object ()
858	{	690	{
		691	unlink ();
		692
859	free_key_values (this);	693	free_key_values (this);
860	}	694	}
861		695
		696	static int object_count;
		697
862	void object::link ()	698	void object::link ()
863	{	699	{
864	count = ++ob_count;	700	assert (!index);//D
865	uuid = gen_uuid ();	701	uuid = gen_uuid ();
		702	count = ++object_count;
866		703
867	prev = 0;	704	refcnt_inc ();
868	next = object::first;	705	objects.insert (this);
869
870	if (object::first)
871	object::first->prev = this;
872
873	object::first = this;
874	}	706	}
875		707
876	void object::unlink ()	708	void object::unlink ()
877	{	709	{
878	if (this == object::first)	710	if (!index)
879	object::first = next;	711	return;
880		712
881	/* Remove this object from the list of used objects */	713	objects.erase (this);
882	if (prev) prev->next = next;	714	refcnt_dec ();
883	if (next) next->prev = prev;	715	}
884		716
885	prev = 0;	717	void
886	next = 0;	718	object::activate ()
		719	{
		720	/* If already on active list, don't do anything */
		721	if (active)
		722	return;
		723
		724	if (has_active_speed ())
		725	actives.insert (this);
		726	}
		727
		728	void
		729	object::activate_recursive ()
		730	{
		731	activate ();
		732
		733	for (object *op = inv; op; op = op->below)
		734	op->activate_recursive ();
		735	}
		736
		737	/* This function removes object 'op' from the list of active
		738	* objects.
		739	* This should only be used for style maps or other such
		740	* reference maps where you don't want an object that isn't
		741	* in play chewing up cpu time getting processed.
		742	* The reverse of this is to call update_ob_speed, which
		743	* will do the right thing based on the speed of the object.
		744	*/
		745	void
		746	object::deactivate ()
		747	{
		748	/* If not on the active list, nothing needs to be done */
		749	if (!active)
		750	return;
		751
		752	actives.erase (this);
		753	}
		754
		755	void
		756	object::deactivate_recursive ()
		757	{
		758	for (object *op = inv; op; op = op->below)
		759	op->deactivate_recursive ();
		760
		761	deactivate ();
		762	}
		763
		764	void
		765	object::set_flag_inv (int flag, int value)
		766	{
		767	for (object *op = inv; op; op = op->below)
		768	{
		769	op->flag [flag] = value;
		770	op->set_flag_inv (flag, value);
		771	}
		772	}
		773
		774	/*
		775	* Remove and free all objects in the inventory of the given object.
		776	* object.c ?
		777	*/
		778	void
		779	object::destroy_inv (bool drop_to_ground)
		780	{
		781	// need to check first, because the checks below might segfault
		782	// as we might be on an invalid mapspace and crossfire code
		783	// is too buggy to ensure that the inventory is empty.
		784	// corollary: if you create arrows etc. with stuff in tis inventory,
		785	// cf will crash below with off-map x and y
		786	if (!inv)
		787	return;
		788
		789	/* Only if the space blocks everything do we not process -
		790	* if some form of movement is allowed, let objects
		791	* drop on that space.
		792	*/
		793	if (!drop_to_ground
		794	|| !map
		795	|| map->in_memory != MAP_IN_MEMORY
		796	|| map->nodrop
		797	|| ms ().move_block == MOVE_ALL)
		798	{
		799	while (inv)
		800	{
		801	inv->destroy_inv (drop_to_ground);
		802	inv->destroy ();
		803	}
		804	}
		805	else
		806	{ /* Put objects in inventory onto this space */
		807	while (inv)
		808	{
		809	object *op = inv;
		810
		811	if (op->flag [FLAG_STARTEQUIP]
		812	|| op->flag [FLAG_NO_DROP]
		813	|| op->type == RUNE
		814	|| op->type == TRAP
		815	|| op->flag [FLAG_IS_A_TEMPLATE]
		816	|| op->flag [FLAG_DESTROY_ON_DEATH])
		817	op->destroy ();
		818	else
		819	map->insert (op, x, y);
		820	}
		821	}
887	}	822	}
888		823
889	object *object::create ()	824	object *object::create ()
890	{	825	{
891	object *op = new object;	826	object *op = new object;
892	op->link ();	827	op->link ();
893	return op;	828	return op;
894	}	829	}
895		830
896	/*	831	void
897	* free_object() frees everything allocated by an object, removes	832	object::do_destroy ()
898	* it from the list of used objects, and puts it on the list of
899	* free objects. The IS_FREED() flag is set in the object.
900	* The object must have been removed by remove_ob() first for
901	* this function to succeed.
902	*
903	* If destroy_inventory is set, free inventory as well. Else drop items in
904	* inventory to the ground.
905	*/
906	void object::destroy (bool destroy_inventory)
907	{	833	{
908	if (QUERY_FLAG (this, FLAG_FREED))	834	attachable::do_destroy ();
909	return;
910		835
911	if (QUERY_FLAG (this, FLAG_FRIENDLY))	836	if (flag [FLAG_IS_LINKED])
		837	remove_button_link (this);
		838
		839	if (flag [FLAG_FRIENDLY])
		840	{
912	remove_friendly_object (this);	841	remove_friendly_object (this);
913		842
914	if (!QUERY_FLAG (this, FLAG_REMOVED))	843	if (type == GOLEM
		844	&& owner
		845	&& owner->type == PLAYER
		846	&& owner->contr->ranges[range_golem] == this)
		847	owner->contr->ranges[range_golem] = 0;
		848	}
		849
		850	if (!flag [FLAG_REMOVED])
915	remove ();	851	remove ();
916		852
917	SET_FLAG (this, FLAG_FREED);	853	destroy_inv (true);
918		854
919	if (more)	855	deactivate ();
920	{	856	unlink ();
921	more->destroy (destroy_inventory);
922	more = 0;
923	}
924		857
925	if (inv)	858	flag [FLAG_FREED] = 1;
926	{
927	/* Only if the space blocks everything do we not process -
928	* if some form of movement is allowed, let objects
929	* drop on that space.
930	*/
931	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
932	{
933	object *op = inv;
934
935	while (op)
936	{
937	object *tmp = op->below;
938	op->destroy (destroy_inventory);
939	op = tmp;
940	}
941	}
942	else
943	{ /* Put objects in inventory onto this space */
944	object *op = inv;
945
946	while (op)
947	{
948	object *tmp = op->below;
949
950	op->remove ();
951
952	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
953	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
954	op->destroy ();
955	else
956	{
957	op->x = x;
958	op->y = y;
959	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
960	}
961
962	op = tmp;
963	}
964	}
965	}
966		859
967	// hack to ensure that freed objects still have a valid map	860	// hack to ensure that freed objects still have a valid map
968	{	861	{
969	static maptile *freed_map; // freed objects are moved here to avoid crashes	862	static maptile *freed_map; // freed objects are moved here to avoid crashes
970		863
…		…
974		867
975	freed_map->name = "/internal/freed_objects_map";	868	freed_map->name = "/internal/freed_objects_map";
976	freed_map->width = 3;	869	freed_map->width = 3;
977	freed_map->height = 3;	870	freed_map->height = 3;
978		871
979	freed_map->allocate ();	872	freed_map->alloc ();
		873	freed_map->in_memory = MAP_IN_MEMORY;
980	}	874	}
981		875
982	map = freed_map;	876	map = freed_map;
983	x = 1;	877	x = 1;
984	y = 1;	878	y = 1;
985	}	879	}
986		880
		881	head = 0;
		882
		883	if (more)
		884	{
		885	more->destroy ();
		886	more = 0;
		887	}
		888
987	// clear those pointers that likely might have circular references to us	889	// clear those pointers that likely might have circular references to us
988	owner = 0;	890	owner = 0;
989	enemy = 0;	891	enemy = 0;
990	attacked_by = 0;	892	attacked_by = 0;
		893	}
991		894
992	// only relevant for players(?), but make sure of it anyways	895	void
993	contr = 0;	896	object::destroy (bool destroy_inventory)
		897	{
		898	if (destroyed ())
		899	return;
994		900
995	/* Remove object from the active list */	901	if (destroy_inventory)
996	speed = 0;	902	destroy_inv (false);
997	update_ob_speed (this);
998		903
999	unlink ();	904	attachable::destroy ();
1000
1001	mortals.push_back (this);
1002	}	905	}
1003		906
1004	/*	907	/*
1005	* sub_weight() recursively (outwards) subtracts a number from the	908	* sub_weight() recursively (outwards) subtracts a number from the
1006	* weight of an object (and what is carried by it's environment(s)).	909	* weight of an object (and what is carried by it's environment(s)).
…		…
1022	* This function removes the object op from the linked list of objects	925	* This function removes the object op from the linked list of objects
1023	* which it is currently tied to. When this function is done, the	926	* which it is currently tied to. When this function is done, the
1024	* object will have no environment. If the object previously had an	927	* object will have no environment. If the object previously had an
1025	* environment, the x and y coordinates will be updated to	928	* environment, the x and y coordinates will be updated to
1026	* the previous environment.	929	* the previous environment.
1027	* Beware: This function is called from the editor as well!
1028	*/	930	*/
1029	void	931	void
1030	object::remove ()	932	object::do_remove ()
1031	{	933	{
1032	object *tmp, *last = 0;	934	object *tmp, *last = 0;
1033	object *otmp;	935	object *otmp;
1034		936
1035	int check_walk_off;
1036
1037	if (QUERY_FLAG (this, FLAG_REMOVED))	937	if (QUERY_FLAG (this, FLAG_REMOVED))
1038	return;	938	return;
1039		939
1040	SET_FLAG (this, FLAG_REMOVED);	940	SET_FLAG (this, FLAG_REMOVED);
		941	INVOKE_OBJECT (REMOVE, this);
1041		942
1042	if (more)	943	if (more)
1043	more->remove ();	944	more->remove ();
1044		945
1045	/*	946	/*
…		…
1055		956
1056	/* NO_FIX_PLAYER is set when a great many changes are being	957	/* NO_FIX_PLAYER is set when a great many changes are being
1057	* made to players inventory. If set, avoiding the call	958	* made to players inventory. If set, avoiding the call
1058	* to save cpu time.	959	* to save cpu time.
1059	*/	960	*/
1060	if ((otmp = is_player_inv (env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	961	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1061	fix_player (otmp);	962	otmp->update_stats ();
1062		963
1063	if (above != NULL)	964	if (above)
1064	above->below = below;	965	above->below = below;
1065	else	966	else
1066	env->inv = below;	967	env->inv = below;
1067		968
1068	if (below != NULL)	969	if (below)
1069	below->above = above;	970	below->above = above;
1070		971
1071	/* we set up values so that it could be inserted into	972	/* we set up values so that it could be inserted into
1072	* the map, but we don't actually do that - it is up	973	* the map, but we don't actually do that - it is up
1073	* to the caller to decide what we want to do.	974	* to the caller to decide what we want to do.
…		…
1077	above = 0, below = 0;	978	above = 0, below = 0;
1078	env = 0;	979	env = 0;
1079	}	980	}
1080	else if (map)	981	else if (map)
1081	{	982	{
1082	/* Re did the following section of code - it looks like it had	983	if (type == PLAYER)
1083	* lots of logic for things we no longer care about
1084	*/	984	{
		985	// leaving a spot always closes any open container on the ground
		986	if (container && !container->env)
		987	// this causes spurious floorbox updates, but it ensures
		988	// that the CLOSE event is being sent.
		989	close_container ();
		990
		991	--map->players;
		992	map->touch ();
		993	}
		994
		995	map->dirty = true;
		996	mapspace &ms = this->ms ();
1085		997
1086	/* link the object above us */	998	/* link the object above us */
1087	if (above)	999	if (above)
1088	above->below = below;	1000	above->below = below;
1089	else	1001	else
1090	SET_MAP_TOP (map, x, y, below); /* we were top, set new top */	1002	ms.top = below; /* we were top, set new top */
1091		1003
1092	/* Relink the object below us, if there is one */	1004	/* Relink the object below us, if there is one */
1093	if (below)	1005	if (below)
1094	below->above = above;	1006	below->above = above;
1095	else	1007	else
…		…
1097	/* Nothing below, which means we need to relink map object for this space	1009	/* Nothing below, which means we need to relink map object for this space
1098	* use translated coordinates in case some oddness with map tiling is	1010	* use translated coordinates in case some oddness with map tiling is
1099	* evident	1011	* evident
1100	*/	1012	*/
1101	if (GET_MAP_OB (map, x, y) != this)	1013	if (GET_MAP_OB (map, x, y) != this)
1102	{
1103	char *dump = dump_object (this);
1104	LOG (llevError,
1105	"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump);	1014	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1106	free (dump);
1107	dump = dump_object (GET_MAP_OB (map, x, y));
1108	LOG (llevError, "%s\n", dump);
1109	free (dump);
1110	}
1111		1015
1112	SET_MAP_OB (map, x, y, above); /* goes on above it. */	1016	ms.bot = above; /* goes on above it. */
1113	}	1017	}
1114		1018
1115	above = 0;	1019	above = 0;
1116	below = 0;	1020	below = 0;
1117		1021
1118	if (map->in_memory == MAP_SAVING)	1022	if (map->in_memory == MAP_SAVING)
1119	return;	1023	return;
1120		1024
1121	check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);	1025	int check_walk_off = !flag [FLAG_NO_APPLY];
1122		1026
1123	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	1027	for (tmp = ms.bot; tmp; tmp = tmp->above)
1124	{	1028	{
1125	/* No point updating the players look faces if he is the object	1029	/* No point updating the players look faces if he is the object
1126	* being removed.	1030	* being removed.
1127	*/	1031	*/
1128		1032
…		…
1132	* removed (most likely destroyed), update the player view	1036	* removed (most likely destroyed), update the player view
1133	* appropriately.	1037	* appropriately.
1134	*/	1038	*/
1135	if (tmp->container == this)	1039	if (tmp->container == this)
1136	{	1040	{
1137	CLEAR_FLAG (this, FLAG_APPLIED);	1041	flag [FLAG_APPLIED] = 0;
1138	tmp->container = 0;	1042	tmp->container = 0;
1139	}	1043	}
1140		1044
		1045	if (tmp->contr->ns)
1141	tmp->contr->socket->floorbox_update ();	1046	tmp->contr->ns->floorbox_update ();
1142	}	1047	}
1143		1048
1144	/* See if player moving off should effect something */	1049	/* See if object moving off should effect something */
1145	if (check_walk_off	1050	if (check_walk_off
1146	&& ((move_type & tmp->move_off)	1051	&& ((move_type & tmp->move_off)
1147	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1052	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1148	{	1053	{
1149	move_apply (tmp, this, 0);	1054	move_apply (tmp, this, 0);
…		…
1151	if (destroyed ())	1056	if (destroyed ())
1152	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1057	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1153	}	1058	}
1154		1059
1155	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1060	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1156		1061	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1157	if (tmp->above == tmp)	1062	if (tmp->above == tmp)
1158	tmp->above = 0;	1063	tmp->above = 0;
1159		1064
1160	last = tmp;	1065	last = tmp;
1161	}	1066	}
1162		1067
1163	/* last == NULL of there are no objects on this space */	1068	/* last == NULL if there are no objects on this space */
		1069	//TODO: this makes little sense, why only update the topmost object?
1164	if (!last)	1070	if (!last)
1165	{	1071	map->at (x, y).flags_ = 0;
1166	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1167	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1168	* those out anyways, and if there are any flags set right now, they won't
1169	* be correct anyways.
1170	*/
1171	SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE);
1172	update_position (map, x, y);
1173	}
1174	else	1072	else
1175	update_object (last, UP_OBJ_REMOVE);	1073	update_object (last, UP_OBJ_REMOVE);
1176		1074
1177	if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)	1075	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1178	update_all_los (map, x, y);	1076	update_all_los (map, x, y);
1179	}	1077	}
1180	}	1078	}
1181		1079
1182	/*	1080	/*
…		…
1191	merge_ob (object *op, object *top)	1089	merge_ob (object *op, object *top)
1192	{	1090	{
1193	if (!op->nrof)	1091	if (!op->nrof)
1194	return 0;	1092	return 0;
1195		1093
1196	if (top == NULL)	1094	if (top)
1197	for (top = op; top != NULL && top->above != NULL; top = top->above);	1095	for (top = op; top && top->above; top = top->above)
		1096	;
1198		1097
1199	for (; top != NULL; top = top->below)	1098	for (; top; top = top->below)
1200	{	1099	{
1201	if (top == op)	1100	if (top == op)
1202	continue;	1101	continue;
1203		1102
1204	if (object::can_merge (op, top))	1103	if (object::can_merge (op, top))
…		…
1214		1113
1215	return 0;	1114	return 0;
1216	}	1115	}
1217		1116
1218	/*	1117	/*
1219	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1118	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1220	* job preparing multi-part monsters	1119	* job preparing multi-part monsters.
1221	*/	1120	*/
1222	object *	1121	object *
1223	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1122	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1224	{	1123	{
1225	object *tmp;
1226
1227	if (op->head)
1228	op = op->head;
1229
1230	for (tmp = op; tmp; tmp = tmp->more)	1124	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1231	{	1125	{
1232	tmp->x = x + tmp->arch->clone.x;	1126	tmp->x = x + tmp->arch->clone.x;
1233	tmp->y = y + tmp->arch->clone.y;	1127	tmp->y = y + tmp->arch->clone.y;
1234	}	1128	}
1235		1129
…		…
1254	* Return value:	1148	* Return value:
1255	* new object if 'op' was merged with other object	1149	* new object if 'op' was merged with other object
1256	* NULL if 'op' was destroyed	1150	* NULL if 'op' was destroyed
1257	* just 'op' otherwise	1151	* just 'op' otherwise
1258	*/	1152	*/
1259
1260	object *	1153	object *
1261	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1154	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1262	{	1155	{
1263	object *tmp, *top, *floor = NULL;	1156	object *tmp, *top, *floor = NULL;
1264	sint16 x, y;
1265		1157
1266	if (QUERY_FLAG (op, FLAG_FREED))	1158	if (QUERY_FLAG (op, FLAG_FREED))
1267	{	1159	{
1268	LOG (llevError, "Trying to insert freed object!\n");	1160	LOG (llevError, "Trying to insert freed object!\n");
1269	return NULL;	1161	return NULL;
1270	}	1162	}
1271		1163
1272	if (m == NULL)	1164	if (!QUERY_FLAG (op, FLAG_REMOVED))
		1165	LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
		1166
		1167	op->remove ();
		1168
		1169	if (!m)
1273	{	1170	{
1274	char *dump = dump_object (op);	1171	char *dump = dump_object (op);
1275	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1172	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1276	free (dump);	1173	free (dump);
1277	return op;	1174	return op;
…		…
1290	#endif	1187	#endif
1291	free (dump);	1188	free (dump);
1292	return op;	1189	return op;
1293	}	1190	}
1294		1191
1295	if (!QUERY_FLAG (op, FLAG_REMOVED))
1296	{
1297	char *dump = dump_object (op);
1298	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1299	free (dump);
1300	return op;
1301	}
1302
1303	if (op->more != NULL)
1304	{
1305	/* The part may be on a different map. */
1306
1307	object *more = op->more;	1192	if (object *more = op->more)
1308		1193	{
1309	/* We really need the caller to normalize coordinates - if
1310	* we set the map, that doesn't work if the location is within
1311	* a map and this is straddling an edge. So only if coordinate
1312	* is clear wrong do we normalize it.
1313	*/
1314	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1315	more->map = get_map_from_coord (m, &more->x, &more->y);
1316	else if (!more->map)
1317	{
1318	/* For backwards compatibility - when not dealing with tiled maps,
1319	* more->map should always point to the parent.
1320	*/
1321	more->map = m;
1322	}
1323
1324	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1194	if (!insert_ob_in_map (more, m, originator, flag))
1325	{	1195	{
1326	if (!op->head)	1196	if (!op->head)
1327	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1197	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1328		1198
1329	return NULL;	1199	return 0;
1330	}	1200	}
1331	}	1201	}
1332		1202
1333	CLEAR_FLAG (op, FLAG_REMOVED);	1203	CLEAR_FLAG (op, FLAG_REMOVED);
1334		1204
1335	/* Ideally, the caller figures this out. However, it complicates a lot	1205	/* Ideally, the caller figures this out. However, it complicates a lot
1336	* of areas of callers (eg, anything that uses find_free_spot would now	1206	* of areas of callers (eg, anything that uses find_free_spot would now
1337	* need extra work	1207	* need extra work
1338	*/	1208	*/
1339	op->map = get_map_from_coord (m, &op->x, &op->y);	1209	if (!xy_normalise (m, op->x, op->y))
1340	x = op->x;	1210	return 0;
1341	y = op->y;	1211
		1212	op->map = m;
		1213	mapspace &ms = op->ms ();
1342		1214
1343	/* this has to be done after we translate the coordinates.	1215	/* this has to be done after we translate the coordinates.
1344	*/	1216	*/
1345	if (op->nrof && !(flag & INS_NO_MERGE))	1217	if (op->nrof && !(flag & INS_NO_MERGE))
1346	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1218	for (tmp = ms.bot; tmp; tmp = tmp->above)
1347	if (object::can_merge (op, tmp))	1219	if (object::can_merge (op, tmp))
1348	{	1220	{
1349	op->nrof += tmp->nrof;	1221	op->nrof += tmp->nrof;
1350	tmp->destroy ();	1222	tmp->destroy ();
1351	}	1223	}
…		…
1368	op->below = originator->below;	1240	op->below = originator->below;
1369		1241
1370	if (op->below)	1242	if (op->below)
1371	op->below->above = op;	1243	op->below->above = op;
1372	else	1244	else
1373	SET_MAP_OB (op->map, op->x, op->y, op);	1245	ms.bot = op;
1374		1246
1375	/* since *below* originator, no need to update top */	1247	/* since *below* originator, no need to update top */
1376	originator->below = op;	1248	originator->below = op;
1377	}	1249	}
1378	else	1250	else
1379	{	1251	{
		1252	top = ms.bot;
		1253
1380	/* If there are other objects, then */	1254	/* If there are other objects, then */
1381	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1255	if ((!(flag & INS_MAP_LOAD)) && top)
1382	{	1256	{
1383	object *last = NULL;	1257	object *last = 0;
1384		1258
1385	/*	1259	/*
1386	* If there are multiple objects on this space, we do some trickier handling.	1260	* If there are multiple objects on this space, we do some trickier handling.
1387	* We've already dealt with merging if appropriate.	1261	* We've already dealt with merging if appropriate.
1388	* Generally, we want to put the new object on top. But if	1262	* Generally, we want to put the new object on top. But if
…		…
1392	* once we get to them. This reduces the need to traverse over all of	1266	* once we get to them. This reduces the need to traverse over all of
1393	* them when adding another one - this saves quite a bit of cpu time	1267	* them when adding another one - this saves quite a bit of cpu time
1394	* when lots of spells are cast in one area. Currently, it is presumed	1268	* when lots of spells are cast in one area. Currently, it is presumed
1395	* that flying non pickable objects are spell objects.	1269	* that flying non pickable objects are spell objects.
1396	*/	1270	*/
1397		1271	for (top = ms.bot; top; top = top->above)
1398	while (top != NULL)
1399	{	1272	{
1400	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1273	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1401	floor = top;	1274	floor = top;
1402		1275
1403	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1276	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1406	top = top->below;	1279	top = top->below;
1407	break;	1280	break;
1408	}	1281	}
1409		1282
1410	last = top;	1283	last = top;
1411	top = top->above;
1412	}	1284	}
1413		1285
1414	/* Don't want top to be NULL, so set it to the last valid object */	1286	/* Don't want top to be NULL, so set it to the last valid object */
1415	top = last;	1287	top = last;
1416		1288
…		…
1418	* looks like instead of lots of conditions here.	1290	* looks like instead of lots of conditions here.
1419	* makes things faster, and effectively the same result.	1291	* makes things faster, and effectively the same result.
1420	*/	1292	*/
1421		1293
1422	/* Have object 'fall below' other objects that block view.	1294	/* Have object 'fall below' other objects that block view.
1423	* Unless those objects are exits, type 66	1295	* Unless those objects are exits.
1424	* If INS_ON_TOP is used, don't do this processing	1296	* If INS_ON_TOP is used, don't do this processing
1425	* Need to find the object that in fact blocks view, otherwise	1297	* Need to find the object that in fact blocks view, otherwise
1426	* stacking is a bit odd.	1298	* stacking is a bit odd.
1427	*/	1299	*/
1428	if (!(flag & INS_ON_TOP) &&	1300	if (!(flag & INS_ON_TOP)
1429	(get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1301	&& ms.flags () & P_BLOCKSVIEW
		1302	&& (op->face && !faces [op->face].visibility))
1430	{	1303	{
1431	for (last = top; last != floor; last = last->below)	1304	for (last = top; last != floor; last = last->below)
1432	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1305	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1433	break;	1306	break;
		1307
1434	/* Check to see if we found the object that blocks view,	1308	/* Check to see if we found the object that blocks view,
1435	* and make sure we have a below pointer for it so that	1309	* and make sure we have a below pointer for it so that
1436	* we can get inserted below this one, which requires we	1310	* we can get inserted below this one, which requires we
1437	* set top to the object below us.	1311	* set top to the object below us.
1438	*/	1312	*/
…		…
1440	top = last->below;	1314	top = last->below;
1441	}	1315	}
1442	} /* If objects on this space */	1316	} /* If objects on this space */
1443		1317
1444	if (flag & INS_MAP_LOAD)	1318	if (flag & INS_MAP_LOAD)
1445	top = GET_MAP_TOP (op->map, op->x, op->y);	1319	top = ms.top;
1446		1320
1447	if (flag & INS_ABOVE_FLOOR_ONLY)	1321	if (flag & INS_ABOVE_FLOOR_ONLY)
1448	top = floor;	1322	top = floor;
1449		1323
1450	/* Top is the object that our object (op) is going to get inserted above.	1324	/* Top is the object that our object (op) is going to get inserted above.
1451	*/	1325	*/
1452		1326
1453	/* First object on this space */	1327	/* First object on this space */
1454	if (!top)	1328	if (!top)
1455	{	1329	{
1456	op->above = GET_MAP_OB (op->map, op->x, op->y);	1330	op->above = ms.bot;
1457		1331
1458	if (op->above)	1332	if (op->above)
1459	op->above->below = op;	1333	op->above->below = op;
1460		1334
1461	op->below = NULL;	1335	op->below = 0;
1462	SET_MAP_OB (op->map, op->x, op->y, op);	1336	ms.bot = op;
1463	}	1337	}
1464	else	1338	else
1465	{ /* get inserted into the stack above top */	1339	{ /* get inserted into the stack above top */
1466	op->above = top->above;	1340	op->above = top->above;
1467		1341
…		…
1470		1344
1471	op->below = top;	1345	op->below = top;
1472	top->above = op;	1346	top->above = op;
1473	}	1347	}
1474		1348
1475	if (op->above == NULL)	1349	if (!op->above)
1476	SET_MAP_TOP (op->map, op->x, op->y, op);	1350	ms.top = op;
1477	} /* else not INS_BELOW_ORIGINATOR */	1351	} /* else not INS_BELOW_ORIGINATOR */
1478		1352
1479	if (op->type == PLAYER)	1353	if (op->type == PLAYER)
		1354	{
1480	op->contr->do_los = 1;	1355	op->contr->do_los = 1;
		1356	++op->map->players;
		1357	op->map->touch ();
		1358	}
		1359
		1360	op->map->dirty = true;
1481		1361
1482	/* If we have a floor, we know the player, if any, will be above	1362	/* If we have a floor, we know the player, if any, will be above
1483	* it, so save a few ticks and start from there.	1363	* it, so save a few ticks and start from there.
1484	*/	1364	*/
1485	if (!(flag & INS_MAP_LOAD))	1365	if (!(flag & INS_MAP_LOAD))
1486	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1366	if (object *pl = ms.player ())
1487	if (tmp->type == PLAYER)	1367	if (pl->contr->ns)
1488	tmp->contr->socket->floorbox_update ();	1368	pl->contr->ns->floorbox_update ();
1489		1369
1490	/* If this object glows, it may affect lighting conditions that are	1370	/* If this object glows, it may affect lighting conditions that are
1491	* visible to others on this map. But update_all_los is really	1371	* visible to others on this map. But update_all_los is really
1492	* an inefficient way to do this, as it means los for all players	1372	* an inefficient way to do this, as it means los for all players
1493	* on the map will get recalculated. The players could very well	1373	* on the map will get recalculated. The players could very well
1494	* be far away from this change and not affected in any way -	1374	* be far away from this change and not affected in any way -
1495	* this should get redone to only look for players within range,	1375	* this should get redone to only look for players within range,
1496	* or just updating the P_NEED_UPDATE for spaces within this area	1376	* or just updating the P_UPTODATE for spaces within this area
1497	* of effect may be sufficient.	1377	* of effect may be sufficient.
1498	*/	1378	*/
1499	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1379	if (op->map->darkness && (op->glow_radius != 0))
1500	update_all_los (op->map, op->x, op->y);	1380	update_all_los (op->map, op->x, op->y);
1501		1381
1502	/* updates flags (blocked, alive, no magic, etc) for this map space */	1382	/* updates flags (blocked, alive, no magic, etc) for this map space */
1503	update_object (op, UP_OBJ_INSERT);	1383	update_object (op, UP_OBJ_INSERT);
		1384
		1385	INVOKE_OBJECT (INSERT, op);
1504		1386
1505	/* Don't know if moving this to the end will break anything. However,	1387	/* Don't know if moving this to the end will break anything. However,
1506	* we want to have floorbox_update called before calling this.	1388	* we want to have floorbox_update called before calling this.
1507	*	1389	*
1508	* check_move_on() must be after this because code called from	1390	* check_move_on() must be after this because code called from
…		…
1513		1395
1514	/* if this is not the head or flag has been passed, don't check walk on status */	1396	/* if this is not the head or flag has been passed, don't check walk on status */
1515	if (!(flag & INS_NO_WALK_ON) && !op->head)	1397	if (!(flag & INS_NO_WALK_ON) && !op->head)
1516	{	1398	{
1517	if (check_move_on (op, originator))	1399	if (check_move_on (op, originator))
1518	return NULL;	1400	return 0;
1519		1401
1520	/* If we are a multi part object, lets work our way through the check	1402	/* If we are a multi part object, lets work our way through the check
1521	* walk on's.	1403	* walk on's.
1522	*/	1404	*/
1523	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1405	for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1524	if (check_move_on (tmp, originator))	1406	if (check_move_on (tmp, originator))
1525	return NULL;	1407	return 0;
1526	}	1408	}
1527		1409
1528	return op;	1410	return op;
1529	}	1411	}
1530		1412
1531	/* this function inserts an object in the map, but if it	1413	/* this function inserts an object in the map, but if it
1532	* finds an object of its own type, it'll remove that one first.	1414	* finds an object of its own type, it'll remove that one first.
1533	* op is the object to insert it under: supplies x and the map.	1415	* op is the object to insert it under: supplies x and the map.
1534	*/	1416	*/
1535	void	1417	void
1536	replace_insert_ob_in_map (const char *arch_string, object *op)	1418	replace_insert_ob_in_map (const char *arch_string, object *op)
1537	{	1419	{
1538	object *	1420	object *tmp, *tmp1;
1539	tmp;
1540	object *
1541	tmp1;
1542		1421
1543	/* first search for itself and remove any old instances */	1422	/* first search for itself and remove any old instances */
1544		1423
1545	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1424	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1546	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1425	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1547	tmp->destroy ();	1426	tmp->destroy ();
1548		1427
1549	tmp1 = arch_to_object (archetype::find (arch_string));	1428	tmp1 = arch_to_object (archetype::find (arch_string));
1550		1429
1551	tmp1->x = op->x;	1430	tmp1->x = op->x;
1552	tmp1->y = op->y;	1431	tmp1->y = op->y;
1553	insert_ob_in_map (tmp1, op->map, op, 0);	1432	insert_ob_in_map (tmp1, op->map, op, 0);
		1433	}
		1434
		1435	// XXX: function not returning object*
		1436	object *
		1437	object::insert_at (object *where, object *originator, int flags)
		1438	{
		1439	where->map->insert (this, where->x, where->y, originator, flags);
1554	}	1440	}
1555		1441
1556	/*	1442	/*
1557	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1443	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1558	* is returned contains nr objects, and the remaining parts contains	1444	* is returned contains nr objects, and the remaining parts contains
1559	* the rest (or is removed and freed if that number is 0).	1445	* the rest (or is removed and freed if that number is 0).
1560	* On failure, NULL is returned, and the reason put into the	1446	* On failure, NULL is returned, and the reason put into the
1561	* global static errmsg array.	1447	* global static errmsg array.
1562	*/	1448	*/
1563
1564	object *	1449	object *
1565	get_split_ob (object *orig_ob, uint32 nr)	1450	get_split_ob (object *orig_ob, uint32 nr)
1566	{	1451	{
1567	object *newob;	1452	object *newob;
1568	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1453	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1604		1489
1605	object *	1490	object *
1606	decrease_ob_nr (object *op, uint32 i)	1491	decrease_ob_nr (object *op, uint32 i)
1607	{	1492	{
1608	object *tmp;	1493	object *tmp;
1609	player *pl;
1610		1494
1611	if (i == 0) /* objects with op->nrof require this check */	1495	if (i == 0) /* objects with op->nrof require this check */
1612	return op;	1496	return op;
1613		1497
1614	if (i > op->nrof)	1498	if (i > op->nrof)
…		…
1619	else if (op->env)	1503	else if (op->env)
1620	{	1504	{
1621	/* is this object in the players inventory, or sub container	1505	/* is this object in the players inventory, or sub container
1622	* therein?	1506	* therein?
1623	*/	1507	*/
1624	tmp = is_player_inv (op->env);	1508	tmp = op->in_player ();
1625	/* nope. Is this a container the player has opened?	1509	/* nope. Is this a container the player has opened?
1626	* If so, set tmp to that player.	1510	* If so, set tmp to that player.
1627	* IMO, searching through all the players will mostly	1511	* IMO, searching through all the players will mostly
1628	* likely be quicker than following op->env to the map,	1512	* likely be quicker than following op->env to the map,
1629	* and then searching the map for a player.	1513	* and then searching the map for a player.
1630	*/	1514	*/
1631	if (!tmp)	1515	if (!tmp)
1632	{	1516	for_all_players (pl)
1633	for (pl = first_player; pl; pl = pl->next)
1634	if (pl->ob->container == op->env)	1517	if (pl->ob->container == op->env)
1635	{	1518	{
1636	tmp = pl->ob;	1519	tmp = pl->ob;
1637	break;	1520	break;
1638	}	1521	}
1639	}
1640		1522
1641	if (i < op->nrof)	1523	if (i < op->nrof)
1642	{	1524	{
1643	sub_weight (op->env, op->weight * i);	1525	sub_weight (op->env, op->weight * i);
1644	op->nrof -= i;	1526	op->nrof -= i;
…		…
1777	add_weight (this, op->weight * op->nrof);	1659	add_weight (this, op->weight * op->nrof);
1778	}	1660	}
1779	else	1661	else
1780	add_weight (this, (op->weight + op->carrying));	1662	add_weight (this, (op->weight + op->carrying));
1781		1663
1782	otmp = is_player_inv (this);	1664	otmp = this->in_player ();
1783	if (otmp && otmp->contr)	1665	if (otmp && otmp->contr)
1784	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1666	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1785	fix_player (otmp);	1667	otmp->update_stats ();
1786		1668
1787	op->map = NULL;	1669	op->map = 0;
1788	op->env = this;	1670	op->env = this;
1789	op->above = NULL;	1671	op->above = 0;
1790	op->below = NULL;	1672	op->below = 0;
1791	op->x = 0, op->y = 0;	1673	op->x = 0, op->y = 0;
1792		1674
1793	/* reset the light list and los of the players on the map */	1675	/* reset the light list and los of the players on the map */
1794	if ((op->glow_radius != 0) && map)	1676	if ((op->glow_radius != 0) && map)
1795	{	1677	{
1796	#ifdef DEBUG_LIGHTS	1678	#ifdef DEBUG_LIGHTS
1797	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1679	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1798	#endif /* DEBUG_LIGHTS */	1680	#endif /* DEBUG_LIGHTS */
1799	if (MAP_DARKNESS (map))	1681	if (map->darkness)
1800	update_all_los (map, x, y);	1682	update_all_los (map, x, y);
1801	}	1683	}
1802		1684
1803	/* Client has no idea of ordering so lets not bother ordering it here.	1685	/* Client has no idea of ordering so lets not bother ordering it here.
1804	* It sure simplifies this function...	1686	* It sure simplifies this function...
…		…
1809	{	1691	{
1810	op->below = inv;	1692	op->below = inv;
1811	op->below->above = op;	1693	op->below->above = op;
1812	inv = op;	1694	inv = op;
1813	}	1695	}
		1696
		1697	INVOKE_OBJECT (INSERT, this);
1814		1698
1815	return op;	1699	return op;
1816	}	1700	}
1817		1701
1818	/*	1702	/*
…		…
1833	*	1717	*
1834	* MSW 2001-07-08: Check all objects on space, not just those below	1718	* MSW 2001-07-08: Check all objects on space, not just those below
1835	* object being inserted. insert_ob_in_map may not put new objects	1719	* object being inserted. insert_ob_in_map may not put new objects
1836	* on top.	1720	* on top.
1837	*/	1721	*/
1838
1839	int	1722	int
1840	check_move_on (object *op, object *originator)	1723	check_move_on (object *op, object *originator)
1841	{	1724	{
1842	object *tmp;	1725	object *tmp;
1843	maptile *m = op->map;	1726	maptile *m = op->map;
…		…
1870		1753
1871	/* The objects have to be checked from top to bottom.	1754	/* The objects have to be checked from top to bottom.
1872	* Hence, we first go to the top:	1755	* Hence, we first go to the top:
1873	*/	1756	*/
1874		1757
1875	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1758	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1876	{	1759	{
1877	/* Trim the search when we find the first other spell effect	1760	/* Trim the search when we find the first other spell effect
1878	* this helps performance so that if a space has 50 spell objects,	1761	* this helps performance so that if a space has 50 spell objects,
1879	* we don't need to check all of them.	1762	* we don't need to check all of them.
1880	*/	1763	*/
…		…
1898	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1781	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1899	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1782	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1900	{	1783	{
1901		1784
1902	float	1785	float
1903	diff = tmp->move_slow_penalty * FABS (op->speed);	1786	diff = tmp->move_slow_penalty * fabs (op->speed);
1904		1787
1905	if (op->type == PLAYER)	1788	if (op->type == PLAYER)
1906	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1789	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1907	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1790	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1908	diff /= 4.0;	1791	diff /= 4.0;
…		…
1935	/*	1818	/*
1936	* present_arch(arch, map, x, y) searches for any objects with	1819	* present_arch(arch, map, x, y) searches for any objects with
1937	* a matching archetype at the given map and coordinates.	1820	* a matching archetype at the given map and coordinates.
1938	* The first matching object is returned, or NULL if none.	1821	* The first matching object is returned, or NULL if none.
1939	*/	1822	*/
1940
1941	object *	1823	object *
1942	present_arch (const archetype *at, maptile *m, int x, int y)	1824	present_arch (const archetype *at, maptile *m, int x, int y)
1943	{	1825	{
1944	object *
1945	tmp;
1946
1947	if (m == NULL || out_of_map (m, x, y))	1826	if (!m || out_of_map (m, x, y))
1948	{	1827	{
1949	LOG (llevError, "Present_arch called outside map.\n");	1828	LOG (llevError, "Present_arch called outside map.\n");
1950	return NULL;	1829	return NULL;
1951	}	1830	}
1952	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1831
		1832	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1953	if (tmp->arch == at)	1833	if (tmp->arch == at)
1954	return tmp;	1834	return tmp;
		1835
1955	return NULL;	1836	return NULL;
1956	}	1837	}
1957		1838
1958	/*	1839	/*
1959	* present(type, map, x, y) searches for any objects with	1840	* present(type, map, x, y) searches for any objects with
1960	* a matching type variable at the given map and coordinates.	1841	* a matching type variable at the given map and coordinates.
1961	* The first matching object is returned, or NULL if none.	1842	* The first matching object is returned, or NULL if none.
1962	*/	1843	*/
1963
1964	object *	1844	object *
1965	present (unsigned char type, maptile *m, int x, int y)	1845	present (unsigned char type, maptile *m, int x, int y)
1966	{	1846	{
1967	object *
1968	tmp;
1969
1970	if (out_of_map (m, x, y))	1847	if (out_of_map (m, x, y))
1971	{	1848	{
1972	LOG (llevError, "Present called outside map.\n");	1849	LOG (llevError, "Present called outside map.\n");
1973	return NULL;	1850	return NULL;
1974	}	1851	}
1975	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1852
		1853	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1976	if (tmp->type == type)	1854	if (tmp->type == type)
1977	return tmp;	1855	return tmp;
		1856
1978	return NULL;	1857	return NULL;
1979	}	1858	}
1980		1859
1981	/*	1860	/*
1982	* present_in_ob(type, object) searches for any objects with	1861	* present_in_ob(type, object) searches for any objects with
1983	* a matching type variable in the inventory of the given object.	1862	* a matching type variable in the inventory of the given object.
1984	* The first matching object is returned, or NULL if none.	1863	* The first matching object is returned, or NULL if none.
1985	*/	1864	*/
1986
1987	object *	1865	object *
1988	present_in_ob (unsigned char type, const object *op)	1866	present_in_ob (unsigned char type, const object *op)
1989	{	1867	{
1990	object *
1991	tmp;
1992
1993	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1868	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1994	if (tmp->type == type)	1869	if (tmp->type == type)
1995	return tmp;	1870	return tmp;
		1871
1996	return NULL;	1872	return NULL;
1997	}	1873	}
1998		1874
1999	/*	1875	/*
2000	* present_in_ob (type, str, object) searches for any objects with	1876	* present_in_ob (type, str, object) searches for any objects with
…		…
2008	* str is the string to match against. Note that we match against	1884	* str is the string to match against. Note that we match against
2009	* the object name, not the archetype name. this is so that the	1885	* the object name, not the archetype name. this is so that the
2010	* spell code can use one object type (force), but change it's name	1886	* spell code can use one object type (force), but change it's name
2011	* to be unique.	1887	* to be unique.
2012	*/	1888	*/
2013
2014	object *	1889	object *
2015	present_in_ob_by_name (int type, const char *str, const object *op)	1890	present_in_ob_by_name (int type, const char *str, const object *op)
2016	{	1891	{
2017	object *
2018	tmp;
2019
2020	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1892	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2021	{
2022	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1893	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2023	return tmp;	1894	return tmp;
2024	}	1895
2025	return NULL;	1896	return 0;
2026	}	1897	}
2027		1898
2028	/*	1899	/*
2029	* present_arch_in_ob(archetype, object) searches for any objects with	1900	* present_arch_in_ob(archetype, object) searches for any objects with
2030	* a matching archetype in the inventory of the given object.	1901	* a matching archetype in the inventory of the given object.
2031	* The first matching object is returned, or NULL if none.	1902	* The first matching object is returned, or NULL if none.
2032	*/	1903	*/
2033
2034	object *	1904	object *
2035	present_arch_in_ob (const archetype *at, const object *op)	1905	present_arch_in_ob (const archetype *at, const object *op)
2036	{	1906	{
2037	object *
2038	tmp;
2039
2040	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1907	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2041	if (tmp->arch == at)	1908	if (tmp->arch == at)
2042	return tmp;	1909	return tmp;
		1910
2043	return NULL;	1911	return NULL;
2044	}	1912	}
2045		1913
2046	/*	1914	/*
2047	* activate recursively a flag on an object inventory	1915	* activate recursively a flag on an object inventory
2048	*/	1916	*/
2049	void	1917	void
2050	flag_inv (object *op, int flag)	1918	flag_inv (object *op, int flag)
2051	{	1919	{
2052	object *
2053	tmp;
2054
2055	if (op->inv)	1920	if (op->inv)
2056	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1921	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2057	{	1922	{
2058	SET_FLAG (tmp, flag);	1923	SET_FLAG (tmp, flag);
2059	flag_inv (tmp, flag);	1924	flag_inv (tmp, flag);
2060	}	1925	}
2061	} /*	1926	}
		1927
		1928	/*
2062	* desactivate recursively a flag on an object inventory	1929	* deactivate recursively a flag on an object inventory
2063	*/	1930	*/
2064	void	1931	void
2065	unflag_inv (object *op, int flag)	1932	unflag_inv (object *op, int flag)
2066	{	1933	{
2067	object *
2068	tmp;
2069
2070	if (op->inv)	1934	if (op->inv)
2071	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1935	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2072	{	1936	{
2073	CLEAR_FLAG (tmp, flag);	1937	CLEAR_FLAG (tmp, flag);
2074	unflag_inv (tmp, flag);	1938	unflag_inv (tmp, flag);
2075	}	1939	}
2076	}	1940	}
…		…
2079	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in	1943	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2080	* all it's inventory (recursively).	1944	* all it's inventory (recursively).
2081	* If checksums are used, a player will get set_cheat called for	1945	* If checksums are used, a player will get set_cheat called for
2082	* him/her-self and all object carried by a call to this function.	1946	* him/her-self and all object carried by a call to this function.
2083	*/	1947	*/
2084
2085	void	1948	void
2086	set_cheat (object *op)	1949	set_cheat (object *op)
2087	{	1950	{
2088	SET_FLAG (op, FLAG_WAS_WIZ);	1951	SET_FLAG (op, FLAG_WAS_WIZ);
2089	flag_inv (op, FLAG_WAS_WIZ);	1952	flag_inv (op, FLAG_WAS_WIZ);
…		…
2108	* because arch_blocked (now ob_blocked) needs to know the movement type	1971	* because arch_blocked (now ob_blocked) needs to know the movement type
2109	* to know if the space in question will block the object. We can't use	1972	* to know if the space in question will block the object. We can't use
2110	* the archetype because that isn't correct if the monster has been	1973	* the archetype because that isn't correct if the monster has been
2111	* customized, changed states, etc.	1974	* customized, changed states, etc.
2112	*/	1975	*/
2113
2114	int	1976	int
2115	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1977	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2116	{	1978	{
2117	int
2118	i,
2119	index = 0, flag;	1979	int index = 0, flag;
2120	static int
2121	altern[SIZEOFFREE];	1980	int altern[SIZEOFFREE];
2122		1981
2123	for (i = start; i < stop; i++)	1982	for (int i = start; i < stop; i++)
2124	{	1983	{
2125	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1984	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2126	if (!flag)	1985	if (!flag)
2127	altern[index++] = i;	1986	altern [index++] = i;
2128		1987
2129	/* Basically, if we find a wall on a space, we cut down the search size.	1988	/* Basically, if we find a wall on a space, we cut down the search size.
2130	* In this way, we won't return spaces that are on another side of a wall.	1989	* In this way, we won't return spaces that are on another side of a wall.
2131	* This mostly work, but it cuts down the search size in all directions -	1990	* This mostly work, but it cuts down the search size in all directions -
2132	* if the space being examined only has a wall to the north and empty	1991	* if the space being examined only has a wall to the north and empty
2133	* spaces in all the other directions, this will reduce the search space	1992	* spaces in all the other directions, this will reduce the search space
2134	* to only the spaces immediately surrounding the target area, and	1993	* to only the spaces immediately surrounding the target area, and
2135	* won't look 2 spaces south of the target space.	1994	* won't look 2 spaces south of the target space.
2136	*/	1995	*/
2137	else if ((flag & AB_NO_PASS) && maxfree[i] < stop)	1996	else if ((flag & P_NO_PASS) && maxfree[i] < stop)
2138	stop = maxfree[i];	1997	stop = maxfree[i];
2139	}	1998	}
		1999
2140	if (!index)	2000	if (!index)
2141	return -1;	2001	return -1;
		2002
2142	return altern[RANDOM () % index];	2003	return altern [rndm (index)];
2143	}	2004	}
2144		2005
2145	/*	2006	/*
2146	* find_first_free_spot(archetype, maptile, x, y) works like	2007	* find_first_free_spot(archetype, maptile, x, y) works like
2147	* find_free_spot(), but it will search max number of squares.	2008	* find_free_spot(), but it will search max number of squares.
2148	* But it will return the first available spot, not a random choice.	2009	* But it will return the first available spot, not a random choice.
2149	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2010	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2150	*/	2011	*/
2151
2152	int	2012	int
2153	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2013	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2154	{	2014	{
2155	int
2156	i;
2157
2158	for (i = 0; i < SIZEOFFREE; i++)	2015	for (int i = 0; i < SIZEOFFREE; i++)
2159	{
2160	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2016	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2161	return i;	2017	return i;
2162	}	2018
2163	return -1;	2019	return -1;
2164	}	2020	}
2165		2021
2166	/*	2022	/*
2167	* The function permute(arr, begin, end) randomly reorders the array	2023	* The function permute(arr, begin, end) randomly reorders the array
2168	* arr[begin..end-1].	2024	* arr[begin..end-1].
		2025	* now uses a fisher-yates shuffle, old permute was broken
2169	*/	2026	*/
2170	static void	2027	static void
2171	permute (int *arr, int begin, int end)	2028	permute (int *arr, int begin, int end)
2172	{	2029	{
2173	int	2030	arr += begin;
2174	i,
2175	j,
2176	tmp,
2177	len;
2178
2179	len = end - begin;	2031	end -= begin;
2180	for (i = begin; i < end; i++)
2181	{
2182	j = begin + RANDOM () % len;
2183		2032
2184	tmp = arr[i];	2033	while (--end)
2185	arr[i] = arr[j];	2034	swap (arr [end], arr [rndm (end + 1)]);
2186	arr[j] = tmp;
2187	}
2188	}	2035	}
2189		2036
2190	/* new function to make monster searching more efficient, and effective!	2037	/* new function to make monster searching more efficient, and effective!
2191	* This basically returns a randomized array (in the passed pointer) of	2038	* This basically returns a randomized array (in the passed pointer) of
2192	* the spaces to find monsters. In this way, it won't always look for	2039	* the spaces to find monsters. In this way, it won't always look for
…		…
2195	* the 3x3 area will be searched, just not in a predictable order.	2042	* the 3x3 area will be searched, just not in a predictable order.
2196	*/	2043	*/
2197	void	2044	void
2198	get_search_arr (int *search_arr)	2045	get_search_arr (int *search_arr)
2199	{	2046	{
2200	int	2047	int i;
2201	i;
2202		2048
2203	for (i = 0; i < SIZEOFFREE; i++)	2049	for (i = 0; i < SIZEOFFREE; i++)
2204	{
2205	search_arr[i] = i;	2050	search_arr[i] = i;
2206	}
2207		2051
2208	permute (search_arr, 1, SIZEOFFREE1 + 1);	2052	permute (search_arr, 1, SIZEOFFREE1 + 1);
2209	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2053	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2210	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2054	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2211	}	2055	}
…		…
2220	* Perhaps incorrectly, but I'm making the assumption that exclude	2064	* Perhaps incorrectly, but I'm making the assumption that exclude
2221	* is actually want is going to try and move there. We need this info	2065	* is actually want is going to try and move there. We need this info
2222	* because we have to know what movement the thing looking to move	2066	* because we have to know what movement the thing looking to move
2223	* there is capable of.	2067	* there is capable of.
2224	*/	2068	*/
2225
2226	int	2069	int
2227	find_dir (maptile *m, int x, int y, object *exclude)	2070	find_dir (maptile *m, int x, int y, object *exclude)
2228	{	2071	{
2229	int
2230	i,
2231	max = SIZEOFFREE, mflags;	2072	int i, max = SIZEOFFREE, mflags;
2232		2073
2233	sint16 nx, ny;	2074	sint16 nx, ny;
2234	object *	2075	object *tmp;
2235	tmp;
2236	maptile *	2076	maptile *mp;
2237	mp;
2238		2077
2239	MoveType blocked, move_type;	2078	MoveType blocked, move_type;
2240		2079
2241	if (exclude && exclude->head)	2080	if (exclude && exclude->head)
2242	{	2081	{
…		…
2254	mp = m;	2093	mp = m;
2255	nx = x + freearr_x[i];	2094	nx = x + freearr_x[i];
2256	ny = y + freearr_y[i];	2095	ny = y + freearr_y[i];
2257		2096
2258	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2097	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
		2098
2259	if (mflags & P_OUT_OF_MAP)	2099	if (mflags & P_OUT_OF_MAP)
2260	{
2261	max = maxfree[i];	2100	max = maxfree[i];
2262	}
2263	else	2101	else
2264	{	2102	{
2265	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2103	mapspace &ms = mp->at (nx, ny);
		2104
		2105	blocked = ms.move_block;
2266		2106
2267	if ((move_type & blocked) == move_type)	2107	if ((move_type & blocked) == move_type)
2268	{
2269	max = maxfree[i];	2108	max = maxfree[i];
2270	}
2271	else if (mflags & P_IS_ALIVE)	2109	else if (mflags & P_IS_ALIVE)
2272	{	2110	{
2273	for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)	2111	for (tmp = ms.bot; tmp; tmp = tmp->above)
2274	{	2112	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2275	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2113	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))
2276	{
2277	break;	2114	break;
2278	}	2115
2279	}
2280	if (tmp)	2116	if (tmp)
2281	{
2282	return freedir[i];	2117	return freedir[i];
2283	}
2284	}	2118	}
2285	}	2119	}
2286	}	2120	}
		2121
2287	return 0;	2122	return 0;
2288	}	2123	}
2289		2124
2290	/*	2125	/*
2291	* distance(object 1, object 2) will return the square of the	2126	* distance(object 1, object 2) will return the square of the
2292	* distance between the two given objects.	2127	* distance between the two given objects.
2293	*/	2128	*/
2294
2295	int	2129	int
2296	distance (const object *ob1, const object *ob2)	2130	distance (const object *ob1, const object *ob2)
2297	{	2131	{
2298	int
2299	i;
2300
2301	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2132	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2302	return i;
2303	}	2133	}
2304		2134
2305	/*	2135	/*
2306	* find_dir_2(delta-x,delta-y) will return a direction in which	2136	* find_dir_2(delta-x,delta-y) will return a direction in which
2307	* an object which has subtracted the x and y coordinates of another	2137	* an object which has subtracted the x and y coordinates of another
2308	* object, needs to travel toward it.	2138	* object, needs to travel toward it.
2309	*/	2139	*/
2310
2311	int	2140	int
2312	find_dir_2 (int x, int y)	2141	find_dir_2 (int x, int y)
2313	{	2142	{
2314	int	2143	int q;
2315	q;
2316		2144
2317	if (y)	2145	if (y)
2318	q = x * 100 / y;	2146	q = x * 100 / y;
2319	else if (x)	2147	else if (x)
2320	q = -300 * x;	2148	q = -300 * x;
…		…
2345		2173
2346	return 3;	2174	return 3;
2347	}	2175	}
2348		2176
2349	/*	2177	/*
2350	* absdir(int): Returns a number between 1 and 8, which represent
2351	* the "absolute" direction of a number (it actually takes care of
2352	* "overflow" in previous calculations of a direction).
2353	*/
2354
2355	int
2356	absdir (int d)
2357	{
2358	while (d < 1)
2359	d += 8;
2360	while (d > 8)
2361	d -= 8;
2362	return d;
2363	}
2364
2365	/*
2366	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2178	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2367	* between two directions (which are expected to be absolute (see absdir())	2179	* between two directions (which are expected to be absolute (see absdir())
2368	*/	2180	*/
2369
2370	int	2181	int
2371	dirdiff (int dir1, int dir2)	2182	dirdiff (int dir1, int dir2)
2372	{	2183	{
2373	int	2184	int d;
2374	d;
2375		2185
2376	d = abs (dir1 - dir2);	2186	d = abs (dir1 - dir2);
2377	if (d > 4)	2187	if (d > 4)
2378	d = 8 - d;	2188	d = 8 - d;
		2189
2379	return d;	2190	return d;
2380	}	2191	}
2381		2192
2382	/* peterm:	2193	/* peterm:
2383	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2194	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2386	* This basically means that if direction is 15, then it could either go	2197	* This basically means that if direction is 15, then it could either go
2387	* direction 4, 14, or 16 to get back to where we are.	2198	* direction 4, 14, or 16 to get back to where we are.
2388	* Moved from spell_util.c to object.c with the other related direction	2199	* Moved from spell_util.c to object.c with the other related direction
2389	* functions.	2200	* functions.
2390	*/	2201	*/
2391
2392	int
2393	reduction_dir[SIZEOFFREE][3] = {	2202	int reduction_dir[SIZEOFFREE][3] = {
2394	{0, 0, 0}, /* 0 */	2203	{0, 0, 0}, /* 0 */
2395	{0, 0, 0}, /* 1 */	2204	{0, 0, 0}, /* 1 */
2396	{0, 0, 0}, /* 2 */	2205	{0, 0, 0}, /* 2 */
2397	{0, 0, 0}, /* 3 */	2206	{0, 0, 0}, /* 3 */
2398	{0, 0, 0}, /* 4 */	2207	{0, 0, 0}, /* 4 */
…		…
2446	* find a path to that monster that we found. If not,	2255	* find a path to that monster that we found. If not,
2447	* we don't bother going toward it. Returns 1 if we	2256	* we don't bother going toward it. Returns 1 if we
2448	* can see a direct way to get it	2257	* can see a direct way to get it
2449	* Modified to be map tile aware -.MSW	2258	* Modified to be map tile aware -.MSW
2450	*/	2259	*/
2451
2452
2453	int	2260	int
2454	can_see_monsterP (maptile *m, int x, int y, int dir)	2261	can_see_monsterP (maptile *m, int x, int y, int dir)
2455	{	2262	{
2456	sint16 dx, dy;	2263	sint16 dx, dy;
2457	int
2458	mflags;	2264	int mflags;
2459		2265
2460	if (dir < 0)	2266	if (dir < 0)
2461	return 0; /* exit condition: invalid direction */	2267	return 0; /* exit condition: invalid direction */
2462		2268
2463	dx = x + freearr_x[dir];	2269	dx = x + freearr_x[dir];
…		…
2476	return 0;	2282	return 0;
2477		2283
2478	/* yes, can see. */	2284	/* yes, can see. */
2479	if (dir < 9)	2285	if (dir < 9)
2480	return 1;	2286	return 1;
		2287
2481	return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |	2288	return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2482	can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);	2289	| can_see_monsterP (m, x, y, reduction_dir[dir][1])
		2290	| can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2483	}	2291	}
2484
2485
2486		2292
2487	/*	2293	/*
2488	* can_pick(picker, item): finds out if an object is possible to be	2294	* can_pick(picker, item): finds out if an object is possible to be
2489	* picked up by the picker. Returnes 1 if it can be	2295	* picked up by the picker. Returnes 1 if it can be
2490	* picked up, otherwise 0.	2296	* picked up, otherwise 0.
…		…
2501	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2307	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2502	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2308	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2503	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2309	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2504	}	2310	}
2505		2311
2506
2507	/*	2312	/*
2508	* create clone from object to another	2313	* create clone from object to another
2509	*/	2314	*/
2510	object *	2315	object *
2511	object_create_clone (object *asrc)	2316	object_create_clone (object *asrc)
…		…
2530	{	2335	{
2531	dst = tmp;	2336	dst = tmp;
2532	tmp->head = 0;	2337	tmp->head = 0;
2533	}	2338	}
2534	else	2339	else
2535	{
2536	tmp->head = dst;	2340	tmp->head = dst;
2537	}
2538		2341
2539	tmp->more = 0;	2342	tmp->more = 0;
2540		2343
2541	if (prev)	2344	if (prev)
2542	prev->more = tmp;	2345	prev->more = tmp;
…		…
2546		2349
2547	for (item = src->inv; item; item = item->below)	2350	for (item = src->inv; item; item = item->below)
2548	insert_ob_in_ob (object_create_clone (item), dst);	2351	insert_ob_in_ob (object_create_clone (item), dst);
2549		2352
2550	return dst;	2353	return dst;
2551	}
2552
2553	/* GROS - Creates an object using a string representing its content. */
2554	/* Basically, we save the content of the string to a temp file, then call */
2555	/* load_object on it. I admit it is a highly inefficient way to make things, */
2556	/* but it was simple to make and allows reusing the load_object function. */
2557	/* Remember not to use load_object_str in a time-critical situation. */
2558	/* Also remember that multiparts objects are not supported for now. */
2559
2560	object *
2561	load_object_str (const char *obstr)
2562	{
2563	object *op;
2564	char filename[MAX_BUF];
2565
2566	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2567
2568	FILE *tempfile = fopen (filename, "w");
2569
2570	if (tempfile == NULL)
2571	{
2572	LOG (llevError, "Error - Unable to access load object temp file\n");
2573	return NULL;
2574	}
2575
2576	fprintf (tempfile, obstr);
2577	fclose (tempfile);
2578
2579	op = object::create ();
2580
2581	object_thawer thawer (filename);
2582
2583	if (thawer)
2584	load_object (thawer, op, 0);
2585
2586	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2587	CLEAR_FLAG (op, FLAG_REMOVED);
2588
2589	return op;
2590	}	2354	}
2591		2355
2592	/* This returns the first object in who's inventory that	2356	/* This returns the first object in who's inventory that
2593	* has the same type and subtype match.	2357	* has the same type and subtype match.
2594	* returns NULL if no match.	2358	* returns NULL if no match.
2595	*/	2359	*/
2596	object *	2360	object *
2597	find_obj_by_type_subtype (const object *who, int type, int subtype)	2361	find_obj_by_type_subtype (const object *who, int type, int subtype)
2598	{	2362	{
2599	object *tmp;
2600
2601	for (tmp = who->inv; tmp; tmp = tmp->below)	2363	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2602	if (tmp->type == type && tmp->subtype == subtype)	2364	if (tmp->type == type && tmp->subtype == subtype)
2603	return tmp;	2365	return tmp;
2604		2366
2605	return NULL;	2367	return 0;
2606	}	2368	}
2607		2369
2608	/* If ob has a field named key, return the link from the list,	2370	/* If ob has a field named key, return the link from the list,
2609	* otherwise return NULL.	2371	* otherwise return NULL.
2610	*	2372	*
…		…
2612	* do the desired thing.	2374	* do the desired thing.
2613	*/	2375	*/
2614	key_value *	2376	key_value *
2615	get_ob_key_link (const object *ob, const char *key)	2377	get_ob_key_link (const object *ob, const char *key)
2616	{	2378	{
2617	key_value *link;
2618
2619	for (link = ob->key_values; link != NULL; link = link->next)	2379	for (key_value *link = ob->key_values; link; link = link->next)
2620	if (link->key == key)	2380	if (link->key == key)
2621	return link;	2381	return link;
2622		2382
2623	return NULL;	2383	return 0;
2624	}	2384	}
2625		2385
2626	/*	2386	/*
2627	* Returns the value of op has an extra_field for key, or NULL.	2387	* Returns the value of op has an extra_field for key, or NULL.
2628	*	2388	*
…		…
2653	if (link->key == canonical_key)	2413	if (link->key == canonical_key)
2654	return link->value;	2414	return link->value;
2655		2415
2656	return 0;	2416	return 0;
2657	}	2417	}
2658
2659		2418
2660	/*	2419	/*
2661	* Updates the canonical_key in op to value.	2420	* Updates the canonical_key in op to value.
2662	*	2421	*
2663	* canonical_key is a shared string (value doesn't have to be).	2422	* canonical_key is a shared string (value doesn't have to be).
…		…
2668	* Returns TRUE on success.	2427	* Returns TRUE on success.
2669	*/	2428	*/
2670	int	2429	int
2671	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2430	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2672	{	2431	{
2673	key_value *
2674	field = NULL, *last = NULL;	2432	key_value *field = NULL, *last = NULL;
2675		2433
2676	for (field = op->key_values; field != NULL; field = field->next)	2434	for (field = op->key_values; field != NULL; field = field->next)
2677	{	2435	{
2678	if (field->key != canonical_key)	2436	if (field->key != canonical_key)
2679	{	2437	{
…		…
2707	/* IF we get here, key doesn't exist */	2465	/* IF we get here, key doesn't exist */
2708		2466
2709	/* No field, we'll have to add it. */	2467	/* No field, we'll have to add it. */
2710		2468
2711	if (!add_key)	2469	if (!add_key)
2712	{
2713	return FALSE;	2470	return FALSE;
2714	}	2471
2715	/* There isn't any good reason to store a null	2472	/* There isn't any good reason to store a null
2716	* value in the key/value list. If the archetype has	2473	* value in the key/value list. If the archetype has
2717	* this key, then we should also have it, so shouldn't	2474	* this key, then we should also have it, so shouldn't
2718	* be here. If user wants to store empty strings,	2475	* be here. If user wants to store empty strings,
2719	* should pass in ""	2476	* should pass in ""
…		…
2768	}	2525	}
2769	else	2526	else
2770	item = item->env;	2527	item = item->env;
2771	}	2528	}
2772		2529
		2530
		2531	const char *
		2532	object::flag_desc (char *desc, int len) const
		2533	{
		2534	char *p = desc;
		2535	bool first = true;
		2536
		2537	*p = 0;
		2538
		2539	for (int i = 0; i < NUM_FLAGS; i++)
		2540	{
		2541	if (len <= 10) // magic constant!
		2542	{
		2543	snprintf (p, len, ",...");
		2544	break;
		2545	}
		2546
		2547	if (flag [i])
		2548	{
		2549	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2550	len -= cnt;
		2551	p += cnt;
		2552	first = false;
		2553	}
		2554	}
		2555
		2556	return desc;
		2557	}
		2558
2773	// return a suitable string describing an objetc in enough detail to find it	2559	// return a suitable string describing an object in enough detail to find it
2774	const char *	2560	const char *
2775	object::debug_desc (char *info) const	2561	object::debug_desc (char *info) const
2776	{	2562	{
		2563	char flagdesc[512];
2777	char info2[256 * 3];	2564	char info2[256 * 4];
2778	char *p = info;	2565	char *p = info;
2779		2566
2780	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2567	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2781	count,	2568	count, uuid.seq,
2782	&name,	2569	&name,
2783	title ? " " : "",	2570	title ? "\",title:\"" : "",
2784	title ? (const char *)title : "");	2571	title ? (const char *)title : "",
		2572	flag_desc (flagdesc, 512), type);
2785		2573
2786	if (env)	2574	if (env)
2787	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2575	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2788		2576
2789	if (map)	2577	if (map)
2790	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2578	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2791		2579
2792	return info;	2580	return info;
2793	}	2581	}
2794		2582
2795	const char *	2583	const char *
2796	object::debug_desc () const	2584	object::debug_desc () const
2797	{	2585	{
2798	static char info[256 * 3];	2586	static char info[256 * 4];
2799	return debug_desc (info);	2587	return debug_desc (info);
2800	}	2588	}
2801		2589
		2590	const char *
		2591	object::debug_desc2 () const
		2592	{
		2593	static char info[256 * 4];
		2594	return debug_desc (info);
		2595	}
		2596
		2597	struct region *
		2598	object::region () const
		2599	{
		2600	return map ? map->region (x, y)
		2601	: region::default_region ();
		2602	}
		2603
		2604	const materialtype_t *
		2605	object::dominant_material () const
		2606	{
		2607	if (materialtype_t *mat = name_to_material (materialname))
		2608	return mat;
		2609
		2610	// omfg this is slow, this has to be temporary :)
		2611	shstr unknown ("unknown");
		2612
		2613	return name_to_material (unknown);
		2614	}
		2615
		2616	void
		2617	object::open_container (object *new_container)
		2618	{
		2619	if (container == new_container)
		2620	return;
		2621
		2622	if (object *old_container = container)
		2623	{
		2624	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2625	return;
		2626
		2627	#if 0
		2628	// remove the "Close old_container" object.
		2629	if (object *closer = old_container->inv)
		2630	if (closer->type == CLOSE_CON)
		2631	closer->destroy ();
		2632	#endif
		2633
		2634	old_container->flag [FLAG_APPLIED] = 0;
		2635	container = 0;
		2636
		2637	esrv_update_item (UPD_FLAGS, this, old_container);
		2638	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2639	}
		2640
		2641	if (new_container)
		2642	{
		2643	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2644	return;
		2645
		2646	// TODO: this does not seem to serve any purpose anymore?
		2647	#if 0
		2648	// insert the "Close Container" object.
		2649	if (archetype *closer = new_container->other_arch)
		2650	{
		2651	object *closer = arch_to_object (new_container->other_arch);
		2652	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2653	new_container->insert (closer);
		2654	}
		2655	#endif
		2656
		2657	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2658
		2659	new_container->flag [FLAG_APPLIED] = 1;
		2660	container = new_container;
		2661
		2662	esrv_update_item (UPD_FLAGS, this, new_container);
		2663	esrv_send_inventory (this, new_container);
		2664	}
		2665	}
		2666
		2667

Diff Legend

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