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.25 by root, Mon Sep 11 01:16:20 2006 UTC vs.
Revision 1.46 by root, Thu Sep 14 21:16:11 2006 UTC

1
2	/*
3	* static char *rcsid_object_c =
4	* "$Id: object.C,v 1.25 2006/09/11 01:16:20 root Exp $";
5	*/
6		1
7	/*	2	/*
8	CrossFire, A Multiplayer game for X-windows	3	CrossFire, A Multiplayer game for X-windows
9		4
10	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	Copyright (C) 2001 Mark Wedel & Crossfire Development Team
…		…
29		24
30	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
31	sub/add_weight will transcend the environment updating the carrying	26	sub/add_weight will transcend the environment updating the carrying
32	variable. */	27	variable. */
33	#include <global.h>	28	#include <global.h>
34	#ifndef WIN32 /* ---win32 exclude headers */
35	# include <stdio.h>	29	#include <stdio.h>
36	# include <sys/types.h>	30	#include <sys/types.h>
37	# include <sys/uio.h>	31	#include <sys/uio.h>
38	#endif /* win32 */
39	#include <object.h>	32	#include <object.h>
40	#include <funcpoint.h>	33	#include <funcpoint.h>
41	#include <skills.h>
42	#include <loader.h>	34	#include <loader.h>
		35
43	int nrofallocobjects = 0;	36	int nrofallocobjects = 0;
		37	static UUID uuid;
		38	const uint64 UUID_SKIP = 1<<19;
44		39
45	object *objects; /* Pointer to the list of used objects */
46	object *active_objects; /* List of active objects that need to be processed */	40	object *active_objects; /* List of active objects that need to be processed */
47		41
48	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	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,
49	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	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
50	};	44	};
…		…
56	};	50	};
57	int freedir[SIZEOFFREE] = {	51	int freedir[SIZEOFFREE] = {
58	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	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,
59	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	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
60	};	54	};
		55
		56	static void
		57	write_uuid (void)
		58	{
		59	char filename1[MAX_BUF], filename2[MAX_BUF];
		60
		61	sprintf (filename1, "%s/uuid", settings.localdir);
		62	sprintf (filename2, "%s/uuid~", settings.localdir);
		63
		64	FILE *fp;
		65
		66	if (!(fp = fopen (filename2, "w")))
		67	{
		68	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
		69	return;
		70	}
		71
		72	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
		73	fclose (fp);
		74	rename (filename2, filename1);
		75	}
		76
		77	static void
		78	read_uuid (void)
		79	{
		80	char filename[MAX_BUF];
		81
		82	sprintf (filename, "%s/uuid", settings.localdir);
		83
		84	FILE *fp;
		85
		86	if (!(fp = fopen (filename, "r")))
		87	{
		88	if (errno == ENOENT)
		89	{
		90	LOG (llevInfo, "RESET uid to 1\n");
		91	uuid.seq = 0;
		92	write_uuid ();
		93	return;
		94	}
		95
		96	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
		97	_exit (1);
		98	}
		99
		100	int version;
		101	unsigned long long uid;
		102	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)
		103	{
		104	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);
		105	_exit (1);
		106	}
		107
		108	uuid.seq = uid;
		109	write_uuid ();
		110	LOG (llevDebug, "read UID: %lld\n", uid);
		111	fclose (fp);
		112	}
		113
		114	UUID
		115	gen_uuid ()
		116	{
		117	UUID uid;
		118
		119	uid.seq = ++uuid.seq;
		120
		121	if (!(uuid.seq & (UUID_SKIP - 1)))
		122	write_uuid ();
		123
		124	return uid;
		125	}
		126
		127	void
		128	init_uuid ()
		129	{
		130	read_uuid ();
		131	}
