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

Diff Legend

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