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.78 by root, Fri Dec 22 16:34:00 2006 UTC vs.
Revision 1.208 by root, Mon Apr 21 06:16:01 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);
		83
		84	seq_next_save = 0;
84		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	/*	556	object &
473	* copy_to first frees everything allocated by the dst object,	557	object::operator =(const object &src)
474	* and then copies the contents of itself into the second
475	* object, allocating what needs to be allocated. Basically, any
476	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
477	* if the first object is freed, the pointers in the new object
478	* will point at garbage.
479	*/
480	void
481	object::copy_to (object *dst)
482	{	558	{
483	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	559	bool is_freed = flag [FLAG_FREED];
484	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	560	bool is_removed = flag [FLAG_REMOVED];
485		561
486	*(object_copy *)dst = *this;	562	*(object_copy *)this = src;
487	*(object_pod *)dst = *this;
488		563
489	if (self || cb)	564	flag [FLAG_FREED] = is_freed;
490	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst));	565	flag [FLAG_REMOVED] = is_removed;
491
492	if (is_freed)
493	SET_FLAG (dst, FLAG_FREED);
494
495	if (is_removed)
496	SET_FLAG (dst, FLAG_REMOVED);
497
498	if (speed < 0)
499	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
500		566
501	/* Copy over key_values, if any. */	567	/* Copy over key_values, if any. */
502	if (key_values)	568	if (src.key_values)
503	{	569	{
504	key_value *tail = 0;	570	key_value *tail = 0;
505	key_value *i;
506
507	dst->key_values = 0;	571	key_values = 0;
508		572
509	for (i = key_values; i; i = i->next)	573	for (key_value *i = src.key_values; i; i = i->next)
510	{	574	{
511	key_value *new_link = new key_value;	575	key_value *new_link = new key_value;
512		576
513	new_link->next = 0;	577	new_link->next = 0;
514	new_link->key = i->key;	578	new_link->key = i->key;
515	new_link->value = i->value;	579	new_link->value = i->value;
516		580
517	/* Try and be clever here, too. */	581	/* Try and be clever here, too. */
518	if (!dst->key_values)	582	if (!key_values)
519	{	583	{
520	dst->key_values = new_link;	584	key_values = new_link;
521	tail = new_link;	585	tail = new_link;
522	}	586	}
523	else	587	else
524	{	588	{
525	tail->next = new_link;	589	tail->next = new_link;
526	tail = new_link;	590	tail = new_link;
527	}	591	}
528	}	592	}
529	}	593	}
		594	}
