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.73 by root, Wed Dec 20 01:19:11 2006 UTC vs.
Revision 1.258 by root, Mon Sep 29 09:04:50 2008 UTC

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

Diff Legend

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