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.92 by root, Tue Dec 26 17:39:29 2006 UTC vs.
Revision 1.229 by root, Sat May 3 12:29:09 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;
139
140	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	144	/* n-squared behaviour (see kv_get), but I'm hoping both
141	* objects with lists are rare, and lists stay short. If not, use a	145	* objects with lists are rare, and lists stay short. If not, use a
142	* different structure or at least keep the lists sorted...	146	* different structure or at least keep the lists sorted...
143	*/	147	*/
144		148
145	/* For each field in wants, */	149	/* For each field in wants, */
146	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)	150	for (key_value *kv = wants->key_values; kv; kv = kv->next)
147	{	151	if (has->kv_get (kv->key) != kv->value)
148	key_value *has_field;	152	return false;
149
150	/* Look for a field in has with the same key. */
151	has_field = get_ob_key_link (has, wants_field->key);
152
153	if (has_field == NULL)
154	{
155	/* No field with that name. */
156	return FALSE;
157	}
158
159	/* Found the matching field. */
160	if (has_field->value != wants_field->value)
161	{
162	/* Values don't match, so this half of the comparison is false. */
163	return FALSE;
164	}
165
166	/* If we get here, we found a match. Now for the next field in wants. */
167	}
168		153
169	/* If we get here, every field in wants has a matching field in has. */	154	/* If we get here, every field in wants has a matching field in has. */
170	return TRUE;	155	return true;
171	}	156	}
172		157
173	/* Returns TRUE if ob1 has the same key_values as ob2. */	158	/* Returns TRUE if ob1 has the same key_values as ob2. */
174	static int	159	static bool
175	compare_ob_value_lists (const object *ob1, const object *ob2)	160	compare_ob_value_lists (const object *ob1, const object *ob2)
176	{	161	{
177	/* However, there may be fields in has which aren't partnered in wants,	162	/* However, there may be fields in has which aren't partnered in wants,
178	* so we need to run the comparison *twice*. :(	163	* so we need to run the comparison *twice*. :(
179	*/	164	*/
180	return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1);	165	return compare_ob_value_lists_one (ob1, ob2)
		166	&& compare_ob_value_lists_one (ob2, ob1);
181	}	167	}
182		168
183	/* Function examines the 2 objects given to it, and returns true if	169	/* Function examines the 2 objects given to it, and returns true if
184	* they can be merged together.	170	* they can be merged together.
185	*	171	*
…		…
190	* Check nrof variable *before* calling can_merge()	176	* Check nrof variable *before* calling can_merge()
191	*	177	*
192	* Improvements made with merge: Better checking on potion, and also	178	* Improvements made with merge: Better checking on potion, and also
193	* check weight	179	* check weight
194	*/	180	*/
195
196	bool object::can_merge_slow (object *ob1, object *ob2)	181	bool object::can_merge_slow (object *ob1, object *ob2)
197	{	182	{
198	/* A couple quicksanity checks */	183	/* A couple quicksanity checks */
199	if (ob1 == ob2	184	if (ob1 == ob2
200	|| ob1->type != ob2->type	185	|| ob1->type != ob2->type
201	|| ob1->speed != ob2->speed	186	|| ob1->speed != ob2->speed
202	|| ob1->value != ob2->value	187	|| ob1->value != ob2->value
203	|| ob1->name != ob2->name)	188	|| ob1->name != ob2->name)
204	return 0;	189	return 0;
205		190
206	//TODO: this ain't working well, use nicer and correct overflow check	191	/* 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	192	* for unsigned overflow (2c), second part checks whether the result
208	* value could not be stored in a sint32 (which unfortunately sometimes is	193	* would fit into a 32 bit signed int, which is often used to hold
209	* used to store nrof).	194	* nrof values.
210	*/	195	*/
211	if (ob1->nrof + ob2->nrof >= 1UL << 31)	196	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
212	return 0;	197	return 0;
213		198
214	/* If the objects have been identified, set the BEEN_APPLIED flag.	199	/* 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	200	* 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	201	* 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	202	* are not equal - just if it has been identified, the been_applied
218	* flags lose any meaning.	203	* flags lose any meaning.
219	*/	204	*/
220	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	205	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	206	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
222		207
223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	208	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	209	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
225		210
226	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	211	if (ob1->arch->name != ob2->arch->name
227	|| ob1->arch != ob2->arch
228	|| ob1->name != ob2->name	212	|| ob1->name != ob2->name
229	|| ob1->title != ob2->title	213	|| ob1->title != ob2->title
230	|| ob1->msg != ob2->msg	214	|| ob1->msg != ob2->msg
231	|| ob1->weight != ob2->weight	215	|| 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	216	|| ob1->attacktype != ob2->attacktype
235	|| ob1->magic != ob2->magic	217	|| ob1->magic != ob2->magic
236	|| ob1->slaying != ob2->slaying	218	|| ob1->slaying != ob2->slaying
237	|| ob1->skill != ob2->skill	219	|| ob1->skill != ob2->skill
238	|| ob1->value != ob2->value	220	|| ob1->value != ob2->value
…		…
245	|| ob1->move_block != ob2->move_block	227	|| ob1->move_block != ob2->move_block
246	|| ob1->move_allow != ob2->move_allow	228	|| ob1->move_allow != ob2->move_allow
247	|| ob1->move_on != ob2->move_on	229	|| ob1->move_on != ob2->move_on
248	|| ob1->move_off != ob2->move_off	230	|| ob1->move_off != ob2->move_off
249	|| ob1->move_slow != ob2->move_slow	231	|| ob1->move_slow != ob2->move_slow
250	|| ob1->move_slow_penalty != ob2->move_slow_penalty)	232	|| ob1->move_slow_penalty != ob2->move_slow_penalty
		233	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
		234	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
251	return 0;	235	return 0;
252		236
		237	if ((ob1->flag ^ ob2->flag)
		238	.reset (FLAG_INV_LOCKED)
		239	.reset (FLAG_CLIENT_SENT)
		240	.reset (FLAG_REMOVED)
		241	.any ())
		242	return 0;
		243
253	/* This is really a spellbook check - really, we should	244	/* This is really a spellbook check - we should in general
254	* check all objects in the inventory.	245	* not merge objects with real inventories, as splitting them
		246	* is hard.
255	*/	247	*/
256	if (ob1->inv || ob2->inv)	248	if (ob1->inv || ob2->inv)
257	{	249	{
258	/* if one object has inventory but the other doesn't, not equiv */	250	if (!(ob1->inv && ob2->inv))
259	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	251	return 0; /* inventories differ in length */
260	return 0;
261		252
262	/* Now check to see if the two inventory objects could merge */	253	if (ob1->inv->below || ob2->inv->below)
		254	return 0; /* more than one object in inv */
		255
263	if (!object::can_merge (ob1->inv, ob2->inv))	256	if (!object::can_merge (ob1->inv, ob2->inv))
264	return 0;	257	return 0; /* inventory objects differ */
265		258
266	/* inventory ok - still need to check rest of this object to see	259	/* inventory ok - still need to check rest of this object to see
267	* if it is valid.	260	* if it is valid.
268	*/	261	*/
269	}	262	}
…		…
277		270
278	/* Note sure why the following is the case - either the object has to	271	/* 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	272	* be animated or have a very low speed. Is this an attempted monster
280	* check?	273	* check?
281	*/	274	*/
282	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	275	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
283	return 0;	276	return 0;
284		277
285	switch (ob1->type)	278	switch (ob1->type)
286	{	279	{
287	case SCROLL:	280	case SCROLL:
288	if (ob1->level != ob2->level)	281	if (ob1->level != ob2->level)
289	return 0;	282	return 0;
290	break;	283	break;
291	}	284	}
292		285
293	if (ob1->key_values != NULL || ob2->key_values != NULL)	286	if (ob1->key_values || ob2->key_values)
294	{	287	{
295	/* At least one of these has key_values. */	288	/* At least one of these has key_values. */
296	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	289	if ((!ob1->key_values) != (!ob2->key_values))
297	/* One has fields, but the other one doesn't. */	290	return 0; /* One has fields, but the other one doesn't. */
		291
		292	if (!compare_ob_value_lists (ob1, ob2))
298	return 0;	293	return 0;
299	else if (!compare_ob_value_lists (ob1, ob2))
300	return 0;
301	}	294	}
302		295
303	//TODO: generate an event or call into perl for additional checks
304	if (ob1->self || ob2->self)	296	if (ob1->self || ob2->self)
305	{	297	{
306	ob1->optimise ();	298	ob1->optimise ();
307	ob2->optimise ();	299	ob2->optimise ();
308		300
309	if (ob1->self || ob2->self)	301	if (ob1->self || ob2->self)
		302	{
		303	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		304	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		305
		306	if (k1 != k2)
310	return 0;	307	return 0;
		308
		309	if (k1 == 0)
		310	return 1;
		311
		312	if (!cfperl_can_merge (ob1, ob2))
		313	return 0;
		314	}
311	}	315	}
312		316
313	/* Everything passes, must be OK. */	317	/* Everything passes, must be OK. */
314	return 1;	318	return 1;
315	}	319	}
316		320
		321	// find player who can see this object
		322	object *
		323	object::visible_to () const
		324	{
		325	if (client_visible () && !flag [FLAG_REMOVED])
		326	{
		327	// see if we are in a container of sorts
		328	if (env)
		329	{
		330	// the player inventory itself is always visible
		331	if (env->type == PLAYER)
		332	return env;
		333
		334	// else a player could have our env open
		335	object *envest = env->outer_env ();
		336
		337	// the player itself is always on a map, so we will find him here
		338	// even if our inv is in a player.
		339	if (envest->is_on_map ())
		340	if (object *pl = envest->ms ().player ())
		341	if (pl->container == env)
		342	return pl;
		343	}
		344	else
		345	{
		346	// maybe there is a player standing on the same mapspace
		347	// this will catch the case where "this" is a player
		348	if (object *pl = ms ().player ())
		349	if (!pl->container || this == pl->container)
		350	return pl;
		351	}
		352	}
		353
		354	return 0;
		355	}
		356
		357	// adjust weight per container type ("of holding")
		358	static sint32
		359	weight_adjust (object *op, sint32 weight)
		360	{
		361	return op->type == CONTAINER
		362	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		363	: weight;
		364	}
		365
