ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.120 by root, Sun Jan 21 21:28:27 2007 UTC vs.
Revision 1.207 by root, Sun Apr 20 23:25:09 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. */
		27
28	#include <global.h>	28	#include <global.h>
29	#include <stdio.h>	29	#include <stdio.h>
30	#include <sys/types.h>	30	#include <sys/types.h>
31	#include <sys/uio.h>	31	#include <sys/uio.h>
32	#include <object.h>	32	#include <object.h>
33	#include <funcpoint.h>	33	#include <funcpoint.h>
		34	#include <sproto.h>
34	#include <loader.h>	35	#include <loader.h>
35		36
36	#include <bitset>	37	#include <bitset>
37		38
38	int nrofallocobjects = 0;	39	UUID UUID::cur;
39	static UUID uuid;	40	static uint64_t seq_next_save;
40	const uint64 UUID_SKIP = 1<<19;	41	static const uint64 UUID_GAP = 1<<19;
41		42
42	objectvec objects;	43	objectvec objects;
43	activevec actives;	44	activevec actives;
44		45
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,	46	short freearr_x[SIZEOFFREE] = {
		47	0,
		48	0, 1, 1, 1, 0, -1, -1, -1,
		49	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	50	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	};	51	};
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,	52	short freearr_y[SIZEOFFREE] = {
		53	0,
		54	-1, -1, 0, 1, 1, 1, 0, -1,
		55	-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	56	-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	};	57	};
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,	58	int maxfree[SIZEOFFREE] = {
		59	0,
		60	9, 10, 13, 14, 17, 18, 21, 22,
		61	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	62	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	};	63	};
54	int freedir[SIZEOFFREE] = {	64	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,	65	0,
		66	1, 2, 3, 4, 5, 6, 7, 8,
		67	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	68	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	};	69	};
58		70
59	static void	71	static void
60	write_uuid (void)	72	write_uuid (uval64 skip, bool sync)
61	{	73	{
62	char filename1[MAX_BUF], filename2[MAX_BUF];	74	CALL_BEGIN (2);
63		75	CALL_ARG_SV (newSVval64 (skip));
64	sprintf (filename1, "%s/uuid", settings.localdir);	76	CALL_ARG_SV (boolSV (sync));
65	sprintf (filename2, "%s/uuid~", settings.localdir);	77	CALL_CALL ("cf::write_uuid", G_DISCARD);
66		78	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	}	79	}
79		80
80	static void	81	static void
81	read_uuid (void)	82	read_uuid (void)
82	{	83	{
83	char filename[MAX_BUF];	84	char filename[MAX_BUF];
84		85
85	sprintf (filename, "%s/uuid", settings.localdir);	86	sprintf (filename, "%s/uuid", settings.localdir);
86		87
		88	seq_next_save = 0;
		89
87	FILE *fp;	90	FILE *fp;
88		91
89	if (!(fp = fopen (filename, "r")))	92	if (!(fp = fopen (filename, "r")))
90	{	93	{
91	if (errno == ENOENT)	94	if (errno == ENOENT)
92	{	95	{
93	LOG (llevInfo, "RESET uid to 1\n");	96	LOG (llevInfo, "RESET uid to 1\n");
94	uuid.seq = 0;	97	UUID::cur.seq = 0;
95	write_uuid ();	98	write_uuid (UUID_GAP, true);
96	return;	99	return;
97	}	100	}
98		101
99	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	102	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100	_exit (1);	103	_exit (1);
101	}	104	}
102		105
103	int version;	106	UUID::BUF buf;
104	unsigned long long uid;	107	buf[0] = 0;
105	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	108	fgets (buf, sizeof (buf), fp);
		109
		110	if (!UUID::cur.parse (buf))
106	{	111	{
107	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	112	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
108	_exit (1);	113	_exit (1);
109	}	114	}
110		115
111	uuid.seq = uid;	116	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
112	write_uuid ();	117
113	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	118	write_uuid (UUID_GAP, true);
114	fclose (fp);	119	fclose (fp);
115	}	120	}
116		121
117	UUID	122	UUID
118	gen_uuid ()	123	UUID::gen ()
119	{	124	{
120	UUID uid;	125	UUID uid;
121		126
122	uid.seq = ++uuid.seq;	127	uid.seq = ++cur.seq;
123		128
124	if (!(uuid.seq & (UUID_SKIP - 1)))	129	if (expect_false (cur.seq >= seq_next_save))
125	write_uuid ();	130	{
		131	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		132	write_uuid (UUID_GAP, false);
		133	}
		134
126		135
127	return uid;	136	return uid;
128	}	137	}
129		138
130	void	139	void
131	init_uuid ()	140	UUID::init ()
132	{	141	{
133	read_uuid ();	142	read_uuid ();
134	}	143	}
135		144
136	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	145	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
137	static int	146	static bool
138	compare_ob_value_lists_one (const object *wants, const object *has)	147	compare_ob_value_lists_one (const object *wants, const object *has)
139	{	148	{
140	key_value *wants_field;	149	key_value *wants_field;
141		150
142	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	151	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both
…		…
150	key_value *has_field;	159	key_value *has_field;
151		160
152	/* Look for a field in has with the same key. */	161	/* Look for a field in has with the same key. */
153	has_field = get_ob_key_link (has, wants_field->key);	162	has_field = get_ob_key_link (has, wants_field->key);
154		163
155	if (has_field == NULL)	164	if (!has_field)
156	{
157	/* No field with that name. */	165	return 0; /* No field with that name. */
158	return FALSE;
159	}
160		166
161	/* Found the matching field. */	167	/* Found the matching field. */
162	if (has_field->value != wants_field->value)	168	if (has_field->value != wants_field->value)
163	{
164	/* Values don't match, so this half of the comparison is false. */	169	return 0; /* Values don't match, so this half of the comparison is false. */
165	return FALSE;
166	}
167		170
168	/* If we get here, we found a match. Now for the next field in wants. */	171	/* If we get here, we found a match. Now for the next field in wants. */
169	}	172	}
170		173
171	/* If we get here, every field in wants has a matching field in has. */	174	/* If we get here, every field in wants has a matching field in has. */
172	return TRUE;	175	return 1;
173	}	176	}
174		177
175	/* Returns TRUE if ob1 has the same key_values as ob2. */	178	/* Returns TRUE if ob1 has the same key_values as ob2. */
176	static int	179	static bool
177	compare_ob_value_lists (const object *ob1, const object *ob2)	180	compare_ob_value_lists (const object *ob1, const object *ob2)
178	{	181	{
179	/* However, there may be fields in has which aren't partnered in wants,	182	/* However, there may be fields in has which aren't partnered in wants,
180	* so we need to run the comparison *twice*. :(	183	* so we need to run the comparison *twice*. :(
181	*/	184	*/
…		…
202	|| ob1->speed != ob2->speed	205	|| ob1->speed != ob2->speed
203	|| ob1->value != ob2->value	206	|| ob1->value != ob2->value
204	|| ob1->name != ob2->name)	207	|| ob1->name != ob2->name)
205	return 0;	208	return 0;
206		209
207	//TODO: this ain't working well, use nicer and correct overflow check	210	/* Do not merge objects if nrof would overflow. First part checks
208	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	211	* for unsigned overflow (2c), second part checks wether the result
209	* value could not be stored in a sint32 (which unfortunately sometimes is	212	* would fit into a 32 bit signed int, which is often used to hold
210	* used to store nrof).	213	* nrof values.
211	*/	214	*/
212	if (ob1->nrof + ob2->nrof >= 1UL << 31)	215	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
213	return 0;	216	return 0;
214		217
215	/* If the objects have been identified, set the BEEN_APPLIED flag.	218	/* If the objects have been identified, set the BEEN_APPLIED flag.
216	* This is to the comparison of the flags below will be OK. We	219	* This is to the comparison of the flags below will be OK. We
217	* just can't ignore the been applied or identified flags, as they	220	* just can't ignore the been applied or identified flags, as they
218	* are not equal - just if it has been identified, the been_applied	221	* are not equal - just if it has been identified, the been_applied
219	* flags lose any meaning.	222	* flags lose any meaning.
220	*/	223	*/
221	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	224	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
…		…
249	|| ob1->move_off != ob2->move_off	252	|| ob1->move_off != ob2->move_off
250	|| ob1->move_slow != ob2->move_slow	253	|| ob1->move_slow != ob2->move_slow
251	|| ob1->move_slow_penalty != ob2->move_slow_penalty)	254	|| ob1->move_slow_penalty != ob2->move_slow_penalty)
252	return 0;	255	return 0;
253		256
254	/* This is really a spellbook check - really, we should	257	/* This is really a spellbook check - we should in general
255	* check all objects in the inventory.	258	* not merge objects with real inventories, as splitting them
		259	* is hard.
256	*/	260	*/
257	if (ob1->inv || ob2->inv)	261	if (ob1->inv || ob2->inv)
258	{	262	{
259	/* if one object has inventory but the other doesn't, not equiv */	263	if (!(ob1->inv && ob2->inv))
260	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	264	return 0; /* inventories differ in length */
261	return 0;
262		265
263	/* Now check to see if the two inventory objects could merge */	266	if (ob1->inv->below || ob2->inv->below)
		267	return 0; /* more than one object in inv */
		268
264	if (!object::can_merge (ob1->inv, ob2->inv))	269	if (!object::can_merge (ob1->inv, ob2->inv))
265	return 0;	270	return 0; /* inventory objects differ */
266		271
267	/* inventory ok - still need to check rest of this object to see	272	/* inventory ok - still need to check rest of this object to see
268	* if it is valid.	273	* if it is valid.
269	*/	274	*/
270	}	275	}
…		…
289	if (ob1->level != ob2->level)	294	if (ob1->level != ob2->level)
290	return 0;	295	return 0;
291	break;	296	break;
292	}	297	}
293		298
294	if (ob1->key_values != NULL || ob2->key_values != NULL)	299	if (ob1->key_values || ob2->key_values)
295	{	300	{
296	/* At least one of these has key_values. */	301	/* At least one of these has key_values. */
297	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	302	if ((!ob1->key_values) != (!ob2->key_values))
298	/* One has fields, but the other one doesn't. */	303	/* One has fields, but the other one doesn't. */
299	return 0;	304	return 0;
300	else if (!compare_ob_value_lists (ob1, ob2))	305	else if (!compare_ob_value_lists (ob1, ob2))
301	return 0;	306	return 0;
302	}	307	}
303		308
304	//TODO: generate an event or call into perl for additional checks
305	if (ob1->self || ob2->self)	309	if (ob1->self || ob2->self)
306	{	310	{
307	ob1->optimise ();	311	ob1->optimise ();
308	ob2->optimise ();	312	ob2->optimise ();
309		313
310	if (ob1->self || ob2->self)	314	if (ob1->self || ob2->self)
		315	{
		316	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		317	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		318
		319	if (k1 != k2)
311	return 0;	320	return 0;
		321	else if (k1 == 0)
		322	return 1;
		323	else if (!cfperl_can_merge (ob1, ob2))
		324	return 0;
		325	}
312	}	326	}
313		327
314	/* Everything passes, must be OK. */	328	/* Everything passes, must be OK. */
315	return 1;	329	return 1;
316	}	330	}
317		331
		332	static sint32
		333	weight_adjust (object *op, sint32 weight)
		334	{
		335	return op->type == CONTAINER
		336	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		337	: weight;
		338	}
		339
