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

Diff Legend

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