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.75 by root, Wed Dec 20 11:36:38 2006 UTC vs.
Revision 1.223 by root, Wed Apr 30 08:29:31 2008 UTC

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

Diff Legend

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