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

Diff Legend

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