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

Diff Legend

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