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.191 by root, Sun Sep 30 20:22:15 2007 UTC vs.
Revision 1.326 by root, Thu Apr 15 00:56:40 2010 UTC

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

Diff Legend

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