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.97 by elmex, Sat Dec 30 21:07:46 2006 UTC vs.
Revision 1.353 by root, Fri Jan 27 22:00:39 2012 UTC

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

Diff Legend

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