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.106 by root, Wed Jan 3 20:08:04 2007 UTC vs.
Revision 1.226 by root, Sat May 3 08:50:30 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	}
…		…
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 (client_visible () && !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	if (!pl->container || this == pl->container)
		364	return pl;
		365	}
		366	}
		367
		368	return 0;
		369	}
		370
		371	// adjust weight per container type ("of holding")
		372	static sint32
		373	weight_adjust (object *op, sint32 weight)
		374	{
		375	return op->type == CONTAINER
		376	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		377	: weight;
		378	}
		379
316	/*	380	/*
		381	* adjust_weight(object, weight) adds the specified weight to an object,
		382	* and also updates how much the environment(s) is/are carrying.
		383	*/
		384	static void
		385	adjust_weight (object *op, sint32 weight)
		386	{
		387	while (op)
		388	{
		389	weight = weight_adjust (op, weight);
		390
		391	if (!weight)
		392	return;
		393
		394	op->carrying += weight;
		395
		396	if (object *pl = op->visible_to ())
		397	if (pl != op) // player is handled lazily
		398	esrv_update_item (UPD_WEIGHT, pl, op);
		399
		400	op = op->env;
		401	}
		402	}
		403
		404	/*
317	* sum_weight() is a recursive function which calculates the weight	405	* this is a recursive function which calculates the weight
318	* an object is carrying. It goes through in figures out how much	406	* an object is carrying. It goes through op and figures out how much
319	* containers are carrying, and sums it up.	407	* containers are carrying, and sums it up.
320	*/	408	*/
321	long	409	void
322	sum_weight (object *op)	410	object::update_weight ()
323	{	411	{
324	long sum;	412	sint32 sum = 0;
325	object *inv;
326		413
327	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	414	for (object *op = inv; op; op = op->below)
328	{	415	{
329	if (inv->inv)	416	if (op->inv)
330	sum_weight (inv);	417	op->update_weight ();
331	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	418
		419	sum += op->total_weight ();
		420	}
		421
		422	sum = weight_adjust (this, sum);
		423
		424	if (sum != carrying)
332	}	425	{
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;	426	carrying = sum;
339		427
340	return sum;	428	if (object *pl = visible_to ())
		429	if (pl != this) // player is handled lazily
		430	esrv_update_item (UPD_WEIGHT, pl, this);
		431	}
341	}	432	}
342		433
343	/**	434	/*
344	* Return the outermost environment object for a given object.	435	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
345	*/	436	*/
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 *	437	char *
362	dump_object (object *op)	438	dump_object (object *op)
363	{	439	{
364	if (!op)	440	if (!op)
365	return strdup ("[NULLOBJ]");	441	return strdup ("[NULLOBJ]");
366		442
367	object_freezer freezer;	443	object_freezer freezer;
368	save_object (freezer, op, 1);	444	op->write (freezer);
369	return freezer.as_string ();	445	return freezer.as_string ();
370	}	446	}
371		447
372	/*	448	/*
373	* get_nearest_part(multi-object, object 2) returns the part of the	449	* get_nearest_part(multi-object, object 2) returns the part of the
374	* multi-object 1 which is closest to the second object.	450	* multi-object 1 which is closest to the second object.
375	* If it's not a multi-object, it is returned.	451	* If it's not a multi-object, it is returned.
376	*/	452	*/
377
378	object *	453	object *
379	get_nearest_part (object *op, const object *pl)	454	get_nearest_part (object *op, const object *pl)
380	{	455	{
381	object *tmp, *closest;	456	object *tmp, *closest;
382	int last_dist, i;	457	int last_dist, i;
383		458
384	if (op->more == NULL)	459	if (!op->more)
385	return op;	460	return op;
		461
386	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	462	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		463	tmp;
		464	tmp = tmp->more)
387	if ((i = distance (tmp, pl)) < last_dist)	465	if ((i = distance (tmp, pl)) < last_dist)
388	closest = tmp, last_dist = i;	466	closest = tmp, last_dist = i;
		467
389	return closest;	468	return closest;
390	}	469	}
391		470
392	/*	471	/*
393	* Returns the object which has the count-variable equal to the argument.	472	* Returns the object which has the count-variable equal to the argument.
		473	* VERRRY slow.
394	*/	474	*/
395
396	object *	475	object *
397	find_object (tag_t i)	476	find_object (tag_t i)
398	{	477	{
399	for (object *op = object::first; op; op = op->next)	478	for_all_objects (op)
400	if (op->count == i)	479	if (op->count == i)
401	return op;	480	return op;
402		481
403	return 0;	482	return 0;
404	}	483	}
405		484
406	/*	485	/*
407	* Returns the first object which has a name equal to the argument.	486	* Returns the first object which has a name equal to the argument.
408	* Used only by the patch command, but not all that useful.	487	* Used only by the patch command, but not all that useful.
409	* Enables features like "patch <name-of-other-player> food 999"	488	* Enables features like "patch <name-of-other-player> food 999"
410	*/	489	*/
411
412	object *	490	object *
413	find_object_name (const char *str)	491	find_object_name (const char *str)
414	{	492	{
415	shstr_cmp str_ (str);	493	shstr_cmp str_ (str);
416	object *op;	494	object *op;
417		495
418	for (op = object::first; op != NULL; op = op->next)	496	for_all_objects (op)
419	if (op->name == str_)	497	if (op->name == str_)
420	break;	498	break;
421		499
422	return op;	500	return op;
423	}	501	}
424		502
425	void
426	free_all_object_data ()
427	{
428	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
429	}
430
431	/*	503	/*
432	* Sets the owner and sets the skill and exp pointers to owner's current	504	* Sets the owner and sets the skill and exp pointers to owner's current
433	* skill and experience objects.	505	* skill and experience objects.
		506	* ACTUALLY NO! investigate! TODO
434	*/	507	*/
435	void	508	void
436	object::set_owner (object *owner)	509	object::set_owner (object *owner)
437	{	510	{
		511	// allow objects which own objects
438	if (!owner)	512	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)	513	while (owner->owner)
449	owner = owner->owner;	514	owner = owner->owner;
		515
		516	if (flag [FLAG_FREED])
		517	{
		518	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		519	return;
		520	}
450		521
451	this->owner = owner;	522	this->owner = owner;
		523	}
		524
		525	int
		526	object::slottype () const
		527	{
		528	if (type == SKILL)
		529	{
		530	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		531	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		532	}
		533	else
		534	{
		535	if (slot [body_combat].info) return slot_combat;
		536	if (slot [body_range ].info) return slot_ranged;
		537	}
		538
		539	return slot_none;
		540	}
		541
		542	bool
		543	object::change_weapon (object *ob)
		544	{
		545	if (current_weapon == ob)
		546	return true;
		547
		548	if (chosen_skill)
		549	chosen_skill->flag [FLAG_APPLIED] = false;
		550
		551	current_weapon = ob;
		552	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		553
		554	if (chosen_skill)
		555	chosen_skill->flag [FLAG_APPLIED] = true;
		556
		557	update_stats ();
		558
		559	if (ob)
		560	{
		561	// now check wether any body locations became invalid, in which case
		562	// we cannot apply the weapon at the moment.
		563	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		564	if (slot[i].used < 0)
		565	{
		566	current_weapon = chosen_skill = 0;
		567	update_stats ();
		568
		569	new_draw_info_format (NDI_UNIQUE, 0, this,
		570	"You try to balance all your items at once, "
		571	"but the %s is just too much for your body. "
		572	"[You need to unapply some items first.]", &ob->name);
		573	return false;
		574	}
		575
		576	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		577	}
		578	else
		579	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		580
		581	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		582	{
		583	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		584	&name, ob->debug_desc ());
		585	return false;
		586	}
		587
		588	return true;