317	/*	366	/*
		367	* adjust_weight(object, weight) adds the specified weight to an object,
		368	* and also updates how much the environment(s) is/are carrying.
		369	*/
		370	static void
		371	adjust_weight (object *op, sint32 weight)
		372	{
		373	while (op)
		374	{
		375	weight = weight_adjust (op, weight);
		376
		377	if (!weight)
		378	return;
		379
		380	op->carrying += weight;
		381
		382	if (object *pl = op->visible_to ())
		383	if (pl != op) // player is handled lazily
		384	esrv_update_item (UPD_WEIGHT, pl, op);
		385
		386	op = op->env;
		387	}
		388	}
		389
		390	/*
318	* sum_weight() is a recursive function which calculates the weight	391	* this is a recursive function which calculates the weight
319	* an object is carrying. It goes through in figures out how much	392	* an object is carrying. It goes through op and figures out how much
320	* containers are carrying, and sums it up.	393	* containers are carrying, and sums it up.
321	*/	394	*/
322	long	395	void
323	sum_weight (object *op)	396	object::update_weight ()
324	{	397	{
325	long sum;	398	sint32 sum = 0;
326	object *inv;
327		399
328	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	400	for (object *op = inv; op; op = op->below)
329	{	401	{
330	if (inv->inv)	402	if (op->inv)
331	sum_weight (inv);	403	op->update_weight ();
332	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	404
		405	sum += op->total_weight ();
		406	}
		407
		408	sum = weight_adjust (this, sum);
		409
		410	if (sum != carrying)
333	}	411	{
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;	412	carrying = sum;
340		413
341	return sum;	414	if (object *pl = visible_to ())
		415	if (pl != this) // player is handled lazily
		416	esrv_update_item (UPD_WEIGHT, pl, this);
		417	}
342	}	418	}
343		419
344	/**	420	/*
345	* Return the outermost environment object for a given object.	421	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
346	*/	422	*/
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 *	423	char *
363	dump_object (object *op)	424	dump_object (object *op)
364	{	425	{
365	if (!op)	426	if (!op)
366	return strdup ("[NULLOBJ]");	427	return strdup ("[NULLOBJ]");
367		428
368	object_freezer freezer;	429	object_freezer freezer;
369	save_object (freezer, op, 1);	430	op->write (freezer);
370	return freezer.as_string ();	431	return freezer.as_string ();
371	}	432	}
372		433
373	/*	434	/*
374	* get_nearest_part(multi-object, object 2) returns the part of the	435	* get_nearest_part(multi-object, object 2) returns the part of the
375	* multi-object 1 which is closest to the second object.	436	* multi-object 1 which is closest to the second object.
376	* If it's not a multi-object, it is returned.	437	* If it's not a multi-object, it is returned.
377	*/	438	*/
378
379	object *	439	object *
380	get_nearest_part (object *op, const object *pl)	440	get_nearest_part (object *op, const object *pl)
381	{	441	{
382	object *tmp, *closest;	442	object *tmp, *closest;
383	int last_dist, i;	443	int last_dist, i;
384		444
385	if (op->more == NULL)	445	if (!op->more)
386	return op;	446	return op;
		447
387	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	448	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		449	tmp;
		450	tmp = tmp->more)
388	if ((i = distance (tmp, pl)) < last_dist)	451	if ((i = distance (tmp, pl)) < last_dist)
389	closest = tmp, last_dist = i;	452	closest = tmp, last_dist = i;
		453
390	return closest;	454	return closest;
391	}	455	}
392		456
393	/*	457	/*
394	* Returns the object which has the count-variable equal to the argument.	458	* Returns the object which has the count-variable equal to the argument.
		459	* VERRRY slow.
395	*/	460	*/
396
397	object *	461	object *
398	find_object (tag_t i)	462	find_object (tag_t i)
399	{	463	{
400	for (object *op = object::first; op; op = op->next)	464	for_all_objects (op)
401	if (op->count == i)	465	if (op->count == i)
402	return op;	466	return op;
403		467
404	return 0;	468	return 0;
405	}	469	}
406		470
407	/*	471	/*
408	* Returns the first object which has a name equal to the argument.	472	* Returns the first object which has a name equal to the argument.
409	* Used only by the patch command, but not all that useful.	473	* Used only by the patch command, but not all that useful.
410	* Enables features like "patch <name-of-other-player> food 999"	474	* Enables features like "patch <name-of-other-player> food 999"
411	*/	475	*/
412
413	object *	476	object *
414	find_object_name (const char *str)	477	find_object_name (const char *str)
415	{	478	{
416	shstr_cmp str_ (str);	479	shstr_cmp str_ (str);
417	object *op;	480	object *op;
418		481
419	for (op = object::first; op != NULL; op = op->next)	482	for_all_objects (op)
420	if (op->name == str_)	483	if (op->name == str_)
421	break;	484	break;
422		485
423	return op;	486	return op;
424	}	487	}
425		488
426	void
427	free_all_object_data ()
428	{
429	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
430	}
431
432	/*	489	/*
433	* Sets the owner and sets the skill and exp pointers to owner's current	490	* Sets the owner and sets the skill and exp pointers to owner's current
434	* skill and experience objects.	491	* skill and experience objects.
		492	* ACTUALLY NO! investigate! TODO
435	*/	493	*/
436	void	494	void
437	object::set_owner (object *owner)	495	object::set_owner (object *owner)
438	{	496	{
		497	// allow objects which own objects
439	if (!owner)	498	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)	499	while (owner->owner)
450	owner = owner->owner;	500	owner = owner->owner;
		501
		502	if (flag [FLAG_FREED])
		503	{
		504	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		505	return;
		506	}
451		507
452	this->owner = owner;	508	this->owner = owner;
		509	}
		510
		511	int
		512	object::slottype () const
		513	{
		514	if (type == SKILL)
		515	{
		516	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		517	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		518	}
		519	else
		520	{
		521	if (slot [body_combat].info) return slot_combat;
		522	if (slot [body_range ].info) return slot_ranged;
		523	}
		524
		525	return slot_none;
		526	}
		527
		528	bool
		529	object::change_weapon (object *ob)
		530	{
		531	if (current_weapon == ob)
		532	return true;
		533
		534	if (chosen_skill)
		535	chosen_skill->flag [FLAG_APPLIED] = false;
		536
		537	current_weapon = ob;
		538	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		539
		540	if (chosen_skill)
		541	chosen_skill->flag [FLAG_APPLIED] = true;
		542
		543	update_stats ();
		544
		545	if (ob)
		546	{
		547	// now check wether any body locations became invalid, in which case
		548	// we cannot apply the weapon at the moment.
		549	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		550	if (slot[i].used < 0)
		551	{
		552	current_weapon = chosen_skill = 0;
		553	update_stats ();
		554
		555	new_draw_info_format (NDI_UNIQUE, 0, this,
		556	"You try to balance all your items at once, "
		557	"but the %s is just too much for your body. "
		558	"[You need to unapply some items first.]", &ob->name);
		559	return false;
		560	}
		561
		562	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		563	}
		564	else
		565	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		566
		567	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		568	{
		569	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		570	&name, ob->debug_desc ());
		571	return false;
		572	}
		573
		574	return true;