318	/*	340	/*
		341	* add_weight(object, weight) adds the specified weight to an object,
		342	* and also updates how much the environment(s) is/are carrying.
		343	*/
		344	static void
		345	add_weight (object *op, sint32 weight)
		346	{
		347	while (op)
		348	{
		349	weight = weight_adjust (op, weight);
		350
		351	op->carrying += weight;
		352	op = op->env;
		353	}
		354	}
		355
		356	/*
		357	* sub_weight() recursively (outwards) subtracts a number from the
		358	* weight of an object (and what is carried by it's environment(s)).
		359	*/
		360	static void
		361	sub_weight (object *op, long weight)
		362	{
		363	add_weight (op, -weight);
		364	}
		365
		366	/*
319	* sum_weight() is a recursive function which calculates the weight	367	* this is a recursive function which calculates the weight
320	* an object is carrying. It goes through in figures out how much	368	* an object is carrying. It goes through op and figures out how much
321	* containers are carrying, and sums it up.	369	* containers are carrying, and sums it up.
322	*/	370	*/
323	long	371	void
324	sum_weight (object *op)	372	object::update_weight ()
325	{	373	{
326	long sum;	374	sint32 sum = 0;
327	object *inv;
328		375
329	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	376	for (object *op = inv; op; op = op->below)
330	{	377	{
331	if (inv->inv)	378	if (op->inv)
332	sum_weight (inv);	379	op->update_weight ();
333	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
334	}
335		380
336	if (op->type == CONTAINER && op->stats.Str)	381	sum += op->total_weight ();
337	sum = (sum * (100 - op->stats.Str)) / 100;	382	}
338		383
339	if (op->carrying != sum)	384	carrying = weight_adjust (this, sum);
340	op->carrying = sum;
341
342	return sum;
343	}
344
345	/**
346	* Return the outermost environment object for a given object.
347	*/
348
349	object *
350	object_get_env_recursive (object *op)
351	{
352	while (op->env != NULL)
353	op = op->env;
354	return op;
355	}	385	}
356		386
357	/*	387	/*
358	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	388	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
359	* Some error messages.	389	* Some error messages.
360	* The result of the dump is stored in the static global errmsg array.	390	* The result of the dump is stored in the static global errmsg array.
361	*/	391	*/
362
363	char *	392	char *
364	dump_object (object *op)	393	dump_object (object *op)
365	{	394	{
366	if (!op)	395	if (!op)
367	return strdup ("[NULLOBJ]");	396	return strdup ("[NULLOBJ]");
368		397
369	object_freezer freezer;	398	object_freezer freezer;
370	save_object (freezer, op, 1);	399	op->write (freezer);
371	return freezer.as_string ();	400	return freezer.as_string ();
372	}	401	}
373		402
374	/*	403	/*
375	* get_nearest_part(multi-object, object 2) returns the part of the	404	* get_nearest_part(multi-object, object 2) returns the part of the
376	* multi-object 1 which is closest to the second object.	405	* multi-object 1 which is closest to the second object.
377	* If it's not a multi-object, it is returned.	406	* If it's not a multi-object, it is returned.
378	*/	407	*/
379
380	object *	408	object *
381	get_nearest_part (object *op, const object *pl)	409	get_nearest_part (object *op, const object *pl)
382	{	410	{
383	object *tmp, *closest;	411	object *tmp, *closest;
384	int last_dist, i;	412	int last_dist, i;
…		…
420	break;	448	break;
421		449
422	return op;	450	return op;
423	}	451	}
424		452
425	void
426	free_all_object_data ()
427	{
428	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
429	}
430
431	/*	453	/*
432	* Sets the owner and sets the skill and exp pointers to owner's current	454	* Sets the owner and sets the skill and exp pointers to owner's current
433	* skill and experience objects.	455	* skill and experience objects.
		456	* ACTUALLY NO! investigate! TODO
434	*/	457	*/
435	void	458	void
436	object::set_owner (object *owner)	459	object::set_owner (object *owner)
437	{	460	{
		461	// allow objects which own objects
438	if (!owner)	462	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)	463	while (owner->owner)
449	owner = owner->owner;	464	owner = owner->owner;
		465
		466	if (flag [FLAG_FREED])
		467	{
		468	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		469	return;
		470	}
450		471
451	this->owner = owner;	472	this->owner = owner;
		473	}
		474
		475	int
		476	object::slottype () const
		477	{
		478	if (type == SKILL)
		479	{
		480	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		481	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		482	}
		483	else
		484	{
		485	if (slot [body_combat].info) return slot_combat;
		486	if (slot [body_range ].info) return slot_ranged;
		487	}
		488
		489	return slot_none;
		490	}
		491
		492	bool
		493	object::change_weapon (object *ob)
		494	{
		495	if (current_weapon == ob)
		496	return true;
		497
		498	if (chosen_skill)
		499	chosen_skill->flag [FLAG_APPLIED] = false;
		500
		501	current_weapon = ob;
		502	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		503
		504	if (chosen_skill)
		505	chosen_skill->flag [FLAG_APPLIED] = true;
		506
		507	update_stats ();
		508
		509	if (ob)
		510	{
		511	// now check wether any body locations became invalid, in which case
		512	// we cannot apply the weapon at the moment.
		513	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		514	if (slot[i].used < 0)
		515	{
		516	current_weapon = chosen_skill = 0;
		517	update_stats ();
		518
		519	new_draw_info_format (NDI_UNIQUE, 0, this,
		520	"You try to balance all your items at once, "
		521	"but the %s is just too much for your body. "
		522	"[You need to unapply some items first.]", &ob->name);
		523	return false;
		524	}
		525
		526	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		527	}
		528	else
		529	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		530
		531	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		532	{
		533	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		534	&name, ob->debug_desc ());
		535	return false;
		536	}
		537
		538	return true;
