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

Diff Legend

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