530		595
531	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 ();
532	}	632	}
533		633
534	object *	634	object *
535	object::clone ()	635	object::clone ()
536	{	636	{
…		…
542	/*	642	/*
543	* 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
544	* 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
545	* 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.
546	*/	646	*/
547
548	void	647	void
549	update_turn_face (object *op)	648	update_turn_face (object *op)
550	{	649	{
551	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	650	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
552	return;	651	return;
		652
553	SET_ANIMATION (op, op->direction);	653	SET_ANIMATION (op, op->direction);
554	update_object (op, UP_OBJ_FACE);	654	update_object (op, UP_OBJ_FACE);
555	}	655	}
556		656
557	/*	657	/*
558	* 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
559	* 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.
560	* 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.
561	*/	661	*/
562	void	662	void
563	update_ob_speed (object *op)	663	object::set_speed (float speed)
564	{	664	{
565	extern int arch_init;	665	if (flag [FLAG_FREED] && speed)
566
567	/* No reason putting the archetypes objects on the speed list,
568	* since they never really need to be updated.
569	*/
570
571	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
572	{	666	{
573	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	667	LOG (llevError, "Object %s is freed but has speed.\n", &name);
574	#ifdef MANY_CORES
575	abort ();
576	#else
577	op->speed = 0;	668	speed = 0;
578	#endif
579	}
580
581	if (arch_init)
582	return;
583
584	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
585	{	669	}
586	/* If already on active list, don't do anything */
587	if (op->active_next || op->active_prev || op == active_objects)
588	return;
589		670
590	/* process_events() expects us to insert the object at the beginning	671	this->speed = speed;
591	* of the list. */
592	op->active_next = active_objects;
593		672
594	if (op->active_next != NULL)	673	if (has_active_speed ())
595	op->active_next->active_prev = op;	674	activate ();
596
597	active_objects = op;
598	}
599	else	675	else
600	{	676	deactivate ();
601	/* If not on the active list, nothing needs to be done */
602	if (!op->active_next && !op->active_prev && op != active_objects)
603	return;
604
605	if (op->active_prev == NULL)
606	{
607	active_objects = op->active_next;
608
609	if (op->active_next != NULL)
610	op->active_next->active_prev = NULL;
611	}
612	else
613	{
614	op->active_prev->active_next = op->active_next;
615
616	if (op->active_next)
617	op->active_next->active_prev = op->active_prev;
618	}
619
620	op->active_next = NULL;
621	op->active_prev = NULL;
622	}
623	}
624
625	/* This function removes object 'op' from the list of active
626	* objects.
627	* This should only be used for style maps or other such
628	* reference maps where you don't want an object that isn't
629	* in play chewing up cpu time getting processed.
630	* The reverse of this is to call update_ob_speed, which
631	* will do the right thing based on the speed of the object.
632	*/
633	void
634	remove_from_active_list (object *op)
635	{
636	/* If not on the active list, nothing needs to be done */
637	if (!op->active_next && !op->active_prev && op != active_objects)
638	return;
639
640	if (op->active_prev == NULL)
641	{
642	active_objects = op->active_next;
643	if (op->active_next != NULL)
644	op->active_next->active_prev = NULL;
645	}
646	else
647	{
648	op->active_prev->active_next = op->active_next;
649	if (op->active_next)
650	op->active_next->active_prev = op->active_prev;
651	}
652	op->active_next = NULL;
653	op->active_prev = NULL;
654	}	677	}
655		678
656	/*	679	/*
657	* update_object() updates the the map.	680	* update_object() updates the the map.
658	* It takes into account invisible objects (and represent squares covered	681	* It takes into account invisible objects (and represent squares covered
…		…
671	* UP_OBJ_FACE: only the objects face has changed.	694	* UP_OBJ_FACE: only the objects face has changed.
672	*/	695	*/
673	void	696	void
674	update_object (object *op, int action)	697	update_object (object *op, int action)
675	{	698	{
676	MoveType move_on, move_off, move_block, move_slow;
677
678	if (op == NULL)	699	if (op == NULL)
679	{	700	{
680	/* this should never happen */	701	/* this should never happen */
681	LOG (llevDebug, "update_object() called for NULL object.\n");	702	LOG (llevDebug, "update_object() called for NULL object.\n");
682	return;	703	return;
…		…
695	*/	716	*/
696	if (!op->map || op->map->in_memory == MAP_SAVING)	717	if (!op->map || op->map->in_memory == MAP_SAVING)
697	return;	718	return;
698		719
699	/* make sure the object is within map boundaries */	720	/* make sure the object is within map boundaries */
700	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)
701	{	722	{
702	LOG (llevError, "update_object() called for object out of map!\n");	723	LOG (llevError, "update_object() called for object out of map!\n");
703	#ifdef MANY_CORES	724	#ifdef MANY_CORES
704	abort ();	725	abort ();
705	#endif	726	#endif
706	return;	727	return;
707	}	728	}
708		729
709	mapspace &m = op->ms ();	730	mapspace &m = op->ms ();
710		731
711	if (m.flags_ & P_NEED_UPDATE)	732	if (!(m.flags_ & P_UPTODATE))
712	/* nop */;	733	/* nop */;
713	else if (action == UP_OBJ_INSERT)	734	else if (action == UP_OBJ_INSERT)
714	{	735	{
715	// this is likely overkill, TODO: revisit (schmorp)	736	// this is likely overkill, TODO: revisit (schmorp)
716	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	737	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
…		…
725	/* 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
726	* to have move_allow right now.	747	* to have move_allow right now.
727	*/	748	*/
728	|| ((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
729	|| 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)
730	m.flags_ = P_NEED_UPDATE;	751	m.flags_ = 0;
731	}	752	}
732	/* if the object is being removed, we can't make intelligent	753	/* if the object is being removed, we can't make intelligent
733	* decisions, because remove_ob can't really pass the object	754	* decisions, because remove_ob can't really pass the object
734	* that is being removed.	755	* that is being removed.
735	*/	756	*/
736	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	757	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
737	m.flags_ = P_NEED_UPDATE;	758	m.flags_ = 0;
738	else if (action == UP_OBJ_FACE)	759	else if (action == UP_OBJ_FACE)
739	/* Nothing to do for that case */ ;	760	/* Nothing to do for that case */ ;
740	else	761	else
741	LOG (llevError, "update_object called with invalid action: %d\n", action);	762	LOG (llevError, "update_object called with invalid action: %d\n", action);
742		763
743	if (op->more)	764	if (op->more)
744	update_object (op->more, action);	765	update_object (op->more, action);
745	}	766	}
746		767
747	object::vector object::mortals;
748	object::vector object::objects; // not yet used
749	object *object::first;
750
751	void object::free_mortals ()
752	{
753	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
754	if ((*i)->refcnt)
755	++i; // further delay freeing
756	else
757	{
758	delete *i;
759	mortals.erase (i);
760	}
761	}
762
763	object::object ()	768	object::object ()
764	{	769	{
765	SET_FLAG (this, FLAG_REMOVED);	770	SET_FLAG (this, FLAG_REMOVED);
766		771
767	expmul = 1.0;	772	expmul = 1.0;
768	face = blank_face;	773	face = blank_face;
769	}	774	}
770		775
771	object::~object ()	776	object::~object ()
772	{	777	{
		778	unlink ();
		779
773	free_key_values (this);	780	free_key_values (this);
774	}	781	}
775		782
		783	static int object_count;
		784
776	void object::link ()	785	void object::link ()
777	{	786	{
		787	assert (!index);//D
		788	uuid = UUID::gen ();
778	count = ++ob_count;	789	count = ++object_count;
779	uuid = gen_uuid ();
780		790
781	prev = 0;	791	refcnt_inc ();
782	next = object::first;	792	objects.insert (this);
783
784	if (object::first)
785	object::first->prev = this;
786
787	object::first = this;
788	}	793	}
789		794
790	void object::unlink ()	795	void object::unlink ()
791	{	796	{
792	if (this == object::first)	797	if (!index)
793	object::first = next;	798	return;
794		799
795	/* Remove this object from the list of used objects */	800	objects.erase (this);
796	if (prev) prev->next = next;	801	refcnt_dec ();
797	if (next) next->prev = prev;	802	}
798		803
799	prev = 0;	804	void
800	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	}
801	}	909	}
802		910
803	object *object::create ()	911	object *object::create ()
804	{	912	{
805	object *op = new object;	913	object *op = new object;
806	op->link ();	914	op->link ();
807	return op;	915	return op;
808	}	916	}
809		917
810	/*	918	void
811	* free_object() frees everything allocated by an object, removes	919	object::do_destroy ()
812	* it from the list of used objects, and puts it on the list of
813	* free objects. The IS_FREED() flag is set in the object.
814	* The object must have been removed by remove_ob() first for
815	* this function to succeed.
816	*
817	* If destroy_inventory is set, free inventory as well. Else drop items in
818	* inventory to the ground.
819	*/
820	void object::destroy (bool destroy_inventory)
821	{	920	{
822	if (QUERY_FLAG (this, FLAG_FREED))	921	attachable::do_destroy ();
823	return;
824		922
825	if (QUERY_FLAG (this, FLAG_FRIENDLY))	923	if (flag [FLAG_IS_LINKED])
		924	remove_button_link (this);
		925
		926	if (flag [FLAG_FRIENDLY])
826	remove_friendly_object (this);	927	remove_friendly_object (this);
827		928
828	if (!QUERY_FLAG (this, FLAG_REMOVED))	929	if (!flag [FLAG_REMOVED])
829	remove ();	930	remove ();
830		931
831	SET_FLAG (this, FLAG_FREED);	932	destroy_inv (true);
832		933
833	if (more)	934	deactivate ();
834	{	935	unlink ();
835	more->destroy (destroy_inventory);
836	more = 0;
837	}
838		936
839	if (inv)	937	flag [FLAG_FREED] = 1;
840	{
841	/* Only if the space blocks everything do we not process -
842	* if some form of movement is allowed, let objects
843	* drop on that space.
844	*/
845	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
846	{
847	object *op = inv;
848
849	while (op)
850	{
851	object *tmp = op->below;
852	op->destroy (destroy_inventory);
853	op = tmp;
854	}
855	}
856	else
857	{ /* Put objects in inventory onto this space */
858	object *op = inv;
859
860	while (op)
861	{
862	object *tmp = op->below;
863
864	op->remove ();
865
866	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
867	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
868	op->destroy ();
869	else
870	{
871	op->x = x;
872	op->y = y;
873	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
874	}
875
876	op = tmp;
877	}
878	}
879	}
880		938
881	// hack to ensure that freed objects still have a valid map	939	// hack to ensure that freed objects still have a valid map
882	{	940	{
883	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
884		942
885	if (!freed_map)	943	if (!freed_map)
886	{	944	{
887	freed_map = new maptile;	945	freed_map = new maptile;
888		946
		947	freed_map->path = "<freed objects map>";
889	freed_map->name = "/internal/freed_objects_map";	948	freed_map->name = "/internal/freed_objects_map";
890	freed_map->width = 3;	949	freed_map->width = 3;
891	freed_map->height = 3;	950	freed_map->height = 3;
		951	freed_map->nodrop = 1;
892		952
893	freed_map->allocate ();	953	freed_map->alloc ();
		954	freed_map->in_memory = MAP_ACTIVE;
894	}	955	}
895		956
896	map = freed_map;	957	map = freed_map;
897	x = 1;	958	x = 1;
898	y = 1;	959	y = 1;
899	}	960	}
900		961
		962	if (more)
		963	{
		964	more->destroy ();
		965	more = 0;
		966	}
		967
		968	head = 0;
		969
901	// clear those pointers that likely might have circular references to us	970	// clear those pointers that likely might cause circular references
902	owner = 0;	971	owner = 0;
903	enemy = 0;	972	enemy = 0;
904	attacked_by = 0;	973	attacked_by = 0;
905		974	current_weapon = 0;
906	// only relevant for players(?), but make sure of it anyways
907	contr = 0;
908
909	/* Remove object from the active list */
910	speed = 0;
911	update_ob_speed (this);
912
913	unlink ();
914
915	mortals.push_back (this);
916	}	975	}
917		976
918	/*
919	* sub_weight() recursively (outwards) subtracts a number from the
920	* weight of an object (and what is carried by it's environment(s)).
921	*/
922	void	977	void
923	sub_weight (object *op, signed long weight)	978	object::destroy (bool destroy_inventory)
924	{	979	{
925	while (op != NULL)	980	if (destroyed ())
926	{	981	return;
927	if (op->type == CONTAINER)
928	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
929		982
930	op->carrying -= weight;	983	if (destroy_inventory)
931	op = op->env;	984	destroy_inv (false);
932	}	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 ();
933	}	993	}
934		994
935	/* op->remove ():	995	/* op->remove ():
936	* 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
937	* 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
938	* object will have no environment. If the object previously had an	998	* object will have no environment. If the object previously had an
939	* environment, the x and y coordinates will be updated to	999	* environment, the x and y coordinates will be updated to
940	* the previous environment.	1000	* the previous environment.
941	* Beware: This function is called from the editor as well!
942	*/	1001	*/
943	void	1002	void
944	object::remove ()	1003	object::do_remove ()
945	{	1004	{
946	object *tmp, *last = 0;	1005	object *tmp, *last = 0;
947	object *otmp;	1006	object *otmp;
948		1007
949	int check_walk_off;
950
951	if (QUERY_FLAG (this, FLAG_REMOVED))	1008	if (QUERY_FLAG (this, FLAG_REMOVED))
952	return;	1009	return;
953		1010
954	SET_FLAG (this, FLAG_REMOVED);	1011	SET_FLAG (this, FLAG_REMOVED);
		1012	INVOKE_OBJECT (REMOVE, this);
955		1013
956	if (more)	1014	if (more)
957	more->remove ();	1015	more->remove ();
958		1016
959	/*	1017	/*
960	* In this case, the object to be removed is in someones	1018	* In this case, the object to be removed is in someones
961	* inventory.	1019	* inventory.
962	*/	1020	*/
963	if (env)	1021	if (env)
964	{	1022	{
		1023	adjust_weight (env, -total_weight ());
		1024
		1025	*(above ? &above->below : &env->inv) = below;
		1026
965	if (nrof)	1027	if (below)
966	sub_weight (env, weight * nrof);	1028	below->above = above;
967	else	1029
968	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;
969		1040
970	/* 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
971	* made to players inventory. If set, avoiding the call	1042	* made to players inventory. If set, avoiding the call
972	* to save cpu time.	1043	* to save cpu time.
973	*/	1044	*/
974	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))
975	otmp->update_stats ();	1046	otmp->update_stats ();
976
977	if (above != NULL)
978	above->below = below;
979	else
980	env->inv = below;
981
982	if (below != NULL)
983	below->above = above;
984
985	/* we set up values so that it could be inserted into
986	* the map, but we don't actually do that - it is up
987	* to the caller to decide what we want to do.
988	*/
989	x = env->x, y = env->y;
990	map = env->map;
991	above = 0, below = 0;
992	env = 0;
993	}	1047	}
994	else if (map)	1048	else if (map)
995	{	1049	{
996	/* Re did the following section of code - it looks like it had	1050	if (type == PLAYER)
997	* lots of logic for things we no longer care about
998	*/	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 ();
999		1064
1000	/* link the object above us */	1065	/* link the object above us */
1001	if (above)	1066	if (above)
1002	above->below = below;	1067	above->below = below;
1003	else	1068	else
1004	map->at (x, y).top = below; /* we were top, set new top */	1069	ms.top = below; /* we were top, set new top */
1005		1070
1006	/* Relink the object below us, if there is one */	1071	/* Relink the object below us, if there is one */
1007	if (below)	1072	if (below)
1008	below->above = above;	1073	below->above = above;
1009	else	1074	else
…		…
1011	/* 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
1012	* use translated coordinates in case some oddness with map tiling is	1077	* use translated coordinates in case some oddness with map tiling is
1013	* evident	1078	* evident
1014	*/	1079	*/
1015	if (GET_MAP_OB (map, x, y) != this)	1080	if (GET_MAP_OB (map, x, y) != this)
1016	{
1017	char *dump = dump_object (this);
1018	LOG (llevError,
1019	"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 ());
1020	free (dump);
1021	dump = dump_object (GET_MAP_OB (map, x, y));
1022	LOG (llevError, "%s\n", dump);
1023	free (dump);
1024	}
1025		1082
1026	map->at (x, y).bottom = above; /* goes on above it. */	1083	ms.bot = above; /* goes on above it. */
1027	}	1084	}
1028		1085
1029	above = 0;	1086	above = 0;
1030	below = 0;	1087	below = 0;
1031		1088
1032	if (map->in_memory == MAP_SAVING)	1089	if (map->in_memory == MAP_SAVING)
1033	return;	1090	return;
1034		1091
1035	check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);	1092	int check_walk_off = !flag [FLAG_NO_APPLY];
1036		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
1037	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	1106	for (tmp = ms.bot; tmp; tmp = tmp->above)
1038	{	1107	{
1039	/* 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
1040	* being removed.	1109	* being removed.
1041	*/	1110	*/
1042		1111
1043	if (tmp->type == PLAYER && tmp != this)
1044	{
1045	/* If a container that the player is currently using somehow gets
1046	* removed (most likely destroyed), update the player view
1047	* appropriately.
1048	*/
1049	if (tmp->container == this)
1050	{
1051	CLEAR_FLAG (this, FLAG_APPLIED);
1052	tmp->container = 0;
1053	}
1054
1055	tmp->contr->ns->floorbox_update ();
1056	}
1057
1058	/* See if player moving off should effect something */	1112	/* See if object moving off should effect something */
1059	if (check_walk_off	1113	if (check_walk_off
1060	&& ((move_type & tmp->move_off)	1114	&& ((move_type & tmp->move_off)
1061	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1115	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1062	{	1116	{
1063	move_apply (tmp, this, 0);	1117	move_apply (tmp, this, 0);
1064		1118
1065	if (destroyed ())	1119	if (destroyed ())
1066	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 ());
1067	}	1121	}
1068		1122
1069	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1070
1071	if (tmp->above == tmp)
1072	tmp->above = 0;
1073
1074	last = tmp;	1123	last = tmp;
1075	}	1124	}
1076		1125
1077	/* 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?
1078	if (!last)	1128	if (!last)
1079	map->at (x, y).flags_ = P_NEED_UPDATE;	1129	map->at (x, y).flags_ = 0;
1080	else	1130	else
1081	update_object (last, UP_OBJ_REMOVE);	1131	update_object (last, UP_OBJ_REMOVE);
1082		1132
1083	if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)	1133	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1084	update_all_los (map, x, y);	1134	update_all_los (map, x, y);
1085	}	1135	}
1086	}	1136	}
1087		1137
1088	/*	1138	/*
…		…
1097	merge_ob (object *op, object *top)	1147	merge_ob (object *op, object *top)
1098	{	1148	{
1099	if (!op->nrof)	1149	if (!op->nrof)
1100	return 0;	1150	return 0;
1101		1151
1102	if (top == NULL)	1152	if (!top)
1103	for (top = op; top != NULL && top->above != NULL; top = top->above);	1153	for (top = op; top && top->above; top = top->above)
		1154	;
1104		1155
1105	for (; top != NULL; top = top->below)	1156	for (; top; top = top->below)
1106	{	1157	{
1107	if (top == op)	1158	if (top == op)
1108	continue;	1159	continue;
1109		1160
1110	if (object::can_merge (op, top))	1161	if (object::can_merge (op, top))
…		…
1119	}	1170	}
1120		1171
1121	return 0;	1172	return 0;
1122	}	1173	}
1123		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
1124	/*	1198	/*
1125	* 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
1126	* job preparing multi-part monsters	1200	* job preparing multi-part monsters.
1127	*/	1201	*/
1128	object *	1202	object *
1129	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)
1130	{	1204	{
1131	object *tmp;
1132
1133	if (op->head)
1134	op = op->head;
1135
1136	for (tmp = op; tmp; tmp = tmp->more)	1205	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1137	{	1206	{
1138	tmp->x = x + tmp->arch->clone.x;	1207	tmp->x = x + tmp->arch->x;
1139	tmp->y = y + tmp->arch->clone.y;	1208	tmp->y = y + tmp->arch->y;
1140	}	1209	}
1141		1210
1142	return insert_ob_in_map (op, m, originator, flag);	1211	return insert_ob_in_map (op, m, originator, flag);
1143	}	1212	}
1144		1213
…		…
1160	* Return value:	1229	* Return value:
1161	* new object if 'op' was merged with other object	1230	* new object if 'op' was merged with other object
1162	* NULL if 'op' was destroyed	1231	* NULL if 'op' was destroyed
1163	* just 'op' otherwise	1232	* just 'op' otherwise
1164	*/	1233	*/
1165
1166	object *	1234	object *
1167	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)
1168	{	1236	{
		1237	assert (!op->flag [FLAG_FREED]);
		1238
1169	object *tmp, *top, *floor = NULL;	1239	object *top, *floor = NULL;
1170	sint16 x, y;
1171		1240
1172	if (QUERY_FLAG (op, FLAG_FREED))	1241	op->remove ();
1173	{
1174	LOG (llevError, "Trying to insert freed object!\n");
1175	return NULL;
1176	}
1177
1178	if (m == NULL)
1179	{
1180	char *dump = dump_object (op);
1181	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1182	free (dump);
1183	return op;
1184	}
1185
1186	if (out_of_map (m, op->x, op->y))
1187	{
1188	char *dump = dump_object (op);
1189	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1190	#ifdef MANY_CORES
1191	/* Better to catch this here, as otherwise the next use of this object
1192	* is likely to cause a crash. Better to find out where it is getting
1193	* improperly inserted.
1194	*/
1195	abort ();
1196	#endif
1197	free (dump);
1198	return op;
1199	}
1200
1201	if (!QUERY_FLAG (op, FLAG_REMOVED))
1202	{
1203	char *dump = dump_object (op);
1204	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1205	free (dump);
1206	return op;
1207	}
1208
1209	if (op->more != NULL)
1210	{
1211	/* The part may be on a different map. */
1212
1213	object *more = op->more;
1214
1215	/* We really need the caller to normalize coordinates - if
1216	* we set the map, that doesn't work if the location is within
1217	* a map and this is straddling an edge. So only if coordinate
1218	* is clear wrong do we normalize it.
1219	*/
1220	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1221	more->map = get_map_from_coord (m, &more->x, &more->y);
1222	else if (!more->map)
1223	{
1224	/* For backwards compatibility - when not dealing with tiled maps,
1225	* more->map should always point to the parent.
1226	*/
1227	more->map = m;
1228	}
1229
1230	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1231	{
1232	if (!op->head)
1233	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1234
1235	return NULL;
1236	}
1237	}
1238
1239	CLEAR_FLAG (op, FLAG_REMOVED);
1240		1242
1241	/* Ideally, the caller figures this out. However, it complicates a lot	1243	/* Ideally, the caller figures this out. However, it complicates a lot
1242	* 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
1243	* need extra work	1245	* need extra work
1244	*/	1246	*/
1245	op->map = get_map_from_coord (m, &op->x, &op->y);	1247	if (!xy_normalise (m, op->x, op->y))
1246	x = op->x;	1248	{
1247	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 ();
1248		1261
1249	/* this has to be done after we translate the coordinates.	1262	/* this has to be done after we translate the coordinates.
1250	*/	1263	*/
1251	if (op->nrof && !(flag & INS_NO_MERGE))	1264	if (op->nrof && !(flag & INS_NO_MERGE))
1252	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1265	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1253	if (object::can_merge (op, tmp))	1266	if (object::can_merge (op, tmp))
1254	{	1267	{
1255	op->nrof += tmp->nrof;	1268	op->nrof += tmp->nrof;
1256	tmp->destroy ();	1269	tmp->destroy (1);
1257	}	1270	}
1258		1271
1259	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 */
1260	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1273	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1261		1274
…		…
1274	op->below = originator->below;	1287	op->below = originator->below;
1275		1288
1276	if (op->below)	1289	if (op->below)
1277	op->below->above = op;	1290	op->below->above = op;
1278	else	1291	else
1279	op->ms ().bottom = op;	1292	ms.bot = op;
1280		1293
1281	/* since *below* originator, no need to update top */	1294	/* since *below* originator, no need to update top */
1282	originator->below = op;	1295	originator->below = op;
1283	}	1296	}
1284	else	1297	else
1285	{	1298	{
		1299	top = ms.bot;
		1300
1286	/* If there are other objects, then */	1301	/* If there are other objects, then */
1287	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1302	if (top)
1288	{	1303	{
1289	object *last = NULL;	1304	object *last = 0;
1290		1305
1291	/*	1306	/*
1292	* 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.
1293	* We've already dealt with merging if appropriate.	1308	* We've already dealt with merging if appropriate.
1294	* 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
…		…
1298	* 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
1299	* 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
1300	* 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
1301	* that flying non pickable objects are spell objects.	1316	* that flying non pickable objects are spell objects.
1302	*/	1317	*/
1303		1318	for (top = ms.bot; top; top = top->above)
1304	while (top != NULL)
1305	{	1319	{
1306	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))
1307	floor = top;	1321	floor = top;
1308		1322
1309	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))
…		…
1312	top = top->below;	1326	top = top->below;
1313	break;	1327	break;
1314	}	1328	}
1315		1329
1316	last = top;	1330	last = top;
1317	top = top->above;
1318	}	1331	}
1319		1332
1320	/* 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 */
1321	top = last;	1334	top = last;
1322		1335
…		…
1324	* looks like instead of lots of conditions here.	1337	* looks like instead of lots of conditions here.
1325	* makes things faster, and effectively the same result.	1338	* makes things faster, and effectively the same result.
1326	*/	1339	*/
1327		1340
1328	/* Have object 'fall below' other objects that block view.	1341	/* Have object 'fall below' other objects that block view.
1329	* Unless those objects are exits, type 66	1342	* Unless those objects are exits.
1330	* If INS_ON_TOP is used, don't do this processing	1343	* If INS_ON_TOP is used, don't do this processing
1331	* Need to find the object that in fact blocks view, otherwise	1344	* Need to find the object that in fact blocks view, otherwise
1332	* stacking is a bit odd.	1345	* stacking is a bit odd.
1333	*/	1346	*/
1334	if (!(flag & INS_ON_TOP) &&	1347	if (!(flag & INS_ON_TOP)
1335	(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))
1336	{	1350	{
1337	for (last = top; last != floor; last = last->below)	1351	for (last = top; last != floor; last = last->below)
1338	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1352	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1339	break;	1353	break;
		1354
1340	/* Check to see if we found the object that blocks view,	1355	/* Check to see if we found the object that blocks view,
1341	* 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
1342	* we can get inserted below this one, which requires we	1357	* we can get inserted below this one, which requires we
1343	* set top to the object below us.	1358	* set top to the object below us.
1344	*/	1359	*/
1345	if (last && last->below && last != floor)	1360	if (last && last->below && last != floor)
1346	top = last->below;	1361	top = last->below;
1347	}	1362	}
1348	} /* If objects on this space */	1363	} /* If objects on this space */
1349		1364
1350	if (flag & INS_MAP_LOAD)
1351	top = GET_MAP_TOP (op->map, op->x, op->y);
1352
1353	if (flag & INS_ABOVE_FLOOR_ONLY)	1365	if (flag & INS_ABOVE_FLOOR_ONLY)
1354	top = floor;	1366	top = floor;
1355		1367
1356	/* 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.
1357	*/	1369	*/
1358		1370
1359	/* First object on this space */	1371	/* First object on this space */
1360	if (!top)	1372	if (!top)
1361	{	1373	{
1362	op->above = GET_MAP_OB (op->map, op->x, op->y);	1374	op->above = ms.bot;
1363		1375
1364	if (op->above)	1376	if (op->above)
1365	op->above->below = op;	1377	op->above->below = op;
1366		1378
1367	op->below = NULL;	1379	op->below = 0;
1368	op->ms ().bottom = op;	1380	ms.bot = op;
1369	}	1381	}
1370	else	1382	else
1371	{ /* get inserted into the stack above top */	1383	{ /* get inserted into the stack above top */
1372	op->above = top->above;	1384	op->above = top->above;
1373		1385
…		…
1376		1388
1377	op->below = top;	1389	op->below = top;
1378	top->above = op;	1390	top->above = op;
1379	}	1391	}
1380		1392
1381	if (op->above == NULL)	1393	if (!op->above)
1382	op->ms ().top = op;	1394	ms.top = op;
1383	} /* else not INS_BELOW_ORIGINATOR */	1395	} /* else not INS_BELOW_ORIGINATOR */
1384		1396
1385	if (op->type == PLAYER)	1397	if (op->type == PLAYER)
		1398	{
1386	op->contr->do_los = 1;	1399	op->contr->do_los = 1;
		1400	++op->map->players;
		1401	op->map->touch ();
		1402	}
