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

Diff Legend

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