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.95 by root, Wed Dec 27 05:42:08 2006 UTC vs.
Revision 1.224 by root, Fri May 2 20:16:24 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
…		…
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->flag ^ ob2->flag).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, 1);	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	/*	608	object &
473	* copy_to first frees everything allocated by the dst object,	609	object::operator =(const object &src)
474	* and then copies the contents of itself into the second
475	* object, allocating what needs to be allocated. Basically, any
476	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
477	* if the first object is freed, the pointers in the new object
478	* will point at garbage.
479	*/
480	void
481	object::copy_to (object *dst)
482	{	610	{
483	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	611	remove ();
484	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
485		612
486	*(object_copy *)dst = *this;	613	*(object_copy *)this = src;
487		614
488	if (is_freed)	615	flag [FLAG_REMOVED] = true;
489	SET_FLAG (dst, FLAG_FREED);
490
491	if (is_removed)
492	SET_FLAG (dst, FLAG_REMOVED);
493
494	if (speed < 0)
495	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
496		616
497	/* Copy over key_values, if any. */	617	/* Copy over key_values, if any. */
498	if (key_values)	618	if (src.key_values)
499	{	619	{
500	key_value *tail = 0;	620	key_value *tail = 0;
501	key_value *i;
502
503	dst->key_values = 0;	621	key_values = 0;
504		622
505	for (i = key_values; i; i = i->next)	623	for (key_value *i = src.key_values; i; i = i->next)
506	{	624	{
507	key_value *new_link = new key_value;	625	key_value *new_link = new key_value;
508		626
509	new_link->next = 0;	627	new_link->next = 0;
510	new_link->key = i->key;	628	new_link->key = i->key;
511	new_link->value = i->value;	629	new_link->value = i->value;
512		630
513	/* Try and be clever here, too. */	631	/* Try and be clever here, too. */
514	if (!dst->key_values)	632	if (!key_values)
515	{	633	{
516	dst->key_values = new_link;	634	key_values = new_link;
517	tail = new_link;	635	tail = new_link;
518	}	636	}
519	else	637	else
520	{	638	{
521	tail->next = new_link;	639	tail->next = new_link;
522	tail = new_link;	640	tail = new_link;
523	}	641	}
524	}	642	}
525	}	643	}
		644	}
		645
		646	/*
		647	* copy_to first frees everything allocated by the dst object,
		648	* and then copies the contents of itself into the second
		649	* object, allocating what needs to be allocated. Basically, any
		650	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		651	* if the first object is freed, the pointers in the new object
		652	* will point at garbage.
		653	*/
		654	void
		655	object::copy_to (object *dst)
		656	{
		657	*dst = *this;
		658
		659	if (speed < 0)
		660	dst->speed_left -= rndm ();
526		661
527	dst->set_speed (dst->speed);	662	dst->set_speed (dst->speed);
		663	}
		664
		665	void
		666	object::instantiate ()
		667	{
		668	if (!uuid.seq) // HACK
		669	uuid = UUID::gen ();
		670
		671	speed_left = -0.1f;
		672	/* copy the body_info to the body_used - this is only really
		673	* need for monsters, but doesn't hurt to do it for everything.
		674	* by doing so, when a monster is created, it has good starting
		675	* values for the body_used info, so when items are created
		676	* for it, they can be properly equipped.
		677	*/
		678	for (int i = NUM_BODY_LOCATIONS; i--; )
		679	slot[i].used = slot[i].info;
		680
		681	attachable::instantiate ();
528	}	682	}
529		683
530	object *	684	object *
531	object::clone ()	685	object::clone ()
532	{	686	{
…		…
538	/*	692	/*
539	* If an object with the IS_TURNABLE() flag needs to be turned due	693	* If an object with the IS_TURNABLE() flag needs to be turned due
540	* to the closest player being on the other side, this function can	694	* to the closest player being on the other side, this function can
541	* be called to update the face variable, _and_ how it looks on the map.	695	* be called to update the face variable, _and_ how it looks on the map.
542	*/	696	*/
543
544	void	697	void
545	update_turn_face (object *op)	698	update_turn_face (object *op)
546	{	699	{
547	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	700	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
548	return;	701	return;
		702
549	SET_ANIMATION (op, op->direction);	703	SET_ANIMATION (op, op->direction);
550	update_object (op, UP_OBJ_FACE);	704	update_object (op, UP_OBJ_FACE);
551	}	705	}
552		706
553	/*	707	/*
…		…
556	* This function needs to be called whenever the speed of an object changes.	710	* This function needs to be called whenever the speed of an object changes.
557	*/	711	*/
558	void	712	void
559	object::set_speed (float speed)	713	object::set_speed (float speed)
560	{	714	{
561	extern int arch_init;
562
563	/* No reason putting the archetypes objects on the speed list,
564	* since they never really need to be updated.
565	*/
566	if (flag [FLAG_FREED] && speed)	715	if (flag [FLAG_FREED] && speed)
567	{	716	{
568	LOG (llevError, "Object %s is freed but has speed.\n", &name);	717	LOG (llevError, "Object %s is freed but has speed.\n", &name);
569	speed = 0;	718	speed = 0;
570	}	719	}
571		720
572	this->speed = speed;	721	this->speed = speed;
573		722
574	if (arch_init)	723	if (has_active_speed ())
575	return;	724	activate ();
576
577	if (FABS (speed) > MIN_ACTIVE_SPEED)
578	{
579	/* If already on active list, don't do anything */
580	if (active_next || active_prev || this == active_objects)
581	return;
582
583	/* process_events() expects us to insert the object at the beginning
584	* of the list. */
585	active_next = active_objects;
586
587	if (active_next)
588	active_next->active_prev = this;
589
590	active_objects = this;
591	}
592	else	725	else
593	{	726	deactivate ();
594	/* If not on the active list, nothing needs to be done */
595	if (!active_next && !active_prev && this != active_objects)
596	return;
597
598	if (!active_prev)
599	{
600	active_objects = active_next;
601
602	if (active_next)
603	active_next->active_prev = 0;
604	}
605	else
606	{
607	active_prev->active_next = active_next;
608
609	if (active_next)
610	active_next->active_prev = active_prev;
611	}
612
613	active_next = 0;
614	active_prev = 0;
615	}
616	}
617
618	/* This function removes object 'op' from the list of active
619	* objects.
620	* This should only be used for style maps or other such
621	* reference maps where you don't want an object that isn't
622	* in play chewing up cpu time getting processed.
623	* The reverse of this is to call update_ob_speed, which
624	* will do the right thing based on the speed of the object.
625	*/
626	void
627	remove_from_active_list (object *op)
628	{
629	/* If not on the active list, nothing needs to be done */
630	if (!op->active_next && !op->active_prev && op != active_objects)
631	return;
632
633	if (op->active_prev == NULL)
634	{
635	active_objects = op->active_next;
636	if (op->active_next != NULL)
637	op->active_next->active_prev = NULL;
638	}
639	else
640	{
641	op->active_prev->active_next = op->active_next;
642	if (op->active_next)
643	op->active_next->active_prev = op->active_prev;
644	}
645	op->active_next = NULL;
646	op->active_prev = NULL;
647	}	727	}
648		728
649	/*	729	/*
650	* update_object() updates the the map.	730	* update_object() updates the the map.
651	* It takes into account invisible objects (and represent squares covered	731	* It takes into account invisible objects (and represent squares covered
…		…
664	* UP_OBJ_FACE: only the objects face has changed.	744	* UP_OBJ_FACE: only the objects face has changed.
665	*/	745	*/
666	void	746	void
667	update_object (object *op, int action)	747	update_object (object *op, int action)
668	{	748	{
669	MoveType move_on, move_off, move_block, move_slow;	749	if (!op)
670
671	if (op == NULL)
672	{	750	{
673	/* this should never happen */	751	/* this should never happen */
674	LOG (llevDebug, "update_object() called for NULL object.\n");	752	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
675	return;	753	return;
676	}	754	}
677		755
678	if (op->env)	756	if (!op->is_on_map ())
679	{	757	{
680	/* Animation is currently handled by client, so nothing	758	/* Animation is currently handled by client, so nothing
681	* to do in this case.	759	* to do in this case.
682	*/	760	*/
683	return;	761	return;
684	}	762	}
685
686	/* If the map is saving, don't do anything as everything is
687	* going to get freed anyways.
688	*/
689	if (!op->map || op->map->in_memory == MAP_SAVING)
690	return;
691		763
692	/* make sure the object is within map boundaries */	764	/* make sure the object is within map boundaries */
693	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)	765	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
694	{	766	{
695	LOG (llevError, "update_object() called for object out of map!\n");	767	LOG (llevError, "update_object() called for object out of map!\n");
…		…
699	return;	771	return;
700	}	772	}
701		773
702	mapspace &m = op->ms ();	774	mapspace &m = op->ms ();
703		775
704	if (m.flags_ & P_NEED_UPDATE)	776	if (!(m.flags_ & P_UPTODATE))
705	/* nop */;	777	/* nop */;
706	else if (action == UP_OBJ_INSERT)	778	else if (action == UP_OBJ_INSERT)
707	{	779	{
708	// this is likely overkill, TODO: revisit (schmorp)	780	// this is likely overkill, TODO: revisit (schmorp)
709	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	781	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
…		…
718	/* This isn't perfect, but I don't expect a lot of objects to	790	/* This isn't perfect, but I don't expect a lot of objects to
719	* to have move_allow right now.	791	* to have move_allow right now.
720	*/	792	*/
721	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	793	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
722	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	794	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
723	m.flags_ = P_NEED_UPDATE;	795	m.flags_ = 0;
724	}	796	}
725	/* if the object is being removed, we can't make intelligent	797	/* if the object is being removed, we can't make intelligent
726	* decisions, because remove_ob can't really pass the object	798	* decisions, because remove_ob can't really pass the object
727	* that is being removed.	799	* that is being removed.
728	*/	800	*/
729	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	801	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
730	m.flags_ = P_NEED_UPDATE;	802	m.flags_ = 0;
731	else if (action == UP_OBJ_FACE)	803	else if (action == UP_OBJ_FACE)
732	/* Nothing to do for that case */ ;	804	/* Nothing to do for that case */ ;
733	else	805	else
734	LOG (llevError, "update_object called with invalid action: %d\n", action);	806	LOG (llevError, "update_object called with invalid action: %d\n", action);
735		807
736	if (op->more)	808	if (op->more)
737	update_object (op->more, action);	809	update_object (op->more, action);
738	}	810	}
739		811
740	object::vector object::objects; // not yet used
741	object *object::first;
742
743	object::object ()	812	object::object ()
744	{	813	{
745	SET_FLAG (this, FLAG_REMOVED);	814	SET_FLAG (this, FLAG_REMOVED);
746		815
747	expmul = 1.0;	816	expmul = 1.0;
748	face = blank_face;	817	face = blank_face;
749	}	818	}
750		819
751	object::~object ()	820	object::~object ()
752	{	821	{
		822	unlink ();
		823
753	free_key_values (this);	824	free_key_values (this);
754	}	825	}
755		826
		827	static int object_count;
		828
756	void object::link ()	829	void object::link ()
757	{	830	{
		831	assert (!index);//D
		832	uuid = UUID::gen ();
758	count = ++ob_count;	833	count = ++object_count;
759	uuid = gen_uuid ();
760		834
761	prev = 0;	835	refcnt_inc ();
762	next = object::first;	836	objects.insert (this);
763
764	if (object::first)
765	object::first->prev = this;
766
767	object::first = this;
768	}	837	}
769		838
770	void object::unlink ()	839	void object::unlink ()
771	{	840	{
772	if (this == object::first)	841	if (!index)
773	object::first = next;	842	return;
774		843
775	/* Remove this object from the list of used objects */	844	objects.erase (this);
776	if (prev) prev->next = next;	845	refcnt_dec ();
777	if (next) next->prev = prev;	846	}
778		847
779	prev = 0;	848	void
780	next = 0;	849	object::activate ()
		850	{
		851	/* If already on active list, don't do anything */
		852	if (active)
		853	return;
		854
		855	if (has_active_speed ())
		856	actives.insert (this);
		857	}
		858
		859	void
		860	object::activate_recursive ()
		861	{
		862	activate ();
		863
		864	for (object *op = inv; op; op = op->below)
		865	op->activate_recursive ();
		866	}
		867
		868	/* This function removes object 'op' from the list of active
		869	* objects.
		870	* This should only be used for style maps or other such
		871	* reference maps where you don't want an object that isn't
		872	* in play chewing up cpu time getting processed.
		873	* The reverse of this is to call update_ob_speed, which
		874	* will do the right thing based on the speed of the object.
		875	*/
		876	void
		877	object::deactivate ()
		878	{
		879	/* If not on the active list, nothing needs to be done */
		880	if (!active)
		881	return;
		882
		883	actives.erase (this);
		884	}
		885
		886	void
		887	object::deactivate_recursive ()
		888	{
		889	for (object *op = inv; op; op = op->below)
		890	op->deactivate_recursive ();
		891
		892	deactivate ();
		893	}
		894
		895	void
		896	object::set_flag_inv (int flag, int value)
		897	{
		898	for (object *op = inv; op; op = op->below)
		899	{
		900	op->flag [flag] = value;
		901	op->set_flag_inv (flag, value);
		902	}
781	}	903	}
782		904
783	/*	905	/*
784	* Remove and free all objects in the inventory of the given object.	906	* Remove and free all objects in the inventory of the given object.
785	* object.c ?	907	* object.c ?
…		…
788	object::destroy_inv (bool drop_to_ground)	910	object::destroy_inv (bool drop_to_ground)
789	{	911	{
790	// need to check first, because the checks below might segfault	912	// need to check first, because the checks below might segfault
791	// as we might be on an invalid mapspace and crossfire code	913	// as we might be on an invalid mapspace and crossfire code
792	// is too buggy to ensure that the inventory is empty.	914	// is too buggy to ensure that the inventory is empty.
793	// corollary: if you create arrows etc. with stuff in tis inventory,	915	// corollary: if you create arrows etc. with stuff in its inventory,
794	// cf will crash below with off-map x and y	916	// cf will crash below with off-map x and y
795	if (!inv)	917	if (!inv)
796	return;	918	return;
797		919
798	/* Only if the space blocks everything do we not process -	920	/* Only if the space blocks everything do we not process -
799	* if some form of movement is allowed, let objects	921	* if some form of movement is allowed, let objects
800	* drop on that space.	922	* drop on that space.
801	*/	923	*/
802	if (!drop_to_ground	924	if (!drop_to_ground
803	|| !map	925	|| !map
804	|| map->in_memory != MAP_IN_MEMORY	926	|| map->in_memory != MAP_ACTIVE
		927	|| map->nodrop
805	|| ms ().move_block == MOVE_ALL)	928	|| ms ().move_block == MOVE_ALL)
806	{	929	{
807	while (inv)	930	while (inv)
808	{	931	{
809	inv->destroy_inv (drop_to_ground);	932	inv->destroy_inv (false);
810	inv->destroy ();	933	inv->destroy ();
811	}	934	}
812	}	935	}
813	else	936	else
814	{ /* Put objects in inventory onto this space */	937	{ /* Put objects in inventory onto this space */
…		…
818		941
819	if (op->flag [FLAG_STARTEQUIP]	942	if (op->flag [FLAG_STARTEQUIP]
820	|| op->flag [FLAG_NO_DROP]	943	|| op->flag [FLAG_NO_DROP]
821	|| op->type == RUNE	944	|| op->type == RUNE
822	|| op->type == TRAP	945	|| op->type == TRAP
823	|| op->flag [FLAG_IS_A_TEMPLATE])	946	|| op->flag [FLAG_IS_A_TEMPLATE]
		947	|| op->flag [FLAG_DESTROY_ON_DEATH])
824	op->destroy ();	948	op->destroy (true);
825	else	949	else
826	map->insert (op, x, y);	950	map->insert (op, x, y);
827	}	951	}
828	}	952	}
829	}	953	}
…		…
833	object *op = new object;	957	object *op = new object;
834	op->link ();	958	op->link ();
835	return op;	959	return op;
836	}	960	}
837		961
		962	static struct freed_map : maptile
		963	{
		964	freed_map ()
		965	{
		966	path = "<freed objects map>";
		967	name = "/internal/freed_objects_map";
		968	width = 3;
		969	height = 3;
		970	nodrop = 1;
		971
		972	alloc ();
		973	in_memory = MAP_ACTIVE;
		974	}
		975	} freed_map; // freed objects are moved here to avoid crashes
		976
