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

Diff Legend

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