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.37 by root, Tue Sep 12 20:55:40 2006 UTC vs.
Revision 1.298 by root, Sun Nov 8 00:01:33 2009 UTC

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

Diff Legend

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