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.193 by root, Mon Oct 15 17:50:27 2007 UTC vs.
Revision 1.294 by root, Thu Nov 5 15:43:21 2009 UTC

1	/*	1	/*
2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team	4	* Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Crossfire TRT is free software: you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation, either version 3 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* 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 Affero GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
20	*	21	*
21	* The authors can be reached via e-mail to <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
23		24
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying
26	variable. */
27	#include <global.h>	25	#include <global.h>
28	#include <stdio.h>	26	#include <stdio.h>
29	#include <sys/types.h>	27	#include <sys/types.h>
30	#include <sys/uio.h>	28	#include <sys/uio.h>
31	#include <object.h>	29	#include <object.h>
32	#include <funcpoint.h>
33	#include <sproto.h>	30	#include <sproto.h>
34	#include <loader.h>	31	#include <loader.h>
35		32
36	#include <bitset>	33	#include <bitset>
37		34
38	int nrofallocobjects = 0;	35	UUID UUID::cur;
39	static UUID uuid;	36	static uint64_t seq_next_save;
40	const uint64 UUID_SKIP = 1<<19;	37	static const uint64 UUID_GAP = 1<<19;
		38	uint32_t mapspace::smellcount = 10000;
41		39
42	objectvec objects;	40	objectvec objects;
43	activevec actives;	41	activevec actives;
44		42
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,	43	//+GPL
		44
		45	short freearr_x[SIZEOFFREE] = {
		46	0,
		47	0, 1, 1, 1, 0, -1, -1, -1,
		48	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	49	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	};	50	};
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,	51	short freearr_y[SIZEOFFREE] = {
		52	0,
		53	-1, -1, 0, 1, 1, 1, 0, -1,
		54	-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	55	-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	};	56	};
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,	57	int maxfree[SIZEOFFREE] = {
		58	0,
		59	9, 10, 13, 14, 17, 18, 21, 22,
		60	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	61	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	};	62	};
54	int freedir[SIZEOFFREE] = {	63	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,	64	0,
		65	1, 2, 3, 4, 5, 6, 7, 8,
		66	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	67	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	};	68	};
58		69
59	static void	70	static void
60	write_uuid (void)	71	write_uuid (uval64 skip, bool sync)
61	{	72	{
62	char filename1[MAX_BUF], filename2[MAX_BUF];	73	CALL_BEGIN (2);
63		74	CALL_ARG_SV (newSVval64 (skip));
64	sprintf (filename1, "%s/uuid", settings.localdir);	75	CALL_ARG_SV (boolSV (sync));
65	sprintf (filename2, "%s/uuid~", settings.localdir);	76	CALL_CALL ("cf::write_uuid", G_DISCARD);
66		77	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	}	78	}
79		79
80	static void	80	static void
81	read_uuid (void)	81	read_uuid (void)
82	{	82	{
83	char filename[MAX_BUF];	83	char filename[MAX_BUF];
84		84
85	sprintf (filename, "%s/uuid", settings.localdir);	85	sprintf (filename, "%s/uuid", settings.localdir);
		86
		87	seq_next_save = 0;
86		88
87	FILE *fp;	89	FILE *fp;
88		90
89	if (!(fp = fopen (filename, "r")))	91	if (!(fp = fopen (filename, "r")))
90	{	92	{
91	if (errno == ENOENT)	93	if (errno == ENOENT)
92	{	94	{
93	LOG (llevInfo, "RESET uid to 1\n");	95	LOG (llevInfo, "RESET uid to 1\n");
94	uuid.seq = 0;	96	UUID::cur.seq = 0;
95	write_uuid ();	97	write_uuid (UUID_GAP, true);
96	return;	98	return;
97	}	99	}
98		100
99	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	101	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100	_exit (1);	102	_exit (1);
101	}	103	}
102		104
103	int version;	105	UUID::BUF buf;
104	unsigned long long uid;	106	buf[0] = 0;
105	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	107	fgets (buf, sizeof (buf), fp);
		108
		109	if (!UUID::cur.parse (buf))
106	{	110	{
107	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	111	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
108	_exit (1);	112	_exit (1);
109	}	113	}
110		114
111	uuid.seq = uid;	115	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
112	write_uuid ();	116
113	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	117	write_uuid (UUID_GAP, true);
114	fclose (fp);	118	fclose (fp);
115	}	119	}
116		120
117	UUID	121	UUID
118	gen_uuid ()	122	UUID::gen ()
119	{	123	{
120	UUID uid;	124	UUID uid;
121		125
122	uid.seq = ++uuid.seq;	126	uid.seq = ++cur.seq;
123		127
124	if (!(uuid.seq & (UUID_SKIP - 1)))	128	if (expect_false (cur.seq >= seq_next_save))
125	write_uuid ();	129	{
		130	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		131	write_uuid (UUID_GAP, false);
		132	}
		133
126		134
127	return uid;	135	return uid;
128	}	136	}
129		137
130	void	138	void
131	init_uuid ()	139	UUID::init ()
132	{	140	{
133	read_uuid ();	141	read_uuid ();
134	}	142	}
135		143
136	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	144	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
137	static int	145	static bool
138	compare_ob_value_lists_one (const object *wants, const object *has)	146	compare_ob_value_lists_one (const object *wants, const object *has)
139	{	147	{
140	key_value *wants_field;
141
142	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	148	/* 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	149	* objects with lists are rare, and lists stay short. If not, use a
144	* different structure or at least keep the lists sorted...	150	* different structure or at least keep the lists sorted...
145	*/	151	*/
146		152
147	/* For each field in wants, */	153	/* For each field in wants, */
148	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)	154	for (key_value *kv = wants->key_values; kv; kv = kv->next)
149	{	155	if (has->kv_get (kv->key) != kv->value)
150	key_value *has_field;	156	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		157
171	/* If we get here, every field in wants has a matching field in has. */	158	/* If we get here, every field in wants has a matching field in has. */
172	return TRUE;	159	return true;
173	}	160	}
174		161
175	/* Returns TRUE if ob1 has the same key_values as ob2. */	162	/* Returns TRUE if ob1 has the same key_values as ob2. */
176	static int	163	static bool
177	compare_ob_value_lists (const object *ob1, const object *ob2)	164	compare_ob_value_lists (const object *ob1, const object *ob2)
178	{	165	{
179	/* However, there may be fields in has which aren't partnered in wants,	166	/* However, there may be fields in has which aren't partnered in wants,
180	* so we need to run the comparison *twice*. :(	167	* so we need to run the comparison *twice*. :(
181	*/	168	*/
182	return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1);	169	return compare_ob_value_lists_one (ob1, ob2)
		170	&& compare_ob_value_lists_one (ob2, ob1);
183	}	171	}
184		172
185	/* Function examines the 2 objects given to it, and returns true if	173	/* Function examines the 2 objects given to it, and returns true if
186	* they can be merged together.	174	* they can be merged together.
187	*	175	*
…		…
202	|| ob1->speed != ob2->speed	190	|| ob1->speed != ob2->speed
203	|| ob1->value != ob2->value	191	|| ob1->value != ob2->value
204	|| ob1->name != ob2->name)	192	|| ob1->name != ob2->name)
205	return 0;	193	return 0;
206		194
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	195	/* Do not merge objects if nrof would overflow, assume nrof
209	* value could not be stored in a sint32 (which unfortunately sometimes is	196	* is always 0 .. 2**31-1 */
210	* used to store nrof).	197	if (ob1->nrof > 0x7fffffff - ob2->nrof)
211	*/
212	if (ob1->nrof + ob2->nrof >= 1UL << 31)
213	return 0;	198	return 0;
214		199
215	/* If the objects have been identified, set the BEEN_APPLIED flag.	200	/* 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	201	* 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	202	* 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	203	* are not equal - just if it has been identified, the been_applied
219	* flags lose any meaning.	204	* flags lose any meaning.
220	*/	205	*/
221	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	206	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
222	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	207	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
223		208
224	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	209	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
225	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	210	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
226		211
227	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	212	if (ob1->arch->archname != ob2->arch->archname
228	|| ob1->arch != ob2->arch
229	|| ob1->name != ob2->name	213	|| ob1->name != ob2->name
230	|| ob1->title != ob2->title	214	|| ob1->title != ob2->title
231	|| ob1->msg != ob2->msg	215	|| ob1->msg != ob2->msg
232	|| ob1->weight != ob2->weight	216	|| 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	217	|| ob1->attacktype != ob2->attacktype
236	|| ob1->magic != ob2->magic	218	|| ob1->magic != ob2->magic
237	|| ob1->slaying != ob2->slaying	219	|| ob1->slaying != ob2->slaying
238	|| ob1->skill != ob2->skill	220	|| ob1->skill != ob2->skill
239	|| ob1->value != ob2->value	221	|| ob1->value != ob2->value
240	|| ob1->animation_id != ob2->animation_id	222	|| ob1->animation_id != ob2->animation_id
		223	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
241	|| ob1->client_type != ob2->client_type	224	|| ob1->client_type != ob2->client_type
242	|| ob1->materialname != ob2->materialname	225	|| ob1->materialname != ob2->materialname
243	|| ob1->lore != ob2->lore	226	|| ob1->lore != ob2->lore
244	|| ob1->subtype != ob2->subtype	227	|| ob1->subtype != ob2->subtype
245	|| ob1->move_type != ob2->move_type	228	|| ob1->move_type != ob2->move_type
246	|| ob1->move_block != ob2->move_block	229	|| ob1->move_block != ob2->move_block
247	|| ob1->move_allow != ob2->move_allow	230	|| ob1->move_allow != ob2->move_allow
248	|| ob1->move_on != ob2->move_on	231	|| ob1->move_on != ob2->move_on
249	|| ob1->move_off != ob2->move_off	232	|| ob1->move_off != ob2->move_off
250	|| ob1->move_slow != ob2->move_slow	233	|| ob1->move_slow != ob2->move_slow
251	|| ob1->move_slow_penalty != ob2->move_slow_penalty)	234	|| ob1->move_slow_penalty != ob2->move_slow_penalty
		235	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
		236	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
252	return 0;	237	return 0;
253		238
		239	if ((ob1->flag ^ ob2->flag)
		240	.reset (FLAG_INV_LOCKED)
		241	.reset (FLAG_REMOVED)
		242	.any ())
		243	return 0;
		244
