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.74 by root, Wed Dec 20 09:14:21 2006 UTC vs.
Revision 1.207 by root, Sun Apr 20 23:25:09 2008 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3		3	*
		4	* Copyright (©) 2005,2006,2007 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.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
26	variable. */	26	variable. */
		27
27	#include <global.h>	28	#include <global.h>
28	#include <stdio.h>	29	#include <stdio.h>
29	#include <sys/types.h>	30	#include <sys/types.h>
30	#include <sys/uio.h>	31	#include <sys/uio.h>
31	#include <object.h>	32	#include <object.h>
32	#include <funcpoint.h>	33	#include <funcpoint.h>
		34	#include <sproto.h>
33	#include <loader.h>	35	#include <loader.h>
34		36
35	#include <bitset>	37	#include <bitset>
36		38
37	int nrofallocobjects = 0;	39	UUID UUID::cur;
38	static UUID uuid;	40	static uint64_t seq_next_save;
39	const uint64 UUID_SKIP = 1<<19;	41	static const uint64 UUID_GAP = 1<<19;
40		42
41	object *active_objects; /* List of active objects that need to be processed */	43	objectvec objects;
		44	activevec actives;
42		45
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,	46	short freearr_x[SIZEOFFREE] = {
		47	0,
		48	0, 1, 1, 1, 0, -1, -1, -1,
		49	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
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	50	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
45	};	51	};
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,	52	short freearr_y[SIZEOFFREE] = {
		53	0,
		54	-1, -1, 0, 1, 1, 1, 0, -1,
		55	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
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	56	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
48	};	57	};
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,	58	int maxfree[SIZEOFFREE] = {
		59	0,
		60	9, 10, 13, 14, 17, 18, 21, 22,
		61	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
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	62	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
51	};	63	};
52	int freedir[SIZEOFFREE] = {	64	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,	65	0,
		66	1, 2, 3, 4, 5, 6, 7, 8,
		67	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
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	68	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
55	};	69	};
56		70
57	static void	71	static void
58	write_uuid (void)	72	write_uuid (uval64 skip, bool sync)
59	{	73	{
60	char filename1[MAX_BUF], filename2[MAX_BUF];	74	CALL_BEGIN (2);
61		75	CALL_ARG_SV (newSVval64 (skip));
62	sprintf (filename1, "%s/uuid", settings.localdir);	76	CALL_ARG_SV (boolSV (sync));
63	sprintf (filename2, "%s/uuid~", settings.localdir);	77	CALL_CALL ("cf::write_uuid", G_DISCARD);
64		78	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	}	79	}
77		80
78	static void	81	static void
79	read_uuid (void)	82	read_uuid (void)
80	{	83	{
81	char filename[MAX_BUF];	84	char filename[MAX_BUF];
82		85
83	sprintf (filename, "%s/uuid", settings.localdir);	86	sprintf (filename, "%s/uuid", settings.localdir);
84		87
		88	seq_next_save = 0;
		89
85	FILE *fp;	90	FILE *fp;
86		91
87	if (!(fp = fopen (filename, "r")))	92	if (!(fp = fopen (filename, "r")))
88	{	93	{
89	if (errno == ENOENT)	94	if (errno == ENOENT)
90	{	95	{
91	LOG (llevInfo, "RESET uid to 1\n");	96	LOG (llevInfo, "RESET uid to 1\n");
92	uuid.seq = 0;	97	UUID::cur.seq = 0;
93	write_uuid ();	98	write_uuid (UUID_GAP, true);
94	return;	99	return;
95	}	100	}
96		101
97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	102	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
98	_exit (1);	103	_exit (1);
99	}	104	}
100		105
101	int version;	106	UUID::BUF buf;
102	unsigned long long uid;	107	buf[0] = 0;
103	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	108	fgets (buf, sizeof (buf), fp);
		109
		110	if (!UUID::cur.parse (buf))
104	{	111	{
105	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	112	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
106	_exit (1);	113	_exit (1);
107	}	114	}
108		115
109	uuid.seq = uid;	116	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
110	write_uuid ();	117
111	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	118	write_uuid (UUID_GAP, true);
112	fclose (fp);	119	fclose (fp);
113	}	120	}
114		121
115	UUID	122	UUID
116	gen_uuid ()	123	UUID::gen ()
117	{	124	{
118	UUID uid;	125	UUID uid;
119		126
120	uid.seq = ++uuid.seq;	127	uid.seq = ++cur.seq;
121		128
122	if (!(uuid.seq & (UUID_SKIP - 1)))	129	if (expect_false (cur.seq >= seq_next_save))
123	write_uuid ();	130	{
		131	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		132	write_uuid (UUID_GAP, false);
		133	}
		134
124		135
125	return uid;	136	return uid;
126	}	137	}
127		138
128	void	139	void
129	init_uuid ()	140	UUID::init ()
130	{	141	{
131	read_uuid ();	142	read_uuid ();
132	}	143	}
133		144
134	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	145	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
135	static int	146	static bool
136	compare_ob_value_lists_one (const object *wants, const object *has)	147	compare_ob_value_lists_one (const object *wants, const object *has)
137	{	148	{
138	key_value *wants_field;	149	key_value *wants_field;
139		150
140	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	151	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both
141	* objects with lists are rare, and lists stay short. If not, use a	152	* objects with lists are rare, and lists stay short. If not, use a
142	* different structure or at least keep the lists sorted...	153	* different structure or at least keep the lists sorted...
143	*/	154	*/
144		155
145	/* For each field in wants, */	156	/* For each field in wants, */
146	for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)	157	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)
147	{	158	{
148	key_value *has_field;	159	key_value *has_field;
149		160
150	/* Look for a field in has with the same key. */	161	/* Look for a field in has with the same key. */
151	has_field = get_ob_key_link (has, wants_field->key);	162	has_field = get_ob_key_link (has, wants_field->key);
152		163
153	if (has_field == NULL)	164	if (!has_field)
154	{
155	/* No field with that name. */	165	return 0; /* No field with that name. */
156	return FALSE;
157	}
158		166
159	/* Found the matching field. */	167	/* Found the matching field. */
160	if (has_field->value != wants_field->value)	168	if (has_field->value != wants_field->value)
161	{
162	/* Values don't match, so this half of the comparison is false. */	169	return 0; /* Values don't match, so this half of the comparison is false. */
163	return FALSE;
164	}
165		170
166	/* If we get here, we found a match. Now for the next field in wants. */	171	/* If we get here, we found a match. Now for the next field in wants. */
167	}	172	}
168		173
169	/* If we get here, every field in wants has a matching field in has. */	174	/* If we get here, every field in wants has a matching field in has. */
170	return TRUE;	175	return 1;
171	}	176	}
172		177
173	/* Returns TRUE if ob1 has the same key_values as ob2. */	178	/* Returns TRUE if ob1 has the same key_values as ob2. */
174	static int	179	static bool
175	compare_ob_value_lists (const object *ob1, const object *ob2)	180	compare_ob_value_lists (const object *ob1, const object *ob2)
176	{	181	{
177	/* However, there may be fields in has which aren't partnered in wants,	182	/* However, there may be fields in has which aren't partnered in wants,
178	* so we need to run the comparison *twice*. :(	183	* so we need to run the comparison *twice*. :(
179	*/	184	*/
…		…
190	* Check nrof variable *before* calling can_merge()	195	* Check nrof variable *before* calling can_merge()
191	*	196	*
192	* Improvements made with merge: Better checking on potion, and also	197	* Improvements made with merge: Better checking on potion, and also
193	* check weight	198	* check weight
194	*/	199	*/
195
196	bool object::can_merge_slow (object *ob1, object *ob2)	200	bool object::can_merge_slow (object *ob1, object *ob2)
197	{	201	{
198	/* A couple quicksanity checks */	202	/* A couple quicksanity checks */
199	if (ob1 == ob2	203	if (ob1 == ob2
200	|| ob1->type != ob2->type	204	|| ob1->type != ob2->type
201	|| ob1->speed != ob2->speed	205	|| ob1->speed != ob2->speed
202	|| ob1->value != ob2->value	206	|| ob1->value != ob2->value
203	|| ob1->name != ob2->name)	207	|| ob1->name != ob2->name)
204	return 0;	208	return 0;
205		209
206	//TODO: this ain't working well, use nicer and correct overflow check	210	/* Do not merge objects if nrof would overflow. First part checks
207	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	211	* for unsigned overflow (2c), second part checks wether the result
208	* value could not be stored in a sint32 (which unfortunately sometimes is	212	* would fit into a 32 bit signed int, which is often used to hold
209	* used to store nrof).	213	* nrof values.
210	*/	214	*/
211	if (ob1->nrof + ob2->nrof >= 1UL << 31)	215	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
212	return 0;	216	return 0;
213		217
214	/* If the objects have been identified, set the BEEN_APPLIED flag.	218	/* If the objects have been identified, set the BEEN_APPLIED flag.
215	* This is to the comparison of the flags below will be OK. We	219	* This is to the comparison of the flags below will be OK. We
216	* just can't ignore the been applied or identified flags, as they	220	* just can't ignore the been applied or identified flags, as they
217	* are not equal - just if it has been identified, the been_applied	221	* are not equal - just if it has been identified, the been_applied
218	* flags lose any meaning.	222	* flags lose any meaning.
219	*/	223	*/
220	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	224	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	225	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
222		226
223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	227	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	228	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
225		229
226	if ((ob1->flags ^ ob2->flags).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	230	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
227	|| ob1->arch != ob2->arch	231	|| ob1->arch != ob2->arch
228	|| ob1->name != ob2->name	232	|| ob1->name != ob2->name
229	|| ob1->title != ob2->title	233	|| ob1->title != ob2->title
230	|| ob1->msg != ob2->msg	234	|| ob1->msg != ob2->msg
231	|| ob1->weight != ob2->weight	235	|| ob1->weight != ob2->weight
…		…
248	|| ob1->move_off != ob2->move_off	252	|| ob1->move_off != ob2->move_off
249	|| ob1->move_slow != ob2->move_slow	253	|| ob1->move_slow != ob2->move_slow
250	|| ob1->move_slow_penalty != ob2->move_slow_penalty)	254	|| ob1->move_slow_penalty != ob2->move_slow_penalty)
251	return 0;	255	return 0;
252		256
253	/* This is really a spellbook check - really, we should	257	/* This is really a spellbook check - we should in general
254	* check all objects in the inventory.	258	* not merge objects with real inventories, as splitting them
		259	* is hard.
255	*/	260	*/
256	if (ob1->inv || ob2->inv)	261	if (ob1->inv || ob2->inv)
257	{	262	{
258	/* if one object has inventory but the other doesn't, not equiv */	263	if (!(ob1->inv && ob2->inv))
259	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	264	return 0; /* inventories differ in length */
260	return 0;
261		265
262	/* Now check to see if the two inventory objects could merge */	266	if (ob1->inv->below || ob2->inv->below)
		267	return 0; /* more than one object in inv */
		268
263	if (!object::can_merge (ob1->inv, ob2->inv))	269	if (!object::can_merge (ob1->inv, ob2->inv))
264	return 0;	270	return 0; /* inventory objects differ */
265		271
266	/* inventory ok - still need to check rest of this object to see	272	/* inventory ok - still need to check rest of this object to see
267	* if it is valid.	273	* if it is valid.
268	*/	274	*/
269	}	275	}
…		…
277		283
278	/* Note sure why the following is the case - either the object has to	284	/* Note sure why the following is the case - either the object has to
279	* be animated or have a very low speed. Is this an attempted monster	285	* be animated or have a very low speed. Is this an attempted monster
280	* check?	286	* check?
281	*/	287	*/
282	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	288	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
283	return 0;	289	return 0;
284		290
285	switch (ob1->type)	291	switch (ob1->type)
286	{	292	{
287	case SCROLL:	293	case SCROLL:
288	if (ob1->level != ob2->level)	294	if (ob1->level != ob2->level)
289	return 0;	295	return 0;
290	break;	296	break;
291	}	297	}
292		298
293	if (ob1->key_values != NULL || ob2->key_values != NULL)	299	if (ob1->key_values || ob2->key_values)
294	{	300	{
295	/* At least one of these has key_values. */	301	/* At least one of these has key_values. */
296	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	302	if ((!ob1->key_values) != (!ob2->key_values))
297	/* One has fields, but the other one doesn't. */	303	/* One has fields, but the other one doesn't. */
298	return 0;	304	return 0;
299	else if (!compare_ob_value_lists (ob1, ob2))	305	else if (!compare_ob_value_lists (ob1, ob2))
300	return 0;	306	return 0;
301	}	307	}
302		308
303	//TODO: generate an event or call into perl for additional checks
304	if (ob1->self || ob2->self)	309	if (ob1->self || ob2->self)
305	{	310	{
306	ob1->optimise ();	311	ob1->optimise ();
307	ob2->optimise ();	312	ob2->optimise ();
308		313
309	if (ob1->self || ob2->self)	314	if (ob1->self || ob2->self)
		315	{
		316	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		317	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		318
		319	if (k1 != k2)
310	return 0;	320	return 0;
		321	else if (k1 == 0)
		322	return 1;
		323	else if (!cfperl_can_merge (ob1, ob2))
		324	return 0;
		325	}
311	}	326	}
312		327
313	/* Everything passes, must be OK. */	328	/* Everything passes, must be OK. */
314	return 1;	329	return 1;
315	}	330	}
316		331
		332	static sint32
		333	weight_adjust (object *op, sint32 weight)
		334	{
		335	return op->type == CONTAINER
		336	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		337	: weight;
		338	}
		339
317	/*	340	/*
		341	* add_weight(object, weight) adds the specified weight to an object,
		342	* and also updates how much the environment(s) is/are carrying.
		343	*/
		344	static void
		345	add_weight (object *op, sint32 weight)
		346	{
		347	while (op)
		348	{
		349	weight = weight_adjust (op, weight);
		350
		351	op->carrying += weight;
		352	op = op->env;
		353	}
		354	}
		355
		356	/*
		357	* sub_weight() recursively (outwards) subtracts a number from the
		358	* weight of an object (and what is carried by it's environment(s)).
		359	*/
		360	static void
		361	sub_weight (object *op, long weight)
		362	{
		363	add_weight (op, -weight);
		364	}
		365
		366	/*
318	* sum_weight() is a recursive function which calculates the weight	367	* this is a recursive function which calculates the weight
319	* an object is carrying. It goes through in figures out how much	368	* an object is carrying. It goes through op and figures out how much
320	* containers are carrying, and sums it up.	369	* containers are carrying, and sums it up.
321	*/	370	*/
322	long	371	void
323	sum_weight (object *op)	372	object::update_weight ()
324	{	373	{
325	long sum;	374	sint32 sum = 0;
326	object *inv;
327		375
328	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	376	for (object *op = inv; op; op = op->below)
329	{	377	{
330	if (inv->inv)	378	if (op->inv)
331	sum_weight (inv);	379	op->update_weight ();
332	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
333	}
334		380
335	if (op->type == CONTAINER && op->stats.Str)	381	sum += op->total_weight ();
336	sum = (sum * (100 - op->stats.Str)) / 100;	382	}
337		383
338	if (op->carrying != sum)	384	carrying = weight_adjust (this, sum);
339	op->carrying = sum;
340
341	return sum;
342	}
343
344	/**
345	* Return the outermost environment object for a given object.
346	*/
347
348	object *
349	object_get_env_recursive (object *op)
350	{
351	while (op->env != NULL)
352	op = op->env;
353	return op;
354	}	385	}
355		386
356	/*	387	/*
357	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	388	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
358	* Some error messages.	389	* Some error messages.
359	* The result of the dump is stored in the static global errmsg array.	390	* The result of the dump is stored in the static global errmsg array.
360	*/	391	*/
361
362	char *	392	char *
363	dump_object (object *op)	393	dump_object (object *op)
364	{	394	{
365	if (!op)	395	if (!op)
366	return strdup ("[NULLOBJ]");	396	return strdup ("[NULLOBJ]");
367		397
368	object_freezer freezer;	398	object_freezer freezer;
369	save_object (freezer, op, 3);	399	op->write (freezer);
370	return freezer.as_string ();	400	return freezer.as_string ();
371	}	401	}
372		402
373	/*	403	/*
374	* get_nearest_part(multi-object, object 2) returns the part of the	404	* get_nearest_part(multi-object, object 2) returns the part of the
375	* multi-object 1 which is closest to the second object.	405	* multi-object 1 which is closest to the second object.
376	* If it's not a multi-object, it is returned.	406	* If it's not a multi-object, it is returned.
377	*/	407	*/
378
379	object *	408	object *
380	get_nearest_part (object *op, const object *pl)	409	get_nearest_part (object *op, const object *pl)
381	{	410	{
382	object *tmp, *closest;	411	object *tmp, *closest;
383	int last_dist, i;	412	int last_dist, i;
…		…
391	}	420	}
392		421
393	/*	422	/*
394	* Returns the object which has the count-variable equal to the argument.	423	* Returns the object which has the count-variable equal to the argument.
395	*/	424	*/
396
397	object *	425	object *
398	find_object (tag_t i)	426	find_object (tag_t i)
399	{	427	{
400	for (object *op = object::first; op; op = op->next)	428	for_all_objects (op)
401	if (op->count == i)	429	if (op->count == i)
402	return op;	430	return op;
403		431
404	return 0;	432	return 0;
405	}	433	}
406		434
407	/*	435	/*
408	* Returns the first object which has a name equal to the argument.	436	* Returns the first object which has a name equal to the argument.
409	* Used only by the patch command, but not all that useful.	437	* Used only by the patch command, but not all that useful.
410	* Enables features like "patch <name-of-other-player> food 999"	438	* Enables features like "patch <name-of-other-player> food 999"
411	*/	439	*/
412
413	object *	440	object *
414	find_object_name (const char *str)	441	find_object_name (const char *str)
415	{	442	{
416	shstr_cmp str_ (str);	443	shstr_cmp str_ (str);
417	object *op;	444	object *op;
418		445
419	for (op = object::first; op != NULL; op = op->next)	446	for_all_objects (op)
420	if (op->name == str_)	447	if (op->name == str_)
421	break;	448	break;
422		449
423	return op;	450	return op;
424	}	451	}
425		452
426	void
427	free_all_object_data ()
428	{
429	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
430	}
431
432	/*	453	/*
433	* Sets the owner and sets the skill and exp pointers to owner's current	454	* Sets the owner and sets the skill and exp pointers to owner's current
434	* skill and experience objects.	455	* skill and experience objects.
		456	* ACTUALLY NO! investigate! TODO
435	*/	457	*/
436	void	458	void
437	object::set_owner (object *owner)	459	object::set_owner (object *owner)
438	{	460	{
		461	// allow objects which own objects
439	if (!owner)	462	if (owner)
440	return;
441
442	/* next line added to allow objects which own objects */
443	/* Add a check for ownercounts in here, as I got into an endless loop
444	* with the fireball owning a poison cloud which then owned the
445	* fireball. I believe that was caused by one of the objects getting
446	* freed and then another object replacing it. Since the ownercounts
447	* didn't match, this check is valid and I believe that cause is valid.
448	*/
449	while (owner->owner)	463	while (owner->owner)
450	owner = owner->owner;	464	owner = owner->owner;
		465
		466	if (flag [FLAG_FREED])
		467	{
		468	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		469	return;
		470	}
451		471
452	this->owner = owner;	472	this->owner = owner;
		473	}
		474
		475	int
		476	object::slottype () const
		477	{
		478	if (type == SKILL)
		479	{
		480	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		481	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		482	}
		483	else
		484	{
		485	if (slot [body_combat].info) return slot_combat;
		486	if (slot [body_range ].info) return slot_ranged;
		487	}
		488
		489	return slot_none;
		490	}
		491
		492	bool
		493	object::change_weapon (object *ob)
		494	{
		495	if (current_weapon == ob)
		496	return true;
		497
		498	if (chosen_skill)
		499	chosen_skill->flag [FLAG_APPLIED] = false;
		500
		501	current_weapon = ob;
		502	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		503
		504	if (chosen_skill)
		505	chosen_skill->flag [FLAG_APPLIED] = true;
		506
		507	update_stats ();
		508
		509	if (ob)
		510	{
		511	// now check wether any body locations became invalid, in which case
		512	// we cannot apply the weapon at the moment.
		513	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		514	if (slot[i].used < 0)
		515	{
		516	current_weapon = chosen_skill = 0;
		517	update_stats ();
		518
		519	new_draw_info_format (NDI_UNIQUE, 0, this,
		520	"You try to balance all your items at once, "
		521	"but the %s is just too much for your body. "
		522	"[You need to unapply some items first.]", &ob->name);
		523	return false;
		524	}
		525
		526	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		527	}
		528	else
		529	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		530
		531	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		532	{
		533	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		534	&name, ob->debug_desc ());
		535	return false;
		536	}
		537
		538	return true;
453	}	539	}
454		540
455	/* Zero the key_values on op, decrementing the shared-string	541	/* Zero the key_values on op, decrementing the shared-string
456	* refcounts and freeing the links.	542	* refcounts and freeing the links.
457	*/	543	*/
458	static void	544	static void
459	free_key_values (object *op)	545	free_key_values (object *op)
460	{	546	{
461	for (key_value *i = op->key_values; i != 0;)	547	for (key_value *i = op->key_values; i; )
462	{	548	{
463	key_value *next = i->next;	549	key_value *next = i->next;
464	delete i;	550	delete i;
465		551
466	i = next;	552	i = next;
467	}	553	}
468		554
469	op->key_values = 0;	555	op->key_values = 0;
470	}	556	}
471		557
472	void object::clear ()	558	object &
		559	object::operator =(const object &src)
