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

Diff Legend

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