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.25 by root, Mon Sep 11 01:16:20 2006 UTC vs.
Revision 1.360 by root, Wed Nov 16 23:41:59 2016 UTC

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

Diff Legend

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