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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.29 by root, Mon Sep 11 12:38:36 2006 UTC vs.
Revision 1.52 by root, Wed Sep 27 00:36:08 2006 UTC

…		…
1
2	/*	1	/*
3	CrossFire, A Multiplayer game for X-windows	2	CrossFire, A Multiplayer game for X-windows
4		3
5	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team
6	Copyright (C) 1992 Frank Tore Johansen	5	Copyright (C) 1992 Frank Tore Johansen
17		16
18	You should have received a copy of the GNU General Public License	17	You should have received a copy of the GNU General Public License
19	along with this program; if not, write to the Free Software	18	along with this program; if not, write to the Free Software
20	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21		20
22	The authors can be reached via e-mail at crossfire-devel@real-time.com	21	The authors can be reached via e-mail at <crossfire@schmorp.de>
23	*/	22	*/
24		23
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
27	variable. */	26	variable. */
…		…
29	#include <stdio.h>	28	#include <stdio.h>
30	#include <sys/types.h>	29	#include <sys/types.h>
31	#include <sys/uio.h>	30	#include <sys/uio.h>
32	#include <object.h>	31	#include <object.h>
33	#include <funcpoint.h>	32	#include <funcpoint.h>
34	#include <skills.h>
35	#include <loader.h>	33	#include <loader.h>
36		34
37	int nrofallocobjects = 0;	35	int nrofallocobjects = 0;
		36	static UUID uuid;
		37	const uint64 UUID_SKIP = 1<<19;
38		38
39	object objects; / Pointer to the list of used objects */
40	object active_objects; / List of active objects that need to be processed */	39	object active_objects; / List of active objects that need to be processed */
41		40
42	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	41	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
43	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	42	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
44	};	43	};
…		…
50	};	49	};
51	int freedir[SIZEOFFREE] = {	50	int freedir[SIZEOFFREE] = {
52	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	51	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
53	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	52	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
54	};	53	};
		54
		55	static void
		56	write_uuid (void)
		57	{
		58	char filename1[MAX_BUF], filename2[MAX_BUF];
		59
		60	sprintf (filename1, "%s/uuid", settings.localdir);
		61	sprintf (filename2, "%s/uuid~", settings.localdir);
		62
		63	FILE *fp;
		64
		65	if (!(fp = fopen (filename2, "w")))
		66	{
		67	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
		68	return;
		69	}
		70
		71	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
		72	fclose (fp);
		73	rename (filename2, filename1);
		74	}
		75
		76	static void
		77	read_uuid (void)
		78	{
		79	char filename[MAX_BUF];
		80
		81	sprintf (filename, "%s/uuid", settings.localdir);
		82
		83	FILE *fp;
		84
		85	if (!(fp = fopen (filename, "r")))
		86	{
		87	if (errno == ENOENT)
		88	{
		89	LOG (llevInfo, "RESET uid to 1\n");
		90	uuid.seq = 0;
		91	write_uuid ();
		92	return;
		93	}
		94
		95	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
		96	_exit (1);
		97	}
		98
		99	int version;
		100	unsigned long long uid;
		101	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) \|\| version != 1)
		102	{
		103	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);
		104	_exit (1);
		105	}
		106
		107	uuid.seq = uid;
		108	write_uuid ();
		109	LOG (llevDebug, "read UID: %lld\n", uid);
		110	fclose (fp);
		111	}
		112
		113	UUID
		114	gen_uuid ()
		115	{
		116	UUID uid;
		117
		118	uid.seq = ++uuid.seq;
		119
		120	if (!(uuid.seq & (UUID_SKIP - 1)))
		121	write_uuid ();
		122
		123	return uid;
		124	}
		125
		126	void
		127	init_uuid ()
		128	{
		129	read_uuid ();
		130	}
