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.107 by pippijn, Sat Jan 6 14:42:29 2007 UTC vs.
Revision 1.330 by root, Sun Apr 18 14:01:33 2010 UTC

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

Diff Legend

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