473	{	560	{
474	attachable_base::clear ();	561	bool is_freed = flag [FLAG_FREED];
		562	bool is_removed = flag [FLAG_REMOVED];
475		563
476	free_key_values (this);
477
478	owner = 0;
479	name = 0;
480	name_pl = 0;
481	title = 0;
482	race = 0;
483	slaying = 0;
484	skill = 0;
485	msg = 0;
486	lore = 0;
487	custom_name = 0;
488	materialname = 0;
489	contr = 0;
490	below = 0;
491	above = 0;
492	inv = 0;
493	container = 0;
494	env = 0;
495	more = 0;
496	head = 0;
497	map = 0;
498	active_next = 0;
499	active_prev = 0;
500
501	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
502
503	SET_FLAG (this, FLAG_REMOVED);
504
505	/* What is not cleared is next, prev, and count */
506
507	expmul = 1.0;
508	face = blank_face;
509
510	if (settings.casting_time)
511	casting_time = -1;
512	}
513
514	/*
515	* copy_to first frees everything allocated by the dst object,
516	* and then copies the contents of itself into the second
517	* object, allocating what needs to be allocated. Basically, any
518	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
519	* if the first object is freed, the pointers in the new object
520	* will point at garbage.
521	*/
522	void
523	object::copy_to (object *dst)
524	{
525	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
526	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
527
528	*(object_copy *)dst = *this;	564	*(object_copy *)this = src;
529	*(object_pod *)dst = *this;
530		565
531	if (self || cb)	566	flag [FLAG_FREED] = is_freed;
532	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst));	567	flag [FLAG_REMOVED] = is_removed;
533
534	if (is_freed)
535	SET_FLAG (dst, FLAG_FREED);
536
537	if (is_removed)
538	SET_FLAG (dst, FLAG_REMOVED);
539
540	if (speed < 0)
541	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
542		568
543	/* Copy over key_values, if any. */	569	/* Copy over key_values, if any. */
544	if (key_values)	570	if (src.key_values)
545	{	571	{
546	key_value *tail = 0;	572	key_value *tail = 0;
547	key_value *i;
548
549	dst->key_values = 0;	573	key_values = 0;
550		574
551	for (i = key_values; i; i = i->next)	575	for (key_value *i = src.key_values; i; i = i->next)
552	{	576	{
553	key_value *new_link = new key_value;	577	key_value *new_link = new key_value;
554		578
555	new_link->next = 0;	579	new_link->next = 0;
556	new_link->key = i->key;	580	new_link->key = i->key;
557	new_link->value = i->value;	581	new_link->value = i->value;
558		582
559	/* Try and be clever here, too. */	583	/* Try and be clever here, too. */
560	if (!dst->key_values)	584	if (!key_values)
561	{	585	{
562	dst->key_values = new_link;	586	key_values = new_link;
563	tail = new_link;	587	tail = new_link;
564	}	588	}
565	else	589	else
566	{	590	{
567	tail->next = new_link;	591	tail->next = new_link;
568	tail = new_link;	592	tail = new_link;
569	}	593	}
570	}	594	}
571	}	595	}
		596	}