61		132
62	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	133	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
63	static int	134	static int
64	compare_ob_value_lists_one (const object *wants, const object *has)	135	compare_ob_value_lists_one (const object *wants, const object *has)
65	{	136	{
…		…
214	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	285	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)
215	return 0;	286	return 0;
216		287
217	switch (ob1->type)	288	switch (ob1->type)
218	{	289	{
219	case SCROLL:	290	case SCROLL:
220	if (ob1->level != ob2->level)	291	if (ob1->level != ob2->level)
221	return 0;	292	return 0;
222	break;	293	break;
223	}	294	}
224		295
225	if (ob1->key_values != NULL || ob2->key_values != NULL)	296	if (ob1->key_values != NULL || ob2->key_values != NULL)
226	{	297	{
227	/* At least one of these has key_values. */	298	/* At least one of these has key_values. */
…		…
249	/*	320	/*
250	* sum_weight() is a recursive function which calculates the weight	321	* sum_weight() is a recursive function which calculates the weight
251	* an object is carrying. It goes through in figures out how much	322	* an object is carrying. It goes through in figures out how much
252	* containers are carrying, and sums it up.	323	* containers are carrying, and sums it up.
253	*/	324	*/
254	signed long	325	long
255	sum_weight (object *op)	326	sum_weight (object *op)
256	{	327	{
257	signed long sum;	328	long sum;
258	object *inv;	329	object *inv;
259		330
260	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	331	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)
261	{	332	{
262	if (inv->inv)	333	if (inv->inv)
263	sum_weight (inv);	334	sum_weight (inv);
264	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	335	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
265	}	336	}
		337
266	if (op->type == CONTAINER && op->stats.Str)	338	if (op->type == CONTAINER && op->stats.Str)
267	sum = (sum * (100 - op->stats.Str)) / 100;	339	sum = (sum * (100 - op->stats.Str)) / 100;
		340
268	if (op->carrying != sum)	341	if (op->carrying != sum)
269	op->carrying = sum;	342	op->carrying = sum;
		343
270	return sum;	344	return sum;
271	}	345	}
272		346
273	/**	347	/**
274	* Return the outermost environment object for a given object.	348	* Return the outermost environment object for a given object.
…		…
372	void	446	void
373	dump_all_objects (void)	447	dump_all_objects (void)
374	{	448	{
375	object *op;	449	object *op;
376		450
377	for (op = objects; op != NULL; op = op->next)	451	for (op = object::first; op != NULL; op = op->next)
378	{	452	{
379	dump_object (op);	453	dump_object (op);
380	fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg);	454	fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg);
381	}	455	}
382	}	456	}
…		…
408	object *	482	object *
409	find_object (tag_t i)	483	find_object (tag_t i)
410	{	484	{
411	object *op;	485	object *op;
412		486
413	for (op = objects; op != NULL; op = op->next)	487	for (op = object::first; op != NULL; op = op->next)
414	if (op->count == i)	488	if (op->count == i)
415	break;	489	break;
416	return op;	490	return op;
417	}	491	}
418		492
…		…
423	*/	497	*/
424		498
425	object *	499	object *
426	find_object_name (const char *str)	500	find_object_name (const char *str)
427	{	501	{
428	const char *name = shstr::find (str);	502	shstr_cmp str_ (str);
429	object *op;	503	object *op;
430		504
431	for (op = objects; op != NULL; op = op->next)	505	for (op = object::first; op != NULL; op = op->next)
432	if (&op->name == name)	506	if (op->name == str_)
433	break;	507	break;
434		508
435	return op;	509	return op;
436	}	510	}
437		511
…		…
440	{	514	{
441	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);	515	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
442	}	516	}
443		517
444	/*	518	/*
445	* Returns the object which this object marks as being the owner.
446	* A id-scheme is used to avoid pointing to objects which have been
447	* freed and are now reused. If this is detected, the owner is
448	* set to NULL, and NULL is returned.
449	* Changed 2004-02-12 - if the player is setting at the play again
450	* prompt, he is removed, and we don't want to treat him as an owner of
451	* anything, so check removed flag. I don't expect that this should break
452	* anything - once an object is removed, it is basically dead anyways.
453	*/
454
455	object *
456	get_owner (object *op)
457	{
458	if (op->owner == NULL)
459	return NULL;
460
461	if (!QUERY_FLAG (op->owner, FLAG_FREED) && !QUERY_FLAG (op->owner, FLAG_REMOVED) && op->owner->count == op->ownercount)
462	return op->owner;
463
464	op->owner = NULL;
465	op->ownercount = 0;
466	return NULL;
467	}
468
469	void
470	clear_owner (object *op)
471	{
472	if (!op)
473	return;
474
475	if (op->owner && op->ownercount == op->owner->count)
476	op->owner->refcount--;
477
478	op->owner = NULL;
479	op->ownercount = 0;
480	}
481
482	/*
483	* Sets the owner and sets the skill and exp pointers to owner's current	519	* Sets the owner and sets the skill and exp pointers to owner's current
484	* skill and experience objects.	520	* skill and experience objects.
485	*/	521	*/
486	void	522	void
487	set_owner (object *op, object *owner)	523	object::set_owner (object *owner)
488	{	524	{
489	if (owner == NULL || op == NULL)	525	if (!owner)
490	return;	526	return;
491		527
492	/* next line added to allow objects which own objects */	528	/* next line added to allow objects which own objects */
493	/* Add a check for ownercounts in here, as I got into an endless loop	529	/* Add a check for ownercounts in here, as I got into an endless loop
494	* with the fireball owning a poison cloud which then owned the	530	* with the fireball owning a poison cloud which then owned the
495	* fireball. I believe that was caused by one of the objects getting	531	* fireball. I believe that was caused by one of the objects getting
496	* freed and then another object replacing it. Since the ownercounts	532	* freed and then another object replacing it. Since the ownercounts
497	* didn't match, this check is valid and I believe that cause is valid.	533	* didn't match, this check is valid and I believe that cause is valid.
498	*/	534	*/
499	while (owner->owner && owner != owner->owner && owner->ownercount == owner->owner->count)	535	while (owner->owner)
500	owner = owner->owner;	536	owner = owner->owner;
501		537
502	/* IF the owner still has an owner, we did not resolve to a final owner.
503	* so lets not add to that.
504	*/
505	if (owner->owner)
506	return;
507
508	op->owner = owner;	538	this->owner = owner;
509
510	op->ownercount = owner->count;
511	owner->refcount++;
512	}
513
514	/* Set the owner to clone's current owner and set the skill and experience
515	* objects to clone's objects (typically those objects that where the owner's
516	* current skill and experience objects at the time when clone's owner was
517	* set - not the owner's current skill and experience objects).
518	*
519	* Use this function if player created an object (e.g. fire bullet, swarm
520	* spell), and this object creates further objects whose kills should be
521	* accounted for the player's original skill, even if player has changed
522	* skills meanwhile.
523	*/
524	void
525	copy_owner (object *op, object *clone)
526	{
527	object *owner = get_owner (clone);
528
529	if (owner == NULL)
530	{
531	/* players don't have owners - they own themselves. Update
532	* as appropriate.
533	*/
534	if (clone->type == PLAYER)
535	owner = clone;
536	else
537	return;
538	}
539
540	set_owner (op, owner);
541	}	539	}
542		540
543	/* Zero the key_values on op, decrementing the shared-string	541	/* Zero the key_values on op, decrementing the shared-string
544	* refcounts and freeing the links.	542	* refcounts and freeing the links.
545	*/	543	*/
…		…
561	{	559	{
562	attachable_base::clear ();	560	attachable_base::clear ();
563		561
564	free_key_values (this);	562	free_key_values (this);
565		563
566	clear_owner (this);	564	owner = 0;
567
568	name = 0;	565	name = 0;
569	name_pl = 0;	566	name_pl = 0;
570	title = 0;	567	title = 0;
571	race = 0;	568	race = 0;
572	slaying = 0;	569	slaying = 0;
573	skill = 0;	570	skill = 0;
574	msg = 0;	571	msg = 0;
575	lore = 0;	572	lore = 0;
576	custom_name = 0;	573	custom_name = 0;
577	materialname = 0;	574	materialname = 0;
		575	contr = 0;
		576	below = 0;
		577	above = 0;
		578	inv = 0;
		579	container = 0;
		580	env = 0;
		581	more = 0;
		582	head = 0;
		583	map = 0;
		584	active_next = 0;
		585	active_prev = 0;
578		586
579	memset (static_cast < object_pod * >(this), 0, sizeof (object_pod));	587	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
580		588
581	SET_FLAG (this, FLAG_REMOVED);	589	SET_FLAG (this, FLAG_REMOVED);
		590
		591	/* What is not cleared is next, prev, and count */
		592
		593	expmul = 1.0;
		594	face = blank_face;
		595
		596	if (settings.casting_time)
		597	casting_time = -1;
582	}	598	}
583		599
584	void object::clone (object *destination)	600	void object::clone (object *destination)
585	{	601	{
586	*(object_copy *) destination = *this;	602	*(object_copy *)destination = *this;
587	*(object_pod *) destination = *this;	603	*(object_pod *)destination = *this;
588		604
589	if (self || cb)	605	if (self || cb)
590	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));	606	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
591	}
592
593	/*
594	* clear_object() frees everything allocated by an object, and also
595	* clears all variables and flags to default settings.
596	*/
597
598	void
599	clear_object (object *op)
600	{
601	op->clear ();
602
603	op->contr = NULL;
604	op->below = NULL;
605	op->above = NULL;
606	op->inv = NULL;
607	op->container = NULL;
608	op->env = NULL;
609	op->more = NULL;
610	op->head = NULL;
611	op->map = NULL;
612	op->refcount = 0;
613	op->active_next = NULL;
614	op->active_prev = NULL;
615	/* What is not cleared is next, prev, and count */
616
617	op->expmul = 1.0;
618	op->face = blank_face;
619	op->attacked_by_count = -1;
620
621	if (settings.casting_time)
622	op->casting_time = -1;
623	}	607	}
624		608
625	/*	609	/*
626	* copy object first frees everything allocated by the second object,	610	* copy object first frees everything allocated by the second object,
627	* and then copies the contends of the first object into the second	611	* and then copies the contends of the first object into the second
628	* object, allocating what needs to be allocated. Basically, any	612	* object, allocating what needs to be allocated. Basically, any
629	* data that is malloc'd needs to be re-malloc/copied. Otherwise,	613	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
630	* if the first object is freed, the pointers in the new object	614	* if the first object is freed, the pointers in the new object
631	* will point at garbage.	615	* will point at garbage.
632	*/	616	*/
633
634	void	617	void
635	copy_object (object *op2, object *op)	618	copy_object (object *op2, object *op)
636	{	619	{
637	bool is_freed = QUERY_FLAG (op, FLAG_FREED);	620	bool is_freed = QUERY_FLAG (op, FLAG_FREED);
638	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);	621	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);
…		…
698	/*	681	/*
699	* Updates the speed of an object. If the speed changes from 0 to another	682	* Updates the speed of an object. If the speed changes from 0 to another
700	* value, or vice versa, then add/remove the object from the active list.	683	* value, or vice versa, then add/remove the object from the active list.
701	* This function needs to be called whenever the speed of an object changes.	684	* This function needs to be called whenever the speed of an object changes.
702	*/	685	*/
703
704	void	686	void
705	update_ob_speed (object *op)	687	update_ob_speed (object *op)
706	{	688	{
707	extern int arch_init;	689	extern int arch_init;
708		690
…		…
717	abort ();	699	abort ();
718	#else	700	#else
719	op->speed = 0;	701	op->speed = 0;
720	#endif	702	#endif
721	}	703	}
		704
