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.61 by root, Mon Dec 11 21:32:16 2006 UTC vs.
Revision 1.215 by root, Tue Apr 22 07:28:05 2008 UTC

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

Diff Legend

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