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.151 by root, Wed May 16 11:10:01 2007 UTC vs.
Revision 1.244 by root, Sun May 18 17:52:53 2008 UTC

1	/*	1	/*
2	* CrossFire, A Multiplayer game	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
9	* 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
10	* the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	* (at your option) any later version.	11	* (at your option) any later version.
12	*	12	*
13	* 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,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* 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
19	* along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21	*	20	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	22	*/
24		23
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying
27	variable. */
28	#include <global.h>	24	#include <global.h>
29	#include <stdio.h>	25	#include <stdio.h>
30	#include <sys/types.h>	26	#include <sys/types.h>
31	#include <sys/uio.h>	27	#include <sys/uio.h>
32	#include <object.h>	28	#include <object.h>
33	#include <funcpoint.h>
34	#include <sproto.h>	29	#include <sproto.h>
35	#include <loader.h>	30	#include <loader.h>
36		31
37	#include <bitset>	32	#include <bitset>
38		33
39	int nrofallocobjects = 0;	34	UUID UUID::cur;
40	static UUID uuid;	35	static uint64_t seq_next_save;
41	const uint64 UUID_SKIP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
42		37
43	objectvec objects;	38	objectvec objects;
44	activevec actives;	39	activevec actives;
45		40
46	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,
47	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
48	};	46	};
49	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,
50	-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
51	};	52	};
52	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,
53	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
54	};	58	};
55	int freedir[SIZEOFFREE] = {	59	int freedir[SIZEOFFREE] = {
56	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,
57	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
58	};	64	};
59		65
60	static void	66	static void
61	write_uuid (void)	67	write_uuid (uval64 skip, bool sync)
62	{	68	{
63	char filename1[MAX_BUF], filename2[MAX_BUF];	69	CALL_BEGIN (2);
64		70	CALL_ARG_SV (newSVval64 (skip));
65	sprintf (filename1, "%s/uuid", settings.localdir);	71	CALL_ARG_SV (boolSV (sync));
66	sprintf (filename2, "%s/uuid~", settings.localdir);	72	CALL_CALL ("cf::write_uuid", G_DISCARD);
67		73	CALL_END;
68	FILE *fp;
69
70	if (!(fp = fopen (filename2, "w")))
71	{
72	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
73	return;
74	}
75
76	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
77	fclose (fp);
78	rename (filename2, filename1);
79	}	74	}
80		75
81	static void	76	static void
82	read_uuid (void)	77	read_uuid (void)
83	{	78	{
84	char filename[MAX_BUF];	79	char filename[MAX_BUF];
85		80
86	sprintf (filename, "%s/uuid", settings.localdir);	81	sprintf (filename, "%s/uuid", settings.localdir);
		82
		83	seq_next_save = 0;
87		84
88	FILE *fp;	85	FILE *fp;
89		86
90	if (!(fp = fopen (filename, "r")))	87	if (!(fp = fopen (filename, "r")))
91	{	88	{
92	if (errno == ENOENT)	89	if (errno == ENOENT)
93	{	90	{
94	LOG (llevInfo, "RESET uid to 1\n");	91	LOG (llevInfo, "RESET uid to 1\n");
95	uuid.seq = 0;	92	UUID::cur.seq = 0;
96	write_uuid ();	93	write_uuid (UUID_GAP, true);
97	return;	94	return;
98	}	95	}
99		96
100	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
101	_exit (1);	98	_exit (1);
102	}	99	}
103		100
104	int version;	101	UUID::BUF buf;
105	unsigned long long uid;	102	buf[0] = 0;
106	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	103	fgets (buf, sizeof (buf), fp);
		104
		105	if (!UUID::cur.parse (buf))
107	{	106	{
108	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	107	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
109	_exit (1);	108	_exit (1);
110	}	109	}
111		110
112	uuid.seq = uid;	111	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
113	write_uuid ();	112
114	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	113	write_uuid (UUID_GAP, true);
115	fclose (fp);	114	fclose (fp);
116	}	115	}
117		116
118	UUID	117	UUID
119	gen_uuid ()	118	UUID::gen ()
120	{	119	{
121	UUID uid;	120	UUID uid;
122		121
123	uid.seq = ++uuid.seq;	122	uid.seq = ++cur.seq;
124		123
125	if (!(uuid.seq & (UUID_SKIP - 1)))	124	if (expect_false (cur.seq >= seq_next_save))
126	write_uuid ();	125	{
		126	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		127	write_uuid (UUID_GAP, false);
		128	}
		129
127		130
128	return uid;	131	return uid;
129	}	132	}
130		133
131	void	134	void
132	init_uuid ()	135	UUID::init ()
133	{	136	{
134	read_uuid ();	137	read_uuid ();
135	}	138	}
136		139
137	/* 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. */
138	static int	141	static bool
139	compare_ob_value_lists_one (const object *wants, const object *has)	142	compare_ob_value_lists_one (const object *wants, const object *has)
140	{	143	{
141	key_value *wants_field;
142
143	/* 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
144	* 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
145	* different structure or at least keep the lists sorted...	146	* different structure or at least keep the lists sorted...
146	*/	147	*/
147		148
148	/* For each field in wants, */	149	/* For each field in wants, */
149	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)
150	{	151	if (has->kv_get (kv->key) != kv->value)
151	key_value *has_field;	152	return false;
152
153	/* Look for a field in has with the same key. */
154	has_field = get_ob_key_link (has, wants_field->key);
155
156	if (has_field == NULL)
157	{
158	/* No field with that name. */
159	return FALSE;
160	}
161
162	/* Found the matching field. */
163	if (has_field->value != wants_field->value)
164	{
165	/* Values don't match, so this half of the comparison is false. */
166	return FALSE;
167	}
168
169	/* If we get here, we found a match. Now for the next field in wants. */
170	}
171		153
172	/* 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. */
173	return TRUE;	155	return true;
174	}	156	}
175		157
176	/* Returns TRUE if ob1 has the same key_values as ob2. */	158	/* Returns TRUE if ob1 has the same key_values as ob2. */
177	static int	159	static bool
178	compare_ob_value_lists (const object *ob1, const object *ob2)	160	compare_ob_value_lists (const object *ob1, const object *ob2)
179	{	161	{
180	/* 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,
181	* so we need to run the comparison *twice*. :(	163	* so we need to run the comparison *twice*. :(
182	*/	164	*/
183	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);
184	}	167	}
185		168
186	/* 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
187	* they can be merged together.	170	* they can be merged together.
188	*	171	*
…		…
203	|| ob1->speed != ob2->speed	186	|| ob1->speed != ob2->speed
204	|| ob1->value != ob2->value	187	|| ob1->value != ob2->value
205	|| ob1->name != ob2->name)	188	|| ob1->name != ob2->name)
206	return 0;	189	return 0;
207		190
208	//TODO: this ain't working well, use nicer and correct overflow check	191	// some objects are unmergable
209	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	192	if (!ob1->nrof || !ob2->nrof)
210	* value could not be stored in a sint32 (which unfortunately sometimes is	193	return 0;
211	* used to store nrof).	194
		195	/* Do not merge objects if nrof would overflow. First part checks
		196	* for unsigned overflow (2c), second part checks whether the result
		197	* would fit into a 32 bit signed int, which is often used to hold
		198	* nrof values.
212	*/	199	*/
213	if (ob1->nrof + ob2->nrof >= 1UL << 31)	200	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
214	return 0;	201	return 0;
215		202
216	/* If the objects have been identified, set the BEEN_APPLIED flag.	203	/* If the objects have been identified, set the BEEN_APPLIED flag.
217	* This is to the comparison of the flags below will be OK. We	204	* This is to the comparison of the flags below will be OK. We
218	* just can't ignore the been applied or identified flags, as they	205	* just can't ignore the been applied or identified flags, as they
219	* are not equal - just if it has been identified, the been_applied	206	* are not equal - just if it has been identified, the been_applied
220	* flags lose any meaning.	207	* flags lose any meaning.
221	*/	208	*/
222	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	209	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
223	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	210	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
224		211
225	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	212	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
226	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	213	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
227		214
228	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	215	if (ob1->arch->archname != ob2->arch->archname
229	|| ob1->arch != ob2->arch
230	|| ob1->name != ob2->name	216	|| ob1->name != ob2->name
231	|| ob1->title != ob2->title	217	|| ob1->title != ob2->title
232	|| ob1->msg != ob2->msg	218	|| ob1->msg != ob2->msg
233	|| ob1->weight != ob2->weight	219	|| ob1->weight != ob2->weight
234	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
235	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
236	|| ob1->attacktype != ob2->attacktype	220	|| ob1->attacktype != ob2->attacktype
237	|| ob1->magic != ob2->magic	221	|| ob1->magic != ob2->magic
238	|| ob1->slaying != ob2->slaying	222	|| ob1->slaying != ob2->slaying
239	|| ob1->skill != ob2->skill	223	|| ob1->skill != ob2->skill
240	|| ob1->value != ob2->value	224	|| ob1->value != ob2->value
241	|| ob1->animation_id != ob2->animation_id	225	|| ob1->animation_id != ob2->animation_id
		226	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
242	|| ob1->client_type != ob2->client_type	227	|| ob1->client_type != ob2->client_type
243	|| ob1->materialname != ob2->materialname	228	|| ob1->materialname != ob2->materialname
244	|| ob1->lore != ob2->lore	229	|| ob1->lore != ob2->lore
245	|| ob1->subtype != ob2->subtype	230	|| ob1->subtype != ob2->subtype
246	|| ob1->move_type != ob2->move_type	231	|| ob1->move_type != ob2->move_type
247	|| ob1->move_block != ob2->move_block	232	|| ob1->move_block != ob2->move_block
248	|| ob1->move_allow != ob2->move_allow	233	|| ob1->move_allow != ob2->move_allow
249	|| ob1->move_on != ob2->move_on	234	|| ob1->move_on != ob2->move_on
250	|| ob1->move_off != ob2->move_off	235	|| ob1->move_off != ob2->move_off
251	|| ob1->move_slow != ob2->move_slow	236	|| ob1->move_slow != ob2->move_slow
252	|| ob1->move_slow_penalty != ob2->move_slow_penalty)	237	|| ob1->move_slow_penalty != ob2->move_slow_penalty
		238	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
		239	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
253	return 0;	240	return 0;
254		241
		242	if ((ob1->flag ^ ob2->flag)
		243	.reset (FLAG_INV_LOCKED)
		244	.reset (FLAG_CLIENT_SENT)
		245	.reset (FLAG_REMOVED)
		246	.any ())
		247	return 0;
		248
