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

Diff Legend

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