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.28 by root, Mon Sep 11 12:10:21 2006 UTC vs.
Revision 1.58 by pippijn, Mon Dec 4 17:48:35 2006 UTC

…		…
16		16
17	You should have received a copy of the GNU General Public License	17	You should have received a copy of the GNU General Public License
18	along with this program; if not, write to the Free Software	18	along with this program; if not, write to the Free Software
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20		20
21	The authors can be reached via e-mail at crossfire-devel@real-time.com	21	The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	22	*/
23		23
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
26	variable. */	26	variable. */
…		…
28	#include <stdio.h>	28	#include <stdio.h>
29	#include <sys/types.h>	29	#include <sys/types.h>
30	#include <sys/uio.h>	30	#include <sys/uio.h>
31	#include <object.h>	31	#include <object.h>
32	#include <funcpoint.h>	32	#include <funcpoint.h>
33	#include <skills.h>
34	#include <loader.h>	33	#include <loader.h>
35		34
36	int nrofallocobjects = 0;	35	int nrofallocobjects = 0;
		36	static UUID uuid;
		37	const uint64 UUID_SKIP = 1<<19;
37		38
38	object *objects; /* Pointer to the list of used objects */
39	object *active_objects; /* List of active objects that need to be processed */	39	object *active_objects; /* List of active objects that need to be processed */
40		40
41	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	41	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
42	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	42	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
43	};	43	};
…		…
49	};	49	};
50	int freedir[SIZEOFFREE] = {	50	int freedir[SIZEOFFREE] = {
51	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	51	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
52	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	52	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
53	};	53	};
		54
		55	static void
		56	write_uuid (void)
		57	{
		58	char filename1[MAX_BUF], filename2[MAX_BUF];
		59
		60	sprintf (filename1, "%s/uuid", settings.localdir);
		61	sprintf (filename2, "%s/uuid~", settings.localdir);
		62
		63	FILE *fp;
		64
		65	if (!(fp = fopen (filename2, "w")))
		66	{
		67	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
		68	return;
		69	}
		70
		71	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
		72	fclose (fp);
		73	rename (filename2, filename1);
		74	}
		75
		76	static void
		77	read_uuid (void)
		78	{
		79	char filename[MAX_BUF];
		80
		81	sprintf (filename, "%s/uuid", settings.localdir);
		82
		83	FILE *fp;
		84
		85	if (!(fp = fopen (filename, "r")))
		86	{
		87	if (errno == ENOENT)
		88	{
		89	LOG (llevInfo, "RESET uid to 1\n");
		90	uuid.seq = 0;
		91	write_uuid ();
		92	return;
		93	}
		94
		95	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
		96	_exit (1);
		97	}
		98
		99	int version;
		100	unsigned long long uid;
		101	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)
		102	{
		103	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);
		104	_exit (1);
		105	}
		106
		107	uuid.seq = uid;
		108	write_uuid ();
		109	LOG (llevDebug, "read UID: %lld\n", uid);
		110	fclose (fp);
		111	}
		112
		113	UUID
		114	gen_uuid ()
		115	{
		116	UUID uid;
		117
		118	uid.seq = ++uuid.seq;
		119
		120	if (!(uuid.seq & (UUID_SKIP - 1)))
		121	write_uuid ();
		122
		123	return uid;
		124	}
		125
		126	void
		127	init_uuid ()
		128	{
		129	read_uuid ();
		130	}
