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.50 by root, Sat Sep 16 22:40:22 2006 UTC vs.
Revision 1.259 by root, Mon Sep 29 10:32:50 2008 UTC

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

Diff Legend

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