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.98 by root, Sun Dec 31 17:17:22 2006 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 (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
8	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
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
10	(at your option) any later version.	11	* (at your option) any later version.
11		12	*
12	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,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	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
18	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
20		21	* The authors can be reached via e-mail to <support@deliantra.net>
21	The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	22	*/
23		23
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying
26	variable. */
27	#include <global.h>	24	#include <global.h>
28	#include <stdio.h>	25	#include <stdio.h>
29	#include <sys/types.h>	26	#include <sys/types.h>
30	#include <sys/uio.h>	27	#include <sys/uio.h>
31	#include <object.h>	28	#include <object.h>
32	#include <funcpoint.h>	29	#include <funcpoint.h>
		30	#include <sproto.h>
33	#include <loader.h>	31	#include <loader.h>
34		32
35	#include <bitset>	33	#include <bitset>
36		34
37	int nrofallocobjects = 0;	35	UUID UUID::cur;
38	static UUID uuid;	36	static uint64_t seq_next_save;
39	const uint64 UUID_SKIP = 1<<19;	37	static const uint64 UUID_GAP = 1<<19;
40		38
41	object *active_objects; /* List of active objects that need to be processed */	39	objectvec objects;
		40	activevec actives;
42		41
43	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,
44	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
45	};	47	};
46	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,
47	-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
48	};	53	};
49	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,
50	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
51	};	59	};
52	int freedir[SIZEOFFREE] = {	60	int freedir[SIZEOFFREE] = {
53	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,
54	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
55	};	65	};
56		66
57	static void	67	static void
58	write_uuid (void)	68	write_uuid (uval64 skip, bool sync)
59	{	69	{
60	char filename1[MAX_BUF], filename2[MAX_BUF];	70	CALL_BEGIN (2);
61		71	CALL_ARG_SV (newSVval64 (skip));
62	sprintf (filename1, "%s/uuid", settings.localdir);	72	CALL_ARG_SV (boolSV (sync));
63	sprintf (filename2, "%s/uuid~", settings.localdir);	73	CALL_CALL ("cf::write_uuid", G_DISCARD);
64		74	CALL_END;
65	FILE *fp;
66
67	if (!(fp = fopen (filename2, "w")))
68	{
69	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
70	return;
71	}
72
73	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
74	fclose (fp);
75	rename (filename2, filename1);
76	}	75	}
77		76
78	static void	77	static void
79	read_uuid (void)	78	read_uuid (void)
80	{	79	{
81	char filename[MAX_BUF];	80	char filename[MAX_BUF];
82		81
83	sprintf (filename, "%s/uuid", settings.localdir);	82	sprintf (filename, "%s/uuid", settings.localdir);
84		83
		84	seq_next_save = 0;
		85
85	FILE *fp;	86	FILE *fp;
86		87
87	if (!(fp = fopen (filename, "r")))	88	if (!(fp = fopen (filename, "r")))
88	{	89	{
89	if (errno == ENOENT)	90	if (errno == ENOENT)
90	{	91	{
91	LOG (llevInfo, "RESET uid to 1\n");	92	LOG (llevInfo, "RESET uid to 1\n");
92	uuid.seq = 0;	93	UUID::cur.seq = 0;
93	write_uuid ();	94	write_uuid (UUID_GAP, true);
94	return;	95	return;
95	}	96	}
96		97
97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	98	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
98	_exit (1);	99	_exit (1);
99	}	100	}
100		101
101	int version;	102	UUID::BUF buf;
102	unsigned long long uid;	103	buf[0] = 0;
103	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	104	fgets (buf, sizeof (buf), fp);
		105
		106	if (!UUID::cur.parse (buf))
104	{	107	{
105	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	108	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
106	_exit (1);	109	_exit (1);
107	}	110	}
108		111
109	uuid.seq = uid;	112	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
110	write_uuid ();	113
111	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	114	write_uuid (UUID_GAP, true);
112	fclose (fp);	115	fclose (fp);
113	}	116	}
114		117
115	UUID	118	UUID
116	gen_uuid ()	119	UUID::gen ()
117	{	120	{
118	UUID uid;	121	UUID uid;
119		122
120	uid.seq = ++uuid.seq;	123	uid.seq = ++cur.seq;
121		124
122	if (!(uuid.seq & (UUID_SKIP - 1)))	125	if (expect_false (cur.seq >= seq_next_save))
123	write_uuid ();	126	{
		127	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		128	write_uuid (UUID_GAP, false);
		129	}
		130
124		131
125	return uid;	132	return uid;
126	}	133	}
127		134
128	void	135	void
129	init_uuid ()	136	UUID::init ()
130	{	137	{
131	read_uuid ();	138	read_uuid ();
132	}	139	}
133		140
134	/* 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. */
135	static int	142	static bool
136	compare_ob_value_lists_one (const object *wants, const object *has)	143	compare_ob_value_lists_one (const object *wants, const object *has)
137	{	144	{
138	key_value *wants_field;	145	key_value *wants_field;
139		146
140	/* 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
…		…
148	key_value *has_field;	155	key_value *has_field;
149		156
150	/* Look for a field in has with the same key. */	157	/* Look for a field in has with the same key. */
151	has_field = get_ob_key_link (has, wants_field->key);	158	has_field = get_ob_key_link (has, wants_field->key);
152		159
153	if (has_field == NULL)	160	if (!has_field)
154	{
155	/* No field with that name. */	161	return 0; /* No field with that name. */
156	return FALSE;
157	}
158		162
159	/* Found the matching field. */	163	/* Found the matching field. */
160	if (has_field->value != wants_field->value)	164	if (has_field->value != wants_field->value)
161	{
162	/* 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. */
163	return FALSE;
164	}
165		166
166	/* 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. */
167	}	168	}
168		169
169	/* 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. */
170	return TRUE;	171	return 1;
171	}	172	}
172		173
173	/* Returns TRUE if ob1 has the same key_values as ob2. */	174	/* Returns TRUE if ob1 has the same key_values as ob2. */
174	static int	175	static bool
175	compare_ob_value_lists (const object *ob1, const object *ob2)	176	compare_ob_value_lists (const object *ob1, const object *ob2)
176	{	177	{
177	/* 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,
178	* so we need to run the comparison *twice*. :(	179	* so we need to run the comparison *twice*. :(
179	*/	180	*/
…		…
200	|| ob1->speed != ob2->speed	201	|| ob1->speed != ob2->speed
201	|| ob1->value != ob2->value	202	|| ob1->value != ob2->value
202	|| ob1->name != ob2->name)	203	|| ob1->name != ob2->name)
203	return 0;	204	return 0;
204		205
205	//TODO: this ain't working well, use nicer and correct overflow check	206	/* Do not merge objects if nrof would overflow. First part checks
206	/* 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
207	* 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
208	* used to store nrof).	209	* nrof values.
209	*/	210	*/
210	if (ob1->nrof + ob2->nrof >= 1UL << 31)	211	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
211	return 0;	212	return 0;
212		213
213	/* If the objects have been identified, set the BEEN_APPLIED flag.	214	/* If the objects have been identified, set the BEEN_APPLIED flag.
214	* 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
215	* 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
216	* 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
217	* flags lose any meaning.	218	* flags lose any meaning.
218	*/	219	*/
219	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	220	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
220	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
221		222
222	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
223	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
224		225
225	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	226	if (ob1->arch->name != ob2->arch->name
226	|| ob1->arch != ob2->arch
227	|| ob1->name != ob2->name	227	|| ob1->name != ob2->name
228	|| ob1->title != ob2->title	228	|| ob1->title != ob2->title
229	|| ob1->msg != ob2->msg	229	|| ob1->msg != ob2->msg
230	|| ob1->weight != ob2->weight	230	|| ob1->weight != ob2->weight
231	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
232	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
233	|| ob1->attacktype != ob2->attacktype	231	|| ob1->attacktype != ob2->attacktype
234	|| ob1->magic != ob2->magic	232	|| ob1->magic != ob2->magic
235	|| ob1->slaying != ob2->slaying	233	|| ob1->slaying != ob2->slaying
236	|| ob1->skill != ob2->skill	234	|| ob1->skill != ob2->skill
237	|| ob1->value != ob2->value	235	|| ob1->value != ob2->value
…		…
244	|| ob1->move_block != ob2->move_block	242	|| ob1->move_block != ob2->move_block
245	|| ob1->move_allow != ob2->move_allow	243	|| ob1->move_allow != ob2->move_allow
246	|| ob1->move_on != ob2->move_on	244	|| ob1->move_on != ob2->move_on
247	|| ob1->move_off != ob2->move_off	245	|| ob1->move_off != ob2->move_off
248	|| ob1->move_slow != ob2->move_slow	246	|| ob1->move_slow != ob2->move_slow
249	|| 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)))
250	return 0;	250	return 0;
251		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
252	/* This is really a spellbook check - really, we should	259	/* This is really a spellbook check - we should in general
253	* check all objects in the inventory.	260	* not merge objects with real inventories, as splitting them
		261	* is hard.
254	*/	262	*/
255	if (ob1->inv || ob2->inv)	263	if (ob1->inv || ob2->inv)
256	{	264	{
257	/* if one object has inventory but the other doesn't, not equiv */	265	if (!(ob1->inv && ob2->inv))
258	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	266	return 0; /* inventories differ in length */
259	return 0;
260		267
261	/* 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
262	if (!object::can_merge (ob1->inv, ob2->inv))	271	if (!object::can_merge (ob1->inv, ob2->inv))
263	return 0;	272	return 0; /* inventory objects differ */
264		273
265	/* 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
266	* if it is valid.	275	* if it is valid.
267	*/	276	*/
268	}	277	}
…		…
287	if (ob1->level != ob2->level)	296	if (ob1->level != ob2->level)
288	return 0;	297	return 0;
289	break;	298	break;
290	}	299	}
291		300
292	if (ob1->key_values != NULL || ob2->key_values != NULL)	301	if (ob1->key_values || ob2->key_values)
293	{	302	{
294	/* At least one of these has key_values. */	303	/* At least one of these has key_values. */
295	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	304	if ((!ob1->key_values) != (!ob2->key_values))
296	/* 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))
297	return 0;	308	return 0;
298	else if (!compare_ob_value_lists (ob1, ob2))
299	return 0;
300	}	309	}
301		310
302	//TODO: generate an event or call into perl for additional checks
303	if (ob1->self || ob2->self)	311	if (ob1->self || ob2->self)
304	{	312	{
305	ob1->optimise ();	313	ob1->optimise ();
306	ob2->optimise ();	314	ob2->optimise ();
307		315
308	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)
309	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	}
310	}	330	}
311		331
312	/* Everything passes, must be OK. */	332	/* Everything passes, must be OK. */
313	return 1;	333	return 1;
314	}	334	}
315		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
316	/*	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	/*
317	* sum_weight() is a recursive function which calculates the weight	362	* this is a recursive function which calculates the weight
318	* 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
319	* containers are carrying, and sums it up.	364	* containers are carrying, and sums it up.
320	*/	365	*/
321	long	366	void
322	sum_weight (object *op)	367	object::update_weight ()
323	{	368	{
324	long sum;	369	sint32 sum = 0;
325	object *inv;
326		370
327	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	371	for (object *op = inv; op; op = op->below)
328	{	372	{
329	if (inv->inv)	373	if (op->inv)
330	sum_weight (inv);	374	op->update_weight ();
331	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
332	}
333		375
334	if (op->type == CONTAINER && op->stats.Str)	376	sum += op->total_weight ();
335	sum = (sum * (100 - op->stats.Str)) / 100;	377	}
336		378
337	if (op->carrying != sum)	379	carrying = weight_adjust (this, sum);
338	op->carrying = sum;
339
340	return sum;
341	}	380	}
342		381
343	/**	382	/*
344	* Return the outermost environment object for a given object.	383	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
345	*/	384	*/
346
347	object *
348	object_get_env_recursive (object *op)
349	{
350	while (op->env != NULL)
351	op = op->env;
352	return op;
353	}
354
355	/*
356	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
357	* Some error messages.
358	* The result of the dump is stored in the static global errmsg array.
359	*/
360
361	char *	385	char *
362	dump_object (object *op)	386	dump_object (object *op)
363	{	387	{
364	if (!op)	388	if (!op)
365	return strdup ("[NULLOBJ]");	389	return strdup ("[NULLOBJ]");
366		390
367	object_freezer freezer;	391	object_freezer freezer;
368	save_object (freezer, op, 1);	392	op->write (freezer);
369	return freezer.as_string ();	393	return freezer.as_string ();
370	}	394	}
371		395
372	/*	396	/*
373	* 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
374	* multi-object 1 which is closest to the second object.	398	* multi-object 1 which is closest to the second object.
375	* If it's not a multi-object, it is returned.	399	* If it's not a multi-object, it is returned.
376	*/	400	*/
377
378	object *	401	object *
379	get_nearest_part (object *op, const object *pl)	402	get_nearest_part (object *op, const object *pl)
380	{	403	{
381	object *tmp, *closest;	404	object *tmp, *closest;
382	int last_dist, i;	405	int last_dist, i;
383		406
384	if (op->more == NULL)	407	if (!op->more)
385	return op;	408	return op;
		409
386	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)
387	if ((i = distance (tmp, pl)) < last_dist)	413	if ((i = distance (tmp, pl)) < last_dist)
388	closest = tmp, last_dist = i;	414	closest = tmp, last_dist = i;
		415
389	return closest;	416	return closest;
390	}	417	}
391		418
392	/*	419	/*
393	* 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.
394	*/	422	*/
395
396	object *	423	object *
397	find_object (tag_t i)	424	find_object (tag_t i)
398	{	425	{
399	for (object *op = object::first; op; op = op->next)	426	for_all_objects (op)
400	if (op->count == i)	427	if (op->count == i)
401	return op;	428	return op;
402		429
403	return 0;	430	return 0;
404	}	431	}
405		432
406	/*	433	/*
407	* Returns the first object which has a name equal to the argument.	434	* Returns the first object which has a name equal to the argument.
408	* Used only by the patch command, but not all that useful.	435	* Used only by the patch command, but not all that useful.
409	* Enables features like "patch <name-of-other-player> food 999"	436	* Enables features like "patch <name-of-other-player> food 999"
410	*/	437	*/
411
412	object *	438	object *
413	find_object_name (const char *str)	439	find_object_name (const char *str)
414	{	440	{
415	shstr_cmp str_ (str);	441	shstr_cmp str_ (str);
416	object *op;	442	object *op;
417		443
418	for (op = object::first; op != NULL; op = op->next)	444	for_all_objects (op)
419	if (op->name == str_)	445	if (op->name == str_)
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;
…		…
624	return;	727	return;
625	}	728	}
626		729
627	mapspace &m = op->ms ();	730	mapspace &m = op->ms ();
628		731
629	if (m.flags_ & P_NEED_UPDATE)	732	if (!(m.flags_ & P_UPTODATE))
630	/* nop */;	733	/* nop */;
631	else if (action == UP_OBJ_INSERT)	734	else if (action == UP_OBJ_INSERT)
632	{	735	{
633	// this is likely overkill, TODO: revisit (schmorp)	736	// this is likely overkill, TODO: revisit (schmorp)
634	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	737	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
…		…
643	/* This isn't perfect, but I don't expect a lot of objects to	746	/* This isn't perfect, but I don't expect a lot of objects to
644	* to have move_allow right now.	747	* to have move_allow right now.
645	*/	748	*/
646	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	749	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
647	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	750	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
648	m.flags_ = P_NEED_UPDATE;	751	m.flags_ = 0;
649	}	752	}
650	/* if the object is being removed, we can't make intelligent	753	/* if the object is being removed, we can't make intelligent
651	* decisions, because remove_ob can't really pass the object	754	* decisions, because remove_ob can't really pass the object
652	* that is being removed.	755	* that is being removed.
653	*/	756	*/
654	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	757	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
655	m.flags_ = P_NEED_UPDATE;	758	m.flags_ = 0;
656	else if (action == UP_OBJ_FACE)	759	else if (action == UP_OBJ_FACE)
657	/* Nothing to do for that case */ ;	760	/* Nothing to do for that case */ ;
658	else	761	else
659	LOG (llevError, "update_object called with invalid action: %d\n", action);	762	LOG (llevError, "update_object called with invalid action: %d\n", action);
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
		783	static int object_count;
		784