722	if (arch_init)	705	if (arch_init)
723	{
724	return;	706	return;
725	}	707
726	if (FABS (op->speed) > MIN_ACTIVE_SPEED)	708	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
727	{	709	{
728	/* If already on active list, don't do anything */	710	/* If already on active list, don't do anything */
729	if (op->active_next || op->active_prev || op == active_objects)	711	if (op->active_next || op->active_prev || op == active_objects)
730	return;	712	return;
731		713
732	/* process_events() expects us to insert the object at the beginning	714	/* process_events() expects us to insert the object at the beginning
733	* of the list. */	715	* of the list. */
734	op->active_next = active_objects;	716	op->active_next = active_objects;
		717
735	if (op->active_next != NULL)	718	if (op->active_next != NULL)
736	op->active_next->active_prev = op;	719	op->active_next->active_prev = op;
		720
737	active_objects = op;	721	active_objects = op;
738	}	722	}
739	else	723	else
740	{	724	{
741	/* If not on the active list, nothing needs to be done */	725	/* If not on the active list, nothing needs to be done */
…		…
743	return;	727	return;
744		728
745	if (op->active_prev == NULL)	729	if (op->active_prev == NULL)
746	{	730	{
747	active_objects = op->active_next;	731	active_objects = op->active_next;
		732
748	if (op->active_next != NULL)	733	if (op->active_next != NULL)
749	op->active_next->active_prev = NULL;	734	op->active_next->active_prev = NULL;
750	}	735	}
751	else	736	else
752	{	737	{
753	op->active_prev->active_next = op->active_next;	738	op->active_prev->active_next = op->active_next;
		739
754	if (op->active_next)	740	if (op->active_next)
755	op->active_next->active_prev = op->active_prev;	741	op->active_next->active_prev = op->active_prev;
756	}	742	}
		743
757	op->active_next = NULL;	744	op->active_next = NULL;
758	op->active_prev = NULL;	745	op->active_prev = NULL;
759	}	746	}
760	}	747	}
761		748
…		…
891	/* if the object is being removed, we can't make intelligent	878	/* if the object is being removed, we can't make intelligent
892	* decisions, because remove_ob can't really pass the object	879	* decisions, because remove_ob can't really pass the object
893	* that is being removed.	880	* that is being removed.
894	*/	881	*/
895	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	882	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
896	{
897	update_now = 1;	883	update_now = 1;
898	}
899	else if (action == UP_OBJ_FACE)	884	else if (action == UP_OBJ_FACE)
900	{
901	/* Nothing to do for that case */	885	/* Nothing to do for that case */ ;
902	}
903	else	886	else
904	{
905	LOG (llevError, "update_object called with invalid action: %d\n", action);	887	LOG (llevError, "update_object called with invalid action: %d\n", action);
906	}
907		888
908	if (update_now)	889	if (update_now)
909	{	890	{
910	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);	891	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
911	update_position (op->map, op->x, op->y);	892	update_position (op->map, op->x, op->y);
…		…
913		894
914	if (op->more != NULL)	895	if (op->more != NULL)
915	update_object (op->more, action);	896	update_object (op->more, action);
916	}	897	}
917		898
918	static unordered_vector<object *> mortals;	899	object::vector object::mortals;
919	static std::vector<object *> freed;	900	object::vector object::objects; // not yet used
		901	object *object::first;
