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.27 by root, Mon Sep 11 12:08:45 2006 UTC vs.
Revision 1.270 by root, Sat Dec 27 02:31:19 2008 UTC

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

Diff Legend

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