ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.50 by root, Sat Sep 16 22:40:22 2006 UTC vs.
Revision 1.221 by root, Thu Apr 24 12:06:01 2008 UTC

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

Diff Legend

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