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.7 by root, Tue Aug 29 05:03:54 2006 UTC vs.
Revision 1.345 by root, Sun May 1 16:58:15 2011 UTC

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

Diff Legend

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