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.2 by root, Fri Aug 25 17:11:52 2006 UTC vs.
Revision 1.341 by root, Fri Feb 25 07:23:38 2011 UTC

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

Diff Legend

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