838	void	977	void
839	object::do_destroy ()	978	object::do_destroy ()
840	{	979	{
841	if (flag [FLAG_IS_LINKED])	980	if (flag [FLAG_IS_LINKED])
842	remove_button_link (this);	981	remove_button_link (this);
843		982
844	if (flag [FLAG_FRIENDLY])	983	if (flag [FLAG_FRIENDLY])
845	remove_friendly_object (this);	984	remove_friendly_object (this);
846		985
847	if (!flag [FLAG_REMOVED])
848	remove ();	986	remove ();
849		987
850	if (flag [FLAG_FREED])	988	attachable::do_destroy ();
851	return;
852		989
853	set_speed (0);	990	deactivate ();
		991	unlink ();
854		992
855	flag [FLAG_FREED] = 1;	993	flag [FLAG_FREED] = 1;
856		994
857	attachable::do_destroy ();
858
859	destroy_inv (true);
860	unlink ();
861
862	// hack to ensure that freed objects still have a valid map	995	// hack to ensure that freed objects still have a valid map
863	{
864	static maptile *freed_map; // freed objects are moved here to avoid crashes
865
866	if (!freed_map)
867	{
868	freed_map = new maptile;
869
870	freed_map->name = "/internal/freed_objects_map";
871	freed_map->width = 3;
872	freed_map->height = 3;
873
874	freed_map->allocate ();
875	}
876
877	map = freed_map;	996	map = &freed_map;
878	x = 1;	997	x = 1;
879	y = 1;	998	y = 1;
880	}
881
882	head = 0;
883		999
884	if (more)	1000	if (more)
885	{	1001	{
886	more->destroy ();	1002	more->destroy ();
887	more = 0;	1003	more = 0;
888	}	1004	}
889		1005
		1006	head = 0;
		1007
890	// clear those pointers that likely might have circular references to us	1008	// clear those pointers that likely might cause circular references
891	owner = 0;	1009	owner = 0;
892	enemy = 0;	1010	enemy = 0;
893	attacked_by = 0;	1011	attacked_by = 0;
894		1012	current_weapon = 0;
895	// only relevant for players(?), but make sure of it anyways
896	contr = 0;
897	}	1013	}
898		1014
899	void	1015	void
900	object::destroy (bool destroy_inventory)	1016	object::destroy (bool destroy_inventory)
901	{	1017	{
902	if (destroyed ())	1018	if (destroyed ())
903	return;	1019	return;
904		1020
		1021	if (!is_head () && !head->destroyed ())
		1022	{
		1023	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1024	head->destroy (destroy_inventory);
		1025	return;
		1026	}
		1027
905	if (destroy_inventory)	1028	destroy_inv (!destroy_inventory);
906	destroy_inv (false);	1029
		1030	if (is_head ())
		1031	if (sound_destroy)
		1032	play_sound (sound_destroy);
		1033	else if (flag [FLAG_MONSTER])
		1034	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
907		1035
908	attachable::destroy ();	1036	attachable::destroy ();
909	}
910
911	/*
912	* sub_weight() recursively (outwards) subtracts a number from the
913	* weight of an object (and what is carried by it's environment(s)).
914	*/
915	void
916	sub_weight (object *op, signed long weight)
917	{
918	while (op != NULL)
919	{
920	if (op->type == CONTAINER)
921	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
922
923	op->carrying -= weight;
924	op = op->env;
925	}
926	}	1037	}
927		1038
928	/* op->remove ():	1039	/* op->remove ():
929	* This function removes the object op from the linked list of objects	1040	* This function removes the object op from the linked list of objects
930	* which it is currently tied to. When this function is done, the	1041	* which it is currently tied to. When this function is done, the
931	* object will have no environment. If the object previously had an	1042	* object will have no environment. If the object previously had an
932	* environment, the x and y coordinates will be updated to	1043	* environment, the x and y coordinates will be updated to
933	* the previous environment.	1044	* the previous environment.
934	* Beware: This function is called from the editor as well!
935	*/	1045	*/
936	void	1046	void
937	object::remove ()	1047	object::do_remove ()
938	{	1048	{
939	object *tmp, *last = 0;	1049	object *tmp, *last = 0;
940	object *otmp;	1050	object *otmp;
941		1051
942	if (QUERY_FLAG (this, FLAG_REMOVED))	1052	if (flag [FLAG_REMOVED])
943	return;	1053	return;
944		1054
945	SET_FLAG (this, FLAG_REMOVED);
946	INVOKE_OBJECT (REMOVE, this);	1055	INVOKE_OBJECT (REMOVE, this);
		1056
		1057	flag [FLAG_REMOVED] = true;
947		1058
948	if (more)	1059	if (more)
949	more->remove ();	1060	more->remove ();
950		1061
951	/*	1062	/*
952	* In this case, the object to be removed is in someones	1063	* In this case, the object to be removed is in someones
953	* inventory.	1064	* inventory.
954	*/	1065	*/
955	if (env)	1066	if (env)
956	{	1067	{
		1068	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
		1069	if (object *pl = visible_to ())
		1070	esrv_del_item (pl->contr, count);
		1071	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1072
		1073	adjust_weight (env, -total_weight ());
		1074
		1075	*(above ? &above->below : &env->inv) = below;
		1076
957	if (nrof)	1077	if (below)
958	sub_weight (env, weight * nrof);	1078	below->above = above;
959	else	1079
960	sub_weight (env, weight + carrying);	1080	/* we set up values so that it could be inserted into
		1081	* the map, but we don't actually do that - it is up
		1082	* to the caller to decide what we want to do.
		1083	*/
		1084	map = env->map;
		1085	x = env->x;
		1086	y = env->y;
		1087	above = 0;
		1088	below = 0;
		1089	env = 0;
961		1090
962	/* NO_FIX_PLAYER is set when a great many changes are being	1091	/* NO_FIX_PLAYER is set when a great many changes are being
963	* made to players inventory. If set, avoiding the call	1092	* made to players inventory. If set, avoiding the call
964	* to save cpu time.	1093	* to save cpu time.
965	*/	1094	*/
966	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1095	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
967	otmp->update_stats ();	1096	otmp->update_stats ();
968
969	if (above != NULL)
970	above->below = below;
971	else
972	env->inv = below;
973
974	if (below != NULL)
975	below->above = above;
976
977	/* we set up values so that it could be inserted into
978	* the map, but we don't actually do that - it is up
979	* to the caller to decide what we want to do.
980	*/
981	x = env->x, y = env->y;
982	map = env->map;
983	above = 0, below = 0;
984	env = 0;
985	}	1097	}
986	else if (map)	1098	else if (map)
987	{	1099	{
988	/* Re did the following section of code - it looks like it had	1100	map->dirty = true;
989	* lots of logic for things we no longer care about	1101	mapspace &ms = this->ms ();
		1102
		1103	if (object *pl = ms.player ())
990	*/	1104	{
		1105	if (type == PLAYER) // this == pl(!)
		1106	{
		1107	// leaving a spot always closes any open container on the ground
		1108	if (container && !container->env)
		1109	// this causes spurious floorbox updates, but it ensures
		1110	// that the CLOSE event is being sent.
		1111	close_container ();
		1112
		1113	--map->players;
		1114	map->touch ();
		1115	}
		1116	else if (pl->container == this)
		1117	{
		1118	// removing a container should close it
		1119	close_container ();
		1120	}
		1121
		1122	esrv_del_item (pl->contr, count);
		1123	}
991		1124
992	/* link the object above us */	1125	/* link the object above us */
993	if (above)	1126	if (above)
994	above->below = below;	1127	above->below = below;
995	else	1128	else
996	map->at (x, y).top = below; /* we were top, set new top */	1129	ms.top = below; /* we were top, set new top */
997		1130
998	/* Relink the object below us, if there is one */	1131	/* Relink the object below us, if there is one */
999	if (below)	1132	if (below)
1000	below->above = above;	1133	below->above = above;
1001	else	1134	else
…		…
1003	/* Nothing below, which means we need to relink map object for this space	1136	/* Nothing below, which means we need to relink map object for this space
1004	* use translated coordinates in case some oddness with map tiling is	1137	* use translated coordinates in case some oddness with map tiling is
1005	* evident	1138	* evident
1006	*/	1139	*/
1007	if (GET_MAP_OB (map, x, y) != this)	1140	if (GET_MAP_OB (map, x, y) != this)
1008	{
1009	char *dump = dump_object (this);
1010	LOG (llevError,
1011	"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);	1141	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 ());
1012	free (dump);
1013	dump = dump_object (GET_MAP_OB (map, x, y));
1014	LOG (llevError, "%s\n", dump);
1015	free (dump);
1016	}
1017		1142
1018	map->at (x, y).bot = above; /* goes on above it. */	1143	ms.bot = above; /* goes on above it. */
1019	}	1144	}
1020		1145
1021	above = 0;	1146	above = 0;
1022	below = 0;	1147	below = 0;
1023		1148
1024	if (map->in_memory == MAP_SAVING)	1149	if (map->in_memory == MAP_SAVING)
1025	return;	1150	return;
1026		1151
1027	int check_walk_off = !flag [FLAG_NO_APPLY];	1152	int check_walk_off = !flag [FLAG_NO_APPLY];
1028		1153
		1154	if (object *pl = ms.player ())
		1155	{
		1156	if (pl->container == this)
		1157	/* If a container that the player is currently using somehow gets
		1158	* removed (most likely destroyed), update the player view
		1159	* appropriately.
		1160	*/
		1161	pl->close_container ();
		1162
		1163	//TODO: the floorbox prev/next might need updating
		1164	esrv_del_item (pl->contr, count);
		1165	}
		1166
1029	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1167	for (tmp = ms.bot; tmp; tmp = tmp->above)
1030	{	1168	{
1031	/* No point updating the players look faces if he is the object	1169	/* No point updating the players look faces if he is the object
1032	* being removed.	1170	* being removed.
1033	*/	1171	*/
1034		1172
1035	if (tmp->type == PLAYER && tmp != this)
1036	{
1037	/* If a container that the player is currently using somehow gets
1038	* removed (most likely destroyed), update the player view
1039	* appropriately.
1040	*/
1041	if (tmp->container == this)
1042	{
1043	flag [FLAG_APPLIED] = 0;
1044	tmp->container = 0;
1045	}
1046
1047	if (tmp->contr->ns)
1048	tmp->contr->ns->floorbox_update ();
1049	}
1050
1051	/* See if player moving off should effect something */	1173	/* See if object moving off should effect something */
1052	if (check_walk_off	1174	if (check_walk_off
1053	&& ((move_type & tmp->move_off)	1175	&& ((move_type & tmp->move_off)
1054	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1176	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1055	{	1177	{
1056	move_apply (tmp, this, 0);	1178	move_apply (tmp, this, 0);
1057		1179
1058	if (destroyed ())	1180	if (destroyed ())
1059	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1181	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1060	}	1182	}
1061		1183
1062	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1063
1064	if (tmp->above == tmp)
1065	tmp->above = 0;
1066
1067	last = tmp;	1184	last = tmp;
1068	}	1185	}
1069		1186
1070	/* last == NULL of there are no objects on this space */	1187	/* last == NULL if there are no objects on this space */
		1188	//TODO: this makes little sense, why only update the topmost object?
1071	if (!last)	1189	if (!last)
1072	map->at (x, y).flags_ = P_NEED_UPDATE;	1190	map->at (x, y).flags_ = 0;
1073	else	1191	else
1074	update_object (last, UP_OBJ_REMOVE);	1192	update_object (last, UP_OBJ_REMOVE);
1075		1193
1076	if (flag [FLAG_BLOCKSVIEW] || glow_radius)	1194	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1077	update_all_los (map, x, y);	1195	update_all_los (map, x, y);
…		…
1090	merge_ob (object *op, object *top)	1208	merge_ob (object *op, object *top)
1091	{	1209	{
1092	if (!op->nrof)	1210	if (!op->nrof)
1093	return 0;	1211	return 0;
1094		1212
1095	if (top)	1213	if (!top)
1096	for (top = op; top && top->above; top = top->above)	1214	for (top = op; top && top->above; top = top->above)
1097	;	1215	;
1098		1216
1099	for (; top; top = top->below)	1217	for (; top; top = top->below)
1100	{
1101	if (top == op)
1102	continue;
1103
1104	if (object::can_merge (op, top))	1218	if (object::can_merge (op, top))
1105	{	1219	{
1106	top->nrof += op->nrof;	1220	top->nrof += op->nrof;
1107		1221
1108	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1222	if (object *pl = top->visible_to ())
1109	op->weight = 0; /* Don't want any adjustements now */	1223	esrv_update_item (UPD_NROF, pl, top);
		1224
		1225	op->weight = 0; // cancel the addition above
		1226	op->carrying = 0; // must be 0 already
		1227
1110	op->destroy ();	1228	op->destroy (1);
		1229
1111	return top;	1230	return top;
1112	}	1231	}
1113	}
1114		1232
1115	return 0;	1233	return 0;
1116	}	1234	}
1117		1235
		1236	void
		1237	object::expand_tail ()
		1238	{
		1239	if (more)
		1240	return;
		1241
		1242	object *prev = this;
		1243
		1244	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1245	{
		1246	object *op = arch_to_object (at);
		1247
		1248	op->name = name;
		1249	op->name_pl = name_pl;
		1250	op->title = title;
		1251
		1252	op->head = this;
		1253	prev->more = op;
		1254
		1255	prev = op;
		1256	}
		1257	}
		1258
1118	/*	1259	/*
1119	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1260	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1120	* job preparing multi-part monsters	1261	* job preparing multi-part monsters.
1121	*/	1262	*/
1122	object *	1263	object *
1123	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1264	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1124	{	1265	{
1125	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1266	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1126	{	1267	{
1127	tmp->x = x + tmp->arch->clone.x;	1268	tmp->x = x + tmp->arch->x;
1128	tmp->y = y + tmp->arch->clone.y;	1269	tmp->y = y + tmp->arch->y;
1129	}	1270	}
1130		1271
1131	return insert_ob_in_map (op, m, originator, flag);	1272	return insert_ob_in_map (op, m, originator, flag);
1132	}	1273	}
1133		1274
…		…
1152	* just 'op' otherwise	1293	* just 'op' otherwise
1153	*/	1294	*/
1154	object *	1295	object *
1155	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1296	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1156	{	1297	{
1157	object *tmp, *top, *floor = NULL;	1298	assert (!op->flag [FLAG_FREED]);
1158	sint16 x, y;
1159		1299
1160	if (QUERY_FLAG (op, FLAG_FREED))	1300	op->remove ();
1161	{
1162	LOG (llevError, "Trying to insert freed object!\n");
1163	return NULL;
1164	}
1165
1166	if (m == NULL)
1167	{
1168	char *dump = dump_object (op);
1169	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1170	free (dump);
1171	return op;
1172	}
1173
1174	if (out_of_map (m, op->x, op->y))
1175	{
1176	char *dump = dump_object (op);
1177	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1178	#ifdef MANY_CORES
1179	/* Better to catch this here, as otherwise the next use of this object
1180	* is likely to cause a crash. Better to find out where it is getting
1181	* improperly inserted.
1182	*/
1183	abort ();
1184	#endif
1185	free (dump);
1186	return op;
1187	}
1188
1189	if (!QUERY_FLAG (op, FLAG_REMOVED))
1190	{
1191	char *dump = dump_object (op);
1192	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1193	free (dump);
1194	return op;
1195	}
1196
1197	if (op->more)
1198	{
1199	/* The part may be on a different map. */
1200
1201	object *more = op->more;
1202
1203	/* We really need the caller to normalize coordinates - if
1204	* we set the map, that doesn't work if the location is within
1205	* a map and this is straddling an edge. So only if coordinate
1206	* is clear wrong do we normalize it.
1207	*/
1208	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1209	more->map = get_map_from_coord (m, &more->x, &more->y);
1210	else if (!more->map)
1211	{
1212	/* For backwards compatibility - when not dealing with tiled maps,
1213	* more->map should always point to the parent.
1214	*/
1215	more->map = m;
1216	}
1217
1218	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1219	{
1220	if (!op->head)
1221	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1222
1223	return 0;
1224	}
1225	}
1226
1227	CLEAR_FLAG (op, FLAG_REMOVED);
1228		1301
1229	/* Ideally, the caller figures this out. However, it complicates a lot	1302	/* Ideally, the caller figures this out. However, it complicates a lot
1230	* of areas of callers (eg, anything that uses find_free_spot would now	1303	* of areas of callers (eg, anything that uses find_free_spot would now
1231	* need extra work	1304	* need extra work
1232	*/	1305	*/
1233	op->map = get_map_from_coord (m, &op->x, &op->y);	1306	if (!xy_normalise (m, op->x, op->y))
1234	x = op->x;	1307	{
1235	y = op->y;	1308	op->destroy (1);
		1309	return 0;
		1310	}
		1311
		1312	if (object *more = op->more)
		1313	if (!insert_ob_in_map (more, m, originator, flag))
		1314	return 0;
		1315
		1316	CLEAR_FLAG (op, FLAG_REMOVED);
		1317
		1318	op->map = m;
		1319	mapspace &ms = op->ms ();
1236		1320
1237	/* this has to be done after we translate the coordinates.	1321	/* this has to be done after we translate the coordinates.
1238	*/	1322	*/
1239	if (op->nrof && !(flag & INS_NO_MERGE))	1323	if (op->nrof && !(flag & INS_NO_MERGE))
1240	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1324	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1241	if (object::can_merge (op, tmp))	1325	if (object::can_merge (op, tmp))
1242	{	1326	{
		1327	// TODO: we atcually want to update tmp, not op,
		1328	// but some caller surely breaks when we return tmp
		1329	// from here :/
1243	op->nrof += tmp->nrof;	1330	op->nrof += tmp->nrof;
1244	tmp->destroy ();	1331	tmp->destroy (1);
1245	}	1332	}
1246		1333
1247	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1334	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1248	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1335	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1249		1336
…		…
1262	op->below = originator->below;	1349	op->below = originator->below;
1263		1350
1264	if (op->below)	1351	if (op->below)
1265	op->below->above = op;	1352	op->below->above = op;
1266	else	1353	else
1267	op->ms ().bot = op;	1354	ms.bot = op;
1268		1355
1269	/* since *below* originator, no need to update top */	1356	/* since *below* originator, no need to update top */
1270	originator->below = op;	1357	originator->below = op;
1271	}	1358	}
1272	else	1359	else
1273	{	1360	{
		1361	object *top, *floor = NULL;
		1362
		1363	top = ms.bot;
		1364
1274	/* If there are other objects, then */	1365	/* If there are other objects, then */
1275	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1366	if (top)
1276	{	1367	{
1277	object *last = NULL;	1368	object *last = 0;
1278		1369
1279	/*	1370	/*
1280	* If there are multiple objects on this space, we do some trickier handling.	1371	* If there are multiple objects on this space, we do some trickier handling.
1281	* We've already dealt with merging if appropriate.	1372	* We've already dealt with merging if appropriate.
1282	* Generally, we want to put the new object on top. But if	1373	* Generally, we want to put the new object on top. But if
…		…
1286	* once we get to them. This reduces the need to traverse over all of	1377	* once we get to them. This reduces the need to traverse over all of
1287	* them when adding another one - this saves quite a bit of cpu time	1378	* them when adding another one - this saves quite a bit of cpu time
1288	* when lots of spells are cast in one area. Currently, it is presumed	1379	* when lots of spells are cast in one area. Currently, it is presumed
1289	* that flying non pickable objects are spell objects.	1380	* that flying non pickable objects are spell objects.
1290	*/	1381	*/
1291		1382	for (top = ms.bot; top; top = top->above)
1292	while (top != NULL)
1293	{	1383	{
1294	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1384	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1295	floor = top;	1385	floor = top;
1296		1386
1297	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1387	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1300	top = top->below;	1390	top = top->below;
1301	break;	1391	break;
1302	}	1392	}
1303		1393
1304	last = top;	1394	last = top;
1305	top = top->above;
1306	}	1395	}
1307		1396
1308	/* Don't want top to be NULL, so set it to the last valid object */	1397	/* Don't want top to be NULL, so set it to the last valid object */
1309	top = last;	1398	top = last;
1310		1399
…		…
1312	* looks like instead of lots of conditions here.	1401	* looks like instead of lots of conditions here.
1313	* makes things faster, and effectively the same result.	1402	* makes things faster, and effectively the same result.
1314	*/	1403	*/
1315		1404
1316	/* Have object 'fall below' other objects that block view.	1405	/* Have object 'fall below' other objects that block view.
1317	* Unless those objects are exits, type 66	1406	* Unless those objects are exits.
1318	* If INS_ON_TOP is used, don't do this processing	1407	* If INS_ON_TOP is used, don't do this processing
1319	* Need to find the object that in fact blocks view, otherwise	1408	* Need to find the object that in fact blocks view, otherwise
1320	* stacking is a bit odd.	1409	* stacking is a bit odd.
1321	*/	1410	*/
1322	if (!(flag & INS_ON_TOP) &&	1411	if (!(flag & INS_ON_TOP)
1323	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1412	&& ms.flags () & P_BLOCKSVIEW
		1413	&& (op->face && !faces [op->face].visibility))
1324	{	1414	{
1325	for (last = top; last != floor; last = last->below)	1415	for (last = top; last != floor; last = last->below)
1326	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1416	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1327	break;	1417	break;
		1418
1328	/* Check to see if we found the object that blocks view,	1419	/* Check to see if we found the object that blocks view,
1329	* and make sure we have a below pointer for it so that	1420	* and make sure we have a below pointer for it so that
1330	* we can get inserted below this one, which requires we	1421	* we can get inserted below this one, which requires we
1331	* set top to the object below us.	1422	* set top to the object below us.
1332	*/	1423	*/
1333	if (last && last->below && last != floor)	1424	if (last && last->below && last != floor)
1334	top = last->below;	1425	top = last->below;
1335	}	1426	}
1336	} /* If objects on this space */	1427	} /* If objects on this space */
1337		1428
1338	if (flag & INS_MAP_LOAD)
1339	top = GET_MAP_TOP (op->map, op->x, op->y);
1340
1341	if (flag & INS_ABOVE_FLOOR_ONLY)	1429	if (flag & INS_ABOVE_FLOOR_ONLY)
1342	top = floor;	1430	top = floor;
1343		1431
1344	/* Top is the object that our object (op) is going to get inserted above.	1432	/* Top is the object that our object (op) is going to get inserted above.
1345	*/	1433	*/
1346		1434
1347	/* First object on this space */	1435	/* First object on this space */
1348	if (!top)	1436	if (!top)
1349	{	1437	{
1350	op->above = GET_MAP_OB (op->map, op->x, op->y);	1438	op->above = ms.bot;
1351		1439
1352	if (op->above)	1440	if (op->above)
1353	op->above->below = op;	1441	op->above->below = op;
1354		1442
1355	op->below = NULL;	1443	op->below = 0;
1356	op->ms ().bot = op;	1444	ms.bot = op;
1357	}	1445	}
1358	else	1446	else
1359	{ /* get inserted into the stack above top */	1447	{ /* get inserted into the stack above top */
1360	op->above = top->above;	1448	op->above = top->above;
1361		1449
…		…
1364		1452
1365	op->below = top;	1453	op->below = top;
1366	top->above = op;	1454	top->above = op;
1367	}	1455	}
1368		1456
1369	if (op->above == NULL)	1457	if (!op->above)
1370	op->ms ().top = op;	1458	ms.top = op;
1371	} /* else not INS_BELOW_ORIGINATOR */	1459	} /* else not INS_BELOW_ORIGINATOR */
1372		1460
1373	if (op->type == PLAYER)	1461	if (op->type == PLAYER)
		1462	{
1374	op->contr->do_los = 1;	1463	op->contr->do_los = 1;
		1464	++op->map->players;
		1465	op->map->touch ();
		1466	}
1375		1467
1376	/* If we have a floor, we know the player, if any, will be above	1468	op->map->dirty = true;
1377	* it, so save a few ticks and start from there.	1469
1378	*/
1379	if (!(flag & INS_MAP_LOAD))
1380	if (object *pl = op->ms ().player ())	1470	if (object *pl = ms.player ())
1381	if (pl->contr->ns)	1471	//TODO: the floorbox prev/next might need updating
1382	pl->contr->ns->floorbox_update ();	1472	esrv_send_item (pl, op);
1383		1473
1384	/* If this object glows, it may affect lighting conditions that are	1474	/* If this object glows, it may affect lighting conditions that are
1385	* visible to others on this map. But update_all_los is really	1475	* visible to others on this map. But update_all_los is really
1386	* an inefficient way to do this, as it means los for all players	1476	* an inefficient way to do this, as it means los for all players
1387	* on the map will get recalculated. The players could very well	1477	* on the map will get recalculated. The players could very well
1388	* be far away from this change and not affected in any way -	1478	* be far away from this change and not affected in any way -
1389	* this should get redone to only look for players within range,	1479	* this should get redone to only look for players within range,
1390	* or just updating the P_NEED_UPDATE for spaces within this area	1480	* or just updating the P_UPTODATE for spaces within this area
1391	* of effect may be sufficient.	1481	* of effect may be sufficient.
1392	*/	1482	*/
1393	if (op->map->darkness && (op->glow_radius != 0))	1483	if (op->map->darkness && (op->glow_radius != 0))
1394	update_all_los (op->map, op->x, op->y);	1484	update_all_los (op->map, op->x, op->y);
1395		1485
…		…
1406	* blocked() and wall() work properly), and these flags are updated by	1496	* blocked() and wall() work properly), and these flags are updated by
1407	* update_object().	1497	* update_object().
1408	*/	1498	*/
1409		1499
1410	/* if this is not the head or flag has been passed, don't check walk on status */	1500	/* if this is not the head or flag has been passed, don't check walk on status */
1411	if (!(flag & INS_NO_WALK_ON) && !op->head)	1501	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1412	{	1502	{
1413	if (check_move_on (op, originator))	1503	if (check_move_on (op, originator))
1414	return 0;	1504	return 0;
1415		1505
1416	/* If we are a multi part object, lets work our way through the check	1506	/* If we are a multi part object, lets work our way through the check
1417	* walk on's.	1507	* walk on's.
1418	*/	1508	*/
1419	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1509	for (object *tmp = op->more; tmp; tmp = tmp->more)
1420	if (check_move_on (tmp, originator))	1510	if (check_move_on (tmp, originator))
1421	return 0;	1511	return 0;
1422	}	1512	}
1423		1513
1424	return op;	1514	return op;
…		…
1429	* op is the object to insert it under: supplies x and the map.	1519	* op is the object to insert it under: supplies x and the map.
1430	*/	1520	*/
1431	void	1521	void
1432	replace_insert_ob_in_map (const char *arch_string, object *op)	1522	replace_insert_ob_in_map (const char *arch_string, object *op)
1433	{	1523	{
1434	object *tmp, *tmp1;
1435
1436	/* first search for itself and remove any old instances */	1524	/* first search for itself and remove any old instances */
1437		1525
1438	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1526	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1439	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1527	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1440	tmp->destroy ();	1528	tmp->destroy (1);
1441		1529
1442	tmp1 = arch_to_object (archetype::find (arch_string));	1530	object *tmp = arch_to_object (archetype::find (arch_string));
1443		1531
1444	tmp1->x = op->x;	1532	tmp->x = op->x;
1445	tmp1->y = op->y;	1533	tmp->y = op->y;
		1534
1446	insert_ob_in_map (tmp1, op->map, op, 0);	1535	insert_ob_in_map (tmp, op->map, op, 0);
1447	}	1536	}
1448		1537
1449	object *	1538	object *
1450	object::insert_at (object *where, object *originator, int flags)	1539	object::insert_at (object *where, object *originator, int flags)
1451	{	1540	{
		1541	if (where->env)
		1542	return where->env->insert (this);
		1543	else
1452	where->map->insert (this, where->x, where->y, originator, flags);	1544	return where->map->insert (this, where->x, where->y, originator, flags);
1453	}	1545	}
1454		1546
1455	/*	1547	/*
1456	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1457	* is returned contains nr objects, and the remaining parts contains
1458	* the rest (or is removed and freed if that number is 0).
1459	* On failure, NULL is returned, and the reason put into the
1460	* global static errmsg array.
1461	*/
1462	object *
1463	get_split_ob (object *orig_ob, uint32 nr)
1464	{
1465	object *newob;
1466	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1467
1468	if (orig_ob->nrof < nr)
1469	{
1470	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1471	return NULL;
1472	}
1473
1474	newob = object_create_clone (orig_ob);
1475
1476	if ((orig_ob->nrof -= nr) < 1)
1477	orig_ob->destroy (1);
1478	else if (!is_removed)
1479	{
1480	if (orig_ob->env != NULL)
1481	sub_weight (orig_ob->env, orig_ob->weight * nr);
1482	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1483	{
1484	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1485	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1486	return NULL;
1487	}
1488	}
1489
1490	newob->nrof = nr;
1491
1492	return newob;
1493	}
1494
1495	/*
1496	* decrease_ob_nr(object, number) decreases a specified number from	1548	* decrease(object, number) decreases a specified number from
1497	* the amount of an object. If the amount reaches 0, the object	1549	* the amount of an object. If the amount reaches 0, the object
1498	* is subsequently removed and freed.	1550	* is subsequently removed and freed.
1499	*	1551	*
1500	* Return value: 'op' if something is left, NULL if the amount reached 0	1552	* Return value: 'op' if something is left, NULL if the amount reached 0
1501	*/	1553	*/
		1554	bool
		1555	object::decrease (sint32 nr)
		1556	{
		1557	if (!nr)
		1558	return true;
1502		1559
		1560	nr = min (nr, nrof);
		1561
		1562	nrof -= nr;
		1563
		1564	if (nrof)
		1565	{
		1566	adjust_weight (env, -weight * nr); // carrying == 0
		1567
		1568	if (object *pl = visible_to ())
		1569	esrv_update_item (UPD_NROF, pl, this);
		1570
		1571	return true;
		1572	}
		1573	else
		1574	{
		1575	destroy (1);
		1576	return false;
		1577	}
		1578	}
		1579
		1580	/*
		1581	* split(ob,nr) splits up ob into two parts. The part which
		1582	* is returned contains nr objects, and the remaining parts contains
		1583	* the rest (or is removed and returned if that number is 0).
		1584	* On failure, NULL is returned.
		1585	*/
1503	object *	1586	object *
1504	decrease_ob_nr (object *op, uint32 i)	1587	object::split (sint32 nr)
1505	{	1588	{
1506	object *tmp;	1589	int have = number_of ();
1507		1590
1508	if (i == 0) /* objects with op->nrof require this check */	1591	if (have < nr)
1509	return op;	1592	return 0;
1510		1593	else if (have == nr)
1511	if (i > op->nrof)
1512	i = op->nrof;
1513
1514	if (QUERY_FLAG (op, FLAG_REMOVED))
1515	op->nrof -= i;
1516	else if (op->env)
1517	{	1594	{
1518	/* is this object in the players inventory, or sub container
1519	* therein?
1520	*/
1521	tmp = op->in_player ();
1522	/* nope. Is this a container the player has opened?
1523	* If so, set tmp to that player.
1524	* IMO, searching through all the players will mostly
1525	* likely be quicker than following op->env to the map,
1526	* and then searching the map for a player.
1527	*/
1528	if (!tmp)
1529	for_all_players (pl)
1530	if (pl->ob->container == op->env)
1531	{
1532	tmp = pl->ob;
1533	break;
1534	}
1535
1536	if (i < op->nrof)
1537	{
1538	sub_weight (op->env, op->weight * i);
1539	op->nrof -= i;
1540	if (tmp)
1541	esrv_send_item (tmp, op);
1542	}
1543	else
1544	{
1545	op->remove ();	1595	remove ();
1546	op->nrof = 0;	1596	return this;
1547	if (tmp)
1548	esrv_del_item (tmp->contr, op->count);
1549	}
1550	}	1597	}
1551	else	1598	else
1552	{	1599	{
1553	object *above = op->above;	1600	decrease (nr);
1554		1601
1555	if (i < op->nrof)	1602	object *op = object_create_clone (this);
1556	op->nrof -= i;	1603	op->nrof = nr;
1557	else
1558	{
1559	op->remove ();
1560	op->nrof = 0;
1561	}
1562
1563	/* Since we just removed op, op->above is null */
1564	for (tmp = above; tmp; tmp = tmp->above)
1565	if (tmp->type == PLAYER)
1566	{
1567	if (op->nrof)
1568	esrv_send_item (tmp, op);
1569	else
1570	esrv_del_item (tmp->contr, op->count);
1571	}
1572	}
1573
1574	if (op->nrof)
1575	return op;	1604	return op;
1576	else
1577	{
1578	op->destroy ();
1579	return 0;
1580	}
1581	}
1582
1583	/*
1584	* add_weight(object, weight) adds the specified weight to an object,
1585	* and also updates how much the environment(s) is/are carrying.
1586	*/
1587
1588	void
1589	add_weight (object *op, signed long weight)
1590	{
1591	while (op != NULL)
1592	{
1593	if (op->type == CONTAINER)
1594	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1595
1596	op->carrying += weight;
1597	op = op->env;
1598	}	1605	}
1599	}	1606	}
1600		1607
1601	object *	1608	object *
1602	insert_ob_in_ob (object *op, object *where)	1609	insert_ob_in_ob (object *op, object *where)
…		…
1607	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1614	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1608	free (dump);	1615	free (dump);
1609	return op;	1616	return op;
1610	}	1617	}
1611		1618
1612	if (where->head)	1619	if (where->head_ () != where)
1613	{	1620	{
1614	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1621	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1615	where = where->head;	1622	where = where->head;
1616	}	1623	}
1617		1624
1618	return where->insert (op);	1625	return where->insert (op);
1619	}	1626	}
…		…
1624	* inside the object environment.	1631	* inside the object environment.
1625	*	1632	*
1626	* The function returns now pointer to inserted item, and return value can	1633	* The function returns now pointer to inserted item, and return value can
1627	* be != op, if items are merged. -Tero	1634	* be != op, if items are merged. -Tero
1628	*/	1635	*/
1629
1630	object *	1636	object *
1631	object::insert (object *op)	1637	object::insert (object *op)
1632	{	1638	{
1633	object *tmp, *otmp;
1634
1635	if (!QUERY_FLAG (op, FLAG_REMOVED))
1636	op->remove ();
1637
1638	if (op->more)	1639	if (op->more)
1639	{	1640	{
1640	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1641	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1641	return op;	1642	return op;
1642	}	1643	}
1643		1644
1644	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1645	op->remove ();
1645	CLEAR_FLAG (op, FLAG_REMOVED);	1646
		1647	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1648
1646	if (op->nrof)	1649	if (op->nrof)
1647	{
1648	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1650	for (object *tmp = inv; tmp; tmp = tmp->below)
1649	if (object::can_merge (tmp, op))	1651	if (object::can_merge (tmp, op))
1650	{	1652	{
1651	/* return the original object and remove inserted object	1653	/* return the original object and remove inserted object
1652	(client needs the original object) */	1654	(client needs the original object) */
1653	tmp->nrof += op->nrof;	1655	tmp->nrof += op->nrof;
1654	/* Weight handling gets pretty funky. Since we are adding to	1656
1655	* tmp->nrof, we need to increase the weight.	1657	if (object *pl = tmp->visible_to ())
1656	*/	1658	esrv_update_item (UPD_NROF, pl, tmp);
		1659
1657	add_weight (this, op->weight * op->nrof);	1660	adjust_weight (this, op->total_weight ());
1658	SET_FLAG (op, FLAG_REMOVED);	1661
1659	op->destroy (); /* free the inserted object */	1662	op->destroy (1);
1660	op = tmp;	1663	op = tmp;
1661	op->remove (); /* and fix old object's links */	1664	goto inserted;
1662	CLEAR_FLAG (op, FLAG_REMOVED);
1663	break;
1664	}	1665	}
1665		1666
1666	/* I assume combined objects have no inventory	1667	op->owner = 0; // it's his/hers now. period.
1667	* We add the weight - this object could have just been removed
1668	* (if it was possible to merge). calling remove_ob will subtract
1669	* the weight, so we need to add it in again, since we actually do
1670	* the linking below
1671	*/
1672	add_weight (this, op->weight * op->nrof);
1673	}
1674	else
1675	add_weight (this, (op->weight + op->carrying));
1676
1677	otmp = this->in_player ();
1678	if (otmp && otmp->contr)
1679	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1680	otmp->update_stats ();
1681
1682	op->map = 0;	1668	op->map = 0;
1683	op->env = this;	1669	op->x = 0;
		1670	op->y = 0;
		1671
1684	op->above = 0;	1672	op->above = 0;
1685	op->below = 0;	1673	op->below = inv;
1686	op->x = 0, op->y = 0;	1674	op->env = this;
1687		1675
		1676	if (inv)
		1677	inv->above = op;
		1678
		1679	inv = op;
		1680
		1681	op->flag [FLAG_REMOVED] = 0;
		1682
		1683	if (object *pl = op->visible_to ())
		1684	esrv_send_item (pl, op);
		1685
		1686	adjust_weight (this, op->total_weight ());
		1687
		1688	inserted:
1688	/* reset the light list and los of the players on the map */	1689	/* reset the light list and los of the players on the map */
1689	if ((op->glow_radius != 0) && map)	1690	if (op->glow_radius && map && map->darkness)
1690	{
1691	#ifdef DEBUG_LIGHTS
1692	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1693	#endif /* DEBUG_LIGHTS */
1694	if (map->darkness)
1695	update_all_los (map, x, y);	1691	update_all_los (map, x, y);
1696	}
1697		1692
1698	/* Client has no idea of ordering so lets not bother ordering it here.	1693	// if this is a player's inventory, update stats
1699	* It sure simplifies this function...	1694	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1700	*/	1695	update_stats ();
1701	if (!inv)
1702	inv = op;
1703	else
1704	{
1705	op->below = inv;
1706	op->below->above = op;
1707	inv = op;
1708	}
1709		1696
1710	INVOKE_OBJECT (INSERT, this);	1697	INVOKE_OBJECT (INSERT, this);
1711		1698
1712	return op;	1699	return op;
1713	}	1700	}
…		…
1766		1753
1767	/* The objects have to be checked from top to bottom.	1754	/* The objects have to be checked from top to bottom.
1768	* Hence, we first go to the top:	1755	* Hence, we first go to the top:
1769	*/	1756	*/
1770		1757
1771	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above)	1758	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1772	{	1759	{
1773	/* Trim the search when we find the first other spell effect	1760	/* Trim the search when we find the first other spell effect
1774	* this helps performance so that if a space has 50 spell objects,	1761	* this helps performance so that if a space has 50 spell objects,
1775	* we don't need to check all of them.	1762	* we don't need to check all of them.
1776	*/	1763	*/
…		…
1794	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1781	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1795	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1782	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1796	{	1783	{
1797		1784
1798	float	1785	float
1799	diff = tmp->move_slow_penalty * FABS (op->speed);	1786	diff = tmp->move_slow_penalty * fabs (op->speed);
1800		1787
1801	if (op->type == PLAYER)	1788	if (op->type == PLAYER)
1802	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1789	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1803	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1790	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1804	diff /= 4.0;	1791	diff /= 4.0;
…		…
1834	* The first matching object is returned, or NULL if none.	1821	* The first matching object is returned, or NULL if none.
1835	*/	1822	*/
1836	object *	1823	object *
1837	present_arch (const archetype *at, maptile *m, int x, int y)	1824	present_arch (const archetype *at, maptile *m, int x, int y)
1838	{	1825	{
1839	if (m == NULL || out_of_map (m, x, y))	1826	if (!m || out_of_map (m, x, y))
1840	{	1827	{
1841	LOG (llevError, "Present_arch called outside map.\n");	1828	LOG (llevError, "Present_arch called outside map.\n");
1842	return NULL;	1829	return NULL;
1843	}	1830	}
1844		1831
1845	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1832	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1846	if (tmp->arch == at)	1833	if (tmp->arch == at)
1847	return tmp;	1834	return tmp;
1848		1835
1849	return NULL;	1836	return NULL;
1850	}	1837	}
…		…
1861	{	1848	{
1862	LOG (llevError, "Present called outside map.\n");	1849	LOG (llevError, "Present called outside map.\n");
1863	return NULL;	1850	return NULL;
1864	}	1851	}
1865		1852
1866	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1853	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1867	if (tmp->type == type)	1854	if (tmp->type == type)
1868	return tmp;	1855	return tmp;
1869		1856
1870	return NULL;	1857	return NULL;
1871	}	1858	}
…		…
1928	* activate recursively a flag on an object inventory	1915	* activate recursively a flag on an object inventory
1929	*/	1916	*/
1930	void	1917	void
1931	flag_inv (object *op, int flag)	1918	flag_inv (object *op, int flag)
1932	{	1919	{
1933	if (op->inv)
1934	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1920	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1935	{	1921	{
1936	SET_FLAG (tmp, flag);	1922	SET_FLAG (tmp, flag);
1937	flag_inv (tmp, flag);	1923	flag_inv (tmp, flag);
1938	}	1924	}
1939	}	1925	}
1940		1926
1941	/*	1927	/*
1942	* deactivate recursively a flag on an object inventory	1928	* deactivate recursively a flag on an object inventory
1943	*/	1929	*/
1944	void	1930	void
1945	unflag_inv (object *op, int flag)	1931	unflag_inv (object *op, int flag)
1946	{	1932	{
1947	if (op->inv)
1948	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1933	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1949	{	1934	{
1950	CLEAR_FLAG (tmp, flag);	1935	CLEAR_FLAG (tmp, flag);
1951	unflag_inv (tmp, flag);	1936	unflag_inv (tmp, flag);
1952	}	1937	}
1953	}
1954
1955	/*
1956	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1957	* all it's inventory (recursively).
1958	* If checksums are used, a player will get set_cheat called for
1959	* him/her-self and all object carried by a call to this function.
1960	*/
1961	void
1962	set_cheat (object *op)
1963	{
1964	SET_FLAG (op, FLAG_WAS_WIZ);
1965	flag_inv (op, FLAG_WAS_WIZ);
1966	}	1938	}
1967		1939
1968	/*	1940	/*
1969	* find_free_spot(object, map, x, y, start, stop) will search for	1941	* find_free_spot(object, map, x, y, start, stop) will search for
1970	* a spot at the given map and coordinates which will be able to contain	1942	* a spot at the given map and coordinates which will be able to contain
…		…
1972	* to search (see the freearr_x/y[] definition).	1944	* to search (see the freearr_x/y[] definition).
1973	* It returns a random choice among the alternatives found.	1945	* It returns a random choice among the alternatives found.
1974	* start and stop are where to start relative to the free_arr array (1,9	1946	* start and stop are where to start relative to the free_arr array (1,9
1975	* does all 4 immediate directions). This returns the index into the	1947	* does all 4 immediate directions). This returns the index into the
1976	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1948	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1977	* Note - this only checks to see if there is space for the head of the
1978	* object - if it is a multispace object, this should be called for all
1979	* pieces.
1980	* Note2: This function does correctly handle tiled maps, but does not	1949	* Note: This function does correctly handle tiled maps, but does not
1981	* inform the caller. However, insert_ob_in_map will update as	1950	* inform the caller. However, insert_ob_in_map will update as
1982	* necessary, so the caller shouldn't need to do any special work.	1951	* necessary, so the caller shouldn't need to do any special work.
1983	* Note - updated to take an object instead of archetype - this is necessary	1952	* Note - updated to take an object instead of archetype - this is necessary
1984	* because arch_blocked (now ob_blocked) needs to know the movement type	1953	* because arch_blocked (now ob_blocked) needs to know the movement type
1985	* to know if the space in question will block the object. We can't use	1954	* to know if the space in question will block the object. We can't use
…		…
1987	* customized, changed states, etc.	1956	* customized, changed states, etc.
1988	*/	1957	*/
1989	int	1958	int
1990	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1959	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
1991	{	1960	{
		1961	int altern[SIZEOFFREE];
1992	int index = 0, flag;	1962	int index = 0, flag;
1993	int altern[SIZEOFFREE];
1994		1963
1995	for (int i = start; i < stop; i++)	1964	for (int i = start; i < stop; i++)
1996	{	1965	{
1997	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1966	mapxy pos (m, x, y); pos.move (i);
1998	if (!flag)	1967
		1968	if (!pos.normalise ())
		1969	continue;
		1970
		1971	mapspace &ms = *pos;
		1972
		1973	if (ms.flags () & P_IS_ALIVE)
		1974	continue;
		1975
		1976	/* However, often
		1977	* ob doesn't have any move type (when used to place exits)
		1978	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1979	*/
		1980	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1981	{
1999	altern [index++] = i;	1982	altern [index++] = i;
		1983	continue;
		1984	}
2000		1985
2001	/* Basically, if we find a wall on a space, we cut down the search size.	1986	/* Basically, if we find a wall on a space, we cut down the search size.
2002	* In this way, we won't return spaces that are on another side of a wall.	1987	* In this way, we won't return spaces that are on another side of a wall.
2003	* This mostly work, but it cuts down the search size in all directions -	1988	* This mostly work, but it cuts down the search size in all directions -
2004	* if the space being examined only has a wall to the north and empty	1989	* if the space being examined only has a wall to the north and empty
2005	* spaces in all the other directions, this will reduce the search space	1990	* spaces in all the other directions, this will reduce the search space
2006	* to only the spaces immediately surrounding the target area, and	1991	* to only the spaces immediately surrounding the target area, and
2007	* won't look 2 spaces south of the target space.	1992	* won't look 2 spaces south of the target space.
2008	*/	1993	*/
2009	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1994	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1995	{
2010	stop = maxfree[i];	1996	stop = maxfree[i];
		1997	continue;
		1998	}
		1999
		2000	/* Note it is intentional that we check ob - the movement type of the
		2001	* head of the object should correspond for the entire object.
		2002	*/
		2003	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2004	continue;
		2005
		2006	if (ob->blocked (m, pos.x, pos.y))
		2007	continue;
		2008
		2009	altern [index++] = i;
2011	}	2010	}
2012		2011
2013	if (!index)	2012	if (!index)
2014	return -1;	2013	return -1;
2015		2014
2016	return altern[RANDOM () % index];	2015	return altern [rndm (index)];
2017	}	2016	}
2018		2017
2019	/*	2018	/*
2020	* find_first_free_spot(archetype, maptile, x, y) works like	2019	* find_first_free_spot(archetype, maptile, x, y) works like
2021	* find_free_spot(), but it will search max number of squares.	2020	* find_free_spot(), but it will search max number of squares.
…		…
2024	*/	2023	*/
2025	int	2024	int
2026	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2025	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2027	{	2026	{
2028	for (int i = 0; i < SIZEOFFREE; i++)	2027	for (int i = 0; i < SIZEOFFREE; i++)
2029	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2028	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2030	return i;	2029	return i;
2031		2030
2032	return -1;	2031	return -1;
2033	}	2032	}
2034		2033
…		…
2042	{	2041	{
2043	arr += begin;	2042	arr += begin;
2044	end -= begin;	2043	end -= begin;
2045		2044
2046	while (--end)	2045	while (--end)
2047	swap (arr [end], arr [RANDOM () % (end + 1)]);	2046	swap (arr [end], arr [rndm (end + 1)]);
2048	}	2047	}
2049		2048
2050	/* new function to make monster searching more efficient, and effective!	2049	/* new function to make monster searching more efficient, and effective!
2051	* This basically returns a randomized array (in the passed pointer) of	2050	* This basically returns a randomized array (in the passed pointer) of
2052	* the spaces to find monsters. In this way, it won't always look for	2051	* the spaces to find monsters. In this way, it won't always look for
…		…
2088	object *tmp;	2087	object *tmp;
2089	maptile *mp;	2088	maptile *mp;
2090		2089
2091	MoveType blocked, move_type;	2090	MoveType blocked, move_type;
2092		2091
2093	if (exclude && exclude->head)	2092	if (exclude && exclude->head_ () != exclude)
2094	{	2093	{
2095	exclude = exclude->head;	2094	exclude = exclude->head;
2096	move_type = exclude->move_type;	2095	move_type = exclude->move_type;
2097	}	2096	}
2098	else	2097	else
…		…
2121	max = maxfree[i];	2120	max = maxfree[i];
2122	else if (mflags & P_IS_ALIVE)	2121	else if (mflags & P_IS_ALIVE)
2123	{	2122	{
2124	for (tmp = ms.bot; tmp; tmp = tmp->above)	2123	for (tmp = ms.bot; tmp; tmp = tmp->above)
2125	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2124	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2126	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2125	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2127	break;	2126	break;
2128		2127
2129	if (tmp)	2128	if (tmp)
2130	return freedir[i];	2129	return freedir[i];
2131	}	2130	}
…		…
2186		2185
2187	return 3;	2186	return 3;
2188	}	2187	}
2189		2188
2190	/*	2189	/*
2191	* absdir(int): Returns a number between 1 and 8, which represent
2192	* the "absolute" direction of a number (it actually takes care of
2193	* "overflow" in previous calculations of a direction).
2194	*/
2195
2196	int
2197	absdir (int d)
2198	{
2199	while (d < 1)
2200	d += 8;
2201
2202	while (d > 8)
2203	d -= 8;
2204
2205	return d;
2206	}
2207
2208	/*
2209	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2190	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2210	* between two directions (which are expected to be absolute (see absdir())	2191	* between two directions (which are expected to be absolute (see absdir())
2211	*/	2192	*/
2212
2213	int	2193	int
2214	dirdiff (int dir1, int dir2)	2194	dirdiff (int dir1, int dir2)
2215	{	2195	{
2216	int d;	2196	int d;
2217		2197
…		…
2330	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2310	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2331	* core dumps if they do.	2311	* core dumps if they do.
2332	*	2312	*
2333	* Add a check so we can't pick up invisible objects (0.93.8)	2313	* Add a check so we can't pick up invisible objects (0.93.8)
2334	*/	2314	*/
2335
2336	int	2315	int
2337	can_pick (const object *who, const object *item)	2316	can_pick (const object *who, const object *item)
2338	{	2317	{
2339	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2318	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2340	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2319	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2345	* create clone from object to another	2324	* create clone from object to another
2346	*/	2325	*/
2347	object *	2326	object *
2348	object_create_clone (object *asrc)	2327	object_create_clone (object *asrc)
2349	{	2328	{
2350	object *dst = 0, *tmp, *src, *part, *prev, *item;	2329	object *dst = 0;
2351		2330
2352	if (!asrc)	2331	if (!asrc)
2353	return 0;	2332	return 0;
2354		2333
2355	src = asrc;	2334	object *src = asrc->head_ ();
2356	if (src->head)
2357	src = src->head;
2358		2335
2359	prev = 0;	2336	object *prev = 0;
2360	for (part = src; part; part = part->more)	2337	for (object *part = src; part; part = part->more)
2361	{	2338	{
2362	tmp = part->clone ();	2339	object *tmp = part->clone ();
		2340
2363	tmp->x -= src->x;	2341	tmp->x -= src->x;
2364	tmp->y -= src->y;	2342	tmp->y -= src->y;
2365		2343
2366	if (!part->head)	2344	if (!part->head)
2367	{	2345	{
…		…
2377	prev->more = tmp;	2355	prev->more = tmp;
2378		2356
2379	prev = tmp;	2357	prev = tmp;
2380	}	2358	}
2381		2359
2382	for (item = src->inv; item; item = item->below)	2360	for (object *item = src->inv; item; item = item->below)
2383	insert_ob_in_ob (object_create_clone (item), dst);	2361	insert_ob_in_ob (object_create_clone (item), dst);
2384		2362
2385	return dst;	2363	return dst;
2386	}
2387
2388	/* GROS - Creates an object using a string representing its content. */
2389	/* Basically, we save the content of the string to a temp file, then call */
2390	/* load_object on it. I admit it is a highly inefficient way to make things, */
2391	/* but it was simple to make and allows reusing the load_object function. */
2392	/* Remember not to use load_object_str in a time-critical situation. */
2393	/* Also remember that multiparts objects are not supported for now. */
2394	object *
2395	load_object_str (const char *obstr)
2396	{
2397	object *op;
2398	char filename[MAX_BUF];
2399
2400	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2401
2402	FILE *tempfile = fopen (filename, "w");
2403
2404	if (tempfile == NULL)
2405	{
2406	LOG (llevError, "Error - Unable to access load object temp file\n");
2407	return NULL;
2408	}
2409
2410	fprintf (tempfile, obstr);
2411	fclose (tempfile);
2412
2413	op = object::create ();
2414
2415	object_thawer thawer (filename);
2416
2417	if (thawer)
2418	load_object (thawer, op, 0);
2419
2420	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2421	CLEAR_FLAG (op, FLAG_REMOVED);
2422
2423	return op;
2424	}	2364	}
2425		2365
2426	/* This returns the first object in who's inventory that	2366	/* This returns the first object in who's inventory that
2427	* has the same type and subtype match.	2367	* has the same type and subtype match.
2428	* returns NULL if no match.	2368	* returns NULL if no match.
…		…
2483	if (link->key == canonical_key)	2423	if (link->key == canonical_key)
2484	return link->value;	2424	return link->value;
2485		2425
2486	return 0;	2426	return 0;
2487	}	2427	}
2488
2489		2428
2490	/*	2429	/*
2491	* Updates the canonical_key in op to value.	2430	* Updates the canonical_key in op to value.
2492	*	2431	*
2493	* canonical_key is a shared string (value doesn't have to be).	2432	* canonical_key is a shared string (value doesn't have to be).
…		…
2517	/* Basically, if the archetype has this key set,	2456	/* Basically, if the archetype has this key set,
2518	* we need to store the null value so when we save	2457	* we need to store the null value so when we save
2519	* it, we save the empty value so that when we load,	2458	* it, we save the empty value so that when we load,
2520	* we get this value back again.	2459	* we get this value back again.
2521	*/	2460	*/
2522	if (get_ob_key_link (&op->arch->clone, canonical_key))	2461	if (get_ob_key_link (op->arch, canonical_key))
2523	field->value = 0;	2462	field->value = 0;
2524	else	2463	else
2525	{	2464	{
2526	if (last)	2465	if (last)
2527	last->next = field->next;	2466	last->next = field->next;
…		…
2596	}	2535	}
2597	else	2536	else
2598	item = item->env;	2537	item = item->env;
2599	}	2538	}
2600		2539
		2540	const char *
		2541	object::flag_desc (char *desc, int len) const
		2542	{
		2543	char *p = desc;
		2544	bool first = true;
		2545
		2546	*p = 0;
		2547
		2548	for (int i = 0; i < NUM_FLAGS; i++)
		2549	{
		2550	if (len <= 10) // magic constant!
		2551	{
		2552	snprintf (p, len, ",...");
		2553	break;
		2554	}
		2555
		2556	if (flag [i])
		2557	{
		2558	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2559	len -= cnt;
		2560	p += cnt;
		2561	first = false;
		2562	}
		2563	}
		2564
		2565	return desc;
		2566	}
		2567
2601	// return a suitable string describing an objetc in enough detail to find it	2568	// return a suitable string describing an object in enough detail to find it
2602	const char *	2569	const char *
2603	object::debug_desc (char *info) const	2570	object::debug_desc (char *info) const
2604	{	2571	{
		2572	char flagdesc[512];
2605	char info2[256 * 3];	2573	char info2[256 * 4];
2606	char *p = info;	2574	char *p = info;
2607		2575
2608	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2576	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2609	count,	2577	count,
		2578	uuid.c_str (),
2610	&name,	2579	&name,
2611	title ? " " : "",	2580	title ? "\",title:\"" : "",
2612	title ? (const char *)title : "");	2581	title ? (const char *)title : "",
		2582	flag_desc (flagdesc, 512), type);
2613		2583
2614	if (env)	2584	if (!flag[FLAG_REMOVED] && env)
2615	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2585	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2616		2586
2617	if (map)	2587	if (map)
2618	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2588	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2619		2589
2620	return info;	2590	return info;
2621	}	2591	}
2622		2592
2623	const char *	2593	const char *
2624	object::debug_desc () const	2594	object::debug_desc () const
2625	{	2595	{
2626	static char info[256 * 3];	2596	static char info[3][256 * 4];
		2597	static int info_idx;
		2598
2627	return debug_desc (info);	2599	return debug_desc (info [++info_idx % 3]);
2628	}	2600	}
2629		2601
		2602	struct region *
		2603	object::region () const
		2604	{
		2605	return map ? map->region (x, y)
		2606	: region::default_region ();
		2607	}
		2608
		2609	const materialtype_t *
		2610	object::dominant_material () const
		2611	{
		2612	if (materialtype_t *mt = name_to_material (materialname))
		2613	return mt;
		2614
		2615	return name_to_material (shstr_unknown);
		2616	}
		2617
		2618	void
		2619	object::open_container (object *new_container)
		2620	{
		2621	if (container == new_container)
		2622	return;
		2623
		2624	object *old_container = container;
		2625
		2626	if (old_container)
		2627	{
		2628	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2629	return;
		2630
		2631	#if 0
		2632	// remove the "Close old_container" object.
		2633	if (object *closer = old_container->inv)
		2634	if (closer->type == CLOSE_CON)
		2635	closer->destroy ();
		2636	#endif
		2637
		2638	// make sure the container is available
		2639	esrv_send_item (this, old_container);
		2640
		2641	old_container->flag [FLAG_APPLIED] = false;
		2642	container = 0;
		2643
		2644	// client needs item update to make it work, client bug requires this to be separate
		2645	esrv_update_item (UPD_FLAGS, this, old_container);
		2646
		2647	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2648	play_sound (sound_find ("chest_close"));
		2649	}
		2650
		2651	if (new_container)
		2652	{
		2653	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2654	return;
		2655
		2656	// TODO: this does not seem to serve any purpose anymore?
		2657	#if 0
		2658	// insert the "Close Container" object.
		2659	if (archetype *closer = new_container->other_arch)
		2660	{
		2661	object *closer = arch_to_object (new_container->other_arch);
		2662	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2663	new_container->insert (closer);
		2664	}
		2665	#endif
		2666
		2667	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2668
		2669	// make sure the container is available, client bug requires this to be separate
		2670	esrv_send_item (this, new_container);
		2671
		2672	new_container->flag [FLAG_APPLIED] = true;
		2673	container = new_container;
		2674
		2675	// client needs flag change
		2676	esrv_update_item (UPD_FLAGS, this, new_container);
		2677	esrv_send_inventory (this, new_container);
		2678	play_sound (sound_find ("chest_open"));
		2679	}
		2680	// else if (!old_container->env && contr && contr->ns)
		2681	// contr->ns->floorbox_reset ();
		2682	}
		2683
		2684	object *
		2685	object::force_find (const shstr name)
		2686	{
		2687	/* cycle through his inventory to look for the MARK we want to
		2688	* place
		2689	*/
		2690	for (object *tmp = inv; tmp; tmp = tmp->below)
		2691	if (tmp->type == FORCE && tmp->slaying == name)
		2692	return splay (tmp);
		2693
		2694	return 0;
		2695	}
		2696
		2697	void
		2698	object::force_add (const shstr name, int duration)
		2699	{
		2700	if (object *force = force_find (name))
		2701	force->destroy ();
		2702
		2703	object *force = get_archetype (FORCE_NAME);
		2704
		2705	force->slaying = name;
		2706	force->stats.food = 1;
		2707	force->speed_left = -1.f;
		2708
		2709	force->set_speed (duration ? 1.f / duration : 0.f);
		2710	force->flag [FLAG_IS_USED_UP] = true;
		2711	force->flag [FLAG_APPLIED] = true;
		2712
		2713	insert (force);
		2714	}
		2715
		2716	void
		2717	object::play_sound (faceidx sound)
		2718	{
		2719	if (!sound)
		2720	return;
		2721
		2722	if (flag [FLAG_REMOVED])
		2723	return;
		2724
		2725	if (env)
		2726	{
		2727	if (object *pl = in_player ())
		2728	pl->contr->play_sound (sound);
		2729	}
		2730	else
		2731	map->play_sound (sound, x, y);
		2732	}
		2733

Diff Legend

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