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.194 by root, Tue Oct 16 00:30:24 2007 UTC vs.
Revision 1.259 by root, Mon Sep 29 10:32:50 2008 UTC

1	/*	1	/*
2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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	* Crossfire TRT 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 3 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,
…		…
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, 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 <crossfire@schmorp.de>	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
208	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	191	/* Do not merge objects if nrof would overflow, assume nrof
209	* value could not be stored in a sint32 (which unfortunately sometimes is	192	* is always 0 .. 2**31-1 */
210	* used to store nrof).	193	if (ob1->nrof > 0x7fffffff - ob2->nrof)
211	*/
212	if (ob1->nrof + ob2->nrof >= 1UL << 31)
213	return 0;	194	return 0;
214		195
215	/* If the objects have been identified, set the BEEN_APPLIED flag.	196	/* 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	197	* 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	198	* 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	199	* are not equal - just if it has been identified, the been_applied
219	* flags lose any meaning.	200	* flags lose any meaning.
220	*/	201	*/
221	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	202	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
222	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	203	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
223		204
224	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	205	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
225	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	206	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
226		207
227	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	208	if (ob1->arch->archname != ob2->arch->archname
228	|| ob1->arch != ob2->arch
229	|| ob1->name != ob2->name	209	|| ob1->name != ob2->name
230	|| ob1->title != ob2->title	210	|| ob1->title != ob2->title
231	|| ob1->msg != ob2->msg	211	|| ob1->msg != ob2->msg
232	|| ob1->weight != ob2->weight	212	|| 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	213	|| ob1->attacktype != ob2->attacktype
236	|| ob1->magic != ob2->magic	214	|| ob1->magic != ob2->magic
237	|| ob1->slaying != ob2->slaying	215	|| ob1->slaying != ob2->slaying
238	|| ob1->skill != ob2->skill	216	|| ob1->skill != ob2->skill
239	|| ob1->value != ob2->value	217	|| ob1->value != ob2->value
240	|| ob1->animation_id != ob2->animation_id	218	|| ob1->animation_id != ob2->animation_id
		219	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
241	|| ob1->client_type != ob2->client_type	220	|| ob1->client_type != ob2->client_type
242	|| ob1->materialname != ob2->materialname	221	|| ob1->materialname != ob2->materialname
243	|| ob1->lore != ob2->lore	222	|| ob1->lore != ob2->lore
244	|| ob1->subtype != ob2->subtype	223	|| ob1->subtype != ob2->subtype
245	|| ob1->move_type != ob2->move_type	224	|| ob1->move_type != ob2->move_type
246	|| ob1->move_block != ob2->move_block	225	|| ob1->move_block != ob2->move_block
247	|| ob1->move_allow != ob2->move_allow	226	|| ob1->move_allow != ob2->move_allow
248	|| ob1->move_on != ob2->move_on	227	|| ob1->move_on != ob2->move_on
249	|| ob1->move_off != ob2->move_off	228	|| ob1->move_off != ob2->move_off
250	|| ob1->move_slow != ob2->move_slow	229	|| ob1->move_slow != ob2->move_slow
251	|| ob1->move_slow_penalty != ob2->move_slow_penalty)	230	|| ob1->move_slow_penalty != ob2->move_slow_penalty
		231	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
		232	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
252	return 0;	233	return 0;
253		234
		235	if ((ob1->flag ^ ob2->flag)
		236	.reset (FLAG_INV_LOCKED)
		237	.reset (FLAG_REMOVED)
		238	.any ())
		239	return 0;
		240
254	/* This is really a spellbook check - really, we should	241	/* This is really a spellbook check - we should in general
255	* check all objects in the inventory.	242	* not merge objects with real inventories, as splitting them
		243	* is hard.
256	*/	244	*/
257	if (ob1->inv || ob2->inv)	245	if (ob1->inv || ob2->inv)
258	{	246	{
259	if (!(ob1->inv && ob2->inv))	247	if (!(ob1->inv && ob2->inv))
260	return 0; /* inventories differ in length */	248	return 0; /* inventories differ in length */
261		249
262	if (ob1->inv->below || ob2->inv->below)	250	if (ob1->inv->below || ob2->inv->below)
263	return 0; /* more than one object in inv */	251	return 0; /* more than one object in inv */
264		252
265	if (!object::can_merge (ob1->inv, ob2->inv))	253	if (!object::can_merge (ob1->inv, ob2->inv))
266	return 0; /* inventory objexts differ */	254	return 0; /* inventory objects differ */
267		255
268	/* inventory ok - still need to check rest of this object to see	256	/* inventory ok - still need to check rest of this object to see
269	* if it is valid.	257	* if it is valid.
270	*/	258	*/
271	}	259	}
…		…
290	if (ob1->level != ob2->level)	278	if (ob1->level != ob2->level)
291	return 0;	279	return 0;
292	break;	280	break;
293	}	281	}
294		282
295	if (ob1->key_values != NULL || ob2->key_values != NULL)	283	if (ob1->key_values || ob2->key_values)
296	{	284	{
297	/* At least one of these has key_values. */	285	/* At least one of these has key_values. */
298	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	286	if ((!ob1->key_values) != (!ob2->key_values))
299	/* One has fields, but the other one doesn't. */	287	return 0; /* One has fields, but the other one doesn't. */
300	return 0;	288
301	else if (!compare_ob_value_lists (ob1, ob2))	289	if (!compare_ob_value_lists (ob1, ob2))
302	return 0;	290	return 0;
303	}	291	}
304		292
305	if (ob1->self || ob2->self)	293	if (ob1->self || ob2->self)
306	{	294	{
307	ob1->optimise ();	295	ob1->optimise ();
308	ob2->optimise ();	296	ob2->optimise ();
309		297
310	if (ob1->self || ob2->self)	298	if (ob1->self || ob2->self)
311	{	299	{
312	int k1 = ob1->self ? HvTOTALKEYS (SvRV (ob1->self)) : 0;	300	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
313	int k2 = ob2->self ? HvTOTALKEYS (SvRV (ob2->self)) : 0;	301	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
314		302
315	if (k1 != k2)	303	if (k1 != k2)
316	return 0;	304	return 0;
		305
317	else if (k1 == 0)	306	if (k1 == 0)
318	return 1;	307	return 1;
		308
319	else if (!cfperl_can_merge (ob1, ob2))	309	if (!cfperl_can_merge (ob1, ob2))
320	return 0;	310	return 0;
321	}	311	}
322	}	312	}
323		313
324	/* Everything passes, must be OK. */	314	/* Everything passes, must be OK. */
325	return 1;	315	return 1;
326	}	316	}
327		317
		318	// find player who can see this object
		319	object *
		320	object::visible_to () const
		321	{
		322	if (client_visible () && !flag [FLAG_REMOVED])
		323	{
		324	// see if we are in a container of sorts
		325	if (env)
		326	{
		327	// the player inventory itself is always visible
		328	if (env->type == PLAYER)
		329	return env;
		330
		331	// else a player could have our env open
		332	object *envest = env->outer_env ();
		333
		334	// the player itself is always on a map, so we will find him here
		335	// even if our inv is in a player.
		336	if (envest->is_on_map ())
		337	if (object *pl = envest->ms ().player ())
		338	if (pl->container == env)
		339	return pl;
		340	}
		341	else
		342	{
		343	// maybe there is a player standing on the same mapspace
		344	// this will catch the case where "this" is a player
		345	if (object *pl = ms ().player ())
		346	if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look)
		347	|| this == pl->container)
		348	return pl;
		349	}
		350	}
		351
		352	return 0;
		353	}
		354
		355	// adjust weight per container type ("of holding")
		356	static sint32
		357	weight_adjust_for (object *op, sint32 weight)
		358	{
		359	return op->type == CONTAINER
		360	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		361	: weight;
		362	}
		363