920		902
921	void object::free_mortals ()	903	void object::free_mortals ()
922	{	904	{
923	for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end (); )	905	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
924	if (!(*i)->refcount)	906	if ((*i)->refcnt)
		907	++i; // further delay freeing
		908	else
925	{	909	{
926	freed.push_back (*i);	910	delete *i;
927	mortals.erase (i);	911	mortals.erase (i);
928	}	912	}
929	else	913
930	++i;	914	static int lastmortals = 0;//D
		915
		916	if (mortals.size() != lastmortals)//D
		917	{
		918	lastmortals = mortals.size ();//D
		919	LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
		920	}
931	}	921	}
932		922
933	object::object ()	923	object::object ()
934	{	924	{
935	SET_FLAG (this, FLAG_REMOVED);	925	SET_FLAG (this, FLAG_REMOVED);
936		926
937	expmul = 1.0;	927	expmul = 1.0;
938	face = blank_face;	928	face = blank_face;
939	attacked_by_count = -1;
940	}	929	}
941		930
942	object::~object ()	931	object::~object ()
943	{	932	{
944	free_key_values (this);	933	free_key_values (this);
945	}	934	}
946		935
947	void object::link ()	936	void object::link ()
948	{	937	{
949	count = ++ob_count;	938	count = ++ob_count;
		939	uuid = gen_uuid ();
950		940
951	prev = 0;	941	prev = 0;
952	next = objects;	942	next = object::first;
953		943
954	if (objects)	944	if (object::first)
955	objects->prev = this;	945	object::first->prev = this;
956		946
957	objects = this;	947	object::first = this;
958	}	948	}
959		949
960	void object::unlink ()	950	void object::unlink ()
961	{	951	{
962	count = 0;	952	//count = 0;//D
		953	if (!prev && !next) return;//D
		954
		955	if (this == object::first)
		956	object::first = next;
963		957
964	/* Remove this object from the list of used objects */	958	/* Remove this object from the list of used objects */
965	if (prev)
966	{
967	prev->next = next;	959	if (prev) prev->next = next;
		960	if (next) next->prev = prev;
		961
968	prev = 0;	962	prev = 0;
969	}
970
971	if (next)
972	{
973	next->prev = prev;
974	next = 0;	963	next = 0;
975	}
976
977	if (this == objects)
978	objects = next;
979	}	964	}
980		965
981	object *object::create ()	966	object *object::create ()
982	{	967	{
983	object *op;
984
985	if (freed.empty ())
986	op = new object;	968	object *op = new object;
987	else
988	{
989	// highly annoying, but the only way to get it stable right now
990	op = freed.back (); freed.pop_back ();
991	op->~object ();
992	new ((void *)op) object;
993	}
994
995	op->link ();	969	op->link ();
996	return op;	970	return op;
997	}	971	}
998		972
999	/*	973	/*
…		…
1006	* If free_inventory is set, free inventory as well. Else drop items in	980	* If free_inventory is set, free inventory as well. Else drop items in
1007	* inventory to the ground.	981	* inventory to the ground.
1008	*/	982	*/
1009	void object::free (bool free_inventory)	983	void object::free (bool free_inventory)
1010	{	984	{
		985	if (QUERY_FLAG (this, FLAG_FREED))
		986	return;
		987
		988	if (QUERY_FLAG (this, FLAG_FRIENDLY))
		989	remove_friendly_object (this);
		990
1011	if (!QUERY_FLAG (this, FLAG_REMOVED))	991	if (!QUERY_FLAG (this, FLAG_REMOVED))
1012	{	992	remove_ob (this);
1013	LOG (llevDebug, "Free object called with non removed object\n");
1014	dump_object (this);
1015	#ifdef MANY_CORES
1016	abort ();
1017	#endif
1018	}
1019		993
1020	if (QUERY_FLAG (this, FLAG_FRIENDLY))
1021	{
1022	LOG (llevMonster, "Warning: tried to free friendly object.\n");
1023	remove_friendly_object (this);
1024	}
1025
1026	if (QUERY_FLAG (this, FLAG_FREED))	994	SET_FLAG (this, FLAG_FREED);
1027	{
1028	dump_object (this);
1029	LOG (llevError, "Trying to free freed object.\n%s\n", errmsg);
1030	return;
1031	}
1032		995
1033	if (more)	996	if (more)
1034	{	997	{
1035	more->free (free_inventory);	998	more->free (free_inventory);
1036	more = 0;	999	more = 0;
…		…
1040	{	1003	{
1041	/* Only if the space blocks everything do we not process -	1004	/* Only if the space blocks everything do we not process -
1042	* if some form of movement is allowed, let objects	1005	* if some form of movement is allowed, let objects
1043	* drop on that space.	1006	* drop on that space.
1044	*/	1007	*/
1045	if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || (GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL))	1008	if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
1046	{	1009	{
1047	object *	1010	object *op = inv;
1048	op = inv;
1049		1011
1050	while (op)	1012	while (op)
1051	{	1013	{
1052	object *
1053	tmp = op->below;	1014	object *tmp = op->below;
1054
1055	remove_ob (op);
1056	op->free (free_inventory);	1015	op->free (free_inventory);
1057	op = tmp;	1016	op = tmp;
1058	}	1017	}
1059	}	1018	}
1060	else	1019	else
1061	{ /* Put objects in inventory onto this space */	1020	{ /* Put objects in inventory onto this space */
1062	object *	1021	object *op = inv;
1063	op = inv;
1064		1022
1065	while (op)	1023	while (op)
1066	{	1024	{
1067	object *
1068	tmp = op->below;	1025	object *tmp = op->below;
1069		1026
1070	remove_ob (op);	1027	remove_ob (op);
1071		1028
1072	if (QUERY_FLAG (op, FLAG_STARTEQUIP)	1029	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
1073	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))	1030	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
…		…
1082	op = tmp;	1039	op = tmp;
1083	}	1040	}
1084	}	1041	}
1085	}	1042	}
1086		1043
1087	clear_owner (this);	1044	// clear those pointers that likely might have circular references to us
		1045	owner = 0;
		1046	enemy = 0;
		1047	attacked_by = 0;
1088		1048
1089	/* Remove object from the active list */	1049	/* Remove object from the active list */
1090	speed = 0;	1050	speed = 0;
1091	update_ob_speed (this);	1051	update_ob_speed (this);
1092		1052
1093	unlink ();	1053	unlink ();
1094		1054
1095	SET_FLAG (this, FLAG_FREED);
1096
1097	mortals.push_back (this);	1055	mortals.push_back (this);
1098	}	1056	}
1099		1057
1100	/*	1058	/*
1101	* sub_weight() recursively (outwards) subtracts a number from the	1059	* sub_weight() recursively (outwards) subtracts a number from the
…		…
1106	sub_weight (object *op, signed long weight)	1064	sub_weight (object *op, signed long weight)
1107	{	1065	{
1108	while (op != NULL)	1066	while (op != NULL)
1109	{	1067	{
1110	if (op->type == CONTAINER)	1068	if (op->type == CONTAINER)
1111	{
1112	weight = (signed long) (weight * (100 - op->stats.Str) / 100);	1069	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1113	}	1070
1114	op->carrying -= weight;	1071	op->carrying -= weight;
1115	op = op->env;	1072	op = op->env;
1116	}	1073	}
1117	}	1074	}
1118		1075
…		…
1126	*/	1083	*/
1127		1084
1128	void	1085	void
1129	remove_ob (object *op)	1086	remove_ob (object *op)
1130	{	1087	{
		1088	object *tmp, *last = 0;
1131	object *	1089	object *otmp;
1132	tmp, *	1090
1133	last = NULL;	1091	tag_t tag;
1134	object *
1135	otmp;
1136	tag_t
1137	tag;
1138	int
1139	check_walk_off;	1092	int check_walk_off;
1140	mapstruct *	1093	mapstruct *m;
1141	m;
1142	sint16
1143	x,
1144	y;
1145		1094
		1095	sint16 x, y;
1146		1096
1147	if (QUERY_FLAG (op, FLAG_REMOVED))	1097	if (QUERY_FLAG (op, FLAG_REMOVED))
1148	{	1098	return;
1149	dump_object (op);
1150	LOG (llevError, "Trying to remove removed object.\n%s\n", errmsg);
1151		1099
1152	/* Changed it to always dump core in this case. As has been learned	1100	SET_FLAG (op, FLAG_REMOVED);
1153	* in the past, trying to recover from errors almost always	1101
1154	* make things worse, and this is a real error here - something
1155	* that should not happen.
1156	* Yes, if this was a mission critical app, trying to do something
1157	* to recover may make sense, but that is because failure of the app
1158	* may have other disastrous problems. Cf runs out of a script
1159	* so is easily enough restarted without any real problems.
1160	* MSW 2001-07-01
1161	*/
1162	abort ();
1163	}
1164	if (op->more != NULL)	1102	if (op->more != NULL)
1165	remove_ob (op->more);	1103	remove_ob (op->more);
1166
1167	SET_FLAG (op, FLAG_REMOVED);
1168		1104
1169	/*	1105	/*
1170	* In this case, the object to be removed is in someones	1106	* In this case, the object to be removed is in someones
1171	* inventory.	1107	* inventory.
1172	*/	1108	*/
…		…
1198	*/	1134	*/
1199	op->x = op->env->x, op->y = op->env->y;	1135	op->x = op->env->x, op->y = op->env->y;
1200	op->map = op->env->map;	1136	op->map = op->env->map;
1201	op->above = NULL, op->below = NULL;	1137	op->above = NULL, op->below = NULL;
1202	op->env = NULL;	1138	op->env = NULL;
1203	return;	1139	}
		1140	else if (op->map)
1204	}	1141	{
1205
1206	/* If we get here, we are removing it from a map */
1207	if (op->map == NULL)
1208	return;
1209
1210	x = op->x;	1142	x = op->x;
1211	y = op->y;	1143	y = op->y;
1212	m = get_map_from_coord (op->map, &x, &y);	1144	m = get_map_from_coord (op->map, &x, &y);
1213		1145
1214	if (!m)	1146	if (!m)
1215	{	1147	{
1216	LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",	1148	LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1217	op->map->path, op->x, op->y);	1149	op->map->path, op->x, op->y);
1218	/* in old days, we used to set x and y to 0 and continue.	1150	/* in old days, we used to set x and y to 0 and continue.
1219	* it seems if we get into this case, something is probablye	1151	* it seems if we get into this case, something is probablye
1220	* screwed up and should be fixed.	1152	* screwed up and should be fixed.
		1153	*/
		1154	abort ();
		1155	}
		1156
		1157	if (op->map != m)
		1158	LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
		1159	op->map->path, m->path, op->x, op->y, x, y);
		1160
		1161	/* Re did the following section of code - it looks like it had
		1162	* lots of logic for things we no longer care about
1221	*/	1163	*/
1222	abort ();
1223	}
1224	if (op->map != m)
1225	{
1226	LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1227	op->map->path, m->path, op->x, op->y, x, y);
1228	}
1229		1164
1230	/* Re did the following section of code - it looks like it had
1231	* lots of logic for things we no longer care about
1232	*/
1233
1234	/* link the object above us */	1165	/* link the object above us */
1235	if (op->above)	1166	if (op->above)
1236	op->above->below = op->below;	1167	op->above->below = op->below;
1237	else	1168	else
1238	SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */	1169	SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */
1239		1170
1240	/* Relink the object below us, if there is one */	1171	/* Relink the object below us, if there is one */
1241	if (op->below)	1172	if (op->below)
1242	{
1243	op->below->above = op->above;	1173	op->below->above = op->above;
1244	}
1245	else	1174	else
1246	{	1175	{
1247	/* Nothing below, which means we need to relink map object for this space	1176	/* Nothing below, which means we need to relink map object for this space
1248	* use translated coordinates in case some oddness with map tiling is	1177	* use translated coordinates in case some oddness with map tiling is
1249	* evident	1178	* evident
1250	*/
1251	if (GET_MAP_OB (m, x, y) != op)
1252	{
1253	dump_object (op);
1254	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",
1255	errmsg);
1256	dump_object (GET_MAP_OB (m, x, y));
1257	LOG (llevError, "%s\n", errmsg);
1258	}
1259	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1260	}
1261	op->above = NULL;
1262	op->below = NULL;
1263
1264	if (op->map->in_memory == MAP_SAVING)
1265	return;
1266
1267	tag = op->count;
1268	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1269	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1270	{
1271	/* No point updating the players look faces if he is the object
1272	* being removed.
1273	*/
1274
1275	if (tmp->type == PLAYER && tmp != op)
1276	{
1277	/* If a container that the player is currently using somehow gets
1278	* removed (most likely destroyed), update the player view
1279	* appropriately.
1280	*/	1179	*/
1281	if (tmp->container == op)	1180	if (GET_MAP_OB (m, x, y) != op)
1282	{	1181	{
1283	CLEAR_FLAG (op, FLAG_APPLIED);	1182	dump_object (op);
1284	tmp->container = NULL;	1183	LOG (llevError,
		1184	"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);
		1185	dump_object (GET_MAP_OB (m, x, y));
		1186	LOG (llevError, "%s\n", errmsg);
1285	}	1187	}
1286	tmp->contr->socket.update_look = 1;	1188
1287	}	1189	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1288	/* See if player moving off should effect something */
1289	if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1290	{	1190	}
1291		1191
1292	move_apply (tmp, op, NULL);	1192	op->above = 0;
1293	if (was_destroyed (op, tag))	1193	op->below = 0;
		1194
		1195	if (op->map->in_memory == MAP_SAVING)
		1196	return;
		1197
		1198	tag = op->count;
		1199	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
		1200
		1201	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
		1202	{
		1203	/* No point updating the players look faces if he is the object
		1204	* being removed.
		1205	*/
		1206
		1207	if (tmp->type == PLAYER && tmp != op)
1294	{	1208	{
1295	LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name);	1209	/* If a container that the player is currently using somehow gets
		1210	* removed (most likely destroyed), update the player view
		1211	* appropriately.
		1212	*/
		1213	if (tmp->container == op)
		1214	{
		1215	CLEAR_FLAG (op, FLAG_APPLIED);
		1216	tmp->container = NULL;
		1217	}
		1218
		1219	tmp->contr->socket.update_look = 1;
1296	}	1220	}
		1221
		1222	/* See if player moving off should effect something */
		1223	if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
		1224	{
		1225	move_apply (tmp, op, NULL);
		1226
		1227	if (was_destroyed (op, tag))
		1228	{
		1229	LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name);
		1230	}
1297	}	1231	}
1298		1232
1299	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1233	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1300		1234
1301	if (tmp->above == tmp)	1235	if (tmp->above == tmp)
1302	tmp->above = NULL;	1236	tmp->above = NULL;
		1237