54		131
55	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	132	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
56	static int	133	static int
57	compare_ob_value_lists_one (const object *wants, const object *has)	134	compare_ob_value_lists_one (const object *wants, const object *has)
58	{	135	{
…		…
207	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	284	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)
208	return 0;	285	return 0;
209		286
210	switch (ob1->type)	287	switch (ob1->type)
211	{	288	{
212	case SCROLL:	289	case SCROLL:
213	if (ob1->level != ob2->level)	290	if (ob1->level != ob2->level)
214	return 0;	291	return 0;
215	break;	292	break;
216	}	293	}
217		294
218	if (ob1->key_values != NULL || ob2->key_values != NULL)	295	if (ob1->key_values != NULL || ob2->key_values != NULL)
219	{	296	{
220	/* At least one of these has key_values. */	297	/* At least one of these has key_values. */
…		…
254	{	331	{
255	if (inv->inv)	332	if (inv->inv)
256	sum_weight (inv);	333	sum_weight (inv);
257	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
258	}	335	}
		336
259	if (op->type == CONTAINER && op->stats.Str)	337	if (op->type == CONTAINER && op->stats.Str)
260	sum = (sum * (100 - op->stats.Str)) / 100;	338	sum = (sum * (100 - op->stats.Str)) / 100;
		339
261	if (op->carrying != sum)	340	if (op->carrying != sum)
262	op->carrying = sum;	341	op->carrying = sum;
		342
263	return sum;	343	return sum;
264	}	344	}
265		345
266	/**	346	/**
267	* Return the outermost environment object for a given object.	347	* Return the outermost environment object for a given object.
…		…
294	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	374	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
295	* Some error messages.	375	* Some error messages.
296	* The result of the dump is stored in the static global errmsg array.	376	* The result of the dump is stored in the static global errmsg array.
297	*/	377	*/
298		378
299	void	379	char *
300	dump_object2 (object *op)
301	{
302	errmsg[0] = 0;
303	return;
304	//TODO//D#d#
305	#if 0
306	char *cp;
307
308	/* object *tmp;*/
309
310	if (op->arch != NULL)
311	{
312	strcat (errmsg, "arch ");
313	strcat (errmsg, op->arch->name ? op->arch->name : "(null)");
314	strcat (errmsg, "\n");
315	if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
316	strcat (errmsg, cp);
317	# if 0
318	/* Don't dump player diffs - they are too long, mostly meaningless, and
319	* will overflow the buffer.
320	* Changed so that we don't dump inventory either. This may
321	* also overflow the buffer.
322	*/
323	if (op->type != PLAYER && (cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
324	strcat (errmsg, cp);
325	for (tmp = op->inv; tmp; tmp = tmp->below)
326	dump_object2 (tmp);
327	# endif
328	strcat (errmsg, "end\n");
329	}
330	else
331	{
332	strcat (errmsg, "Object ");
333	if (op->name == NULL)
334	strcat (errmsg, "(null)");
335	else
336	strcat (errmsg, op->name);
337	strcat (errmsg, "\n");
338	# if 0
339	if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
340	strcat (errmsg, cp);
341	for (tmp = op->inv; tmp; tmp = tmp->below)
342	dump_object2 (tmp);
343	# endif
344	strcat (errmsg, "end\n");
345	}
346	#endif
347	}
348
349	/*
350	* Dumps an object. Returns output in the static global errmsg array.
351	*/
352
353	void
354	dump_object (object *op)	380	dump_object (object *op)
355	{	381	{
356	if (op == NULL)	382	if (!op)
357	{	383	return strdup ("[NULLOBJ]");
358	strcpy (errmsg, "[NULL pointer]");
359	return;
360	}
361	errmsg[0] = '\0';
362	dump_object2 (op);
363	}
364		384
365	void	385	object_freezer freezer;
366	dump_all_objects (void)	386	save_object (freezer, op, 3);
367	{	387	return freezer.as_string ();
368	object *op;
369
370	for (op = objects; op != NULL; op = op->next)
371	{
372	dump_object (op);
373	fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg);
374	}
375	}	388	}
376		389
377	/*	390	/*
378	* get_nearest_part(multi-object, object 2) returns the part of the	391	* get_nearest_part(multi-object, object 2) returns the part of the
379	* multi-object 1 which is closest to the second object.	392	* multi-object 1 which is closest to the second object.
…		…
399	*/	412	*/
400		413
401	object *	414	object *
402	find_object (tag_t i)	415	find_object (tag_t i)
403	{	416	{
404	object *op;	417	for (object *op = object::first; op; op = op->next)
405
406	for (op = objects; op != NULL; op = op->next)
407	if (op->count == i)	418	if (op->count == i)
408	break;	419	return op;
		420
409	return op;	421	return 0;
410	}	422	}
411		423
412	/*	424	/*
413	* Returns the first object which has a name equal to the argument.	425	* Returns the first object which has a name equal to the argument.
414	* Used only by the patch command, but not all that useful.	426	* Used only by the patch command, but not all that useful.
…		…
416	*/	428	*/
417		429
418	object *	430	object *
419	find_object_name (const char *str)	431	find_object_name (const char *str)
420	{	432	{
421	const char *name = shstr::find (str);	433	shstr_cmp str_ (str);
422	object *op;	434	object *op;
423		435
424	for (op = objects; op != NULL; op = op->next)	436	for (op = object::first; op != NULL; op = op->next)
425	if (&op->name == name)	437	if (op->name == str_)
426	break;	438	break;
427		439
428	return op;	440	return op;
429	}	441	}
430		442
…		…
433	{	445	{
434	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);	446	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
435	}	447	}
436		448
437	/*	449	/*
438	* Returns the object which this object marks as being the owner.
439	* A id-scheme is used to avoid pointing to objects which have been
440	* freed and are now reused. If this is detected, the owner is
441	* set to NULL, and NULL is returned.
442	* Changed 2004-02-12 - if the player is setting at the play again
443	* prompt, he is removed, and we don't want to treat him as an owner of
444	* anything, so check removed flag. I don't expect that this should break
445	* anything - once an object is removed, it is basically dead anyways.
446	*/
447
448	object *
449	get_owner (object *op)
450	{
451	if (op->owner == NULL)
452	return NULL;
453
454	if (!QUERY_FLAG (op->owner, FLAG_FREED) && !QUERY_FLAG (op->owner, FLAG_REMOVED) && op->owner->count == op->ownercount)
455	return op->owner;
456
457	op->owner = NULL;
458	op->ownercount = 0;
459	return NULL;
460	}
461
462	void
463	clear_owner (object *op)
464	{
465	if (!op)
466	return;
467
468	if (op->owner && op->ownercount == op->owner->count)
469	op->owner->refcount--;
470
471	op->owner = NULL;
472	op->ownercount = 0;
473	}
474
475	/*
476	* Sets the owner and sets the skill and exp pointers to owner's current	450	* Sets the owner and sets the skill and exp pointers to owner's current
477	* skill and experience objects.	451	* skill and experience objects.
478	*/	452	*/
479	void	453	void
480	set_owner (object *op, object *owner)	454	object::set_owner (object *owner)
481	{	455	{
482	if (owner == NULL || op == NULL)	456	if (!owner)
483	return;	457	return;
484		458
485	/* next line added to allow objects which own objects */	459	/* next line added to allow objects which own objects */
486	/* Add a check for ownercounts in here, as I got into an endless loop	460	/* Add a check for ownercounts in here, as I got into an endless loop
487	* with the fireball owning a poison cloud which then owned the	461	* with the fireball owning a poison cloud which then owned the
488	* fireball. I believe that was caused by one of the objects getting	462	* fireball. I believe that was caused by one of the objects getting
489	* freed and then another object replacing it. Since the ownercounts	463	* freed and then another object replacing it. Since the ownercounts
490	* didn't match, this check is valid and I believe that cause is valid.	464	* didn't match, this check is valid and I believe that cause is valid.
491	*/	465	*/
492	while (owner->owner && owner != owner->owner && owner->ownercount == owner->owner->count)	466	while (owner->owner)
493	owner = owner->owner;	467	owner = owner->owner;
494		468
495	/* IF the owner still has an owner, we did not resolve to a final owner.
496	* so lets not add to that.
497	*/
498	if (owner->owner)
499	return;
500
501	op->owner = owner;	469	this->owner = owner;
502
503	op->ownercount = owner->count;
504	owner->refcount++;
505	}
506
507	/* Set the owner to clone's current owner and set the skill and experience
508	* objects to clone's objects (typically those objects that where the owner's
509	* current skill and experience objects at the time when clone's owner was
510	* set - not the owner's current skill and experience objects).
511	*
512	* Use this function if player created an object (e.g. fire bullet, swarm
513	* spell), and this object creates further objects whose kills should be
514	* accounted for the player's original skill, even if player has changed
515	* skills meanwhile.
516	*/
517	void
518	copy_owner (object *op, object *clone)
519	{
520	object *owner = get_owner (clone);
521
522	if (owner == NULL)
523	{
524	/* players don't have owners - they own themselves. Update
525	* as appropriate.
526	*/
527	if (clone->type == PLAYER)
528	owner = clone;
529	else
530	return;
531	}
532
533	set_owner (op, owner);
534	}	470	}
535		471
536	/* Zero the key_values on op, decrementing the shared-string	472	/* Zero the key_values on op, decrementing the shared-string
537	* refcounts and freeing the links.	473	* refcounts and freeing the links.
538	*/	474	*/
…		…
554	{	490	{
555	attachable_base::clear ();	491	attachable_base::clear ();
556		492
557	free_key_values (this);	493	free_key_values (this);
558		494
559	clear_owner (this);	495	owner = 0;
560
561	name = 0;	496	name = 0;
562	name_pl = 0;	497	name_pl = 0;
563	title = 0;	498	title = 0;
564	race = 0;	499	race = 0;
565	slaying = 0;	500	slaying = 0;
566	skill = 0;	501	skill = 0;
567	msg = 0;	502	msg = 0;
568	lore = 0;	503	lore = 0;
569	custom_name = 0;	504	custom_name = 0;
570	materialname = 0;	505	materialname = 0;
		506	contr = 0;
		507	below = 0;
		508	above = 0;
		509	inv = 0;
		510	container = 0;
		511	env = 0;
		512	more = 0;
		513	head = 0;
		514	map = 0;
		515	active_next = 0;
		516	active_prev = 0;
571		517
572	memset (static_cast < object_pod * >(this), 0, sizeof (object_pod));	518	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
573		519
574	SET_FLAG (this, FLAG_REMOVED);	520	SET_FLAG (this, FLAG_REMOVED);
		521
		522	/* What is not cleared is next, prev, and count */
		523
		524	expmul = 1.0;
		525	face = blank_face;
		526
		527	if (settings.casting_time)
		528	casting_time = -1;
575	}	529	}
576		530
577	void object::clone (object *destination)	531	void object::clone (object *destination)
578	{	532	{
579	*(object_copy *) destination = *this;	533	*(object_copy *)destination = *this;
580	*(object_pod *) destination = *this;	534	*(object_pod *)destination = *this;
581		535
582	if (self || cb)	536	if (self || cb)
583	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));	537	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
584	}
585
586	/*
587	* clear_object() frees everything allocated by an object, and also
588	* clears all variables and flags to default settings.
589	*/
590
591	void
592	clear_object (object *op)
593	{
594	op->clear ();
595
596	op->contr = NULL;
597	op->below = NULL;
598	op->above = NULL;
599	op->inv = NULL;
600	op->container = NULL;
601	op->env = NULL;
602	op->more = NULL;
603	op->head = NULL;
604	op->map = NULL;
605	op->refcount = 0;
606	op->active_next = NULL;
607	op->active_prev = NULL;
608	/* What is not cleared is next, prev, and count */
609
610	op->expmul = 1.0;
611	op->face = blank_face;
612	op->attacked_by_count = -1;
613
614	if (settings.casting_time)
615	op->casting_time = -1;
616	}	538	}
617		539
618	/*	540	/*
619	* copy object first frees everything allocated by the second object,	541	* copy object first frees everything allocated by the second object,
620	* and then copies the contends of the first object into the second	542	* and then copies the contends of the first object into the second
621	* object, allocating what needs to be allocated. Basically, any	543	* object, allocating what needs to be allocated. Basically, any
622	* data that is malloc'd needs to be re-malloc/copied. Otherwise,	544	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
623	* if the first object is freed, the pointers in the new object	545	* if the first object is freed, the pointers in the new object
624	* will point at garbage.	546	* will point at garbage.
625	*/	547	*/
626
627	void	548	void
628	copy_object (object *op2, object *op)	549	copy_object (object *op2, object *op)
629	{	550	{
630	bool is_freed = QUERY_FLAG (op, FLAG_FREED);	551	bool is_freed = QUERY_FLAG (op, FLAG_FREED);
631	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);	552	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);
…		…
691	/*	612	/*
692	* Updates the speed of an object. If the speed changes from 0 to another	613	* Updates the speed of an object. If the speed changes from 0 to another
693	* value, or vice versa, then add/remove the object from the active list.	614	* value, or vice versa, then add/remove the object from the active list.
694	* This function needs to be called whenever the speed of an object changes.	615	* This function needs to be called whenever the speed of an object changes.
695	*/	616	*/
696
697	void	617	void
698	update_ob_speed (object *op)	618	update_ob_speed (object *op)
699	{	619	{
700	extern int arch_init;	620	extern int arch_init;
701		621
…		…
710	abort ();	630	abort ();
711	#else	631	#else
712	op->speed = 0;	632	op->speed = 0;
713	#endif	633	#endif
714	}	634	}
		635
