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.115 by root, Mon Jan 15 01:39:42 2007 UTC vs.
Revision 1.254 by root, Sun Aug 31 01:17:11 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 (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7		7	*
8	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
9	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
10	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	(at your option) any later version.	11	* (at your option) any later version.
12		12	*
13	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,
14	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	GNU General Public License for more details.	16	* GNU General Public License for more details.
17		17	*
18	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
19	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
21		21	* The authors can be reached via e-mail to <support@deliantra.net>
22	The authors can be reached via e-mail at <crossfire@schmorp.de>
23	*/	22	*/
24		23
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying
27	variable. */
28	#include <global.h>	24	#include <global.h>
29	#include <stdio.h>	25	#include <stdio.h>
30	#include <sys/types.h>	26	#include <sys/types.h>
31	#include <sys/uio.h>	27	#include <sys/uio.h>
32	#include <object.h>	28	#include <object.h>
33	#include <funcpoint.h>	29	#include <sproto.h>
34	#include <loader.h>	30	#include <loader.h>
35		31
36	#include <bitset>	32	#include <bitset>
37		33
38	int nrofallocobjects = 0;	34	UUID UUID::cur;
39	static UUID uuid;	35	static uint64_t seq_next_save;
40	const uint64 UUID_SKIP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
41		37
42	objectvec objects;	38	objectvec objects;
43	activevec actives;	39	activevec actives;
44		40
45	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,
46	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	45	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
47	};	46	};
48	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,
49	-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
50	};	52	};
51	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,
52	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
53	};	58	};
54	int freedir[SIZEOFFREE] = {	59	int freedir[SIZEOFFREE] = {
55	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,
56	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
57	};	64	};
58		65
59	static void	66	static void
60	write_uuid (void)	67	write_uuid (uval64 skip, bool sync)
61	{	68	{
62	char filename1[MAX_BUF], filename2[MAX_BUF];	69	CALL_BEGIN (2);
63		70	CALL_ARG_SV (newSVval64 (skip));
64	sprintf (filename1, "%s/uuid", settings.localdir);	71	CALL_ARG_SV (boolSV (sync));
65	sprintf (filename2, "%s/uuid~", settings.localdir);	72	CALL_CALL ("cf::write_uuid", G_DISCARD);
66		73	CALL_END;
67	FILE *fp;
68
69	if (!(fp = fopen (filename2, "w")))
70	{
71	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
72	return;
73	}
74
75	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
76	fclose (fp);
77	rename (filename2, filename1);
78	}	74	}
79		75
80	static void	76	static void
81	read_uuid (void)	77	read_uuid (void)
82	{	78	{
83	char filename[MAX_BUF];	79	char filename[MAX_BUF];
84		80
85	sprintf (filename, "%s/uuid", settings.localdir);	81	sprintf (filename, "%s/uuid", settings.localdir);
		82
		83	seq_next_save = 0;
86		84
87	FILE *fp;	85	FILE *fp;
88		86
89	if (!(fp = fopen (filename, "r")))	87	if (!(fp = fopen (filename, "r")))
90	{	88	{
91	if (errno == ENOENT)	89	if (errno == ENOENT)
92	{	90	{
93	LOG (llevInfo, "RESET uid to 1\n");	91	LOG (llevInfo, "RESET uid to 1\n");
94	uuid.seq = 0;	92	UUID::cur.seq = 0;
95	write_uuid ();	93	write_uuid (UUID_GAP, true);
96	return;	94	return;
97	}	95	}
98		96
99	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100	_exit (1);	98	_exit (1);
101	}	99	}
102		100
103	int version;	101	UUID::BUF buf;
104	unsigned long long uid;	102	buf[0] = 0;
105	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	103	fgets (buf, sizeof (buf), fp);
		104
		105	if (!UUID::cur.parse (buf))
106	{	106	{
107	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	107	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
108	_exit (1);	108	_exit (1);
109	}	109	}
110		110
111	uuid.seq = uid;	111	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
112	write_uuid ();	112
113	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	113	write_uuid (UUID_GAP, true);
114	fclose (fp);	114	fclose (fp);
115	}	115	}
116		116
117	UUID	117	UUID
118	gen_uuid ()	118	UUID::gen ()
119	{	119	{
120	UUID uid;	120	UUID uid;
121		121
122	uid.seq = ++uuid.seq;	122	uid.seq = ++cur.seq;
123		123
124	if (!(uuid.seq & (UUID_SKIP - 1)))	124	if (expect_false (cur.seq >= seq_next_save))
125	write_uuid ();	125	{
		126	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		127	write_uuid (UUID_GAP, false);
		128	}
		129
126		130
127	return uid;	131	return uid;
128	}	132	}
129		133
130	void	134	void
131	init_uuid ()	135	UUID::init ()
132	{	136	{
133	read_uuid ();	137	read_uuid ();
134	}	138	}
135		139
136	/* 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. */
137	static int	141	static bool
138	compare_ob_value_lists_one (const object *wants, const object *has)	142	compare_ob_value_lists_one (const object *wants, const object *has)
139	{	143	{
140	key_value *wants_field;
141
142	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	144	/* n-squared behaviour (see kv_get), but I'm hoping both
143	* objects with lists are rare, and lists stay short. If not, use a	145	* objects with lists are rare, and lists stay short. If not, use a
144	* different structure or at least keep the lists sorted...	146	* different structure or at least keep the lists sorted...
145	*/	147	*/
146		148
147	/* For each field in wants, */	149	/* For each field in wants, */
148	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)	150	for (key_value *kv = wants->key_values; kv; kv = kv->next)
149	{	151	if (has->kv_get (kv->key) != kv->value)
150	key_value *has_field;	152	return false;
151
152	/* Look for a field in has with the same key. */
153	has_field = get_ob_key_link (has, wants_field->key);
154
155	if (has_field == NULL)
156	{
157	/* No field with that name. */
158	return FALSE;
159	}
160
161	/* Found the matching field. */
162	if (has_field->value != wants_field->value)
163	{
164	/* Values don't match, so this half of the comparison is false. */
165	return FALSE;
166	}
167
168	/* If we get here, we found a match. Now for the next field in wants. */
169	}
170		153
171	/* If we get here, every field in wants has a matching field in has. */	154	/* If we get here, every field in wants has a matching field in has. */
172	return TRUE;	155	return true;
173	}	156	}
174		157
175	/* Returns TRUE if ob1 has the same key_values as ob2. */	158	/* Returns TRUE if ob1 has the same key_values as ob2. */
176	static int	159	static bool
177	compare_ob_value_lists (const object *ob1, const object *ob2)	160	compare_ob_value_lists (const object *ob1, const object *ob2)
178	{	161	{
179	/* However, there may be fields in has which aren't partnered in wants,	162	/* However, there may be fields in has which aren't partnered in wants,
180	* so we need to run the comparison *twice*. :(	163	* so we need to run the comparison *twice*. :(
181	*/	164	*/
182	return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1);	165	return compare_ob_value_lists_one (ob1, ob2)
		166	&& compare_ob_value_lists_one (ob2, ob1);
183	}	167	}
184		168
185	/* Function examines the 2 objects given to it, and returns true if	169	/* Function examines the 2 objects given to it, and returns true if
186	* they can be merged together.	170	* they can be merged together.
187	*	171	*
…		…
202	|| ob1->speed != ob2->speed	186	|| ob1->speed != ob2->speed
203	|| ob1->value != ob2->value	187	|| ob1->value != ob2->value
204	|| ob1->name != ob2->name)	188	|| ob1->name != ob2->name)
205	return 0;	189	return 0;
206		190
207	//TODO: this ain't working well, use nicer and correct overflow check
208	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	191	/* Do not merge objects if nrof would overflow, assume nrof
209	* value could not be stored in a sint32 (which unfortunately sometimes is	192	* is always 0 .. 2**31-1 */
210	* used to store nrof).	193	if (ob1->nrof > 0x7fffffff - ob2->nrof)
211	*/
212	if (ob1->nrof + ob2->nrof >= 1UL << 31)
213	return 0;	194	return 0;
214		195
215	/* If the objects have been identified, set the BEEN_APPLIED flag.	196	/* If the objects have been identified, set the BEEN_APPLIED flag.
216	* This is to the comparison of the flags below will be OK. We	197	* This is to the comparison of the flags below will be OK. We
217	* just can't ignore the been applied or identified flags, as they	198	* just can't ignore the been applied or identified flags, as they
218	* are not equal - just if it has been identified, the been_applied	199	* are not equal - just if it has been identified, the been_applied
219	* flags lose any meaning.	200	* flags lose any meaning.
220	*/	201	*/
221	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	202	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
222	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	203	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
223		204
224	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	205	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
225	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	206	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
226		207
227	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	208	if (ob1->arch->archname != ob2->arch->archname
228	|| ob1->arch != ob2->arch
229	|| ob1->name != ob2->name	209	|| ob1->name != ob2->name
230	|| ob1->title != ob2->title	210	|| ob1->title != ob2->title
231	|| ob1->msg != ob2->msg	211	|| ob1->msg != ob2->msg
232	|| ob1->weight != ob2->weight	212	|| ob1->weight != ob2->weight
233	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
234	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
235	|| ob1->attacktype != ob2->attacktype	213	|| ob1->attacktype != ob2->attacktype
236	|| ob1->magic != ob2->magic	214	|| ob1->magic != ob2->magic
237	|| ob1->slaying != ob2->slaying	215	|| ob1->slaying != ob2->slaying
238	|| ob1->skill != ob2->skill	216	|| ob1->skill != ob2->skill
239	|| ob1->value != ob2->value	217	|| ob1->value != ob2->value
240	|| ob1->animation_id != ob2->animation_id	218	|| ob1->animation_id != ob2->animation_id
		219	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
241	|| ob1->client_type != ob2->client_type	220	|| ob1->client_type != ob2->client_type
242	|| ob1->materialname != ob2->materialname	221	|| ob1->materialname != ob2->materialname
243	|| ob1->lore != ob2->lore	222	|| ob1->lore != ob2->lore
244	|| ob1->subtype != ob2->subtype	223	|| ob1->subtype != ob2->subtype
245	|| ob1->move_type != ob2->move_type	224	|| ob1->move_type != ob2->move_type
246	|| ob1->move_block != ob2->move_block	225	|| ob1->move_block != ob2->move_block
247	|| ob1->move_allow != ob2->move_allow	226	|| ob1->move_allow != ob2->move_allow
248	|| ob1->move_on != ob2->move_on	227	|| ob1->move_on != ob2->move_on
249	|| ob1->move_off != ob2->move_off	228	|| ob1->move_off != ob2->move_off
250	|| ob1->move_slow != ob2->move_slow	229	|| ob1->move_slow != ob2->move_slow
251	|| ob1->move_slow_penalty != ob2->move_slow_penalty)	230	|| ob1->move_slow_penalty != ob2->move_slow_penalty
		231	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
		232	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
252	return 0;	233	return 0;
253		234
		235	if ((ob1->flag ^ ob2->flag)
		236	.reset (FLAG_INV_LOCKED)
		237	.reset (FLAG_CLIENT_SENT)
		238	.reset (FLAG_REMOVED)
		239	.any ())
		240	return 0;
		241