254	/* This is really a spellbook check - really, we should	245	/* This is really a spellbook check - we should in general
255	* check all objects in the inventory.	246	* not merge objects with real inventories, as splitting them
		247	* is hard.
256	*/	248	*/
257	if (ob1->inv || ob2->inv)	249	if (ob1->inv || ob2->inv)
258	{	250	{
259	if (!(ob1->inv && ob2->inv))	251	if (!(ob1->inv && ob2->inv))
260	return 0; /* inventories differ in length */	252	return 0; /* inventories differ in length */
261		253
262	if (ob1->inv->below || ob2->inv->below)	254	if (ob1->inv->below || ob2->inv->below)
263	return 0; /* more than one object in inv */	255	return 0; /* more than one object in inv */
264		256
265	if (!object::can_merge (ob1->inv, ob2->inv))	257	if (!object::can_merge (ob1->inv, ob2->inv))
266	return 0; /* inventory objexts differ */	258	return 0; /* inventory objects differ */
267		259
268	/* inventory ok - still need to check rest of this object to see	260	/* inventory ok - still need to check rest of this object to see
269	* if it is valid.	261	* if it is valid.
270	*/	262	*/
271	}	263	}
…		…
290	if (ob1->level != ob2->level)	282	if (ob1->level != ob2->level)
291	return 0;	283	return 0;
292	break;	284	break;
293	}	285	}
294		286
295	if (ob1->key_values != NULL || ob2->key_values != NULL)	287	if (ob1->key_values || ob2->key_values)
296	{	288	{
297	/* At least one of these has key_values. */	289	/* At least one of these has key_values. */
298	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	290	if ((!ob1->key_values) != (!ob2->key_values))
299	/* One has fields, but the other one doesn't. */	291	return 0; /* One has fields, but the other one doesn't. */
300	return 0;	292
301	else if (!compare_ob_value_lists (ob1, ob2))	293	if (!compare_ob_value_lists (ob1, ob2))
302	return 0;	294	return 0;
303	}	295	}
304		296
305	if (ob1->self || ob2->self)	297	if (ob1->self || ob2->self)
306	{	298	{
307	ob1->optimise ();	299	ob1->optimise ();
308	ob2->optimise ();	300	ob2->optimise ();
309		301
310	if (ob1->self || ob2->self)	302	if (ob1->self || ob2->self)
311	{	303	{
312	int k1 = ob1->self ? HvTOTALKEYS (SvRV (ob1->self)) : 0;	304	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
313	int k2 = ob2->self ? HvTOTALKEYS (SvRV (ob2->self)) : 0;	305	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
314		306
315	if (k1 != k2)	307	if (k1 != k2)
316	return 0;	308	return 0;
		309
317	else if (k1 == 0)	310	if (k1 == 0)
318	return 1;	311	return 1;
		312
319	else if (!cfperl_can_merge (ob1, ob2))	313	if (!cfperl_can_merge (ob1, ob2))
320	return 0;	314	return 0;
321	}	315	}
322	}	316	}
323		317
324	/* Everything passes, must be OK. */	318	/* Everything passes, must be OK. */
325	return 1;	319	return 1;
326	}	320	}
327		321
		322	// find player who can see this object
		323	object *
		324	object::visible_to () const
		325	{
		326	if (client_visible () && !flag [FLAG_REMOVED])
		327	{
		328	// see if we are in a container of sorts
		329	if (env)
		330	{
		331	// the player inventory itself is always visible
		332	if (env->is_player ())
		333	return env;
		334
		335	// else a player could have our env open
		336	object *envest = env->outer_env_or_self ();
		337
		338	// the player itself is always on a map, so we will find him here
		339	// even if our inv is in a player.
		340	if (envest->is_on_map ())
		341	if (object *pl = envest->ms ().player ())
		342	if (pl->container_ () == env)
		343	return pl;
		344	}
		345	else
		346	{
		347	// maybe there is a player standing on the same mapspace
		348	// this will catch the case where "this" is a player
		349	if (object *pl = ms ().player ())
		350	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
		351	|| pl->container_ () == this)
		352	return pl;
		353	}
		354	}
		355
		356	return 0;
		357	}
		358
		359	// adjust weight per container type ("of holding")
		360	static sint32
		361	weight_adjust_for (object *op, sint32 weight)
		362	{
		363	return op->type == CONTAINER
		364	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		365	: weight;
		366	}
		367
328	/*	368	/*
		369	* adjust_weight(object, weight) adds the specified weight to an object,
		370	* and also updates how much the environment(s) is/are carrying.
		371	*/
		372	static void
		373	adjust_weight (object *op, sint32 weight)
		374	{
		375	while (op)
		376	{
		377	// adjust by actual difference to account for rounding errors
		378	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
		379	weight = weight_adjust_for (op, op->carrying)
		380	- weight_adjust_for (op, op->carrying - weight);
		381
		382	if (!weight)
		383	return;
		384
		385	op->carrying += weight;
		386
		387	if (object *pl = op->visible_to ())
		388	if (pl != op) // player is handled lazily
		389	esrv_update_item (UPD_WEIGHT, pl, op);
		390
		391	op = op->env;
		392	}
		393	}
		394
		395	/*
329	* sum_weight() is a recursive function which calculates the weight	396	* this is a recursive function which calculates the weight
330	* an object is carrying. It goes through in figures out how much	397	* an object is carrying. It goes through op and figures out how much
331	* containers are carrying, and sums it up.	398	* containers are carrying, and sums it up.
332	*/	399	*/
333	long	400	void
334	sum_weight (object *op)	401	object::update_weight ()
335	{	402	{
336	long sum;	403	sint32 sum = 0;
337	object *inv;
338		404
339	for (sum = 0, inv = op->inv; inv; inv = inv->below)	405	for (object *op = inv; op; op = op->below)
340	{	406	{
341	if (inv->inv)	407	if (op->inv)
342	sum_weight (inv);	408	op->update_weight ();
343		409
344	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	410	sum += op->total_weight ();
		411	}
		412
		413	sum = weight_adjust_for (this, sum);
		414
		415	if (sum != carrying)
345	}	416	{
346
347	if (op->type == CONTAINER && op->stats.Str)
348	sum = (sum * (100 - op->stats.Str)) / 100;
349
350	if (op->carrying != sum)
351	op->carrying = sum;	417	carrying = sum;
352		418
353	return sum;	419	if (object *pl = visible_to ())
		420	if (pl != this) // player is handled lazily
		421	esrv_update_item (UPD_WEIGHT, pl, this);
		422	}
354	}	423	}
355		424
356	/**	425	/*
357	* Return the outermost environment object for a given object.	426	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
358	*/
359
360	object *
361	object_get_env_recursive (object *op)
362	{
363	while (op->env != NULL)
364	op = op->env;
365	return op;
366	}
367
368	/*
369	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
370	* Some error messages.
371	* The result of the dump is stored in the static global errmsg array.
372	*/	427	*/
373	char *	428	char *
374	dump_object (object *op)	429	dump_object (object *op)
375	{	430	{
376	if (!op)	431	if (!op)
…		…
379	object_freezer freezer;	434	object_freezer freezer;
380	op->write (freezer);	435	op->write (freezer);
381	return freezer.as_string ();	436	return freezer.as_string ();
382	}	437	}
383		438
		439	char *
		440	object::as_string ()
		441	{
		442	return dump_object (this);
		443	}
		444
