[ViewVC] Diff of: cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.29 by root, Mon Sep 11 12:38:36 2006 UTC vs.
Revision 1.54 by root, Fri Nov 17 19:40:53 2006 UTC

…		…
1
2	/*	1	/*
3	CrossFire, A Multiplayer game for X-windows	2	CrossFire, A Multiplayer game for X-windows
4		3
5	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team
6	Copyright (C) 1992 Frank Tore Johansen	5	Copyright (C) 1992 Frank Tore Johansen
17		16
18	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
19	along with this program; if not, write to the Free Software	18	along with this program; if not, write to the Free Software
20	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21		20
22	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>
23	*/	22	*/
24		23
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
27	variable. */	26	variable. */
…		…
29	#include <stdio.h>	28	#include <stdio.h>
30	#include <sys/types.h>	29	#include <sys/types.h>
31	#include <sys/uio.h>	30	#include <sys/uio.h>
32	#include <object.h>	31	#include <object.h>
33	#include <funcpoint.h>	32	#include <funcpoint.h>
34	#include <skills.h>
35	#include <loader.h>	33	#include <loader.h>
36		34
37	int nrofallocobjects = 0;	35	int nrofallocobjects = 0;
		36	static UUID uuid;
		37	const uint64 UUID_SKIP = 1<<19;