1303	last = tmp;	1238	last = tmp;
1304	}	1239	}
		1240
1305	/* last == NULL of there are no objects on this space */	1241	/* last == NULL of there are no objects on this space */
1306	if (last == NULL)	1242	if (last == NULL)
1307	{	1243	{
1308	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,	1244	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1309	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures	1245	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1310	* those out anyways, and if there are any flags set right now, they won't	1246	* those out anyways, and if there are any flags set right now, they won't
1311	* be correct anyways.	1247	* be correct anyways.
1312	*/	1248	*/
1313	SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);	1249	SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);
1314	update_position (op->map, op->x, op->y);	1250	update_position (op->map, op->x, op->y);
1315	}	1251	}
1316	else	1252	else
1317	update_object (last, UP_OBJ_REMOVE);	1253	update_object (last, UP_OBJ_REMOVE);
1318		1254
1319	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))	1255	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))
1320	update_all_los (op->map, op->x, op->y);	1256	update_all_los (op->map, op->x, op->y);
1321		1257	}
1322	}	1258	}
1323		1259
1324	/*	1260	/*
1325	* merge_ob(op,top):	1261	* merge_ob(op,top):
1326	*	1262	*
1327	* This function goes through all objects below and including top, and	1263	* This function goes through all objects below and including top, and
1328	* merges op to the first matching object.	1264	* merges op to the first matching object.
1329	* If top is NULL, it is calculated.	1265	* If top is NULL, it is calculated.
1330	* Returns pointer to object if it succeded in the merge, otherwise NULL	1266	* Returns pointer to object if it succeded in the merge, otherwise NULL
1331	*/	1267	*/
1332
1333	object *	1268	object *
1334	merge_ob (object *op, object *top)	1269	merge_ob (object *op, object *top)
1335	{	1270	{
1336	if (!op->nrof)	1271	if (!op->nrof)
1337	return 0;	1272	return 0;
		1273
1338	if (top == NULL)	1274	if (top == NULL)
1339	for (top = op; top != NULL && top->above != NULL; top = top->above);	1275	for (top = op; top != NULL && top->above != NULL; top = top->above);
		1276
1340	for (; top != NULL; top = top->below)	1277	for (; top != NULL; top = top->below)
1341	{	1278	{
1342	if (top == op)	1279	if (top == op)
1343	continue;	1280	continue;
1344	if (CAN_MERGE (op, top))	1281	if (CAN_MERGE (op, top))
…		…
1350	remove_ob (op);	1287	remove_ob (op);
1351	free_object (op);	1288	free_object (op);
1352	return top;	1289	return top;
1353	}	1290	}
1354	}	1291	}
		1292
