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.24 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.52 by root, Wed Sep 27 00:36:08 2006 UTC

1
2	/*
3	* static char *rcsid_object_c =
4	* "$Id: object.C,v 1.24 2006/09/10 16:00:23 root Exp $";
5	*/
6
7	/*	1	/*
8	CrossFire, A Multiplayer game for X-windows	2	CrossFire, A Multiplayer game for X-windows
9		3
10	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team
11	Copyright (C) 1992 Frank Tore Johansen	5	Copyright (C) 1992 Frank Tore Johansen
…		…
22		16
23	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
24	along with this program; if not, write to the Free Software	18	along with this program; if not, write to the Free Software
25	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
26		20
27	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>
28	*/	22	*/
29		23
30	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
31	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
32	variable. */	26	variable. */
33	#include <global.h>	27	#include <global.h>
34	#ifndef WIN32 /* ---win32 exclude headers */
35	# include <stdio.h>	28	#include <stdio.h>
36	# include <sys/types.h>	29	#include <sys/types.h>
37	# include <sys/uio.h>	30	#include <sys/uio.h>
38	#endif /* win32 */
39	#include <object.h>	31	#include <object.h>
40	#include <funcpoint.h>	32	#include <funcpoint.h>
41	#include <skills.h>
42	#include <loader.h>	33	#include <loader.h>
		34
43	int nrofallocobjects = 0;	35	int nrofallocobjects = 0;
		36	static UUID uuid;
		37	const uint64 UUID_SKIP = 1<<19;
44		38
45	object *objects; /* Pointer to the list of used objects */
46	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 */
47		40
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,	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,
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	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
50	};	43	};
…		…
56	};	49	};
57	int freedir[SIZEOFFREE] = {	50	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,	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,
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	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
60	};	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	}
61		131
62	/* 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. */
63	static int	133	static int
64	compare_ob_value_lists_one (const object *wants, const object *has)	134	compare_ob_value_lists_one (const object *wants, const object *has)
65	{	135	{
…		…
214	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	284	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)
215	return 0;	285	return 0;
216		286
217	switch (ob1->type)	287	switch (ob1->type)
218	{	288	{
219	case SCROLL:	289	case SCROLL:
220	if (ob1->level != ob2->level)	290	if (ob1->level != ob2->level)
221	return 0;	291	return 0;
222	break;	292	break;
223	}	293	}
224		294
225	if (ob1->key_values != NULL || ob2->key_values != NULL)	295	if (ob1->key_values != NULL || ob2->key_values != NULL)
226	{	296	{
227	/* At least one of these has key_values. */	297	/* At least one of these has key_values. */
…		…
249	/*	319	/*
250	* sum_weight() is a recursive function which calculates the weight	320	* sum_weight() is a recursive function which calculates the weight
251	* an object is carrying. It goes through in figures out how much	321	* an object is carrying. It goes through in figures out how much
252	* containers are carrying, and sums it up.	322	* containers are carrying, and sums it up.
253	*/	323	*/
254	signed long	324	long
255	sum_weight (object *op)	325	sum_weight (object *op)
256	{	326	{
257	signed long sum;	327	long sum;
258	object *inv;	328	object *inv;
259		329
260	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	330	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)
261	{	331	{
262	if (inv->inv)	332	if (inv->inv)
263	sum_weight (inv);	333	sum_weight (inv);
264	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
265	}	335	}
		336
266	if (op->type == CONTAINER && op->stats.Str)	337	if (op->type == CONTAINER && op->stats.Str)
267	sum = (sum * (100 - op->stats.Str)) / 100;	338	sum = (sum * (100 - op->stats.Str)) / 100;
		339
268	if (op->carrying != sum)	340	if (op->carrying != sum)
269	op->carrying = sum;	341	op->carrying = sum;
		342
270	return sum;	343	return sum;
271	}	344	}
272		345
273	/**	346	/**
274	* Return the outermost environment object for a given object.	347	* Return the outermost environment object for a given object.
…		…
372	void	445	void
373	dump_all_objects (void)	446	dump_all_objects (void)
374	{	447	{
375	object *op;	448	object *op;
376		449
377	for (op = objects; op != NULL; op = op->next)	450	for (op = object::first; op != NULL; op = op->next)
378	{	451	{
379	dump_object (op);	452	dump_object (op);
380	fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg);	453	fprintf (logfile, "Object %s\n", errmsg);
381	}	454	}
382	}	455	}
383		456
384	/*	457	/*
385	* get_nearest_part(multi-object, object 2) returns the part of the	458	* get_nearest_part(multi-object, object 2) returns the part of the
…		…
408	object *	481	object *
409	find_object (tag_t i)	482	find_object (tag_t i)
410	{	483	{
411	object *op;	484	object *op;
412		485
413	for (op = objects; op != NULL; op = op->next)	486	for (op = object::first; op != NULL; op = op->next)
414	if (op->count == i)	487	if (op->count == i)
415	break;	488	break;
		489
416	return op;	490	return op;
417	}	491	}
418		492
419	/*	493	/*
420	* Returns the first object which has a name equal to the argument.	494	* Returns the first object which has a name equal to the argument.
…		…
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
515	/* Set the owner to clone's current owner and set the skill and experience
516	* objects to clone's objects (typically those objects that where the owner's
517	* current skill and experience objects at the time when clone's owner was
518	* set - not the owner's current skill and experience objects).
519	*
520	* Use this function if player created an object (e.g. fire bullet, swarm
521	* spell), and this object creates further objects whose kills should be
522	* accounted for the player's original skill, even if player has changed
523	* skills meanwhile.
524	*/
525	void
526	copy_owner (object *op, object *clone)
527	{
528	object *owner = get_owner (clone);
529
530	if (owner == NULL)
531	{
532	/* players don't have owners - they own themselves. Update
533	* as appropriate.
534	*/
535	if (clone->type == PLAYER)
536	owner = clone;
537	else
538	return;
539	}
540	set_owner (op, owner);
541
542	}	539	}
543		540
544	/* Zero the key_values on op, decrementing the shared-string	541	/* Zero the key_values on op, decrementing the shared-string
545	* refcounts and freeing the links.	542	* refcounts and freeing the links.
546	*/	543	*/
…		…
562	{	559	{
563	attachable_base::clear ();	560	attachable_base::clear ();
564		561
565	free_key_values (this);	562	free_key_values (this);
566		563
		564	owner = 0;
567	name = 0;	565	name = 0;
568	name_pl = 0;	566	name_pl = 0;
569	title = 0;	567	title = 0;
570	race = 0;	568	race = 0;
571	slaying = 0;	569	slaying = 0;
572	skill = 0;	570	skill = 0;
573	msg = 0;	571	msg = 0;
574	lore = 0;	572	lore = 0;
575	custom_name = 0;	573	custom_name = 0;
576	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;
577		586
578	memset (static_cast < object_pod * >(this), 0, sizeof (object_pod));	587	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
579		588
580	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;
581	}	598	}
582		599
583	void object::clone (object *destination)	600	void object::clone (object *destination)
584	{	601	{
585	*(object_copy *) destination = *this;	602	*(object_copy *)destination = *this;
586	*(object_pod *) destination = *this;	603	*(object_pod *)destination = *this;
587		604
588	if (self || cb)	605	if (self || cb)
589	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));	606	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
590	}
591
592	/*
593	* clear_object() frees everything allocated by an object, and also
594	* clears all variables and flags to default settings.
595	*/
596
597	void
598	clear_object (object *op)
599	{
600	op->clear ();
601
602	op->contr = NULL;
603	op->below = NULL;
604	op->above = NULL;
605	op->inv = NULL;
606	op->container = NULL;
607	op->env = NULL;
608	op->more = NULL;
609	op->head = NULL;
610	op->map = NULL;
611	op->refcount = 0;
612	op->active_next = NULL;
613	op->active_prev = NULL;
614	/* What is not cleared is next, prev, and count */
615
616	op->expmul = 1.0;
617	op->face = blank_face;
618	op->attacked_by_count = -1;
619
620	if (settings.casting_time)
621	op->casting_time = -1;
622	}	607	}
623		608
624	/*	609	/*
625	* copy object first frees everything allocated by the second object,	610	* copy object first frees everything allocated by the second object,
626	* 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
627	* object, allocating what needs to be allocated. Basically, any	612	* object, allocating what needs to be allocated. Basically, any
628	* 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,
629	* 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
630	* will point at garbage.	615	* will point at garbage.
631	*/	616	*/
632
633	void	617	void
634	copy_object (object *op2, object *op)	618	copy_object (object *op2, object *op)
635	{	619	{
636	bool is_freed = QUERY_FLAG (op, FLAG_FREED);	620	bool is_freed = QUERY_FLAG (op, FLAG_FREED);
637	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);	621	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);
…		…
697	/*	681	/*
698	* 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
699	* 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.
700	* 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.
701	*/	685	*/
702
703	void	686	void
704	update_ob_speed (object *op)	687	update_ob_speed (object *op)
705	{	688	{
706	extern int arch_init;	689	extern int arch_init;
707		690
…		…
716	abort ();	699	abort ();
717	#else	700	#else
718	op->speed = 0;	701	op->speed = 0;
719	#endif	702	#endif
720	}	703	}
		704