384	/*	445	/*
385	* get_nearest_part(multi-object, object 2) returns the part of the	446	* get_nearest_part(multi-object, object 2) returns the part of the
386	* multi-object 1 which is closest to the second object.	447	* multi-object 1 which is closest to the second object.
387	* If it's not a multi-object, it is returned.	448	* If it's not a multi-object, it is returned.
388	*/	449	*/
…		…
390	get_nearest_part (object *op, const object *pl)	451	get_nearest_part (object *op, const object *pl)
391	{	452	{
392	object *tmp, *closest;	453	object *tmp, *closest;
393	int last_dist, i;	454	int last_dist, i;
394		455
395	if (op->more == NULL)	456	if (!op->more)
396	return op;	457	return op;
		458
397	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	459	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		460	tmp;
		461	tmp = tmp->more)
398	if ((i = distance (tmp, pl)) < last_dist)	462	if ((i = distance (tmp, pl)) < last_dist)
399	closest = tmp, last_dist = i;	463	closest = tmp, last_dist = i;
		464
400	return closest;	465	return closest;
401	}	466	}
402		467
403	/*	468	/*
404	* Returns the object which has the count-variable equal to the argument.	469	* Returns the object which has the count-variable equal to the argument.
		470	* VERRRY slow.
405	*/	471	*/
406	object *	472	object *
407	find_object (tag_t i)	473	find_object (tag_t i)
408	{	474	{
409	for_all_objects (op)	475	for_all_objects (op)
…		…
420	*/	486	*/
421	object *	487	object *
422	find_object_name (const char *str)	488	find_object_name (const char *str)
423	{	489	{
424	shstr_cmp str_ (str);	490	shstr_cmp str_ (str);
425	object *op;
426		491
		492	if (str_)
427	for_all_objects (op)	493	for_all_objects (op)
428	if (op->name == str_)	494	if (op->name == str_)
429	break;	495	return op;
430		496
431	return op;	497	return 0;
432	}
433
434	void
435	free_all_object_data ()
436	{
437	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
438	}	498	}
439		499
440	/*	500	/*
441	* Sets the owner and sets the skill and exp pointers to owner's current	501	* Sets the owner and sets the skill and exp pointers to owner's current
442	* skill and experience objects.	502	* skill and experience objects.
…		…
447	{	507	{
448	// allow objects which own objects	508	// allow objects which own objects
449	if (owner)	509	if (owner)
450	while (owner->owner)	510	while (owner->owner)
451	owner = owner->owner;	511	owner = owner->owner;
		512
		513	if (flag [FLAG_FREED])
		514	{
		515	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		516	return;
		517	}
452		518
453	this->owner = owner;	519	this->owner = owner;
454	}	520	}
455		521
456	int	522	int
…		…
498	update_stats ();	564	update_stats ();
499		565
500	new_draw_info_format (NDI_UNIQUE, 0, this,	566	new_draw_info_format (NDI_UNIQUE, 0, this,
501	"You try to balance all your items at once, "	567	"You try to balance all your items at once, "
502	"but the %s is just too much for your body. "	568	"but the %s is just too much for your body. "
503	"[You need to unapply some items first.]", &ob->name);	569	"[You need to unapply some items first - use the 'body' command to see "
		570	"how many items you cna wera on a specific body part.]", &ob->name);
504	return false;	571	return false;
505	}	572	}
506		573
507	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);	574	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
508	}	575	}
…		…
534	}	601	}
535		602
536	op->key_values = 0;	603	op->key_values = 0;
537	}	604	}
538		605
539	object &	606	/*
540	object::operator =(const object &src)	607	* copy_to first frees everything allocated by the dst object,
		608	* and then copies the contents of itself into the second
		609	* object, allocating what needs to be allocated. Basically, any
		610	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		611	* if the first object is freed, the pointers in the new object
		612	* will point at garbage.
		613	*/
		614	void
		615	object::copy_to (object *dst)
541	{	616	{
542	bool is_freed = flag [FLAG_FREED];	617	dst->remove ();
543	bool is_removed = flag [FLAG_REMOVED];
544
545	*(object_copy *)this = src;	618	*(object_copy *)dst = *this;
546
547	flag [FLAG_FREED] = is_freed;
548	flag [FLAG_REMOVED] = is_removed;	619	dst->flag [FLAG_REMOVED] = true;
549		620
550	/* Copy over key_values, if any. */	621	/* Copy over key_values, if any. */
551	if (src.key_values)	622	if (key_values)
552	{	623	{
553	key_value *tail = 0;	624	key_value *tail = 0;
554	key_values = 0;	625	dst->key_values = 0;
555		626
556	for (key_value *i = src.key_values; i; i = i->next)	627	for (key_value *i = key_values; i; i = i->next)
557	{	628	{
558	key_value *new_link = new key_value;	629	key_value *new_link = new key_value;
559		630
560	new_link->next = 0;	631	new_link->next = 0;
561	new_link->key = i->key;	632	new_link->key = i->key;
562	new_link->value = i->value;	633	new_link->value = i->value;
563		634
564	/* Try and be clever here, too. */	635	/* Try and be clever here, too. */
565	if (!key_values)	636	if (!dst->key_values)
566	{	637	{
567	key_values = new_link;	638	dst->key_values = new_link;
568	tail = new_link;	639	tail = new_link;
569	}	640	}
570	else	641	else
571	{	642	{
572	tail->next = new_link;	643	tail->next = new_link;
573	tail = new_link;	644	tail = new_link;
574	}	645	}
575	}	646	}
576	}	647	}
577	}
578
579	/*
580	* copy_to first frees everything allocated by the dst object,
581	* and then copies the contents of itself into the second
582	* object, allocating what needs to be allocated. Basically, any
583	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
584	* if the first object is freed, the pointers in the new object
585	* will point at garbage.
586	*/
587	void
588	object::copy_to (object *dst)
589	{
590	*dst = *this;
591		648
592	if (speed < 0)	649	if (speed < 0)
593	dst->speed_left -= rndm ();	650	dst->speed_left -= rndm ();
594		651
595	dst->set_speed (dst->speed);	652	dst->activate ();
596	}	653	}
597		654
598	void	655	void
599	object::instantiate ()	656	object::instantiate ()
600	{	657	{
601	if (!uuid.seq) // HACK	658	if (!uuid.seq) // HACK
602	uuid = gen_uuid ();	659	uuid = UUID::gen ();
603		660
604	speed_left = -0.1f;	661	speed_left = -0.1f;
605	/* copy the body_info to the body_used - this is only really	662	/* copy the body_info to the body_used - this is only really
606	* need for monsters, but doesn't hurt to do it for everything.	663	* need for monsters, but doesn't hurt to do it for everything.
607	* by doing so, when a monster is created, it has good starting	664	* by doing so, when a monster is created, it has good starting
…		…
617	object *	674	object *
618	object::clone ()	675	object::clone ()
619	{	676	{
620	object *neu = create ();	677	object *neu = create ();
621	copy_to (neu);	678	copy_to (neu);
		679	neu->map = map; // not copied by copy_to
622	return neu;	680	return neu;
623	}	681	}
624		682
625	/*	683	/*
626	* If an object with the IS_TURNABLE() flag needs to be turned due	684	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
677	* UP_OBJ_FACE: only the objects face has changed.	735	* UP_OBJ_FACE: only the objects face has changed.
678	*/	736	*/
679	void	737	void
680	update_object (object *op, int action)	738	update_object (object *op, int action)
681	{	739	{
682	if (op == NULL)	740	if (!op)
683	{	741	{
684	/* this should never happen */	742	/* this should never happen */
685	LOG (llevDebug, "update_object() called for NULL object.\n");	743	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
686	return;	744	return;
687	}	745	}
688		746
689	if (op->env)	747	if (!op->is_on_map ())
690	{	748	{
691	/* Animation is currently handled by client, so nothing	749	/* Animation is currently handled by client, so nothing
692	* to do in this case.	750	* to do in this case.
693	*/	751	*/
694	return;	752	return;
695	}	753	}
696
697	/* If the map is saving, don't do anything as everything is
698	* going to get freed anyways.
699	*/
700	if (!op->map || op->map->in_memory == MAP_SAVING)
701	return;
702		754
703	/* make sure the object is within map boundaries */	755	/* make sure the object is within map boundaries */
704	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)	756	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
705	{	757	{
706	LOG (llevError, "update_object() called for object out of map!\n");	758	LOG (llevError, "update_object() called for object out of map!\n");
…		…
717	else if (action == UP_OBJ_INSERT)	769	else if (action == UP_OBJ_INSERT)
718	{	770	{
719	// this is likely overkill, TODO: revisit (schmorp)	771	// this is likely overkill, TODO: revisit (schmorp)
720	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	772	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
721	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	773	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
722	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	774	|| (op->is_player () && !(m.flags_ & P_PLAYER))
723	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	775	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
724	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	776	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
725	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	777	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
726	|| (m.move_on | op->move_on ) != m.move_on	778	|| (m.move_on | op->move_on ) != m.move_on
727	|| (m.move_off | op->move_off ) != m.move_off	779	|| (m.move_off | op->move_off ) != m.move_off
728	|| (m.move_slow | op->move_slow) != m.move_slow	780	|| (m.move_slow | op->move_slow) != m.move_slow
729	/* This isn't perfect, but I don't expect a lot of objects to	781	/* This isn't perfect, but I don't expect a lot of objects to
730	* to have move_allow right now.	782	* have move_allow right now.
731	*/	783	*/
732	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	784	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
733	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	785	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
734	m.flags_ = 0;	786	m.invalidate ();
735	}	787	}
736	/* if the object is being removed, we can't make intelligent	788	/* if the object is being removed, we can't make intelligent
737	* decisions, because remove_ob can't really pass the object	789	* decisions, because remove_ob can't really pass the object
738	* that is being removed.	790	* that is being removed.
739	*/	791	*/
740	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	792	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
741	m.flags_ = 0;	793	m.invalidate ();
742	else if (action == UP_OBJ_FACE)	794	else if (action == UP_OBJ_FACE)
743	/* Nothing to do for that case */ ;	795	/* Nothing to do for that case */ ;
744	else	796	else
745	LOG (llevError, "update_object called with invalid action: %d\n", action);	797	LOG (llevError, "update_object called with invalid action: %d\n", action);
746		798
…		…
750		802
751	object::object ()	803	object::object ()
752	{	804	{
753	SET_FLAG (this, FLAG_REMOVED);	805	SET_FLAG (this, FLAG_REMOVED);
754		806
755	expmul = 1.0;	807	//expmul = 1.0; declared const for the time being
756	face = blank_face;	808	face = blank_face;
757	}	809	}
758		810
759	object::~object ()	811	object::~object ()
760	{	812	{
…		…
766	static int object_count;	818	static int object_count;
767		819
768	void object::link ()	820	void object::link ()
769	{	821	{
770	assert (!index);//D	822	assert (!index);//D
771	uuid = gen_uuid ();	823	uuid = UUID::gen ();
772	count = ++object_count;	824	count = ++object_count;
773		825
774	refcnt_inc ();	826	refcnt_inc ();
775	objects.insert (this);	827	objects.insert (this);
776	}	828	}
…		…
790	/* If already on active list, don't do anything */	842	/* If already on active list, don't do anything */
791	if (active)	843	if (active)
792	return;	844	return;
793		845
794	if (has_active_speed ())	846	if (has_active_speed ())
		847	{
		848	if (flag [FLAG_FREED])
		849	LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		850
795	actives.insert (this);	851	actives.insert (this);
		852	}
796	}	853	}
797		854
798	void	855	void
799	object::activate_recursive ()	856	object::activate_recursive ()
800	{	857	{
…		…
849	object::destroy_inv (bool drop_to_ground)	906	object::destroy_inv (bool drop_to_ground)
850	{	907	{
851	// need to check first, because the checks below might segfault	908	// need to check first, because the checks below might segfault
852	// as we might be on an invalid mapspace and crossfire code	909	// as we might be on an invalid mapspace and crossfire code
853	// is too buggy to ensure that the inventory is empty.	910	// is too buggy to ensure that the inventory is empty.
854	// corollary: if you create arrows etc. with stuff in tis inventory,	911	// corollary: if you create arrows etc. with stuff in its inventory,
855	// cf will crash below with off-map x and y	912	// cf will crash below with off-map x and y
856	if (!inv)	913	if (!inv)
857	return;	914	return;
858		915
859	/* Only if the space blocks everything do we not process -	916	/* Only if the space blocks everything do we not process -
860	* if some form of movement is allowed, let objects	917	* if some form of movement is allowed, let objects
861	* drop on that space.	918	* drop on that space.
862	*/	919	*/
863	if (!drop_to_ground	920	if (!drop_to_ground
864	|| !map	921	|| !map
865	|| map->in_memory != MAP_IN_MEMORY	922	|| map->in_memory != MAP_ACTIVE
866	|| map->nodrop	923	|| map->no_drop
867	|| ms ().move_block == MOVE_ALL)	924	|| ms ().move_block == MOVE_ALL)
868	{	925	{
869	while (inv)	926	while (inv)
870	{
871	inv->destroy_inv (drop_to_ground);
872	inv->destroy ();	927	inv->destroy ();
873	}
874	}	928	}
875	else	929	else
876	{ /* Put objects in inventory onto this space */	930	{ /* Put objects in inventory onto this space */
877	while (inv)	931	while (inv)
878	{	932	{
…		…
896	object *op = new object;	950	object *op = new object;
897	op->link ();	951	op->link ();
898	return op;	952	return op;
899	}	953	}
900		954
		955	static struct freed_map : maptile
		956	{
		957	freed_map ()
		958	{
		959	path = "<freed objects map>";
		960	name = "/internal/freed_objects_map";
		961	width = 3;
		962	height = 3;
		963	no_drop = 1;
		964	no_reset = 1;
		965
		966	alloc ();
		967	in_memory = MAP_ACTIVE;
		968	}
		969
		970	~freed_map ()
		971	{
		972	destroy ();
		973	}
		974	} freed_map; // freed objects are moved here to avoid crashes
		975
901	void	976	void
902	object::do_destroy ()	977	object::do_destroy ()
903	{	978	{
904	attachable::do_destroy ();
905
906	if (flag [FLAG_IS_LINKED])	979	if (flag [FLAG_IS_LINKED])
907	remove_button_link (this);	980	remove_link ();
908		981
909	if (flag [FLAG_FRIENDLY])	982	if (flag [FLAG_FRIENDLY])
910	remove_friendly_object (this);	983	remove_friendly_object (this);
911		984
912	if (!flag [FLAG_REMOVED])
913	remove ();	985	remove ();
914		986
915	destroy_inv (true);	987	attachable::do_destroy ();
916		988
917	deactivate ();	989	deactivate ();
918	unlink ();	990	unlink ();
919		991
920	flag [FLAG_FREED] = 1;	992	flag [FLAG_FREED] = 1;
921		993
922	// hack to ensure that freed objects still have a valid map	994	// hack to ensure that freed objects still have a valid map
923	{
924	static maptile *freed_map; // freed objects are moved here to avoid crashes
925
926	if (!freed_map)
927	{
928	freed_map = new maptile;
929
930	freed_map->path = "<freed objects map>";
931	freed_map->name = "/internal/freed_objects_map";
932	freed_map->width = 3;
933	freed_map->height = 3;
934
935	freed_map->alloc ();
936	freed_map->in_memory = MAP_IN_MEMORY;
937	}
938
939	map = freed_map;	995	map = &freed_map;
940	x = 1;	996	x = 1;
941	y = 1;	997	y = 1;
942	}
943		998
944	if (more)	999	if (more)
945	{	1000	{
946	more->destroy ();	1001	more->destroy ();
947	more = 0;	1002	more = 0;
…		…
955	attacked_by = 0;	1010	attacked_by = 0;
956	current_weapon = 0;	1011	current_weapon = 0;
957	}	1012	}
958		1013
959	void	1014	void
960	object::destroy (bool destroy_inventory)	1015	object::destroy ()
961	{	1016	{
962	if (destroyed ())	1017	if (destroyed ())
963	return;	1018	return;
964		1019
965	if (destroy_inventory)	1020	if (!is_head () && !head->destroyed ())
		1021	{
		1022	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1023	head->destroy ();
		1024	return;
		1025	}
		1026
966	destroy_inv (false);	1027	destroy_inv (false);
967		1028
968	if (is_head ())	1029	if (is_head ())
969	if (sound_destroy)	1030	if (sound_destroy)
970	play_sound (sound_destroy);	1031	play_sound (sound_destroy);
971	else if (flag [FLAG_MONSTER])	1032	else if (flag [FLAG_MONSTER])
972	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism	1033	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
973		1034
974	attachable::destroy ();	1035	attachable::destroy ();
975	}
976
977	/*
978	* sub_weight() recursively (outwards) subtracts a number from the
979	* weight of an object (and what is carried by it's environment(s)).
980	*/
981	void
982	sub_weight (object *op, signed long weight)
983	{
984	while (op != NULL)
985	{
986	if (op->type == CONTAINER)
987	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
988
989	op->carrying -= weight;
990	op = op->env;
991	}
992	}	1036	}
993		1037
994	/* op->remove ():	1038	/* op->remove ():
995	* This function removes the object op from the linked list of objects	1039	* This function removes the object op from the linked list of objects
996	* which it is currently tied to. When this function is done, the	1040	* which it is currently tied to. When this function is done, the
…		…
999	* the previous environment.	1043	* the previous environment.
1000	*/	1044	*/
1001	void	1045	void
1002	object::do_remove ()	1046	object::do_remove ()
1003	{	1047	{
1004	object *tmp, *last = 0;	1048	if (flag [FLAG_REMOVED])
1005	object *otmp;
1006
1007	if (QUERY_FLAG (this, FLAG_REMOVED))
1008	return;	1049	return;
1009		1050
1010	SET_FLAG (this, FLAG_REMOVED);
1011	INVOKE_OBJECT (REMOVE, this);	1051	INVOKE_OBJECT (REMOVE, this);
		1052
		1053	flag [FLAG_REMOVED] = true;
1012		1054
1013	if (more)	1055	if (more)
1014	more->remove ();	1056	more->remove ();
1015		1057
1016	/*	1058	/*
1017	* In this case, the object to be removed is in someones	1059	* In this case, the object to be removed is in someones
1018	* inventory.	1060	* inventory.
1019	*/	1061	*/
1020	if (env)	1062	if (env)
1021	{	1063	{
1022	if (nrof)	1064	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1023	sub_weight (env, weight * nrof);	1065	if (object *pl = visible_to ())
1024	else	1066	esrv_del_item (pl->contr, count);
1025	sub_weight (env, weight + carrying);	1067	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1068
		1069	adjust_weight (env, -total_weight ());
		1070
		1071	object *pl = in_player ();
		1072
		1073	/* we set up values so that it could be inserted into
		1074	* the map, but we don't actually do that - it is up
		1075	* to the caller to decide what we want to do.
		1076	*/
		1077	map = env->map;
		1078	x = env->x;
		1079	y = env->y;
		1080
		1081	// make sure cmov optimisation is applicable
		1082	*(above ? &above->below : &env->inv) = below;
		1083	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1084
		1085	above = 0;
		1086	below = 0;
		1087	env = 0;
1026		1088
1027	/* NO_FIX_PLAYER is set when a great many changes are being	1089	/* NO_FIX_PLAYER is set when a great many changes are being
1028	* made to players inventory. If set, avoiding the call	1090	* made to players inventory. If set, avoiding the call
1029	* to save cpu time.	1091	* to save cpu time.
1030	*/	1092	*/
1031	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1093	if (pl)
		1094	if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
		1095	{
1032	otmp->update_stats ();	1096	pl->update_stats ();
1033		1097
1034	if (above)	1098	if (glow_radius && pl->is_on_map ())
1035	above->below = below;	1099	update_all_los (pl->map, pl->x, pl->y);
1036	else	1100	}
1037	env->inv = below;
1038
1039	if (below)
1040	below->above = above;
1041
1042	/* we set up values so that it could be inserted into
1043	* the map, but we don't actually do that - it is up
1044	* to the caller to decide what we want to do.
1045	*/
1046	x = env->x, y = env->y;
1047	map = env->map;
1048	above = 0, below = 0;
1049	env = 0;
1050	}	1101	}
1051	else if (map)	1102	else if (map)
1052	{	1103	{
1053	if (type == PLAYER)
1054	{
1055	// leaving a spot always closes any open container on the ground
1056	if (container && !container->env)
1057	// this causes spurious floorbox updates, but it ensures
1058	// that the CLOSE event is being sent.
1059	close_container ();
1060
1061	--map->players;
1062	map->touch ();
1063	}
1064
1065	map->dirty = true;	1104	map->dirty = true;
1066	mapspace &ms = this->ms ();	1105	mapspace &ms = this->ms ();
1067		1106
		1107	if (object *pl = ms.player ())
		1108	{
		1109	if (is_player ())
		1110	{
		1111	if (!flag [FLAG_WIZPASS])
		1112	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1113
		1114	// leaving a spot always closes any open container on the ground
		1115	if (container && !container->env)
		1116	// this causes spurious floorbox updates, but it ensures
		1117	// that the CLOSE event is being sent.
		1118	close_container ();
		1119
		1120	--map->players;
		1121	map->touch ();
		1122	}
		1123	else if (pl->container_ () == this)
		1124	{
		1125	// removing a container should close it
		1126	close_container ();
		1127	}
		1128
		1129	esrv_del_item (pl->contr, count);
		1130	}
		1131
1068	/* link the object above us */	1132	/* link the object above us */
1069	if (above)	1133	// re-link, make sure compiler can easily use cmove
1070	above->below = below;	1134	*(above ? &above->below : &ms.top) = below;
1071	else	1135	*(below ? &below->above : &ms.bot) = above;
1072	ms.top = below; /* we were top, set new top */
1073
1074	/* Relink the object below us, if there is one */
1075	if (below)
1076	below->above = above;
1077	else
1078	{
1079	/* Nothing below, which means we need to relink map object for this space
1080	* use translated coordinates in case some oddness with map tiling is
1081	* evident
1082	*/
1083	if (GET_MAP_OB (map, x, y) != this)
1084	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1085
1086	ms.bot = above; /* goes on above it. */
1087	}
1088		1136
1089	above = 0;	1137	above = 0;
1090	below = 0;	1138	below = 0;
1091		1139
		1140	ms.invalidate ();
		1141
1092	if (map->in_memory == MAP_SAVING)	1142	if (map->in_memory == MAP_SAVING)
1093	return;	1143	return;
1094		1144
1095	int check_walk_off = !flag [FLAG_NO_APPLY];	1145	int check_walk_off = !flag [FLAG_NO_APPLY];
1096		1146
1097	if (object *pl = ms.player ())	1147	if (object *pl = ms.player ())
1098	{	1148	{
1099	if (pl->container == this)	1149	if (pl->container_ () == this)
1100	/* If a container that the player is currently using somehow gets	1150	/* If a container that the player is currently using somehow gets
1101	* removed (most likely destroyed), update the player view	1151	* removed (most likely destroyed), update the player view
1102	* appropriately.	1152	* appropriately.
1103	*/	1153	*/
1104	pl->close_container ();	1154	pl->close_container ();
1105		1155
		1156	//TODO: the floorbox prev/next might need updating
		1157	//esrv_del_item (pl->contr, count);
		1158	//TODO: update floorbox to preserve ordering
		1159	if (pl->contr->ns)
1106	pl->contr->ns->floorbox_update ();	1160	pl->contr->ns->floorbox_update ();
1107	}	1161	}
1108		1162
		1163	if (check_walk_off)
1109	for (tmp = ms.bot; tmp; tmp = tmp->above)	1164	for (object *above, *tmp = ms.bot; tmp; tmp = above)
1110	{	1165	{
		1166	above = tmp->above;
		1167
1111	/* No point updating the players look faces if he is the object	1168	/* No point updating the players look faces if he is the object
1112	* being removed.	1169	* being removed.
1113	*/	1170	*/
1114		1171
1115	/* See if object moving off should effect something */	1172	/* See if object moving off should effect something */
1116	if (check_walk_off
1117	&& ((move_type & tmp->move_off)	1173	if ((move_type & tmp->move_off)
1118	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1174	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1119	{
1120	move_apply (tmp, this, 0);	1175	move_apply (tmp, this, 0);
1121
1122	if (destroyed ())
1123	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1124	}	1176	}
1125		1177
1126	last = tmp;	1178	if (affects_los ())
1127	}
1128
1129	/* last == NULL if there are no objects on this space */
1130	//TODO: this makes little sense, why only update the topmost object?
1131	if (!last)
1132	map->at (x, y).flags_ = 0;
1133	else
1134	update_object (last, UP_OBJ_REMOVE);
1135
1136	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1137	update_all_los (map, x, y);	1179	update_all_los (map, x, y);
1138	}	1180	}
1139	}	1181	}
1140		1182
1141	/*	1183	/*
…		…
1150	merge_ob (object *op, object *top)	1192	merge_ob (object *op, object *top)
1151	{	1193	{
1152	if (!op->nrof)	1194	if (!op->nrof)
1153	return 0;	1195	return 0;
1154		1196
1155	if (top)	1197	if (!top)
1156	for (top = op; top && top->above; top = top->above)	1198	for (top = op; top && top->above; top = top->above)
1157	;	1199	;
1158		1200
1159	for (; top; top = top->below)	1201	for (; top; top = top->below)
1160	{
1161	if (top == op)
1162	continue;
1163
1164	if (object::can_merge (op, top))	1202	if (object::can_merge (op, top))
1165	{	1203	{
1166	top->nrof += op->nrof;	1204	top->nrof += op->nrof;
1167		1205
1168	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1206	if (object *pl = top->visible_to ())
1169	op->weight = 0; /* Don't want any adjustements now */	1207	esrv_update_item (UPD_NROF, pl, top);
		1208
		1209	op->weight = 0; // cancel the addition above
		1210	op->carrying = 0; // must be 0 already
		1211
1170	op->destroy ();	1212	op->destroy ();
		1213
1171	return top;	1214	return top;
1172	}	1215	}
1173	}
1174		1216
1175	return 0;	1217	return 0;
1176	}	1218	}
1177		1219
1178	void	1220	void
…		…
1203	* job preparing multi-part monsters.	1245	* job preparing multi-part monsters.
1204	*/	1246	*/
1205	object *	1247	object *
1206	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1248	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1207	{	1249	{
		1250	op->remove ();
		1251
1208	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1252	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1209	{	1253	{
1210	tmp->x = x + tmp->arch->x;	1254	tmp->x = x + tmp->arch->x;
1211	tmp->y = y + tmp->arch->y;	1255	tmp->y = y + tmp->arch->y;
1212	}	1256	}
…		…
1235	* just 'op' otherwise	1279	* just 'op' otherwise
1236	*/	1280	*/
1237	object *	1281	object *
1238	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1282	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1239	{	1283	{
1240	assert (!op->flag [FLAG_FREED]);
1241
1242	object *top, *floor = NULL;
1243
1244	op->remove ();	1284	op->remove ();
		1285
		1286	if (m == &freed_map)//D TODO: remove soon
		1287	{//D
		1288	LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
		1289	}//D
1245		1290
1246	/* Ideally, the caller figures this out. However, it complicates a lot	1291	/* Ideally, the caller figures this out. However, it complicates a lot
1247	* of areas of callers (eg, anything that uses find_free_spot would now	1292	* of areas of callers (eg, anything that uses find_free_spot would now
1248	* need extra work	1293	* need extra work
1249	*/	1294	*/
		1295	maptile *newmap = m;
1250	if (!xy_normalise (m, op->x, op->y))	1296	if (!xy_normalise (newmap, op->x, op->y))
1251	{	1297	{
1252	op->destroy ();	1298	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1253	return 0;	1299	return 0;
1254	}	1300	}
1255		1301
1256	if (object *more = op->more)	1302	if (object *more = op->more)
1257	if (!insert_ob_in_map (more, m, originator, flag))	1303	if (!insert_ob_in_map (more, m, originator, flag))
1258	return 0;	1304	return 0;
1259		1305
1260	CLEAR_FLAG (op, FLAG_REMOVED);	1306	op->flag [FLAG_REMOVED] = false;
1261		1307	op->env = 0;
1262	op->map = m;	1308	op->map = newmap;
		1309
1263	mapspace &ms = op->ms ();	1310	mapspace &ms = op->ms ();
1264		1311
1265	/* this has to be done after we translate the coordinates.	1312	/* this has to be done after we translate the coordinates.
1266	*/	1313	*/
1267	if (op->nrof && !(flag & INS_NO_MERGE))	1314	if (op->nrof && !(flag & INS_NO_MERGE))
1268	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1315	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1269	if (object::can_merge (op, tmp))	1316	if (object::can_merge (op, tmp))
1270	{	1317	{
		1318	// TODO: we actually want to update tmp, not op,
		1319	// but some caller surely breaks when we return tmp
		1320	// from here :/
1271	op->nrof += tmp->nrof;	1321	op->nrof += tmp->nrof;
1272	tmp->destroy ();	1322	tmp->destroy ();
1273	}	1323	}
1274		1324
1275	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1325	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
…		…
1284	{	1334	{
1285	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1335	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1286	abort ();	1336	abort ();
1287	}	1337	}
1288		1338
		1339	if (!originator->is_on_map ())
		1340	{
		1341	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1342	op->debug_desc (), originator->debug_desc ());
		1343	abort ();
		1344	}
		1345
1289	op->above = originator;	1346	op->above = originator;
1290	op->below = originator->below;	1347	op->below = originator->below;
1291
1292	if (op->below)
1293	op->below->above = op;
1294	else
1295	ms.bot = op;
1296
1297	/* since *below* originator, no need to update top */
1298	originator->below = op;	1348	originator->below = op;
		1349
		1350	*(op->below ? &op->below->above : &ms.bot) = op;
1299	}	1351	}
1300	else	1352	else
1301	{	1353	{
1302	top = ms.bot;	1354	object *floor = 0;
		1355	object *top = ms.top;
1303		1356
1304	/* If there are other objects, then */	1357	/* If there are other objects, then */
1305	if (top)	1358	if (top)
1306	{	1359	{
1307	object *last = 0;
1308
1309	/*	1360	/*
1310	* If there are multiple objects on this space, we do some trickier handling.	1361	* If there are multiple objects on this space, we do some trickier handling.
1311	* We've already dealt with merging if appropriate.	1362	* We've already dealt with merging if appropriate.
1312	* Generally, we want to put the new object on top. But if	1363	* Generally, we want to put the new object on top. But if
1313	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1364	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1316	* once we get to them. This reduces the need to traverse over all of	1367	* once we get to them. This reduces the need to traverse over all of
1317	* them when adding another one - this saves quite a bit of cpu time	1368	* them when adding another one - this saves quite a bit of cpu time
1318	* when lots of spells are cast in one area. Currently, it is presumed	1369	* when lots of spells are cast in one area. Currently, it is presumed
1319	* that flying non pickable objects are spell objects.	1370	* that flying non pickable objects are spell objects.
1320	*/	1371	*/
1321	for (top = ms.bot; top; top = top->above)	1372	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1322	{	1373	{
1323	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1374	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1324	floor = top;	1375	floor = tmp;
1325		1376
1326	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1377	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1327	{	1378	{
1328	/* We insert above top, so we want this object below this */	1379	/* We insert above top, so we want this object below this */
1329	top = top->below;	1380	top = tmp->below;
1330	break;	1381	break;
1331	}	1382	}
1332		1383
1333	last = top;	1384	top = tmp;
1334	}	1385	}
1335
1336	/* Don't want top to be NULL, so set it to the last valid object */
1337	top = last;
1338		1386
1339	/* We let update_position deal with figuring out what the space	1387	/* We let update_position deal with figuring out what the space
1340	* looks like instead of lots of conditions here.	1388	* looks like instead of lots of conditions here.
1341	* makes things faster, and effectively the same result.	1389	* makes things faster, and effectively the same result.
1342	*/	1390	*/
…		…
1349	*/	1397	*/
1350	if (!(flag & INS_ON_TOP)	1398	if (!(flag & INS_ON_TOP)
1351	&& ms.flags () & P_BLOCKSVIEW	1399	&& ms.flags () & P_BLOCKSVIEW
1352	&& (op->face && !faces [op->face].visibility))	1400	&& (op->face && !faces [op->face].visibility))
1353	{	1401	{
		1402	object *last;
		1403
1354	for (last = top; last != floor; last = last->below)	1404	for (last = top; last != floor; last = last->below)
1355	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1405	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1356	break;	1406	break;
1357		1407
1358	/* Check to see if we found the object that blocks view,	1408	/* Check to see if we found the object that blocks view,
…		…
1366	} /* If objects on this space */	1416	} /* If objects on this space */
1367		1417
1368	if (flag & INS_ABOVE_FLOOR_ONLY)	1418	if (flag & INS_ABOVE_FLOOR_ONLY)
1369	top = floor;	1419	top = floor;
1370		1420
1371	/* Top is the object that our object (op) is going to get inserted above.	1421	// insert object above top, or bottom-most if top = 0
1372	*/
1373
1374	/* First object on this space */
1375	if (!top)	1422	if (!top)
1376	{	1423	{
		1424	op->below = 0;
1377	op->above = ms.bot;	1425	op->above = ms.bot;
1378
1379	if (op->above)
1380	op->above->below = op;
1381
1382	op->below = 0;
1383	ms.bot = op;	1426	ms.bot = op;
		1427
		1428	*(op->above ? &op->above->below : &ms.top) = op;
1384	}	1429	}
1385	else	1430	else
1386	{ /* get inserted into the stack above top */	1431	{
1387	op->above = top->above;	1432	op->above = top->above;
1388
1389	if (op->above)
1390	op->above->below = op;	1433	top->above = op;
1391		1434
1392	op->below = top;	1435	op->below = top;
1393	top->above = op;	1436	*(op->above ? &op->above->below : &ms.top) = op;
1394	}	1437	}
		1438	}
1395		1439
1396	if (!op->above)	1440	if (op->is_player ())
1397	ms.top = op;
1398	} /* else not INS_BELOW_ORIGINATOR */
1399
1400	if (op->type == PLAYER)
1401	{	1441	{
1402	op->contr->do_los = 1;	1442	op->contr->do_los = 1;
1403	++op->map->players;	1443	++op->map->players;
1404	op->map->touch ();	1444	op->map->touch ();
1405	}	1445	}
1406		1446
1407	op->map->dirty = true;	1447	op->map->dirty = true;
1408		1448
1409	if (object *pl = ms.player ())	1449	if (object *pl = ms.player ())
		1450	//TODO: the floorbox prev/next might need updating
		1451	//esrv_send_item (pl, op);
		1452	//TODO: update floorbox to preserve ordering
		1453	if (pl->contr->ns)
1410	pl->contr->ns->floorbox_update ();	1454	pl->contr->ns->floorbox_update ();
1411		1455
1412	/* If this object glows, it may affect lighting conditions that are	1456	/* If this object glows, it may affect lighting conditions that are
1413	* visible to others on this map. But update_all_los is really	1457	* visible to others on this map. But update_all_los is really
1414	* an inefficient way to do this, as it means los for all players	1458	* an inefficient way to do this, as it means los for all players
1415	* on the map will get recalculated. The players could very well	1459	* on the map will get recalculated. The players could very well
1416	* be far away from this change and not affected in any way -	1460	* be far away from this change and not affected in any way -
1417	* this should get redone to only look for players within range,	1461	* this should get redone to only look for players within range,
1418	* or just updating the P_UPTODATE for spaces within this area	1462	* or just updating the P_UPTODATE for spaces within this area
1419	* of effect may be sufficient.	1463	* of effect may be sufficient.
1420	*/	1464	*/
1421	if (op->map->darkness && (op->glow_radius != 0))	1465	if (op->affects_los ())
		1466	{
		1467	op->ms ().invalidate ();
1422	update_all_los (op->map, op->x, op->y);	1468	update_all_los (op->map, op->x, op->y);
		1469	}
1423		1470
1424	/* updates flags (blocked, alive, no magic, etc) for this map space */	1471	/* updates flags (blocked, alive, no magic, etc) for this map space */
1425	update_object (op, UP_OBJ_INSERT);	1472	update_object (op, UP_OBJ_INSERT);
1426		1473
1427	INVOKE_OBJECT (INSERT, op);	1474	INVOKE_OBJECT (INSERT, op);
…		…
1434	* blocked() and wall() work properly), and these flags are updated by	1481	* blocked() and wall() work properly), and these flags are updated by
1435	* update_object().	1482	* update_object().
1436	*/	1483	*/
1437		1484
1438	/* if this is not the head or flag has been passed, don't check walk on status */	1485	/* if this is not the head or flag has been passed, don't check walk on status */
1439	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1486	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1440	{	1487	{
1441	if (check_move_on (op, originator))	1488	if (check_move_on (op, originator))
1442	return 0;	1489	return 0;
1443		1490
1444	/* If we are a multi part object, lets work our way through the check	1491	/* If we are a multi part object, lets work our way through the check
…		…
1455	/* this function inserts an object in the map, but if it	1502	/* this function inserts an object in the map, but if it
1456	* finds an object of its own type, it'll remove that one first.	1503	* finds an object of its own type, it'll remove that one first.
1457	* op is the object to insert it under: supplies x and the map.	1504	* op is the object to insert it under: supplies x and the map.
1458	*/	1505	*/
1459	void	1506	void
1460	replace_insert_ob_in_map (const char *arch_string, object *op)	1507	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1461	{	1508	{
1462	object *tmp, *tmp1;
1463
1464	/* first search for itself and remove any old instances */	1509	/* first search for itself and remove any old instances */
1465		1510
1466	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1511	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1467	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1512	if (tmp->arch->archname == archname) /* same archetype */
1468	tmp->destroy ();	1513	tmp->destroy ();
1469		1514
1470	tmp1 = arch_to_object (archetype::find (arch_string));	1515	object *tmp = arch_to_object (archetype::find (archname));
1471		1516
1472	tmp1->x = op->x;	1517	tmp->x = op->x;
1473	tmp1->y = op->y;	1518	tmp->y = op->y;
		1519
1474	insert_ob_in_map (tmp1, op->map, op, 0);	1520	insert_ob_in_map (tmp, op->map, op, 0);
1475	}	1521	}
1476		1522
1477	object *	1523	object *
1478	object::insert_at (object *where, object *originator, int flags)	1524	object::insert_at (object *where, object *originator, int flags)
1479	{	1525	{
		1526	if (where->env)
		1527	return where->env->insert (this);
		1528	else
1480	return where->map->insert (this, where->x, where->y, originator, flags);	1529	return where->map->insert (this, where->x, where->y, originator, flags);
1481	}	1530	}
1482		1531
1483	/*	1532	/*
1484	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1485	* is returned contains nr objects, and the remaining parts contains
1486	* the rest (or is removed and freed if that number is 0).
1487	* On failure, NULL is returned, and the reason put into the
1488	* global static errmsg array.
1489	*/
1490	object *
1491	get_split_ob (object *orig_ob, uint32 nr)
1492	{
1493	object *newob;
1494	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1495
1496	if (orig_ob->nrof < nr)
1497	{
1498	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1499	return NULL;
1500	}
1501
1502	newob = object_create_clone (orig_ob);
1503
1504	if ((orig_ob->nrof -= nr) < 1)
1505	orig_ob->destroy (1);
1506	else if (!is_removed)
1507	{
1508	if (orig_ob->env != NULL)
1509	sub_weight (orig_ob->env, orig_ob->weight * nr);
1510	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1511	{
1512	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1513	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1514	return NULL;
1515	}
1516	}
1517
1518	newob->nrof = nr;
1519
1520	return newob;
1521	}
1522
1523	/*
1524	* decrease_ob_nr(object, number) decreases a specified number from	1533	* decrease(object, number) decreases a specified number from
1525	* the amount of an object. If the amount reaches 0, the object	1534	* the amount of an object. If the amount reaches 0, the object
1526	* is subsequently removed and freed.	1535	* is subsequently removed and freed.
1527	*	1536	*
1528	* Return value: 'op' if something is left, NULL if the amount reached 0	1537	* Return value: 'op' if something is left, NULL if the amount reached 0
1529	*/	1538	*/
		1539	bool
		1540	object::decrease (sint32 nr)
		1541	{
		1542	if (!nr)
		1543	return true;
		1544
		1545	nr = min (nr, nrof);
		1546
		1547	if (nrof > nr)
		1548	{
		1549	nrof -= nr;
		1550	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
		1551
		1552	if (object *pl = visible_to ())
		1553	esrv_update_item (UPD_NROF, pl, this);
		1554
		1555	return true;
		1556	}
		1557	else
		1558	{
		1559	destroy ();
		1560	return false;
		1561	}
		1562	}
		1563
		1564	/*
		1565	* split(ob,nr) splits up ob into two parts. The part which
		1566	* is returned contains nr objects, and the remaining parts contains
		1567	* the rest (or is removed and returned if that number is 0).
		1568	* On failure, NULL is returned.
		1569	*/
1530	object *	1570	object *
1531	decrease_ob_nr (object *op, uint32 i)	1571	object::split (sint32 nr)
1532	{	1572	{
1533	object *tmp;	1573	int have = number_of ();
1534		1574
1535	if (i == 0) /* objects with op->nrof require this check */	1575	if (have < nr)
1536	return op;	1576	return 0;
1537		1577	else if (have == nr)
1538	if (i > op->nrof)
1539	i = op->nrof;
1540
1541	if (QUERY_FLAG (op, FLAG_REMOVED))
1542	op->nrof -= i;
1543	else if (op->env)
1544	{	1578	{
1545	/* is this object in the players inventory, or sub container
1546	* therein?
1547	*/
1548	tmp = op->in_player ();
1549	/* nope. Is this a container the player has opened?
1550	* If so, set tmp to that player.
1551	* IMO, searching through all the players will mostly
1552	* likely be quicker than following op->env to the map,
1553	* and then searching the map for a player.
1554	*/
1555	if (!tmp)
1556	for_all_players (pl)
1557	if (pl->ob->container == op->env)
1558	{
1559	tmp = pl->ob;
1560	break;
1561	}
1562
1563	if (i < op->nrof)
1564	{
1565	sub_weight (op->env, op->weight * i);
1566	op->nrof -= i;
1567	if (tmp)
1568	esrv_send_item (tmp, op);
1569	}
1570	else
1571	{
1572	op->remove ();	1579	remove ();
1573	op->nrof = 0;	1580	return this;
1574	if (tmp)
1575	esrv_del_item (tmp->contr, op->count);
1576	}
1577	}	1581	}
1578	else	1582	else
1579	{	1583	{
1580	object *above = op->above;	1584	decrease (nr);
1581		1585
1582	if (i < op->nrof)	1586	object *op = deep_clone ();
1583	op->nrof -= i;	1587	op->nrof = nr;
1584	else
1585	{
1586	op->remove ();
1587	op->nrof = 0;
1588	}
1589
1590	/* Since we just removed op, op->above is null */
1591	for (tmp = above; tmp; tmp = tmp->above)
1592	if (tmp->type == PLAYER)
1593	{
1594	if (op->nrof)
1595	esrv_send_item (tmp, op);
1596	else
1597	esrv_del_item (tmp->contr, op->count);
1598	}
1599	}
1600
1601	if (op->nrof)
1602	return op;	1588	return op;
1603	else
1604	{
1605	op->destroy ();
1606	return 0;
1607	}
1608	}
1609
1610	/*
1611	* add_weight(object, weight) adds the specified weight to an object,
1612	* and also updates how much the environment(s) is/are carrying.
1613	*/
1614	void
1615	add_weight (object *op, signed long weight)
1616	{
1617	while (op != NULL)
1618	{
1619	if (op->type == CONTAINER)
1620	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1621
1622	op->carrying += weight;
1623	op = op->env;
1624	}	1589	}
1625	}	1590	}
1626		1591
1627	object *	1592	object *
1628	insert_ob_in_ob (object *op, object *where)	1593	insert_ob_in_ob (object *op, object *where)
…		…
1653	* be != op, if items are merged. -Tero	1618	* be != op, if items are merged. -Tero
1654	*/	1619	*/
1655	object *	1620	object *
1656	object::insert (object *op)	1621	object::insert (object *op)
1657	{	1622	{
1658	if (!QUERY_FLAG (op, FLAG_REMOVED))
1659	op->remove ();
1660
1661	if (op->more)	1623	if (op->more)
1662	{	1624	{
1663	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1625	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1664	return op;	1626	return op;
1665	}	1627	}
1666		1628
1667	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1629	op->remove ();
1668	CLEAR_FLAG (op, FLAG_REMOVED);	1630
		1631	op->flag [FLAG_OBJ_ORIGINAL] = 0;
1669		1632
1670	if (op->nrof)	1633	if (op->nrof)
1671	{
1672	for (object *tmp = inv; tmp; tmp = tmp->below)	1634	for (object *tmp = inv; tmp; tmp = tmp->below)
1673	if (object::can_merge (tmp, op))	1635	if (object::can_merge (tmp, op))
1674	{	1636	{
1675	/* return the original object and remove inserted object	1637	/* return the original object and remove inserted object
1676	(client needs the original object) */	1638	(client needs the original object) */
1677	tmp->nrof += op->nrof;	1639	tmp->nrof += op->nrof;
1678	/* Weight handling gets pretty funky. Since we are adding to	1640
1679	* tmp->nrof, we need to increase the weight.	1641	if (object *pl = tmp->visible_to ())
1680	*/	1642	esrv_update_item (UPD_NROF, pl, tmp);
		1643
1681	add_weight (this, op->weight * op->nrof);	1644	adjust_weight (this, op->total_weight ());
1682	SET_FLAG (op, FLAG_REMOVED);	1645
1683	op->destroy (); /* free the inserted object */	1646	op->destroy ();
1684	op = tmp;	1647	op = tmp;
1685	op->remove (); /* and fix old object's links */	1648	goto inserted;
1686	CLEAR_FLAG (op, FLAG_REMOVED);
1687	break;
1688	}	1649	}
1689		1650
1690	/* I assume combined objects have no inventory
1691	* We add the weight - this object could have just been removed
1692	* (if it was possible to merge). calling remove_ob will subtract
1693	* the weight, so we need to add it in again, since we actually do
1694	* the linking below
1695	*/
1696	add_weight (this, op->weight * op->nrof);
1697	}
1698	else
1699	add_weight (this, (op->weight + op->carrying));
1700
1701	if (object *otmp = this->in_player ())
1702	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1703	otmp->update_stats ();
1704
1705	op->owner = 0; // its his/hers now. period.	1651	op->owner = 0; // it's his/hers now. period.
1706	op->map = 0;	1652	op->map = 0;
		1653	op->x = 0;
		1654	op->y = 0;
		1655
		1656	op->above = 0;
		1657	op->below = inv;
1707	op->env = this;	1658	op->env = this;
1708	op->above = 0;
1709	op->below = 0;
1710	op->x = op->y = 0;
1711		1659
		1660	if (inv)
		1661	inv->above = op;
		1662
		1663	inv = op;
		1664
		1665	op->flag [FLAG_REMOVED] = 0;
		1666
		1667	if (object *pl = op->visible_to ())
		1668	esrv_send_item (pl, op);
		1669
		1670	adjust_weight (this, op->total_weight ());
		1671
		1672	inserted:
1712	/* reset the light list and los of the players on the map */	1673	/* reset the light list and los of the players on the map */
1713	if (op->glow_radius && map)	1674	if (op->glow_radius && is_on_map ())
1714	{	1675	{
1715	#ifdef DEBUG_LIGHTS	1676	update_stats ();
1716	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1717	#endif /* DEBUG_LIGHTS */
1718	if (map->darkness)
1719	update_all_los (map, x, y);	1677	update_all_los (map, x, y);
1720	}
1721
1722	/* Client has no idea of ordering so lets not bother ordering it here.
1723	* It sure simplifies this function...
1724	*/
1725	if (!inv)
1726	inv = op;
1727	else
1728	{	1678	}
1729	op->below = inv;	1679	else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])
1730	op->below->above = op;	1680	// if this is a player's inventory, update stats
1731	inv = op;	1681	update_stats ();
1732	}
1733		1682
1734	INVOKE_OBJECT (INSERT, this);	1683	INVOKE_OBJECT (INSERT, this);
1735		1684
1736	return op;	1685	return op;
1737	}	1686	}
…		…
1757	* on top.	1706	* on top.
1758	*/	1707	*/
1759	int	1708	int
1760	check_move_on (object *op, object *originator)	1709	check_move_on (object *op, object *originator)
1761	{	1710	{
		1711	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1712	return 0;
		1713
1762	object *tmp;	1714	object *tmp;
1763	maptile *m = op->map;	1715	maptile *m = op->map;
1764	int x = op->x, y = op->y;	1716	int x = op->x, y = op->y;
1765		1717
1766	MoveType move_on, move_slow, move_block;	1718	mapspace &ms = m->at (x, y);
1767		1719
1768	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1720	ms.update ();
1769	return 0;
1770		1721
1771	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1722	MoveType move_on = ms.move_on;
1772	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1723	MoveType move_slow = ms.move_slow;
1773	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1724	MoveType move_block = ms.move_block;
1774		1725
1775	/* if nothing on this space will slow op down or be applied,	1726	/* if nothing on this space will slow op down or be applied,
1776	* no need to do checking below. have to make sure move_type	1727	* no need to do checking below. have to make sure move_type
1777	* is set, as lots of objects don't have it set - we treat that	1728	* is set, as lots of objects don't have it set - we treat that
1778	* as walking.	1729	* as walking.
…		…
1789	return 0;	1740	return 0;
1790		1741
1791	/* The objects have to be checked from top to bottom.	1742	/* The objects have to be checked from top to bottom.
1792	* Hence, we first go to the top:	1743	* Hence, we first go to the top:
1793	*/	1744	*/
1794		1745	for (object *next, *tmp = ms.top; tmp; tmp = next)
1795	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1796	{
1797	/* Trim the search when we find the first other spell effect
1798	* this helps performance so that if a space has 50 spell objects,
1799	* we don't need to check all of them.
1800	*/
1801	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1802	break;
1803	}	1746	{
		1747	next = tmp->below;
1804		1748
1805	for (; tmp; tmp = tmp->below)
1806	{
1807	if (tmp == op)	1749	if (tmp == op)
1808	continue; /* Can't apply yourself */	1750	continue; /* Can't apply yourself */
1809		1751
1810	/* Check to see if one of the movement types should be slowed down.	1752	/* Check to see if one of the movement types should be slowed down.
1811	* Second check makes sure that the movement types not being slowed	1753	* Second check makes sure that the movement types not being slowed
…		…
1816	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1758	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1817	{	1759	{
1818	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1760	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1819	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1761	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1820	{	1762	{
1821
1822	float
1823	diff = tmp->move_slow_penalty * fabs (op->speed);	1763	float diff = tmp->move_slow_penalty * fabs (op->speed);
1824		1764
1825	if (op->type == PLAYER)	1765	if (op->is_player ())
1826	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1766	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1827	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1767	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1828	diff /= 4.0;	1768	diff /= 4.0;
1829		1769
1830	op->speed_left -= diff;	1770	op->speed_left -= diff;
1831	}	1771	}
1832	}	1772	}
…		…
1865	LOG (llevError, "Present_arch called outside map.\n");	1805	LOG (llevError, "Present_arch called outside map.\n");
1866	return NULL;	1806	return NULL;
1867	}	1807	}
1868		1808
1869	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1809	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1870	if (tmp->arch == at)	1810	if (tmp->arch->archname == at->archname)
1871	return tmp;	1811	return tmp;
1872		1812
1873	return NULL;	1813	return NULL;
1874	}	1814	}
1875		1815
…		…
1939	* The first matching object is returned, or NULL if none.	1879	* The first matching object is returned, or NULL if none.
1940	*/	1880	*/
1941	object *	1881	object *
1942	present_arch_in_ob (const archetype *at, const object *op)	1882	present_arch_in_ob (const archetype *at, const object *op)
1943	{	1883	{
1944	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1884	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1945	if (tmp->arch == at)	1885	if (tmp->arch->archname == at->archname)
1946	return tmp;	1886	return tmp;
1947		1887
1948	return NULL;	1888	return NULL;
1949	}	1889	}
1950		1890
…		…
1952	* activate recursively a flag on an object inventory	1892	* activate recursively a flag on an object inventory
1953	*/	1893	*/
1954	void	1894	void
1955	flag_inv (object *op, int flag)	1895	flag_inv (object *op, int flag)
1956	{	1896	{
1957	if (op->inv)
1958	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1897	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1959	{	1898	{
1960	SET_FLAG (tmp, flag);	1899	SET_FLAG (tmp, flag);
1961	flag_inv (tmp, flag);	1900	flag_inv (tmp, flag);
1962	}	1901	}
1963	}	1902	}
1964		1903
1965	/*	1904	/*
1966	* deactivate recursively a flag on an object inventory	1905	* deactivate recursively a flag on an object inventory
1967	*/	1906	*/
1968	void	1907	void
1969	unflag_inv (object *op, int flag)	1908	unflag_inv (object *op, int flag)
1970	{	1909	{
1971	if (op->inv)
1972	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1910	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1973	{	1911	{
1974	CLEAR_FLAG (tmp, flag);	1912	CLEAR_FLAG (tmp, flag);
1975	unflag_inv (tmp, flag);	1913	unflag_inv (tmp, flag);
1976	}	1914	}
1977	}	1915	}
1978		1916
1979	/*	1917	/*
1980	* find_free_spot(object, map, x, y, start, stop) will search for	1918	* find_free_spot(object, map, x, y, start, stop) will search for
1981	* a spot at the given map and coordinates which will be able to contain	1919	* a spot at the given map and coordinates which will be able to contain
…		…
1983	* to search (see the freearr_x/y[] definition).	1921	* to search (see the freearr_x/y[] definition).
1984	* It returns a random choice among the alternatives found.	1922	* It returns a random choice among the alternatives found.
1985	* start and stop are where to start relative to the free_arr array (1,9	1923	* start and stop are where to start relative to the free_arr array (1,9
1986	* does all 4 immediate directions). This returns the index into the	1924	* does all 4 immediate directions). This returns the index into the
1987	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1925	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1988	* Note - this only checks to see if there is space for the head of the
1989	* object - if it is a multispace object, this should be called for all
1990	* pieces.
1991	* Note2: This function does correctly handle tiled maps, but does not	1926	* Note: This function does correctly handle tiled maps, but does not
1992	* inform the caller. However, insert_ob_in_map will update as	1927	* inform the caller. However, insert_ob_in_map will update as
1993	* necessary, so the caller shouldn't need to do any special work.	1928	* necessary, so the caller shouldn't need to do any special work.
1994	* Note - updated to take an object instead of archetype - this is necessary	1929	* Note - updated to take an object instead of archetype - this is necessary
1995	* because arch_blocked (now ob_blocked) needs to know the movement type	1930	* because arch_blocked (now ob_blocked) needs to know the movement type
1996	* to know if the space in question will block the object. We can't use	1931	* to know if the space in question will block the object. We can't use
…		…
2017		1952
2018	/* However, often	1953	/* However, often
2019	* ob doesn't have any move type (when used to place exits)	1954	* ob doesn't have any move type (when used to place exits)
2020	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.	1955	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
2021	*/	1956	*/
2022	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	1957	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
2023	{	1958	{
2024	altern [index++] = i;	1959	altern [index++] = i;
2025	continue;	1960	continue;
2026	}	1961	}
2027		1962
…		…
2043	* head of the object should correspond for the entire object.	1978	* head of the object should correspond for the entire object.
2044	*/	1979	*/
2045	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	1980	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
2046	continue;	1981	continue;
2047		1982
		1983	if (ob->blocked (pos.m, pos.x, pos.y))
		1984	continue;
		1985
2048	altern [index++] = i;	1986	altern [index++] = i;
2049	}	1987	}
2050		1988
2051	if (!index)	1989	if (!index)
2052	return -1;	1990	return -1;
…		…
2118	* there is capable of.	2056	* there is capable of.
2119	*/	2057	*/
2120	int	2058	int
2121	find_dir (maptile *m, int x, int y, object *exclude)	2059	find_dir (maptile *m, int x, int y, object *exclude)
2122	{	2060	{
2123	int i, max = SIZEOFFREE, mflags;	2061	int max = SIZEOFFREE, mflags;
2124
2125	sint16 nx, ny;
2126	object *tmp;
2127	maptile *mp;
2128
2129	MoveType blocked, move_type;	2062	MoveType move_type;
2130		2063
2131	if (exclude && exclude->head_ () != exclude)	2064	if (exclude && exclude->head_ () != exclude)
2132	{	2065	{
2133	exclude = exclude->head;	2066	exclude = exclude->head;
2134	move_type = exclude->move_type;	2067	move_type = exclude->move_type;
…		…
2137	{	2070	{
2138	/* If we don't have anything, presume it can use all movement types. */	2071	/* If we don't have anything, presume it can use all movement types. */
2139	move_type = MOVE_ALL;	2072	move_type = MOVE_ALL;
2140	}	2073	}
2141		2074
2142	for (i = 1; i < max; i++)	2075	for (int i = 1; i < max; i++)
2143	{	2076	{
2144	mp = m;	2077	mapxy pos (m, x, y);
2145	nx = x + freearr_x[i];	2078	pos.move (i);
2146	ny = y + freearr_y[i];
2147		2079
2148	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2080	if (!pos.normalise ())
2149
2150	if (mflags & P_OUT_OF_MAP)
2151	max = maxfree[i];	2081	max = maxfree[i];
2152	else	2082	else
2153	{	2083	{
2154	mapspace &ms = mp->at (nx, ny);	2084	mapspace &ms = *pos;
2155		2085
2156	blocked = ms.move_block;
2157
2158	if ((move_type & blocked) == move_type)	2086	if ((move_type & ms.move_block) == move_type)
2159	max = maxfree[i];	2087	max = maxfree [i];
2160	else if (mflags & P_IS_ALIVE)	2088	else if (ms.flags () & P_IS_ALIVE)
2161	{	2089	{
2162	for (tmp = ms.bot; tmp; tmp = tmp->above)	2090	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2163	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2091	if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2164	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2092	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2165	break;
2166
2167	if (tmp)
2168	return freedir[i];	2093	return freedir [i];
2169	}	2094	}
2170	}	2095	}
2171	}	2096	}
2172		2097
2173	return 0;	2098	return 0;
…		…
2248	* This basically means that if direction is 15, then it could either go	2173	* This basically means that if direction is 15, then it could either go
2249	* direction 4, 14, or 16 to get back to where we are.	2174	* direction 4, 14, or 16 to get back to where we are.
2250	* Moved from spell_util.c to object.c with the other related direction	2175	* Moved from spell_util.c to object.c with the other related direction
2251	* functions.	2176	* functions.
2252	*/	2177	*/
2253	int reduction_dir[SIZEOFFREE][3] = {	2178	const int reduction_dir[SIZEOFFREE][3] = {
2254	{0, 0, 0}, /* 0 */	2179	{0, 0, 0}, /* 0 */
2255	{0, 0, 0}, /* 1 */	2180	{0, 0, 0}, /* 1 */
2256	{0, 0, 0}, /* 2 */	2181	{0, 0, 0}, /* 2 */
2257	{0, 0, 0}, /* 3 */	2182	{0, 0, 0}, /* 3 */
2258	{0, 0, 0}, /* 4 */	2183	{0, 0, 0}, /* 4 */
…		…
2354	int	2279	int
2355	can_pick (const object *who, const object *item)	2280	can_pick (const object *who, const object *item)
2356	{	2281	{
2357	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2282	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2358	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2283	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2359	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2284	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2360	}	2285	}
2361		2286
2362	/*	2287	/*
2363	* create clone from object to another	2288	* create clone from object to another
2364	*/	2289	*/
2365	object *	2290	object *
2366	object_create_clone (object *asrc)	2291	object::deep_clone ()
2367	{	2292	{
2368	object *dst = 0, *tmp, *src, *prev, *item;	2293	assert (("deep_clone called on non-head object", is_head ()));
2369		2294
2370	if (!asrc)	2295	object *dst = clone ();
2371	return 0;
2372		2296
2373	src = asrc->head_ ();	2297	object *prev = dst;
2374
2375	prev = 0;
2376	for (object *part = src; part; part = part->more)	2298	for (object *part = this->more; part; part = part->more)
2377	{	2299	{
2378	tmp = part->clone ();	2300	object *tmp = part->clone ();
2379	tmp->x -= src->x;
2380	tmp->y -= src->y;
2381
2382	if (!part->head)
2383	{
2384	dst = tmp;
2385	tmp->head = 0;
2386	}
2387	else
2388	tmp->head = dst;	2301	tmp->head = dst;
2389
2390	tmp->more = 0;
2391
2392	if (prev)
2393	prev->more = tmp;	2302	prev->more = tmp;
2394
2395	prev = tmp;	2303	prev = tmp;
2396	}	2304	}
2397		2305
2398	for (item = src->inv; item; item = item->below)	2306	for (object *item = inv; item; item = item->below)
2399	insert_ob_in_ob (object_create_clone (item), dst);	2307	insert_ob_in_ob (item->deep_clone (), dst);
2400		2308
2401	return dst;	2309	return dst;
2402	}	2310	}
2403		2311
2404	/* This returns the first object in who's inventory that	2312	/* This returns the first object in who's inventory that
…		…
2413	return tmp;	2321	return tmp;
2414		2322
2415	return 0;	2323	return 0;
2416	}	2324	}
2417		2325
2418	/* If ob has a field named key, return the link from the list,	2326	shstr_tmp
2419	* otherwise return NULL.	2327	object::kv_get (shstr_tmp key) const
2420	*
2421	* key must be a passed in shared string - otherwise, this won't
2422	* do the desired thing.
2423	*/
2424	key_value *
2425	get_ob_key_link (const object *ob, const char *key)
2426	{	2328	{
2427	for (key_value *link = ob->key_values; link; link = link->next)	2329	for (key_value *kv = key_values; kv; kv = kv->next)
2428	if (link->key == key)	2330	if (kv->key == key)
2429	return link;
2430
2431	return 0;
2432	}
2433
2434	/*
2435	* Returns the value of op has an extra_field for key, or NULL.
2436	*
2437	* The argument doesn't need to be a shared string.
2438	*
2439	* The returned string is shared.
2440	*/
2441	const char *
2442	get_ob_key_value (const object *op, const char *const key)
2443	{
2444	key_value *link;
2445	shstr_cmp canonical_key (key);
2446
2447	if (!canonical_key)
2448	{
2449	/* 1. There being a field named key on any object
2450	* implies there'd be a shared string to find.
2451	* 2. Since there isn't, no object has this field.
2452	* 3. Therefore, *this* object doesn't have this field.
2453	*/
2454	return 0;
2455	}
2456
2457	/* This is copied from get_ob_key_link() above -
2458	* only 4 lines, and saves the function call overhead.
2459	*/
2460	for (link = op->key_values; link; link = link->next)
2461	if (link->key == canonical_key)
2462	return link->value;	2331	return kv->value;
2463		2332
2464	return 0;	2333	return shstr ();
2465	}	2334	}
2466		2335
2467	/*	2336	void
2468	* Updates the canonical_key in op to value.	2337	object::kv_set (shstr_tmp key, shstr_tmp value)
2469	*
2470	* canonical_key is a shared string (value doesn't have to be).
2471	*
2472	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2473	* keys.
2474	*
2475	* Returns TRUE on success.
2476	*/
2477	int
2478	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2479	{	2338	{
2480	key_value *field = NULL, *last = NULL;	2339	for (key_value *kv = key_values; kv; kv = kv->next)
2481		2340	if (kv->key == key)
2482	for (field = op->key_values; field != NULL; field = field->next)
2483	{
2484	if (field->key != canonical_key)
2485	{	2341	{
2486	last = field;	2342	kv->value = value;
2487	continue;	2343	return;
2488	}	2344	}
2489		2345
2490	if (value)	2346	key_value *kv = new key_value;
2491	field->value = value;	2347
2492	else	2348	kv->next = key_values;
		2349	kv->key = key;
		2350	kv->value = value;
		2351
		2352	key_values = kv;
		2353	}
		2354
		2355	void
		2356	object::kv_del (shstr_tmp key)
		2357	{
		2358	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2359	if ((*kvp)->key == key)
2493	{	2360	{
2494	/* Basically, if the archetype has this key set,	2361	key_value *kv = *kvp;
2495	* we need to store the null value so when we save	2362	*kvp = (*kvp)->next;
2496	* it, we save the empty value so that when we load,	2363	delete kv;
2497	* we get this value back again.	2364	return;
2498	*/
2499	if (get_ob_key_link (op->arch, canonical_key))
2500	field->value = 0;
2501	else
2502	{
2503	if (last)
2504	last->next = field->next;
2505	else
2506	op->key_values = field->next;
2507
2508	delete field;
2509	}
2510	}	2365	}
2511	return TRUE;
2512	}
2513	/* IF we get here, key doesn't exist */
2514
2515	/* No field, we'll have to add it. */
2516
2517	if (!add_key)
2518	return FALSE;
2519
2520	/* There isn't any good reason to store a null
2521	* value in the key/value list. If the archetype has
2522	* this key, then we should also have it, so shouldn't
2523	* be here. If user wants to store empty strings,
2524	* should pass in ""
2525	*/
2526	if (value == NULL)
2527	return TRUE;
2528
2529	field = new key_value;
2530
2531	field->key = canonical_key;
2532	field->value = value;
2533	/* Usual prepend-addition. */
2534	field->next = op->key_values;
2535	op->key_values = field;
2536
2537	return TRUE;
2538	}
2539
2540	/*
2541	* Updates the key in op to value.
2542	*
2543	* If add_key is FALSE, this will only update existing keys,
2544	* and not add new ones.
2545	* In general, should be little reason FALSE is ever passed in for add_key
2546	*
2547	* Returns TRUE on success.
2548	*/
2549	int
2550	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2551	{
2552	shstr key_ (key);
2553
2554	return set_ob_key_value_s (op, key_, value, add_key);
2555	}	2366	}
2556		2367
2557	object::depth_iterator::depth_iterator (object *container)	2368	object::depth_iterator::depth_iterator (object *container)
2558	: iterator_base (container)	2369	: iterator_base (container)
2559	{	2370	{
…		…
2609	{	2420	{
2610	char flagdesc[512];	2421	char flagdesc[512];
2611	char info2[256 * 4];	2422	char info2[256 * 4];
2612	char *p = info;	2423	char *p = info;
2613		2424
2614	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2425	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2615	count, uuid.seq,	2426	count,
		2427	uuid.c_str (),
2616	&name,	2428	&name,
2617	title ? "\",title:\"" : "",	2429	title ? ",title:\"" : "",
2618	title ? (const char *)title : "",	2430	title ? (const char *)title : "",
		2431	title ? "\"" : "",
2619	flag_desc (flagdesc, 512), type);	2432	flag_desc (flagdesc, 512), type);
2620		2433
2621	if (!this->flag[FLAG_REMOVED] && env)	2434	if (!flag[FLAG_REMOVED] && env)
2622	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2435	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2623		2436
2624	if (map)	2437	if (map)
2625	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2438	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2626		2439
…		…
2656	object::open_container (object *new_container)	2469	object::open_container (object *new_container)
2657	{	2470	{
2658	if (container == new_container)	2471	if (container == new_container)
2659	return;	2472	return;
2660		2473
2661	if (object *old_container = container)	2474	object *old_container = container;
		2475
		2476	if (old_container)
2662	{	2477	{
2663	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2478	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2664	return;	2479	return;
2665		2480
2666	#if 0	2481	#if 0
…		…
2668	if (object *closer = old_container->inv)	2483	if (object *closer = old_container->inv)
2669	if (closer->type == CLOSE_CON)	2484	if (closer->type == CLOSE_CON)
2670	closer->destroy ();	2485	closer->destroy ();
2671	#endif	2486	#endif
2672		2487
		2488	// make sure the container is available
		2489	esrv_send_item (this, old_container);
		2490
2673	old_container->flag [FLAG_APPLIED] = 0;	2491	old_container->flag [FLAG_APPLIED] = false;
2674	container = 0;	2492	container = 0;
2675		2493
		2494	// client needs item update to make it work, client bug requires this to be separate
2676	esrv_update_item (UPD_FLAGS, this, old_container);	2495	esrv_update_item (UPD_FLAGS, this, old_container);
		2496
2677	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2497	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2678	play_sound (sound_find ("chest_close"));	2498	play_sound (sound_find ("chest_close"));
2679	}	2499	}
2680		2500
2681	if (new_container)	2501	if (new_container)
2682	{	2502	{
…		…
2692	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2512	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2693	new_container->insert (closer);	2513	new_container->insert (closer);
2694	}	2514	}
2695	#endif	2515	#endif
2696		2516
2697	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2517	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2698		2518
		2519	// make sure the container is available, client bug requires this to be separate
		2520	esrv_send_item (this, new_container);
		2521
2699	new_container->flag [FLAG_APPLIED] = 1;	2522	new_container->flag [FLAG_APPLIED] = true;
2700	container = new_container;	2523	container = new_container;
2701		2524
		2525	// client needs flag change
2702	esrv_update_item (UPD_FLAGS, this, new_container);	2526	esrv_update_item (UPD_FLAGS, this, new_container);
2703	esrv_send_inventory (this, new_container);	2527	esrv_send_inventory (this, new_container);
2704	play_sound (sound_find ("chest_open"));	2528	play_sound (sound_find ("chest_open"));
2705	}	2529	}
		2530	// else if (!old_container->env && contr && contr->ns)
		2531	// contr->ns->floorbox_reset ();
2706	}	2532	}
2707		2533
2708	object *	2534	object *
2709	object::force_find (const shstr name)	2535	object::force_find (shstr_tmp name)
2710	{	2536	{
2711	/* cycle through his inventory to look for the MARK we want to	2537	/* cycle through his inventory to look for the MARK we want to
2712	* place	2538	* place
2713	*/	2539	*/
2714	for (object *tmp = inv; tmp; tmp = tmp->below)	2540	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2716	return splay (tmp);	2542	return splay (tmp);
2717		2543
2718	return 0;	2544	return 0;
2719	}	2545	}
2720		2546
		2547	//-GPL
		2548
2721	void	2549	void
		2550	object::force_set_timer (int duration)
		2551	{
		2552	this->duration = 1;
		2553	this->speed_left = -1.f;
		2554
		2555	this->set_speed (duration ? 1.f / duration : 0.f);
		2556	}
		2557
		2558	object *
2722	object::force_add (const shstr name, int duration)	2559	object::force_add (shstr_tmp name, int duration)
2723	{	2560	{
2724	if (object *force = force_find (name))	2561	if (object *force = force_find (name))
2725	force->destroy ();	2562	force->destroy ();
2726		2563
2727	object *force = get_archetype (FORCE_NAME);	2564	object *force = get_archetype (FORCE_NAME);
2728		2565
2729	force->slaying = name;	2566	force->slaying = name;
2730	force->stats.food = 1;	2567	force->force_set_timer (duration);
2731	force->speed_left = -1.f;
2732
2733	force->set_speed (duration ? 1.f / duration : 0.f);
2734	force->flag [FLAG_IS_USED_UP] = true;
2735	force->flag [FLAG_APPLIED] = true;	2568	force->flag [FLAG_APPLIED] = true;
2736		2569
2737	insert (force);	2570	return insert (force);
2738	}	2571	}
2739		2572
2740	void	2573	void
2741	object::play_sound (faceidx sound) const	2574	object::play_sound (faceidx sound) const
2742	{	2575	{
2743	if (!sound)	2576	if (!sound)
2744	return;	2577	return;
2745		2578
2746	if (flag [FLAG_REMOVED])	2579	if (is_on_map ())
		2580	map->play_sound (sound, x, y);
		2581	else if (object *pl = in_player ())
		2582	pl->contr->play_sound (sound);
		2583	}
		2584
		2585	void
		2586	object::say_msg (const char *msg) const
		2587	{
		2588	if (is_on_map ())
		2589	map->say_msg (msg, x, y);
		2590	else if (object *pl = in_player ())
		2591	pl->contr->play_sound (sound);
		2592	}
		2593
		2594	void
		2595	object::make_noise ()
		2596	{
		2597	// we do not model noise in the map, so instead put
		2598	// a temporary light into the noise source
		2599	// could use the map instead, but that's less reliable for our
		2600	// goal, which is to make invisibility a bit harder to exploit
		2601
		2602	// currently only works sensibly for players
		2603	if (!is_player ())
2747	return;	2604	return;
2748		2605
2749	if (env)	2606	// find old force, or create new one
2750	{	2607	object *force = force_find (shstr_noise_force);
2751	if (object *pl = in_player ())	2608
2752	pl->contr->play_sound (sound);	2609	if (force)
2753	}	2610	force->speed_left = -1.f; // patch old speed up
2754	else	2611	else
2755	map->play_sound (sound, x, y);	2612	{
2756	}	2613	force = archetype::get (shstr_noise_force);
2757		2614
		2615	force->slaying = shstr_noise_force;
		2616	force->stats.food = 1;
		2617	force->speed_left = -1.f;
		2618
		2619	force->set_speed (1.f / 4.f);
		2620	force->flag [FLAG_IS_USED_UP] = true;
		2621	force->flag [FLAG_APPLIED] = true;
		2622
		2623	insert (force);
		2624	}
		2625	}
		2626

Diff Legend

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