452	}	589	}
453		590
454	/* Zero the key_values on op, decrementing the shared-string	591	/* Zero the key_values on op, decrementing the shared-string
455	* refcounts and freeing the links.	592	* refcounts and freeing the links.
456	*/	593	*/
457	static void	594	static void
458	free_key_values (object *op)	595	free_key_values (object *op)
459	{	596	{
460	for (key_value *i = op->key_values; i != 0;)	597	for (key_value *i = op->key_values; i; )
461	{	598	{
462	key_value *next = i->next;	599	key_value *next = i->next;
463	delete i;	600	delete i;
464		601
465	i = next;	602	i = next;
466	}	603	}
467		604
468	op->key_values = 0;	605	op->key_values = 0;
469	}	606	}
470		607
471	/*	608	object &
472	* copy_to first frees everything allocated by the dst object,	609	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	{	610	{
482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	611	remove ();
483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
484		612
485	*(object_copy *)dst = *this;	613	*(object_copy *)this = src;
486		614
487	if (is_freed)	615	flag [FLAG_REMOVED] = true;
488	SET_FLAG (dst, FLAG_FREED);
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		616
496	/* Copy over key_values, if any. */	617	/* Copy over key_values, if any. */
497	if (key_values)	618	if (src.key_values)
498	{	619	{
499	key_value *tail = 0;	620	key_value *tail = 0;
500	key_value *i;
501
502	dst->key_values = 0;	621	key_values = 0;
503		622
504	for (i = key_values; i; i = i->next)	623	for (key_value *i = src.key_values; i; i = i->next)
505	{	624	{
506	key_value *new_link = new key_value;	625	key_value *new_link = new key_value;
507		626
508	new_link->next = 0;	627	new_link->next = 0;
509	new_link->key = i->key;	628	new_link->key = i->key;
510	new_link->value = i->value;	629	new_link->value = i->value;
511		630
512	/* Try and be clever here, too. */	631	/* Try and be clever here, too. */
513	if (!dst->key_values)	632	if (!key_values)
514	{	633	{
515	dst->key_values = new_link;	634	key_values = new_link;
516	tail = new_link;	635	tail = new_link;
517	}	636	}
518	else	637	else
519	{	638	{
520	tail->next = new_link;	639	tail->next = new_link;
521	tail = new_link;	640	tail = new_link;
522	}	641	}
523	}	642	}
524	}	643	}
		644	}
		645
		646	/*
		647	* copy_to first frees everything allocated by the dst object,
		648	* and then copies the contents of itself into the second
		649	* object, allocating what needs to be allocated. Basically, any
		650	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		651	* if the first object is freed, the pointers in the new object
		652	* will point at garbage.
		653	*/
		654	void
		655	object::copy_to (object *dst)
		656	{
		657	*dst = *this;
		658
		659	if (speed < 0)
		660	dst->speed_left -= rndm ();
525		661
526	dst->set_speed (dst->speed);	662	dst->set_speed (dst->speed);
		663	}
		664
		665	void
		666	object::instantiate ()
		667	{
		668	if (!uuid.seq) // HACK
		669	uuid = UUID::gen ();
		670
		671	speed_left = -0.1f;
		672	/* copy the body_info to the body_used - this is only really
		673	* need for monsters, but doesn't hurt to do it for everything.
		674	* by doing so, when a monster is created, it has good starting
		675	* values for the body_used info, so when items are created
		676	* for it, they can be properly equipped.
		677	*/
		678	for (int i = NUM_BODY_LOCATIONS; i--; )
		679	slot[i].used = slot[i].info;
		680
		681	attachable::instantiate ();
527	}	682	}
528		683
529	object *	684	object *
530	object::clone ()	685	object::clone ()
531	{	686	{
532	object *neu = create ();	687	object *neu = create ();
533	copy_to (neu);	688	copy_to (neu);
		689	neu->map = map; // not copied by copy_to
534	return neu;	690	return neu;
535	}	691	}
536		692
537	/*	693	/*
538	* If an object with the IS_TURNABLE() flag needs to be turned due	694	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
589	* UP_OBJ_FACE: only the objects face has changed.	745	* UP_OBJ_FACE: only the objects face has changed.
590	*/	746	*/
591	void	747	void
592	update_object (object *op, int action)	748	update_object (object *op, int action)
593	{	749	{
594	MoveType move_on, move_off, move_block, move_slow;	750	if (!op)
595
596	if (op == NULL)
597	{	751	{
598	/* this should never happen */	752	/* this should never happen */
599	LOG (llevDebug, "update_object() called for NULL object.\n");	753	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
600	return;	754	return;
601	}	755	}
602		756
603	if (op->env)	757	if (!op->is_on_map ())
604	{	758	{
605	/* Animation is currently handled by client, so nothing	759	/* Animation is currently handled by client, so nothing
606	* to do in this case.	760	* to do in this case.
607	*/	761	*/
608	return;	762	return;
609	}	763	}
610
611	/* If the map is saving, don't do anything as everything is
612	* going to get freed anyways.
613	*/
614	if (!op->map || op->map->in_memory == MAP_SAVING)
615	return;
616		764
617	/* make sure the object is within map boundaries */	765	/* make sure the object is within map boundaries */
618	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)	766	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
619	{	767	{
620	LOG (llevError, "update_object() called for object out of map!\n");	768	LOG (llevError, "update_object() called for object out of map!\n");
…		…
660		808
661	if (op->more)	809	if (op->more)
662	update_object (op->more, action);	810	update_object (op->more, action);
663	}	811	}
664		812
665	object *object::first;
666
667	object::object ()	813	object::object ()
668	{	814	{
669	SET_FLAG (this, FLAG_REMOVED);	815	SET_FLAG (this, FLAG_REMOVED);
670		816
671	expmul = 1.0;	817	expmul = 1.0;
672	face = blank_face;	818	face = blank_face;
673	}	819	}
674		820
675	object::~object ()	821	object::~object ()
676	{	822	{
		823	unlink ();
		824
677	free_key_values (this);	825	free_key_values (this);
678	}	826	}
679		827
		828	static int object_count;
		829
680	void object::link ()	830	void object::link ()
681	{	831	{
		832	assert (!index);//D
		833	uuid = UUID::gen ();
682	count = ++ob_count;	834	count = ++object_count;
683	uuid = gen_uuid ();
684		835
685	prev = 0;	836	refcnt_inc ();
686	next = object::first;	837	objects.insert (this);
687
688	if (object::first)
689	object::first->prev = this;
690
691	object::first = this;
692	}	838	}
693		839
694	void object::unlink ()	840	void object::unlink ()
695	{	841	{
696	if (this == object::first)	842	if (!index)
697	object::first = next;	843	return;
698		844
699	/* Remove this object from the list of used objects */	845	objects.erase (this);
700	if (prev) prev->next = next;	846	refcnt_dec ();
701	if (next) next->prev = prev;
702
703	prev = 0;
704	next = 0;
705	}
706
707	bool
708	object::active () const
709	{
710	return active_next || active_prev || this == active_objects;
711	}	847	}
712		848
713	void	849	void
714	object::activate ()	850	object::activate ()
715	{	851	{
716	/* If already on active list, don't do anything */	852	/* If already on active list, don't do anything */
717	if (active ())	853	if (active)
718	return;	854	return;
719		855
720	if (has_active_speed ())	856	if (has_active_speed ())
721	{	857	actives.insert (this);
722	/* process_events() expects us to insert the object at the beginning
723	* of the list. */
724	active_next = active_objects;
725
726	if (active_next)
727	active_next->active_prev = this;
728
729	active_objects = this;
730	}
731	}	858	}
732		859
733	void	860	void
734	object::activate_recursive ()	861	object::activate_recursive ()
735	{	862	{
…		…
749	*/	876	*/
750	void	877	void
751	object::deactivate ()	878	object::deactivate ()
752	{	879	{
753	/* If not on the active list, nothing needs to be done */	880	/* If not on the active list, nothing needs to be done */
754	if (!active ())	881	if (!active)
755	return;	882	return;
756		883
757	if (active_prev == 0)	884	actives.erase (this);
758	{
759	active_objects = active_next;
760	if (active_next)
761	active_next->active_prev = 0;
762	}
763	else
764	{
765	active_prev->active_next = active_next;
766	if (active_next)
767	active_next->active_prev = active_prev;
768	}
769
770	active_next = 0;
771	active_prev = 0;
772	}	885	}
773		886
774	void	887	void
775	object::deactivate_recursive ()	888	object::deactivate_recursive ()
776	{	889	{
…		…
798	object::destroy_inv (bool drop_to_ground)	911	object::destroy_inv (bool drop_to_ground)
799	{	912	{
800	// need to check first, because the checks below might segfault	913	// need to check first, because the checks below might segfault
801	// as we might be on an invalid mapspace and crossfire code	914	// as we might be on an invalid mapspace and crossfire code
802	// is too buggy to ensure that the inventory is empty.	915	// is too buggy to ensure that the inventory is empty.
803	// corollary: if you create arrows etc. with stuff in tis inventory,	916	// corollary: if you create arrows etc. with stuff in its inventory,
804	// cf will crash below with off-map x and y	917	// cf will crash below with off-map x and y
805	if (!inv)	918	if (!inv)
806	return;	919	return;
807		920
808	/* Only if the space blocks everything do we not process -	921	/* Only if the space blocks everything do we not process -
809	* if some form of movement is allowed, let objects	922	* if some form of movement is allowed, let objects
810	* drop on that space.	923	* drop on that space.
811	*/	924	*/
812	if (!drop_to_ground	925	if (!drop_to_ground
813	|| !map	926	|| !map
814	|| map->in_memory != MAP_IN_MEMORY	927	|| map->in_memory != MAP_ACTIVE
		928	|| map->nodrop
815	|| ms ().move_block == MOVE_ALL)	929	|| ms ().move_block == MOVE_ALL)
816	{	930	{
817	while (inv)	931	while (inv)
818	{	932	{
819	inv->destroy_inv (drop_to_ground);	933	inv->destroy_inv (false);
820	inv->destroy ();	934	inv->destroy ();
821	}	935	}
822	}	936	}
823	else	937	else
824	{ /* Put objects in inventory onto this space */	938	{ /* Put objects in inventory onto this space */
…		…
828		942
829	if (op->flag [FLAG_STARTEQUIP]	943	if (op->flag [FLAG_STARTEQUIP]
830	|| op->flag [FLAG_NO_DROP]	944	|| op->flag [FLAG_NO_DROP]
831	|| op->type == RUNE	945	|| op->type == RUNE
832	|| op->type == TRAP	946	|| op->type == TRAP
833	|| op->flag [FLAG_IS_A_TEMPLATE])	947	|| op->flag [FLAG_IS_A_TEMPLATE]
		948	|| op->flag [FLAG_DESTROY_ON_DEATH])
834	op->destroy ();	949	op->destroy (true);
835	else	950	else
836	map->insert (op, x, y);	951	map->insert (op, x, y);
837	}	952	}
838	}	953	}
839	}	954	}
…		…
843	object *op = new object;	958	object *op = new object;
844	op->link ();	959	op->link ();
845	return op;	960	return op;
846	}	961	}
847		962
		963	static struct freed_map : maptile
		964	{
		965	freed_map ()
		966	{
		967	path = "<freed objects map>";
		968	name = "/internal/freed_objects_map";
		969	width = 3;
		970	height = 3;
		971	nodrop = 1;
		972
		973	alloc ();
		974	in_memory = MAP_ACTIVE;
		975	}
		976	} freed_map; // freed objects are moved here to avoid crashes
		977
848	void	978	void
849	object::do_destroy ()	979	object::do_destroy ()
850	{	980	{
851	if (flag [FLAG_IS_LINKED])	981	if (flag [FLAG_IS_LINKED])
852	remove_button_link (this);	982	remove_button_link (this);
853		983
854	if (flag [FLAG_FRIENDLY])	984	if (flag [FLAG_FRIENDLY])
855	remove_friendly_object (this);	985	remove_friendly_object (this);
856		986
857	if (!flag [FLAG_REMOVED])
858	remove ();	987	remove ();
859		988
860	if (flag [FLAG_FREED])	989	attachable::do_destroy ();
861	return;
862		990
863	set_speed (0);	991	deactivate ();
		992	unlink ();
864		993
865	flag [FLAG_FREED] = 1;	994	flag [FLAG_FREED] = 1;
866		995
867	attachable::do_destroy ();
868
869	destroy_inv (true);
870	unlink ();
871
872	// hack to ensure that freed objects still have a valid map	996	// hack to ensure that freed objects still have a valid map
873	{
874	static maptile *freed_map; // freed objects are moved here to avoid crashes
875
876	if (!freed_map)
877	{
878	freed_map = new maptile;
879
880	freed_map->name = "/internal/freed_objects_map";
881	freed_map->width = 3;
882	freed_map->height = 3;
883
884	freed_map->alloc ();
885	freed_map->in_memory = MAP_IN_MEMORY;
886	}
887
888	map = freed_map;	997	map = &freed_map;
889	x = 1;	998	x = 1;
890	y = 1;	999	y = 1;
891	}
892
893	head = 0;
894		1000
895	if (more)	1001	if (more)
896	{	1002	{
897	more->destroy ();	1003	more->destroy ();
898	more = 0;	1004	more = 0;
899	}	1005	}
900		1006
		1007	head = 0;
		1008
901	// clear those pointers that likely might have circular references to us	1009	// clear those pointers that likely might cause circular references
902	owner = 0;	1010	owner = 0;
903	enemy = 0;	1011	enemy = 0;
904	attacked_by = 0;	1012	attacked_by = 0;
905		1013	current_weapon = 0;
906	// only relevant for players(?), but make sure of it anyways
907	contr = 0;
908	}	1014	}
909		1015
910	void	1016	void
911	object::destroy (bool destroy_inventory)	1017	object::destroy (bool destroy_inventory)
912	{	1018	{
913	if (destroyed ())	1019	if (destroyed ())
914	return;	1020	return;
915		1021
		1022	if (!is_head () && !head->destroyed ())
		1023	{
		1024	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1025	head->destroy (destroy_inventory);
		1026	return;
		1027	}
		1028
916	if (destroy_inventory)	1029	destroy_inv (!destroy_inventory);
917	destroy_inv (false);	1030
		1031	if (is_head ())
		1032	if (sound_destroy)
		1033	play_sound (sound_destroy);
		1034	else if (flag [FLAG_MONSTER])
		1035	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
918		1036
919	attachable::destroy ();	1037	attachable::destroy ();
920	}
921
922	/*
923	* sub_weight() recursively (outwards) subtracts a number from the
924	* weight of an object (and what is carried by it's environment(s)).
925	*/
926	void
927	sub_weight (object *op, signed long weight)
928	{
929	while (op != NULL)
930	{
931	if (op->type == CONTAINER)
932	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
933
934	op->carrying -= weight;
935	op = op->env;
936	}
937	}	1038	}
938		1039
939	/* op->remove ():	1040	/* op->remove ():
940	* This function removes the object op from the linked list of objects	1041	* This function removes the object op from the linked list of objects
941	* which it is currently tied to. When this function is done, the	1042	* which it is currently tied to. When this function is done, the
942	* object will have no environment. If the object previously had an	1043	* object will have no environment. If the object previously had an
943	* environment, the x and y coordinates will be updated to	1044	* environment, the x and y coordinates will be updated to
944	* the previous environment.	1045	* the previous environment.
945	* Beware: This function is called from the editor as well!
946	*/	1046	*/
947	void	1047	void
948	object::remove ()	1048	object::do_remove ()
949	{	1049	{
950	object *tmp, *last = 0;	1050	object *tmp, *last = 0;
951	object *otmp;	1051	object *otmp;
952		1052
953	if (QUERY_FLAG (this, FLAG_REMOVED))	1053	if (flag [FLAG_REMOVED])
954	return;	1054	return;
955		1055
956	SET_FLAG (this, FLAG_REMOVED);
957	INVOKE_OBJECT (REMOVE, this);	1056	INVOKE_OBJECT (REMOVE, this);
		1057
		1058	flag [FLAG_REMOVED] = true;
958		1059
959	if (more)	1060	if (more)
960	more->remove ();	1061	more->remove ();
961		1062
962	/*	1063	/*
963	* In this case, the object to be removed is in someones	1064	* In this case, the object to be removed is in someones
964	* inventory.	1065	* inventory.
965	*/	1066	*/
966	if (env)	1067	if (env)
967	{	1068	{
		1069	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
		1070	if (object *pl = visible_to ())
		1071	esrv_del_item (pl->contr, count);
		1072	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1073
		1074	adjust_weight (env, -total_weight ());
		1075
		1076	*(above ? &above->below : &env->inv) = below;
		1077
968	if (nrof)	1078	if (below)
969	sub_weight (env, weight * nrof);	1079	below->above = above;
970	else	1080
971	sub_weight (env, weight + carrying);	1081	/* we set up values so that it could be inserted into
		1082	* the map, but we don't actually do that - it is up
		1083	* to the caller to decide what we want to do.
		1084	*/
		1085	map = env->map;
		1086	x = env->x;
		1087	y = env->y;
		1088	above = 0;
		1089	below = 0;
		1090	env = 0;
972		1091
973	/* NO_FIX_PLAYER is set when a great many changes are being	1092	/* NO_FIX_PLAYER is set when a great many changes are being
974	* made to players inventory. If set, avoiding the call	1093	* made to players inventory. If set, avoiding the call
975	* to save cpu time.	1094	* to save cpu time.
976	*/	1095	*/
977	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1096	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
978	otmp->update_stats ();	1097	otmp->update_stats ();
979
980	if (above)
981	above->below = below;
982	else
983	env->inv = below;
984
985	if (below)
986	below->above = above;
987
988	/* we set up values so that it could be inserted into
989	* the map, but we don't actually do that - it is up
990	* to the caller to decide what we want to do.
991	*/
992	x = env->x, y = env->y;
993	map = env->map;
994	above = 0, below = 0;
995	env = 0;
996	}	1098	}
997	else if (map)	1099	else if (map)
998	{	1100	{
999	if (type == PLAYER)	1101	map->dirty = true;
		1102	mapspace &ms = this->ms ();
		1103
		1104	if (object *pl = ms.player ())
1000	{	1105	{
		1106	if (type == PLAYER) // this == pl(!)
		1107	{
		1108	// leaving a spot always closes any open container on the ground
		1109	if (container && !container->env)
		1110	// this causes spurious floorbox updates, but it ensures
		1111	// that the CLOSE event is being sent.
		1112	close_container ();
		1113
1001	--map->players;	1114	--map->players;
1002	map->touch ();	1115	map->touch ();
		1116	}
		1117	else if (pl->container == this)
		1118	{
		1119	// removing a container should close it
		1120	close_container ();
		1121	}
		1122
		1123	esrv_del_item (pl->contr, count);
1003	}	1124	}
1004
1005	map->dirty = true;
1006		1125
1007	/* link the object above us */	1126	/* link the object above us */
1008	if (above)	1127	if (above)
1009	above->below = below;	1128	above->below = below;
1010	else	1129	else
1011	map->at (x, y).top = below; /* we were top, set new top */	1130	ms.top = below; /* we were top, set new top */
1012		1131
1013	/* Relink the object below us, if there is one */	1132	/* Relink the object below us, if there is one */
1014	if (below)	1133	if (below)
1015	below->above = above;	1134	below->above = above;
1016	else	1135	else
…		…
1018	/* Nothing below, which means we need to relink map object for this space	1137	/* Nothing below, which means we need to relink map object for this space
1019	* use translated coordinates in case some oddness with map tiling is	1138	* use translated coordinates in case some oddness with map tiling is
1020	* evident	1139	* evident
1021	*/	1140	*/
1022	if (GET_MAP_OB (map, x, y) != this)	1141	if (GET_MAP_OB (map, x, y) != this)
1023	{
1024	char *dump = dump_object (this);
1025	LOG (llevError,
1026	"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);	1142	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 ());
1027	free (dump);
1028	dump = dump_object (GET_MAP_OB (map, x, y));
1029	LOG (llevError, "%s\n", dump);
1030	free (dump);
1031	}
1032		1143
1033	map->at (x, y).bot = above; /* goes on above it. */	1144	ms.bot = above; /* goes on above it. */
1034	}	1145	}
1035		1146
1036	above = 0;	1147	above = 0;
1037	below = 0;	1148	below = 0;
1038		1149
1039	if (map->in_memory == MAP_SAVING)	1150	if (map->in_memory == MAP_SAVING)
1040	return;	1151	return;
1041		1152
1042	int check_walk_off = !flag [FLAG_NO_APPLY];	1153	int check_walk_off = !flag [FLAG_NO_APPLY];
1043		1154
		1155	if (object *pl = ms.player ())
		1156	{
		1157	if (pl->container == this)
		1158	/* If a container that the player is currently using somehow gets
		1159	* removed (most likely destroyed), update the player view
		1160	* appropriately.
		1161	*/
		1162	pl->close_container ();
		1163
		1164	//TODO: the floorbox prev/next might need updating
		1165	//esrv_del_item (pl->contr, count);
		1166	//TODO: update floorbox to preserve ordering
		1167	if (pl->contr->ns)
		1168	pl->contr->ns->floorbox_update ();
		1169	}
		1170
1044	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1171	for (tmp = ms.bot; tmp; tmp = tmp->above)
1045	{	1172	{
1046	/* No point updating the players look faces if he is the object	1173	/* No point updating the players look faces if he is the object
1047	* being removed.	1174	* being removed.
1048	*/	1175	*/
1049
1050	if (tmp->type == PLAYER && tmp != this)
1051	{
1052	/* If a container that the player is currently using somehow gets
1053	* removed (most likely destroyed), update the player view
1054	* appropriately.
1055	*/
1056	if (tmp->container == this)
1057	{
1058	flag [FLAG_APPLIED] = 0;
1059	tmp->container = 0;
1060	}
1061
1062	if (tmp->contr->ns)
1063	tmp->contr->ns->floorbox_update ();
1064	}
1065		1176
1066	/* See if object moving off should effect something */	1177	/* See if object moving off should effect something */
1067	if (check_walk_off	1178	if (check_walk_off
1068	&& ((move_type & tmp->move_off)	1179	&& ((move_type & tmp->move_off)
1069	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1180	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1072		1183
1073	if (destroyed ())	1184	if (destroyed ())
1074	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1185	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1075	}	1186	}
1076		1187
1077	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1078	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1079	if (tmp->above == tmp)
1080	tmp->above = 0;
1081
1082	last = tmp;	1188	last = tmp;
1083	}	1189	}
1084		1190
1085	/* last == NULL if there are no objects on this space */	1191	/* last == NULL if there are no objects on this space */
1086	//TODO: this makes little sense, why only update the topmost object?	1192	//TODO: this makes little sense, why only update the topmost object?
…		…
1106	merge_ob (object *op, object *top)	1212	merge_ob (object *op, object *top)
1107	{	1213	{
1108	if (!op->nrof)	1214	if (!op->nrof)
1109	return 0;	1215	return 0;
1110		1216
1111	if (top)	1217	if (!top)
1112	for (top = op; top && top->above; top = top->above)	1218	for (top = op; top && top->above; top = top->above)
1113	;	1219	;
1114		1220
1115	for (; top; top = top->below)	1221	for (; top; top = top->below)
1116	{
1117	if (top == op)
1118	continue;
1119
1120	if (object::can_merge (op, top))	1222	if (object::can_merge (op, top))
1121	{	1223	{
1122	top->nrof += op->nrof;	1224	top->nrof += op->nrof;
1123		1225
1124	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1226	if (object *pl = top->visible_to ())
1125	op->weight = 0; /* Don't want any adjustements now */	1227	esrv_update_item (UPD_NROF, pl, top);
		1228
		1229	op->weight = 0; // cancel the addition above
		1230	op->carrying = 0; // must be 0 already
		1231
1126	op->destroy ();	1232	op->destroy (1);
		1233
1127	return top;	1234	return top;
1128	}	1235	}
1129	}
1130		1236
1131	return 0;	1237	return 0;
1132	}	1238	}
1133		1239
		1240	void
		1241	object::expand_tail ()
		1242	{
		1243	if (more)
		1244	return;
		1245
		1246	object *prev = this;
		1247
		1248	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1249	{
		1250	object *op = arch_to_object (at);
		1251
		1252	op->name = name;
		1253	op->name_pl = name_pl;
		1254	op->title = title;
		1255
		1256	op->head = this;
		1257	prev->more = op;
		1258
		1259	prev = op;
		1260	}
		1261	}
		1262
1134	/*	1263	/*
1135	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1264	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1136	* job preparing multi-part monsters	1265	* job preparing multi-part monsters.
1137	*/	1266	*/
1138	object *	1267	object *
1139	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1268	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1140	{	1269	{
1141	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1270	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1142	{	1271	{
1143	tmp->x = x + tmp->arch->clone.x;	1272	tmp->x = x + tmp->arch->x;
1144	tmp->y = y + tmp->arch->clone.y;	1273	tmp->y = y + tmp->arch->y;
1145	}	1274	}
1146		1275
1147	return insert_ob_in_map (op, m, originator, flag);	1276	return insert_ob_in_map (op, m, originator, flag);
1148	}	1277	}
1149		1278
…		…
1168	* just 'op' otherwise	1297	* just 'op' otherwise
1169	*/	1298	*/
1170	object *	1299	object *
1171	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1300	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1172	{	1301	{
1173	object *tmp, *top, *floor = NULL;	1302	assert (!op->flag [FLAG_FREED]);
1174	sint16 x, y;
1175		1303
1176	if (QUERY_FLAG (op, FLAG_FREED))	1304	op->remove ();
1177	{
1178	LOG (llevError, "Trying to insert freed object!\n");
1179	return NULL;
1180	}
1181
1182	if (!m)
1183	{
1184	char *dump = dump_object (op);
1185	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1186	free (dump);
1187	return op;
1188	}
1189
1190	if (out_of_map (m, op->x, op->y))
1191	{
1192	char *dump = dump_object (op);
1193	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1194	#ifdef MANY_CORES
1195	/* Better to catch this here, as otherwise the next use of this object
1196	* is likely to cause a crash. Better to find out where it is getting
1197	* improperly inserted.
1198	*/
1199	abort ();
1200	#endif
1201	free (dump);
1202	return op;
1203	}
1204
1205	if (!QUERY_FLAG (op, FLAG_REMOVED))
1206	{
1207	char *dump = dump_object (op);
1208	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1209	free (dump);
1210	return op;
1211	}
1212
1213	if (op->more)
1214	{
1215	/* The part may be on a different map. */
1216
1217	object *more = op->more;
1218
1219	/* We really need the caller to normalise coordinates - if
1220	* we set the map, that doesn't work if the location is within
1221	* a map and this is straddling an edge. So only if coordinate
1222	* is clear wrong do we normalise it.
1223	*/
1224	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1225	more->map = get_map_from_coord (m, &more->x, &more->y);
1226	else if (!more->map)
1227	{
1228	/* For backwards compatibility - when not dealing with tiled maps,
1229	* more->map should always point to the parent.
1230	*/
1231	more->map = m;
1232	}
1233
1234	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1235	{
1236	if (!op->head)
1237	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1238
1239	return 0;
1240	}
1241	}
1242
1243	CLEAR_FLAG (op, FLAG_REMOVED);
1244		1305
1245	/* Ideally, the caller figures this out. However, it complicates a lot	1306	/* Ideally, the caller figures this out. However, it complicates a lot
1246	* of areas of callers (eg, anything that uses find_free_spot would now	1307	* of areas of callers (eg, anything that uses find_free_spot would now
1247	* need extra work	1308	* need extra work
1248	*/	1309	*/
1249	op->map = get_map_from_coord (m, &op->x, &op->y);	1310	if (!xy_normalise (m, op->x, op->y))
1250	x = op->x;	1311	{
1251	y = op->y;	1312	op->destroy (1);
		1313	return 0;
		1314	}
		1315
		1316	if (object *more = op->more)
		1317	if (!insert_ob_in_map (more, m, originator, flag))
		1318	return 0;
		1319
		1320	CLEAR_FLAG (op, FLAG_REMOVED);
		1321
		1322	op->map = m;
		1323	mapspace &ms = op->ms ();
1252		1324
1253	/* this has to be done after we translate the coordinates.	1325	/* this has to be done after we translate the coordinates.
1254	*/	1326	*/
1255	if (op->nrof && !(flag & INS_NO_MERGE))	1327	if (op->nrof && !(flag & INS_NO_MERGE))
1256	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1328	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1257	if (object::can_merge (op, tmp))	1329	if (object::can_merge (op, tmp))
1258	{	1330	{
		1331	// TODO: we atcually want to update tmp, not op,
		1332	// but some caller surely breaks when we return tmp
		1333	// from here :/
1259	op->nrof += tmp->nrof;	1334	op->nrof += tmp->nrof;
1260	tmp->destroy ();	1335	tmp->destroy (1);
1261	}	1336	}
1262		1337
1263	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1338	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1264	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1339	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1265		1340
…		…
1278	op->below = originator->below;	1353	op->below = originator->below;
1279		1354
1280	if (op->below)	1355	if (op->below)
1281	op->below->above = op;	1356	op->below->above = op;
1282	else	1357	else
1283	op->ms ().bot = op;	1358	ms.bot = op;
1284		1359
1285	/* since *below* originator, no need to update top */	1360	/* since *below* originator, no need to update top */
1286	originator->below = op;	1361	originator->below = op;
1287	}	1362	}
1288	else	1363	else
1289	{	1364	{
		1365	object *top, *floor = NULL;
		1366
		1367	top = ms.bot;
		1368
1290	/* If there are other objects, then */	1369	/* If there are other objects, then */
1291	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1370	if (top)
1292	{	1371	{
1293	object *last = 0;	1372	object *last = 0;
1294		1373
1295	/*	1374	/*
1296	* If there are multiple objects on this space, we do some trickier handling.	1375	* If there are multiple objects on this space, we do some trickier handling.
…		…
1302	* once we get to them. This reduces the need to traverse over all of	1381	* once we get to them. This reduces the need to traverse over all of
1303	* them when adding another one - this saves quite a bit of cpu time	1382	* them when adding another one - this saves quite a bit of cpu time
1304	* when lots of spells are cast in one area. Currently, it is presumed	1383	* when lots of spells are cast in one area. Currently, it is presumed
1305	* that flying non pickable objects are spell objects.	1384	* that flying non pickable objects are spell objects.
1306	*/	1385	*/
1307	while (top)	1386	for (top = ms.bot; top; top = top->above)
1308	{	1387	{
1309	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1388	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1310	floor = top;	1389	floor = top;
1311		1390
1312	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1391	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1315	top = top->below;	1394	top = top->below;
1316	break;	1395	break;
1317	}	1396	}
1318		1397
1319	last = top;	1398	last = top;
1320	top = top->above;
1321	}	1399	}
1322		1400
1323	/* Don't want top to be NULL, so set it to the last valid object */	1401	/* Don't want top to be NULL, so set it to the last valid object */
1324	top = last;	1402	top = last;
1325		1403
…		…
1327	* looks like instead of lots of conditions here.	1405	* looks like instead of lots of conditions here.
1328	* makes things faster, and effectively the same result.	1406	* makes things faster, and effectively the same result.
1329	*/	1407	*/
1330		1408
1331	/* Have object 'fall below' other objects that block view.	1409	/* Have object 'fall below' other objects that block view.
1332	* Unless those objects are exits, type 66	1410	* Unless those objects are exits.
1333	* If INS_ON_TOP is used, don't do this processing	1411	* If INS_ON_TOP is used, don't do this processing
1334	* Need to find the object that in fact blocks view, otherwise	1412	* Need to find the object that in fact blocks view, otherwise
1335	* stacking is a bit odd.	1413	* stacking is a bit odd.
1336	*/	1414	*/
1337	if (!(flag & INS_ON_TOP) &&	1415	if (!(flag & INS_ON_TOP)
1338	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1416	&& ms.flags () & P_BLOCKSVIEW
		1417	&& (op->face && !faces [op->face].visibility))
1339	{	1418	{
1340	for (last = top; last != floor; last = last->below)	1419	for (last = top; last != floor; last = last->below)
1341	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1420	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1342	break;	1421	break;
		1422
1343	/* Check to see if we found the object that blocks view,	1423	/* Check to see if we found the object that blocks view,
1344	* and make sure we have a below pointer for it so that	1424	* and make sure we have a below pointer for it so that
1345	* we can get inserted below this one, which requires we	1425	* we can get inserted below this one, which requires we
1346	* set top to the object below us.	1426	* set top to the object below us.
1347	*/	1427	*/
1348	if (last && last->below && last != floor)	1428	if (last && last->below && last != floor)
1349	top = last->below;	1429	top = last->below;
1350	}	1430	}
1351	} /* If objects on this space */	1431	} /* If objects on this space */
1352		1432
1353	if (flag & INS_MAP_LOAD)
1354	top = GET_MAP_TOP (op->map, op->x, op->y);
1355
1356	if (flag & INS_ABOVE_FLOOR_ONLY)	1433	if (flag & INS_ABOVE_FLOOR_ONLY)
1357	top = floor;	1434	top = floor;
1358		1435
1359	/* Top is the object that our object (op) is going to get inserted above.	1436	/* Top is the object that our object (op) is going to get inserted above.
1360	*/	1437	*/
1361		1438
1362	/* First object on this space */	1439	/* First object on this space */
1363	if (!top)	1440	if (!top)
1364	{	1441	{
1365	op->above = GET_MAP_OB (op->map, op->x, op->y);	1442	op->above = ms.bot;
1366		1443
1367	if (op->above)	1444	if (op->above)
1368	op->above->below = op;	1445	op->above->below = op;
1369		1446
1370	op->below = 0;	1447	op->below = 0;
1371	op->ms ().bot = op;	1448	ms.bot = op;
1372	}	1449	}
1373	else	1450	else
1374	{ /* get inserted into the stack above top */	1451	{ /* get inserted into the stack above top */
1375	op->above = top->above;	1452	op->above = top->above;
1376		1453
…		…
1380	op->below = top;	1457	op->below = top;
1381	top->above = op;	1458	top->above = op;
1382	}	1459	}
1383		1460
1384	if (!op->above)	1461	if (!op->above)
1385	op->ms ().top = op;	1462	ms.top = op;
1386	} /* else not INS_BELOW_ORIGINATOR */	1463	} /* else not INS_BELOW_ORIGINATOR */
1387		1464
1388	if (op->type == PLAYER)	1465	if (op->type == PLAYER)
1389	{	1466	{
1390	op->contr->do_los = 1;	1467	op->contr->do_los = 1;
…		…
1392	op->map->touch ();	1469	op->map->touch ();
1393	}	1470	}
1394		1471
1395	op->map->dirty = true;	1472	op->map->dirty = true;
1396		1473
1397	/* If we have a floor, we know the player, if any, will be above
1398	* it, so save a few ticks and start from there.
1399	*/
1400	if (!(flag & INS_MAP_LOAD))
1401	if (object *pl = op->ms ().player ())	1474	if (object *pl = ms.player ())
		1475	//TODO: the floorbox prev/next might need updating
		1476	//esrv_send_item (pl, op);
		1477	//TODO: update floorbox to preserve ordering
1402	if (pl->contr->ns)	1478	if (pl->contr->ns)
1403	pl->contr->ns->floorbox_update ();	1479	pl->contr->ns->floorbox_update ();
1404		1480
1405	/* If this object glows, it may affect lighting conditions that are	1481	/* If this object glows, it may affect lighting conditions that are
1406	* visible to others on this map. But update_all_los is really	1482	* visible to others on this map. But update_all_los is really
1407	* an inefficient way to do this, as it means los for all players	1483	* an inefficient way to do this, as it means los for all players
1408	* on the map will get recalculated. The players could very well	1484	* on the map will get recalculated. The players could very well
…		…
1427	* blocked() and wall() work properly), and these flags are updated by	1503	* blocked() and wall() work properly), and these flags are updated by
1428	* update_object().	1504	* update_object().
1429	*/	1505	*/
1430		1506
1431	/* if this is not the head or flag has been passed, don't check walk on status */	1507	/* if this is not the head or flag has been passed, don't check walk on status */
1432	if (!(flag & INS_NO_WALK_ON) && !op->head)	1508	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1433	{	1509	{
1434	if (check_move_on (op, originator))	1510	if (check_move_on (op, originator))
1435	return 0;	1511	return 0;
1436		1512
1437	/* If we are a multi part object, lets work our way through the check	1513	/* If we are a multi part object, lets work our way through the check
1438	* walk on's.	1514	* walk on's.
1439	*/	1515	*/
1440	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1516	for (object *tmp = op->more; tmp; tmp = tmp->more)
1441	if (check_move_on (tmp, originator))	1517	if (check_move_on (tmp, originator))
1442	return 0;	1518	return 0;
1443	}	1519	}
1444		1520
1445	return op;	1521	return op;
…		…
1450	* op is the object to insert it under: supplies x and the map.	1526	* op is the object to insert it under: supplies x and the map.
1451	*/	1527	*/
1452	void	1528	void
1453	replace_insert_ob_in_map (const char *arch_string, object *op)	1529	replace_insert_ob_in_map (const char *arch_string, object *op)
1454	{	1530	{
1455	object *tmp, *tmp1;
1456
1457	/* first search for itself and remove any old instances */	1531	/* first search for itself and remove any old instances */
1458		1532
1459	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1533	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1460	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1534	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1461	tmp->destroy ();	1535	tmp->destroy (1);
1462		1536
1463	tmp1 = arch_to_object (archetype::find (arch_string));	1537	object *tmp = arch_to_object (archetype::find (arch_string));
1464		1538
1465	tmp1->x = op->x;	1539	tmp->x = op->x;
1466	tmp1->y = op->y;	1540	tmp->y = op->y;
		1541
1467	insert_ob_in_map (tmp1, op->map, op, 0);	1542	insert_ob_in_map (tmp, op->map, op, 0);
1468	}	1543	}
1469		1544
1470	object *	1545	object *
1471	object::insert_at (object *where, object *originator, int flags)	1546	object::insert_at (object *where, object *originator, int flags)
1472	{	1547	{
		1548	if (where->env)
		1549	return where->env->insert (this);
		1550	else
1473	where->map->insert (this, where->x, where->y, originator, flags);	1551	return where->map->insert (this, where->x, where->y, originator, flags);
1474	}	1552	}
1475		1553
1476	/*	1554	/*
1477	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1478	* is returned contains nr objects, and the remaining parts contains
1479	* the rest (or is removed and freed if that number is 0).
1480	* On failure, NULL is returned, and the reason put into the
1481	* global static errmsg array.
1482	*/
1483	object *
1484	get_split_ob (object *orig_ob, uint32 nr)
1485	{
1486	object *newob;
1487	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1488
1489	if (orig_ob->nrof < nr)
1490	{
1491	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1492	return NULL;
1493	}
1494
1495	newob = object_create_clone (orig_ob);
1496
1497	if ((orig_ob->nrof -= nr) < 1)
1498	orig_ob->destroy (1);
1499	else if (!is_removed)
1500	{
1501	if (orig_ob->env != NULL)
1502	sub_weight (orig_ob->env, orig_ob->weight * nr);
1503	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1504	{
1505	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1506	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1507	return NULL;
1508	}
1509	}
1510
1511	newob->nrof = nr;
1512
1513	return newob;
1514	}
1515
1516	/*
1517	* decrease_ob_nr(object, number) decreases a specified number from	1555	* decrease(object, number) decreases a specified number from
1518	* the amount of an object. If the amount reaches 0, the object	1556	* the amount of an object. If the amount reaches 0, the object
1519	* is subsequently removed and freed.	1557	* is subsequently removed and freed.
1520	*	1558	*
1521	* Return value: 'op' if something is left, NULL if the amount reached 0	1559	* Return value: 'op' if something is left, NULL if the amount reached 0
1522	*/	1560	*/
		1561	bool
		1562	object::decrease (sint32 nr)
		1563	{
		1564	if (!nr)
		1565	return true;
1523		1566
		1567	nr = min (nr, nrof);
		1568
		1569	nrof -= nr;
		1570
		1571	if (nrof)
		1572	{
		1573	adjust_weight (env, -weight * nr); // carrying == 0
		1574
		1575	if (object *pl = visible_to ())
		1576	esrv_update_item (UPD_NROF, pl, this);
		1577
		1578	return true;
		1579	}
		1580	else
		1581	{
		1582	destroy (1);
		1583	return false;
		1584	}
		1585	}
		1586
		1587	/*
		1588	* split(ob,nr) splits up ob into two parts. The part which
		1589	* is returned contains nr objects, and the remaining parts contains
		1590	* the rest (or is removed and returned if that number is 0).
		1591	* On failure, NULL is returned.
		1592	*/
1524	object *	1593	object *
1525	decrease_ob_nr (object *op, uint32 i)	1594	object::split (sint32 nr)
1526	{	1595	{
1527	object *tmp;	1596	int have = number_of ();
1528		1597
1529	if (i == 0) /* objects with op->nrof require this check */	1598	if (have < nr)
1530	return op;	1599	return 0;
1531		1600	else if (have == nr)
1532	if (i > op->nrof)
1533	i = op->nrof;
1534
1535	if (QUERY_FLAG (op, FLAG_REMOVED))
1536	op->nrof -= i;
1537	else if (op->env)
1538	{	1601	{
1539	/* is this object in the players inventory, or sub container
1540	* therein?
1541	*/
1542	tmp = op->in_player ();
1543	/* nope. Is this a container the player has opened?
1544	* If so, set tmp to that player.
1545	* IMO, searching through all the players will mostly
1546	* likely be quicker than following op->env to the map,
1547	* and then searching the map for a player.
1548	*/
1549	if (!tmp)
1550	for_all_players (pl)
1551	if (pl->ob->container == op->env)
1552	{
1553	tmp = pl->ob;
1554	break;
1555	}
1556
1557	if (i < op->nrof)
1558	{
1559	sub_weight (op->env, op->weight * i);
1560	op->nrof -= i;
1561	if (tmp)
1562	esrv_send_item (tmp, op);
1563	}
1564	else
1565	{
1566	op->remove ();	1602	remove ();
1567	op->nrof = 0;	1603	return this;
1568	if (tmp)
1569	esrv_del_item (tmp->contr, op->count);
1570	}
1571	}	1604	}
1572	else	1605	else
1573	{	1606	{
1574	object *above = op->above;	1607	decrease (nr);
1575		1608
1576	if (i < op->nrof)	1609	object *op = object_create_clone (this);
1577	op->nrof -= i;	1610	op->nrof = nr;
1578	else
1579	{
1580	op->remove ();
1581	op->nrof = 0;
1582	}
1583
1584	/* Since we just removed op, op->above is null */
1585	for (tmp = above; tmp; tmp = tmp->above)
1586	if (tmp->type == PLAYER)
1587	{
1588	if (op->nrof)
1589	esrv_send_item (tmp, op);
1590	else
1591	esrv_del_item (tmp->contr, op->count);
1592	}
1593	}
1594
1595	if (op->nrof)
1596	return op;	1611	return op;
1597	else
1598	{
1599	op->destroy ();
1600	return 0;
1601	}
1602	}
1603
1604	/*
1605	* add_weight(object, weight) adds the specified weight to an object,
1606	* and also updates how much the environment(s) is/are carrying.
1607	*/
1608
1609	void
1610	add_weight (object *op, signed long weight)
1611	{
1612	while (op != NULL)
1613	{
1614	if (op->type == CONTAINER)
1615	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1616
1617	op->carrying += weight;
1618	op = op->env;
1619	}	1612	}
1620	}	1613	}
1621		1614
1622	object *	1615	object *
1623	insert_ob_in_ob (object *op, object *where)	1616	insert_ob_in_ob (object *op, object *where)
…		…
1628	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1621	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1629	free (dump);	1622	free (dump);
1630	return op;	1623	return op;
1631	}	1624	}
1632		1625
1633	if (where->head)	1626	if (where->head_ () != where)
1634	{	1627	{
1635	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1628	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1636	where = where->head;	1629	where = where->head;
1637	}	1630	}
1638		1631
1639	return where->insert (op);	1632	return where->insert (op);
1640	}	1633	}
…		…
1645	* inside the object environment.	1638	* inside the object environment.
1646	*	1639	*
1647	* The function returns now pointer to inserted item, and return value can	1640	* The function returns now pointer to inserted item, and return value can
1648	* be != op, if items are merged. -Tero	1641	* be != op, if items are merged. -Tero
1649	*/	1642	*/
1650
1651	object *	1643	object *
1652	object::insert (object *op)	1644	object::insert (object *op)
1653	{	1645	{
1654	object *tmp, *otmp;
1655
1656	if (!QUERY_FLAG (op, FLAG_REMOVED))
1657	op->remove ();
1658
1659	if (op->more)	1646	if (op->more)
1660	{	1647	{
1661	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1648	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1662	return op;	1649	return op;
1663	}	1650	}
1664		1651
1665	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1652	op->remove ();
1666	CLEAR_FLAG (op, FLAG_REMOVED);	1653
		1654	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1655
1667	if (op->nrof)	1656	if (op->nrof)
1668	{
1669	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1657	for (object *tmp = inv; tmp; tmp = tmp->below)
1670	if (object::can_merge (tmp, op))	1658	if (object::can_merge (tmp, op))
1671	{	1659	{
1672	/* return the original object and remove inserted object	1660	/* return the original object and remove inserted object
1673	(client needs the original object) */	1661	(client needs the original object) */
1674	tmp->nrof += op->nrof;	1662	tmp->nrof += op->nrof;
1675	/* Weight handling gets pretty funky. Since we are adding to	1663
1676	* tmp->nrof, we need to increase the weight.	1664	if (object *pl = tmp->visible_to ())
1677	*/	1665	esrv_update_item (UPD_NROF, pl, tmp);
		1666
1678	add_weight (this, op->weight * op->nrof);	1667	adjust_weight (this, op->total_weight ());
1679	SET_FLAG (op, FLAG_REMOVED);	1668
1680	op->destroy (); /* free the inserted object */	1669	op->destroy (1);
1681	op = tmp;	1670	op = tmp;
1682	op->remove (); /* and fix old object's links */	1671	goto inserted;
1683	CLEAR_FLAG (op, FLAG_REMOVED);
1684	break;
1685	}	1672	}
1686		1673
1687	/* I assume combined objects have no inventory	1674	op->owner = 0; // it's his/hers now. period.
1688	* We add the weight - this object could have just been removed
1689	* (if it was possible to merge). calling remove_ob will subtract
1690	* the weight, so we need to add it in again, since we actually do
1691	* the linking below
1692	*/
1693	add_weight (this, op->weight * op->nrof);
1694	}
1695	else
1696	add_weight (this, (op->weight + op->carrying));
1697
1698	otmp = this->in_player ();
1699	if (otmp && otmp->contr)
1700	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1701	otmp->update_stats ();
1702
1703	op->map = 0;	1675	op->map = 0;
1704	op->env = this;	1676	op->x = 0;
		1677	op->y = 0;
		1678
1705	op->above = 0;	1679	op->above = 0;
1706	op->below = 0;	1680	op->below = inv;
1707	op->x = 0, op->y = 0;	1681	op->env = this;
1708		1682
		1683	if (inv)
		1684	inv->above = op;
		1685
		1686	inv = op;
		1687
		1688	op->flag [FLAG_REMOVED] = 0;
		1689
		1690	if (object *pl = op->visible_to ())
		1691	esrv_send_item (pl, op);
		1692
		1693	adjust_weight (this, op->total_weight ());
		1694
		1695	inserted:
1709	/* reset the light list and los of the players on the map */	1696	/* reset the light list and los of the players on the map */
1710	if ((op->glow_radius != 0) && map)	1697	if (op->glow_radius && map && map->darkness)
1711	{
1712	#ifdef DEBUG_LIGHTS
1713	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1714	#endif /* DEBUG_LIGHTS */
1715	if (map->darkness)
1716	update_all_los (map, x, y);	1698	update_all_los (map, x, y);
1717	}
1718		1699
1719	/* Client has no idea of ordering so lets not bother ordering it here.	1700	// if this is a player's inventory, update stats
1720	* It sure simplifies this function...	1701	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1721	*/	1702	update_stats ();
1722	if (!inv)
1723	inv = op;
1724	else
1725	{
1726	op->below = inv;
1727	op->below->above = op;
1728	inv = op;
1729	}
1730		1703
1731	INVOKE_OBJECT (INSERT, this);	1704	INVOKE_OBJECT (INSERT, this);
1732		1705
1733	return op;	1706	return op;
1734	}	1707	}
…		…
1815	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1788	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1816	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1789	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1817	{	1790	{
1818		1791
1819	float	1792	float
1820	diff = tmp->move_slow_penalty * FABS (op->speed);	1793	diff = tmp->move_slow_penalty * fabs (op->speed);
1821		1794
1822	if (op->type == PLAYER)	1795	if (op->type == PLAYER)
1823	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1796	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1824	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1797	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1825	diff /= 4.0;	1798	diff /= 4.0;
…		…
1949	* activate recursively a flag on an object inventory	1922	* activate recursively a flag on an object inventory
1950	*/	1923	*/
1951	void	1924	void
1952	flag_inv (object *op, int flag)	1925	flag_inv (object *op, int flag)
1953	{	1926	{
1954	if (op->inv)
1955	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1927	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1956	{	1928	{
1957	SET_FLAG (tmp, flag);	1929	SET_FLAG (tmp, flag);
1958	flag_inv (tmp, flag);	1930	flag_inv (tmp, flag);
1959	}	1931	}
1960	}	1932	}
1961		1933
1962	/*	1934	/*
1963	* deactivate recursively a flag on an object inventory	1935	* deactivate recursively a flag on an object inventory
1964	*/	1936	*/
1965	void	1937	void
1966	unflag_inv (object *op, int flag)	1938	unflag_inv (object *op, int flag)
1967	{	1939	{
1968	if (op->inv)
1969	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1940	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1970	{	1941	{
1971	CLEAR_FLAG (tmp, flag);	1942	CLEAR_FLAG (tmp, flag);
1972	unflag_inv (tmp, flag);	1943	unflag_inv (tmp, flag);
1973	}	1944	}
1974	}
1975
1976	/*
1977	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1978	* all it's inventory (recursively).
1979	* If checksums are used, a player will get set_cheat called for
1980	* him/her-self and all object carried by a call to this function.
1981	*/
1982	void
1983	set_cheat (object *op)
1984	{
1985	SET_FLAG (op, FLAG_WAS_WIZ);
1986	flag_inv (op, FLAG_WAS_WIZ);
1987	}	1945	}
1988		1946
1989	/*	1947	/*
1990	* find_free_spot(object, map, x, y, start, stop) will search for	1948	* find_free_spot(object, map, x, y, start, stop) will search for
1991	* a spot at the given map and coordinates which will be able to contain	1949	* a spot at the given map and coordinates which will be able to contain
…		…
1993	* to search (see the freearr_x/y[] definition).	1951	* to search (see the freearr_x/y[] definition).
1994	* It returns a random choice among the alternatives found.	1952	* It returns a random choice among the alternatives found.
1995	* start and stop are where to start relative to the free_arr array (1,9	1953	* start and stop are where to start relative to the free_arr array (1,9
1996	* does all 4 immediate directions). This returns the index into the	1954	* does all 4 immediate directions). This returns the index into the
1997	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1955	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1998	* Note - this only checks to see if there is space for the head of the
1999	* object - if it is a multispace object, this should be called for all
2000	* pieces.
2001	* Note2: This function does correctly handle tiled maps, but does not	1956	* Note: This function does correctly handle tiled maps, but does not
2002	* inform the caller. However, insert_ob_in_map will update as	1957	* inform the caller. However, insert_ob_in_map will update as
2003	* necessary, so the caller shouldn't need to do any special work.	1958	* necessary, so the caller shouldn't need to do any special work.
2004	* Note - updated to take an object instead of archetype - this is necessary	1959	* Note - updated to take an object instead of archetype - this is necessary
2005	* because arch_blocked (now ob_blocked) needs to know the movement type	1960	* because arch_blocked (now ob_blocked) needs to know the movement type
2006	* to know if the space in question will block the object. We can't use	1961	* to know if the space in question will block the object. We can't use
…		…
2008	* customized, changed states, etc.	1963	* customized, changed states, etc.
2009	*/	1964	*/
2010	int	1965	int
2011	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1966	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2012	{	1967	{
		1968	int altern[SIZEOFFREE];
2013	int index = 0, flag;	1969	int index = 0, flag;
2014	int altern[SIZEOFFREE];
2015		1970
2016	for (int i = start; i < stop; i++)	1971	for (int i = start; i < stop; i++)
2017	{	1972	{
2018	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1973	mapxy pos (m, x, y); pos.move (i);
2019	if (!flag)	1974
		1975	if (!pos.normalise ())
		1976	continue;
		1977
		1978	mapspace &ms = *pos;
		1979
		1980	if (ms.flags () & P_IS_ALIVE)
		1981	continue;
		1982
		1983	/* However, often
		1984	* ob doesn't have any move type (when used to place exits)
		1985	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1986	*/
		1987	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1988	{
2020	altern [index++] = i;	1989	altern [index++] = i;
		1990	continue;
		1991	}
2021		1992
2022	/* Basically, if we find a wall on a space, we cut down the search size.	1993	/* Basically, if we find a wall on a space, we cut down the search size.
2023	* In this way, we won't return spaces that are on another side of a wall.	1994	* In this way, we won't return spaces that are on another side of a wall.
2024	* This mostly work, but it cuts down the search size in all directions -	1995	* This mostly work, but it cuts down the search size in all directions -
2025	* if the space being examined only has a wall to the north and empty	1996	* if the space being examined only has a wall to the north and empty
2026	* spaces in all the other directions, this will reduce the search space	1997	* spaces in all the other directions, this will reduce the search space
2027	* to only the spaces immediately surrounding the target area, and	1998	* to only the spaces immediately surrounding the target area, and
2028	* won't look 2 spaces south of the target space.	1999	* won't look 2 spaces south of the target space.
2029	*/	2000	*/
2030	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2001	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2002	{
2031	stop = maxfree[i];	2003	stop = maxfree[i];
		2004	continue;
		2005	}
		2006
		2007	/* Note it is intentional that we check ob - the movement type of the
		2008	* head of the object should correspond for the entire object.
		2009	*/
		2010	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2011	continue;
		2012
		2013	if (ob->blocked (m, pos.x, pos.y))
		2014	continue;
		2015
		2016	altern [index++] = i;
2032	}	2017	}
2033		2018
2034	if (!index)	2019	if (!index)
2035	return -1;	2020	return -1;
2036		2021
2037	return altern[RANDOM () % index];	2022	return altern [rndm (index)];
2038	}	2023	}
2039		2024
2040	/*	2025	/*
2041	* find_first_free_spot(archetype, maptile, x, y) works like	2026	* find_first_free_spot(archetype, maptile, x, y) works like
2042	* find_free_spot(), but it will search max number of squares.	2027	* find_free_spot(), but it will search max number of squares.
…		…
2045	*/	2030	*/
2046	int	2031	int
2047	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2032	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2048	{	2033	{
2049	for (int i = 0; i < SIZEOFFREE; i++)	2034	for (int i = 0; i < SIZEOFFREE; i++)
2050	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2035	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2051	return i;	2036	return i;
2052		2037
2053	return -1;	2038	return -1;
2054	}	2039	}
2055		2040
…		…
2063	{	2048	{
2064	arr += begin;	2049	arr += begin;
2065	end -= begin;	2050	end -= begin;
2066		2051
2067	while (--end)	2052	while (--end)
2068	swap (arr [end], arr [RANDOM () % (end + 1)]);	2053	swap (arr [end], arr [rndm (end + 1)]);
2069	}	2054	}
2070		2055
2071	/* new function to make monster searching more efficient, and effective!	2056	/* new function to make monster searching more efficient, and effective!
2072	* This basically returns a randomized array (in the passed pointer) of	2057	* This basically returns a randomized array (in the passed pointer) of
2073	* the spaces to find monsters. In this way, it won't always look for	2058	* the spaces to find monsters. In this way, it won't always look for
…		…
2109	object *tmp;	2094	object *tmp;
2110	maptile *mp;	2095	maptile *mp;
2111		2096
2112	MoveType blocked, move_type;	2097	MoveType blocked, move_type;
2113		2098
2114	if (exclude && exclude->head)	2099	if (exclude && exclude->head_ () != exclude)
2115	{	2100	{
2116	exclude = exclude->head;	2101	exclude = exclude->head;
2117	move_type = exclude->move_type;	2102	move_type = exclude->move_type;
2118	}	2103	}
2119	else	2104	else
…		…
2142	max = maxfree[i];	2127	max = maxfree[i];
2143	else if (mflags & P_IS_ALIVE)	2128	else if (mflags & P_IS_ALIVE)
2144	{	2129	{
2145	for (tmp = ms.bot; tmp; tmp = tmp->above)	2130	for (tmp = ms.bot; tmp; tmp = tmp->above)
2146	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2131	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2147	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2132	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2148	break;	2133	break;
2149		2134
2150	if (tmp)	2135	if (tmp)
2151	return freedir[i];	2136	return freedir[i];
2152	}	2137	}
…		…
2207		2192
2208	return 3;	2193	return 3;
2209	}	2194	}
2210		2195
2211	/*	2196	/*
2212	* absdir(int): Returns a number between 1 and 8, which represent
2213	* the "absolute" direction of a number (it actually takes care of
2214	* "overflow" in previous calculations of a direction).
2215	*/
2216
2217	int
2218	absdir (int d)
2219	{
2220	while (d < 1)
2221	d += 8;
2222
2223	while (d > 8)
2224	d -= 8;
2225
2226	return d;
2227	}
2228
2229	/*
2230	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2197	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2231	* between two directions (which are expected to be absolute (see absdir())	2198	* between two directions (which are expected to be absolute (see absdir())
2232	*/	2199	*/
2233
2234	int	2200	int
2235	dirdiff (int dir1, int dir2)	2201	dirdiff (int dir1, int dir2)
2236	{	2202	{
2237	int d;	2203	int d;
2238		2204
…		…
2351	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2317	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2352	* core dumps if they do.	2318	* core dumps if they do.
2353	*	2319	*
2354	* Add a check so we can't pick up invisible objects (0.93.8)	2320	* Add a check so we can't pick up invisible objects (0.93.8)
2355	*/	2321	*/
2356
2357	int	2322	int
2358	can_pick (const object *who, const object *item)	2323	can_pick (const object *who, const object *item)
2359	{	2324	{
2360	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2325	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2361	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2326	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2366	* create clone from object to another	2331	* create clone from object to another
2367	*/	2332	*/
2368	object *	2333	object *
2369	object_create_clone (object *asrc)	2334	object_create_clone (object *asrc)
2370	{	2335	{
2371	object *dst = 0, *tmp, *src, *part, *prev, *item;	2336	object *dst = 0;
2372		2337
2373	if (!asrc)	2338	if (!asrc)
2374	return 0;	2339	return 0;
2375		2340
2376	src = asrc;	2341	object *src = asrc->head_ ();
2377	if (src->head)
2378	src = src->head;
2379		2342
2380	prev = 0;	2343	object *prev = 0;
2381	for (part = src; part; part = part->more)	2344	for (object *part = src; part; part = part->more)
2382	{	2345	{
2383	tmp = part->clone ();	2346	object *tmp = part->clone ();
		2347
2384	tmp->x -= src->x;	2348	tmp->x -= src->x;
2385	tmp->y -= src->y;	2349	tmp->y -= src->y;
2386		2350
2387	if (!part->head)	2351	if (!part->head)
2388	{	2352	{
…		…
2398	prev->more = tmp;	2362	prev->more = tmp;
2399		2363
2400	prev = tmp;	2364	prev = tmp;
2401	}	2365	}
2402		2366
2403	for (item = src->inv; item; item = item->below)	2367	for (object *item = src->inv; item; item = item->below)
2404	insert_ob_in_ob (object_create_clone (item), dst);	2368	insert_ob_in_ob (object_create_clone (item), dst);
2405		2369
2406	return dst;	2370	return dst;
2407	}
2408
2409	/* GROS - Creates an object using a string representing its content. */
2410	/* Basically, we save the content of the string to a temp file, then call */
2411	/* load_object on it. I admit it is a highly inefficient way to make things, */
2412	/* but it was simple to make and allows reusing the load_object function. */
2413	/* Remember not to use load_object_str in a time-critical situation. */
2414	/* Also remember that multiparts objects are not supported for now. */
2415	object *
2416	load_object_str (const char *obstr)
2417	{
2418	object *op;
2419	char filename[MAX_BUF];
2420
2421	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2422
2423	FILE *tempfile = fopen (filename, "w");
2424
2425	if (tempfile == NULL)
2426	{
2427	LOG (llevError, "Error - Unable to access load object temp file\n");
2428	return NULL;
2429	}
2430
2431	fprintf (tempfile, obstr);
2432	fclose (tempfile);
2433
2434	op = object::create ();
2435
2436	object_thawer thawer (filename);
2437
2438	if (thawer)
2439	load_object (thawer, op, 0);
2440
2441	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2442	CLEAR_FLAG (op, FLAG_REMOVED);
2443
2444	return op;
2445	}	2371	}
2446		2372
2447	/* This returns the first object in who's inventory that	2373	/* This returns the first object in who's inventory that
2448	* has the same type and subtype match.	2374	* has the same type and subtype match.
2449	* returns NULL if no match.	2375	* returns NULL if no match.
…		…
2504	if (link->key == canonical_key)	2430	if (link->key == canonical_key)
2505	return link->value;	2431	return link->value;
2506		2432
2507	return 0;	2433	return 0;
2508	}	2434	}
2509
2510		2435
2511	/*	2436	/*
2512	* Updates the canonical_key in op to value.	2437	* Updates the canonical_key in op to value.
2513	*	2438	*
2514	* canonical_key is a shared string (value doesn't have to be).	2439	* canonical_key is a shared string (value doesn't have to be).
…		…
2538	/* Basically, if the archetype has this key set,	2463	/* Basically, if the archetype has this key set,
2539	* we need to store the null value so when we save	2464	* we need to store the null value so when we save
2540	* it, we save the empty value so that when we load,	2465	* it, we save the empty value so that when we load,
2541	* we get this value back again.	2466	* we get this value back again.
2542	*/	2467	*/
2543	if (get_ob_key_link (&op->arch->clone, canonical_key))	2468	if (get_ob_key_link (op->arch, canonical_key))
2544	field->value = 0;	2469	field->value = 0;
2545	else	2470	else
2546	{	2471	{
2547	if (last)	2472	if (last)
2548	last->next = field->next;	2473	last->next = field->next;
…		…
2617	}	2542	}
2618	else	2543	else
2619	item = item->env;	2544	item = item->env;
2620	}	2545	}
2621		2546
2622
2623	const char *	2547	const char *
2624	object::flag_desc (char *desc, int len) const	2548	object::flag_desc (char *desc, int len) const
2625	{	2549	{
2626	char *p = desc;	2550	char *p = desc;
2627	bool first = true;	2551	bool first = true;
…		…
2654	{	2578	{
2655	char flagdesc[512];	2579	char flagdesc[512];
2656	char info2[256 * 4];	2580	char info2[256 * 4];
2657	char *p = info;	2581	char *p = info;
2658		2582
2659	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",	2583	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2660	count, uuid.seq,	2584	count,
		2585	uuid.c_str (),
2661	&name,	2586	&name,
2662	title ? "\",title:" : "",	2587	title ? "\",title:\"" : "",
2663	title ? (const char *)title : "",	2588	title ? (const char *)title : "",
2664	flag_desc (flagdesc, 512), type);	2589	flag_desc (flagdesc, 512), type);
2665		2590
2666	if (env)	2591	if (!flag[FLAG_REMOVED] && env)
2667	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2592	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2668		2593
2669	if (map)	2594	if (map)
2670	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2595	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2671		2596
…		…
2673	}	2598	}
2674		2599
2675	const char *	2600	const char *
2676	object::debug_desc () const	2601	object::debug_desc () const
2677	{	2602	{
2678	static char info[256 * 4];	2603	static char info[3][256 * 4];
		2604	static int info_idx;
		2605
2679	return debug_desc (info);	2606	return debug_desc (info [++info_idx % 3]);
2680	}	2607	}
2681		2608
		2609	struct region *
		2610	object::region () const
		2611	{
		2612	return map ? map->region (x, y)
		2613	: region::default_region ();
		2614	}
		2615
		2616	const materialtype_t *
		2617	object::dominant_material () const
		2618	{
		2619	if (materialtype_t *mt = name_to_material (materialname))
		2620	return mt;
		2621
		2622	return name_to_material (shstr_unknown);
		2623	}
		2624
		2625	void
		2626	object::open_container (object *new_container)
		2627	{
		2628	if (container == new_container)
		2629	return;
		2630
		2631	object *old_container = container;
		2632
		2633	if (old_container)
		2634	{
		2635	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2636	return;
		2637
		2638	#if 0
		2639	// remove the "Close old_container" object.
		2640	if (object *closer = old_container->inv)
		2641	if (closer->type == CLOSE_CON)
		2642	closer->destroy ();
		2643	#endif
		2644
		2645	// make sure the container is available
		2646	esrv_send_item (this, old_container);
		2647
		2648	old_container->flag [FLAG_APPLIED] = false;
		2649	container = 0;
		2650
		2651	// client needs item update to make it work, client bug requires this to be separate
		2652	esrv_update_item (UPD_FLAGS, this, old_container);
		2653
		2654	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2655	play_sound (sound_find ("chest_close"));
		2656	}
		2657
		2658	if (new_container)
		2659	{
		2660	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2661	return;
		2662
		2663	// TODO: this does not seem to serve any purpose anymore?
		2664	#if 0
		2665	// insert the "Close Container" object.
		2666	if (archetype *closer = new_container->other_arch)
		2667	{
		2668	object *closer = arch_to_object (new_container->other_arch);
		2669	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2670	new_container->insert (closer);
		2671	}
		2672	#endif
		2673
		2674	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2675
		2676	// make sure the container is available, client bug requires this to be separate
		2677	esrv_send_item (this, new_container);
		2678
		2679	new_container->flag [FLAG_APPLIED] = true;
		2680	container = new_container;
		2681
		2682	// client needs flag change
		2683	esrv_update_item (UPD_FLAGS, this, new_container);
		2684	esrv_send_inventory (this, new_container);
		2685	play_sound (sound_find ("chest_open"));
		2686	}
		2687	// else if (!old_container->env && contr && contr->ns)
		2688	// contr->ns->floorbox_reset ();
		2689	}
		2690
		2691	object *
		2692	object::force_find (const shstr name)
		2693	{
		2694	/* cycle through his inventory to look for the MARK we want to
		2695	* place
		2696	*/
		2697	for (object *tmp = inv; tmp; tmp = tmp->below)
		2698	if (tmp->type == FORCE && tmp->slaying == name)
		2699	return splay (tmp);
		2700
		2701	return 0;
		2702	}
		2703
		2704	void
		2705	object::force_add (const shstr name, int duration)
		2706	{
		2707	if (object *force = force_find (name))
		2708	force->destroy ();
		2709
		2710	object *force = get_archetype (FORCE_NAME);
		2711
		2712	force->slaying = name;
		2713	force->stats.food = 1;
		2714	force->speed_left = -1.f;
		2715
		2716	force->set_speed (duration ? 1.f / duration : 0.f);
		2717	force->flag [FLAG_IS_USED_UP] = true;
		2718	force->flag [FLAG_APPLIED] = true;
		2719
		2720	insert (force);
		2721	}
		2722
		2723	void
		2724	object::play_sound (faceidx sound)
		2725	{
		2726	if (!sound)
		2727	return;
		2728
		2729	if (flag [FLAG_REMOVED])
		2730	return;
		2731
		2732	if (env)
		2733	{
		2734	if (object *pl = in_player ())
		2735	pl->contr->play_sound (sound);
		2736	}
		2737	else
		2738	map->play_sound (sound, x, y);
		2739	}
		2740

Diff Legend

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