1355	return NULL;	1293	return 0;
1356	}	1294	}
1357		1295
1358	/*	1296	/*
1359	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1297	* same as insert_ob_in_map except it handle separate coordinates and do a clean
1360	* job preparing multi-part monsters	1298	* job preparing multi-part monsters
1361	*/	1299	*/
1362	object *	1300	object *
1363	insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y)	1301	insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y)
1364	{	1302	{
1365	object *	1303	object *tmp;
1366	tmp;
1367		1304
1368	if (op->head)	1305	if (op->head)
1369	op = op->head;	1306	op = op->head;
		1307
1370	for (tmp = op; tmp; tmp = tmp->more)	1308	for (tmp = op; tmp; tmp = tmp->more)
1371	{	1309	{
1372	tmp->x = x + tmp->arch->clone.x;	1310	tmp->x = x + tmp->arch->clone.x;
1373	tmp->y = y + tmp->arch->clone.y;	1311	tmp->y = y + tmp->arch->clone.y;
1374	}	1312	}
		1313
1375	return insert_ob_in_map (op, m, originator, flag);	1314	return insert_ob_in_map (op, m, originator, flag);
1376	}	1315	}
1377		1316
1378	/*	1317	/*
1379	* insert_ob_in_map (op, map, originator, flag):	1318	* insert_ob_in_map (op, map, originator, flag):
…		…
1438		1377
1439	if (op->more != NULL)	1378	if (op->more != NULL)
1440	{	1379	{
1441	/* The part may be on a different map. */	1380	/* The part may be on a different map. */
1442		1381
1443	object *
1444	more = op->more;	1382	object *more = op->more;
1445		1383
1446	/* We really need the caller to normalize coordinates - if	1384	/* We really need the caller to normalize coordinates - if
1447	* we set the map, that doesn't work if the location is within	1385	* we set the map, that doesn't work if the location is within
1448	* a map and this is straddling an edge. So only if coordinate	1386	* a map and this is straddling an edge. So only if coordinate
1449	* is clear wrong do we normalize it.	1387	* is clear wrong do we normalize it.
1450	*/	1388	*/
1451	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))	1389	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1452	{
1453	more->map = get_map_from_coord (m, &more->x, &more->y);	1390	more->map = get_map_from_coord (m, &more->x, &more->y);
1454	}
1455	else if (!more->map)	1391	else if (!more->map)
1456	{	1392	{
1457	/* For backwards compatibility - when not dealing with tiled maps,	1393	/* For backwards compatibility - when not dealing with tiled maps,
1458	* more->map should always point to the parent.	1394	* more->map should always point to the parent.
1459	*/	1395	*/
…		…
1462		1398
1463	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1399	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1464	{	1400	{
1465	if (!op->head)	1401	if (!op->head)
1466	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1402	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
		1403
1467	return NULL;	1404	return NULL;
1468	}	1405	}
1469	}	1406	}
1470		1407
1471	CLEAR_FLAG (op, FLAG_REMOVED);	1408	CLEAR_FLAG (op, FLAG_REMOVED);
…		…
1536		1473
1537	while (top != NULL)	1474	while (top != NULL)
1538	{	1475	{
1539	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1476	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1540	floor = top;	1477	floor = top;
		1478
1541	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1479	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
1542	{	1480	{
1543	/* We insert above top, so we want this object below this */	1481	/* We insert above top, so we want this object below this */
1544	top = top->below;	1482	top = top->below;
1545	break;	1483	break;
1546	}	1484	}
		1485
1547	last = top;	1486	last = top;
1548	top = top->above;	1487	top = top->above;
1549	}	1488	}
		1489
1550	/* Don't want top to be NULL, so set it to the last valid object */	1490	/* Don't want top to be NULL, so set it to the last valid object */
1551	top = last;	1491	top = last;
1552		1492
1553	/* We let update_position deal with figuring out what the space	1493	/* We let update_position deal with figuring out what the space
1554	* looks like instead of lots of conditions here.	1494	* looks like instead of lots of conditions here.
…		…
1633	* of effect may be sufficient.	1573	* of effect may be sufficient.
1634	*/	1574	*/
1635	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1575	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))
1636	update_all_los (op->map, op->x, op->y);	1576	update_all_los (op->map, op->x, op->y);
1637		1577
1638
1639	/* updates flags (blocked, alive, no magic, etc) for this map space */	1578	/* updates flags (blocked, alive, no magic, etc) for this map space */
1640	update_object (op, UP_OBJ_INSERT);	1579	update_object (op, UP_OBJ_INSERT);
1641
1642		1580
1643	/* Don't know if moving this to the end will break anything. However,	1581	/* Don't know if moving this to the end will break anything. However,
1644	* we want to have update_look set above before calling this.	1582	* we want to have update_look set above before calling this.
1645	*	1583	*
1646	* check_move_on() must be after this because code called from	1584	* check_move_on() must be after this because code called from
…		…
1671	* op is the object to insert it under: supplies x and the map.	1609	* op is the object to insert it under: supplies x and the map.
1672	*/	1610	*/
1673	void	1611	void
1674	replace_insert_ob_in_map (const char *arch_string, object *op)	1612	replace_insert_ob_in_map (const char *arch_string, object *op)
1675	{	1613	{
1676	object *tmp;	1614	object *
		1615	tmp;
1677	object *tmp1;	1616	object *
		1617	tmp1;
1678		1618
1679	/* first search for itself and remove any old instances */	1619	/* first search for itself and remove any old instances */
1680		1620
1681	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1621	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1682	{	1622	{
…		…
1685	remove_ob (tmp);	1625	remove_ob (tmp);
1686	free_object (tmp);	1626	free_object (tmp);
1687	}	1627	}
1688	}	1628	}
1689		1629
1690	tmp1 = arch_to_object (find_archetype (arch_string));	1630	tmp1 = arch_to_object (archetype::find (arch_string));
1691		1631
1692	tmp1->x = op->x;	1632	tmp1->x = op->x;
1693	tmp1->y = op->y;	1633	tmp1->y = op->y;
1694	insert_ob_in_map (tmp1, op->map, op, 0);	1634	insert_ob_in_map (tmp1, op->map, op, 0);
1695	}	1635	}
…		…
1713	if (orig_ob->nrof < nr)	1653	if (orig_ob->nrof < nr)
1714	{	1654	{
1715	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);	1655	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1716	return NULL;	1656	return NULL;
1717	}	1657	}
		1658
1718	newob = object_create_clone (orig_ob);	1659	newob = object_create_clone (orig_ob);
		1660
1719	if ((orig_ob->nrof -= nr) < 1)	1661	if ((orig_ob->nrof -= nr) < 1)
1720	{	1662	{
1721	if (!is_removed)	1663	if (!is_removed)
1722	remove_ob (orig_ob);	1664	remove_ob (orig_ob);
1723	free_object2 (orig_ob, 1);	1665	free_object2 (orig_ob, 1);
…		…
1731	strcpy (errmsg, "Tried to split object whose map is not in memory.");	1673	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1732	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");	1674	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1733	return NULL;	1675	return NULL;
1734	}	1676	}
1735	}	1677	}
		1678
