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.112 by root, Mon Jan 8 14:11:04 2007 UTC vs.
Revision 1.209 by root, Mon Apr 21 06:35:26 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,2008 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.	20	*
21		21	* The authors can be reached via e-mail to <support@deliantra.net>
22	The authors can be reached via e-mail at <crossfire@schmorp.de>
23	*/	22	*/
24		23
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying
27	variable. */
28	#include <global.h>	24	#include <global.h>
29	#include <stdio.h>	25	#include <stdio.h>
30	#include <sys/types.h>	26	#include <sys/types.h>
31	#include <sys/uio.h>	27	#include <sys/uio.h>
32	#include <object.h>	28	#include <object.h>
33	#include <funcpoint.h>	29	#include <funcpoint.h>
		30	#include <sproto.h>
34	#include <loader.h>	31	#include <loader.h>
35		32
36	#include <bitset>	33	#include <bitset>
37		34
38	int nrofallocobjects = 0;	35	UUID UUID::cur;
39	static UUID uuid;	36	static uint64_t seq_next_save;
40	const uint64 UUID_SKIP = 1<<19;	37	static const uint64 UUID_GAP = 1<<19;
41		38
42	objectvec objects;	39	objectvec objects;
43	activevec actives;	40	activevec actives;
44		41
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,	42	short freearr_x[SIZEOFFREE] = {
		43	0,
		44	0, 1, 1, 1, 0, -1, -1, -1,
		45	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	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
47	};	47	};
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,	48	short freearr_y[SIZEOFFREE] = {
		49	0,
		50	-1, -1, 0, 1, 1, 1, 0, -1,
		51	-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	52	-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	};	53	};
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,	54	int maxfree[SIZEOFFREE] = {
		55	0,
		56	9, 10, 13, 14, 17, 18, 21, 22,
		57	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	58	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	};	59	};
54	int freedir[SIZEOFFREE] = {	60	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,	61	0,
		62	1, 2, 3, 4, 5, 6, 7, 8,
		63	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	64	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	};	65	};
58		66
59	static void	67	static void
60	write_uuid (void)	68	write_uuid (uval64 skip, bool sync)
61	{	69	{
62	char filename1[MAX_BUF], filename2[MAX_BUF];	70	CALL_BEGIN (2);
63		71	CALL_ARG_SV (newSVval64 (skip));
64	sprintf (filename1, "%s/uuid", settings.localdir);	72	CALL_ARG_SV (boolSV (sync));
65	sprintf (filename2, "%s/uuid~", settings.localdir);	73	CALL_CALL ("cf::write_uuid", G_DISCARD);
66		74	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	}	75	}
79		76
80	static void	77	static void
81	read_uuid (void)	78	read_uuid (void)
82	{	79	{
83	char filename[MAX_BUF];	80	char filename[MAX_BUF];
84		81
85	sprintf (filename, "%s/uuid", settings.localdir);	82	sprintf (filename, "%s/uuid", settings.localdir);
86		83
		84	seq_next_save = 0;
		85
87	FILE *fp;	86	FILE *fp;
88		87
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_GAP, 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_GAP, 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 >= seq_next_save))
125	write_uuid ();	126	{
		127	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		128	write_uuid (UUID_GAP, false);
		129	}
		130
126		131
127	return uid;	132	return uid;
128	}	133	}
129		134
130	void	135	void
131	init_uuid ()	136	UUID::init ()
132	{	137	{
133	read_uuid ();	138	read_uuid ();
134	}	139	}
135		140
136	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	141	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
137	static int	142	static bool
138	compare_ob_value_lists_one (const object *wants, const object *has)	143	compare_ob_value_lists_one (const object *wants, const object *has)
139	{	144	{
140	key_value *wants_field;	145	key_value *wants_field;
141		146
142	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	147	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both
…		…
150	key_value *has_field;	155	key_value *has_field;
151		156
152	/* Look for a field in has with the same key. */	157	/* Look for a field in has with the same key. */
153	has_field = get_ob_key_link (has, wants_field->key);	158	has_field = get_ob_key_link (has, wants_field->key);
154		159
155	if (has_field == NULL)	160	if (!has_field)
156	{
157	/* No field with that name. */	161	return 0; /* No field with that name. */
158	return FALSE;
159	}
160		162
161	/* Found the matching field. */	163	/* Found the matching field. */
162	if (has_field->value != wants_field->value)	164	if (has_field->value != wants_field->value)
163	{
164	/* Values don't match, so this half of the comparison is false. */	165	return 0; /* Values don't match, so this half of the comparison is false. */
165	return FALSE;
166	}
167		166
168	/* If we get here, we found a match. Now for the next field in wants. */	167	/* If we get here, we found a match. Now for the next field in wants. */
169	}	168	}
170		169
171	/* If we get here, every field in wants has a matching field in has. */	170	/* If we get here, every field in wants has a matching field in has. */
172	return TRUE;	171	return 1;
173	}	172	}
174		173
175	/* Returns TRUE if ob1 has the same key_values as ob2. */	174	/* Returns TRUE if ob1 has the same key_values as ob2. */
176	static int	175	static bool
177	compare_ob_value_lists (const object *ob1, const object *ob2)	176	compare_ob_value_lists (const object *ob1, const object *ob2)
178	{	177	{
179	/* However, there may be fields in has which aren't partnered in wants,	178	/* However, there may be fields in has which aren't partnered in wants,
180	* so we need to run the comparison *twice*. :(	179	* so we need to run the comparison *twice*. :(
181	*/	180	*/
…		…
202	|| ob1->speed != ob2->speed	201	|| ob1->speed != ob2->speed
203	|| ob1->value != ob2->value	202	|| ob1->value != ob2->value
204	|| ob1->name != ob2->name)	203	|| ob1->name != ob2->name)
205	return 0;	204	return 0;
206		205
207	//TODO: this ain't working well, use nicer and correct overflow check	206	/* 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	207	* for unsigned overflow (2c), second part checks whether the result
209	* value could not be stored in a sint32 (which unfortunately sometimes is	208	* would fit into a 32 bit signed int, which is often used to hold
210	* used to store nrof).	209	* nrof values.
211	*/	210	*/
212	if (ob1->nrof + ob2->nrof >= 1UL << 31)	211	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
213	return 0;	212	return 0;
214		213
215	/* If the objects have been identified, set the BEEN_APPLIED flag.	214	/* 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	215	* 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	216	* 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	217	* are not equal - just if it has been identified, the been_applied
219	* flags lose any meaning.	218	* flags lose any meaning.
220	*/	219	*/
221	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	220	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
222	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
223		222
224	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
225	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
226		225
227	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	226	if (ob1->arch->name != ob2->arch->name
228	|| ob1->arch != ob2->arch
229	|| ob1->name != ob2->name	227	|| ob1->name != ob2->name
230	|| ob1->title != ob2->title	228	|| ob1->title != ob2->title
231	|| ob1->msg != ob2->msg	229	|| ob1->msg != ob2->msg
232	|| ob1->weight != ob2->weight	230	|| ob1->weight != ob2->weight
233	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
234	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
235	|| ob1->attacktype != ob2->attacktype	231	|| ob1->attacktype != ob2->attacktype
236	|| ob1->magic != ob2->magic	232	|| ob1->magic != ob2->magic
237	|| ob1->slaying != ob2->slaying	233	|| ob1->slaying != ob2->slaying
238	|| ob1->skill != ob2->skill	234	|| ob1->skill != ob2->skill
239	|| ob1->value != ob2->value	235	|| ob1->value != ob2->value
…		…
246	|| ob1->move_block != ob2->move_block	242	|| ob1->move_block != ob2->move_block
247	|| ob1->move_allow != ob2->move_allow	243	|| ob1->move_allow != ob2->move_allow
248	|| ob1->move_on != ob2->move_on	244	|| ob1->move_on != ob2->move_on
249	|| ob1->move_off != ob2->move_off	245	|| ob1->move_off != ob2->move_off
250	|| ob1->move_slow != ob2->move_slow	246	|| ob1->move_slow != ob2->move_slow
251	|| ob1->move_slow_penalty != ob2->move_slow_penalty)	247	|| ob1->move_slow_penalty != ob2->move_slow_penalty
		248	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
		249	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
252	return 0;	250	return 0;
253		251
		252	if ((ob1->flag ^ ob2->flag)
		253	.reset (FLAG_INV_LOCKED)
		254	.reset (FLAG_CLIENT_SENT)
		255	.reset (FLAG_REMOVED)
		256	.any ())
		257	return 0;
		258
