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.26 by root, Mon Sep 11 11:46:52 2006 UTC vs.
Revision 1.245 by root, Sun May 18 19:53:07 2008 UTC

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

Diff Legend

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