1387		1403
1388	/* If we have a floor, we know the player, if any, will be above	1404	op->map->dirty = true;
1389	* it, so save a few ticks and start from there.	1405
1390	*/
1391	if (!(flag & INS_MAP_LOAD))
1392	if (object *pl = op->ms ().player ())	1406	if (object *pl = ms.player ())
1393	pl->contr->ns->floorbox_update ();	1407	pl->contr->ns->floorbox_update ();
1394		1408
1395	/* If this object glows, it may affect lighting conditions that are	1409	/* If this object glows, it may affect lighting conditions that are
1396	* 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
1397	* 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
1398	* on the map will get recalculated. The players could very well	1412	* on the map will get recalculated. The players could very well
1399	* 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 -
1400	* this should get redone to only look for players within range,	1414	* this should get redone to only look for players within range,
1401	* or just updating the P_NEED_UPDATE for spaces within this area	1415	* or just updating the P_UPTODATE for spaces within this area
1402	* of effect may be sufficient.	1416	* of effect may be sufficient.
1403	*/	1417	*/
1404	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1418	if (op->map->darkness && (op->glow_radius != 0))
1405	update_all_los (op->map, op->x, op->y);	1419	update_all_los (op->map, op->x, op->y);
1406		1420
1407	/* updates flags (blocked, alive, no magic, etc) for this map space */	1421	/* updates flags (blocked, alive, no magic, etc) for this map space */
1408	update_object (op, UP_OBJ_INSERT);	1422	update_object (op, UP_OBJ_INSERT);
		1423
		1424	INVOKE_OBJECT (INSERT, op);
