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.111 by root, Mon Jan 8 01:19:02 2007 UTC vs.
Revision 1.288 by root, Sat Oct 3 22:36:08 2009 UTC

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

Diff Legend

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