572		597
573	update_ob_speed (dst);	598	/*
		599	* copy_to first frees everything allocated by the dst object,
		600	* and then copies the contents of itself into the second
		601	* object, allocating what needs to be allocated. Basically, any
		602	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		603	* if the first object is freed, the pointers in the new object
		604	* will point at garbage.
		605	*/
		606	void
		607	object::copy_to (object *dst)
		608	{
		609	*dst = *this;
		610
		611	if (speed < 0)
		612	dst->speed_left -= rndm ();
		613
		614	dst->set_speed (dst->speed);
		615	}
		616
		617	void
		618	object::instantiate ()
		619	{
		620	if (!uuid.seq) // HACK
		621	uuid = UUID::gen ();
		622
		623	speed_left = -0.1f;
		624	/* copy the body_info to the body_used - this is only really
		625	* need for monsters, but doesn't hurt to do it for everything.
		626	* by doing so, when a monster is created, it has good starting
		627	* values for the body_used info, so when items are created
		628	* for it, they can be properly equipped.
		629	*/
		630	for (int i = NUM_BODY_LOCATIONS; i--; )
		631	slot[i].used = slot[i].info;
		632
		633	attachable::instantiate ();
574	}	634	}
575		635
576	object *	636	object *
577	object::clone ()	637	object::clone ()
578	{	638	{
…		…
584	/*	644	/*
585	* If an object with the IS_TURNABLE() flag needs to be turned due	645	* If an object with the IS_TURNABLE() flag needs to be turned due
586	* to the closest player being on the other side, this function can	646	* to the closest player being on the other side, this function can
587	* be called to update the face variable, _and_ how it looks on the map.	647	* be called to update the face variable, _and_ how it looks on the map.
588	*/	648	*/
589
590	void	649	void
591	update_turn_face (object *op)	650	update_turn_face (object *op)
592	{	651	{
593	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	652	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
594	return;	653	return;
		654
595	SET_ANIMATION (op, op->direction);	655	SET_ANIMATION (op, op->direction);
596	update_object (op, UP_OBJ_FACE);	656	update_object (op, UP_OBJ_FACE);
597	}	657	}
598		658
599	/*	659	/*
600	* Updates the speed of an object. If the speed changes from 0 to another	660	* Updates the speed of an object. If the speed changes from 0 to another
601	* value, or vice versa, then add/remove the object from the active list.	661	* value, or vice versa, then add/remove the object from the active list.
602	* This function needs to be called whenever the speed of an object changes.	662	* This function needs to be called whenever the speed of an object changes.
603	*/	663	*/
604	void	664	void
605	update_ob_speed (object *op)	665	object::set_speed (float speed)
606	{	666	{
607	extern int arch_init;	667	if (flag [FLAG_FREED] && speed)
608
609	/* No reason putting the archetypes objects on the speed list,
610	* since they never really need to be updated.
611	*/
612
613	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
614	{	668	{
615	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	669	LOG (llevError, "Object %s is freed but has speed.\n", &name);
616	#ifdef MANY_CORES
617	abort ();
618	#else
619	op->speed = 0;	670	speed = 0;
620	#endif
621	}
622
623	if (arch_init)
624	return;
625
626	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
627	{	671	}
628	/* If already on active list, don't do anything */
629	if (op->active_next || op->active_prev || op == active_objects)
630	return;
631		672
632	/* process_events() expects us to insert the object at the beginning	673	this->speed = speed;
633	* of the list. */
634	op->active_next = active_objects;
635		674
636	if (op->active_next != NULL)	675	if (has_active_speed ())
637	op->active_next->active_prev = op;	676	activate ();
638
639	active_objects = op;
640	}
641	else	677	else
642	{	678	deactivate ();
643	/* If not on the active list, nothing needs to be done */
644	if (!op->active_next && !op->active_prev && op != active_objects)
645	return;
646
647	if (op->active_prev == NULL)
648	{
649	active_objects = op->active_next;
650
651	if (op->active_next != NULL)
652	op->active_next->active_prev = NULL;
653	}
654	else
655	{
656	op->active_prev->active_next = op->active_next;
657
658	if (op->active_next)
659	op->active_next->active_prev = op->active_prev;
660	}
661
662	op->active_next = NULL;
663	op->active_prev = NULL;
664	}
665	}	679	}
666		680
667	/* This function removes object 'op' from the list of active
668	* objects.
669	* This should only be used for style maps or other such
670	* reference maps where you don't want an object that isn't
671	* in play chewing up cpu time getting processed.
672	* The reverse of this is to call update_ob_speed, which
673	* will do the right thing based on the speed of the object.
674	*/
675	void
676	remove_from_active_list (object *op)
677	{
678	/* If not on the active list, nothing needs to be done */
679	if (!op->active_next && !op->active_prev && op != active_objects)
680	return;
681
682	if (op->active_prev == NULL)
683	{
684	active_objects = op->active_next;
685	if (op->active_next != NULL)
686	op->active_next->active_prev = NULL;
687	}
688	else
689	{
690	op->active_prev->active_next = op->active_next;
691	if (op->active_next)
692	op->active_next->active_prev = op->active_prev;
693	}
694	op->active_next = NULL;
695	op->active_prev = NULL;
696	}
697
698	/*	681	/*
699	* update_object() updates the array which represents the map.	682	* update_object() updates the the map.
700	* It takes into account invisible objects (and represent squares covered	683	* It takes into account invisible objects (and represent squares covered
701	* by invisible objects by whatever is below them (unless it's another	684	* by invisible objects by whatever is below them (unless it's another
702	* invisible object, etc...)	685	* invisible object, etc...)
703	* If the object being updated is beneath a player, the look-window	686	* If the object being updated is beneath a player, the look-window
704	* of that player is updated (this might be a suboptimal way of	687	* of that player is updated (this might be a suboptimal way of
705	* updating that window, though, since update_object() is called _often_)	688	* updating that window, though, since update_object() is called _often_)
706	*	689	*
707	* action is a hint of what the caller believes need to be done.	690	* action is a hint of what the caller believes need to be done.
708	* For example, if the only thing that has changed is the face (due to
709	* an animation), we don't need to call update_position until that actually
710	* comes into view of a player. OTOH, many other things, like addition/removal
711	* of walls or living creatures may need us to update the flags now.
712	* current action are:	691	* current action are:
713	* UP_OBJ_INSERT: op was inserted	692	* UP_OBJ_INSERT: op was inserted
714	* UP_OBJ_REMOVE: op was removed	693	* UP_OBJ_REMOVE: op was removed
715	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update	694	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
716	* as that is easier than trying to look at what may have changed.	695	* as that is easier than trying to look at what may have changed.
717	* UP_OBJ_FACE: only the objects face has changed.	696	* UP_OBJ_FACE: only the objects face has changed.
718	*/	697	*/
719
720	void	698	void
721	update_object (object *op, int action)	699	update_object (object *op, int action)
722	{	700	{
723	int update_now = 0, flags;
724	MoveType move_on, move_off, move_block, move_slow;
725
726	if (op == NULL)	701	if (op == NULL)
727	{	702	{
728	/* this should never happen */	703	/* this should never happen */
729	LOG (llevDebug, "update_object() called for NULL object.\n");	704	LOG (llevDebug, "update_object() called for NULL object.\n");
730	return;	705	return;
731	}	706	}
732		707
733	if (op->env != NULL)	708	if (op->env)
734	{	709	{
735	/* Animation is currently handled by client, so nothing	710	/* Animation is currently handled by client, so nothing
736	* to do in this case.	711	* to do in this case.
737	*/	712	*/
738	return;	713	return;
…		…
743	*/	718	*/
744	if (!op->map || op->map->in_memory == MAP_SAVING)	719	if (!op->map || op->map->in_memory == MAP_SAVING)
745	return;	720	return;
746		721
747	/* make sure the object is within map boundaries */	722	/* make sure the object is within map boundaries */
748	if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))	723	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
749	{	724	{
750	LOG (llevError, "update_object() called for object out of map!\n");	725	LOG (llevError, "update_object() called for object out of map!\n");
751	#ifdef MANY_CORES	726	#ifdef MANY_CORES
752	abort ();	727	abort ();
753	#endif	728	#endif
754	return;	729	return;
755	}	730	}
756		731
757	flags = GET_MAP_FLAGS (op->map, op->x, op->y);	732	mapspace &m = op->ms ();
758	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
759	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
760	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
761	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
762	move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
763		733
		734	if (!(m.flags_ & P_UPTODATE))
		735	/* nop */;
764	if (action == UP_OBJ_INSERT)	736	else if (action == UP_OBJ_INSERT)
765	{	737	{
		738	// this is likely overkill, TODO: revisit (schmorp)
766	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))	739	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
767	update_now = 1;
768
769	if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))	740	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
770	update_now = 1;	741	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))
771		742	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
		743	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
772	if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))	744	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
773	update_now = 1;
774
775	if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
776	update_now = 1;
777
778	if (op->type == SAFE_GROUND && !(flags & P_SAFE))
779	update_now = 1;
780
781	if ((move_on | op->move_on) != move_on)	745	|| (m.move_on | op->move_on ) != m.move_on
782	update_now = 1;
783
784	if ((move_off | op->move_off) != move_off)	746	|| (m.move_off | op->move_off ) != m.move_off
785	update_now = 1;	747	|| (m.move_slow | op->move_slow) != m.move_slow
786
787	/* This isn't perfect, but I don't expect a lot of objects to	748	/* This isn't perfect, but I don't expect a lot of objects to
788	* to have move_allow right now.	749	* to have move_allow right now.
789	*/	750	*/
790	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	751	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
791	update_now = 1;	752	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
792		753	m.flags_ = 0;
793	if ((move_slow | op->move_slow) != move_slow)
794	update_now = 1;
795	}	754	}
796
797	/* if the object is being removed, we can't make intelligent	755	/* if the object is being removed, we can't make intelligent
798	* decisions, because remove_ob can't really pass the object	756	* decisions, because remove_ob can't really pass the object
799	* that is being removed.	757	* that is being removed.
800	*/	758	*/
801	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	759	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
802	update_now = 1;	760	m.flags_ = 0;
803	else if (action == UP_OBJ_FACE)	761	else if (action == UP_OBJ_FACE)
804	/* Nothing to do for that case */ ;	762	/* Nothing to do for that case */ ;
805	else	763	else
806	LOG (llevError, "update_object called with invalid action: %d\n", action);	764	LOG (llevError, "update_object called with invalid action: %d\n", action);
807		765
808	if (update_now)
809	{
810	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
811	update_position (op->map, op->x, op->y);
812	}
813
814	if (op->more != NULL)	766	if (op->more)
815	update_object (op->more, action);	767	update_object (op->more, action);
816	}
817
818	object::vector object::mortals;
819	object::vector object::objects; // not yet used
820	object *object::first;
821
822	void object::free_mortals ()
823	{
824	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
825	if ((*i)->refcnt)
826	++i; // further delay freeing
827	else
828	{
829	delete *i;
830	mortals.erase (i);
831	}
832	}	768	}
833		769
834	object::object ()	770	object::object ()
835	{	771	{
836	SET_FLAG (this, FLAG_REMOVED);	772	SET_FLAG (this, FLAG_REMOVED);
…		…
839	face = blank_face;	775	face = blank_face;
840	}	776	}
841		777
842	object::~object ()	778	object::~object ()
843	{	779	{
		780	unlink ();
		781
844	free_key_values (this);	782	free_key_values (this);
845	}	783	}
846		784
		785	static int object_count;
		786
847	void object::link ()	787	void object::link ()
848	{	788	{
		789	assert (!index);//D
		790	uuid = UUID::gen ();
849	count = ++ob_count;	791	count = ++object_count;
850	uuid = gen_uuid ();
851		792
852	prev = 0;	793	refcnt_inc ();
853	next = object::first;	794	objects.insert (this);
854
855	if (object::first)
856	object::first->prev = this;
857
858	object::first = this;
859	}	795	}
860		796
861	void object::unlink ()	797	void object::unlink ()
862	{	798	{
863	if (this == object::first)	799	if (!index)
864	object::first = next;	800	return;
865		801
866	/* Remove this object from the list of used objects */	802	objects.erase (this);
867	if (prev) prev->next = next;	803	refcnt_dec ();
868	if (next) next->prev = prev;	804	}
869		805
870	prev = 0;	806	void
871	next = 0;	807	object::activate ()
		808	{
		809	/* If already on active list, don't do anything */
		810	if (active)
		811	return;
		812
		813	if (has_active_speed ())
		814	actives.insert (this);
		815	}
		816
		817	void
		818	object::activate_recursive ()
		819	{
		820	activate ();
		821
		822	for (object *op = inv; op; op = op->below)
		823	op->activate_recursive ();
		824	}
		825
		826	/* This function removes object 'op' from the list of active
		827	* objects.
		828	* This should only be used for style maps or other such
		829	* reference maps where you don't want an object that isn't
		830	* in play chewing up cpu time getting processed.
		831	* The reverse of this is to call update_ob_speed, which
		832	* will do the right thing based on the speed of the object.
		833	*/
		834	void
		835	object::deactivate ()
		836	{
		837	/* If not on the active list, nothing needs to be done */
		838	if (!active)
		839	return;
		840
		841	actives.erase (this);
		842	}
		843
		844	void
		845	object::deactivate_recursive ()
		846	{
		847	for (object *op = inv; op; op = op->below)
		848	op->deactivate_recursive ();
		849
		850	deactivate ();
		851	}
		852
		853	void
		854	object::set_flag_inv (int flag, int value)
		855	{
		856	for (object *op = inv; op; op = op->below)
		857	{
		858	op->flag [flag] = value;
		859	op->set_flag_inv (flag, value);
		860	}
		861	}
		862
		863	/*
		864	* Remove and free all objects in the inventory of the given object.
		865	* object.c ?
		866	*/
		867	void
		868	object::destroy_inv (bool drop_to_ground)
		869	{
		870	// need to check first, because the checks below might segfault
		871	// as we might be on an invalid mapspace and crossfire code
		872	// is too buggy to ensure that the inventory is empty.
		873	// corollary: if you create arrows etc. with stuff in tis inventory,
		874	// cf will crash below with off-map x and y
		875	if (!inv)
		876	return;
		877
		878	/* Only if the space blocks everything do we not process -
		879	* if some form of movement is allowed, let objects
		880	* drop on that space.
		881	*/
		882	if (!drop_to_ground
		883	|| !map
		884	|| map->in_memory != MAP_ACTIVE
		885	|| map->nodrop
		886	|| ms ().move_block == MOVE_ALL)
		887	{
		888	while (inv)
		889	{
		890	inv->destroy_inv (drop_to_ground);
		891	inv->destroy ();
		892	}
		893	}
		894	else
		895	{ /* Put objects in inventory onto this space */
		896	while (inv)
		897	{
		898	object *op = inv;
		899
		900	if (op->flag [FLAG_STARTEQUIP]
		901	|| op->flag [FLAG_NO_DROP]
		902	|| op->type == RUNE
		903	|| op->type == TRAP
		904	|| op->flag [FLAG_IS_A_TEMPLATE]
		905	|| op->flag [FLAG_DESTROY_ON_DEATH])
		906	op->destroy ();
		907	else
		908	map->insert (op, x, y);
		909	}
		910	}
872	}	911	}
873		912
874	object *object::create ()	913	object *object::create ()
875	{	914	{
876	object *op = new object;	915	object *op = new object;
877	op->link ();	916	op->link ();
878	return op;	917	return op;
879	}	918	}
880		919
881	/*	920	void
882	* free_object() frees everything allocated by an object, removes	921	object::do_destroy ()
883	* it from the list of used objects, and puts it on the list of
884	* free objects. The IS_FREED() flag is set in the object.
885	* The object must have been removed by remove_ob() first for
886	* this function to succeed.
887	*
888	* If destroy_inventory is set, free inventory as well. Else drop items in
889	* inventory to the ground.
890	*/
891	void object::destroy (bool destroy_inventory)
892	{	922	{
893	if (QUERY_FLAG (this, FLAG_FREED))	923	attachable::do_destroy ();
894	return;
895		924
896	if (QUERY_FLAG (this, FLAG_FRIENDLY))	925	if (flag [FLAG_IS_LINKED])
		926	remove_button_link (this);
		927
		928	if (flag [FLAG_FRIENDLY])
897	remove_friendly_object (this);	929	remove_friendly_object (this);
898		930
899	if (!QUERY_FLAG (this, FLAG_REMOVED))	931	if (!flag [FLAG_REMOVED])
900	remove ();	932	remove ();
901		933
902	SET_FLAG (this, FLAG_FREED);	934	destroy_inv (true);
903		935
904	if (more)	936	deactivate ();
905	{	937	unlink ();
906	more->destroy (destroy_inventory);
907	more = 0;
908	}
909		938
910	if (inv)	939	flag [FLAG_FREED] = 1;
911	{
912	/* Only if the space blocks everything do we not process -
913	* if some form of movement is allowed, let objects
914	* drop on that space.
915	*/
916	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
917	{
918	object *op = inv;
919
920	while (op)
921	{
922	object *tmp = op->below;
923	op->destroy (destroy_inventory);
924	op = tmp;
925	}
926	}
927	else
928	{ /* Put objects in inventory onto this space */
929	object *op = inv;
930
931	while (op)
932	{
933	object *tmp = op->below;
934
935	op->remove ();
936
937	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
938	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
939	op->destroy ();
940	else
941	{
942	op->x = x;
943	op->y = y;
944	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
945	}
946
947	op = tmp;
948	}
949	}
950	}
951		940
952	// hack to ensure that freed objects still have a valid map	941	// hack to ensure that freed objects still have a valid map
953	{	942	{
954	static maptile *freed_map; // freed objects are moved here to avoid crashes	943	static maptile *freed_map; // freed objects are moved here to avoid crashes
955		944
956	if (!freed_map)	945	if (!freed_map)
957	{	946	{
958	freed_map = new maptile;	947	freed_map = new maptile;
959		948
		949	freed_map->path = "<freed objects map>";
960	freed_map->name = "/internal/freed_objects_map";	950	freed_map->name = "/internal/freed_objects_map";
961	freed_map->width = 3;	951	freed_map->width = 3;
962	freed_map->height = 3;	952	freed_map->height = 3;
		953	freed_map->nodrop = 1;
963		954
964	freed_map->allocate ();	955	freed_map->alloc ();
		956	freed_map->in_memory = MAP_ACTIVE;
965	}	957	}
966		958
967	map = freed_map;	959	map = freed_map;
968	x = 1;	960	x = 1;
969	y = 1;	961	y = 1;
970	}	962	}
971		963
		964	if (more)
		965	{
		966	more->destroy ();
		967	more = 0;
		968	}
		969
		970	head = 0;
		971
972	// clear those pointers that likely might have circular references to us	972	// clear those pointers that likely might cause circular references
973	owner = 0;	973	owner = 0;
974	enemy = 0;	974	enemy = 0;
975	attacked_by = 0;	975	attacked_by = 0;
976		976	current_weapon = 0;
977	// only relevant for players(?), but make sure of it anyways
978	contr = 0;
979
980	/* Remove object from the active list */
981	speed = 0;
982	update_ob_speed (this);
983
984	unlink ();
985
986	mortals.push_back (this);
987	}	977	}
988		978
989	/*
990	* sub_weight() recursively (outwards) subtracts a number from the
991	* weight of an object (and what is carried by it's environment(s)).
992	*/
993	void	979	void
994	sub_weight (object *op, signed long weight)	980	object::destroy (bool destroy_inventory)
995	{	981	{
996	while (op != NULL)	982	if (destroyed ())
997	{	983	return;
998	if (op->type == CONTAINER)
999	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1000		984
1001	op->carrying -= weight;	985	if (destroy_inventory)
1002	op = op->env;	986	destroy_inv (false);
1003	}	987
		988	if (is_head ())
		989	if (sound_destroy)
		990	play_sound (sound_destroy);
		991	else if (flag [FLAG_MONSTER])
		992	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
		993
		994	attachable::destroy ();
1004	}	995	}
1005		996
1006	/* op->remove ():	997	/* op->remove ():
1007	* This function removes the object op from the linked list of objects	998	* This function removes the object op from the linked list of objects
1008	* which it is currently tied to. When this function is done, the	999	* which it is currently tied to. When this function is done, the
1009	* object will have no environment. If the object previously had an	1000	* object will have no environment. If the object previously had an
1010	* environment, the x and y coordinates will be updated to	1001	* environment, the x and y coordinates will be updated to
1011	* the previous environment.	1002	* the previous environment.
1012	* Beware: This function is called from the editor as well!
1013	*/	1003	*/
1014	void	1004	void
1015	object::remove ()	1005	object::do_remove ()
1016	{	1006	{
1017	object *tmp, *last = 0;	1007	object *tmp, *last = 0;
1018	object *otmp;	1008	object *otmp;
1019		1009
1020	int check_walk_off;
1021
1022	if (QUERY_FLAG (this, FLAG_REMOVED))	1010	if (QUERY_FLAG (this, FLAG_REMOVED))
1023	return;	1011	return;
1024		1012
1025	SET_FLAG (this, FLAG_REMOVED);	1013	SET_FLAG (this, FLAG_REMOVED);
		1014	INVOKE_OBJECT (REMOVE, this);
1026		1015
1027	if (more)	1016	if (more)
1028	more->remove ();	1017	more->remove ();
1029		1018
1030	/*	1019	/*
…		…
1041	/* NO_FIX_PLAYER is set when a great many changes are being	1030	/* NO_FIX_PLAYER is set when a great many changes are being
1042	* made to players inventory. If set, avoiding the call	1031	* made to players inventory. If set, avoiding the call
1043	* to save cpu time.	1032	* to save cpu time.
1044	*/	1033	*/
1045	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1034	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1046	fix_player (otmp);	1035	otmp->update_stats ();
1047		1036
1048	if (above != NULL)	1037	if (above)
1049	above->below = below;	1038	above->below = below;
1050	else	1039	else
1051	env->inv = below;	1040	env->inv = below;
1052		1041
1053	if (below != NULL)	1042	if (below)
1054	below->above = above;	1043	below->above = above;
1055		1044
1056	/* we set up values so that it could be inserted into	1045	/* we set up values so that it could be inserted into
1057	* the map, but we don't actually do that - it is up	1046	* the map, but we don't actually do that - it is up
1058	* to the caller to decide what we want to do.	1047	* to the caller to decide what we want to do.
…		…
1062	above = 0, below = 0;	1051	above = 0, below = 0;
1063	env = 0;	1052	env = 0;
1064	}	1053	}
1065	else if (map)	1054	else if (map)
1066	{	1055	{
1067	/* Re did the following section of code - it looks like it had	1056	if (type == PLAYER)
1068	* lots of logic for things we no longer care about
1069	*/	1057	{
		1058	// leaving a spot always closes any open container on the ground
		1059	if (container && !container->env)
		1060	// this causes spurious floorbox updates, but it ensures
		1061	// that the CLOSE event is being sent.
		1062	close_container ();
		1063
		1064	--map->players;
		1065	map->touch ();
		1066	}
		1067
		1068	map->dirty = true;
		1069	mapspace &ms = this->ms ();
1070		1070
1071	/* link the object above us */	1071	/* link the object above us */
1072	if (above)	1072	if (above)
1073	above->below = below;	1073	above->below = below;
1074	else	1074	else
1075	SET_MAP_TOP (map, x, y, below); /* we were top, set new top */	1075	ms.top = below; /* we were top, set new top */
1076		1076
1077	/* Relink the object below us, if there is one */	1077	/* Relink the object below us, if there is one */
1078	if (below)	1078	if (below)
1079	below->above = above;	1079	below->above = above;
1080	else	1080	else
…		…
1082	/* Nothing below, which means we need to relink map object for this space	1082	/* Nothing below, which means we need to relink map object for this space
1083	* use translated coordinates in case some oddness with map tiling is	1083	* use translated coordinates in case some oddness with map tiling is
1084	* evident	1084	* evident
1085	*/	1085	*/
1086	if (GET_MAP_OB (map, x, y) != this)	1086	if (GET_MAP_OB (map, x, y) != this)
1087	{
1088	char *dump = dump_object (this);
1089	LOG (llevError,
1090	"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);	1087	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 ());
1091	free (dump);
1092	dump = dump_object (GET_MAP_OB (map, x, y));
1093	LOG (llevError, "%s\n", dump);
1094	free (dump);
1095	}
1096		1088
1097	SET_MAP_OB (map, x, y, above); /* goes on above it. */	1089	ms.bot = above; /* goes on above it. */
1098	}	1090	}
1099		1091
1100	above = 0;	1092	above = 0;
1101	below = 0;	1093	below = 0;
1102		1094
1103	if (map->in_memory == MAP_SAVING)	1095	if (map->in_memory == MAP_SAVING)
1104	return;	1096	return;
1105		1097
1106	check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);	1098	int check_walk_off = !flag [FLAG_NO_APPLY];
1107		1099
		1100	if (object *pl = ms.player ())
		1101	{
		1102	if (pl->container == this)
		1103	/* If a container that the player is currently using somehow gets
		1104	* removed (most likely destroyed), update the player view
		1105	* appropriately.
		1106	*/
		1107	pl->close_container ();
		1108
		1109	pl->contr->ns->floorbox_update ();
		1110	}
		1111
