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.187 by root, Tue Sep 4 08:42:55 2007 UTC vs.
Revision 1.319 by root, Sat Apr 3 02:29:40 2010 UTC

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

Diff Legend

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