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.106 by root, Wed Jan 3 20:08:04 2007 UTC vs.
Revision 1.252 by root, Mon Aug 11 23:23:41 2008 UTC

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

Diff Legend

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