680	void object::link ()	785	void object::link ()
681	{	786	{
		787	assert (!index);//D
		788	uuid = UUID::gen ();
682	count = ++ob_count;	789	count = ++object_count;
683	uuid = gen_uuid ();
684		790
685	prev = 0;	791	refcnt_inc ();
686	next = object::first;	792	objects.insert (this);
687
688	if (object::first)
689	object::first->prev = this;
690
691	object::first = this;
692	}	793	}
693		794
694	void object::unlink ()	795	void object::unlink ()
695	{	796	{
696	if (this == object::first)	797	if (!index)
697	object::first = next;	798	return;
698		799
699	/* Remove this object from the list of used objects */	800	objects.erase (this);
700	if (prev) prev->next = next;	801	refcnt_dec ();
701	if (next) next->prev = prev;
702
703	prev = 0;
704	next = 0;
705	}
706
707	bool
708	object::active () const
709	{
710	return active_next || active_prev || this == active_objects;
711	}	802	}
712		803
713	void	804	void
714	object::activate ()	805	object::activate ()
715	{	806	{
716	/* If already on active list, don't do anything */	807	/* If already on active list, don't do anything */
717	if (active ())	808	if (active)
718	return;	809	return;
719		810
720	if (has_active_speed ())	811	if (has_active_speed ())
721	{	812	actives.insert (this);
722	/* process_events() expects us to insert the object at the beginning
723	* of the list. */
724	active_next = active_objects;
725
726	if (active_next)
727	active_next->active_prev = this;
728
729	active_objects = this;
730	}
731	}	813	}
732		814
733	void	815	void
734	object::activate_recursive ()	816	object::activate_recursive ()
735	{	817	{
736	activate ();	818	activate ();
737		819
738	for (object *op = inv; op; op = op->above)	820	for (object *op = inv; op; op = op->below)
739	op->activate_recursive ();	821	op->activate_recursive ();
740	}	822	}
741		823
742	/* This function removes object 'op' from the list of active	824	/* This function removes object 'op' from the list of active
743	* objects.	825	* objects.
…		…
749	*/	831	*/
750	void	832	void
751	object::deactivate ()	833	object::deactivate ()
752	{	834	{
753	/* If not on the active list, nothing needs to be done */	835	/* If not on the active list, nothing needs to be done */
754	if (!active ())	836	if (!active)
755	return;	837	return;
756		838
757	if (active_prev == 0)	839	actives.erase (this);
758	{
759	active_objects = active_next;
760	if (active_next)
761	active_next->active_prev = 0;
762	}
763	else
764	{
765	active_prev->active_next = active_next;
766	if (active_next)
767	active_next->active_prev = active_prev;
768	}
769
770	active_next = 0;
771	active_prev = 0;
772	}	840	}
773		841
774	void	842	void
775	object::deactivate_recursive ()	843	object::deactivate_recursive ()
776	{	844	{
777	for (object *op = inv; op; op = op->above)	845	for (object *op = inv; op; op = op->below)
778	op->deactivate_recursive ();	846	op->deactivate_recursive ();
779		847
780	deactivate ();	848	deactivate ();
		849	}
		850
		851	void
		852	object::set_flag_inv (int flag, int value)
		853	{
		854	for (object *op = inv; op; op = op->below)
		855	{
		856	op->flag [flag] = value;
		857	op->set_flag_inv (flag, value);
		858	}
781	}	859	}
782		860
783	/*	861	/*
784	* Remove and free all objects in the inventory of the given object.	862	* Remove and free all objects in the inventory of the given object.
785	* object.c ?	863	* object.c ?
…		…
799	* if some form of movement is allowed, let objects	877	* if some form of movement is allowed, let objects
800	* drop on that space.	878	* drop on that space.
801	*/	879	*/
802	if (!drop_to_ground	880	if (!drop_to_ground
803	|| !map	881	|| !map
804	|| map->in_memory != MAP_IN_MEMORY	882	|| map->in_memory != MAP_ACTIVE
		883	|| map->nodrop
805	|| ms ().move_block == MOVE_ALL)	884	|| ms ().move_block == MOVE_ALL)
806	{	885	{
807	while (inv)	886	while (inv)
808	{	887	{
809	inv->destroy_inv (drop_to_ground);	888	inv->destroy_inv (drop_to_ground);
…		…
818		897
819	if (op->flag [FLAG_STARTEQUIP]	898	if (op->flag [FLAG_STARTEQUIP]
820	|| op->flag [FLAG_NO_DROP]	899	|| op->flag [FLAG_NO_DROP]
821	|| op->type == RUNE	900	|| op->type == RUNE
822	|| op->type == TRAP	901	|| op->type == TRAP
823	|| op->flag [FLAG_IS_A_TEMPLATE])	902	|| op->flag [FLAG_IS_A_TEMPLATE]
		903	|| op->flag [FLAG_DESTROY_ON_DEATH])
824	op->destroy ();	904	op->destroy ();
825	else	905	else
826	map->insert (op, x, y);	906	map->insert (op, x, y);
827	}	907	}
828	}	908	}
…		…
836	}	916	}
837		917
838	void	918	void
839	object::do_destroy ()	919	object::do_destroy ()
840	{	920	{
		921	attachable::do_destroy ();
		922
841	if (flag [FLAG_IS_LINKED])	923	if (flag [FLAG_IS_LINKED])
842	remove_button_link (this);	924	remove_button_link (this);
843		925
844	if (flag [FLAG_FRIENDLY])	926	if (flag [FLAG_FRIENDLY])
845	remove_friendly_object (this);	927	remove_friendly_object (this);
846		928
847	if (!flag [FLAG_REMOVED])	929	if (!flag [FLAG_REMOVED])
848	remove ();	930	remove ();
849		931
850	if (flag [FLAG_FREED])	932	destroy_inv (true);
851	return;
852		933
853	set_speed (0);	934	deactivate ();
		935	unlink ();
854		936
855	flag [FLAG_FREED] = 1;	937	flag [FLAG_FREED] = 1;
856
857	attachable::do_destroy ();
858
859	destroy_inv (true);
860	unlink ();
861		938
862	// hack to ensure that freed objects still have a valid map	939	// hack to ensure that freed objects still have a valid map
863	{	940	{
864	static maptile *freed_map; // freed objects are moved here to avoid crashes	941	static maptile *freed_map; // freed objects are moved here to avoid crashes
865		942
866	if (!freed_map)	943	if (!freed_map)
867	{	944	{
868	freed_map = new maptile;	945	freed_map = new maptile;
869		946
		947	freed_map->path = "<freed objects map>";
870	freed_map->name = "/internal/freed_objects_map";	948	freed_map->name = "/internal/freed_objects_map";
871	freed_map->width = 3;	949	freed_map->width = 3;
872	freed_map->height = 3;	950	freed_map->height = 3;
		951	freed_map->nodrop = 1;
873		952
874	freed_map->alloc ();	953	freed_map->alloc ();
		954	freed_map->in_memory = MAP_ACTIVE;
875	}	955	}
876		956
877	map = freed_map;	957	map = freed_map;
878	x = 1;	958	x = 1;
879	y = 1;	959	y = 1;
880	}	960	}
881		961
882	head = 0;
883
884	if (more)	962	if (more)
885	{	963	{
886	more->destroy ();	964	more->destroy ();
887	more = 0;	965	more = 0;
888	}	966	}
889		967
		968	head = 0;
		969
890	// clear those pointers that likely might have circular references to us	970	// clear those pointers that likely might cause circular references
891	owner = 0;	971	owner = 0;
892	enemy = 0;	972	enemy = 0;
893	attacked_by = 0;	973	attacked_by = 0;
894		974	current_weapon = 0;
895	// only relevant for players(?), but make sure of it anyways
896	contr = 0;
897	}	975	}
898		976
899	void	977	void
900	object::destroy (bool destroy_inventory)	978	object::destroy (bool destroy_inventory)
901	{	979	{
…		…
903	return;	981	return;
904		982
905	if (destroy_inventory)	983	if (destroy_inventory)
906	destroy_inv (false);	984	destroy_inv (false);
907		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
908	attachable::destroy ();	992	attachable::destroy ();
909	}
910
911	/*
912	* sub_weight() recursively (outwards) subtracts a number from the
913	* weight of an object (and what is carried by it's environment(s)).
914	*/
915	void
916	sub_weight (object *op, signed long weight)
917	{
918	while (op != NULL)
919	{
920	if (op->type == CONTAINER)
921	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
922
923	op->carrying -= weight;
924	op = op->env;
925	}
926	}	993	}
927		994
928	/* op->remove ():	995	/* op->remove ():
929	* 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
930	* 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
931	* object will have no environment. If the object previously had an	998	* object will have no environment. If the object previously had an
932	* environment, the x and y coordinates will be updated to	999	* environment, the x and y coordinates will be updated to
933	* the previous environment.	1000	* the previous environment.
934	* Beware: This function is called from the editor as well!
935	*/	1001	*/
936	void	1002	void
937	object::remove ()	1003	object::do_remove ()
938	{	1004	{
939	object *tmp, *last = 0;	1005	object *tmp, *last = 0;
940	object *otmp;	1006	object *otmp;
941		1007
942	if (QUERY_FLAG (this, FLAG_REMOVED))	1008	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
952	* In this case, the object to be removed is in someones	1018	* In this case, the object to be removed is in someones
953	* inventory.	1019	* inventory.
954	*/	1020	*/
955	if (env)	1021	if (env)
956	{	1022	{
		1023	adjust_weight (env, -total_weight ());
		1024
		1025	*(above ? &above->below : &env->inv) = below;
		1026
957	if (nrof)	1027	if (below)
958	sub_weight (env, weight * nrof);	1028	below->above = above;
959	else	1029
960	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;
961		1040
962	/* 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
963	* made to players inventory. If set, avoiding the call	1042	* made to players inventory. If set, avoiding the call
964	* to save cpu time.	1043	* to save cpu time.
965	*/	1044	*/
966	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))
967	otmp->update_stats ();	1046	otmp->update_stats ();
968
969	if (above)
970	above->below = below;
971	else
972	env->inv = below;
973
974	if (below)
975	below->above = above;
976
977	/* we set up values so that it could be inserted into
978	* the map, but we don't actually do that - it is up
979	* to the caller to decide what we want to do.
980	*/
981	x = env->x, y = env->y;
982	map = env->map;
983	above = 0, below = 0;
984	env = 0;
985	}	1047	}
986	else if (map)	1048	else if (map)
987	{	1049	{
988	if (type == PLAYER)	1050	if (type == PLAYER)
989	{	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
990	--map->players;	1058	--map->players;
991	map->last_access = runtime;	1059	map->touch ();
992	}	1060	}
993		1061
994	map->dirty = true;	1062	map->dirty = true;
		1063	mapspace &ms = this->ms ();
995		1064
996	/* link the object above us */	1065	/* link the object above us */
997	if (above)	1066	if (above)
998	above->below = below;	1067	above->below = below;
999	else	1068	else
1000	map->at (x, y).top = below; /* we were top, set new top */	1069	ms.top = below; /* we were top, set new top */
1001		1070
1002	/* Relink the object below us, if there is one */	1071	/* Relink the object below us, if there is one */
1003	if (below)	1072	if (below)
1004	below->above = above;	1073	below->above = above;
1005	else	1074	else
…		…
1007	/* 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
1008	* use translated coordinates in case some oddness with map tiling is	1077	* use translated coordinates in case some oddness with map tiling is
1009	* evident	1078	* evident
1010	*/	1079	*/
1011	if (GET_MAP_OB (map, x, y) != this)	1080	if (GET_MAP_OB (map, x, y) != this)
1012	{
1013	char *dump = dump_object (this);
1014	LOG (llevError,
1015	"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 ());
1016	free (dump);
1017	dump = dump_object (GET_MAP_OB (map, x, y));
1018	LOG (llevError, "%s\n", dump);
1019	free (dump);
1020	}
1021		1082
1022	map->at (x, y).bot = above; /* goes on above it. */	1083	ms.bot = above; /* goes on above it. */
1023	}	1084	}
1024		1085
1025	above = 0;	1086	above = 0;
1026	below = 0;	1087	below = 0;
1027		1088
1028	if (map->in_memory == MAP_SAVING)	1089	if (map->in_memory == MAP_SAVING)
1029	return;	1090	return;
1030		1091
1031	int check_walk_off = !flag [FLAG_NO_APPLY];	1092	int check_walk_off = !flag [FLAG_NO_APPLY];
1032		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
1033	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1106	for (tmp = ms.bot; tmp; tmp = tmp->above)
1034	{	1107	{
1035	/* 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
1036	* being removed.	1109	* being removed.
1037	*/	1110	*/
1038
1039	if (tmp->type == PLAYER && tmp != this)
1040	{
1041	/* If a container that the player is currently using somehow gets
1042	* removed (most likely destroyed), update the player view
1043	* appropriately.
1044	*/
1045	if (tmp->container == this)
1046	{
1047	flag [FLAG_APPLIED] = 0;
1048	tmp->container = 0;
1049	}
1050
1051	if (tmp->contr->ns)
1052	tmp->contr->ns->floorbox_update ();
1053	}
1054		1111
1055	/* See if object moving off should effect something */	1112	/* See if object moving off should effect something */
1056	if (check_walk_off	1113	if (check_walk_off
1057	&& ((move_type & tmp->move_off)	1114	&& ((move_type & tmp->move_off)
1058	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1115	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1061		1118
1062	if (destroyed ())	1119	if (destroyed ())
1063	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 ());
1064	}	1121	}
1065		1122
1066	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1067	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1068	if (tmp->above == tmp)
1069	tmp->above = 0;
1070
1071	last = tmp;	1123	last = tmp;
1072	}	1124	}
1073		1125
1074	/* last == NULL if there are no objects on this space */	1126	/* last == NULL if there are no objects on this space */
1075	//TODO: this makes little sense, why only update the topmost object?	1127	//TODO: this makes little sense, why only update the topmost object?
1076	if (!last)	1128	if (!last)
1077	map->at (x, y).flags_ = P_NEED_UPDATE;	1129	map->at (x, y).flags_ = 0;
1078	else	1130	else
1079	update_object (last, UP_OBJ_REMOVE);	1131	update_object (last, UP_OBJ_REMOVE);
1080		1132
1081	if (flag [FLAG_BLOCKSVIEW] || glow_radius)	1133	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1082	update_all_los (map, x, y);	1134	update_all_los (map, x, y);
…		…
1095	merge_ob (object *op, object *top)	1147	merge_ob (object *op, object *top)
1096	{	1148	{
1097	if (!op->nrof)	1149	if (!op->nrof)
1098	return 0;	1150	return 0;
1099		1151
1100	if (top)	1152	if (!top)
1101	for (top = op; top && top->above; top = top->above)	1153	for (top = op; top && top->above; top = top->above)
1102	;	1154	;
1103		1155
1104	for (; top; top = top->below)	1156	for (; top; top = top->below)
1105	{	1157	{
…		…
1118	}	1170	}
1119		1171
1120	return 0;	1172	return 0;
1121	}	1173	}
1122		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
1123	/*	1198	/*
1124	* 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
1125	* job preparing multi-part monsters	1200	* job preparing multi-part monsters.
1126	*/	1201	*/
1127	object *	1202	object *
1128	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)
1129	{	1204	{
1130	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1205	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1131	{	1206	{
1132	tmp->x = x + tmp->arch->clone.x;	1207	tmp->x = x + tmp->arch->x;
1133	tmp->y = y + tmp->arch->clone.y;	1208	tmp->y = y + tmp->arch->y;
1134	}	1209	}
1135		1210
1136	return insert_ob_in_map (op, m, originator, flag);	1211	return insert_ob_in_map (op, m, originator, flag);
1137	}	1212	}
1138		1213
…		…
1157	* just 'op' otherwise	1232	* just 'op' otherwise
1158	*/	1233	*/
1159	object *	1234	object *
1160	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)
1161	{	1236	{
		1237	assert (!op->flag [FLAG_FREED]);
		1238
1162	object *tmp, *top, *floor = NULL;	1239	object *top, *floor = NULL;
1163	sint16 x, y;
1164		1240
1165	if (QUERY_FLAG (op, FLAG_FREED))	1241	op->remove ();
1166	{
1167	LOG (llevError, "Trying to insert freed object!\n");
1168	return NULL;
1169	}
1170
1171	if (!m)
1172	{
1173	char *dump = dump_object (op);
1174	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1175	free (dump);
1176	return op;
1177	}
1178
1179	if (out_of_map (m, op->x, op->y))
1180	{
1181	char *dump = dump_object (op);
1182	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1183	#ifdef MANY_CORES
1184	/* Better to catch this here, as otherwise the next use of this object
1185	* is likely to cause a crash. Better to find out where it is getting
1186	* improperly inserted.
1187	*/
1188	abort ();
1189	#endif
1190	free (dump);
1191	return op;
1192	}
1193
1194	if (!QUERY_FLAG (op, FLAG_REMOVED))
1195	{
1196	char *dump = dump_object (op);
1197	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1198	free (dump);
1199	return op;
1200	}
1201
1202	if (op->more)
1203	{
1204	/* The part may be on a different map. */
1205
1206	object *more = op->more;
1207
1208	/* We really need the caller to normalize coordinates - if
1209	* we set the map, that doesn't work if the location is within
1210	* a map and this is straddling an edge. So only if coordinate
1211	* is clear wrong do we normalize it.
1212	*/
1213	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1214	more->map = get_map_from_coord (m, &more->x, &more->y);
1215	else if (!more->map)
1216	{
1217	/* For backwards compatibility - when not dealing with tiled maps,
1218	* more->map should always point to the parent.
1219	*/
1220	more->map = m;
1221	}
1222
1223	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1224	{
1225	if (!op->head)
1226	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1227
1228	return 0;
1229	}
1230	}
1231
1232	CLEAR_FLAG (op, FLAG_REMOVED);
1233		1242
1234	/* Ideally, the caller figures this out. However, it complicates a lot	1243	/* Ideally, the caller figures this out. However, it complicates a lot
1235	* 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
1236	* need extra work	1245	* need extra work
1237	*/	1246	*/
1238	op->map = get_map_from_coord (m, &op->x, &op->y);	1247	if (!xy_normalise (m, op->x, op->y))
1239	x = op->x;	1248	{
1240	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 ();
1241		1261
1242	/* this has to be done after we translate the coordinates.	1262	/* this has to be done after we translate the coordinates.
1243	*/	1263	*/
1244	if (op->nrof && !(flag & INS_NO_MERGE))	1264	if (op->nrof && !(flag & INS_NO_MERGE))
1245	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1265	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1246	if (object::can_merge (op, tmp))	1266	if (object::can_merge (op, tmp))
1247	{	1267	{
1248	op->nrof += tmp->nrof;	1268	op->nrof += tmp->nrof;
1249	tmp->destroy ();	1269	tmp->destroy (1);
1250	}	1270	}
1251		1271
1252	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 */
1253	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1273	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1254		1274
…		…
1267	op->below = originator->below;	1287	op->below = originator->below;
1268		1288
1269	if (op->below)	1289	if (op->below)
1270	op->below->above = op;	1290	op->below->above = op;
1271	else	1291	else
1272	op->ms ().bot = op;	1292	ms.bot = op;
1273		1293
1274	/* since *below* originator, no need to update top */	1294	/* since *below* originator, no need to update top */
1275	originator->below = op;	1295	originator->below = op;
1276	}	1296	}
1277	else	1297	else
1278	{	1298	{
		1299	top = ms.bot;
		1300
1279	/* If there are other objects, then */	1301	/* If there are other objects, then */
1280	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1302	if (top)
1281	{	1303	{
1282	object *last = 0;	1304	object *last = 0;
1283		1305
1284	/*	1306	/*
1285	* 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.
…		…
1291	* 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
1292	* 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
1293	* 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
1294	* that flying non pickable objects are spell objects.	1316	* that flying non pickable objects are spell objects.
1295	*/	1317	*/
1296	while (top)	1318	for (top = ms.bot; top; top = top->above)
1297	{	1319	{
1298	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))
1299	floor = top;	1321	floor = top;
1300		1322
1301	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))
…		…
1304	top = top->below;	1326	top = top->below;
1305	break;	1327	break;
1306	}	1328	}
1307		1329
1308	last = top;	1330	last = top;
1309	top = top->above;
1310	}	1331	}
1311		1332
1312	/* 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 */
1313	top = last;	1334	top = last;
1314		1335
…		…
1316	* looks like instead of lots of conditions here.	1337	* looks like instead of lots of conditions here.
1317	* makes things faster, and effectively the same result.	1338	* makes things faster, and effectively the same result.
1318	*/	1339	*/
1319		1340
1320	/* Have object 'fall below' other objects that block view.	1341	/* Have object 'fall below' other objects that block view.
1321	* Unless those objects are exits, type 66	1342	* Unless those objects are exits.
1322	* If INS_ON_TOP is used, don't do this processing	1343	* If INS_ON_TOP is used, don't do this processing
1323	* Need to find the object that in fact blocks view, otherwise	1344	* Need to find the object that in fact blocks view, otherwise
1324	* stacking is a bit odd.	1345	* stacking is a bit odd.
1325	*/	1346	*/
1326	if (!(flag & INS_ON_TOP) &&	1347	if (!(flag & INS_ON_TOP)
1327	(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))
1328	{	1350	{
1329	for (last = top; last != floor; last = last->below)	1351	for (last = top; last != floor; last = last->below)
1330	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1352	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1331	break;	1353	break;
		1354
1332	/* Check to see if we found the object that blocks view,	1355	/* Check to see if we found the object that blocks view,
1333	* 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
1334	* we can get inserted below this one, which requires we	1357	* we can get inserted below this one, which requires we
1335	* set top to the object below us.	1358	* set top to the object below us.
1336	*/	1359	*/
1337	if (last && last->below && last != floor)	1360	if (last && last->below && last != floor)
1338	top = last->below;	1361	top = last->below;
1339	}	1362	}
1340	} /* If objects on this space */	1363	} /* If objects on this space */
1341		1364
1342	if (flag & INS_MAP_LOAD)
1343	top = GET_MAP_TOP (op->map, op->x, op->y);
1344
1345	if (flag & INS_ABOVE_FLOOR_ONLY)	1365	if (flag & INS_ABOVE_FLOOR_ONLY)
1346	top = floor;	1366	top = floor;
1347		1367
1348	/* 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.
1349	*/	1369	*/
1350		1370
1351	/* First object on this space */	1371	/* First object on this space */
1352	if (!top)	1372	if (!top)
1353	{	1373	{
1354	op->above = GET_MAP_OB (op->map, op->x, op->y);	1374	op->above = ms.bot;
1355		1375
1356	if (op->above)	1376	if (op->above)
1357	op->above->below = op;	1377	op->above->below = op;
1358		1378
1359	op->below = 0;	1379	op->below = 0;
1360	op->ms ().bot = op;	1380	ms.bot = op;
1361	}	1381	}
1362	else	1382	else
1363	{ /* get inserted into the stack above top */	1383	{ /* get inserted into the stack above top */
1364	op->above = top->above;	1384	op->above = top->above;
1365		1385
…		…
1369	op->below = top;	1389	op->below = top;
1370	top->above = op;	1390	top->above = op;
1371	}	1391	}
1372		1392
1373	if (!op->above)	1393	if (!op->above)
1374	op->ms ().top = op;	1394	ms.top = op;
1375	} /* else not INS_BELOW_ORIGINATOR */	1395	} /* else not INS_BELOW_ORIGINATOR */
1376		1396
1377	if (op->type == PLAYER)	1397	if (op->type == PLAYER)
1378	{	1398	{
1379	op->contr->do_los = 1;	1399	op->contr->do_los = 1;
1380	++op->map->players;	1400	++op->map->players;
1381	op->map->last_access = runtime;	1401	op->map->touch ();
1382	}	1402	}
1383		1403
1384	op->map->dirty = true;	1404	op->map->dirty = true;
1385		1405
1386	/* If we have a floor, we know the player, if any, will be above
1387	* it, so save a few ticks and start from there.
1388	*/
1389	if (!(flag & INS_MAP_LOAD))
1390	if (object *pl = op->ms ().player ())	1406	if (object *pl = ms.player ())
1391	if (pl->contr->ns)
1392	pl->contr->ns->floorbox_update ();	1407	pl->contr->ns->floorbox_update ();
1393		1408
1394	/* If this object glows, it may affect lighting conditions that are	1409	/* If this object glows, it may affect lighting conditions that are
1395	* 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
1396	* 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
1397	* on the map will get recalculated. The players could very well	1412	* on the map will get recalculated. The players could very well
1398	* be far away from this change and not affected in any way -	1413	* be far away from this change and not affected in any way -
1399	* this should get redone to only look for players within range,	1414	* this should get redone to only look for players within range,
1400	* or just updating the P_NEED_UPDATE for spaces within this area	1415	* or just updating the P_UPTODATE for spaces within this area
1401	* of effect may be sufficient.	1416	* of effect may be sufficient.
1402	*/	1417	*/
1403	if (op->map->darkness && (op->glow_radius != 0))	1418	if (op->map->darkness && (op->glow_radius != 0))
1404	update_all_los (op->map, op->x, op->y);	1419	update_all_los (op->map, op->x, op->y);
1405		1420
…		…
1416	* blocked() and wall() work properly), and these flags are updated by	1431	* blocked() and wall() work properly), and these flags are updated by
1417	* update_object().	1432	* update_object().
1418	*/	1433	*/
1419		1434
1420	/* 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 */
1421	if (!(flag & INS_NO_WALK_ON) && !op->head)	1436	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1422	{	1437	{
1423	if (check_move_on (op, originator))	1438	if (check_move_on (op, originator))
1424	return 0;	1439	return 0;
1425		1440
1426	/* 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
1427	* walk on's.	1442	* walk on's.
1428	*/	1443	*/
1429	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1444	for (object *tmp = op->more; tmp; tmp = tmp->more)
1430	if (check_move_on (tmp, originator))	1445	if (check_move_on (tmp, originator))
1431	return 0;	1446	return 0;
1432	}	1447	}
1433		1448
1434	return op;	1449	return op;
…		…
1439	* 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.
1440	*/	1455	*/
1441	void	1456	void
1442	replace_insert_ob_in_map (const char *arch_string, object *op)	1457	replace_insert_ob_in_map (const char *arch_string, object *op)
1443	{	1458	{
1444	object *tmp, *tmp1;
1445
1446	/* first search for itself and remove any old instances */	1459	/* first search for itself and remove any old instances */
1447		1460
1448	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1461	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1449	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1462	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1450	tmp->destroy ();	1463	tmp->destroy (1);
1451		1464
1452	tmp1 = arch_to_object (archetype::find (arch_string));	1465	object *tmp = arch_to_object (archetype::find (arch_string));
1453		1466
1454	tmp1->x = op->x;	1467	tmp->x = op->x;
1455	tmp1->y = op->y;	1468	tmp->y = op->y;
		1469
1456	insert_ob_in_map (tmp1, op->map, op, 0);	1470	insert_ob_in_map (tmp, op->map, op, 0);
1457	}	1471	}
1458		1472
1459	object *	1473	object *
1460	object::insert_at (object *where, object *originator, int flags)	1474	object::insert_at (object *where, object *originator, int flags)
1461	{	1475	{
		1476	if (where->env)
		1477	return where->env->insert (this);
		1478	else
1462	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	}
1463	}	1552	}
1464		1553
1465	/*	1554	/*
1466	* 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
1467	* is returned contains nr objects, and the remaining parts contains	1556	* is returned contains nr objects, and the remaining parts contains
1468	* 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).
1469	* On failure, NULL is returned, and the reason put into the	1558	* On failure, NULL is returned, and the reason put into the
1470	* global static errmsg array.	1559	* global static errmsg array.
1471	*/	1560	*/
1472	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 *
1473	get_split_ob (object *orig_ob, uint32 nr)	1583	get_split_ob (object *orig_ob, uint32 nr)
1474	{	1584	{
1475	object *newob;
1476	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1477
1478	if (orig_ob->nrof < nr)	1585	if (orig_ob->nrof < nr)
1479	{	1586	{
1480	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);
1481	return NULL;
1482	}
1483
1484	newob = object_create_clone (orig_ob);
1485
1486	if ((orig_ob->nrof -= nr) < 1)
1487	orig_ob->destroy (1);
1488	else if (!is_removed)
1489	{
1490	if (orig_ob->env != NULL)
1491	sub_weight (orig_ob->env, orig_ob->weight * nr);
1492	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1493	{
1494	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1495	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1496	return NULL;
1497	}
1498	}
1499
1500	newob->nrof = nr;
1501
1502	return newob;
1503	}
1504
1505	/*
1506	* decrease_ob_nr(object, number) decreases a specified number from
1507	* the amount of an object. If the amount reaches 0, the object
1508	* is subsequently removed and freed.
1509	*
1510	* Return value: 'op' if something is left, NULL if the amount reached 0
1511	*/
1512
1513	object *
1514	decrease_ob_nr (object *op, uint32 i)
1515	{
1516	object *tmp;
1517
1518	if (i == 0) /* objects with op->nrof require this check */
1519	return op;
1520
1521	if (i > op->nrof)
1522	i = op->nrof;
1523
1524	if (QUERY_FLAG (op, FLAG_REMOVED))
1525	op->nrof -= i;
1526	else if (op->env)
1527	{
1528	/* is this object in the players inventory, or sub container
1529	* therein?
1530	*/
1531	tmp = op->in_player ();
1532	/* nope. Is this a container the player has opened?
1533	* If so, set tmp to that player.
1534	* IMO, searching through all the players will mostly
1535	* likely be quicker than following op->env to the map,
1536	* and then searching the map for a player.
1537	*/
1538	if (!tmp)
1539	for_all_players (pl)
1540	if (pl->ob->container == op->env)
1541	{
1542	tmp = pl->ob;
1543	break;
1544	}
1545
1546	if (i < op->nrof)
1547	{
1548	sub_weight (op->env, op->weight * i);
1549	op->nrof -= i;
1550	if (tmp)
1551	esrv_send_item (tmp, op);
1552	}
1553	else
1554	{
1555	op->remove ();
1556	op->nrof = 0;
1557	if (tmp)
1558	esrv_del_item (tmp->contr, op->count);
1559	}
1560	}
1561	else
1562	{
1563	object *above = op->above;
1564
1565	if (i < op->nrof)
1566	op->nrof -= i;
1567	else
1568	{
1569	op->remove ();
1570	op->nrof = 0;
1571	}
1572
1573	/* Since we just removed op, op->above is null */
1574	for (tmp = above; tmp; tmp = tmp->above)
1575	if (tmp->type == PLAYER)
1576	{
1577	if (op->nrof)
1578	esrv_send_item (tmp, op);
1579	else
1580	esrv_del_item (tmp->contr, op->count);
1581	}
1582	}
1583
1584	if (op->nrof)
1585	return op;
1586	else
1587	{
1588	op->destroy ();
1589	return 0;	1588	return 0;
1590	}	1589	}
1591	}
1592		1590
1593	/*	1591	return orig_ob->split (nr);
1594	* add_weight(object, weight) adds the specified weight to an object,
1595	* and also updates how much the environment(s) is/are carrying.
1596	*/
1597
1598	void
1599	add_weight (object *op, signed long weight)
1600	{
1601	while (op != NULL)
1602	{
1603	if (op->type == CONTAINER)
1604	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1605
1606	op->carrying += weight;
1607	op = op->env;
1608	}
1609	}	1592	}
1610		1593
1611	object *	1594	object *
1612	insert_ob_in_ob (object *op, object *where)	1595	insert_ob_in_ob (object *op, object *where)
1613	{	1596	{
…		…
1617	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);
1618	free (dump);	1601	free (dump);
1619	return op;	1602	return op;
1620	}	1603	}
1621		1604
1622	if (where->head)	1605	if (where->head_ () != where)
1623	{	1606	{
1624	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");
1625	where = where->head;	1608	where = where->head;
1626	}	1609	}
1627		1610
1628	return where->insert (op);	1611	return where->insert (op);
1629	}	1612	}
…		…
1634	* inside the object environment.	1617	* inside the object environment.
1635	*	1618	*
1636	* 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
1637	* be != op, if items are merged. -Tero	1620	* be != op, if items are merged. -Tero
1638	*/	1621	*/
1639
1640	object *	1622	object *
1641	object::insert (object *op)	1623	object::insert (object *op)
1642	{	1624	{
1643	object *tmp, *otmp;
1644
1645	if (!QUERY_FLAG (op, FLAG_REMOVED))
1646	op->remove ();
1647
1648	if (op->more)	1625	if (op->more)
1649	{	1626	{
1650	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);
1651	return op;	1628	return op;
1652	}	1629	}
1653		1630
1654	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1631	op->remove ();
1655	CLEAR_FLAG (op, FLAG_REMOVED);	1632
		1633	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1634
1656	if (op->nrof)	1635	if (op->nrof)
1657	{
1658	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1636	for (object *tmp = inv; tmp; tmp = tmp->below)
1659	if (object::can_merge (tmp, op))	1637	if (object::can_merge (tmp, op))
1660	{	1638	{
1661	/* return the original object and remove inserted object	1639	/* return the original object and remove inserted object
1662	(client needs the original object) */	1640	(client needs the original object) */
1663	tmp->nrof += op->nrof;	1641	tmp->nrof += op->nrof;
1664	/* Weight handling gets pretty funky. Since we are adding to	1642	op->destroy (1);
1665	* tmp->nrof, we need to increase the weight.
1666	*/
1667	add_weight (this, op->weight * op->nrof);
1668	SET_FLAG (op, FLAG_REMOVED);
1669	op->destroy (); /* free the inserted object */
1670	op = tmp;	1643	op = tmp;
1671	op->remove (); /* and fix old object's links */	1644	goto inserted;
1672	CLEAR_FLAG (op, FLAG_REMOVED);
1673	break;
1674	}	1645	}
1675		1646
1676	/* I assume combined objects have no inventory	1647	op->owner = 0; // it's his/hers now. period.
1677	* We add the weight - this object could have just been removed	1648	op->map = 0;
1678	* (if it was possible to merge). calling remove_ob will subtract	1649	op->x = 0;
1679	* the weight, so we need to add it in again, since we actually do	1650	op->y = 0;
1680	* the linking below
1681	*/
1682	add_weight (this, op->weight * op->nrof);
1683	}
1684	else
1685	add_weight (this, (op->weight + op->carrying));
1686		1651
1687	otmp = this->in_player ();	1652	op->above = 0;
1688	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 ())
1689	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1671	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1690	otmp->update_stats ();	1672	otmp->update_stats ();
1691
1692	op->map = 0;
1693	op->env = this;
1694	op->above = 0;
1695	op->below = 0;
1696	op->x = 0, op->y = 0;
1697
1698	/* reset the light list and los of the players on the map */
1699	if ((op->glow_radius != 0) && map)
1700	{
1701	#ifdef DEBUG_LIGHTS
1702	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1703	#endif /* DEBUG_LIGHTS */
1704	if (map->darkness)
1705	update_all_los (map, x, y);
1706	}
1707
1708	/* Client has no idea of ordering so lets not bother ordering it here.
1709	* It sure simplifies this function...
1710	*/
1711	if (!inv)
1712	inv = op;
1713	else
1714	{
1715	op->below = inv;
1716	op->below->above = op;
1717	inv = op;
1718	}
1719		1673
1720	INVOKE_OBJECT (INSERT, this);	1674	INVOKE_OBJECT (INSERT, this);
1721		1675
1722	return op;	1676	return op;
1723	}	1677	}
…		…
1776		1730
1777	/* The objects have to be checked from top to bottom.	1731	/* The objects have to be checked from top to bottom.
1778	* Hence, we first go to the top:	1732	* Hence, we first go to the top:
1779	*/	1733	*/
1780		1734
1781	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above)	1735	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1782	{	1736	{
1783	/* Trim the search when we find the first other spell effect	1737	/* Trim the search when we find the first other spell effect
1784	* this helps performance so that if a space has 50 spell objects,	1738	* this helps performance so that if a space has 50 spell objects,
1785	* we don't need to check all of them.	1739	* we don't need to check all of them.
1786	*/	1740	*/
…		…
1804	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1758	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1805	((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))
1806	{	1760	{
1807		1761
1808	float	1762	float
1809	diff = tmp->move_slow_penalty * FABS (op->speed);	1763	diff = tmp->move_slow_penalty * fabs (op->speed);
1810		1764
1811	if (op->type == PLAYER)	1765	if (op->type == PLAYER)
1812	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)) ||
1813	(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)))
1814	diff /= 4.0;	1768	diff /= 4.0;
…		…
1844	* The first matching object is returned, or NULL if none.	1798	* The first matching object is returned, or NULL if none.
1845	*/	1799	*/
1846	object *	1800	object *
1847	present_arch (const archetype *at, maptile *m, int x, int y)	1801	present_arch (const archetype *at, maptile *m, int x, int y)
1848	{	1802	{
1849	if (m == NULL || out_of_map (m, x, y))	1803	if (!m || out_of_map (m, x, y))
1850	{	1804	{
1851	LOG (llevError, "Present_arch called outside map.\n");	1805	LOG (llevError, "Present_arch called outside map.\n");
1852	return NULL;	1806	return NULL;
1853	}	1807	}
1854		1808
1855	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1809	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1856	if (tmp->arch == at)	1810	if (tmp->arch == at)
1857	return tmp;	1811	return tmp;
1858		1812
1859	return NULL;	1813	return NULL;
1860	}	1814	}
…		…
1871	{	1825	{
1872	LOG (llevError, "Present called outside map.\n");	1826	LOG (llevError, "Present called outside map.\n");
1873	return NULL;	1827	return NULL;
1874	}	1828	}
1875		1829
1876	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1830	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1877	if (tmp->type == type)	1831	if (tmp->type == type)
1878	return tmp;	1832	return tmp;
1879		1833
1880	return NULL;	1834	return NULL;
1881	}	1835	}
…		…
1938	* activate recursively a flag on an object inventory	1892	* activate recursively a flag on an object inventory
1939	*/	1893	*/
1940	void	1894	void
1941	flag_inv (object *op, int flag)	1895	flag_inv (object *op, int flag)
1942	{	1896	{
1943	if (op->inv)
1944	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1897	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1945	{	1898	{
1946	SET_FLAG (tmp, flag);	1899	SET_FLAG (tmp, flag);
1947	flag_inv (tmp, flag);	1900	flag_inv (tmp, flag);
1948	}	1901	}
1949	}	1902	}
1950		1903
1951	/*	1904	/*
1952	* deactivate recursively a flag on an object inventory	1905	* deactivate recursively a flag on an object inventory
1953	*/	1906	*/
1954	void	1907	void
1955	unflag_inv (object *op, int flag)	1908	unflag_inv (object *op, int flag)
1956	{	1909	{
1957	if (op->inv)
1958	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1910	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1959	{	1911	{
1960	CLEAR_FLAG (tmp, flag);	1912	CLEAR_FLAG (tmp, flag);
1961	unflag_inv (tmp, flag);	1913	unflag_inv (tmp, flag);
1962	}	1914	}
1963	}
1964
1965	/*
1966	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1967	* all it's inventory (recursively).
1968	* If checksums are used, a player will get set_cheat called for
1969	* him/her-self and all object carried by a call to this function.
1970	*/
1971	void
1972	set_cheat (object *op)
1973	{
1974	SET_FLAG (op, FLAG_WAS_WIZ);
1975	flag_inv (op, FLAG_WAS_WIZ);
1976	}	1915	}
1977		1916
1978	/*	1917	/*
1979	* 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
1980	* 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
…		…
1982	* to search (see the freearr_x/y[] definition).	1921	* to search (see the freearr_x/y[] definition).
1983	* It returns a random choice among the alternatives found.	1922	* It returns a random choice among the alternatives found.
1984	* 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
1985	* does all 4 immediate directions). This returns the index into the	1924	* does all 4 immediate directions). This returns the index into the
1986	* 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)
1987	* Note - this only checks to see if there is space for the head of the
1988	* object - if it is a multispace object, this should be called for all
1989	* pieces.
1990	* Note2: This function does correctly handle tiled maps, but does not	1926	* Note: This function does correctly handle tiled maps, but does not
1991	* inform the caller. However, insert_ob_in_map will update as	1927	* inform the caller. However, insert_ob_in_map will update as
1992	* 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.
1993	* 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
1994	* 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
1995	* 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
…		…
1997	* customized, changed states, etc.	1933	* customized, changed states, etc.
1998	*/	1934	*/
1999	int	1935	int
2000	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)
2001	{	1937	{
		1938	int altern[SIZEOFFREE];
2002	int index = 0, flag;	1939	int index = 0, flag;
2003	int altern[SIZEOFFREE];
2004		1940
2005	for (int i = start; i < stop; i++)	1941	for (int i = start; i < stop; i++)
2006	{	1942	{
2007	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1943	mapxy pos (m, x, y); pos.move (i);
2008	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	{
2009	altern [index++] = i;	1959	altern [index++] = i;
		1960	continue;
		1961	}
2010		1962
2011	/* 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.
2012	* 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.
2013	* 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 -
2014	* 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
2015	* 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
2016	* to only the spaces immediately surrounding the target area, and	1968	* to only the spaces immediately surrounding the target area, and
2017	* won't look 2 spaces south of the target space.	1969	* won't look 2 spaces south of the target space.
2018	*/	1970	*/
2019	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1971	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1972	{
2020	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;
2021	}	1987	}
2022		1988
2023	if (!index)	1989	if (!index)
2024	return -1;	1990	return -1;
2025		1991
2026	return altern[RANDOM () % index];	1992	return altern [rndm (index)];
2027	}	1993	}
2028		1994
2029	/*	1995	/*
2030	* find_first_free_spot(archetype, maptile, x, y) works like	1996	* find_first_free_spot(archetype, maptile, x, y) works like
2031	* find_free_spot(), but it will search max number of squares.	1997	* find_free_spot(), but it will search max number of squares.
…		…
2034	*/	2000	*/
2035	int	2001	int
2036	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)
2037	{	2003	{
2038	for (int i = 0; i < SIZEOFFREE; i++)	2004	for (int i = 0; i < SIZEOFFREE; i++)
2039	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]))
2040	return i;	2006	return i;
2041		2007
2042	return -1;	2008	return -1;
2043	}	2009	}
2044		2010
…		…
2052	{	2018	{
2053	arr += begin;	2019	arr += begin;
2054	end -= begin;	2020	end -= begin;
2055		2021
2056	while (--end)	2022	while (--end)
2057	swap (arr [end], arr [RANDOM () % (end + 1)]);	2023	swap (arr [end], arr [rndm (end + 1)]);
2058	}	2024	}
2059		2025
2060	/* new function to make monster searching more efficient, and effective!	2026	/* new function to make monster searching more efficient, and effective!
2061	* This basically returns a randomized array (in the passed pointer) of	2027	* This basically returns a randomized array (in the passed pointer) of
2062	* 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
…		…
2098	object *tmp;	2064	object *tmp;
2099	maptile *mp;	2065	maptile *mp;
2100		2066
2101	MoveType blocked, move_type;	2067	MoveType blocked, move_type;
2102		2068
2103	if (exclude && exclude->head)	2069	if (exclude && exclude->head_ () != exclude)
2104	{	2070	{
2105	exclude = exclude->head;	2071	exclude = exclude->head;
2106	move_type = exclude->move_type;	2072	move_type = exclude->move_type;
2107	}	2073	}
2108	else	2074	else
…		…
2131	max = maxfree[i];	2097	max = maxfree[i];
2132	else if (mflags & P_IS_ALIVE)	2098	else if (mflags & P_IS_ALIVE)
2133	{	2099	{
2134	for (tmp = ms.bot; tmp; tmp = tmp->above)	2100	for (tmp = ms.bot; tmp; tmp = tmp->above)
2135	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2101	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2136	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2102	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2137	break;	2103	break;
2138		2104
2139	if (tmp)	2105	if (tmp)
2140	return freedir[i];	2106	return freedir[i];
2141	}	2107	}
…		…
2196		2162
2197	return 3;	2163	return 3;
2198	}	2164	}
2199		2165
2200	/*	2166	/*
2201	* absdir(int): Returns a number between 1 and 8, which represent
2202	* the "absolute" direction of a number (it actually takes care of
2203	* "overflow" in previous calculations of a direction).
2204	*/
2205
2206	int
2207	absdir (int d)
2208	{
2209	while (d < 1)
2210	d += 8;
2211
2212	while (d > 8)
2213	d -= 8;
2214
2215	return d;
2216	}
2217
2218	/*
2219	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2167	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2220	* between two directions (which are expected to be absolute (see absdir())	2168	* between two directions (which are expected to be absolute (see absdir())
2221	*/	2169	*/
2222
2223	int	2170	int
2224	dirdiff (int dir1, int dir2)	2171	dirdiff (int dir1, int dir2)
2225	{	2172	{
2226	int d;	2173	int d;
2227		2174
…		…
2340	* 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
2341	* core dumps if they do.	2288	* core dumps if they do.
2342	*	2289	*
2343	* 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)
2344	*/	2291	*/
2345
2346	int	2292	int
2347	can_pick (const object *who, const object *item)	2293	can_pick (const object *who, const object *item)
2348	{	2294	{
2349	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2295	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2350	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2296	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2355	* create clone from object to another	2301	* create clone from object to another
2356	*/	2302	*/
2357	object *	2303	object *
2358	object_create_clone (object *asrc)	2304	object_create_clone (object *asrc)
2359	{	2305	{
2360	object *dst = 0, *tmp, *src, *part, *prev, *item;	2306	object *dst = 0, *tmp, *src, *prev, *item;
2361		2307
2362	if (!asrc)	2308	if (!asrc)
2363	return 0;	2309	return 0;
2364		2310
2365	src = asrc;
2366	if (src->head)
2367	src = src->head;	2311	src = asrc->head_ ();
2368		2312
2369	prev = 0;	2313	prev = 0;
2370	for (part = src; part; part = part->more)	2314	for (object *part = src; part; part = part->more)
2371	{	2315	{
2372	tmp = part->clone ();	2316	tmp = part->clone ();
2373	tmp->x -= src->x;	2317	tmp->x -= src->x;
2374	tmp->y -= src->y;	2318	tmp->y -= src->y;
2375		2319
…		…
2391		2335
2392	for (item = src->inv; item; item = item->below)	2336	for (item = src->inv; item; item = item->below)
2393	insert_ob_in_ob (object_create_clone (item), dst);	2337	insert_ob_in_ob (object_create_clone (item), dst);
2394		2338
2395	return dst;	2339	return dst;
2396	}
2397
2398	/* GROS - Creates an object using a string representing its content. */
2399	/* Basically, we save the content of the string to a temp file, then call */
2400	/* load_object on it. I admit it is a highly inefficient way to make things, */
2401	/* but it was simple to make and allows reusing the load_object function. */
2402	/* Remember not to use load_object_str in a time-critical situation. */
2403	/* Also remember that multiparts objects are not supported for now. */
2404	object *
2405	load_object_str (const char *obstr)
2406	{
2407	object *op;
2408	char filename[MAX_BUF];
2409
2410	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2411
2412	FILE *tempfile = fopen (filename, "w");
2413
2414	if (tempfile == NULL)
2415	{
2416	LOG (llevError, "Error - Unable to access load object temp file\n");
2417	return NULL;
2418	}
2419
2420	fprintf (tempfile, obstr);
2421	fclose (tempfile);
2422
2423	op = object::create ();
2424
2425	object_thawer thawer (filename);
2426
2427	if (thawer)
2428	load_object (thawer, op, 0);
2429
2430	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2431	CLEAR_FLAG (op, FLAG_REMOVED);
2432
2433	return op;
2434	}	2340	}
2435		2341
2436	/* This returns the first object in who's inventory that	2342	/* This returns the first object in who's inventory that
2437	* has the same type and subtype match.	2343	* has the same type and subtype match.
2438	* returns NULL if no match.	2344	* returns NULL if no match.
…		…
2493	if (link->key == canonical_key)	2399	if (link->key == canonical_key)
2494	return link->value;	2400	return link->value;
2495		2401
2496	return 0;	2402	return 0;
2497	}	2403	}
2498
2499		2404
2500	/*	2405	/*
2501	* Updates the canonical_key in op to value.	2406	* Updates the canonical_key in op to value.
2502	*	2407	*
2503	* 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).
…		…
2527	/* Basically, if the archetype has this key set,	2432	/* Basically, if the archetype has this key set,
2528	* we need to store the null value so when we save	2433	* we need to store the null value so when we save
2529	* it, we save the empty value so that when we load,	2434	* it, we save the empty value so that when we load,
2530	* we get this value back again.	2435	* we get this value back again.
2531	*/	2436	*/
2532	if (get_ob_key_link (&op->arch->clone, canonical_key))	2437	if (get_ob_key_link (op->arch, canonical_key))
2533	field->value = 0;	2438	field->value = 0;
2534	else	2439	else
2535	{	2440	{
2536	if (last)	2441	if (last)
2537	last->next = field->next;	2442	last->next = field->next;
…		…
2606	}	2511	}
2607	else	2512	else
2608	item = item->env;	2513	item = item->env;
2609	}	2514	}
2610		2515
2611
2612	const char *	2516	const char *
2613	object::flag_desc (char *desc, int len) const	2517	object::flag_desc (char *desc, int len) const
2614	{	2518	{
2615	char *p = desc;	2519	char *p = desc;
2616	bool first = true;	2520	bool first = true;
2617		2521
		2522	*p = 0;
		2523
2618	for (int i = 0; i < NUM_FLAGS; i++)	2524	for (int i = 0; i < NUM_FLAGS; i++)
2619	{	2525	{
2620	if (len <= 10) // magic constant!	2526	if (len <= 10) // magic constant!
2621	{	2527	{
2622	snprintf (p, len, ",...");	2528	snprintf (p, len, ",...");
2623	break;	2529	break;
2624	}	2530	}
2625		2531
2626	if (flag[i])	2532	if (flag [i])
2627	{	2533	{
2628	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);	2534	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
2629	len -= cnt;	2535	len -= cnt;
2630	p += cnt;	2536	p += cnt;
2631	first = false;	2537	first = false;
…		…
2633	}	2539	}
2634		2540
2635	return desc;	2541	return desc;
2636	}	2542	}
2637		2543
2638	// return a suitable string describing an objetc in enough detail to find it	2544	// return a suitable string describing an object in enough detail to find it
2639	const char *	2545	const char *
2640	object::debug_desc (char *info) const	2546	object::debug_desc (char *info) const
2641	{	2547	{
2642	char flagdesc[512];	2548	char flagdesc[512];
2643	char info2[256 * 4];	2549	char info2[256 * 4];
2644	char *p = info;	2550	char *p = info;
2645		2551
2646	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}",
2647	count, uuid.seq,	2553	count,
		2554	uuid.c_str (),
2648	&name,	2555	&name,
2649	title ? "\",title:" : "",	2556	title ? "\",title:\"" : "",
2650	title ? (const char *)title : "",	2557	title ? (const char *)title : "",
2651	flag_desc (flagdesc, 512), type);	2558	flag_desc (flagdesc, 512), type);
2652		2559
2653	if (env)	2560	if (!this->flag[FLAG_REMOVED] && env)
2654	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2561	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2655		2562
2656	if (map)	2563	if (map)
2657	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);
2658		2565
…		…
2660	}	2567	}
2661		2568
2662	const char *	2569	const char *
2663	object::debug_desc () const	2570	object::debug_desc () const
2664	{	2571	{
2665	static char info[256 * 3];	2572	static char info[3][256 * 4];
		2573	static int info_idx;
		2574
2666	return debug_desc (info);	2575	return debug_desc (info [++info_idx % 3]);
2667	}	2576	}
2668		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