55		131
56	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	132	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
57	static int	133	static int
58	compare_ob_value_lists_one (const object wants, const object has)	134	compare_ob_value_lists_one (const object wants, const object has)
59	{	135	{
…		…
255	{	331	{
256	if (inv->inv)	332	if (inv->inv)
257	sum_weight (inv);	333	sum_weight (inv);
258	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
259	}	335	}
		336
260	if (op->type == CONTAINER && op->stats.Str)	337	if (op->type == CONTAINER && op->stats.Str)
261	sum = (sum * (100 - op->stats.Str)) / 100;	338	sum = (sum * (100 - op->stats.Str)) / 100;
		339
262	if (op->carrying != sum)	340	if (op->carrying != sum)
263	op->carrying = sum;	341	op->carrying = sum;
		342
264	return sum;	343	return sum;
265	}	344	}
266		345
267	/**	346	/**
268	* Return the outermost environment object for a given object.	347	* Return the outermost environment object for a given object.
…		…
366	void	445	void
367	dump_all_objects (void)	446	dump_all_objects (void)
368	{	447	{
369	object *op;	448	object *op;
370		449
371	for (op = objects; op != NULL; op = op->next)	450	for (op = object::first; op != NULL; op = op->next)
372	{	451	{
373	dump_object (op);	452	dump_object (op);
374	fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg);	453	fprintf (logfile, "Object %s\n", errmsg);
375	}	454	}
376	}	455	}
377		456
378	/*	457	/*
379	* 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
…		…
402	object *	481	object *
403	find_object (tag_t i)	482	find_object (tag_t i)
404	{	483	{
405	object *op;	484	object *op;
406		485
407	for (op = objects; op != NULL; op = op->next)	486	for (op = object::first; op != NULL; op = op->next)
408	if (op->count == i)	487	if (op->count == i)
409	break;	488	break;
		489
410	return op;	490	return op;
411	}	491	}
412		492
413	/*	493	/*
414	* 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.
…		…
417	*/	497	*/
418		498
419	object *	499	object *
420	find_object_name (const char *str)	500	find_object_name (const char *str)
421	{	501	{
422	const char *name = shstr::find (str);	502	shstr_cmp str_ (str);
423	object *op;	503	object *op;
424		504
425	for (op = objects; op != NULL; op = op->next)	505	for (op = object::first; op != NULL; op = op->next)
426	if (&op->name == name)	506	if (op->name == str_)
427	break;	507	break;
428		508
429	return op;	509	return op;
430	}	510	}
431		511
…		…
434	{	514	{
435	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);	515	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
436	}	516	}
437		517
438	/*	518	/*
439	* Returns the object which this object marks as being the owner.
440	* A id-scheme is used to avoid pointing to objects which have been
441	* freed and are now reused. If this is detected, the owner is
442	* set to NULL, and NULL is returned.
443	* Changed 2004-02-12 - if the player is setting at the play again
444	* prompt, he is removed, and we don't want to treat him as an owner of
445	* anything, so check removed flag. I don't expect that this should break
446	* anything - once an object is removed, it is basically dead anyways.
447	*/
448
449	object *
450	get_owner (object *op)
451	{
452	if (op->owner == NULL)
453	return NULL;
454
455	if (!QUERY_FLAG (op->owner, FLAG_FREED) && !QUERY_FLAG (op->owner, FLAG_REMOVED) && op->owner->count == op->ownercount)
456	return op->owner;
457
458	op->owner = NULL;
459	op->ownercount = 0;
460	return NULL;
461	}
462
463	void
464	clear_owner (object *op)
465	{
466	if (!op)
467	return;
468
469	if (op->owner && op->ownercount == op->owner->count)
470	op->owner->refcount--;
471
472	op->owner = NULL;
473	op->ownercount = 0;
474	}
475
476	/*
477	* Sets the owner and sets the skill and exp pointers to owner's current	519	* Sets the owner and sets the skill and exp pointers to owner's current
478	* skill and experience objects.	520	* skill and experience objects.
479	*/	521	*/
480	void	522	void
481	set_owner (object op, object owner)	523	object::set_owner (object *owner)
482	{	524	{
483	if (owner == NULL \|\| op == NULL)	525	if (!owner)
484	return;	526	return;
485		527
486	/* next line added to allow objects which own objects */	528	/* next line added to allow objects which own objects */
487	/* 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
488	* with the fireball owning a poison cloud which then owned the	530	* with the fireball owning a poison cloud which then owned the
489	* 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
490	* freed and then another object replacing it. Since the ownercounts	532	* freed and then another object replacing it. Since the ownercounts
491	* didn't match, this check is valid and I believe that cause is valid.	533	* didn't match, this check is valid and I believe that cause is valid.
492	*/	534	*/
493	while (owner->owner && owner != owner->owner && owner->ownercount == owner->owner->count)	535	while (owner->owner)
494	owner = owner->owner;	536	owner = owner->owner;
495		537
496	/* IF the owner still has an owner, we did not resolve to a final owner.
497	* so lets not add to that.
498	*/
499	if (owner->owner)
500	return;
501
502	op->owner = owner;	538	this->owner = owner;
503
504	op->ownercount = owner->count;
505	owner->refcount++;
506	}
507
508	/* Set the owner to clone's current owner and set the skill and experience
509	* objects to clone's objects (typically those objects that where the owner's
510	* current skill and experience objects at the time when clone's owner was
511	* set - not the owner's current skill and experience objects).
512	*
513	* Use this function if player created an object (e.g. fire bullet, swarm
514	* spell), and this object creates further objects whose kills should be
515	* accounted for the player's original skill, even if player has changed
516	* skills meanwhile.
517	*/
518	void
519	copy_owner (object op, object clone)
520	{
521	object *owner = get_owner (clone);
522
523	if (owner == NULL)
524	{
525	/* players don't have owners - they own themselves. Update
526	* as appropriate.
527	*/
528	if (clone->type == PLAYER)
529	owner = clone;
530	else
531	return;
532	}
533
534	set_owner (op, owner);
535	}	539	}
536		540
537	/* Zero the key_values on op, decrementing the shared-string	541	/* Zero the key_values on op, decrementing the shared-string
538	* refcounts and freeing the links.	542	* refcounts and freeing the links.
539	*/	543	*/
…		…
555	{	559	{
556	attachable_base::clear ();	560	attachable_base::clear ();
557		561
558	free_key_values (this);	562	free_key_values (this);
559		563
560	clear_owner (this);	564	owner = 0;
561
562	name = 0;	565	name = 0;
563	name_pl = 0;	566	name_pl = 0;
564	title = 0;	567	title = 0;
565	race = 0;	568	race = 0;
566	slaying = 0;	569	slaying = 0;
567	skill = 0;	570	skill = 0;
568	msg = 0;	571	msg = 0;
569	lore = 0;	572	lore = 0;
570	custom_name = 0;	573	custom_name = 0;
571	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;
572		586
573	memset (static_cast < object_pod * >(this), 0, sizeof (object_pod));	587	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
574		588
575	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;
576	}	598	}
577		599
578	void object::clone (object *destination)	600	void object::clone (object *destination)
579	{	601	{
580	(object_copy ) destination = *this;	602	(object_copy )destination = *this;
581	(object_pod ) destination = *this;	603	(object_pod )destination = *this;
582		604
583	if (self \|\| cb)	605	if (self \|\| cb)
584	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));	606	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
585	}
586
587	/*
588	* clear_object() frees everything allocated by an object, and also
589	* clears all variables and flags to default settings.
590	*/
591
592	void
593	clear_object (object *op)
594	{
595	op->clear ();
596
597	op->contr = NULL;
598	op->below = NULL;
599	op->above = NULL;
600	op->inv = NULL;
601	op->container = NULL;
602	op->env = NULL;
603	op->more = NULL;
604	op->head = NULL;
605	op->map = NULL;
606	op->refcount = 0;
607	op->active_next = NULL;
608	op->active_prev = NULL;
609	/* What is not cleared is next, prev, and count */
610
611	op->expmul = 1.0;
612	op->face = blank_face;
613	op->attacked_by_count = -1;
614
615	if (settings.casting_time)
616	op->casting_time = -1;
617	}	607	}
618		608
619	/*	609	/*
620	* copy object first frees everything allocated by the second object,	610	* copy object first frees everything allocated by the second object,
621	* 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
622	* object, allocating what needs to be allocated. Basically, any	612	* object, allocating what needs to be allocated. Basically, any
623	* 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,
624	* 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
625	* will point at garbage.	615	* will point at garbage.
626	*/	616	*/
627
628	void	617	void
629	copy_object (object op2, object op)	618	copy_object (object op2, object op)
630	{	619	{
631	bool is_freed = QUERY_FLAG (op, FLAG_FREED);	620	bool is_freed = QUERY_FLAG (op, FLAG_FREED);
632	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);	621	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);
…		…
692	/*	681	/*
693	* 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
694	* 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.
695	* 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.
696	*/	685	*/
697
698	void	686	void
699	update_ob_speed (object *op)	687	update_ob_speed (object *op)
700	{	688	{
701	extern int arch_init;	689	extern int arch_init;
702		690
…		…
711	abort ();	699	abort ();
712	#else	700	#else
713	op->speed = 0;	701	op->speed = 0;
714	#endif	702	#endif
715	}	703	}
		704
