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

Diff Legend

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