721	if (arch_init)	705	if (arch_init)
722	{
723	return;	706	return;
724	}	707
725	if (FABS (op->speed) > MIN_ACTIVE_SPEED)	708	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
726	{	709	{
727	/* If already on active list, don't do anything */	710	/* If already on active list, don't do anything */
728	if (op->active_next || op->active_prev || op == active_objects)	711	if (op->active_next || op->active_prev || op == active_objects)
729	return;	712	return;
730		713
731	/* process_events() expects us to insert the object at the beginning	714	/* process_events() expects us to insert the object at the beginning
732	* of the list. */	715	* of the list. */
733	op->active_next = active_objects;	716	op->active_next = active_objects;
		717
734	if (op->active_next != NULL)	718	if (op->active_next != NULL)
735	op->active_next->active_prev = op;	719	op->active_next->active_prev = op;
		720
736	active_objects = op;	721	active_objects = op;
737	}	722	}
738	else	723	else
739	{	724	{
740	/* If not on the active list, nothing needs to be done */	725	/* If not on the active list, nothing needs to be done */
…		…
742	return;	727	return;
743		728
744	if (op->active_prev == NULL)	729	if (op->active_prev == NULL)
745	{	730	{
746	active_objects = op->active_next;	731	active_objects = op->active_next;
		732
747	if (op->active_next != NULL)	733	if (op->active_next != NULL)
748	op->active_next->active_prev = NULL;	734	op->active_next->active_prev = NULL;
749	}	735	}
750	else	736	else
751	{	737	{
752	op->active_prev->active_next = op->active_next;	738	op->active_prev->active_next = op->active_next;
		739
753	if (op->active_next)	740	if (op->active_next)
754	op->active_next->active_prev = op->active_prev;	741	op->active_next->active_prev = op->active_prev;
755	}	742	}
		743
756	op->active_next = NULL;	744	op->active_next = NULL;
757	op->active_prev = NULL;	745	op->active_prev = NULL;
758	}	746	}
759	}	747	}
760		748
…		…
890	/* if the object is being removed, we can't make intelligent	878	/* if the object is being removed, we can't make intelligent
891	* decisions, because remove_ob can't really pass the object	879	* decisions, because remove_ob can't really pass the object
892	* that is being removed.	880	* that is being removed.
893	*/	881	*/
894	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	882	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
895	{
896	update_now = 1;	883	update_now = 1;
897	}
898	else if (action == UP_OBJ_FACE)	884	else if (action == UP_OBJ_FACE)
899	{
900	/* Nothing to do for that case */	885	/* Nothing to do for that case */ ;
901	}
902	else	886	else
903	{
904	LOG (llevError, "update_object called with invalid action: %d\n", action);	887	LOG (llevError, "update_object called with invalid action: %d\n", action);
905	}
906		888
907	if (update_now)	889	if (update_now)
908	{	890	{
909	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);
910	update_position (op->map, op->x, op->y);	892	update_position (op->map, op->x, op->y);
…		…
912		894
913	if (op->more != NULL)	895	if (op->more != NULL)
914	update_object (op->more, action);	896	update_object (op->more, action);
915	}	897	}
916		898
917	static	899	object::vector object::mortals;
918	std::vector < object *>	900	object::vector object::objects; // not yet used
919	mortals;	901	object *object::first;
920		902
921	void object::free_mortals ()	903	void object::free_mortals ()
922	{	904	{
923	for (std::vector < object *>::iterator i = mortals.begin (); i != mortals.end (); ++i)	905	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
924	delete *	906	if ((*i)->refcnt)
		907	++i; // further delay freeing
		908	else
925	i;	909	{
		910	delete *i;
		911	mortals.erase (i);
		912	}
926		913
927	mortals.clear ();	914	static int lastmortals = 0;//D
		915
		916	if (mortals.size() != lastmortals && lastmortals > 100)//D
		917	{
		918	lastmortals = mortals.size ();//D
		919	LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
		920	}
928	}	921	}
929		922
930	object::object ()	923	object::object ()
931	{	924	{
932	SET_FLAG (this, FLAG_REMOVED);	925	SET_FLAG (this, FLAG_REMOVED);
933		926
934	expmul = 1.0;	927	expmul = 1.0;
935	face = blank_face;	928	face = blank_face;
936	attacked_by_count = -1;
937	}	929	}
938		930
939	object::~object ()	931	object::~object ()
940	{	932	{
941	free_key_values (this);	933	free_key_values (this);
942	}	934	}
943		935
944	void object::link ()	936	void object::link ()
945	{	937	{
946	count = ++ob_count;	938	count = ++ob_count;
		939	uuid = gen_uuid ();
947		940
948	prev = 0;	941	prev = 0;
949	next = objects;	942	next = object::first;
950		943
951	if (objects)	944	if (object::first)
952	objects->prev = this;	945	object::first->prev = this;
953		946
954	objects = this;	947	object::first = this;
955	}	948	}
956		949
957	void object::unlink ()	950	void object::unlink ()
958	{	951	{
959	count = 0;	952	if (this == object::first)
		953	object::first = next;
960		954
961	/* Remove this object from the list of used objects */	955	/* Remove this object from the list of used objects */
962	if (prev)
963	prev->next = next;	956	if (prev) prev->next = next;
964	if (next)
965	next->prev = prev;	957	if (next) next->prev = prev;
966	if (this == objects)	958
967	objects = next;	959	prev = 0;
		960	next = 0;
968	}	961	}
969		962
970	object *object::create ()	963	object *object::create ()
971	{	964	{
972	object *
973	op = new object;	965	object *op = new object;
974
975	op->link ();	966	op->link ();
976	return op;	967	return op;
977	}	968	}
978		969
979	/*	970	/*
…		…
981	* it from the list of used objects, and puts it on the list of	972	* it from the list of used objects, and puts it on the list of
982	* free objects. The IS_FREED() flag is set in the object.	973	* free objects. The IS_FREED() flag is set in the object.
983	* The object must have been removed by remove_ob() first for	974	* The object must have been removed by remove_ob() first for
984	* this function to succeed.	975	* this function to succeed.
985	*	976	*
986	* If free_inventory is set, free inventory as well. Else drop items in	977	* If destroy_inventory is set, free inventory as well. Else drop items in
987	* inventory to the ground.	978	* inventory to the ground.
988	*/	979	*/
989	void object::free (bool free_inventory)	980	void object::destroy (bool destroy_inventory)
990	{	981	{
		982	if (QUERY_FLAG (this, FLAG_FREED))
		983	return;
		984
		985	if (QUERY_FLAG (this, FLAG_FRIENDLY))
		986	remove_friendly_object (this);
		987
991	if (!QUERY_FLAG (this, FLAG_REMOVED))	988	if (!QUERY_FLAG (this, FLAG_REMOVED))
992	{	989	remove_ob (this);
993	LOG (llevDebug, "Free object called with non removed object\n");
994	dump_object (this);
995	#ifdef MANY_CORES
996	abort ();
997	#endif
998	}
999		990
1000	if (QUERY_FLAG (this, FLAG_FRIENDLY))
1001	{
1002	LOG (llevMonster, "Warning: tried to free friendly object.\n");
1003	remove_friendly_object (this);
1004	}
1005
1006	if (QUERY_FLAG (this, FLAG_FREED))	991	SET_FLAG (this, FLAG_FREED);
1007	{
1008	dump_object (this);
1009	LOG (llevError, "Trying to free freed object.\n%s\n", errmsg);
1010	return;
1011	}
1012		992
1013	if (more)	993	if (more)
1014	{	994	{
1015	more->free (free_inventory);	995	more->destroy (destroy_inventory);
1016	more = 0;	996	more = 0;
1017	}	997	}
1018		998
1019	if (inv)	999	if (inv)
1020	{	1000	{
1021	/* Only if the space blocks everything do we not process -	1001	/* Only if the space blocks everything do we not process -
1022	* if some form of movement is allowed, let objects	1002	* if some form of movement is allowed, let objects
1023	* drop on that space.	1003	* drop on that space.
1024	*/	1004	*/
1025	if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || (GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL))	1005	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
1026	{	1006	{
1027	object *	1007	object *op = inv;
1028	op = inv;
1029		1008
1030	while (op)	1009	while (op)
1031	{	1010	{
1032	object *
1033	tmp = op->below;	1011	object *tmp = op->below;
1034
1035	remove_ob (op);
1036	op->free (free_inventory);	1012	op->destroy (destroy_inventory);
1037	op = tmp;	1013	op = tmp;
1038	}	1014	}
1039	}	1015	}
1040	else	1016	else
1041	{ /* Put objects in inventory onto this space */	1017	{ /* Put objects in inventory onto this space */
1042	object *	1018	object *op = inv;
1043	op = inv;
1044		1019
1045	while (op)	1020	while (op)
1046	{	1021	{
1047	object *
1048	tmp = op->below;	1022	object *tmp = op->below;
1049		1023
1050	remove_ob (op);	1024	remove_ob (op);
1051		1025
1052	if (QUERY_FLAG (op, FLAG_STARTEQUIP)	1026	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
1053	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))	1027	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
…		…
1062	op = tmp;	1036	op = tmp;
1063	}	1037	}
1064	}	1038	}
1065	}	1039	}
1066		1040
		1041	// clear those pointers that likely might have circular references to us
		1042	owner = 0;
		1043	enemy = 0;
		1044	attacked_by = 0;
		1045
		1046	// only relevant for players(?), but make sure of it anyways
		1047	contr = 0;
		1048