715	if (arch_init)	636	if (arch_init)
716	{
717	return;	637	return;
718	}	638
719	if (FABS (op->speed) > MIN_ACTIVE_SPEED)	639	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
720	{	640	{
721	/* If already on active list, don't do anything */	641	/* If already on active list, don't do anything */
722	if (op->active_next || op->active_prev || op == active_objects)	642	if (op->active_next || op->active_prev || op == active_objects)
723	return;	643	return;
724		644
725	/* process_events() expects us to insert the object at the beginning	645	/* process_events() expects us to insert the object at the beginning
726	* of the list. */	646	* of the list. */
727	op->active_next = active_objects;	647	op->active_next = active_objects;
		648
728	if (op->active_next != NULL)	649	if (op->active_next != NULL)
729	op->active_next->active_prev = op;	650	op->active_next->active_prev = op;
		651
730	active_objects = op;	652	active_objects = op;
731	}	653	}
732	else	654	else
733	{	655	{
734	/* If not on the active list, nothing needs to be done */	656	/* If not on the active list, nothing needs to be done */
…		…
736	return;	658	return;
737		659
738	if (op->active_prev == NULL)	660	if (op->active_prev == NULL)
739	{	661	{
740	active_objects = op->active_next;	662	active_objects = op->active_next;
		663
741	if (op->active_next != NULL)	664	if (op->active_next != NULL)
742	op->active_next->active_prev = NULL;	665	op->active_next->active_prev = NULL;
743	}	666	}
744	else	667	else
745	{	668	{
746	op->active_prev->active_next = op->active_next;	669	op->active_prev->active_next = op->active_next;
		670
747	if (op->active_next)	671	if (op->active_next)
748	op->active_next->active_prev = op->active_prev;	672	op->active_next->active_prev = op->active_prev;
749	}	673	}
		674
750	op->active_next = NULL;	675	op->active_next = NULL;
751	op->active_prev = NULL;	676	op->active_prev = NULL;
752	}	677	}
753	}	678	}
754		679
…		…
886	* that is being removed.	811	* that is being removed.
887	*/	812	*/
888	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	813	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
889	update_now = 1;	814	update_now = 1;
890	else if (action == UP_OBJ_FACE)	815	else if (action == UP_OBJ_FACE)
891	/* Nothing to do for that case */;	816	/* Nothing to do for that case */ ;
892	else	817	else
893	LOG (llevError, "update_object called with invalid action: %d\n", action);	818	LOG (llevError, "update_object called with invalid action: %d\n", action);
894		819
895	if (update_now)	820	if (update_now)
896	{	821	{
…		…
900		825
901	if (op->more != NULL)	826	if (op->more != NULL)
902	update_object (op->more, action);	827	update_object (op->more, action);
903	}	828	}
904		829
905	static unordered_vector<object *> mortals;	830	object::vector object::mortals;
906	static std::vector<object *> freed;	831	object::vector object::objects; // not yet used
		832	object *object::first;
907		833
908	void object::free_mortals ()	834	void object::free_mortals ()
909	{	835	{
910	for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end (); )	836	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
911	if (!(*i)->refcount)	837	if ((*i)->refcnt)
		838	++i; // further delay freeing
		839	else
912	{	840	{
913	freed.push_back (*i);	841	delete *i;
914	mortals.erase (i);	842	mortals.erase (i);
915	}	843	}
916	else
917	++i;
918	}	844	}
919		845
920	object::object ()	846	object::object ()
921	{	847	{
922	SET_FLAG (this, FLAG_REMOVED);	848	SET_FLAG (this, FLAG_REMOVED);
923		849
924	expmul = 1.0;	850	expmul = 1.0;
925	face = blank_face;	851	face = blank_face;
926	attacked_by_count = -1;
927	}	852	}
928		853
929	object::~object ()	854	object::~object ()
930	{	855	{
931	free_key_values (this);	856	free_key_values (this);
932	}	857	}
933		858
934	void object::link ()	859	void object::link ()
935	{	860	{
936	count = ++ob_count;	861	count = ++ob_count;
		862	uuid = gen_uuid ();
937		863
938	prev = 0;	864	prev = 0;
939	next = objects;	865	next = object::first;
940		866
941	if (objects)	867	if (object::first)
942	objects->prev = this;	868	object::first->prev = this;
943		869
944	objects = this;	870	object::first = this;
945	}	871	}
946		872
947	void object::unlink ()	873	void object::unlink ()
948	{	874	{
949	count = 0;	875	if (this == object::first)
		876	object::first = next;
950		877
951	/* Remove this object from the list of used objects */	878	/* Remove this object from the list of used objects */
952	if (prev)
953	{
954	prev->next = next;	879	if (prev) prev->next = next;
		880	if (next) next->prev = prev;
		881
955	prev = 0;	882	prev = 0;
956	}
957
958	if (next)
959	{
960	next->prev = prev;
961	next = 0;	883	next = 0;
962	}
963
964	if (this == objects)
965	objects = next;
966	}	884	}
967		885
968	object *object::create ()	886	object *object::create ()
969	{	887	{
970	object *op;
971
972	if (freed.empty ())
973	op = new object;	888	object *op = new object;
974	else
975	{
976	// highly annoying, but the only way to get it stable right now
977	op = freed.back (); freed.pop_back ();
978	op->~object ();
979	new ((void *)op) object;
980	}
981
982	op->link ();	889	op->link ();
983	return op;	890	return op;
984	}	891	}
985		892
986	/*	893	/*
…		…
988	* it from the list of used objects, and puts it on the list of	895	* it from the list of used objects, and puts it on the list of
989	* free objects. The IS_FREED() flag is set in the object.	896	* free objects. The IS_FREED() flag is set in the object.
990	* The object must have been removed by remove_ob() first for	897	* The object must have been removed by remove_ob() first for
991	* this function to succeed.	898	* this function to succeed.
992	*	899	*
993	* If free_inventory is set, free inventory as well. Else drop items in	900	* If destroy_inventory is set, free inventory as well. Else drop items in
994	* inventory to the ground.	901	* inventory to the ground.
995	*/	902	*/
996	void object::free (bool free_inventory)	903	void object::destroy (bool destroy_inventory)
997	{	904	{
		905	if (QUERY_FLAG (this, FLAG_FREED))
		906	return;
		907
		908	if (QUERY_FLAG (this, FLAG_FRIENDLY))
		909	remove_friendly_object (this);
		910
998	if (!QUERY_FLAG (this, FLAG_REMOVED))	911	if (!QUERY_FLAG (this, FLAG_REMOVED))
999	{	912	remove_ob (this);
1000	LOG (llevDebug, "Free object called with non removed object\n");
1001	dump_object (this);
1002	#ifdef MANY_CORES
1003	abort ();
1004	#endif
1005	}
1006		913
1007	if (QUERY_FLAG (this, FLAG_FRIENDLY))
1008	{
1009	LOG (llevMonster, "Warning: tried to free friendly object.\n");
1010	remove_friendly_object (this);
1011	}
1012
1013	if (QUERY_FLAG (this, FLAG_FREED))	914	SET_FLAG (this, FLAG_FREED);
1014	{
1015	dump_object (this);
1016	LOG (llevError, "Trying to free freed object.\n%s\n", errmsg);
1017	return;
1018	}
1019		915
1020	if (more)	916	if (more)
1021	{	917	{
1022	more->free (free_inventory);	918	more->destroy (destroy_inventory);
1023	more = 0;	919	more = 0;
1024	}	920	}
1025		921
1026	if (inv)	922	if (inv)
1027	{	923	{
1028	/* Only if the space blocks everything do we not process -	924	/* Only if the space blocks everything do we not process -
1029	* if some form of movement is allowed, let objects	925	* if some form of movement is allowed, let objects
1030	* drop on that space.	926	* drop on that space.
1031	*/	927	*/
1032	if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || (GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL))	928	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
1033	{	929	{
1034	object *	930	object *op = inv;
1035	op = inv;
1036		931
1037	while (op)	932	while (op)
1038	{	933	{
1039	object *
1040	tmp = op->below;	934	object *tmp = op->below;
1041
1042	remove_ob (op);
1043	op->free (free_inventory);	935	op->destroy (destroy_inventory);
1044	op = tmp;	936	op = tmp;
1045	}	937	}
1046	}	938	}
1047	else	939	else
1048	{ /* Put objects in inventory onto this space */	940	{ /* Put objects in inventory onto this space */
1049	object *	941	object *op = inv;
1050	op = inv;
1051		942
1052	while (op)	943	while (op)
1053	{	944	{
1054	object *
1055	tmp = op->below;	945	object *tmp = op->below;
1056		946
1057	remove_ob (op);	947	remove_ob (op);
1058		948
1059	if (QUERY_FLAG (op, FLAG_STARTEQUIP)	949	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
1060	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))	950	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
…		…
1069	op = tmp;	959	op = tmp;
1070	}	960	}
1071	}	961	}
1072	}	962	}
1073		963
1074	clear_owner (this);	964	// hack to ensure that freed objects still have a valid map
		965	{
		966	static maptile *freed_map; // freed objects are moved here to avoid crashes
		967
		968	if (!freed_map)
		969	{
		970	freed_map = new maptile;
		971
		972	freed_map->name = "/internal/freed_objects_map";
		973	freed_map->width = 3;
		974	freed_map->height = 3;
		975
		976	freed_map->allocate ();
		977	}
		978
		979	map = freed_map;
		980	x = 1;
		981	y = 1;
		982	}
		983
		984	// clear those pointers that likely might have circular references to us
		985	owner = 0;
		986	enemy = 0;
		987	attacked_by = 0;
		988
		989	// only relevant for players(?), but make sure of it anyways
		990	contr = 0;
