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

Diff Legend

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