254	/* This is really a spellbook check - really, we should	259	/* This is really a spellbook check - we should in general
255	* check all objects in the inventory.	260	* not merge objects with real inventories, as splitting them
		261	* is hard.
256	*/	262	*/
257	if (ob1->inv || ob2->inv)	263	if (ob1->inv || ob2->inv)
258	{	264	{
259	/* if one object has inventory but the other doesn't, not equiv */	265	if (!(ob1->inv && ob2->inv))
260	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	266	return 0; /* inventories differ in length */
261	return 0;
262		267
263	/* Now check to see if the two inventory objects could merge */	268	if (ob1->inv->below || ob2->inv->below)
		269	return 0; /* more than one object in inv */
		270
264	if (!object::can_merge (ob1->inv, ob2->inv))	271	if (!object::can_merge (ob1->inv, ob2->inv))
265	return 0;	272	return 0; /* inventory objects differ */
266		273
267	/* inventory ok - still need to check rest of this object to see	274	/* inventory ok - still need to check rest of this object to see
268	* if it is valid.	275	* if it is valid.
269	*/	276	*/
270	}	277	}
…		…
289	if (ob1->level != ob2->level)	296	if (ob1->level != ob2->level)
290	return 0;	297	return 0;
291	break;	298	break;
292	}	299	}
293		300
294	if (ob1->key_values != NULL || ob2->key_values != NULL)	301	if (ob1->key_values || ob2->key_values)
295	{	302	{
296	/* At least one of these has key_values. */	303	/* At least one of these has key_values. */
297	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	304	if ((!ob1->key_values) != (!ob2->key_values))
298	/* One has fields, but the other one doesn't. */	305	return 0; /* One has fields, but the other one doesn't. */
		306
		307	if (!compare_ob_value_lists (ob1, ob2))
299	return 0;	308	return 0;
300	else if (!compare_ob_value_lists (ob1, ob2))
301	return 0;
302	}	309	}
303		310
304	//TODO: generate an event or call into perl for additional checks
305	if (ob1->self || ob2->self)	311	if (ob1->self || ob2->self)
306	{	312	{
307	ob1->optimise ();	313	ob1->optimise ();
308	ob2->optimise ();	314	ob2->optimise ();
309		315
310	if (ob1->self || ob2->self)	316	if (ob1->self || ob2->self)
		317	{
		318	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		319	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		320
		321	if (k1 != k2)
311	return 0;	322	return 0;
		323
		324	if (k1 == 0)
		325	return 1;
		326
		327	if (!cfperl_can_merge (ob1, ob2))
		328	return 0;
		329	}
312	}	330	}
313		331
314	/* Everything passes, must be OK. */	332	/* Everything passes, must be OK. */
315	return 1;	333	return 1;
316	}	334	}
317		335
		336	// adjust weight per container type ("of holding")
		337	static sint32
		338	weight_adjust (object *op, sint32 weight)
		339	{
		340	return op->type == CONTAINER
		341	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		342	: weight;
		343	}
		344
318	/*	345	/*
		346	* adjust_weight(object, weight) adds the specified weight to an object,
		347	* and also updates how much the environment(s) is/are carrying.
		348	*/
		349	static void
		350	adjust_weight (object *op, sint32 weight)
		351	{
		352	while (op)
		353	{
		354	weight = weight_adjust (op, weight);
		355
		356	op->carrying += weight;
		357	op = op->env;
		358	}
		359	}
		360
		361	/*
319	* sum_weight() is a recursive function which calculates the weight	362	* this is a recursive function which calculates the weight
320	* an object is carrying. It goes through in figures out how much	363	* an object is carrying. It goes through op and figures out how much
321	* containers are carrying, and sums it up.	364	* containers are carrying, and sums it up.
322	*/	365	*/
323	long	366	void
324	sum_weight (object *op)	367	object::update_weight ()
325	{	368	{
326	long sum;	369	sint32 sum = 0;
327	object *inv;
328		370
329	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	371	for (object *op = inv; op; op = op->below)
330	{	372	{
331	if (inv->inv)	373	if (op->inv)
332	sum_weight (inv);	374	op->update_weight ();
333	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
334	}
335		375
336	if (op->type == CONTAINER && op->stats.Str)	376	sum += op->total_weight ();
337	sum = (sum * (100 - op->stats.Str)) / 100;	377	}
338		378
339	if (op->carrying != sum)	379	carrying = weight_adjust (this, sum);
340	op->carrying = sum;
341
342	return sum;
343	}	380	}
344		381
345	/**	382	/*
346	* Return the outermost environment object for a given object.	383	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
347	*/	384	*/
348
349	object *
350	object_get_env_recursive (object *op)
351	{
352	while (op->env != NULL)
353	op = op->env;
354	return op;
355	}
356
357	/*
358	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
359	* Some error messages.
360	* The result of the dump is stored in the static global errmsg array.
361	*/
362
363	char *	385	char *
364	dump_object (object *op)	386	dump_object (object *op)
365	{	387	{
366	if (!op)	388	if (!op)
367	return strdup ("[NULLOBJ]");	389	return strdup ("[NULLOBJ]");
368		390
369	object_freezer freezer;	391	object_freezer freezer;
370	save_object (freezer, op, 1);	392	op->write (freezer);
371	return freezer.as_string ();	393	return freezer.as_string ();
372	}	394	}
373		395
374	/*	396	/*
375	* get_nearest_part(multi-object, object 2) returns the part of the	397	* get_nearest_part(multi-object, object 2) returns the part of the
376	* multi-object 1 which is closest to the second object.	398	* multi-object 1 which is closest to the second object.
377	* If it's not a multi-object, it is returned.	399	* If it's not a multi-object, it is returned.
378	*/	400	*/
379
380	object *	401	object *
381	get_nearest_part (object *op, const object *pl)	402	get_nearest_part (object *op, const object *pl)
382	{	403	{
383	object *tmp, *closest;	404	object *tmp, *closest;
384	int last_dist, i;	405	int last_dist, i;
385		406
386	if (op->more == NULL)	407	if (!op->more)
387	return op;	408	return op;
		409
388	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	410	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		411	tmp;
		412	tmp = tmp->more)
389	if ((i = distance (tmp, pl)) < last_dist)	413	if ((i = distance (tmp, pl)) < last_dist)
390	closest = tmp, last_dist = i;	414	closest = tmp, last_dist = i;
		415
391	return closest;	416	return closest;
392	}	417	}
393		418
394	/*	419	/*
395	* Returns the object which has the count-variable equal to the argument.	420	* Returns the object which has the count-variable equal to the argument.
		421	* VERRRY slow.
396	*/	422	*/
397	object *	423	object *
398	find_object (tag_t i)	424	find_object (tag_t i)
399	{	425	{
400	for_all_objects (op)	426	for_all_objects (op)
…		…
420	break;	446	break;
421		447
422	return op;	448	return op;
423	}	449	}
424		450
425	void
426	free_all_object_data ()
427	{
428	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
429	}
430
431	/*	451	/*
432	* Sets the owner and sets the skill and exp pointers to owner's current	452	* Sets the owner and sets the skill and exp pointers to owner's current
433	* skill and experience objects.	453	* skill and experience objects.
		454	* ACTUALLY NO! investigate! TODO
434	*/	455	*/
435	void	456	void
436	object::set_owner (object *owner)	457	object::set_owner (object *owner)
437	{	458	{
		459	// allow objects which own objects
438	if (!owner)	460	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)	461	while (owner->owner)
449	owner = owner->owner;	462	owner = owner->owner;
		463
		464	if (flag [FLAG_FREED])
		465	{
		466	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		467	return;
		468	}
450		469
451	this->owner = owner;	470	this->owner = owner;
		471	}
		472
		473	int
		474	object::slottype () const
		475	{
		476	if (type == SKILL)
		477	{
		478	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		479	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		480	}
		481	else
		482	{
		483	if (slot [body_combat].info) return slot_combat;
		484	if (slot [body_range ].info) return slot_ranged;
		485	}
		486
		487	return slot_none;
		488	}
		489
		490	bool
		491	object::change_weapon (object *ob)
		492	{
		493	if (current_weapon == ob)
		494	return true;
		495
		496	if (chosen_skill)
		497	chosen_skill->flag [FLAG_APPLIED] = false;
		498
		499	current_weapon = ob;
		500	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		501
		502	if (chosen_skill)
		503	chosen_skill->flag [FLAG_APPLIED] = true;
		504
		505	update_stats ();
		506
		507	if (ob)
		508	{
		509	// now check wether any body locations became invalid, in which case
		510	// we cannot apply the weapon at the moment.
		511	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		512	if (slot[i].used < 0)
		513	{
		514	current_weapon = chosen_skill = 0;
		515	update_stats ();
		516
		517	new_draw_info_format (NDI_UNIQUE, 0, this,
		518	"You try to balance all your items at once, "
		519	"but the %s is just too much for your body. "
		520	"[You need to unapply some items first.]", &ob->name);
		521	return false;
		522	}
		523
		524	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		525	}
		526	else
		527	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		528
		529	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		530	{
		531	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		532	&name, ob->debug_desc ());
		533	return false;
		534	}
		535
		536	return true;
