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

Diff Legend

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