1067	/* Remove object from the active list */	1049	/* Remove object from the active list */
1068	speed = 0;	1050	speed = 0;
1069	update_ob_speed (this);	1051	update_ob_speed (this);
1070		1052
1071	unlink ();	1053	unlink ();
1072		1054
1073	SET_FLAG (this, FLAG_FREED);
1074
1075	mortals.push_back (this);	1055	mortals.push_back (this);
1076	}	1056	}
1077		1057
1078	/*	1058	/*
1079	* sub_weight() recursively (outwards) subtracts a number from the	1059	* sub_weight() recursively (outwards) subtracts a number from the
…		…
1084	sub_weight (object *op, signed long weight)	1064	sub_weight (object *op, signed long weight)
1085	{	1065	{
1086	while (op != NULL)	1066	while (op != NULL)
1087	{	1067	{
1088	if (op->type == CONTAINER)	1068	if (op->type == CONTAINER)
1089	{
1090	weight = (signed long) (weight * (100 - op->stats.Str) / 100);	1069	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1091	}	1070
1092	op->carrying -= weight;	1071	op->carrying -= weight;
1093	op = op->env;	1072	op = op->env;
1094	}	1073	}
1095	}	1074	}
1096		1075
…		…
1104	*/	1083	*/
1105		1084
1106	void	1085	void
1107	remove_ob (object *op)	1086	remove_ob (object *op)
1108	{	1087	{
		1088	object *tmp, *last = 0;
1109	object *	1089	object *otmp;
1110	tmp, *	1090
1111	last = NULL;
1112	object *
1113	otmp;
1114	tag_t
1115	tag;
1116	int
1117	check_walk_off;	1091	int check_walk_off;
1118	mapstruct *	1092	maptile *m;
1119	m;
1120	sint16
1121	x,
1122	y;
1123		1093
		1094	sint16 x, y;
1124		1095
1125	if (QUERY_FLAG (op, FLAG_REMOVED))	1096	if (QUERY_FLAG (op, FLAG_REMOVED))
1126	{	1097	return;
1127	dump_object (op);
1128	LOG (llevError, "Trying to remove removed object.\n%s\n", errmsg);
1129		1098
1130	/* Changed it to always dump core in this case. As has been learned	1099	SET_FLAG (op, FLAG_REMOVED);
1131	* in the past, trying to recover from errors almost always	1100
1132	* make things worse, and this is a real error here - something
1133	* that should not happen.
1134	* Yes, if this was a mission critical app, trying to do something
1135	* to recover may make sense, but that is because failure of the app
1136	* may have other disastrous problems. Cf runs out of a script
1137	* so is easily enough restarted without any real problems.
1138	* MSW 2001-07-01
1139	*/
1140	abort ();
1141	}
1142	if (op->more != NULL)	1101	if (op->more != NULL)
1143	remove_ob (op->more);	1102	remove_ob (op->more);
1144
1145	SET_FLAG (op, FLAG_REMOVED);
1146		1103
1147	/*	1104	/*
1148	* In this case, the object to be removed is in someones	1105	* In this case, the object to be removed is in someones
1149	* inventory.	1106	* inventory.
1150	*/	1107	*/
…		…
1176	*/	1133	*/
1177	op->x = op->env->x, op->y = op->env->y;	1134	op->x = op->env->x, op->y = op->env->y;
1178	op->map = op->env->map;	1135	op->map = op->env->map;
1179	op->above = NULL, op->below = NULL;	1136	op->above = NULL, op->below = NULL;
1180	op->env = NULL;	1137	op->env = NULL;
1181	return;	1138	}
		1139	else if (op->map)
1182	}	1140	{
1183
1184	/* If we get here, we are removing it from a map */
1185	if (op->map == NULL)
1186	return;
1187
1188	x = op->x;	1141	x = op->x;
1189	y = op->y;	1142	y = op->y;
1190	m = get_map_from_coord (op->map, &x, &y);	1143	m = get_map_from_coord (op->map, &x, &y);
1191		1144
1192	if (!m)	1145	if (!m)
1193	{	1146	{
1194	LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",	1147	LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1195	op->map->path, op->x, op->y);	1148	op->map->path, op->x, op->y);
1196	/* in old days, we used to set x and y to 0 and continue.	1149	/* in old days, we used to set x and y to 0 and continue.
1197	* it seems if we get into this case, something is probablye	1150	* it seems if we get into this case, something is probablye
1198	* screwed up and should be fixed.	1151	* screwed up and should be fixed.
		1152	*/
		1153	abort ();
		1154	}
		1155
		1156	if (op->map != m)
		1157	LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
		1158	op->map->path, m->path, op->x, op->y, x, y);
		1159
		1160	/* Re did the following section of code - it looks like it had
		1161	* lots of logic for things we no longer care about
1199	*/	1162	*/
1200	abort ();
1201	}
1202	if (op->map != m)
1203	{
1204	LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1205	op->map->path, m->path, op->x, op->y, x, y);
1206	}
1207		1163
1208	/* Re did the following section of code - it looks like it had
1209	* lots of logic for things we no longer care about
1210	*/
1211
1212	/* link the object above us */	1164	/* link the object above us */
1213	if (op->above)	1165	if (op->above)
1214	op->above->below = op->below;	1166	op->above->below = op->below;
1215	else	1167	else
1216	SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */	1168	SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */
1217		1169
1218	/* Relink the object below us, if there is one */	1170	/* Relink the object below us, if there is one */
1219	if (op->below)	1171	if (op->below)
1220	{
1221	op->below->above = op->above;	1172	op->below->above = op->above;
1222	}
1223	else	1173	else
1224	{	1174	{
1225	/* Nothing below, which means we need to relink map object for this space	1175	/* Nothing below, which means we need to relink map object for this space
1226	* use translated coordinates in case some oddness with map tiling is	1176	* use translated coordinates in case some oddness with map tiling is
1227	* evident	1177	* evident
1228	*/
1229	if (GET_MAP_OB (m, x, y) != op)
1230	{
1231	dump_object (op);
1232	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",
1233	errmsg);
1234	dump_object (GET_MAP_OB (m, x, y));
1235	LOG (llevError, "%s\n", errmsg);
1236	}
1237	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1238	}
1239	op->above = NULL;
1240	op->below = NULL;
1241
1242	if (op->map->in_memory == MAP_SAVING)
1243	return;
1244
1245	tag = op->count;
1246	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1247	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1248	{
1249	/* No point updating the players look faces if he is the object
1250	* being removed.
1251	*/
1252
1253	if (tmp->type == PLAYER && tmp != op)
1254	{
1255	/* If a container that the player is currently using somehow gets
1256	* removed (most likely destroyed), update the player view
1257	* appropriately.
1258	*/	1178	*/
1259	if (tmp->container == op)	1179	if (GET_MAP_OB (m, x, y) != op)
1260	{	1180	{
1261	CLEAR_FLAG (op, FLAG_APPLIED);	1181	dump_object (op);
1262	tmp->container = NULL;	1182	LOG (llevError,
		1183	"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);
		1184	dump_object (GET_MAP_OB (m, x, y));
		1185	LOG (llevError, "%s\n", errmsg);
1263	}	1186	}
1264	tmp->contr->socket.update_look = 1;	1187
1265	}	1188	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1266	/* See if player moving off should effect something */
1267	if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1268	{	1189	}
1269		1190
1270	move_apply (tmp, op, NULL);	1191	op->above = 0;
1271	if (was_destroyed (op, tag))	1192	op->below = 0;
		1193
		1194	if (op->map->in_memory == MAP_SAVING)
		1195	return;
		1196
		1197	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
		1198
		1199	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
		1200	{
		1201	/* No point updating the players look faces if he is the object
		1202	* being removed.
		1203	*/
		1204
		1205	if (tmp->type == PLAYER && tmp != op)
1272	{	1206	{
1273	LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name);	1207	/* If a container that the player is currently using somehow gets
		1208	* removed (most likely destroyed), update the player view
		1209	* appropriately.
		1210	*/
		1211	if (tmp->container == op)
		1212	{
		1213	CLEAR_FLAG (op, FLAG_APPLIED);
		1214	tmp->container = NULL;
		1215	}
		1216
		1217	tmp->contr->socket.update_look = 1;
1274	}	1218	}
		1219
		1220	/* See if player moving off should effect something */
		1221	if (check_walk_off
		1222	&& ((op->move_type & tmp->move_off)
		1223	&& (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
		1224	{
		1225	move_apply (tmp, op, NULL);
		1226
		1227	if (op->destroyed ())
		1228	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1275	}	1229	}
1276		1230
1277	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1231	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1278		1232
1279	if (tmp->above == tmp)	1233	if (tmp->above == tmp)
1280	tmp->above = NULL;	1234	tmp->above = NULL;
		1235
1281	last = tmp;	1236	last = tmp;
1282	}	1237	}
		1238
1283	/* last == NULL of there are no objects on this space */	1239	/* last == NULL of there are no objects on this space */
1284	if (last == NULL)	1240	if (last == NULL)
1285	{	1241	{
1286	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,	1242	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1287	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures	1243	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1288	* those out anyways, and if there are any flags set right now, they won't	1244	* those out anyways, and if there are any flags set right now, they won't
1289	* be correct anyways.	1245	* be correct anyways.
1290	*/	1246	*/
1291	SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);	1247	SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);
1292	update_position (op->map, op->x, op->y);	1248	update_position (op->map, op->x, op->y);
1293	}	1249	}
1294	else	1250	else
1295	update_object (last, UP_OBJ_REMOVE);	1251	update_object (last, UP_OBJ_REMOVE);
1296		1252
1297	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))	1253	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))
1298	update_all_los (op->map, op->x, op->y);	1254	update_all_los (op->map, op->x, op->y);
1299		1255	}
1300	}	1256	}
1301		1257
1302	/*	1258	/*
1303	* merge_ob(op,top):	1259	* merge_ob(op,top):
1304	*	1260	*
1305	* This function goes through all objects below and including top, and	1261	* This function goes through all objects below and including top, and
1306	* merges op to the first matching object.	1262	* merges op to the first matching object.
1307	* If top is NULL, it is calculated.	1263	* If top is NULL, it is calculated.
1308	* Returns pointer to object if it succeded in the merge, otherwise NULL	1264	* Returns pointer to object if it succeded in the merge, otherwise NULL
1309	*/	1265	*/
1310
1311	object *	1266	object *
1312	merge_ob (object *op, object *top)	1267	merge_ob (object *op, object *top)
1313	{	1268	{
1314	if (!op->nrof)	1269	if (!op->nrof)
1315	return 0;	1270	return 0;
		1271
1316	if (top == NULL)	1272	if (top == NULL)
1317	for (top = op; top != NULL && top->above != NULL; top = top->above);	1273	for (top = op; top != NULL && top->above != NULL; top = top->above);
		1274
1318	for (; top != NULL; top = top->below)	1275	for (; top != NULL; top = top->below)
1319	{	1276	{
1320	if (top == op)	1277	if (top == op)
1321	continue;	1278	continue;
1322	if (CAN_MERGE (op, top))	1279	if (CAN_MERGE (op, top))
…		…
1328	remove_ob (op);	1285	remove_ob (op);
1329	free_object (op);	1286	free_object (op);
1330	return top;	1287	return top;
1331	}	1288	}
1332	}	1289	}
		1290