254	/* This is really a spellbook check - really, we should	242	/* This is really a spellbook check - we should in general
255	* check all objects in the inventory.	243	* not merge objects with real inventories, as splitting them
		244	* is hard.
256	*/	245	*/
257	if (ob1->inv || ob2->inv)	246	if (ob1->inv || ob2->inv)
258	{	247	{
259	/* if one object has inventory but the other doesn't, not equiv */	248	if (!(ob1->inv && ob2->inv))
260	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	249	return 0; /* inventories differ in length */
261	return 0;
262		250
263	/* Now check to see if the two inventory objects could merge */	251	if (ob1->inv->below || ob2->inv->below)
		252	return 0; /* more than one object in inv */
		253
264	if (!object::can_merge (ob1->inv, ob2->inv))	254	if (!object::can_merge (ob1->inv, ob2->inv))
265	return 0;	255	return 0; /* inventory objects differ */
266		256
267	/* inventory ok - still need to check rest of this object to see	257	/* inventory ok - still need to check rest of this object to see
268	* if it is valid.	258	* if it is valid.
269	*/	259	*/
270	}	260	}
…		…
289	if (ob1->level != ob2->level)	279	if (ob1->level != ob2->level)
290	return 0;	280	return 0;
291	break;	281	break;
292	}	282	}
293		283
294	if (ob1->key_values != NULL || ob2->key_values != NULL)	284	if (ob1->key_values || ob2->key_values)
295	{	285	{
296	/* At least one of these has key_values. */	286	/* At least one of these has key_values. */
297	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	287	if ((!ob1->key_values) != (!ob2->key_values))
298	/* One has fields, but the other one doesn't. */	288	return 0; /* One has fields, but the other one doesn't. */
		289
		290	if (!compare_ob_value_lists (ob1, ob2))
299	return 0;	291	return 0;
300	else if (!compare_ob_value_lists (ob1, ob2))
301	return 0;
302	}	292	}
303		293
304	//TODO: generate an event or call into perl for additional checks
305	if (ob1->self || ob2->self)	294	if (ob1->self || ob2->self)
306	{	295	{
307	ob1->optimise ();	296	ob1->optimise ();
308	ob2->optimise ();	297	ob2->optimise ();
309		298
310	if (ob1->self || ob2->self)	299	if (ob1->self || ob2->self)
		300	{
		301	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		302	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		303
		304	if (k1 != k2)
311	return 0;	305	return 0;
		306
		307	if (k1 == 0)
		308	return 1;
		309
		310	if (!cfperl_can_merge (ob1, ob2))
		311	return 0;
		312	}
312	}	313	}
313		314
314	/* Everything passes, must be OK. */	315	/* Everything passes, must be OK. */
315	return 1;	316	return 1;
316	}	317	}
317		318
		319	// find player who can see this object
		320	object *
		321	object::visible_to () const
		322	{
		323	if (client_visible () && !flag [FLAG_REMOVED])
		324	{
		325	// see if we are in a container of sorts
		326	if (env)
		327	{
		328	// the player inventory itself is always visible
		329	if (env->type == PLAYER)
		330	return env;
		331
		332	// else a player could have our env open
		333	object *envest = env->outer_env ();
		334
		335	// the player itself is always on a map, so we will find him here
		336	// even if our inv is in a player.
		337	if (envest->is_on_map ())
		338	if (object *pl = envest->ms ().player ())
		339	if (pl->container == env)
		340	return pl;
		341	}
		342	else
		343	{
		344	// maybe there is a player standing on the same mapspace
		345	// this will catch the case where "this" is a player
		346	if (object *pl = ms ().player ())
		347	if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look)
		348	|| this == pl->container)
		349	return pl;
		350	}
		351	}
		352
		353	return 0;
		354	}
		355
		356	// adjust weight per container type ("of holding")
		357	static sint32
		358	weight_adjust_for (object *op, sint32 weight)
		359	{
		360	return op->type == CONTAINER
		361	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		362	: weight;
		363	}
		364
318	/*	365	/*
		366	* adjust_weight(object, weight) adds the specified weight to an object,
		367	* and also updates how much the environment(s) is/are carrying.
		368	*/
		369	static void
		370	adjust_weight (object *op, sint32 weight)
		371	{
		372	while (op)
		373	{
		374	// adjust by actual difference to account for rounding errors
		375	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
		376	weight = weight_adjust_for (op, op->carrying)
		377	- weight_adjust_for (op, op->carrying - weight);
		378
		379	if (!weight)
		380	return;
		381
		382	op->carrying += weight;
		383
		384	if (object *pl = op->visible_to ())
		385	if (pl != op) // player is handled lazily
		386	esrv_update_item (UPD_WEIGHT, pl, op);
		387
		388	op = op->env;
		389	}
		390	}
		391
		392	/*
319	* sum_weight() is a recursive function which calculates the weight	393	* this is a recursive function which calculates the weight
320	* an object is carrying. It goes through in figures out how much	394	* an object is carrying. It goes through op and figures out how much
321	* containers are carrying, and sums it up.	395	* containers are carrying, and sums it up.
322	*/	396	*/
323	long	397	void
324	sum_weight (object *op)	398	object::update_weight ()
325	{	399	{
326	long sum;	400	sint32 sum = 0;
327	object *inv;
328		401
329	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	402	for (object *op = inv; op; op = op->below)
330	{	403	{
331	if (inv->inv)	404	if (op->inv)
332	sum_weight (inv);	405	op->update_weight ();
333	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	406
		407	sum += op->total_weight ();
		408	}
		409
		410	sum = weight_adjust_for (this, sum);
		411
		412	if (sum != carrying)
334	}	413	{
335
336	if (op->type == CONTAINER && op->stats.Str)
337	sum = (sum * (100 - op->stats.Str)) / 100;
338
339	if (op->carrying != sum)
340	op->carrying = sum;	414	carrying = sum;
341		415
342	return sum;	416	if (object *pl = visible_to ())
		417	if (pl != this) // player is handled lazily
		418	esrv_update_item (UPD_WEIGHT, pl, this);
		419	}
343	}	420	}
344		421
345	/**	422	/*
346	* Return the outermost environment object for a given object.	423	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
347	*/	424	*/
348
349	object *
350	object_get_env_recursive (object *op)
351	{
352	while (op->env != NULL)
353	op = op->env;
354	return op;
355	}
356
357	/*
358	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
359	* Some error messages.
360	* The result of the dump is stored in the static global errmsg array.
361	*/
362
363	char *	425	char *
364	dump_object (object *op)	426	dump_object (object *op)
365	{	427	{
366	if (!op)	428	if (!op)
367	return strdup ("[NULLOBJ]");	429	return strdup ("[NULLOBJ]");
368		430
369	object_freezer freezer;	431	object_freezer freezer;
370	save_object (freezer, op, 1);	432	op->write (freezer);
371	return freezer.as_string ();	433	return freezer.as_string ();
372	}	434	}
373		435
374	/*	436	/*
375	* get_nearest_part(multi-object, object 2) returns the part of the	437	* get_nearest_part(multi-object, object 2) returns the part of the
376	* multi-object 1 which is closest to the second object.	438	* multi-object 1 which is closest to the second object.
377	* If it's not a multi-object, it is returned.	439	* If it's not a multi-object, it is returned.
378	*/	440	*/
379
380	object *	441	object *
381	get_nearest_part (object *op, const object *pl)	442	get_nearest_part (object *op, const object *pl)
382	{	443	{
383	object *tmp, *closest;	444	object *tmp, *closest;
384	int last_dist, i;	445	int last_dist, i;
385		446
386	if (op->more == NULL)	447	if (!op->more)
387	return op;	448	return op;
		449
388	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	450	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		451	tmp;
		452	tmp = tmp->more)
389	if ((i = distance (tmp, pl)) < last_dist)	453	if ((i = distance (tmp, pl)) < last_dist)
390	closest = tmp, last_dist = i;	454	closest = tmp, last_dist = i;
		455
391	return closest;	456	return closest;
392	}	457	}
393		458
394	/*	459	/*
395	* Returns the object which has the count-variable equal to the argument.	460	* Returns the object which has the count-variable equal to the argument.
		461	* VERRRY slow.
396	*/	462	*/
397	object *	463	object *
398	find_object (tag_t i)	464	find_object (tag_t i)
399	{	465	{
400	for_all_objects (op)	466	for_all_objects (op)
…		…
411	*/	477	*/
412	object *	478	object *
413	find_object_name (const char *str)	479	find_object_name (const char *str)
414	{	480	{
415	shstr_cmp str_ (str);	481	shstr_cmp str_ (str);
416	object *op;
417		482
		483	if (str_)
418	for_all_objects (op)	484	for_all_objects (op)
419	if (op->name == str_)	485	if (op->name == str_)
420	break;	486	return op;
421		487
422	return op;	488	return 0;
423	}
424
425	void
426	free_all_object_data ()
427	{
428	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
429	}	489	}
430		490
431	/*	491	/*
432	* Sets the owner and sets the skill and exp pointers to owner's current	492	* Sets the owner and sets the skill and exp pointers to owner's current
433	* skill and experience objects.	493	* skill and experience objects.
		494	* ACTUALLY NO! investigate! TODO
434	*/	495	*/
435	void	496	void
436	object::set_owner (object *owner)	497	object::set_owner (object *owner)
437	{	498	{
		499	// allow objects which own objects
438	if (!owner)	500	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)	501	while (owner->owner)
449	owner = owner->owner;	502	owner = owner->owner;
		503
		504	if (flag [FLAG_FREED])
		505	{
		506	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		507	return;
		508	}
450		509
451	this->owner = owner;	510	this->owner = owner;
		511	}
		512
		513	int
		514	object::slottype () const
		515	{
		516	if (type == SKILL)
		517	{
		518	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		519	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		520	}
		521	else
		522	{
		523	if (slot [body_combat].info) return slot_combat;
		524	if (slot [body_range ].info) return slot_ranged;
		525	}
		526
		527	return slot_none;
		528	}
		529
		530	bool
		531	object::change_weapon (object *ob)
		532	{
		533	if (current_weapon == ob)
		534	return true;
		535
		536	if (chosen_skill)
		537	chosen_skill->flag [FLAG_APPLIED] = false;
		538
		539	current_weapon = ob;
		540	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		541
		542	if (chosen_skill)
		543	chosen_skill->flag [FLAG_APPLIED] = true;
		544
		545	update_stats ();
		546
		547	if (ob)
		548	{
		549	// now check wether any body locations became invalid, in which case
		550	// we cannot apply the weapon at the moment.
		551	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		552	if (slot[i].used < 0)
		553	{
		554	current_weapon = chosen_skill = 0;
		555	update_stats ();
		556
		557	new_draw_info_format (NDI_UNIQUE, 0, this,
		558	"You try to balance all your items at once, "
		559	"but the %s is just too much for your body. "
		560	"[You need to unapply some items first.]", &ob->name);
		561	return false;
		562	}
		563
		564	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		565	}
		566	else
		567	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		568
		569	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		570	{
		571	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		572	&name, ob->debug_desc ());
		573	return false;
		574	}
		575
		576	return true;
452	}	577	}
453		578
454	/* Zero the key_values on op, decrementing the shared-string	579	/* Zero the key_values on op, decrementing the shared-string
455	* refcounts and freeing the links.	580	* refcounts and freeing the links.
456	*/	581	*/
457	static void	582	static void
458	free_key_values (object *op)	583	free_key_values (object *op)
459	{	584	{
460	for (key_value *i = op->key_values; i != 0;)	585	for (key_value *i = op->key_values; i; )
461	{	586	{
462	key_value *next = i->next;	587	key_value *next = i->next;
463	delete i;	588	delete i;
464		589
465	i = next;	590	i = next;
…		…
477	* will point at garbage.	602	* will point at garbage.
478	*/	603	*/
479	void	604	void
480	object::copy_to (object *dst)	605	object::copy_to (object *dst)
481	{	606	{
482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	607	dst->remove ();
483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
484
485	*(object_copy *)dst = *this;	608	*(object_copy *)dst = *this;
486		609	dst->flag [FLAG_REMOVED] = true;
487	if (is_freed)
488	SET_FLAG (dst, FLAG_FREED);
489
490	if (is_removed)
491	SET_FLAG (dst, FLAG_REMOVED);
492
493	if (speed < 0)
494	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
495		610
496	/* Copy over key_values, if any. */	611	/* Copy over key_values, if any. */
497	if (key_values)	612	if (key_values)
498	{	613	{
499	key_value *tail = 0;	614	key_value *tail = 0;
500	key_value *i;
501
502	dst->key_values = 0;	615	dst->key_values = 0;
503		616
504	for (i = key_values; i; i = i->next)	617	for (key_value *i = key_values; i; i = i->next)
505	{	618	{
506	key_value *new_link = new key_value;	619	key_value *new_link = new key_value;
507		620
508	new_link->next = 0;	621	new_link->next = 0;
509	new_link->key = i->key;	622	new_link->key = i->key;
510	new_link->value = i->value;	623	new_link->value = i->value;
511		624
512	/* Try and be clever here, too. */	625	/* Try and be clever here, too. */
513	if (!dst->key_values)	626	if (!dst->key_values)
514	{	627	{
…		…
521	tail = new_link;	634	tail = new_link;
522	}	635	}
523	}	636	}
524	}	637	}
525		638
		639	if (speed < 0)
		640	dst->speed_left -= rndm ();
		641
526	dst->set_speed (dst->speed);	642	dst->set_speed (dst->speed);
		643	}
		644
		645	void
		646	object::instantiate ()
		647	{
		648	if (!uuid.seq) // HACK
		649	uuid = UUID::gen ();
		650
		651	speed_left = -0.1f;
		652	/* copy the body_info to the body_used - this is only really
		653	* need for monsters, but doesn't hurt to do it for everything.
		654	* by doing so, when a monster is created, it has good starting
		655	* values for the body_used info, so when items are created
		656	* for it, they can be properly equipped.
		657	*/
		658	for (int i = NUM_BODY_LOCATIONS; i--; )
		659	slot[i].used = slot[i].info;
		660
		661	attachable::instantiate ();
527	}	662	}
528		663
529	object *	664	object *
530	object::clone ()	665	object::clone ()
531	{	666	{
532	object *neu = create ();	667	object *neu = create ();
533	copy_to (neu);	668	copy_to (neu);
		669	neu->map = map; // not copied by copy_to
534	return neu;	670	return neu;
535	}	671	}
536		672
537	/*	673	/*
538	* If an object with the IS_TURNABLE() flag needs to be turned due	674	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
589	* UP_OBJ_FACE: only the objects face has changed.	725	* UP_OBJ_FACE: only the objects face has changed.
590	*/	726	*/
591	void	727	void
592	update_object (object *op, int action)	728	update_object (object *op, int action)
593	{	729	{
594	MoveType move_on, move_off, move_block, move_slow;	730	if (!op)
595
596	if (op == NULL)
597	{	731	{
598	/* this should never happen */	732	/* this should never happen */
599	LOG (llevDebug, "update_object() called for NULL object.\n");	733	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
600	return;	734	return;
601	}	735	}
602		736
603	if (op->env)	737	if (!op->is_on_map ())
604	{	738	{
605	/* Animation is currently handled by client, so nothing	739	/* Animation is currently handled by client, so nothing
606	* to do in this case.	740	* to do in this case.
607	*/	741	*/
608	return;	742	return;
609	}	743	}
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		744
617	/* make sure the object is within map boundaries */	745	/* 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)	746	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
619	{	747	{
620	LOG (llevError, "update_object() called for object out of map!\n");	748	LOG (llevError, "update_object() called for object out of map!\n");
…		…
639	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	767	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
640	|| (m.move_on | op->move_on ) != m.move_on	768	|| (m.move_on | op->move_on ) != m.move_on
641	|| (m.move_off | op->move_off ) != m.move_off	769	|| (m.move_off | op->move_off ) != m.move_off
642	|| (m.move_slow | op->move_slow) != m.move_slow	770	|| (m.move_slow | op->move_slow) != m.move_slow
643	/* This isn't perfect, but I don't expect a lot of objects to	771	/* This isn't perfect, but I don't expect a lot of objects to
644	* to have move_allow right now.	772	* have move_allow right now.
645	*/	773	*/
646	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	774	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
647	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	775	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
648	m.flags_ = 0;	776	m.flags_ = 0;
649	}	777	}
…		…
670	face = blank_face;	798	face = blank_face;
671	}	799	}
672		800
673	object::~object ()	801	object::~object ()
674	{	802	{
		803	unlink ();
		804
675	free_key_values (this);	805	free_key_values (this);
676	}	806	}
677		807
678	static int object_count;	808	static int object_count;
679		809
680	void object::link ()	810	void object::link ()
681	{	811	{
682	assert (!index);//D	812	assert (!index);//D
683	uuid = gen_uuid ();	813	uuid = UUID::gen ();
684	count = ++object_count;	814	count = ++object_count;
685		815
686	refcnt_inc ();	816	refcnt_inc ();
687	objects.insert (this);	817	objects.insert (this);
688	}	818	}
689		819
690	void object::unlink ()	820	void object::unlink ()
691	{	821	{
692	assert (index);//D	822	if (!index)
		823	return;
		824
693	objects.erase (this);	825	objects.erase (this);
694	refcnt_dec ();	826	refcnt_dec ();
695	}	827	}
696		828
697	void	829	void
…		…
759	object::destroy_inv (bool drop_to_ground)	891	object::destroy_inv (bool drop_to_ground)
760	{	892	{
761	// need to check first, because the checks below might segfault	893	// need to check first, because the checks below might segfault
762	// as we might be on an invalid mapspace and crossfire code	894	// as we might be on an invalid mapspace and crossfire code
763	// is too buggy to ensure that the inventory is empty.	895	// is too buggy to ensure that the inventory is empty.
764	// corollary: if you create arrows etc. with stuff in tis inventory,	896	// corollary: if you create arrows etc. with stuff in its inventory,
765	// cf will crash below with off-map x and y	897	// cf will crash below with off-map x and y
766	if (!inv)	898	if (!inv)
767	return;	899	return;
768		900
769	/* Only if the space blocks everything do we not process -	901	/* Only if the space blocks everything do we not process -
770	* if some form of movement is allowed, let objects	902	* if some form of movement is allowed, let objects
771	* drop on that space.	903	* drop on that space.
772	*/	904	*/
773	if (!drop_to_ground	905	if (!drop_to_ground
774	|| !map	906	|| !map
775	|| map->in_memory != MAP_IN_MEMORY	907	|| map->in_memory != MAP_ACTIVE
		908	|| map->no_drop
776	|| ms ().move_block == MOVE_ALL)	909	|| ms ().move_block == MOVE_ALL)
777	{	910	{
778	while (inv)	911	while (inv)
779	{
780	inv->destroy_inv (drop_to_ground);
781	inv->destroy ();	912	inv->destroy (true);
782	}
783	}	913	}
784	else	914	else
785	{ /* Put objects in inventory onto this space */	915	{ /* Put objects in inventory onto this space */
786	while (inv)	916	while (inv)
787	{	917	{
…		…
791	|| op->flag [FLAG_NO_DROP]	921	|| op->flag [FLAG_NO_DROP]
792	|| op->type == RUNE	922	|| op->type == RUNE
793	|| op->type == TRAP	923	|| op->type == TRAP
794	|| op->flag [FLAG_IS_A_TEMPLATE]	924	|| op->flag [FLAG_IS_A_TEMPLATE]
795	|| op->flag [FLAG_DESTROY_ON_DEATH])	925	|| op->flag [FLAG_DESTROY_ON_DEATH])
796	op->destroy ();	926	op->destroy (true);
797	else	927	else
798	map->insert (op, x, y);	928	map->insert (op, x, y);
799	}	929	}
800	}	930	}
801	}	931	}
…		…
805	object *op = new object;	935	object *op = new object;
806	op->link ();	936	op->link ();
807	return op;	937	return op;
808	}	938	}
809		939
		940	static struct freed_map : maptile
		941	{
		942	freed_map ()
		943	{
		944	path = "<freed objects map>";
		945	name = "/internal/freed_objects_map";
		946	width = 3;
		947	height = 3;
		948	no_drop = 1;
		949	no_reset = 1;
		950
		951	alloc ();
		952	in_memory = MAP_ACTIVE;
		953	}
		954
		955	~freed_map ()
		956	{
		957	destroy ();
		958	}
		959	} freed_map; // freed objects are moved here to avoid crashes
		960
