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.82 by root, Mon Dec 25 11:25:49 2006 UTC vs.
Revision 1.324 by root, Mon Apr 12 05:22:37 2010 UTC

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

Diff Legend

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