1075		991
1076	/* Remove object from the active list */	992	/* Remove object from the active list */
1077	speed = 0;	993	speed = 0;
1078	update_ob_speed (this);	994	update_ob_speed (this);
1079		995
1080	unlink ();	996	unlink ();
1081		997
1082	SET_FLAG (this, FLAG_FREED);
1083
1084	mortals.push_back (this);	998	mortals.push_back (this);
1085	}	999	}
1086		1000
1087	/*	1001	/*
1088	* sub_weight() recursively (outwards) subtracts a number from the	1002	* sub_weight() recursively (outwards) subtracts a number from the
…		…
1093	sub_weight (object *op, signed long weight)	1007	sub_weight (object *op, signed long weight)
1094	{	1008	{
1095	while (op != NULL)	1009	while (op != NULL)
1096	{	1010	{
1097	if (op->type == CONTAINER)	1011	if (op->type == CONTAINER)
1098	{
1099	weight = (signed long) (weight * (100 - op->stats.Str) / 100);	1012	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1100	}	1013
1101	op->carrying -= weight;	1014	op->carrying -= weight;
1102	op = op->env;	1015	op = op->env;
1103	}	1016	}
1104	}	1017	}
1105		1018
…		…
1113	*/	1026	*/
1114		1027
1115	void	1028	void
1116	remove_ob (object *op)	1029	remove_ob (object *op)
1117	{	1030	{
1118	object *tmp, *last = NULL;	1031	object *tmp, *last = 0;
1119	object *otmp;	1032	object *otmp;
1120		1033
1121	tag_t tag;
1122	int check_walk_off;	1034	int check_walk_off;
1123	mapstruct *m;	1035	maptile *m;
1124		1036
1125	sint16 x, y;	1037	sint16 x, y;
1126		1038
1127	if (QUERY_FLAG (op, FLAG_REMOVED))	1039	if (QUERY_FLAG (op, FLAG_REMOVED))
1128	{	1040	return;
1129	dump_object (op);
1130	LOG (llevError, "Trying to remove removed object.\n%s\n", errmsg);
1131		1041
1132	/* Changed it to always dump core in this case. As has been learned	1042	SET_FLAG (op, FLAG_REMOVED);
1133	* in the past, trying to recover from errors almost always
1134	* make things worse, and this is a real error here - something
1135	* that should not happen.
1136	* Yes, if this was a mission critical app, trying to do something
1137	* to recover may make sense, but that is because failure of the app
1138	* may have other disastrous problems. Cf runs out of a script
1139	* so is easily enough restarted without any real problems.
1140	* MSW 2001-07-01
1141	*/
1142	abort ();
1143	}
1144		1043
1145	if (op->more != NULL)	1044	if (op->more != NULL)
1146	remove_ob (op->more);	1045	remove_ob (op->more);
1147
1148	SET_FLAG (op, FLAG_REMOVED);
1149		1046
1150	/*	1047	/*
1151	* In this case, the object to be removed is in someones	1048	* In this case, the object to be removed is in someones
1152	* inventory.	1049	* inventory.
1153	*/	1050	*/
…		…
1179	*/	1076	*/
1180	op->x = op->env->x, op->y = op->env->y;	1077	op->x = op->env->x, op->y = op->env->y;
1181	op->map = op->env->map;	1078	op->map = op->env->map;
1182	op->above = NULL, op->below = NULL;	1079	op->above = NULL, op->below = NULL;
1183	op->env = NULL;	1080	op->env = NULL;
1184	return;	1081	}
		1082	else if (op->map)
1185	}	1083	{
1186
1187	/* If we get here, we are removing it from a map */
1188	if (op->map == NULL)
1189	return;
1190
1191	x = op->x;	1084	x = op->x;
1192	y = op->y;	1085	y = op->y;
1193	m = get_map_from_coord (op->map, &x, &y);	1086	m = get_map_from_coord (op->map, &x, &y);
1194		1087
1195	if (!m)	1088	if (!m)
1196	{	1089	{
1197	LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",	1090	LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1198	op->map->path, op->x, op->y);	1091	op->map->path, op->x, op->y);
1199	/* in old days, we used to set x and y to 0 and continue.	1092	/* in old days, we used to set x and y to 0 and continue.
1200	* it seems if we get into this case, something is probablye	1093	* it seems if we get into this case, something is probablye
1201	* screwed up and should be fixed.	1094	* screwed up and should be fixed.
		1095	*/
		1096	abort ();
		1097	}
		1098
		1099	if (op->map != m)
		1100	LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
		1101	op->map->path, m->path, op->x, op->y, x, y);
		1102
		1103	/* Re did the following section of code - it looks like it had
		1104	* lots of logic for things we no longer care about
1202	*/	1105	*/
1203	abort ();
1204	}
1205	if (op->map != m)
1206	{
1207	LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1208	op->map->path, m->path, op->x, op->y, x, y);
1209	}
1210		1106
1211	/* Re did the following section of code - it looks like it had
1212	* lots of logic for things we no longer care about
1213	*/
1214
1215	/* link the object above us */	1107	/* link the object above us */
1216	if (op->above)	1108	if (op->above)
1217	op->above->below = op->below;	1109	op->above->below = op->below;
1218	else	1110	else
1219	SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */	1111	SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */
1220		1112
1221	/* Relink the object below us, if there is one */	1113	/* Relink the object below us, if there is one */
1222	if (op->below)	1114	if (op->below)
1223	op->below->above = op->above;	1115	op->below->above = op->above;
1224	else	1116	else
1225	{	1117	{
1226	/* Nothing below, which means we need to relink map object for this space	1118	/* Nothing below, which means we need to relink map object for this space
1227	* use translated coordinates in case some oddness with map tiling is	1119	* use translated coordinates in case some oddness with map tiling is
1228	* evident	1120	* evident
1229	*/
1230	if (GET_MAP_OB (m, x, y) != op)
1231	{
1232	dump_object (op);
1233	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n",
1234	errmsg);
1235	dump_object (GET_MAP_OB (m, x, y));
1236	LOG (llevError, "%s\n", errmsg);
1237	}
1238
1239	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1240	}
1241
1242	op->above = NULL;
1243	op->below = NULL;
1244
1245	if (op->map->in_memory == MAP_SAVING)
1246	return;
1247
1248	tag = op->count;
1249	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1250
1251	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1252	{
1253	/* No point updating the players look faces if he is the object
1254	* being removed.
1255	*/
1256
1257	if (tmp->type == PLAYER && tmp != op)
1258	{
1259	/* If a container that the player is currently using somehow gets
1260	* removed (most likely destroyed), update the player view
1261	* appropriately.
1262	*/	1121	*/
1263	if (tmp->container == op)	1122	if (GET_MAP_OB (m, x, y) != op)
1264	{	1123	{
1265	CLEAR_FLAG (op, FLAG_APPLIED);	1124	char *dump = dump_object (op);
1266	tmp->container = NULL;	1125	LOG (llevError,
		1126	"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);
		1127	free (dump);
		1128	dump = dump_object (GET_MAP_OB (m, x, y));
		1129	LOG (llevError, "%s\n", dump);
		1130	free (dump);
1267	}	1131	}
1268		1132
1269	tmp->contr->socket.update_look = 1;	1133	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1270	}
1271	/* See if player moving off should effect something */
1272	if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1273	{	1134	}
1274	move_apply (tmp, op, NULL);
1275		1135
1276	if (was_destroyed (op, tag))	1136	op->above = 0;
		1137	op->below = 0;
		1138
		1139	if (op->map->in_memory == MAP_SAVING)
		1140	return;
		1141
		1142	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
		1143
		1144	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
		1145	{
		1146	/* No point updating the players look faces if he is the object
		1147	* being removed.
		1148	*/
		1149
		1150	if (tmp->type == PLAYER && tmp != op)
1277	{	1151	{
1278	LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name);	1152	/* If a container that the player is currently using somehow gets
		1153	* removed (most likely destroyed), update the player view
		1154	* appropriately.
		1155	*/
		1156	if (tmp->container == op)
		1157	{
		1158	CLEAR_FLAG (op, FLAG_APPLIED);
		1159	tmp->container = NULL;
		1160	}
		1161
		1162	tmp->contr->socket.update_look = 1;
1279	}	1163	}
		1164
		1165	/* See if player moving off should effect something */
		1166	if (check_walk_off
		1167	&& ((op->move_type & tmp->move_off)
		1168	&& (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
		1169	{
		1170	move_apply (tmp, op, NULL);
		1171
		1172	if (op->destroyed ())
		1173	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1280	}	1174	}
1281		1175
1282	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1176	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1283		1177
1284	if (tmp->above == tmp)	1178	if (tmp->above == tmp)
1285	tmp->above = NULL;	1179	tmp->above = NULL;
1286		1180
1287	last = tmp;	1181	last = tmp;
1288	}	1182	}
1289		1183
1290	/* last == NULL of there are no objects on this space */	1184	/* last == NULL of there are no objects on this space */
1291	if (last == NULL)	1185	if (last == NULL)
1292	{	1186	{
1293	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,	1187	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1294	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures	1188	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1295	* those out anyways, and if there are any flags set right now, they won't	1189	* those out anyways, and if there are any flags set right now, they won't
1296	* be correct anyways.	1190	* be correct anyways.
1297	*/	1191	*/
1298	SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);	1192	SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);
1299	update_position (op->map, op->x, op->y);	1193	update_position (op->map, op->x, op->y);
1300	}	1194	}
1301	else	1195	else
1302	update_object (last, UP_OBJ_REMOVE);	1196	update_object (last, UP_OBJ_REMOVE);
1303		1197
1304	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))	1198	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))
1305	update_all_los (op->map, op->x, op->y);	1199	update_all_los (op->map, op->x, op->y);
		1200	}
