ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.74 by root, Wed Dec 20 09:14:21 2006 UTC vs.
Revision 1.173 by root, Sat Aug 4 22:23:47 2007 UTC

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

Diff Legend

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