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.76 by root, Thu Dec 21 01:33:49 2006 UTC vs.
Revision 1.211 by root, Mon Apr 21 21:32:32 2008 UTC

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

Diff Legend

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