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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.124 by root, Sat Jan 27 02:19:36 2007 UTC vs.
Revision 1.203 by root, Fri Apr 11 13:59:05 2008 UTC

…		…
1	/*	1	/*
2	* CrossFire, A Multiplayer game for X-windows	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
9	* it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
10	* the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	* (at your option) any later version.	11	* (at your option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
19	* along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21	*	20	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
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>
		33	#include <sproto.h>
34	#include <loader.h>	34	#include <loader.h>
35		35
36	#include <bitset>	36	#include <bitset>
37		37
38	int nrofallocobjects = 0;	38	UUID UUID::cur;
39	static UUID uuid;
40	const uint64 UUID_SKIP = 1<<19;	39	static const uint64 UUID_SKIP = 1<<19;
41		40
42	objectvec objects;	41	objectvec objects;
43	activevec actives;	42	activevec actives;
44		43
45	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,	44	short freearr_x[SIZEOFFREE] = {
		45	0,
		46	0, 1, 1, 1, 0, -1, -1, -1,
		47	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
46	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	48	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
47	};	49	};
48	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	50	short freearr_y[SIZEOFFREE] = {
		51	0,
		52	-1, -1, 0, 1, 1, 1, 0, -1,
		53	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
49	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	54	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
50	};	55	};
51	int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45,	56	int maxfree[SIZEOFFREE] = {
		57	0,
		58	9, 10, 13, 14, 17, 18, 21, 22,
		59	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
52	48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49	60	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
53	};	61	};
54	int freedir[SIZEOFFREE] = {	62	int freedir[SIZEOFFREE] = {
55	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,	63	0,
		64	1, 2, 3, 4, 5, 6, 7, 8,
		65	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
56	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	66	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
57	};	67	};
58		68
59	static void	69	static void
60	write_uuid (void)	70	write_uuid (uval64 skip, bool sync)
61	{	71	{
62	char filename1[MAX_BUF], filename2[MAX_BUF];	72	CALL_BEGIN (2);
63		73	CALL_ARG_SV (newSVval64 (skip));
64	sprintf (filename1, "%s/uuid", settings.localdir);	74	CALL_ARG_SV (boolSV (sync));
65	sprintf (filename2, "%s/uuid~", settings.localdir);	75	CALL_CALL ("cf::write_uuid", G_DISCARD);
66		76	CALL_END;
67	FILE *fp;
68
69	if (!(fp = fopen (filename2, "w")))
70	{
71	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
72	return;
73	}
74
75	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
76	fclose (fp);
77	rename (filename2, filename1);
78	}	77	}
79		78
80	static void	79	static void
81	read_uuid (void)	80	read_uuid (void)
82	{	81	{
…		…
89	if (!(fp = fopen (filename, "r")))	88	if (!(fp = fopen (filename, "r")))
90	{	89	{
91	if (errno == ENOENT)	90	if (errno == ENOENT)
92	{	91	{
93	LOG (llevInfo, "RESET uid to 1\n");	92	LOG (llevInfo, "RESET uid to 1\n");
94	uuid.seq = 0;	93	UUID::cur.seq = 0;
95	write_uuid ();	94	write_uuid (UUID_SKIP, true);
96	return;	95	return;
97	}	96	}
98		97
99	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	98	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100	_exit (1);	99	_exit (1);
101	}	100	}
102		101
103	int version;	102	UUID::BUF buf;
104	unsigned long long uid;	103	buf[0] = 0;
105	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) \|\| version != 1)	104	fgets (buf, sizeof (buf), fp);
		105
		106	if (!UUID::cur.parse (buf))
106	{	107	{
107	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	108	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
108	_exit (1);	109	_exit (1);
109	}	110	}
110		111
111	uuid.seq = uid;	112	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
112	write_uuid ();	113
113	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	114	write_uuid (UUID_SKIP, true);
114	fclose (fp);	115	fclose (fp);
115	}	116	}
116		117
117	UUID	118	UUID
118	gen_uuid ()	119	UUID::gen ()
119	{	120	{
120	UUID uid;	121	UUID uid;
121		122
122	uid.seq = ++uuid.seq;	123	uid.seq = ++cur.seq;
123		124
124	if (!(uuid.seq & (UUID_SKIP - 1)))	125	if (expect_false (!(cur.seq & (UUID_SKIP - 1))))
125	write_uuid ();	126	write_uuid (UUID_SKIP, false);
126		127
127	return uid;	128	return uid;
128	}	129	}
129		130
130	void	131	void
131	init_uuid ()	132	UUID::init ()
132	{	133	{
133	read_uuid ();	134	read_uuid ();
134	}	135	}
135		136
136	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	137	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
…		…
254	/* This is really a spellbook check - really, we should	255	/* This is really a spellbook check - really, we should
255	* check all objects in the inventory.	256	* check all objects in the inventory.
256	*/	257	*/
257	if (ob1->inv \|\| ob2->inv)	258	if (ob1->inv \|\| ob2->inv)
258	{	259	{
259	/* if one object has inventory but the other doesn't, not equiv */	260	if (!(ob1->inv && ob2->inv))
260	if ((ob1->inv && !ob2->inv) \|\| (ob2->inv && !ob1->inv))	261	return 0; /* inventories differ in length */
261	return 0;
262		262
263	/* Now check to see if the two inventory objects could merge */	263	if (ob1->inv->below \|\| ob2->inv->below)
		264	return 0; /* more than one object in inv */
		265
264	if (!object::can_merge (ob1->inv, ob2->inv))	266	if (!object::can_merge (ob1->inv, ob2->inv))
265	return 0;	267	return 0; /* inventory objexts differ */
266		268
267	/* inventory ok - still need to check rest of this object to see	269	/* inventory ok - still need to check rest of this object to see
268	* if it is valid.	270	* if it is valid.
269	*/	271	*/
270	}	272	}
…		…
299	return 0;	301	return 0;
300	else if (!compare_ob_value_lists (ob1, ob2))	302	else if (!compare_ob_value_lists (ob1, ob2))
301	return 0;	303	return 0;
302	}	304	}
303		305
304	//TODO: generate an event or call into perl for additional checks
305	if (ob1->self \|\| ob2->self)	306	if (ob1->self \|\| ob2->self)
306	{	307	{
307	ob1->optimise ();	308	ob1->optimise ();
308	ob2->optimise ();	309	ob2->optimise ();
309		310
310	if (ob1->self \|\| ob2->self)	311	if (ob1->self \|\| ob2->self)
		312	{
		313	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		314	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		315
		316	if (k1 != k2)
311	return 0;	317	return 0;
		318	else if (k1 == 0)
		319	return 1;
		320	else if (!cfperl_can_merge (ob1, ob2))
		321	return 0;
		322	}
312	}	323	}
313		324
314	/* Everything passes, must be OK. */	325	/* Everything passes, must be OK. */
315	return 1;	326	return 1;
316	}	327	}
…		…
324	sum_weight (object *op)	335	sum_weight (object *op)
325	{	336	{
326	long sum;	337	long sum;
327	object *inv;	338	object *inv;
328		339
329	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	340	for (sum = 0, inv = op->inv; inv; inv = inv->below)
330	{	341	{
331	if (inv->inv)	342	if (inv->inv)
332	sum_weight (inv);	343	sum_weight (inv);
		344
333	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	345	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
334	}	346	}
335		347
336	if (op->type == CONTAINER && op->stats.Str)	348	if (op->type == CONTAINER && op->stats.Str)
337	sum = (sum * (100 - op->stats.Str)) / 100;	349	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
357	/*	369	/*
358	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	370	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
359	* Some error messages.	371	* Some error messages.
360	* The result of the dump is stored in the static global errmsg array.	372	* The result of the dump is stored in the static global errmsg array.
361	*/	373	*/
362
363	char *	374	char *
364	dump_object (object *op)	375	dump_object (object *op)
365	{	376	{
366	if (!op)	377	if (!op)
367	return strdup ("[NULLOBJ]");	378	return strdup ("[NULLOBJ]");
368		379
369	object_freezer freezer;	380	object_freezer freezer;
370	save_object (freezer, op, 1);	381	op->write (freezer);
371	return freezer.as_string ();	382	return freezer.as_string ();
372	}	383	}
373		384
374	/*	385	/*
375	* get_nearest_part(multi-object, object 2) returns the part of the	386	* get_nearest_part(multi-object, object 2) returns the part of the
376	* multi-object 1 which is closest to the second object.	387	* multi-object 1 which is closest to the second object.
377	* If it's not a multi-object, it is returned.	388	* If it's not a multi-object, it is returned.
378	*/	389	*/
379
380	object *	390	object *
381	get_nearest_part (object op, const object pl)	391	get_nearest_part (object op, const object pl)
382	{	392	{
383	object tmp, closest;	393	object tmp, closest;
384	int last_dist, i;	394	int last_dist, i;
…		…
420	break;	430	break;
421		431
422	return op;	432	return op;
423	}	433	}
424		434
425	void
426	free_all_object_data ()
427	{
428	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
429	}
430
431	/*	435	/*
432	* Sets the owner and sets the skill and exp pointers to owner's current	436	* Sets the owner and sets the skill and exp pointers to owner's current
433	* skill and experience objects.	437	* skill and experience objects.
		438	* ACTUALLY NO! investigate! TODO
434	*/	439	*/
435	void	440	void
436	object::set_owner (object *owner)	441	object::set_owner (object *owner)
437	{	442	{
		443	// allow objects which own objects
438	if (!owner)	444	if (owner)
439	return;
440
441	/* next line added to allow objects which own objects */
442	/* Add a check for ownercounts in here, as I got into an endless loop
443	* with the fireball owning a poison cloud which then owned the
444	* fireball. I believe that was caused by one of the objects getting
445	* freed and then another object replacing it. Since the ownercounts
446	* didn't match, this check is valid and I believe that cause is valid.
447	*/
448	while (owner->owner)	445	while (owner->owner)
449	owner = owner->owner;	446	owner = owner->owner;
		447
		448	if (flag [FLAG_FREED])
		449	{
		450	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		451	return;
		452	}
450		453
451	this->owner = owner;	454	this->owner = owner;
		455	}
		456
		457	int
		458	object::slottype () const
		459	{
		460	if (type == SKILL)
		461	{
		462	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		463	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		464	}
		465	else
		466	{
		467	if (slot [body_combat].info) return slot_combat;
		468	if (slot [body_range ].info) return slot_ranged;
		469	}
		470
		471	return slot_none;
		472	}
		473
		474	bool
		475	object::change_weapon (object *ob)
		476	{
		477	if (current_weapon == ob)
		478	return true;
		479
		480	if (chosen_skill)
		481	chosen_skill->flag [FLAG_APPLIED] = false;
		482
		483	current_weapon = ob;
		484	chosen_skill = !ob \|\| ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		485
		486	if (chosen_skill)
		487	chosen_skill->flag [FLAG_APPLIED] = true;
		488
		489	update_stats ();
		490
		491	if (ob)
		492	{
		493	// now check wether any body locations became invalid, in which case
		494	// we cannot apply the weapon at the moment.
		495	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		496	if (slot[i].used < 0)
		497	{
		498	current_weapon = chosen_skill = 0;
		499	update_stats ();
		500
		501	new_draw_info_format (NDI_UNIQUE, 0, this,
		502	"You try to balance all your items at once, "
		503	"but the %s is just too much for your body. "
		504	"[You need to unapply some items first.]", &ob->name);
		505	return false;
		506	}
		507
		508	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		509	}
		510	else
		511	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		512
		513	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		514	{
		515	LOG (llevError \| logBacktrace, "%s changed to unapplied weapon %s",
		516	&name, ob->debug_desc ());
		517	return false;
		518	}
		519
		520	return true;
452	}	521	}
453		522
454	/* Zero the key_values on op, decrementing the shared-string	523	/* Zero the key_values on op, decrementing the shared-string
455	* refcounts and freeing the links.	524	* refcounts and freeing the links.
456	*/	525	*/
457	static void	526	static void
458	free_key_values (object *op)	527	free_key_values (object *op)
459	{	528	{
460	for (key_value *i = op->key_values; i != 0;)	529	for (key_value *i = op->key_values; i; )
461	{	530	{
462	key_value *next = i->next;	531	key_value *next = i->next;
463	delete i;	532	delete i;
464		533
465	i = next;	534	i = next;
466	}	535	}
467		536
468	op->key_values = 0;	537	op->key_values = 0;
469	}	538	}
470		539
471	/*	540	object &
472	* copy_to first frees everything allocated by the dst object,	541	object::operator =(const object &src)
473	* and then copies the contents of itself into the second
474	* object, allocating what needs to be allocated. Basically, any
475	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
476	* if the first object is freed, the pointers in the new object
477	* will point at garbage.
478	*/
479	void
480	object::copy_to (object *dst)
481	{	542	{
482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	543	bool is_freed = flag [FLAG_FREED];
483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	544	bool is_removed = flag [FLAG_REMOVED];
484		545
485	(object_copy )dst = *this;	546	(object_copy )this = src;
486		547
487	if (is_freed)	548	flag [FLAG_FREED] = is_freed;
488	SET_FLAG (dst, FLAG_FREED);	549	flag [FLAG_REMOVED] = is_removed;
489
490	if (is_removed)
491	SET_FLAG (dst, FLAG_REMOVED);
492
493	if (speed < 0)
494	dst->speed_left = speed_left - rndm ();
495		550
496	/* Copy over key_values, if any. */	551	/* Copy over key_values, if any. */
497	if (key_values)	552	if (src.key_values)
498	{	553	{
499	key_value *tail = 0;	554	key_value *tail = 0;
500	key_value *i;
501
502	dst->key_values = 0;	555	key_values = 0;
503		556
504	for (i = key_values; i; i = i->next)	557	for (key_value *i = src.key_values; i; i = i->next)
505	{	558	{
506	key_value *new_link = new key_value;	559	key_value *new_link = new key_value;
507		560
508	new_link->next = 0;	561	new_link->next = 0;
509	new_link->key = i->key;	562	new_link->key = i->key;
510	new_link->value = i->value;	563	new_link->value = i->value;
511		564
512	/* Try and be clever here, too. */	565	/* Try and be clever here, too. */
513	if (!dst->key_values)	566	if (!key_values)
514	{	567	{
515	dst->key_values = new_link;	568	key_values = new_link;
516	tail = new_link;	569	tail = new_link;
517	}	570	}
518	else	571	else
519	{	572	{
520	tail->next = new_link;	573	tail->next = new_link;
521	tail = new_link;	574	tail = new_link;
522	}	575	}
523	}	576	}
524	}	577	}
		578	}
		579
		580	/*
		581	* copy_to first frees everything allocated by the dst object,
		582	* and then copies the contents of itself into the second
		583	* object, allocating what needs to be allocated. Basically, any
		584	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		585	* if the first object is freed, the pointers in the new object
		586	* will point at garbage.
		587	*/
		588	void
		589	object::copy_to (object *dst)
		590	{
		591	dst = this;
		592
		593	if (speed < 0)
		594	dst->speed_left -= rndm ();
525		595
526	dst->set_speed (dst->speed);	596	dst->set_speed (dst->speed);
		597	}
		598
		599	void
		600	object::instantiate ()
		601	{
		602	if (!uuid.seq) // HACK
		603	uuid = UUID::gen ();
		604
		605	speed_left = -0.1f;
		606	/* copy the body_info to the body_used - this is only really
		607	* need for monsters, but doesn't hurt to do it for everything.
		608	* by doing so, when a monster is created, it has good starting
		609	* values for the body_used info, so when items are created
		610	* for it, they can be properly equipped.
		611	*/
		612	for (int i = NUM_BODY_LOCATIONS; i--; )
		613	slot[i].used = slot[i].info;
		614
		615	attachable::instantiate ();
527	}	616	}
528		617
529	object *	618	object *
530	object::clone ()	619	object::clone ()
531	{	620	{
…		…
589	* UP_OBJ_FACE: only the objects face has changed.	678	* UP_OBJ_FACE: only the objects face has changed.
590	*/	679	*/
591	void	680	void
592	update_object (object *op, int action)	681	update_object (object *op, int action)
593	{	682	{
594	MoveType move_on, move_off, move_block, move_slow;
595
596	if (op == NULL)	683	if (op == NULL)
597	{	684	{
598	/* this should never happen */	685	/* this should never happen */
599	LOG (llevDebug, "update_object() called for NULL object.\n");	686	LOG (llevDebug, "update_object() called for NULL object.\n");
600	return;	687	return;
…		…
680	static int object_count;	767	static int object_count;
681		768
682	void object::link ()	769	void object::link ()
683	{	770	{
684	assert (!index);//D	771	assert (!index);//D
685	uuid = gen_uuid ();	772	uuid = UUID::gen ();
686	count = ++object_count;	773	count = ++object_count;
687		774
688	refcnt_inc ();	775	refcnt_inc ();
689	objects.insert (this);	776	objects.insert (this);
690	}	777	}
…		…
839		926
840	if (!freed_map)	927	if (!freed_map)
841	{	928	{
842	freed_map = new maptile;	929	freed_map = new maptile;
843		930
		931	freed_map->path = "<freed objects map>";
844	freed_map->name = "/internal/freed_objects_map";	932	freed_map->name = "/internal/freed_objects_map";
845	freed_map->width = 3;	933	freed_map->width = 3;
846	freed_map->height = 3;	934	freed_map->height = 3;
		935	freed_map->nodrop = 1;
847		936
848	freed_map->alloc ();	937	freed_map->alloc ();
849	freed_map->in_memory = MAP_IN_MEMORY;	938	freed_map->in_memory = MAP_IN_MEMORY;
850	}	939	}
851		940
852	map = freed_map;	941	map = freed_map;
853	x = 1;	942	x = 1;
854	y = 1;	943	y = 1;
855	}	944	}
856		945
857	head = 0;
858
859	if (more)	946	if (more)
860	{	947	{
861	more->destroy ();	948	more->destroy ();
862	more = 0;	949	more = 0;
863	}	950	}
864		951
		952	head = 0;
		953
865	// clear those pointers that likely might have circular references to us	954	// clear those pointers that likely might cause circular references
866	owner = 0;	955	owner = 0;
867	enemy = 0;	956	enemy = 0;
868	attacked_by = 0;	957	attacked_by = 0;
		958	current_weapon = 0;
869	}	959	}
870		960
871	void	961	void
872	object::destroy (bool destroy_inventory)	962	object::destroy (bool destroy_inventory)
873	{	963	{
874	if (destroyed ())	964	if (destroyed ())
875	return;	965	return;
876		966
877	if (destroy_inventory)	967	if (destroy_inventory)
878	destroy_inv (false);	968	destroy_inv (false);
		969
		970	if (is_head ())
		971	if (sound_destroy)
		972	play_sound (sound_destroy);
		973	else if (flag [FLAG_MONSTER])
		974	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
879		975
880	attachable::destroy ();	976	attachable::destroy ();
881	}	977	}
882		978
883	/*	979	/*
…		…
903	* object will have no environment. If the object previously had an	999	* object will have no environment. If the object previously had an
904	* environment, the x and y coordinates will be updated to	1000	* environment, the x and y coordinates will be updated to
905	* the previous environment.	1001	* the previous environment.
906	*/	1002	*/
907	void	1003	void
908	object::remove_slow ()	1004	object::do_remove ()
909	{	1005	{
910	object tmp, last = 0;	1006	object tmp, last = 0;
911	object *otmp;	1007	object *otmp;
912		1008
913	if (QUERY_FLAG (this, FLAG_REMOVED))	1009	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
956	}	1052	}
957	else if (map)	1053	else if (map)
958	{	1054	{
959	if (type == PLAYER)	1055	if (type == PLAYER)
960	{	1056	{
		1057	// leaving a spot always closes any open container on the ground
		1058	if (container && !container->env)
		1059	// this causes spurious floorbox updates, but it ensures
		1060	// that the CLOSE event is being sent.
		1061	close_container ();
		1062
961	--map->players;	1063	--map->players;
962	map->touch ();	1064	map->touch ();
963	}	1065	}
964		1066
965	map->dirty = true;	1067	map->dirty = true;
…		…
992	if (map->in_memory == MAP_SAVING)	1094	if (map->in_memory == MAP_SAVING)
993	return;	1095	return;
994		1096
995	int check_walk_off = !flag [FLAG_NO_APPLY];	1097	int check_walk_off = !flag [FLAG_NO_APPLY];
996		1098
		1099	if (object *pl = ms.player ())
		1100	{
		1101	if (pl->container == this)
		1102	/* If a container that the player is currently using somehow gets
		1103	* removed (most likely destroyed), update the player view
		1104	* appropriately.
		1105	*/
		1106	pl->close_container ();
		1107
		1108	pl->contr->ns->floorbox_update ();
		1109	}
		1110
997	for (tmp = ms.bot; tmp; tmp = tmp->above)	1111	for (tmp = ms.bot; tmp; tmp = tmp->above)
998	{	1112	{
999	/* No point updating the players look faces if he is the object	1113	/* No point updating the players look faces if he is the object
1000	* being removed.	1114	* being removed.
1001	*/	1115	*/
1002
1003	if (tmp->type == PLAYER && tmp != this)
1004	{
1005	/* If a container that the player is currently using somehow gets
1006	* removed (most likely destroyed), update the player view
1007	* appropriately.
1008	*/
1009	if (tmp->container == this)
1010	{
1011	flag [FLAG_APPLIED] = 0;
1012	tmp->container = 0;
1013	}
1014
1015	if (tmp->contr->ns)
1016	tmp->contr->ns->floorbox_update ();
1017	}
1018		1116
1019	/* See if object moving off should effect something */	1117	/* See if object moving off should effect something */
1020	if (check_walk_off	1118	if (check_walk_off
1021	&& ((move_type & tmp->move_off)	1119	&& ((move_type & tmp->move_off)
1022	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1120	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1025		1123
1026	if (destroyed ())	1124	if (destroyed ())
1027	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1125	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1028	}	1126	}
1029		1127
1030	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1031	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1032	if (tmp->above == tmp)
1033	tmp->above = 0;
1034
1035	last = tmp;	1128	last = tmp;
1036	}	1129	}
1037		1130
1038	/* last == NULL if there are no objects on this space */	1131	/* last == NULL if there are no objects on this space */
1039	//TODO: this makes little sense, why only update the topmost object?	1132	//TODO: this makes little sense, why only update the topmost object?
…		…
1059	merge_ob (object op, object top)	1152	merge_ob (object op, object top)
1060	{	1153	{
1061	if (!op->nrof)	1154	if (!op->nrof)
1062	return 0;	1155	return 0;
1063		1156
1064	if (top)	1157	if (!top)
1065	for (top = op; top && top->above; top = top->above)	1158	for (top = op; top && top->above; top = top->above)
1066	;	1159	;
1067		1160
1068	for (; top; top = top->below)	1161	for (; top; top = top->below)
1069	{	1162	{
…		…
1082	}	1175	}
1083		1176
1084	return 0;	1177	return 0;
1085	}	1178	}
1086		1179
		1180	void
		1181	object::expand_tail ()
		1182	{
		1183	if (more)
		1184	return;
		1185
		1186	object *prev = this;
		1187
		1188	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)
		1189	{
		1190	object *op = arch_to_object (at);
		1191
		1192	op->name = name;
		1193	op->name_pl = name_pl;
		1194	op->title = title;
		1195
		1196	op->head = this;
		1197	prev->more = op;
		1198
		1199	prev = op;
		1200	}
		1201	}
		1202
1087	/*	1203	/*
1088	* same as insert_ob_in_map except it handles separate coordinates and does a clean	1204	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1089	* job preparing multi-part monsters.	1205	* job preparing multi-part monsters.
1090	*/	1206	*/
1091	object *	1207	object *
1092	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1208	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1093	{	1209	{
1094	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1210	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1095	{	1211	{
1096	tmp->x = x + tmp->arch->clone.x;	1212	tmp->x = x + tmp->arch->x;
1097	tmp->y = y + tmp->arch->clone.y;	1213	tmp->y = y + tmp->arch->y;
1098	}	1214	}
1099		1215
1100	return insert_ob_in_map (op, m, originator, flag);	1216	return insert_ob_in_map (op, m, originator, flag);
1101	}	1217	}
1102		1218
…		…
1121	* just 'op' otherwise	1237	* just 'op' otherwise
1122	*/	1238	*/
1123	object *	1239	object *
1124	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1240	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1125	{	1241	{
		1242	assert (!op->flag [FLAG_FREED]);
		1243
1126	object tmp, top, *floor = NULL;	1244	object top, floor = NULL;
1127
1128	if (QUERY_FLAG (op, FLAG_FREED))
1129	{
1130	LOG (llevError, "Trying to insert freed object!\n");
1131	return NULL;
1132	}
1133
1134	if (!QUERY_FLAG (op, FLAG_REMOVED))
1135	LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1136		1245
1137	op->remove ();	1246	op->remove ();
1138
1139	if (!m)
1140	{
1141	char *dump = dump_object (op);
1142	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1143	free (dump);
1144	return op;
1145	}
1146
1147	if (out_of_map (m, op->x, op->y))
1148	{
1149	char *dump = dump_object (op);
1150	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1151	#ifdef MANY_CORES
1152	/* Better to catch this here, as otherwise the next use of this object
1153	* is likely to cause a crash. Better to find out where it is getting
1154	* improperly inserted.
1155	*/
1156	abort ();
1157	#endif
1158	free (dump);
1159	return op;
1160	}
1161
1162	if (object *more = op->more)
1163	{
1164	if (!insert_ob_in_map (more, m, originator, flag))
1165	{
1166	if (!op->head)
1167	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1168
1169	return 0;
1170	}
1171	}
1172
1173	CLEAR_FLAG (op, FLAG_REMOVED);
1174		1247
1175	/* Ideally, the caller figures this out. However, it complicates a lot	1248	/* Ideally, the caller figures this out. However, it complicates a lot
1176	* of areas of callers (eg, anything that uses find_free_spot would now	1249	* of areas of callers (eg, anything that uses find_free_spot would now
1177	* need extra work	1250	* need extra work
1178	*/	1251	*/
1179	if (!xy_normalise (m, op->x, op->y))	1252	if (!xy_normalise (m, op->x, op->y))
		1253	{
		1254	op->destroy ();
1180	return 0;	1255	return 0;
		1256	}
		1257
		1258	if (object *more = op->more)
		1259	if (!insert_ob_in_map (more, m, originator, flag))
		1260	return 0;
		1261
		1262	CLEAR_FLAG (op, FLAG_REMOVED);
1181		1263
1182	op->map = m;	1264	op->map = m;
1183	mapspace &ms = op->ms ();	1265	mapspace &ms = op->ms ();
1184		1266
1185	/* this has to be done after we translate the coordinates.	1267	/* this has to be done after we translate the coordinates.
1186	*/	1268	*/
1187	if (op->nrof && !(flag & INS_NO_MERGE))	1269	if (op->nrof && !(flag & INS_NO_MERGE))
1188	for (tmp = ms.bot; tmp; tmp = tmp->above)	1270	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1189	if (object::can_merge (op, tmp))	1271	if (object::can_merge (op, tmp))
1190	{	1272	{
1191	op->nrof += tmp->nrof;	1273	op->nrof += tmp->nrof;
1192	tmp->destroy ();	1274	tmp->destroy ();
1193	}	1275	}
…		…
1220	else	1302	else
1221	{	1303	{
1222	top = ms.bot;	1304	top = ms.bot;
1223		1305
1224	/* If there are other objects, then */	1306	/* If there are other objects, then */
1225	if ((!(flag & INS_MAP_LOAD)) && top)	1307	if (top)
1226	{	1308	{
1227	object *last = 0;	1309	object *last = 0;
1228		1310
1229	/*	1311	/*
1230	* If there are multiple objects on this space, we do some trickier handling.	1312	* If there are multiple objects on this space, we do some trickier handling.
…		…
1260	* looks like instead of lots of conditions here.	1342	* looks like instead of lots of conditions here.
1261	* makes things faster, and effectively the same result.	1343	* makes things faster, and effectively the same result.
1262	*/	1344	*/
1263		1345
1264	/* Have object 'fall below' other objects that block view.	1346	/* Have object 'fall below' other objects that block view.
1265	* Unless those objects are exits, type 66	1347	* Unless those objects are exits.
1266	* If INS_ON_TOP is used, don't do this processing	1348	* If INS_ON_TOP is used, don't do this processing
1267	* Need to find the object that in fact blocks view, otherwise	1349	* Need to find the object that in fact blocks view, otherwise
1268	* stacking is a bit odd.	1350	* stacking is a bit odd.
1269	*/	1351	*/
1270	if (!(flag & INS_ON_TOP)	1352	if (!(flag & INS_ON_TOP)
1271	&& ms.flags () & P_BLOCKSVIEW	1353	&& ms.flags () & P_BLOCKSVIEW
1272	&& (op->face && !op->face->visibility))	1354	&& (op->face && !faces [op->face].visibility))
1273	{	1355	{
1274	for (last = top; last != floor; last = last->below)	1356	for (last = top; last != floor; last = last->below)
1275	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1357	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1276	break;	1358	break;
1277		1359
…		…
1283	if (last && last->below && last != floor)	1365	if (last && last->below && last != floor)
1284	top = last->below;	1366	top = last->below;
1285	}	1367	}
1286	} /* If objects on this space */	1368	} /* If objects on this space */
1287		1369
1288	if (flag & INS_MAP_LOAD)
1289	top = ms.top;
1290
1291	if (flag & INS_ABOVE_FLOOR_ONLY)	1370	if (flag & INS_ABOVE_FLOOR_ONLY)
1292	top = floor;	1371	top = floor;
1293		1372
1294	/* Top is the object that our object (op) is going to get inserted above.	1373	/* Top is the object that our object (op) is going to get inserted above.
1295	*/	1374	*/
…		…
1327	op->map->touch ();	1406	op->map->touch ();
1328	}	1407	}
1329		1408
1330	op->map->dirty = true;	1409	op->map->dirty = true;
1331		1410
1332	/* If we have a floor, we know the player, if any, will be above
1333	* it, so save a few ticks and start from there.
1334	*/
1335	if (!(flag & INS_MAP_LOAD))
1336	if (object *pl = ms.player ())	1411	if (object *pl = ms.player ())
1337	if (pl->contr->ns)
1338	pl->contr->ns->floorbox_update ();	1412	pl->contr->ns->floorbox_update ();
1339		1413
1340	/* If this object glows, it may affect lighting conditions that are	1414	/* If this object glows, it may affect lighting conditions that are
1341	* visible to others on this map. But update_all_los is really	1415	* visible to others on this map. But update_all_los is really
1342	* an inefficient way to do this, as it means los for all players	1416	* an inefficient way to do this, as it means los for all players
1343	* on the map will get recalculated. The players could very well	1417	* on the map will get recalculated. The players could very well
…		…
1362	* blocked() and wall() work properly), and these flags are updated by	1436	* blocked() and wall() work properly), and these flags are updated by
1363	* update_object().	1437	* update_object().
1364	*/	1438	*/
1365		1439
1366	/* if this is not the head or flag has been passed, don't check walk on status */	1440	/* if this is not the head or flag has been passed, don't check walk on status */
1367	if (!(flag & INS_NO_WALK_ON) && !op->head)	1441	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1368	{	1442	{
1369	if (check_move_on (op, originator))	1443	if (check_move_on (op, originator))
1370	return 0;	1444	return 0;
1371		1445
1372	/* If we are a multi part object, lets work our way through the check	1446	/* If we are a multi part object, lets work our way through the check
1373	* walk on's.	1447	* walk on's.
1374	*/	1448	*/
1375	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1449	for (object *tmp = op->more; tmp; tmp = tmp->more)
1376	if (check_move_on (tmp, originator))	1450	if (check_move_on (tmp, originator))
1377	return 0;	1451	return 0;
1378	}	1452	}
1379		1453
1380	return op;	1454	return op;
…		…
1390	object tmp, tmp1;	1464	object tmp, tmp1;
1391		1465
1392	/* first search for itself and remove any old instances */	1466	/* first search for itself and remove any old instances */
1393		1467
1394	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1468	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1395	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1469	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1396	tmp->destroy ();	1470	tmp->destroy ();
1397		1471
1398	tmp1 = arch_to_object (archetype::find (arch_string));	1472	tmp1 = arch_to_object (archetype::find (arch_string));
1399		1473
1400	tmp1->x = op->x;	1474	tmp1->x = op->x;
…		…
1403	}	1477	}
1404		1478
1405	object *	1479	object *
1406	object::insert_at (object where, object originator, int flags)	1480	object::insert_at (object where, object originator, int flags)
1407	{	1481	{
1408	where->map->insert (this, where->x, where->y, originator, flags);	1482	return where->map->insert (this, where->x, where->y, originator, flags);
1409	}	1483	}
1410		1484
1411	/*	1485	/*
1412	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1486	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1413	* is returned contains nr objects, and the remaining parts contains	1487	* is returned contains nr objects, and the remaining parts contains
…		…
1453	* the amount of an object. If the amount reaches 0, the object	1527	* the amount of an object. If the amount reaches 0, the object
1454	* is subsequently removed and freed.	1528	* is subsequently removed and freed.
1455	*	1529	*
1456	* Return value: 'op' if something is left, NULL if the amount reached 0	1530	* Return value: 'op' if something is left, NULL if the amount reached 0
1457	*/	1531	*/
1458
1459	object *	1532	object *
1460	decrease_ob_nr (object *op, uint32 i)	1533	decrease_ob_nr (object *op, uint32 i)
1461	{	1534	{
1462	object *tmp;	1535	object *tmp;
1463		1536
…		…
1538		1611
1539	/*	1612	/*
1540	* add_weight(object, weight) adds the specified weight to an object,	1613	* add_weight(object, weight) adds the specified weight to an object,
1541	* and also updates how much the environment(s) is/are carrying.	1614	* and also updates how much the environment(s) is/are carrying.
1542	*/	1615	*/
1543
1544	void	1616	void
1545	add_weight (object *op, signed long weight)	1617	add_weight (object *op, signed long weight)
1546	{	1618	{
1547	while (op != NULL)	1619	while (op != NULL)
1548	{	1620	{
…		…
1563	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1635	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1564	free (dump);	1636	free (dump);
1565	return op;	1637	return op;
1566	}	1638	}
1567		1639
1568	if (where->head)	1640	if (where->head_ () != where)
1569	{	1641	{
1570	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1642	LOG (llevError \| logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1571	where = where->head;	1643	where = where->head;
1572	}	1644	}
1573		1645
1574	return where->insert (op);	1646	return where->insert (op);
1575	}	1647	}
…		…
1580	* inside the object environment.	1652	* inside the object environment.
1581	*	1653	*
1582	* The function returns now pointer to inserted item, and return value can	1654	* The function returns now pointer to inserted item, and return value can
1583	* be != op, if items are merged. -Tero	1655	* be != op, if items are merged. -Tero
1584	*/	1656	*/
1585
1586	object *	1657	object *
1587	object::insert (object *op)	1658	object::insert (object *op)
1588	{	1659	{
1589	object tmp, otmp;
1590
1591	if (!QUERY_FLAG (op, FLAG_REMOVED))	1660	if (!QUERY_FLAG (op, FLAG_REMOVED))
1592	op->remove ();	1661	op->remove ();
1593		1662
1594	if (op->more)	1663	if (op->more)
1595	{	1664	{
…		…
1597	return op;	1666	return op;
1598	}	1667	}
1599		1668
1600	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1669	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1601	CLEAR_FLAG (op, FLAG_REMOVED);	1670	CLEAR_FLAG (op, FLAG_REMOVED);
		1671
1602	if (op->nrof)	1672	if (op->nrof)
1603	{	1673	{
1604	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1674	for (object *tmp = inv; tmp; tmp = tmp->below)
1605	if (object::can_merge (tmp, op))	1675	if (object::can_merge (tmp, op))
1606	{	1676	{
1607	/* return the original object and remove inserted object	1677	/* return the original object and remove inserted object
1608	(client needs the original object) */	1678	(client needs the original object) */
1609	tmp->nrof += op->nrof;	1679	tmp->nrof += op->nrof;
…		…
1628	add_weight (this, op->weight * op->nrof);	1698	add_weight (this, op->weight * op->nrof);
1629	}	1699	}
1630	else	1700	else
1631	add_weight (this, (op->weight + op->carrying));	1701	add_weight (this, (op->weight + op->carrying));
1632		1702
1633	otmp = this->in_player ();	1703	if (object *otmp = this->in_player ())
1634	if (otmp && otmp->contr)
1635	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1704	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1636	otmp->update_stats ();	1705	otmp->update_stats ();
1637		1706
		1707	op->owner = 0; // its his/hers now. period.
1638	op->map = 0;	1708	op->map = 0;
1639	op->env = this;	1709	op->env = this;
1640	op->above = 0;	1710	op->above = 0;
1641	op->below = 0;	1711	op->below = 0;
1642	op->x = 0, op->y = 0;	1712	op->x = op->y = 0;
1643		1713
1644	/* reset the light list and los of the players on the map */	1714	/* reset the light list and los of the players on the map */
1645	if ((op->glow_radius != 0) && map)	1715	if (op->glow_radius && map)
1646	{	1716	{
1647	#ifdef DEBUG_LIGHTS	1717	#ifdef DEBUG_LIGHTS
1648	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1718	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1649	#endif /* DEBUG_LIGHTS */	1719	#endif /* DEBUG_LIGHTS */
1650	if (map->darkness)	1720	if (map->darkness)
…		…
1884	* activate recursively a flag on an object inventory	1954	* activate recursively a flag on an object inventory
1885	*/	1955	*/
1886	void	1956	void
1887	flag_inv (object *op, int flag)	1957	flag_inv (object *op, int flag)
1888	{	1958	{
1889	if (op->inv)
1890	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1959	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1891	{	1960	{
1892	SET_FLAG (tmp, flag);	1961	SET_FLAG (tmp, flag);
1893	flag_inv (tmp, flag);	1962	flag_inv (tmp, flag);
1894	}	1963	}
1895	}	1964	}
1896		1965
1897	/*	1966	/*
1898	* deactivate recursively a flag on an object inventory	1967	* deactivate recursively a flag on an object inventory
1899	*/	1968	*/
1900	void	1969	void
1901	unflag_inv (object *op, int flag)	1970	unflag_inv (object *op, int flag)
1902	{	1971	{
1903	if (op->inv)
1904	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1972	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1905	{	1973	{
1906	CLEAR_FLAG (tmp, flag);	1974	CLEAR_FLAG (tmp, flag);
1907	unflag_inv (tmp, flag);	1975	unflag_inv (tmp, flag);
1908	}	1976	}
1909	}
1910
1911	/*
1912	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1913	* all it's inventory (recursively).
1914	* If checksums are used, a player will get set_cheat called for
1915	* him/her-self and all object carried by a call to this function.
1916	*/
1917	void
1918	set_cheat (object *op)
1919	{
1920	SET_FLAG (op, FLAG_WAS_WIZ);
1921	flag_inv (op, FLAG_WAS_WIZ);
1922	}	1977	}
1923		1978
1924	/*	1979	/*
1925	* find_free_spot(object, map, x, y, start, stop) will search for	1980	* find_free_spot(object, map, x, y, start, stop) will search for
1926	* a spot at the given map and coordinates which will be able to contain	1981	* a spot at the given map and coordinates which will be able to contain
…		…
1928	* to search (see the freearr_x/y[] definition).	1983	* to search (see the freearr_x/y[] definition).
1929	* It returns a random choice among the alternatives found.	1984	* It returns a random choice among the alternatives found.
1930	* start and stop are where to start relative to the free_arr array (1,9	1985	* start and stop are where to start relative to the free_arr array (1,9
1931	* does all 4 immediate directions). This returns the index into the	1986	* does all 4 immediate directions). This returns the index into the
1932	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1987	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1933	* Note - this only checks to see if there is space for the head of the
1934	* object - if it is a multispace object, this should be called for all
1935	* pieces.
1936	* Note2: This function does correctly handle tiled maps, but does not	1988	* Note: This function does correctly handle tiled maps, but does not
1937	* inform the caller. However, insert_ob_in_map will update as	1989	* inform the caller. However, insert_ob_in_map will update as
1938	* necessary, so the caller shouldn't need to do any special work.	1990	* necessary, so the caller shouldn't need to do any special work.
1939	* Note - updated to take an object instead of archetype - this is necessary	1991	* Note - updated to take an object instead of archetype - this is necessary
1940	* because arch_blocked (now ob_blocked) needs to know the movement type	1992	* because arch_blocked (now ob_blocked) needs to know the movement type
1941	* to know if the space in question will block the object. We can't use	1993	* to know if the space in question will block the object. We can't use
…		…
1943	* customized, changed states, etc.	1995	* customized, changed states, etc.
1944	*/	1996	*/
1945	int	1997	int
1946	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)	1998	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)
1947	{	1999	{
		2000	int altern[SIZEOFFREE];
1948	int index = 0, flag;	2001	int index = 0, flag;
1949	int altern[SIZEOFFREE];
1950		2002
1951	for (int i = start; i < stop; i++)	2003	for (int i = start; i < stop; i++)
1952	{	2004	{
1953	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2005	mapxy pos (m, x, y); pos.move (i);
1954	if (!flag)	2006
		2007	if (!pos.normalise ())
		2008	continue;
		2009
		2010	mapspace &ms = *pos;
		2011
		2012	if (ms.flags () & P_IS_ALIVE)
		2013	continue;
		2014
		2015	/* However, often
		2016	* ob doesn't have any move type (when used to place exits)
		2017	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2018	*/
		2019	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2020	{
1955	altern [index++] = i;	2021	altern [index++] = i;
		2022	continue;
		2023	}
1956		2024
1957	/* Basically, if we find a wall on a space, we cut down the search size.	2025	/* Basically, if we find a wall on a space, we cut down the search size.
1958	* In this way, we won't return spaces that are on another side of a wall.	2026	* In this way, we won't return spaces that are on another side of a wall.
1959	* This mostly work, but it cuts down the search size in all directions -	2027	* This mostly work, but it cuts down the search size in all directions -
1960	* if the space being examined only has a wall to the north and empty	2028	* if the space being examined only has a wall to the north and empty
1961	* spaces in all the other directions, this will reduce the search space	2029	* spaces in all the other directions, this will reduce the search space
1962	* to only the spaces immediately surrounding the target area, and	2030	* to only the spaces immediately surrounding the target area, and
1963	* won't look 2 spaces south of the target space.	2031	* won't look 2 spaces south of the target space.
1964	*/	2032	*/
1965	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2033	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2034	{
1966	stop = maxfree[i];	2035	stop = maxfree[i];
		2036	continue;
		2037	}
		2038
		2039	/* Note it is intentional that we check ob - the movement type of the
		2040	* head of the object should correspond for the entire object.
		2041	*/
		2042	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2043	continue;
		2044
		2045	if (ob->blocked (m, pos.x, pos.y))
		2046	continue;
		2047
		2048	altern [index++] = i;
1967	}	2049	}
1968		2050
1969	if (!index)	2051	if (!index)
1970	return -1;	2052	return -1;
1971		2053
…		…
1980	*/	2062	*/
1981	int	2063	int
1982	find_first_free_spot (const object ob, maptile m, int x, int y)	2064	find_first_free_spot (const object ob, maptile m, int x, int y)
1983	{	2065	{
1984	for (int i = 0; i < SIZEOFFREE; i++)	2066	for (int i = 0; i < SIZEOFFREE; i++)
1985	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2067	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
1986	return i;	2068	return i;
1987		2069
1988	return -1;	2070	return -1;
1989	}	2071	}
1990		2072
…		…
2044	object *tmp;	2126	object *tmp;
2045	maptile *mp;	2127	maptile *mp;
2046		2128
2047	MoveType blocked, move_type;	2129	MoveType blocked, move_type;
2048		2130
2049	if (exclude && exclude->head)	2131	if (exclude && exclude->head_ () != exclude)
2050	{	2132	{
2051	exclude = exclude->head;	2133	exclude = exclude->head;
2052	move_type = exclude->move_type;	2134	move_type = exclude->move_type;
2053	}	2135	}
2054	else	2136	else
…		…
2077	max = maxfree[i];	2159	max = maxfree[i];
2078	else if (mflags & P_IS_ALIVE)	2160	else if (mflags & P_IS_ALIVE)
2079	{	2161	{
2080	for (tmp = ms.bot; tmp; tmp = tmp->above)	2162	for (tmp = ms.bot; tmp; tmp = tmp->above)
2081	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)	2163	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)
2082	&& (tmp != exclude \|\| (tmp->head && tmp->head != exclude)))	2164	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2083	break;	2165	break;
2084		2166
2085	if (tmp)	2167	if (tmp)
2086	return freedir[i];	2168	return freedir[i];
2087	}	2169	}
…		…
2267	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2349	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2268	* core dumps if they do.	2350	* core dumps if they do.
2269	*	2351	*
2270	* Add a check so we can't pick up invisible objects (0.93.8)	2352	* Add a check so we can't pick up invisible objects (0.93.8)
2271	*/	2353	*/
2272
2273	int	2354	int
2274	can_pick (const object who, const object item)	2355	can_pick (const object who, const object item)
2275	{	2356	{
2276	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2357	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /
2277	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2358	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2282	* create clone from object to another	2363	* create clone from object to another
2283	*/	2364	*/
2284	object *	2365	object *
2285	object_create_clone (object *asrc)	2366	object_create_clone (object *asrc)
2286	{	2367	{
2287	object dst = 0, tmp, src, part, prev, item;	2368	object dst = 0, tmp, src, prev, *item;
2288		2369
2289	if (!asrc)	2370	if (!asrc)
2290	return 0;	2371	return 0;
2291		2372
2292	src = asrc;
2293	if (src->head)
2294	src = src->head;	2373	src = asrc->head_ ();
2295		2374
2296	prev = 0;	2375	prev = 0;
2297	for (part = src; part; part = part->more)	2376	for (object *part = src; part; part = part->more)
2298	{	2377	{
2299	tmp = part->clone ();	2378	tmp = part->clone ();
2300	tmp->x -= src->x;	2379	tmp->x -= src->x;
2301	tmp->y -= src->y;	2380	tmp->y -= src->y;
2302		2381
…		…
2318		2397
2319	for (item = src->inv; item; item = item->below)	2398	for (item = src->inv; item; item = item->below)
2320	insert_ob_in_ob (object_create_clone (item), dst);	2399	insert_ob_in_ob (object_create_clone (item), dst);
2321		2400
2322	return dst;	2401	return dst;
2323	}
2324
2325	/* GROS - Creates an object using a string representing its content. */
2326	/* Basically, we save the content of the string to a temp file, then call */
2327	/* load_object on it. I admit it is a highly inefficient way to make things, */
2328	/* but it was simple to make and allows reusing the load_object function. */
2329	/* Remember not to use load_object_str in a time-critical situation. */
2330	/* Also remember that multiparts objects are not supported for now. */
2331	object *
2332	load_object_str (const char *obstr)
2333	{
2334	object *op;
2335	char filename[MAX_BUF];
2336
2337	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2338
2339	FILE *tempfile = fopen (filename, "w");
2340
2341	if (tempfile == NULL)
2342	{
2343	LOG (llevError, "Error - Unable to access load object temp file\n");
2344	return NULL;
2345	}
2346
2347	fprintf (tempfile, obstr);
2348	fclose (tempfile);
2349
2350	op = object::create ();
2351
2352	object_thawer thawer (filename);
2353
2354	if (thawer)
2355	load_object (thawer, op, 0);
2356
2357	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2358	CLEAR_FLAG (op, FLAG_REMOVED);
2359
2360	return op;
2361	}	2402	}
2362		2403
2363	/* This returns the first object in who's inventory that	2404	/* This returns the first object in who's inventory that
2364	* has the same type and subtype match.	2405	* has the same type and subtype match.
2365	* returns NULL if no match.	2406	* returns NULL if no match.
…		…
2420	if (link->key == canonical_key)	2461	if (link->key == canonical_key)
2421	return link->value;	2462	return link->value;
2422		2463
2423	return 0;	2464	return 0;
2424	}	2465	}
2425
2426		2466
2427	/*	2467	/*
2428	* Updates the canonical_key in op to value.	2468	* Updates the canonical_key in op to value.
2429	*	2469	*
2430	* canonical_key is a shared string (value doesn't have to be).	2470	* canonical_key is a shared string (value doesn't have to be).
…		…
2454	/* Basically, if the archetype has this key set,	2494	/* Basically, if the archetype has this key set,
2455	* we need to store the null value so when we save	2495	* we need to store the null value so when we save
2456	* it, we save the empty value so that when we load,	2496	* it, we save the empty value so that when we load,
2457	* we get this value back again.	2497	* we get this value back again.
2458	*/	2498	*/
2459	if (get_ob_key_link (&op->arch->clone, canonical_key))	2499	if (get_ob_key_link (op->arch, canonical_key))
2460	field->value = 0;	2500	field->value = 0;
2461	else	2501	else
2462	{	2502	{
2463	if (last)	2503	if (last)
2464	last->next = field->next;	2504	last->next = field->next;
…		…
2533	}	2573	}
2534	else	2574	else
2535	item = item->env;	2575	item = item->env;
2536	}	2576	}
2537		2577
2538
2539	const char *	2578	const char *
2540	object::flag_desc (char *desc, int len) const	2579	object::flag_desc (char *desc, int len) const
2541	{	2580	{
2542	char *p = desc;	2581	char *p = desc;
2543	bool first = true;	2582	bool first = true;
…		…
2570	{	2609	{
2571	char flagdesc[512];	2610	char flagdesc[512];
2572	char info2[256 * 4];	2611	char info2[256 * 4];
2573	char *p = info;	2612	char *p = info;
2574		2613
2575	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2614	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2576	count, uuid.seq,	2615	count,
		2616	uuid.c_str (),
2577	&name,	2617	&name,
2578	title ? "\",title:\"" : "",	2618	title ? "\",title:\"" : "",
2579	title ? (const char *)title : "",	2619	title ? (const char *)title : "",
2580	flag_desc (flagdesc, 512), type);	2620	flag_desc (flagdesc, 512), type);
2581		2621
2582	if (env)	2622	if (!this->flag[FLAG_REMOVED] && env)
2583	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2623	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2584		2624
2585	if (map)	2625	if (map)
2586	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2626	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2587		2627
…		…
2589	}	2629	}
2590		2630
2591	const char *	2631	const char *
2592	object::debug_desc () const	2632	object::debug_desc () const
2593	{	2633	{
2594	static char info[256 * 4];	2634	static char info[3][256 * 4];
		2635	static int info_idx;
		2636
2595	return debug_desc (info);	2637	return debug_desc (info [++info_idx % 3]);
2596	}	2638	}
2597		2639
2598	const char *	2640	struct region *
2599	object::debug_desc2 () const	2641	object::region () const
2600	{	2642	{
2601	static char info[256 * 4];	2643	return map ? map->region (x, y)
2602	return debug_desc (info);	2644	: region::default_region ();
2603	}	2645	}
2604		2646
		2647	const materialtype_t *
		2648	object::dominant_material () const
		2649	{
		2650	if (materialtype_t *mt = name_to_material (materialname))
		2651	return mt;
		2652
		2653	return name_to_material (shstr_unknown);
		2654	}
		2655
		2656	void
		2657	object::open_container (object *new_container)
		2658	{
		2659	if (container == new_container)
		2660	return;
		2661
		2662	if (object *old_container = container)
		2663	{
		2664	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2665	return;
		2666
		2667	#if 0
		2668	// remove the "Close old_container" object.
		2669	if (object *closer = old_container->inv)
		2670	if (closer->type == CLOSE_CON)
		2671	closer->destroy ();
		2672	#endif
		2673
		2674	old_container->flag [FLAG_APPLIED] = 0;
		2675	container = 0;
		2676
		2677	esrv_update_item (UPD_FLAGS, this, old_container);
		2678	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2679	play_sound (sound_find ("chest_close"));
		2680	}
		2681
		2682	if (new_container)
		2683	{
		2684	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2685	return;
		2686
		2687	// TODO: this does not seem to serve any purpose anymore?
		2688	#if 0
		2689	// insert the "Close Container" object.
		2690	if (archetype *closer = new_container->other_arch)
		2691	{
		2692	object *closer = arch_to_object (new_container->other_arch);
		2693	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2694	new_container->insert (closer);
		2695	}
		2696	#endif
		2697
		2698	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2699
		2700	new_container->flag [FLAG_APPLIED] = 1;
		2701	container = new_container;
		2702
		2703	esrv_update_item (UPD_FLAGS, this, new_container);
		2704	esrv_send_inventory (this, new_container);
		2705	play_sound (sound_find ("chest_open"));
		2706	}
		2707	}
		2708
		2709	object *
		2710	object::force_find (const shstr name)
		2711	{
		2712	/* cycle through his inventory to look for the MARK we want to
		2713	* place
		2714	*/
		2715	for (object *tmp = inv; tmp; tmp = tmp->below)
		2716	if (tmp->type == FORCE && tmp->slaying == name)
		2717	return splay (tmp);
		2718
		2719	return 0;
		2720	}
		2721
		2722	void
		2723	object::force_add (const shstr name, int duration)
		2724	{
		2725	if (object *force = force_find (name))
		2726	force->destroy ();
		2727
		2728	object *force = get_archetype (FORCE_NAME);
		2729
		2730	force->slaying = name;
		2731	force->stats.food = 1;
		2732	force->speed_left = -1.f;
		2733
		2734	force->set_speed (duration ? 1.f / duration : 0.f);
		2735	force->flag [FLAG_IS_USED_UP] = true;
		2736	force->flag [FLAG_APPLIED] = true;
		2737
		2738	insert (force);
		2739	}
		2740
		2741	void
		2742	object::play_sound (faceidx sound) const
		2743	{
		2744	if (!sound)
		2745	return;
		2746
		2747	if (flag [FLAG_REMOVED])
		2748	return;
		2749
		2750	if (env)
		2751	{
		2752	if (object *pl = in_player ())
		2753	pl->contr->play_sound (sound);
		2754	}
		2755	else
		2756	map->play_sound (sound, x, y);
		2757	}
		2758

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.124 by root, Sat Jan 27 02:19:36 2007 UTC vs. Revision 1.203 by root, Fri Apr 11 13:59:05 2008 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.124 by root, Sat Jan 27 02:19:36 2007 UTC vs.
Revision 1.203 by root, Fri Apr 11 13:59:05 2008 UTC