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.36 by root, Tue Sep 12 19:20:06 2006 UTC vs.
Revision 1.363 by root, Sun Jan 29 02:47:04 2017 UTC

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

Diff Legend

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