452	}	539	}
453		540
454	/* Zero the key_values on op, decrementing the shared-string	541	/* Zero the key_values on op, decrementing the shared-string
455	* refcounts and freeing the links.	542	* refcounts and freeing the links.
456	*/	543	*/
457	static void	544	static void
458	free_key_values (object *op)	545	free_key_values (object *op)
459	{	546	{
460	for (key_value *i = op->key_values; i != 0;)	547	for (key_value *i = op->key_values; i; )
461	{	548	{
462	key_value *next = i->next;	549	key_value *next = i->next;
463	delete i;	550	delete i;
464		551
465	i = next;	552	i = next;
466	}	553	}
467		554
468	op->key_values = 0;	555	op->key_values = 0;
469	}	556	}
470		557
471	/*	558	object &
472	* copy_to first frees everything allocated by the dst object,	559	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	{	560	{
482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	561	bool is_freed = flag [FLAG_FREED];
483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	562	bool is_removed = flag [FLAG_REMOVED];
484		563
485	*(object_copy *)dst = *this;	564	*(object_copy *)this = src;
486		565
487	if (is_freed)	566	flag [FLAG_FREED] = is_freed;
488	SET_FLAG (dst, FLAG_FREED);	567	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		568
496	/* Copy over key_values, if any. */	569	/* Copy over key_values, if any. */
497	if (key_values)	570	if (src.key_values)
498	{	571	{
499	key_value *tail = 0;	572	key_value *tail = 0;
500	key_value *i;
501
502	dst->key_values = 0;	573	key_values = 0;
503		574
504	for (i = key_values; i; i = i->next)	575	for (key_value *i = src.key_values; i; i = i->next)
505	{	576	{
506	key_value *new_link = new key_value;	577	key_value *new_link = new key_value;
507		578
508	new_link->next = 0;	579	new_link->next = 0;
509	new_link->key = i->key;	580	new_link->key = i->key;
510	new_link->value = i->value;	581	new_link->value = i->value;
511		582
512	/* Try and be clever here, too. */	583	/* Try and be clever here, too. */
513	if (!dst->key_values)	584	if (!key_values)
514	{	585	{
515	dst->key_values = new_link;	586	key_values = new_link;
516	tail = new_link;	587	tail = new_link;
517	}	588	}
518	else	589	else
519	{	590	{
520	tail->next = new_link;	591	tail->next = new_link;
521	tail = new_link;	592	tail = new_link;
522	}	593	}
523	}	594	}
524	}	595	}
		596	}
		597
		598	/*
		599	* copy_to first frees everything allocated by the dst object,
		600	* and then copies the contents of itself into the second
		601	* object, allocating what needs to be allocated. Basically, any
		602	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		603	* if the first object is freed, the pointers in the new object
		604	* will point at garbage.
		605	*/
		606	void
		607	object::copy_to (object *dst)
		608	{
		609	*dst = *this;
		610
		611	if (speed < 0)
		612	dst->speed_left -= rndm ();
525		613
526	dst->set_speed (dst->speed);	614	dst->set_speed (dst->speed);
		615	}
		616
		617	void
		618	object::instantiate ()
		619	{
		620	if (!uuid.seq) // HACK
		621	uuid = UUID::gen ();
		622
		623	speed_left = -0.1f;
		624	/* copy the body_info to the body_used - this is only really
		625	* need for monsters, but doesn't hurt to do it for everything.
		626	* by doing so, when a monster is created, it has good starting
		627	* values for the body_used info, so when items are created
		628	* for it, they can be properly equipped.
		629	*/
		630	for (int i = NUM_BODY_LOCATIONS; i--; )
		631	slot[i].used = slot[i].info;
		632
		633	attachable::instantiate ();
527	}	634	}
528		635
529	object *	636	object *
530	object::clone ()	637	object::clone ()
531	{	638	{
…		…
589	* UP_OBJ_FACE: only the objects face has changed.	696	* UP_OBJ_FACE: only the objects face has changed.
590	*/	697	*/
591	void	698	void
592	update_object (object *op, int action)	699	update_object (object *op, int action)
593	{	700	{
594	MoveType move_on, move_off, move_block, move_slow;
595
596	if (op == NULL)	701	if (op == NULL)
597	{	702	{
598	/* this should never happen */	703	/* this should never happen */
599	LOG (llevDebug, "update_object() called for NULL object.\n");	704	LOG (llevDebug, "update_object() called for NULL object.\n");
600	return;	705	return;
…		…
670	face = blank_face;	775	face = blank_face;
671	}	776	}
672		777
673	object::~object ()	778	object::~object ()
674	{	779	{
675	if (index)
676	unlink ();	780	unlink ();
677		781
678	free_key_values (this);	782	free_key_values (this);
679	}	783	}
680		784
681	static int object_count;	785	static int object_count;
682		786
683	void object::link ()	787	void object::link ()
684	{	788	{
685	assert (!index);//D	789	assert (!index);//D
686	uuid = gen_uuid ();	790	uuid = UUID::gen ();
687	count = ++object_count;	791	count = ++object_count;
688		792
689	refcnt_inc ();	793	refcnt_inc ();
690	objects.insert (this);	794	objects.insert (this);
691	}	795	}
692		796
693	void object::unlink ()	797	void object::unlink ()
694	{	798	{
695	assert (index);//D	799	if (!index)
		800	return;
		801
696	objects.erase (this);	802	objects.erase (this);
697	refcnt_dec ();	803	refcnt_dec ();
698	}	804	}
699		805
700	void	806	void
…		…
773	* if some form of movement is allowed, let objects	879	* if some form of movement is allowed, let objects
774	* drop on that space.	880	* drop on that space.
775	*/	881	*/
776	if (!drop_to_ground	882	if (!drop_to_ground
777	|| !map	883	|| !map
778	|| map->in_memory != MAP_IN_MEMORY	884	|| map->in_memory != MAP_ACTIVE
		885	|| map->nodrop
779	|| ms ().move_block == MOVE_ALL)	886	|| ms ().move_block == MOVE_ALL)
780	{	887	{
781	while (inv)	888	while (inv)
782	{	889	{
783	inv->destroy_inv (drop_to_ground);	890	inv->destroy_inv (drop_to_ground);
…		…
837		944
838	if (!freed_map)	945	if (!freed_map)
839	{	946	{
840	freed_map = new maptile;	947	freed_map = new maptile;
841		948
		949	freed_map->path = "<freed objects map>";
842	freed_map->name = "/internal/freed_objects_map";	950	freed_map->name = "/internal/freed_objects_map";
843	freed_map->width = 3;	951	freed_map->width = 3;
844	freed_map->height = 3;	952	freed_map->height = 3;
		953	freed_map->nodrop = 1;
845		954
846	freed_map->alloc ();	955	freed_map->alloc ();
847	freed_map->in_memory = MAP_IN_MEMORY;	956	freed_map->in_memory = MAP_ACTIVE;
848	}	957	}
849		958
850	map = freed_map;	959	map = freed_map;
851	x = 1;	960	x = 1;
852	y = 1;	961	y = 1;
853	}	962	}
854		963
855	head = 0;
856
857	if (more)	964	if (more)
858	{	965	{
859	more->destroy ();	966	more->destroy ();
860	more = 0;	967	more = 0;
861	}	968	}
862		969
		970	head = 0;
		971
863	// clear those pointers that likely might have circular references to us	972	// clear those pointers that likely might cause circular references
864	owner = 0;	973	owner = 0;
865	enemy = 0;	974	enemy = 0;
866	attacked_by = 0;	975	attacked_by = 0;
		976	current_weapon = 0;
867	}	977	}
868		978
869	void	979	void
870	object::destroy (bool destroy_inventory)	980	object::destroy (bool destroy_inventory)
871	{	981	{
…		…
873	return;	983	return;
874		984
875	if (destroy_inventory)	985	if (destroy_inventory)
876	destroy_inv (false);	986	destroy_inv (false);
877		987
		988	if (is_head ())
		989	if (sound_destroy)
		990	play_sound (sound_destroy);
		991	else if (flag [FLAG_MONSTER])
		992	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
		993
878	attachable::destroy ();	994	attachable::destroy ();
879	}
880
881	/*
882	* sub_weight() recursively (outwards) subtracts a number from the
883	* weight of an object (and what is carried by it's environment(s)).
884	*/
885	void
886	sub_weight (object *op, signed long weight)
887	{
888	while (op != NULL)
889	{
890	if (op->type == CONTAINER)
891	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
892
893	op->carrying -= weight;
894	op = op->env;
895	}
896	}	995	}
897		996
898	/* op->remove ():	997	/* op->remove ():
899	* This function removes the object op from the linked list of objects	998	* This function removes the object op from the linked list of objects
900	* which it is currently tied to. When this function is done, the	999	* which it is currently tied to. When this function is done, the
901	* object will have no environment. If the object previously had an	1000	* object will have no environment. If the object previously had an
902	* environment, the x and y coordinates will be updated to	1001	* environment, the x and y coordinates will be updated to
903	* the previous environment.	1002	* the previous environment.
904	* Beware: This function is called from the editor as well!
905	*/	1003	*/
906	void	1004	void
907	object::remove_slow ()	1005	object::do_remove ()
908	{	1006	{
909	object *tmp, *last = 0;	1007	object *tmp, *last = 0;
910	object *otmp;	1008	object *otmp;
911		1009
912	if (QUERY_FLAG (this, FLAG_REMOVED))	1010	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
955	}	1053	}
956	else if (map)	1054	else if (map)
957	{	1055	{
958	if (type == PLAYER)	1056	if (type == PLAYER)
959	{	1057	{
		1058	// leaving a spot always closes any open container on the ground
		1059	if (container && !container->env)
		1060	// this causes spurious floorbox updates, but it ensures
		1061	// that the CLOSE event is being sent.
		1062	close_container ();
		1063
960	--map->players;	1064	--map->players;
961	map->touch ();	1065	map->touch ();
962	}	1066	}
963		1067
964	map->dirty = true;	1068	map->dirty = true;
…		…
991	if (map->in_memory == MAP_SAVING)	1095	if (map->in_memory == MAP_SAVING)
992	return;	1096	return;
993		1097
994	int check_walk_off = !flag [FLAG_NO_APPLY];	1098	int check_walk_off = !flag [FLAG_NO_APPLY];
995		1099
		1100	if (object *pl = ms.player ())
		1101	{
		1102	if (pl->container == this)
		1103	/* If a container that the player is currently using somehow gets
		1104	* removed (most likely destroyed), update the player view
		1105	* appropriately.
		1106	*/
		1107	pl->close_container ();
		1108
		1109	pl->contr->ns->floorbox_update ();
		1110	}
		1111
996	for (tmp = ms.bot; tmp; tmp = tmp->above)	1112	for (tmp = ms.bot; tmp; tmp = tmp->above)
997	{	1113	{
998	/* No point updating the players look faces if he is the object	1114	/* No point updating the players look faces if he is the object
999	* being removed.	1115	* being removed.
1000	*/	1116	*/
1001
1002	if (tmp->type == PLAYER && tmp != this)
1003	{
1004	/* If a container that the player is currently using somehow gets
1005	* removed (most likely destroyed), update the player view
1006	* appropriately.
1007	*/
1008	if (tmp->container == this)
1009	{
1010	flag [FLAG_APPLIED] = 0;
1011	tmp->container = 0;
1012	}
1013
1014	if (tmp->contr->ns)
1015	tmp->contr->ns->floorbox_update ();
1016	}
1017		1117
1018	/* See if object moving off should effect something */	1118	/* See if object moving off should effect something */
1019	if (check_walk_off	1119	if (check_walk_off
1020	&& ((move_type & tmp->move_off)	1120	&& ((move_type & tmp->move_off)
1021	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1121	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1024		1124
1025	if (destroyed ())	1125	if (destroyed ())
1026	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1126	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1027	}	1127	}
1028		1128
1029	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1030	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1031	if (tmp->above == tmp)
1032	tmp->above = 0;
1033
1034	last = tmp;	1129	last = tmp;
1035	}	1130	}
1036		1131
1037	/* last == NULL if there are no objects on this space */	1132	/* last == NULL if there are no objects on this space */
1038	//TODO: this makes little sense, why only update the topmost object?	1133	//TODO: this makes little sense, why only update the topmost object?
…		…
1058	merge_ob (object *op, object *top)	1153	merge_ob (object *op, object *top)
1059	{	1154	{
1060	if (!op->nrof)	1155	if (!op->nrof)
1061	return 0;	1156	return 0;
1062		1157
1063	if (top)	1158	if (!top)
1064	for (top = op; top && top->above; top = top->above)	1159	for (top = op; top && top->above; top = top->above)
1065	;	1160	;
1066		1161
1067	for (; top; top = top->below)	1162	for (; top; top = top->below)
1068	{	1163	{
…		…
1081	}	1176	}
1082		1177
1083	return 0;	1178	return 0;
1084	}	1179	}
1085		1180
		1181	void
		1182	object::expand_tail ()
		1183	{
		1184	if (more)
		1185	return;
		1186
		1187	object *prev = this;
		1188
		1189	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1190	{
		1191	object *op = arch_to_object (at);
		1192
		1193	op->name = name;
		1194	op->name_pl = name_pl;
		1195	op->title = title;
		1196
		1197	op->head = this;
		1198	prev->more = op;
		1199
		1200	prev = op;
		1201	}
		1202	}
		1203
1086	/*	1204	/*
1087	* same as insert_ob_in_map except it handles separate coordinates and does a clean	1205	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1088	* job preparing multi-part monsters.	1206	* job preparing multi-part monsters.
1089	*/	1207	*/
1090	object *	1208	object *
1091	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1209	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1092	{	1210	{
1093	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1211	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1094	{	1212	{
1095	tmp->x = x + tmp->arch->clone.x;	1213	tmp->x = x + tmp->arch->x;
1096	tmp->y = y + tmp->arch->clone.y;	1214	tmp->y = y + tmp->arch->y;
1097	}	1215	}
1098		1216
1099	return insert_ob_in_map (op, m, originator, flag);	1217	return insert_ob_in_map (op, m, originator, flag);
1100	}	1218	}
1101		1219
…		…
1120	* just 'op' otherwise	1238	* just 'op' otherwise
1121	*/	1239	*/
1122	object *	1240	object *
1123	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1241	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1124	{	1242	{
		1243	assert (!op->flag [FLAG_FREED]);
		1244
1125	object *tmp, *top, *floor = NULL;	1245	object *top, *floor = NULL;
1126
1127	if (QUERY_FLAG (op, FLAG_FREED))
1128	{
1129	LOG (llevError, "Trying to insert freed object!\n");
1130	return NULL;
1131	}
1132
1133	if (!QUERY_FLAG (op, FLAG_REMOVED))
1134	LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1135		1246
1136	op->remove ();	1247	op->remove ();
1137
1138	if (!m)
1139	{
1140	char *dump = dump_object (op);
1141	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1142	free (dump);
1143	return op;
1144	}
1145
1146	if (out_of_map (m, op->x, op->y))
1147	{
1148	char *dump = dump_object (op);
1149	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1150	#ifdef MANY_CORES
1151	/* Better to catch this here, as otherwise the next use of this object
1152	* is likely to cause a crash. Better to find out where it is getting
1153	* improperly inserted.
1154	*/
1155	abort ();
1156	#endif
1157	free (dump);
1158	return op;
1159	}
1160
1161	if (object *more = op->more)
1162	{
1163	if (!insert_ob_in_map (more, m, originator, flag))
1164	{
1165	if (!op->head)
1166	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1167
1168	return 0;
1169	}
1170	}
1171
1172	CLEAR_FLAG (op, FLAG_REMOVED);
1173		1248
1174	/* Ideally, the caller figures this out. However, it complicates a lot	1249	/* Ideally, the caller figures this out. However, it complicates a lot
1175	* of areas of callers (eg, anything that uses find_free_spot would now	1250	* of areas of callers (eg, anything that uses find_free_spot would now
1176	* need extra work	1251	* need extra work
1177	*/	1252	*/
1178	if (!xy_normalise (m, op->x, op->y))	1253	if (!xy_normalise (m, op->x, op->y))
		1254	{
		1255	op->destroy ();
1179	return 0;	1256	return 0;
		1257	}
		1258
		1259	if (object *more = op->more)
		1260	if (!insert_ob_in_map (more, m, originator, flag))
		1261	return 0;
		1262
		1263	CLEAR_FLAG (op, FLAG_REMOVED);
1180		1264
1181	op->map = m;	1265	op->map = m;
1182	mapspace &ms = op->ms ();	1266	mapspace &ms = op->ms ();
1183		1267
1184	/* this has to be done after we translate the coordinates.	1268	/* this has to be done after we translate the coordinates.
1185	*/	1269	*/
1186	if (op->nrof && !(flag & INS_NO_MERGE))	1270	if (op->nrof && !(flag & INS_NO_MERGE))
1187	for (tmp = ms.bot; tmp; tmp = tmp->above)	1271	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1188	if (object::can_merge (op, tmp))	1272	if (object::can_merge (op, tmp))
1189	{	1273	{
1190	op->nrof += tmp->nrof;	1274	op->nrof += tmp->nrof;
1191	tmp->destroy ();	1275	tmp->destroy ();
1192	}	1276	}
…		…
1219	else	1303	else
1220	{	1304	{
1221	top = ms.bot;	1305	top = ms.bot;
1222		1306
1223	/* If there are other objects, then */	1307	/* If there are other objects, then */
1224	if ((!(flag & INS_MAP_LOAD)) && top)	1308	if (top)
1225	{	1309	{
1226	object *last = 0;	1310	object *last = 0;
1227		1311
1228	/*	1312	/*
1229	* If there are multiple objects on this space, we do some trickier handling.	1313	* If there are multiple objects on this space, we do some trickier handling.
…		…
1259	* looks like instead of lots of conditions here.	1343	* looks like instead of lots of conditions here.
1260	* makes things faster, and effectively the same result.	1344	* makes things faster, and effectively the same result.
1261	*/	1345	*/
1262		1346
1263	/* Have object 'fall below' other objects that block view.	1347	/* Have object 'fall below' other objects that block view.
1264	* Unless those objects are exits, type 66	1348	* Unless those objects are exits.
1265	* If INS_ON_TOP is used, don't do this processing	1349	* If INS_ON_TOP is used, don't do this processing
1266	* Need to find the object that in fact blocks view, otherwise	1350	* Need to find the object that in fact blocks view, otherwise
1267	* stacking is a bit odd.	1351	* stacking is a bit odd.
1268	*/	1352	*/
1269	if (!(flag & INS_ON_TOP)	1353	if (!(flag & INS_ON_TOP)
1270	&& ms.flags () & P_BLOCKSVIEW	1354	&& ms.flags () & P_BLOCKSVIEW
1271	&& (op->face && !op->face->visibility))	1355	&& (op->face && !faces [op->face].visibility))
1272	{	1356	{
1273	for (last = top; last != floor; last = last->below)	1357	for (last = top; last != floor; last = last->below)
1274	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1358	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1275	break;	1359	break;
1276		1360
…		…
1282	if (last && last->below && last != floor)	1366	if (last && last->below && last != floor)
1283	top = last->below;	1367	top = last->below;
1284	}	1368	}
1285	} /* If objects on this space */	1369	} /* If objects on this space */
1286		1370
1287	if (flag & INS_MAP_LOAD)
1288	top = ms.top;
1289
1290	if (flag & INS_ABOVE_FLOOR_ONLY)	1371	if (flag & INS_ABOVE_FLOOR_ONLY)
1291	top = floor;	1372	top = floor;
1292		1373
1293	/* Top is the object that our object (op) is going to get inserted above.	1374	/* Top is the object that our object (op) is going to get inserted above.
1294	*/	1375	*/
…		…
1326	op->map->touch ();	1407	op->map->touch ();
1327	}	1408	}
1328		1409
1329	op->map->dirty = true;	1410	op->map->dirty = true;
1330		1411
1331	/* If we have a floor, we know the player, if any, will be above
1332	* it, so save a few ticks and start from there.
1333	*/
1334	if (!(flag & INS_MAP_LOAD))
1335	if (object *pl = ms.player ())	1412	if (object *pl = ms.player ())
1336	if (pl->contr->ns)
1337	pl->contr->ns->floorbox_update ();	1413	pl->contr->ns->floorbox_update ();
1338		1414
1339	/* If this object glows, it may affect lighting conditions that are	1415	/* If this object glows, it may affect lighting conditions that are
1340	* visible to others on this map. But update_all_los is really	1416	* visible to others on this map. But update_all_los is really
1341	* an inefficient way to do this, as it means los for all players	1417	* an inefficient way to do this, as it means los for all players
1342	* on the map will get recalculated. The players could very well	1418	* on the map will get recalculated. The players could very well
…		…
1361	* blocked() and wall() work properly), and these flags are updated by	1437	* blocked() and wall() work properly), and these flags are updated by
1362	* update_object().	1438	* update_object().
1363	*/	1439	*/
1364		1440
1365	/* if this is not the head or flag has been passed, don't check walk on status */	1441	/* if this is not the head or flag has been passed, don't check walk on status */
1366	if (!(flag & INS_NO_WALK_ON) && !op->head)	1442	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1367	{	1443	{
1368	if (check_move_on (op, originator))	1444	if (check_move_on (op, originator))
1369	return 0;	1445	return 0;
1370		1446
1371	/* If we are a multi part object, lets work our way through the check	1447	/* If we are a multi part object, lets work our way through the check
1372	* walk on's.	1448	* walk on's.
1373	*/	1449	*/
1374	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1450	for (object *tmp = op->more; tmp; tmp = tmp->more)
1375	if (check_move_on (tmp, originator))	1451	if (check_move_on (tmp, originator))
1376	return 0;	1452	return 0;
1377	}	1453	}
1378		1454
1379	return op;	1455	return op;
…		…
1389	object *tmp, *tmp1;	1465	object *tmp, *tmp1;
1390		1466
1391	/* first search for itself and remove any old instances */	1467	/* first search for itself and remove any old instances */
1392		1468
1393	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1469	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1394	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1470	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1395	tmp->destroy ();	1471	tmp->destroy ();
1396		1472
1397	tmp1 = arch_to_object (archetype::find (arch_string));	1473	tmp1 = arch_to_object (archetype::find (arch_string));
1398		1474
1399	tmp1->x = op->x;	1475	tmp1->x = op->x;
…		…
1402	}	1478	}
1403		1479
1404	object *	1480	object *
1405	object::insert_at (object *where, object *originator, int flags)	1481	object::insert_at (object *where, object *originator, int flags)
1406	{	1482	{
		1483	if (where->env)
		1484	return where->env->insert (this);
		1485	else
1407	where->map->insert (this, where->x, where->y, originator, flags);	1486	return where->map->insert (this, where->x, where->y, originator, flags);
1408	}	1487	}
1409		1488
1410	/*	1489	/*
1411	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1490	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1412	* is returned contains nr objects, and the remaining parts contains	1491	* is returned contains nr objects, and the remaining parts contains
…		…
1432	orig_ob->destroy (1);	1511	orig_ob->destroy (1);
1433	else if (!is_removed)	1512	else if (!is_removed)
1434	{	1513	{
1435	if (orig_ob->env != NULL)	1514	if (orig_ob->env != NULL)
1436	sub_weight (orig_ob->env, orig_ob->weight * nr);	1515	sub_weight (orig_ob->env, orig_ob->weight * nr);
1437	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)	1516	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_ACTIVE)
1438	{	1517	{
1439	strcpy (errmsg, "Tried to split object whose map is not in memory.");	1518	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1440	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");	1519	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1441	return NULL;	1520	return NULL;
1442	}	1521	}
…		…
1452	* the amount of an object. If the amount reaches 0, the object	1531	* the amount of an object. If the amount reaches 0, the object
1453	* is subsequently removed and freed.	1532	* is subsequently removed and freed.
1454	*	1533	*
1455	* Return value: 'op' if something is left, NULL if the amount reached 0	1534	* Return value: 'op' if something is left, NULL if the amount reached 0
1456	*/	1535	*/
1457
1458	object *	1536	object *
1459	decrease_ob_nr (object *op, uint32 i)	1537	decrease_ob_nr (object *op, uint32 i)
1460	{	1538	{
1461	object *tmp;	1539	object *tmp;
1462		1540
…		…
1533	op->destroy ();	1611	op->destroy ();
1534	return 0;	1612	return 0;
1535	}	1613	}
1536	}	1614	}
1537		1615
1538	/*
1539	* add_weight(object, weight) adds the specified weight to an object,
1540	* and also updates how much the environment(s) is/are carrying.
1541	*/
1542
1543	void
1544	add_weight (object *op, signed long weight)
1545	{
1546	while (op != NULL)
1547	{
1548	if (op->type == CONTAINER)
1549	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1550
1551	op->carrying += weight;
1552	op = op->env;
1553	}
1554	}
1555
1556	object *	1616	object *
1557	insert_ob_in_ob (object *op, object *where)	1617	insert_ob_in_ob (object *op, object *where)
1558	{	1618	{
1559	if (!where)	1619	if (!where)
1560	{	1620	{
…		…
1562	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1622	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1563	free (dump);	1623	free (dump);
1564	return op;	1624	return op;
1565	}	1625	}
1566		1626
1567	if (where->head)	1627	if (where->head_ () != where)
1568	{	1628	{
1569	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1629	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1570	where = where->head;	1630	where = where->head;
1571	}	1631	}
1572		1632
1573	return where->insert (op);	1633	return where->insert (op);
1574	}	1634	}
…		…
1579	* inside the object environment.	1639	* inside the object environment.
1580	*	1640	*
1581	* The function returns now pointer to inserted item, and return value can	1641	* The function returns now pointer to inserted item, and return value can
1582	* be != op, if items are merged. -Tero	1642	* be != op, if items are merged. -Tero
1583	*/	1643	*/
1584
1585	object *	1644	object *
1586	object::insert (object *op)	1645	object::insert (object *op)
1587	{	1646	{
1588	object *tmp, *otmp;
1589
1590	if (!QUERY_FLAG (op, FLAG_REMOVED))	1647	if (!QUERY_FLAG (op, FLAG_REMOVED))
1591	op->remove ();	1648	op->remove ();
1592		1649
1593	if (op->more)	1650	if (op->more)
1594	{	1651	{
…		…
1596	return op;	1653	return op;
1597	}	1654	}
1598		1655
1599	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1656	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1600	CLEAR_FLAG (op, FLAG_REMOVED);	1657	CLEAR_FLAG (op, FLAG_REMOVED);
		1658
1601	if (op->nrof)	1659	if (op->nrof)
1602	{	1660	{
1603	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1661	for (object *tmp = inv; tmp; tmp = tmp->below)
1604	if (object::can_merge (tmp, op))	1662	if (object::can_merge (tmp, op))
1605	{	1663	{
1606	/* return the original object and remove inserted object	1664	/* return the original object and remove inserted object
1607	(client needs the original object) */	1665	(client needs the original object) */
1608	tmp->nrof += op->nrof;	1666	tmp->nrof += op->nrof;
…		…
1627	add_weight (this, op->weight * op->nrof);	1685	add_weight (this, op->weight * op->nrof);
1628	}	1686	}
1629	else	1687	else
1630	add_weight (this, (op->weight + op->carrying));	1688	add_weight (this, (op->weight + op->carrying));
1631		1689
1632	otmp = this->in_player ();	1690	if (object *otmp = this->in_player ())
1633	if (otmp && otmp->contr)
1634	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1691	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1635	otmp->update_stats ();	1692	otmp->update_stats ();
1636		1693
		1694	op->owner = 0; // its his/hers now. period.
1637	op->map = 0;	1695	op->map = 0;
1638	op->env = this;	1696	op->env = this;
1639	op->above = 0;	1697	op->above = 0;
1640	op->below = 0;	1698	op->below = 0;
1641	op->x = 0, op->y = 0;	1699	op->x = op->y = 0;
1642		1700
1643	/* reset the light list and los of the players on the map */	1701	/* reset the light list and los of the players on the map */
1644	if ((op->glow_radius != 0) && map)	1702	if (op->glow_radius && map)
1645	{	1703	{
1646	#ifdef DEBUG_LIGHTS	1704	#ifdef DEBUG_LIGHTS
1647	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1705	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1648	#endif /* DEBUG_LIGHTS */	1706	#endif /* DEBUG_LIGHTS */
1649	if (map->darkness)	1707	if (map->darkness)
…		…
1883	* activate recursively a flag on an object inventory	1941	* activate recursively a flag on an object inventory
1884	*/	1942	*/
1885	void	1943	void
1886	flag_inv (object *op, int flag)	1944	flag_inv (object *op, int flag)
1887	{	1945	{
1888	if (op->inv)
1889	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1946	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1890	{	1947	{
1891	SET_FLAG (tmp, flag);	1948	SET_FLAG (tmp, flag);
1892	flag_inv (tmp, flag);	1949	flag_inv (tmp, flag);
1893	}	1950	}
1894	}	1951	}
1895		1952
1896	/*	1953	/*
1897	* deactivate recursively a flag on an object inventory	1954	* deactivate recursively a flag on an object inventory
1898	*/	1955	*/
1899	void	1956	void
1900	unflag_inv (object *op, int flag)	1957	unflag_inv (object *op, int flag)
1901	{	1958	{
1902	if (op->inv)
1903	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1959	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1904	{	1960	{
1905	CLEAR_FLAG (tmp, flag);	1961	CLEAR_FLAG (tmp, flag);
1906	unflag_inv (tmp, flag);	1962	unflag_inv (tmp, flag);
1907	}	1963	}
1908	}
1909
1910	/*
1911	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1912	* all it's inventory (recursively).
1913	* If checksums are used, a player will get set_cheat called for
1914	* him/her-self and all object carried by a call to this function.
1915	*/
1916	void
1917	set_cheat (object *op)
1918	{
1919	SET_FLAG (op, FLAG_WAS_WIZ);
1920	flag_inv (op, FLAG_WAS_WIZ);
1921	}	1964	}
1922		1965
1923	/*	1966	/*
1924	* find_free_spot(object, map, x, y, start, stop) will search for	1967	* find_free_spot(object, map, x, y, start, stop) will search for
1925	* a spot at the given map and coordinates which will be able to contain	1968	* a spot at the given map and coordinates which will be able to contain
…		…
1927	* to search (see the freearr_x/y[] definition).	1970	* to search (see the freearr_x/y[] definition).
1928	* It returns a random choice among the alternatives found.	1971	* It returns a random choice among the alternatives found.
1929	* start and stop are where to start relative to the free_arr array (1,9	1972	* start and stop are where to start relative to the free_arr array (1,9
1930	* does all 4 immediate directions). This returns the index into the	1973	* does all 4 immediate directions). This returns the index into the
1931	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1974	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1932	* Note - this only checks to see if there is space for the head of the
1933	* object - if it is a multispace object, this should be called for all
1934	* pieces.
1935	* Note2: This function does correctly handle tiled maps, but does not	1975	* Note: This function does correctly handle tiled maps, but does not
1936	* inform the caller. However, insert_ob_in_map will update as	1976	* inform the caller. However, insert_ob_in_map will update as
1937	* necessary, so the caller shouldn't need to do any special work.	1977	* necessary, so the caller shouldn't need to do any special work.
1938	* Note - updated to take an object instead of archetype - this is necessary	1978	* Note - updated to take an object instead of archetype - this is necessary
1939	* because arch_blocked (now ob_blocked) needs to know the movement type	1979	* because arch_blocked (now ob_blocked) needs to know the movement type
1940	* to know if the space in question will block the object. We can't use	1980	* to know if the space in question will block the object. We can't use
…		…
1942	* customized, changed states, etc.	1982	* customized, changed states, etc.
1943	*/	1983	*/
1944	int	1984	int
1945	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1985	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
1946	{	1986	{
		1987	int altern[SIZEOFFREE];
1947	int index = 0, flag;	1988	int index = 0, flag;
1948	int altern[SIZEOFFREE];
1949		1989
1950	for (int i = start; i < stop; i++)	1990	for (int i = start; i < stop; i++)
1951	{	1991	{
1952	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1992	mapxy pos (m, x, y); pos.move (i);
1953	if (!flag)	1993
		1994	if (!pos.normalise ())
		1995	continue;
		1996
		1997	mapspace &ms = *pos;
		1998
		1999	if (ms.flags () & P_IS_ALIVE)
		2000	continue;
		2001
		2002	/* However, often
		2003	* ob doesn't have any move type (when used to place exits)
		2004	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2005	*/
		2006	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2007	{
1954	altern [index++] = i;	2008	altern [index++] = i;
		2009	continue;
		2010	}
1955		2011
1956	/* Basically, if we find a wall on a space, we cut down the search size.	2012	/* Basically, if we find a wall on a space, we cut down the search size.
1957	* In this way, we won't return spaces that are on another side of a wall.	2013	* In this way, we won't return spaces that are on another side of a wall.
1958	* This mostly work, but it cuts down the search size in all directions -	2014	* This mostly work, but it cuts down the search size in all directions -
1959	* if the space being examined only has a wall to the north and empty	2015	* if the space being examined only has a wall to the north and empty
1960	* spaces in all the other directions, this will reduce the search space	2016	* spaces in all the other directions, this will reduce the search space
1961	* to only the spaces immediately surrounding the target area, and	2017	* to only the spaces immediately surrounding the target area, and
1962	* won't look 2 spaces south of the target space.	2018	* won't look 2 spaces south of the target space.
1963	*/	2019	*/
1964	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2020	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2021	{
1965	stop = maxfree[i];	2022	stop = maxfree[i];
		2023	continue;
		2024	}
		2025
		2026	/* Note it is intentional that we check ob - the movement type of the
		2027	* head of the object should correspond for the entire object.
		2028	*/
		2029	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2030	continue;
		2031
		2032	if (ob->blocked (m, pos.x, pos.y))
		2033	continue;
		2034
		2035	altern [index++] = i;
1966	}	2036	}
1967		2037
1968	if (!index)	2038	if (!index)
1969	return -1;	2039	return -1;
1970		2040
1971	return altern[RANDOM () % index];	2041	return altern [rndm (index)];
1972	}	2042	}
1973		2043
1974	/*	2044	/*
1975	* find_first_free_spot(archetype, maptile, x, y) works like	2045	* find_first_free_spot(archetype, maptile, x, y) works like
1976	* find_free_spot(), but it will search max number of squares.	2046	* find_free_spot(), but it will search max number of squares.
…		…
1979	*/	2049	*/
1980	int	2050	int
1981	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2051	find_first_free_spot (const object *ob, maptile *m, int x, int y)
1982	{	2052	{
1983	for (int i = 0; i < SIZEOFFREE; i++)	2053	for (int i = 0; i < SIZEOFFREE; i++)
1984	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2054	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
1985	return i;	2055	return i;
1986		2056
1987	return -1;	2057	return -1;
1988	}	2058	}
1989		2059
…		…
1997	{	2067	{
1998	arr += begin;	2068	arr += begin;
1999	end -= begin;	2069	end -= begin;
2000		2070
2001	while (--end)	2071	while (--end)
2002	swap (arr [end], arr [RANDOM () % (end + 1)]);	2072	swap (arr [end], arr [rndm (end + 1)]);
2003	}	2073	}
2004		2074
2005	/* new function to make monster searching more efficient, and effective!	2075	/* new function to make monster searching more efficient, and effective!
2006	* This basically returns a randomized array (in the passed pointer) of	2076	* This basically returns a randomized array (in the passed pointer) of
2007	* the spaces to find monsters. In this way, it won't always look for	2077	* the spaces to find monsters. In this way, it won't always look for
…		…
2043	object *tmp;	2113	object *tmp;
2044	maptile *mp;	2114	maptile *mp;
2045		2115
2046	MoveType blocked, move_type;	2116	MoveType blocked, move_type;
2047		2117
2048	if (exclude && exclude->head)	2118	if (exclude && exclude->head_ () != exclude)
2049	{	2119	{
2050	exclude = exclude->head;	2120	exclude = exclude->head;
2051	move_type = exclude->move_type;	2121	move_type = exclude->move_type;
2052	}	2122	}
2053	else	2123	else
…		…
2076	max = maxfree[i];	2146	max = maxfree[i];
2077	else if (mflags & P_IS_ALIVE)	2147	else if (mflags & P_IS_ALIVE)
2078	{	2148	{
2079	for (tmp = ms.bot; tmp; tmp = tmp->above)	2149	for (tmp = ms.bot; tmp; tmp = tmp->above)
2080	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2150	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2081	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2151	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2082	break;	2152	break;
2083		2153
2084	if (tmp)	2154	if (tmp)
2085	return freedir[i];	2155	return freedir[i];
2086	}	2156	}
…		…
2266	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2336	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2267	* core dumps if they do.	2337	* core dumps if they do.
2268	*	2338	*
2269	* Add a check so we can't pick up invisible objects (0.93.8)	2339	* Add a check so we can't pick up invisible objects (0.93.8)
2270	*/	2340	*/
2271
2272	int	2341	int
2273	can_pick (const object *who, const object *item)	2342	can_pick (const object *who, const object *item)
2274	{	2343	{
2275	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2344	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2276	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2345	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2281	* create clone from object to another	2350	* create clone from object to another
2282	*/	2351	*/
2283	object *	2352	object *
2284	object_create_clone (object *asrc)	2353	object_create_clone (object *asrc)
2285	{	2354	{
2286	object *dst = 0, *tmp, *src, *part, *prev, *item;	2355	object *dst = 0, *tmp, *src, *prev, *item;
2287		2356
2288	if (!asrc)	2357	if (!asrc)
2289	return 0;	2358	return 0;
2290		2359
2291	src = asrc;
2292	if (src->head)
2293	src = src->head;	2360	src = asrc->head_ ();
2294		2361
2295	prev = 0;	2362	prev = 0;
2296	for (part = src; part; part = part->more)	2363	for (object *part = src; part; part = part->more)
2297	{	2364	{
2298	tmp = part->clone ();	2365	tmp = part->clone ();
2299	tmp->x -= src->x;	2366	tmp->x -= src->x;
2300	tmp->y -= src->y;	2367	tmp->y -= src->y;
2301		2368
…		…
2317		2384
2318	for (item = src->inv; item; item = item->below)	2385	for (item = src->inv; item; item = item->below)
2319	insert_ob_in_ob (object_create_clone (item), dst);	2386	insert_ob_in_ob (object_create_clone (item), dst);
2320		2387
2321	return dst;	2388	return dst;
2322	}
2323
2324	/* GROS - Creates an object using a string representing its content. */
2325	/* Basically, we save the content of the string to a temp file, then call */
2326	/* load_object on it. I admit it is a highly inefficient way to make things, */
2327	/* but it was simple to make and allows reusing the load_object function. */
2328	/* Remember not to use load_object_str in a time-critical situation. */
2329	/* Also remember that multiparts objects are not supported for now. */
2330	object *
2331	load_object_str (const char *obstr)
2332	{
2333	object *op;
2334	char filename[MAX_BUF];
2335
2336	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2337
2338	FILE *tempfile = fopen (filename, "w");
2339
2340	if (tempfile == NULL)
2341	{
2342	LOG (llevError, "Error - Unable to access load object temp file\n");
2343	return NULL;
2344	}
2345
2346	fprintf (tempfile, obstr);
2347	fclose (tempfile);
2348
2349	op = object::create ();
2350
2351	object_thawer thawer (filename);
2352
2353	if (thawer)
2354	load_object (thawer, op, 0);
2355
2356	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2357	CLEAR_FLAG (op, FLAG_REMOVED);
2358
2359	return op;
2360	}	2389	}
2361		2390
2362	/* This returns the first object in who's inventory that	2391	/* This returns the first object in who's inventory that
2363	* has the same type and subtype match.	2392	* has the same type and subtype match.
2364	* returns NULL if no match.	2393	* returns NULL if no match.
…		…
2419	if (link->key == canonical_key)	2448	if (link->key == canonical_key)
2420	return link->value;	2449	return link->value;
2421		2450
2422	return 0;	2451	return 0;
2423	}	2452	}
2424
2425		2453
2426	/*	2454	/*
2427	* Updates the canonical_key in op to value.	2455	* Updates the canonical_key in op to value.
2428	*	2456	*
2429	* canonical_key is a shared string (value doesn't have to be).	2457	* canonical_key is a shared string (value doesn't have to be).
…		…
2453	/* Basically, if the archetype has this key set,	2481	/* Basically, if the archetype has this key set,
2454	* we need to store the null value so when we save	2482	* we need to store the null value so when we save
2455	* it, we save the empty value so that when we load,	2483	* it, we save the empty value so that when we load,
2456	* we get this value back again.	2484	* we get this value back again.
2457	*/	2485	*/
2458	if (get_ob_key_link (&op->arch->clone, canonical_key))	2486	if (get_ob_key_link (op->arch, canonical_key))
2459	field->value = 0;	2487	field->value = 0;
2460	else	2488	else
2461	{	2489	{
2462	if (last)	2490	if (last)
2463	last->next = field->next;	2491	last->next = field->next;
…		…
2532	}	2560	}
2533	else	2561	else
2534	item = item->env;	2562	item = item->env;
2535	}	2563	}
2536		2564
2537
2538	const char *	2565	const char *
2539	object::flag_desc (char *desc, int len) const	2566	object::flag_desc (char *desc, int len) const
2540	{	2567	{
2541	char *p = desc;	2568	char *p = desc;
2542	bool first = true;	2569	bool first = true;
…		…
2569	{	2596	{
2570	char flagdesc[512];	2597	char flagdesc[512];
2571	char info2[256 * 4];	2598	char info2[256 * 4];
2572	char *p = info;	2599	char *p = info;
2573		2600
2574	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2601	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2575	count, uuid.seq,	2602	count,
		2603	uuid.c_str (),
2576	&name,	2604	&name,
2577	title ? "\",title:\"" : "",	2605	title ? "\",title:\"" : "",
2578	title ? (const char *)title : "",	2606	title ? (const char *)title : "",
2579	flag_desc (flagdesc, 512), type);	2607	flag_desc (flagdesc, 512), type);
2580		2608
2581	if (env)	2609	if (!this->flag[FLAG_REMOVED] && env)
2582	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2610	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2583		2611
2584	if (map)	2612	if (map)
2585	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2613	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2586		2614
…		…
2588	}	2616	}
2589		2617
2590	const char *	2618	const char *
2591	object::debug_desc () const	2619	object::debug_desc () const
2592	{	2620	{
2593	static char info[256 * 4];	2621	static char info[3][256 * 4];
		2622	static int info_idx;
		2623
2594	return debug_desc (info);	2624	return debug_desc (info [++info_idx % 3]);
2595	}	2625	}
2596		2626
2597	const char *	2627	struct region *
2598	object::debug_desc2 () const	2628	object::region () const
2599	{	2629	{
2600	static char info[256 * 4];	2630	return map ? map->region (x, y)
2601	return debug_desc (info);	2631	: region::default_region ();
2602	}	2632	}
2603		2633
		2634	const materialtype_t *
		2635	object::dominant_material () const
		2636	{
		2637	if (materialtype_t *mt = name_to_material (materialname))
		2638	return mt;
		2639
		2640	return name_to_material (shstr_unknown);
		2641	}
		2642
		2643	void
		2644	object::open_container (object *new_container)
		2645	{
		2646	if (container == new_container)
		2647	return;
		2648
		2649	if (object *old_container = container)
		2650	{
		2651	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2652	return;
		2653
		2654	#if 0
		2655	// remove the "Close old_container" object.
		2656	if (object *closer = old_container->inv)
		2657	if (closer->type == CLOSE_CON)
		2658	closer->destroy ();
		2659	#endif
		2660
		2661	old_container->flag [FLAG_APPLIED] = 0;
		2662	container = 0;
		2663
		2664	esrv_update_item (UPD_FLAGS, this, old_container);
		2665	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2666	play_sound (sound_find ("chest_close"));
		2667	}
		2668
		2669	if (new_container)
		2670	{
		2671	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2672	return;
		2673
		2674	// TODO: this does not seem to serve any purpose anymore?
		2675	#if 0
		2676	// insert the "Close Container" object.
		2677	if (archetype *closer = new_container->other_arch)
		2678	{
		2679	object *closer = arch_to_object (new_container->other_arch);
		2680	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2681	new_container->insert (closer);
		2682	}
		2683	#endif
		2684
		2685	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2686
		2687	new_container->flag [FLAG_APPLIED] = 1;
		2688	container = new_container;
		2689
		2690	esrv_update_item (UPD_FLAGS, this, new_container);
		2691	esrv_send_inventory (this, new_container);
		2692	play_sound (sound_find ("chest_open"));
		2693	}
		2694	}
		2695
		2696	object *
		2697	object::force_find (const shstr name)
		2698	{
		2699	/* cycle through his inventory to look for the MARK we want to
		2700	* place
		2701	*/
		2702	for (object *tmp = inv; tmp; tmp = tmp->below)
		2703	if (tmp->type == FORCE && tmp->slaying == name)
		2704	return splay (tmp);
		2705
		2706	return 0;
		2707	}
		2708
		2709	void
		2710	object::force_add (const shstr name, int duration)
		2711	{
		2712	if (object *force = force_find (name))
		2713	force->destroy ();
		2714
		2715	object *force = get_archetype (FORCE_NAME);
		2716
		2717	force->slaying = name;
		2718	force->stats.food = 1;
		2719	force->speed_left = -1.f;
		2720
		2721	force->set_speed (duration ? 1.f / duration : 0.f);
		2722	force->flag [FLAG_IS_USED_UP] = true;
		2723	force->flag [FLAG_APPLIED] = true;
		2724
		2725	insert (force);
		2726	}
		2727
		2728	void
		2729	object::play_sound (faceidx sound) const
		2730	{
		2731	if (!sound)
		2732	return;
		2733
		2734	if (flag [FLAG_REMOVED])
		2735	return;
		2736
		2737	if (env)
		2738	{
		2739	if (object *pl = in_player ())
		2740	pl->contr->play_sound (sound);
		2741	}
		2742	else
		2743	map->play_sound (sound, x, y);
		2744	}
		2745

Diff Legend

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