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.79 by root, Sat Dec 23 06:30:49 2006 UTC vs.
Revision 1.290 by sf-marcmagus, Sun Oct 11 05:43:35 2009 UTC

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

Diff Legend

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