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.153 by root, Thu May 17 21:11:01 2007 UTC vs.
Revision 1.292 by root, Mon Oct 19 21:48:49 2009 UTC

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

Diff Legend

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