716	if (arch_init)	705	if (arch_init)
717	{
718	return;	706	return;
719	}	707
720	if (FABS (op->speed) > MIN_ACTIVE_SPEED)	708	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
721	{	709	{
722	/* If already on active list, don't do anything */	710	/* If already on active list, don't do anything */
723	if (op->active_next \|\| op->active_prev \|\| op == active_objects)	711	if (op->active_next \|\| op->active_prev \|\| op == active_objects)
724	return;	712	return;
725		713
726	/* process_events() expects us to insert the object at the beginning	714	/* process_events() expects us to insert the object at the beginning
727	* of the list. */	715	* of the list. */
728	op->active_next = active_objects;	716	op->active_next = active_objects;
		717
729	if (op->active_next != NULL)	718	if (op->active_next != NULL)
730	op->active_next->active_prev = op;	719	op->active_next->active_prev = op;
		720
731	active_objects = op;	721	active_objects = op;
732	}	722	}
733	else	723	else
734	{	724	{
735	/* If not on the active list, nothing needs to be done */	725	/* If not on the active list, nothing needs to be done */
…		…
737	return;	727	return;
738		728
739	if (op->active_prev == NULL)	729	if (op->active_prev == NULL)
740	{	730	{
741	active_objects = op->active_next;	731	active_objects = op->active_next;
		732
742	if (op->active_next != NULL)	733	if (op->active_next != NULL)
743	op->active_next->active_prev = NULL;	734	op->active_next->active_prev = NULL;
744	}	735	}
745	else	736	else
746	{	737	{
747	op->active_prev->active_next = op->active_next;	738	op->active_prev->active_next = op->active_next;
		739
748	if (op->active_next)	740	if (op->active_next)
749	op->active_next->active_prev = op->active_prev;	741	op->active_next->active_prev = op->active_prev;
750	}	742	}
		743
751	op->active_next = NULL;	744	op->active_next = NULL;
752	op->active_prev = NULL;	745	op->active_prev = NULL;
753	}	746	}
754	}	747	}
755		748
…		…
901		894
902	if (op->more != NULL)	895	if (op->more != NULL)
903	update_object (op->more, action);	896	update_object (op->more, action);
904	}	897	}
905		898
906	static unordered_vector < object *>mortals;	899	object::vector object::mortals;
907	static	900	object::vector object::objects; // not yet used
908	std::vector < object *>	901	object *object::first;
909	freed;
910		902
911	void object::free_mortals ()	903	void object::free_mortals ()
912	{	904	{
913	for (unordered_vector < object *>::iterator i = mortals.begin (); i != mortals.end ();)	905	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
914	if (!(*i)->refcount)	906	if ((*i)->refcnt)
		907	++i; // further delay freeing
		908	else
915	{	909	{
916	freed.push_back (*i);	910	delete *i;
917	mortals.erase (i);	911	mortals.erase (i);
918	}	912	}
919	else	913
920	++i;	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	}
921	}	921	}
922		922
923	object::object ()	923	object::object ()
924	{	924	{
925	SET_FLAG (this, FLAG_REMOVED);	925	SET_FLAG (this, FLAG_REMOVED);
926		926
927	expmul = 1.0;	927	expmul = 1.0;
928	face = blank_face;	928	face = blank_face;
929	attacked_by_count = -1;
930	}	929	}
931		930
932	object::~object ()	931	object::~object ()
933	{	932	{
934	free_key_values (this);	933	free_key_values (this);
935	}	934	}
936		935
937	void object::link ()	936	void object::link ()
938	{	937	{
939	count = ++ob_count;	938	count = ++ob_count;
		939	uuid = gen_uuid ();
940		940
941	prev = 0;	941	prev = 0;
942	next = objects;	942	next = object::first;
943		943
944	if (objects)	944	if (object::first)
945	objects->prev = this;	945	object::first->prev = this;
946		946
947	objects = this;	947	object::first = this;
948	}	948	}
949		949
950	void object::unlink ()	950	void object::unlink ()
951	{	951	{
952	count = 0;	952	if (this == object::first)
		953	object::first = next;
953		954
954	/* Remove this object from the list of used objects */	955	/* Remove this object from the list of used objects */
955	if (prev)
956	{
957	prev->next = next;	956	if (prev) prev->next = next;
		957	if (next) next->prev = prev;
		958
958	prev = 0;	959	prev = 0;
959	}
960
961	if (next)
962	{
963	next->prev = prev;
964	next = 0;	960	next = 0;
965	}
966
967	if (this == objects)
968	objects = next;
969	}	961	}
970		962
971	object *object::create ()	963	object *object::create ()
972	{	964	{
973	object *
974	op;
975
976	if (freed.empty ())
977	op = new object;	965	object *op = new object;
978
979	else
980	{
981	// highly annoying, but the only way to get it stable right now
982	op = freed.back ();
983	freed.pop_back ();
984	op->~object ();
985	new ((void *) op) object;
986	}
987
988	op->link ();	966	op->link ();
989	return op;	967	return op;
990	}	968	}
991		969
992	/*	970	/*
…		…
994	* 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
995	* free objects. The IS_FREED() flag is set in the object.	973	* free objects. The IS_FREED() flag is set in the object.
996	* The object must have been removed by remove_ob() first for	974	* The object must have been removed by remove_ob() first for
997	* this function to succeed.	975	* this function to succeed.
998	*	976	*
999	* 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
1000	* inventory to the ground.	978	* inventory to the ground.
1001	*/	979	*/
1002	void object::free (bool free_inventory)	980	void object::destroy (bool destroy_inventory)
1003	{	981	{
1004	if (QUERY_FLAG (this, FLAG_FREED))	982	if (QUERY_FLAG (this, FLAG_FREED))
1005	return;	983	return;
1006		984
		985	if (QUERY_FLAG (this, FLAG_FRIENDLY))
		986	remove_friendly_object (this);
		987
1007	if (!QUERY_FLAG (this, FLAG_REMOVED))	988	if (!QUERY_FLAG (this, FLAG_REMOVED))
1008	remove_ob (this);	989	remove_ob (this);
1009		990
1010	if (QUERY_FLAG (this, FLAG_FRIENDLY))
1011	remove_friendly_object (this);
1012
1013	SET_FLAG (this, FLAG_FREED);	991	SET_FLAG (this, FLAG_FREED);
1014		992
1015	if (more)	993	if (more)
1016	{	994	{
1017	more->free (free_inventory);	995	more->destroy (destroy_inventory);
1018	more = 0;	996	more = 0;
1019	}	997	}
1020		998
1021	if (inv)	999	if (inv)
1022	{	1000	{
1023	/* Only if the space blocks everything do we not process -	1001	/* Only if the space blocks everything do we not process -
1024	* if some form of movement is allowed, let objects	1002	* if some form of movement is allowed, let objects
1025	* drop on that space.	1003	* drop on that space.
1026	*/	1004	*/
1027	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)
1028	{	1006	{
1029	object *op = inv;	1007	object *op = inv;
1030		1008
1031	while (op)	1009	while (op)
1032	{	1010	{
1033	object *tmp = op->below;	1011	object *tmp = op->below;
1034	op->free (free_inventory);	1012	op->destroy (destroy_inventory);
1035	op = tmp;	1013	op = tmp;
1036	}	1014	}
1037	}	1015	}
1038	else	1016	else
1039	{ /* Put objects in inventory onto this space */	1017	{ /* Put objects in inventory onto this space */
…		…
1058	op = tmp;	1036	op = tmp;
1059	}	1037	}
1060	}	1038	}
1061	}	1039	}
1062		1040
1063	clear_owner (this);	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;
1064		1048
1065	/* Remove object from the active list */	1049	/* Remove object from the active list */
1066	speed = 0;	1050	speed = 0;
1067	update_ob_speed (this);	1051	update_ob_speed (this);
1068		1052
…		…
1080	sub_weight (object *op, signed long weight)	1064	sub_weight (object *op, signed long weight)
1081	{	1065	{
1082	while (op != NULL)	1066	while (op != NULL)
1083	{	1067	{
1084	if (op->type == CONTAINER)	1068	if (op->type == CONTAINER)
1085	{
1086	weight = (signed long) (weight * (100 - op->stats.Str) / 100);	1069	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1087	}	1070
1088	op->carrying -= weight;	1071	op->carrying -= weight;
1089	op = op->env;	1072	op = op->env;
1090	}	1073	}
1091	}	1074	}
1092		1075
…		…
1100	*/	1083	*/
1101		1084
1102	void	1085	void
1103	remove_ob (object *op)	1086	remove_ob (object *op)
1104	{	1087	{
		1088	object tmp, last = 0;
1105	object *	1089	object *otmp;
1106	tmp, *
1107	last = NULL;
1108	object *
1109	otmp;
1110		1090
1111	tag_t
1112	tag;
1113	int
1114	check_walk_off;	1091	int check_walk_off;
1115	mapstruct *	1092	maptile *m;
1116	m;
1117		1093
1118	sint16	1094	sint16 x, y;
1119	x,
1120	y;
1121		1095
1122	if (QUERY_FLAG (op, FLAG_REMOVED))	1096	if (QUERY_FLAG (op, FLAG_REMOVED))
1123	return;	1097	return;
1124		1098
1125	SET_FLAG (op, FLAG_REMOVED);	1099	SET_FLAG (op, FLAG_REMOVED);
…		…
1218	op->below = 0;	1192	op->below = 0;
1219		1193
1220	if (op->map->in_memory == MAP_SAVING)	1194	if (op->map->in_memory == MAP_SAVING)
1221	return;	1195	return;
1222		1196
1223	tag = op->count;
1224	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);	1197	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1225		1198
1226	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1199	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1227	{	1200	{
1228	/* No point updating the players look faces if he is the object	1201	/* No point updating the players look faces if he is the object
…		…
1243		1216
1244	tmp->contr->socket.update_look = 1;	1217	tmp->contr->socket.update_look = 1;
1245	}	1218	}
1246		1219
1247	/* See if player moving off should effect something */	1220	/* See if player moving off should effect something */
1248	if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1221	if (check_walk_off
		1222	&& ((op->move_type & tmp->move_off)
		1223	&& (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1249	{	1224	{
1250	move_apply (tmp, op, NULL);	1225	move_apply (tmp, op, NULL);
1251		1226
1252	if (was_destroyed (op, tag))	1227	if (op->destroyed ())
1253	{
1254	LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name);	1228	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1255	}
1256	}	1229	}
1257		1230
1258	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1231	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1259		1232
1260	if (tmp->above == tmp)	1233	if (tmp->above == tmp)
…		…
1288	* This function goes through all objects below and including top, and	1261	* This function goes through all objects below and including top, and
1289	* merges op to the first matching object.	1262	* merges op to the first matching object.
1290	* If top is NULL, it is calculated.	1263	* If top is NULL, it is calculated.
1291	* 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
1292	*/	1265	*/
1293
1294	object *	1266	object *
1295	merge_ob (object op, object top)	1267	merge_ob (object op, object top)
1296	{	1268	{
1297	if (!op->nrof)	1269	if (!op->nrof)
1298	return 0;	1270	return 0;
…		…
1314	free_object (op);	1286	free_object (op);
1315	return top;	1287	return top;
1316	}	1288	}
1317	}	1289	}
1318		1290
1319	return NULL;	1291	return 0;
1320	}	1292	}
1321		1293
1322	/*	1294	/*
1323	* 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
1324	* job preparing multi-part monsters	1296	* job preparing multi-part monsters
1325	*/	1297	*/
1326	object *	1298	object *
1327	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)
1328	{	1300	{
1329	object *tmp;	1301	object *tmp;
1330		1302
1331	if (op->head)	1303	if (op->head)
1332	op = op->head;	1304	op = op->head;
…		…
1360	* NULL if 'op' was destroyed	1332	* NULL if 'op' was destroyed
1361	* just 'op' otherwise	1333	* just 'op' otherwise
1362	*/	1334	*/
1363		1335
1364	object *	1336	object *
1365	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)
1366	{	1338	{
1367	object tmp, top, *floor = NULL;	1339	object tmp, top, *floor = NULL;
1368	sint16 x, y;	1340	sint16 x, y;
1369		1341
1370	if (QUERY_FLAG (op, FLAG_FREED))	1342	if (QUERY_FLAG (op, FLAG_FREED))
…		…
1651	remove_ob (tmp);	1623	remove_ob (tmp);
1652	free_object (tmp);	1624	free_object (tmp);
1653	}	1625	}
1654	}	1626	}
1655		1627
1656	tmp1 = arch_to_object (find_archetype (arch_string));	1628	tmp1 = arch_to_object (archetype::find (arch_string));
1657		1629
1658	tmp1->x = op->x;	1630	tmp1->x = op->x;
1659	tmp1->y = op->y;	1631	tmp1->y = op->y;
1660	insert_ob_in_map (tmp1, op->map, op, 0);	1632	insert_ob_in_map (tmp1, op->map, op, 0);
1661	}	1633	}
…		…
1960	*/	1932	*/
1961		1933
1962	int	1934	int
1963	check_move_on (object op, object originator)	1935	check_move_on (object op, object originator)
1964	{	1936	{
1965	object *	1937	object *tmp;
1966	tmp;	1938	maptile *m = op->map;
1967	tag_t
1968	tag;
1969	mapstruct *
1970	m = op->map;
1971	int
1972	x = op->x, y = op->y;	1939	int x = op->x, y = op->y;
1973		1940
1974	MoveType	1941	MoveType move_on, move_slow, move_block;
1975	move_on,
1976	move_slow,
1977	move_block;
1978		1942
1979	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1943	if (QUERY_FLAG (op, FLAG_NO_APPLY))
1980	return 0;	1944	return 0;
1981
1982	tag = op->count;
1983		1945
1984	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);
1985	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);
1986	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);
1987		1949
…		…
2048	if ((!op->move_type && tmp->move_on & MOVE_WALK) \|\|	2010	if ((!op->move_type && tmp->move_on & MOVE_WALK) \|\|
2049	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))	2011	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
2050	{	2012	{
2051	move_apply (tmp, op, originator);	2013	move_apply (tmp, op, originator);
2052		2014
2053	if (was_destroyed (op, tag))	2015	if (op->destroyed ())
2054	return 1;	2016	return 1;
2055		2017
2056	/* what the person/creature stepped onto has moved the object	2018	/* what the person/creature stepped onto has moved the object
2057	* someplace new. Don't process any further - if we did,	2019	* someplace new. Don't process any further - if we did,
2058	* have a feeling strange problems would result.	2020	* have a feeling strange problems would result.
…		…
2070	* a matching archetype at the given map and coordinates.	2032	* a matching archetype at the given map and coordinates.
2071	* The first matching object is returned, or NULL if none.	2033	* The first matching object is returned, or NULL if none.
2072	*/	2034	*/
2073		2035
2074	object *	2036	object *
2075	present_arch (const archetype at, mapstruct m, int x, int y)	2037	present_arch (const archetype at, maptile m, int x, int y)
2076	{	2038	{
2077	object *	2039	object *
2078	tmp;	2040	tmp;
2079		2041
2080	if (m == NULL \|\| out_of_map (m, x, y))	2042	if (m == NULL \|\| out_of_map (m, x, y))
…		…
2093	* a matching type variable at the given map and coordinates.	2055	* a matching type variable at the given map and coordinates.
2094	* The first matching object is returned, or NULL if none.	2056	* The first matching object is returned, or NULL if none.
2095	*/	2057	*/
2096		2058
2097	object *	2059	object *
2098	present (unsigned char type, mapstruct *m, int x, int y)	2060	present (unsigned char type, maptile *m, int x, int y)
2099	{	2061	{
2100	object *	2062	object *
2101	tmp;	2063	tmp;
2102		2064
2103	if (out_of_map (m, x, y))	2065	if (out_of_map (m, x, y))
…		…
2243	* 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
2244	* customized, changed states, etc.	2206	* customized, changed states, etc.
2245	*/	2207	*/
2246		2208
2247	int	2209	int
2248	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)
2249	{	2211	{
2250	int	2212	int
2251	i,	2213	i,
2252	index = 0, flag;	2214	index = 0, flag;
2253	static int	2215	static int
…		…
2274	return -1;	2236	return -1;
2275	return altern[RANDOM () % index];	2237	return altern[RANDOM () % index];
2276	}	2238	}
2277		2239
2278	/*	2240	/*
2279	* find_first_free_spot(archetype, mapstruct, x, y) works like	2241	* find_first_free_spot(archetype, maptile, x, y) works like
2280	* find_free_spot(), but it will search max number of squares.	2242	* find_free_spot(), but it will search max number of squares.
2281	* 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.
2282	* 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.
2283	*/	2245	*/
2284		2246
2285	int	2247	int
2286	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)
2287	{	2249	{
2288	int	2250	int
2289	i;	2251	i;
2290		2252
2291	for (i = 0; i < SIZEOFFREE; i++)	2253	for (i = 0; i < SIZEOFFREE; i++)
…		…
2355	* 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
2356	* there is capable of.	2318	* there is capable of.
2357	*/	2319	*/
2358		2320
2359	int	2321	int
2360	find_dir (mapstruct m, int x, int y, object exclude)	2322	find_dir (maptile m, int x, int y, object exclude)
2361	{	2323	{
2362	int	2324	int
2363	i,	2325	i,
2364	max = SIZEOFFREE, mflags;	2326	max = SIZEOFFREE, mflags;
2365		2327
2366	sint16 nx, ny;	2328	sint16 nx, ny;
2367	object *	2329	object *
2368	tmp;	2330	tmp;
2369	mapstruct *	2331	maptile *
2370	mp;	2332	mp;
2371		2333
2372	MoveType blocked, move_type;	2334	MoveType blocked, move_type;
2373		2335
2374	if (exclude && exclude->head)	2336	if (exclude && exclude->head)
…		…
2582	* Modified to be map tile aware -.MSW	2544	* Modified to be map tile aware -.MSW
2583	*/	2545	*/
2584		2546
2585		2547
2586	int	2548	int
2587	can_see_monsterP (mapstruct *m, int x, int y, int dir)	2549	can_see_monsterP (maptile *m, int x, int y, int dir)
2588	{	2550	{
2589	sint16 dx, dy;	2551	sint16 dx, dy;
2590	int	2552	int
2591	mflags;	2553	mflags;
2592		2554
…		…
2672	if (prev)	2634	if (prev)
2673	prev->more = tmp;	2635	prev->more = tmp;
2674	prev = tmp;	2636	prev = tmp;
2675	}	2637	}
2676		2638
2677	/* copy inventory */
2678	for (item = src->inv; item; item = item->below)	2639	for (item = src->inv; item; item = item->below)
2679	{
2680	(void) insert_ob_in_ob (object_create_clone (item), dst);	2640	insert_ob_in_ob (object_create_clone (item), dst);
2681	}
2682		2641
2683	return dst;	2642	return dst;
2684	}	2643	}
2685		2644
2686	/* return true if the object was destroyed, 0 otherwise */
2687	int
2688	was_destroyed (const object *op, tag_t old_tag)
2689	{
2690	/* checking for FLAG_FREED isn't necessary, but makes this function more
2691	* robust */
2692	return op->count != old_tag \|\| QUERY_FLAG (op, FLAG_FREED);
2693	}
2694
2695	/* GROS - Creates an object using a string representing its content. */	2645	/* GROS - Creates an object using a string representing its content. */
2696
2697	/* Basically, we save the content of the string to a temp file, then call */	2646	/* Basically, we save the content of the string to a temp file, then call */
2698
2699	/* load_object on it. I admit it is a highly inefficient way to make things, */	2647	/* load_object on it. I admit it is a highly inefficient way to make things, */
2700
2701	/* but it was simple to make and allows reusing the load_object function. */	2648	/* but it was simple to make and allows reusing the load_object function. */
2702
2703	/* Remember not to use load_object_str in a time-critical situation. */	2649	/* Remember not to use load_object_str in a time-critical situation. */
2704
2705	/* Also remember that multiparts objects are not supported for now. */	2650	/* Also remember that multiparts objects are not supported for now. */
2706		2651
2707	object *	2652	object *
2708	load_object_str (const char *obstr)	2653	load_object_str (const char *obstr)
2709	{	2654	{
2710	object *	2655	object *op;
2711	op;
2712	char
2713	filename[MAX_BUF];	2656	char filename[MAX_BUF];
2714		2657
2715	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);	2658	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2716		2659
2717	FILE *
2718	tempfile = fopen (filename, "w");	2660	FILE *tempfile = fopen (filename, "w");
2719		2661
2720	if (tempfile == NULL)	2662	if (tempfile == NULL)
2721	{	2663	{
2722	LOG (llevError, "Error - Unable to access load object temp file\n");	2664	LOG (llevError, "Error - Unable to access load object temp file\n");
2723	return NULL;	2665	return NULL;
2724	};	2666	}
		2667
2725	fprintf (tempfile, obstr);	2668	fprintf (tempfile, obstr);
2726	fclose (tempfile);	2669	fclose (tempfile);
2727		2670
2728	op = get_object ();	2671	op = get_object ();
2729		2672
…		…
2743	* returns NULL if no match.	2686	* returns NULL if no match.
2744	*/	2687	*/
2745	object *	2688	object *
2746	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)
2747	{	2690	{
2748	object *	2691	object *tmp;
2749	tmp;
2750		2692
2751	for (tmp = who->inv; tmp; tmp = tmp->below)	2693	for (tmp = who->inv; tmp; tmp = tmp->below)
2752	if (tmp->type == type && tmp->subtype == subtype)	2694	if (tmp->type == type && tmp->subtype == subtype)
2753	return tmp;	2695	return tmp;
2754		2696
…		…
2762	* do the desired thing.	2704	* do the desired thing.
2763	*/	2705	*/
2764	key_value *	2706	key_value *
2765	get_ob_key_link (const object ob, const char key)	2707	get_ob_key_link (const object ob, const char key)
2766	{	2708	{
2767	key_value *	2709	key_value *link;
2768	link;
2769		2710
2770	for (link = ob->key_values; link != NULL; link = link->next)	2711	for (link = ob->key_values; link != NULL; link = link->next)
2771	{
2772	if (link->key == key)	2712	if (link->key == key)
2773	{
2774	return link;	2713	return link;
2775	}
2776	}
2777		2714
2778	return NULL;	2715	return NULL;
2779	}	2716	}
2780		2717
2781	/*	2718	/*
…		…
2786	* The returned string is shared.	2723	* The returned string is shared.
2787	*/	2724	*/
2788	const char *	2725	const char *
2789	get_ob_key_value (const object op, const char const key)	2726	get_ob_key_value (const object op, const char const key)
2790	{	2727	{
2791	key_value *	2728	key_value *link;
2792	link;	2729	shstr_cmp canonical_key (key);
2793	const char *
2794	canonical_key;
2795		2730
2796	canonical_key = shstr::find (key);
2797
2798	if (canonical_key == NULL)	2731	if (!canonical_key)
2799	{	2732	{
2800	/* 1. There being a field named key on any object	2733	/* 1. There being a field named key on any object
2801	* implies there'd be a shared string to find.	2734	* implies there'd be a shared string to find.
2802	* 2. Since there isn't, no object has this field.	2735	* 2. Since there isn't, no object has this field.
2803	* 3. Therefore, this object doesn't have this field.	2736	* 3. Therefore, this object doesn't have this field.
2804	*/	2737	*/
2805	return NULL;	2738	return 0;
2806	}	2739	}
2807		2740
2808	/* This is copied from get_ob_key_link() above -	2741	/* This is copied from get_ob_key_link() above -
2809	* only 4 lines, and saves the function call overhead.	2742	* only 4 lines, and saves the function call overhead.
2810	*/	2743	*/
2811	for (link = op->key_values; link != NULL; link = link->next)	2744	for (link = op->key_values; link; link = link->next)
2812	{
2813	if (link->key == canonical_key)	2745	if (link->key == canonical_key)
2814	{
2815	return link->value;	2746	return link->value;
2816	}	2747
2817	}
2818	return NULL;	2748	return 0;
2819	}	2749	}
2820		2750
2821		2751
2822	/*	2752	/*
2823	* Updates the canonical_key in op to value.	2753	* Updates the canonical_key in op to value.
…		…
2908	{	2838	{
2909	shstr key_ (key);	2839	shstr key_ (key);
2910		2840
2911	return set_ob_key_value_s (op, key_, value, add_key);	2841	return set_ob_key_value_s (op, key_, value, add_key);
2912	}	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

Comparing deliantra/server/common/object.C (file contents): Revision 1.29 by root, Mon Sep 11 12:38:36 2006 UTC vs. Revision 1.52 by root, Wed Sep 27 00:36:08 2006 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.29 by root, Mon Sep 11 12:38:36 2006 UTC vs.
Revision 1.52 by root, Wed Sep 27 00:36:08 2006 UTC