1108	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	1112	for (tmp = ms.bot; tmp; tmp = tmp->above)
1109	{	1113	{
1110	/* No point updating the players look faces if he is the object	1114	/* No point updating the players look faces if he is the object
1111	* being removed.	1115	* being removed.
1112	*/	1116	*/
1113		1117
1114	if (tmp->type == PLAYER && tmp != this)
1115	{
1116	/* If a container that the player is currently using somehow gets
1117	* removed (most likely destroyed), update the player view
1118	* appropriately.
1119	*/
1120	if (tmp->container == this)
1121	{
1122	CLEAR_FLAG (this, FLAG_APPLIED);
1123	tmp->container = 0;
1124	}
1125
1126	tmp->contr->socket->floorbox_update ();
1127	}
1128
1129	/* See if player moving off should effect something */	1118	/* See if object moving off should effect something */
1130	if (check_walk_off	1119	if (check_walk_off
1131	&& ((move_type & tmp->move_off)	1120	&& ((move_type & tmp->move_off)
1132	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1121	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1133	{	1122	{
1134	move_apply (tmp, this, 0);	1123	move_apply (tmp, this, 0);
1135		1124
1136	if (destroyed ())	1125	if (destroyed ())
1137	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1126	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1138	}	1127	}
1139		1128
1140	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1141
1142	if (tmp->above == tmp)
1143	tmp->above = 0;
1144
1145	last = tmp;	1129	last = tmp;
1146	}	1130	}
1147		1131
1148	/* last == NULL of there are no objects on this space */	1132	/* last == NULL if there are no objects on this space */
		1133	//TODO: this makes little sense, why only update the topmost object?
1149	if (!last)	1134	if (!last)
1150	{	1135	map->at (x, y).flags_ = 0;
1151	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1152	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1153	* those out anyways, and if there are any flags set right now, they won't
1154	* be correct anyways.
1155	*/
1156	SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE);
1157	update_position (map, x, y);
1158	}
1159	else	1136	else
1160	update_object (last, UP_OBJ_REMOVE);	1137	update_object (last, UP_OBJ_REMOVE);
1161		1138
1162	if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)	1139	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1163	update_all_los (map, x, y);	1140	update_all_los (map, x, y);
1164	}	1141	}
1165	}	1142	}
1166		1143
1167	/*	1144	/*
…		…
1176	merge_ob (object *op, object *top)	1153	merge_ob (object *op, object *top)
1177	{	1154	{
1178	if (!op->nrof)	1155	if (!op->nrof)
1179	return 0;	1156	return 0;
1180		1157
1181	if (top == NULL)	1158	if (!top)
1182	for (top = op; top != NULL && top->above != NULL; top = top->above);	1159	for (top = op; top && top->above; top = top->above)
		1160	;
1183		1161
1184	for (; top != NULL; top = top->below)	1162	for (; top; top = top->below)
1185	{	1163	{
1186	if (top == op)	1164	if (top == op)
1187	continue;	1165	continue;
1188		1166
1189	if (object::can_merge (op, top))	1167	if (object::can_merge (op, top))
…		…
1198	}	1176	}
1199		1177
1200	return 0;	1178	return 0;
1201	}	1179	}
1202		1180
		1181	void
		1182	object::expand_tail ()
		1183	{
		1184	if (more)
		1185	return;
		1186
		1187	object *prev = this;
		1188
		1189	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1190	{
		1191	object *op = arch_to_object (at);
		1192
		1193	op->name = name;
		1194	op->name_pl = name_pl;
		1195	op->title = title;
		1196
		1197	op->head = this;
		1198	prev->more = op;
		1199
		1200	prev = op;
		1201	}
		1202	}
		1203
1203	/*	1204	/*
1204	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1205	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1205	* job preparing multi-part monsters	1206	* job preparing multi-part monsters.
1206	*/	1207	*/
1207	object *	1208	object *
1208	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1209	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1209	{	1210	{
1210	object *tmp;
1211
1212	if (op->head)
1213	op = op->head;
1214
1215	for (tmp = op; tmp; tmp = tmp->more)	1211	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1216	{	1212	{
1217	tmp->x = x + tmp->arch->clone.x;	1213	tmp->x = x + tmp->arch->x;
1218	tmp->y = y + tmp->arch->clone.y;	1214	tmp->y = y + tmp->arch->y;
1219	}	1215	}
1220		1216
1221	return insert_ob_in_map (op, m, originator, flag);	1217	return insert_ob_in_map (op, m, originator, flag);
1222	}	1218	}
1223		1219
…		…
1239	* Return value:	1235	* Return value:
1240	* new object if 'op' was merged with other object	1236	* new object if 'op' was merged with other object
1241	* NULL if 'op' was destroyed	1237	* NULL if 'op' was destroyed
1242	* just 'op' otherwise	1238	* just 'op' otherwise
1243	*/	1239	*/
1244
1245	object *	1240	object *
1246	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1241	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1247	{	1242	{
		1243	assert (!op->flag [FLAG_FREED]);
		1244
1248	object *tmp, *top, *floor = NULL;	1245	object *top, *floor = NULL;
1249	sint16 x, y;
1250		1246
1251	if (QUERY_FLAG (op, FLAG_FREED))	1247	op->remove ();
1252	{
1253	LOG (llevError, "Trying to insert freed object!\n");
1254	return NULL;
1255	}
1256
1257	if (m == NULL)
1258	{
1259	char *dump = dump_object (op);
1260	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1261	free (dump);
1262	return op;
1263	}
1264
1265	if (out_of_map (m, op->x, op->y))
1266	{
1267	char *dump = dump_object (op);
1268	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1269	#ifdef MANY_CORES
1270	/* Better to catch this here, as otherwise the next use of this object
1271	* is likely to cause a crash. Better to find out where it is getting
1272	* improperly inserted.
1273	*/
1274	abort ();
1275	#endif
1276	free (dump);
1277	return op;
1278	}
1279
1280	if (!QUERY_FLAG (op, FLAG_REMOVED))
1281	{
1282	char *dump = dump_object (op);
1283	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1284	free (dump);
1285	return op;
1286	}
1287
1288	if (op->more != NULL)
1289	{
1290	/* The part may be on a different map. */
1291
1292	object *more = op->more;
1293
1294	/* We really need the caller to normalize coordinates - if
1295	* we set the map, that doesn't work if the location is within
1296	* a map and this is straddling an edge. So only if coordinate
1297	* is clear wrong do we normalize it.
1298	*/
1299	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1300	more->map = get_map_from_coord (m, &more->x, &more->y);
1301	else if (!more->map)
1302	{
1303	/* For backwards compatibility - when not dealing with tiled maps,
1304	* more->map should always point to the parent.
1305	*/
1306	more->map = m;
1307	}
1308
1309	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1310	{
1311	if (!op->head)
1312	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1313
1314	return NULL;
1315	}
1316	}
1317
1318	CLEAR_FLAG (op, FLAG_REMOVED);
1319		1248
1320	/* Ideally, the caller figures this out. However, it complicates a lot	1249	/* Ideally, the caller figures this out. However, it complicates a lot
1321	* of areas of callers (eg, anything that uses find_free_spot would now	1250	* of areas of callers (eg, anything that uses find_free_spot would now
1322	* need extra work	1251	* need extra work
1323	*/	1252	*/
1324	op->map = get_map_from_coord (m, &op->x, &op->y);	1253	if (!xy_normalise (m, op->x, op->y))
1325	x = op->x;	1254	{
1326	y = op->y;	1255	op->destroy ();
		1256	return 0;
		1257	}
		1258
		1259	if (object *more = op->more)
		1260	if (!insert_ob_in_map (more, m, originator, flag))
		1261	return 0;
		1262
		1263	CLEAR_FLAG (op, FLAG_REMOVED);
		1264
		1265	op->map = m;
		1266	mapspace &ms = op->ms ();
1327		1267
1328	/* this has to be done after we translate the coordinates.	1268	/* this has to be done after we translate the coordinates.
1329	*/	1269	*/
1330	if (op->nrof && !(flag & INS_NO_MERGE))	1270	if (op->nrof && !(flag & INS_NO_MERGE))
1331	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1271	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1332	if (object::can_merge (op, tmp))	1272	if (object::can_merge (op, tmp))
1333	{	1273	{
1334	op->nrof += tmp->nrof;	1274	op->nrof += tmp->nrof;
1335	tmp->destroy ();	1275	tmp->destroy ();
1336	}	1276	}
…		…
1353	op->below = originator->below;	1293	op->below = originator->below;
1354		1294
1355	if (op->below)	1295	if (op->below)
1356	op->below->above = op;	1296	op->below->above = op;
1357	else	1297	else
1358	SET_MAP_OB (op->map, op->x, op->y, op);	1298	ms.bot = op;
1359		1299
1360	/* since *below* originator, no need to update top */	1300	/* since *below* originator, no need to update top */
1361	originator->below = op;	1301	originator->below = op;
1362	}	1302	}
1363	else	1303	else
1364	{	1304	{
		1305	top = ms.bot;
		1306
1365	/* If there are other objects, then */	1307	/* If there are other objects, then */
1366	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1308	if (top)
1367	{	1309	{
1368	object *last = NULL;	1310	object *last = 0;
1369		1311
1370	/*	1312	/*
1371	* If there are multiple objects on this space, we do some trickier handling.	1313	* If there are multiple objects on this space, we do some trickier handling.
1372	* We've already dealt with merging if appropriate.	1314	* We've already dealt with merging if appropriate.
1373	* Generally, we want to put the new object on top. But if	1315	* Generally, we want to put the new object on top. But if
…		…
1377	* once we get to them. This reduces the need to traverse over all of	1319	* once we get to them. This reduces the need to traverse over all of
1378	* them when adding another one - this saves quite a bit of cpu time	1320	* them when adding another one - this saves quite a bit of cpu time
1379	* when lots of spells are cast in one area. Currently, it is presumed	1321	* when lots of spells are cast in one area. Currently, it is presumed
1380	* that flying non pickable objects are spell objects.	1322	* that flying non pickable objects are spell objects.
1381	*/	1323	*/
1382		1324	for (top = ms.bot; top; top = top->above)
1383	while (top != NULL)
1384	{	1325	{
1385	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1326	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1386	floor = top;	1327	floor = top;
1387		1328
1388	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1329	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1391	top = top->below;	1332	top = top->below;
1392	break;	1333	break;
1393	}	1334	}
1394		1335
1395	last = top;	1336	last = top;
1396	top = top->above;
1397	}	1337	}
1398		1338
1399	/* Don't want top to be NULL, so set it to the last valid object */	1339	/* Don't want top to be NULL, so set it to the last valid object */
1400	top = last;	1340	top = last;
1401		1341
…		…
1403	* looks like instead of lots of conditions here.	1343	* looks like instead of lots of conditions here.
1404	* makes things faster, and effectively the same result.	1344	* makes things faster, and effectively the same result.
1405	*/	1345	*/
1406		1346
1407	/* Have object 'fall below' other objects that block view.	1347	/* Have object 'fall below' other objects that block view.
1408	* Unless those objects are exits, type 66	1348	* Unless those objects are exits.
1409	* If INS_ON_TOP is used, don't do this processing	1349	* If INS_ON_TOP is used, don't do this processing
1410	* Need to find the object that in fact blocks view, otherwise	1350	* Need to find the object that in fact blocks view, otherwise
1411	* stacking is a bit odd.	1351	* stacking is a bit odd.
1412	*/	1352	*/
1413	if (!(flag & INS_ON_TOP) &&	1353	if (!(flag & INS_ON_TOP)
1414	(get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1354	&& ms.flags () & P_BLOCKSVIEW
		1355	&& (op->face && !faces [op->face].visibility))
1415	{	1356	{
1416	for (last = top; last != floor; last = last->below)	1357	for (last = top; last != floor; last = last->below)
1417	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1358	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1418	break;	1359	break;
		1360
1419	/* Check to see if we found the object that blocks view,	1361	/* Check to see if we found the object that blocks view,
1420	* and make sure we have a below pointer for it so that	1362	* and make sure we have a below pointer for it so that
1421	* we can get inserted below this one, which requires we	1363	* we can get inserted below this one, which requires we
1422	* set top to the object below us.	1364	* set top to the object below us.
1423	*/	1365	*/
1424	if (last && last->below && last != floor)	1366	if (last && last->below && last != floor)
1425	top = last->below;	1367	top = last->below;
1426	}	1368	}
1427	} /* If objects on this space */	1369	} /* If objects on this space */
1428		1370
1429	if (flag & INS_MAP_LOAD)
1430	top = GET_MAP_TOP (op->map, op->x, op->y);
1431
1432	if (flag & INS_ABOVE_FLOOR_ONLY)	1371	if (flag & INS_ABOVE_FLOOR_ONLY)
1433	top = floor;	1372	top = floor;
1434		1373
1435	/* Top is the object that our object (op) is going to get inserted above.	1374	/* Top is the object that our object (op) is going to get inserted above.
1436	*/	1375	*/
1437		1376
1438	/* First object on this space */	1377	/* First object on this space */
1439	if (!top)	1378	if (!top)
1440	{	1379	{
1441	op->above = GET_MAP_OB (op->map, op->x, op->y);	1380	op->above = ms.bot;
1442		1381
1443	if (op->above)	1382	if (op->above)
1444	op->above->below = op;	1383	op->above->below = op;
1445		1384
1446	op->below = NULL;	1385	op->below = 0;
1447	SET_MAP_OB (op->map, op->x, op->y, op);	1386	ms.bot = op;
1448	}	1387	}
1449	else	1388	else
1450	{ /* get inserted into the stack above top */	1389	{ /* get inserted into the stack above top */
1451	op->above = top->above;	1390	op->above = top->above;
1452		1391
…		…
1455		1394
1456	op->below = top;	1395	op->below = top;
1457	top->above = op;	1396	top->above = op;
1458	}	1397	}
1459		1398
1460	if (op->above == NULL)	1399	if (!op->above)
1461	SET_MAP_TOP (op->map, op->x, op->y, op);	1400	ms.top = op;
1462	} /* else not INS_BELOW_ORIGINATOR */	1401	} /* else not INS_BELOW_ORIGINATOR */
1463		1402
1464	if (op->type == PLAYER)	1403	if (op->type == PLAYER)
		1404	{
1465	op->contr->do_los = 1;	1405	op->contr->do_los = 1;
		1406	++op->map->players;
		1407	op->map->touch ();
		1408	}
