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.11 by root, Sun Sep 3 00:18:40 2006 UTC vs.
Revision 1.349 by root, Sun May 8 11:44:43 2011 UTC

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

Diff Legend

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