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

Diff Legend

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