453	}	575	}
454		576
455	/* Zero the key_values on op, decrementing the shared-string	577	/* Zero the key_values on op, decrementing the shared-string
456	* refcounts and freeing the links.	578	* refcounts and freeing the links.
457	*/	579	*/
458	static void	580	static void
459	free_key_values (object *op)	581	free_key_values (object *op)
460	{	582	{
461	for (key_value *i = op->key_values; i != 0;)	583	for (key_value *i = op->key_values; i; )
462	{	584	{
463	key_value *next = i->next;	585	key_value *next = i->next;
464	delete i;	586	delete i;
465		587
466	i = next;	588	i = next;
…		…
478	* will point at garbage.	600	* will point at garbage.
479	*/	601	*/
480	void	602	void
481	object::copy_to (object *dst)	603	object::copy_to (object *dst)
482	{	604	{
483	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	605	dst->remove ();
484	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
485
486	*(object_copy *)dst = *this;	606	*(object_copy *)dst = *this;
487		607	dst->flag [FLAG_REMOVED] = true;
488	if (is_freed)
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		608
497	/* Copy over key_values, if any. */	609	/* Copy over key_values, if any. */
498	if (key_values)	610	if (key_values)
499	{	611	{
500	key_value *tail = 0;	612	key_value *tail = 0;
501	key_value *i;
502
503	dst->key_values = 0;	613	dst->key_values = 0;
504		614
505	for (i = key_values; i; i = i->next)	615	for (key_value *i = key_values; i; i = i->next)
506	{	616	{
507	key_value *new_link = new key_value;	617	key_value *new_link = new key_value;
508		618
509	new_link->next = 0;	619	new_link->next = 0;
510	new_link->key = i->key;	620	new_link->key = i->key;
511	new_link->value = i->value;	621	new_link->value = i->value;
512		622
513	/* Try and be clever here, too. */	623	/* Try and be clever here, too. */
514	if (!dst->key_values)	624	if (!dst->key_values)
515	{	625	{
…		…
522	tail = new_link;	632	tail = new_link;
523	}	633	}
524	}	634	}
525	}	635	}
526		636
		637	if (speed < 0)
		638	dst->speed_left -= rndm ();
		639
527	dst->set_speed (dst->speed);	640	dst->set_speed (dst->speed);
		641	}
		642
		643	void
		644	object::instantiate ()
		645	{
		646	if (!uuid.seq) // HACK
		647	uuid = UUID::gen ();
		648
		649	speed_left = -0.1f;
		650	/* copy the body_info to the body_used - this is only really
		651	* need for monsters, but doesn't hurt to do it for everything.
		652	* by doing so, when a monster is created, it has good starting
		653	* values for the body_used info, so when items are created
		654	* for it, they can be properly equipped.
		655	*/
		656	for (int i = NUM_BODY_LOCATIONS; i--; )
		657	slot[i].used = slot[i].info;
		658
		659	attachable::instantiate ();
528	}	660	}
529		661
530	object *	662	object *
531	object::clone ()	663	object::clone ()
532	{	664	{
533	object *neu = create ();	665	object *neu = create ();
534	copy_to (neu);	666	copy_to (neu);
		667	neu->map = map; // not copied by copy_to
535	return neu;	668	return neu;
536	}	669	}
537		670
538	/*	671	/*
539	* If an object with the IS_TURNABLE() flag needs to be turned due	672	* 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	673	* 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.	674	* be called to update the face variable, _and_ how it looks on the map.
542	*/	675	*/
543
544	void	676	void
545	update_turn_face (object *op)	677	update_turn_face (object *op)
546	{	678	{
547	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	679	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
548	return;	680	return;
		681
549	SET_ANIMATION (op, op->direction);	682	SET_ANIMATION (op, op->direction);
550	update_object (op, UP_OBJ_FACE);	683	update_object (op, UP_OBJ_FACE);
551	}	684	}
552		685
553	/*	686	/*
…		…
556	* This function needs to be called whenever the speed of an object changes.	689	* This function needs to be called whenever the speed of an object changes.
557	*/	690	*/
558	void	691	void
559	object::set_speed (float speed)	692	object::set_speed (float speed)
560	{	693	{
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)	694	if (flag [FLAG_FREED] && speed)
567	{	695	{
568	LOG (llevError, "Object %s is freed but has speed.\n", &name);	696	LOG (llevError, "Object %s is freed but has speed.\n", &name);
569	speed = 0;	697	speed = 0;
570	}	698	}
571		699
572	this->speed = speed;	700	this->speed = speed;
573		701
574	if (arch_init)	702	if (has_active_speed ())
575	return;	703	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	704	else
593	{	705	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	}	706	}
648		707
649	/*	708	/*
650	* update_object() updates the the map.	709	* update_object() updates the the map.
651	* It takes into account invisible objects (and represent squares covered	710	* It takes into account invisible objects (and represent squares covered
…		…
664	* UP_OBJ_FACE: only the objects face has changed.	723	* UP_OBJ_FACE: only the objects face has changed.
665	*/	724	*/
666	void	725	void
667	update_object (object *op, int action)	726	update_object (object *op, int action)
668	{	727	{
669	MoveType move_on, move_off, move_block, move_slow;	728	if (!op)
670
671	if (op == NULL)
672	{	729	{
673	/* this should never happen */	730	/* this should never happen */
674	LOG (llevDebug, "update_object() called for NULL object.\n");	731	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
675	return;	732	return;
676	}	733	}
677		734
678	if (op->env)	735	if (!op->is_on_map ())
679	{	736	{
680	/* Animation is currently handled by client, so nothing	737	/* Animation is currently handled by client, so nothing
681	* to do in this case.	738	* to do in this case.
682	*/	739	*/
683	return;	740	return;
684	}	741	}
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		742
692	/* make sure the object is within map boundaries */	743	/* 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)	744	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
694	{	745	{
695	LOG (llevError, "update_object() called for object out of map!\n");	746	LOG (llevError, "update_object() called for object out of map!\n");
…		…
699	return;	750	return;
700	}	751	}
701		752
702	mapspace &m = op->ms ();	753	mapspace &m = op->ms ();
703		754
704	if (m.flags_ & P_NEED_UPDATE)	755	if (!(m.flags_ & P_UPTODATE))
705	/* nop */;	756	/* nop */;
706	else if (action == UP_OBJ_INSERT)	757	else if (action == UP_OBJ_INSERT)
707	{	758	{
708	// this is likely overkill, TODO: revisit (schmorp)	759	// this is likely overkill, TODO: revisit (schmorp)
709	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	760	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	769	/* This isn't perfect, but I don't expect a lot of objects to
719	* to have move_allow right now.	770	* to have move_allow right now.
720	*/	771	*/
721	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	772	|| ((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)	773	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
723	m.flags_ = P_NEED_UPDATE;	774	m.flags_ = 0;
724	}	775	}
725	/* if the object is being removed, we can't make intelligent	776	/* if the object is being removed, we can't make intelligent
726	* decisions, because remove_ob can't really pass the object	777	* decisions, because remove_ob can't really pass the object
727	* that is being removed.	778	* that is being removed.
728	*/	779	*/
729	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	780	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
730	m.flags_ = P_NEED_UPDATE;	781	m.flags_ = 0;
731	else if (action == UP_OBJ_FACE)	782	else if (action == UP_OBJ_FACE)
732	/* Nothing to do for that case */ ;	783	/* Nothing to do for that case */ ;
733	else	784	else
734	LOG (llevError, "update_object called with invalid action: %d\n", action);	785	LOG (llevError, "update_object called with invalid action: %d\n", action);
735		786
736	if (op->more)	787	if (op->more)
737	update_object (op->more, action);	788	update_object (op->more, action);
738	}	789	}
739		790
740	object::vector object::objects; // not yet used
741	object *object::first;
742
743	object::object ()	791	object::object ()
744	{	792	{
745	SET_FLAG (this, FLAG_REMOVED);	793	SET_FLAG (this, FLAG_REMOVED);
746		794
747	expmul = 1.0;	795	expmul = 1.0;
748	face = blank_face;	796	face = blank_face;
749	}	797	}
750		798
751	object::~object ()	799	object::~object ()
752	{	800	{
		801	unlink ();
		802
753	free_key_values (this);	803	free_key_values (this);
754	}	804	}
755		805
		806	static int object_count;
		807
756	void object::link ()	808	void object::link ()
757	{	809	{
		810	assert (!index);//D
		811	uuid = UUID::gen ();
758	count = ++ob_count;	812	count = ++object_count;
759	uuid = gen_uuid ();
760		813
761	prev = 0;	814	refcnt_inc ();
762	next = object::first;	815	objects.insert (this);
763
764	if (object::first)
765	object::first->prev = this;
766
767	object::first = this;
768	}	816	}
769		817
770	void object::unlink ()	818	void object::unlink ()
771	{	819	{
772	if (this == object::first)	820	if (!index)
773	object::first = next;	821	return;
774		822
775	/* Remove this object from the list of used objects */	823	objects.erase (this);
776	if (prev) prev->next = next;	824	refcnt_dec ();
777	if (next) next->prev = prev;	825	}
778		826
779	prev = 0;	827	void
780	next = 0;	828	object::activate ()
		829	{
		830	/* If already on active list, don't do anything */
		831	if (active)
		832	return;
		833
		834	if (has_active_speed ())
		835	actives.insert (this);
		836	}
		837
		838	void
		839	object::activate_recursive ()
		840	{
		841	activate ();
		842
		843	for (object *op = inv; op; op = op->below)
		844	op->activate_recursive ();
		845	}
		846
		847	/* This function removes object 'op' from the list of active
		848	* objects.
		849	* This should only be used for style maps or other such
		850	* reference maps where you don't want an object that isn't
		851	* in play chewing up cpu time getting processed.
		852	* The reverse of this is to call update_ob_speed, which
		853	* will do the right thing based on the speed of the object.
		854	*/
		855	void
		856	object::deactivate ()
		857	{
		858	/* If not on the active list, nothing needs to be done */
		859	if (!active)
		860	return;
		861
		862	actives.erase (this);
		863	}
		864
		865	void
		866	object::deactivate_recursive ()
		867	{
		868	for (object *op = inv; op; op = op->below)
		869	op->deactivate_recursive ();
		870
		871	deactivate ();
		872	}
		873
		874	void
		875	object::set_flag_inv (int flag, int value)
		876	{
		877	for (object *op = inv; op; op = op->below)
		878	{
		879	op->flag [flag] = value;
		880	op->set_flag_inv (flag, value);
		881	}
781	}	882	}
782		883
783	/*	884	/*
784	* Remove and free all objects in the inventory of the given object.	885	* Remove and free all objects in the inventory of the given object.
785	* object.c ?	886	* object.c ?
786	*/	887	*/
787	void	888	void
788	object::destroy_inv (bool drop_to_ground)	889	object::destroy_inv (bool drop_to_ground)
789	{	890	{
		891	// need to check first, because the checks below might segfault
		892	// as we might be on an invalid mapspace and crossfire code
		893	// is too buggy to ensure that the inventory is empty.
		894	// corollary: if you create arrows etc. with stuff in its inventory,
		895	// cf will crash below with off-map x and y
		896	if (!inv)
		897	return;
		898
790	/* Only if the space blocks everything do we not process -	899	/* Only if the space blocks everything do we not process -
791	* if some form of movement is allowed, let objects	900	* if some form of movement is allowed, let objects
792	* drop on that space.	901	* drop on that space.
793	*/	902	*/
794	if (!drop_to_ground	903	if (!drop_to_ground
795	|| !map	904	|| !map
796	|| map->in_memory != MAP_IN_MEMORY	905	|| map->in_memory != MAP_ACTIVE
		906	|| map->nodrop
797	|| map->at (x, y).move_block == MOVE_ALL)	907	|| ms ().move_block == MOVE_ALL)
798	{	908	{
799	while (inv)	909	while (inv)
800	{	910	{
801	inv->destroy_inv (drop_to_ground);	911	inv->destroy_inv (false);
802	inv->destroy ();	912	inv->destroy ();
803	}	913	}
804	}	914	}
805	else	915	else
806	{ /* Put objects in inventory onto this space */	916	{ /* Put objects in inventory onto this space */
…		…
810		920
811	if (op->flag [FLAG_STARTEQUIP]	921	if (op->flag [FLAG_STARTEQUIP]
812	|| op->flag [FLAG_NO_DROP]	922	|| op->flag [FLAG_NO_DROP]
813	|| op->type == RUNE	923	|| op->type == RUNE
814	|| op->type == TRAP	924	|| op->type == TRAP
815	|| op->flag [FLAG_IS_A_TEMPLATE])	925	|| op->flag [FLAG_IS_A_TEMPLATE]
		926	|| op->flag [FLAG_DESTROY_ON_DEATH])
816	op->destroy ();	927	op->destroy (true);
817	else	928	else
818	{	929	map->insert (op, x, y);
819	op->remove ();
820	op->x = x;
821	op->y = y;
822	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
823	}
824	}	930	}
825	}	931	}
826	}	932	}
827		933
828	object *object::create ()	934	object *object::create ()
…		…
830	object *op = new object;	936	object *op = new object;
831	op->link ();	937	op->link ();
832	return op;	938	return op;
833	}	939	}
834		940
		941	static struct freed_map : maptile
		942	{
		943	freed_map ()
		944	{
		945	path = "<freed objects map>";
		946	name = "/internal/freed_objects_map";
		947	width = 3;
		948	height = 3;
		949	nodrop = 1;
		950
		951	alloc ();
		952	in_memory = MAP_ACTIVE;
		953	}
		954
		955	~freed_map ()
		956	{
		957	destroy ();
		958	}
		959	} freed_map; // freed objects are moved here to avoid crashes
		960
835	void	961	void
836	object::do_destroy ()	962	object::do_destroy ()
837	{	963	{
838	if (flag [FLAG_IS_LINKED])	964	if (flag [FLAG_IS_LINKED])
839	remove_button_link (this);	965	remove_button_link (this);
840		966
841	if (flag [FLAG_FRIENDLY])	967	if (flag [FLAG_FRIENDLY])
842	remove_friendly_object (this);	968	remove_friendly_object (this);
843		969
844	if (!flag [FLAG_REMOVED])
845	remove ();	970	remove ();
846		971
847	if (flag [FLAG_FREED])	972	attachable::do_destroy ();
848	return;
849		973
850	set_speed (0);	974	deactivate ();
		975	unlink ();
851		976
852	flag [FLAG_FREED] = 1;	977	flag [FLAG_FREED] = 1;
853		978
854	attachable::do_destroy ();
855
856	destroy_inv (true);
857	unlink ();
858
859	// hack to ensure that freed objects still have a valid map	979	// hack to ensure that freed objects still have a valid map
860	{
861	static maptile *freed_map; // freed objects are moved here to avoid crashes
862
863	if (!freed_map)
864	{
865	freed_map = new maptile;
866
867	freed_map->name = "/internal/freed_objects_map";
868	freed_map->width = 3;
869	freed_map->height = 3;
870
871	freed_map->allocate ();
872	}
873
874	map = freed_map;	980	map = &freed_map;
875	x = 1;	981	x = 1;
876	y = 1;	982	y = 1;
877	}
878
879	head = 0;
880		983
881	if (more)	984	if (more)
882	{	985	{
883	more->destroy ();	986	more->destroy ();
884	more = 0;	987	more = 0;
885	}	988	}
886		989
		990	head = 0;
		991
887	// clear those pointers that likely might have circular references to us	992	// clear those pointers that likely might cause circular references
888	owner = 0;	993	owner = 0;
889	enemy = 0;	994	enemy = 0;
890	attacked_by = 0;	995	attacked_by = 0;
891		996	current_weapon = 0;
892	// only relevant for players(?), but make sure of it anyways
893	contr = 0;
894	}	997	}
895		998
896	void	999	void
897	object::destroy (bool destroy_inventory)	1000	object::destroy (bool destroy_inventory)
898	{	1001	{
899	if (destroyed ())	1002	if (destroyed ())
900	return;	1003	return;
901		1004
		1005	if (!is_head () && !head->destroyed ())
		1006	{
		1007	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1008	head->destroy (destroy_inventory);
		1009	return;
		1010	}
		1011
902	if (destroy_inventory)	1012	destroy_inv (!destroy_inventory);
903	destroy_inv (false);	1013
		1014	if (is_head ())
		1015	if (sound_destroy)
		1016	play_sound (sound_destroy);
		1017	else if (flag [FLAG_MONSTER])
		1018	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
904		1019
905	attachable::destroy ();	1020	attachable::destroy ();
906	}
907
908	/*
909	* sub_weight() recursively (outwards) subtracts a number from the
910	* weight of an object (and what is carried by it's environment(s)).
911	*/
912	void
913	sub_weight (object *op, signed long weight)
914	{
915	while (op != NULL)
916	{
917	if (op->type == CONTAINER)
918	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
919
920	op->carrying -= weight;
921	op = op->env;
922	}
923	}	1021	}
924		1022
925	/* op->remove ():	1023	/* op->remove ():
926	* This function removes the object op from the linked list of objects	1024	* This function removes the object op from the linked list of objects
927	* which it is currently tied to. When this function is done, the	1025	* which it is currently tied to. When this function is done, the
928	* object will have no environment. If the object previously had an	1026	* object will have no environment. If the object previously had an
929	* environment, the x and y coordinates will be updated to	1027	* environment, the x and y coordinates will be updated to
930	* the previous environment.	1028	* the previous environment.
931	* Beware: This function is called from the editor as well!
932	*/	1029	*/
933	void	1030	void
934	object::remove ()	1031	object::do_remove ()
935	{	1032	{
936	object *tmp, *last = 0;	1033	object *tmp, *last = 0;
937	object *otmp;	1034	object *otmp;
938		1035
939	if (QUERY_FLAG (this, FLAG_REMOVED))	1036	if (flag [FLAG_REMOVED])
940	return;	1037	return;
941		1038
942	SET_FLAG (this, FLAG_REMOVED);
943	INVOKE_OBJECT (REMOVE, this);	1039	INVOKE_OBJECT (REMOVE, this);
		1040
		1041	flag [FLAG_REMOVED] = true;
944		1042
945	if (more)	1043	if (more)
946	more->remove ();	1044	more->remove ();
947		1045
948	/*	1046	/*
949	* In this case, the object to be removed is in someones	1047	* In this case, the object to be removed is in someones
950	* inventory.	1048	* inventory.
951	*/	1049	*/
952	if (env)	1050	if (env)
953	{	1051	{
		1052	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
		1053	if (object *pl = visible_to ())
		1054	esrv_del_item (pl->contr, count);
		1055	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1056
		1057	adjust_weight (env, -total_weight ());
		1058
		1059	*(above ? &above->below : &env->inv) = below;
		1060
954	if (nrof)	1061	if (below)
955	sub_weight (env, weight * nrof);	1062	below->above = above;
956	else	1063
957	sub_weight (env, weight + carrying);	1064	/* we set up values so that it could be inserted into
		1065	* the map, but we don't actually do that - it is up
		1066	* to the caller to decide what we want to do.
		1067	*/
		1068	map = env->map;
		1069	x = env->x;
		1070	y = env->y;
		1071	above = 0;
		1072	below = 0;
		1073	env = 0;
958		1074
959	/* NO_FIX_PLAYER is set when a great many changes are being	1075	/* NO_FIX_PLAYER is set when a great many changes are being
960	* made to players inventory. If set, avoiding the call	1076	* made to players inventory. If set, avoiding the call
961	* to save cpu time.	1077	* to save cpu time.
962	*/	1078	*/
963	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1079	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
964	otmp->update_stats ();	1080	otmp->update_stats ();
965
966	if (above != NULL)
967	above->below = below;
968	else
969	env->inv = below;
970
971	if (below != NULL)
972	below->above = above;
973
974	/* we set up values so that it could be inserted into
975	* the map, but we don't actually do that - it is up
976	* to the caller to decide what we want to do.
977	*/
978	x = env->x, y = env->y;
979	map = env->map;
980	above = 0, below = 0;
981	env = 0;
982	}	1081	}
983	else if (map)	1082	else if (map)
984	{	1083	{
985	/* Re did the following section of code - it looks like it had	1084	map->dirty = true;
986	* lots of logic for things we no longer care about	1085	mapspace &ms = this->ms ();
		1086
		1087	if (object *pl = ms.player ())
987	*/	1088	{
		1089	if (type == PLAYER) // this == pl(!)
		1090	{
		1091	// leaving a spot always closes any open container on the ground
		1092	if (container && !container->env)
		1093	// this causes spurious floorbox updates, but it ensures
		1094	// that the CLOSE event is being sent.
		1095	close_container ();
		1096
		1097	--map->players;
		1098	map->touch ();
		1099	}
		1100	else if (pl->container == this)
		1101	{
		1102	// removing a container should close it
		1103	close_container ();
		1104	}
		1105
		1106	esrv_del_item (pl->contr, count);
		1107	}
988		1108
989	/* link the object above us */	1109	/* link the object above us */
990	if (above)	1110	if (above)
991	above->below = below;	1111	above->below = below;
992	else	1112	else
993	map->at (x, y).top = below; /* we were top, set new top */	1113	ms.top = below; /* we were top, set new top */
994		1114
995	/* Relink the object below us, if there is one */	1115	/* Relink the object below us, if there is one */
996	if (below)	1116	if (below)
997	below->above = above;	1117	below->above = above;
998	else	1118	else
…		…
1000	/* Nothing below, which means we need to relink map object for this space	1120	/* Nothing below, which means we need to relink map object for this space
1001	* use translated coordinates in case some oddness with map tiling is	1121	* use translated coordinates in case some oddness with map tiling is
1002	* evident	1122	* evident
1003	*/	1123	*/
1004	if (GET_MAP_OB (map, x, y) != this)	1124	if (GET_MAP_OB (map, x, y) != this)
1005	{
1006	char *dump = dump_object (this);
1007	LOG (llevError,
1008	"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);	1125	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 ());
1009	free (dump);
1010	dump = dump_object (GET_MAP_OB (map, x, y));
1011	LOG (llevError, "%s\n", dump);
1012	free (dump);
1013	}
1014		1126
1015	map->at (x, y).bot = above; /* goes on above it. */	1127	ms.bot = above; /* goes on above it. */
1016	}	1128	}
1017		1129
1018	above = 0;	1130	above = 0;
1019	below = 0;	1131	below = 0;
1020		1132
1021	if (map->in_memory == MAP_SAVING)	1133	if (map->in_memory == MAP_SAVING)
1022	return;	1134	return;
1023		1135
1024	int check_walk_off = !flag [FLAG_NO_APPLY];	1136	int check_walk_off = !flag [FLAG_NO_APPLY];
1025		1137
		1138	if (object *pl = ms.player ())
		1139	{
		1140	if (pl->container == this)
		1141	/* If a container that the player is currently using somehow gets
		1142	* removed (most likely destroyed), update the player view
		1143	* appropriately.
		1144	*/
		1145	pl->close_container ();
		1146
		1147	//TODO: the floorbox prev/next might need updating
		1148	//esrv_del_item (pl->contr, count);
		1149	//TODO: update floorbox to preserve ordering
		1150	if (pl->contr->ns)
		1151	pl->contr->ns->floorbox_update ();
		1152	}
		1153
1026	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1154	for (tmp = ms.bot; tmp; tmp = tmp->above)
1027	{	1155	{
1028	/* No point updating the players look faces if he is the object	1156	/* No point updating the players look faces if he is the object
1029	* being removed.	1157	* being removed.
1030	*/	1158	*/
1031		1159
1032	if (tmp->type == PLAYER && tmp != this)
1033	{
1034	/* If a container that the player is currently using somehow gets
1035	* removed (most likely destroyed), update the player view
1036	* appropriately.
1037	*/
1038	if (tmp->container == this)
1039	{
1040	flag [FLAG_APPLIED] = 0;
1041	tmp->container = 0;
1042	}
1043
1044	if (tmp->contr->ns)
1045	tmp->contr->ns->floorbox_update ();
1046	}
1047
1048	/* See if player moving off should effect something */	1160	/* See if object moving off should effect something */
1049	if (check_walk_off	1161	if (check_walk_off
1050	&& ((move_type & tmp->move_off)	1162	&& ((move_type & tmp->move_off)
1051	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1163	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1052	{	1164	{
1053	move_apply (tmp, this, 0);	1165	move_apply (tmp, this, 0);
1054		1166
1055	if (destroyed ())	1167	if (destroyed ())
1056	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1168	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1057	}	1169	}
1058		1170
1059	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1060
1061	if (tmp->above == tmp)
1062	tmp->above = 0;
1063
1064	last = tmp;	1171	last = tmp;
1065	}	1172	}
1066		1173
1067	/* last == NULL of there are no objects on this space */	1174	/* last == NULL if there are no objects on this space */
		1175	//TODO: this makes little sense, why only update the topmost object?
1068	if (!last)	1176	if (!last)
1069	map->at (x, y).flags_ = P_NEED_UPDATE;	1177	map->at (x, y).flags_ = 0;
1070	else	1178	else
1071	update_object (last, UP_OBJ_REMOVE);	1179	update_object (last, UP_OBJ_REMOVE);
1072		1180
1073	if (flag [FLAG_BLOCKSVIEW] || glow_radius)	1181	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1074	update_all_los (map, x, y);	1182	update_all_los (map, x, y);
…		…
1087	merge_ob (object *op, object *top)	1195	merge_ob (object *op, object *top)
1088	{	1196	{
1089	if (!op->nrof)	1197	if (!op->nrof)
1090	return 0;	1198	return 0;
1091		1199
1092	if (top)	1200	if (!top)
1093	for (top = op; top && top->above; top = top->above)	1201	for (top = op; top && top->above; top = top->above)
1094	;	1202	;
1095		1203
1096	for (; top; top = top->below)	1204	for (; top; top = top->below)
1097	{
1098	if (top == op)
1099	continue;
1100
1101	if (object::can_merge (op, top))	1205	if (object::can_merge (op, top))
1102	{	1206	{
1103	top->nrof += op->nrof;	1207	top->nrof += op->nrof;
1104		1208
1105	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1209	if (object *pl = top->visible_to ())
1106	op->weight = 0; /* Don't want any adjustements now */	1210	esrv_update_item (UPD_NROF, pl, top);
		1211
		1212	op->weight = 0; // cancel the addition above
		1213	op->carrying = 0; // must be 0 already
		1214
1107	op->destroy ();	1215	op->destroy (1);
		1216
1108	return top;	1217	return top;
1109	}	1218	}
1110	}
1111		1219
1112	return 0;	1220	return 0;
1113	}	1221	}
1114		1222
		1223	void
		1224	object::expand_tail ()
		1225	{
		1226	if (more)
		1227	return;
		1228
		1229	object *prev = this;
		1230
		1231	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1232	{
		1233	object *op = arch_to_object (at);
		1234
		1235	op->name = name;
		1236	op->name_pl = name_pl;
		1237	op->title = title;
		1238
		1239	op->head = this;
		1240	prev->more = op;
		1241
		1242	prev = op;
		1243	}
		1244	}
		1245
1115	/*	1246	/*
1116	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1247	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1117	* job preparing multi-part monsters	1248	* job preparing multi-part monsters.
1118	*/	1249	*/
1119	object *	1250	object *
1120	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1251	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1121	{	1252	{
1122	object *tmp;
1123
1124	if (op->head)
1125	op = op->head;
1126
1127	for (tmp = op; tmp; tmp = tmp->more)	1253	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1128	{	1254	{
1129	tmp->x = x + tmp->arch->clone.x;	1255	tmp->x = x + tmp->arch->x;
1130	tmp->y = y + tmp->arch->clone.y;	1256	tmp->y = y + tmp->arch->y;
1131	}	1257	}
1132		1258
1133	return insert_ob_in_map (op, m, originator, flag);	1259	return insert_ob_in_map (op, m, originator, flag);
1134	}	1260	}
1135		1261
…		…
1154	* just 'op' otherwise	1280	* just 'op' otherwise
1155	*/	1281	*/
1156	object *	1282	object *
1157	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1283	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1158	{	1284	{
1159	object *tmp, *top, *floor = NULL;	1285	assert (!op->flag [FLAG_FREED]);
1160	sint16 x, y;
1161		1286
1162	if (QUERY_FLAG (op, FLAG_FREED))	1287	op->remove ();
1163	{
1164	LOG (llevError, "Trying to insert freed object!\n");
1165	return NULL;
1166	}
1167
1168	if (m == NULL)
1169	{
1170	char *dump = dump_object (op);
1171	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1172	free (dump);
1173	return op;
1174	}
1175
1176	if (out_of_map (m, op->x, op->y))
1177	{
1178	char *dump = dump_object (op);
1179	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1180	#ifdef MANY_CORES
1181	/* Better to catch this here, as otherwise the next use of this object
1182	* is likely to cause a crash. Better to find out where it is getting
1183	* improperly inserted.
1184	*/
1185	abort ();
1186	#endif
1187	free (dump);
1188	return op;
1189	}
1190
1191	if (!QUERY_FLAG (op, FLAG_REMOVED))
1192	{
1193	char *dump = dump_object (op);
1194	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1195	free (dump);
1196	return op;
1197	}
1198
1199	if (op->more)
1200	{
1201	/* The part may be on a different map. */
1202
1203	object *more = op->more;
1204
1205	/* We really need the caller to normalize coordinates - if
1206	* we set the map, that doesn't work if the location is within
1207	* a map and this is straddling an edge. So only if coordinate
1208	* is clear wrong do we normalize it.
1209	*/
1210	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1211	more->map = get_map_from_coord (m, &more->x, &more->y);
1212	else if (!more->map)
1213	{
1214	/* For backwards compatibility - when not dealing with tiled maps,
1215	* more->map should always point to the parent.
1216	*/
1217	more->map = m;
1218	}
1219
1220	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1221	{
1222	if (!op->head)
1223	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1224
1225	return 0;
1226	}
1227	}
1228
1229	CLEAR_FLAG (op, FLAG_REMOVED);
1230		1288
1231	/* Ideally, the caller figures this out. However, it complicates a lot	1289	/* Ideally, the caller figures this out. However, it complicates a lot
1232	* of areas of callers (eg, anything that uses find_free_spot would now	1290	* of areas of callers (eg, anything that uses find_free_spot would now
1233	* need extra work	1291	* need extra work
1234	*/	1292	*/
1235	op->map = get_map_from_coord (m, &op->x, &op->y);	1293	if (!xy_normalise (m, op->x, op->y))
1236	x = op->x;	1294	{
1237	y = op->y;	1295	op->destroy (1);
		1296	return 0;
		1297	}
		1298
		1299	if (object *more = op->more)
		1300	if (!insert_ob_in_map (more, m, originator, flag))
		1301	return 0;
		1302
		1303	CLEAR_FLAG (op, FLAG_REMOVED);
		1304
		1305	op->map = m;
		1306	mapspace &ms = op->ms ();
1238		1307
1239	/* this has to be done after we translate the coordinates.	1308	/* this has to be done after we translate the coordinates.
1240	*/	1309	*/
1241	if (op->nrof && !(flag & INS_NO_MERGE))	1310	if (op->nrof && !(flag & INS_NO_MERGE))
1242	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1311	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1243	if (object::can_merge (op, tmp))	1312	if (object::can_merge (op, tmp))
1244	{	1313	{
		1314	// TODO: we atcually want to update tmp, not op,
		1315	// but some caller surely breaks when we return tmp
		1316	// from here :/
1245	op->nrof += tmp->nrof;	1317	op->nrof += tmp->nrof;
1246	tmp->destroy ();	1318	tmp->destroy (1);
1247	}	1319	}
1248		1320
1249	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1321	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1250	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1322	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1251		1323
…		…
1264	op->below = originator->below;	1336	op->below = originator->below;
1265		1337
1266	if (op->below)	1338	if (op->below)
1267	op->below->above = op;	1339	op->below->above = op;
1268	else	1340	else
1269	op->ms ().bot = op;	1341	ms.bot = op;
1270		1342
1271	/* since *below* originator, no need to update top */	1343	/* since *below* originator, no need to update top */
1272	originator->below = op;	1344	originator->below = op;
1273	}	1345	}
1274	else	1346	else
1275	{	1347	{
		1348	object *top, *floor = NULL;
		1349
		1350	top = ms.bot;
		1351
1276	/* If there are other objects, then */	1352	/* If there are other objects, then */
1277	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1353	if (top)
1278	{	1354	{
1279	object *last = NULL;	1355	object *last = 0;
1280		1356
1281	/*	1357	/*
1282	* If there are multiple objects on this space, we do some trickier handling.	1358	* If there are multiple objects on this space, we do some trickier handling.
1283	* We've already dealt with merging if appropriate.	1359	* We've already dealt with merging if appropriate.
1284	* Generally, we want to put the new object on top. But if	1360	* Generally, we want to put the new object on top. But if
…		…
1288	* once we get to them. This reduces the need to traverse over all of	1364	* once we get to them. This reduces the need to traverse over all of
1289	* them when adding another one - this saves quite a bit of cpu time	1365	* them when adding another one - this saves quite a bit of cpu time
1290	* when lots of spells are cast in one area. Currently, it is presumed	1366	* when lots of spells are cast in one area. Currently, it is presumed
1291	* that flying non pickable objects are spell objects.	1367	* that flying non pickable objects are spell objects.
1292	*/	1368	*/
1293		1369	for (top = ms.bot; top; top = top->above)
1294	while (top != NULL)
1295	{	1370	{
1296	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1371	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1297	floor = top;	1372	floor = top;
1298		1373
1299	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1374	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1302	top = top->below;	1377	top = top->below;
1303	break;	1378	break;
1304	}	1379	}
1305		1380
1306	last = top;	1381	last = top;
1307	top = top->above;
1308	}	1382	}
1309		1383
1310	/* Don't want top to be NULL, so set it to the last valid object */	1384	/* Don't want top to be NULL, so set it to the last valid object */
1311	top = last;	1385	top = last;
1312		1386
…		…
1314	* looks like instead of lots of conditions here.	1388	* looks like instead of lots of conditions here.
1315	* makes things faster, and effectively the same result.	1389	* makes things faster, and effectively the same result.
1316	*/	1390	*/
1317		1391
1318	/* Have object 'fall below' other objects that block view.	1392	/* Have object 'fall below' other objects that block view.
1319	* Unless those objects are exits, type 66	1393	* Unless those objects are exits.
1320	* If INS_ON_TOP is used, don't do this processing	1394	* If INS_ON_TOP is used, don't do this processing
1321	* Need to find the object that in fact blocks view, otherwise	1395	* Need to find the object that in fact blocks view, otherwise
1322	* stacking is a bit odd.	1396	* stacking is a bit odd.
1323	*/	1397	*/
1324	if (!(flag & INS_ON_TOP) &&	1398	if (!(flag & INS_ON_TOP)
1325	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1399	&& ms.flags () & P_BLOCKSVIEW
		1400	&& (op->face && !faces [op->face].visibility))
1326	{	1401	{
1327	for (last = top; last != floor; last = last->below)	1402	for (last = top; last != floor; last = last->below)
1328	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1403	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1329	break;	1404	break;
		1405
1330	/* Check to see if we found the object that blocks view,	1406	/* Check to see if we found the object that blocks view,
1331	* and make sure we have a below pointer for it so that	1407	* and make sure we have a below pointer for it so that
1332	* we can get inserted below this one, which requires we	1408	* we can get inserted below this one, which requires we
1333	* set top to the object below us.	1409	* set top to the object below us.
1334	*/	1410	*/
1335	if (last && last->below && last != floor)	1411	if (last && last->below && last != floor)
1336	top = last->below;	1412	top = last->below;
1337	}	1413	}
1338	} /* If objects on this space */	1414	} /* If objects on this space */
1339		1415
1340	if (flag & INS_MAP_LOAD)
1341	top = GET_MAP_TOP (op->map, op->x, op->y);
1342
1343	if (flag & INS_ABOVE_FLOOR_ONLY)	1416	if (flag & INS_ABOVE_FLOOR_ONLY)
1344	top = floor;	1417	top = floor;
1345		1418
1346	/* Top is the object that our object (op) is going to get inserted above.	1419	/* Top is the object that our object (op) is going to get inserted above.
1347	*/	1420	*/
1348		1421
1349	/* First object on this space */	1422	/* First object on this space */
1350	if (!top)	1423	if (!top)
1351	{	1424	{
1352	op->above = GET_MAP_OB (op->map, op->x, op->y);	1425	op->above = ms.bot;
1353		1426
1354	if (op->above)	1427	if (op->above)
1355	op->above->below = op;	1428	op->above->below = op;
1356		1429
1357	op->below = NULL;	1430	op->below = 0;
1358	op->ms ().bot = op;	1431	ms.bot = op;
1359	}	1432	}
1360	else	1433	else
1361	{ /* get inserted into the stack above top */	1434	{ /* get inserted into the stack above top */
1362	op->above = top->above;	1435	op->above = top->above;
1363		1436
…		…
1366		1439
1367	op->below = top;	1440	op->below = top;
1368	top->above = op;	1441	top->above = op;
1369	}	1442	}
1370		1443
1371	if (op->above == NULL)	1444	if (!op->above)
1372	op->ms ().top = op;	1445	ms.top = op;
1373	} /* else not INS_BELOW_ORIGINATOR */	1446	} /* else not INS_BELOW_ORIGINATOR */
1374		1447
1375	if (op->type == PLAYER)	1448	if (op->type == PLAYER)
		1449	{
1376	op->contr->do_los = 1;	1450	op->contr->do_los = 1;
		1451	++op->map->players;
		1452	op->map->touch ();
		1453	}
1377		1454
1378	/* If we have a floor, we know the player, if any, will be above	1455	op->map->dirty = true;
1379	* it, so save a few ticks and start from there.	1456
1380	*/
1381	if (!(flag & INS_MAP_LOAD))
1382	if (object *pl = op->ms ().player ())	1457	if (object *pl = ms.player ())
		1458	//TODO: the floorbox prev/next might need updating
		1459	//esrv_send_item (pl, op);
		1460	//TODO: update floorbox to preserve ordering
1383	if (pl->contr->ns)	1461	if (pl->contr->ns)
1384	pl->contr->ns->floorbox_update ();	1462	pl->contr->ns->floorbox_update ();
1385		1463
1386	/* If this object glows, it may affect lighting conditions that are	1464	/* If this object glows, it may affect lighting conditions that are
1387	* visible to others on this map. But update_all_los is really	1465	* visible to others on this map. But update_all_los is really
1388	* an inefficient way to do this, as it means los for all players	1466	* an inefficient way to do this, as it means los for all players
1389	* on the map will get recalculated. The players could very well	1467	* on the map will get recalculated. The players could very well
1390	* be far away from this change and not affected in any way -	1468	* be far away from this change and not affected in any way -
1391	* this should get redone to only look for players within range,	1469	* this should get redone to only look for players within range,
1392	* or just updating the P_NEED_UPDATE for spaces within this area	1470	* or just updating the P_UPTODATE for spaces within this area
1393	* of effect may be sufficient.	1471	* of effect may be sufficient.
1394	*/	1472	*/
1395	if (op->map->darkness && (op->glow_radius != 0))	1473	if (op->map->darkness && (op->glow_radius != 0))
1396	update_all_los (op->map, op->x, op->y);	1474	update_all_los (op->map, op->x, op->y);
1397		1475
…		…
1408	* blocked() and wall() work properly), and these flags are updated by	1486	* blocked() and wall() work properly), and these flags are updated by
1409	* update_object().	1487	* update_object().
1410	*/	1488	*/
1411		1489
1412	/* if this is not the head or flag has been passed, don't check walk on status */	1490	/* if this is not the head or flag has been passed, don't check walk on status */
1413	if (!(flag & INS_NO_WALK_ON) && !op->head)	1491	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1414	{	1492	{
1415	if (check_move_on (op, originator))	1493	if (check_move_on (op, originator))
1416	return 0;	1494	return 0;
1417		1495
1418	/* If we are a multi part object, lets work our way through the check	1496	/* If we are a multi part object, lets work our way through the check
1419	* walk on's.	1497	* walk on's.
1420	*/	1498	*/
1421	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1499	for (object *tmp = op->more; tmp; tmp = tmp->more)
1422	if (check_move_on (tmp, originator))	1500	if (check_move_on (tmp, originator))
1423	return 0;	1501	return 0;
1424	}	1502	}
1425		1503
1426	return op;	1504	return op;
…		…
1431	* op is the object to insert it under: supplies x and the map.	1509	* op is the object to insert it under: supplies x and the map.
1432	*/	1510	*/
1433	void	1511	void
1434	replace_insert_ob_in_map (const char *arch_string, object *op)	1512	replace_insert_ob_in_map (const char *arch_string, object *op)
1435	{	1513	{
1436	object *tmp, *tmp1;
1437
1438	/* first search for itself and remove any old instances */	1514	/* first search for itself and remove any old instances */
1439		1515
1440	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1516	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1441	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1517	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1442	tmp->destroy ();	1518	tmp->destroy (1);
1443		1519
1444	tmp1 = arch_to_object (archetype::find (arch_string));	1520	object *tmp = arch_to_object (archetype::find (arch_string));
1445		1521
1446	tmp1->x = op->x;	1522	tmp->x = op->x;
1447	tmp1->y = op->y;	1523	tmp->y = op->y;
		1524
1448	insert_ob_in_map (tmp1, op->map, op, 0);	1525	insert_ob_in_map (tmp, op->map, op, 0);
1449	}	1526	}
1450
1451	/*
1452	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1453	* is returned contains nr objects, and the remaining parts contains
1454	* the rest (or is removed and freed if that number is 0).
1455	* On failure, NULL is returned, and the reason put into the
1456	* global static errmsg array.
1457	*/
1458		1527
1459	object *	1528	object *
1460	get_split_ob (object *orig_ob, uint32 nr)	1529	object::insert_at (object *where, object *originator, int flags)
1461	{	1530	{
1462	object *newob;	1531	if (where->env)
1463	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1532	return where->env->insert (this);
1464		1533	else
1465	if (orig_ob->nrof < nr)	1534	return where->map->insert (this, where->x, where->y, originator, flags);
1466	{
1467	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1468	return NULL;
1469	}
1470
1471	newob = object_create_clone (orig_ob);
1472
1473	if ((orig_ob->nrof -= nr) < 1)
1474	orig_ob->destroy (1);
1475	else if (!is_removed)
1476	{
1477	if (orig_ob->env != NULL)
1478	sub_weight (orig_ob->env, orig_ob->weight * nr);
1479	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1480	{
1481	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1482	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1483	return NULL;
1484	}
1485	}
1486
1487	newob->nrof = nr;
1488
1489	return newob;
1490	}	1535	}
1491		1536
1492	/*	1537	/*
1493	* decrease_ob_nr(object, number) decreases a specified number from	1538	* decrease(object, number) decreases a specified number from
1494	* the amount of an object. If the amount reaches 0, the object	1539	* the amount of an object. If the amount reaches 0, the object
1495	* is subsequently removed and freed.	1540	* is subsequently removed and freed.
1496	*	1541	*
1497	* Return value: 'op' if something is left, NULL if the amount reached 0	1542	* Return value: 'op' if something is left, NULL if the amount reached 0
1498	*/	1543	*/
		1544	bool
		1545	object::decrease (sint32 nr)
		1546	{
		1547	if (!nr)
		1548	return true;
1499		1549
		1550	nr = min (nr, nrof);
		1551
		1552	nrof -= nr;
		1553
		1554	if (nrof)
		1555	{
		1556	adjust_weight (env, -weight * nr); // carrying == 0
		1557
		1558	if (object *pl = visible_to ())
		1559	esrv_update_item (UPD_NROF, pl, this);
		1560
		1561	return true;
		1562	}
		1563	else
		1564	{
		1565	destroy (1);
		1566	return false;
		1567	}
		1568	}
		1569
		1570	/*
		1571	* split(ob,nr) splits up ob into two parts. The part which
		1572	* is returned contains nr objects, and the remaining parts contains
		1573	* the rest (or is removed and returned if that number is 0).
		1574	* On failure, NULL is returned.
		1575	*/
1500	object *	1576	object *
1501	decrease_ob_nr (object *op, uint32 i)	1577	object::split (sint32 nr)
1502	{	1578	{
1503	object *tmp;	1579	int have = number_of ();
1504		1580
1505	if (i == 0) /* objects with op->nrof require this check */	1581	if (have < nr)
1506	return op;	1582	return 0;
1507		1583	else if (have == nr)
1508	if (i > op->nrof)
1509	i = op->nrof;
1510
1511	if (QUERY_FLAG (op, FLAG_REMOVED))
1512	op->nrof -= i;
1513	else if (op->env)
1514	{	1584	{
1515	/* is this object in the players inventory, or sub container
1516	* therein?
1517	*/
1518	tmp = op->in_player ();
1519	/* nope. Is this a container the player has opened?
1520	* If so, set tmp to that player.
1521	* IMO, searching through all the players will mostly
1522	* likely be quicker than following op->env to the map,
1523	* and then searching the map for a player.
1524	*/
1525	if (!tmp)
1526	for_all_players (pl)
1527	if (pl->ob->container == op->env)
1528	{
1529	tmp = pl->ob;
1530	break;
1531	}
1532
1533	if (i < op->nrof)
1534	{
1535	sub_weight (op->env, op->weight * i);
1536	op->nrof -= i;
1537	if (tmp)
1538	esrv_send_item (tmp, op);
1539	}
1540	else
1541	{
1542	op->remove ();	1585	remove ();
1543	op->nrof = 0;	1586	return this;
1544	if (tmp)
1545	esrv_del_item (tmp->contr, op->count);
1546	}
1547	}	1587	}
1548	else	1588	else
1549	{	1589	{
1550	object *above = op->above;	1590	decrease (nr);
1551		1591
1552	if (i < op->nrof)	1592	object *op = object_create_clone (this);
1553	op->nrof -= i;	1593	op->nrof = nr;
1554	else
1555	{
1556	op->remove ();
1557	op->nrof = 0;
1558	}
1559
1560	/* Since we just removed op, op->above is null */
1561	for (tmp = above; tmp; tmp = tmp->above)
1562	if (tmp->type == PLAYER)
1563	{
1564	if (op->nrof)
1565	esrv_send_item (tmp, op);
1566	else
1567	esrv_del_item (tmp->contr, op->count);
1568	}
1569	}
1570
1571	if (op->nrof)
1572	return op;	1594	return op;
1573	else
1574	{
1575	op->destroy ();
1576	return 0;
1577	}
1578	}
1579
1580	/*
1581	* add_weight(object, weight) adds the specified weight to an object,
1582	* and also updates how much the environment(s) is/are carrying.
1583	*/
1584
1585	void
1586	add_weight (object *op, signed long weight)
1587	{
1588	while (op != NULL)
1589	{
1590	if (op->type == CONTAINER)
1591	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1592
1593	op->carrying += weight;
1594	op = op->env;
1595	}	1595	}
1596	}	1596	}
1597		1597
1598	object *	1598	object *
1599	insert_ob_in_ob (object *op, object *where)	1599	insert_ob_in_ob (object *op, object *where)
…		…
1604	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1604	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1605	free (dump);	1605	free (dump);
1606	return op;	1606	return op;
1607	}	1607	}
1608		1608
1609	if (where->head)	1609	if (where->head_ () != where)
1610	{	1610	{
1611	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1611	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1612	where = where->head;	1612	where = where->head;
1613	}	1613	}
1614		1614
1615	return where->insert (op);	1615	return where->insert (op);
1616	}	1616	}
…		…
1621	* inside the object environment.	1621	* inside the object environment.
1622	*	1622	*
1623	* The function returns now pointer to inserted item, and return value can	1623	* The function returns now pointer to inserted item, and return value can
1624	* be != op, if items are merged. -Tero	1624	* be != op, if items are merged. -Tero
1625	*/	1625	*/
1626
1627	object *	1626	object *
1628	object::insert (object *op)	1627	object::insert (object *op)
1629	{	1628	{
1630	object *tmp, *otmp;
1631
1632	if (!QUERY_FLAG (op, FLAG_REMOVED))
1633	op->remove ();
1634
1635	if (op->more)	1629	if (op->more)
1636	{	1630	{
1637	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1631	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1638	return op;	1632	return op;
1639	}	1633	}
1640		1634
1641	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1635	op->remove ();
1642	CLEAR_FLAG (op, FLAG_REMOVED);	1636
		1637	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1638
1643	if (op->nrof)	1639	if (op->nrof)
1644	{
1645	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1640	for (object *tmp = inv; tmp; tmp = tmp->below)
1646	if (object::can_merge (tmp, op))	1641	if (object::can_merge (tmp, op))
1647	{	1642	{
1648	/* return the original object and remove inserted object	1643	/* return the original object and remove inserted object
1649	(client needs the original object) */	1644	(client needs the original object) */
1650	tmp->nrof += op->nrof;	1645	tmp->nrof += op->nrof;
1651	/* Weight handling gets pretty funky. Since we are adding to	1646
1652	* tmp->nrof, we need to increase the weight.	1647	if (object *pl = tmp->visible_to ())
1653	*/	1648	esrv_update_item (UPD_NROF, pl, tmp);
		1649
1654	add_weight (this, op->weight * op->nrof);	1650	adjust_weight (this, op->total_weight ());
1655	SET_FLAG (op, FLAG_REMOVED);	1651
1656	op->destroy (); /* free the inserted object */	1652	op->destroy (1);
1657	op = tmp;	1653	op = tmp;
1658	op->remove (); /* and fix old object's links */	1654	goto inserted;
1659	CLEAR_FLAG (op, FLAG_REMOVED);
1660	break;
1661	}	1655	}
1662		1656
1663	/* I assume combined objects have no inventory	1657	op->owner = 0; // it's his/hers now. period.
1664	* We add the weight - this object could have just been removed
1665	* (if it was possible to merge). calling remove_ob will subtract
1666	* the weight, so we need to add it in again, since we actually do
1667	* the linking below
1668	*/
1669	add_weight (this, op->weight * op->nrof);
1670	}
1671	else
1672	add_weight (this, (op->weight + op->carrying));
1673
1674	otmp = this->in_player ();
1675	if (otmp && otmp->contr)
1676	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1677	otmp->update_stats ();
1678
1679	op->map = 0;	1658	op->map = 0;
1680	op->env = this;	1659	op->x = 0;
		1660	op->y = 0;
		1661
1681	op->above = 0;	1662	op->above = 0;
1682	op->below = 0;	1663	op->below = inv;
1683	op->x = 0, op->y = 0;	1664	op->env = this;
1684		1665
		1666	if (inv)
		1667	inv->above = op;
		1668
		1669	inv = op;
		1670
		1671	op->flag [FLAG_REMOVED] = 0;
		1672
		1673	if (object *pl = op->visible_to ())
		1674	esrv_send_item (pl, op);
		1675
		1676	adjust_weight (this, op->total_weight ());
		1677
		1678	inserted:
1685	/* reset the light list and los of the players on the map */	1679	/* reset the light list and los of the players on the map */
1686	if ((op->glow_radius != 0) && map)	1680	if (op->glow_radius && map && map->darkness)
1687	{
1688	#ifdef DEBUG_LIGHTS
1689	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1690	#endif /* DEBUG_LIGHTS */
1691	if (map->darkness)
1692	update_all_los (map, x, y);	1681	update_all_los (map, x, y);
1693	}
1694		1682
1695	/* Client has no idea of ordering so lets not bother ordering it here.	1683	// if this is a player's inventory, update stats
1696	* It sure simplifies this function...	1684	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1697	*/	1685	update_stats ();
1698	if (!inv)
1699	inv = op;
1700	else
1701	{
1702	op->below = inv;
1703	op->below->above = op;
1704	inv = op;
1705	}
1706		1686
1707	INVOKE_OBJECT (INSERT, this);	1687	INVOKE_OBJECT (INSERT, this);
1708		1688
1709	return op;	1689	return op;
1710	}	1690	}
…		…
1727	*	1707	*
1728	* MSW 2001-07-08: Check all objects on space, not just those below	1708	* MSW 2001-07-08: Check all objects on space, not just those below
1729	* object being inserted. insert_ob_in_map may not put new objects	1709	* object being inserted. insert_ob_in_map may not put new objects
1730	* on top.	1710	* on top.
1731	*/	1711	*/
1732
1733	int	1712	int
1734	check_move_on (object *op, object *originator)	1713	check_move_on (object *op, object *originator)
1735	{	1714	{
1736	object *tmp;	1715	object *tmp;
1737	maptile *m = op->map;	1716	maptile *m = op->map;
…		…
1764		1743
1765	/* The objects have to be checked from top to bottom.	1744	/* The objects have to be checked from top to bottom.
1766	* Hence, we first go to the top:	1745	* Hence, we first go to the top:
1767	*/	1746	*/
1768		1747
1769	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above)	1748	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1770	{	1749	{
1771	/* Trim the search when we find the first other spell effect	1750	/* Trim the search when we find the first other spell effect
1772	* this helps performance so that if a space has 50 spell objects,	1751	* this helps performance so that if a space has 50 spell objects,
1773	* we don't need to check all of them.	1752	* we don't need to check all of them.
1774	*/	1753	*/
…		…
1792	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1771	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1793	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1772	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1794	{	1773	{
1795		1774
1796	float	1775	float
1797	diff = tmp->move_slow_penalty * FABS (op->speed);	1776	diff = tmp->move_slow_penalty * fabs (op->speed);
1798		1777
1799	if (op->type == PLAYER)	1778	if (op->type == PLAYER)
1800	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1779	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1801	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1780	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1802	diff /= 4.0;	1781	diff /= 4.0;
…		…
1832	* The first matching object is returned, or NULL if none.	1811	* The first matching object is returned, or NULL if none.
1833	*/	1812	*/
1834	object *	1813	object *
1835	present_arch (const archetype *at, maptile *m, int x, int y)	1814	present_arch (const archetype *at, maptile *m, int x, int y)
1836	{	1815	{
1837	if (m == NULL || out_of_map (m, x, y))	1816	if (!m || out_of_map (m, x, y))
1838	{	1817	{
1839	LOG (llevError, "Present_arch called outside map.\n");	1818	LOG (llevError, "Present_arch called outside map.\n");
1840	return NULL;	1819	return NULL;
1841	}	1820	}
1842		1821
1843	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1822	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1844	if (tmp->arch == at)	1823	if (tmp->arch == at)
1845	return tmp;	1824	return tmp;
1846		1825
1847	return NULL;	1826	return NULL;
1848	}	1827	}
…		…
1859	{	1838	{
1860	LOG (llevError, "Present called outside map.\n");	1839	LOG (llevError, "Present called outside map.\n");
1861	return NULL;	1840	return NULL;
1862	}	1841	}
1863		1842
1864	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1843	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1865	if (tmp->type == type)	1844	if (tmp->type == type)
1866	return tmp;	1845	return tmp;
1867		1846
1868	return NULL;	1847	return NULL;
1869	}	1848	}
…		…
1926	* activate recursively a flag on an object inventory	1905	* activate recursively a flag on an object inventory
1927	*/	1906	*/
1928	void	1907	void
1929	flag_inv (object *op, int flag)	1908	flag_inv (object *op, int flag)
1930	{	1909	{
1931	if (op->inv)
1932	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1910	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1933	{	1911	{
1934	SET_FLAG (tmp, flag);	1912	SET_FLAG (tmp, flag);
1935	flag_inv (tmp, flag);	1913	flag_inv (tmp, flag);
1936	}	1914	}
1937	}	1915	}
1938		1916
1939	/*	1917	/*
1940	* deactivate recursively a flag on an object inventory	1918	* deactivate recursively a flag on an object inventory
1941	*/	1919	*/
1942	void	1920	void
1943	unflag_inv (object *op, int flag)	1921	unflag_inv (object *op, int flag)
1944	{	1922	{
1945	if (op->inv)
1946	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1923	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1947	{	1924	{
1948	CLEAR_FLAG (tmp, flag);	1925	CLEAR_FLAG (tmp, flag);
1949	unflag_inv (tmp, flag);	1926	unflag_inv (tmp, flag);
1950	}	1927	}
1951	}
1952
1953	/*
1954	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1955	* all it's inventory (recursively).
1956	* If checksums are used, a player will get set_cheat called for
1957	* him/her-self and all object carried by a call to this function.
1958	*/
1959	void
1960	set_cheat (object *op)
1961	{
1962	SET_FLAG (op, FLAG_WAS_WIZ);
1963	flag_inv (op, FLAG_WAS_WIZ);
1964	}	1928	}
1965		1929
1966	/*	1930	/*
1967	* find_free_spot(object, map, x, y, start, stop) will search for	1931	* find_free_spot(object, map, x, y, start, stop) will search for
1968	* a spot at the given map and coordinates which will be able to contain	1932	* a spot at the given map and coordinates which will be able to contain
…		…
1970	* to search (see the freearr_x/y[] definition).	1934	* to search (see the freearr_x/y[] definition).
1971	* It returns a random choice among the alternatives found.	1935	* It returns a random choice among the alternatives found.
1972	* start and stop are where to start relative to the free_arr array (1,9	1936	* start and stop are where to start relative to the free_arr array (1,9
1973	* does all 4 immediate directions). This returns the index into the	1937	* does all 4 immediate directions). This returns the index into the
1974	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1938	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1975	* Note - this only checks to see if there is space for the head of the
1976	* object - if it is a multispace object, this should be called for all
1977	* pieces.
1978	* Note2: This function does correctly handle tiled maps, but does not	1939	* Note: This function does correctly handle tiled maps, but does not
1979	* inform the caller. However, insert_ob_in_map will update as	1940	* inform the caller. However, insert_ob_in_map will update as
1980	* necessary, so the caller shouldn't need to do any special work.	1941	* necessary, so the caller shouldn't need to do any special work.
1981	* Note - updated to take an object instead of archetype - this is necessary	1942	* Note - updated to take an object instead of archetype - this is necessary
1982	* because arch_blocked (now ob_blocked) needs to know the movement type	1943	* because arch_blocked (now ob_blocked) needs to know the movement type
1983	* to know if the space in question will block the object. We can't use	1944	* to know if the space in question will block the object. We can't use
…		…
1985	* customized, changed states, etc.	1946	* customized, changed states, etc.
1986	*/	1947	*/
1987	int	1948	int
1988	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1949	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
1989	{	1950	{
		1951	int altern[SIZEOFFREE];
1990	int index = 0, flag;	1952	int index = 0, flag;
1991	int altern[SIZEOFFREE];
1992		1953
1993	for (int i = start; i < stop; i++)	1954	for (int i = start; i < stop; i++)
1994	{	1955	{
1995	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1956	mapxy pos (m, x, y); pos.move (i);
1996	if (!flag)	1957
		1958	if (!pos.normalise ())
		1959	continue;
		1960
		1961	mapspace &ms = *pos;
		1962
		1963	if (ms.flags () & P_IS_ALIVE)
		1964	continue;
		1965
		1966	/* However, often
		1967	* ob doesn't have any move type (when used to place exits)
		1968	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1969	*/
		1970	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1971	{
1997	altern [index++] = i;	1972	altern [index++] = i;
		1973	continue;
		1974	}
1998		1975
1999	/* Basically, if we find a wall on a space, we cut down the search size.	1976	/* Basically, if we find a wall on a space, we cut down the search size.
2000	* In this way, we won't return spaces that are on another side of a wall.	1977	* In this way, we won't return spaces that are on another side of a wall.
2001	* This mostly work, but it cuts down the search size in all directions -	1978	* This mostly work, but it cuts down the search size in all directions -
2002	* if the space being examined only has a wall to the north and empty	1979	* if the space being examined only has a wall to the north and empty
2003	* spaces in all the other directions, this will reduce the search space	1980	* spaces in all the other directions, this will reduce the search space
2004	* to only the spaces immediately surrounding the target area, and	1981	* to only the spaces immediately surrounding the target area, and
2005	* won't look 2 spaces south of the target space.	1982	* won't look 2 spaces south of the target space.
2006	*/	1983	*/
2007	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1984	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1985	{
2008	stop = maxfree[i];	1986	stop = maxfree[i];
		1987	continue;
		1988	}
		1989
		1990	/* Note it is intentional that we check ob - the movement type of the
		1991	* head of the object should correspond for the entire object.
		1992	*/
		1993	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1994	continue;
		1995
		1996	if (ob->blocked (m, pos.x, pos.y))
		1997	continue;
		1998
		1999	altern [index++] = i;
2009	}	2000	}
2010		2001
2011	if (!index)	2002	if (!index)
2012	return -1;	2003	return -1;
2013		2004
2014	return altern[RANDOM () % index];	2005	return altern [rndm (index)];
2015	}	2006	}
2016		2007
2017	/*	2008	/*
2018	* find_first_free_spot(archetype, maptile, x, y) works like	2009	* find_first_free_spot(archetype, maptile, x, y) works like
2019	* find_free_spot(), but it will search max number of squares.	2010	* find_free_spot(), but it will search max number of squares.
…		…
2022	*/	2013	*/
2023	int	2014	int
2024	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2015	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2025	{	2016	{
2026	for (int i = 0; i < SIZEOFFREE; i++)	2017	for (int i = 0; i < SIZEOFFREE; i++)
2027	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2018	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2028	return i;	2019	return i;
2029		2020
2030	return -1;	2021	return -1;
2031	}	2022	}
2032		2023
…		…
2040	{	2031	{
2041	arr += begin;	2032	arr += begin;
2042	end -= begin;	2033	end -= begin;
2043		2034
2044	while (--end)	2035	while (--end)
2045	swap (arr [end], arr [RANDOM () % (end + 1)]);	2036	swap (arr [end], arr [rndm (end + 1)]);
2046	}	2037	}
2047		2038
2048	/* new function to make monster searching more efficient, and effective!	2039	/* new function to make monster searching more efficient, and effective!
2049	* This basically returns a randomized array (in the passed pointer) of	2040	* This basically returns a randomized array (in the passed pointer) of
2050	* the spaces to find monsters. In this way, it won't always look for	2041	* the spaces to find monsters. In this way, it won't always look for
…		…
2086	object *tmp;	2077	object *tmp;
2087	maptile *mp;	2078	maptile *mp;
2088		2079
2089	MoveType blocked, move_type;	2080	MoveType blocked, move_type;
2090		2081
2091	if (exclude && exclude->head)	2082	if (exclude && exclude->head_ () != exclude)
2092	{	2083	{
2093	exclude = exclude->head;	2084	exclude = exclude->head;
2094	move_type = exclude->move_type;	2085	move_type = exclude->move_type;
2095	}	2086	}
2096	else	2087	else
…		…
2119	max = maxfree[i];	2110	max = maxfree[i];
2120	else if (mflags & P_IS_ALIVE)	2111	else if (mflags & P_IS_ALIVE)
2121	{	2112	{
2122	for (tmp = ms.bot; tmp; tmp = tmp->above)	2113	for (tmp = ms.bot; tmp; tmp = tmp->above)
2123	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2114	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2124	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2115	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2125	break;	2116	break;
2126		2117
2127	if (tmp)	2118	if (tmp)
2128	return freedir[i];	2119	return freedir[i];
2129	}	2120	}
…		…
2184		2175
2185	return 3;	2176	return 3;
2186	}	2177	}
2187		2178
2188	/*	2179	/*
2189	* absdir(int): Returns a number between 1 and 8, which represent
2190	* the "absolute" direction of a number (it actually takes care of
2191	* "overflow" in previous calculations of a direction).
2192	*/
2193
2194	int
2195	absdir (int d)
2196	{
2197	while (d < 1)
2198	d += 8;
2199
2200	while (d > 8)
2201	d -= 8;
2202
2203	return d;
2204	}
2205
2206	/*
2207	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2180	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2208	* between two directions (which are expected to be absolute (see absdir())	2181	* between two directions (which are expected to be absolute (see absdir())
2209	*/	2182	*/
2210
2211	int	2183	int
2212	dirdiff (int dir1, int dir2)	2184	dirdiff (int dir1, int dir2)
2213	{	2185	{
2214	int d;	2186	int d;
2215		2187
…		…
2328	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2300	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2329	* core dumps if they do.	2301	* core dumps if they do.
2330	*	2302	*
2331	* Add a check so we can't pick up invisible objects (0.93.8)	2303	* Add a check so we can't pick up invisible objects (0.93.8)
2332	*/	2304	*/
2333
2334	int	2305	int
2335	can_pick (const object *who, const object *item)	2306	can_pick (const object *who, const object *item)
2336	{	2307	{
2337	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2308	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2338	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2309	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2343	* create clone from object to another	2314	* create clone from object to another
2344	*/	2315	*/
2345	object *	2316	object *
2346	object_create_clone (object *asrc)	2317	object_create_clone (object *asrc)
2347	{	2318	{
2348	object *dst = 0, *tmp, *src, *part, *prev, *item;	2319	object *dst = 0;
2349		2320
2350	if (!asrc)	2321	if (!asrc)
2351	return 0;	2322	return 0;
2352		2323
2353	src = asrc;	2324	object *src = asrc->head_ ();
2354	if (src->head)
2355	src = src->head;
2356		2325
2357	prev = 0;	2326	object *prev = 0;
2358	for (part = src; part; part = part->more)	2327	for (object *part = src; part; part = part->more)
2359	{	2328	{
2360	tmp = part->clone ();	2329	object *tmp = part->clone ();
		2330
2361	tmp->x -= src->x;	2331	tmp->x -= src->x;
2362	tmp->y -= src->y;	2332	tmp->y -= src->y;
2363		2333
2364	if (!part->head)	2334	if (!part->head)
2365	{	2335	{
…		…
2375	prev->more = tmp;	2345	prev->more = tmp;
2376		2346
2377	prev = tmp;	2347	prev = tmp;
2378	}	2348	}
2379		2349
2380	for (item = src->inv; item; item = item->below)	2350	for (object *item = src->inv; item; item = item->below)
2381	insert_ob_in_ob (object_create_clone (item), dst);	2351	insert_ob_in_ob (object_create_clone (item), dst);
2382		2352
2383	return dst;	2353	return dst;
2384	}
2385
2386	/* GROS - Creates an object using a string representing its content. */
2387	/* Basically, we save the content of the string to a temp file, then call */
2388	/* load_object on it. I admit it is a highly inefficient way to make things, */
2389	/* but it was simple to make and allows reusing the load_object function. */
2390	/* Remember not to use load_object_str in a time-critical situation. */
2391	/* Also remember that multiparts objects are not supported for now. */
2392	object *
2393	load_object_str (const char *obstr)
2394	{
2395	object *op;
2396	char filename[MAX_BUF];
2397
2398	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2399
2400	FILE *tempfile = fopen (filename, "w");
2401
2402	if (tempfile == NULL)
2403	{
2404	LOG (llevError, "Error - Unable to access load object temp file\n");
2405	return NULL;
2406	}
2407
2408	fprintf (tempfile, obstr);
2409	fclose (tempfile);
2410
2411	op = object::create ();
2412
2413	object_thawer thawer (filename);
2414
2415	if (thawer)
2416	load_object (thawer, op, 0);
2417
2418	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2419	CLEAR_FLAG (op, FLAG_REMOVED);
2420
2421	return op;
2422	}	2354	}
2423		2355
2424	/* This returns the first object in who's inventory that	2356	/* This returns the first object in who's inventory that
2425	* has the same type and subtype match.	2357	* has the same type and subtype match.
2426	* returns NULL if no match.	2358	* returns NULL if no match.
…		…
2433	return tmp;	2365	return tmp;
2434		2366
2435	return 0;	2367	return 0;
2436	}	2368	}
2437		2369
2438	/* If ob has a field named key, return the link from the list,	2370	const shstr &
2439	* otherwise return NULL.	2371	object::kv_get (const shstr &key) const
2440	*
2441	* key must be a passed in shared string - otherwise, this won't
2442	* do the desired thing.
2443	*/
2444	key_value *
2445	get_ob_key_link (const object *ob, const char *key)
2446	{	2372	{
2447	for (key_value *link = ob->key_values; link; link = link->next)	2373	for (key_value *kv = key_values; kv; kv = kv->next)
2448	if (link->key == key)	2374	if (kv->key == key)
2449	return link;
2450
2451	return 0;
2452	}
2453
2454	/*
2455	* Returns the value of op has an extra_field for key, or NULL.
2456	*
2457	* The argument doesn't need to be a shared string.
2458	*
2459	* The returned string is shared.
2460	*/
2461	const char *
2462	get_ob_key_value (const object *op, const char *const key)
2463	{
2464	key_value *link;
2465	shstr_cmp canonical_key (key);
2466
2467	if (!canonical_key)
2468	{
2469	/* 1. There being a field named key on any object
2470	* implies there'd be a shared string to find.
2471	* 2. Since there isn't, no object has this field.
2472	* 3. Therefore, *this* object doesn't have this field.
2473	*/
2474	return 0;
2475	}
2476
2477	/* This is copied from get_ob_key_link() above -
2478	* only 4 lines, and saves the function call overhead.
2479	*/
2480	for (link = op->key_values; link; link = link->next)
2481	if (link->key == canonical_key)
2482	return link->value;	2375	return kv->value;
2483		2376
2484	return 0;	2377	return shstr_null;
2485	}	2378	}
2486		2379
2487		2380	void
2488	/*	2381	object::kv_set (const shstr &key, const shstr &value)
2489	* Updates the canonical_key in op to value.
2490	*
2491	* canonical_key is a shared string (value doesn't have to be).
2492	*
2493	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2494	* keys.
2495	*
2496	* Returns TRUE on success.
2497	*/
2498	int
2499	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2500	{	2382	{
2501	key_value *field = NULL, *last = NULL;	2383	for (key_value *kv = key_values; kv; kv = kv->next)
2502		2384	if (kv->key == key)
2503	for (field = op->key_values; field != NULL; field = field->next)
2504	{
2505	if (field->key != canonical_key)
2506	{	2385	{
2507	last = field;	2386	kv->value = value;
2508	continue;	2387	return;
2509	}	2388	}
2510		2389
2511	if (value)	2390	key_value *kv = new key_value;
2512	field->value = value;	2391
2513	else	2392	kv->next = key_values;
		2393	kv->key = key;
		2394	kv->value = value;
		2395
		2396	key_values = kv;
		2397	}
		2398
		2399	void
		2400	object::kv_del (const shstr &key)
		2401	{
		2402	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2403	if ((*kvp)->key == key)
2514	{	2404	{
2515	/* Basically, if the archetype has this key set,	2405	key_value *kv = *kvp;
2516	* we need to store the null value so when we save	2406	*kvp = (*kvp)->next;
2517	* it, we save the empty value so that when we load,	2407	delete kv;
2518	* we get this value back again.	2408	return;
2519	*/
2520	if (get_ob_key_link (&op->arch->clone, canonical_key))
2521	field->value = 0;
2522	else
2523	{
2524	if (last)
2525	last->next = field->next;
2526	else
2527	op->key_values = field->next;
2528
2529	delete field;
2530	}
2531	}	2409	}
2532	return TRUE;
2533	}
2534	/* IF we get here, key doesn't exist */
2535
2536	/* No field, we'll have to add it. */
2537
2538	if (!add_key)
2539	return FALSE;
2540
2541	/* There isn't any good reason to store a null
2542	* value in the key/value list. If the archetype has
2543	* this key, then we should also have it, so shouldn't
2544	* be here. If user wants to store empty strings,
2545	* should pass in ""
2546	*/
2547	if (value == NULL)
2548	return TRUE;
2549
2550	field = new key_value;
2551
2552	field->key = canonical_key;
2553	field->value = value;
2554	/* Usual prepend-addition. */
2555	field->next = op->key_values;
2556	op->key_values = field;
2557
2558	return TRUE;
2559	}
2560
2561	/*
2562	* Updates the key in op to value.
2563	*
2564	* If add_key is FALSE, this will only update existing keys,
2565	* and not add new ones.
2566	* In general, should be little reason FALSE is ever passed in for add_key
2567	*
2568	* Returns TRUE on success.
2569	*/
2570	int
2571	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2572	{
2573	shstr key_ (key);
2574
2575	return set_ob_key_value_s (op, key_, value, add_key);
2576	}	2410	}
2577		2411
2578	object::depth_iterator::depth_iterator (object *container)	2412	object::depth_iterator::depth_iterator (object *container)
2579	: iterator_base (container)	2413	: iterator_base (container)
2580	{	2414	{
…		…
2594	}	2428	}
2595	else	2429	else
2596	item = item->env;	2430	item = item->env;
2597	}	2431	}
2598		2432
		2433	const char *
		2434	object::flag_desc (char *desc, int len) const
		2435	{
		2436	char *p = desc;
		2437	bool first = true;
		2438
		2439	*p = 0;
		2440
		2441	for (int i = 0; i < NUM_FLAGS; i++)
		2442	{
		2443	if (len <= 10) // magic constant!
		2444	{
		2445	snprintf (p, len, ",...");
		2446	break;
		2447	}
		2448
		2449	if (flag [i])
		2450	{
		2451	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2452	len -= cnt;
		2453	p += cnt;
		2454	first = false;
		2455	}
		2456	}
		2457
		2458	return desc;
		2459	}
		2460
2599	// return a suitable string describing an objetc in enough detail to find it	2461	// return a suitable string describing an object in enough detail to find it
2600	const char *	2462	const char *
2601	object::debug_desc (char *info) const	2463	object::debug_desc (char *info) const
2602	{	2464	{
		2465	char flagdesc[512];
2603	char info2[256 * 3];	2466	char info2[256 * 4];
2604	char *p = info;	2467	char *p = info;
2605		2468
2606	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2469	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2607	count,	2470	count,
		2471	uuid.c_str (),
2608	&name,	2472	&name,
2609	title ? " " : "",	2473	title ? "\",title:\"" : "",
2610	title ? (const char *)title : "");	2474	title ? (const char *)title : "",
		2475	flag_desc (flagdesc, 512), type);
2611		2476
2612	if (env)	2477	if (!flag[FLAG_REMOVED] && env)
2613	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2478	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2614		2479
2615	if (map)	2480	if (map)
2616	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2481	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2617		2482
2618	return info;	2483	return info;
2619	}	2484	}
2620		2485
2621	const char *	2486	const char *
2622	object::debug_desc () const	2487	object::debug_desc () const
2623	{	2488	{
2624	static char info[256 * 3];	2489	static char info[3][256 * 4];
		2490	static int info_idx;
		2491
2625	return debug_desc (info);	2492	return debug_desc (info [++info_idx % 3]);
2626	}	2493	}
2627		2494
		2495	struct region *
		2496	object::region () const
		2497	{
		2498	return map ? map->region (x, y)
		2499	: region::default_region ();
		2500	}
		2501
		2502	const materialtype_t *
		2503	object::dominant_material () const
		2504	{
		2505	if (materialtype_t *mt = name_to_material (materialname))
		2506	return mt;
		2507
		2508	return name_to_material (shstr_unknown);
		2509	}
		2510
		2511	void
		2512	object::open_container (object *new_container)
		2513	{
		2514	if (container == new_container)
		2515	return;
		2516
		2517	object *old_container = container;
		2518
		2519	if (old_container)
		2520	{
		2521	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2522	return;
		2523
		2524	#if 0
		2525	// remove the "Close old_container" object.
		2526	if (object *closer = old_container->inv)
		2527	if (closer->type == CLOSE_CON)
		2528	closer->destroy ();
		2529	#endif
		2530
		2531	// make sure the container is available
		2532	esrv_send_item (this, old_container);
		2533
		2534	old_container->flag [FLAG_APPLIED] = false;
		2535	container = 0;
		2536
		2537	// client needs item update to make it work, client bug requires this to be separate
		2538	esrv_update_item (UPD_FLAGS, this, old_container);
		2539
		2540	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2541	play_sound (sound_find ("chest_close"));
		2542	}
		2543
		2544	if (new_container)
		2545	{
		2546	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2547	return;
		2548
		2549	// TODO: this does not seem to serve any purpose anymore?
		2550	#if 0
		2551	// insert the "Close Container" object.
		2552	if (archetype *closer = new_container->other_arch)
		2553	{
		2554	object *closer = arch_to_object (new_container->other_arch);
		2555	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2556	new_container->insert (closer);
		2557	}
		2558	#endif
		2559
		2560	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2561
		2562	// make sure the container is available, client bug requires this to be separate
		2563	esrv_send_item (this, new_container);
		2564
		2565	new_container->flag [FLAG_APPLIED] = true;
		2566	container = new_container;
		2567
		2568	// client needs flag change
		2569	esrv_update_item (UPD_FLAGS, this, new_container);
		2570	esrv_send_inventory (this, new_container);
		2571	play_sound (sound_find ("chest_open"));
		2572	}
		2573	// else if (!old_container->env && contr && contr->ns)
		2574	// contr->ns->floorbox_reset ();
		2575	}
		2576
		2577	object *
		2578	object::force_find (const shstr name)
		2579	{
		2580	/* cycle through his inventory to look for the MARK we want to
		2581	* place
		2582	*/
		2583	for (object *tmp = inv; tmp; tmp = tmp->below)
		2584	if (tmp->type == FORCE && tmp->slaying == name)
		2585	return splay (tmp);
		2586
		2587	return 0;
		2588	}
		2589
		2590	void
		2591	object::force_add (const shstr name, int duration)
		2592	{
		2593	if (object *force = force_find (name))
		2594	force->destroy ();
		2595
		2596	object *force = get_archetype (FORCE_NAME);
		2597
		2598	force->slaying = name;
		2599	force->stats.food = 1;
		2600	force->speed_left = -1.f;
		2601
		2602	force->set_speed (duration ? 1.f / duration : 0.f);
		2603	force->flag [FLAG_IS_USED_UP] = true;
		2604	force->flag [FLAG_APPLIED] = true;
		2605
		2606	insert (force);
		2607	}
		2608
		2609	void
		2610	object::play_sound (faceidx sound)
		2611	{
		2612	if (!sound)
		2613	return;
		2614
		2615	if (flag [FLAG_REMOVED])
		2616	return;
		2617
		2618	if (env)
		2619	{
		2620	if (object *pl = in_player ())
		2621	pl->contr->play_sound (sound);
		2622	}
		2623	else
		2624	map->play_sound (sound, x, y);
		2625	}
		2626

Diff Legend

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