1466		1409
1467	/* If we have a floor, we know the player, if any, will be above	1410	op->map->dirty = true;
1468	* it, so save a few ticks and start from there.	1411
1469	*/	1412	if (object *pl = ms.player ())
1470	if (!(flag & INS_MAP_LOAD))
1471	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1472	if (tmp->type == PLAYER)
1473	tmp->contr->socket->floorbox_update ();	1413	pl->contr->ns->floorbox_update ();
1474		1414
1475	/* If this object glows, it may affect lighting conditions that are	1415	/* If this object glows, it may affect lighting conditions that are
1476	* visible to others on this map. But update_all_los is really	1416	* visible to others on this map. But update_all_los is really
1477	* an inefficient way to do this, as it means los for all players	1417	* an inefficient way to do this, as it means los for all players
1478	* on the map will get recalculated. The players could very well	1418	* on the map will get recalculated. The players could very well
1479	* be far away from this change and not affected in any way -	1419	* be far away from this change and not affected in any way -
1480	* this should get redone to only look for players within range,	1420	* this should get redone to only look for players within range,
1481	* or just updating the P_NEED_UPDATE for spaces within this area	1421	* or just updating the P_UPTODATE for spaces within this area
1482	* of effect may be sufficient.	1422	* of effect may be sufficient.
1483	*/	1423	*/
1484	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1424	if (op->map->darkness && (op->glow_radius != 0))
1485	update_all_los (op->map, op->x, op->y);	1425	update_all_los (op->map, op->x, op->y);
1486		1426
1487	/* updates flags (blocked, alive, no magic, etc) for this map space */	1427	/* updates flags (blocked, alive, no magic, etc) for this map space */
1488	update_object (op, UP_OBJ_INSERT);	1428	update_object (op, UP_OBJ_INSERT);
		1429
		1430	INVOKE_OBJECT (INSERT, op);