1333	return NULL;	1291	return 0;
1334	}	1292	}
1335		1293
1336	/*	1294	/*
1337	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1295	* same as insert_ob_in_map except it handle separate coordinates and do a clean
1338	* job preparing multi-part monsters	1296	* job preparing multi-part monsters
1339	*/	1297	*/
1340	object *	1298	object *
1341	insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y)	1299	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1342	{	1300	{
1343	object *	1301	object *tmp;
1344	tmp;
1345		1302
1346	if (op->head)	1303	if (op->head)
1347	op = op->head;	1304	op = op->head;
		1305
1348	for (tmp = op; tmp; tmp = tmp->more)	1306	for (tmp = op; tmp; tmp = tmp->more)
1349	{	1307	{
1350	tmp->x = x + tmp->arch->clone.x;	1308	tmp->x = x + tmp->arch->clone.x;
1351	tmp->y = y + tmp->arch->clone.y;	1309	tmp->y = y + tmp->arch->clone.y;
1352	}	1310	}
		1311
1353	return insert_ob_in_map (op, m, originator, flag);	1312	return insert_ob_in_map (op, m, originator, flag);
1354	}	1313	}
1355		1314
1356	/*	1315	/*
1357	* insert_ob_in_map (op, map, originator, flag):	1316	* insert_ob_in_map (op, map, originator, flag):
…		…
1373	* NULL if 'op' was destroyed	1332	* NULL if 'op' was destroyed
1374	* just 'op' otherwise	1333	* just 'op' otherwise
1375	*/	1334	*/
1376		1335
1377	object *	1336	object *
1378	insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag)	1337	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1379	{	1338	{
1380	object *	1339	object *tmp, *top, *floor = NULL;
1381	tmp, *	1340	sint16 x, y;
1382	top, *
1383	floor = NULL;
1384	sint16
1385	x,
1386	y;
1387		1341
1388	if (QUERY_FLAG (op, FLAG_FREED))	1342	if (QUERY_FLAG (op, FLAG_FREED))
1389	{	1343	{
1390	LOG (llevError, "Trying to insert freed object!\n");	1344	LOG (llevError, "Trying to insert freed object!\n");
1391	return NULL;	1345	return NULL;
1392	}	1346	}
		1347
1393	if (m == NULL)	1348	if (m == NULL)
1394	{	1349	{
1395	dump_object (op);	1350	dump_object (op);
1396	LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg);	1351	LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg);
1397	return op;	1352	return op;
1398	}	1353	}
		1354
1399	if (out_of_map (m, op->x, op->y))	1355	if (out_of_map (m, op->x, op->y))
1400	{	1356	{
1401	dump_object (op);	1357	dump_object (op);
1402	LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg);	1358	LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg);
1403	#ifdef MANY_CORES	1359	#ifdef MANY_CORES
…		…
1407	*/	1363	*/
1408	abort ();	1364	abort ();
1409	#endif	1365	#endif
1410	return op;	1366	return op;
1411	}	1367	}
		1368
1412	if (!QUERY_FLAG (op, FLAG_REMOVED))	1369	if (!QUERY_FLAG (op, FLAG_REMOVED))
1413	{	1370	{
1414	dump_object (op);	1371	dump_object (op);
1415	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg);	1372	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg);
1416	return op;	1373	return op;
1417	}	1374	}
		1375
