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

Diff Legend

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