1736	newob->nrof = nr;	1679	newob->nrof = nr;
1737		1680
1738	return newob;	1681	return newob;
1739	}	1682	}
1740		1683
…		…
1747	*/	1690	*/
1748		1691
1749	object *	1692	object *
1750	decrease_ob_nr (object *op, uint32 i)	1693	decrease_ob_nr (object *op, uint32 i)
1751	{	1694	{
1752	object *	1695	object *tmp;
1753	tmp;
1754	player *	1696	player *pl;
1755	pl;
1756		1697
1757	if (i == 0) /* objects with op->nrof require this check */	1698	if (i == 0) /* objects with op->nrof require this check */
1758	return op;	1699	return op;
1759		1700
1760	if (i > op->nrof)	1701	if (i > op->nrof)
1761	i = op->nrof;	1702	i = op->nrof;
1762		1703
1763	if (QUERY_FLAG (op, FLAG_REMOVED))	1704	if (QUERY_FLAG (op, FLAG_REMOVED))
1764	{
1765	op->nrof -= i;	1705	op->nrof -= i;
1766	}
1767	else if (op->env != NULL)	1706	else if (op->env != NULL)
1768	{	1707	{
1769	/* is this object in the players inventory, or sub container	1708	/* is this object in the players inventory, or sub container
1770	* therein?	1709	* therein?
1771	*/	1710	*/
…		…
1806	}	1745	}
1807	}	1746	}
1808	}	1747	}
1809	else	1748	else
1810	{	1749	{
1811	object *
1812	above = op->above;	1750	object *above = op->above;
1813		1751
1814	if (i < op->nrof)	1752	if (i < op->nrof)
1815	{
1816	op->nrof -= i;	1753	op->nrof -= i;
1817	}
1818	else	1754	else
1819	{	1755	{
1820	remove_ob (op);	1756	remove_ob (op);
1821	op->nrof = 0;	1757	op->nrof = 0;
1822	}	1758	}
		1759
1823	/* Since we just removed op, op->above is null */	1760	/* Since we just removed op, op->above is null */
1824	for (tmp = above; tmp != NULL; tmp = tmp->above)	1761	for (tmp = above; tmp != NULL; tmp = tmp->above)
1825	if (tmp->type == PLAYER)	1762	if (tmp->type == PLAYER)
1826	{	1763	{
1827	if (op->nrof)	1764	if (op->nrof)
…		…
1830	esrv_del_item (tmp->contr, op->count);	1767	esrv_del_item (tmp->contr, op->count);
1831	}	1768	}
1832	}	1769	}
1833		1770
1834	if (op->nrof)	1771	if (op->nrof)
1835	{
1836	return op;	1772	return op;
1837	}
1838	else	1773	else
1839	{	1774	{
1840	free_object (op);	1775	free_object (op);
1841	return NULL;	1776	return NULL;
1842	}	1777	}
…		…
1851	add_weight (object *op, signed long weight)	1786	add_weight (object *op, signed long weight)
1852	{	1787	{
1853	while (op != NULL)	1788	while (op != NULL)
1854	{	1789	{
1855	if (op->type == CONTAINER)	1790	if (op->type == CONTAINER)
1856	{
1857	weight = (signed long) (weight * (100 - op->stats.Str) / 100);	1791	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1858	}	1792
1859	op->carrying += weight;	1793	op->carrying += weight;
1860	op = op->env;	1794	op = op->env;
1861	}	1795	}
1862	}	1796	}
1863		1797
…		…
1886	{	1820	{
1887	dump_object (op);	1821	dump_object (op);
1888	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);	1822	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);
1889	return op;	1823	return op;
1890	}	1824	}
		1825
1891	if (where == NULL)	1826	if (where == NULL)
1892	{	1827	{
1893	dump_object (op);	1828	dump_object (op);
1894	LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);	1829	LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);
1895	return op;	1830	return op;
1896	}	1831	}
		1832
1897	if (where->head)	1833	if (where->head)
1898	{	1834	{
1899	LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");	1835	LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");
1900	where = where->head;	1836	where = where->head;
1901	}	1837	}
		1838
1902	if (op->more)	1839	if (op->more)
1903	{	1840	{
1904	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1841	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1905	return op;	1842	return op;
1906	}	1843	}
		1844
1907	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1845	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1908	CLEAR_FLAG (op, FLAG_REMOVED);	1846	CLEAR_FLAG (op, FLAG_REMOVED);
1909	if (op->nrof)	1847	if (op->nrof)
1910	{	1848	{
1911	for (tmp = where->inv; tmp != NULL; tmp = tmp->below)	1849	for (tmp = where->inv; tmp != NULL; tmp = tmp->below)
…		…
2004	tag;	1942	tag;
2005	mapstruct *	1943	mapstruct *
2006	m = op->map;	1944	m = op->map;
2007	int	1945	int
2008	x = op->x, y = op->y;	1946	x = op->x, y = op->y;
		1947
2009	MoveType	1948	MoveType
2010	move_on,	1949	move_on,
2011	move_slow,	1950	move_slow,
2012	move_block;	1951	move_block;
2013		1952
…		…
2047	* we don't need to check all of them.	1986	* we don't need to check all of them.
2048	*/	1987	*/
2049	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))	1988	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
2050	break;	1989	break;
2051	}	1990	}
		1991
2052	for (; tmp != NULL; tmp = tmp->below)	1992	for (; tmp; tmp = tmp->below)
2053	{	1993	{
2054	if (tmp == op)	1994	if (tmp == op)
2055	continue; /* Can't apply yourself */	1995	continue; /* Can't apply yourself */
2056		1996
2057	/* Check to see if one of the movement types should be slowed down.	1997	/* Check to see if one of the movement types should be slowed down.
…		…
2065	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	2005	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
2066	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	2006	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
2067	{	2007	{
2068		2008
2069	float	2009	float
2070	diff;
2071
2072	diff = tmp->move_slow_penalty * FABS (op->speed);	2010	diff = tmp->move_slow_penalty * FABS (op->speed);
		2011
2073	if (op->type == PLAYER)	2012	if (op->type == PLAYER)
2074	{
2075	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	2013	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
2076	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	2014	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
2077	{
2078	diff /= 4.0;	2015	diff /= 4.0;
2079	}	2016
2080	}
2081	op->speed_left -= diff;	2017	op->speed_left -= diff;
2082	}	2018	}
2083	}	2019	}
2084		2020
2085	/* Basically same logic as above, except now for actual apply. */	2021	/* Basically same logic as above, except now for actual apply. */
2086	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||	2022	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
2087	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))	2023	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
2088	{	2024	{
2089
2090	move_apply (tmp, op, originator);	2025	move_apply (tmp, op, originator);
		2026
2091	if (was_destroyed (op, tag))	2027	if (was_destroyed (op, tag))
2092	return 1;	2028	return 1;
2093		2029
2094	/* what the person/creature stepped onto has moved the object	2030	/* what the person/creature stepped onto has moved the object
2095	* someplace new. Don't process any further - if we did,	2031	* someplace new. Don't process any further - if we did,
…		…
2097	*/	2033	*/
2098	if (op->map != m || op->x != x || op->y != y)	2034	if (op->map != m || op->x != x || op->y != y)
2099	return 0;	2035	return 0;
2100	}	2036	}
2101	}	2037	}
		2038