1418	if (op->more != NULL)	1376	if (op->more != NULL)
1419	{	1377	{
1420	/* The part may be on a different map. */	1378	/* The part may be on a different map. */
1421		1379
1422	object *
1423	more = op->more;	1380	object *more = op->more;
1424		1381
1425	/* We really need the caller to normalize coordinates - if	1382	/* We really need the caller to normalize coordinates - if
1426	* we set the map, that doesn't work if the location is within	1383	* we set the map, that doesn't work if the location is within
1427	* a map and this is straddling an edge. So only if coordinate	1384	* a map and this is straddling an edge. So only if coordinate
1428	* is clear wrong do we normalize it.	1385	* is clear wrong do we normalize it.
1429	*/	1386	*/
1430	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))	1387	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1431	{
1432	more->map = get_map_from_coord (m, &more->x, &more->y);	1388	more->map = get_map_from_coord (m, &more->x, &more->y);
1433	}
1434	else if (!more->map)	1389	else if (!more->map)
1435	{	1390	{
1436	/* For backwards compatibility - when not dealing with tiled maps,	1391	/* For backwards compatibility - when not dealing with tiled maps,
1437	* more->map should always point to the parent.	1392	* more->map should always point to the parent.
1438	*/	1393	*/
…		…
1441		1396
1442	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1397	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1443	{	1398	{
1444	if (!op->head)	1399	if (!op->head)
1445	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1400	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
		1401
1446	return NULL;	1402	return NULL;
1447	}	1403	}
1448	}	1404	}
		1405
1449	CLEAR_FLAG (op, FLAG_REMOVED);	1406	CLEAR_FLAG (op, FLAG_REMOVED);
1450		1407
1451	/* Ideally, the caller figures this out. However, it complicates a lot	1408	/* Ideally, the caller figures this out. However, it complicates a lot
1452	* of areas of callers (eg, anything that uses find_free_spot would now	1409	* of areas of callers (eg, anything that uses find_free_spot would now
1453	* need extra work	1410	* need extra work
…		…
1457	y = op->y;	1414	y = op->y;
1458		1415
1459	/* this has to be done after we translate the coordinates.	1416	/* this has to be done after we translate the coordinates.
1460	*/	1417	*/
1461	if (op->nrof && !(flag & INS_NO_MERGE))	1418	if (op->nrof && !(flag & INS_NO_MERGE))
1462	{
1463	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1419	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)
1464	if (CAN_MERGE (op, tmp))	1420	if (CAN_MERGE (op, tmp))
1465	{	1421	{
1466	op->nrof += tmp->nrof;	1422	op->nrof += tmp->nrof;
1467	remove_ob (tmp);	1423	remove_ob (tmp);
1468	free_object (tmp);	1424	free_object (tmp);
1469	}	1425	}
1470	}
1471		1426
1472	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1427	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1473	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1428	CLEAR_FLAG (op, FLAG_INV_LOCKED);
		1429
1474	if (!QUERY_FLAG (op, FLAG_ALIVE))	1430	if (!QUERY_FLAG (op, FLAG_ALIVE))
1475	CLEAR_FLAG (op, FLAG_NO_STEAL);	1431	CLEAR_FLAG (op, FLAG_NO_STEAL);
1476		1432
1477	if (flag & INS_BELOW_ORIGINATOR)	1433	if (flag & INS_BELOW_ORIGINATOR)
1478	{	1434	{
1479	if (originator->map != op->map || originator->x != op->x || originator->y != op->y)	1435	if (originator->map != op->map || originator->x != op->x || originator->y != op->y)
1480	{	1436	{
1481	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1437	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1482	abort ();	1438	abort ();
1483	}	1439	}
		1440
1484	op->above = originator;	1441	op->above = originator;
1485	op->below = originator->below;	1442	op->below = originator->below;
		1443
1486	if (op->below)	1444	if (op->below)
1487	op->below->above = op;	1445	op->below->above = op;
1488	else	1446	else
1489	SET_MAP_OB (op->map, op->x, op->y, op);	1447	SET_MAP_OB (op->map, op->x, op->y, op);
		1448
1490	/* since *below* originator, no need to update top */	1449	/* since *below* originator, no need to update top */
1491	originator->below = op;	1450	originator->below = op;
1492	}	1451	}
1493	else	1452	else
1494	{	1453	{
1495	/* If there are other objects, then */	1454	/* If there are other objects, then */
1496	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1455	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))
1497	{	1456	{
1498	object *
1499	last = NULL;	1457	object *last = NULL;
1500		1458
1501	/*	1459	/*
1502	* If there are multiple objects on this space, we do some trickier handling.	1460	* If there are multiple objects on this space, we do some trickier handling.
1503	* We've already dealt with merging if appropriate.	1461	* We've already dealt with merging if appropriate.
1504	* Generally, we want to put the new object on top. But if	1462	* Generally, we want to put the new object on top. But if
…		…
1513		1471
1514	while (top != NULL)	1472	while (top != NULL)
1515	{	1473	{
1516	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1474	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1517	floor = top;	1475	floor = top;
		1476
1518	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1477	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
1519	{	1478	{
1520	/* We insert above top, so we want this object below this */	1479	/* We insert above top, so we want this object below this */
1521	top = top->below;	1480	top = top->below;
1522	break;	1481	break;
1523	}	1482	}
		1483
1524	last = top;	1484	last = top;
1525	top = top->above;	1485	top = top->above;
1526	}	1486	}
		1487
1527	/* Don't want top to be NULL, so set it to the last valid object */	1488	/* Don't want top to be NULL, so set it to the last valid object */
1528	top = last;	1489	top = last;
1529		1490
1530	/* We let update_position deal with figuring out what the space	1491	/* We let update_position deal with figuring out what the space
1531	* looks like instead of lots of conditions here.	1492	* looks like instead of lots of conditions here.
…		…
1551	*/	1512	*/
1552	if (last && last->below && last != floor)	1513	if (last && last->below && last != floor)
1553	top = last->below;	1514	top = last->below;
1554	}	1515	}
1555	} /* If objects on this space */	1516	} /* If objects on this space */
		1517
1556	if (flag & INS_MAP_LOAD)	1518	if (flag & INS_MAP_LOAD)
1557	top = GET_MAP_TOP (op->map, op->x, op->y);	1519	top = GET_MAP_TOP (op->map, op->x, op->y);
		1520
1558	if (flag & INS_ABOVE_FLOOR_ONLY)	1521	if (flag & INS_ABOVE_FLOOR_ONLY)
1559	top = floor;	1522	top = floor;
1560		1523
1561	/* Top is the object that our object (op) is going to get inserted above.	1524	/* Top is the object that our object (op) is going to get inserted above.
1562	*/	1525	*/
1563		1526
1564	/* First object on this space */	1527	/* First object on this space */
1565	if (!top)	1528	if (!top)
1566	{	1529	{
1567	op->above = GET_MAP_OB (op->map, op->x, op->y);	1530	op->above = GET_MAP_OB (op->map, op->x, op->y);
		1531
1568	if (op->above)	1532	if (op->above)
1569	op->above->below = op;	1533	op->above->below = op;
		1534
1570	op->below = NULL;	1535	op->below = NULL;
1571	SET_MAP_OB (op->map, op->x, op->y, op);	1536	SET_MAP_OB (op->map, op->x, op->y, op);
1572	}	1537	}
1573	else	1538	else
1574	{ /* get inserted into the stack above top */	1539	{ /* get inserted into the stack above top */
1575	op->above = top->above;	1540	op->above = top->above;
		1541
1576	if (op->above)	1542	if (op->above)
1577	op->above->below = op;	1543	op->above->below = op;
		1544
1578	op->below = top;	1545	op->below = top;
1579	top->above = op;	1546	top->above = op;
1580	}	1547	}
		1548
