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

Diff Legend

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