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

Diff Legend

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