1306	}	1201	}
1307		1202
1308	/*	1203	/*
1309	* merge_ob(op,top):	1204	* merge_ob(op,top):
1310	*	1205	*
1311	* This function goes through all objects below and including top, and	1206	* This function goes through all objects below and including top, and
1312	* merges op to the first matching object.	1207	* merges op to the first matching object.
1313	* If top is NULL, it is calculated.	1208	* If top is NULL, it is calculated.
1314	* Returns pointer to object if it succeded in the merge, otherwise NULL	1209	* Returns pointer to object if it succeded in the merge, otherwise NULL
1315	*/	1210	*/
1316
1317	object *	1211	object *
1318	merge_ob (object *op, object *top)	1212	merge_ob (object *op, object *top)
1319	{	1213	{
1320	if (!op->nrof)	1214	if (!op->nrof)
1321	return 0;	1215	return 0;
		1216
1322	if (top == NULL)	1217	if (top == NULL)
1323	for (top = op; top != NULL && top->above != NULL; top = top->above);	1218	for (top = op; top != NULL && top->above != NULL; top = top->above);
		1219
1324	for (; top != NULL; top = top->below)	1220	for (; top != NULL; top = top->below)
1325	{	1221	{
1326	if (top == op)	1222	if (top == op)
1327	continue;	1223	continue;
1328	if (CAN_MERGE (op, top))	1224	if (CAN_MERGE (op, top))
…		…
1334	remove_ob (op);	1230	remove_ob (op);
1335	free_object (op);	1231	free_object (op);
1336	return top;	1232	return top;
1337	}	1233	}
1338	}	1234	}
		1235
