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

Diff Legend

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