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.158 by root, Mon Jun 4 12:19:08 2007 UTC vs.
Revision 1.294 by root, Thu Nov 5 15:43:21 2009 UTC

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

Diff Legend

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