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

Diff Legend

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