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

Diff Legend

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