810	void	961	void
811	object::do_destroy ()	962	object::do_destroy ()
812	{	963	{
813	attachable::do_destroy ();
814
815	if (flag [FLAG_IS_LINKED])	964	if (flag [FLAG_IS_LINKED])
816	remove_button_link (this);	965	remove_button_link (this);
817		966
818	if (flag [FLAG_FRIENDLY])	967	if (flag [FLAG_FRIENDLY])
819	remove_friendly_object (this);	968	remove_friendly_object (this);
820		969
821	if (!flag [FLAG_REMOVED])
822	remove ();	970	remove ();
823		971
824	destroy_inv (true);	972	attachable::do_destroy ();
825		973
826	deactivate ();	974	deactivate ();
827	unlink ();	975	unlink ();
828		976
829	flag [FLAG_FREED] = 1;	977	flag [FLAG_FREED] = 1;
830		978
831	// hack to ensure that freed objects still have a valid map	979	// hack to ensure that freed objects still have a valid map
832	{
833	static maptile *freed_map; // freed objects are moved here to avoid crashes
834
835	if (!freed_map)
836	{
837	freed_map = new maptile;
838
839	freed_map->name = "/internal/freed_objects_map";
840	freed_map->width = 3;
841	freed_map->height = 3;
842
843	freed_map->alloc ();
844	freed_map->in_memory = MAP_IN_MEMORY;
845	}
846
847	map = freed_map;	980	map = &freed_map;
848	x = 1;	981	x = 1;
849	y = 1;	982	y = 1;
850	}
851
852	head = 0;
853		983
854	if (more)	984	if (more)
855	{	985	{
856	more->destroy ();	986	more->destroy ();
857	more = 0;	987	more = 0;
858	}	988	}
859		989
		990	head = 0;
		991
860	// clear those pointers that likely might have circular references to us	992	// clear those pointers that likely might cause circular references
861	owner = 0;	993	owner = 0;
862	enemy = 0;	994	enemy = 0;
863	attacked_by = 0;	995	attacked_by = 0;
		996	current_weapon = 0;
864	}	997	}
865		998
866	void	999	void
867	object::destroy (bool destroy_inventory)	1000	object::destroy (bool destroy_inventory)
868	{	1001	{
869	if (destroyed ())	1002	if (destroyed ())
870	return;	1003	return;
871		1004
		1005	if (!is_head () && !head->destroyed ())
		1006	{
		1007	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1008	head->destroy (destroy_inventory);
		1009	return;
		1010	}
		1011
872	if (destroy_inventory)	1012	destroy_inv (!destroy_inventory);
873	destroy_inv (false);	1013
		1014	if (is_head ())
		1015	if (sound_destroy)
		1016	play_sound (sound_destroy);
		1017	else if (flag [FLAG_MONSTER])
		1018	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
874		1019
875	attachable::destroy ();	1020	attachable::destroy ();
876	}
877
878	/*
879	* sub_weight() recursively (outwards) subtracts a number from the
880	* weight of an object (and what is carried by it's environment(s)).
881	*/
882	void
883	sub_weight (object *op, signed long weight)
884	{
885	while (op != NULL)
886	{
887	if (op->type == CONTAINER)
888	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
889
890	op->carrying -= weight;
891	op = op->env;
892	}
893	}	1021	}
894		1022
895	/* op->remove ():	1023	/* op->remove ():
896	* This function removes the object op from the linked list of objects	1024	* This function removes the object op from the linked list of objects
897	* which it is currently tied to. When this function is done, the	1025	* which it is currently tied to. When this function is done, the
898	* object will have no environment. If the object previously had an	1026	* object will have no environment. If the object previously had an
899	* environment, the x and y coordinates will be updated to	1027	* environment, the x and y coordinates will be updated to
900	* the previous environment.	1028	* the previous environment.
901	* Beware: This function is called from the editor as well!
902	*/	1029	*/
903	void	1030	void
904	object::remove ()	1031	object::do_remove ()
905	{	1032	{
906	object *tmp, *last = 0;	1033	object *tmp, *last = 0;
907	object *otmp;	1034	object *otmp;
908		1035
909	if (QUERY_FLAG (this, FLAG_REMOVED))	1036	if (flag [FLAG_REMOVED])
910	return;	1037	return;
911		1038
912	SET_FLAG (this, FLAG_REMOVED);
913	INVOKE_OBJECT (REMOVE, this);	1039	INVOKE_OBJECT (REMOVE, this);
		1040
		1041	flag [FLAG_REMOVED] = true;
914		1042
915	if (more)	1043	if (more)
916	more->remove ();	1044	more->remove ();
917		1045
918	/*	1046	/*
919	* In this case, the object to be removed is in someones	1047	* In this case, the object to be removed is in someones
920	* inventory.	1048	* inventory.
921	*/	1049	*/
922	if (env)	1050	if (env)
923	{	1051	{
924	if (nrof)	1052	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
925	sub_weight (env, weight * nrof);	1053	if (object *pl = visible_to ())
926	else	1054	esrv_del_item (pl->contr, count);
927	sub_weight (env, weight + carrying);	1055	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1056
		1057	adjust_weight (env, -total_weight ());
		1058
		1059	/* we set up values so that it could be inserted into
		1060	* the map, but we don't actually do that - it is up
		1061	* to the caller to decide what we want to do.
		1062	*/
		1063	map = env->map;
		1064	x = env->x;
		1065	y = env->y;
		1066
		1067	// make sure cmov optimisation is applicable
		1068	*(above ? &above->below : &env->inv) = below;
		1069	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1070
		1071	above = 0;
		1072	below = 0;
		1073	env = 0;
928		1074
929	/* NO_FIX_PLAYER is set when a great many changes are being	1075	/* NO_FIX_PLAYER is set when a great many changes are being
930	* made to players inventory. If set, avoiding the call	1076	* made to players inventory. If set, avoiding the call
931	* to save cpu time.	1077	* to save cpu time.
932	*/	1078	*/
933	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1079	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
934	otmp->update_stats ();	1080	otmp->update_stats ();
935
936	if (above)
937	above->below = below;
938	else
939	env->inv = below;
940
941	if (below)
942	below->above = above;
943
944	/* we set up values so that it could be inserted into
945	* the map, but we don't actually do that - it is up
946	* to the caller to decide what we want to do.
947	*/
948	x = env->x, y = env->y;
949	map = env->map;
950	above = 0, below = 0;
951	env = 0;
952	}	1081	}
953	else if (map)	1082	else if (map)
954	{	1083	{
955	if (type == PLAYER)	1084	map->dirty = true;
		1085	mapspace &ms = this->ms ();
		1086
		1087	if (object *pl = ms.player ())
956	{	1088	{
		1089	if (type == PLAYER) // this == pl(!)
		1090	{
		1091	// leaving a spot always closes any open container on the ground
		1092	if (container && !container->env)
		1093	// this causes spurious floorbox updates, but it ensures
		1094	// that the CLOSE event is being sent.
		1095	close_container ();
		1096
957	--map->players;	1097	--map->players;
958	map->touch ();	1098	map->touch ();
		1099	}
		1100	else if (pl->container == this)
		1101	{
		1102	// removing a container should close it
		1103	close_container ();
		1104	}
		1105
		1106	esrv_del_item (pl->contr, count);
959	}	1107	}
960		1108
961	map->dirty = true;
962
963	/* link the object above us */	1109	/* link the object above us */
964	if (above)	1110	// re-link, make sure compiler can easily use cmove
965	above->below = below;	1111	*(above ? &above->below : &ms.top) = below;
966	else	1112	*(below ? &below->above : &ms.bot) = above;
967	map->at (x, y).top = below; /* we were top, set new top */
968
969	/* Relink the object below us, if there is one */
970	if (below)
971	below->above = above;
972	else
973	{
974	/* Nothing below, which means we need to relink map object for this space
975	* use translated coordinates in case some oddness with map tiling is
976	* evident
977	*/
978	if (GET_MAP_OB (map, x, y) != this)
979	{
980	char *dump = dump_object (this);
981	LOG (llevError,
982	"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);
983	free (dump);
984	dump = dump_object (GET_MAP_OB (map, x, y));
985	LOG (llevError, "%s\n", dump);
986	free (dump);
987	}
988
989	map->at (x, y).bot = above; /* goes on above it. */
990	}
991		1113
992	above = 0;	1114	above = 0;
993	below = 0;	1115	below = 0;
994		1116
		1117	ms.flags_ = 0;
		1118
995	if (map->in_memory == MAP_SAVING)	1119	if (map->in_memory == MAP_SAVING)
996	return;	1120	return;
997		1121
998	int check_walk_off = !flag [FLAG_NO_APPLY];	1122	int check_walk_off = !flag [FLAG_NO_APPLY];
999		1123
		1124	if (object *pl = ms.player ())
		1125	{
		1126	if (pl->container == this)
		1127	/* If a container that the player is currently using somehow gets
		1128	* removed (most likely destroyed), update the player view
		1129	* appropriately.
		1130	*/
		1131	pl->close_container ();
		1132
		1133	//TODO: the floorbox prev/next might need updating
		1134	//esrv_del_item (pl->contr, count);
		1135	//TODO: update floorbox to preserve ordering
		1136	if (pl->contr->ns)
		1137	pl->contr->ns->floorbox_update ();
		1138	}
		1139
1000	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1140	for (tmp = ms.bot; tmp; tmp = tmp->above)
1001	{	1141	{
1002	/* No point updating the players look faces if he is the object	1142	/* No point updating the players look faces if he is the object
1003	* being removed.	1143	* being removed.
1004	*/	1144	*/
1005
1006	if (tmp->type == PLAYER && tmp != this)
1007	{
1008	/* If a container that the player is currently using somehow gets
1009	* removed (most likely destroyed), update the player view
1010	* appropriately.
1011	*/
1012	if (tmp->container == this)
1013	{
1014	flag [FLAG_APPLIED] = 0;
1015	tmp->container = 0;
1016	}
1017
1018	if (tmp->contr->ns)
1019	tmp->contr->ns->floorbox_update ();
1020	}
1021		1145
1022	/* See if object moving off should effect something */	1146	/* See if object moving off should effect something */
1023	if (check_walk_off	1147	if (check_walk_off
1024	&& ((move_type & tmp->move_off)	1148	&& ((move_type & tmp->move_off)
1025	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1149	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1028		1152
1029	if (destroyed ())	1153	if (destroyed ())
1030	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1154	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1031	}	1155	}
1032		1156
1033	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1034	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1035	if (tmp->above == tmp)
1036	tmp->above = 0;
1037
1038	last = tmp;	1157	last = tmp;
1039	}	1158	}
1040
1041	/* last == NULL if there are no objects on this space */
1042	//TODO: this makes little sense, why only update the topmost object?
1043	if (!last)
1044	map->at (x, y).flags_ = 0;
1045	else
1046	update_object (last, UP_OBJ_REMOVE);
1047		1159
1048	if (flag [FLAG_BLOCKSVIEW] || glow_radius)	1160	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1049	update_all_los (map, x, y);	1161	update_all_los (map, x, y);
1050	}	1162	}
1051	}	1163	}
…		…
1062	merge_ob (object *op, object *top)	1174	merge_ob (object *op, object *top)
1063	{	1175	{
1064	if (!op->nrof)	1176	if (!op->nrof)
1065	return 0;	1177	return 0;
1066		1178
1067	if (top)	1179	if (!top)
1068	for (top = op; top && top->above; top = top->above)	1180	for (top = op; top && top->above; top = top->above)
1069	;	1181	;
1070		1182
1071	for (; top; top = top->below)	1183	for (; top; top = top->below)
1072	{
1073	if (top == op)
1074	continue;
1075
1076	if (object::can_merge (op, top))	1184	if (object::can_merge (op, top))
1077	{	1185	{
1078	top->nrof += op->nrof;	1186	top->nrof += op->nrof;
1079		1187
1080	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1188	if (object *pl = top->visible_to ())
1081	op->weight = 0; /* Don't want any adjustements now */	1189	esrv_update_item (UPD_NROF, pl, top);
		1190
		1191	op->weight = 0; // cancel the addition above
		1192	op->carrying = 0; // must be 0 already
		1193
1082	op->destroy ();	1194	op->destroy (1);
		1195
1083	return top;	1196	return top;
1084	}	1197	}
1085	}
1086		1198
1087	return 0;	1199	return 0;
1088	}	1200	}
1089		1201
		1202	void
		1203	object::expand_tail ()
		1204	{
		1205	if (more)
		1206	return;
		1207
		1208	object *prev = this;
		1209
		1210	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1211	{
		1212	object *op = arch_to_object (at);
		1213
		1214	op->name = name;
		1215	op->name_pl = name_pl;
		1216	op->title = title;
		1217
		1218	op->head = this;
		1219	prev->more = op;
		1220
		1221	prev = op;
		1222	}
		1223	}
		1224
1090	/*	1225	/*
1091	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1226	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1092	* job preparing multi-part monsters	1227	* job preparing multi-part monsters.
1093	*/	1228	*/
1094	object *	1229	object *
1095	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1230	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1096	{	1231	{
		1232	op->remove ();
		1233
1097	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1234	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1098	{	1235	{
1099	tmp->x = x + tmp->arch->clone.x;	1236	tmp->x = x + tmp->arch->x;
1100	tmp->y = y + tmp->arch->clone.y;	1237	tmp->y = y + tmp->arch->y;
1101	}	1238	}
1102		1239
1103	return insert_ob_in_map (op, m, originator, flag);	1240	return insert_ob_in_map (op, m, originator, flag);
1104	}	1241	}
1105		1242
…		…
1124	* just 'op' otherwise	1261	* just 'op' otherwise
1125	*/	1262	*/
1126	object *	1263	object *
1127	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1264	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1128	{	1265	{
1129	object *tmp, *top, *floor = NULL;	1266	if (op->is_on_map ())
1130	sint16 x, y;
1131
1132	if (QUERY_FLAG (op, FLAG_FREED))
1133	{
1134	LOG (llevError, "Trying to insert freed object!\n");
1135	return NULL;
1136	}	1267	{
1137		1268	LOG (llevError, "insert_ob_in_map called for object already on map");
1138	if (!m)
1139	{
1140	char *dump = dump_object (op);
1141	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1142	free (dump);
1143	return op;
1144	}
1145
1146	if (out_of_map (m, op->x, op->y))
1147	{
1148	char *dump = dump_object (op);
1149	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1150	#ifdef MANY_CORES
1151	/* Better to catch this here, as otherwise the next use of this object
1152	* is likely to cause a crash. Better to find out where it is getting
1153	* improperly inserted.
1154	*/
1155	abort ();	1269	abort ();
1156	#endif
1157	free (dump);
1158	return op;
1159	}
1160
1161	if (!QUERY_FLAG (op, FLAG_REMOVED))
1162	{	1270	}
1163	char *dump = dump_object (op);
1164	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1165	free (dump);
1166	return op;
1167	}
1168		1271
1169	if (op->more)	1272	if (op->env)
1170	{
1171	/* The part may be on a different map. */
1172
1173	object *more = op->more;
1174
1175	/* We really need the caller to normalise coordinates - if
1176	* we set the map, that doesn't work if the location is within
1177	* a map and this is straddling an edge. So only if coordinate
1178	* is clear wrong do we normalise it.
1179	*/
1180	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1181	more->map = get_map_from_coord (m, &more->x, &more->y);
1182	else if (!more->map)
1183	{
1184	/* For backwards compatibility - when not dealing with tiled maps,
1185	* more->map should always point to the parent.
1186	*/
1187	more->map = m;
1188	}
1189
1190	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1191	{
1192	if (!op->head)
1193	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1194
1195	return 0;
1196	}
1197	}	1273	{
		1274	LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)");
		1275	op->remove ();
		1276	}
1198		1277
1199	CLEAR_FLAG (op, FLAG_REMOVED);	1278	if (op->face && !face_info (op->face))//D TODO: remove soon
		1279	{//D
		1280	LOG (llevError | logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D
		1281	op->face = 1;//D
		1282	}//D
1200		1283
1201	/* Ideally, the caller figures this out. However, it complicates a lot	1284	/* Ideally, the caller figures this out. However, it complicates a lot
1202	* of areas of callers (eg, anything that uses find_free_spot would now	1285	* of areas of callers (eg, anything that uses find_free_spot would now
1203	* need extra work	1286	* need extra work
1204	*/	1287	*/
1205	op->map = get_map_from_coord (m, &op->x, &op->y);	1288	if (!xy_normalise (m, op->x, op->y))
1206	x = op->x;	1289	{
1207	y = op->y;	1290	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
		1291	return 0;
		1292	}
		1293
		1294	if (object *more = op->more)
		1295	if (!insert_ob_in_map (more, m, originator, flag))
		1296	return 0;
		1297
		1298	CLEAR_FLAG (op, FLAG_REMOVED);
		1299
		1300	op->map = m;
		1301	mapspace &ms = op->ms ();
1208		1302
1209	/* this has to be done after we translate the coordinates.	1303	/* this has to be done after we translate the coordinates.
1210	*/	1304	*/
1211	if (op->nrof && !(flag & INS_NO_MERGE))	1305	if (op->nrof && !(flag & INS_NO_MERGE))
1212	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1306	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1213	if (object::can_merge (op, tmp))	1307	if (object::can_merge (op, tmp))
1214	{	1308	{
		1309	// TODO: we actually want to update tmp, not op,
		1310	// but some caller surely breaks when we return tmp
		1311	// from here :/
1215	op->nrof += tmp->nrof;	1312	op->nrof += tmp->nrof;
1216	tmp->destroy ();	1313	tmp->destroy (1);
1217	}	1314	}
1218		1315
1219	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1316	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1220	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1317	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1221		1318
…		…
1228	{	1325	{
1229	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1326	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1230	abort ();	1327	abort ();
1231	}	1328	}
1232		1329
		1330	if (!originator->is_on_map ())
		1331	LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1332	op->debug_desc (), originator->debug_desc ());
		1333
1233	op->above = originator;	1334	op->above = originator;
1234	op->below = originator->below;	1335	op->below = originator->below;
1235
1236	if (op->below)
1237	op->below->above = op;
1238	else
1239	op->ms ().bot = op;
1240
1241	/* since *below* originator, no need to update top */
1242	originator->below = op;	1336	originator->below = op;
		1337
		1338	*(op->below ? &op->below->above : &ms.bot) = op;
1243	}	1339	}
1244	else	1340	else
1245	{	1341	{
		1342	object *floor = 0;
		1343	object *top = ms.top;
		1344
1246	/* If there are other objects, then */	1345	/* If there are other objects, then */
1247	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1346	if (top)
1248	{	1347	{
1249	object *last = 0;
1250
1251	/*	1348	/*
1252	* If there are multiple objects on this space, we do some trickier handling.	1349	* If there are multiple objects on this space, we do some trickier handling.
1253	* We've already dealt with merging if appropriate.	1350	* We've already dealt with merging if appropriate.
1254	* Generally, we want to put the new object on top. But if	1351	* Generally, we want to put the new object on top. But if
1255	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1352	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1258	* once we get to them. This reduces the need to traverse over all of	1355	* once we get to them. This reduces the need to traverse over all of
1259	* them when adding another one - this saves quite a bit of cpu time	1356	* them when adding another one - this saves quite a bit of cpu time
1260	* when lots of spells are cast in one area. Currently, it is presumed	1357	* when lots of spells are cast in one area. Currently, it is presumed
1261	* that flying non pickable objects are spell objects.	1358	* that flying non pickable objects are spell objects.
1262	*/	1359	*/
1263	while (top)	1360	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1264	{	1361	{
1265	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1362	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1266	floor = top;	1363	floor = tmp;
1267		1364
1268	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1365	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1269	{	1366	{
1270	/* We insert above top, so we want this object below this */	1367	/* We insert above top, so we want this object below this */
1271	top = top->below;	1368	top = tmp->below;
1272	break;	1369	break;
1273	}	1370	}
1274		1371
1275	last = top;
1276	top = top->above;	1372	top = tmp;
1277	}	1373	}
1278
1279	/* Don't want top to be NULL, so set it to the last valid object */
1280	top = last;
1281		1374
1282	/* We let update_position deal with figuring out what the space	1375	/* We let update_position deal with figuring out what the space
1283	* looks like instead of lots of conditions here.	1376	* looks like instead of lots of conditions here.
1284	* makes things faster, and effectively the same result.	1377	* makes things faster, and effectively the same result.
1285	*/	1378	*/
1286		1379
1287	/* Have object 'fall below' other objects that block view.	1380	/* Have object 'fall below' other objects that block view.
1288	* Unless those objects are exits, type 66	1381	* Unless those objects are exits.
1289	* If INS_ON_TOP is used, don't do this processing	1382	* If INS_ON_TOP is used, don't do this processing
1290	* Need to find the object that in fact blocks view, otherwise	1383	* Need to find the object that in fact blocks view, otherwise
1291	* stacking is a bit odd.	1384	* stacking is a bit odd.
1292	*/	1385	*/
1293	if (!(flag & INS_ON_TOP) &&	1386	if (!(flag & INS_ON_TOP)
1294	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1387	&& ms.flags () & P_BLOCKSVIEW
		1388	&& (op->face && !faces [op->face].visibility))
1295	{	1389	{
		1390	object *last;
		1391
1296	for (last = top; last != floor; last = last->below)	1392	for (last = top; last != floor; last = last->below)
1297	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1393	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1298	break;	1394	break;
		1395
1299	/* Check to see if we found the object that blocks view,	1396	/* Check to see if we found the object that blocks view,
1300	* and make sure we have a below pointer for it so that	1397	* and make sure we have a below pointer for it so that
1301	* we can get inserted below this one, which requires we	1398	* we can get inserted below this one, which requires we
1302	* set top to the object below us.	1399	* set top to the object below us.
1303	*/	1400	*/
1304	if (last && last->below && last != floor)	1401	if (last && last->below && last != floor)
1305	top = last->below;	1402	top = last->below;
1306	}	1403	}
1307	} /* If objects on this space */	1404	} /* If objects on this space */
1308		1405
1309	if (flag & INS_MAP_LOAD)
1310	top = GET_MAP_TOP (op->map, op->x, op->y);
1311
1312	if (flag & INS_ABOVE_FLOOR_ONLY)	1406	if (flag & INS_ABOVE_FLOOR_ONLY)
1313	top = floor;	1407	top = floor;
1314		1408
1315	/* Top is the object that our object (op) is going to get inserted above.	1409	// insert object above top, or bottom-most if top = 0
1316	*/
1317
1318	/* First object on this space */
1319	if (!top)	1410	if (!top)
1320	{	1411	{
1321	op->above = GET_MAP_OB (op->map, op->x, op->y);
1322
1323	if (op->above)
1324	op->above->below = op;
1325
1326	op->below = 0;	1412	op->below = 0;
		1413	op->above = ms.bot;
1327	op->ms ().bot = op;	1414	ms.bot = op;
		1415
		1416	*(op->above ? &op->above->below : &ms.top) = op;
1328	}	1417	}
1329	else	1418	else
1330	{ /* get inserted into the stack above top */	1419	{
1331	op->above = top->above;	1420	op->above = top->above;
1332
1333	if (op->above)
1334	op->above->below = op;	1421	top->above = op;
1335		1422
1336	op->below = top;	1423	op->below = top;
1337	top->above = op;	1424	*(op->above ? &op->above->below : &ms.top) = op;
1338	}	1425	}
1339		1426	}
1340	if (!op->above)
1341	op->ms ().top = op;
1342	} /* else not INS_BELOW_ORIGINATOR */
1343		1427
1344	if (op->type == PLAYER)	1428	if (op->type == PLAYER)
1345	{	1429	{
1346	op->contr->do_los = 1;	1430	op->contr->do_los = 1;
1347	++op->map->players;	1431	++op->map->players;
1348	op->map->touch ();	1432	op->map->touch ();
1349	}	1433	}
1350		1434
1351	op->map->dirty = true;	1435	op->map->dirty = true;
1352		1436
1353	/* If we have a floor, we know the player, if any, will be above
1354	* it, so save a few ticks and start from there.
1355	*/
1356	if (!(flag & INS_MAP_LOAD))
1357	if (object *pl = op->ms ().player ())	1437	if (object *pl = ms.player ())
		1438	//TODO: the floorbox prev/next might need updating
		1439	//esrv_send_item (pl, op);
		1440	//TODO: update floorbox to preserve ordering
1358	if (pl->contr->ns)	1441	if (pl->contr->ns)
1359	pl->contr->ns->floorbox_update ();	1442	pl->contr->ns->floorbox_update ();
1360		1443
1361	/* If this object glows, it may affect lighting conditions that are	1444	/* If this object glows, it may affect lighting conditions that are
1362	* visible to others on this map. But update_all_los is really	1445	* visible to others on this map. But update_all_los is really
1363	* an inefficient way to do this, as it means los for all players	1446	* an inefficient way to do this, as it means los for all players
1364	* on the map will get recalculated. The players could very well	1447	* on the map will get recalculated. The players could very well
…		…
1383	* blocked() and wall() work properly), and these flags are updated by	1466	* blocked() and wall() work properly), and these flags are updated by
1384	* update_object().	1467	* update_object().
1385	*/	1468	*/
1386		1469
1387	/* if this is not the head or flag has been passed, don't check walk on status */	1470	/* if this is not the head or flag has been passed, don't check walk on status */
1388	if (!(flag & INS_NO_WALK_ON) && !op->head)	1471	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1389	{	1472	{
1390	if (check_move_on (op, originator))	1473	if (check_move_on (op, originator))
1391	return 0;	1474	return 0;
1392		1475
1393	/* If we are a multi part object, lets work our way through the check	1476	/* If we are a multi part object, lets work our way through the check
1394	* walk on's.	1477	* walk on's.
1395	*/	1478	*/
1396	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1479	for (object *tmp = op->more; tmp; tmp = tmp->more)
1397	if (check_move_on (tmp, originator))	1480	if (check_move_on (tmp, originator))
1398	return 0;	1481	return 0;
1399	}	1482	}
1400		1483
1401	return op;	1484	return op;
…		…
1406	* op is the object to insert it under: supplies x and the map.	1489	* op is the object to insert it under: supplies x and the map.
1407	*/	1490	*/
1408	void	1491	void
1409	replace_insert_ob_in_map (const char *arch_string, object *op)	1492	replace_insert_ob_in_map (const char *arch_string, object *op)
1410	{	1493	{
1411	object *tmp, *tmp1;
1412
1413	/* first search for itself and remove any old instances */	1494	/* first search for itself and remove any old instances */
1414		1495
1415	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1496	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1416	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1497	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1417	tmp->destroy ();	1498	tmp->destroy (1);
1418		1499
1419	tmp1 = arch_to_object (archetype::find (arch_string));	1500	object *tmp = arch_to_object (archetype::find (arch_string));
1420		1501
1421	tmp1->x = op->x;	1502	tmp->x = op->x;
1422	tmp1->y = op->y;	1503	tmp->y = op->y;
		1504
1423	insert_ob_in_map (tmp1, op->map, op, 0);	1505	insert_ob_in_map (tmp, op->map, op, 0);
1424	}	1506	}
1425		1507
1426	object *	1508	object *
1427	object::insert_at (object *where, object *originator, int flags)	1509	object::insert_at (object *where, object *originator, int flags)
1428	{	1510	{
		1511	if (where->env)
		1512	return where->env->insert (this);
		1513	else
1429	where->map->insert (this, where->x, where->y, originator, flags);	1514	return where->map->insert (this, where->x, where->y, originator, flags);
1430	}	1515	}
1431		1516
1432	/*	1517	/*
1433	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1434	* is returned contains nr objects, and the remaining parts contains
1435	* the rest (or is removed and freed if that number is 0).
1436	* On failure, NULL is returned, and the reason put into the
1437	* global static errmsg array.
1438	*/
1439	object *
1440	get_split_ob (object *orig_ob, uint32 nr)
1441	{
1442	object *newob;
1443	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1444
1445	if (orig_ob->nrof < nr)
1446	{
1447	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1448	return NULL;
1449	}
1450
1451	newob = object_create_clone (orig_ob);
1452
1453	if ((orig_ob->nrof -= nr) < 1)
1454	orig_ob->destroy (1);
1455	else if (!is_removed)
1456	{
1457	if (orig_ob->env != NULL)
1458	sub_weight (orig_ob->env, orig_ob->weight * nr);
1459	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1460	{
1461	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1462	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1463	return NULL;
1464	}
1465	}
1466
1467	newob->nrof = nr;
1468
1469	return newob;
1470	}
1471
1472	/*
1473	* decrease_ob_nr(object, number) decreases a specified number from	1518	* decrease(object, number) decreases a specified number from
1474	* the amount of an object. If the amount reaches 0, the object	1519	* the amount of an object. If the amount reaches 0, the object
1475	* is subsequently removed and freed.	1520	* is subsequently removed and freed.
1476	*	1521	*
1477	* Return value: 'op' if something is left, NULL if the amount reached 0	1522	* Return value: 'op' if something is left, NULL if the amount reached 0
1478	*/	1523	*/
		1524	bool
		1525	object::decrease (sint32 nr)
		1526	{
		1527	if (!nr)
		1528	return true;
1479		1529
		1530	nr = min (nr, nrof);
		1531
		1532	if (nrof > nr)
		1533	{
		1534	nrof -= nr;
		1535	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
		1536
		1537	if (object *pl = visible_to ())
		1538	esrv_update_item (UPD_NROF, pl, this);
		1539
		1540	return true;
		1541	}
		1542	else
		1543	{
		1544	destroy ();
		1545	return false;
		1546	}
		1547	}
		1548
		1549	/*
		1550	* split(ob,nr) splits up ob into two parts. The part which
		1551	* is returned contains nr objects, and the remaining parts contains
		1552	* the rest (or is removed and returned if that number is 0).
		1553	* On failure, NULL is returned.
		1554	*/
1480	object *	1555	object *
1481	decrease_ob_nr (object *op, uint32 i)	1556	object::split (sint32 nr)
1482	{	1557	{
1483	object *tmp;	1558	int have = number_of ();
1484		1559
1485	if (i == 0) /* objects with op->nrof require this check */	1560	if (have < nr)
1486	return op;	1561	return 0;
1487		1562	else if (have == nr)
1488	if (i > op->nrof)
1489	i = op->nrof;
1490
1491	if (QUERY_FLAG (op, FLAG_REMOVED))
1492	op->nrof -= i;
1493	else if (op->env)
1494	{	1563	{
1495	/* is this object in the players inventory, or sub container
1496	* therein?
1497	*/
1498	tmp = op->in_player ();
1499	/* nope. Is this a container the player has opened?
1500	* If so, set tmp to that player.
1501	* IMO, searching through all the players will mostly
1502	* likely be quicker than following op->env to the map,
1503	* and then searching the map for a player.
1504	*/
1505	if (!tmp)
1506	for_all_players (pl)
1507	if (pl->ob->container == op->env)
1508	{
1509	tmp = pl->ob;
1510	break;
1511	}
1512
1513	if (i < op->nrof)
1514	{
1515	sub_weight (op->env, op->weight * i);
1516	op->nrof -= i;
1517	if (tmp)
1518	esrv_send_item (tmp, op);
1519	}
1520	else
1521	{
1522	op->remove ();	1564	remove ();
1523	op->nrof = 0;	1565	return this;
1524	if (tmp)
1525	esrv_del_item (tmp->contr, op->count);
1526	}
1527	}	1566	}
1528	else	1567	else
1529	{	1568	{
1530	object *above = op->above;	1569	decrease (nr);
1531		1570
1532	if (i < op->nrof)	1571	object *op = deep_clone ();
1533	op->nrof -= i;	1572	op->nrof = nr;
1534	else
1535	{
1536	op->remove ();
1537	op->nrof = 0;
1538	}
1539
1540	/* Since we just removed op, op->above is null */
1541	for (tmp = above; tmp; tmp = tmp->above)
1542	if (tmp->type == PLAYER)
1543	{
1544	if (op->nrof)
1545	esrv_send_item (tmp, op);
1546	else
1547	esrv_del_item (tmp->contr, op->count);
1548	}
1549	}
1550
1551	if (op->nrof)
1552	return op;	1573	return op;
1553	else
1554	{
1555	op->destroy ();
1556	return 0;
1557	}
1558	}
1559
1560	/*
1561	* add_weight(object, weight) adds the specified weight to an object,
1562	* and also updates how much the environment(s) is/are carrying.
1563	*/
1564
1565	void
1566	add_weight (object *op, signed long weight)
1567	{
1568	while (op != NULL)
1569	{
1570	if (op->type == CONTAINER)
1571	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1572
1573	op->carrying += weight;
1574	op = op->env;
1575	}	1574	}
1576	}	1575	}
1577		1576
1578	object *	1577	object *
1579	insert_ob_in_ob (object *op, object *where)	1578	insert_ob_in_ob (object *op, object *where)
…		…
1584	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1583	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1585	free (dump);	1584	free (dump);
1586	return op;	1585	return op;
1587	}	1586	}
1588		1587
1589	if (where->head)	1588	if (where->head_ () != where)
1590	{	1589	{
1591	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1590	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1592	where = where->head;	1591	where = where->head;
1593	}	1592	}
1594		1593
1595	return where->insert (op);	1594	return where->insert (op);
1596	}	1595	}
…		…
1601	* inside the object environment.	1600	* inside the object environment.
1602	*	1601	*
1603	* The function returns now pointer to inserted item, and return value can	1602	* The function returns now pointer to inserted item, and return value can
1604	* be != op, if items are merged. -Tero	1603	* be != op, if items are merged. -Tero
1605	*/	1604	*/
1606
1607	object *	1605	object *
1608	object::insert (object *op)	1606	object::insert (object *op)
1609	{	1607	{
1610	object *tmp, *otmp;
1611
1612	if (!QUERY_FLAG (op, FLAG_REMOVED))
1613	op->remove ();
1614
1615	if (op->more)	1608	if (op->more)
1616	{	1609	{
1617	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1610	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1618	return op;	1611	return op;
1619	}	1612	}
1620		1613
1621	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1614	op->remove ();
1622	CLEAR_FLAG (op, FLAG_REMOVED);	1615
		1616	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1617
1623	if (op->nrof)	1618	if (op->nrof)
1624	{
1625	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1619	for (object *tmp = inv; tmp; tmp = tmp->below)
1626	if (object::can_merge (tmp, op))	1620	if (object::can_merge (tmp, op))
1627	{	1621	{
1628	/* return the original object and remove inserted object	1622	/* return the original object and remove inserted object
1629	(client needs the original object) */	1623	(client needs the original object) */
1630	tmp->nrof += op->nrof;	1624	tmp->nrof += op->nrof;
1631	/* Weight handling gets pretty funky. Since we are adding to	1625
1632	* tmp->nrof, we need to increase the weight.	1626	if (object *pl = tmp->visible_to ())
1633	*/	1627	esrv_update_item (UPD_NROF, pl, tmp);
		1628
1634	add_weight (this, op->weight * op->nrof);	1629	adjust_weight (this, op->total_weight ());
1635	SET_FLAG (op, FLAG_REMOVED);	1630
1636	op->destroy (); /* free the inserted object */	1631	op->destroy (1);
1637	op = tmp;	1632	op = tmp;
1638	op->remove (); /* and fix old object's links */	1633	goto inserted;
1639	CLEAR_FLAG (op, FLAG_REMOVED);
1640	break;
1641	}	1634	}
1642		1635
1643	/* I assume combined objects have no inventory	1636	op->owner = 0; // it's his/hers now. period.
1644	* We add the weight - this object could have just been removed
1645	* (if it was possible to merge). calling remove_ob will subtract
1646	* the weight, so we need to add it in again, since we actually do
1647	* the linking below
1648	*/
1649	add_weight (this, op->weight * op->nrof);
1650	}
1651	else
1652	add_weight (this, (op->weight + op->carrying));
1653
1654	otmp = this->in_player ();
1655	if (otmp && otmp->contr)
1656	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1657	otmp->update_stats ();
1658
1659	op->map = 0;	1637	op->map = 0;
1660	op->env = this;	1638	op->x = 0;
		1639	op->y = 0;
		1640
1661	op->above = 0;	1641	op->above = 0;
1662	op->below = 0;	1642	op->below = inv;
1663	op->x = 0, op->y = 0;	1643	op->env = this;
1664		1644
		1645	if (inv)
		1646	inv->above = op;
		1647
		1648	inv = op;
		1649
		1650	op->flag [FLAG_REMOVED] = 0;
		1651
		1652	if (object *pl = op->visible_to ())
		1653	esrv_send_item (pl, op);
		1654
		1655	adjust_weight (this, op->total_weight ());
		1656
		1657	inserted:
1665	/* reset the light list and los of the players on the map */	1658	/* reset the light list and los of the players on the map */
1666	if ((op->glow_radius != 0) && map)	1659	if (op->glow_radius && map && map->darkness)
1667	{
1668	#ifdef DEBUG_LIGHTS
1669	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1670	#endif /* DEBUG_LIGHTS */
1671	if (map->darkness)
1672	update_all_los (map, x, y);	1660	update_all_los (map, x, y);
1673	}
1674		1661
1675	/* Client has no idea of ordering so lets not bother ordering it here.	1662	// if this is a player's inventory, update stats
1676	* It sure simplifies this function...	1663	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1677	*/	1664	update_stats ();
1678	if (!inv)
1679	inv = op;
1680	else
1681	{
1682	op->below = inv;
1683	op->below->above = op;
1684	inv = op;
1685	}
1686		1665
1687	INVOKE_OBJECT (INSERT, this);	1666	INVOKE_OBJECT (INSERT, this);
1688		1667
1689	return op;	1668	return op;
1690	}	1669	}
…		…
1771	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1750	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1772	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1751	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1773	{	1752	{
1774		1753
1775	float	1754	float
1776	diff = tmp->move_slow_penalty * FABS (op->speed);	1755	diff = tmp->move_slow_penalty * fabs (op->speed);
1777		1756
1778	if (op->type == PLAYER)	1757	if (op->type == PLAYER)
1779	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1758	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1780	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1759	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1781	diff /= 4.0;	1760	diff /= 4.0;
…		…
1818	LOG (llevError, "Present_arch called outside map.\n");	1797	LOG (llevError, "Present_arch called outside map.\n");
1819	return NULL;	1798	return NULL;
1820	}	1799	}
1821		1800
1822	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1801	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1823	if (tmp->arch == at)	1802	if (tmp->arch->archname == at->archname)
1824	return tmp;	1803	return tmp;
1825		1804
1826	return NULL;	1805	return NULL;
1827	}	1806	}
1828		1807
…		…
1892	* The first matching object is returned, or NULL if none.	1871	* The first matching object is returned, or NULL if none.
1893	*/	1872	*/
1894	object *	1873	object *
1895	present_arch_in_ob (const archetype *at, const object *op)	1874	present_arch_in_ob (const archetype *at, const object *op)
1896	{	1875	{
1897	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1876	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1898	if (tmp->arch == at)	1877	if (tmp->arch->archname == at->archname)
1899	return tmp;	1878	return tmp;
1900		1879
1901	return NULL;	1880	return NULL;
1902	}	1881	}
1903		1882
…		…
1905	* activate recursively a flag on an object inventory	1884	* activate recursively a flag on an object inventory
1906	*/	1885	*/
1907	void	1886	void
1908	flag_inv (object *op, int flag)	1887	flag_inv (object *op, int flag)
1909	{	1888	{
1910	if (op->inv)
1911	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1889	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1912	{	1890	{
1913	SET_FLAG (tmp, flag);	1891	SET_FLAG (tmp, flag);
1914	flag_inv (tmp, flag);	1892	flag_inv (tmp, flag);
1915	}	1893	}
1916	}	1894	}
1917		1895
1918	/*	1896	/*
1919	* deactivate recursively a flag on an object inventory	1897	* deactivate recursively a flag on an object inventory
1920	*/	1898	*/
1921	void	1899	void
1922	unflag_inv (object *op, int flag)	1900	unflag_inv (object *op, int flag)
1923	{	1901	{
1924	if (op->inv)
1925	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1902	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1926	{	1903	{
1927	CLEAR_FLAG (tmp, flag);	1904	CLEAR_FLAG (tmp, flag);
1928	unflag_inv (tmp, flag);	1905	unflag_inv (tmp, flag);
1929	}	1906	}
1930	}
1931
1932	/*
1933	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1934	* all it's inventory (recursively).
1935	* If checksums are used, a player will get set_cheat called for
1936	* him/her-self and all object carried by a call to this function.
1937	*/
1938	void
1939	set_cheat (object *op)
1940	{
1941	SET_FLAG (op, FLAG_WAS_WIZ);
1942	flag_inv (op, FLAG_WAS_WIZ);
1943	}	1907	}
1944		1908
1945	/*	1909	/*
1946	* find_free_spot(object, map, x, y, start, stop) will search for	1910	* find_free_spot(object, map, x, y, start, stop) will search for
1947	* a spot at the given map and coordinates which will be able to contain	1911	* a spot at the given map and coordinates which will be able to contain
…		…
1949	* to search (see the freearr_x/y[] definition).	1913	* to search (see the freearr_x/y[] definition).
1950	* It returns a random choice among the alternatives found.	1914	* It returns a random choice among the alternatives found.
1951	* start and stop are where to start relative to the free_arr array (1,9	1915	* start and stop are where to start relative to the free_arr array (1,9
1952	* does all 4 immediate directions). This returns the index into the	1916	* does all 4 immediate directions). This returns the index into the
1953	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1917	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1954	* Note - this only checks to see if there is space for the head of the
1955	* object - if it is a multispace object, this should be called for all
1956	* pieces.
1957	* Note2: This function does correctly handle tiled maps, but does not	1918	* Note: This function does correctly handle tiled maps, but does not
1958	* inform the caller. However, insert_ob_in_map will update as	1919	* inform the caller. However, insert_ob_in_map will update as
1959	* necessary, so the caller shouldn't need to do any special work.	1920	* necessary, so the caller shouldn't need to do any special work.
1960	* Note - updated to take an object instead of archetype - this is necessary	1921	* Note - updated to take an object instead of archetype - this is necessary
1961	* because arch_blocked (now ob_blocked) needs to know the movement type	1922	* because arch_blocked (now ob_blocked) needs to know the movement type
1962	* to know if the space in question will block the object. We can't use	1923	* to know if the space in question will block the object. We can't use
…		…
1964	* customized, changed states, etc.	1925	* customized, changed states, etc.
1965	*/	1926	*/
1966	int	1927	int
1967	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1928	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
1968	{	1929	{
		1930	int altern[SIZEOFFREE];
1969	int index = 0, flag;	1931	int index = 0, flag;
1970	int altern[SIZEOFFREE];
1971		1932
1972	for (int i = start; i < stop; i++)	1933	for (int i = start; i < stop; i++)
1973	{	1934	{
1974	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1935	mapxy pos (m, x, y); pos.move (i);
1975	if (!flag)	1936
		1937	if (!pos.normalise ())
		1938	continue;
		1939
		1940	mapspace &ms = *pos;
		1941
		1942	if (ms.flags () & P_IS_ALIVE)
		1943	continue;
		1944
		1945	/* However, often
		1946	* ob doesn't have any move type (when used to place exits)
		1947	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1948	*/
		1949	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1950	{
1976	altern [index++] = i;	1951	altern [index++] = i;
		1952	continue;
		1953	}
1977		1954
1978	/* Basically, if we find a wall on a space, we cut down the search size.	1955	/* Basically, if we find a wall on a space, we cut down the search size.
1979	* In this way, we won't return spaces that are on another side of a wall.	1956	* In this way, we won't return spaces that are on another side of a wall.
1980	* This mostly work, but it cuts down the search size in all directions -	1957	* This mostly work, but it cuts down the search size in all directions -
1981	* if the space being examined only has a wall to the north and empty	1958	* if the space being examined only has a wall to the north and empty
1982	* spaces in all the other directions, this will reduce the search space	1959	* spaces in all the other directions, this will reduce the search space
1983	* to only the spaces immediately surrounding the target area, and	1960	* to only the spaces immediately surrounding the target area, and
1984	* won't look 2 spaces south of the target space.	1961	* won't look 2 spaces south of the target space.
1985	*/	1962	*/
1986	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1963	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1964	{
1987	stop = maxfree[i];	1965	stop = maxfree[i];
		1966	continue;
		1967	}
		1968
		1969	/* Note it is intentional that we check ob - the movement type of the
		1970	* head of the object should correspond for the entire object.
		1971	*/
		1972	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1973	continue;
		1974
		1975	if (ob->blocked (m, pos.x, pos.y))
		1976	continue;
		1977
		1978	altern [index++] = i;
1988	}	1979	}
1989		1980
1990	if (!index)	1981	if (!index)
1991	return -1;	1982	return -1;
1992		1983
1993	return altern[RANDOM () % index];	1984	return altern [rndm (index)];
1994	}	1985	}
1995		1986
1996	/*	1987	/*
1997	* find_first_free_spot(archetype, maptile, x, y) works like	1988	* find_first_free_spot(archetype, maptile, x, y) works like
1998	* find_free_spot(), but it will search max number of squares.	1989	* find_free_spot(), but it will search max number of squares.
…		…
2001	*/	1992	*/
2002	int	1993	int
2003	find_first_free_spot (const object *ob, maptile *m, int x, int y)	1994	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2004	{	1995	{
2005	for (int i = 0; i < SIZEOFFREE; i++)	1996	for (int i = 0; i < SIZEOFFREE; i++)
2006	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	1997	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2007	return i;	1998	return i;
2008		1999
2009	return -1;	2000	return -1;
2010	}	2001	}
2011		2002
…		…
2019	{	2010	{
2020	arr += begin;	2011	arr += begin;
2021	end -= begin;	2012	end -= begin;
2022		2013
2023	while (--end)	2014	while (--end)
2024	swap (arr [end], arr [RANDOM () % (end + 1)]);	2015	swap (arr [end], arr [rndm (end + 1)]);
2025	}	2016	}
2026		2017
2027	/* new function to make monster searching more efficient, and effective!	2018	/* new function to make monster searching more efficient, and effective!
2028	* This basically returns a randomized array (in the passed pointer) of	2019	* This basically returns a randomized array (in the passed pointer) of
2029	* the spaces to find monsters. In this way, it won't always look for	2020	* the spaces to find monsters. In this way, it won't always look for
…		…
2065	object *tmp;	2056	object *tmp;
2066	maptile *mp;	2057	maptile *mp;
2067		2058
2068	MoveType blocked, move_type;	2059	MoveType blocked, move_type;
2069		2060
2070	if (exclude && exclude->head)	2061	if (exclude && exclude->head_ () != exclude)
2071	{	2062	{
2072	exclude = exclude->head;	2063	exclude = exclude->head;
2073	move_type = exclude->move_type;	2064	move_type = exclude->move_type;
2074	}	2065	}
2075	else	2066	else
…		…
2098	max = maxfree[i];	2089	max = maxfree[i];
2099	else if (mflags & P_IS_ALIVE)	2090	else if (mflags & P_IS_ALIVE)
2100	{	2091	{
2101	for (tmp = ms.bot; tmp; tmp = tmp->above)	2092	for (tmp = ms.bot; tmp; tmp = tmp->above)
2102	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2093	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2103	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2094	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2104	break;	2095	break;
2105		2096
2106	if (tmp)	2097	if (tmp)
2107	return freedir[i];	2098	return freedir[i];
2108	}	2099	}
…		…
2288	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2279	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2289	* core dumps if they do.	2280	* core dumps if they do.
2290	*	2281	*
2291	* Add a check so we can't pick up invisible objects (0.93.8)	2282	* Add a check so we can't pick up invisible objects (0.93.8)
2292	*/	2283	*/
2293
2294	int	2284	int
2295	can_pick (const object *who, const object *item)	2285	can_pick (const object *who, const object *item)
2296	{	2286	{
2297	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2287	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2298	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2288	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2301		2291
2302	/*	2292	/*
2303	* create clone from object to another	2293	* create clone from object to another
2304	*/	2294	*/
2305	object *	2295	object *
2306	object_create_clone (object *asrc)	2296	object::deep_clone ()
2307	{	2297	{
2308	object *dst = 0, *tmp, *src, *part, *prev, *item;	2298	assert (("deep_clone called on non-head object", is_head ()));
2309		2299
2310	if (!asrc)	2300	object *dst = clone ();
2311	return 0;
2312		2301
2313	src = asrc;	2302	object *prev = dst;
2314	if (src->head)
2315	src = src->head;
2316
2317	prev = 0;
2318	for (part = src; part; part = part->more)	2303	for (object *part = this->more; part; part = part->more)
2319	{	2304	{
2320	tmp = part->clone ();	2305	object *tmp = part->clone ();
2321	tmp->x -= src->x;
2322	tmp->y -= src->y;
2323
2324	if (!part->head)
2325	{
2326	dst = tmp;
2327	tmp->head = 0;
2328	}
2329	else
2330	tmp->head = dst;	2306	tmp->head = dst;
2331
2332	tmp->more = 0;
2333
2334	if (prev)
2335	prev->more = tmp;	2307	prev->more = tmp;
2336
2337	prev = tmp;	2308	prev = tmp;
2338	}	2309	}
2339		2310
2340	for (item = src->inv; item; item = item->below)	2311	for (object *item = inv; item; item = item->below)
2341	insert_ob_in_ob (object_create_clone (item), dst);	2312	insert_ob_in_ob (item->deep_clone (), dst);
2342		2313
2343	return dst;	2314	return dst;
2344	}
2345
2346	/* GROS - Creates an object using a string representing its content. */
2347	/* Basically, we save the content of the string to a temp file, then call */
2348	/* load_object on it. I admit it is a highly inefficient way to make things, */
2349	/* but it was simple to make and allows reusing the load_object function. */
2350	/* Remember not to use load_object_str in a time-critical situation. */
2351	/* Also remember that multiparts objects are not supported for now. */
2352	object *
2353	load_object_str (const char *obstr)
2354	{
2355	object *op;
2356	char filename[MAX_BUF];
2357
2358	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2359
2360	FILE *tempfile = fopen (filename, "w");
2361
2362	if (tempfile == NULL)
2363	{
2364	LOG (llevError, "Error - Unable to access load object temp file\n");
2365	return NULL;
2366	}
2367
2368	fprintf (tempfile, obstr);
2369	fclose (tempfile);
2370
2371	op = object::create ();
2372
2373	object_thawer thawer (filename);
2374
2375	if (thawer)
2376	load_object (thawer, op, 0);
2377
2378	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2379	CLEAR_FLAG (op, FLAG_REMOVED);
2380
2381	return op;
2382	}	2315	}
2383		2316
2384	/* This returns the first object in who's inventory that	2317	/* This returns the first object in who's inventory that
2385	* has the same type and subtype match.	2318	* has the same type and subtype match.
2386	* returns NULL if no match.	2319	* returns NULL if no match.
…		…
2393	return tmp;	2326	return tmp;
2394		2327
2395	return 0;	2328	return 0;
2396	}	2329	}
2397		2330
2398	/* If ob has a field named key, return the link from the list,	2331	const shstr &
2399	* otherwise return NULL.	2332	object::kv_get (const shstr &key) const
2400	*
2401	* key must be a passed in shared string - otherwise, this won't
2402	* do the desired thing.
2403	*/
2404	key_value *
2405	get_ob_key_link (const object *ob, const char *key)
2406	{	2333	{
2407	for (key_value *link = ob->key_values; link; link = link->next)	2334	for (key_value *kv = key_values; kv; kv = kv->next)
2408	if (link->key == key)	2335	if (kv->key == key)
2409	return link;
2410
2411	return 0;
2412	}
2413
2414	/*
2415	* Returns the value of op has an extra_field for key, or NULL.
2416	*
2417	* The argument doesn't need to be a shared string.
2418	*
2419	* The returned string is shared.
2420	*/
2421	const char *
2422	get_ob_key_value (const object *op, const char *const key)
2423	{
2424	key_value *link;
2425	shstr_cmp canonical_key (key);
2426
2427	if (!canonical_key)
2428	{
2429	/* 1. There being a field named key on any object
2430	* implies there'd be a shared string to find.
2431	* 2. Since there isn't, no object has this field.
2432	* 3. Therefore, *this* object doesn't have this field.
2433	*/
2434	return 0;
2435	}
2436
2437	/* This is copied from get_ob_key_link() above -
2438	* only 4 lines, and saves the function call overhead.
2439	*/
2440	for (link = op->key_values; link; link = link->next)
2441	if (link->key == canonical_key)
2442	return link->value;	2336	return kv->value;
2443		2337
2444	return 0;	2338	return shstr_null;
2445	}	2339	}
2446		2340
2447		2341	void
2448	/*	2342	object::kv_set (const shstr &key, const shstr &value)
2449	* Updates the canonical_key in op to value.
2450	*
2451	* canonical_key is a shared string (value doesn't have to be).
2452	*
2453	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2454	* keys.
2455	*
2456	* Returns TRUE on success.
2457	*/
2458	int
2459	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2460	{	2343	{
2461	key_value *field = NULL, *last = NULL;	2344	for (key_value *kv = key_values; kv; kv = kv->next)
2462		2345	if (kv->key == key)
2463	for (field = op->key_values; field != NULL; field = field->next)
2464	{
2465	if (field->key != canonical_key)
2466	{	2346	{
2467	last = field;	2347	kv->value = value;
2468	continue;	2348	return;
2469	}	2349	}
2470		2350
2471	if (value)	2351	key_value *kv = new key_value;
2472	field->value = value;	2352
2473	else	2353	kv->next = key_values;
		2354	kv->key = key;
		2355	kv->value = value;
		2356
		2357	key_values = kv;
		2358	}
		2359
		2360	void
		2361	object::kv_del (const shstr &key)
		2362	{
		2363	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2364	if ((*kvp)->key == key)
2474	{	2365	{
2475	/* Basically, if the archetype has this key set,	2366	key_value *kv = *kvp;
2476	* we need to store the null value so when we save	2367	*kvp = (*kvp)->next;
2477	* it, we save the empty value so that when we load,	2368	delete kv;
2478	* we get this value back again.	2369	return;
2479	*/
2480	if (get_ob_key_link (&op->arch->clone, canonical_key))
2481	field->value = 0;
2482	else
2483	{
2484	if (last)
2485	last->next = field->next;
2486	else
2487	op->key_values = field->next;
2488
2489	delete field;
2490	}
2491	}	2370	}
2492	return TRUE;
2493	}
2494	/* IF we get here, key doesn't exist */
2495
2496	/* No field, we'll have to add it. */
2497
2498	if (!add_key)
2499	return FALSE;
2500
2501	/* There isn't any good reason to store a null
2502	* value in the key/value list. If the archetype has
2503	* this key, then we should also have it, so shouldn't
2504	* be here. If user wants to store empty strings,
2505	* should pass in ""
2506	*/
2507	if (value == NULL)
2508	return TRUE;
2509
2510	field = new key_value;
2511
2512	field->key = canonical_key;
2513	field->value = value;
2514	/* Usual prepend-addition. */
2515	field->next = op->key_values;
2516	op->key_values = field;
2517
2518	return TRUE;
2519	}
2520
2521	/*
2522	* Updates the key in op to value.
2523	*
2524	* If add_key is FALSE, this will only update existing keys,
2525	* and not add new ones.
2526	* In general, should be little reason FALSE is ever passed in for add_key
2527	*
2528	* Returns TRUE on success.
2529	*/
2530	int
2531	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2532	{
2533	shstr key_ (key);
2534
2535	return set_ob_key_value_s (op, key_, value, add_key);
2536	}	2371	}
2537		2372
2538	object::depth_iterator::depth_iterator (object *container)	2373	object::depth_iterator::depth_iterator (object *container)
2539	: iterator_base (container)	2374	: iterator_base (container)
2540	{	2375	{
…		…
2553	item = item->inv;	2388	item = item->inv;
2554	}	2389	}
2555	else	2390	else
2556	item = item->env;	2391	item = item->env;
2557	}	2392	}
2558
2559		2393
2560	const char *	2394	const char *
2561	object::flag_desc (char *desc, int len) const	2395	object::flag_desc (char *desc, int len) const
2562	{	2396	{
2563	char *p = desc;	2397	char *p = desc;
…		…
2591	{	2425	{
2592	char flagdesc[512];	2426	char flagdesc[512];
2593	char info2[256 * 4];	2427	char info2[256 * 4];
2594	char *p = info;	2428	char *p = info;
2595		2429
2596	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",	2430	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2597	count, uuid.seq,	2431	count,
		2432	uuid.c_str (),
2598	&name,	2433	&name,
2599	title ? "\",title:" : "",	2434	title ? ",title:\"" : "",
2600	title ? (const char *)title : "",	2435	title ? (const char *)title : "",
		2436	title ? "\"" : "",
2601	flag_desc (flagdesc, 512), type);	2437	flag_desc (flagdesc, 512), type);
2602		2438
2603	if (env)	2439	if (!flag[FLAG_REMOVED] && env)
2604	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2440	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2605		2441
2606	if (map)	2442	if (map)
2607	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2443	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2608		2444
…		…
2610	}	2446	}
2611		2447
2612	const char *	2448	const char *
2613	object::debug_desc () const	2449	object::debug_desc () const
2614	{	2450	{
2615	static char info[256 * 4];	2451	static char info[3][256 * 4];
		2452	static int info_idx;
		2453
2616	return debug_desc (info);	2454	return debug_desc (info [++info_idx % 3]);
2617	}	2455	}
2618		2456
2619	const char *	2457	struct region *
2620	object::debug_desc2 () const	2458	object::region () const
2621	{	2459	{
2622	static char info[256 * 4];	2460	return map ? map->region (x, y)
2623	return debug_desc (info);	2461	: region::default_region ();
2624	}	2462	}
2625		2463
		2464	const materialtype_t *
		2465	object::dominant_material () const
		2466	{
		2467	if (materialtype_t *mt = name_to_material (materialname))
		2468	return mt;
		2469
		2470	return name_to_material (shstr_unknown);
		2471	}
		2472
		2473	void
		2474	object::open_container (object *new_container)
		2475	{
		2476	if (container == new_container)
		2477	return;
		2478
		2479	object *old_container = container;
		2480
		2481	if (old_container)
		2482	{
		2483	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2484	return;
		2485
		2486	#if 0
		2487	// remove the "Close old_container" object.
		2488	if (object *closer = old_container->inv)
		2489	if (closer->type == CLOSE_CON)
		2490	closer->destroy ();
		2491	#endif
		2492
		2493	// make sure the container is available
		2494	esrv_send_item (this, old_container);
		2495
		2496	old_container->flag [FLAG_APPLIED] = false;
		2497	container = 0;
		2498
		2499	// client needs item update to make it work, client bug requires this to be separate
		2500	esrv_update_item (UPD_FLAGS, this, old_container);
		2501
		2502	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2503	play_sound (sound_find ("chest_close"));
		2504	}
		2505
		2506	if (new_container)
		2507	{
		2508	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2509	return;
		2510
		2511	// TODO: this does not seem to serve any purpose anymore?
		2512	#if 0
		2513	// insert the "Close Container" object.
		2514	if (archetype *closer = new_container->other_arch)
		2515	{
		2516	object *closer = arch_to_object (new_container->other_arch);
		2517	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2518	new_container->insert (closer);
		2519	}
		2520	#endif
		2521
		2522	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2523
		2524	// make sure the container is available, client bug requires this to be separate
		2525	esrv_send_item (this, new_container);
		2526
		2527	new_container->flag [FLAG_APPLIED] = true;
		2528	container = new_container;
		2529
		2530	// client needs flag change
		2531	esrv_update_item (UPD_FLAGS, this, new_container);
		2532	esrv_send_inventory (this, new_container);
		2533	play_sound (sound_find ("chest_open"));
		2534	}
		2535	// else if (!old_container->env && contr && contr->ns)
		2536	// contr->ns->floorbox_reset ();
		2537	}
		2538
		2539	object *
		2540	object::force_find (const shstr name)
		2541	{
		2542	/* cycle through his inventory to look for the MARK we want to
		2543	* place
		2544	*/
		2545	for (object *tmp = inv; tmp; tmp = tmp->below)
		2546	if (tmp->type == FORCE && tmp->slaying == name)
		2547	return splay (tmp);
		2548
		2549	return 0;
		2550	}
		2551
		2552	void
		2553	object::force_add (const shstr name, int duration)
		2554	{
		2555	if (object *force = force_find (name))
		2556	force->destroy ();
		2557
		2558	object *force = get_archetype (FORCE_NAME);
		2559
		2560	force->slaying = name;
		2561	force->stats.food = 1;
		2562	force->speed_left = -1.f;
		2563
		2564	force->set_speed (duration ? 1.f / duration : 0.f);
		2565	force->flag [FLAG_IS_USED_UP] = true;
		2566	force->flag [FLAG_APPLIED] = true;
		2567
		2568	insert (force);
		2569	}
		2570
		2571	void
		2572	object::play_sound (faceidx sound)
		2573	{
		2574	if (!sound)
		2575	return;
		2576
		2577	if (flag [FLAG_REMOVED])
		2578	return;
		2579
		2580	if (env)
		2581	{
		2582	if (object *pl = in_player ())
		2583	pl->contr->play_sound (sound);
		2584	}
		2585	else
		2586	map->play_sound (sound, x, y);
		2587	}
		2588

Diff Legend

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