1581	if (op->above == NULL)	1549	if (op->above == NULL)
1582	SET_MAP_TOP (op->map, op->x, op->y, op);	1550	SET_MAP_TOP (op->map, op->x, op->y, op);
1583	} /* else not INS_BELOW_ORIGINATOR */	1551	} /* else not INS_BELOW_ORIGINATOR */
1584		1552
1585	if (op->type == PLAYER)	1553	if (op->type == PLAYER)
…		…
1588	/* If we have a floor, we know the player, if any, will be above	1556	/* If we have a floor, we know the player, if any, will be above
1589	* it, so save a few ticks and start from there.	1557	* it, so save a few ticks and start from there.
1590	*/	1558	*/
1591	if (!(flag & INS_MAP_LOAD))	1559	if (!(flag & INS_MAP_LOAD))
1592	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1560	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1593	{
1594	if (tmp->type == PLAYER)	1561	if (tmp->type == PLAYER)
1595	tmp->contr->socket.update_look = 1;	1562	tmp->contr->socket.update_look = 1;
1596	}
1597		1563
1598	/* If this object glows, it may affect lighting conditions that are	1564	/* If this object glows, it may affect lighting conditions that are
1599	* visible to others on this map. But update_all_los is really	1565	* visible to others on this map. But update_all_los is really
1600	* an inefficient way to do this, as it means los for all players	1566	* an inefficient way to do this, as it means los for all players
1601	* on the map will get recalculated. The players could very well	1567	* on the map will get recalculated. The players could very well
…		…
1605	* of effect may be sufficient.	1571	* of effect may be sufficient.
1606	*/	1572	*/
1607	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1573	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))
1608	update_all_los (op->map, op->x, op->y);	1574	update_all_los (op->map, op->x, op->y);
1609		1575
1610
1611	/* updates flags (blocked, alive, no magic, etc) for this map space */	1576	/* updates flags (blocked, alive, no magic, etc) for this map space */
1612	update_object (op, UP_OBJ_INSERT);	1577	update_object (op, UP_OBJ_INSERT);
1613
1614		1578
1615	/* Don't know if moving this to the end will break anything. However,	1579	/* Don't know if moving this to the end will break anything. However,
1616	* we want to have update_look set above before calling this.	1580	* we want to have update_look set above before calling this.
1617	*	1581	*
1618	* check_move_on() must be after this because code called from	1582	* check_move_on() must be after this because code called from
…		…
1620	* blocked() and wall() work properly), and these flags are updated by	1584	* blocked() and wall() work properly), and these flags are updated by
1621	* update_object().	1585	* update_object().
1622	*/	1586	*/
1623		1587
1624	/* if this is not the head or flag has been passed, don't check walk on status */	1588	/* if this is not the head or flag has been passed, don't check walk on status */
1625
1626	if (!(flag & INS_NO_WALK_ON) && !op->head)	1589	if (!(flag & INS_NO_WALK_ON) && !op->head)
1627	{	1590	{
1628	if (check_move_on (op, originator))	1591	if (check_move_on (op, originator))
1629	return NULL;	1592	return NULL;
1630		1593
…		…
1633	*/	1596	*/
1634	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1597	for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1635	if (check_move_on (tmp, originator))	1598	if (check_move_on (tmp, originator))
1636	return NULL;	1599	return NULL;
1637	}	1600	}
		1601
1638	return op;	1602	return op;
1639	}	1603	}
1640		1604
1641	/* this function inserts an object in the map, but if it	1605	/* this function inserts an object in the map, but if it
1642	* finds an object of its own type, it'll remove that one first.	1606	* finds an object of its own type, it'll remove that one first.
…		…
1659	remove_ob (tmp);	1623	remove_ob (tmp);
1660	free_object (tmp);	1624	free_object (tmp);
1661	}	1625	}
1662	}	1626	}
1663		1627
1664	tmp1 = arch_to_object (find_archetype (arch_string));	1628	tmp1 = arch_to_object (archetype::find (arch_string));
1665
1666		1629
1667	tmp1->x = op->x;	1630	tmp1->x = op->x;
1668	tmp1->y = op->y;	1631	tmp1->y = op->y;
1669	insert_ob_in_map (tmp1, op->map, op, 0);	1632	insert_ob_in_map (tmp1, op->map, op, 0);
1670	}	1633	}
…		…
1688	if (orig_ob->nrof < nr)	1651	if (orig_ob->nrof < nr)
1689	{	1652	{
1690	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);	1653	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1691	return NULL;	1654	return NULL;
1692	}	1655	}
		1656
1693	newob = object_create_clone (orig_ob);	1657	newob = object_create_clone (orig_ob);
		1658
1694	if ((orig_ob->nrof -= nr) < 1)	1659	if ((orig_ob->nrof -= nr) < 1)
1695	{	1660	{
1696	if (!is_removed)	1661	if (!is_removed)
1697	remove_ob (orig_ob);	1662	remove_ob (orig_ob);
1698	free_object2 (orig_ob, 1);	1663	free_object2 (orig_ob, 1);
…		…
1706	strcpy (errmsg, "Tried to split object whose map is not in memory.");	1671	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1707	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");	1672	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1708	return NULL;	1673	return NULL;
1709	}	1674	}
1710	}	1675	}
		1676
1711	newob->nrof = nr;	1677	newob->nrof = nr;
1712		1678
1713	return newob;	1679	return newob;
1714	}	1680	}
1715		1681
…		…
1722	*/	1688	*/
1723		1689
1724	object *	1690	object *
1725	decrease_ob_nr (object *op, uint32 i)	1691	decrease_ob_nr (object *op, uint32 i)
1726	{	1692	{
1727	object *	1693	object *tmp;
1728	tmp;
1729	player *	1694	player *pl;
1730	pl;
1731		1695
1732	if (i == 0) /* objects with op->nrof require this check */	1696	if (i == 0) /* objects with op->nrof require this check */
1733	return op;	1697	return op;
1734		1698
1735	if (i > op->nrof)	1699	if (i > op->nrof)
1736	i = op->nrof;	1700	i = op->nrof;
1737		1701
1738	if (QUERY_FLAG (op, FLAG_REMOVED))	1702	if (QUERY_FLAG (op, FLAG_REMOVED))
1739	{
1740	op->nrof -= i;	1703	op->nrof -= i;
1741	}
1742	else if (op->env != NULL)	1704	else if (op->env != NULL)
1743	{	1705	{
1744	/* is this object in the players inventory, or sub container	1706	/* is this object in the players inventory, or sub container
1745	* therein?	1707	* therein?
1746	*/	1708	*/
…		…
1781	}	1743	}
1782	}	1744	}
1783	}	1745	}
1784	else	1746	else
1785	{	1747	{
1786	object *
1787	above = op->above;	1748	object *above = op->above;
1788		1749
1789	if (i < op->nrof)	1750	if (i < op->nrof)
1790	{
1791	op->nrof -= i;	1751	op->nrof -= i;
1792	}
1793	else	1752	else
1794	{	1753	{
1795	remove_ob (op);	1754	remove_ob (op);
1796	op->nrof = 0;	1755	op->nrof = 0;
1797	}	1756	}
		1757
1798	/* Since we just removed op, op->above is null */	1758	/* Since we just removed op, op->above is null */
1799	for (tmp = above; tmp != NULL; tmp = tmp->above)	1759	for (tmp = above; tmp != NULL; tmp = tmp->above)
1800	if (tmp->type == PLAYER)	1760	if (tmp->type == PLAYER)
1801	{	1761	{
1802	if (op->nrof)	1762	if (op->nrof)
…		…
1805	esrv_del_item (tmp->contr, op->count);	1765	esrv_del_item (tmp->contr, op->count);
1806	}	1766	}
1807	}	1767	}
1808		1768
1809	if (op->nrof)	1769	if (op->nrof)
1810	{
1811	return op;	1770	return op;
1812	}
1813	else	1771	else
1814	{	1772	{
1815	free_object (op);	1773	free_object (op);
1816	return NULL;	1774	return NULL;
1817	}	1775	}
…		…
1826	add_weight (object *op, signed long weight)	1784	add_weight (object *op, signed long weight)
1827	{	1785	{
1828	while (op != NULL)	1786	while (op != NULL)
1829	{	1787	{
1830	if (op->type == CONTAINER)	1788	if (op->type == CONTAINER)
1831	{
1832	weight = (signed long) (weight * (100 - op->stats.Str) / 100);	1789	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1833	}	1790
1834	op->carrying += weight;	1791	op->carrying += weight;
1835	op = op->env;	1792	op = op->env;
1836	}	1793	}
1837	}	1794	}
1838		1795
…		…
1861	{	1818	{
1862	dump_object (op);	1819	dump_object (op);
1863	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);	1820	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);
1864	return op;	1821	return op;
1865	}	1822	}
		1823
1866	if (where == NULL)	1824	if (where == NULL)
1867	{	1825	{
1868	dump_object (op);	1826	dump_object (op);
1869	LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);	1827	LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);
1870	return op;	1828	return op;
1871	}	1829	}
		1830
1872	if (where->head)	1831	if (where->head)
1873	{	1832	{
1874	LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");	1833	LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");
1875	where = where->head;	1834	where = where->head;
1876	}	1835	}
		1836
1877	if (op->more)	1837	if (op->more)
1878	{	1838	{
1879	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1839	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1880	return op;	1840	return op;
1881	}	1841	}
		1842