1339	return NULL;	1236	return 0;
1340	}	1237	}
1341		1238
1342	/*	1239	/*
1343	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1240	* same as insert_ob_in_map except it handle separate coordinates and do a clean
1344	* job preparing multi-part monsters	1241	* job preparing multi-part monsters
1345	*/	1242	*/
1346	object *	1243	object *
1347	insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y)	1244	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1348	{	1245	{
1349	object *	1246	object *tmp;
1350	tmp;
1351		1247
1352	if (op->head)	1248	if (op->head)
1353	op = op->head;	1249	op = op->head;
		1250
1354	for (tmp = op; tmp; tmp = tmp->more)	1251	for (tmp = op; tmp; tmp = tmp->more)
1355	{	1252	{
1356	tmp->x = x + tmp->arch->clone.x;	1253	tmp->x = x + tmp->arch->clone.x;
1357	tmp->y = y + tmp->arch->clone.y;	1254	tmp->y = y + tmp->arch->clone.y;
1358	}	1255	}
		1256
1359	return insert_ob_in_map (op, m, originator, flag);	1257	return insert_ob_in_map (op, m, originator, flag);
1360	}	1258	}
1361		1259
1362	/*	1260	/*
1363	* insert_ob_in_map (op, map, originator, flag):	1261	* insert_ob_in_map (op, map, originator, flag):
…		…
1379	* NULL if 'op' was destroyed	1277	* NULL if 'op' was destroyed
1380	* just 'op' otherwise	1278	* just 'op' otherwise
1381	*/	1279	*/
1382		1280
1383	object *	1281	object *
1384	insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag)	1282	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1385	{	1283	{
1386	object *tmp, *top, *floor = NULL;	1284	object *tmp, *top, *floor = NULL;
1387	sint16 x, y;	1285	sint16 x, y;
1388		1286
1389	if (QUERY_FLAG (op, FLAG_FREED))	1287	if (QUERY_FLAG (op, FLAG_FREED))
…		…
1392	return NULL;	1290	return NULL;
1393	}	1291	}
1394		1292
1395	if (m == NULL)	1293	if (m == NULL)
1396	{	1294	{
1397	dump_object (op);	1295	char *dump = dump_object (op);
1398	LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg);	1296	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
		1297	free (dump);
1399	return op;	1298	return op;
1400	}	1299	}
1401		1300
1402	if (out_of_map (m, op->x, op->y))	1301	if (out_of_map (m, op->x, op->y))
1403	{	1302	{
1404	dump_object (op);	1303	char *dump = dump_object (op);
1405	LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg);	1304	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1406	#ifdef MANY_CORES	1305	#ifdef MANY_CORES
1407	/* Better to catch this here, as otherwise the next use of this object	1306	/* Better to catch this here, as otherwise the next use of this object
1408	* is likely to cause a crash. Better to find out where it is getting	1307	* is likely to cause a crash. Better to find out where it is getting
1409	* improperly inserted.	1308	* improperly inserted.
1410	*/	1309	*/
1411	abort ();	1310	abort ();
1412	#endif	1311	#endif
		1312	free (dump);
1413	return op;	1313	return op;
1414	}	1314	}
1415		1315
1416	if (!QUERY_FLAG (op, FLAG_REMOVED))	1316	if (!QUERY_FLAG (op, FLAG_REMOVED))
1417	{	1317	{
1418	dump_object (op);	1318	char *dump = dump_object (op);
1419	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg);	1319	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
		1320	free (dump);
1420	return op;	1321	return op;
1421	}	1322	}
1422		1323
1423	if (op->more != NULL)	1324	if (op->more != NULL)
1424	{	1325	{
…		…
1654	* op is the object to insert it under: supplies x and the map.	1555	* op is the object to insert it under: supplies x and the map.
1655	*/	1556	*/
1656	void	1557	void
1657	replace_insert_ob_in_map (const char *arch_string, object *op)	1558	replace_insert_ob_in_map (const char *arch_string, object *op)
1658	{	1559	{
1659	object *tmp;	1560	object *
		1561	tmp;
1660	object *tmp1;	1562	object *
		1563	tmp1;
1661		1564
1662	/* first search for itself and remove any old instances */	1565	/* first search for itself and remove any old instances */
1663		1566
1664	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1567	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1665	{	1568	{
…		…
1668	remove_ob (tmp);	1571	remove_ob (tmp);
1669	free_object (tmp);	1572	free_object (tmp);
1670	}	1573	}
1671	}	1574	}
1672		1575
1673	tmp1 = arch_to_object (find_archetype (arch_string));	1576	tmp1 = arch_to_object (archetype::find (arch_string));
1674		1577
1675	tmp1->x = op->x;	1578	tmp1->x = op->x;
1676	tmp1->y = op->y;	1579	tmp1->y = op->y;
1677	insert_ob_in_map (tmp1, op->map, op, 0);	1580	insert_ob_in_map (tmp1, op->map, op, 0);
1678	}	1581	}
…		…
1696	if (orig_ob->nrof < nr)	1599	if (orig_ob->nrof < nr)
1697	{	1600	{
1698	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);	1601	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1699	return NULL;	1602	return NULL;
1700	}	1603	}
		1604
1701	newob = object_create_clone (orig_ob);	1605	newob = object_create_clone (orig_ob);
		1606
1702	if ((orig_ob->nrof -= nr) < 1)	1607	if ((orig_ob->nrof -= nr) < 1)
1703	{	1608	{
1704	if (!is_removed)	1609	if (!is_removed)
1705	remove_ob (orig_ob);	1610	remove_ob (orig_ob);
1706	free_object2 (orig_ob, 1);	1611	free_object2 (orig_ob, 1);
…		…
1714	strcpy (errmsg, "Tried to split object whose map is not in memory.");	1619	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1715	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");	1620	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1716	return NULL;	1621	return NULL;
1717	}	1622	}
1718	}	1623	}
		1624
1719	newob->nrof = nr;	1625	newob->nrof = nr;
1720		1626
1721	return newob;	1627	return newob;
1722	}	1628	}
1723		1629
…		…
1730	*/	1636	*/
1731		1637
1732	object *	1638	object *
1733	decrease_ob_nr (object *op, uint32 i)	1639	decrease_ob_nr (object *op, uint32 i)
1734	{	1640	{
1735	object *	1641	object *tmp;
1736	tmp;
1737	player *	1642	player *pl;
1738	pl;
1739		1643
1740	if (i == 0) /* objects with op->nrof require this check */	1644	if (i == 0) /* objects with op->nrof require this check */
1741	return op;	1645	return op;
1742		1646
1743	if (i > op->nrof)	1647	if (i > op->nrof)
1744	i = op->nrof;	1648	i = op->nrof;
1745		1649
1746	if (QUERY_FLAG (op, FLAG_REMOVED))	1650	if (QUERY_FLAG (op, FLAG_REMOVED))
1747	{
1748	op->nrof -= i;	1651	op->nrof -= i;
1749	}
1750	else if (op->env != NULL)	1652	else if (op->env != NULL)
1751	{	1653	{
1752	/* is this object in the players inventory, or sub container	1654	/* is this object in the players inventory, or sub container
1753	* therein?	1655	* therein?
1754	*/	1656	*/
…		…
1789	}	1691	}
1790	}	1692	}
1791	}	1693	}
1792	else	1694	else
1793	{	1695	{
1794	object *
1795	above = op->above;	1696	object *above = op->above;
1796		1697
1797	if (i < op->nrof)	1698	if (i < op->nrof)
1798	{
1799	op->nrof -= i;	1699	op->nrof -= i;
1800	}
1801	else	1700	else
1802	{	1701	{
1803	remove_ob (op);	1702	remove_ob (op);
1804	op->nrof = 0;	1703	op->nrof = 0;
1805	}	1704	}
		1705
1806	/* Since we just removed op, op->above is null */	1706	/* Since we just removed op, op->above is null */
1807	for (tmp = above; tmp != NULL; tmp = tmp->above)	1707	for (tmp = above; tmp != NULL; tmp = tmp->above)
1808	if (tmp->type == PLAYER)	1708	if (tmp->type == PLAYER)
1809	{	1709	{
1810	if (op->nrof)	1710	if (op->nrof)
…		…
1813	esrv_del_item (tmp->contr, op->count);	1713	esrv_del_item (tmp->contr, op->count);
1814	}	1714	}
1815	}	1715	}
1816		1716
1817	if (op->nrof)	1717	if (op->nrof)
1818	{
1819	return op;	1718	return op;
1820	}
1821	else	1719	else
1822	{	1720	{
1823	free_object (op);	1721	free_object (op);
1824	return NULL;	1722	return NULL;
1825	}	1723	}
…		…
1834	add_weight (object *op, signed long weight)	1732	add_weight (object *op, signed long weight)
1835	{	1733	{
1836	while (op != NULL)	1734	while (op != NULL)
1837	{	1735	{
1838	if (op->type == CONTAINER)	1736	if (op->type == CONTAINER)
1839	{
1840	weight = (signed long) (weight * (100 - op->stats.Str) / 100);	1737	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1841	}	1738
1842	op->carrying += weight;	1739	op->carrying += weight;
1843	op = op->env;	1740	op = op->env;
1844	}	1741	}
1845	}	1742	}
1846		1743
…		…
1865	tmp, *	1762	tmp, *
1866	otmp;	1763	otmp;
1867		1764
1868	if (!QUERY_FLAG (op, FLAG_REMOVED))	1765	if (!QUERY_FLAG (op, FLAG_REMOVED))
1869	{	1766	{
1870	dump_object (op);	1767	char *dump = dump_object (op);
1871	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);	1768	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", dump);
		1769	free (dump);
1872	return op;	1770	return op;
1873	}	1771	}
		1772
1874	if (where == NULL)	1773	if (where == NULL)
1875	{	1774	{
1876	dump_object (op);	1775	char *dump = dump_object (op);
1877	LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);	1776	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
		1777	free (dump);
1878	return op;	1778	return op;
1879	}	1779	}
		1780
