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.200 by root, Sun Jan 13 08:55:41 2008 UTC vs.
Revision 1.245 by root, Sun May 18 19:53:07 2008 UTC

1	/*	1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Deliantra 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
…		…
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	*	20	*
21	* The authors can be reached via e-mail to <support@deliantra.net>	21	* The authors can be reached via e-mail to <support@deliantra.net>
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>
33	#include <sproto.h>	29	#include <sproto.h>
34	#include <loader.h>	30	#include <loader.h>
35		31
36	#include <bitset>	32	#include <bitset>
37		33
38	int nrofallocobjects = 0;	34	UUID UUID::cur;
39	static UUID uuid;	35	static uint64_t seq_next_save;
40	const uint64 UUID_SKIP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
41		37
42	objectvec objects;	38	objectvec objects;
43	activevec actives;	39	activevec actives;
44		40
45	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,
46	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
47	};	46	};
48	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,
49	-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
50	};	52	};
51	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,
52	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
53	};	58	};
54	int freedir[SIZEOFFREE] = {	59	int freedir[SIZEOFFREE] = {
55	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,
56	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
57	};	64	};
58		65
59	static void	66	static void
60	write_uuid (void)	67	write_uuid (uval64 skip, bool sync)
61	{	68	{
62	char filename1[MAX_BUF], filename2[MAX_BUF];	69	CALL_BEGIN (2);
63		70	CALL_ARG_SV (newSVval64 (skip));
64	sprintf (filename1, "%s/uuid", settings.localdir);	71	CALL_ARG_SV (boolSV (sync));
65	sprintf (filename2, "%s/uuid~", settings.localdir);	72	CALL_CALL ("cf::write_uuid", G_DISCARD);
66		73	CALL_END;
67	FILE *fp;
68
69	if (!(fp = fopen (filename2, "w")))
70	{
71	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
72	return;
73	}
74
75	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
76	fclose (fp);
77	rename (filename2, filename1);
78	}	74	}
79		75
80	static void	76	static void
81	read_uuid (void)	77	read_uuid (void)
82	{	78	{
83	char filename[MAX_BUF];	79	char filename[MAX_BUF];
84		80
85	sprintf (filename, "%s/uuid", settings.localdir);	81	sprintf (filename, "%s/uuid", settings.localdir);
		82
		83	seq_next_save = 0;
86		84
87	FILE *fp;	85	FILE *fp;
88		86
89	if (!(fp = fopen (filename, "r")))	87	if (!(fp = fopen (filename, "r")))
90	{	88	{
91	if (errno == ENOENT)	89	if (errno == ENOENT)
92	{	90	{
93	LOG (llevInfo, "RESET uid to 1\n");	91	LOG (llevInfo, "RESET uid to 1\n");
94	uuid.seq = 0;	92	UUID::cur.seq = 0;
95	write_uuid ();	93	write_uuid (UUID_GAP, true);
96	return;	94	return;
97	}	95	}
98		96
99	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100	_exit (1);	98	_exit (1);
101	}	99	}
102		100
103	int version;	101	UUID::BUF buf;
104	unsigned long long uid;	102	buf[0] = 0;
105	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	103	fgets (buf, sizeof (buf), fp);
		104
		105	if (!UUID::cur.parse (buf))
106	{	106	{
107	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	107	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
108	_exit (1);	108	_exit (1);
109	}	109	}
110		110
111	uuid.seq = uid;	111	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
112	write_uuid ();	112
113	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	113	write_uuid (UUID_GAP, true);
114	fclose (fp);	114	fclose (fp);
115	}	115	}
116		116
117	UUID	117	UUID
118	gen_uuid ()	118	UUID::gen ()
119	{	119	{
120	UUID uid;	120	UUID uid;
121		121
122	uid.seq = ++uuid.seq;	122	uid.seq = ++cur.seq;
123		123
124	if (!(uuid.seq & (UUID_SKIP - 1)))	124	if (expect_false (cur.seq >= seq_next_save))
125	write_uuid ();	125	{
		126	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		127	write_uuid (UUID_GAP, false);
		128	}
		129
126		130
127	return uid;	131	return uid;
128	}	132	}
129		133
130	void	134	void
131	init_uuid ()	135	UUID::init ()
132	{	136	{
133	read_uuid ();	137	read_uuid ();
134	}	138	}
135		139
136	/* 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. */
137	static int	141	static bool
138	compare_ob_value_lists_one (const object *wants, const object *has)	142	compare_ob_value_lists_one (const object *wants, const object *has)
139	{	143	{
140	key_value *wants_field;
141
142	/* 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
143	* 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
144	* different structure or at least keep the lists sorted...	146	* different structure or at least keep the lists sorted...
145	*/	147	*/
146		148
147	/* For each field in wants, */	149	/* For each field in wants, */
148	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)
149	{	151	if (has->kv_get (kv->key) != kv->value)
150	key_value *has_field;	152	return false;
151
152	/* Look for a field in has with the same key. */
153	has_field = get_ob_key_link (has, wants_field->key);
154
155	if (has_field == NULL)
156	{
157	/* No field with that name. */
158	return FALSE;
159	}
160
161	/* Found the matching field. */
162	if (has_field->value != wants_field->value)
163	{
164	/* Values don't match, so this half of the comparison is false. */
165	return FALSE;
166	}
167
168	/* If we get here, we found a match. Now for the next field in wants. */
169	}
170		153
171	/* 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. */
172	return TRUE;	155	return true;
173	}	156	}
174		157
175	/* Returns TRUE if ob1 has the same key_values as ob2. */	158	/* Returns TRUE if ob1 has the same key_values as ob2. */
176	static int	159	static bool
177	compare_ob_value_lists (const object *ob1, const object *ob2)	160	compare_ob_value_lists (const object *ob1, const object *ob2)
178	{	161	{
179	/* 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,
180	* so we need to run the comparison *twice*. :(	163	* so we need to run the comparison *twice*. :(
181	*/	164	*/
182	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);
183	}	167	}
184		168
185	/* 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
186	* they can be merged together.	170	* they can be merged together.
187	*	171	*
…		…
202	|| ob1->speed != ob2->speed	186	|| ob1->speed != ob2->speed
203	|| ob1->value != ob2->value	187	|| ob1->value != ob2->value
204	|| ob1->name != ob2->name)	188	|| ob1->name != ob2->name)
205	return 0;	189	return 0;
206		190
207	//TODO: this ain't working well, use nicer and correct overflow check	191	// some objects are unmergable
208	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	192	if (!ob1->nrof || !ob2->nrof)
209	* value could not be stored in a sint32 (which unfortunately sometimes is	193	return 0;
210	* 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.
211	*/	199	*/
212	if (ob1->nrof + ob2->nrof >= 1UL << 31)	200	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
213	return 0;	201	return 0;
214		202
215	/* If the objects have been identified, set the BEEN_APPLIED flag.	203	/* If the objects have been identified, set the BEEN_APPLIED flag.
216	* 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
217	* 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
218	* 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
219	* flags lose any meaning.	207	* flags lose any meaning.
220	*/	208	*/
221	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	209	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
222	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	210	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
223		211
224	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	212	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
225	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	213	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
226		214
227	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	215	if (ob1->arch->archname != ob2->arch->archname
228	|| ob1->arch != ob2->arch
229	|| ob1->name != ob2->name	216	|| ob1->name != ob2->name
230	|| ob1->title != ob2->title	217	|| ob1->title != ob2->title
231	|| ob1->msg != ob2->msg	218	|| ob1->msg != ob2->msg
232	|| ob1->weight != ob2->weight	219	|| ob1->weight != ob2->weight
233	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
234	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
235	|| ob1->attacktype != ob2->attacktype	220	|| ob1->attacktype != ob2->attacktype
236	|| ob1->magic != ob2->magic	221	|| ob1->magic != ob2->magic
237	|| ob1->slaying != ob2->slaying	222	|| ob1->slaying != ob2->slaying
238	|| ob1->skill != ob2->skill	223	|| ob1->skill != ob2->skill
239	|| ob1->value != ob2->value	224	|| ob1->value != ob2->value
240	|| 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
241	|| ob1->client_type != ob2->client_type	227	|| ob1->client_type != ob2->client_type
242	|| ob1->materialname != ob2->materialname	228	|| ob1->materialname != ob2->materialname
243	|| ob1->lore != ob2->lore	229	|| ob1->lore != ob2->lore
244	|| ob1->subtype != ob2->subtype	230	|| ob1->subtype != ob2->subtype
245	|| ob1->move_type != ob2->move_type	231	|| ob1->move_type != ob2->move_type
246	|| ob1->move_block != ob2->move_block	232	|| ob1->move_block != ob2->move_block
247	|| ob1->move_allow != ob2->move_allow	233	|| ob1->move_allow != ob2->move_allow
248	|| ob1->move_on != ob2->move_on	234	|| ob1->move_on != ob2->move_on
249	|| ob1->move_off != ob2->move_off	235	|| ob1->move_off != ob2->move_off
250	|| ob1->move_slow != ob2->move_slow	236	|| ob1->move_slow != ob2->move_slow
251	|| 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)))
252	return 0;	240	return 0;
253		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
254	/* This is really a spellbook check - really, we should	249	/* This is really a spellbook check - we should in general
255	* check all objects in the inventory.	250	* not merge objects with real inventories, as splitting them
		251	* is hard.
256	*/	252	*/
257	if (ob1->inv || ob2->inv)	253	if (ob1->inv || ob2->inv)
258	{	254	{
259	if (!(ob1->inv && ob2->inv))	255	if (!(ob1->inv && ob2->inv))
260	return 0; /* inventories differ in length */	256	return 0; /* inventories differ in length */
261		257
262	if (ob1->inv->below || ob2->inv->below)	258	if (ob1->inv->below || ob2->inv->below)
263	return 0; /* more than one object in inv */	259	return 0; /* more than one object in inv */
264		260
265	if (!object::can_merge (ob1->inv, ob2->inv))	261	if (!object::can_merge (ob1->inv, ob2->inv))
266	return 0; /* inventory objexts differ */	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. */
300	return 0;	296
301	else if (!compare_ob_value_lists (ob1, ob2))	297	if (!compare_ob_value_lists (ob1, ob2))
302	return 0;	298	return 0;
303	}	299	}
304		300
305	if (ob1->self || ob2->self)	301	if (ob1->self || ob2->self)
306	{	302	{
…		…
312	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;	308	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
313	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;	309	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
314		310
315	if (k1 != k2)	311	if (k1 != k2)
316	return 0;	312	return 0;
		313
317	else if (k1 == 0)	314	if (k1 == 0)
318	return 1;	315	return 1;
		316
319	else if (!cfperl_can_merge (ob1, ob2))	317	if (!cfperl_can_merge (ob1, ob2))
320	return 0;	318	return 0;
321	}	319	}
322	}	320	}
323		321
324	/* Everything passes, must be OK. */	322	/* Everything passes, must be OK. */
325	return 1;	323	return 1;
326	}	324	}
327		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
328	/*	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	/*
329	* sum_weight() is a recursive function which calculates the weight	399	* this is a recursive function which calculates the weight
330	* 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
331	* containers are carrying, and sums it up.	401	* containers are carrying, and sums it up.
332	*/	402	*/
333	long	403	void
334	sum_weight (object *op)	404	object::update_weight ()
335	{	405	{
336	long sum;	406	sint32 sum = 0;
337	object *inv;
338		407
339	for (sum = 0, inv = op->inv; inv; inv = inv->below)	408	for (object *op = inv; op; op = op->below)
340	{	409	{
341	if (inv->inv)	410	if (op->inv)
342	sum_weight (inv);	411	op->update_weight ();
343		412
344	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)
345	}	419	{
346
347	if (op->type == CONTAINER && op->stats.Str)
348	sum = (sum * (100 - op->stats.Str)) / 100;
349
350	if (op->carrying != sum)
351	op->carrying = sum;	420	carrying = sum;
352		421
353	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	}
354	}	426	}
355		427
356	/**	428	/*
357	* Return the outermost environment object for a given object.	429	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
358	*/
359
360	object *
361	object_get_env_recursive (object *op)
362	{
363	while (op->env != NULL)
364	op = op->env;
365	return op;
366	}
367
368	/*
369	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
370	* Some error messages.
371	* The result of the dump is stored in the static global errmsg array.
372	*/	430	*/
373	char *	431	char *
374	dump_object (object *op)	432	dump_object (object *op)
375	{	433	{
376	if (!op)	434	if (!op)
…		…
390	get_nearest_part (object *op, const object *pl)	448	get_nearest_part (object *op, const object *pl)
391	{	449	{
392	object *tmp, *closest;	450	object *tmp, *closest;
393	int last_dist, i;	451	int last_dist, i;
394		452
395	if (op->more == NULL)	453	if (!op->more)
396	return op;	454	return op;
		455
397	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)
398	if ((i = distance (tmp, pl)) < last_dist)	459	if ((i = distance (tmp, pl)) < last_dist)
399	closest = tmp, last_dist = i;	460	closest = tmp, last_dist = i;
		461
400	return closest;	462	return closest;
401	}	463	}
402		464
403	/*	465	/*
404	* 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.
405	*/	468	*/
406	object *	469	object *
407	find_object (tag_t i)	470	find_object (tag_t i)
408	{	471	{
409	for_all_objects (op)	472	for_all_objects (op)
…		…
420	*/	483	*/
421	object *	484	object *
422	find_object_name (const char *str)	485	find_object_name (const char *str)
423	{	486	{
424	shstr_cmp str_ (str);	487	shstr_cmp str_ (str);
425	object *op;
426		488
		489	if (str_)
427	for_all_objects (op)	490	for_all_objects (op)
428	if (op->name == str_)	491	if (op->name == str_)
429	break;	492	return op;
430		493
431	return op;	494	return 0;
432	}
433
434	void
435	free_all_object_data ()
436	{
437	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
438	}	495	}
439		496
440	/*	497	/*
441	* 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
442	* skill and experience objects.	499	* skill and experience objects.
…		…
540	}	597	}
541		598
542	op->key_values = 0;	599	op->key_values = 0;
543	}	600	}
544		601
545	object &	602	/*
546	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)
547	{	612	{
548	bool is_freed = flag [FLAG_FREED];	613	dst->remove ();
549	bool is_removed = flag [FLAG_REMOVED];
550
551	*(object_copy *)this = src;	614	*(object_copy *)dst = *this;
552
553	flag [FLAG_FREED] = is_freed;
554	flag [FLAG_REMOVED] = is_removed;	615	dst->flag [FLAG_REMOVED] = true;
555		616
556	/* Copy over key_values, if any. */	617	/* Copy over key_values, if any. */
557	if (src.key_values)	618	if (key_values)
558	{	619	{
559	key_value *tail = 0;	620	key_value *tail = 0;
560	key_values = 0;	621	dst->key_values = 0;
561		622
562	for (key_value *i = src.key_values; i; i = i->next)	623	for (key_value *i = key_values; i; i = i->next)
563	{	624	{
564	key_value *new_link = new key_value;	625	key_value *new_link = new key_value;
565		626
566	new_link->next = 0;	627	new_link->next = 0;
567	new_link->key = i->key;	628	new_link->key = i->key;
568	new_link->value = i->value;	629	new_link->value = i->value;
569		630
570	/* Try and be clever here, too. */	631	/* Try and be clever here, too. */
571	if (!key_values)	632	if (!dst->key_values)
572	{	633	{
573	key_values = new_link;	634	dst->key_values = new_link;
574	tail = new_link;	635	tail = new_link;
575	}	636	}
576	else	637	else
577	{	638	{
578	tail->next = new_link;	639	tail->next = new_link;
579	tail = new_link;	640	tail = new_link;
580	}	641	}
581	}	642	}
582	}	643	}
583	}
584
585	/*
586	* copy_to first frees everything allocated by the dst object,
587	* and then copies the contents of itself into the second
588	* object, allocating what needs to be allocated. Basically, any
589	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
590	* if the first object is freed, the pointers in the new object
591	* will point at garbage.
592	*/
593	void
594	object::copy_to (object *dst)
595	{
596	*dst = *this;
597		644
598	if (speed < 0)	645	if (speed < 0)
599	dst->speed_left -= rndm ();	646	dst->speed_left -= rndm ();
600		647
601	dst->set_speed (dst->speed);	648	dst->set_speed (dst->speed);
…		…
603		650
604	void	651	void
605	object::instantiate ()	652	object::instantiate ()
606	{	653	{
607	if (!uuid.seq) // HACK	654	if (!uuid.seq) // HACK
608	uuid = gen_uuid ();	655	uuid = UUID::gen ();
609		656
610	speed_left = -0.1f;	657	speed_left = -0.1f;
611	/* 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
612	* 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.
613	* 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
…		…
623	object *	670	object *
624	object::clone ()	671	object::clone ()
625	{	672	{
626	object *neu = create ();	673	object *neu = create ();
627	copy_to (neu);	674	copy_to (neu);
		675	neu->map = map; // not copied by copy_to
628	return neu;	676	return neu;
629	}	677	}
630		678
631	/*	679	/*
632	* 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
…		…
683	* UP_OBJ_FACE: only the objects face has changed.	731	* UP_OBJ_FACE: only the objects face has changed.
684	*/	732	*/
685	void	733	void
686	update_object (object *op, int action)	734	update_object (object *op, int action)
687	{	735	{
688	if (op == NULL)	736	if (!op)
689	{	737	{
690	/* this should never happen */	738	/* this should never happen */
691	LOG (llevDebug, "update_object() called for NULL object.\n");	739	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
692	return;	740	return;
693	}	741	}
694		742
695	if (op->env)	743	if (!op->is_on_map ())
696	{	744	{
697	/* Animation is currently handled by client, so nothing	745	/* Animation is currently handled by client, so nothing
698	* to do in this case.	746	* to do in this case.
699	*/	747	*/
700	return;	748	return;
701	}	749	}
702
703	/* If the map is saving, don't do anything as everything is
704	* going to get freed anyways.
705	*/
706	if (!op->map || op->map->in_memory == MAP_SAVING)
707	return;
708		750
709	/* make sure the object is within map boundaries */	751	/* make sure the object is within map boundaries */
710	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)
711	{	753	{
712	LOG (llevError, "update_object() called for object out of map!\n");	754	LOG (llevError, "update_object() called for object out of map!\n");
…		…
772	static int object_count;	814	static int object_count;
773		815
774	void object::link ()	816	void object::link ()
775	{	817	{
776	assert (!index);//D	818	assert (!index);//D
777	uuid = gen_uuid ();	819	uuid = UUID::gen ();
778	count = ++object_count;	820	count = ++object_count;
779		821
780	refcnt_inc ();	822	refcnt_inc ();
781	objects.insert (this);	823	objects.insert (this);
782	}	824	}
…		…
855	object::destroy_inv (bool drop_to_ground)	897	object::destroy_inv (bool drop_to_ground)
856	{	898	{
857	// need to check first, because the checks below might segfault	899	// need to check first, because the checks below might segfault
858	// as we might be on an invalid mapspace and crossfire code	900	// as we might be on an invalid mapspace and crossfire code
859	// is too buggy to ensure that the inventory is empty.	901	// is too buggy to ensure that the inventory is empty.
860	// corollary: if you create arrows etc. with stuff in tis inventory,	902	// corollary: if you create arrows etc. with stuff in its inventory,
861	// cf will crash below with off-map x and y	903	// cf will crash below with off-map x and y
862	if (!inv)	904	if (!inv)
863	return;	905	return;
864		906
865	/* Only if the space blocks everything do we not process -	907	/* Only if the space blocks everything do we not process -
866	* if some form of movement is allowed, let objects	908	* if some form of movement is allowed, let objects
867	* drop on that space.	909	* drop on that space.
868	*/	910	*/
869	if (!drop_to_ground	911	if (!drop_to_ground
870	|| !map	912	|| !map
871	|| map->in_memory != MAP_IN_MEMORY	913	|| map->in_memory != MAP_ACTIVE
872	|| map->nodrop	914	|| map->no_drop
873	|| ms ().move_block == MOVE_ALL)	915	|| ms ().move_block == MOVE_ALL)
874	{	916	{
875	while (inv)	917	while (inv)
876	{	918	{
877	inv->destroy_inv (drop_to_ground);	919	inv->destroy_inv (false);
878	inv->destroy ();	920	inv->destroy ();
879	}	921	}
880	}	922	}
881	else	923	else
882	{ /* Put objects in inventory onto this space */	924	{ /* Put objects in inventory onto this space */
…		…
888	|| op->flag [FLAG_NO_DROP]	930	|| op->flag [FLAG_NO_DROP]
889	|| op->type == RUNE	931	|| op->type == RUNE
890	|| op->type == TRAP	932	|| op->type == TRAP
891	|| op->flag [FLAG_IS_A_TEMPLATE]	933	|| op->flag [FLAG_IS_A_TEMPLATE]
892	|| op->flag [FLAG_DESTROY_ON_DEATH])	934	|| op->flag [FLAG_DESTROY_ON_DEATH])
893	op->destroy ();	935	op->destroy (true);
894	else	936	else
895	map->insert (op, x, y);	937	map->insert (op, x, y);
896	}	938	}
897	}	939	}
898	}	940	}
…		…
902	object *op = new object;	944	object *op = new object;
903	op->link ();	945	op->link ();
904	return op;	946	return op;
905	}	947	}
906		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
907	void	970	void
908	object::do_destroy ()	971	object::do_destroy ()
909	{	972	{
910	attachable::do_destroy ();
911
912	if (flag [FLAG_IS_LINKED])	973	if (flag [FLAG_IS_LINKED])
913	remove_button_link (this);	974	remove_button_link (this);
914		975
915	if (flag [FLAG_FRIENDLY])	976	if (flag [FLAG_FRIENDLY])
916	remove_friendly_object (this);	977	remove_friendly_object (this);
917		978
918	if (!flag [FLAG_REMOVED])
919	remove ();	979	remove ();
920		980
921	destroy_inv (true);	981	attachable::do_destroy ();
922		982
923	deactivate ();	983	deactivate ();
924	unlink ();	984	unlink ();
925		985
926	flag [FLAG_FREED] = 1;	986	flag [FLAG_FREED] = 1;
927		987
928	// hack to ensure that freed objects still have a valid map	988	// hack to ensure that freed objects still have a valid map
929	{
930	static maptile *freed_map; // freed objects are moved here to avoid crashes
931
932	if (!freed_map)
933	{
934	freed_map = new maptile;
935
936	freed_map->path = "<freed objects map>";
937	freed_map->name = "/internal/freed_objects_map";
938	freed_map->width = 3;
939	freed_map->height = 3;
940
941	freed_map->alloc ();
942	freed_map->in_memory = MAP_IN_MEMORY;
943	}
944
945	map = freed_map;	989	map = &freed_map;
946	x = 1;	990	x = 1;
947	y = 1;	991	y = 1;
948	}
949		992
950	if (more)	993	if (more)
951	{	994	{
952	more->destroy ();	995	more->destroy ();
953	more = 0;	996	more = 0;
…		…
966	object::destroy (bool destroy_inventory)	1009	object::destroy (bool destroy_inventory)
967	{	1010	{
968	if (destroyed ())	1011	if (destroyed ())
969	return;	1012	return;
970		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
971	if (destroy_inventory)	1021	destroy_inv (!destroy_inventory);
972	destroy_inv (false);
973		1022
974	if (is_head ())	1023	if (is_head ())
975	if (sound_destroy)	1024	if (sound_destroy)
976	play_sound (sound_destroy);	1025	play_sound (sound_destroy);
977	else if (flag [FLAG_MONSTER])	1026	else if (flag [FLAG_MONSTER])
978	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism	1027	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
979		1028
980	attachable::destroy ();	1029	attachable::destroy ();
981	}
982
983	/*
984	* sub_weight() recursively (outwards) subtracts a number from the
985	* weight of an object (and what is carried by it's environment(s)).
986	*/
987	void
988	sub_weight (object *op, signed long weight)
989	{
990	while (op != NULL)
991	{
992	if (op->type == CONTAINER)
993	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
994
995	op->carrying -= weight;
996	op = op->env;
997	}
998	}	1030	}
999		1031
1000	/* op->remove ():	1032	/* op->remove ():
1001	* 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
1002	* 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
…		…
1008	object::do_remove ()	1040	object::do_remove ()
1009	{	1041	{
1010	object *tmp, *last = 0;	1042	object *tmp, *last = 0;
1011	object *otmp;	1043	object *otmp;
1012		1044
1013	if (QUERY_FLAG (this, FLAG_REMOVED))	1045	if (flag [FLAG_REMOVED])
1014	return;	1046	return;
1015		1047
1016	SET_FLAG (this, FLAG_REMOVED);
1017	INVOKE_OBJECT (REMOVE, this);	1048	INVOKE_OBJECT (REMOVE, this);
		1049
		1050	flag [FLAG_REMOVED] = true;
1018		1051
1019	if (more)	1052	if (more)
1020	more->remove ();	1053	more->remove ();
1021		1054
1022	/*	1055	/*
1023	* In this case, the object to be removed is in someones	1056	* In this case, the object to be removed is in someones
1024	* inventory.	1057	* inventory.
1025	*/	1058	*/
1026	if (env)	1059	if (env)
1027	{	1060	{
1028	if (nrof)	1061	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1029	sub_weight (env, weight * nrof);	1062	if (object *pl = visible_to ())
1030	else	1063	esrv_del_item (pl->contr, count);
1031	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;
1032		1083
1033	/* 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
1034	* made to players inventory. If set, avoiding the call	1085	* made to players inventory. If set, avoiding the call
1035	* to save cpu time.	1086	* to save cpu time.
1036	*/	1087	*/
1037	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))
1038	otmp->update_stats ();	1089	otmp->update_stats ();
1039
1040	if (above)
1041	above->below = below;
1042	else
1043	env->inv = below;
1044
1045	if (below)
1046	below->above = above;
1047
1048	/* we set up values so that it could be inserted into
1049	* the map, but we don't actually do that - it is up
1050	* to the caller to decide what we want to do.
1051	*/
1052	x = env->x, y = env->y;
1053	map = env->map;
1054	above = 0, below = 0;
1055	env = 0;
1056	}	1090	}
1057	else if (map)	1091	else if (map)
1058	{	1092	{
1059	if (type == PLAYER)
1060	{
1061	// leaving a spot always closes any open container on the ground
1062	if (container && !container->env)
1063	// this causes spurious floorbox updates, but it ensures
1064	// that the CLOSE event is being sent.
1065	close_container ();
1066
1067	--map->players;
1068	map->touch ();
1069	}
1070
1071	map->dirty = true;	1093	map->dirty = true;
1072	mapspace &ms = this->ms ();	1094	mapspace &ms = this->ms ();
1073		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
1074	/* link the object above us */	1118	/* link the object above us */
1075	if (above)	1119	// re-link, make sure compiler can easily use cmove
1076	above->below = below;	1120	*(above ? &above->below : &ms.top) = below;
1077	else	1121	*(below ? &below->above : &ms.bot) = above;
1078	ms.top = below; /* we were top, set new top */
1079
1080	/* Relink the object below us, if there is one */
1081	if (below)
1082	below->above = above;
1083	else
1084	{
1085	/* Nothing below, which means we need to relink map object for this space
1086	* use translated coordinates in case some oddness with map tiling is
1087	* evident
1088	*/
1089	if (GET_MAP_OB (map, x, y) != this)
1090	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 ());
1091
1092	ms.bot = above; /* goes on above it. */
1093	}
1094		1122
1095	above = 0;	1123	above = 0;
1096	below = 0;	1124	below = 0;
1097		1125
1098	if (map->in_memory == MAP_SAVING)	1126	if (map->in_memory == MAP_SAVING)
…		…
1107	* removed (most likely destroyed), update the player view	1135	* removed (most likely destroyed), update the player view
1108	* appropriately.	1136	* appropriately.
1109	*/	1137	*/
1110	pl->close_container ();	1138	pl->close_container ();
1111		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)
1112	pl->contr->ns->floorbox_update ();	1144	pl->contr->ns->floorbox_update ();
1113	}	1145	}
1114		1146
1115	for (tmp = ms.bot; tmp; tmp = tmp->above)	1147	for (tmp = ms.bot; tmp; tmp = tmp->above)
1116	{	1148	{
1117	/* 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
…		…
1161	if (!top)	1193	if (!top)
1162	for (top = op; top && top->above; top = top->above)	1194	for (top = op; top && top->above; top = top->above)
1163	;	1195	;
1164		1196
1165	for (; top; top = top->below)	1197	for (; top; top = top->below)
1166	{
1167	if (top == op)
1168	continue;
1169
1170	if (object::can_merge (op, top))	1198	if (object::can_merge (op, top))
1171	{	1199	{
1172	top->nrof += op->nrof;	1200	top->nrof += op->nrof;
1173		1201
1174	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1202	if (object *pl = top->visible_to ())
1175	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
1176	op->destroy ();	1208	op->destroy (1);
		1209
1177	return top;	1210	return top;
1178	}	1211	}
1179	}
1180		1212
1181	return 0;	1213	return 0;
1182	}	1214	}
1183		1215
1184	void	1216	void
…		…
1209	* job preparing multi-part monsters.	1241	* job preparing multi-part monsters.
1210	*/	1242	*/
1211	object *	1243	object *
1212	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)
1213	{	1245	{
		1246	op->remove ();
		1247
1214	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1248	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1215	{	1249	{
1216	tmp->x = x + tmp->arch->x;	1250	tmp->x = x + tmp->arch->x;
1217	tmp->y = y + tmp->arch->y;	1251	tmp->y = y + tmp->arch->y;
1218	}	1252	}
…		…
1241	* just 'op' otherwise	1275	* just 'op' otherwise
1242	*/	1276	*/
1243	object *	1277	object *
1244	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)
1245	{	1279	{
1246	assert (!op->flag [FLAG_FREED]);	1280	if (op->is_on_map ())
		1281	{
		1282	LOG (llevError, "insert_ob_in_map called for object already on map");
		1283	abort ();
		1284	}
1247		1285
1248	object *top, *floor = NULL;	1286	if (op->env)
1249		1287	{
		1288	LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)");
1250	op->remove ();	1289	op->remove ();
		1290	}
		1291
		1292	if (op->face && !face_info (op->face))//D TODO: remove soon
		1293	{//D
		1294	LOG (llevError | logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D
		1295	op->face = 1;//D
		1296	}//D
1251		1297
1252	/* Ideally, the caller figures this out. However, it complicates a lot	1298	/* Ideally, the caller figures this out. However, it complicates a lot
1253	* of areas of callers (eg, anything that uses find_free_spot would now	1299	* of areas of callers (eg, anything that uses find_free_spot would now
1254	* need extra work	1300	* need extra work
1255	*/	1301	*/
1256	if (!xy_normalise (m, op->x, op->y))	1302	if (!xy_normalise (m, op->x, op->y))
1257	{	1303	{
1258	op->destroy ();	1304	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1259	return 0;	1305	return 0;
1260	}	1306	}
1261		1307
1262	if (object *more = op->more)	1308	if (object *more = op->more)
1263	if (!insert_ob_in_map (more, m, originator, flag))	1309	if (!insert_ob_in_map (more, m, originator, flag))
…		…
1272	*/	1318	*/
1273	if (op->nrof && !(flag & INS_NO_MERGE))	1319	if (op->nrof && !(flag & INS_NO_MERGE))
1274	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1320	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1275	if (object::can_merge (op, tmp))	1321	if (object::can_merge (op, tmp))
1276	{	1322	{
		1323	// TODO: we actually want to update tmp, not op,
		1324	// but some caller surely breaks when we return tmp
		1325	// from here :/
1277	op->nrof += tmp->nrof;	1326	op->nrof += tmp->nrof;
1278	tmp->destroy ();	1327	tmp->destroy (1);
1279	}	1328	}
1280		1329
1281	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1330	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1282	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1331	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1283		1332
…		…
1290	{	1339	{
1291	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1340	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1292	abort ();	1341	abort ();
1293	}	1342	}
1294		1343
		1344	if (!originator->is_on_map ())
		1345	LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1346	op->debug_desc (), originator->debug_desc ());
		1347
1295	op->above = originator;	1348	op->above = originator;
1296	op->below = originator->below;	1349	op->below = originator->below;
1297
1298	if (op->below)
1299	op->below->above = op;
1300	else
1301	ms.bot = op;
1302
1303	/* since *below* originator, no need to update top */
1304	originator->below = op;	1350	originator->below = op;
		1351
		1352	*(op->below ? &op->below->above : &ms.bot) = op;
1305	}	1353	}
1306	else	1354	else
1307	{	1355	{
1308	top = ms.bot;	1356	object *floor = 0;
		1357	object *top = ms.top;
1309		1358
1310	/* If there are other objects, then */	1359	/* If there are other objects, then */
1311	if (top)	1360	if (top)
1312	{	1361	{
1313	object *last = 0;
1314
1315	/*	1362	/*
1316	* If there are multiple objects on this space, we do some trickier handling.	1363	* If there are multiple objects on this space, we do some trickier handling.
1317	* We've already dealt with merging if appropriate.	1364	* We've already dealt with merging if appropriate.
1318	* Generally, we want to put the new object on top. But if	1365	* Generally, we want to put the new object on top. But if
1319	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1366	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1322	* once we get to them. This reduces the need to traverse over all of	1369	* once we get to them. This reduces the need to traverse over all of
1323	* them when adding another one - this saves quite a bit of cpu time	1370	* them when adding another one - this saves quite a bit of cpu time
1324	* when lots of spells are cast in one area. Currently, it is presumed	1371	* when lots of spells are cast in one area. Currently, it is presumed
1325	* that flying non pickable objects are spell objects.	1372	* that flying non pickable objects are spell objects.
1326	*/	1373	*/
1327	for (top = ms.bot; top; top = top->above)	1374	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1328	{	1375	{
1329	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1376	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1330	floor = top;	1377	floor = tmp;
1331		1378
1332	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1379	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1333	{	1380	{
1334	/* We insert above top, so we want this object below this */	1381	/* We insert above top, so we want this object below this */
1335	top = top->below;	1382	top = tmp->below;
1336	break;	1383	break;
1337	}	1384	}
1338		1385
1339	last = top;	1386	top = tmp;
1340	}	1387	}
1341
1342	/* Don't want top to be NULL, so set it to the last valid object */
1343	top = last;
1344		1388
1345	/* We let update_position deal with figuring out what the space	1389	/* We let update_position deal with figuring out what the space
1346	* looks like instead of lots of conditions here.	1390	* looks like instead of lots of conditions here.
1347	* makes things faster, and effectively the same result.	1391	* makes things faster, and effectively the same result.
1348	*/	1392	*/
…		…
1355	*/	1399	*/
1356	if (!(flag & INS_ON_TOP)	1400	if (!(flag & INS_ON_TOP)
1357	&& ms.flags () & P_BLOCKSVIEW	1401	&& ms.flags () & P_BLOCKSVIEW
1358	&& (op->face && !faces [op->face].visibility))	1402	&& (op->face && !faces [op->face].visibility))
1359	{	1403	{
		1404	object *last;
		1405
1360	for (last = top; last != floor; last = last->below)	1406	for (last = top; last != floor; last = last->below)
1361	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1407	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1362	break;	1408	break;
1363		1409
1364	/* Check to see if we found the object that blocks view,	1410	/* Check to see if we found the object that blocks view,
…		…
1372	} /* If objects on this space */	1418	} /* If objects on this space */
1373		1419
1374	if (flag & INS_ABOVE_FLOOR_ONLY)	1420	if (flag & INS_ABOVE_FLOOR_ONLY)
1375	top = floor;	1421	top = floor;
1376		1422
1377	/* Top is the object that our object (op) is going to get inserted above.	1423	// insert object above top, or bottom-most if top = 0
1378	*/
1379
1380	/* First object on this space */
1381	if (!top)	1424	if (!top)
1382	{	1425	{
		1426	op->below = 0;
1383	op->above = ms.bot;	1427	op->above = ms.bot;
1384
1385	if (op->above)
1386	op->above->below = op;
1387
1388	op->below = 0;
1389	ms.bot = op;	1428	ms.bot = op;
		1429
		1430	*(op->above ? &op->above->below : &ms.top) = op;
1390	}	1431	}
1391	else	1432	else
1392	{ /* get inserted into the stack above top */	1433	{
1393	op->above = top->above;	1434	op->above = top->above;
1394
1395	if (op->above)
1396	op->above->below = op;	1435	top->above = op;
1397		1436
1398	op->below = top;	1437	op->below = top;
1399	top->above = op;	1438	*(op->above ? &op->above->below : &ms.top) = op;
1400	}	1439	}
1401		1440	}
1402	if (!op->above)
1403	ms.top = op;
1404	} /* else not INS_BELOW_ORIGINATOR */
1405		1441
1406	if (op->type == PLAYER)	1442	if (op->type == PLAYER)
1407	{	1443	{
1408	op->contr->do_los = 1;	1444	op->contr->do_los = 1;
1409	++op->map->players;	1445	++op->map->players;
…		…
1411	}	1447	}
1412		1448
1413	op->map->dirty = true;	1449	op->map->dirty = true;
1414		1450
1415	if (object *pl = ms.player ())	1451	if (object *pl = ms.player ())
		1452	//TODO: the floorbox prev/next might need updating
		1453	//esrv_send_item (pl, op);
		1454	//TODO: update floorbox to preserve ordering
		1455	if (pl->contr->ns)
1416	pl->contr->ns->floorbox_update ();	1456	pl->contr->ns->floorbox_update ();
1417		1457
1418	/* If this object glows, it may affect lighting conditions that are	1458	/* If this object glows, it may affect lighting conditions that are
1419	* visible to others on this map. But update_all_los is really	1459	* visible to others on this map. But update_all_los is really
1420	* an inefficient way to do this, as it means los for all players	1460	* an inefficient way to do this, as it means los for all players
1421	* on the map will get recalculated. The players could very well	1461	* on the map will get recalculated. The players could very well
…		…
1463	* op is the object to insert it under: supplies x and the map.	1503	* op is the object to insert it under: supplies x and the map.
1464	*/	1504	*/
1465	void	1505	void
1466	replace_insert_ob_in_map (const char *arch_string, object *op)	1506	replace_insert_ob_in_map (const char *arch_string, object *op)
1467	{	1507	{
1468	object *tmp, *tmp1;
1469
1470	/* first search for itself and remove any old instances */	1508	/* first search for itself and remove any old instances */
1471		1509
1472	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1510	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1473	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1511	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1474	tmp->destroy ();	1512	tmp->destroy (1);
1475		1513
1476	tmp1 = arch_to_object (archetype::find (arch_string));	1514	object *tmp = arch_to_object (archetype::find (arch_string));
1477		1515
1478	tmp1->x = op->x;	1516	tmp->x = op->x;
1479	tmp1->y = op->y;	1517	tmp->y = op->y;
		1518
1480	insert_ob_in_map (tmp1, op->map, op, 0);	1519	insert_ob_in_map (tmp, op->map, op, 0);
1481	}	1520	}
1482		1521
1483	object *	1522	object *
1484	object::insert_at (object *where, object *originator, int flags)	1523	object::insert_at (object *where, object *originator, int flags)
1485	{	1524	{
		1525	if (where->env)
		1526	return where->env->insert (this);
		1527	else
1486	return where->map->insert (this, where->x, where->y, originator, flags);	1528	return where->map->insert (this, where->x, where->y, originator, flags);
1487	}	1529	}
1488		1530
1489	/*	1531	/*
1490	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1491	* is returned contains nr objects, and the remaining parts contains
1492	* the rest (or is removed and freed if that number is 0).
1493	* On failure, NULL is returned, and the reason put into the
1494	* global static errmsg array.
1495	*/
1496	object *
1497	get_split_ob (object *orig_ob, uint32 nr)
1498	{
1499	object *newob;
1500	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1501
1502	if (orig_ob->nrof < nr)
1503	{
1504	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1505	return NULL;
1506	}
1507
1508	newob = object_create_clone (orig_ob);
1509
1510	if ((orig_ob->nrof -= nr) < 1)
1511	orig_ob->destroy (1);
1512	else if (!is_removed)
1513	{
1514	if (orig_ob->env != NULL)
1515	sub_weight (orig_ob->env, orig_ob->weight * nr);
1516	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1517	{
1518	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1519	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1520	return NULL;
1521	}
1522	}
1523
1524	newob->nrof = nr;
1525
1526	return newob;
1527	}
1528
1529	/*
1530	* decrease_ob_nr(object, number) decreases a specified number from	1532	* decrease(object, number) decreases a specified number from
1531	* the amount of an object. If the amount reaches 0, the object	1533	* the amount of an object. If the amount reaches 0, the object
1532	* is subsequently removed and freed.	1534	* is subsequently removed and freed.
1533	*	1535	*
1534	* Return value: 'op' if something is left, NULL if the amount reached 0	1536	* Return value: 'op' if something is left, NULL if the amount reached 0
1535	*/	1537	*/
		1538	bool
		1539	object::decrease (sint32 nr)
		1540	{
		1541	if (!nr)
		1542	return true;
		1543
		1544	nr = min (nr, nrof);
		1545
		1546	nrof -= nr;
		1547
		1548	if (nrof)
		1549	{
		1550	adjust_weight (env, -weight * nr); // carrying == 0
		1551
		1552	if (object *pl = visible_to ())
		1553	esrv_update_item (UPD_NROF, pl, this);
		1554
		1555	return true;
		1556	}
		1557	else
		1558	{
		1559	destroy (1);
		1560	return false;
		1561	}
		1562	}
		1563
		1564	/*
		1565	* split(ob,nr) splits up ob into two parts. The part which
		1566	* is returned contains nr objects, and the remaining parts contains
		1567	* the rest (or is removed and returned if that number is 0).
		1568	* On failure, NULL is returned.
		1569	*/
1536	object *	1570	object *
1537	decrease_ob_nr (object *op, uint32 i)	1571	object::split (sint32 nr)
1538	{	1572	{
1539	object *tmp;	1573	int have = number_of ();
1540		1574
1541	if (i == 0) /* objects with op->nrof require this check */	1575	if (have < nr)
1542	return op;	1576	return 0;
1543		1577	else if (have == nr)
1544	if (i > op->nrof)
1545	i = op->nrof;
1546
1547	if (QUERY_FLAG (op, FLAG_REMOVED))
1548	op->nrof -= i;
1549	else if (op->env)
1550	{	1578	{
1551	/* is this object in the players inventory, or sub container
1552	* therein?
1553	*/
1554	tmp = op->in_player ();
1555	/* nope. Is this a container the player has opened?
1556	* If so, set tmp to that player.
1557	* IMO, searching through all the players will mostly
1558	* likely be quicker than following op->env to the map,
1559	* and then searching the map for a player.
1560	*/
1561	if (!tmp)
1562	for_all_players (pl)
1563	if (pl->ob->container == op->env)
1564	{
1565	tmp = pl->ob;
1566	break;
1567	}
1568
1569	if (i < op->nrof)
1570	{
1571	sub_weight (op->env, op->weight * i);
1572	op->nrof -= i;
1573	if (tmp)
1574	esrv_send_item (tmp, op);
1575	}
1576	else
1577	{
1578	op->remove ();	1579	remove ();
1579	op->nrof = 0;	1580	return this;
1580	if (tmp)
1581	esrv_del_item (tmp->contr, op->count);
1582	}
1583	}	1581	}
1584	else	1582	else
1585	{	1583	{
1586	object *above = op->above;	1584	decrease (nr);
1587		1585
1588	if (i < op->nrof)	1586	object *op = deep_clone ();
1589	op->nrof -= i;	1587	op->nrof = nr;
1590	else
1591	{
1592	op->remove ();
1593	op->nrof = 0;
1594	}
1595
1596	/* Since we just removed op, op->above is null */
1597	for (tmp = above; tmp; tmp = tmp->above)
1598	if (tmp->type == PLAYER)
1599	{
1600	if (op->nrof)
1601	esrv_send_item (tmp, op);
1602	else
1603	esrv_del_item (tmp->contr, op->count);
1604	}
1605	}
1606
1607	if (op->nrof)
1608	return op;	1588	return op;
1609	else
1610	{
1611	op->destroy ();
1612	return 0;
1613	}
1614	}
1615
1616	/*
1617	* add_weight(object, weight) adds the specified weight to an object,
1618	* and also updates how much the environment(s) is/are carrying.
1619	*/
1620	void
1621	add_weight (object *op, signed long weight)
1622	{
1623	while (op != NULL)
1624	{
1625	if (op->type == CONTAINER)
1626	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1627
1628	op->carrying += weight;
1629	op = op->env;
1630	}	1589	}
1631	}	1590	}
1632		1591
1633	object *	1592	object *
1634	insert_ob_in_ob (object *op, object *where)	1593	insert_ob_in_ob (object *op, object *where)
…		…
1659	* be != op, if items are merged. -Tero	1618	* be != op, if items are merged. -Tero
1660	*/	1619	*/
1661	object *	1620	object *
1662	object::insert (object *op)	1621	object::insert (object *op)
1663	{	1622	{
1664	if (!QUERY_FLAG (op, FLAG_REMOVED))
1665	op->remove ();
1666
1667	if (op->more)	1623	if (op->more)
1668	{	1624	{
1669	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1625	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1670	return op;	1626	return op;
1671	}	1627	}
1672		1628
1673	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1629	op->remove ();
1674	CLEAR_FLAG (op, FLAG_REMOVED);	1630
		1631	op->flag [FLAG_OBJ_ORIGINAL] = 0;
1675		1632
1676	if (op->nrof)	1633	if (op->nrof)
1677	{
1678	for (object *tmp = inv; tmp; tmp = tmp->below)	1634	for (object *tmp = inv; tmp; tmp = tmp->below)
1679	if (object::can_merge (tmp, op))	1635	if (object::can_merge (tmp, op))
1680	{	1636	{
1681	/* return the original object and remove inserted object	1637	/* return the original object and remove inserted object
1682	(client needs the original object) */	1638	(client needs the original object) */
1683	tmp->nrof += op->nrof;	1639	tmp->nrof += op->nrof;
1684	/* Weight handling gets pretty funky. Since we are adding to	1640
1685	* tmp->nrof, we need to increase the weight.	1641	if (object *pl = tmp->visible_to ())
1686	*/	1642	esrv_update_item (UPD_NROF, pl, tmp);
		1643
1687	add_weight (this, op->weight * op->nrof);	1644	adjust_weight (this, op->total_weight ());
1688	SET_FLAG (op, FLAG_REMOVED);	1645
1689	op->destroy (); /* free the inserted object */	1646	op->destroy (1);
1690	op = tmp;	1647	op = tmp;
1691	op->remove (); /* and fix old object's links */	1648	goto inserted;
1692	CLEAR_FLAG (op, FLAG_REMOVED);
1693	break;
1694	}	1649	}
1695		1650
1696	/* I assume combined objects have no inventory
1697	* We add the weight - this object could have just been removed
1698	* (if it was possible to merge). calling remove_ob will subtract
1699	* the weight, so we need to add it in again, since we actually do
1700	* the linking below
1701	*/
1702	add_weight (this, op->weight * op->nrof);
1703	}
1704	else
1705	add_weight (this, (op->weight + op->carrying));
1706
1707	if (object *otmp = this->in_player ())
1708	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1709	otmp->update_stats ();
1710
1711	op->owner = 0; // its his/hers now. period.	1651	op->owner = 0; // it's his/hers now. period.
1712	op->map = 0;	1652	op->map = 0;
		1653	op->x = 0;
		1654	op->y = 0;
		1655
		1656	op->above = 0;
		1657	op->below = inv;
1713	op->env = this;	1658	op->env = this;
1714	op->above = 0;
1715	op->below = 0;
1716	op->x = op->y = 0;
1717		1659
		1660	if (inv)
		1661	inv->above = op;
		1662
		1663	inv = op;
		1664
		1665	op->flag [FLAG_REMOVED] = 0;
		1666
		1667	if (object *pl = op->visible_to ())
		1668	esrv_send_item (pl, op);
		1669
		1670	adjust_weight (this, op->total_weight ());
		1671
		1672	inserted:
1718	/* reset the light list and los of the players on the map */	1673	/* reset the light list and los of the players on the map */
1719	if (op->glow_radius && map)	1674	if (op->glow_radius && map && map->darkness)
1720	{
1721	#ifdef DEBUG_LIGHTS
1722	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1723	#endif /* DEBUG_LIGHTS */
1724	if (map->darkness)
1725	update_all_los (map, x, y);	1675	update_all_los (map, x, y);
1726	}
1727		1676
1728	/* Client has no idea of ordering so lets not bother ordering it here.	1677	// if this is a player's inventory, update stats
1729	* It sure simplifies this function...	1678	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1730	*/	1679	update_stats ();
1731	if (!inv)
1732	inv = op;
1733	else
1734	{
1735	op->below = inv;
1736	op->below->above = op;
1737	inv = op;
1738	}
1739		1680
1740	INVOKE_OBJECT (INSERT, this);	1681	INVOKE_OBJECT (INSERT, this);
1741		1682
1742	return op;	1683	return op;
1743	}	1684	}
…		…
1871	LOG (llevError, "Present_arch called outside map.\n");	1812	LOG (llevError, "Present_arch called outside map.\n");
1872	return NULL;	1813	return NULL;
1873	}	1814	}
1874		1815
1875	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1816	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1876	if (tmp->arch == at)	1817	if (tmp->arch->archname == at->archname)
1877	return tmp;	1818	return tmp;
1878		1819
1879	return NULL;	1820	return NULL;
1880	}	1821	}
1881		1822
…		…
1945	* The first matching object is returned, or NULL if none.	1886	* The first matching object is returned, or NULL if none.
1946	*/	1887	*/
1947	object *	1888	object *
1948	present_arch_in_ob (const archetype *at, const object *op)	1889	present_arch_in_ob (const archetype *at, const object *op)
1949	{	1890	{
1950	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1891	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1951	if (tmp->arch == at)	1892	if (tmp->arch->archname == at->archname)
1952	return tmp;	1893	return tmp;
1953		1894
1954	return NULL;	1895	return NULL;
1955	}	1896	}
1956		1897
…		…
2365		2306
2366	/*	2307	/*
2367	* create clone from object to another	2308	* create clone from object to another
2368	*/	2309	*/
2369	object *	2310	object *
2370	object_create_clone (object *asrc)	2311	object::deep_clone ()
2371	{	2312	{
2372	object *dst = 0, *tmp, *src, *prev, *item;	2313	assert (("deep_clone called on non-head object", is_head ()));
2373		2314
2374	if (!asrc)	2315	object *dst = clone ();
2375	return 0;
2376		2316
2377	src = asrc->head_ ();	2317	object *prev = dst;
2378
2379	prev = 0;
2380	for (object *part = src; part; part = part->more)	2318	for (object *part = this->more; part; part = part->more)
2381	{	2319	{
2382	tmp = part->clone ();	2320	object *tmp = part->clone ();
2383	tmp->x -= src->x;
2384	tmp->y -= src->y;
2385
2386	if (!part->head)
2387	{
2388	dst = tmp;
2389	tmp->head = 0;
2390	}
2391	else
2392	tmp->head = dst;	2321	tmp->head = dst;
2393
2394	tmp->more = 0;
2395
2396	if (prev)
2397	prev->more = tmp;	2322	prev->more = tmp;
2398
2399	prev = tmp;	2323	prev = tmp;
2400	}	2324	}
2401		2325
2402	for (item = src->inv; item; item = item->below)	2326	for (object *item = inv; item; item = item->below)
2403	insert_ob_in_ob (object_create_clone (item), dst);	2327	insert_ob_in_ob (item->deep_clone (), dst);
2404		2328
2405	return dst;	2329	return dst;
2406	}	2330	}
2407		2331
2408	/* This returns the first object in who's inventory that	2332	/* This returns the first object in who's inventory that
…		…
2417	return tmp;	2341	return tmp;
2418		2342
2419	return 0;	2343	return 0;
2420	}	2344	}
2421		2345
2422	/* If ob has a field named key, return the link from the list,	2346	const shstr &
2423	* otherwise return NULL.	2347	object::kv_get (const shstr &key) const
2424	*
2425	* key must be a passed in shared string - otherwise, this won't
2426	* do the desired thing.
2427	*/
2428	key_value *
2429	get_ob_key_link (const object *ob, const char *key)
2430	{	2348	{
2431	for (key_value *link = ob->key_values; link; link = link->next)	2349	for (key_value *kv = key_values; kv; kv = kv->next)
2432	if (link->key == key)	2350	if (kv->key == key)
2433	return link;
2434
2435	return 0;
2436	}
2437
2438	/*
2439	* Returns the value of op has an extra_field for key, or NULL.
2440	*
2441	* The argument doesn't need to be a shared string.
2442	*
2443	* The returned string is shared.
2444	*/
2445	const char *
2446	get_ob_key_value (const object *op, const char *const key)
2447	{
2448	key_value *link;
2449	shstr_cmp canonical_key (key);
2450
2451	if (!canonical_key)
2452	{
2453	/* 1. There being a field named key on any object
2454	* implies there'd be a shared string to find.
2455	* 2. Since there isn't, no object has this field.
2456	* 3. Therefore, *this* object doesn't have this field.
2457	*/
2458	return 0;
2459	}
2460
2461	/* This is copied from get_ob_key_link() above -
2462	* only 4 lines, and saves the function call overhead.
2463	*/
2464	for (link = op->key_values; link; link = link->next)
2465	if (link->key == canonical_key)
2466	return link->value;	2351	return kv->value;
2467		2352
2468	return 0;	2353	return shstr_null;
2469	}	2354	}
2470		2355
2471	/*	2356	void
2472	* Updates the canonical_key in op to value.	2357	object::kv_set (const shstr &key, const shstr &value)
2473	*
2474	* canonical_key is a shared string (value doesn't have to be).
2475	*
2476	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2477	* keys.
2478	*
2479	* Returns TRUE on success.
2480	*/
2481	int
2482	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2483	{	2358	{
2484	key_value *field = NULL, *last = NULL;	2359	for (key_value *kv = key_values; kv; kv = kv->next)
2485		2360	if (kv->key == key)
2486	for (field = op->key_values; field != NULL; field = field->next)
2487	{
2488	if (field->key != canonical_key)
2489	{	2361	{
2490	last = field;	2362	kv->value = value;
2491	continue;	2363	return;
2492	}	2364	}
2493		2365
2494	if (value)	2366	key_value *kv = new key_value;
2495	field->value = value;	2367
2496	else	2368	kv->next = key_values;
		2369	kv->key = key;
		2370	kv->value = value;
		2371
		2372	key_values = kv;
		2373	}
		2374
		2375	void
		2376	object::kv_del (const shstr &key)
		2377	{
		2378	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2379	if ((*kvp)->key == key)
2497	{	2380	{
2498	/* Basically, if the archetype has this key set,	2381	key_value *kv = *kvp;
2499	* we need to store the null value so when we save	2382	*kvp = (*kvp)->next;
2500	* it, we save the empty value so that when we load,	2383	delete kv;
2501	* we get this value back again.	2384	return;
2502	*/
2503	if (get_ob_key_link (op->arch, canonical_key))
2504	field->value = 0;
2505	else
2506	{
2507	if (last)
2508	last->next = field->next;
2509	else
2510	op->key_values = field->next;
2511
2512	delete field;
2513	}
2514	}	2385	}
2515	return TRUE;
2516	}
2517	/* IF we get here, key doesn't exist */
2518
2519	/* No field, we'll have to add it. */
2520
2521	if (!add_key)
2522	return FALSE;
2523
2524	/* There isn't any good reason to store a null
2525	* value in the key/value list. If the archetype has
2526	* this key, then we should also have it, so shouldn't
2527	* be here. If user wants to store empty strings,
2528	* should pass in ""
2529	*/
2530	if (value == NULL)
2531	return TRUE;
2532
2533	field = new key_value;
2534
2535	field->key = canonical_key;
2536	field->value = value;
2537	/* Usual prepend-addition. */
2538	field->next = op->key_values;
2539	op->key_values = field;
2540
2541	return TRUE;
2542	}
2543
2544	/*
2545	* Updates the key in op to value.
2546	*
2547	* If add_key is FALSE, this will only update existing keys,
2548	* and not add new ones.
2549	* In general, should be little reason FALSE is ever passed in for add_key
2550	*
2551	* Returns TRUE on success.
2552	*/
2553	int
2554	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2555	{
2556	shstr key_ (key);
2557
2558	return set_ob_key_value_s (op, key_, value, add_key);
2559	}	2386	}
2560		2387
2561	object::depth_iterator::depth_iterator (object *container)	2388	object::depth_iterator::depth_iterator (object *container)
2562	: iterator_base (container)	2389	: iterator_base (container)
2563	{	2390	{
…		…
2613	{	2440	{
2614	char flagdesc[512];	2441	char flagdesc[512];
2615	char info2[256 * 4];	2442	char info2[256 * 4];
2616	char *p = info;	2443	char *p = info;
2617		2444
2618	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2445	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2619	count, uuid.seq,	2446	count,
		2447	uuid.c_str (),
2620	&name,	2448	&name,
2621	title ? "\",title:\"" : "",	2449	title ? ",title:\"" : "",
2622	title ? (const char *)title : "",	2450	title ? (const char *)title : "",
		2451	title ? "\"" : "",
2623	flag_desc (flagdesc, 512), type);	2452	flag_desc (flagdesc, 512), type);
2624		2453
2625	if (!this->flag[FLAG_REMOVED] && env)	2454	if (!flag[FLAG_REMOVED] && env)
2626	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2455	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2627		2456
2628	if (map)	2457	if (map)
2629	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2458	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2630		2459
…		…
2660	object::open_container (object *new_container)	2489	object::open_container (object *new_container)
2661	{	2490	{
2662	if (container == new_container)	2491	if (container == new_container)
2663	return;	2492	return;
2664		2493
2665	if (object *old_container = container)	2494	object *old_container = container;
		2495
		2496	if (old_container)
2666	{	2497	{
2667	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2498	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2668	return;	2499	return;
2669		2500
2670	#if 0	2501	#if 0
…		…
2672	if (object *closer = old_container->inv)	2503	if (object *closer = old_container->inv)
2673	if (closer->type == CLOSE_CON)	2504	if (closer->type == CLOSE_CON)
2674	closer->destroy ();	2505	closer->destroy ();
2675	#endif	2506	#endif
2676		2507
		2508	// make sure the container is available
		2509	esrv_send_item (this, old_container);
		2510
2677	old_container->flag [FLAG_APPLIED] = 0;	2511	old_container->flag [FLAG_APPLIED] = false;
2678	container = 0;	2512	container = 0;
2679		2513
		2514	// client needs item update to make it work, client bug requires this to be separate
2680	esrv_update_item (UPD_FLAGS, this, old_container);	2515	esrv_update_item (UPD_FLAGS, this, old_container);
		2516
2681	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2517	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2682	play_sound (sound_find ("chest_close"));	2518	play_sound (sound_find ("chest_close"));
2683	}	2519	}
2684		2520
2685	if (new_container)	2521	if (new_container)
…		…
2698	}	2534	}
2699	#endif	2535	#endif
2700		2536
2701	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2537	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2702		2538
		2539	// make sure the container is available, client bug requires this to be separate
		2540	esrv_send_item (this, new_container);
		2541
2703	new_container->flag [FLAG_APPLIED] = 1;	2542	new_container->flag [FLAG_APPLIED] = true;
2704	container = new_container;	2543	container = new_container;
2705		2544
		2545	// client needs flag change
2706	esrv_update_item (UPD_FLAGS, this, new_container);	2546	esrv_update_item (UPD_FLAGS, this, new_container);
2707	esrv_send_inventory (this, new_container);	2547	esrv_send_inventory (this, new_container);
2708	play_sound (sound_find ("chest_open"));	2548	play_sound (sound_find ("chest_open"));
2709	}	2549	}
		2550	// else if (!old_container->env && contr && contr->ns)
		2551	// contr->ns->floorbox_reset ();
2710	}	2552	}
2711		2553
2712	object *	2554	object *
2713	object::force_find (const shstr name)	2555	object::force_find (const shstr name)
2714	{	2556	{
…		…
2740		2582
2741	insert (force);	2583	insert (force);
2742	}	2584	}
2743		2585
2744	void	2586	void
2745	object::play_sound (faceidx sound) const	2587	object::play_sound (faceidx sound)
2746	{	2588	{
2747	if (!sound)	2589	if (!sound)
2748	return;	2590	return;
2749		2591
2750	if (flag [FLAG_REMOVED])	2592	if (flag [FLAG_REMOVED])

Diff Legend

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