1882	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1843	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1883	CLEAR_FLAG (op, FLAG_REMOVED);	1844	CLEAR_FLAG (op, FLAG_REMOVED);
1884	if (op->nrof)	1845	if (op->nrof)
1885	{	1846	{
1886	for (tmp = where->inv; tmp != NULL; tmp = tmp->below)	1847	for (tmp = where->inv; tmp != NULL; tmp = tmp->below)
…		…
1971	*/	1932	*/
1972		1933
1973	int	1934	int
1974	check_move_on (object *op, object *originator)	1935	check_move_on (object *op, object *originator)
1975	{	1936	{
1976	object *	1937	object *tmp;
1977	tmp;	1938	maptile *m = op->map;
1978	tag_t
1979	tag;
1980	mapstruct *
1981	m = op->map;
1982	int
1983	x = op->x, y = op->y;	1939	int x = op->x, y = op->y;
1984	MoveType	1940
1985	move_on,	1941	MoveType move_on, move_slow, move_block;
1986	move_slow,
1987	move_block;
1988		1942
1989	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1943	if (QUERY_FLAG (op, FLAG_NO_APPLY))
1990	return 0;	1944	return 0;
1991
1992	tag = op->count;
1993		1945
1994	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1946	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
1995	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1947	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
1996	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1948	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1997		1949
…		…
2022	* we don't need to check all of them.	1974	* we don't need to check all of them.
2023	*/	1975	*/
2024	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))	1976	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
2025	break;	1977	break;
2026	}	1978	}
		1979
2027	for (; tmp != NULL; tmp = tmp->below)	1980	for (; tmp; tmp = tmp->below)
2028	{	1981	{
2029	if (tmp == op)	1982	if (tmp == op)
2030	continue; /* Can't apply yourself */	1983	continue; /* Can't apply yourself */
2031		1984
2032	/* Check to see if one of the movement types should be slowed down.	1985	/* Check to see if one of the movement types should be slowed down.
…		…
2040	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1993	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
2041	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1994	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
2042	{	1995	{
2043		1996
2044	float	1997	float
2045	diff;
2046
2047	diff = tmp->move_slow_penalty * FABS (op->speed);	1998	diff = tmp->move_slow_penalty * FABS (op->speed);
		1999
2048	if (op->type == PLAYER)	2000	if (op->type == PLAYER)
2049	{
2050	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	2001	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
2051	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	2002	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
2052	{
2053	diff /= 4.0;	2003	diff /= 4.0;
2054	}	2004
2055	}
2056	op->speed_left -= diff;	2005	op->speed_left -= diff;
2057	}	2006	}
2058	}	2007	}
2059		2008
2060	/* Basically same logic as above, except now for actual apply. */	2009	/* Basically same logic as above, except now for actual apply. */
2061	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||	2010	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
2062	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))	2011	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
2063	{	2012	{
2064
2065	move_apply (tmp, op, originator);	2013	move_apply (tmp, op, originator);
		2014
2066	if (was_destroyed (op, tag))	2015	if (op->destroyed ())
2067	return 1;	2016	return 1;
2068		2017
2069	/* what the person/creature stepped onto has moved the object	2018	/* what the person/creature stepped onto has moved the object
2070	* someplace new. Don't process any further - if we did,	2019	* someplace new. Don't process any further - if we did,
2071	* have a feeling strange problems would result.	2020	* have a feeling strange problems would result.
2072	*/	2021	*/
2073	if (op->map != m || op->x != x || op->y != y)	2022	if (op->map != m || op->x != x || op->y != y)
2074	return 0;	2023	return 0;
2075	}	2024	}
2076	}	2025	}
		2026