2102	return 0;	2039	return 0;
2103	}	2040	}
2104		2041
2105	/*	2042	/*
2106	* present_arch(arch, map, x, y) searches for any objects with	2043	* present_arch(arch, map, x, y) searches for any objects with
…		…
2397	find_dir (mapstruct *m, int x, int y, object *exclude)	2334	find_dir (mapstruct *m, int x, int y, object *exclude)
2398	{	2335	{
2399	int	2336	int
2400	i,	2337	i,
2401	max = SIZEOFFREE, mflags;	2338	max = SIZEOFFREE, mflags;
2402	sint16	2339
2403	nx,	2340	sint16 nx, ny;
2404	ny;
2405	object *	2341	object *
2406	tmp;	2342	tmp;
2407	mapstruct *	2343	mapstruct *
2408	mp;	2344	mp;
2409	MoveType	2345
2410	blocked,	2346	MoveType blocked, move_type;
2411	move_type;
2412		2347
2413	if (exclude && exclude->head)	2348	if (exclude && exclude->head)
2414	{	2349	{
2415	exclude = exclude->head;	2350	exclude = exclude->head;
2416	move_type = exclude->move_type;	2351	move_type = exclude->move_type;
…		…
2623		2558
2624		2559
2625	int	2560	int
2626	can_see_monsterP (mapstruct *m, int x, int y, int dir)	2561	can_see_monsterP (mapstruct *m, int x, int y, int dir)
2627	{	2562	{
2628	sint16	2563	sint16 dx, dy;
2629	dx,
2630	dy;
2631	int	2564	int
2632	mflags;	2565	mflags;
2633		2566
2634	if (dir < 0)	2567	if (dir < 0)
2635	return 0; /* exit condition: invalid direction */	2568	return 0; /* exit condition: invalid direction */
…		…
2760		2693
2761	if (tempfile == NULL)	2694	if (tempfile == NULL)
2762	{	2695	{
2763	LOG (llevError, "Error - Unable to access load object temp file\n");	2696	LOG (llevError, "Error - Unable to access load object temp file\n");
2764	return NULL;	2697	return NULL;
2765	};	2698	}
		2699
2766	fprintf (tempfile, obstr);	2700	fprintf (tempfile, obstr);
2767	fclose (tempfile);	2701	fclose (tempfile);
2768		2702
2769	op = get_object ();	2703	op = get_object ();
2770		2704
2771	object_thawer	2705	object_thawer thawer (filename);
2772	thawer (filename);
2773		2706
2774	if (thawer)	2707	if (thawer)
2775	load_object (thawer, op, 0);	2708	load_object (thawer, op, 0);
2776		2709
2777	LOG (llevDebug, " load str completed, object=%s\n", &op->name);	2710	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
…		…
2828	* The returned string is shared.	2761	* The returned string is shared.
2829	*/	2762	*/
2830	const char *	2763	const char *
2831	get_ob_key_value (const object *op, const char *const key)	2764	get_ob_key_value (const object *op, const char *const key)
2832	{	2765	{
2833	key_value *	2766	key_value *link;
2834	link;	2767	shstr_cmp canonical_key (key);
2835	const char *
2836	canonical_key;
2837		2768
2838	canonical_key = shstr::find (key);
2839
2840	if (canonical_key == NULL)	2769	if (!canonical_key)
2841	{	2770	{
2842	/* 1. There being a field named key on any object	2771	/* 1. There being a field named key on any object
2843	* implies there'd be a shared string to find.	2772	* implies there'd be a shared string to find.
2844	* 2. Since there isn't, no object has this field.	2773	* 2. Since there isn't, no object has this field.
2845	* 3. Therefore, *this* object doesn't have this field.	2774	* 3. Therefore, *this* object doesn't have this field.
2846	*/	2775	*/
2847	return NULL;	2776	return 0;
2848	}	2777	}
2849		2778
2850	/* This is copied from get_ob_key_link() above -	2779	/* This is copied from get_ob_key_link() above -
2851	* only 4 lines, and saves the function call overhead.	2780	* only 4 lines, and saves the function call overhead.
2852	*/	2781	*/
2853	for (link = op->key_values; link != NULL; link = link->next)	2782	for (link = op->key_values; link; link = link->next)
2854	{
2855	if (link->key == canonical_key)	2783	if (link->key == canonical_key)
2856	{
2857	return link->value;	2784	return link->value;
2858	}	2785
2859	}
2860	return NULL;	2786	return 0;
2861	}	2787	}
2862		2788
2863		2789
2864	/*	2790	/*
2865	* Updates the canonical_key in op to value.	2791	* Updates the canonical_key in op to value.
…		…
2901	if (last)	2827	if (last)
2902	last->next = field->next;	2828	last->next = field->next;
2903	else	2829	else
2904	op->key_values = field->next;	2830	op->key_values = field->next;
2905		2831
2906	delete
2907	field;	2832	delete field;
2908	}	2833	}
2909	}	2834	}
2910	return TRUE;	2835	return TRUE;
2911	}	2836	}
2912	/* IF we get here, key doesn't exist */	2837	/* IF we get here, key doesn't exist */
…		…
2947	* Returns TRUE on success.	2872	* Returns TRUE on success.
2948	*/	2873	*/
2949	int	2874	int
2950	set_ob_key_value (object *op, const char *key, const char *value, int add_key)	2875	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2951	{	2876	{
2952	shstr
2953	key_ (key);	2877	shstr key_ (key);
2954		2878
2955	return set_ob_key_value_s (op, key_, value, add_key);	2879	return set_ob_key_value_s (op, key_, value, add_key);
2956	}	2880	}
		2881
		2882	object::depth_iterator::depth_iterator (object *container)
		2883	: iterator_base (container)
		2884	{
		2885	while (item->inv)
		2886	item = item->inv;
		2887	}
		2888
		2889	void
		2890	object::depth_iterator::next ()
		2891	{
		2892	if (item->below)
		2893	{
		2894	item = item->below;
		2895
		2896	while (item->inv)
		2897	item = item->inv;
		2898	}
		2899	else
		2900	item = item->env;
		2901	}
		2902
		2903	// return a suitable string describing an objetc in enough detail to find it
		2904	const char *
		2905	object::debug_desc (char *info) const
		2906	{
		2907	char info2[256 * 3];
		2908	char *p = info;
		2909
		2910	p += snprintf (p, 256, "%d=\"%s%s%s\"",
		2911	count,
		2912	&name,
		2913	title ? " " : "",
		2914	title ? (const char *)title : "");
		2915
		2916	if (env)
		2917	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
		2918
		2919	if (map)
		2920	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);
		2921
		2922	return info;
		2923	}
		2924
		2925	const char *
		2926	object::debug_desc () const
		2927	{
		2928	static char info[256 * 3];
		2929	return debug_desc (info);
		2930	}
		2931

Diff Legend

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