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

Diff Legend

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