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.44 by root, Thu Sep 14 17:29:27 2006 UTC vs.
Revision 1.250 by root, Wed Jul 16 14:29:40 2008 UTC

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

Diff Legend

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