1409		1425
1410	/* 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,
1411	* we want to have floorbox_update called before calling this.	1427	* we want to have floorbox_update called before calling this.
1412	*	1428	*
1413	* check_move_on() must be after this because code called from	1429	* check_move_on() must be after this because code called from
…		…
1415	* blocked() and wall() work properly), and these flags are updated by	1431	* blocked() and wall() work properly), and these flags are updated by
1416	* update_object().	1432	* update_object().
1417	*/	1433	*/
1418		1434
1419	/* 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 */
1420	if (!(flag & INS_NO_WALK_ON) && !op->head)	1436	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1421	{	1437	{
1422	if (check_move_on (op, originator))	1438	if (check_move_on (op, originator))
1423	return NULL;	1439	return 0;
1424		1440
1425	/* 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
1426	* walk on's.	1442	* walk on's.
1427	*/	1443	*/
1428	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1444	for (object *tmp = op->more; tmp; tmp = tmp->more)
1429	if (check_move_on (tmp, originator))	1445	if (check_move_on (tmp, originator))
1430	return NULL;	1446	return 0;
1431	}	1447	}
1432		1448
1433	return op;	1449	return op;
1434	}	1450	}
1435		1451
…		…
1438	* 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.
1439	*/	1455	*/
1440	void	1456	void
1441	replace_insert_ob_in_map (const char *arch_string, object *op)	1457	replace_insert_ob_in_map (const char *arch_string, object *op)
1442	{	1458	{
1443	object *tmp, *tmp1;
1444
1445	/* first search for itself and remove any old instances */	1459	/* first search for itself and remove any old instances */
1446		1460
1447	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)
1448	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1462	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1449	tmp->destroy ();	1463	tmp->destroy (1);
1450		1464
1451	tmp1 = arch_to_object (archetype::find (arch_string));	1465	object *tmp = arch_to_object (archetype::find (arch_string));
1452		1466
1453	tmp1->x = op->x;	1467	tmp->x = op->x;
1454	tmp1->y = op->y;	1468	tmp->y = op->y;
		1469
1455	insert_ob_in_map (tmp1, op->map, op, 0);	1470	insert_ob_in_map (tmp, op->map, op, 0);
		1471	}
		1472
		1473	object *
		1474	object::insert_at (object *where, object *originator, int flags)
		1475	{
		1476	if (where->env)
		1477	return where->env->insert (this);
		1478	else
		1479	return where->map->insert (this, where->x, where->y, originator, flags);
1456	}	1480	}
1457		1481
1458	/*	1482	/*
1459	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1483	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1460	* is returned contains nr objects, and the remaining parts contains	1484	* is returned contains nr objects, and the remaining parts contains
1461	* the rest (or is removed and freed if that number is 0).	1485	* the rest (or is removed and freed if that number is 0).
1462	* On failure, NULL is returned, and the reason put into the	1486	* On failure, NULL is returned, and the reason put into the
1463	* global static errmsg array.	1487	* global static errmsg array.
1464	*/	1488	*/
		1489	object *
		1490	object::split_nr (sint32 nr)
		1491	{
		1492	if (nrof < nr)
		1493	return 0;
		1494	else if (nrof == nr)
		1495	{
		1496	remove ();
		1497	return this;
		1498	}
		1499	else
		1500	{
		1501	decrease_nr (nr);
1465		1502
		1503	object *op = object_create_clone (this);
		1504	op->nrof = nr;
		1505	return op;
		1506	}
		1507	}
		1508
		1509	//TODO: remove, but semantics differs from split_nr
1466	object *	1510	object *
1467	get_split_ob (object *orig_ob, uint32 nr)	1511	get_split_ob (object *orig_ob, uint32 nr)
1468	{	1512	{
1469	object *newob;
1470	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1471
1472	if (orig_ob->nrof < nr)	1513	if (orig_ob->nrof < nr)
1473	{	1514	{
1474	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);	1515	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1475	return NULL;	1516	return 0;
1476	}
1477
1478	newob = object_create_clone (orig_ob);
1479
1480	if ((orig_ob->nrof -= nr) < 1)
1481	orig_ob->destroy (1);
1482	else if (!is_removed)
1483	{	1517	}
1484	if (orig_ob->env != NULL)	1518
1485	sub_weight (orig_ob->env, orig_ob->weight * nr);	1519	return orig_ob->split_nr (nr);
1486	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)	1520	}
		1521
		1522	// find player who can see this object
		1523	static object *
		1524	visible_to (object *op)
		1525	{
		1526	if (!op->flag [FLAG_REMOVED])
		1527	{
		1528	// see if we are in a container of sorts
		1529	if (object *env = op->env)
1487	{	1530	{
1488	strcpy (errmsg, "Tried to split object whose map is not in memory.");	1531	// the player inventory itself is always visible
1489	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");	1532	if (env->type == PLAYER)
1490	return NULL;	1533	return env;
		1534
		1535	// else a player could have our env open
		1536	env = env->outer_env ();
		1537
		1538	// the player itself is always on a map, so we will find him here
		1539	// even if our inv is in a player.
		1540	if (env->is_on_map ())
		1541	if (object *pl = env->ms ().player ())
		1542	if (pl->container == op->env)
		1543	return pl;
1491	}	1544	}
		1545	else
		1546	{
		1547	// maybe there is a player standing on the same mapspace
		1548	if (object *pl = env->ms ().player ())
		1549	return pl;
		1550	}
1492	}	1551	}
1493		1552
1494	newob->nrof = nr;
1495
1496	return newob;	1553	return 0;
1497	}	1554	}
1498		1555
1499	/*	1556	/*
1500	* decrease_ob_nr(object, number) decreases a specified number from	1557	* decrease_ob_nr(object, number) decreases a specified number from
1501	* the amount of an object. If the amount reaches 0, the object	1558	* the amount of an object. If the amount reaches 0, the object
1502	* is subsequently removed and freed.	1559	* is subsequently removed and freed.
1503	*	1560	*
1504	* Return value: 'op' if something is left, NULL if the amount reached 0	1561	* Return value: 'op' if something is left, NULL if the amount reached 0
1505	*/	1562	*/
		1563	bool
		1564	object::decrease_nr (sint32 nr)
		1565	{
		1566	nr = min (nr, nrof);
1506		1567
		1568	if (!nr)
		1569	return 1;
		1570
		1571	nrof -= nr;
		1572
		1573	object *visible = visible_to (this);
		1574
		1575	if (nrof)
		1576	{
		1577	adjust_weight (env, -weight * nr); // carrying == 0
		1578
		1579	if (visible)
		1580	esrv_send_item (visible, this);
		1581
		1582	return 1;
		1583	}
		1584	else
		1585	{
		1586	if (visible)
		1587	esrv_del_item (visible->contr, count);
		1588
		1589	this->destroy (1);
		1590	return 0;
		1591	}
		1592	}
		1593
		1594	//TODO: remove