255	/* This is really a spellbook check - really, we should	249	/* This is really a spellbook check - we should in general
256	* check all objects in the inventory.	250	* not merge objects with real inventories, as splitting them
		251	* is hard.
257	*/	252	*/
258	if (ob1->inv || ob2->inv)	253	if (ob1->inv || ob2->inv)
259	{	254	{
260	/* if one object has inventory but the other doesn't, not equiv */	255	if (!(ob1->inv && ob2->inv))
261	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	256	return 0; /* inventories differ in length */
262	return 0;
263		257
264	/* Now check to see if the two inventory objects could merge */	258	if (ob1->inv->below || ob2->inv->below)
		259	return 0; /* more than one object in inv */
		260
265	if (!object::can_merge (ob1->inv, ob2->inv))	261	if (!object::can_merge (ob1->inv, ob2->inv))
266	return 0;	262	return 0; /* inventory objects differ */
267		263
268	/* inventory ok - still need to check rest of this object to see	264	/* inventory ok - still need to check rest of this object to see
269	* if it is valid.	265	* if it is valid.
270	*/	266	*/
271	}	267	}
…		…
290	if (ob1->level != ob2->level)	286	if (ob1->level != ob2->level)
291	return 0;	287	return 0;
292	break;	288	break;
293	}	289	}
294		290
295	if (ob1->key_values != NULL || ob2->key_values != NULL)	291	if (ob1->key_values || ob2->key_values)
296	{	292	{
297	/* At least one of these has key_values. */	293	/* At least one of these has key_values. */
298	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	294	if ((!ob1->key_values) != (!ob2->key_values))
299	/* One has fields, but the other one doesn't. */	295	return 0; /* One has fields, but the other one doesn't. */
		296
		297	if (!compare_ob_value_lists (ob1, ob2))
300	return 0;	298	return 0;
301	else if (!compare_ob_value_lists (ob1, ob2))
302	return 0;
303	}	299	}
304		300
305	//TODO: generate an event or call into perl for additional checks
306	if (ob1->self || ob2->self)	301	if (ob1->self || ob2->self)
307	{	302	{
308	ob1->optimise ();	303	ob1->optimise ();
309	ob2->optimise ();	304	ob2->optimise ();
310		305
311	if (ob1->self || ob2->self)	306	if (ob1->self || ob2->self)
		307	{
		308	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		309	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		310
		311	if (k1 != k2)
312	return 0;	312	return 0;
		313
		314	if (k1 == 0)
		315	return 1;
		316
		317	if (!cfperl_can_merge (ob1, ob2))
		318	return 0;
		319	}
313	}	320	}
314		321
315	/* Everything passes, must be OK. */	322	/* Everything passes, must be OK. */
316	return 1;	323	return 1;
317	}	324	}
318		325
		326	// find player who can see this object
		327	object *
		328	object::visible_to () const
		329	{
		330	if (client_visible () && !flag [FLAG_REMOVED])
		331	{
		332	// see if we are in a container of sorts
		333	if (env)
		334	{
		335	// the player inventory itself is always visible
		336	if (env->type == PLAYER)
		337	return env;
		338
		339	// else a player could have our env open
		340	object *envest = env->outer_env ();
		341
		342	// the player itself is always on a map, so we will find him here
		343	// even if our inv is in a player.
		344	if (envest->is_on_map ())
		345	if (object *pl = envest->ms ().player ())
		346	if (pl->container == env)
		347	return pl;
		348	}
		349	else
		350	{
		351	// maybe there is a player standing on the same mapspace
		352	// this will catch the case where "this" is a player
		353	if (object *pl = ms ().player ())
		354	if (!pl->container || this == pl->container)
		355	return pl;
		356	}
		357	}
		358
		359	return 0;
		360	}
		361
		362	// adjust weight per container type ("of holding")
		363	static sint32
		364	weight_adjust_for (object *op, sint32 weight)
		365	{
		366	return op->type == CONTAINER
		367	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		368	: weight;
		369	}
		370
319	/*	371	/*
		372	* adjust_weight(object, weight) adds the specified weight to an object,
		373	* and also updates how much the environment(s) is/are carrying.
		374	*/
		375	static void
		376	adjust_weight (object *op, sint32 weight)
		377	{
		378	while (op)
		379	{
		380	// adjust by actual difference to account for rounding errors
		381	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
		382	weight = weight_adjust_for (op, op->carrying)
		383	- weight_adjust_for (op, op->carrying - weight);
		384
		385	if (!weight)
		386	return;
		387
		388	op->carrying += weight;
		389
		390	if (object *pl = op->visible_to ())
		391	if (pl != op) // player is handled lazily
		392	esrv_update_item (UPD_WEIGHT, pl, op);
		393
		394	op = op->env;
		395	}
		396	}
		397
		398	/*
320	* sum_weight() is a recursive function which calculates the weight	399	* this is a recursive function which calculates the weight
321	* an object is carrying. It goes through in figures out how much	400	* an object is carrying. It goes through op and figures out how much
322	* containers are carrying, and sums it up.	401	* containers are carrying, and sums it up.
323	*/	402	*/
324	long	403	void
325	sum_weight (object *op)	404	object::update_weight ()
326	{	405	{
327	long sum;	406	sint32 sum = 0;
328	object *inv;
329		407
330	for (sum = 0, inv = op->inv; inv; inv = inv->below)	408	for (object *op = inv; op; op = op->below)
331	{	409	{
332	if (inv->inv)	410	if (op->inv)
333	sum_weight (inv);	411	op->update_weight ();
334		412
335	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	413	sum += op->total_weight ();
		414	}
		415
		416	sum = weight_adjust_for (this, sum);
		417
		418	if (sum != carrying)
336	}	419	{
337
338	if (op->type == CONTAINER && op->stats.Str)
339	sum = (sum * (100 - op->stats.Str)) / 100;
340
341	if (op->carrying != sum)
342	op->carrying = sum;	420	carrying = sum;
343		421
344	return sum;	422	if (object *pl = visible_to ())
		423	if (pl != this) // player is handled lazily
		424	esrv_update_item (UPD_WEIGHT, pl, this);
		425	}
345	}	426	}
346		427
347	/**	428	/*
348	* Return the outermost environment object for a given object.	429	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
349	*/
350
351	object *
352	object_get_env_recursive (object *op)
353	{
354	while (op->env != NULL)
355	op = op->env;
356	return op;
357	}
358
359	/*
360	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
361	* Some error messages.
362	* The result of the dump is stored in the static global errmsg array.
363	*/	430	*/
364	char *	431	char *
365	dump_object (object *op)	432	dump_object (object *op)
366	{	433	{
367	if (!op)	434	if (!op)
…		…
375	/*	442	/*
376	* get_nearest_part(multi-object, object 2) returns the part of the	443	* get_nearest_part(multi-object, object 2) returns the part of the
377	* multi-object 1 which is closest to the second object.	444	* multi-object 1 which is closest to the second object.
378	* If it's not a multi-object, it is returned.	445	* If it's not a multi-object, it is returned.
379	*/	446	*/
380
381	object *	447	object *
382	get_nearest_part (object *op, const object *pl)	448	get_nearest_part (object *op, const object *pl)
383	{	449	{
384	object *tmp, *closest;	450	object *tmp, *closest;
385	int last_dist, i;	451	int last_dist, i;
386		452
387	if (op->more == NULL)	453	if (!op->more)
388	return op;	454	return op;
		455
389	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	456	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		457	tmp;
		458	tmp = tmp->more)
390	if ((i = distance (tmp, pl)) < last_dist)	459	if ((i = distance (tmp, pl)) < last_dist)
391	closest = tmp, last_dist = i;	460	closest = tmp, last_dist = i;
		461
392	return closest;	462	return closest;
393	}	463	}
394		464
395	/*	465	/*
396	* Returns the object which has the count-variable equal to the argument.	466	* Returns the object which has the count-variable equal to the argument.
		467	* VERRRY slow.
397	*/	468	*/
398	object *	469	object *
399	find_object (tag_t i)	470	find_object (tag_t i)
400	{	471	{
401	for_all_objects (op)	472	for_all_objects (op)
…		…
412	*/	483	*/
413	object *	484	object *
414	find_object_name (const char *str)	485	find_object_name (const char *str)
415	{	486	{
416	shstr_cmp str_ (str);	487	shstr_cmp str_ (str);
417	object *op;
418		488
		489	if (str_)
419	for_all_objects (op)	490	for_all_objects (op)
420	if (op->name == str_)	491	if (op->name == str_)
421	break;	492	return op;
422		493
423	return op;	494	return 0;
424	}
425
426	void
427	free_all_object_data ()
428	{
429	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
430	}	495	}
431		496
432	/*	497	/*
433	* Sets the owner and sets the skill and exp pointers to owner's current	498	* Sets the owner and sets the skill and exp pointers to owner's current
434	* skill and experience objects.	499	* skill and experience objects.
		500	* ACTUALLY NO! investigate! TODO
435	*/	501	*/
436	void	502	void
437	object::set_owner (object *owner)	503	object::set_owner (object *owner)
438	{	504	{
		505	// allow objects which own objects
439	if (!owner)	506	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)	507	while (owner->owner)
450	owner = owner->owner;	508	owner = owner->owner;
		509
		510	if (flag [FLAG_FREED])
		511	{
		512	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		513	return;
		514	}
451		515
452	this->owner = owner;	516	this->owner = owner;
453	}	517	}
454		518
455	int	519	int
…		…
495	{	559	{
496	current_weapon = chosen_skill = 0;	560	current_weapon = chosen_skill = 0;
497	update_stats ();	561	update_stats ();
498		562
499	new_draw_info_format (NDI_UNIQUE, 0, this,	563	new_draw_info_format (NDI_UNIQUE, 0, this,
500	"You try to balance your applied items all at once, but the %s is too much. "	564	"You try to balance all your items at once, "
		565	"but the %s is just too much for your body. "
501	"You need to unapply some items first.", &ob->name);	566	"[You need to unapply some items first.]", &ob->name);
502	return false;	567	return false;
503	}	568	}
504		569
505	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);	570	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
506	}	571	}
…		…
532	}	597	}
533		598
534	op->key_values = 0;	599	op->key_values = 0;
535	}	600	}
536		601
537	object &	602	/*
538	object::operator =(const object &src)	603	* copy_to first frees everything allocated by the dst object,
		604	* and then copies the contents of itself into the second
		605	* object, allocating what needs to be allocated. Basically, any
		606	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		607	* if the first object is freed, the pointers in the new object
		608	* will point at garbage.
		609	*/
		610	void
		611	object::copy_to (object *dst)