38		38
39	object objects; / Pointer to the list of used objects */
40	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 */
41		40
42	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,
43	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
44	};	43	};
…		…
50	};	49	};
51	int freedir[SIZEOFFREE] = {	50	int freedir[SIZEOFFREE] = {
52	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,
53	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
54	};	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	}
55		131
56	/* 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. */
57	static int	133	static int
58	compare_ob_value_lists_one (const object wants, const object has)	134	compare_ob_value_lists_one (const object wants, const object has)
59	{	135	{
…		…
255	{	331	{
256	if (inv->inv)	332	if (inv->inv)
257	sum_weight (inv);	333	sum_weight (inv);
258	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
259	}	335	}
		336
260	if (op->type == CONTAINER && op->stats.Str)	337	if (op->type == CONTAINER && op->stats.Str)
261	sum = (sum * (100 - op->stats.Str)) / 100;	338	sum = (sum * (100 - op->stats.Str)) / 100;
		339
262	if (op->carrying != sum)	340	if (op->carrying != sum)
263	op->carrying = sum;	341	op->carrying = sum;
		342
264	return sum;	343	return sum;
265	}	344	}
266		345
267	/**	346	/**
268	* Return the outermost environment object for a given object.	347	* Return the outermost environment object for a given object.
…		…
295	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	374	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
296	* Some error messages.	375	* Some error messages.
297	* 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.
298	*/	377	*/
299		378
300	void	379	char *
301	dump_object2 (object *op)
302	{
303	errmsg[0] = 0;
304	return;
305	//TODO//D#d#
306	#if 0
307	char *cp;
308
309	/* object tmp;/
310
311	if (op->arch != NULL)
312	{
313	strcat (errmsg, "arch ");
314	strcat (errmsg, op->arch->name ? op->arch->name : "(null)");
315	strcat (errmsg, "\n");
316	if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
317	strcat (errmsg, cp);
318	# if 0
319	/* Don't dump player diffs - they are too long, mostly meaningless, and
320	* will overflow the buffer.
321	* Changed so that we don't dump inventory either. This may
322	* also overflow the buffer.
323	*/
324	if (op->type != PLAYER && (cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
325	strcat (errmsg, cp);
326	for (tmp = op->inv; tmp; tmp = tmp->below)
327	dump_object2 (tmp);
328	# endif
329	strcat (errmsg, "end\n");
330	}
331	else
332	{
333	strcat (errmsg, "Object ");
334	if (op->name == NULL)
335	strcat (errmsg, "(null)");
336	else
337	strcat (errmsg, op->name);
338	strcat (errmsg, "\n");
339	# if 0
340	if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
341	strcat (errmsg, cp);
342	for (tmp = op->inv; tmp; tmp = tmp->below)
343	dump_object2 (tmp);
344	# endif
345	strcat (errmsg, "end\n");
346	}
347	#endif
348	}
349
350	/*
351	* Dumps an object. Returns output in the static global errmsg array.
352	*/
353
354	void
355	dump_object (object *op)	380	dump_object (object *op)
356	{	381	{
357	if (op == NULL)	382	if (!op)
358	{	383	return strdup ("[NULLOBJ]");
359	strcpy (errmsg, "[NULL pointer]");
360	return;
361	}
362	errmsg[0] = '\0';
363	dump_object2 (op);
364	}
365		384
366	void	385	object_freezer freezer;
367	dump_all_objects (void)	386	save_object (freezer, op, 3);
368	{	387	return freezer.as_string ();
369	object *op;
370
371	for (op = objects; op != NULL; op = op->next)
372	{
373	dump_object (op);
374	fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg);
375	}
376	}	388	}
377		389
378	/*	390	/*
379	* 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
380	* multi-object 1 which is closest to the second object.	392	* multi-object 1 which is closest to the second object.
…		…
400	*/	412	*/
401		413
402	object *	414	object *
403	find_object (tag_t i)	415	find_object (tag_t i)
404	{	416	{
405	object *op;	417	for (object *op = object::first; op; op = op->next)
406
407	for (op = objects; op != NULL; op = op->next)
408	if (op->count == i)	418	if (op->count == i)
409	break;	419	return op;
		420
410	return op;	421	return 0;
411	}	422	}
412		423
413	/*	424	/*
414	* 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.
415	* Used only by the patch command, but not all that useful.	426	* Used only by the patch command, but not all that useful.
…		…
417	*/	428	*/
418		429
419	object *	430	object *
420	find_object_name (const char *str)	431	find_object_name (const char *str)
421	{	432	{
422	const char *name = shstr::find (str);	433	shstr_cmp str_ (str);
423	object *op;	434	object *op;
424		435
425	for (op = objects; op != NULL; op = op->next)	436	for (op = object::first; op != NULL; op = op->next)
426	if (&op->name == name)	437	if (op->name == str_)
427	break;	438	break;
428		439
429	return op;	440	return op;
430	}	441	}
431		442
…		…
434	{	445	{
435	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);	446	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
436	}	447	}
437		448
438	/*	449	/*
439	* Returns the object which this object marks as being the owner.
440	* A id-scheme is used to avoid pointing to objects which have been
441	* freed and are now reused. If this is detected, the owner is
442	* set to NULL, and NULL is returned.
443	* Changed 2004-02-12 - if the player is setting at the play again
444	* prompt, he is removed, and we don't want to treat him as an owner of
445	* anything, so check removed flag. I don't expect that this should break
446	* anything - once an object is removed, it is basically dead anyways.
447	*/
448
449	object *
450	get_owner (object *op)
451	{
452	if (op->owner == NULL)
453	return NULL;
454
455	if (!QUERY_FLAG (op->owner, FLAG_FREED) && !QUERY_FLAG (op->owner, FLAG_REMOVED) && op->owner->count == op->ownercount)
456	return op->owner;
457
458	op->owner = NULL;
459	op->ownercount = 0;
460	return NULL;
461	}
462
463	void
464	clear_owner (object *op)
465	{
466	if (!op)
467	return;
468
469	if (op->owner && op->ownercount == op->owner->count)
470	op->owner->refcount--;
471
472	op->owner = NULL;
473	op->ownercount = 0;
474	}
475
476	/*
477	* 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
478	* skill and experience objects.	451	* skill and experience objects.
479	*/	452	*/
480	void	453	void
481	set_owner (object op, object owner)	454	object::set_owner (object *owner)
482	{	455	{
483	if (owner == NULL \|\| op == NULL)	456	if (!owner)
484	return;	457	return;
485		458
486	/* next line added to allow objects which own objects */	459	/* next line added to allow objects which own objects */
487	/* 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
488	* with the fireball owning a poison cloud which then owned the	461	* with the fireball owning a poison cloud which then owned the
489	* 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
490	* freed and then another object replacing it. Since the ownercounts	463	* freed and then another object replacing it. Since the ownercounts
491	* 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.
492	*/	465	*/
493	while (owner->owner && owner != owner->owner && owner->ownercount == owner->owner->count)	466	while (owner->owner)
494	owner = owner->owner;	467	owner = owner->owner;
495		468
496	/* IF the owner still has an owner, we did not resolve to a final owner.
497	* so lets not add to that.
498	*/
499	if (owner->owner)
500	return;
501
502	op->owner = owner;	469	this->owner = owner;
503
504	op->ownercount = owner->count;
505	owner->refcount++;
506	}
507
508	/* Set the owner to clone's current owner and set the skill and experience
509	* objects to clone's objects (typically those objects that where the owner's
510	* current skill and experience objects at the time when clone's owner was
511	* set - not the owner's current skill and experience objects).
512	*
513	* Use this function if player created an object (e.g. fire bullet, swarm
514	* spell), and this object creates further objects whose kills should be
515	* accounted for the player's original skill, even if player has changed
516	* skills meanwhile.
517	*/
518	void
519	copy_owner (object op, object clone)
520	{
521	object *owner = get_owner (clone);
522
523	if (owner == NULL)
524	{
525	/* players don't have owners - they own themselves. Update
526	* as appropriate.
527	*/
528	if (clone->type == PLAYER)
529	owner = clone;
530	else
531	return;
532	}
533
534	set_owner (op, owner);
535	}	470	}
536		471
537	/* Zero the key_values on op, decrementing the shared-string	472	/* Zero the key_values on op, decrementing the shared-string
538	* refcounts and freeing the links.	473	* refcounts and freeing the links.
539	*/	474	*/
…		…
555	{	490	{
556	attachable_base::clear ();	491	attachable_base::clear ();
557		492
558	free_key_values (this);	493	free_key_values (this);
559		494
560	clear_owner (this);	495	owner = 0;
561
562	name = 0;	496	name = 0;
563	name_pl = 0;	497	name_pl = 0;
564	title = 0;	498	title = 0;
565	race = 0;	499	race = 0;
566	slaying = 0;	500	slaying = 0;
567	skill = 0;	501	skill = 0;
568	msg = 0;	502	msg = 0;
569	lore = 0;	503	lore = 0;
570	custom_name = 0;	504	custom_name = 0;
571	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;
572		517
573	memset (static_cast < object_pod * >(this), 0, sizeof (object_pod));	518	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
574		519
575	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;
576	}	529	}
577		530
578	void object::clone (object *destination)	531	void object::clone (object *destination)
579	{	532	{
580	(object_copy ) destination = *this;	533	(object_copy )destination = *this;
581	(object_pod ) destination = *this;	534	(object_pod )destination = *this;
582		535
583	if (self \|\| cb)	536	if (self \|\| cb)
584	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));	537	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
585	}
586
587	/*
588	* clear_object() frees everything allocated by an object, and also
589	* clears all variables and flags to default settings.
590	*/
591
592	void
593	clear_object (object *op)
594	{
595	op->clear ();
596
597	op->contr = NULL;
598	op->below = NULL;
599	op->above = NULL;
600	op->inv = NULL;
601	op->container = NULL;
602	op->env = NULL;
603	op->more = NULL;
604	op->head = NULL;
605	op->map = NULL;
606	op->refcount = 0;
607	op->active_next = NULL;
608	op->active_prev = NULL;
609	/* What is not cleared is next, prev, and count */
610
611	op->expmul = 1.0;
612	op->face = blank_face;
613	op->attacked_by_count = -1;
614
615	if (settings.casting_time)
616	op->casting_time = -1;
617	}	538	}
618		539
619	/*	540	/*
620	* copy object first frees everything allocated by the second object,	541	* copy object first frees everything allocated by the second object,
621	* 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
622	* object, allocating what needs to be allocated. Basically, any	543	* object, allocating what needs to be allocated. Basically, any
623	* 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,
624	* 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
625	* will point at garbage.	546	* will point at garbage.
626	*/	547	*/
627
628	void	548	void
629	copy_object (object op2, object op)	549	copy_object (object op2, object op)
630	{	550	{
631	bool is_freed = QUERY_FLAG (op, FLAG_FREED);	551	bool is_freed = QUERY_FLAG (op, FLAG_FREED);
632	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);	552	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);
…		…
692	/*	612	/*
693	* 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
694	* 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.
695	* 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.
696	*/	616	*/
697
698	void	617	void
699	update_ob_speed (object *op)	618	update_ob_speed (object *op)
700	{	619	{
701	extern int arch_init;	620	extern int arch_init;
702		621
…		…
711	abort ();	630	abort ();
712	#else	631	#else
713	op->speed = 0;	632	op->speed = 0;
714	#endif	633	#endif
715	}	634	}
		635