328	/*	364	/*
		365	* adjust_weight(object, weight) adds the specified weight to an object,
		366	* and also updates how much the environment(s) is/are carrying.
		367	*/
		368	static void
		369	adjust_weight (object *op, sint32 weight)
		370	{
		371	while (op)
		372	{
		373	// adjust by actual difference to account for rounding errors
		374	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
		375	weight = weight_adjust_for (op, op->carrying)
		376	- weight_adjust_for (op, op->carrying - weight);
		377
		378	if (!weight)
		379	return;
		380
		381	op->carrying += weight;
		382
		383	if (object *pl = op->visible_to ())
		384	if (pl != op) // player is handled lazily
		385	esrv_update_item (UPD_WEIGHT, pl, op);
		386
		387	op = op->env;
		388	}
		389	}
		390
		391	/*
329	* sum_weight() is a recursive function which calculates the weight	392	* this is a recursive function which calculates the weight
330	* an object is carrying. It goes through in figures out how much	393	* an object is carrying. It goes through op and figures out how much
331	* containers are carrying, and sums it up.	394	* containers are carrying, and sums it up.
332	*/	395	*/
333	long	396	void
334	sum_weight (object *op)	397	object::update_weight ()
335	{	398	{
336	long sum;	399	sint32 sum = 0;
337	object *inv;
338		400
339	for (sum = 0, inv = op->inv; inv; inv = inv->below)	401	for (object *op = inv; op; op = op->below)
340	{	402	{
341	if (inv->inv)	403	if (op->inv)
342	sum_weight (inv);	404	op->update_weight ();
343		405
344	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	406	sum += op->total_weight ();
		407	}
		408
		409	sum = weight_adjust_for (this, sum);
		410
		411	if (sum != carrying)
345	}	412	{
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;	413	carrying = sum;
352		414
353	return sum;	415	if (object *pl = visible_to ())
		416	if (pl != this) // player is handled lazily
		417	esrv_update_item (UPD_WEIGHT, pl, this);
		418	}
354	}	419	}
355		420
356	/**	421	/*
357	* Return the outermost environment object for a given object.	422	* 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	*/	423	*/
373	char *	424	char *
374	dump_object (object *op)	425	dump_object (object *op)
375	{	426	{
376	if (!op)	427	if (!op)
…		…
390	get_nearest_part (object *op, const object *pl)	441	get_nearest_part (object *op, const object *pl)
391	{	442	{
392	object *tmp, *closest;	443	object *tmp, *closest;
393	int last_dist, i;	444	int last_dist, i;
394		445
395	if (op->more == NULL)	446	if (!op->more)
396	return op;	447	return op;
		448
397	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	449	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		450	tmp;
		451	tmp = tmp->more)
398	if ((i = distance (tmp, pl)) < last_dist)	452	if ((i = distance (tmp, pl)) < last_dist)
399	closest = tmp, last_dist = i;	453	closest = tmp, last_dist = i;
		454
400	return closest;	455	return closest;
401	}	456	}
402		457
403	/*	458	/*
404	* Returns the object which has the count-variable equal to the argument.	459	* Returns the object which has the count-variable equal to the argument.
		460	* VERRRY slow.
405	*/	461	*/
406	object *	462	object *
407	find_object (tag_t i)	463	find_object (tag_t i)
408	{	464	{
409	for_all_objects (op)	465	for_all_objects (op)
…		…
420	*/	476	*/
421	object *	477	object *
422	find_object_name (const char *str)	478	find_object_name (const char *str)
423	{	479	{
424	shstr_cmp str_ (str);	480	shstr_cmp str_ (str);
425	object *op;
426		481
		482	if (str_)
427	for_all_objects (op)	483	for_all_objects (op)
428	if (op->name == str_)	484	if (op->name == str_)
429	break;	485	return op;
430		486
431	return op;	487	return 0;
432	}
433
434	void
435	free_all_object_data ()
436	{
437	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
438	}	488	}
439		489
440	/*	490	/*
441	* Sets the owner and sets the skill and exp pointers to owner's current	491	* Sets the owner and sets the skill and exp pointers to owner's current
442	* skill and experience objects.	492	* skill and experience objects.
…		…
447	{	497	{
448	// allow objects which own objects	498	// allow objects which own objects
449	if (owner)	499	if (owner)
450	while (owner->owner)	500	while (owner->owner)
451	owner = owner->owner;	501	owner = owner->owner;
		502
		503	if (flag [FLAG_FREED])
		504	{
		505	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		506	return;
		507	}
452		508
453	this->owner = owner;	509	this->owner = owner;
454	}	510	}
455		511
456	int	512	int
…		…
534	}	590	}
535		591
536	op->key_values = 0;	592	op->key_values = 0;
537	}	593	}
538		594
539	object &	595	/*
540	object::operator =(const object &src)	596	* copy_to first frees everything allocated by the dst object,
		597	* and then copies the contents of itself into the second
		598	* object, allocating what needs to be allocated. Basically, any
		599	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		600	* if the first object is freed, the pointers in the new object
		601	* will point at garbage.
		602	*/
		603	void
		604	object::copy_to (object *dst)
541	{	605	{
542	bool is_freed = flag [FLAG_FREED];	606	dst->remove ();
543	bool is_removed = flag [FLAG_REMOVED];
544
545	*(object_copy *)this = src;	607	*(object_copy *)dst = *this;
546
547	flag [FLAG_FREED] = is_freed;
548	flag [FLAG_REMOVED] = is_removed;	608	dst->flag [FLAG_REMOVED] = true;
549		609
550	/* Copy over key_values, if any. */	610	/* Copy over key_values, if any. */
551	if (src.key_values)	611	if (key_values)
552	{	612	{
553	key_value *tail = 0;	613	key_value *tail = 0;
554	key_values = 0;	614	dst->key_values = 0;
555		615
556	for (key_value *i = src.key_values; i; i = i->next)	616	for (key_value *i = key_values; i; i = i->next)
557	{	617	{
558	key_value *new_link = new key_value;	618	key_value *new_link = new key_value;
559		619
560	new_link->next = 0;	620	new_link->next = 0;
561	new_link->key = i->key;	621	new_link->key = i->key;
562	new_link->value = i->value;	622	new_link->value = i->value;
563		623
564	/* Try and be clever here, too. */	624	/* Try and be clever here, too. */
565	if (!key_values)	625	if (!dst->key_values)
566	{	626	{
567	key_values = new_link;	627	dst->key_values = new_link;
568	tail = new_link;	628	tail = new_link;
569	}	629	}
570	else	630	else
571	{	631	{
572	tail->next = new_link;	632	tail->next = new_link;
573	tail = new_link;	633	tail = new_link;
574	}	634	}
575	}	635	}
576	}	636	}
577	}
578
579	/*
580	* copy_to first frees everything allocated by the dst object,
581	* and then copies the contents of itself into the second
582	* object, allocating what needs to be allocated. Basically, any
583	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
584	* if the first object is freed, the pointers in the new object
585	* will point at garbage.
586	*/
587	void
588	object::copy_to (object *dst)
589	{
590	*dst = *this;
591		637
592	if (speed < 0)	638	if (speed < 0)
593	dst->speed_left -= rndm ();	639	dst->speed_left -= rndm ();
594		640
595	dst->set_speed (dst->speed);	641	dst->activate ();
596	}	642	}
597		643
598	void	644	void
599	object::instantiate ()	645	object::instantiate ()
600	{	646	{
601	if (!uuid.seq) // HACK	647	if (!uuid.seq) // HACK
602	uuid = gen_uuid ();	648	uuid = UUID::gen ();
603		649
604	speed_left = -0.1f;	650	speed_left = -0.1f;
605	/* copy the body_info to the body_used - this is only really	651	/* copy the body_info to the body_used - this is only really
606	* need for monsters, but doesn't hurt to do it for everything.	652	* need for monsters, but doesn't hurt to do it for everything.
607	* by doing so, when a monster is created, it has good starting	653	* by doing so, when a monster is created, it has good starting
…		…
617	object *	663	object *
618	object::clone ()	664	object::clone ()
619	{	665	{
620	object *neu = create ();	666	object *neu = create ();
621	copy_to (neu);	667	copy_to (neu);
		668	neu->map = map; // not copied by copy_to
622	return neu;	669	return neu;
623	}	670	}
624		671
625	/*	672	/*
626	* If an object with the IS_TURNABLE() flag needs to be turned due	673	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
677	* UP_OBJ_FACE: only the objects face has changed.	724	* UP_OBJ_FACE: only the objects face has changed.
678	*/	725	*/
679	void	726	void
680	update_object (object *op, int action)	727	update_object (object *op, int action)
681	{	728	{
682	if (op == NULL)	729	if (!op)
683	{	730	{
684	/* this should never happen */	731	/* this should never happen */
685	LOG (llevDebug, "update_object() called for NULL object.\n");	732	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
686	return;	733	return;
687	}	734	}
688		735
689	if (op->env)	736	if (!op->is_on_map ())
690	{	737	{
691	/* Animation is currently handled by client, so nothing	738	/* Animation is currently handled by client, so nothing
692	* to do in this case.	739	* to do in this case.
693	*/	740	*/
694	return;	741	return;
695	}	742	}
696
697	/* If the map is saving, don't do anything as everything is
698	* going to get freed anyways.
699	*/
700	if (!op->map || op->map->in_memory == MAP_SAVING)
701	return;
702		743
703	/* make sure the object is within map boundaries */	744	/* make sure the object is within map boundaries */
704	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)	745	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
705	{	746	{
706	LOG (llevError, "update_object() called for object out of map!\n");	747	LOG (llevError, "update_object() called for object out of map!\n");
…		…
725	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	766	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
726	|| (m.move_on | op->move_on ) != m.move_on	767	|| (m.move_on | op->move_on ) != m.move_on
727	|| (m.move_off | op->move_off ) != m.move_off	768	|| (m.move_off | op->move_off ) != m.move_off
728	|| (m.move_slow | op->move_slow) != m.move_slow	769	|| (m.move_slow | op->move_slow) != m.move_slow
729	/* This isn't perfect, but I don't expect a lot of objects to	770	/* This isn't perfect, but I don't expect a lot of objects to
730	* to have move_allow right now.	771	* have move_allow right now.
731	*/	772	*/
732	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	773	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
733	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	774	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
734	m.flags_ = 0;	775	m.flags_ = 0;
735	}	776	}
…		…
766	static int object_count;	807	static int object_count;
767		808
768	void object::link ()	809	void object::link ()
769	{	810	{
770	assert (!index);//D	811	assert (!index);//D
771	uuid = gen_uuid ();	812	uuid = UUID::gen ();
772	count = ++object_count;	813	count = ++object_count;
773		814
774	refcnt_inc ();	815	refcnt_inc ();
775	objects.insert (this);	816	objects.insert (this);
776	}	817	}
…		…
788	object::activate ()	829	object::activate ()
789	{	830	{
790	/* If already on active list, don't do anything */	831	/* If already on active list, don't do anything */
791	if (active)	832	if (active)
792	return;	833	return;
		834
		835	if (has_active_speed () && flag [FLAG_FREED]) LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		836	if (has_active_speed () && flag [FLAG_DEBUG]) LOG (llevError | logBacktrace, "BUG: tried to activate DEBUG object %s\n", debug_desc ());//D temp
793		837
794	if (has_active_speed ())	838	if (has_active_speed ())
795	actives.insert (this);	839	actives.insert (this);
796	}	840	}
797		841
…		…
849	object::destroy_inv (bool drop_to_ground)	893	object::destroy_inv (bool drop_to_ground)
850	{	894	{
851	// need to check first, because the checks below might segfault	895	// need to check first, because the checks below might segfault
852	// as we might be on an invalid mapspace and crossfire code	896	// as we might be on an invalid mapspace and crossfire code
853	// is too buggy to ensure that the inventory is empty.	897	// is too buggy to ensure that the inventory is empty.
854	// corollary: if you create arrows etc. with stuff in tis inventory,	898	// corollary: if you create arrows etc. with stuff in its inventory,
855	// cf will crash below with off-map x and y	899	// cf will crash below with off-map x and y
856	if (!inv)	900	if (!inv)
857	return;	901	return;
858		902
859	/* Only if the space blocks everything do we not process -	903	/* Only if the space blocks everything do we not process -
860	* if some form of movement is allowed, let objects	904	* if some form of movement is allowed, let objects
861	* drop on that space.	905	* drop on that space.
862	*/	906	*/
863	if (!drop_to_ground	907	if (!drop_to_ground
864	|| !map	908	|| !map
865	|| map->in_memory != MAP_IN_MEMORY	909	|| map->in_memory != MAP_ACTIVE
866	|| map->nodrop	910	|| map->no_drop
867	|| ms ().move_block == MOVE_ALL)	911	|| ms ().move_block == MOVE_ALL)
868	{	912	{
869	while (inv)	913	while (inv)
870	{
871	inv->destroy_inv (drop_to_ground);
872	inv->destroy ();	914	inv->destroy ();
873	}
874	}	915	}
875	else	916	else
876	{ /* Put objects in inventory onto this space */	917	{ /* Put objects in inventory onto this space */
877	while (inv)	918	while (inv)
878	{	919	{
…		…
896	object *op = new object;	937	object *op = new object;
897	op->link ();	938	op->link ();
898	return op;	939	return op;
899	}	940	}
900		941
		942	static struct freed_map : maptile
		943	{
		944	freed_map ()
		945	{
		946	path = "<freed objects map>";
		947	name = "/internal/freed_objects_map";
		948	width = 3;
		949	height = 3;
		950	no_drop = 1;
		951	no_reset = 1;
		952
		953	alloc ();
		954	in_memory = MAP_ACTIVE;
		955	}
		956
		957	~freed_map ()
		958	{
		959	destroy ();
		960	}
		961	} freed_map; // freed objects are moved here to avoid crashes
		962
901	void	963	void
902	object::do_destroy ()	964	object::do_destroy ()
903	{	965	{
904	attachable::do_destroy ();
905
906	if (flag [FLAG_IS_LINKED])	966	if (flag [FLAG_IS_LINKED])
907	remove_button_link (this);	967	remove_button_link (this);
908		968
909	if (flag [FLAG_FRIENDLY])	969	if (flag [FLAG_FRIENDLY])
910	remove_friendly_object (this);	970	remove_friendly_object (this);
911		971
912	if (!flag [FLAG_REMOVED])
913	remove ();	972	remove ();
914		973
915	destroy_inv (true);	974	attachable::do_destroy ();
916		975
917	deactivate ();	976	deactivate ();
918	unlink ();	977	unlink ();
919		978
920	flag [FLAG_FREED] = 1;	979	flag [FLAG_FREED] = 1;
921		980
922	// hack to ensure that freed objects still have a valid map	981	// hack to ensure that freed objects still have a valid map
923	{
924	static maptile *freed_map; // freed objects are moved here to avoid crashes
925
926	if (!freed_map)
927	{
928	freed_map = new maptile;
929
930	freed_map->path = "<freed objects map>";
931	freed_map->name = "/internal/freed_objects_map";
932	freed_map->width = 3;
933	freed_map->height = 3;
934
935	freed_map->alloc ();
936	freed_map->in_memory = MAP_IN_MEMORY;
937	}
938
939	map = freed_map;	982	map = &freed_map;
940	x = 1;	983	x = 1;
941	y = 1;	984	y = 1;
942	}
943		985
944	if (more)	986	if (more)
945	{	987	{
946	more->destroy ();	988	more->destroy ();
947	more = 0;	989	more = 0;
…		…
960	object::destroy (bool destroy_inventory)	1002	object::destroy (bool destroy_inventory)
961	{	1003	{
962	if (destroyed ())	1004	if (destroyed ())
963	return;	1005	return;
964		1006
		1007	if (!is_head () && !head->destroyed ())
		1008	{
		1009	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1010	head->destroy (destroy_inventory);
		1011	return;
		1012	}
		1013
965	if (destroy_inventory)	1014	destroy_inv (!destroy_inventory);
966	destroy_inv (false);
967		1015
968	if (is_head ())	1016	if (is_head ())
969	if (sound_destroy)	1017	if (sound_destroy)
970	play_sound (sound_destroy);	1018	play_sound (sound_destroy);
971	else if (flag [FLAG_MONSTER])	1019	else if (flag [FLAG_MONSTER])
972	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism	1020	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
973		1021
974	attachable::destroy ();	1022	attachable::destroy ();
975	}
976
977	/*
978	* sub_weight() recursively (outwards) subtracts a number from the
979	* weight of an object (and what is carried by it's environment(s)).
980	*/
981	void
982	sub_weight (object *op, signed long weight)
983	{
984	while (op != NULL)
985	{
986	if (op->type == CONTAINER)
987	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
988
989	op->carrying -= weight;
990	op = op->env;
991	}
992	}	1023	}
993		1024
994	/* op->remove ():	1025	/* op->remove ():
995	* This function removes the object op from the linked list of objects	1026	* This function removes the object op from the linked list of objects
996	* which it is currently tied to. When this function is done, the	1027	* which it is currently tied to. When this function is done, the
…		…
1002	object::do_remove ()	1033	object::do_remove ()
1003	{	1034	{
1004	object *tmp, *last = 0;	1035	object *tmp, *last = 0;
1005	object *otmp;	1036	object *otmp;
1006		1037
1007	if (QUERY_FLAG (this, FLAG_REMOVED))	1038	if (flag [FLAG_REMOVED])
1008	return;	1039	return;
1009		1040
1010	SET_FLAG (this, FLAG_REMOVED);
1011	INVOKE_OBJECT (REMOVE, this);	1041	INVOKE_OBJECT (REMOVE, this);
		1042
		1043	flag [FLAG_REMOVED] = true;
1012		1044
1013	if (more)	1045	if (more)
1014	more->remove ();	1046	more->remove ();
1015		1047
1016	/*	1048	/*
1017	* In this case, the object to be removed is in someones	1049	* In this case, the object to be removed is in someones
1018	* inventory.	1050	* inventory.
1019	*/	1051	*/
1020	if (env)	1052	if (env)
1021	{	1053	{
1022	if (nrof)	1054	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1023	sub_weight (env, weight * nrof);	1055	if (object *pl = visible_to ())
1024	else	1056	esrv_del_item (pl->contr, count);
1025	sub_weight (env, weight + carrying);	1057	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1058
		1059	adjust_weight (env, -total_weight ());
		1060
		1061	/* we set up values so that it could be inserted into
		1062	* the map, but we don't actually do that - it is up
		1063	* to the caller to decide what we want to do.
		1064	*/
		1065	map = env->map;
		1066	x = env->x;
		1067	y = env->y;
		1068
		1069	// make sure cmov optimisation is applicable
		1070	*(above ? &above->below : &env->inv) = below;
		1071	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1072
		1073	above = 0;
		1074	below = 0;
		1075	env = 0;
1026		1076
1027	/* NO_FIX_PLAYER is set when a great many changes are being	1077	/* NO_FIX_PLAYER is set when a great many changes are being
1028	* made to players inventory. If set, avoiding the call	1078	* made to players inventory. If set, avoiding the call
1029	* to save cpu time.	1079	* to save cpu time.
1030	*/	1080	*/
1031	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1081	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1032	otmp->update_stats ();	1082	otmp->update_stats ();
1033
1034	if (above)
1035	above->below = below;
1036	else
1037	env->inv = below;
1038
1039	if (below)
1040	below->above = above;
1041
1042	/* we set up values so that it could be inserted into
1043	* the map, but we don't actually do that - it is up
1044	* to the caller to decide what we want to do.
1045	*/
1046	x = env->x, y = env->y;
1047	map = env->map;
1048	above = 0, below = 0;
1049	env = 0;
1050	}	1083	}
1051	else if (map)	1084	else if (map)
1052	{	1085	{
1053	if (type == PLAYER)
1054	{
1055	// leaving a spot always closes any open container on the ground
1056	if (container && !container->env)
1057	// this causes spurious floorbox updates, but it ensures
1058	// that the CLOSE event is being sent.
1059	close_container ();
1060
1061	--map->players;
1062	map->touch ();
1063	}
1064
1065	map->dirty = true;	1086	map->dirty = true;
1066	mapspace &ms = this->ms ();	1087	mapspace &ms = this->ms ();
1067		1088
		1089	if (object *pl = ms.player ())
		1090	{
		1091	if (type == PLAYER) // this == pl(!)
		1092	{
		1093	// leaving a spot always closes any open container on the ground
		1094	if (container && !container->env)
		1095	// this causes spurious floorbox updates, but it ensures
		1096	// that the CLOSE event is being sent.
		1097	close_container ();
		1098
		1099	--map->players;
		1100	map->touch ();
		1101	}
		1102	else if (pl->container == this)
		1103	{
		1104	// removing a container should close it
		1105	close_container ();
		1106	}
		1107
		1108	esrv_del_item (pl->contr, count);
		1109	}
		1110
1068	/* link the object above us */	1111	/* link the object above us */
1069	if (above)	1112	// re-link, make sure compiler can easily use cmove
1070	above->below = below;	1113	*(above ? &above->below : &ms.top) = below;
1071	else	1114	*(below ? &below->above : &ms.bot) = above;
1072	ms.top = below; /* we were top, set new top */
1073
1074	/* Relink the object below us, if there is one */
1075	if (below)
1076	below->above = above;
1077	else
1078	{
1079	/* Nothing below, which means we need to relink map object for this space
1080	* use translated coordinates in case some oddness with map tiling is
1081	* evident
1082	*/
1083	if (GET_MAP_OB (map, x, y) != this)
1084	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 ());
1085
1086	ms.bot = above; /* goes on above it. */
1087	}
1088		1115
1089	above = 0;	1116	above = 0;
1090	below = 0;	1117	below = 0;
		1118
		1119	ms.flags_ = 0;
1091		1120
1092	if (map->in_memory == MAP_SAVING)	1121	if (map->in_memory == MAP_SAVING)
1093	return;	1122	return;
1094		1123
1095	int check_walk_off = !flag [FLAG_NO_APPLY];	1124	int check_walk_off = !flag [FLAG_NO_APPLY];
…		…
1101	* removed (most likely destroyed), update the player view	1130	* removed (most likely destroyed), update the player view
1102	* appropriately.	1131	* appropriately.
1103	*/	1132	*/
1104	pl->close_container ();	1133	pl->close_container ();
1105		1134
		1135	//TODO: the floorbox prev/next might need updating
		1136	//esrv_del_item (pl->contr, count);
		1137	//TODO: update floorbox to preserve ordering
		1138	if (pl->contr->ns)
1106	pl->contr->ns->floorbox_update ();	1139	pl->contr->ns->floorbox_update ();
1107	}	1140	}
1108		1141
1109	for (tmp = ms.bot; tmp; tmp = tmp->above)	1142	for (tmp = ms.bot; tmp; tmp = tmp->above)
1110	{	1143	{
1111	/* No point updating the players look faces if he is the object	1144	/* No point updating the players look faces if he is the object
…		…
1124	}	1157	}
1125		1158
1126	last = tmp;	1159	last = tmp;
1127	}	1160	}
1128		1161
1129	/* last == NULL if there are no objects on this space */
1130	//TODO: this makes little sense, why only update the topmost object?
1131	if (!last)
1132	map->at (x, y).flags_ = 0;
1133	else
1134	update_object (last, UP_OBJ_REMOVE);
1135
1136	if (flag [FLAG_BLOCKSVIEW] || glow_radius)	1162	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1137	update_all_los (map, x, y);	1163	update_all_los (map, x, y);
1138	}	1164	}
1139	}	1165	}
1140		1166
…		…
1155	if (!top)	1181	if (!top)
1156	for (top = op; top && top->above; top = top->above)	1182	for (top = op; top && top->above; top = top->above)
1157	;	1183	;
1158		1184
1159	for (; top; top = top->below)	1185	for (; top; top = top->below)
1160	{
1161	if (top == op)
1162	continue;
1163
1164	if (object::can_merge (op, top))	1186	if (object::can_merge (op, top))
1165	{	1187	{
1166	top->nrof += op->nrof;	1188	top->nrof += op->nrof;
1167		1189
1168	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1190	if (object *pl = top->visible_to ())
1169	op->weight = 0; /* Don't want any adjustements now */	1191	esrv_update_item (UPD_NROF, pl, top);
		1192
		1193	op->weight = 0; // cancel the addition above
		1194	op->carrying = 0; // must be 0 already
		1195
1170	op->destroy ();	1196	op->destroy ();
		1197
1171	return top;	1198	return top;
1172	}	1199	}
1173	}
1174		1200
1175	return 0;	1201	return 0;
1176	}	1202	}
1177		1203
1178	void	1204	void
…		…
1203	* job preparing multi-part monsters.	1229	* job preparing multi-part monsters.
1204	*/	1230	*/
1205	object *	1231	object *
1206	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1232	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1207	{	1233	{
		1234	op->remove ();
		1235
1208	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1236	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1209	{	1237	{
1210	tmp->x = x + tmp->arch->x;	1238	tmp->x = x + tmp->arch->x;
1211	tmp->y = y + tmp->arch->y;	1239	tmp->y = y + tmp->arch->y;
1212	}	1240	}
…		…
1235	* just 'op' otherwise	1263	* just 'op' otherwise
1236	*/	1264	*/
1237	object *	1265	object *
1238	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1266	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1239	{	1267	{
1240	assert (!op->flag [FLAG_FREED]);	1268	if (op->is_on_map ())
		1269	{
		1270	LOG (llevError, "insert_ob_in_map called for object already on map");
		1271	abort ();
		1272	}
1241		1273
1242	object *top, *floor = NULL;	1274	if (op->env)
1243		1275	{
		1276	LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)");
1244	op->remove ();	1277	op->remove ();
		1278	}
		1279
		1280	if (m == &freed_map)//D TODO: remove soon
		1281	{//D
		1282	LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
		1283	}//D
1245		1284
1246	/* Ideally, the caller figures this out. However, it complicates a lot	1285	/* Ideally, the caller figures this out. However, it complicates a lot
1247	* of areas of callers (eg, anything that uses find_free_spot would now	1286	* of areas of callers (eg, anything that uses find_free_spot would now
1248	* need extra work	1287	* need extra work
1249	*/	1288	*/
1250	if (!xy_normalise (m, op->x, op->y))	1289	if (!xy_normalise (m, op->x, op->y))
1251	{	1290	{
1252	op->destroy ();	1291	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1253	return 0;	1292	return 0;
1254	}	1293	}
1255		1294
1256	if (object *more = op->more)	1295	if (object *more = op->more)
1257	if (!insert_ob_in_map (more, m, originator, flag))	1296	if (!insert_ob_in_map (more, m, originator, flag))
…		…
1266	*/	1305	*/
1267	if (op->nrof && !(flag & INS_NO_MERGE))	1306	if (op->nrof && !(flag & INS_NO_MERGE))
1268	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1307	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1269	if (object::can_merge (op, tmp))	1308	if (object::can_merge (op, tmp))
1270	{	1309	{
		1310	// TODO: we actually want to update tmp, not op,
		1311	// but some caller surely breaks when we return tmp
		1312	// from here :/
1271	op->nrof += tmp->nrof;	1313	op->nrof += tmp->nrof;
1272	tmp->destroy ();	1314	tmp->destroy ();
1273	}	1315	}
1274		1316
1275	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1317	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
…		…
1284	{	1326	{
1285	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1327	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1286	abort ();	1328	abort ();
1287	}	1329	}
1288		1330
		1331	if (!originator->is_on_map ())
		1332	LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1333	op->debug_desc (), originator->debug_desc ());
		1334
1289	op->above = originator;	1335	op->above = originator;
1290	op->below = originator->below;	1336	op->below = originator->below;
1291
1292	if (op->below)
1293	op->below->above = op;
1294	else
1295	ms.bot = op;
1296
1297	/* since *below* originator, no need to update top */
1298	originator->below = op;	1337	originator->below = op;
		1338
		1339	*(op->below ? &op->below->above : &ms.bot) = op;
1299	}	1340	}
1300	else	1341	else
1301	{	1342	{
1302	top = ms.bot;	1343	object *floor = 0;
		1344	object *top = ms.top;
1303		1345
1304	/* If there are other objects, then */	1346	/* If there are other objects, then */
1305	if (top)	1347	if (top)
1306	{	1348	{
1307	object *last = 0;
1308
1309	/*	1349	/*
1310	* If there are multiple objects on this space, we do some trickier handling.	1350	* If there are multiple objects on this space, we do some trickier handling.
1311	* We've already dealt with merging if appropriate.	1351	* We've already dealt with merging if appropriate.
1312	* Generally, we want to put the new object on top. But if	1352	* Generally, we want to put the new object on top. But if
1313	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1353	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1316	* once we get to them. This reduces the need to traverse over all of	1356	* once we get to them. This reduces the need to traverse over all of
1317	* them when adding another one - this saves quite a bit of cpu time	1357	* them when adding another one - this saves quite a bit of cpu time
1318	* when lots of spells are cast in one area. Currently, it is presumed	1358	* when lots of spells are cast in one area. Currently, it is presumed
1319	* that flying non pickable objects are spell objects.	1359	* that flying non pickable objects are spell objects.
1320	*/	1360	*/
1321	for (top = ms.bot; top; top = top->above)	1361	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1322	{	1362	{
1323	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1363	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1324	floor = top;	1364	floor = tmp;
1325		1365
1326	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1366	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1327	{	1367	{
1328	/* We insert above top, so we want this object below this */	1368	/* We insert above top, so we want this object below this */
1329	top = top->below;	1369	top = tmp->below;
1330	break;	1370	break;
1331	}	1371	}
1332		1372
1333	last = top;	1373	top = tmp;
1334	}	1374	}
1335
1336	/* Don't want top to be NULL, so set it to the last valid object */
1337	top = last;
1338		1375
1339	/* We let update_position deal with figuring out what the space	1376	/* We let update_position deal with figuring out what the space
1340	* looks like instead of lots of conditions here.	1377	* looks like instead of lots of conditions here.
1341	* makes things faster, and effectively the same result.	1378	* makes things faster, and effectively the same result.
1342	*/	1379	*/
…		…
1349	*/	1386	*/
1350	if (!(flag & INS_ON_TOP)	1387	if (!(flag & INS_ON_TOP)
1351	&& ms.flags () & P_BLOCKSVIEW	1388	&& ms.flags () & P_BLOCKSVIEW
1352	&& (op->face && !faces [op->face].visibility))	1389	&& (op->face && !faces [op->face].visibility))
1353	{	1390	{
		1391	object *last;
		1392
1354	for (last = top; last != floor; last = last->below)	1393	for (last = top; last != floor; last = last->below)
1355	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1394	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1356	break;	1395	break;
1357		1396
1358	/* Check to see if we found the object that blocks view,	1397	/* Check to see if we found the object that blocks view,
…		…
1366	} /* If objects on this space */	1405	} /* If objects on this space */
1367		1406
1368	if (flag & INS_ABOVE_FLOOR_ONLY)	1407	if (flag & INS_ABOVE_FLOOR_ONLY)
1369	top = floor;	1408	top = floor;
1370		1409
1371	/* Top is the object that our object (op) is going to get inserted above.	1410	// insert object above top, or bottom-most if top = 0
1372	*/
1373
1374	/* First object on this space */
1375	if (!top)	1411	if (!top)
1376	{	1412	{
		1413	op->below = 0;
1377	op->above = ms.bot;	1414	op->above = ms.bot;
1378
1379	if (op->above)
1380	op->above->below = op;
1381
1382	op->below = 0;
1383	ms.bot = op;	1415	ms.bot = op;
		1416
		1417	*(op->above ? &op->above->below : &ms.top) = op;
1384	}	1418	}
1385	else	1419	else
1386	{ /* get inserted into the stack above top */	1420	{
1387	op->above = top->above;	1421	op->above = top->above;
1388
1389	if (op->above)
1390	op->above->below = op;	1422	top->above = op;
1391		1423
1392	op->below = top;	1424	op->below = top;
1393	top->above = op;	1425	*(op->above ? &op->above->below : &ms.top) = op;
1394	}	1426	}
1395		1427	}
1396	if (!op->above)
1397	ms.top = op;
1398	} /* else not INS_BELOW_ORIGINATOR */
1399		1428
1400	if (op->type == PLAYER)	1429	if (op->type == PLAYER)
1401	{	1430	{
1402	op->contr->do_los = 1;	1431	op->contr->do_los = 1;
1403	++op->map->players;	1432	++op->map->players;
…		…
1405	}	1434	}
1406		1435
1407	op->map->dirty = true;	1436	op->map->dirty = true;
1408		1437
1409	if (object *pl = ms.player ())	1438	if (object *pl = ms.player ())
		1439	//TODO: the floorbox prev/next might need updating
		1440	//esrv_send_item (pl, op);
		1441	//TODO: update floorbox to preserve ordering
		1442	if (pl->contr->ns)
1410	pl->contr->ns->floorbox_update ();	1443	pl->contr->ns->floorbox_update ();
1411		1444
1412	/* If this object glows, it may affect lighting conditions that are	1445	/* If this object glows, it may affect lighting conditions that are
1413	* visible to others on this map. But update_all_los is really	1446	* visible to others on this map. But update_all_los is really
1414	* an inefficient way to do this, as it means los for all players	1447	* an inefficient way to do this, as it means los for all players
1415	* on the map will get recalculated. The players could very well	1448	* on the map will get recalculated. The players could very well
…		…
1457	* op is the object to insert it under: supplies x and the map.	1490	* op is the object to insert it under: supplies x and the map.
1458	*/	1491	*/
1459	void	1492	void
1460	replace_insert_ob_in_map (const char *arch_string, object *op)	1493	replace_insert_ob_in_map (const char *arch_string, object *op)
1461	{	1494	{
1462	object *tmp, *tmp1;
1463
1464	/* first search for itself and remove any old instances */	1495	/* first search for itself and remove any old instances */
1465		1496
1466	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1497	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1467	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1498	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1468	tmp->destroy ();	1499	tmp->destroy ();
1469		1500
1470	tmp1 = arch_to_object (archetype::find (arch_string));	1501	object *tmp = arch_to_object (archetype::find (arch_string));
1471		1502
1472	tmp1->x = op->x;	1503	tmp->x = op->x;
1473	tmp1->y = op->y;	1504	tmp->y = op->y;
		1505
1474	insert_ob_in_map (tmp1, op->map, op, 0);	1506	insert_ob_in_map (tmp, op->map, op, 0);
1475	}	1507	}
1476		1508
1477	object *	1509	object *
1478	object::insert_at (object *where, object *originator, int flags)	1510	object::insert_at (object *where, object *originator, int flags)
1479	{	1511	{
		1512	if (where->env)
		1513	return where->env->insert (this);
		1514	else
1480	return where->map->insert (this, where->x, where->y, originator, flags);	1515	return where->map->insert (this, where->x, where->y, originator, flags);
1481	}	1516	}
1482		1517
1483	/*	1518	/*
1484	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1485	* is returned contains nr objects, and the remaining parts contains
1486	* the rest (or is removed and freed if that number is 0).
1487	* On failure, NULL is returned, and the reason put into the
1488	* global static errmsg array.
1489	*/
1490	object *
1491	get_split_ob (object *orig_ob, uint32 nr)
1492	{
1493	object *newob;
1494	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1495
1496	if (orig_ob->nrof < nr)
1497	{
1498	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1499	return NULL;
1500	}
1501
1502	newob = object_create_clone (orig_ob);
1503
1504	if ((orig_ob->nrof -= nr) < 1)
1505	orig_ob->destroy (1);
1506	else if (!is_removed)
1507	{
1508	if (orig_ob->env != NULL)
1509	sub_weight (orig_ob->env, orig_ob->weight * nr);
1510	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1511	{
1512	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1513	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1514	return NULL;
1515	}
1516	}
1517
1518	newob->nrof = nr;
1519
1520	return newob;
1521	}
1522
1523	/*
1524	* decrease_ob_nr(object, number) decreases a specified number from	1519	* decrease(object, number) decreases a specified number from
1525	* the amount of an object. If the amount reaches 0, the object	1520	* the amount of an object. If the amount reaches 0, the object
1526	* is subsequently removed and freed.	1521	* is subsequently removed and freed.
1527	*	1522	*
1528	* Return value: 'op' if something is left, NULL if the amount reached 0	1523	* Return value: 'op' if something is left, NULL if the amount reached 0
1529	*/	1524	*/
		1525	bool
		1526	object::decrease (sint32 nr)
		1527	{
		1528	if (!nr)
		1529	return true;
		1530
		1531	nr = min (nr, nrof);
		1532
		1533	if (nrof > nr)
		1534	{
		1535	nrof -= nr;
		1536	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
		1537
		1538	if (object *pl = visible_to ())
		1539	esrv_update_item (UPD_NROF, pl, this);
		1540
		1541	return true;
		1542	}
		1543	else
		1544	{
		1545	destroy ();
		1546	return false;
		1547	}
		1548	}
		1549
		1550	/*
		1551	* split(ob,nr) splits up ob into two parts. The part which
		1552	* is returned contains nr objects, and the remaining parts contains
		1553	* the rest (or is removed and returned if that number is 0).
		1554	* On failure, NULL is returned.
		1555	*/
1530	object *	1556	object *
1531	decrease_ob_nr (object *op, uint32 i)	1557	object::split (sint32 nr)
1532	{	1558	{
1533	object *tmp;	1559	int have = number_of ();
1534		1560
1535	if (i == 0) /* objects with op->nrof require this check */	1561	if (have < nr)
1536	return op;	1562	return 0;
1537		1563	else if (have == nr)
1538	if (i > op->nrof)
1539	i = op->nrof;
1540
1541	if (QUERY_FLAG (op, FLAG_REMOVED))
1542	op->nrof -= i;
1543	else if (op->env)
1544	{	1564	{
1545	/* is this object in the players inventory, or sub container
1546	* therein?
1547	*/
1548	tmp = op->in_player ();
1549	/* nope. Is this a container the player has opened?
1550	* If so, set tmp to that player.
1551	* IMO, searching through all the players will mostly
1552	* likely be quicker than following op->env to the map,
1553	* and then searching the map for a player.
1554	*/
1555	if (!tmp)
1556	for_all_players (pl)
1557	if (pl->ob->container == op->env)
1558	{
1559	tmp = pl->ob;
1560	break;
1561	}
1562
1563	if (i < op->nrof)
1564	{
1565	sub_weight (op->env, op->weight * i);
1566	op->nrof -= i;
1567	if (tmp)
1568	esrv_send_item (tmp, op);
1569	}
1570	else
1571	{
1572	op->remove ();	1565	remove ();
1573	op->nrof = 0;	1566	return this;
1574	if (tmp)
1575	esrv_del_item (tmp->contr, op->count);
1576	}
1577	}	1567	}
1578	else	1568	else
1579	{	1569	{
1580	object *above = op->above;	1570	decrease (nr);
1581		1571
1582	if (i < op->nrof)	1572	object *op = deep_clone ();
1583	op->nrof -= i;	1573	op->nrof = nr;
1584	else
1585	{
1586	op->remove ();
1587	op->nrof = 0;
1588	}
1589
1590	/* Since we just removed op, op->above is null */
1591	for (tmp = above; tmp; tmp = tmp->above)
1592	if (tmp->type == PLAYER)
1593	{
1594	if (op->nrof)
1595	esrv_send_item (tmp, op);
1596	else
1597	esrv_del_item (tmp->contr, op->count);
1598	}
1599	}
1600
1601	if (op->nrof)
1602	return op;	1574	return op;
1603	else
1604	{
1605	op->destroy ();
1606	return 0;
1607	}
1608	}
1609
1610	/*
1611	* add_weight(object, weight) adds the specified weight to an object,
1612	* and also updates how much the environment(s) is/are carrying.
1613	*/
1614	void
1615	add_weight (object *op, signed long weight)
1616	{
1617	while (op != NULL)
1618	{
1619	if (op->type == CONTAINER)
1620	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1621
1622	op->carrying += weight;
1623	op = op->env;
1624	}	1575	}
1625	}	1576	}
1626		1577
1627	object *	1578	object *
1628	insert_ob_in_ob (object *op, object *where)	1579	insert_ob_in_ob (object *op, object *where)
…		…
1653	* be != op, if items are merged. -Tero	1604	* be != op, if items are merged. -Tero
1654	*/	1605	*/
1655	object *	1606	object *
1656	object::insert (object *op)	1607	object::insert (object *op)
1657	{	1608	{
1658	if (!QUERY_FLAG (op, FLAG_REMOVED))
1659	op->remove ();
1660
1661	if (op->more)	1609	if (op->more)
1662	{	1610	{
1663	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1611	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1664	return op;	1612	return op;
1665	}	1613	}
1666		1614
1667	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1615	op->remove ();
1668	CLEAR_FLAG (op, FLAG_REMOVED);	1616
		1617	op->flag [FLAG_OBJ_ORIGINAL] = 0;
1669		1618
1670	if (op->nrof)	1619	if (op->nrof)
1671	{
1672	for (object *tmp = inv; tmp; tmp = tmp->below)	1620	for (object *tmp = inv; tmp; tmp = tmp->below)
1673	if (object::can_merge (tmp, op))	1621	if (object::can_merge (tmp, op))
1674	{	1622	{
1675	/* return the original object and remove inserted object	1623	/* return the original object and remove inserted object
1676	(client needs the original object) */	1624	(client needs the original object) */
1677	tmp->nrof += op->nrof;	1625	tmp->nrof += op->nrof;
1678	/* Weight handling gets pretty funky. Since we are adding to	1626
1679	* tmp->nrof, we need to increase the weight.	1627	if (object *pl = tmp->visible_to ())
1680	*/	1628	esrv_update_item (UPD_NROF, pl, tmp);
		1629
1681	add_weight (this, op->weight * op->nrof);	1630	adjust_weight (this, op->total_weight ());
1682	SET_FLAG (op, FLAG_REMOVED);	1631
1683	op->destroy (); /* free the inserted object */	1632	op->destroy ();
1684	op = tmp;	1633	op = tmp;
1685	op->remove (); /* and fix old object's links */	1634	goto inserted;
1686	CLEAR_FLAG (op, FLAG_REMOVED);
1687	break;
1688	}	1635	}
1689		1636
1690	/* I assume combined objects have no inventory
1691	* We add the weight - this object could have just been removed
1692	* (if it was possible to merge). calling remove_ob will subtract
1693	* the weight, so we need to add it in again, since we actually do
1694	* the linking below
1695	*/
1696	add_weight (this, op->weight * op->nrof);
1697	}
1698	else
1699	add_weight (this, (op->weight + op->carrying));
1700
1701	if (object *otmp = this->in_player ())
1702	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1703	otmp->update_stats ();
1704
1705	op->owner = 0; // its his/hers now. period.	1637	op->owner = 0; // it's his/hers now. period.
1706	op->map = 0;	1638	op->map = 0;
		1639	op->x = 0;
		1640	op->y = 0;
		1641
		1642	op->above = 0;
		1643	op->below = inv;
1707	op->env = this;	1644	op->env = this;
1708	op->above = 0;
1709	op->below = 0;
1710	op->x = op->y = 0;
1711		1645
		1646	if (inv)
		1647	inv->above = op;
		1648
		1649	inv = op;
		1650
		1651	op->flag [FLAG_REMOVED] = 0;
		1652
		1653	if (object *pl = op->visible_to ())
		1654	esrv_send_item (pl, op);
		1655
		1656	adjust_weight (this, op->total_weight ());
		1657
		1658	inserted:
1712	/* reset the light list and los of the players on the map */	1659	/* reset the light list and los of the players on the map */
1713	if (op->glow_radius && map)	1660	if (op->glow_radius && map && map->darkness)
1714	{
1715	#ifdef DEBUG_LIGHTS
1716	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1717	#endif /* DEBUG_LIGHTS */
1718	if (map->darkness)
1719	update_all_los (map, x, y);	1661	update_all_los (map, x, y);
1720	}
1721		1662
1722	/* Client has no idea of ordering so lets not bother ordering it here.	1663	// if this is a player's inventory, update stats
1723	* It sure simplifies this function...	1664	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1724	*/	1665	update_stats ();
1725	if (!inv)
1726	inv = op;
1727	else
1728	{
1729	op->below = inv;
1730	op->below->above = op;
1731	inv = op;
1732	}
1733		1666
1734	INVOKE_OBJECT (INSERT, this);	1667	INVOKE_OBJECT (INSERT, this);
1735		1668
1736	return op;	1669	return op;
1737	}	1670	}
…		…
1865	LOG (llevError, "Present_arch called outside map.\n");	1798	LOG (llevError, "Present_arch called outside map.\n");
1866	return NULL;	1799	return NULL;
1867	}	1800	}
1868		1801
1869	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1802	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1870	if (tmp->arch == at)	1803	if (tmp->arch->archname == at->archname)
1871	return tmp;	1804	return tmp;
1872		1805
1873	return NULL;	1806	return NULL;
1874	}	1807	}
1875		1808
…		…
1939	* The first matching object is returned, or NULL if none.	1872	* The first matching object is returned, or NULL if none.
1940	*/	1873	*/
1941	object *	1874	object *
1942	present_arch_in_ob (const archetype *at, const object *op)	1875	present_arch_in_ob (const archetype *at, const object *op)
1943	{	1876	{
1944	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1877	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1945	if (tmp->arch == at)	1878	if (tmp->arch->archname == at->archname)
1946	return tmp;	1879	return tmp;
1947		1880
1948	return NULL;	1881	return NULL;
1949	}	1882	}
1950		1883
…		…
1952	* activate recursively a flag on an object inventory	1885	* activate recursively a flag on an object inventory
1953	*/	1886	*/
1954	void	1887	void
1955	flag_inv (object *op, int flag)	1888	flag_inv (object *op, int flag)
1956	{	1889	{
1957	if (op->inv)
1958	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1890	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1959	{	1891	{
1960	SET_FLAG (tmp, flag);	1892	SET_FLAG (tmp, flag);
1961	flag_inv (tmp, flag);	1893	flag_inv (tmp, flag);
1962	}	1894	}
1963	}	1895	}
1964		1896
1965	/*	1897	/*
1966	* deactivate recursively a flag on an object inventory	1898	* deactivate recursively a flag on an object inventory
1967	*/	1899	*/
1968	void	1900	void
1969	unflag_inv (object *op, int flag)	1901	unflag_inv (object *op, int flag)
1970	{	1902	{
1971	if (op->inv)
1972	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1903	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1973	{	1904	{
1974	CLEAR_FLAG (tmp, flag);	1905	CLEAR_FLAG (tmp, flag);
1975	unflag_inv (tmp, flag);	1906	unflag_inv (tmp, flag);
1976	}	1907	}
1977	}	1908	}
1978		1909
1979	/*	1910	/*
1980	* find_free_spot(object, map, x, y, start, stop) will search for	1911	* find_free_spot(object, map, x, y, start, stop) will search for
1981	* a spot at the given map and coordinates which will be able to contain	1912	* a spot at the given map and coordinates which will be able to contain
…		…
1983	* to search (see the freearr_x/y[] definition).	1914	* to search (see the freearr_x/y[] definition).
1984	* It returns a random choice among the alternatives found.	1915	* It returns a random choice among the alternatives found.
1985	* start and stop are where to start relative to the free_arr array (1,9	1916	* start and stop are where to start relative to the free_arr array (1,9
1986	* does all 4 immediate directions). This returns the index into the	1917	* does all 4 immediate directions). This returns the index into the
1987	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1918	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1988	* Note - this only checks to see if there is space for the head of the
1989	* object - if it is a multispace object, this should be called for all
1990	* pieces.
1991	* Note2: This function does correctly handle tiled maps, but does not	1919	* Note: This function does correctly handle tiled maps, but does not
1992	* inform the caller. However, insert_ob_in_map will update as	1920	* inform the caller. However, insert_ob_in_map will update as
1993	* necessary, so the caller shouldn't need to do any special work.	1921	* necessary, so the caller shouldn't need to do any special work.
1994	* Note - updated to take an object instead of archetype - this is necessary	1922	* Note - updated to take an object instead of archetype - this is necessary
1995	* because arch_blocked (now ob_blocked) needs to know the movement type	1923	* because arch_blocked (now ob_blocked) needs to know the movement type
1996	* to know if the space in question will block the object. We can't use	1924	* to know if the space in question will block the object. We can't use
…		…
2017		1945
2018	/* However, often	1946	/* However, often
2019	* ob doesn't have any move type (when used to place exits)	1947	* ob doesn't have any move type (when used to place exits)
2020	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.	1948	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
2021	*/	1949	*/
2022	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	1950	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
2023	{	1951	{
2024	altern [index++] = i;	1952	altern [index++] = i;
2025	continue;	1953	continue;
2026	}	1954	}
2027		1955
…		…
2041		1969
2042	/* Note it is intentional that we check ob - the movement type of the	1970	/* Note it is intentional that we check ob - the movement type of the
2043	* head of the object should correspond for the entire object.	1971	* head of the object should correspond for the entire object.
2044	*/	1972	*/
2045	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	1973	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1974	continue;
		1975
		1976	if (ob->blocked (m, pos.x, pos.y))
2046	continue;	1977	continue;
2047		1978
2048	altern [index++] = i;	1979	altern [index++] = i;
2049	}	1980	}
2050		1981
…		…
2361		2292
2362	/*	2293	/*
2363	* create clone from object to another	2294	* create clone from object to another
2364	*/	2295	*/
2365	object *	2296	object *
2366	object_create_clone (object *asrc)	2297	object::deep_clone ()
2367	{	2298	{
2368	object *dst = 0, *tmp, *src, *prev, *item;	2299	assert (("deep_clone called on non-head object", is_head ()));
2369		2300
2370	if (!asrc)	2301	object *dst = clone ();
2371	return 0;
2372		2302
2373	src = asrc->head_ ();	2303	object *prev = dst;
2374
2375	prev = 0;
2376	for (object *part = src; part; part = part->more)	2304	for (object *part = this->more; part; part = part->more)
2377	{	2305	{
2378	tmp = part->clone ();	2306	object *tmp = part->clone ();
2379	tmp->x -= src->x;
2380	tmp->y -= src->y;
2381
2382	if (!part->head)
2383	{
2384	dst = tmp;
2385	tmp->head = 0;
2386	}
2387	else
2388	tmp->head = dst;	2307	tmp->head = dst;
2389
2390	tmp->more = 0;
2391
2392	if (prev)
2393	prev->more = tmp;	2308	prev->more = tmp;
2394
2395	prev = tmp;	2309	prev = tmp;
2396	}	2310	}
2397		2311
2398	for (item = src->inv; item; item = item->below)	2312	for (object *item = inv; item; item = item->below)
2399	insert_ob_in_ob (object_create_clone (item), dst);	2313	insert_ob_in_ob (item->deep_clone (), dst);
2400		2314
2401	return dst;	2315	return dst;
2402	}	2316	}
2403		2317
2404	/* This returns the first object in who's inventory that	2318	/* This returns the first object in who's inventory that
…		…
2413	return tmp;	2327	return tmp;
2414		2328
2415	return 0;	2329	return 0;
2416	}	2330	}
2417		2331
2418	/* If ob has a field named key, return the link from the list,	2332	const shstr &
2419	* otherwise return NULL.	2333	object::kv_get (const shstr &key) const
2420	*
2421	* key must be a passed in shared string - otherwise, this won't
2422	* do the desired thing.
2423	*/
2424	key_value *
2425	get_ob_key_link (const object *ob, const char *key)
2426	{	2334	{
2427	for (key_value *link = ob->key_values; link; link = link->next)	2335	for (key_value *kv = key_values; kv; kv = kv->next)
2428	if (link->key == key)	2336	if (kv->key == key)
2429	return link;
2430
2431	return 0;
2432	}
2433
2434	/*
2435	* Returns the value of op has an extra_field for key, or NULL.
2436	*
2437	* The argument doesn't need to be a shared string.
2438	*
2439	* The returned string is shared.
2440	*/
2441	const char *
2442	get_ob_key_value (const object *op, const char *const key)
2443	{
2444	key_value *link;
2445	shstr_cmp canonical_key (key);
2446
2447	if (!canonical_key)
2448	{
2449	/* 1. There being a field named key on any object
2450	* implies there'd be a shared string to find.
2451	* 2. Since there isn't, no object has this field.
2452	* 3. Therefore, *this* object doesn't have this field.
2453	*/
2454	return 0;
2455	}
2456
2457	/* This is copied from get_ob_key_link() above -
2458	* only 4 lines, and saves the function call overhead.
2459	*/
2460	for (link = op->key_values; link; link = link->next)
2461	if (link->key == canonical_key)
2462	return link->value;	2337	return kv->value;
2463		2338
2464	return 0;	2339	return shstr_null;
2465	}	2340	}
2466		2341
2467	/*	2342	void
2468	* Updates the canonical_key in op to value.	2343	object::kv_set (const shstr &key, const shstr &value)
2469	*
2470	* canonical_key is a shared string (value doesn't have to be).
2471	*
2472	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2473	* keys.
2474	*
2475	* Returns TRUE on success.
2476	*/
2477	int
2478	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2479	{	2344	{
2480	key_value *field = NULL, *last = NULL;	2345	for (key_value *kv = key_values; kv; kv = kv->next)
2481		2346	if (kv->key == key)
2482	for (field = op->key_values; field != NULL; field = field->next)
2483	{
2484	if (field->key != canonical_key)
2485	{	2347	{
2486	last = field;	2348	kv->value = value;
2487	continue;	2349	return;
2488	}	2350	}
2489		2351
2490	if (value)	2352	key_value *kv = new key_value;
2491	field->value = value;	2353
2492	else	2354	kv->next = key_values;
		2355	kv->key = key;
		2356	kv->value = value;
		2357
		2358	key_values = kv;
		2359	}
		2360
		2361	void
		2362	object::kv_del (const shstr &key)
		2363	{
		2364	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2365	if ((*kvp)->key == key)
2493	{	2366	{
2494	/* Basically, if the archetype has this key set,	2367	key_value *kv = *kvp;
2495	* we need to store the null value so when we save	2368	*kvp = (*kvp)->next;
2496	* it, we save the empty value so that when we load,	2369	delete kv;
2497	* we get this value back again.	2370	return;
2498	*/
2499	if (get_ob_key_link (op->arch, canonical_key))
2500	field->value = 0;
2501	else
2502	{
2503	if (last)
2504	last->next = field->next;
2505	else
2506	op->key_values = field->next;
2507
2508	delete field;
2509	}
2510	}	2371	}
2511	return TRUE;
2512	}
2513	/* IF we get here, key doesn't exist */
2514
2515	/* No field, we'll have to add it. */
2516
2517	if (!add_key)
2518	return FALSE;
2519
2520	/* There isn't any good reason to store a null
2521	* value in the key/value list. If the archetype has
2522	* this key, then we should also have it, so shouldn't
2523	* be here. If user wants to store empty strings,
2524	* should pass in ""
2525	*/
2526	if (value == NULL)
2527	return TRUE;
2528
2529	field = new key_value;
2530
2531	field->key = canonical_key;
2532	field->value = value;
2533	/* Usual prepend-addition. */
2534	field->next = op->key_values;
2535	op->key_values = field;
2536
2537	return TRUE;
2538	}
2539
2540	/*
2541	* Updates the key in op to value.
2542	*
2543	* If add_key is FALSE, this will only update existing keys,
2544	* and not add new ones.
2545	* In general, should be little reason FALSE is ever passed in for add_key
2546	*
2547	* Returns TRUE on success.
2548	*/
2549	int
2550	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2551	{
2552	shstr key_ (key);
2553
2554	return set_ob_key_value_s (op, key_, value, add_key);
2555	}	2372	}
2556		2373
2557	object::depth_iterator::depth_iterator (object *container)	2374	object::depth_iterator::depth_iterator (object *container)
2558	: iterator_base (container)	2375	: iterator_base (container)
2559	{	2376	{
…		…
2609	{	2426	{
2610	char flagdesc[512];	2427	char flagdesc[512];
2611	char info2[256 * 4];	2428	char info2[256 * 4];
2612	char *p = info;	2429	char *p = info;
2613		2430
2614	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2431	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2615	count, uuid.seq,	2432	count,
		2433	uuid.c_str (),
2616	&name,	2434	&name,
2617	title ? "\",title:\"" : "",	2435	title ? ",title:\"" : "",
2618	title ? (const char *)title : "",	2436	title ? (const char *)title : "",
		2437	title ? "\"" : "",
2619	flag_desc (flagdesc, 512), type);	2438	flag_desc (flagdesc, 512), type);
2620		2439
2621	if (!this->flag[FLAG_REMOVED] && env)	2440	if (!flag[FLAG_REMOVED] && env)
2622	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2441	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2623		2442
2624	if (map)	2443	if (map)
2625	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2444	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2626		2445
…		…
2656	object::open_container (object *new_container)	2475	object::open_container (object *new_container)
2657	{	2476	{
2658	if (container == new_container)	2477	if (container == new_container)
2659	return;	2478	return;
2660		2479
2661	if (object *old_container = container)	2480	object *old_container = container;
		2481
		2482	if (old_container)
2662	{	2483	{
2663	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2484	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2664	return;	2485	return;
2665		2486
2666	#if 0	2487	#if 0
…		…
2668	if (object *closer = old_container->inv)	2489	if (object *closer = old_container->inv)
2669	if (closer->type == CLOSE_CON)	2490	if (closer->type == CLOSE_CON)
2670	closer->destroy ();	2491	closer->destroy ();
2671	#endif	2492	#endif
2672		2493
		2494	// make sure the container is available
		2495	esrv_send_item (this, old_container);
		2496
2673	old_container->flag [FLAG_APPLIED] = 0;	2497	old_container->flag [FLAG_APPLIED] = false;
2674	container = 0;	2498	container = 0;
2675		2499
		2500	// client needs item update to make it work, client bug requires this to be separate
2676	esrv_update_item (UPD_FLAGS, this, old_container);	2501	esrv_update_item (UPD_FLAGS, this, old_container);
		2502
2677	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2503	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2678	play_sound (sound_find ("chest_close"));	2504	play_sound (sound_find ("chest_close"));
2679	}	2505	}
2680		2506
2681	if (new_container)	2507	if (new_container)
…		…
2694	}	2520	}
2695	#endif	2521	#endif
2696		2522
2697	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2523	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2698		2524
		2525	// make sure the container is available, client bug requires this to be separate
		2526	esrv_send_item (this, new_container);
		2527
2699	new_container->flag [FLAG_APPLIED] = 1;	2528	new_container->flag [FLAG_APPLIED] = true;
2700	container = new_container;	2529	container = new_container;
2701		2530
		2531	// client needs flag change
2702	esrv_update_item (UPD_FLAGS, this, new_container);	2532	esrv_update_item (UPD_FLAGS, this, new_container);
2703	esrv_send_inventory (this, new_container);	2533	esrv_send_inventory (this, new_container);
2704	play_sound (sound_find ("chest_open"));	2534	play_sound (sound_find ("chest_open"));
2705	}	2535	}
		2536	// else if (!old_container->env && contr && contr->ns)
		2537	// contr->ns->floorbox_reset ();
2706	}	2538	}
2707		2539
2708	object *	2540	object *
2709	object::force_find (const shstr name)	2541	object::force_find (const shstr name)
2710	{	2542	{
…		…
2736		2568
2737	insert (force);	2569	insert (force);
2738	}	2570	}
2739		2571
2740	void	2572	void
2741	object::play_sound (faceidx sound) const	2573	object::play_sound (faceidx sound)
2742	{	2574	{
2743	if (!sound)	2575	if (!sound)
2744	return;	2576	return;
2745		2577
2746	if (flag [FLAG_REMOVED])	2578	if (flag [FLAG_REMOVED])

Diff Legend

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