452	}	537	}
453		538
454	/* Zero the key_values on op, decrementing the shared-string	539	/* Zero the key_values on op, decrementing the shared-string
455	* refcounts and freeing the links.	540	* refcounts and freeing the links.
456	*/	541	*/
457	static void	542	static void
458	free_key_values (object *op)	543	free_key_values (object *op)
459	{	544	{
460	for (key_value *i = op->key_values; i != 0;)	545	for (key_value *i = op->key_values; i; )
461	{	546	{
462	key_value *next = i->next;	547	key_value *next = i->next;
463	delete i;	548	delete i;
464		549
465	i = next;	550	i = next;
466	}	551	}
467		552
468	op->key_values = 0;	553	op->key_values = 0;
469	}	554	}
470		555
471	/*	556	object &
472	* copy_to first frees everything allocated by the dst object,	557	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	{	558	{
482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	559	bool is_freed = flag [FLAG_FREED];
483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	560	bool is_removed = flag [FLAG_REMOVED];
484		561
485	*(object_copy *)dst = *this;	562	*(object_copy *)this = src;
486		563
487	if (is_freed)	564	flag [FLAG_FREED] = is_freed;
488	SET_FLAG (dst, FLAG_FREED);	565	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 - RANDOM () % 200 / 100.0;
495		566
496	/* Copy over key_values, if any. */	567	/* Copy over key_values, if any. */
497	if (key_values)	568	if (src.key_values)
498	{	569	{
499	key_value *tail = 0;	570	key_value *tail = 0;
500	key_value *i;
501
502	dst->key_values = 0;	571	key_values = 0;
503		572
504	for (i = key_values; i; i = i->next)	573	for (key_value *i = src.key_values; i; i = i->next)
505	{	574	{
506	key_value *new_link = new key_value;	575	key_value *new_link = new key_value;
507		576
508	new_link->next = 0;	577	new_link->next = 0;
509	new_link->key = i->key;	578	new_link->key = i->key;
510	new_link->value = i->value;	579	new_link->value = i->value;
511		580
512	/* Try and be clever here, too. */	581	/* Try and be clever here, too. */
513	if (!dst->key_values)	582	if (!key_values)
514	{	583	{
515	dst->key_values = new_link;	584	key_values = new_link;
516	tail = new_link;	585	tail = new_link;
517	}	586	}
518	else	587	else
519	{	588	{
520	tail->next = new_link;	589	tail->next = new_link;
521	tail = new_link;	590	tail = new_link;
522	}	591	}
523	}	592	}
524	}	593	}
		594	}
		595
		596	/*
		597	* copy_to first frees everything allocated by the dst object,
		598	* and then copies the contents of itself into the second
		599	* object, allocating what needs to be allocated. Basically, any
		600	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		601	* if the first object is freed, the pointers in the new object
		602	* will point at garbage.
		603	*/
		604	void
		605	object::copy_to (object *dst)
		606	{
		607	*dst = *this;
		608
		609	if (speed < 0)
		610	dst->speed_left -= rndm ();
525		611
526	dst->set_speed (dst->speed);	612	dst->set_speed (dst->speed);
		613	}
		614
		615	void
		616	object::instantiate ()
		617	{
		618	if (!uuid.seq) // HACK
		619	uuid = UUID::gen ();
		620
		621	speed_left = -0.1f;
		622	/* copy the body_info to the body_used - this is only really
		623	* need for monsters, but doesn't hurt to do it for everything.
		624	* by doing so, when a monster is created, it has good starting
		625	* values for the body_used info, so when items are created
		626	* for it, they can be properly equipped.
		627	*/
		628	for (int i = NUM_BODY_LOCATIONS; i--; )
		629	slot[i].used = slot[i].info;
		630
		631	attachable::instantiate ();
527	}	632	}
528		633
529	object *	634	object *
530	object::clone ()	635	object::clone ()
531	{	636	{
…		…
589	* UP_OBJ_FACE: only the objects face has changed.	694	* UP_OBJ_FACE: only the objects face has changed.
590	*/	695	*/
591	void	696	void
592	update_object (object *op, int action)	697	update_object (object *op, int action)
593	{	698	{
594	MoveType move_on, move_off, move_block, move_slow;
595
596	if (op == NULL)	699	if (op == NULL)
597	{	700	{
598	/* this should never happen */	701	/* this should never happen */
599	LOG (llevDebug, "update_object() called for NULL object.\n");	702	LOG (llevDebug, "update_object() called for NULL object.\n");
600	return;	703	return;
…		…
660		763
661	if (op->more)	764	if (op->more)
662	update_object (op->more, action);	765	update_object (op->more, action);
663	}	766	}
664		767
665	object *object::first;
666
667	object::object ()	768	object::object ()
668	{	769	{
669	SET_FLAG (this, FLAG_REMOVED);	770	SET_FLAG (this, FLAG_REMOVED);
670		771
671	expmul = 1.0;	772	expmul = 1.0;
672	face = blank_face;	773	face = blank_face;
673	}	774	}
674		775
675	object::~object ()	776	object::~object ()
676	{	777	{
		778	unlink ();
		779
677	free_key_values (this);	780	free_key_values (this);
678	}	781	}
679		782
680	static int object_count;	783	static int object_count;
681		784
682	void object::link ()	785	void object::link ()
683	{	786	{
684	assert (!index);//D	787	assert (!index);//D
685	uuid = gen_uuid ();	788	uuid = UUID::gen ();
686	count = ++object_count;	789	count = ++object_count;
687		790
688	refcnt_inc ();	791	refcnt_inc ();
689	objects.insert (this);	792	objects.insert (this);
690	}	793	}
691		794
692	void object::unlink ()	795	void object::unlink ()
693	{	796	{
694	assert (index);//D	797	if (!index)
		798	return;
		799
695	objects.erase (this);	800	objects.erase (this);
696	refcnt_dec ();	801	refcnt_dec ();
697	}	802	}
698		803
699	void	804	void
…		…
772	* if some form of movement is allowed, let objects	877	* if some form of movement is allowed, let objects
773	* drop on that space.	878	* drop on that space.
774	*/	879	*/
775	if (!drop_to_ground	880	if (!drop_to_ground
776	|| !map	881	|| !map
777	|| map->in_memory != MAP_IN_MEMORY	882	|| map->in_memory != MAP_ACTIVE
		883	|| map->nodrop
778	|| ms ().move_block == MOVE_ALL)	884	|| ms ().move_block == MOVE_ALL)
779	{	885	{
780	while (inv)	886	while (inv)
781	{	887	{
782	inv->destroy_inv (drop_to_ground);	888	inv->destroy_inv (drop_to_ground);
…		…
836		942
837	if (!freed_map)	943	if (!freed_map)
838	{	944	{
839	freed_map = new maptile;	945	freed_map = new maptile;
840		946
		947	freed_map->path = "<freed objects map>";
841	freed_map->name = "/internal/freed_objects_map";	948	freed_map->name = "/internal/freed_objects_map";
842	freed_map->width = 3;	949	freed_map->width = 3;
843	freed_map->height = 3;	950	freed_map->height = 3;
		951	freed_map->nodrop = 1;
844		952
845	freed_map->alloc ();	953	freed_map->alloc ();
846	freed_map->in_memory = MAP_IN_MEMORY;	954	freed_map->in_memory = MAP_ACTIVE;
847	}	955	}
848		956
849	map = freed_map;	957	map = freed_map;
850	x = 1;	958	x = 1;
851	y = 1;	959	y = 1;
852	}	960	}
853		961
854	head = 0;
855
856	if (more)	962	if (more)
857	{	963	{
858	more->destroy ();	964	more->destroy ();
859	more = 0;	965	more = 0;
860	}	966	}
861		967
		968	head = 0;
		969
862	// clear those pointers that likely might have circular references to us	970	// clear those pointers that likely might cause circular references
863	owner = 0;	971	owner = 0;
864	enemy = 0;	972	enemy = 0;
865	attacked_by = 0;	973	attacked_by = 0;
		974	current_weapon = 0;
866	}	975	}
867		976
868	void	977	void
869	object::destroy (bool destroy_inventory)	978	object::destroy (bool destroy_inventory)
870	{	979	{
…		…
872	return;	981	return;
873		982
874	if (destroy_inventory)	983	if (destroy_inventory)
875	destroy_inv (false);	984	destroy_inv (false);
876		985
		986	if (is_head ())
		987	if (sound_destroy)
		988	play_sound (sound_destroy);
		989	else if (flag [FLAG_MONSTER])
		990	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
		991
877	attachable::destroy ();	992	attachable::destroy ();
878	}
879
880	/*
881	* sub_weight() recursively (outwards) subtracts a number from the
882	* weight of an object (and what is carried by it's environment(s)).
883	*/
884	void
885	sub_weight (object *op, signed long weight)
886	{
887	while (op != NULL)
888	{
889	if (op->type == CONTAINER)
890	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
891
892	op->carrying -= weight;
893	op = op->env;
894	}
895	}	993	}
896		994
897	/* op->remove ():	995	/* op->remove ():
898	* This function removes the object op from the linked list of objects	996	* This function removes the object op from the linked list of objects
899	* which it is currently tied to. When this function is done, the	997	* which it is currently tied to. When this function is done, the
900	* object will have no environment. If the object previously had an	998	* object will have no environment. If the object previously had an
901	* environment, the x and y coordinates will be updated to	999	* environment, the x and y coordinates will be updated to
902	* the previous environment.	1000	* the previous environment.
903	* Beware: This function is called from the editor as well!
904	*/	1001	*/
905	void	1002	void
906	object::remove ()	1003	object::do_remove ()
907	{	1004	{
908	object *tmp, *last = 0;	1005	object *tmp, *last = 0;
909	object *otmp;	1006	object *otmp;
910		1007
911	if (QUERY_FLAG (this, FLAG_REMOVED))	1008	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
921	* In this case, the object to be removed is in someones	1018	* In this case, the object to be removed is in someones
922	* inventory.	1019	* inventory.
923	*/	1020	*/
924	if (env)	1021	if (env)
925	{	1022	{
		1023	adjust_weight (env, -total_weight ());
		1024
		1025	*(above ? &above->below : &env->inv) = below;
		1026
926	if (nrof)	1027	if (below)
927	sub_weight (env, weight * nrof);	1028	below->above = above;
928	else	1029
929	sub_weight (env, weight + carrying);	1030	/* we set up values so that it could be inserted into
		1031	* the map, but we don't actually do that - it is up
		1032	* to the caller to decide what we want to do.
		1033	*/
		1034	map = env->map;
		1035	x = env->x;
		1036	y = env->y;
		1037	above = 0;
		1038	below = 0;
		1039	env = 0;
930		1040
931	/* NO_FIX_PLAYER is set when a great many changes are being	1041	/* NO_FIX_PLAYER is set when a great many changes are being
932	* made to players inventory. If set, avoiding the call	1042	* made to players inventory. If set, avoiding the call
933	* to save cpu time.	1043	* to save cpu time.
934	*/	1044	*/
935	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1045	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
936	otmp->update_stats ();	1046	otmp->update_stats ();
937
938	if (above)
939	above->below = below;
940	else
941	env->inv = below;
942
943	if (below)
944	below->above = above;
945
946	/* we set up values so that it could be inserted into
947	* the map, but we don't actually do that - it is up
948	* to the caller to decide what we want to do.
949	*/
950	x = env->x, y = env->y;
951	map = env->map;
952	above = 0, below = 0;
953	env = 0;
954	}	1047	}
955	else if (map)	1048	else if (map)
956	{	1049	{
957	if (type == PLAYER)	1050	if (type == PLAYER)
958	{	1051	{
		1052	// leaving a spot always closes any open container on the ground
		1053	if (container && !container->env)
		1054	// this causes spurious floorbox updates, but it ensures
		1055	// that the CLOSE event is being sent.
		1056	close_container ();
		1057
959	--map->players;	1058	--map->players;
960	map->touch ();	1059	map->touch ();
961	}	1060	}
962		1061
963	map->dirty = true;	1062	map->dirty = true;
		1063	mapspace &ms = this->ms ();
964		1064
965	/* link the object above us */	1065	/* link the object above us */
966	if (above)	1066	if (above)
967	above->below = below;	1067	above->below = below;
968	else	1068	else
969	map->at (x, y).top = below; /* we were top, set new top */	1069	ms.top = below; /* we were top, set new top */
970		1070
971	/* Relink the object below us, if there is one */	1071	/* Relink the object below us, if there is one */
972	if (below)	1072	if (below)
973	below->above = above;	1073	below->above = above;
974	else	1074	else
…		…
976	/* Nothing below, which means we need to relink map object for this space	1076	/* Nothing below, which means we need to relink map object for this space
977	* use translated coordinates in case some oddness with map tiling is	1077	* use translated coordinates in case some oddness with map tiling is
978	* evident	1078	* evident
979	*/	1079	*/
980	if (GET_MAP_OB (map, x, y) != this)	1080	if (GET_MAP_OB (map, x, y) != this)
981	{
982	char *dump = dump_object (this);
983	LOG (llevError,
984	"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump);	1081	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
985	free (dump);
986	dump = dump_object (GET_MAP_OB (map, x, y));
987	LOG (llevError, "%s\n", dump);
988	free (dump);
989	}
990		1082
991	map->at (x, y).bot = above; /* goes on above it. */	1083	ms.bot = above; /* goes on above it. */
992	}	1084	}
993		1085
994	above = 0;	1086	above = 0;
995	below = 0;	1087	below = 0;
996		1088
997	if (map->in_memory == MAP_SAVING)	1089	if (map->in_memory == MAP_SAVING)
998	return;	1090	return;
999		1091
1000	int check_walk_off = !flag [FLAG_NO_APPLY];	1092	int check_walk_off = !flag [FLAG_NO_APPLY];
1001		1093
		1094	if (object *pl = ms.player ())
		1095	{
		1096	if (pl->container == this)
		1097	/* If a container that the player is currently using somehow gets
		1098	* removed (most likely destroyed), update the player view
		1099	* appropriately.
		1100	*/
		1101	pl->close_container ();
		1102
		1103	pl->contr->ns->floorbox_update ();
		1104	}
		1105
1002	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1106	for (tmp = ms.bot; tmp; tmp = tmp->above)
1003	{	1107	{
1004	/* No point updating the players look faces if he is the object	1108	/* No point updating the players look faces if he is the object
1005	* being removed.	1109	* being removed.
1006	*/	1110	*/
1007
1008	if (tmp->type == PLAYER && tmp != this)
1009	{
1010	/* If a container that the player is currently using somehow gets
1011	* removed (most likely destroyed), update the player view
1012	* appropriately.
1013	*/
1014	if (tmp->container == this)
1015	{
1016	flag [FLAG_APPLIED] = 0;
1017	tmp->container = 0;
1018	}
1019
1020	if (tmp->contr->ns)
1021	tmp->contr->ns->floorbox_update ();
1022	}
1023		1111
1024	/* See if object moving off should effect something */	1112	/* See if object moving off should effect something */
1025	if (check_walk_off	1113	if (check_walk_off
1026	&& ((move_type & tmp->move_off)	1114	&& ((move_type & tmp->move_off)
1027	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1115	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1030		1118
1031	if (destroyed ())	1119	if (destroyed ())
1032	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1120	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1033	}	1121	}
1034		1122
1035	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1036	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1037	if (tmp->above == tmp)
1038	tmp->above = 0;
1039
1040	last = tmp;	1123	last = tmp;
1041	}	1124	}
1042		1125
1043	/* last == NULL if there are no objects on this space */	1126	/* last == NULL if there are no objects on this space */
1044	//TODO: this makes little sense, why only update the topmost object?	1127	//TODO: this makes little sense, why only update the topmost object?
…		…
1064	merge_ob (object *op, object *top)	1147	merge_ob (object *op, object *top)
1065	{	1148	{
1066	if (!op->nrof)	1149	if (!op->nrof)
1067	return 0;	1150	return 0;
1068		1151
1069	if (top)	1152	if (!top)
1070	for (top = op; top && top->above; top = top->above)	1153	for (top = op; top && top->above; top = top->above)
1071	;	1154	;
1072		1155
1073	for (; top; top = top->below)	1156	for (; top; top = top->below)
1074	{	1157	{
…		…
1087	}	1170	}
1088		1171
1089	return 0;	1172	return 0;
1090	}	1173	}
1091		1174
		1175	void
		1176	object::expand_tail ()
		1177	{
		1178	if (more)
		1179	return;
		1180
		1181	object *prev = this;
		1182
		1183	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1184	{
		1185	object *op = arch_to_object (at);
		1186
		1187	op->name = name;
		1188	op->name_pl = name_pl;
		1189	op->title = title;
		1190
		1191	op->head = this;
		1192	prev->more = op;
		1193
		1194	prev = op;
		1195	}
		1196	}
		1197
1092	/*	1198	/*
1093	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1199	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1094	* job preparing multi-part monsters	1200	* job preparing multi-part monsters.
1095	*/	1201	*/
1096	object *	1202	object *
1097	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1203	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1098	{	1204	{
1099	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1205	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1100	{	1206	{
1101	tmp->x = x + tmp->arch->clone.x;	1207	tmp->x = x + tmp->arch->x;
1102	tmp->y = y + tmp->arch->clone.y;	1208	tmp->y = y + tmp->arch->y;
1103	}	1209	}
1104		1210
1105	return insert_ob_in_map (op, m, originator, flag);	1211	return insert_ob_in_map (op, m, originator, flag);
1106	}	1212	}
1107		1213
…		…
1126	* just 'op' otherwise	1232	* just 'op' otherwise
1127	*/	1233	*/
1128	object *	1234	object *
1129	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1235	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1130	{	1236	{
		1237	assert (!op->flag [FLAG_FREED]);
		1238
1131	object *tmp, *top, *floor = NULL;	1239	object *top, *floor = NULL;
1132	sint16 x, y;
1133		1240
1134	if (QUERY_FLAG (op, FLAG_FREED))	1241	op->remove ();
1135	{
1136	LOG (llevError, "Trying to insert freed object!\n");
1137	return NULL;
1138	}
1139
1140	if (!m)
1141	{
1142	char *dump = dump_object (op);
1143	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1144	free (dump);
1145	return op;
1146	}
1147
1148	if (out_of_map (m, op->x, op->y))
1149	{
1150	char *dump = dump_object (op);
1151	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1152	#ifdef MANY_CORES
1153	/* Better to catch this here, as otherwise the next use of this object
1154	* is likely to cause a crash. Better to find out where it is getting
1155	* improperly inserted.
1156	*/
1157	abort ();
1158	#endif
1159	free (dump);
1160	return op;
1161	}
1162
1163	if (!QUERY_FLAG (op, FLAG_REMOVED))
1164	{
1165	char *dump = dump_object (op);
1166	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1167	free (dump);
1168	return op;
1169	}
1170
1171	if (op->more)
1172	{
1173	/* The part may be on a different map. */
1174
1175	object *more = op->more;
1176
1177	/* We really need the caller to normalise coordinates - if
1178	* we set the map, that doesn't work if the location is within
1179	* a map and this is straddling an edge. So only if coordinate
1180	* is clear wrong do we normalise it.
1181	*/
1182	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1183	more->map = get_map_from_coord (m, &more->x, &more->y);
1184	else if (!more->map)
1185	{
1186	/* For backwards compatibility - when not dealing with tiled maps,
1187	* more->map should always point to the parent.
1188	*/
1189	more->map = m;
1190	}
1191
1192	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1193	{
1194	if (!op->head)
1195	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1196
1197	return 0;
1198	}
1199	}
1200
1201	CLEAR_FLAG (op, FLAG_REMOVED);
1202		1242
1203	/* Ideally, the caller figures this out. However, it complicates a lot	1243	/* Ideally, the caller figures this out. However, it complicates a lot
1204	* of areas of callers (eg, anything that uses find_free_spot would now	1244	* of areas of callers (eg, anything that uses find_free_spot would now
1205	* need extra work	1245	* need extra work
1206	*/	1246	*/
1207	op->map = get_map_from_coord (m, &op->x, &op->y);	1247	if (!xy_normalise (m, op->x, op->y))
1208	x = op->x;	1248	{
1209	y = op->y;	1249	op->destroy ();
		1250	return 0;
		1251	}
		1252
		1253	if (object *more = op->more)
		1254	if (!insert_ob_in_map (more, m, originator, flag))
		1255	return 0;
		1256
		1257	CLEAR_FLAG (op, FLAG_REMOVED);
		1258
		1259	op->map = m;
		1260	mapspace &ms = op->ms ();
1210		1261
1211	/* this has to be done after we translate the coordinates.	1262	/* this has to be done after we translate the coordinates.
1212	*/	1263	*/
1213	if (op->nrof && !(flag & INS_NO_MERGE))	1264	if (op->nrof && !(flag & INS_NO_MERGE))
1214	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1265	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1215	if (object::can_merge (op, tmp))	1266	if (object::can_merge (op, tmp))
1216	{	1267	{
1217	op->nrof += tmp->nrof;	1268	op->nrof += tmp->nrof;
1218	tmp->destroy ();	1269	tmp->destroy (1);
1219	}	1270	}
1220		1271
1221	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1272	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1222	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1273	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1223		1274
…		…
1236	op->below = originator->below;	1287	op->below = originator->below;
1237		1288
1238	if (op->below)	1289	if (op->below)
1239	op->below->above = op;	1290	op->below->above = op;
1240	else	1291	else
1241	op->ms ().bot = op;	1292	ms.bot = op;
1242		1293
1243	/* since *below* originator, no need to update top */	1294	/* since *below* originator, no need to update top */
1244	originator->below = op;	1295	originator->below = op;
1245	}	1296	}
1246	else	1297	else
1247	{	1298	{
		1299	top = ms.bot;
		1300
1248	/* If there are other objects, then */	1301	/* If there are other objects, then */
1249	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1302	if (top)
1250	{	1303	{
1251	object *last = 0;	1304	object *last = 0;
1252		1305
1253	/*	1306	/*
1254	* If there are multiple objects on this space, we do some trickier handling.	1307	* If there are multiple objects on this space, we do some trickier handling.
…		…
1260	* once we get to them. This reduces the need to traverse over all of	1313	* once we get to them. This reduces the need to traverse over all of
1261	* them when adding another one - this saves quite a bit of cpu time	1314	* them when adding another one - this saves quite a bit of cpu time
1262	* when lots of spells are cast in one area. Currently, it is presumed	1315	* when lots of spells are cast in one area. Currently, it is presumed
1263	* that flying non pickable objects are spell objects.	1316	* that flying non pickable objects are spell objects.
1264	*/	1317	*/
1265	while (top)	1318	for (top = ms.bot; top; top = top->above)
1266	{	1319	{
1267	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1320	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1268	floor = top;	1321	floor = top;
1269		1322
1270	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1323	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1273	top = top->below;	1326	top = top->below;
1274	break;	1327	break;
1275	}	1328	}
1276		1329
1277	last = top;	1330	last = top;
1278	top = top->above;
1279	}	1331	}
1280		1332
1281	/* Don't want top to be NULL, so set it to the last valid object */	1333	/* Don't want top to be NULL, so set it to the last valid object */
1282	top = last;	1334	top = last;
1283		1335
…		…
1285	* looks like instead of lots of conditions here.	1337	* looks like instead of lots of conditions here.
1286	* makes things faster, and effectively the same result.	1338	* makes things faster, and effectively the same result.
1287	*/	1339	*/
1288		1340
1289	/* Have object 'fall below' other objects that block view.	1341	/* Have object 'fall below' other objects that block view.
1290	* Unless those objects are exits, type 66	1342	* Unless those objects are exits.
1291	* If INS_ON_TOP is used, don't do this processing	1343	* If INS_ON_TOP is used, don't do this processing
1292	* Need to find the object that in fact blocks view, otherwise	1344	* Need to find the object that in fact blocks view, otherwise
1293	* stacking is a bit odd.	1345	* stacking is a bit odd.
1294	*/	1346	*/
1295	if (!(flag & INS_ON_TOP) &&	1347	if (!(flag & INS_ON_TOP)
1296	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1348	&& ms.flags () & P_BLOCKSVIEW
		1349	&& (op->face && !faces [op->face].visibility))
1297	{	1350	{
1298	for (last = top; last != floor; last = last->below)	1351	for (last = top; last != floor; last = last->below)
1299	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1352	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1300	break;	1353	break;
		1354
1301	/* Check to see if we found the object that blocks view,	1355	/* Check to see if we found the object that blocks view,
1302	* and make sure we have a below pointer for it so that	1356	* and make sure we have a below pointer for it so that
1303	* we can get inserted below this one, which requires we	1357	* we can get inserted below this one, which requires we
1304	* set top to the object below us.	1358	* set top to the object below us.
1305	*/	1359	*/
1306	if (last && last->below && last != floor)	1360	if (last && last->below && last != floor)
1307	top = last->below;	1361	top = last->below;
1308	}	1362	}
1309	} /* If objects on this space */	1363	} /* If objects on this space */
1310		1364
1311	if (flag & INS_MAP_LOAD)
1312	top = GET_MAP_TOP (op->map, op->x, op->y);
1313
1314	if (flag & INS_ABOVE_FLOOR_ONLY)	1365	if (flag & INS_ABOVE_FLOOR_ONLY)
1315	top = floor;	1366	top = floor;
1316		1367
1317	/* Top is the object that our object (op) is going to get inserted above.	1368	/* Top is the object that our object (op) is going to get inserted above.
1318	*/	1369	*/
1319		1370
1320	/* First object on this space */	1371	/* First object on this space */
1321	if (!top)	1372	if (!top)
1322	{	1373	{
1323	op->above = GET_MAP_OB (op->map, op->x, op->y);	1374	op->above = ms.bot;
1324		1375
1325	if (op->above)	1376	if (op->above)
1326	op->above->below = op;	1377	op->above->below = op;
1327		1378
1328	op->below = 0;	1379	op->below = 0;
1329	op->ms ().bot = op;	1380	ms.bot = op;
1330	}	1381	}
1331	else	1382	else
1332	{ /* get inserted into the stack above top */	1383	{ /* get inserted into the stack above top */
1333	op->above = top->above;	1384	op->above = top->above;
1334		1385
…		…
1338	op->below = top;	1389	op->below = top;
1339	top->above = op;	1390	top->above = op;
1340	}	1391	}
1341		1392
1342	if (!op->above)	1393	if (!op->above)
1343	op->ms ().top = op;	1394	ms.top = op;
1344	} /* else not INS_BELOW_ORIGINATOR */	1395	} /* else not INS_BELOW_ORIGINATOR */
1345		1396
1346	if (op->type == PLAYER)	1397	if (op->type == PLAYER)
1347	{	1398	{
1348	op->contr->do_los = 1;	1399	op->contr->do_los = 1;
…		…
1350	op->map->touch ();	1401	op->map->touch ();
1351	}	1402	}
1352		1403
1353	op->map->dirty = true;	1404	op->map->dirty = true;
1354		1405
1355	/* If we have a floor, we know the player, if any, will be above
1356	* it, so save a few ticks and start from there.
1357	*/
1358	if (!(flag & INS_MAP_LOAD))
1359	if (object *pl = op->ms ().player ())	1406	if (object *pl = ms.player ())
1360	if (pl->contr->ns)
1361	pl->contr->ns->floorbox_update ();	1407	pl->contr->ns->floorbox_update ();
1362		1408
1363	/* If this object glows, it may affect lighting conditions that are	1409	/* If this object glows, it may affect lighting conditions that are
1364	* visible to others on this map. But update_all_los is really	1410	* visible to others on this map. But update_all_los is really
1365	* an inefficient way to do this, as it means los for all players	1411	* an inefficient way to do this, as it means los for all players
1366	* on the map will get recalculated. The players could very well	1412	* on the map will get recalculated. The players could very well
…		…
1385	* blocked() and wall() work properly), and these flags are updated by	1431	* blocked() and wall() work properly), and these flags are updated by
1386	* update_object().	1432	* update_object().
1387	*/	1433	*/
1388		1434
1389	/* if this is not the head or flag has been passed, don't check walk on status */	1435	/* if this is not the head or flag has been passed, don't check walk on status */
1390	if (!(flag & INS_NO_WALK_ON) && !op->head)	1436	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1391	{	1437	{
1392	if (check_move_on (op, originator))	1438	if (check_move_on (op, originator))
1393	return 0;	1439	return 0;
1394		1440
1395	/* If we are a multi part object, lets work our way through the check	1441	/* If we are a multi part object, lets work our way through the check
1396	* walk on's.	1442	* walk on's.
1397	*/	1443	*/
1398	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1444	for (object *tmp = op->more; tmp; tmp = tmp->more)
1399	if (check_move_on (tmp, originator))	1445	if (check_move_on (tmp, originator))
1400	return 0;	1446	return 0;
1401	}	1447	}
1402		1448
1403	return op;	1449	return op;
…		…
1408	* op is the object to insert it under: supplies x and the map.	1454	* op is the object to insert it under: supplies x and the map.
1409	*/	1455	*/
1410	void	1456	void
1411	replace_insert_ob_in_map (const char *arch_string, object *op)	1457	replace_insert_ob_in_map (const char *arch_string, object *op)
1412	{	1458	{
1413	object *tmp, *tmp1;
1414
1415	/* first search for itself and remove any old instances */	1459	/* first search for itself and remove any old instances */
1416		1460
1417	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1461	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1418	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1462	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1419	tmp->destroy ();	1463	tmp->destroy (1);
1420		1464
1421	tmp1 = arch_to_object (archetype::find (arch_string));	1465	object *tmp = arch_to_object (archetype::find (arch_string));
1422		1466
1423	tmp1->x = op->x;	1467	tmp->x = op->x;
1424	tmp1->y = op->y;	1468	tmp->y = op->y;
		1469
1425	insert_ob_in_map (tmp1, op->map, op, 0);	1470	insert_ob_in_map (tmp, op->map, op, 0);
1426	}	1471	}
1427		1472
1428	object *	1473	object *
1429	object::insert_at (object *where, object *originator, int flags)	1474	object::insert_at (object *where, object *originator, int flags)
1430	{	1475	{
		1476	if (where->env)
		1477	return where->env->insert (this);
		1478	else
1431	where->map->insert (this, where->x, where->y, originator, flags);	1479	return where->map->insert (this, where->x, where->y, originator, flags);
		1480	}
		1481
		1482	// find player who can see this object
		1483	static object *
		1484	visible_to (object *op)
		1485	{
		1486	if (!op->flag [FLAG_REMOVED])
		1487	{
		1488	// see if we are in a container of sorts
		1489	if (object *env = op->env)
		1490	{
		1491	// the player inventory itself is always visible
		1492	if (env->type == PLAYER)
		1493	return env;
		1494
		1495	// else a player could have our env open
		1496	env = env->outer_env ();
		1497
		1498	// the player itself is always on a map, so we will find him here
		1499	// even if our inv is in a player.
		1500	if (env->is_on_map ())
		1501	if (object *pl = env->ms ().player ())
		1502	if (pl->container == op->env)
		1503	return pl;
		1504	}
		1505	else
		1506	{
		1507	// maybe there is a player standing on the same mapspace
		1508	if (object *pl = env->ms ().player ())
		1509	return pl;
		1510	}
		1511	}
		1512
		1513	return 0;
		1514	}
		1515
		1516	/*
		1517	* decrease(object, number) decreases a specified number from
		1518	* the amount of an object. If the amount reaches 0, the object
		1519	* is subsequently removed and freed.
		1520	*
		1521	* Return value: 'op' if something is left, NULL if the amount reached 0
		1522	*/
		1523	bool
		1524	object::decrease (sint32 nr)
		1525	{
		1526	nr = min (nr, nrof);
		1527
		1528	if (!nr)
		1529	return 1;
		1530
		1531	nrof -= nr;
		1532
		1533	object *visible = visible_to (this);
		1534
		1535	if (nrof)
		1536	{
		1537	adjust_weight (env, -weight * nr); // carrying == 0
		1538
		1539	if (visible)
		1540	esrv_send_item (visible, this);
		1541
		1542	return 1;
		1543	}
		1544	else
		1545	{
		1546	if (visible)
		1547	esrv_del_item (visible->contr, count);
		1548
		1549	this->destroy (1);
		1550	return 0;
		1551	}
1432	}	1552	}
1433		1553
1434	/*	1554	/*
1435	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1555	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1436	* is returned contains nr objects, and the remaining parts contains	1556	* is returned contains nr objects, and the remaining parts contains
1437	* the rest (or is removed and freed if that number is 0).	1557	* the rest (or is removed and freed if that number is 0).
1438	* On failure, NULL is returned, and the reason put into the	1558	* On failure, NULL is returned, and the reason put into the
1439	* global static errmsg array.	1559	* global static errmsg array.
1440	*/	1560	*/
1441	object *	1561	object *
		1562	object::split (sint32 nr)
		1563	{
		1564	if (nrof < nr)
		1565	return 0;
		1566	else if (nrof == nr)
		1567	{
		1568	remove ();
		1569	return this;
		1570	}
		1571	else
		1572	{
		1573	decrease (nr);
		1574
		1575	object *op = object_create_clone (this);
		1576	op->nrof = nr;
		1577	return op;
		1578	}
		1579	}
		1580
		1581	//TODO: remove, but semantics differs from split_nr
		1582	object *
1442	get_split_ob (object *orig_ob, uint32 nr)	1583	get_split_ob (object *orig_ob, uint32 nr)
1443	{	1584	{
1444	object *newob;
1445	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1446
1447	if (orig_ob->nrof < nr)	1585	if (orig_ob->nrof < nr)
1448	{	1586	{
1449	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);	1587	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1450	return NULL;
1451	}
1452
1453	newob = object_create_clone (orig_ob);
1454
1455	if ((orig_ob->nrof -= nr) < 1)
1456	orig_ob->destroy (1);
1457	else if (!is_removed)
1458	{
1459	if (orig_ob->env != NULL)
1460	sub_weight (orig_ob->env, orig_ob->weight * nr);
1461	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1462	{
1463	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1464	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1465	return NULL;
1466	}
1467	}
1468
1469	newob->nrof = nr;
1470
1471	return newob;
1472	}
1473
1474	/*
1475	* decrease_ob_nr(object, number) decreases a specified number from
1476	* the amount of an object. If the amount reaches 0, the object
1477	* is subsequently removed and freed.
1478	*
1479	* Return value: 'op' if something is left, NULL if the amount reached 0
1480	*/
1481
1482	object *
1483	decrease_ob_nr (object *op, uint32 i)
1484	{
1485	object *tmp;
1486
1487	if (i == 0) /* objects with op->nrof require this check */
1488	return op;
1489
1490	if (i > op->nrof)
1491	i = op->nrof;
1492
1493	if (QUERY_FLAG (op, FLAG_REMOVED))
1494	op->nrof -= i;
1495	else if (op->env)
1496	{
1497	/* is this object in the players inventory, or sub container
1498	* therein?
1499	*/
1500	tmp = op->in_player ();
1501	/* nope. Is this a container the player has opened?
1502	* If so, set tmp to that player.
1503	* IMO, searching through all the players will mostly
1504	* likely be quicker than following op->env to the map,
1505	* and then searching the map for a player.
1506	*/
1507	if (!tmp)
1508	for_all_players (pl)
1509	if (pl->ob->container == op->env)
1510	{
1511	tmp = pl->ob;
1512	break;
1513	}
1514
1515	if (i < op->nrof)
1516	{
1517	sub_weight (op->env, op->weight * i);
1518	op->nrof -= i;
1519	if (tmp)
1520	esrv_send_item (tmp, op);
1521	}
1522	else
1523	{
1524	op->remove ();
1525	op->nrof = 0;
1526	if (tmp)
1527	esrv_del_item (tmp->contr, op->count);
1528	}
1529	}
1530	else
1531	{
1532	object *above = op->above;
1533
1534	if (i < op->nrof)
1535	op->nrof -= i;
1536	else
1537	{
1538	op->remove ();
1539	op->nrof = 0;
1540	}
1541
1542	/* Since we just removed op, op->above is null */
1543	for (tmp = above; tmp; tmp = tmp->above)
1544	if (tmp->type == PLAYER)
1545	{
1546	if (op->nrof)
1547	esrv_send_item (tmp, op);
1548	else
1549	esrv_del_item (tmp->contr, op->count);
1550	}
1551	}
1552
1553	if (op->nrof)
1554	return op;
1555	else
1556	{
1557	op->destroy ();
1558	return 0;	1588	return 0;
1559	}	1589	}
1560	}
1561		1590
1562	/*	1591	return orig_ob->split (nr);
1563	* add_weight(object, weight) adds the specified weight to an object,
1564	* and also updates how much the environment(s) is/are carrying.
1565	*/
1566
1567	void
1568	add_weight (object *op, signed long weight)
1569	{
1570	while (op != NULL)
1571	{
1572	if (op->type == CONTAINER)
1573	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1574
1575	op->carrying += weight;
1576	op = op->env;
1577	}
1578	}	1592	}
1579		1593
1580	object *	1594	object *
1581	insert_ob_in_ob (object *op, object *where)	1595	insert_ob_in_ob (object *op, object *where)
1582	{	1596	{
…		…
1586	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1600	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1587	free (dump);	1601	free (dump);
1588	return op;	1602	return op;
1589	}	1603	}
1590		1604
1591	if (where->head)	1605	if (where->head_ () != where)
1592	{	1606	{
1593	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1607	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1594	where = where->head;	1608	where = where->head;
1595	}	1609	}
1596		1610
1597	return where->insert (op);	1611	return where->insert (op);
1598	}	1612	}
…		…
1603	* inside the object environment.	1617	* inside the object environment.
1604	*	1618	*
1605	* The function returns now pointer to inserted item, and return value can	1619	* The function returns now pointer to inserted item, and return value can
1606	* be != op, if items are merged. -Tero	1620	* be != op, if items are merged. -Tero
1607	*/	1621	*/
1608
1609	object *	1622	object *
1610	object::insert (object *op)	1623	object::insert (object *op)
1611	{	1624	{
1612	object *tmp, *otmp;
1613
1614	if (!QUERY_FLAG (op, FLAG_REMOVED))
1615	op->remove ();
1616
1617	if (op->more)	1625	if (op->more)
1618	{	1626	{
1619	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1627	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1620	return op;	1628	return op;
1621	}	1629	}
1622		1630
1623	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1631	op->remove ();
1624	CLEAR_FLAG (op, FLAG_REMOVED);	1632
		1633	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1634
1625	if (op->nrof)	1635	if (op->nrof)
1626	{
1627	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1636	for (object *tmp = inv; tmp; tmp = tmp->below)
1628	if (object::can_merge (tmp, op))	1637	if (object::can_merge (tmp, op))
1629	{	1638	{
1630	/* return the original object and remove inserted object	1639	/* return the original object and remove inserted object
1631	(client needs the original object) */	1640	(client needs the original object) */
1632	tmp->nrof += op->nrof;	1641	tmp->nrof += op->nrof;
1633	/* Weight handling gets pretty funky. Since we are adding to	1642	op->destroy (1);
1634	* tmp->nrof, we need to increase the weight.
1635	*/
1636	add_weight (this, op->weight * op->nrof);
1637	SET_FLAG (op, FLAG_REMOVED);
1638	op->destroy (); /* free the inserted object */
1639	op = tmp;	1643	op = tmp;
1640	op->remove (); /* and fix old object's links */	1644	goto inserted;
1641	CLEAR_FLAG (op, FLAG_REMOVED);
1642	break;
1643	}	1645	}
1644		1646
1645	/* I assume combined objects have no inventory	1647	op->owner = 0; // it's his/hers now. period.
1646	* We add the weight - this object could have just been removed	1648	op->map = 0;
1647	* (if it was possible to merge). calling remove_ob will subtract	1649	op->x = 0;
1648	* the weight, so we need to add it in again, since we actually do	1650	op->y = 0;
1649	* the linking below
1650	*/
1651	add_weight (this, op->weight * op->nrof);
1652	}
1653	else
1654	add_weight (this, (op->weight + op->carrying));
1655		1651
1656	otmp = this->in_player ();	1652	op->above = 0;
1657	if (otmp && otmp->contr)	1653	op->below = inv;
		1654	op->env = this;
		1655
		1656	if (inv)
		1657	inv->above = op;
		1658
		1659	inv = op;
		1660
		1661	op->flag [FLAG_REMOVED] = 0;
		1662
		1663	adjust_weight (this, op->total_weight ());
		1664
		1665	inserted:
		1666	/* reset the light list and los of the players on the map */
		1667	if (op->glow_radius && map && map->darkness)
		1668	update_all_los (map, x, y);
		1669
		1670	if (object *otmp = in_player ())
1658	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1671	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1659	otmp->update_stats ();	1672	otmp->update_stats ();
1660
1661	op->map = 0;
1662	op->env = this;
1663	op->above = 0;
1664	op->below = 0;
1665	op->x = 0, op->y = 0;
1666
1667	/* reset the light list and los of the players on the map */
1668	if ((op->glow_radius != 0) && map)
1669	{
1670	#ifdef DEBUG_LIGHTS
1671	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1672	#endif /* DEBUG_LIGHTS */
1673	if (map->darkness)
1674	update_all_los (map, x, y);
1675	}
1676
1677	/* Client has no idea of ordering so lets not bother ordering it here.
1678	* It sure simplifies this function...
1679	*/
1680	if (!inv)
1681	inv = op;
1682	else
1683	{
1684	op->below = inv;
1685	op->below->above = op;
1686	inv = op;
1687	}
1688		1673
1689	INVOKE_OBJECT (INSERT, this);	1674	INVOKE_OBJECT (INSERT, this);
1690		1675
1691	return op;	1676	return op;
1692	}	1677	}
…		…
1773	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1758	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1774	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1759	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1775	{	1760	{
1776		1761
1777	float	1762	float
1778	diff = tmp->move_slow_penalty * FABS (op->speed);	1763	diff = tmp->move_slow_penalty * fabs (op->speed);
1779		1764
1780	if (op->type == PLAYER)	1765	if (op->type == PLAYER)
1781	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1766	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1782	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1767	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1783	diff /= 4.0;	1768	diff /= 4.0;
…		…
1907	* activate recursively a flag on an object inventory	1892	* activate recursively a flag on an object inventory
1908	*/	1893	*/
1909	void	1894	void
1910	flag_inv (object *op, int flag)	1895	flag_inv (object *op, int flag)
1911	{	1896	{
1912	if (op->inv)
1913	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1897	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1914	{	1898	{
1915	SET_FLAG (tmp, flag);	1899	SET_FLAG (tmp, flag);
1916	flag_inv (tmp, flag);	1900	flag_inv (tmp, flag);
1917	}	1901	}
1918	}	1902	}
1919		1903
1920	/*	1904	/*
1921	* deactivate recursively a flag on an object inventory	1905	* deactivate recursively a flag on an object inventory
1922	*/	1906	*/
1923	void	1907	void
1924	unflag_inv (object *op, int flag)	1908	unflag_inv (object *op, int flag)
1925	{	1909	{
1926	if (op->inv)
1927	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1910	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1928	{	1911	{
1929	CLEAR_FLAG (tmp, flag);	1912	CLEAR_FLAG (tmp, flag);
1930	unflag_inv (tmp, flag);	1913	unflag_inv (tmp, flag);
1931	}	1914	}
1932	}
1933
1934	/*
1935	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1936	* all it's inventory (recursively).
1937	* If checksums are used, a player will get set_cheat called for
1938	* him/her-self and all object carried by a call to this function.
1939	*/
1940	void
1941	set_cheat (object *op)
1942	{
1943	SET_FLAG (op, FLAG_WAS_WIZ);
1944	flag_inv (op, FLAG_WAS_WIZ);
1945	}	1915	}
1946		1916
1947	/*	1917	/*
1948	* find_free_spot(object, map, x, y, start, stop) will search for	1918	* find_free_spot(object, map, x, y, start, stop) will search for
1949	* a spot at the given map and coordinates which will be able to contain	1919	* a spot at the given map and coordinates which will be able to contain
…		…
1951	* to search (see the freearr_x/y[] definition).	1921	* to search (see the freearr_x/y[] definition).
1952	* It returns a random choice among the alternatives found.	1922	* It returns a random choice among the alternatives found.
1953	* start and stop are where to start relative to the free_arr array (1,9	1923	* start and stop are where to start relative to the free_arr array (1,9
1954	* does all 4 immediate directions). This returns the index into the	1924	* does all 4 immediate directions). This returns the index into the
1955	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1925	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1956	* Note - this only checks to see if there is space for the head of the
1957	* object - if it is a multispace object, this should be called for all
1958	* pieces.
1959	* Note2: This function does correctly handle tiled maps, but does not	1926	* Note: This function does correctly handle tiled maps, but does not
1960	* inform the caller. However, insert_ob_in_map will update as	1927	* inform the caller. However, insert_ob_in_map will update as
1961	* necessary, so the caller shouldn't need to do any special work.	1928	* necessary, so the caller shouldn't need to do any special work.
1962	* Note - updated to take an object instead of archetype - this is necessary	1929	* Note - updated to take an object instead of archetype - this is necessary
1963	* because arch_blocked (now ob_blocked) needs to know the movement type	1930	* because arch_blocked (now ob_blocked) needs to know the movement type
1964	* to know if the space in question will block the object. We can't use	1931	* to know if the space in question will block the object. We can't use
…		…
1966	* customized, changed states, etc.	1933	* customized, changed states, etc.
1967	*/	1934	*/
1968	int	1935	int
1969	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1936	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
1970	{	1937	{
		1938	int altern[SIZEOFFREE];
1971	int index = 0, flag;	1939	int index = 0, flag;
1972	int altern[SIZEOFFREE];
1973		1940
1974	for (int i = start; i < stop; i++)	1941	for (int i = start; i < stop; i++)
1975	{	1942	{
1976	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1943	mapxy pos (m, x, y); pos.move (i);
1977	if (!flag)	1944
		1945	if (!pos.normalise ())
		1946	continue;
		1947
		1948	mapspace &ms = *pos;
		1949
		1950	if (ms.flags () & P_IS_ALIVE)
		1951	continue;
		1952
		1953	/* However, often
		1954	* ob doesn't have any move type (when used to place exits)
		1955	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1956	*/
		1957	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1958	{
1978	altern [index++] = i;	1959	altern [index++] = i;
		1960	continue;
		1961	}
1979		1962
1980	/* Basically, if we find a wall on a space, we cut down the search size.	1963	/* Basically, if we find a wall on a space, we cut down the search size.
1981	* In this way, we won't return spaces that are on another side of a wall.	1964	* In this way, we won't return spaces that are on another side of a wall.
1982	* This mostly work, but it cuts down the search size in all directions -	1965	* This mostly work, but it cuts down the search size in all directions -
1983	* if the space being examined only has a wall to the north and empty	1966	* if the space being examined only has a wall to the north and empty
1984	* spaces in all the other directions, this will reduce the search space	1967	* spaces in all the other directions, this will reduce the search space
1985	* to only the spaces immediately surrounding the target area, and	1968	* to only the spaces immediately surrounding the target area, and
1986	* won't look 2 spaces south of the target space.	1969	* won't look 2 spaces south of the target space.
1987	*/	1970	*/
1988	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1971	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1972	{
1989	stop = maxfree[i];	1973	stop = maxfree[i];
		1974	continue;
		1975	}
		1976
		1977	/* Note it is intentional that we check ob - the movement type of the
		1978	* head of the object should correspond for the entire object.
		1979	*/
		1980	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1981	continue;
		1982
		1983	if (ob->blocked (m, pos.x, pos.y))
		1984	continue;
		1985
		1986	altern [index++] = i;
1990	}	1987	}
1991		1988
1992	if (!index)	1989	if (!index)
1993	return -1;	1990	return -1;
1994		1991
1995	return altern[RANDOM () % index];	1992	return altern [rndm (index)];
1996	}	1993	}
1997		1994
1998	/*	1995	/*
1999	* find_first_free_spot(archetype, maptile, x, y) works like	1996	* find_first_free_spot(archetype, maptile, x, y) works like
2000	* find_free_spot(), but it will search max number of squares.	1997	* find_free_spot(), but it will search max number of squares.
…		…
2003	*/	2000	*/
2004	int	2001	int
2005	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2002	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2006	{	2003	{
2007	for (int i = 0; i < SIZEOFFREE; i++)	2004	for (int i = 0; i < SIZEOFFREE; i++)
2008	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2005	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2009	return i;	2006	return i;
2010		2007
2011	return -1;	2008	return -1;
2012	}	2009	}
2013		2010
…		…
2021	{	2018	{
2022	arr += begin;	2019	arr += begin;
2023	end -= begin;	2020	end -= begin;
2024		2021
2025	while (--end)	2022	while (--end)
2026	swap (arr [end], arr [RANDOM () % (end + 1)]);	2023	swap (arr [end], arr [rndm (end + 1)]);
2027	}	2024	}
2028		2025
2029	/* new function to make monster searching more efficient, and effective!	2026	/* new function to make monster searching more efficient, and effective!
2030	* This basically returns a randomized array (in the passed pointer) of	2027	* This basically returns a randomized array (in the passed pointer) of
2031	* the spaces to find monsters. In this way, it won't always look for	2028	* the spaces to find monsters. In this way, it won't always look for
…		…
2067	object *tmp;	2064	object *tmp;
2068	maptile *mp;	2065	maptile *mp;
2069		2066
2070	MoveType blocked, move_type;	2067	MoveType blocked, move_type;
2071		2068
2072	if (exclude && exclude->head)	2069	if (exclude && exclude->head_ () != exclude)
2073	{	2070	{
2074	exclude = exclude->head;	2071	exclude = exclude->head;
2075	move_type = exclude->move_type;	2072	move_type = exclude->move_type;
2076	}	2073	}
2077	else	2074	else
…		…
2100	max = maxfree[i];	2097	max = maxfree[i];
2101	else if (mflags & P_IS_ALIVE)	2098	else if (mflags & P_IS_ALIVE)
2102	{	2099	{
2103	for (tmp = ms.bot; tmp; tmp = tmp->above)	2100	for (tmp = ms.bot; tmp; tmp = tmp->above)
2104	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2101	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2105	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2102	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2106	break;	2103	break;
2107		2104
2108	if (tmp)	2105	if (tmp)
2109	return freedir[i];	2106	return freedir[i];
2110	}	2107	}
…		…
2165		2162
2166	return 3;	2163	return 3;
2167	}	2164	}
2168		2165
2169	/*	2166	/*
2170	* absdir(int): Returns a number between 1 and 8, which represent
2171	* the "absolute" direction of a number (it actually takes care of
2172	* "overflow" in previous calculations of a direction).
2173	*/
2174
2175	int
2176	absdir (int d)
2177	{
2178	while (d < 1)
2179	d += 8;
2180
2181	while (d > 8)
2182	d -= 8;
2183
2184	return d;
2185	}
2186
2187	/*
2188	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2167	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2189	* between two directions (which are expected to be absolute (see absdir())	2168	* between two directions (which are expected to be absolute (see absdir())
2190	*/	2169	*/
2191
2192	int	2170	int
2193	dirdiff (int dir1, int dir2)	2171	dirdiff (int dir1, int dir2)
2194	{	2172	{
2195	int d;	2173	int d;
2196		2174
…		…
2309	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2287	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2310	* core dumps if they do.	2288	* core dumps if they do.
2311	*	2289	*
2312	* Add a check so we can't pick up invisible objects (0.93.8)	2290	* Add a check so we can't pick up invisible objects (0.93.8)
2313	*/	2291	*/
2314
2315	int	2292	int
2316	can_pick (const object *who, const object *item)	2293	can_pick (const object *who, const object *item)
2317	{	2294	{
2318	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2295	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2319	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2296	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2324	* create clone from object to another	2301	* create clone from object to another
2325	*/	2302	*/
2326	object *	2303	object *
2327	object_create_clone (object *asrc)	2304	object_create_clone (object *asrc)
2328	{	2305	{
2329	object *dst = 0, *tmp, *src, *part, *prev, *item;	2306	object *dst = 0, *tmp, *src, *prev, *item;
2330		2307
2331	if (!asrc)	2308	if (!asrc)
2332	return 0;	2309	return 0;
2333		2310
2334	src = asrc;
2335	if (src->head)
2336	src = src->head;	2311	src = asrc->head_ ();
2337		2312
2338	prev = 0;	2313	prev = 0;
2339	for (part = src; part; part = part->more)	2314	for (object *part = src; part; part = part->more)
2340	{	2315	{
2341	tmp = part->clone ();	2316	tmp = part->clone ();
2342	tmp->x -= src->x;	2317	tmp->x -= src->x;
2343	tmp->y -= src->y;	2318	tmp->y -= src->y;
2344		2319
…		…
2360		2335
2361	for (item = src->inv; item; item = item->below)	2336	for (item = src->inv; item; item = item->below)
2362	insert_ob_in_ob (object_create_clone (item), dst);	2337	insert_ob_in_ob (object_create_clone (item), dst);
2363		2338
2364	return dst;	2339	return dst;
2365	}
2366
2367	/* GROS - Creates an object using a string representing its content. */
2368	/* Basically, we save the content of the string to a temp file, then call */
2369	/* load_object on it. I admit it is a highly inefficient way to make things, */
2370	/* but it was simple to make and allows reusing the load_object function. */
2371	/* Remember not to use load_object_str in a time-critical situation. */
2372	/* Also remember that multiparts objects are not supported for now. */
2373	object *
2374	load_object_str (const char *obstr)
2375	{
2376	object *op;
2377	char filename[MAX_BUF];
2378
2379	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2380
2381	FILE *tempfile = fopen (filename, "w");
2382
2383	if (tempfile == NULL)
2384	{
2385	LOG (llevError, "Error - Unable to access load object temp file\n");
2386	return NULL;
2387	}
2388
2389	fprintf (tempfile, obstr);
2390	fclose (tempfile);
2391
2392	op = object::create ();
2393
2394	object_thawer thawer (filename);
2395
2396	if (thawer)
2397	load_object (thawer, op, 0);
2398
2399	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2400	CLEAR_FLAG (op, FLAG_REMOVED);
2401
2402	return op;
2403	}	2340	}
2404		2341
2405	/* This returns the first object in who's inventory that	2342	/* This returns the first object in who's inventory that
2406	* has the same type and subtype match.	2343	* has the same type and subtype match.
2407	* returns NULL if no match.	2344	* returns NULL if no match.
…		…
2462	if (link->key == canonical_key)	2399	if (link->key == canonical_key)
2463	return link->value;	2400	return link->value;
2464		2401
2465	return 0;	2402	return 0;
2466	}	2403	}
2467
2468		2404
2469	/*	2405	/*
2470	* Updates the canonical_key in op to value.	2406	* Updates the canonical_key in op to value.
2471	*	2407	*
2472	* canonical_key is a shared string (value doesn't have to be).	2408	* canonical_key is a shared string (value doesn't have to be).
…		…
2496	/* Basically, if the archetype has this key set,	2432	/* Basically, if the archetype has this key set,
2497	* we need to store the null value so when we save	2433	* we need to store the null value so when we save
2498	* it, we save the empty value so that when we load,	2434	* it, we save the empty value so that when we load,
2499	* we get this value back again.	2435	* we get this value back again.
2500	*/	2436	*/
2501	if (get_ob_key_link (&op->arch->clone, canonical_key))	2437	if (get_ob_key_link (op->arch, canonical_key))
2502	field->value = 0;	2438	field->value = 0;
2503	else	2439	else
2504	{	2440	{
2505	if (last)	2441	if (last)
2506	last->next = field->next;	2442	last->next = field->next;
…		…
2575	}	2511	}
2576	else	2512	else
2577	item = item->env;	2513	item = item->env;
2578	}	2514	}
2579		2515
2580
2581	const char *	2516	const char *
2582	object::flag_desc (char *desc, int len) const	2517	object::flag_desc (char *desc, int len) const
2583	{	2518	{
2584	char *p = desc;	2519	char *p = desc;
2585	bool first = true;	2520	bool first = true;
…		…
2612	{	2547	{
2613	char flagdesc[512];	2548	char flagdesc[512];
2614	char info2[256 * 4];	2549	char info2[256 * 4];
2615	char *p = info;	2550	char *p = info;
2616		2551
2617	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",	2552	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2618	count, uuid.seq,	2553	count,
		2554	uuid.c_str (),
2619	&name,	2555	&name,
2620	title ? "\",title:" : "",	2556	title ? "\",title:\"" : "",
2621	title ? (const char *)title : "",	2557	title ? (const char *)title : "",
2622	flag_desc (flagdesc, 512), type);	2558	flag_desc (flagdesc, 512), type);
2623		2559
2624	if (env)	2560	if (!this->flag[FLAG_REMOVED] && env)
2625	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2561	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2626		2562
2627	if (map)	2563	if (map)
2628	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2564	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2629		2565
…		…
2631	}	2567	}
2632		2568
2633	const char *	2569	const char *
2634	object::debug_desc () const	2570	object::debug_desc () const
2635	{	2571	{
2636	static char info[256 * 4];	2572	static char info[3][256 * 4];
		2573	static int info_idx;
		2574
2637	return debug_desc (info);	2575	return debug_desc (info [++info_idx % 3]);
2638	}	2576	}
2639		2577
		2578	struct region *
		2579	object::region () const
		2580	{
		2581	return map ? map->region (x, y)
		2582	: region::default_region ();
		2583	}
		2584
		2585	const materialtype_t *
		2586	object::dominant_material () const
		2587	{
		2588	if (materialtype_t *mt = name_to_material (materialname))
		2589	return mt;
		2590
		2591	return name_to_material (shstr_unknown);
		2592	}
		2593
		2594	void
		2595	object::open_container (object *new_container)
		2596	{
		2597	if (container == new_container)
		2598	return;
		2599
		2600	if (object *old_container = container)
		2601	{
		2602	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2603	return;
		2604
		2605	#if 0
		2606	// remove the "Close old_container" object.
		2607	if (object *closer = old_container->inv)
		2608	if (closer->type == CLOSE_CON)
		2609	closer->destroy ();
		2610	#endif
		2611
		2612	old_container->flag [FLAG_APPLIED] = 0;
		2613	container = 0;
		2614
		2615	esrv_update_item (UPD_FLAGS, this, old_container);
		2616	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2617	play_sound (sound_find ("chest_close"));
		2618	}
		2619
		2620	if (new_container)
		2621	{
		2622	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2623	return;
		2624
		2625	// TODO: this does not seem to serve any purpose anymore?
		2626	#if 0
		2627	// insert the "Close Container" object.
		2628	if (archetype *closer = new_container->other_arch)
		2629	{
		2630	object *closer = arch_to_object (new_container->other_arch);
		2631	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2632	new_container->insert (closer);
		2633	}
		2634	#endif
		2635
		2636	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2637
		2638	new_container->flag [FLAG_APPLIED] = 1;
		2639	container = new_container;
		2640
		2641	esrv_update_item (UPD_FLAGS, this, new_container);
		2642	esrv_send_inventory (this, new_container);
		2643	play_sound (sound_find ("chest_open"));
		2644	}
		2645	}
		2646
		2647	object *
		2648	object::force_find (const shstr name)
		2649	{
		2650	/* cycle through his inventory to look for the MARK we want to
		2651	* place
		2652	*/
		2653	for (object *tmp = inv; tmp; tmp = tmp->below)
		2654	if (tmp->type == FORCE && tmp->slaying == name)
		2655	return splay (tmp);
		2656
		2657	return 0;
		2658	}
		2659
		2660	void
		2661	object::force_add (const shstr name, int duration)
		2662	{
		2663	if (object *force = force_find (name))
		2664	force->destroy ();
		2665
		2666	object *force = get_archetype (FORCE_NAME);
		2667
		2668	force->slaying = name;
		2669	force->stats.food = 1;
		2670	force->speed_left = -1.f;
		2671
		2672	force->set_speed (duration ? 1.f / duration : 0.f);
		2673	force->flag [FLAG_IS_USED_UP] = true;
		2674	force->flag [FLAG_APPLIED] = true;
		2675
		2676	insert (force);
		2677	}
		2678
		2679	void
		2680	object::play_sound (faceidx sound)
		2681	{
		2682	if (!sound)
		2683	return;
		2684
		2685	if (flag [FLAG_REMOVED])
		2686	return;
		2687
		2688	if (env)
		2689	{
		2690	if (object *pl = in_player ())
		2691	pl->contr->play_sound (sound);
		2692	}
		2693	else
		2694	map->play_sound (sound, x, y);
		2695	}
		2696

Diff Legend

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