716	if (arch_init)	636	if (arch_init)
717	{
718	return;	637	return;
719	}	638
720	if (FABS (op->speed) > MIN_ACTIVE_SPEED)	639	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
721	{	640	{
722	/* If already on active list, don't do anything */	641	/* If already on active list, don't do anything */
723	if (op->active_next \|\| op->active_prev \|\| op == active_objects)	642	if (op->active_next \|\| op->active_prev \|\| op == active_objects)
724	return;	643	return;
725		644
726	/* process_events() expects us to insert the object at the beginning	645	/* process_events() expects us to insert the object at the beginning
727	* of the list. */	646	* of the list. */
728	op->active_next = active_objects;	647	op->active_next = active_objects;
		648
729	if (op->active_next != NULL)	649	if (op->active_next != NULL)
730	op->active_next->active_prev = op;	650	op->active_next->active_prev = op;
		651
731	active_objects = op;	652	active_objects = op;
732	}	653	}
733	else	654	else
734	{	655	{
735	/* If not on the active list, nothing needs to be done */	656	/* If not on the active list, nothing needs to be done */
…		…
737	return;	658	return;
738		659
739	if (op->active_prev == NULL)	660	if (op->active_prev == NULL)
740	{	661	{
741	active_objects = op->active_next;	662	active_objects = op->active_next;
		663
742	if (op->active_next != NULL)	664	if (op->active_next != NULL)
743	op->active_next->active_prev = NULL;	665	op->active_next->active_prev = NULL;
744	}	666	}
745	else	667	else
746	{	668	{
747	op->active_prev->active_next = op->active_next;	669	op->active_prev->active_next = op->active_next;
		670
748	if (op->active_next)	671	if (op->active_next)
749	op->active_next->active_prev = op->active_prev;	672	op->active_next->active_prev = op->active_prev;
750	}	673	}
		674
751	op->active_next = NULL;	675	op->active_next = NULL;
752	op->active_prev = NULL;	676	op->active_prev = NULL;
753	}	677	}
754	}	678	}
755		679
…		…
901		825
902	if (op->more != NULL)	826	if (op->more != NULL)
903	update_object (op->more, action);	827	update_object (op->more, action);
904	}	828	}
905		829
906	static unordered_vector < object *>mortals;	830	object::vector object::mortals;
907	static	831	object::vector object::objects; // not yet used
908	std::vector < object *>	832	object *object::first;
909	freed;
910		833
911	void object::free_mortals ()	834	void object::free_mortals ()
912	{	835	{
913	for (unordered_vector < object *>::iterator i = mortals.begin (); i != mortals.end ();)	836	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
914	if (!(*i)->refcount)	837	if ((*i)->refcnt)
		838	++i; // further delay freeing
		839	else
915	{	840	{
916	freed.push_back (*i);	841	delete *i;
917	mortals.erase (i);	842	mortals.erase (i);
918	}	843	}
919	else	844
920	++i;	845	static int lastmortals = 0;//D
		846
		847	if (mortals.size() != lastmortals && lastmortals > 100)//D
		848	{
		849	lastmortals = mortals.size ();//D
		850	LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
		851	}
921	}	852	}
922		853
923	object::object ()	854	object::object ()
924	{	855	{
925	SET_FLAG (this, FLAG_REMOVED);	856	SET_FLAG (this, FLAG_REMOVED);
926		857
927	expmul = 1.0;	858	expmul = 1.0;
928	face = blank_face;	859	face = blank_face;
929	attacked_by_count = -1;
930	}	860	}
931		861
932	object::~object ()	862	object::~object ()
933	{	863	{
934	free_key_values (this);	864	free_key_values (this);
935	}	865	}
936		866
937	void object::link ()	867	void object::link ()
938	{	868	{
939	count = ++ob_count;	869	count = ++ob_count;
		870	uuid = gen_uuid ();
940		871
941	prev = 0;	872	prev = 0;
942	next = objects;	873	next = object::first;
943		874
944	if (objects)	875	if (object::first)
945	objects->prev = this;	876	object::first->prev = this;
946		877
947	objects = this;	878	object::first = this;
948	}	879	}
949		880
950	void object::unlink ()	881	void object::unlink ()
951	{	882	{
952	count = 0;	883	if (this == object::first)
		884	object::first = next;
953		885
954	/* Remove this object from the list of used objects */	886	/* Remove this object from the list of used objects */
955	if (prev)
956	{
957	prev->next = next;	887	if (prev) prev->next = next;
		888	if (next) next->prev = prev;
		889
958	prev = 0;	890	prev = 0;
959	}
960
961	if (next)
962	{
963	next->prev = prev;
964	next = 0;	891	next = 0;
965	}
966
967	if (this == objects)
968	objects = next;
969	}	892	}
970		893
971	object *object::create ()	894	object *object::create ()
972	{	895	{
973	object *
974	op;
975
976	if (freed.empty ())
977	op = new object;	896	object *op = new object;
978
979	else
980	{
981	// highly annoying, but the only way to get it stable right now
982	op = freed.back ();
983	freed.pop_back ();
984	op->~object ();
985	new ((void *) op) object;
986	}
987
988	op->link ();	897	op->link ();
989	return op;	898	return op;
990	}	899	}
991		900
992	/*	901	/*
…		…
994	* it from the list of used objects, and puts it on the list of	903	* it from the list of used objects, and puts it on the list of
995	* free objects. The IS_FREED() flag is set in the object.	904	* free objects. The IS_FREED() flag is set in the object.
996	* The object must have been removed by remove_ob() first for	905	* The object must have been removed by remove_ob() first for
997	* this function to succeed.	906	* this function to succeed.
998	*	907	*
999	* If free_inventory is set, free inventory as well. Else drop items in	908	* If destroy_inventory is set, free inventory as well. Else drop items in
1000	* inventory to the ground.	909	* inventory to the ground.
1001	*/	910	*/
1002	void object::free (bool free_inventory)	911	void object::destroy (bool destroy_inventory)
1003	{	912	{
1004	if (QUERY_FLAG (this, FLAG_FREED))	913	if (QUERY_FLAG (this, FLAG_FREED))
1005	return;	914	return;
1006		915
		916	if (QUERY_FLAG (this, FLAG_FRIENDLY))
		917	remove_friendly_object (this);
		918
1007	if (!QUERY_FLAG (this, FLAG_REMOVED))	919	if (!QUERY_FLAG (this, FLAG_REMOVED))
1008	remove_ob (this);	920	remove_ob (this);
1009		921
1010	if (QUERY_FLAG (this, FLAG_FRIENDLY))
1011	remove_friendly_object (this);
1012
1013	SET_FLAG (this, FLAG_FREED);	922	SET_FLAG (this, FLAG_FREED);
1014		923
1015	if (more)	924	if (more)
1016	{	925	{
1017	more->free (free_inventory);	926	more->destroy (destroy_inventory);
1018	more = 0;	927	more = 0;
1019	}	928	}
1020		929
1021	if (inv)	930	if (inv)
1022	{	931	{
1023	/* Only if the space blocks everything do we not process -	932	/* Only if the space blocks everything do we not process -
1024	* if some form of movement is allowed, let objects	933	* if some form of movement is allowed, let objects
1025	* drop on that space.	934	* drop on that space.
1026	*/	935	*/
1027	if (free_inventory \|\| !map \|\| map->in_memory != MAP_IN_MEMORY \|\| (GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL))	936	if (destroy_inventory \|\| !map \|\| map->in_memory != MAP_IN_MEMORY \|\| GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
1028	{	937	{
1029	object *op = inv;	938	object *op = inv;
1030		939
1031	while (op)	940	while (op)
1032	{	941	{
1033	object *tmp = op->below;	942	object *tmp = op->below;
1034	op->free (free_inventory);	943	op->destroy (destroy_inventory);
1035	op = tmp;	944	op = tmp;
1036	}	945	}
1037	}	946	}
1038	else	947	else
1039	{ /* Put objects in inventory onto this space */	948	{ /* Put objects in inventory onto this space */
…		…
1058	op = tmp;	967	op = tmp;
1059	}	968	}
1060	}	969	}
1061	}	970	}
1062		971
1063	clear_owner (this);	972	// clear those pointers that likely might have circular references to us
		973	owner = 0;
		974	enemy = 0;
		975	attacked_by = 0;
		976
		977	// only relevant for players(?), but make sure of it anyways
		978	contr = 0;
1064		979
1065	/* Remove object from the active list */	980	/* Remove object from the active list */
1066	speed = 0;	981	speed = 0;
1067	update_ob_speed (this);	982	update_ob_speed (this);
1068		983
…		…
1080	sub_weight (object *op, signed long weight)	995	sub_weight (object *op, signed long weight)
1081	{	996	{
1082	while (op != NULL)	997	while (op != NULL)
1083	{	998	{
1084	if (op->type == CONTAINER)	999	if (op->type == CONTAINER)
1085	{
1086	weight = (signed long) (weight * (100 - op->stats.Str) / 100);	1000	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1087	}	1001
1088	op->carrying -= weight;	1002	op->carrying -= weight;
1089	op = op->env;	1003	op = op->env;
1090	}	1004	}
1091	}	1005	}
1092		1006
…		…
1100	*/	1014	*/
1101		1015
1102	void	1016	void
1103	remove_ob (object *op)	1017	remove_ob (object *op)
1104	{	1018	{
		1019	object tmp, last = 0;
1105	object *	1020	object *otmp;
1106	tmp, *
1107	last = NULL;
1108	object *
1109	otmp;
1110		1021
1111	tag_t
1112	tag;
1113	int
1114	check_walk_off;	1022	int check_walk_off;
1115	mapstruct *	1023	maptile *m;
1116	m;
1117		1024
1118	sint16	1025	sint16 x, y;
1119	x,
1120	y;
1121		1026
1122	if (QUERY_FLAG (op, FLAG_REMOVED))	1027	if (QUERY_FLAG (op, FLAG_REMOVED))
1123	return;	1028	return;
1124		1029
1125	SET_FLAG (op, FLAG_REMOVED);	1030	SET_FLAG (op, FLAG_REMOVED);
…		…
1202	* use translated coordinates in case some oddness with map tiling is	1107	* use translated coordinates in case some oddness with map tiling is
1203	* evident	1108	* evident
1204	*/	1109	*/
1205	if (GET_MAP_OB (m, x, y) != op)	1110	if (GET_MAP_OB (m, x, y) != op)
1206	{	1111	{
1207	dump_object (op);	1112	char *dump = dump_object (op);
1208	LOG (llevError,	1113	LOG (llevError,
1209	"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg);	1114	"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);
		1115	free (dump);
1210	dump_object (GET_MAP_OB (m, x, y));	1116	dump = dump_object (GET_MAP_OB (m, x, y));
1211	LOG (llevError, "%s\n", errmsg);	1117	LOG (llevError, "%s\n", dump);
		1118	free (dump);
1212	}	1119	}
1213		1120
1214	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */	1121	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1215	}	1122	}
1216		1123
…		…
1218	op->below = 0;	1125	op->below = 0;
1219		1126
1220	if (op->map->in_memory == MAP_SAVING)	1127	if (op->map->in_memory == MAP_SAVING)
1221	return;	1128	return;
1222		1129
1223	tag = op->count;
1224	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);	1130	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1225		1131
1226	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1132	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1227	{	1133	{
1228	/* No point updating the players look faces if he is the object	1134	/* No point updating the players look faces if he is the object
…		…
1243		1149
1244	tmp->contr->socket.update_look = 1;	1150	tmp->contr->socket.update_look = 1;
1245	}	1151	}
1246		1152
1247	/* See if player moving off should effect something */	1153	/* See if player moving off should effect something */
1248	if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1154	if (check_walk_off
		1155	&& ((op->move_type & tmp->move_off)
		1156	&& (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1249	{	1157	{
1250	move_apply (tmp, op, NULL);	1158	move_apply (tmp, op, NULL);
1251		1159
1252	if (was_destroyed (op, tag))	1160	if (op->destroyed ())
1253	{
1254	LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name);	1161	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1255	}
1256	}	1162	}
1257		1163
1258	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1164	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1259		1165
1260	if (tmp->above == tmp)	1166	if (tmp->above == tmp)
…		…
1288	* This function goes through all objects below and including top, and	1194	* This function goes through all objects below and including top, and
1289	* merges op to the first matching object.	1195	* merges op to the first matching object.
1290	* If top is NULL, it is calculated.	1196	* If top is NULL, it is calculated.
1291	* Returns pointer to object if it succeded in the merge, otherwise NULL	1197	* Returns pointer to object if it succeded in the merge, otherwise NULL
1292	*/	1198	*/
1293
1294	object *	1199	object *
1295	merge_ob (object op, object top)	1200	merge_ob (object op, object top)
1296	{	1201	{
1297	if (!op->nrof)	1202	if (!op->nrof)
1298	return 0;	1203	return 0;
…		…
1314	free_object (op);	1219	free_object (op);
1315	return top;	1220	return top;
1316	}	1221	}
1317	}	1222	}
1318		1223
1319	return NULL;	1224	return 0;
1320	}	1225	}
1321		1226
1322	/*	1227	/*
1323	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1228	* same as insert_ob_in_map except it handle separate coordinates and do a clean
1324	* job preparing multi-part monsters	1229	* job preparing multi-part monsters
1325	*/	1230	*/
1326	object *	1231	object *
1327	insert_ob_in_map_at (object op, mapstruct m, object *originator, int flag, int x, int y)	1232	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1328	{	1233	{
1329	object *tmp;	1234	object *tmp;
1330		1235
1331	if (op->head)	1236	if (op->head)
1332	op = op->head;	1237	op = op->head;
…		…
1360	* NULL if 'op' was destroyed	1265	* NULL if 'op' was destroyed
1361	* just 'op' otherwise	1266	* just 'op' otherwise
1362	*/	1267	*/
1363		1268
1364	object *	1269	object *
1365	insert_ob_in_map (object op, mapstruct m, object *originator, int flag)	1270	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1366	{	1271	{
1367	object tmp, top, *floor = NULL;	1272	object tmp, top, *floor = NULL;
1368	sint16 x, y;	1273	sint16 x, y;
1369		1274
1370	if (QUERY_FLAG (op, FLAG_FREED))	1275	if (QUERY_FLAG (op, FLAG_FREED))
…		…
1373	return NULL;	1278	return NULL;
1374	}	1279	}
1375		1280
1376	if (m == NULL)	1281	if (m == NULL)
1377	{	1282	{
1378	dump_object (op);	1283	char *dump = dump_object (op);
1379	LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg);	1284	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
		1285	free (dump);
1380	return op;	1286	return op;
1381	}	1287	}
1382		1288
1383	if (out_of_map (m, op->x, op->y))	1289	if (out_of_map (m, op->x, op->y))
1384	{	1290	{
1385	dump_object (op);	1291	char *dump = dump_object (op);
1386	LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg);	1292	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1387	#ifdef MANY_CORES	1293	#ifdef MANY_CORES
1388	/* Better to catch this here, as otherwise the next use of this object	1294	/* Better to catch this here, as otherwise the next use of this object
1389	* is likely to cause a crash. Better to find out where it is getting	1295	* is likely to cause a crash. Better to find out where it is getting
1390	* improperly inserted.	1296	* improperly inserted.
1391	*/	1297	*/
1392	abort ();	1298	abort ();
1393	#endif	1299	#endif
		1300	free (dump);
1394	return op;	1301	return op;
1395	}	1302	}
1396		1303
1397	if (!QUERY_FLAG (op, FLAG_REMOVED))	1304	if (!QUERY_FLAG (op, FLAG_REMOVED))
1398	{	1305	{
1399	dump_object (op);	1306	char *dump = dump_object (op);
1400	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg);	1307	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
		1308	free (dump);
1401	return op;	1309	return op;
1402	}	1310	}
1403		1311
1404	if (op->more != NULL)	1312	if (op->more != NULL)
1405	{	1313	{
…		…
1651	remove_ob (tmp);	1559	remove_ob (tmp);
1652	free_object (tmp);	1560	free_object (tmp);
1653	}	1561	}
1654	}	1562	}
1655		1563
1656	tmp1 = arch_to_object (find_archetype (arch_string));	1564	tmp1 = arch_to_object (archetype::find (arch_string));
1657		1565
1658	tmp1->x = op->x;	1566	tmp1->x = op->x;
1659	tmp1->y = op->y;	1567	tmp1->y = op->y;
1660	insert_ob_in_map (tmp1, op->map, op, 0);	1568	insert_ob_in_map (tmp1, op->map, op, 0);
1661	}	1569	}
…		…
1842	tmp, *	1750	tmp, *
1843	otmp;	1751	otmp;
1844		1752
1845	if (!QUERY_FLAG (op, FLAG_REMOVED))	1753	if (!QUERY_FLAG (op, FLAG_REMOVED))
1846	{	1754	{
1847	dump_object (op);	1755	char *dump = dump_object (op);
1848	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);	1756	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", dump);
		1757	free (dump);
1849	return op;	1758	return op;
1850	}	1759	}
1851		1760
1852	if (where == NULL)	1761	if (where == NULL)
1853	{	1762	{
1854	dump_object (op);	1763	char *dump = dump_object (op);
1855	LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);	1764	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
		1765	free (dump);
1856	return op;	1766	return op;
1857	}	1767	}
1858		1768
1859	if (where->head)	1769	if (where->head)
1860	{	1770	{
…		…
1960	*/	1870	*/
1961		1871
1962	int	1872	int
1963	check_move_on (object op, object originator)	1873	check_move_on (object op, object originator)
1964	{	1874	{
1965	object *	1875	object *tmp;
1966	tmp;	1876	maptile *m = op->map;
1967	tag_t
1968	tag;
1969	mapstruct *
1970	m = op->map;
1971	int
1972	x = op->x, y = op->y;	1877	int x = op->x, y = op->y;
1973		1878
1974	MoveType	1879	MoveType move_on, move_slow, move_block;
1975	move_on,
1976	move_slow,
1977	move_block;
1978		1880
1979	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1881	if (QUERY_FLAG (op, FLAG_NO_APPLY))
1980	return 0;	1882	return 0;
1981
1982	tag = op->count;
1983		1883
1984	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1884	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
1985	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1885	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
1986	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1886	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1987		1887
…		…
2048	if ((!op->move_type && tmp->move_on & MOVE_WALK) \|\|	1948	if ((!op->move_type && tmp->move_on & MOVE_WALK) \|\|
2049	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))	1949	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
2050	{	1950	{
2051	move_apply (tmp, op, originator);	1951	move_apply (tmp, op, originator);
2052		1952
2053	if (was_destroyed (op, tag))	1953	if (op->destroyed ())
2054	return 1;	1954	return 1;
2055		1955
2056	/* what the person/creature stepped onto has moved the object	1956	/* what the person/creature stepped onto has moved the object
2057	* someplace new. Don't process any further - if we did,	1957	* someplace new. Don't process any further - if we did,
2058	* have a feeling strange problems would result.	1958	* have a feeling strange problems would result.
…		…
2070	* a matching archetype at the given map and coordinates.	1970	* a matching archetype at the given map and coordinates.
2071	* The first matching object is returned, or NULL if none.	1971	* The first matching object is returned, or NULL if none.
2072	*/	1972	*/
2073		1973
2074	object *	1974	object *
2075	present_arch (const archetype at, mapstruct m, int x, int y)	1975	present_arch (const archetype at, maptile m, int x, int y)
2076	{	1976	{
2077	object *	1977	object *
2078	tmp;	1978	tmp;
2079		1979
2080	if (m == NULL \|\| out_of_map (m, x, y))	1980	if (m == NULL \|\| out_of_map (m, x, y))
…		…
2093	* a matching type variable at the given map and coordinates.	1993	* a matching type variable at the given map and coordinates.
2094	* The first matching object is returned, or NULL if none.	1994	* The first matching object is returned, or NULL if none.
2095	*/	1995	*/
2096		1996
2097	object *	1997	object *
2098	present (unsigned char type, mapstruct *m, int x, int y)	1998	present (unsigned char type, maptile *m, int x, int y)
2099	{	1999	{
2100	object *	2000	object *
2101	tmp;	2001	tmp;
2102		2002
2103	if (out_of_map (m, x, y))	2003	if (out_of_map (m, x, y))
…		…
2243	* the archetype because that isn't correct if the monster has been	2143	* the archetype because that isn't correct if the monster has been
2244	* customized, changed states, etc.	2144	* customized, changed states, etc.
2245	*/	2145	*/
2246		2146
2247	int	2147	int
2248	find_free_spot (const object ob, mapstruct m, int x, int y, int start, int stop)	2148	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)
2249	{	2149	{
2250	int	2150	int
2251	i,	2151	i,
2252	index = 0, flag;	2152	index = 0, flag;
2253	static int	2153	static int
…		…
2274	return -1;	2174	return -1;
2275	return altern[RANDOM () % index];	2175	return altern[RANDOM () % index];
2276	}	2176	}
2277		2177
2278	/*	2178	/*
2279	* find_first_free_spot(archetype, mapstruct, x, y) works like	2179	* find_first_free_spot(archetype, maptile, x, y) works like
2280	* find_free_spot(), but it will search max number of squares.	2180	* find_free_spot(), but it will search max number of squares.
2281	* But it will return the first available spot, not a random choice.	2181	* But it will return the first available spot, not a random choice.
2282	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2182	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2283	*/	2183	*/
2284		2184
2285	int	2185	int
2286	find_first_free_spot (const object ob, mapstruct m, int x, int y)	2186	find_first_free_spot (const object ob, maptile m, int x, int y)
2287	{	2187	{
2288	int	2188	int
2289	i;	2189	i;
2290		2190
2291	for (i = 0; i < SIZEOFFREE; i++)	2191	for (i = 0; i < SIZEOFFREE; i++)
…		…
2355	* because we have to know what movement the thing looking to move	2255	* because we have to know what movement the thing looking to move
2356	* there is capable of.	2256	* there is capable of.
2357	*/	2257	*/
2358		2258
2359	int	2259	int
2360	find_dir (mapstruct m, int x, int y, object exclude)	2260	find_dir (maptile m, int x, int y, object exclude)
2361	{	2261	{
2362	int	2262	int
2363	i,	2263	i,
2364	max = SIZEOFFREE, mflags;	2264	max = SIZEOFFREE, mflags;
2365		2265
2366	sint16 nx, ny;	2266	sint16 nx, ny;
2367	object *	2267	object *
2368	tmp;	2268	tmp;
2369	mapstruct *	2269	maptile *
2370	mp;	2270	mp;
2371		2271
2372	MoveType blocked, move_type;	2272	MoveType blocked, move_type;
2373		2273
2374	if (exclude && exclude->head)	2274	if (exclude && exclude->head)
…		…
2582	* Modified to be map tile aware -.MSW	2482	* Modified to be map tile aware -.MSW
2583	*/	2483	*/
2584		2484
2585		2485
2586	int	2486	int
2587	can_see_monsterP (mapstruct *m, int x, int y, int dir)	2487	can_see_monsterP (maptile *m, int x, int y, int dir)
2588	{	2488	{
2589	sint16 dx, dy;	2489	sint16 dx, dy;
2590	int	2490	int
2591	mflags;	2491	mflags;
2592		2492
…		…
2672	if (prev)	2572	if (prev)
2673	prev->more = tmp;	2573	prev->more = tmp;
2674	prev = tmp;	2574	prev = tmp;
2675	}	2575	}
2676		2576
2677	/* copy inventory */
2678	for (item = src->inv; item; item = item->below)	2577	for (item = src->inv; item; item = item->below)
2679	{
2680	(void) insert_ob_in_ob (object_create_clone (item), dst);	2578	insert_ob_in_ob (object_create_clone (item), dst);
2681	}
2682		2579
2683	return dst;	2580	return dst;
2684	}	2581	}
2685		2582
2686	/* return true if the object was destroyed, 0 otherwise */
2687	int
2688	was_destroyed (const object *op, tag_t old_tag)
2689	{
2690	/* checking for FLAG_FREED isn't necessary, but makes this function more
2691	* robust */
2692	return op->count != old_tag \|\| QUERY_FLAG (op, FLAG_FREED);
2693	}
2694
2695	/* GROS - Creates an object using a string representing its content. */	2583	/* GROS - Creates an object using a string representing its content. */
2696
2697	/* Basically, we save the content of the string to a temp file, then call */	2584	/* Basically, we save the content of the string to a temp file, then call */
2698
2699	/* load_object on it. I admit it is a highly inefficient way to make things, */	2585	/* load_object on it. I admit it is a highly inefficient way to make things, */
2700
2701	/* but it was simple to make and allows reusing the load_object function. */	2586	/* but it was simple to make and allows reusing the load_object function. */
2702
2703	/* Remember not to use load_object_str in a time-critical situation. */	2587	/* Remember not to use load_object_str in a time-critical situation. */
2704
2705	/* Also remember that multiparts objects are not supported for now. */	2588	/* Also remember that multiparts objects are not supported for now. */
2706		2589
2707	object *	2590	object *
2708	load_object_str (const char *obstr)	2591	load_object_str (const char *obstr)
2709	{	2592	{
2710	object *	2593	object *op;
2711	op;
2712	char
2713	filename[MAX_BUF];	2594	char filename[MAX_BUF];
2714		2595
2715	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);	2596	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2716		2597
2717	FILE *
2718	tempfile = fopen (filename, "w");	2598	FILE *tempfile = fopen (filename, "w");
2719		2599
2720	if (tempfile == NULL)	2600	if (tempfile == NULL)
2721	{	2601	{
2722	LOG (llevError, "Error - Unable to access load object temp file\n");	2602	LOG (llevError, "Error - Unable to access load object temp file\n");
2723	return NULL;	2603	return NULL;
2724	};	2604	}
		2605
2725	fprintf (tempfile, obstr);	2606	fprintf (tempfile, obstr);
2726	fclose (tempfile);	2607	fclose (tempfile);
2727		2608
2728	op = get_object ();	2609	op = get_object ();
2729		2610
…		…
2743	* returns NULL if no match.	2624	* returns NULL if no match.
2744	*/	2625	*/
2745	object *	2626	object *
2746	find_obj_by_type_subtype (const object *who, int type, int subtype)	2627	find_obj_by_type_subtype (const object *who, int type, int subtype)
2747	{	2628	{
2748	object *	2629	object *tmp;
2749	tmp;
2750		2630
2751	for (tmp = who->inv; tmp; tmp = tmp->below)	2631	for (tmp = who->inv; tmp; tmp = tmp->below)
2752	if (tmp->type == type && tmp->subtype == subtype)	2632	if (tmp->type == type && tmp->subtype == subtype)
2753	return tmp;	2633	return tmp;
2754		2634
…		…
2762	* do the desired thing.	2642	* do the desired thing.
2763	*/	2643	*/
2764	key_value *	2644	key_value *
2765	get_ob_key_link (const object ob, const char key)	2645	get_ob_key_link (const object ob, const char key)
2766	{	2646	{
2767	key_value *	2647	key_value *link;
2768	link;
2769		2648
2770	for (link = ob->key_values; link != NULL; link = link->next)	2649	for (link = ob->key_values; link != NULL; link = link->next)
2771	{
2772	if (link->key == key)	2650	if (link->key == key)
2773	{
2774	return link;	2651	return link;
2775	}
2776	}
2777		2652
2778	return NULL;	2653	return NULL;
2779	}	2654	}
2780		2655
2781	/*	2656	/*
…		…
2786	* The returned string is shared.	2661	* The returned string is shared.
2787	*/	2662	*/
2788	const char *	2663	const char *
2789	get_ob_key_value (const object op, const char const key)	2664	get_ob_key_value (const object op, const char const key)
2790	{	2665	{
2791	key_value *	2666	key_value *link;
2792	link;	2667	shstr_cmp canonical_key (key);
2793	const char *
2794	canonical_key;
2795		2668
2796	canonical_key = shstr::find (key);
2797
2798	if (canonical_key == NULL)	2669	if (!canonical_key)
2799	{	2670	{
2800	/* 1. There being a field named key on any object	2671	/* 1. There being a field named key on any object
2801	* implies there'd be a shared string to find.	2672	* implies there'd be a shared string to find.
2802	* 2. Since there isn't, no object has this field.	2673	* 2. Since there isn't, no object has this field.
2803	* 3. Therefore, this object doesn't have this field.	2674	* 3. Therefore, this object doesn't have this field.
2804	*/	2675	*/
2805	return NULL;	2676	return 0;
2806	}	2677	}
2807		2678
2808	/* This is copied from get_ob_key_link() above -	2679	/* This is copied from get_ob_key_link() above -
2809	* only 4 lines, and saves the function call overhead.	2680	* only 4 lines, and saves the function call overhead.
2810	*/	2681	*/
2811	for (link = op->key_values; link != NULL; link = link->next)	2682	for (link = op->key_values; link; link = link->next)
2812	{
2813	if (link->key == canonical_key)	2683	if (link->key == canonical_key)
2814	{
2815	return link->value;	2684	return link->value;
2816	}	2685
2817	}
2818	return NULL;	2686	return 0;
2819	}	2687	}
2820		2688
2821		2689
2822	/*	2690	/*
2823	* Updates the canonical_key in op to value.	2691	* Updates the canonical_key in op to value.
…		…
2908	{	2776	{
2909	shstr key_ (key);	2777	shstr key_ (key);
2910		2778
2911	return set_ob_key_value_s (op, key_, value, add_key);	2779	return set_ob_key_value_s (op, key_, value, add_key);
2912	}	2780	}
		2781
		2782	object::depth_iterator::depth_iterator (object *container)
		2783	: iterator_base (container)
		2784	{
		2785	while (item->inv)
		2786	item = item->inv;
		2787	}
		2788
		2789	void
		2790	object::depth_iterator::next ()
		2791	{
		2792	if (item->below)
		2793	{
		2794	item = item->below;
		2795
		2796	while (item->inv)
		2797	item = item->inv;
		2798	}
		2799	else
		2800	item = item->env;
		2801	}
		2802
		2803	// return a suitable string describing an objetc in enough detail to find it
		2804	const char *
		2805	object::debug_desc (char *info) const
		2806	{
		2807	char info2[256 * 3];
		2808	char *p = info;
		2809
		2810	p += snprintf (p, 256, "%d=\"%s%s%s\"",
		2811	count,
		2812	&name,
		2813	title ? " " : "",
		2814	title ? (const char *)title : "");
		2815
		2816	if (env)
		2817	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
		2818
		2819	if (map)
		2820	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);
		2821
		2822	return info;
		2823	}
		2824
		2825	const char *
		2826	object::debug_desc () const
		2827	{
		2828	static char info[256 * 3];
		2829	return debug_desc (info);
		2830	}
		2831

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.29 by root, Mon Sep 11 12:38:36 2006 UTC vs. Revision 1.54 by root, Fri Nov 17 19:40:53 2006 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.29 by root, Mon Sep 11 12:38:36 2006 UTC vs.
Revision 1.54 by root, Fri Nov 17 19:40:53 2006 UTC