539	{	612	{
540	bool is_freed = flag [FLAG_FREED];	613	dst->remove ();
541	bool is_removed = flag [FLAG_REMOVED];
542
543	*(object_copy *)this = src;	614	*(object_copy *)dst = *this;
544
545	flag [FLAG_FREED] = is_freed;
546	flag [FLAG_REMOVED] = is_removed;	615	dst->flag [FLAG_REMOVED] = true;
547		616
548	/* Copy over key_values, if any. */	617	/* Copy over key_values, if any. */
549	if (src.key_values)	618	if (key_values)
550	{	619	{
551	key_value *tail = 0;	620	key_value *tail = 0;
552	key_values = 0;	621	dst->key_values = 0;
553		622
554	for (key_value *i = src.key_values; i; i = i->next)	623	for (key_value *i = key_values; i; i = i->next)
555	{	624	{
556	key_value *new_link = new key_value;	625	key_value *new_link = new key_value;
557		626
558	new_link->next = 0;	627	new_link->next = 0;
559	new_link->key = i->key;	628	new_link->key = i->key;
560	new_link->value = i->value;	629	new_link->value = i->value;
561		630
562	/* Try and be clever here, too. */	631	/* Try and be clever here, too. */
563	if (!key_values)	632	if (!dst->key_values)
564	{	633	{
565	key_values = new_link;	634	dst->key_values = new_link;
566	tail = new_link;	635	tail = new_link;
567	}	636	}
568	else	637	else
569	{	638	{
570	tail->next = new_link;	639	tail->next = new_link;
571	tail = new_link;	640	tail = new_link;
572	}	641	}
573	}	642	}
574	}	643	}
575	}
576
577	/*
578	* copy_to first frees everything allocated by the dst object,
579	* and then copies the contents of itself into the second
580	* object, allocating what needs to be allocated. Basically, any
581	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
582	* if the first object is freed, the pointers in the new object
583	* will point at garbage.
584	*/
585	void
586	object::copy_to (object *dst)
587	{
588	*dst = *this;
589		644
590	if (speed < 0)	645	if (speed < 0)
591	dst->speed_left = speed_left - rndm ();	646	dst->speed_left -= rndm ();
592		647
593	dst->set_speed (dst->speed);	648	dst->set_speed (dst->speed);
594	}	649	}
595		650
596	void	651	void
597	object::instantiate ()	652	object::instantiate ()
598	{	653	{
599	if (!uuid.seq) // HACK	654	if (!uuid.seq) // HACK
600	uuid = gen_uuid ();	655	uuid = UUID::gen ();
601		656
602	speed_left = -0.1f;	657	speed_left = -0.1f;
603	/* copy the body_info to the body_used - this is only really	658	/* copy the body_info to the body_used - this is only really
604	* need for monsters, but doesn't hurt to do it for everything.	659	* need for monsters, but doesn't hurt to do it for everything.
605	* by doing so, when a monster is created, it has good starting	660	* by doing so, when a monster is created, it has good starting
…		…
615	object *	670	object *
616	object::clone ()	671	object::clone ()
617	{	672	{
618	object *neu = create ();	673	object *neu = create ();
619	copy_to (neu);	674	copy_to (neu);
		675	neu->map = map; // not copied by copy_to
620	return neu;	676	return neu;
621	}	677	}
622		678
623	/*	679	/*
624	* If an object with the IS_TURNABLE() flag needs to be turned due	680	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
675	* UP_OBJ_FACE: only the objects face has changed.	731	* UP_OBJ_FACE: only the objects face has changed.
676	*/	732	*/
677	void	733	void
678	update_object (object *op, int action)	734	update_object (object *op, int action)
679	{	735	{
680	if (op == NULL)	736	if (!op)
681	{	737	{
682	/* this should never happen */	738	/* this should never happen */
683	LOG (llevDebug, "update_object() called for NULL object.\n");	739	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
684	return;	740	return;
685	}	741	}
686		742
687	if (op->env)	743	if (!op->is_on_map ())
688	{	744	{
689	/* Animation is currently handled by client, so nothing	745	/* Animation is currently handled by client, so nothing
690	* to do in this case.	746	* to do in this case.
691	*/	747	*/
692	return;	748	return;
693	}	749	}
694
695	/* If the map is saving, don't do anything as everything is
696	* going to get freed anyways.
697	*/
698	if (!op->map || op->map->in_memory == MAP_SAVING)
699	return;
700		750
701	/* make sure the object is within map boundaries */	751	/* make sure the object is within map boundaries */
702	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)	752	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
703	{	753	{
704	LOG (llevError, "update_object() called for object out of map!\n");	754	LOG (llevError, "update_object() called for object out of map!\n");
…		…
764	static int object_count;	814	static int object_count;
765		815
766	void object::link ()	816	void object::link ()
767	{	817	{
768	assert (!index);//D	818	assert (!index);//D
769	uuid = gen_uuid ();	819	uuid = UUID::gen ();
770	count = ++object_count;	820	count = ++object_count;
771		821
772	refcnt_inc ();	822	refcnt_inc ();
773	objects.insert (this);	823	objects.insert (this);
774	}	824	}
…		…
847	object::destroy_inv (bool drop_to_ground)	897	object::destroy_inv (bool drop_to_ground)
848	{	898	{
849	// need to check first, because the checks below might segfault	899	// need to check first, because the checks below might segfault
850	// as we might be on an invalid mapspace and crossfire code	900	// as we might be on an invalid mapspace and crossfire code
851	// is too buggy to ensure that the inventory is empty.	901	// is too buggy to ensure that the inventory is empty.
852	// corollary: if you create arrows etc. with stuff in tis inventory,	902	// corollary: if you create arrows etc. with stuff in its inventory,
853	// cf will crash below with off-map x and y	903	// cf will crash below with off-map x and y
854	if (!inv)	904	if (!inv)
855	return;	905	return;
856		906
857	/* Only if the space blocks everything do we not process -	907	/* Only if the space blocks everything do we not process -
858	* if some form of movement is allowed, let objects	908	* if some form of movement is allowed, let objects
859	* drop on that space.	909	* drop on that space.
860	*/	910	*/
861	if (!drop_to_ground	911	if (!drop_to_ground
862	|| !map	912	|| !map
863	|| map->in_memory != MAP_IN_MEMORY	913	|| map->in_memory != MAP_ACTIVE
864	|| map->nodrop	914	|| map->no_drop
865	|| ms ().move_block == MOVE_ALL)	915	|| ms ().move_block == MOVE_ALL)
866	{	916	{
867	while (inv)	917	while (inv)
868	{	918	{
869	inv->destroy_inv (drop_to_ground);	919	inv->destroy_inv (false);
870	inv->destroy ();	920	inv->destroy ();
871	}	921	}
872	}	922	}
873	else	923	else
874	{ /* Put objects in inventory onto this space */	924	{ /* Put objects in inventory onto this space */
…		…
880	|| op->flag [FLAG_NO_DROP]	930	|| op->flag [FLAG_NO_DROP]
881	|| op->type == RUNE	931	|| op->type == RUNE
882	|| op->type == TRAP	932	|| op->type == TRAP
883	|| op->flag [FLAG_IS_A_TEMPLATE]	933	|| op->flag [FLAG_IS_A_TEMPLATE]
884	|| op->flag [FLAG_DESTROY_ON_DEATH])	934	|| op->flag [FLAG_DESTROY_ON_DEATH])
885	op->destroy ();	935	op->destroy (true);
886	else	936	else
887	map->insert (op, x, y);	937	map->insert (op, x, y);
888	}	938	}
889	}	939	}
890	}	940	}
…		…
894	object *op = new object;	944	object *op = new object;
895	op->link ();	945	op->link ();
896	return op;	946	return op;
897	}	947	}
898		948
		949	static struct freed_map : maptile
		950	{
		951	freed_map ()
		952	{
		953	path = "<freed objects map>";
		954	name = "/internal/freed_objects_map";
		955	width = 3;
		956	height = 3;
		957	no_drop = 1;
		958	no_reset = 1;
		959
		960	alloc ();
		961	in_memory = MAP_ACTIVE;
		962	}
		963
		964	~freed_map ()
		965	{
		966	destroy ();
		967	}
		968	} freed_map; // freed objects are moved here to avoid crashes
		969