1880	if (where->head)	1781	if (where->head)
1881	{	1782	{
1882	LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");	1783	LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");
1883	where = where->head;	1784	where = where->head;
1884	}	1785	}
		1786
1885	if (op->more)	1787	if (op->more)
1886	{	1788	{
1887	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1789	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1888	return op;	1790	return op;
1889	}	1791	}
		1792
1890	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1793	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1891	CLEAR_FLAG (op, FLAG_REMOVED);	1794	CLEAR_FLAG (op, FLAG_REMOVED);
1892	if (op->nrof)	1795	if (op->nrof)
1893	{	1796	{
1894	for (tmp = where->inv; tmp != NULL; tmp = tmp->below)	1797	for (tmp = where->inv; tmp != NULL; tmp = tmp->below)
…		…
1980		1883
1981	int	1884	int
1982	check_move_on (object *op, object *originator)	1885	check_move_on (object *op, object *originator)
1983	{	1886	{
1984	object *tmp;	1887	object *tmp;
1985	tag_t tag;
1986	mapstruct *m = op->map;	1888	maptile *m = op->map;
1987	int x = op->x, y = op->y;	1889	int x = op->x, y = op->y;
1988		1890
1989	MoveType move_on, move_slow, move_block;	1891	MoveType move_on, move_slow, move_block;
1990		1892
1991	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1893	if (QUERY_FLAG (op, FLAG_NO_APPLY))
1992	return 0;	1894	return 0;
1993
1994	tag = op->count;
1995		1895
1996	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1896	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
1997	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1897	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
1998	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1898	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1999		1899
…		…
2042	{	1942	{
2043	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1943	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
2044	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1944	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
2045	{	1945	{
2046		1946
		1947	float
2047	float diff = tmp->move_slow_penalty * FABS (op->speed);	1948	diff = tmp->move_slow_penalty * FABS (op->speed);
2048		1949
2049	if (op->type == PLAYER)	1950	if (op->type == PLAYER)
2050	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1951	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
2051	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1952	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
2052	diff /= 4.0;	1953	diff /= 4.0;
…		…
2059	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||	1960	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
2060	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))	1961	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
2061	{	1962	{
2062	move_apply (tmp, op, originator);	1963	move_apply (tmp, op, originator);
2063		1964
2064	if (was_destroyed (op, tag))	1965	if (op->destroyed ())
2065	return 1;	1966	return 1;
2066		1967
2067	/* what the person/creature stepped onto has moved the object	1968	/* what the person/creature stepped onto has moved the object
2068	* someplace new. Don't process any further - if we did,	1969	* someplace new. Don't process any further - if we did,
2069	* have a feeling strange problems would result.	1970	* have a feeling strange problems would result.
…		…
2081	* a matching archetype at the given map and coordinates.	1982	* a matching archetype at the given map and coordinates.
2082	* The first matching object is returned, or NULL if none.	1983	* The first matching object is returned, or NULL if none.
2083	*/	1984	*/
2084		1985
2085	object *	1986	object *
2086	present_arch (const archetype *at, mapstruct *m, int x, int y)	1987	present_arch (const archetype *at, maptile *m, int x, int y)
2087	{	1988	{
2088	object *	1989	object *
2089	tmp;	1990	tmp;
2090		1991
2091	if (m == NULL || out_of_map (m, x, y))	1992	if (m == NULL || out_of_map (m, x, y))
…		…
2104	* a matching type variable at the given map and coordinates.	2005	* a matching type variable at the given map and coordinates.
2105	* The first matching object is returned, or NULL if none.	2006	* The first matching object is returned, or NULL if none.
2106	*/	2007	*/
2107		2008
2108	object *	2009	object *
2109	present (unsigned char type, mapstruct *m, int x, int y)	2010	present (unsigned char type, maptile *m, int x, int y)
2110	{	2011	{
2111	object *	2012	object *
2112	tmp;	2013	tmp;
2113		2014
2114	if (out_of_map (m, x, y))	2015	if (out_of_map (m, x, y))
…		…
2254	* the archetype because that isn't correct if the monster has been	2155	* the archetype because that isn't correct if the monster has been
2255	* customized, changed states, etc.	2156	* customized, changed states, etc.
2256	*/	2157	*/
2257		2158
2258	int	2159	int
2259	find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop)	2160	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2260	{	2161	{
2261	int	2162	int
2262	i,	2163	i,
2263	index = 0, flag;	2164	index = 0, flag;
2264	static int	2165	static int
…		…
2285	return -1;	2186	return -1;
2286	return altern[RANDOM () % index];	2187	return altern[RANDOM () % index];
2287	}	2188	}
2288		2189
2289	/*	2190	/*
2290	* find_first_free_spot(archetype, mapstruct, x, y) works like	2191	* find_first_free_spot(archetype, maptile, x, y) works like
2291	* find_free_spot(), but it will search max number of squares.	2192	* find_free_spot(), but it will search max number of squares.
2292	* But it will return the first available spot, not a random choice.	2193	* But it will return the first available spot, not a random choice.
2293	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2194	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2294	*/	2195	*/
2295		2196
2296	int	2197	int
2297	find_first_free_spot (const object *ob, mapstruct *m, int x, int y)	2198	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2298	{	2199	{
2299	int	2200	int
2300	i;	2201	i;
2301		2202
2302	for (i = 0; i < SIZEOFFREE; i++)	2203	for (i = 0; i < SIZEOFFREE; i++)
…		…
2366	* because we have to know what movement the thing looking to move	2267	* because we have to know what movement the thing looking to move
2367	* there is capable of.	2268	* there is capable of.
2368	*/	2269	*/
2369		2270
2370	int	2271	int
2371	find_dir (mapstruct *m, int x, int y, object *exclude)	2272	find_dir (maptile *m, int x, int y, object *exclude)
2372	{	2273	{
2373	int	2274	int
2374	i,	2275	i,
2375	max = SIZEOFFREE, mflags;	2276	max = SIZEOFFREE, mflags;
2376	sint16	2277
2377	nx,	2278	sint16 nx, ny;
2378	ny;
2379	object *	2279	object *
2380	tmp;	2280	tmp;
2381	mapstruct *	2281	maptile *
2382	mp;	2282	mp;
2383	MoveType	2283
2384	blocked,	2284	MoveType blocked, move_type;
2385	move_type;
2386		2285
2387	if (exclude && exclude->head)	2286	if (exclude && exclude->head)
2388	{	2287	{
2389	exclude = exclude->head;	2288	exclude = exclude->head;
2390	move_type = exclude->move_type;	2289	move_type = exclude->move_type;
…		…
2595	* Modified to be map tile aware -.MSW	2494	* Modified to be map tile aware -.MSW
2596	*/	2495	*/
2597		2496
2598		2497
2599	int	2498	int
2600	can_see_monsterP (mapstruct *m, int x, int y, int dir)	2499	can_see_monsterP (maptile *m, int x, int y, int dir)
2601	{	2500	{
2602	sint16	2501	sint16 dx, dy;
2603	dx,
2604	dy;
2605	int	2502	int
2606	mflags;	2503	mflags;
2607		2504
2608	if (dir < 0)	2505	if (dir < 0)
2609	return 0; /* exit condition: invalid direction */	2506	return 0; /* exit condition: invalid direction */
…		…
2687	if (prev)	2584	if (prev)
2688	prev->more = tmp;	2585	prev->more = tmp;
2689	prev = tmp;	2586	prev = tmp;
2690	}	2587	}
2691		2588
2692	/*** copy inventory ***/
2693	for (item = src->inv; item; item = item->below)	2589	for (item = src->inv; item; item = item->below)
2694	{
2695	(void) insert_ob_in_ob (object_create_clone (item), dst);	2590	insert_ob_in_ob (object_create_clone (item), dst);
2696	}
2697		2591
2698	return dst;	2592	return dst;
2699	}	2593	}
2700		2594
2701	/* return true if the object was destroyed, 0 otherwise */
2702	int
2703	was_destroyed (const object *op, tag_t old_tag)
2704	{
2705	/* checking for FLAG_FREED isn't necessary, but makes this function more
2706	* robust */
2707	return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED);
2708	}
2709
2710	/* GROS - Creates an object using a string representing its content. */	2595	/* GROS - Creates an object using a string representing its content. */
2711
2712	/* Basically, we save the content of the string to a temp file, then call */	2596	/* Basically, we save the content of the string to a temp file, then call */
2713
2714	/* load_object on it. I admit it is a highly inefficient way to make things, */	2597	/* load_object on it. I admit it is a highly inefficient way to make things, */
2715
2716	/* but it was simple to make and allows reusing the load_object function. */	2598	/* but it was simple to make and allows reusing the load_object function. */
2717
2718	/* Remember not to use load_object_str in a time-critical situation. */	2599	/* Remember not to use load_object_str in a time-critical situation. */
2719
2720	/* Also remember that multiparts objects are not supported for now. */	2600	/* Also remember that multiparts objects are not supported for now. */
2721		2601
2722	object *	2602	object *
2723	load_object_str (const char *obstr)	2603	load_object_str (const char *obstr)
2724	{	2604	{
2725	object *	2605	object *op;
2726	op;
2727	char
2728	filename[MAX_BUF];	2606	char filename[MAX_BUF];
2729		2607
2730	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);	2608	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2731		2609
2732	FILE *
2733	tempfile = fopen (filename, "w");	2610	FILE *tempfile = fopen (filename, "w");
2734		2611
2735	if (tempfile == NULL)	2612	if (tempfile == NULL)
2736	{	2613	{
2737	LOG (llevError, "Error - Unable to access load object temp file\n");	2614	LOG (llevError, "Error - Unable to access load object temp file\n");
2738	return NULL;	2615	return NULL;
2739	};	2616	}
		2617
2740	fprintf (tempfile, obstr);	2618	fprintf (tempfile, obstr);
2741	fclose (tempfile);	2619	fclose (tempfile);
2742		2620
2743	op = get_object ();	2621	op = get_object ();
2744		2622
2745	object_thawer	2623	object_thawer thawer (filename);
2746	thawer (filename);
2747		2624
2748	if (thawer)	2625	if (thawer)
2749	load_object (thawer, op, 0);	2626	load_object (thawer, op, 0);
2750		2627
2751	LOG (llevDebug, " load str completed, object=%s\n", &op->name);	2628	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
…		…
2759	* returns NULL if no match.	2636	* returns NULL if no match.
2760	*/	2637	*/
2761	object *	2638	object *
2762	find_obj_by_type_subtype (const object *who, int type, int subtype)	2639	find_obj_by_type_subtype (const object *who, int type, int subtype)
2763	{	2640	{
2764	object *	2641	object *tmp;
2765	tmp;
2766		2642
2767	for (tmp = who->inv; tmp; tmp = tmp->below)	2643	for (tmp = who->inv; tmp; tmp = tmp->below)
2768	if (tmp->type == type && tmp->subtype == subtype)	2644	if (tmp->type == type && tmp->subtype == subtype)
2769	return tmp;	2645	return tmp;
2770		2646
…		…
2778	* do the desired thing.	2654	* do the desired thing.
2779	*/	2655	*/
2780	key_value *	2656	key_value *
2781	get_ob_key_link (const object *ob, const char *key)	2657	get_ob_key_link (const object *ob, const char *key)
2782	{	2658	{
2783	key_value *	2659	key_value *link;
2784	link;
2785		2660
2786	for (link = ob->key_values; link != NULL; link = link->next)	2661	for (link = ob->key_values; link != NULL; link = link->next)
2787	{
2788	if (link->key == key)	2662	if (link->key == key)
2789	{
2790	return link;	2663	return link;
2791	}
2792	}
2793		2664
2794	return NULL;	2665	return NULL;
2795	}	2666	}
2796		2667
2797	/*	2668	/*
…		…
2802	* The returned string is shared.	2673	* The returned string is shared.
2803	*/	2674	*/
2804	const char *	2675	const char *
2805	get_ob_key_value (const object *op, const char *const key)	2676	get_ob_key_value (const object *op, const char *const key)
2806	{	2677	{
2807	key_value *	2678	key_value *link;
2808	link;	2679	shstr_cmp canonical_key (key);
2809	const char *
2810	canonical_key;
2811		2680
2812	canonical_key = shstr::find (key);
2813
2814	if (canonical_key == NULL)	2681	if (!canonical_key)
2815	{	2682	{
2816	/* 1. There being a field named key on any object	2683	/* 1. There being a field named key on any object
2817	* implies there'd be a shared string to find.	2684	* implies there'd be a shared string to find.
2818	* 2. Since there isn't, no object has this field.	2685	* 2. Since there isn't, no object has this field.
2819	* 3. Therefore, *this* object doesn't have this field.	2686	* 3. Therefore, *this* object doesn't have this field.
2820	*/	2687	*/
2821	return NULL;	2688	return 0;
2822	}	2689	}
2823		2690
2824	/* This is copied from get_ob_key_link() above -	2691	/* This is copied from get_ob_key_link() above -
2825	* only 4 lines, and saves the function call overhead.	2692	* only 4 lines, and saves the function call overhead.
2826	*/	2693	*/
2827	for (link = op->key_values; link != NULL; link = link->next)	2694	for (link = op->key_values; link; link = link->next)
2828	{
2829	if (link->key == canonical_key)	2695	if (link->key == canonical_key)
2830	{
2831	return link->value;	2696	return link->value;
2832	}	2697
2833	}
2834	return NULL;	2698	return 0;
2835	}	2699	}
2836		2700
2837		2701
2838	/*	2702	/*
2839	* Updates the canonical_key in op to value.	2703	* Updates the canonical_key in op to value.
…		…
2875	if (last)	2739	if (last)
2876	last->next = field->next;	2740	last->next = field->next;
2877	else	2741	else
2878	op->key_values = field->next;	2742	op->key_values = field->next;
2879		2743
2880	delete
2881	field;	2744	delete field;
2882	}	2745	}
2883	}	2746	}
2884	return TRUE;	2747	return TRUE;
2885	}	2748	}
2886	/* IF we get here, key doesn't exist */	2749	/* IF we get here, key doesn't exist */
…		…
2921	* Returns TRUE on success.	2784	* Returns TRUE on success.
2922	*/	2785	*/
2923	int	2786	int
2924	set_ob_key_value (object *op, const char *key, const char *value, int add_key)	2787	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2925	{	2788	{
2926	shstr
2927	key_ (key);	2789	shstr key_ (key);
2928		2790
2929	return set_ob_key_value_s (op, key_, value, add_key);	2791	return set_ob_key_value_s (op, key_, value, add_key);
2930	}	2792	}
		2793
		2794	object::depth_iterator::depth_iterator (object *container)
		2795	: iterator_base (container)
		2796	{
		2797	while (item->inv)
		2798	item = item->inv;
		2799	}
		2800
		2801	void
		2802	object::depth_iterator::next ()
		2803	{
		2804	if (item->below)
		2805	{
		2806	item = item->below;
		2807
		2808	while (item->inv)
		2809	item = item->inv;
		2810	}
		2811	else
		2812	item = item->env;
		2813	}
		2814
		2815	// return a suitable string describing an objetc in enough detail to find it
		2816	const char *
		2817	object::debug_desc (char *info) const
		2818	{
		2819	char info2[256 * 3];
		2820	char *p = info;
		2821
		2822	p += snprintf (p, 256, "%d=\"%s%s%s\"",
		2823	count,
		2824	&name,
		2825	title ? " " : "",
		2826	title ? (const char *)title : "");
		2827
		2828	if (env)
		2829	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
		2830
		2831	if (map)
		2832	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);
		2833
		2834	return info;
		2835	}
		2836
		2837	const char *
		2838	object::debug_desc () const
		2839	{
		2840	static char info[256 * 3];
		2841	return debug_desc (info);
		2842	}
		2843

Diff Legend

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