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.75 by root, Wed Dec 20 11:36:38 2006 UTC vs.
Revision 1.148 by root, Mon May 14 19:08:25 2007 UTC

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

Diff Legend

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