1507	object *	1595	object *
1508	decrease_ob_nr (object *op, uint32 i)	1596	decrease_ob_nr (object *op, uint32 i)
1509	{	1597	{
1510	object *tmp;	1598	return op->decrease_nr (i) ? op : 0;
1511	player *pl;
1512
1513	if (i == 0) /* objects with op->nrof require this check */
1514	return op;
1515
1516	if (i > op->nrof)
1517	i = op->nrof;
1518
1519	if (QUERY_FLAG (op, FLAG_REMOVED))
1520	op->nrof -= i;
1521	else if (op->env)
1522	{
1523	/* is this object in the players inventory, or sub container
1524	* therein?
1525	*/
1526	tmp = op->in_player ();
1527	/* nope. Is this a container the player has opened?
1528	* If so, set tmp to that player.
1529	* IMO, searching through all the players will mostly
1530	* likely be quicker than following op->env to the map,
1531	* and then searching the map for a player.
1532	*/
1533	if (!tmp)
1534	{
1535	for (pl = first_player; pl; pl = pl->next)
1536	if (pl->ob->container == op->env)
1537	{
1538	tmp = pl->ob;
1539	break;
1540	}
1541	}
1542
1543	if (i < op->nrof)
1544	{
1545	sub_weight (op->env, op->weight * i);
1546	op->nrof -= i;
1547	if (tmp)
1548	esrv_send_item (tmp, op);
1549	}
1550	else
1551	{
1552	op->remove ();
1553	op->nrof = 0;
1554	if (tmp)
1555	esrv_del_item (tmp->contr, op->count);
1556	}
1557	}
1558	else
1559	{
1560	object *above = op->above;
1561
1562	if (i < op->nrof)
1563	op->nrof -= i;
1564	else
1565	{
1566	op->remove ();
1567	op->nrof = 0;
1568	}
1569
1570	/* Since we just removed op, op->above is null */
1571	for (tmp = above; tmp; tmp = tmp->above)
1572	if (tmp->type == PLAYER)
1573	{
1574	if (op->nrof)
1575	esrv_send_item (tmp, op);
1576	else
1577	esrv_del_item (tmp->contr, op->count);
1578	}
1579	}
1580
1581	if (op->nrof)
1582	return op;
1583	else
1584	{
1585	op->destroy ();
1586	return 0;
1587	}
1588	}
1589
1590	/*
1591	* add_weight(object, weight) adds the specified weight to an object,
1592	* and also updates how much the environment(s) is/are carrying.
1593	*/
1594
1595	void
1596	add_weight (object *op, signed long weight)
1597	{
1598	while (op != NULL)
1599	{
1600	if (op->type == CONTAINER)
1601	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1602
1603	op->carrying += weight;
1604	op = op->env;
1605	}
1606	}	1599	}
1607		1600
1608	object *	1601	object *
1609	insert_ob_in_ob (object *op, object *where)	1602	insert_ob_in_ob (object *op, object *where)
1610	{	1603	{
…		…
1614	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1607	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1615	free (dump);	1608	free (dump);
1616	return op;	1609	return op;
1617	}	1610	}
1618		1611
1619	if (where->head)	1612	if (where->head_ () != where)
1620	{	1613	{
1621	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1614	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1622	where = where->head;	1615	where = where->head;
1623	}	1616	}
1624		1617
1625	return where->insert (op);	1618	return where->insert (op);
1626	}	1619	}
…		…
1631	* inside the object environment.	1624	* inside the object environment.
1632	*	1625	*
1633	* The function returns now pointer to inserted item, and return value can	1626	* The function returns now pointer to inserted item, and return value can
1634	* be != op, if items are merged. -Tero	1627	* be != op, if items are merged. -Tero
1635	*/	1628	*/
1636
1637	object *	1629	object *
1638	object::insert (object *op)	1630	object::insert (object *op)
1639	{	1631	{
1640	object *tmp, *otmp;
1641
1642	if (!QUERY_FLAG (op, FLAG_REMOVED))
1643	op->remove ();
1644
1645	if (op->more)	1632	if (op->more)
1646	{	1633	{
1647	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1634	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1648	return op;	1635	return op;
1649	}	1636	}
1650		1637
1651	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1638	op->remove ();
1652	CLEAR_FLAG (op, FLAG_REMOVED);	1639
		1640	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1641
1653	if (op->nrof)	1642	if (op->nrof)
1654	{
1655	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1643	for (object *tmp = inv; tmp; tmp = tmp->below)
1656	if (object::can_merge (tmp, op))	1644	if (object::can_merge (tmp, op))
1657	{	1645	{
1658	/* return the original object and remove inserted object	1646	/* return the original object and remove inserted object
1659	(client needs the original object) */	1647	(client needs the original object) */
1660	tmp->nrof += op->nrof;	1648	tmp->nrof += op->nrof;
1661	/* Weight handling gets pretty funky. Since we are adding to	1649	op->destroy (1);
1662	* tmp->nrof, we need to increase the weight.
1663	*/
1664	add_weight (this, op->weight * op->nrof);
1665	SET_FLAG (op, FLAG_REMOVED);
1666	op->destroy (); /* free the inserted object */
1667	op = tmp;	1650	op = tmp;
1668	op->remove (); /* and fix old object's links */	1651	goto inserted;
1669	CLEAR_FLAG (op, FLAG_REMOVED);
1670	break;
1671	}	1652	}
1672		1653
1673	/* I assume combined objects have no inventory	1654	op->owner = 0; // it's his/hers now. period.
1674	* We add the weight - this object could have just been removed	1655	op->map = 0;
1675	* (if it was possible to merge). calling remove_ob will subtract	1656	op->x = 0;
1676	* the weight, so we need to add it in again, since we actually do	1657	op->y = 0;
1677	* the linking below
1678	*/
1679	add_weight (this, op->weight * op->nrof);
1680	}
1681	else
1682	add_weight (this, (op->weight + op->carrying));
1683		1658
1684	otmp = this->in_player ();	1659	op->above = 0;
1685	if (otmp && otmp->contr)	1660	op->below = inv;
		1661	op->env = this;
		1662
		1663	if (inv)
		1664	inv->above = op;
		1665
		1666	inv = op;
		1667
		1668	op->flag [FLAG_REMOVED] = 0;
		1669
		1670	adjust_weight (this, op->total_weight ());
		1671
		1672	inserted:
		1673	/* reset the light list and los of the players on the map */
		1674	if (op->glow_radius && map && map->darkness)
		1675	update_all_los (map, x, y);
		1676
		1677	if (object *otmp = in_player ())
1686	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1678	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1687	otmp->update_stats ();	1679	otmp->update_stats ();
1688		1680
1689	op->map = 0;	1681	INVOKE_OBJECT (INSERT, this);
1690	op->env = this;
1691	op->above = 0;
1692	op->below = 0;
1693	op->x = 0, op->y = 0;
1694
1695	/* reset the light list and los of the players on the map */
1696	if ((op->glow_radius != 0) && map)
1697	{
1698	#ifdef DEBUG_LIGHTS
1699	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1700	#endif /* DEBUG_LIGHTS */
1701	if (MAP_DARKNESS (map))
1702	update_all_los (map, x, y);
1703	}
1704
1705	/* Client has no idea of ordering so lets not bother ordering it here.
1706	* It sure simplifies this function...
1707	*/
1708	if (!inv)
1709	inv = op;
1710	else
1711	{
1712	op->below = inv;
1713	op->below->above = op;
1714	inv = op;
1715	}
1716		1682
1717	return op;	1683	return op;
1718	}	1684	}
1719		1685
1720	/*	1686	/*
…		…
1735	*	1701	*
1736	* MSW 2001-07-08: Check all objects on space, not just those below	1702	* MSW 2001-07-08: Check all objects on space, not just those below
1737	* object being inserted. insert_ob_in_map may not put new objects	1703	* object being inserted. insert_ob_in_map may not put new objects
1738	* on top.	1704	* on top.
1739	*/	1705	*/
1740
1741	int	1706	int
1742	check_move_on (object *op, object *originator)	1707	check_move_on (object *op, object *originator)
1743	{	1708	{
1744	object *tmp;	1709	object *tmp;
1745	maptile *m = op->map;	1710	maptile *m = op->map;
…		…
1772		1737
1773	/* The objects have to be checked from top to bottom.	1738	/* The objects have to be checked from top to bottom.
1774	* Hence, we first go to the top:	1739	* Hence, we first go to the top:
1775	*/	1740	*/
1776		1741
1777	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1742	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1778	{	1743	{
1779	/* Trim the search when we find the first other spell effect	1744	/* Trim the search when we find the first other spell effect
1780	* this helps performance so that if a space has 50 spell objects,	1745	* this helps performance so that if a space has 50 spell objects,
1781	* we don't need to check all of them.	1746	* we don't need to check all of them.
1782	*/	1747	*/
…		…
1800	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1765	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1801	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1766	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1802	{	1767	{
1803		1768
1804	float	1769	float
1805	diff = tmp->move_slow_penalty * FABS (op->speed);	1770	diff = tmp->move_slow_penalty * fabs (op->speed);
1806		1771
1807	if (op->type == PLAYER)	1772	if (op->type == PLAYER)
1808	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1773	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1809	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1774	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1810	diff /= 4.0;	1775	diff /= 4.0;
…		…
1837	/*	1802	/*
1838	* present_arch(arch, map, x, y) searches for any objects with	1803	* present_arch(arch, map, x, y) searches for any objects with
1839	* a matching archetype at the given map and coordinates.	1804	* a matching archetype at the given map and coordinates.
1840	* The first matching object is returned, or NULL if none.	1805	* The first matching object is returned, or NULL if none.
1841	*/	1806	*/
1842
1843	object *	1807	object *
1844	present_arch (const archetype *at, maptile *m, int x, int y)	1808	present_arch (const archetype *at, maptile *m, int x, int y)
1845	{	1809	{
1846	object *
1847	tmp;
1848
1849	if (m == NULL || out_of_map (m, x, y))	1810	if (!m || out_of_map (m, x, y))
1850	{	1811	{
1851	LOG (llevError, "Present_arch called outside map.\n");	1812	LOG (llevError, "Present_arch called outside map.\n");
1852	return NULL;	1813	return NULL;
1853	}	1814	}
1854	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1815
		1816	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1855	if (tmp->arch == at)	1817	if (tmp->arch == at)
1856	return tmp;	1818	return tmp;
		1819
1857	return NULL;	1820	return NULL;
1858	}	1821	}
1859		1822
1860	/*	1823	/*
1861	* present(type, map, x, y) searches for any objects with	1824	* present(type, map, x, y) searches for any objects with
1862	* a matching type variable at the given map and coordinates.	1825	* a matching type variable at the given map and coordinates.
1863	* The first matching object is returned, or NULL if none.	1826	* The first matching object is returned, or NULL if none.
1864	*/	1827	*/
1865
1866	object *	1828	object *
1867	present (unsigned char type, maptile *m, int x, int y)	1829	present (unsigned char type, maptile *m, int x, int y)
1868	{	1830	{
1869	object *
1870	tmp;
1871
1872	if (out_of_map (m, x, y))	1831	if (out_of_map (m, x, y))
1873	{	1832	{
1874	LOG (llevError, "Present called outside map.\n");	1833	LOG (llevError, "Present called outside map.\n");
1875	return NULL;	1834	return NULL;
1876	}	1835	}
1877	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1836
		1837	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1878	if (tmp->type == type)	1838	if (tmp->type == type)
1879	return tmp;	1839	return tmp;
		1840
1880	return NULL;	1841	return NULL;
1881	}	1842	}
1882		1843
1883	/*	1844	/*
1884	* present_in_ob(type, object) searches for any objects with	1845	* present_in_ob(type, object) searches for any objects with
1885	* a matching type variable in the inventory of the given object.	1846	* a matching type variable in the inventory of the given object.
1886	* The first matching object is returned, or NULL if none.	1847	* The first matching object is returned, or NULL if none.
1887	*/	1848	*/
1888
1889	object *	1849	object *
1890	present_in_ob (unsigned char type, const object *op)	1850	present_in_ob (unsigned char type, const object *op)
1891	{	1851	{
1892	object *
1893	tmp;
1894
1895	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1852	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1896	if (tmp->type == type)	1853	if (tmp->type == type)
1897	return tmp;	1854	return tmp;
		1855
1898	return NULL;	1856	return NULL;
1899	}	1857	}
1900		1858
1901	/*	1859	/*
1902	* present_in_ob (type, str, object) searches for any objects with	1860	* present_in_ob (type, str, object) searches for any objects with
…		…
1910	* str is the string to match against. Note that we match against	1868	* str is the string to match against. Note that we match against
1911	* the object name, not the archetype name. this is so that the	1869	* the object name, not the archetype name. this is so that the
1912	* spell code can use one object type (force), but change it's name	1870	* spell code can use one object type (force), but change it's name
1913	* to be unique.	1871	* to be unique.
1914	*/	1872	*/
1915
1916	object *	1873	object *
1917	present_in_ob_by_name (int type, const char *str, const object *op)	1874	present_in_ob_by_name (int type, const char *str, const object *op)
1918	{	1875	{
1919	object *
1920	tmp;
1921
1922	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1876	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1923	{
1924	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1877	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
1925	return tmp;	1878	return tmp;
1926	}	1879
1927	return NULL;	1880	return 0;
1928	}	1881	}
1929		1882
1930	/*	1883	/*
1931	* present_arch_in_ob(archetype, object) searches for any objects with	1884	* present_arch_in_ob(archetype, object) searches for any objects with
1932	* a matching archetype in the inventory of the given object.	1885	* a matching archetype in the inventory of the given object.
1933	* The first matching object is returned, or NULL if none.	1886	* The first matching object is returned, or NULL if none.
1934	*/	1887	*/
1935
1936	object *	1888	object *
1937	present_arch_in_ob (const archetype *at, const object *op)	1889	present_arch_in_ob (const archetype *at, const object *op)
1938	{	1890	{
1939	object *
1940	tmp;
1941
1942	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1891	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1943	if (tmp->arch == at)	1892	if (tmp->arch == at)
1944	return tmp;	1893	return tmp;
		1894
1945	return NULL;	1895	return NULL;
1946	}	1896	}
1947		1897
1948	/*	1898	/*
1949	* activate recursively a flag on an object inventory	1899	* activate recursively a flag on an object inventory
1950	*/	1900	*/
1951	void	1901	void
1952	flag_inv (object *op, int flag)	1902	flag_inv (object *op, int flag)
1953	{	1903	{
1954	object *
1955	tmp;
1956
1957	if (op->inv)
1958	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1904	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1959	{	1905	{
1960	SET_FLAG (tmp, flag);	1906	SET_FLAG (tmp, flag);
1961	flag_inv (tmp, flag);	1907	flag_inv (tmp, flag);
1962	}	1908	}
1963	} /*	1909	}
		1910
		1911	/*
1964	* desactivate recursively a flag on an object inventory	1912	* deactivate recursively a flag on an object inventory
1965	*/	1913	*/
1966	void	1914	void
1967	unflag_inv (object *op, int flag)	1915	unflag_inv (object *op, int flag)
1968	{	1916	{
1969	object *
1970	tmp;
1971
1972	if (op->inv)
1973	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1917	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1974	{	1918	{
1975	CLEAR_FLAG (tmp, flag);	1919	CLEAR_FLAG (tmp, flag);
1976	unflag_inv (tmp, flag);	1920	unflag_inv (tmp, flag);
1977	}	1921	}
1978	}
1979
1980	/*
1981	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1982	* all it's inventory (recursively).
1983	* If checksums are used, a player will get set_cheat called for
1984	* him/her-self and all object carried by a call to this function.
1985	*/
1986
1987	void
1988	set_cheat (object *op)
1989	{
1990	SET_FLAG (op, FLAG_WAS_WIZ);
1991	flag_inv (op, FLAG_WAS_WIZ);
1992	}	1922	}
1993		1923
1994	/*	1924	/*
1995	* find_free_spot(object, map, x, y, start, stop) will search for	1925	* find_free_spot(object, map, x, y, start, stop) will search for
1996	* a spot at the given map and coordinates which will be able to contain	1926	* a spot at the given map and coordinates which will be able to contain
…		…
1998	* to search (see the freearr_x/y[] definition).	1928	* to search (see the freearr_x/y[] definition).
1999	* It returns a random choice among the alternatives found.	1929	* It returns a random choice among the alternatives found.
2000	* start and stop are where to start relative to the free_arr array (1,9	1930	* start and stop are where to start relative to the free_arr array (1,9
2001	* does all 4 immediate directions). This returns the index into the	1931	* does all 4 immediate directions). This returns the index into the
2002	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1932	* array of the free spot, -1 if no spot available (dir 0 = x,y)
2003	* Note - this only checks to see if there is space for the head of the
2004	* object - if it is a multispace object, this should be called for all
2005	* pieces.
2006	* Note2: This function does correctly handle tiled maps, but does not	1933	* Note: This function does correctly handle tiled maps, but does not
2007	* inform the caller. However, insert_ob_in_map will update as	1934	* inform the caller. However, insert_ob_in_map will update as
2008	* necessary, so the caller shouldn't need to do any special work.	1935	* necessary, so the caller shouldn't need to do any special work.
2009	* Note - updated to take an object instead of archetype - this is necessary	1936	* Note - updated to take an object instead of archetype - this is necessary
2010	* because arch_blocked (now ob_blocked) needs to know the movement type	1937	* because arch_blocked (now ob_blocked) needs to know the movement type
2011	* to know if the space in question will block the object. We can't use	1938	* to know if the space in question will block the object. We can't use
2012	* the archetype because that isn't correct if the monster has been	1939	* the archetype because that isn't correct if the monster has been
2013	* customized, changed states, etc.	1940	* customized, changed states, etc.
2014	*/	1941	*/
2015
2016	int	1942	int
2017	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1943	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2018	{	1944	{
2019	int
2020	i,
2021	index = 0, flag;
2022	static int
2023	altern[SIZEOFFREE];	1945	int altern[SIZEOFFREE];
		1946	int index = 0, flag;
2024		1947
2025	for (i = start; i < stop; i++)	1948	for (int i = start; i < stop; i++)
2026	{	1949	{
2027	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1950	mapxy pos (m, x, y); pos.move (i);
2028	if (!flag)	1951
		1952	if (!pos.normalise ())
		1953	continue;
		1954
		1955	mapspace &ms = *pos;
		1956
		1957	if (ms.flags () & P_IS_ALIVE)
		1958	continue;
		1959
		1960	/* However, often
		1961	* ob doesn't have any move type (when used to place exits)
		1962	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1963	*/
		1964	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1965	{
2029	altern[index++] = i;	1966	altern [index++] = i;
		1967	continue;
		1968	}
2030		1969
2031	/* Basically, if we find a wall on a space, we cut down the search size.	1970	/* Basically, if we find a wall on a space, we cut down the search size.
2032	* In this way, we won't return spaces that are on another side of a wall.	1971	* In this way, we won't return spaces that are on another side of a wall.
2033	* This mostly work, but it cuts down the search size in all directions -	1972	* This mostly work, but it cuts down the search size in all directions -
2034	* if the space being examined only has a wall to the north and empty	1973	* if the space being examined only has a wall to the north and empty
2035	* spaces in all the other directions, this will reduce the search space	1974	* spaces in all the other directions, this will reduce the search space
2036	* to only the spaces immediately surrounding the target area, and	1975	* to only the spaces immediately surrounding the target area, and
2037	* won't look 2 spaces south of the target space.	1976	* won't look 2 spaces south of the target space.
2038	*/	1977	*/
2039	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1978	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1979	{
2040	stop = maxfree[i];	1980	stop = maxfree[i];
		1981	continue;
		1982	}
		1983
		1984	/* Note it is intentional that we check ob - the movement type of the
		1985	* head of the object should correspond for the entire object.
		1986	*/
		1987	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1988	continue;
		1989
		1990	if (ob->blocked (m, pos.x, pos.y))
		1991	continue;
		1992
		1993	altern [index++] = i;
2041	}	1994	}
2042		1995
2043	if (!index)	1996	if (!index)
2044	return -1;	1997	return -1;
2045		1998
2046	return altern[RANDOM () % index];	1999	return altern [rndm (index)];
2047	}	2000	}
2048		2001
2049	/*	2002	/*
2050	* find_first_free_spot(archetype, maptile, x, y) works like	2003	* find_first_free_spot(archetype, maptile, x, y) works like
2051	* find_free_spot(), but it will search max number of squares.	2004	* find_free_spot(), but it will search max number of squares.
2052	* But it will return the first available spot, not a random choice.	2005	* But it will return the first available spot, not a random choice.
2053	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2006	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2054	*/	2007	*/
2055
2056	int	2008	int
2057	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2009	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2058	{	2010	{
2059	int
2060	i;
2061
2062	for (i = 0; i < SIZEOFFREE; i++)	2011	for (int i = 0; i < SIZEOFFREE; i++)
2063	{
2064	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2012	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2065	return i;	2013	return i;
2066	}	2014
2067	return -1;	2015	return -1;
2068	}	2016	}
2069		2017
2070	/*	2018	/*
2071	* The function permute(arr, begin, end) randomly reorders the array	2019	* The function permute(arr, begin, end) randomly reorders the array
2072	* arr[begin..end-1].	2020	* arr[begin..end-1].
		2021	* now uses a fisher-yates shuffle, old permute was broken
2073	*/	2022	*/
2074	static void	2023	static void
2075	permute (int *arr, int begin, int end)	2024	permute (int *arr, int begin, int end)
2076	{	2025	{
2077	int	2026	arr += begin;
2078	i,
2079	j,
2080	tmp,
2081	len;
2082
2083	len = end - begin;	2027	end -= begin;
2084	for (i = begin; i < end; i++)
2085	{
2086	j = begin + RANDOM () % len;
2087		2028
2088	tmp = arr[i];	2029	while (--end)
2089	arr[i] = arr[j];	2030	swap (arr [end], arr [rndm (end + 1)]);
2090	arr[j] = tmp;
2091	}
2092	}	2031	}
2093		2032
2094	/* new function to make monster searching more efficient, and effective!	2033	/* new function to make monster searching more efficient, and effective!
2095	* This basically returns a randomized array (in the passed pointer) of	2034	* This basically returns a randomized array (in the passed pointer) of
2096	* the spaces to find monsters. In this way, it won't always look for	2035	* the spaces to find monsters. In this way, it won't always look for
…		…
2099	* the 3x3 area will be searched, just not in a predictable order.	2038	* the 3x3 area will be searched, just not in a predictable order.
2100	*/	2039	*/
2101	void	2040	void
2102	get_search_arr (int *search_arr)	2041	get_search_arr (int *search_arr)
2103	{	2042	{
2104	int	2043	int i;
2105	i;
2106		2044
2107	for (i = 0; i < SIZEOFFREE; i++)	2045	for (i = 0; i < SIZEOFFREE; i++)
2108	{
2109	search_arr[i] = i;	2046	search_arr[i] = i;
2110	}
2111		2047
2112	permute (search_arr, 1, SIZEOFFREE1 + 1);	2048	permute (search_arr, 1, SIZEOFFREE1 + 1);
2113	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2049	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2114	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2050	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2115	}	2051	}
…		…
2124	* Perhaps incorrectly, but I'm making the assumption that exclude	2060	* Perhaps incorrectly, but I'm making the assumption that exclude
2125	* is actually want is going to try and move there. We need this info	2061	* is actually want is going to try and move there. We need this info
2126	* because we have to know what movement the thing looking to move	2062	* because we have to know what movement the thing looking to move
2127	* there is capable of.	2063	* there is capable of.
2128	*/	2064	*/
2129
2130	int	2065	int
2131	find_dir (maptile *m, int x, int y, object *exclude)	2066	find_dir (maptile *m, int x, int y, object *exclude)
2132	{	2067	{
2133	int
2134	i,
2135	max = SIZEOFFREE, mflags;	2068	int i, max = SIZEOFFREE, mflags;
2136		2069
2137	sint16 nx, ny;	2070	sint16 nx, ny;
2138	object *	2071	object *tmp;
2139	tmp;
2140	maptile *	2072	maptile *mp;
2141	mp;
2142		2073
2143	MoveType blocked, move_type;	2074	MoveType blocked, move_type;
2144		2075
2145	if (exclude && exclude->head)	2076	if (exclude && exclude->head_ () != exclude)
2146	{	2077	{
2147	exclude = exclude->head;	2078	exclude = exclude->head;
2148	move_type = exclude->move_type;	2079	move_type = exclude->move_type;
2149	}	2080	}
2150	else	2081	else
…		…
2163		2094
2164	if (mflags & P_OUT_OF_MAP)	2095	if (mflags & P_OUT_OF_MAP)
2165	max = maxfree[i];	2096	max = maxfree[i];
2166	else	2097	else
2167	{	2098	{
2168	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2099	mapspace &ms = mp->at (nx, ny);
		2100
		2101	blocked = ms.move_block;
2169		2102
2170	if ((move_type & blocked) == move_type)	2103	if ((move_type & blocked) == move_type)
2171	max = maxfree[i];	2104	max = maxfree[i];
2172	else if (mflags & P_IS_ALIVE)	2105	else if (mflags & P_IS_ALIVE)
2173	{	2106	{
2174	for (tmp = GET_MAP_OB (mp, nx, ny); tmp; tmp = tmp->above)	2107	for (tmp = ms.bot; tmp; tmp = tmp->above)
2175	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2108	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
		2109	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2176	break;	2110	break;
2177		2111
2178	if (tmp)	2112	if (tmp)
2179	return freedir[i];	2113	return freedir[i];
2180	}	2114	}
…		…
2186		2120
2187	/*	2121	/*
2188	* distance(object 1, object 2) will return the square of the	2122	* distance(object 1, object 2) will return the square of the
2189	* distance between the two given objects.	2123	* distance between the two given objects.
2190	*/	2124	*/
2191
2192	int	2125	int
2193	distance (const object *ob1, const object *ob2)	2126	distance (const object *ob1, const object *ob2)
2194	{	2127	{
2195	int i;
2196
2197	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2128	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2198	return i;
2199	}	2129	}
2200		2130
2201	/*	2131	/*
2202	* find_dir_2(delta-x,delta-y) will return a direction in which	2132	* find_dir_2(delta-x,delta-y) will return a direction in which
2203	* an object which has subtracted the x and y coordinates of another	2133	* an object which has subtracted the x and y coordinates of another
2204	* object, needs to travel toward it.	2134	* object, needs to travel toward it.
2205	*/	2135	*/
2206
2207	int	2136	int
2208	find_dir_2 (int x, int y)	2137	find_dir_2 (int x, int y)
2209	{	2138	{
2210	int q;	2139	int q;
2211		2140
…		…
2240		2169
2241	return 3;	2170	return 3;
2242	}	2171	}
2243		2172
2244	/*	2173	/*
2245	* absdir(int): Returns a number between 1 and 8, which represent
2246	* the "absolute" direction of a number (it actually takes care of
2247	* "overflow" in previous calculations of a direction).
2248	*/
2249
2250	int
2251	absdir (int d)
2252	{
2253	while (d < 1)
2254	d += 8;
2255	while (d > 8)
2256	d -= 8;
2257	return d;
2258	}
2259
2260	/*
2261	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2174	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2262	* between two directions (which are expected to be absolute (see absdir())	2175	* between two directions (which are expected to be absolute (see absdir())
2263	*/	2176	*/
2264
2265	int	2177	int
2266	dirdiff (int dir1, int dir2)	2178	dirdiff (int dir1, int dir2)
2267	{	2179	{
2268	int	2180	int d;
2269	d;
2270		2181
2271	d = abs (dir1 - dir2);	2182	d = abs (dir1 - dir2);
2272	if (d > 4)	2183	if (d > 4)
2273	d = 8 - d;	2184	d = 8 - d;
		2185
2274	return d;	2186	return d;
2275	}	2187	}
2276		2188
2277	/* peterm:	2189	/* peterm:
2278	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2190	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2281	* This basically means that if direction is 15, then it could either go	2193	* This basically means that if direction is 15, then it could either go
2282	* direction 4, 14, or 16 to get back to where we are.	2194	* direction 4, 14, or 16 to get back to where we are.
2283	* Moved from spell_util.c to object.c with the other related direction	2195	* Moved from spell_util.c to object.c with the other related direction
2284	* functions.	2196	* functions.
2285	*/	2197	*/
2286
2287	int
2288	reduction_dir[SIZEOFFREE][3] = {	2198	int reduction_dir[SIZEOFFREE][3] = {
2289	{0, 0, 0}, /* 0 */	2199	{0, 0, 0}, /* 0 */
2290	{0, 0, 0}, /* 1 */	2200	{0, 0, 0}, /* 1 */
2291	{0, 0, 0}, /* 2 */	2201	{0, 0, 0}, /* 2 */
2292	{0, 0, 0}, /* 3 */	2202	{0, 0, 0}, /* 3 */
2293	{0, 0, 0}, /* 4 */	2203	{0, 0, 0}, /* 4 */
…		…
2384	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2294	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2385	* core dumps if they do.	2295	* core dumps if they do.
2386	*	2296	*
2387	* Add a check so we can't pick up invisible objects (0.93.8)	2297	* Add a check so we can't pick up invisible objects (0.93.8)
2388	*/	2298	*/
2389
2390	int	2299	int
2391	can_pick (const object *who, const object *item)	2300	can_pick (const object *who, const object *item)
2392	{	2301	{
2393	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2302	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2394	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2303	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2399	* create clone from object to another	2308	* create clone from object to another
2400	*/	2309	*/
2401	object *	2310	object *
2402	object_create_clone (object *asrc)	2311	object_create_clone (object *asrc)
2403	{	2312	{
2404	object *dst = 0, *tmp, *src, *part, *prev, *item;	2313	object *dst = 0, *tmp, *src, *prev, *item;
2405		2314
2406	if (!asrc)	2315	if (!asrc)
2407	return 0;	2316	return 0;
2408		2317
2409	src = asrc;
2410	if (src->head)
2411	src = src->head;	2318	src = asrc->head_ ();
2412		2319
2413	prev = 0;	2320	prev = 0;
2414	for (part = src; part; part = part->more)	2321	for (object *part = src; part; part = part->more)
2415	{	2322	{
2416	tmp = part->clone ();	2323	tmp = part->clone ();
2417	tmp->x -= src->x;	2324	tmp->x -= src->x;
2418	tmp->y -= src->y;	2325	tmp->y -= src->y;
2419		2326
…		…
2437	insert_ob_in_ob (object_create_clone (item), dst);	2344	insert_ob_in_ob (object_create_clone (item), dst);
2438		2345
2439	return dst;	2346	return dst;
2440	}	2347	}
2441		2348
2442	/* GROS - Creates an object using a string representing its content. */
2443	/* Basically, we save the content of the string to a temp file, then call */
2444	/* load_object on it. I admit it is a highly inefficient way to make things, */
2445	/* but it was simple to make and allows reusing the load_object function. */
2446	/* Remember not to use load_object_str in a time-critical situation. */
2447	/* Also remember that multiparts objects are not supported for now. */
2448
2449	object *
2450	load_object_str (const char *obstr)
2451	{
2452	object *op;
2453	char filename[MAX_BUF];
2454
2455	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2456
2457	FILE *tempfile = fopen (filename, "w");
2458
2459	if (tempfile == NULL)
2460	{
2461	LOG (llevError, "Error - Unable to access load object temp file\n");
2462	return NULL;
2463	}
2464
2465	fprintf (tempfile, obstr);
2466	fclose (tempfile);
2467
2468	op = object::create ();
2469
2470	object_thawer thawer (filename);
2471
2472	if (thawer)
2473	load_object (thawer, op, 0);
2474
2475	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2476	CLEAR_FLAG (op, FLAG_REMOVED);
2477
2478	return op;
2479	}
2480
2481	/* This returns the first object in who's inventory that	2349	/* This returns the first object in who's inventory that
2482	* has the same type and subtype match.	2350	* has the same type and subtype match.
2483	* returns NULL if no match.	2351	* returns NULL if no match.
2484	*/	2352	*/
2485	object *	2353	object *
2486	find_obj_by_type_subtype (const object *who, int type, int subtype)	2354	find_obj_by_type_subtype (const object *who, int type, int subtype)
2487	{	2355	{
2488	object *tmp;
2489
2490	for (tmp = who->inv; tmp; tmp = tmp->below)	2356	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2491	if (tmp->type == type && tmp->subtype == subtype)	2357	if (tmp->type == type && tmp->subtype == subtype)
2492	return tmp;	2358	return tmp;
2493		2359
2494	return NULL;	2360	return 0;
2495	}	2361	}
2496		2362
2497	/* If ob has a field named key, return the link from the list,	2363	/* If ob has a field named key, return the link from the list,
2498	* otherwise return NULL.	2364	* otherwise return NULL.
2499	*	2365	*
…		…
2501	* do the desired thing.	2367	* do the desired thing.
2502	*/	2368	*/
2503	key_value *	2369	key_value *
2504	get_ob_key_link (const object *ob, const char *key)	2370	get_ob_key_link (const object *ob, const char *key)
2505	{	2371	{
2506	key_value *link;
2507
2508	for (link = ob->key_values; link != NULL; link = link->next)	2372	for (key_value *link = ob->key_values; link; link = link->next)
2509	if (link->key == key)	2373	if (link->key == key)
2510	return link;	2374	return link;
2511		2375
2512	return NULL;	2376	return 0;
2513	}	2377	}
2514		2378
2515	/*	2379	/*
2516	* Returns the value of op has an extra_field for key, or NULL.	2380	* Returns the value of op has an extra_field for key, or NULL.
2517	*	2381	*
…		…
2542	if (link->key == canonical_key)	2406	if (link->key == canonical_key)
2543	return link->value;	2407	return link->value;
2544		2408
2545	return 0;	2409	return 0;
2546	}	2410	}
2547
2548		2411
2549	/*	2412	/*
2550	* Updates the canonical_key in op to value.	2413	* Updates the canonical_key in op to value.
2551	*	2414	*
2552	* canonical_key is a shared string (value doesn't have to be).	2415	* canonical_key is a shared string (value doesn't have to be).
…		…
2557	* Returns TRUE on success.	2420	* Returns TRUE on success.
2558	*/	2421	*/
2559	int	2422	int
2560	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2423	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2561	{	2424	{
2562	key_value *
2563	field = NULL, *last = NULL;	2425	key_value *field = NULL, *last = NULL;
2564		2426
2565	for (field = op->key_values; field != NULL; field = field->next)	2427	for (field = op->key_values; field != NULL; field = field->next)
2566	{	2428	{
2567	if (field->key != canonical_key)	2429	if (field->key != canonical_key)
2568	{	2430	{
…		…
2577	/* Basically, if the archetype has this key set,	2439	/* Basically, if the archetype has this key set,
2578	* we need to store the null value so when we save	2440	* we need to store the null value so when we save
2579	* it, we save the empty value so that when we load,	2441	* it, we save the empty value so that when we load,
2580	* we get this value back again.	2442	* we get this value back again.
2581	*/	2443	*/
2582	if (get_ob_key_link (&op->arch->clone, canonical_key))	2444	if (get_ob_key_link (op->arch, canonical_key))
2583	field->value = 0;	2445	field->value = 0;
2584	else	2446	else
2585	{	2447	{
2586	if (last)	2448	if (last)
2587	last->next = field->next;	2449	last->next = field->next;
…		…
2596	/* IF we get here, key doesn't exist */	2458	/* IF we get here, key doesn't exist */
2597		2459
2598	/* No field, we'll have to add it. */	2460	/* No field, we'll have to add it. */
2599		2461
2600	if (!add_key)	2462	if (!add_key)
2601	{
2602	return FALSE;	2463	return FALSE;
2603	}	2464
2604	/* There isn't any good reason to store a null	2465	/* There isn't any good reason to store a null
2605	* value in the key/value list. If the archetype has	2466	* value in the key/value list. If the archetype has
2606	* this key, then we should also have it, so shouldn't	2467	* this key, then we should also have it, so shouldn't
2607	* be here. If user wants to store empty strings,	2468	* be here. If user wants to store empty strings,
2608	* should pass in ""	2469	* should pass in ""
…		…
2657	}	2518	}
2658	else	2519	else
2659	item = item->env;	2520	item = item->env;
2660	}	2521	}
2661		2522
		2523	const char *
		2524	object::flag_desc (char *desc, int len) const
		2525	{
		2526	char *p = desc;
		2527	bool first = true;
		2528
		2529	*p = 0;
		2530
		2531	for (int i = 0; i < NUM_FLAGS; i++)
		2532	{
		2533	if (len <= 10) // magic constant!
		2534	{
		2535	snprintf (p, len, ",...");
		2536	break;
		2537	}
		2538
		2539	if (flag [i])
		2540	{
		2541	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2542	len -= cnt;
		2543	p += cnt;
		2544	first = false;
		2545	}
		2546	}
		2547
		2548	return desc;
		2549	}
		2550
2662	// return a suitable string describing an objetc in enough detail to find it	2551	// return a suitable string describing an object in enough detail to find it
2663	const char *	2552	const char *
2664	object::debug_desc (char *info) const	2553	object::debug_desc (char *info) const
2665	{	2554	{
		2555	char flagdesc[512];
2666	char info2[256 * 3];	2556	char info2[256 * 4];
2667	char *p = info;	2557	char *p = info;
2668		2558
2669	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2559	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2670	count,	2560	count,
		2561	uuid.c_str (),
2671	&name,	2562	&name,
2672	title ? " " : "",	2563	title ? "\",title:\"" : "",
2673	title ? (const char *)title : "");	2564	title ? (const char *)title : "",
		2565	flag_desc (flagdesc, 512), type);
2674		2566
2675	if (env)	2567	if (!this->flag[FLAG_REMOVED] && env)
2676	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2568	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2677		2569
2678	if (map)	2570	if (map)
2679	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2571	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2680		2572
2681	return info;	2573	return info;
2682	}	2574	}
2683		2575
2684	const char *	2576	const char *
2685	object::debug_desc () const	2577	object::debug_desc () const
2686	{	2578	{
2687	static char info[256 * 3];	2579	static char info[3][256 * 4];
		2580	static int info_idx;
		2581
2688	return debug_desc (info);	2582	return debug_desc (info [++info_idx % 3]);
2689	}	2583	}
2690		2584
		2585	struct region *
		2586	object::region () const
		2587	{
		2588	return map ? map->region (x, y)
		2589	: region::default_region ();
		2590	}
		2591
		2592	const materialtype_t *
		2593	object::dominant_material () const
		2594	{
		2595	if (materialtype_t *mt = name_to_material (materialname))
		2596	return mt;
		2597
		2598	return name_to_material (shstr_unknown);
		2599	}
		2600
		2601	void
		2602	object::open_container (object *new_container)
		2603	{
		2604	if (container == new_container)
		2605	return;
		2606
		2607	if (object *old_container = container)
		2608	{
		2609	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2610	return;
		2611
		2612	#if 0
		2613	// remove the "Close old_container" object.
		2614	if (object *closer = old_container->inv)
		2615	if (closer->type == CLOSE_CON)
		2616	closer->destroy ();
		2617	#endif
		2618
		2619	old_container->flag [FLAG_APPLIED] = 0;
		2620	container = 0;
		2621
		2622	esrv_update_item (UPD_FLAGS, this, old_container);
		2623	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2624	play_sound (sound_find ("chest_close"));
		2625	}
		2626
		2627	if (new_container)
		2628	{
		2629	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2630	return;
		2631
		2632	// TODO: this does not seem to serve any purpose anymore?
		2633	#if 0
		2634	// insert the "Close Container" object.
		2635	if (archetype *closer = new_container->other_arch)
		2636	{
		2637	object *closer = arch_to_object (new_container->other_arch);
		2638	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2639	new_container->insert (closer);
		2640	}
		2641	#endif
		2642
		2643	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2644
		2645	new_container->flag [FLAG_APPLIED] = 1;
		2646	container = new_container;
		2647
		2648	esrv_update_item (UPD_FLAGS, this, new_container);
		2649	esrv_send_inventory (this, new_container);
		2650	play_sound (sound_find ("chest_open"));
		2651	}
		2652	}
		2653
		2654	object *
		2655	object::force_find (const shstr name)
		2656	{
		2657	/* cycle through his inventory to look for the MARK we want to
		2658	* place
		2659	*/
		2660	for (object *tmp = inv; tmp; tmp = tmp->below)
		2661	if (tmp->type == FORCE && tmp->slaying == name)
		2662	return splay (tmp);
		2663
		2664	return 0;
		2665	}
		2666
		2667	void
		2668	object::force_add (const shstr name, int duration)
		2669	{
		2670	if (object *force = force_find (name))
		2671	force->destroy ();
		2672
		2673	object *force = get_archetype (FORCE_NAME);
		2674
		2675	force->slaying = name;
		2676	force->stats.food = 1;
		2677	force->speed_left = -1.f;
		2678
		2679	force->set_speed (duration ? 1.f / duration : 0.f);
		2680	force->flag [FLAG_IS_USED_UP] = true;
		2681	force->flag [FLAG_APPLIED] = true;
		2682
		2683	insert (force);
		2684	}
		2685
		2686	void
		2687	object::play_sound (faceidx sound)
		2688	{
		2689	if (!sound)
		2690	return;
		2691
		2692	if (flag [FLAG_REMOVED])
		2693	return;
		2694
		2695	if (env)
		2696	{
		2697	if (object *pl = in_player ())
		2698	pl->contr->play_sound (sound);
		2699	}
		2700	else
		2701	map->play_sound (sound, x, y);
		2702	}
		2703

Diff Legend

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