2077	return 0;	2027	return 0;
2078	}	2028	}
2079		2029
2080	/*	2030	/*
2081	* present_arch(arch, map, x, y) searches for any objects with	2031	* present_arch(arch, map, x, y) searches for any objects with
2082	* a matching archetype at the given map and coordinates.	2032	* a matching archetype at the given map and coordinates.
2083	* The first matching object is returned, or NULL if none.	2033	* The first matching object is returned, or NULL if none.
2084	*/	2034	*/
2085		2035
2086	object *	2036	object *
2087	present_arch (const archetype *at, mapstruct *m, int x, int y)	2037	present_arch (const archetype *at, maptile *m, int x, int y)
2088	{	2038	{
2089	object *	2039	object *
2090	tmp;	2040	tmp;
2091		2041
2092	if (m == NULL || out_of_map (m, x, y))	2042	if (m == NULL || out_of_map (m, x, y))
…		…
2105	* a matching type variable at the given map and coordinates.	2055	* a matching type variable at the given map and coordinates.
2106	* The first matching object is returned, or NULL if none.	2056	* The first matching object is returned, or NULL if none.
2107	*/	2057	*/
2108		2058
2109	object *	2059	object *
2110	present (unsigned char type, mapstruct *m, int x, int y)	2060	present (unsigned char type, maptile *m, int x, int y)
2111	{	2061	{
2112	object *	2062	object *
2113	tmp;	2063	tmp;
2114		2064
2115	if (out_of_map (m, x, y))	2065	if (out_of_map (m, x, y))
…		…
2255	* the archetype because that isn't correct if the monster has been	2205	* the archetype because that isn't correct if the monster has been
2256	* customized, changed states, etc.	2206	* customized, changed states, etc.
2257	*/	2207	*/
2258		2208
2259	int	2209	int
2260	find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop)	2210	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2261	{	2211	{
2262	int	2212	int
2263	i,	2213	i,
2264	index = 0, flag;	2214	index = 0, flag;
2265	static int	2215	static int
…		…
2286	return -1;	2236	return -1;
2287	return altern[RANDOM () % index];	2237	return altern[RANDOM () % index];
2288	}	2238	}
2289		2239
2290	/*	2240	/*
2291	* find_first_free_spot(archetype, mapstruct, x, y) works like	2241	* find_first_free_spot(archetype, maptile, x, y) works like
2292	* find_free_spot(), but it will search max number of squares.	2242	* find_free_spot(), but it will search max number of squares.
2293	* But it will return the first available spot, not a random choice.	2243	* But it will return the first available spot, not a random choice.
2294	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2244	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2295	*/	2245	*/
2296		2246
2297	int	2247	int
2298	find_first_free_spot (const object *ob, mapstruct *m, int x, int y)	2248	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2299	{	2249	{
2300	int	2250	int
2301	i;	2251	i;
2302		2252
2303	for (i = 0; i < SIZEOFFREE; i++)	2253	for (i = 0; i < SIZEOFFREE; i++)
…		…
2367	* because we have to know what movement the thing looking to move	2317	* because we have to know what movement the thing looking to move
2368	* there is capable of.	2318	* there is capable of.
2369	*/	2319	*/
2370		2320
2371	int	2321	int
2372	find_dir (mapstruct *m, int x, int y, object *exclude)	2322	find_dir (maptile *m, int x, int y, object *exclude)
2373	{	2323	{
2374	int	2324	int
2375	i,	2325	i,
2376	max = SIZEOFFREE, mflags;	2326	max = SIZEOFFREE, mflags;
2377	sint16	2327
2378	nx,	2328	sint16 nx, ny;
2379	ny;
2380	object *	2329	object *
2381	tmp;	2330	tmp;
2382	mapstruct *	2331	maptile *
2383	mp;	2332	mp;
2384	MoveType	2333
2385	blocked,	2334	MoveType blocked, move_type;
2386	move_type;
2387		2335
2388	if (exclude && exclude->head)	2336	if (exclude && exclude->head)
2389	{	2337	{
2390	exclude = exclude->head;	2338	exclude = exclude->head;
2391	move_type = exclude->move_type;	2339	move_type = exclude->move_type;
…		…
2596	* Modified to be map tile aware -.MSW	2544	* Modified to be map tile aware -.MSW
2597	*/	2545	*/
2598		2546
2599		2547
2600	int	2548	int
2601	can_see_monsterP (mapstruct *m, int x, int y, int dir)	2549	can_see_monsterP (maptile *m, int x, int y, int dir)
2602	{	2550	{
2603	sint16	2551	sint16 dx, dy;
2604	dx,
2605	dy;
2606	int	2552	int
2607	mflags;	2553	mflags;
2608		2554
2609	if (dir < 0)	2555	if (dir < 0)
2610	return 0; /* exit condition: invalid direction */	2556	return 0; /* exit condition: invalid direction */
…		…
2688	if (prev)	2634	if (prev)
2689	prev->more = tmp;	2635	prev->more = tmp;
2690	prev = tmp;	2636	prev = tmp;
2691	}	2637	}
2692		2638
2693	/*** copy inventory ***/
2694	for (item = src->inv; item; item = item->below)	2639	for (item = src->inv; item; item = item->below)
2695	{
2696	(void) insert_ob_in_ob (object_create_clone (item), dst);	2640	insert_ob_in_ob (object_create_clone (item), dst);
2697	}
2698		2641
2699	return dst;	2642	return dst;
2700	}	2643	}
2701		2644
2702	/* return true if the object was destroyed, 0 otherwise */
2703	int
2704	was_destroyed (const object *op, tag_t old_tag)
2705	{
2706	/* checking for FLAG_FREED isn't necessary, but makes this function more
2707	* robust */
2708	return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED);
2709	}
2710
2711	/* GROS - Creates an object using a string representing its content. */	2645	/* GROS - Creates an object using a string representing its content. */
2712
2713	/* Basically, we save the content of the string to a temp file, then call */	2646	/* Basically, we save the content of the string to a temp file, then call */
2714
2715	/* load_object on it. I admit it is a highly inefficient way to make things, */	2647	/* load_object on it. I admit it is a highly inefficient way to make things, */
2716
2717	/* but it was simple to make and allows reusing the load_object function. */	2648	/* but it was simple to make and allows reusing the load_object function. */
2718
2719	/* Remember not to use load_object_str in a time-critical situation. */	2649	/* Remember not to use load_object_str in a time-critical situation. */
2720
2721	/* Also remember that multiparts objects are not supported for now. */	2650	/* Also remember that multiparts objects are not supported for now. */
2722		2651
2723	object *	2652	object *
2724	load_object_str (const char *obstr)	2653	load_object_str (const char *obstr)
2725	{	2654	{
2726	object *	2655	object *op;
2727	op;
2728	char
2729	filename[MAX_BUF];	2656	char filename[MAX_BUF];
2730		2657
2731	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);	2658	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2732		2659
2733	FILE *
2734	tempfile = fopen (filename, "w");	2660	FILE *tempfile = fopen (filename, "w");
2735		2661
2736	if (tempfile == NULL)	2662	if (tempfile == NULL)
2737	{	2663	{
2738	LOG (llevError, "Error - Unable to access load object temp file\n");	2664	LOG (llevError, "Error - Unable to access load object temp file\n");
2739	return NULL;	2665	return NULL;
2740	};	2666	}
		2667
2741	fprintf (tempfile, obstr);	2668	fprintf (tempfile, obstr);
2742	fclose (tempfile);	2669	fclose (tempfile);
2743		2670
2744	op = get_object ();	2671	op = get_object ();
2745		2672
2746	object_thawer	2673	object_thawer thawer (filename);
2747	thawer (filename);
2748		2674
2749	if (thawer)	2675	if (thawer)
2750	load_object (thawer, op, 0);	2676	load_object (thawer, op, 0);
2751		2677
2752	LOG (llevDebug, " load str completed, object=%s\n", &op->name);	2678	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
…		…
2760	* returns NULL if no match.	2686	* returns NULL if no match.
2761	*/	2687	*/
2762	object *	2688	object *
2763	find_obj_by_type_subtype (const object *who, int type, int subtype)	2689	find_obj_by_type_subtype (const object *who, int type, int subtype)
2764	{	2690	{
2765	object *	2691	object *tmp;
2766	tmp;
2767		2692
2768	for (tmp = who->inv; tmp; tmp = tmp->below)	2693	for (tmp = who->inv; tmp; tmp = tmp->below)
2769	if (tmp->type == type && tmp->subtype == subtype)	2694	if (tmp->type == type && tmp->subtype == subtype)
2770	return tmp;	2695	return tmp;
2771		2696
…		…
2779	* do the desired thing.	2704	* do the desired thing.
2780	*/	2705	*/
2781	key_value *	2706	key_value *
2782	get_ob_key_link (const object *ob, const char *key)	2707	get_ob_key_link (const object *ob, const char *key)
2783	{	2708	{
2784	key_value *	2709	key_value *link;
2785	link;
2786		2710
2787	for (link = ob->key_values; link != NULL; link = link->next)	2711	for (link = ob->key_values; link != NULL; link = link->next)
2788	{
2789	if (link->key == key)	2712	if (link->key == key)
2790	{
2791	return link;	2713	return link;
2792	}
2793	}
2794		2714
2795	return NULL;	2715	return NULL;
2796	}	2716	}
2797		2717
2798	/*	2718	/*
…		…
2803	* The returned string is shared.	2723	* The returned string is shared.
2804	*/	2724	*/
2805	const char *	2725	const char *
2806	get_ob_key_value (const object *op, const char *const key)	2726	get_ob_key_value (const object *op, const char *const key)
2807	{	2727	{
2808	key_value *	2728	key_value *link;
2809	link;	2729	shstr_cmp canonical_key (key);
2810	const char *
2811	canonical_key;
2812		2730
2813	canonical_key = shstr::find (key);
2814
2815	if (canonical_key == NULL)	2731	if (!canonical_key)
2816	{	2732	{
2817	/* 1. There being a field named key on any object	2733	/* 1. There being a field named key on any object
2818	* implies there'd be a shared string to find.	2734	* implies there'd be a shared string to find.
2819	* 2. Since there isn't, no object has this field.	2735	* 2. Since there isn't, no object has this field.
2820	* 3. Therefore, *this* object doesn't have this field.	2736	* 3. Therefore, *this* object doesn't have this field.
2821	*/	2737	*/
2822	return NULL;	2738	return 0;
2823	}	2739	}
2824		2740
2825	/* This is copied from get_ob_key_link() above -	2741	/* This is copied from get_ob_key_link() above -
2826	* only 4 lines, and saves the function call overhead.	2742	* only 4 lines, and saves the function call overhead.
2827	*/	2743	*/
2828	for (link = op->key_values; link != NULL; link = link->next)	2744	for (link = op->key_values; link; link = link->next)
2829	{
2830	if (link->key == canonical_key)	2745	if (link->key == canonical_key)
2831	{
2832	return link->value;	2746	return link->value;
2833	}	2747
2834	}
2835	return NULL;	2748	return 0;
2836	}	2749	}
2837		2750
2838		2751
2839	/*	2752	/*
2840	* Updates the canonical_key in op to value.	2753	* Updates the canonical_key in op to value.
…		…
2876	if (last)	2789	if (last)
2877	last->next = field->next;	2790	last->next = field->next;
2878	else	2791	else
2879	op->key_values = field->next;	2792	op->key_values = field->next;
2880		2793
2881	delete
2882	field;	2794	delete field;
2883	}	2795	}
2884	}	2796	}
2885	return TRUE;	2797	return TRUE;
2886	}	2798	}
2887	/* IF we get here, key doesn't exist */	2799	/* IF we get here, key doesn't exist */
…		…
2922	* Returns TRUE on success.	2834	* Returns TRUE on success.
2923	*/	2835	*/
2924	int	2836	int
2925	set_ob_key_value (object *op, const char *key, const char *value, int add_key)	2837	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2926	{	2838	{
2927	shstr
2928	key_ (key);	2839	shstr key_ (key);
2929		2840
2930	return set_ob_key_value_s (op, key_, value, add_key);	2841	return set_ob_key_value_s (op, key_, value, add_key);
2931	}	2842	}
		2843
		2844	object::depth_iterator::depth_iterator (object *container)
		2845	: iterator_base (container)
		2846	{
		2847	while (item->inv)
		2848	item = item->inv;
		2849	}
		2850
		2851	void
		2852	object::depth_iterator::next ()
		2853	{
		2854	if (item->below)
		2855	{
		2856	item = item->below;
		2857
		2858	while (item->inv)
		2859	item = item->inv;
		2860	}
		2861	else
		2862	item = item->env;
		2863	}
		2864
		2865	// return a suitable string describing an objetc in enough detail to find it
		2866	const char *
		2867	object::debug_desc (char *info) const
		2868	{
		2869	char info2[256 * 3];
		2870	char *p = info;
		2871
		2872	p += snprintf (p, 256, "%d=\"%s%s%s\"",
		2873	count,
		2874	&name,
		2875	title ? " " : "",
		2876	title ? (const char *)title : "");
		2877
		2878	if (env)
		2879	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
		2880
		2881	if (map)
		2882	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);
		2883
		2884	return info;
		2885	}
		2886
		2887	const char *
		2888	object::debug_desc () const
		2889	{
		2890	static char info[256 * 3];
		2891	return debug_desc (info);
		2892	}
		2893

Diff Legend

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