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

Diff Legend

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