899	void	970	void
900	object::do_destroy ()	971	object::do_destroy ()
901	{	972	{
902	attachable::do_destroy ();
903
904	if (flag [FLAG_IS_LINKED])	973	if (flag [FLAG_IS_LINKED])
905	remove_button_link (this);	974	remove_button_link (this);
906		975
907	if (flag [FLAG_FRIENDLY])	976	if (flag [FLAG_FRIENDLY])
908	remove_friendly_object (this);	977	remove_friendly_object (this);
909		978
910	if (!flag [FLAG_REMOVED])
911	remove ();	979	remove ();
912		980
913	destroy_inv (true);	981	attachable::do_destroy ();
914		982
915	deactivate ();	983	deactivate ();
916	unlink ();	984	unlink ();
917		985
918	flag [FLAG_FREED] = 1;	986	flag [FLAG_FREED] = 1;
919		987
920	// hack to ensure that freed objects still have a valid map	988	// hack to ensure that freed objects still have a valid map
921	{
922	static maptile *freed_map; // freed objects are moved here to avoid crashes
923
924	if (!freed_map)
925	{
926	freed_map = new maptile;
927
928	freed_map->name = "/internal/freed_objects_map";
929	freed_map->width = 3;
930	freed_map->height = 3;
931
932	freed_map->alloc ();
933	freed_map->in_memory = MAP_IN_MEMORY;
934	}
935
936	map = freed_map;	989	map = &freed_map;
937	x = 1;	990	x = 1;
938	y = 1;	991	y = 1;
939	}
940
941	head = 0;
942		992
943	if (more)	993	if (more)
944	{	994	{
945	more->destroy ();	995	more->destroy ();
946	more = 0;	996	more = 0;
947	}	997	}
948		998
		999	head = 0;
		1000
949	// clear those pointers that likely might have circular references to us	1001	// clear those pointers that likely might cause circular references
950	owner = 0;	1002	owner = 0;
951	enemy = 0;	1003	enemy = 0;
952	attacked_by = 0;	1004	attacked_by = 0;
		1005	current_weapon = 0;
953	}	1006	}
954		1007
955	void	1008	void
956	object::destroy (bool destroy_inventory)	1009	object::destroy (bool destroy_inventory)
957	{	1010	{
958	if (destroyed ())	1011	if (destroyed ())
959	return;	1012	return;
960		1013
		1014	if (!is_head () && !head->destroyed ())
		1015	{
		1016	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1017	head->destroy (destroy_inventory);
		1018	return;
		1019	}
		1020
961	if (destroy_inventory)	1021	destroy_inv (!destroy_inventory);
962	destroy_inv (false);	1022
		1023	if (is_head ())
		1024	if (sound_destroy)
		1025	play_sound (sound_destroy);
		1026	else if (flag [FLAG_MONSTER])
		1027	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
963		1028
964	attachable::destroy ();	1029	attachable::destroy ();
965	}
966
967	/*
968	* sub_weight() recursively (outwards) subtracts a number from the
969	* weight of an object (and what is carried by it's environment(s)).
970	*/
971	void
972	sub_weight (object *op, signed long weight)
973	{
974	while (op != NULL)
975	{
976	if (op->type == CONTAINER)
977	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
978
979	op->carrying -= weight;
980	op = op->env;
981	}
982	}	1030	}
983		1031
984	/* op->remove ():	1032	/* op->remove ():
985	* This function removes the object op from the linked list of objects	1033	* This function removes the object op from the linked list of objects
986	* which it is currently tied to. When this function is done, the	1034	* which it is currently tied to. When this function is done, the
…		…
992	object::do_remove ()	1040	object::do_remove ()
993	{	1041	{
994	object *tmp, *last = 0;	1042	object *tmp, *last = 0;
995	object *otmp;	1043	object *otmp;
996		1044
997	if (QUERY_FLAG (this, FLAG_REMOVED))	1045	if (flag [FLAG_REMOVED])
998	return;	1046	return;
999		1047
1000	SET_FLAG (this, FLAG_REMOVED);
1001	INVOKE_OBJECT (REMOVE, this);	1048	INVOKE_OBJECT (REMOVE, this);
		1049
		1050	flag [FLAG_REMOVED] = true;
1002		1051
1003	if (more)	1052	if (more)
1004	more->remove ();	1053	more->remove ();
1005		1054
1006	/*	1055	/*
1007	* In this case, the object to be removed is in someones	1056	* In this case, the object to be removed is in someones
1008	* inventory.	1057	* inventory.
1009	*/	1058	*/
1010	if (env)	1059	if (env)
1011	{	1060	{
1012	if (nrof)	1061	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1013	sub_weight (env, weight * nrof);	1062	if (object *pl = visible_to ())
1014	else	1063	esrv_del_item (pl->contr, count);
1015	sub_weight (env, weight + carrying);	1064	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1065
		1066	adjust_weight (env, -total_weight ());
		1067
		1068	/* we set up values so that it could be inserted into
		1069	* the map, but we don't actually do that - it is up
		1070	* to the caller to decide what we want to do.
		1071	*/
		1072	map = env->map;
		1073	x = env->x;
		1074	y = env->y;
		1075
		1076	// make sure cmov optimisation is applicable
		1077	*(above ? &above->below : &env->inv) = below;
		1078	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1079
		1080	above = 0;
		1081	below = 0;
		1082	env = 0;
1016		1083
1017	/* NO_FIX_PLAYER is set when a great many changes are being	1084	/* NO_FIX_PLAYER is set when a great many changes are being
1018	* made to players inventory. If set, avoiding the call	1085	* made to players inventory. If set, avoiding the call
1019	* to save cpu time.	1086	* to save cpu time.
1020	*/	1087	*/
1021	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1088	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1022	otmp->update_stats ();	1089	otmp->update_stats ();
1023
1024	if (above)
1025	above->below = below;
1026	else
1027	env->inv = below;
1028
1029	if (below)
1030	below->above = above;
1031
1032	/* we set up values so that it could be inserted into
1033	* the map, but we don't actually do that - it is up
1034	* to the caller to decide what we want to do.
1035	*/
1036	x = env->x, y = env->y;
1037	map = env->map;
1038	above = 0, below = 0;
1039	env = 0;
1040	}	1090	}
1041	else if (map)	1091	else if (map)
1042	{	1092	{
1043	if (type == PLAYER)
1044	{
1045	// leaving a spot always closes any open container on the ground
1046	if (container && !container->env)
1047	// this causes spurious floorbox updates, but it ensures
1048	// that the CLOSE event is being sent.
1049	close_container ();
1050
1051	--map->players;
1052	map->touch ();
1053	}
1054
1055	map->dirty = true;	1093	map->dirty = true;
1056	mapspace &ms = this->ms ();	1094	mapspace &ms = this->ms ();
1057		1095
		1096	if (object *pl = ms.player ())
		1097	{
		1098	if (type == PLAYER) // this == pl(!)
		1099	{
		1100	// leaving a spot always closes any open container on the ground
		1101	if (container && !container->env)
		1102	// this causes spurious floorbox updates, but it ensures
		1103	// that the CLOSE event is being sent.
		1104	close_container ();
		1105
		1106	--map->players;
		1107	map->touch ();
		1108	}
		1109	else if (pl->container == this)
		1110	{
		1111	// removing a container should close it
		1112	close_container ();
		1113	}
		1114
		1115	esrv_del_item (pl->contr, count);
		1116	}
		1117
1058	/* link the object above us */	1118	/* link the object above us */
1059	if (above)	1119	// re-link, make sure compiler can easily use cmove
1060	above->below = below;	1120	*(above ? &above->below : &ms.top) = below;
1061	else	1121	*(below ? &below->above : &ms.bot) = above;
1062	ms.top = below; /* we were top, set new top */
1063
1064	/* Relink the object below us, if there is one */
1065	if (below)
1066	below->above = above;
1067	else
1068	{
1069	/* Nothing below, which means we need to relink map object for this space
1070	* use translated coordinates in case some oddness with map tiling is
1071	* evident
1072	*/
1073	if (GET_MAP_OB (map, x, y) != this)
1074	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 ());
1075
1076	ms.bot = above; /* goes on above it. */
1077	}
1078		1122
1079	above = 0;	1123	above = 0;
1080	below = 0;	1124	below = 0;
1081		1125
1082	if (map->in_memory == MAP_SAVING)	1126	if (map->in_memory == MAP_SAVING)
1083	return;	1127	return;
1084		1128
1085	int check_walk_off = !flag [FLAG_NO_APPLY];	1129	int check_walk_off = !flag [FLAG_NO_APPLY];
		1130
		1131	if (object *pl = ms.player ())
		1132	{
		1133	if (pl->container == this)
		1134	/* If a container that the player is currently using somehow gets
		1135	* removed (most likely destroyed), update the player view
		1136	* appropriately.
		1137	*/
		1138	pl->close_container ();
		1139
		1140	//TODO: the floorbox prev/next might need updating
		1141	//esrv_del_item (pl->contr, count);
		1142	//TODO: update floorbox to preserve ordering
		1143	if (pl->contr->ns)
		1144	pl->contr->ns->floorbox_update ();
		1145	}
1086		1146
1087	for (tmp = ms.bot; tmp; tmp = tmp->above)	1147	for (tmp = ms.bot; tmp; tmp = tmp->above)
1088	{	1148	{
1089	/* No point updating the players look faces if he is the object	1149	/* No point updating the players look faces if he is the object
1090	* being removed.	1150	* being removed.
1091	*/	1151	*/
1092
1093	if (tmp->type == PLAYER && tmp != this)
1094	{
1095	/* If a container that the player is currently using somehow gets
1096	* removed (most likely destroyed), update the player view
1097	* appropriately.
1098	*/
1099	if (tmp->container == this)
1100	{
1101	flag [FLAG_APPLIED] = 0;
1102	tmp->container = 0;
1103	}
1104
1105	if (tmp->contr->ns)
1106	tmp->contr->ns->floorbox_update ();
1107	}
1108		1152
1109	/* See if object moving off should effect something */	1153	/* See if object moving off should effect something */
1110	if (check_walk_off	1154	if (check_walk_off
1111	&& ((move_type & tmp->move_off)	1155	&& ((move_type & tmp->move_off)
1112	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1156	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1115		1159
1116	if (destroyed ())	1160	if (destroyed ())
1117	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1161	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1118	}	1162	}
1119		1163
1120	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1121	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1122	if (tmp->above == tmp)
1123	tmp->above = 0;
1124
1125	last = tmp;	1164	last = tmp;
1126	}	1165	}
1127		1166
1128	/* last == NULL if there are no objects on this space */	1167	/* last == NULL if there are no objects on this space */
1129	//TODO: this makes little sense, why only update the topmost object?	1168	//TODO: this makes little sense, why only update the topmost object?
…		…
1149	merge_ob (object *op, object *top)	1188	merge_ob (object *op, object *top)
1150	{	1189	{
1151	if (!op->nrof)	1190	if (!op->nrof)
1152	return 0;	1191	return 0;
1153		1192
1154	if (top)	1193	if (!top)
1155	for (top = op; top && top->above; top = top->above)	1194	for (top = op; top && top->above; top = top->above)
1156	;	1195	;
1157		1196
1158	for (; top; top = top->below)	1197	for (; top; top = top->below)
1159	{
1160	if (top == op)
1161	continue;
1162
1163	if (object::can_merge (op, top))	1198	if (object::can_merge (op, top))
1164	{	1199	{
1165	top->nrof += op->nrof;	1200	top->nrof += op->nrof;
1166		1201
1167	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1202	if (object *pl = top->visible_to ())
1168	op->weight = 0; /* Don't want any adjustements now */	1203	esrv_update_item (UPD_NROF, pl, top);
		1204
		1205	op->weight = 0; // cancel the addition above
		1206	op->carrying = 0; // must be 0 already
		1207
1169	op->destroy ();	1208	op->destroy (1);
		1209
1170	return top;	1210	return top;
1171	}	1211	}
1172	}
1173		1212
1174	return 0;	1213	return 0;
1175	}	1214	}
1176		1215
1177	void	1216	void
…		…
1180	if (more)	1219	if (more)
1181	return;	1220	return;
1182		1221
1183	object *prev = this;	1222	object *prev = this;
1184		1223
1185	for (archetype *at = arch->more; at; at = at->more)	1224	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1186	{	1225	{
1187	object *op = arch_to_object (at);	1226	object *op = arch_to_object (at);
1188		1227
1189	op->name = name;	1228	op->name = name;
1190	op->name_pl = name_pl;	1229	op->name_pl = name_pl;
…		…
1202	* job preparing multi-part monsters.	1241	* job preparing multi-part monsters.
1203	*/	1242	*/
1204	object *	1243	object *
1205	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1244	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1206	{	1245	{
		1246	op->remove ();
		1247
1207	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1248	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1208	{	1249	{
1209	tmp->x = x + tmp->arch->clone.x;	1250	tmp->x = x + tmp->arch->x;
1210	tmp->y = y + tmp->arch->clone.y;	1251	tmp->y = y + tmp->arch->y;
1211	}	1252	}
1212		1253
1213	return insert_ob_in_map (op, m, originator, flag);	1254	return insert_ob_in_map (op, m, originator, flag);
1214	}	1255	}
1215		1256
…		…
1234	* just 'op' otherwise	1275	* just 'op' otherwise
1235	*/	1276	*/
1236	object *	1277	object *
1237	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1278	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1238	{	1279	{
1239	assert (!op->flag [FLAG_FREED]);	1280	if (op->is_on_map ())
1240
1241	object *tmp, *top, *floor = NULL;
1242
1243	op->remove ();
1244
1245	#if 0
1246	if (!m->active != !op->active)
1247	if (m->active)
1248	op->activate_recursive ();
1249	else
1250	op->deactivate_recursive ();
1251	#endif
1252
1253	if (out_of_map (m, op->x, op->y))
1254	{	1281	{
1255	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());	1282	LOG (llevError, "insert_ob_in_map called for object already on map");
1256	#ifdef MANY_CORES
1257	/* Better to catch this here, as otherwise the next use of this object
1258	* is likely to cause a crash. Better to find out where it is getting
1259	* improperly inserted.
1260	*/
1261	abort ();	1283	abort ();
1262	#endif
1263	return op;
1264	}
1265
1266	if (object *more = op->more)
1267	{	1284	}
1268	if (!insert_ob_in_map (more, m, originator, flag))
1269	{
1270	if (!op->head)
1271	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1272		1285
1273	return 0;	1286	if (op->env)
1274	}
1275	}	1287	{
1276		1288	LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)");
1277	CLEAR_FLAG (op, FLAG_REMOVED);	1289	op->remove ();
		1290	}
1278		1291
1279	/* Ideally, the caller figures this out. However, it complicates a lot	1292	/* Ideally, the caller figures this out. However, it complicates a lot
1280	* of areas of callers (eg, anything that uses find_free_spot would now	1293	* of areas of callers (eg, anything that uses find_free_spot would now
1281	* need extra work	1294	* need extra work
1282	*/	1295	*/
1283	if (!xy_normalise (m, op->x, op->y))	1296	if (!xy_normalise (m, op->x, op->y))
		1297	{
		1298	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1284	return 0;	1299	return 0;
		1300	}
		1301
		1302	if (object *more = op->more)
		1303	if (!insert_ob_in_map (more, m, originator, flag))
		1304	return 0;
		1305
		1306	CLEAR_FLAG (op, FLAG_REMOVED);
1285		1307
1286	op->map = m;	1308	op->map = m;
1287	mapspace &ms = op->ms ();	1309	mapspace &ms = op->ms ();
1288		1310
1289	/* this has to be done after we translate the coordinates.	1311	/* this has to be done after we translate the coordinates.
1290	*/	1312	*/
1291	if (op->nrof && !(flag & INS_NO_MERGE))	1313	if (op->nrof && !(flag & INS_NO_MERGE))
1292	for (tmp = ms.bot; tmp; tmp = tmp->above)	1314	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1293	if (object::can_merge (op, tmp))	1315	if (object::can_merge (op, tmp))
1294	{	1316	{
		1317	// TODO: we actually want to update tmp, not op,
		1318	// but some caller surely breaks when we return tmp
		1319	// from here :/
1295	op->nrof += tmp->nrof;	1320	op->nrof += tmp->nrof;
1296	tmp->destroy ();	1321	tmp->destroy (1);
1297	}	1322	}
1298		1323
1299	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1324	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1300	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1325	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1301		1326
…		…
1308	{	1333	{
1309	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1334	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1310	abort ();	1335	abort ();
1311	}	1336	}
1312		1337
		1338	if (!originator->is_on_map ())
		1339	LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1340	op->debug_desc (), originator->debug_desc ());
		1341
1313	op->above = originator;	1342	op->above = originator;
1314	op->below = originator->below;	1343	op->below = originator->below;
1315
1316	if (op->below)
1317	op->below->above = op;
1318	else
1319	ms.bot = op;
1320
1321	/* since *below* originator, no need to update top */
1322	originator->below = op;	1344	originator->below = op;
		1345
		1346	*(op->below ? &op->below->above : &ms.bot) = op;
1323	}	1347	}
1324	else	1348	else
1325	{	1349	{
1326	top = ms.bot;	1350	object *floor = 0;
		1351	object *top = ms.top;
1327		1352
1328	/* If there are other objects, then */	1353	/* If there are other objects, then */
1329	if ((!(flag & INS_MAP_LOAD)) && top)	1354	if (top)
1330	{	1355	{
1331	object *last = 0;
1332
1333	/*	1356	/*
1334	* If there are multiple objects on this space, we do some trickier handling.	1357	* If there are multiple objects on this space, we do some trickier handling.
1335	* We've already dealt with merging if appropriate.	1358	* We've already dealt with merging if appropriate.
1336	* Generally, we want to put the new object on top. But if	1359	* Generally, we want to put the new object on top. But if
1337	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1360	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1340	* once we get to them. This reduces the need to traverse over all of	1363	* once we get to them. This reduces the need to traverse over all of
1341	* them when adding another one - this saves quite a bit of cpu time	1364	* them when adding another one - this saves quite a bit of cpu time
1342	* when lots of spells are cast in one area. Currently, it is presumed	1365	* when lots of spells are cast in one area. Currently, it is presumed
1343	* that flying non pickable objects are spell objects.	1366	* that flying non pickable objects are spell objects.
1344	*/	1367	*/
1345	for (top = ms.bot; top; top = top->above)	1368	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1346	{	1369	{
1347	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1370	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1348	floor = top;	1371	floor = tmp;
1349		1372
1350	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1373	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1351	{	1374	{
1352	/* We insert above top, so we want this object below this */	1375	/* We insert above top, so we want this object below this */
1353	top = top->below;	1376	top = tmp->below;
1354	break;	1377	break;
1355	}	1378	}
1356		1379
1357	last = top;	1380	top = tmp;
1358	}	1381	}
1359
1360	/* Don't want top to be NULL, so set it to the last valid object */
1361	top = last;
1362		1382
1363	/* We let update_position deal with figuring out what the space	1383	/* We let update_position deal with figuring out what the space
1364	* looks like instead of lots of conditions here.	1384	* looks like instead of lots of conditions here.
1365	* makes things faster, and effectively the same result.	1385	* makes things faster, and effectively the same result.
1366	*/	1386	*/
…		…
1373	*/	1393	*/
1374	if (!(flag & INS_ON_TOP)	1394	if (!(flag & INS_ON_TOP)
1375	&& ms.flags () & P_BLOCKSVIEW	1395	&& ms.flags () & P_BLOCKSVIEW
1376	&& (op->face && !faces [op->face].visibility))	1396	&& (op->face && !faces [op->face].visibility))
1377	{	1397	{
		1398	object *last;
		1399
1378	for (last = top; last != floor; last = last->below)	1400	for (last = top; last != floor; last = last->below)
1379	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1401	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1380	break;	1402	break;
1381		1403
1382	/* Check to see if we found the object that blocks view,	1404	/* Check to see if we found the object that blocks view,
…		…
1387	if (last && last->below && last != floor)	1409	if (last && last->below && last != floor)
1388	top = last->below;	1410	top = last->below;
1389	}	1411	}
1390	} /* If objects on this space */	1412	} /* If objects on this space */
1391		1413
1392	if (flag & INS_MAP_LOAD)
1393	top = ms.top;
1394
1395	if (flag & INS_ABOVE_FLOOR_ONLY)	1414	if (flag & INS_ABOVE_FLOOR_ONLY)
1396	top = floor;	1415	top = floor;
1397		1416
1398	/* Top is the object that our object (op) is going to get inserted above.	1417	// insert object above top, or bottom-most if top = 0
1399	*/
1400
1401	/* First object on this space */
1402	if (!top)	1418	if (!top)
1403	{	1419	{
		1420	op->below = 0;
1404	op->above = ms.bot;	1421	op->above = ms.bot;
1405
1406	if (op->above)
1407	op->above->below = op;
1408
1409	op->below = 0;
1410	ms.bot = op;	1422	ms.bot = op;
		1423
		1424	*(op->above ? &op->above->below : &ms.top) = op;
1411	}	1425	}
1412	else	1426	else
1413	{ /* get inserted into the stack above top */	1427	{
1414	op->above = top->above;	1428	op->above = top->above;
1415
1416	if (op->above)
1417	op->above->below = op;	1429	top->above = op;
1418		1430
1419	op->below = top;	1431	op->below = top;
1420	top->above = op;	1432	*(op->above ? &op->above->below : &ms.top) = op;
1421	}	1433	}
1422		1434	}
1423	if (!op->above)
1424	ms.top = op;
1425	} /* else not INS_BELOW_ORIGINATOR */
1426		1435
1427	if (op->type == PLAYER)	1436	if (op->type == PLAYER)
1428	{	1437	{
1429	op->contr->do_los = 1;	1438	op->contr->do_los = 1;
1430	++op->map->players;	1439	++op->map->players;
1431	op->map->touch ();	1440	op->map->touch ();
1432	}	1441	}
1433		1442
1434	op->map->dirty = true;	1443	op->map->dirty = true;
1435		1444
1436	/* If we have a floor, we know the player, if any, will be above
1437	* it, so save a few ticks and start from there.
1438	*/
1439	if (!(flag & INS_MAP_LOAD))
1440	if (object *pl = ms.player ())	1445	if (object *pl = ms.player ())
		1446	//TODO: the floorbox prev/next might need updating
		1447	//esrv_send_item (pl, op);
		1448	//TODO: update floorbox to preserve ordering
1441	if (pl->contr->ns)	1449	if (pl->contr->ns)
1442	pl->contr->ns->floorbox_update ();	1450	pl->contr->ns->floorbox_update ();
1443		1451
1444	/* If this object glows, it may affect lighting conditions that are	1452	/* If this object glows, it may affect lighting conditions that are
1445	* visible to others on this map. But update_all_los is really	1453	* visible to others on this map. But update_all_los is really
1446	* an inefficient way to do this, as it means los for all players	1454	* an inefficient way to do this, as it means los for all players
1447	* on the map will get recalculated. The players could very well	1455	* on the map will get recalculated. The players could very well
…		…
1466	* blocked() and wall() work properly), and these flags are updated by	1474	* blocked() and wall() work properly), and these flags are updated by
1467	* update_object().	1475	* update_object().
1468	*/	1476	*/
1469		1477
1470	/* if this is not the head or flag has been passed, don't check walk on status */	1478	/* if this is not the head or flag has been passed, don't check walk on status */
1471	if (!(flag & INS_NO_WALK_ON) && !op->head)	1479	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1472	{	1480	{
1473	if (check_move_on (op, originator))	1481	if (check_move_on (op, originator))
1474	return 0;	1482	return 0;
1475		1483
1476	/* If we are a multi part object, lets work our way through the check	1484	/* If we are a multi part object, lets work our way through the check
1477	* walk on's.	1485	* walk on's.
1478	*/	1486	*/
1479	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1487	for (object *tmp = op->more; tmp; tmp = tmp->more)
1480	if (check_move_on (tmp, originator))	1488	if (check_move_on (tmp, originator))
1481	return 0;	1489	return 0;
1482	}	1490	}
1483		1491
1484	return op;	1492	return op;
…		…
1489	* op is the object to insert it under: supplies x and the map.	1497	* op is the object to insert it under: supplies x and the map.
1490	*/	1498	*/
1491	void	1499	void
1492	replace_insert_ob_in_map (const char *arch_string, object *op)	1500	replace_insert_ob_in_map (const char *arch_string, object *op)
1493	{	1501	{
1494	object *tmp, *tmp1;
1495
1496	/* first search for itself and remove any old instances */	1502	/* first search for itself and remove any old instances */
1497		1503
1498	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1504	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1499	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1505	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1500	tmp->destroy ();	1506	tmp->destroy (1);
1501		1507
1502	tmp1 = arch_to_object (archetype::find (arch_string));	1508	object *tmp = arch_to_object (archetype::find (arch_string));
1503		1509
1504	tmp1->x = op->x;	1510	tmp->x = op->x;
1505	tmp1->y = op->y;	1511	tmp->y = op->y;
		1512
1506	insert_ob_in_map (tmp1, op->map, op, 0);	1513	insert_ob_in_map (tmp, op->map, op, 0);
1507	}	1514	}
1508		1515
1509	object *	1516	object *
1510	object::insert_at (object *where, object *originator, int flags)	1517	object::insert_at (object *where, object *originator, int flags)
1511	{	1518	{
		1519	if (where->env)
		1520	return where->env->insert (this);
		1521	else
1512	return where->map->insert (this, where->x, where->y, originator, flags);	1522	return where->map->insert (this, where->x, where->y, originator, flags);
1513	}	1523	}
1514		1524
1515	/*	1525	/*
1516	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1517	* is returned contains nr objects, and the remaining parts contains
1518	* the rest (or is removed and freed if that number is 0).
1519	* On failure, NULL is returned, and the reason put into the
1520	* global static errmsg array.
1521	*/
1522	object *
1523	get_split_ob (object *orig_ob, uint32 nr)
1524	{
1525	object *newob;
1526	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1527
1528	if (orig_ob->nrof < nr)
1529	{
1530	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1531	return NULL;
1532	}
1533
1534	newob = object_create_clone (orig_ob);
1535
1536	if ((orig_ob->nrof -= nr) < 1)
1537	orig_ob->destroy (1);
1538	else if (!is_removed)
1539	{
1540	if (orig_ob->env != NULL)
1541	sub_weight (orig_ob->env, orig_ob->weight * nr);
1542	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1543	{
1544	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1545	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1546	return NULL;
1547	}
1548	}
1549
1550	newob->nrof = nr;
1551
1552	return newob;
1553	}
1554
1555	/*
1556	* decrease_ob_nr(object, number) decreases a specified number from	1526	* decrease(object, number) decreases a specified number from
1557	* the amount of an object. If the amount reaches 0, the object	1527	* the amount of an object. If the amount reaches 0, the object
1558	* is subsequently removed and freed.	1528	* is subsequently removed and freed.
1559	*	1529	*
1560	* Return value: 'op' if something is left, NULL if the amount reached 0	1530	* Return value: 'op' if something is left, NULL if the amount reached 0
1561	*/	1531	*/
		1532	bool
		1533	object::decrease (sint32 nr)
		1534	{
		1535	if (!nr)
		1536	return true;
		1537
		1538	nr = min (nr, nrof);
		1539
		1540	nrof -= nr;
		1541
		1542	if (nrof)
		1543	{
		1544	adjust_weight (env, -weight * nr); // carrying == 0
		1545
		1546	if (object *pl = visible_to ())
		1547	esrv_update_item (UPD_NROF, pl, this);
		1548
		1549	return true;
		1550	}
		1551	else
		1552	{
		1553	destroy (1);
		1554	return false;
		1555	}
		1556	}
		1557
		1558	/*
		1559	* split(ob,nr) splits up ob into two parts. The part which
		1560	* is returned contains nr objects, and the remaining parts contains
		1561	* the rest (or is removed and returned if that number is 0).
		1562	* On failure, NULL is returned.
		1563	*/
1562	object *	1564	object *
1563	decrease_ob_nr (object *op, uint32 i)	1565	object::split (sint32 nr)
1564	{	1566	{
1565	object *tmp;	1567	int have = number_of ();
1566		1568
1567	if (i == 0) /* objects with op->nrof require this check */	1569	if (have < nr)
1568	return op;	1570	return 0;
1569		1571	else if (have == nr)
1570	if (i > op->nrof)
1571	i = op->nrof;
1572
1573	if (QUERY_FLAG (op, FLAG_REMOVED))
1574	op->nrof -= i;
1575	else if (op->env)
1576	{	1572	{
1577	/* is this object in the players inventory, or sub container
1578	* therein?
1579	*/
1580	tmp = op->in_player ();
1581	/* nope. Is this a container the player has opened?
1582	* If so, set tmp to that player.
1583	* IMO, searching through all the players will mostly
1584	* likely be quicker than following op->env to the map,
1585	* and then searching the map for a player.
1586	*/
1587	if (!tmp)
1588	for_all_players (pl)
1589	if (pl->ob->container == op->env)
1590	{
1591	tmp = pl->ob;
1592	break;
1593	}
1594
1595	if (i < op->nrof)
1596	{
1597	sub_weight (op->env, op->weight * i);
1598	op->nrof -= i;
1599	if (tmp)
1600	esrv_send_item (tmp, op);
1601	}
1602	else
1603	{
1604	op->remove ();	1573	remove ();
1605	op->nrof = 0;	1574	return this;
1606	if (tmp)
1607	esrv_del_item (tmp->contr, op->count);
1608	}
1609	}	1575	}
1610	else	1576	else
1611	{	1577	{
1612	object *above = op->above;	1578	decrease (nr);
1613		1579
1614	if (i < op->nrof)	1580	object *op = deep_clone ();
1615	op->nrof -= i;	1581	op->nrof = nr;
1616	else
1617	{
1618	op->remove ();
1619	op->nrof = 0;
1620	}
1621
1622	/* Since we just removed op, op->above is null */
1623	for (tmp = above; tmp; tmp = tmp->above)
1624	if (tmp->type == PLAYER)
1625	{
1626	if (op->nrof)
1627	esrv_send_item (tmp, op);
1628	else
1629	esrv_del_item (tmp->contr, op->count);
1630	}
1631	}
1632
1633	if (op->nrof)
1634	return op;	1582	return op;
1635	else
1636	{
1637	op->destroy ();
1638	return 0;
1639	}
1640	}
1641
1642	/*
1643	* add_weight(object, weight) adds the specified weight to an object,
1644	* and also updates how much the environment(s) is/are carrying.
1645	*/
1646	void
1647	add_weight (object *op, signed long weight)
1648	{
1649	while (op != NULL)
1650	{
1651	if (op->type == CONTAINER)
1652	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1653
1654	op->carrying += weight;
1655	op = op->env;
1656	}	1583	}
1657	}	1584	}
1658		1585
1659	object *	1586	object *
1660	insert_ob_in_ob (object *op, object *where)	1587	insert_ob_in_ob (object *op, object *where)
…		…
1665	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1592	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1666	free (dump);	1593	free (dump);
1667	return op;	1594	return op;
1668	}	1595	}
1669		1596
1670	if (where->head)	1597	if (where->head_ () != where)
1671	{	1598	{
1672	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1599	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1673	where = where->head;	1600	where = where->head;
1674	}	1601	}
1675		1602
1676	return where->insert (op);	1603	return where->insert (op);
1677	}	1604	}
…		…
1685	* be != op, if items are merged. -Tero	1612	* be != op, if items are merged. -Tero
1686	*/	1613	*/
1687	object *	1614	object *
1688	object::insert (object *op)	1615	object::insert (object *op)
1689	{	1616	{
1690	object *tmp, *otmp;
1691
1692	if (!QUERY_FLAG (op, FLAG_REMOVED))
1693	op->remove ();
1694
1695	if (op->more)	1617	if (op->more)
1696	{	1618	{
1697	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1619	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1698	return op;	1620	return op;
1699	}	1621	}
1700		1622
1701	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1623	op->remove ();
1702	CLEAR_FLAG (op, FLAG_REMOVED);	1624
		1625	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1626
1703	if (op->nrof)	1627	if (op->nrof)
1704	{
1705	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1628	for (object *tmp = inv; tmp; tmp = tmp->below)
1706	if (object::can_merge (tmp, op))	1629	if (object::can_merge (tmp, op))
1707	{	1630	{
1708	/* return the original object and remove inserted object	1631	/* return the original object and remove inserted object
1709	(client needs the original object) */	1632	(client needs the original object) */
1710	tmp->nrof += op->nrof;	1633	tmp->nrof += op->nrof;
1711	/* Weight handling gets pretty funky. Since we are adding to	1634
1712	* tmp->nrof, we need to increase the weight.	1635	if (object *pl = tmp->visible_to ())
1713	*/	1636	esrv_update_item (UPD_NROF, pl, tmp);
		1637
1714	add_weight (this, op->weight * op->nrof);	1638	adjust_weight (this, op->total_weight ());
1715	SET_FLAG (op, FLAG_REMOVED);	1639
1716	op->destroy (); /* free the inserted object */	1640	op->destroy (1);
1717	op = tmp;	1641	op = tmp;
1718	op->remove (); /* and fix old object's links */	1642	goto inserted;
1719	CLEAR_FLAG (op, FLAG_REMOVED);
1720	break;
1721	}	1643	}
1722		1644
1723	/* I assume combined objects have no inventory	1645	op->owner = 0; // it's his/hers now. period.
1724	* We add the weight - this object could have just been removed
1725	* (if it was possible to merge). calling remove_ob will subtract
1726	* the weight, so we need to add it in again, since we actually do
1727	* the linking below
1728	*/
1729	add_weight (this, op->weight * op->nrof);
1730	}
1731	else
1732	add_weight (this, (op->weight + op->carrying));
1733
1734	otmp = this->in_player ();
1735	if (otmp && otmp->contr)
1736	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1737	otmp->update_stats ();
1738
1739	op->map = 0;	1646	op->map = 0;
1740	op->env = this;	1647	op->x = 0;
		1648	op->y = 0;
		1649
1741	op->above = 0;	1650	op->above = 0;
1742	op->below = 0;	1651	op->below = inv;
1743	op->x = 0, op->y = 0;	1652	op->env = this;
1744		1653
		1654	if (inv)
		1655	inv->above = op;
		1656
		1657	inv = op;
		1658
		1659	op->flag [FLAG_REMOVED] = 0;
		1660
		1661	if (object *pl = op->visible_to ())
		1662	esrv_send_item (pl, op);
		1663
		1664	adjust_weight (this, op->total_weight ());
		1665
		1666	inserted:
1745	/* reset the light list and los of the players on the map */	1667	/* reset the light list and los of the players on the map */
1746	if ((op->glow_radius != 0) && map)	1668	if (op->glow_radius && map && map->darkness)
1747	{
1748	#ifdef DEBUG_LIGHTS
1749	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1750	#endif /* DEBUG_LIGHTS */
1751	if (map->darkness)
1752	update_all_los (map, x, y);	1669	update_all_los (map, x, y);
1753	}
1754		1670
1755	/* Client has no idea of ordering so lets not bother ordering it here.	1671	// if this is a player's inventory, update stats
1756	* It sure simplifies this function...	1672	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1757	*/	1673	update_stats ();
1758	if (!inv)
1759	inv = op;
1760	else
1761	{
1762	op->below = inv;
1763	op->below->above = op;
1764	inv = op;
1765	}
1766		1674
1767	INVOKE_OBJECT (INSERT, this);	1675	INVOKE_OBJECT (INSERT, this);
1768		1676
1769	return op;	1677	return op;
1770	}	1678	}
…		…
1898	LOG (llevError, "Present_arch called outside map.\n");	1806	LOG (llevError, "Present_arch called outside map.\n");
1899	return NULL;	1807	return NULL;
1900	}	1808	}
1901		1809
1902	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1810	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1903	if (tmp->arch == at)	1811	if (tmp->arch->archname == at->archname)
1904	return tmp;	1812	return tmp;
1905		1813
1906	return NULL;	1814	return NULL;
1907	}	1815	}
1908		1816
…		…
1972	* The first matching object is returned, or NULL if none.	1880	* The first matching object is returned, or NULL if none.
1973	*/	1881	*/
1974	object *	1882	object *
1975	present_arch_in_ob (const archetype *at, const object *op)	1883	present_arch_in_ob (const archetype *at, const object *op)
1976	{	1884	{
1977	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1885	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1978	if (tmp->arch == at)	1886	if (tmp->arch->archname == at->archname)
1979	return tmp;	1887	return tmp;
1980		1888
1981	return NULL;	1889	return NULL;
1982	}	1890	}
1983		1891
…		…
1985	* activate recursively a flag on an object inventory	1893	* activate recursively a flag on an object inventory
1986	*/	1894	*/
1987	void	1895	void
1988	flag_inv (object *op, int flag)	1896	flag_inv (object *op, int flag)
1989	{	1897	{
1990	if (op->inv)
1991	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1898	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1992	{	1899	{
1993	SET_FLAG (tmp, flag);	1900	SET_FLAG (tmp, flag);
1994	flag_inv (tmp, flag);	1901	flag_inv (tmp, flag);
1995	}	1902	}
1996	}	1903	}
1997		1904
1998	/*	1905	/*
1999	* deactivate recursively a flag on an object inventory	1906	* deactivate recursively a flag on an object inventory
2000	*/	1907	*/
2001	void	1908	void
2002	unflag_inv (object *op, int flag)	1909	unflag_inv (object *op, int flag)
2003	{	1910	{
2004	if (op->inv)
2005	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1911	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2006	{	1912	{
2007	CLEAR_FLAG (tmp, flag);	1913	CLEAR_FLAG (tmp, flag);
2008	unflag_inv (tmp, flag);	1914	unflag_inv (tmp, flag);
2009	}	1915	}
2010	}
2011
2012	/*
2013	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2014	* all it's inventory (recursively).
2015	* If checksums are used, a player will get set_cheat called for
2016	* him/her-self and all object carried by a call to this function.
2017	*/
2018	void
2019	set_cheat (object *op)
2020	{
2021	SET_FLAG (op, FLAG_WAS_WIZ);
2022	flag_inv (op, FLAG_WAS_WIZ);
2023	}	1916	}
2024		1917
2025	/*	1918	/*
2026	* find_free_spot(object, map, x, y, start, stop) will search for	1919	* find_free_spot(object, map, x, y, start, stop) will search for
2027	* a spot at the given map and coordinates which will be able to contain	1920	* a spot at the given map and coordinates which will be able to contain
…		…
2029	* to search (see the freearr_x/y[] definition).	1922	* to search (see the freearr_x/y[] definition).
2030	* It returns a random choice among the alternatives found.	1923	* It returns a random choice among the alternatives found.
2031	* start and stop are where to start relative to the free_arr array (1,9	1924	* start and stop are where to start relative to the free_arr array (1,9
2032	* does all 4 immediate directions). This returns the index into the	1925	* does all 4 immediate directions). This returns the index into the
2033	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1926	* array of the free spot, -1 if no spot available (dir 0 = x,y)
2034	* Note - this only checks to see if there is space for the head of the
2035	* object - if it is a multispace object, this should be called for all
2036	* pieces.
2037	* Note2: This function does correctly handle tiled maps, but does not	1927	* Note: This function does correctly handle tiled maps, but does not
2038	* inform the caller. However, insert_ob_in_map will update as	1928	* inform the caller. However, insert_ob_in_map will update as
2039	* necessary, so the caller shouldn't need to do any special work.	1929	* necessary, so the caller shouldn't need to do any special work.
2040	* Note - updated to take an object instead of archetype - this is necessary	1930	* Note - updated to take an object instead of archetype - this is necessary
2041	* because arch_blocked (now ob_blocked) needs to know the movement type	1931	* because arch_blocked (now ob_blocked) needs to know the movement type
2042	* to know if the space in question will block the object. We can't use	1932	* to know if the space in question will block the object. We can't use
…		…
2044	* customized, changed states, etc.	1934	* customized, changed states, etc.
2045	*/	1935	*/
2046	int	1936	int
2047	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1937	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2048	{	1938	{
		1939	int altern[SIZEOFFREE];
2049	int index = 0, flag;	1940	int index = 0, flag;
2050	int altern[SIZEOFFREE];
2051		1941
2052	for (int i = start; i < stop; i++)	1942	for (int i = start; i < stop; i++)
2053	{	1943	{
2054	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1944	mapxy pos (m, x, y); pos.move (i);
2055	if (!flag)	1945
		1946	if (!pos.normalise ())
		1947	continue;
		1948
		1949	mapspace &ms = *pos;
		1950
		1951	if (ms.flags () & P_IS_ALIVE)
		1952	continue;
		1953
		1954	/* However, often
		1955	* ob doesn't have any move type (when used to place exits)
		1956	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1957	*/
		1958	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1959	{
2056	altern [index++] = i;	1960	altern [index++] = i;
		1961	continue;
		1962	}
2057		1963
2058	/* Basically, if we find a wall on a space, we cut down the search size.	1964	/* Basically, if we find a wall on a space, we cut down the search size.
2059	* In this way, we won't return spaces that are on another side of a wall.	1965	* In this way, we won't return spaces that are on another side of a wall.
2060	* This mostly work, but it cuts down the search size in all directions -	1966	* This mostly work, but it cuts down the search size in all directions -
2061	* if the space being examined only has a wall to the north and empty	1967	* if the space being examined only has a wall to the north and empty
2062	* spaces in all the other directions, this will reduce the search space	1968	* spaces in all the other directions, this will reduce the search space
2063	* to only the spaces immediately surrounding the target area, and	1969	* to only the spaces immediately surrounding the target area, and
2064	* won't look 2 spaces south of the target space.	1970	* won't look 2 spaces south of the target space.
2065	*/	1971	*/
2066	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1972	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1973	{
2067	stop = maxfree[i];	1974	stop = maxfree[i];
		1975	continue;
		1976	}
		1977
		1978	/* Note it is intentional that we check ob - the movement type of the
		1979	* head of the object should correspond for the entire object.
		1980	*/
		1981	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1982	continue;
		1983
		1984	if (ob->blocked (m, pos.x, pos.y))
		1985	continue;
		1986
		1987	altern [index++] = i;
2068	}	1988	}
2069		1989
2070	if (!index)	1990	if (!index)
2071	return -1;	1991	return -1;
2072		1992
…		…
2081	*/	2001	*/
2082	int	2002	int
2083	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2003	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2084	{	2004	{
2085	for (int i = 0; i < SIZEOFFREE; i++)	2005	for (int i = 0; i < SIZEOFFREE; i++)
2086	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2006	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2087	return i;	2007	return i;
2088		2008
2089	return -1;	2009	return -1;
2090	}	2010	}
2091		2011
…		…
2145	object *tmp;	2065	object *tmp;
2146	maptile *mp;	2066	maptile *mp;
2147		2067
2148	MoveType blocked, move_type;	2068	MoveType blocked, move_type;
2149		2069
2150	if (exclude && exclude->head)	2070	if (exclude && exclude->head_ () != exclude)
2151	{	2071	{
2152	exclude = exclude->head;	2072	exclude = exclude->head;
2153	move_type = exclude->move_type;	2073	move_type = exclude->move_type;
2154	}	2074	}
2155	else	2075	else
…		…
2178	max = maxfree[i];	2098	max = maxfree[i];
2179	else if (mflags & P_IS_ALIVE)	2099	else if (mflags & P_IS_ALIVE)
2180	{	2100	{
2181	for (tmp = ms.bot; tmp; tmp = tmp->above)	2101	for (tmp = ms.bot; tmp; tmp = tmp->above)
2182	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2102	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2183	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2103	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2184	break;	2104	break;
2185		2105
2186	if (tmp)	2106	if (tmp)
2187	return freedir[i];	2107	return freedir[i];
2188	}	2108	}
…		…
2368	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2288	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2369	* core dumps if they do.	2289	* core dumps if they do.
2370	*	2290	*
2371	* Add a check so we can't pick up invisible objects (0.93.8)	2291	* Add a check so we can't pick up invisible objects (0.93.8)
2372	*/	2292	*/
2373
2374	int	2293	int
2375	can_pick (const object *who, const object *item)	2294	can_pick (const object *who, const object *item)
2376	{	2295	{
2377	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2296	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2378	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2297	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2381		2300
2382	/*	2301	/*
2383	* create clone from object to another	2302	* create clone from object to another
2384	*/	2303	*/
2385	object *	2304	object *
2386	object_create_clone (object *asrc)	2305	object::deep_clone ()
2387	{	2306	{
2388	object *dst = 0, *tmp, *src, *part, *prev, *item;	2307	assert (("deep_clone called on non-head object", is_head ()));
2389		2308
2390	if (!asrc)	2309	object *dst = clone ();
2391	return 0;
2392		2310
2393	src = asrc;	2311	object *prev = dst;
2394	if (src->head)
2395	src = src->head;
2396
2397	prev = 0;
2398	for (part = src; part; part = part->more)	2312	for (object *part = this->more; part; part = part->more)
2399	{	2313	{
2400	tmp = part->clone ();	2314	object *tmp = part->clone ();
2401	tmp->x -= src->x;
2402	tmp->y -= src->y;
2403
2404	if (!part->head)
2405	{
2406	dst = tmp;
2407	tmp->head = 0;
2408	}
2409	else
2410	tmp->head = dst;	2315	tmp->head = dst;
2411
2412	tmp->more = 0;
2413
2414	if (prev)
2415	prev->more = tmp;	2316	prev->more = tmp;
2416
2417	prev = tmp;	2317	prev = tmp;
2418	}	2318	}
2419		2319
2420	for (item = src->inv; item; item = item->below)	2320	for (object *item = inv; item; item = item->below)
2421	insert_ob_in_ob (object_create_clone (item), dst);	2321	insert_ob_in_ob (item->deep_clone (), dst);
2422		2322
2423	return dst;	2323	return dst;
2424	}	2324	}
2425		2325
2426	/* This returns the first object in who's inventory that	2326	/* This returns the first object in who's inventory that
…		…
2435	return tmp;	2335	return tmp;
2436		2336
2437	return 0;	2337	return 0;
2438	}	2338	}
2439		2339
2440	/* If ob has a field named key, return the link from the list,	2340	const shstr &
2441	* otherwise return NULL.	2341	object::kv_get (const shstr &key) const
2442	*
2443	* key must be a passed in shared string - otherwise, this won't
2444	* do the desired thing.
2445	*/
2446	key_value *
2447	get_ob_key_link (const object *ob, const char *key)
2448	{	2342	{
2449	for (key_value *link = ob->key_values; link; link = link->next)	2343	for (key_value *kv = key_values; kv; kv = kv->next)
2450	if (link->key == key)	2344	if (kv->key == key)
2451	return link;
2452
2453	return 0;
2454	}
2455
2456	/*
2457	* Returns the value of op has an extra_field for key, or NULL.
2458	*
2459	* The argument doesn't need to be a shared string.
2460	*
2461	* The returned string is shared.
2462	*/
2463	const char *
2464	get_ob_key_value (const object *op, const char *const key)
2465	{
2466	key_value *link;
2467	shstr_cmp canonical_key (key);
2468
2469	if (!canonical_key)
2470	{
2471	/* 1. There being a field named key on any object
2472	* implies there'd be a shared string to find.
2473	* 2. Since there isn't, no object has this field.
2474	* 3. Therefore, *this* object doesn't have this field.
2475	*/
2476	return 0;
2477	}
2478
2479	/* This is copied from get_ob_key_link() above -
2480	* only 4 lines, and saves the function call overhead.
2481	*/
2482	for (link = op->key_values; link; link = link->next)
2483	if (link->key == canonical_key)
2484	return link->value;	2345	return kv->value;
2485		2346
2486	return 0;	2347	return shstr_null;
2487	}	2348	}
2488		2349
2489	/*	2350	void
2490	* Updates the canonical_key in op to value.	2351	object::kv_set (const shstr &key, const shstr &value)
2491	*
2492	* canonical_key is a shared string (value doesn't have to be).
2493	*
2494	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2495	* keys.
2496	*
2497	* Returns TRUE on success.
2498	*/
2499	int
2500	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2501	{	2352	{
2502	key_value *field = NULL, *last = NULL;	2353	for (key_value *kv = key_values; kv; kv = kv->next)
2503		2354	if (kv->key == key)
2504	for (field = op->key_values; field != NULL; field = field->next)
2505	{
2506	if (field->key != canonical_key)
2507	{	2355	{
2508	last = field;	2356	kv->value = value;
2509	continue;	2357	return;
2510	}	2358	}
2511		2359
2512	if (value)	2360	key_value *kv = new key_value;
2513	field->value = value;	2361
2514	else	2362	kv->next = key_values;
		2363	kv->key = key;
		2364	kv->value = value;
		2365
		2366	key_values = kv;
		2367	}
		2368
		2369	void
		2370	object::kv_del (const shstr &key)
		2371	{
		2372	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2373	if ((*kvp)->key == key)
2515	{	2374	{
2516	/* Basically, if the archetype has this key set,	2375	key_value *kv = *kvp;
2517	* we need to store the null value so when we save	2376	*kvp = (*kvp)->next;
2518	* it, we save the empty value so that when we load,	2377	delete kv;
2519	* we get this value back again.	2378	return;
2520	*/
2521	if (get_ob_key_link (&op->arch->clone, canonical_key))
2522	field->value = 0;
2523	else
2524	{
2525	if (last)
2526	last->next = field->next;
2527	else
2528	op->key_values = field->next;
2529
2530	delete field;
2531	}
2532	}	2379	}
2533	return TRUE;
2534	}
2535	/* IF we get here, key doesn't exist */
2536
2537	/* No field, we'll have to add it. */
2538
2539	if (!add_key)
2540	return FALSE;
2541
2542	/* There isn't any good reason to store a null
2543	* value in the key/value list. If the archetype has
2544	* this key, then we should also have it, so shouldn't
2545	* be here. If user wants to store empty strings,
2546	* should pass in ""
2547	*/
2548	if (value == NULL)
2549	return TRUE;
2550
2551	field = new key_value;
2552
2553	field->key = canonical_key;
2554	field->value = value;
2555	/* Usual prepend-addition. */
2556	field->next = op->key_values;
2557	op->key_values = field;
2558
2559	return TRUE;
2560	}
2561
2562	/*
2563	* Updates the key in op to value.
2564	*
2565	* If add_key is FALSE, this will only update existing keys,
2566	* and not add new ones.
2567	* In general, should be little reason FALSE is ever passed in for add_key
2568	*
2569	* Returns TRUE on success.
2570	*/
2571	int
2572	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2573	{
2574	shstr key_ (key);
2575
2576	return set_ob_key_value_s (op, key_, value, add_key);
2577	}	2380	}
2578		2381
2579	object::depth_iterator::depth_iterator (object *container)	2382	object::depth_iterator::depth_iterator (object *container)
2580	: iterator_base (container)	2383	: iterator_base (container)
2581	{	2384	{
…		…
2594	item = item->inv;	2397	item = item->inv;
2595	}	2398	}
2596	else	2399	else
2597	item = item->env;	2400	item = item->env;
2598	}	2401	}
2599
2600		2402
2601	const char *	2403	const char *
2602	object::flag_desc (char *desc, int len) const	2404	object::flag_desc (char *desc, int len) const
2603	{	2405	{
2604	char *p = desc;	2406	char *p = desc;
…		…
2632	{	2434	{
2633	char flagdesc[512];	2435	char flagdesc[512];
2634	char info2[256 * 4];	2436	char info2[256 * 4];
2635	char *p = info;	2437	char *p = info;
2636		2438
2637	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2439	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2638	count, uuid.seq,	2440	count,
		2441	uuid.c_str (),
2639	&name,	2442	&name,
2640	title ? "\",title:\"" : "",	2443	title ? ",title:\"" : "",
2641	title ? (const char *)title : "",	2444	title ? (const char *)title : "",
		2445	title ? "\"" : "",
2642	flag_desc (flagdesc, 512), type);	2446	flag_desc (flagdesc, 512), type);
2643		2447
2644	if (env)	2448	if (!flag[FLAG_REMOVED] && env)
2645	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2449	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2646		2450
2647	if (map)	2451	if (map)
2648	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2452	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2649		2453
…		…
2667	}	2471	}
2668		2472
2669	const materialtype_t *	2473	const materialtype_t *
2670	object::dominant_material () const	2474	object::dominant_material () const
2671	{	2475	{
2672	if (materialtype_t *mat = name_to_material (materialname))	2476	if (materialtype_t *mt = name_to_material (materialname))
2673	return mat;	2477	return mt;
2674		2478
2675	// omfg this is slow, this has to be temporary :)
2676	shstr unknown ("unknown");
2677
2678	return name_to_material (unknown);	2479	return name_to_material (shstr_unknown);
2679	}	2480	}
2680		2481
2681	void	2482	void
2682	object::open_container (object *new_container)	2483	object::open_container (object *new_container)
2683	{	2484	{
2684	if (container == new_container)	2485	if (container == new_container)
2685	return;	2486	return;
2686		2487
2687	if (object *old_container = container)	2488	object *old_container = container;
		2489
		2490	if (old_container)
2688	{	2491	{
2689	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2492	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2690	return;	2493	return;
2691		2494
2692	#if 0	2495	#if 0
…		…
2694	if (object *closer = old_container->inv)	2497	if (object *closer = old_container->inv)
2695	if (closer->type == CLOSE_CON)	2498	if (closer->type == CLOSE_CON)
2696	closer->destroy ();	2499	closer->destroy ();
2697	#endif	2500	#endif
2698		2501
		2502	// make sure the container is available
		2503	esrv_send_item (this, old_container);
		2504
2699	old_container->flag [FLAG_APPLIED] = 0;	2505	old_container->flag [FLAG_APPLIED] = false;
2700	container = 0;	2506	container = 0;
2701		2507
		2508	// client needs item update to make it work, client bug requires this to be separate
2702	esrv_update_item (UPD_FLAGS, this, old_container);	2509	esrv_update_item (UPD_FLAGS, this, old_container);
		2510
2703	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2511	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2512	play_sound (sound_find ("chest_close"));
2704	}	2513	}
2705		2514
2706	if (new_container)	2515	if (new_container)
2707	{	2516	{
2708	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))	2517	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
…		…
2719	}	2528	}
2720	#endif	2529	#endif
2721		2530
2722	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2531	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2723		2532
		2533	// make sure the container is available, client bug requires this to be separate
		2534	esrv_send_item (this, new_container);
		2535
2724	new_container->flag [FLAG_APPLIED] = 1;	2536	new_container->flag [FLAG_APPLIED] = true;
2725	container = new_container;	2537	container = new_container;
2726		2538
		2539	// client needs flag change
2727	esrv_update_item (UPD_FLAGS, this, new_container);	2540	esrv_update_item (UPD_FLAGS, this, new_container);
2728	esrv_send_inventory (this, new_container);	2541	esrv_send_inventory (this, new_container);
		2542	play_sound (sound_find ("chest_open"));
		2543	}
		2544	// else if (!old_container->env && contr && contr->ns)
		2545	// contr->ns->floorbox_reset ();
		2546	}
		2547
		2548	object *
		2549	object::force_find (const shstr name)
		2550	{
		2551	/* cycle through his inventory to look for the MARK we want to
		2552	* place
		2553	*/
		2554	for (object *tmp = inv; tmp; tmp = tmp->below)
		2555	if (tmp->type == FORCE && tmp->slaying == name)
		2556	return splay (tmp);
		2557
		2558	return 0;
		2559	}
		2560
		2561	void
		2562	object::force_add (const shstr name, int duration)
		2563	{
		2564	if (object *force = force_find (name))
		2565	force->destroy ();
		2566
		2567	object *force = get_archetype (FORCE_NAME);
		2568
		2569	force->slaying = name;
		2570	force->stats.food = 1;
		2571	force->speed_left = -1.f;
		2572
		2573	force->set_speed (duration ? 1.f / duration : 0.f);
		2574	force->flag [FLAG_IS_USED_UP] = true;
		2575	force->flag [FLAG_APPLIED] = true;
		2576
		2577	insert (force);
		2578	}
		2579
		2580	void
		2581	object::play_sound (faceidx sound)
		2582	{
		2583	if (!sound)
		2584	return;
		2585
		2586	if (flag [FLAG_REMOVED])
		2587	return;
		2588
		2589	if (env)
2729	}	2590	{
		2591	if (object *pl = in_player ())
		2592	pl->contr->play_sound (sound);
		2593	}
		2594	else
		2595	map->play_sound (sound, x, y);
2730	}	2596	}
2731		2597
2732

Diff Legend

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