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

Diff Legend

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