1489		1431
1490	/* Don't know if moving this to the end will break anything. However,	1432	/* Don't know if moving this to the end will break anything. However,
1491	* we want to have floorbox_update called before calling this.	1433	* we want to have floorbox_update called before calling this.
1492	*	1434	*
1493	* check_move_on() must be after this because code called from	1435	* check_move_on() must be after this because code called from
…		…
1495	* blocked() and wall() work properly), and these flags are updated by	1437	* blocked() and wall() work properly), and these flags are updated by
1496	* update_object().	1438	* update_object().
1497	*/	1439	*/
1498		1440
1499	/* if this is not the head or flag has been passed, don't check walk on status */	1441	/* if this is not the head or flag has been passed, don't check walk on status */
1500	if (!(flag & INS_NO_WALK_ON) && !op->head)	1442	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1501	{	1443	{
1502	if (check_move_on (op, originator))	1444	if (check_move_on (op, originator))
1503	return NULL;	1445	return 0;
1504		1446
1505	/* If we are a multi part object, lets work our way through the check	1447	/* If we are a multi part object, lets work our way through the check
1506	* walk on's.	1448	* walk on's.
1507	*/	1449	*/
1508	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1450	for (object *tmp = op->more; tmp; tmp = tmp->more)
1509	if (check_move_on (tmp, originator))	1451	if (check_move_on (tmp, originator))
1510	return NULL;	1452	return 0;
1511	}	1453	}
1512		1454
1513	return op;	1455	return op;
1514	}	1456	}
1515		1457
1516	/* this function inserts an object in the map, but if it	1458	/* this function inserts an object in the map, but if it
1517	* finds an object of its own type, it'll remove that one first.	1459	* finds an object of its own type, it'll remove that one first.
1518	* op is the object to insert it under: supplies x and the map.	1460	* op is the object to insert it under: supplies x and the map.
1519	*/	1461	*/
1520	void	1462	void
1521	replace_insert_ob_in_map (const char *arch_string, object *op)	1463	replace_insert_ob_in_map (const char *arch_string, object *op)
1522	{	1464	{
1523	object *	1465	object *tmp, *tmp1;
1524	tmp;
1525	object *
1526	tmp1;
1527		1466
1528	/* first search for itself and remove any old instances */	1467	/* first search for itself and remove any old instances */
1529		1468
1530	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1469	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1531	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1470	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1532	tmp->destroy ();	1471	tmp->destroy ();
1533		1472
1534	tmp1 = arch_to_object (archetype::find (arch_string));	1473	tmp1 = arch_to_object (archetype::find (arch_string));
1535		1474
1536	tmp1->x = op->x;	1475	tmp1->x = op->x;
1537	tmp1->y = op->y;	1476	tmp1->y = op->y;
1538	insert_ob_in_map (tmp1, op->map, op, 0);	1477	insert_ob_in_map (tmp1, op->map, op, 0);
		1478	}
		1479
		1480	object *
		1481	object::insert_at (object *where, object *originator, int flags)
		1482	{
		1483	if (where->env)
		1484	return where->env->insert (this);
		1485	else
		1486	return where->map->insert (this, where->x, where->y, originator, flags);
1539	}	1487	}
1540		1488
1541	/*	1489	/*
1542	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1490	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1543	* is returned contains nr objects, and the remaining parts contains	1491	* is returned contains nr objects, and the remaining parts contains
1544	* the rest (or is removed and freed if that number is 0).	1492	* the rest (or is removed and freed if that number is 0).
1545	* On failure, NULL is returned, and the reason put into the	1493	* On failure, NULL is returned, and the reason put into the
1546	* global static errmsg array.	1494	* global static errmsg array.
1547	*/	1495	*/
1548
1549	object *	1496	object *
1550	get_split_ob (object *orig_ob, uint32 nr)	1497	get_split_ob (object *orig_ob, uint32 nr)
1551	{	1498	{
1552	object *newob;	1499	object *newob;
1553	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1500	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1564	orig_ob->destroy (1);	1511	orig_ob->destroy (1);
1565	else if (!is_removed)	1512	else if (!is_removed)
1566	{	1513	{
1567	if (orig_ob->env != NULL)	1514	if (orig_ob->env != NULL)
1568	sub_weight (orig_ob->env, orig_ob->weight * nr);	1515	sub_weight (orig_ob->env, orig_ob->weight * nr);
1569	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)	1516	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_ACTIVE)
1570	{	1517	{
1571	strcpy (errmsg, "Tried to split object whose map is not in memory.");	1518	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1572	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");	1519	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1573	return NULL;	1520	return NULL;
1574	}	1521	}
…		…
1584	* the amount of an object. If the amount reaches 0, the object	1531	* the amount of an object. If the amount reaches 0, the object
1585	* is subsequently removed and freed.	1532	* is subsequently removed and freed.
1586	*	1533	*
1587	* Return value: 'op' if something is left, NULL if the amount reached 0	1534	* Return value: 'op' if something is left, NULL if the amount reached 0
1588	*/	1535	*/
1589
1590	object *	1536	object *
1591	decrease_ob_nr (object *op, uint32 i)	1537	decrease_ob_nr (object *op, uint32 i)
1592	{	1538	{
1593	object *tmp;	1539	object *tmp;
1594	player *pl;
1595		1540
1596	if (i == 0) /* objects with op->nrof require this check */	1541	if (i == 0) /* objects with op->nrof require this check */
1597	return op;	1542	return op;
1598		1543
1599	if (i > op->nrof)	1544	if (i > op->nrof)
…		…
1612	* IMO, searching through all the players will mostly	1557	* IMO, searching through all the players will mostly
1613	* likely be quicker than following op->env to the map,	1558	* likely be quicker than following op->env to the map,
1614	* and then searching the map for a player.	1559	* and then searching the map for a player.
1615	*/	1560	*/
1616	if (!tmp)	1561	if (!tmp)
1617	{	1562	for_all_players (pl)
1618	for (pl = first_player; pl; pl = pl->next)
1619	if (pl->ob->container == op->env)	1563	if (pl->ob->container == op->env)
1620	{	1564	{
1621	tmp = pl->ob;	1565	tmp = pl->ob;
1622	break;	1566	break;
1623	}	1567	}
1624	}
1625		1568
1626	if (i < op->nrof)	1569	if (i < op->nrof)
1627	{	1570	{
1628	sub_weight (op->env, op->weight * i);	1571	sub_weight (op->env, op->weight * i);
1629	op->nrof -= i;	1572	op->nrof -= i;
…		…
1668	op->destroy ();	1611	op->destroy ();
1669	return 0;	1612	return 0;
1670	}	1613	}
1671	}	1614	}
1672		1615
1673	/*
1674	* add_weight(object, weight) adds the specified weight to an object,
1675	* and also updates how much the environment(s) is/are carrying.
1676	*/
1677
1678	void
1679	add_weight (object *op, signed long weight)
1680	{
1681	while (op != NULL)
1682	{
1683	if (op->type == CONTAINER)
1684	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1685
1686	op->carrying += weight;
1687	op = op->env;
1688	}
1689	}
1690
1691	object *	1616	object *
1692	insert_ob_in_ob (object *op, object *where)	1617	insert_ob_in_ob (object *op, object *where)
1693	{	1618	{
1694	if (!where)	1619	if (!where)
1695	{	1620	{
…		…
1697	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1622	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1698	free (dump);	1623	free (dump);
1699	return op;	1624	return op;
1700	}	1625	}
1701		1626
1702	if (where->head)	1627	if (where->head_ () != where)
1703	{	1628	{
1704	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1629	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1705	where = where->head;	1630	where = where->head;
1706	}	1631	}
1707		1632
1708	return where->insert (op);	1633	return where->insert (op);
1709	}	1634	}
…		…
1714	* inside the object environment.	1639	* inside the object environment.
1715	*	1640	*
1716	* The function returns now pointer to inserted item, and return value can	1641	* The function returns now pointer to inserted item, and return value can
1717	* be != op, if items are merged. -Tero	1642	* be != op, if items are merged. -Tero
1718	*/	1643	*/
1719
1720	object *	1644	object *
1721	object::insert (object *op)	1645	object::insert (object *op)
1722	{	1646	{
1723	object *tmp, *otmp;
1724
1725	if (!QUERY_FLAG (op, FLAG_REMOVED))	1647	if (!QUERY_FLAG (op, FLAG_REMOVED))
1726	op->remove ();	1648	op->remove ();
1727		1649
1728	if (op->more)	1650	if (op->more)
1729	{	1651	{
…		…
1731	return op;	1653	return op;
1732	}	1654	}
1733		1655
1734	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1656	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1735	CLEAR_FLAG (op, FLAG_REMOVED);	1657	CLEAR_FLAG (op, FLAG_REMOVED);
		1658
1736	if (op->nrof)	1659	if (op->nrof)
1737	{	1660	{
1738	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1661	for (object *tmp = inv; tmp; tmp = tmp->below)
1739	if (object::can_merge (tmp, op))	1662	if (object::can_merge (tmp, op))
1740	{	1663	{
1741	/* return the original object and remove inserted object	1664	/* return the original object and remove inserted object
1742	(client needs the original object) */	1665	(client needs the original object) */
1743	tmp->nrof += op->nrof;	1666	tmp->nrof += op->nrof;
…		…
1762	add_weight (this, op->weight * op->nrof);	1685	add_weight (this, op->weight * op->nrof);
1763	}	1686	}
1764	else	1687	else
1765	add_weight (this, (op->weight + op->carrying));	1688	add_weight (this, (op->weight + op->carrying));
1766		1689
1767	otmp = this->in_player ();	1690	if (object *otmp = this->in_player ())
1768	if (otmp && otmp->contr)
1769	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1691	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1770	fix_player (otmp);	1692	otmp->update_stats ();
1771		1693
		1694	op->owner = 0; // its his/hers now. period.
1772	op->map = 0;	1695	op->map = 0;
1773	op->env = this;	1696	op->env = this;
1774	op->above = 0;	1697	op->above = 0;
1775	op->below = 0;	1698	op->below = 0;
1776	op->x = 0, op->y = 0;	1699	op->x = op->y = 0;
1777		1700
1778	/* reset the light list and los of the players on the map */	1701	/* reset the light list and los of the players on the map */
1779	if ((op->glow_radius != 0) && map)	1702	if (op->glow_radius && map)
1780	{	1703	{
1781	#ifdef DEBUG_LIGHTS	1704	#ifdef DEBUG_LIGHTS
1782	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1705	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1783	#endif /* DEBUG_LIGHTS */	1706	#endif /* DEBUG_LIGHTS */
1784	if (MAP_DARKNESS (map))	1707	if (map->darkness)
1785	update_all_los (map, x, y);	1708	update_all_los (map, x, y);
1786	}	1709	}
1787		1710
1788	/* Client has no idea of ordering so lets not bother ordering it here.	1711	/* Client has no idea of ordering so lets not bother ordering it here.
1789	* It sure simplifies this function...	1712	* It sure simplifies this function...
…		…
1794	{	1717	{
1795	op->below = inv;	1718	op->below = inv;
1796	op->below->above = op;	1719	op->below->above = op;
1797	inv = op;	1720	inv = op;
1798	}	1721	}
		1722
		1723	INVOKE_OBJECT (INSERT, this);
1799		1724
1800	return op;	1725	return op;
1801	}	1726	}
1802		1727
1803	/*	1728	/*
…		…
1818	*	1743	*
1819	* MSW 2001-07-08: Check all objects on space, not just those below	1744	* MSW 2001-07-08: Check all objects on space, not just those below
1820	* object being inserted. insert_ob_in_map may not put new objects	1745	* object being inserted. insert_ob_in_map may not put new objects
1821	* on top.	1746	* on top.
1822	*/	1747	*/
1823
1824	int	1748	int
1825	check_move_on (object *op, object *originator)	1749	check_move_on (object *op, object *originator)
1826	{	1750	{
1827	object *tmp;	1751	object *tmp;
1828	maptile *m = op->map;	1752	maptile *m = op->map;
…		…
1855		1779
1856	/* The objects have to be checked from top to bottom.	1780	/* The objects have to be checked from top to bottom.
1857	* Hence, we first go to the top:	1781	* Hence, we first go to the top:
1858	*/	1782	*/
1859		1783
1860	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1784	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1861	{	1785	{
1862	/* Trim the search when we find the first other spell effect	1786	/* Trim the search when we find the first other spell effect
1863	* this helps performance so that if a space has 50 spell objects,	1787	* this helps performance so that if a space has 50 spell objects,
1864	* we don't need to check all of them.	1788	* we don't need to check all of them.
1865	*/	1789	*/
…		…
1883	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1807	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1884	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1808	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1885	{	1809	{
1886		1810
1887	float	1811	float
1888	diff = tmp->move_slow_penalty * FABS (op->speed);	1812	diff = tmp->move_slow_penalty * fabs (op->speed);
1889		1813
1890	if (op->type == PLAYER)	1814	if (op->type == PLAYER)
1891	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1815	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1892	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1816	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1893	diff /= 4.0;	1817	diff /= 4.0;
…		…
1920	/*	1844	/*
1921	* present_arch(arch, map, x, y) searches for any objects with	1845	* present_arch(arch, map, x, y) searches for any objects with
1922	* a matching archetype at the given map and coordinates.	1846	* a matching archetype at the given map and coordinates.
1923	* The first matching object is returned, or NULL if none.	1847	* The first matching object is returned, or NULL if none.
1924	*/	1848	*/
1925
1926	object *	1849	object *
1927	present_arch (const archetype *at, maptile *m, int x, int y)	1850	present_arch (const archetype *at, maptile *m, int x, int y)
1928	{	1851	{
1929	object *
1930	tmp;
1931
1932	if (m == NULL || out_of_map (m, x, y))	1852	if (!m || out_of_map (m, x, y))
1933	{	1853	{
1934	LOG (llevError, "Present_arch called outside map.\n");	1854	LOG (llevError, "Present_arch called outside map.\n");
1935	return NULL;	1855	return NULL;
1936	}	1856	}
1937	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1857
		1858	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1938	if (tmp->arch == at)	1859	if (tmp->arch == at)
1939	return tmp;	1860	return tmp;
		1861
1940	return NULL;	1862	return NULL;
1941	}	1863	}
1942		1864
1943	/*	1865	/*
1944	* present(type, map, x, y) searches for any objects with	1866	* present(type, map, x, y) searches for any objects with
1945	* a matching type variable at the given map and coordinates.	1867	* a matching type variable at the given map and coordinates.
1946	* The first matching object is returned, or NULL if none.	1868	* The first matching object is returned, or NULL if none.
1947	*/	1869	*/
1948
1949	object *	1870	object *
1950	present (unsigned char type, maptile *m, int x, int y)	1871	present (unsigned char type, maptile *m, int x, int y)
1951	{	1872	{
1952	object *
1953	tmp;
1954
1955	if (out_of_map (m, x, y))	1873	if (out_of_map (m, x, y))
1956	{	1874	{
1957	LOG (llevError, "Present called outside map.\n");	1875	LOG (llevError, "Present called outside map.\n");
1958	return NULL;	1876	return NULL;
1959	}	1877	}
1960	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1878
		1879	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1961	if (tmp->type == type)	1880	if (tmp->type == type)
1962	return tmp;	1881	return tmp;
		1882
1963	return NULL;	1883	return NULL;
1964	}	1884	}
1965		1885
1966	/*	1886	/*
1967	* present_in_ob(type, object) searches for any objects with	1887	* present_in_ob(type, object) searches for any objects with
1968	* a matching type variable in the inventory of the given object.	1888	* a matching type variable in the inventory of the given object.
1969	* The first matching object is returned, or NULL if none.	1889	* The first matching object is returned, or NULL if none.
1970	*/	1890	*/
1971
1972	object *	1891	object *
1973	present_in_ob (unsigned char type, const object *op)	1892	present_in_ob (unsigned char type, const object *op)
1974	{	1893	{
1975	object *
1976	tmp;
1977
1978	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1894	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1979	if (tmp->type == type)	1895	if (tmp->type == type)
1980	return tmp;	1896	return tmp;
		1897
1981	return NULL;	1898	return NULL;
1982	}	1899	}
1983		1900
1984	/*	1901	/*
1985	* present_in_ob (type, str, object) searches for any objects with	1902	* present_in_ob (type, str, object) searches for any objects with
…		…
1993	* str is the string to match against. Note that we match against	1910	* str is the string to match against. Note that we match against
1994	* the object name, not the archetype name. this is so that the	1911	* the object name, not the archetype name. this is so that the
1995	* spell code can use one object type (force), but change it's name	1912	* spell code can use one object type (force), but change it's name
1996	* to be unique.	1913	* to be unique.
1997	*/	1914	*/
1998
1999	object *	1915	object *
2000	present_in_ob_by_name (int type, const char *str, const object *op)	1916	present_in_ob_by_name (int type, const char *str, const object *op)
2001	{	1917	{
2002	object *
2003	tmp;
2004
2005	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1918	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2006	{
2007	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1919	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2008	return tmp;	1920	return tmp;
2009	}	1921
2010	return NULL;	1922	return 0;
2011	}	1923	}
2012		1924
2013	/*	1925	/*
2014	* present_arch_in_ob(archetype, object) searches for any objects with	1926	* present_arch_in_ob(archetype, object) searches for any objects with
2015	* a matching archetype in the inventory of the given object.	1927	* a matching archetype in the inventory of the given object.
2016	* The first matching object is returned, or NULL if none.	1928	* The first matching object is returned, or NULL if none.
2017	*/	1929	*/
2018
2019	object *	1930	object *
2020	present_arch_in_ob (const archetype *at, const object *op)	1931	present_arch_in_ob (const archetype *at, const object *op)
2021	{	1932	{
2022	object *
2023	tmp;
2024
2025	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1933	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2026	if (tmp->arch == at)	1934	if (tmp->arch == at)
2027	return tmp;	1935	return tmp;
		1936
2028	return NULL;	1937	return NULL;
2029	}	1938	}
2030		1939
2031	/*	1940	/*
2032	* activate recursively a flag on an object inventory	1941	* activate recursively a flag on an object inventory
2033	*/	1942	*/
2034	void	1943	void
2035	flag_inv (object *op, int flag)	1944	flag_inv (object *op, int flag)
2036	{	1945	{
2037	object *
2038	tmp;
2039
2040	if (op->inv)
2041	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1946	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2042	{	1947	{
2043	SET_FLAG (tmp, flag);	1948	SET_FLAG (tmp, flag);
2044	flag_inv (tmp, flag);	1949	flag_inv (tmp, flag);
2045	}	1950	}
2046	} /*	1951	}
		1952
		1953	/*
2047	* desactivate recursively a flag on an object inventory	1954	* deactivate recursively a flag on an object inventory
2048	*/	1955	*/
2049	void	1956	void
2050	unflag_inv (object *op, int flag)	1957	unflag_inv (object *op, int flag)
2051	{	1958	{
2052	object *
2053	tmp;
2054
2055	if (op->inv)
2056	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1959	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2057	{	1960	{
2058	CLEAR_FLAG (tmp, flag);	1961	CLEAR_FLAG (tmp, flag);
2059	unflag_inv (tmp, flag);	1962	unflag_inv (tmp, flag);
2060	}	1963	}
2061	}
2062
2063	/*
2064	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2065	* all it's inventory (recursively).
2066	* If checksums are used, a player will get set_cheat called for
2067	* him/her-self and all object carried by a call to this function.
2068	*/
2069
2070	void
2071	set_cheat (object *op)
2072	{
2073	SET_FLAG (op, FLAG_WAS_WIZ);
2074	flag_inv (op, FLAG_WAS_WIZ);
2075	}	1964	}
2076		1965
2077	/*	1966	/*
2078	* find_free_spot(object, map, x, y, start, stop) will search for	1967	* find_free_spot(object, map, x, y, start, stop) will search for
2079	* a spot at the given map and coordinates which will be able to contain	1968	* a spot at the given map and coordinates which will be able to contain
…		…
2081	* to search (see the freearr_x/y[] definition).	1970	* to search (see the freearr_x/y[] definition).
2082	* It returns a random choice among the alternatives found.	1971	* It returns a random choice among the alternatives found.
2083	* start and stop are where to start relative to the free_arr array (1,9	1972	* start and stop are where to start relative to the free_arr array (1,9
2084	* does all 4 immediate directions). This returns the index into the	1973	* does all 4 immediate directions). This returns the index into the
2085	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1974	* array of the free spot, -1 if no spot available (dir 0 = x,y)
2086	* Note - this only checks to see if there is space for the head of the
2087	* object - if it is a multispace object, this should be called for all
2088	* pieces.
2089	* Note2: This function does correctly handle tiled maps, but does not	1975	* Note: This function does correctly handle tiled maps, but does not
2090	* inform the caller. However, insert_ob_in_map will update as	1976	* inform the caller. However, insert_ob_in_map will update as
2091	* necessary, so the caller shouldn't need to do any special work.	1977	* necessary, so the caller shouldn't need to do any special work.
2092	* Note - updated to take an object instead of archetype - this is necessary	1978	* Note - updated to take an object instead of archetype - this is necessary
2093	* because arch_blocked (now ob_blocked) needs to know the movement type	1979	* because arch_blocked (now ob_blocked) needs to know the movement type
2094	* to know if the space in question will block the object. We can't use	1980	* to know if the space in question will block the object. We can't use
2095	* the archetype because that isn't correct if the monster has been	1981	* the archetype because that isn't correct if the monster has been
2096	* customized, changed states, etc.	1982	* customized, changed states, etc.
2097	*/	1983	*/
2098
2099	int	1984	int
2100	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1985	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2101	{	1986	{
2102	int
2103	i,
2104	index = 0, flag;
2105	static int
2106	altern[SIZEOFFREE];	1987	int altern[SIZEOFFREE];
		1988	int index = 0, flag;
2107		1989
2108	for (i = start; i < stop; i++)	1990	for (int i = start; i < stop; i++)
2109	{	1991	{
2110	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1992	mapxy pos (m, x, y); pos.move (i);
2111	if (!flag)	1993
		1994	if (!pos.normalise ())
		1995	continue;
		1996
		1997	mapspace &ms = *pos;
		1998
		1999	if (ms.flags () & P_IS_ALIVE)
		2000	continue;
		2001
		2002	/* However, often
		2003	* ob doesn't have any move type (when used to place exits)
		2004	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2005	*/
		2006	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2007	{
2112	altern[index++] = i;	2008	altern [index++] = i;
		2009	continue;
		2010	}
2113		2011
2114	/* Basically, if we find a wall on a space, we cut down the search size.	2012	/* Basically, if we find a wall on a space, we cut down the search size.
2115	* In this way, we won't return spaces that are on another side of a wall.	2013	* In this way, we won't return spaces that are on another side of a wall.
2116	* This mostly work, but it cuts down the search size in all directions -	2014	* This mostly work, but it cuts down the search size in all directions -
2117	* if the space being examined only has a wall to the north and empty	2015	* if the space being examined only has a wall to the north and empty
2118	* spaces in all the other directions, this will reduce the search space	2016	* spaces in all the other directions, this will reduce the search space
2119	* to only the spaces immediately surrounding the target area, and	2017	* to only the spaces immediately surrounding the target area, and
2120	* won't look 2 spaces south of the target space.	2018	* won't look 2 spaces south of the target space.
2121	*/	2019	*/
2122	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2020	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2021	{
2123	stop = maxfree[i];	2022	stop = maxfree[i];
		2023	continue;
		2024	}
		2025
		2026	/* Note it is intentional that we check ob - the movement type of the
		2027	* head of the object should correspond for the entire object.
		2028	*/
		2029	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2030	continue;
		2031
		2032	if (ob->blocked (m, pos.x, pos.y))
		2033	continue;
		2034
		2035	altern [index++] = i;
2124	}	2036	}
2125		2037
2126	if (!index)	2038	if (!index)
2127	return -1;	2039	return -1;
2128		2040
2129	return altern[RANDOM () % index];	2041	return altern [rndm (index)];
2130	}	2042	}
2131		2043
2132	/*	2044	/*
2133	* find_first_free_spot(archetype, maptile, x, y) works like	2045	* find_first_free_spot(archetype, maptile, x, y) works like
2134	* find_free_spot(), but it will search max number of squares.	2046	* find_free_spot(), but it will search max number of squares.
2135	* But it will return the first available spot, not a random choice.	2047	* But it will return the first available spot, not a random choice.
2136	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2048	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2137	*/	2049	*/
2138
2139	int	2050	int
2140	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2051	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2141	{	2052	{
2142	int
2143	i;
2144
2145	for (i = 0; i < SIZEOFFREE; i++)	2053	for (int i = 0; i < SIZEOFFREE; i++)
2146	{
2147	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2054	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2148	return i;	2055	return i;
2149	}	2056
2150	return -1;	2057	return -1;
2151	}	2058	}
2152		2059
2153	/*	2060	/*
2154	* The function permute(arr, begin, end) randomly reorders the array	2061	* The function permute(arr, begin, end) randomly reorders the array
2155	* arr[begin..end-1].	2062	* arr[begin..end-1].
		2063	* now uses a fisher-yates shuffle, old permute was broken
2156	*/	2064	*/
2157	static void	2065	static void
2158	permute (int *arr, int begin, int end)	2066	permute (int *arr, int begin, int end)
2159	{	2067	{
2160	int	2068	arr += begin;
2161	i,
2162	j,
2163	tmp,
2164	len;
2165
2166	len = end - begin;	2069	end -= begin;
2167	for (i = begin; i < end; i++)
2168	{
2169	j = begin + RANDOM () % len;
2170		2070
2171	tmp = arr[i];	2071	while (--end)
2172	arr[i] = arr[j];	2072	swap (arr [end], arr [rndm (end + 1)]);
2173	arr[j] = tmp;
2174	}
2175	}	2073	}
2176		2074
2177	/* new function to make monster searching more efficient, and effective!	2075	/* new function to make monster searching more efficient, and effective!
2178	* This basically returns a randomized array (in the passed pointer) of	2076	* This basically returns a randomized array (in the passed pointer) of
2179	* the spaces to find monsters. In this way, it won't always look for	2077	* the spaces to find monsters. In this way, it won't always look for
…		…
2182	* the 3x3 area will be searched, just not in a predictable order.	2080	* the 3x3 area will be searched, just not in a predictable order.
2183	*/	2081	*/
2184	void	2082	void
2185	get_search_arr (int *search_arr)	2083	get_search_arr (int *search_arr)
2186	{	2084	{
2187	int	2085	int i;
2188	i;
2189		2086
2190	for (i = 0; i < SIZEOFFREE; i++)	2087	for (i = 0; i < SIZEOFFREE; i++)
2191	{
2192	search_arr[i] = i;	2088	search_arr[i] = i;
2193	}
2194		2089
2195	permute (search_arr, 1, SIZEOFFREE1 + 1);	2090	permute (search_arr, 1, SIZEOFFREE1 + 1);
2196	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2091	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2197	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2092	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2198	}	2093	}
…		…
2207	* Perhaps incorrectly, but I'm making the assumption that exclude	2102	* Perhaps incorrectly, but I'm making the assumption that exclude
2208	* is actually want is going to try and move there. We need this info	2103	* is actually want is going to try and move there. We need this info
2209	* because we have to know what movement the thing looking to move	2104	* because we have to know what movement the thing looking to move
2210	* there is capable of.	2105	* there is capable of.
2211	*/	2106	*/
2212
2213	int	2107	int
2214	find_dir (maptile *m, int x, int y, object *exclude)	2108	find_dir (maptile *m, int x, int y, object *exclude)
2215	{	2109	{
2216	int
2217	i,
2218	max = SIZEOFFREE, mflags;	2110	int i, max = SIZEOFFREE, mflags;
2219		2111
2220	sint16 nx, ny;	2112	sint16 nx, ny;
2221	object *	2113	object *tmp;
2222	tmp;
2223	maptile *	2114	maptile *mp;
2224	mp;
2225		2115
2226	MoveType blocked, move_type;	2116	MoveType blocked, move_type;
2227		2117
2228	if (exclude && exclude->head)	2118	if (exclude && exclude->head_ () != exclude)
2229	{	2119	{
2230	exclude = exclude->head;	2120	exclude = exclude->head;
2231	move_type = exclude->move_type;	2121	move_type = exclude->move_type;
2232	}	2122	}
2233	else	2123	else
…		…
2241	mp = m;	2131	mp = m;
2242	nx = x + freearr_x[i];	2132	nx = x + freearr_x[i];
2243	ny = y + freearr_y[i];	2133	ny = y + freearr_y[i];
2244		2134
2245	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2135	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
		2136
2246	if (mflags & P_OUT_OF_MAP)	2137	if (mflags & P_OUT_OF_MAP)
2247	{
2248	max = maxfree[i];	2138	max = maxfree[i];
2249	}
2250	else	2139	else
2251	{	2140	{
2252	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2141	mapspace &ms = mp->at (nx, ny);
		2142
		2143	blocked = ms.move_block;
2253		2144
2254	if ((move_type & blocked) == move_type)	2145	if ((move_type & blocked) == move_type)
2255	{
2256	max = maxfree[i];	2146	max = maxfree[i];
2257	}
2258	else if (mflags & P_IS_ALIVE)	2147	else if (mflags & P_IS_ALIVE)
2259	{	2148	{
2260	for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)	2149	for (tmp = ms.bot; tmp; tmp = tmp->above)
2261	{	2150	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2262	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2151	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2263	{
2264	break;	2152	break;
2265	}	2153
2266	}
2267	if (tmp)	2154	if (tmp)
2268	{
2269	return freedir[i];	2155	return freedir[i];
2270	}
2271	}	2156	}
2272	}	2157	}
2273	}	2158	}
		2159
2274	return 0;	2160	return 0;
2275	}	2161	}
2276		2162
2277	/*	2163	/*
2278	* distance(object 1, object 2) will return the square of the	2164	* distance(object 1, object 2) will return the square of the
2279	* distance between the two given objects.	2165	* distance between the two given objects.
2280	*/	2166	*/
2281
2282	int	2167	int
2283	distance (const object *ob1, const object *ob2)	2168	distance (const object *ob1, const object *ob2)
2284	{	2169	{
2285	int
2286	i;
2287
2288	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2170	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2289	return i;
2290	}	2171	}
2291		2172
2292	/*	2173	/*
2293	* find_dir_2(delta-x,delta-y) will return a direction in which	2174	* find_dir_2(delta-x,delta-y) will return a direction in which
2294	* an object which has subtracted the x and y coordinates of another	2175	* an object which has subtracted the x and y coordinates of another
2295	* object, needs to travel toward it.	2176	* object, needs to travel toward it.
2296	*/	2177	*/
2297
2298	int	2178	int
2299	find_dir_2 (int x, int y)	2179	find_dir_2 (int x, int y)
2300	{	2180	{
2301	int	2181	int q;
2302	q;
2303		2182
2304	if (y)	2183	if (y)
2305	q = x * 100 / y;	2184	q = x * 100 / y;
2306	else if (x)	2185	else if (x)
2307	q = -300 * x;	2186	q = -300 * x;
…		…
2332		2211
2333	return 3;	2212	return 3;
2334	}	2213	}
2335		2214
2336	/*	2215	/*
2337	* absdir(int): Returns a number between 1 and 8, which represent
2338	* the "absolute" direction of a number (it actually takes care of
2339	* "overflow" in previous calculations of a direction).
2340	*/
2341
2342	int
2343	absdir (int d)
2344	{
2345	while (d < 1)
2346	d += 8;
2347	while (d > 8)
2348	d -= 8;
2349	return d;
2350	}
2351
2352	/*
2353	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2216	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2354	* between two directions (which are expected to be absolute (see absdir())	2217	* between two directions (which are expected to be absolute (see absdir())
2355	*/	2218	*/
2356
2357	int	2219	int
2358	dirdiff (int dir1, int dir2)	2220	dirdiff (int dir1, int dir2)
2359	{	2221	{
2360	int	2222	int d;
2361	d;
2362		2223
2363	d = abs (dir1 - dir2);	2224	d = abs (dir1 - dir2);
2364	if (d > 4)	2225	if (d > 4)
2365	d = 8 - d;	2226	d = 8 - d;
		2227
2366	return d;	2228	return d;
2367	}	2229	}
2368		2230
2369	/* peterm:	2231	/* peterm:
2370	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2232	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2373	* This basically means that if direction is 15, then it could either go	2235	* This basically means that if direction is 15, then it could either go
2374	* direction 4, 14, or 16 to get back to where we are.	2236	* direction 4, 14, or 16 to get back to where we are.
2375	* Moved from spell_util.c to object.c with the other related direction	2237	* Moved from spell_util.c to object.c with the other related direction
2376	* functions.	2238	* functions.
2377	*/	2239	*/
2378
2379	int
2380	reduction_dir[SIZEOFFREE][3] = {	2240	int reduction_dir[SIZEOFFREE][3] = {
2381	{0, 0, 0}, /* 0 */	2241	{0, 0, 0}, /* 0 */
2382	{0, 0, 0}, /* 1 */	2242	{0, 0, 0}, /* 1 */
2383	{0, 0, 0}, /* 2 */	2243	{0, 0, 0}, /* 2 */
2384	{0, 0, 0}, /* 3 */	2244	{0, 0, 0}, /* 3 */
2385	{0, 0, 0}, /* 4 */	2245	{0, 0, 0}, /* 4 */
…		…
2433	* find a path to that monster that we found. If not,	2293	* find a path to that monster that we found. If not,
2434	* we don't bother going toward it. Returns 1 if we	2294	* we don't bother going toward it. Returns 1 if we
2435	* can see a direct way to get it	2295	* can see a direct way to get it
2436	* Modified to be map tile aware -.MSW	2296	* Modified to be map tile aware -.MSW
2437	*/	2297	*/
2438
2439
2440	int	2298	int
2441	can_see_monsterP (maptile *m, int x, int y, int dir)	2299	can_see_monsterP (maptile *m, int x, int y, int dir)
2442	{	2300	{
2443	sint16 dx, dy;	2301	sint16 dx, dy;
2444	int
2445	mflags;	2302	int mflags;
2446		2303
2447	if (dir < 0)	2304	if (dir < 0)
2448	return 0; /* exit condition: invalid direction */	2305	return 0; /* exit condition: invalid direction */
2449		2306
2450	dx = x + freearr_x[dir];	2307	dx = x + freearr_x[dir];
…		…
2463	return 0;	2320	return 0;
2464		2321
2465	/* yes, can see. */	2322	/* yes, can see. */
2466	if (dir < 9)	2323	if (dir < 9)
2467	return 1;	2324	return 1;
		2325
2468	return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |	2326	return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2469	can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);	2327	| can_see_monsterP (m, x, y, reduction_dir[dir][1])
		2328	| can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2470	}	2329	}
2471
2472
2473		2330
2474	/*	2331	/*
2475	* can_pick(picker, item): finds out if an object is possible to be	2332	* can_pick(picker, item): finds out if an object is possible to be
2476	* picked up by the picker. Returnes 1 if it can be	2333	* picked up by the picker. Returnes 1 if it can be
2477	* picked up, otherwise 0.	2334	* picked up, otherwise 0.
…		…
2479	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2336	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2480	* core dumps if they do.	2337	* core dumps if they do.
2481	*	2338	*
2482	* Add a check so we can't pick up invisible objects (0.93.8)	2339	* Add a check so we can't pick up invisible objects (0.93.8)
2483	*/	2340	*/
2484
2485	int	2341	int
2486	can_pick (const object *who, const object *item)	2342	can_pick (const object *who, const object *item)
2487	{	2343	{
2488	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2344	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2489	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2345	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2490	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2346	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2491	}	2347	}
2492		2348
2493
2494	/*	2349	/*
2495	* create clone from object to another	2350	* create clone from object to another
2496	*/	2351	*/
2497	object *	2352	object *
2498	object_create_clone (object *asrc)	2353	object_create_clone (object *asrc)
2499	{	2354	{
2500	object *dst = 0, *tmp, *src, *part, *prev, *item;	2355	object *dst = 0, *tmp, *src, *prev, *item;
2501		2356
2502	if (!asrc)	2357	if (!asrc)
2503	return 0;	2358	return 0;
2504		2359
2505	src = asrc;
2506	if (src->head)
2507	src = src->head;	2360	src = asrc->head_ ();
2508		2361
2509	prev = 0;	2362	prev = 0;
2510	for (part = src; part; part = part->more)	2363	for (object *part = src; part; part = part->more)
2511	{	2364	{
2512	tmp = part->clone ();	2365	tmp = part->clone ();
2513	tmp->x -= src->x;	2366	tmp->x -= src->x;
2514	tmp->y -= src->y;	2367	tmp->y -= src->y;
2515		2368
…		…
2517	{	2370	{
2518	dst = tmp;	2371	dst = tmp;
2519	tmp->head = 0;	2372	tmp->head = 0;
2520	}	2373	}
2521	else	2374	else
2522	{
2523	tmp->head = dst;	2375	tmp->head = dst;
2524	}
2525		2376
2526	tmp->more = 0;	2377	tmp->more = 0;
2527		2378
2528	if (prev)	2379	if (prev)
2529	prev->more = tmp;	2380	prev->more = tmp;
…		…
2533		2384
2534	for (item = src->inv; item; item = item->below)	2385	for (item = src->inv; item; item = item->below)
2535	insert_ob_in_ob (object_create_clone (item), dst);	2386	insert_ob_in_ob (object_create_clone (item), dst);
2536		2387
2537	return dst;	2388	return dst;
2538	}
2539
2540	/* GROS - Creates an object using a string representing its content. */
2541	/* Basically, we save the content of the string to a temp file, then call */
2542	/* load_object on it. I admit it is a highly inefficient way to make things, */
2543	/* but it was simple to make and allows reusing the load_object function. */
2544	/* Remember not to use load_object_str in a time-critical situation. */
2545	/* Also remember that multiparts objects are not supported for now. */
2546
2547	object *
2548	load_object_str (const char *obstr)
2549	{
2550	object *op;
2551	char filename[MAX_BUF];
2552
2553	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2554
2555	FILE *tempfile = fopen (filename, "w");
2556
2557	if (tempfile == NULL)
2558	{
2559	LOG (llevError, "Error - Unable to access load object temp file\n");
2560	return NULL;
2561	}
2562
2563	fprintf (tempfile, obstr);
2564	fclose (tempfile);
2565
2566	op = object::create ();
2567
2568	object_thawer thawer (filename);
2569
2570	if (thawer)
2571	load_object (thawer, op, 0);
2572
2573	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2574	CLEAR_FLAG (op, FLAG_REMOVED);
2575
2576	return op;
2577	}	2389	}
2578		2390
2579	/* This returns the first object in who's inventory that	2391	/* This returns the first object in who's inventory that
2580	* has the same type and subtype match.	2392	* has the same type and subtype match.
2581	* returns NULL if no match.	2393	* returns NULL if no match.
2582	*/	2394	*/
2583	object *	2395	object *
2584	find_obj_by_type_subtype (const object *who, int type, int subtype)	2396	find_obj_by_type_subtype (const object *who, int type, int subtype)
2585	{	2397	{
2586	object *tmp;
2587
2588	for (tmp = who->inv; tmp; tmp = tmp->below)	2398	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2589	if (tmp->type == type && tmp->subtype == subtype)	2399	if (tmp->type == type && tmp->subtype == subtype)
2590	return tmp;	2400	return tmp;
2591		2401
2592	return NULL;	2402	return 0;
2593	}	2403	}
2594		2404
2595	/* If ob has a field named key, return the link from the list,	2405	/* If ob has a field named key, return the link from the list,
2596	* otherwise return NULL.	2406	* otherwise return NULL.
2597	*	2407	*
…		…
2599	* do the desired thing.	2409	* do the desired thing.
2600	*/	2410	*/
2601	key_value *	2411	key_value *
2602	get_ob_key_link (const object *ob, const char *key)	2412	get_ob_key_link (const object *ob, const char *key)
2603	{	2413	{
2604	key_value *link;
2605
2606	for (link = ob->key_values; link != NULL; link = link->next)	2414	for (key_value *link = ob->key_values; link; link = link->next)
2607	if (link->key == key)	2415	if (link->key == key)
2608	return link;	2416	return link;
2609		2417
2610	return NULL;	2418	return 0;
2611	}	2419	}
2612		2420
2613	/*	2421	/*
2614	* Returns the value of op has an extra_field for key, or NULL.	2422	* Returns the value of op has an extra_field for key, or NULL.
2615	*	2423	*
…		…
2640	if (link->key == canonical_key)	2448	if (link->key == canonical_key)
2641	return link->value;	2449	return link->value;
2642		2450
2643	return 0;	2451	return 0;
2644	}	2452	}
2645
2646		2453
2647	/*	2454	/*
2648	* Updates the canonical_key in op to value.	2455	* Updates the canonical_key in op to value.
2649	*	2456	*
2650	* canonical_key is a shared string (value doesn't have to be).	2457	* canonical_key is a shared string (value doesn't have to be).
…		…
2655	* Returns TRUE on success.	2462	* Returns TRUE on success.
2656	*/	2463	*/
2657	int	2464	int
2658	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2465	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2659	{	2466	{
2660	key_value *
2661	field = NULL, *last = NULL;	2467	key_value *field = NULL, *last = NULL;
2662		2468
2663	for (field = op->key_values; field != NULL; field = field->next)	2469	for (field = op->key_values; field != NULL; field = field->next)
2664	{	2470	{
2665	if (field->key != canonical_key)	2471	if (field->key != canonical_key)
2666	{	2472	{
…		…
2675	/* Basically, if the archetype has this key set,	2481	/* Basically, if the archetype has this key set,
2676	* we need to store the null value so when we save	2482	* we need to store the null value so when we save
2677	* it, we save the empty value so that when we load,	2483	* it, we save the empty value so that when we load,
2678	* we get this value back again.	2484	* we get this value back again.
2679	*/	2485	*/
2680	if (get_ob_key_link (&op->arch->clone, canonical_key))	2486	if (get_ob_key_link (op->arch, canonical_key))
2681	field->value = 0;	2487	field->value = 0;
2682	else	2488	else
2683	{	2489	{
2684	if (last)	2490	if (last)
2685	last->next = field->next;	2491	last->next = field->next;
…		…
2694	/* IF we get here, key doesn't exist */	2500	/* IF we get here, key doesn't exist */
2695		2501
2696	/* No field, we'll have to add it. */	2502	/* No field, we'll have to add it. */
2697		2503
2698	if (!add_key)	2504	if (!add_key)
2699	{
2700	return FALSE;	2505	return FALSE;
2701	}	2506
2702	/* There isn't any good reason to store a null	2507	/* There isn't any good reason to store a null
2703	* value in the key/value list. If the archetype has	2508	* value in the key/value list. If the archetype has
2704	* this key, then we should also have it, so shouldn't	2509	* this key, then we should also have it, so shouldn't
2705	* be here. If user wants to store empty strings,	2510	* be here. If user wants to store empty strings,
2706	* should pass in ""	2511	* should pass in ""
…		…
2755	}	2560	}
2756	else	2561	else
2757	item = item->env;	2562	item = item->env;
2758	}	2563	}
2759		2564
		2565	const char *
		2566	object::flag_desc (char *desc, int len) const
		2567	{
		2568	char *p = desc;
		2569	bool first = true;
		2570
		2571	*p = 0;
		2572
		2573	for (int i = 0; i < NUM_FLAGS; i++)
		2574	{
		2575	if (len <= 10) // magic constant!
		2576	{
		2577	snprintf (p, len, ",...");
		2578	break;
		2579	}
		2580
		2581	if (flag [i])
		2582	{
		2583	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2584	len -= cnt;
		2585	p += cnt;
		2586	first = false;
		2587	}
		2588	}
		2589
		2590	return desc;
		2591	}
		2592
2760	// return a suitable string describing an objetc in enough detail to find it	2593	// return a suitable string describing an object in enough detail to find it
2761	const char *	2594	const char *
2762	object::debug_desc (char *info) const	2595	object::debug_desc (char *info) const
2763	{	2596	{
		2597	char flagdesc[512];
2764	char info2[256 * 3];	2598	char info2[256 * 4];
2765	char *p = info;	2599	char *p = info;
2766		2600
2767	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2601	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2768	count,	2602	count,
		2603	uuid.c_str (),
2769	&name,	2604	&name,
2770	title ? " " : "",	2605	title ? "\",title:\"" : "",
2771	title ? (const char *)title : "");	2606	title ? (const char *)title : "",
		2607	flag_desc (flagdesc, 512), type);
2772		2608
2773	if (env)	2609	if (!this->flag[FLAG_REMOVED] && env)
2774	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2610	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2775		2611
2776	if (map)	2612	if (map)
2777	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2613	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2778		2614
2779	return info;	2615	return info;
2780	}	2616	}
2781		2617
2782	const char *	2618	const char *
2783	object::debug_desc () const	2619	object::debug_desc () const
2784	{	2620	{
2785	static char info[256 * 3];	2621	static char info[3][256 * 4];
		2622	static int info_idx;
		2623
2786	return debug_desc (info);	2624	return debug_desc (info [++info_idx % 3]);
2787	}	2625	}
2788		2626
		2627	struct region *
		2628	object::region () const
		2629	{
		2630	return map ? map->region (x, y)
		2631	: region::default_region ();
		2632	}
		2633
		2634	const materialtype_t *
		2635	object::dominant_material () const
		2636	{
		2637	if (materialtype_t *mt = name_to_material (materialname))
		2638	return mt;
		2639
		2640	return name_to_material (shstr_unknown);
		2641	}
		2642
		2643	void
		2644	object::open_container (object *new_container)
		2645	{
		2646	if (container == new_container)
		2647	return;
		2648
		2649	if (object *old_container = container)
		2650	{
		2651	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2652	return;
		2653
		2654	#if 0
		2655	// remove the "Close old_container" object.
		2656	if (object *closer = old_container->inv)
		2657	if (closer->type == CLOSE_CON)
		2658	closer->destroy ();
		2659	#endif
		2660
		2661	old_container->flag [FLAG_APPLIED] = 0;
		2662	container = 0;
		2663
		2664	esrv_update_item (UPD_FLAGS, this, old_container);
		2665	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2666	play_sound (sound_find ("chest_close"));
		2667	}
		2668
		2669	if (new_container)
		2670	{
		2671	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2672	return;
		2673
		2674	// TODO: this does not seem to serve any purpose anymore?
		2675	#if 0
		2676	// insert the "Close Container" object.
		2677	if (archetype *closer = new_container->other_arch)
		2678	{
		2679	object *closer = arch_to_object (new_container->other_arch);
		2680	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2681	new_container->insert (closer);
		2682	}
		2683	#endif
		2684
		2685	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2686
		2687	new_container->flag [FLAG_APPLIED] = 1;
		2688	container = new_container;
		2689
		2690	esrv_update_item (UPD_FLAGS, this, new_container);
		2691	esrv_send_inventory (this, new_container);
		2692	play_sound (sound_find ("chest_open"));
		2693	}
		2694	}
		2695
		2696	object *
		2697	object::force_find (const shstr name)
		2698	{
		2699	/* cycle through his inventory to look for the MARK we want to
		2700	* place
		2701	*/
		2702	for (object *tmp = inv; tmp; tmp = tmp->below)
		2703	if (tmp->type == FORCE && tmp->slaying == name)
		2704	return splay (tmp);
		2705
		2706	return 0;
		2707	}
		2708
		2709	void
		2710	object::force_add (const shstr name, int duration)
		2711	{
		2712	if (object *force = force_find (name))
		2713	force->destroy ();
		2714
		2715	object *force = get_archetype (FORCE_NAME);
		2716
		2717	force->slaying = name;
		2718	force->stats.food = 1;
		2719	force->speed_left = -1.f;
		2720
		2721	force->set_speed (duration ? 1.f / duration : 0.f);
		2722	force->flag [FLAG_IS_USED_UP] = true;
		2723	force->flag [FLAG_APPLIED] = true;
		2724
		2725	insert (force);
		2726	}
		2727
		2728	void
		2729	object::play_sound (faceidx sound) const
		2730	{
		2731	if (!sound)
		2732	return;
		2733
		2734	if (flag [FLAG_REMOVED])
		2735	return;
		2736
		2737	if (env)
		2738	{
		2739	if (object *pl = in_player ())
		2740	pl->contr->play_sound (sound);
		2741	}
		2742	else
		2743	map->play_sound (sound, x, y);
		2744	}
		2745

Diff Legend

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