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.190 by root, Sat Sep 15 15:58:06 2007 UTC vs.
Revision 1.243 by root, Sat May 17 00:17:02 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	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 one object has inventory but the other doesn't, not equiv */	255	if (!(ob1->inv && ob2->inv))
260	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	256	return 0; /* inventories differ in length */
261	return 0;
262		257
263	/* Now check to see if the two inventory objects could merge */	258	if (ob1->inv->below || ob2->inv->below)
		259	return 0; /* more than one object in inv */
		260
264	if (!object::can_merge (ob1->inv, ob2->inv))	261	if (!object::can_merge (ob1->inv, ob2->inv))
265	return 0;	262	return 0; /* inventory objects differ */
266		263
267	/* 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
268	* if it is valid.	265	* if it is valid.
269	*/	266	*/
270	}	267	}
…		…
289	if (ob1->level != ob2->level)	286	if (ob1->level != ob2->level)
290	return 0;	287	return 0;
291	break;	288	break;
292	}	289	}
293		290
294	if (ob1->key_values != NULL || ob2->key_values != NULL)	291	if (ob1->key_values || ob2->key_values)
295	{	292	{
296	/* At least one of these has key_values. */	293	/* At least one of these has key_values. */
297	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	294	if ((!ob1->key_values) != (!ob2->key_values))
298	/* One has fields, but the other one doesn't. */	295	return 0; /* One has fields, but the other one doesn't. */
299	return 0;	296
300	else if (!compare_ob_value_lists (ob1, ob2))	297	if (!compare_ob_value_lists (ob1, ob2))
301	return 0;	298	return 0;
302	}	299	}
303		300
304	if (ob1->self || ob2->self)	301	if (ob1->self || ob2->self)
305	{	302	{
306	ob1->optimise ();	303	ob1->optimise ();
307	ob2->optimise ();	304	ob2->optimise ();
308		305
309	if (ob1->self || ob2->self)	306	if (ob1->self || ob2->self)
		307	{
		308	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		309	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		310
		311	if (k1 != k2)
		312	return 0;
		313
		314	if (k1 == 0)
		315	return 1;
		316
310	if (!cfperl_can_merge (ob1, ob2))	317	if (!cfperl_can_merge (ob1, ob2))
311	return 0;	318	return 0;
		319	}
312	}	320	}
313		321
314	/* Everything passes, must be OK. */	322	/* Everything passes, must be OK. */
315	return 1;	323	return 1;
316	}	324	}
317		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
318	/*	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	/*
319	* sum_weight() is a recursive function which calculates the weight	399	* this is a recursive function which calculates the weight
320	* 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
321	* containers are carrying, and sums it up.	401	* containers are carrying, and sums it up.
322	*/	402	*/
323	long	403	void
324	sum_weight (object *op)	404	object::update_weight ()
325	{	405	{
326	long sum;	406	sint32 sum = 0;
327	object *inv;
328		407
329	for (sum = 0, inv = op->inv; inv; inv = inv->below)	408	for (object *op = inv; op; op = op->below)
330	{	409	{
331	if (inv->inv)	410	if (op->inv)
332	sum_weight (inv);	411	op->update_weight ();
333		412
334	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)
335	}	419	{
336
337	if (op->type == CONTAINER && op->stats.Str)
338	sum = (sum * (100 - op->stats.Str)) / 100;
339
340	if (op->carrying != sum)
341	op->carrying = sum;	420	carrying = sum;
342		421
343	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	}
344	}	426	}
345		427
346	/**	428	/*
347	* Return the outermost environment object for a given object.	429	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
348	*/
349
350	object *
351	object_get_env_recursive (object *op)
352	{
353	while (op->env != NULL)
354	op = op->env;
355	return op;
356	}
357
358	/*
359	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
360	* Some error messages.
361	* The result of the dump is stored in the static global errmsg array.
362	*/	430	*/
363	char *	431	char *
364	dump_object (object *op)	432	dump_object (object *op)
365	{	433	{
366	if (!op)	434	if (!op)
…		…
380	get_nearest_part (object *op, const object *pl)	448	get_nearest_part (object *op, const object *pl)
381	{	449	{
382	object *tmp, *closest;	450	object *tmp, *closest;
383	int last_dist, i;	451	int last_dist, i;
384		452
385	if (op->more == NULL)	453	if (!op->more)
386	return op;	454	return op;
		455
387	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)
388	if ((i = distance (tmp, pl)) < last_dist)	459	if ((i = distance (tmp, pl)) < last_dist)
389	closest = tmp, last_dist = i;	460	closest = tmp, last_dist = i;
		461
390	return closest;	462	return closest;
391	}	463	}
392		464
393	/*	465	/*
394	* 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.
395	*/	468	*/
396	object *	469	object *
397	find_object (tag_t i)	470	find_object (tag_t i)
398	{	471	{
399	for_all_objects (op)	472	for_all_objects (op)
…		…
410	*/	483	*/
411	object *	484	object *
412	find_object_name (const char *str)	485	find_object_name (const char *str)
413	{	486	{
414	shstr_cmp str_ (str);	487	shstr_cmp str_ (str);
415	object *op;
416		488
		489	if (str_)
417	for_all_objects (op)	490	for_all_objects (op)
418	if (op->name == str_)	491	if (op->name == str_)
419	break;	492	return op;
420		493
421	return op;	494	return 0;
422	}
423
424	void
425	free_all_object_data ()
426	{
427	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
428	}	495	}
429		496
430	/*	497	/*
431	* 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
432	* skill and experience objects.	499	* skill and experience objects.
…		…
437	{	504	{
438	// allow objects which own objects	505	// allow objects which own objects
439	if (owner)	506	if (owner)
440	while (owner->owner)	507	while (owner->owner)
441	owner = owner->owner;	508	owner = owner->owner;
		509
		510	if (flag [FLAG_FREED])
		511	{
		512	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		513	return;
		514	}
442		515
443	this->owner = owner;	516	this->owner = owner;
444	}	517	}
445		518
446	int	519	int
…		…
524	}	597	}
525		598
526	op->key_values = 0;	599	op->key_values = 0;
527	}	600	}
528		601
529	object &	602	/*
530	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)
531	{	612	{
532	bool is_freed = flag [FLAG_FREED];	613	dst->remove ();
533	bool is_removed = flag [FLAG_REMOVED];
534
535	*(object_copy *)this = src;	614	*(object_copy *)dst = *this;
536
537	flag [FLAG_FREED] = is_freed;
538	flag [FLAG_REMOVED] = is_removed;	615	dst->flag [FLAG_REMOVED] = true;
539		616
540	/* Copy over key_values, if any. */	617	/* Copy over key_values, if any. */
541	if (src.key_values)	618	if (key_values)
542	{	619	{
543	key_value *tail = 0;	620	key_value *tail = 0;
544	key_values = 0;	621	dst->key_values = 0;
545		622
546	for (key_value *i = src.key_values; i; i = i->next)	623	for (key_value *i = key_values; i; i = i->next)
547	{	624	{
548	key_value *new_link = new key_value;	625	key_value *new_link = new key_value;
549		626
550	new_link->next = 0;	627	new_link->next = 0;
551	new_link->key = i->key;	628	new_link->key = i->key;
552	new_link->value = i->value;	629	new_link->value = i->value;
553		630
554	/* Try and be clever here, too. */	631	/* Try and be clever here, too. */
555	if (!key_values)	632	if (!dst->key_values)
556	{	633	{
557	key_values = new_link;	634	dst->key_values = new_link;
558	tail = new_link;	635	tail = new_link;
559	}	636	}
560	else	637	else
561	{	638	{
562	tail->next = new_link;	639	tail->next = new_link;
563	tail = new_link;	640	tail = new_link;
564	}	641	}
565	}	642	}
566	}	643	}
567	}
568
569	/*
570	* copy_to first frees everything allocated by the dst object,
571	* and then copies the contents of itself into the second
572	* object, allocating what needs to be allocated. Basically, any
573	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
574	* if the first object is freed, the pointers in the new object
575	* will point at garbage.
576	*/
577	void
578	object::copy_to (object *dst)
579	{
580	*dst = *this;
581		644
582	if (speed < 0)	645	if (speed < 0)
583	dst->speed_left -= rndm ();	646	dst->speed_left -= rndm ();
584		647
585	dst->set_speed (dst->speed);	648	dst->set_speed (dst->speed);
…		…
587		650
588	void	651	void
589	object::instantiate ()	652	object::instantiate ()
590	{	653	{
591	if (!uuid.seq) // HACK	654	if (!uuid.seq) // HACK
592	uuid = gen_uuid ();	655	uuid = UUID::gen ();
593		656
594	speed_left = -0.1f;	657	speed_left = -0.1f;
595	/* 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
596	* 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.
597	* 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
…		…
607	object *	670	object *
608	object::clone ()	671	object::clone ()
609	{	672	{
610	object *neu = create ();	673	object *neu = create ();
611	copy_to (neu);	674	copy_to (neu);
		675	neu->map = map; // not copied by copy_to
612	return neu;	676	return neu;
613	}	677	}
614		678
615	/*	679	/*
616	* 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
…		…
667	* UP_OBJ_FACE: only the objects face has changed.	731	* UP_OBJ_FACE: only the objects face has changed.
668	*/	732	*/
669	void	733	void
670	update_object (object *op, int action)	734	update_object (object *op, int action)
671	{	735	{
672	if (op == NULL)	736	if (!op)
673	{	737	{
674	/* this should never happen */	738	/* this should never happen */
675	LOG (llevDebug, "update_object() called for NULL object.\n");	739	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
676	return;	740	return;
677	}	741	}
678		742
679	if (op->env)	743	if (!op->is_on_map ())
680	{	744	{
681	/* Animation is currently handled by client, so nothing	745	/* Animation is currently handled by client, so nothing
682	* to do in this case.	746	* to do in this case.
683	*/	747	*/
684	return;	748	return;
685	}	749	}
686
687	/* If the map is saving, don't do anything as everything is
688	* going to get freed anyways.
689	*/
690	if (!op->map || op->map->in_memory == MAP_SAVING)
691	return;
692		750
693	/* make sure the object is within map boundaries */	751	/* make sure the object is within map boundaries */
694	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)
695	{	753	{
696	LOG (llevError, "update_object() called for object out of map!\n");	754	LOG (llevError, "update_object() called for object out of map!\n");
…		…
756	static int object_count;	814	static int object_count;
757		815
758	void object::link ()	816	void object::link ()
759	{	817	{
760	assert (!index);//D	818	assert (!index);//D
761	uuid = gen_uuid ();	819	uuid = UUID::gen ();
762	count = ++object_count;	820	count = ++object_count;
763		821
764	refcnt_inc ();	822	refcnt_inc ();
765	objects.insert (this);	823	objects.insert (this);
766	}	824	}
…		…
839	object::destroy_inv (bool drop_to_ground)	897	object::destroy_inv (bool drop_to_ground)
840	{	898	{
841	// need to check first, because the checks below might segfault	899	// need to check first, because the checks below might segfault
842	// as we might be on an invalid mapspace and crossfire code	900	// as we might be on an invalid mapspace and crossfire code
843	// is too buggy to ensure that the inventory is empty.	901	// is too buggy to ensure that the inventory is empty.
844	// corollary: if you create arrows etc. with stuff in tis inventory,	902	// corollary: if you create arrows etc. with stuff in its inventory,
845	// cf will crash below with off-map x and y	903	// cf will crash below with off-map x and y
846	if (!inv)	904	if (!inv)
847	return;	905	return;
848		906
849	/* Only if the space blocks everything do we not process -	907	/* Only if the space blocks everything do we not process -
850	* if some form of movement is allowed, let objects	908	* if some form of movement is allowed, let objects
851	* drop on that space.	909	* drop on that space.
852	*/	910	*/
853	if (!drop_to_ground	911	if (!drop_to_ground
854	|| !map	912	|| !map
855	|| map->in_memory != MAP_IN_MEMORY	913	|| map->in_memory != MAP_ACTIVE
856	|| map->nodrop	914	|| map->no_drop
857	|| ms ().move_block == MOVE_ALL)	915	|| ms ().move_block == MOVE_ALL)
858	{	916	{
859	while (inv)	917	while (inv)
860	{	918	{
861	inv->destroy_inv (drop_to_ground);	919	inv->destroy_inv (false);
862	inv->destroy ();	920	inv->destroy ();
863	}	921	}
864	}	922	}
865	else	923	else
866	{ /* Put objects in inventory onto this space */	924	{ /* Put objects in inventory onto this space */
…		…
872	|| op->flag [FLAG_NO_DROP]	930	|| op->flag [FLAG_NO_DROP]
873	|| op->type == RUNE	931	|| op->type == RUNE
874	|| op->type == TRAP	932	|| op->type == TRAP
875	|| op->flag [FLAG_IS_A_TEMPLATE]	933	|| op->flag [FLAG_IS_A_TEMPLATE]
876	|| op->flag [FLAG_DESTROY_ON_DEATH])	934	|| op->flag [FLAG_DESTROY_ON_DEATH])
877	op->destroy ();	935	op->destroy (true);
878	else	936	else
879	map->insert (op, x, y);	937	map->insert (op, x, y);
880	}	938	}
881	}	939	}
882	}	940	}
…		…
886	object *op = new object;	944	object *op = new object;
887	op->link ();	945	op->link ();
888	return op;	946	return op;
889	}	947	}
890		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
891	void	970	void
892	object::do_destroy ()	971	object::do_destroy ()
893	{	972	{
894	attachable::do_destroy ();
895
896	if (flag [FLAG_IS_LINKED])	973	if (flag [FLAG_IS_LINKED])
897	remove_button_link (this);	974	remove_button_link (this);
898		975
899	if (flag [FLAG_FRIENDLY])	976	if (flag [FLAG_FRIENDLY])
900	remove_friendly_object (this);	977	remove_friendly_object (this);
901		978
902	if (!flag [FLAG_REMOVED])
903	remove ();	979	remove ();
904		980
905	destroy_inv (true);	981	attachable::do_destroy ();
906		982
907	deactivate ();	983	deactivate ();
908	unlink ();	984	unlink ();
909		985
910	flag [FLAG_FREED] = 1;	986	flag [FLAG_FREED] = 1;
911		987
912	// hack to ensure that freed objects still have a valid map	988	// hack to ensure that freed objects still have a valid map
913	{
914	static maptile *freed_map; // freed objects are moved here to avoid crashes
915
916	if (!freed_map)
917	{
918	freed_map = new maptile;
919
920	freed_map->path = "<freed objects map>";
921	freed_map->name = "/internal/freed_objects_map";
922	freed_map->width = 3;
923	freed_map->height = 3;
924
925	freed_map->alloc ();
926	freed_map->in_memory = MAP_IN_MEMORY;
927	}
928
929	map = freed_map;	989	map = &freed_map;
930	x = 1;	990	x = 1;
931	y = 1;	991	y = 1;
932	}
933		992
934	if (more)	993	if (more)
935	{	994	{
936	more->destroy ();	995	more->destroy ();
937	more = 0;	996	more = 0;
…		…
950	object::destroy (bool destroy_inventory)	1009	object::destroy (bool destroy_inventory)
951	{	1010	{
952	if (destroyed ())	1011	if (destroyed ())
953	return;	1012	return;
954		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
955	if (destroy_inventory)	1021	destroy_inv (!destroy_inventory);
956	destroy_inv (false);
957		1022
958	if (is_head ())	1023	if (is_head ())
959	if (sound_destroy)	1024	if (sound_destroy)
960	play_sound (sound_destroy);	1025	play_sound (sound_destroy);
961	else if (flag [FLAG_MONSTER])	1026	else if (flag [FLAG_MONSTER])
962	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
963		1028
964	attachable::destroy ();	1029	attachable::destroy ();
965	}
966
967	/*
968	* sub_weight() recursively (outwards) subtracts a number from the
969	* weight of an object (and what is carried by it's environment(s)).
970	*/
971	void
972	sub_weight (object *op, signed long weight)
973	{
974	while (op != NULL)
975	{
976	if (op->type == CONTAINER)
977	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
978
979	op->carrying -= weight;
980	op = op->env;
981	}
982	}	1030	}
983		1031
984	/* op->remove ():	1032	/* op->remove ():
985	* This function removes the object op from the linked list of objects	1033	* This function removes the object op from the linked list of objects
986	* which it is currently tied to. When this function is done, the	1034	* which it is currently tied to. When this function is done, the
…		…
992	object::do_remove ()	1040	object::do_remove ()
993	{	1041	{
994	object *tmp, *last = 0;	1042	object *tmp, *last = 0;
995	object *otmp;	1043	object *otmp;
996		1044
997	if (QUERY_FLAG (this, FLAG_REMOVED))	1045	if (flag [FLAG_REMOVED])
998	return;	1046	return;
999		1047
1000	SET_FLAG (this, FLAG_REMOVED);
1001	INVOKE_OBJECT (REMOVE, this);	1048	INVOKE_OBJECT (REMOVE, this);
		1049
		1050	flag [FLAG_REMOVED] = true;
1002		1051
1003	if (more)	1052	if (more)
1004	more->remove ();	1053	more->remove ();
1005		1054
1006	/*	1055	/*
1007	* In this case, the object to be removed is in someones	1056	* In this case, the object to be removed is in someones
1008	* inventory.	1057	* inventory.
1009	*/	1058	*/
1010	if (env)	1059	if (env)
1011	{	1060	{
1012	if (nrof)	1061	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1013	sub_weight (env, weight * nrof);	1062	if (object *pl = visible_to ())
1014	else	1063	esrv_del_item (pl->contr, count);
1015	sub_weight (env, weight + carrying);	1064	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1065
		1066	adjust_weight (env, -total_weight ());
		1067
		1068	/* we set up values so that it could be inserted into
		1069	* the map, but we don't actually do that - it is up
		1070	* to the caller to decide what we want to do.
		1071	*/
		1072	map = env->map;
		1073	x = env->x;
		1074	y = env->y;
		1075
		1076	// make sure cmov optimisation is applicable
		1077	*(above ? &above->below : &env->inv) = below;
		1078	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1079
		1080	above = 0;
		1081	below = 0;
		1082	env = 0;
1016		1083
1017	/* NO_FIX_PLAYER is set when a great many changes are being	1084	/* NO_FIX_PLAYER is set when a great many changes are being
1018	* made to players inventory. If set, avoiding the call	1085	* made to players inventory. If set, avoiding the call
1019	* to save cpu time.	1086	* to save cpu time.
1020	*/	1087	*/
1021	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1088	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1022	otmp->update_stats ();	1089	otmp->update_stats ();
1023
1024	if (above)
1025	above->below = below;
1026	else
1027	env->inv = below;
1028
1029	if (below)
1030	below->above = above;
1031
1032	/* we set up values so that it could be inserted into
1033	* the map, but we don't actually do that - it is up
1034	* to the caller to decide what we want to do.
1035	*/
1036	x = env->x, y = env->y;
1037	map = env->map;
1038	above = 0, below = 0;
1039	env = 0;
1040	}	1090	}
1041	else if (map)	1091	else if (map)
1042	{	1092	{
1043	if (type == PLAYER)
1044	{
1045	// leaving a spot always closes any open container on the ground
1046	if (container && !container->env)
1047	// this causes spurious floorbox updates, but it ensures
1048	// that the CLOSE event is being sent.
1049	close_container ();
1050
1051	--map->players;
1052	map->touch ();
1053	}
1054
1055	map->dirty = true;	1093	map->dirty = true;
1056	mapspace &ms = this->ms ();	1094	mapspace &ms = this->ms ();
1057		1095
		1096	if (object *pl = ms.player ())
		1097	{
		1098	if (type == PLAYER) // this == pl(!)
		1099	{
		1100	// leaving a spot always closes any open container on the ground
		1101	if (container && !container->env)
		1102	// this causes spurious floorbox updates, but it ensures
		1103	// that the CLOSE event is being sent.
		1104	close_container ();
		1105
		1106	--map->players;
		1107	map->touch ();
		1108	}
		1109	else if (pl->container == this)
		1110	{
		1111	// removing a container should close it
		1112	close_container ();
		1113	}
		1114
		1115	esrv_del_item (pl->contr, count);
		1116	}
		1117
1058	/* link the object above us */	1118	/* link the object above us */
1059	if (above)	1119	// re-link, make sure compiler can easily use cmove
1060	above->below = below;	1120	*(above ? &above->below : &ms.top) = below;
1061	else	1121	*(below ? &below->above : &ms.bot) = above;
1062	ms.top = below; /* we were top, set new top */
1063
1064	/* Relink the object below us, if there is one */
1065	if (below)
1066	below->above = above;
1067	else
1068	{
1069	/* Nothing below, which means we need to relink map object for this space
1070	* use translated coordinates in case some oddness with map tiling is
1071	* evident
1072	*/
1073	if (GET_MAP_OB (map, x, y) != this)
1074	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1075
1076	ms.bot = above; /* goes on above it. */
1077	}
1078		1122
1079	above = 0;	1123	above = 0;
1080	below = 0;	1124	below = 0;
1081		1125
1082	if (map->in_memory == MAP_SAVING)	1126	if (map->in_memory == MAP_SAVING)
…		…
1091	* removed (most likely destroyed), update the player view	1135	* removed (most likely destroyed), update the player view
1092	* appropriately.	1136	* appropriately.
1093	*/	1137	*/
1094	pl->close_container ();	1138	pl->close_container ();
1095		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)
1096	pl->contr->ns->floorbox_update ();	1144	pl->contr->ns->floorbox_update ();
1097	}	1145	}
1098		1146
1099	for (tmp = ms.bot; tmp; tmp = tmp->above)	1147	for (tmp = ms.bot; tmp; tmp = tmp->above)
1100	{	1148	{
1101	/* 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
…		…
1140	merge_ob (object *op, object *top)	1188	merge_ob (object *op, object *top)
1141	{	1189	{
1142	if (!op->nrof)	1190	if (!op->nrof)
1143	return 0;	1191	return 0;
1144		1192
1145	if (top)	1193	if (!top)
1146	for (top = op; top && top->above; top = top->above)	1194	for (top = op; top && top->above; top = top->above)
1147	;	1195	;
1148		1196
1149	for (; top; top = top->below)	1197	for (; top; top = top->below)
1150	{
1151	if (top == op)
1152	continue;
1153
1154	if (object::can_merge (op, top))	1198	if (object::can_merge (op, top))
1155	{	1199	{
1156	top->nrof += op->nrof;	1200	top->nrof += op->nrof;
1157		1201
1158	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1202	if (object *pl = top->visible_to ())
1159	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
1160	op->destroy ();	1208	op->destroy (1);
		1209
1161	return top;	1210	return top;
1162	}	1211	}
1163	}
1164		1212
1165	return 0;	1213	return 0;
1166	}	1214	}
1167		1215
1168	void	1216	void
…		…
1225	* just 'op' otherwise	1273	* just 'op' otherwise
1226	*/	1274	*/
1227	object *	1275	object *
1228	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1276	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1229	{	1277	{
1230	assert (!op->flag [FLAG_FREED]);
1231
1232	object *top, *floor = NULL;
1233
1234	op->remove ();	1278	op->remove ();
1235		1279
1236	/* Ideally, the caller figures this out. However, it complicates a lot	1280	/* Ideally, the caller figures this out. However, it complicates a lot
1237	* of areas of callers (eg, anything that uses find_free_spot would now	1281	* of areas of callers (eg, anything that uses find_free_spot would now
1238	* need extra work	1282	* need extra work
1239	*/	1283	*/
1240	if (!xy_normalise (m, op->x, op->y))	1284	if (!xy_normalise (m, op->x, op->y))
1241	{	1285	{
1242	op->destroy ();	1286	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1243	return 0;	1287	return 0;
1244	}	1288	}
1245		1289
1246	if (object *more = op->more)	1290	if (object *more = op->more)
1247	if (!insert_ob_in_map (more, m, originator, flag))	1291	if (!insert_ob_in_map (more, m, originator, flag))
…		…
1256	*/	1300	*/
1257	if (op->nrof && !(flag & INS_NO_MERGE))	1301	if (op->nrof && !(flag & INS_NO_MERGE))
1258	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1302	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1259	if (object::can_merge (op, tmp))	1303	if (object::can_merge (op, tmp))
1260	{	1304	{
		1305	// TODO: we actually want to update tmp, not op,
		1306	// but some caller surely breaks when we return tmp
		1307	// from here :/
1261	op->nrof += tmp->nrof;	1308	op->nrof += tmp->nrof;
1262	tmp->destroy ();	1309	tmp->destroy (1);
1263	}	1310	}
1264		1311
1265	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1312	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1266	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1313	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1267		1314
…		…
1274	{	1321	{
1275	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1322	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1276	abort ();	1323	abort ();
1277	}	1324	}
1278		1325
		1326	if (!originator->is_on_map ())
		1327	LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1328	op->debug_desc (), originator->debug_desc ());
		1329
1279	op->above = originator;	1330	op->above = originator;
1280	op->below = originator->below;	1331	op->below = originator->below;
1281
1282	if (op->below)
1283	op->below->above = op;
1284	else
1285	ms.bot = op;
1286
1287	/* since *below* originator, no need to update top */
1288	originator->below = op;	1332	originator->below = op;
		1333
		1334	*(op->below ? &op->below->above : &ms.bot) = op;
1289	}	1335	}
1290	else	1336	else
1291	{	1337	{
1292	top = ms.bot;	1338	object *floor = 0;
		1339	object *top = ms.top;
1293		1340
1294	/* If there are other objects, then */	1341	/* If there are other objects, then */
1295	if ((!(flag & INS_MAP_LOAD)) && top)	1342	if (top)
1296	{	1343	{
1297	object *last = 0;
1298
1299	/*	1344	/*
1300	* If there are multiple objects on this space, we do some trickier handling.	1345	* If there are multiple objects on this space, we do some trickier handling.
1301	* We've already dealt with merging if appropriate.	1346	* We've already dealt with merging if appropriate.
1302	* Generally, we want to put the new object on top. But if	1347	* Generally, we want to put the new object on top. But if
1303	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1348	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1306	* once we get to them. This reduces the need to traverse over all of	1351	* once we get to them. This reduces the need to traverse over all of
1307	* them when adding another one - this saves quite a bit of cpu time	1352	* them when adding another one - this saves quite a bit of cpu time
1308	* when lots of spells are cast in one area. Currently, it is presumed	1353	* when lots of spells are cast in one area. Currently, it is presumed
1309	* that flying non pickable objects are spell objects.	1354	* that flying non pickable objects are spell objects.
1310	*/	1355	*/
1311	for (top = ms.bot; top; top = top->above)	1356	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1312	{	1357	{
1313	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1358	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1314	floor = top;	1359	floor = tmp;
1315		1360
1316	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1361	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1317	{	1362	{
1318	/* We insert above top, so we want this object below this */	1363	/* We insert above top, so we want this object below this */
1319	top = top->below;	1364	top = tmp->below;
1320	break;	1365	break;
1321	}	1366	}
1322		1367
1323	last = top;	1368	top = tmp;
1324	}	1369	}
1325
1326	/* Don't want top to be NULL, so set it to the last valid object */
1327	top = last;
1328		1370
1329	/* We let update_position deal with figuring out what the space	1371	/* We let update_position deal with figuring out what the space
1330	* looks like instead of lots of conditions here.	1372	* looks like instead of lots of conditions here.
1331	* makes things faster, and effectively the same result.	1373	* makes things faster, and effectively the same result.
1332	*/	1374	*/
…		…
1339	*/	1381	*/
1340	if (!(flag & INS_ON_TOP)	1382	if (!(flag & INS_ON_TOP)
1341	&& ms.flags () & P_BLOCKSVIEW	1383	&& ms.flags () & P_BLOCKSVIEW
1342	&& (op->face && !faces [op->face].visibility))	1384	&& (op->face && !faces [op->face].visibility))
1343	{	1385	{
		1386	object *last;
		1387
1344	for (last = top; last != floor; last = last->below)	1388	for (last = top; last != floor; last = last->below)
1345	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1389	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1346	break;	1390	break;
1347		1391
1348	/* Check to see if we found the object that blocks view,	1392	/* Check to see if we found the object that blocks view,
…		…
1352	*/	1396	*/
1353	if (last && last->below && last != floor)	1397	if (last && last->below && last != floor)
1354	top = last->below;	1398	top = last->below;
1355	}	1399	}
1356	} /* If objects on this space */	1400	} /* If objects on this space */
1357	if (flag & INS_MAP_LOAD)
1358	top = ms.top;
1359		1401
1360	if (flag & INS_ABOVE_FLOOR_ONLY)	1402	if (flag & INS_ABOVE_FLOOR_ONLY)
1361	top = floor;	1403	top = floor;
1362		1404
1363	/* Top is the object that our object (op) is going to get inserted above.	1405	// insert object above top, or bottom-most if top = 0
1364	*/
1365
1366	/* First object on this space */
1367	if (!top)	1406	if (!top)
1368	{	1407	{
		1408	op->below = 0;
1369	op->above = ms.bot;	1409	op->above = ms.bot;
1370
1371	if (op->above)
1372	op->above->below = op;
1373
1374	op->below = 0;
1375	ms.bot = op;	1410	ms.bot = op;
		1411
		1412	*(op->above ? &op->above->below : &ms.top) = op;
1376	}	1413	}
1377	else	1414	else
1378	{ /* get inserted into the stack above top */	1415	{
1379	op->above = top->above;	1416	op->above = top->above;
1380
1381	if (op->above)
1382	op->above->below = op;	1417	top->above = op;
1383		1418
1384	op->below = top;	1419	op->below = top;
1385	top->above = op;	1420	*(op->above ? &op->above->below : &ms.top) = op;
1386	}	1421	}
1387		1422	}
1388	if (!op->above)
1389	ms.top = op;
1390	} /* else not INS_BELOW_ORIGINATOR */
1391		1423
1392	if (op->type == PLAYER)	1424	if (op->type == PLAYER)
1393	{	1425	{
1394	op->contr->do_los = 1;	1426	op->contr->do_los = 1;
1395	++op->map->players;	1427	++op->map->players;
1396	op->map->touch ();	1428	op->map->touch ();
1397	}	1429	}
1398		1430
1399	op->map->dirty = true;	1431	op->map->dirty = true;
1400		1432
1401	if (!(flag & INS_MAP_LOAD))
1402	if (object *pl = ms.player ())	1433	if (object *pl = ms.player ())
		1434	//TODO: the floorbox prev/next might need updating
		1435	//esrv_send_item (pl, op);
		1436	//TODO: update floorbox to preserve ordering
		1437	if (pl->contr->ns)
1403	pl->contr->ns->floorbox_update ();	1438	pl->contr->ns->floorbox_update ();
1404		1439
1405	/* If this object glows, it may affect lighting conditions that are	1440	/* If this object glows, it may affect lighting conditions that are
1406	* visible to others on this map. But update_all_los is really	1441	* visible to others on this map. But update_all_los is really
1407	* an inefficient way to do this, as it means los for all players	1442	* an inefficient way to do this, as it means los for all players
…		…
1450	* op is the object to insert it under: supplies x and the map.	1485	* op is the object to insert it under: supplies x and the map.
1451	*/	1486	*/
1452	void	1487	void
1453	replace_insert_ob_in_map (const char *arch_string, object *op)	1488	replace_insert_ob_in_map (const char *arch_string, object *op)
1454	{	1489	{
1455	object *tmp, *tmp1;
1456
1457	/* first search for itself and remove any old instances */	1490	/* first search for itself and remove any old instances */
1458		1491
1459	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1492	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1460	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1493	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1461	tmp->destroy ();	1494	tmp->destroy (1);
1462		1495
1463	tmp1 = arch_to_object (archetype::find (arch_string));	1496	object *tmp = arch_to_object (archetype::find (arch_string));
1464		1497
1465	tmp1->x = op->x;	1498	tmp->x = op->x;
1466	tmp1->y = op->y;	1499	tmp->y = op->y;
		1500
1467	insert_ob_in_map (tmp1, op->map, op, 0);	1501	insert_ob_in_map (tmp, op->map, op, 0);
1468	}	1502	}
1469		1503
1470	object *	1504	object *
1471	object::insert_at (object *where, object *originator, int flags)	1505	object::insert_at (object *where, object *originator, int flags)
1472	{	1506	{
		1507	if (where->env)
		1508	return where->env->insert (this);
		1509	else
1473	return where->map->insert (this, where->x, where->y, originator, flags);	1510	return where->map->insert (this, where->x, where->y, originator, flags);
1474	}	1511	}
1475		1512
1476	/*	1513	/*
1477	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1478	* is returned contains nr objects, and the remaining parts contains
1479	* the rest (or is removed and freed if that number is 0).
1480	* On failure, NULL is returned, and the reason put into the
1481	* global static errmsg array.
1482	*/
1483	object *
1484	get_split_ob (object *orig_ob, uint32 nr)
1485	{
1486	object *newob;
1487	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1488
1489	if (orig_ob->nrof < nr)
1490	{
1491	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1492	return NULL;
1493	}
1494
1495	newob = object_create_clone (orig_ob);
1496
1497	if ((orig_ob->nrof -= nr) < 1)
1498	orig_ob->destroy (1);
1499	else if (!is_removed)
1500	{
1501	if (orig_ob->env != NULL)
1502	sub_weight (orig_ob->env, orig_ob->weight * nr);
1503	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1504	{
1505	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1506	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1507	return NULL;
1508	}
1509	}
1510
1511	newob->nrof = nr;
1512
1513	return newob;
1514	}
1515
1516	/*
1517	* decrease_ob_nr(object, number) decreases a specified number from	1514	* decrease(object, number) decreases a specified number from
1518	* the amount of an object. If the amount reaches 0, the object	1515	* the amount of an object. If the amount reaches 0, the object
1519	* is subsequently removed and freed.	1516	* is subsequently removed and freed.
1520	*	1517	*
1521	* Return value: 'op' if something is left, NULL if the amount reached 0	1518	* Return value: 'op' if something is left, NULL if the amount reached 0
1522	*/	1519	*/
		1520	bool
		1521	object::decrease (sint32 nr)
		1522	{
		1523	if (!nr)
		1524	return true;
		1525
		1526	nr = min (nr, nrof);
		1527
		1528	nrof -= nr;
		1529
		1530	if (nrof)
		1531	{
		1532	adjust_weight (env, -weight * nr); // carrying == 0
		1533
		1534	if (object *pl = visible_to ())
		1535	esrv_update_item (UPD_NROF, pl, this);
		1536
		1537	return true;
		1538	}
		1539	else
		1540	{
		1541	destroy (1);
		1542	return false;
		1543	}
		1544	}
		1545
		1546	/*
		1547	* split(ob,nr) splits up ob into two parts. The part which
		1548	* is returned contains nr objects, and the remaining parts contains
		1549	* the rest (or is removed and returned if that number is 0).
		1550	* On failure, NULL is returned.
		1551	*/
1523	object *	1552	object *
1524	decrease_ob_nr (object *op, uint32 i)	1553	object::split (sint32 nr)
1525	{	1554	{
1526	object *tmp;	1555	int have = number_of ();
1527		1556
1528	if (i == 0) /* objects with op->nrof require this check */	1557	if (have < nr)
1529	return op;	1558	return 0;
1530		1559	else if (have == nr)
1531	if (i > op->nrof)
1532	i = op->nrof;
1533
1534	if (QUERY_FLAG (op, FLAG_REMOVED))
1535	op->nrof -= i;
1536	else if (op->env)
1537	{	1560	{
1538	/* is this object in the players inventory, or sub container
1539	* therein?
1540	*/
1541	tmp = op->in_player ();
1542	/* nope. Is this a container the player has opened?
1543	* If so, set tmp to that player.
1544	* IMO, searching through all the players will mostly
1545	* likely be quicker than following op->env to the map,
1546	* and then searching the map for a player.
1547	*/
1548	if (!tmp)
1549	for_all_players (pl)
1550	if (pl->ob->container == op->env)
1551	{
1552	tmp = pl->ob;
1553	break;
1554	}
1555
1556	if (i < op->nrof)
1557	{
1558	sub_weight (op->env, op->weight * i);
1559	op->nrof -= i;
1560	if (tmp)
1561	esrv_send_item (tmp, op);
1562	}
1563	else
1564	{
1565	op->remove ();	1561	remove ();
1566	op->nrof = 0;	1562	return this;
1567	if (tmp)
1568	esrv_del_item (tmp->contr, op->count);
1569	}
1570	}	1563	}
1571	else	1564	else
1572	{	1565	{
1573	object *above = op->above;	1566	decrease (nr);
1574		1567
1575	if (i < op->nrof)	1568	object *op = deep_clone ();
1576	op->nrof -= i;	1569	op->nrof = nr;
1577	else
1578	{
1579	op->remove ();
1580	op->nrof = 0;
1581	}
1582
1583	/* Since we just removed op, op->above is null */
1584	for (tmp = above; tmp; tmp = tmp->above)
1585	if (tmp->type == PLAYER)
1586	{
1587	if (op->nrof)
1588	esrv_send_item (tmp, op);
1589	else
1590	esrv_del_item (tmp->contr, op->count);
1591	}
1592	}
1593
1594	if (op->nrof)
1595	return op;	1570	return op;
1596	else
1597	{
1598	op->destroy ();
1599	return 0;
1600	}
1601	}
1602
1603	/*
1604	* add_weight(object, weight) adds the specified weight to an object,
1605	* and also updates how much the environment(s) is/are carrying.
1606	*/
1607	void
1608	add_weight (object *op, signed long weight)
1609	{
1610	while (op != NULL)
1611	{
1612	if (op->type == CONTAINER)
1613	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1614
1615	op->carrying += weight;
1616	op = op->env;
1617	}	1571	}
1618	}	1572	}
1619		1573
1620	object *	1574	object *
1621	insert_ob_in_ob (object *op, object *where)	1575	insert_ob_in_ob (object *op, object *where)
…		…
1646	* be != op, if items are merged. -Tero	1600	* be != op, if items are merged. -Tero
1647	*/	1601	*/
1648	object *	1602	object *
1649	object::insert (object *op)	1603	object::insert (object *op)
1650	{	1604	{
1651	if (!QUERY_FLAG (op, FLAG_REMOVED))
1652	op->remove ();
1653
1654	if (op->more)	1605	if (op->more)
1655	{	1606	{
1656	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1607	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1657	return op;	1608	return op;
1658	}	1609	}
1659		1610
1660	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1611	op->remove ();
1661	CLEAR_FLAG (op, FLAG_REMOVED);	1612
		1613	op->flag [FLAG_OBJ_ORIGINAL] = 0;
1662		1614
1663	if (op->nrof)	1615	if (op->nrof)
1664	{
1665	for (object *tmp = inv; tmp; tmp = tmp->below)	1616	for (object *tmp = inv; tmp; tmp = tmp->below)
1666	if (object::can_merge (tmp, op))	1617	if (object::can_merge (tmp, op))
1667	{	1618	{
1668	/* return the original object and remove inserted object	1619	/* return the original object and remove inserted object
1669	(client needs the original object) */	1620	(client needs the original object) */
1670	tmp->nrof += op->nrof;	1621	tmp->nrof += op->nrof;
1671	/* Weight handling gets pretty funky. Since we are adding to	1622
1672	* tmp->nrof, we need to increase the weight.	1623	if (object *pl = tmp->visible_to ())
1673	*/	1624	esrv_update_item (UPD_NROF, pl, tmp);
		1625
1674	add_weight (this, op->weight * op->nrof);	1626	adjust_weight (this, op->total_weight ());
1675	SET_FLAG (op, FLAG_REMOVED);	1627
1676	op->destroy (); /* free the inserted object */	1628	op->destroy (1);
1677	op = tmp;	1629	op = tmp;
1678	op->remove (); /* and fix old object's links */	1630	goto inserted;
1679	CLEAR_FLAG (op, FLAG_REMOVED);
1680	break;
1681	}	1631	}
1682		1632
1683	/* I assume combined objects have no inventory
1684	* We add the weight - this object could have just been removed
1685	* (if it was possible to merge). calling remove_ob will subtract
1686	* the weight, so we need to add it in again, since we actually do
1687	* the linking below
1688	*/
1689	add_weight (this, op->weight * op->nrof);
1690	}
1691	else
1692	add_weight (this, (op->weight + op->carrying));
1693
1694	if (object *otmp = this->in_player ())
1695	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1696	otmp->update_stats ();
1697
1698	op->owner = 0; // its his/hers now. period.	1633	op->owner = 0; // it's his/hers now. period.
1699	op->map = 0;	1634	op->map = 0;
		1635	op->x = 0;
		1636	op->y = 0;
		1637
		1638	op->above = 0;
		1639	op->below = inv;
1700	op->env = this;	1640	op->env = this;
1701	op->above = 0;
1702	op->below = 0;
1703	op->x = op->y = 0;
1704		1641
		1642	if (inv)
		1643	inv->above = op;
		1644
		1645	inv = op;
		1646
		1647	op->flag [FLAG_REMOVED] = 0;
		1648
		1649	if (object *pl = op->visible_to ())
		1650	esrv_send_item (pl, op);
		1651
		1652	adjust_weight (this, op->total_weight ());
		1653
		1654	inserted:
1705	/* reset the light list and los of the players on the map */	1655	/* reset the light list and los of the players on the map */
1706	if (op->glow_radius && map)	1656	if (op->glow_radius && map && map->darkness)
1707	{
1708	#ifdef DEBUG_LIGHTS
1709	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1710	#endif /* DEBUG_LIGHTS */
1711	if (map->darkness)
1712	update_all_los (map, x, y);	1657	update_all_los (map, x, y);
1713	}
1714		1658
1715	/* Client has no idea of ordering so lets not bother ordering it here.	1659	// if this is a player's inventory, update stats
1716	* It sure simplifies this function...	1660	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1717	*/	1661	update_stats ();
1718	if (!inv)
1719	inv = op;
1720	else
1721	{
1722	op->below = inv;
1723	op->below->above = op;
1724	inv = op;
1725	}
1726		1662
1727	INVOKE_OBJECT (INSERT, this);	1663	INVOKE_OBJECT (INSERT, this);
1728		1664
1729	return op;	1665	return op;
1730	}	1666	}
…		…
1858	LOG (llevError, "Present_arch called outside map.\n");	1794	LOG (llevError, "Present_arch called outside map.\n");
1859	return NULL;	1795	return NULL;
1860	}	1796	}
1861		1797
1862	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1798	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1863	if (tmp->arch == at)	1799	if (tmp->arch->archname == at->archname)
1864	return tmp;	1800	return tmp;
1865		1801
1866	return NULL;	1802	return NULL;
1867	}	1803	}
1868		1804
…		…
1932	* The first matching object is returned, or NULL if none.	1868	* The first matching object is returned, or NULL if none.
1933	*/	1869	*/
1934	object *	1870	object *
1935	present_arch_in_ob (const archetype *at, const object *op)	1871	present_arch_in_ob (const archetype *at, const object *op)
1936	{	1872	{
1937	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1873	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1938	if (tmp->arch == at)	1874	if (tmp->arch->archname == at->archname)
1939	return tmp;	1875	return tmp;
1940		1876
1941	return NULL;	1877	return NULL;
1942	}	1878	}
1943		1879
…		…
1945	* activate recursively a flag on an object inventory	1881	* activate recursively a flag on an object inventory
1946	*/	1882	*/
1947	void	1883	void
1948	flag_inv (object *op, int flag)	1884	flag_inv (object *op, int flag)
1949	{	1885	{
1950	if (op->inv)
1951	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1886	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1952	{	1887	{
1953	SET_FLAG (tmp, flag);	1888	SET_FLAG (tmp, flag);
1954	flag_inv (tmp, flag);	1889	flag_inv (tmp, flag);
1955	}	1890	}
1956	}	1891	}
1957		1892
1958	/*	1893	/*
1959	* deactivate recursively a flag on an object inventory	1894	* deactivate recursively a flag on an object inventory
1960	*/	1895	*/
1961	void	1896	void
1962	unflag_inv (object *op, int flag)	1897	unflag_inv (object *op, int flag)
1963	{	1898	{
1964	if (op->inv)
1965	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1899	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1966	{	1900	{
1967	CLEAR_FLAG (tmp, flag);	1901	CLEAR_FLAG (tmp, flag);
1968	unflag_inv (tmp, flag);	1902	unflag_inv (tmp, flag);
1969	}	1903	}
1970	}	1904	}
1971		1905
1972	/*	1906	/*
1973	* find_free_spot(object, map, x, y, start, stop) will search for	1907	* find_free_spot(object, map, x, y, start, stop) will search for
1974	* a spot at the given map and coordinates which will be able to contain	1908	* a spot at the given map and coordinates which will be able to contain
…		…
1976	* to search (see the freearr_x/y[] definition).	1910	* to search (see the freearr_x/y[] definition).
1977	* It returns a random choice among the alternatives found.	1911	* It returns a random choice among the alternatives found.
1978	* start and stop are where to start relative to the free_arr array (1,9	1912	* start and stop are where to start relative to the free_arr array (1,9
1979	* does all 4 immediate directions). This returns the index into the	1913	* does all 4 immediate directions). This returns the index into the
1980	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1914	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1981	* Note - this only checks to see if there is space for the head of the
1982	* object - if it is a multispace object, this should be called for all
1983	* pieces.
1984	* Note2: This function does correctly handle tiled maps, but does not	1915	* Note: This function does correctly handle tiled maps, but does not
1985	* inform the caller. However, insert_ob_in_map will update as	1916	* inform the caller. However, insert_ob_in_map will update as
1986	* necessary, so the caller shouldn't need to do any special work.	1917	* necessary, so the caller shouldn't need to do any special work.
1987	* Note - updated to take an object instead of archetype - this is necessary	1918	* Note - updated to take an object instead of archetype - this is necessary
1988	* because arch_blocked (now ob_blocked) needs to know the movement type	1919	* because arch_blocked (now ob_blocked) needs to know the movement type
1989	* to know if the space in question will block the object. We can't use	1920	* to know if the space in question will block the object. We can't use
…		…
2010		1941
2011	/* However, often	1942	/* However, often
2012	* ob doesn't have any move type (when used to place exits)	1943	* ob doesn't have any move type (when used to place exits)
2013	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.	1944	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
2014	*/	1945	*/
2015	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	1946	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
2016	{	1947	{
2017	altern [index++] = i;	1948	altern [index++] = i;
2018	continue;	1949	continue;
2019	}	1950	}
2020		1951
…		…
2034		1965
2035	/* Note it is intentional that we check ob - the movement type of the	1966	/* Note it is intentional that we check ob - the movement type of the
2036	* head of the object should correspond for the entire object.	1967	* head of the object should correspond for the entire object.
2037	*/	1968	*/
2038	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	1969	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1970	continue;
		1971
		1972	if (ob->blocked (m, pos.x, pos.y))
2039	continue;	1973	continue;
2040		1974
2041	altern [index++] = i;	1975	altern [index++] = i;
2042	}	1976	}
2043		1977
…		…
2354		2288
2355	/*	2289	/*
2356	* create clone from object to another	2290	* create clone from object to another
2357	*/	2291	*/
2358	object *	2292	object *
2359	object_create_clone (object *asrc)	2293	object::deep_clone ()
2360	{	2294	{
2361	object *dst = 0, *tmp, *src, *prev, *item;	2295	assert (("deep_clone called on non-head object", is_head ()));
2362		2296
2363	if (!asrc)	2297	object *dst = clone ();
2364	return 0;
2365		2298
2366	src = asrc->head_ ();	2299	object *prev = dst;
2367
2368	prev = 0;
2369	for (object *part = src; part; part = part->more)	2300	for (object *part = this->more; part; part = part->more)
2370	{	2301	{
2371	tmp = part->clone ();	2302	object *tmp = part->clone ();
2372	tmp->x -= src->x;
2373	tmp->y -= src->y;
2374
2375	if (!part->head)
2376	{
2377	dst = tmp;
2378	tmp->head = 0;
2379	}
2380	else
2381	tmp->head = dst;	2303	tmp->head = dst;
2382
2383	tmp->more = 0;
2384
2385	if (prev)
2386	prev->more = tmp;	2304	prev->more = tmp;
2387
2388	prev = tmp;	2305	prev = tmp;
2389	}	2306	}
2390		2307
2391	for (item = src->inv; item; item = item->below)	2308	for (object *item = inv; item; item = item->below)
2392	insert_ob_in_ob (object_create_clone (item), dst);	2309	insert_ob_in_ob (item->deep_clone (), dst);
2393		2310
2394	return dst;	2311	return dst;
2395	}	2312	}
2396		2313
2397	/* This returns the first object in who's inventory that	2314	/* This returns the first object in who's inventory that
…		…
2406	return tmp;	2323	return tmp;
2407		2324
2408	return 0;	2325	return 0;
2409	}	2326	}
2410		2327
2411	/* If ob has a field named key, return the link from the list,	2328	const shstr &
2412	* otherwise return NULL.	2329	object::kv_get (const shstr &key) const
2413	*
2414	* key must be a passed in shared string - otherwise, this won't
2415	* do the desired thing.
2416	*/
2417	key_value *
2418	get_ob_key_link (const object *ob, const char *key)
2419	{	2330	{
2420	for (key_value *link = ob->key_values; link; link = link->next)	2331	for (key_value *kv = key_values; kv; kv = kv->next)
2421	if (link->key == key)	2332	if (kv->key == key)
2422	return link;
2423
2424	return 0;
2425	}
2426
2427	/*
2428	* Returns the value of op has an extra_field for key, or NULL.
2429	*
2430	* The argument doesn't need to be a shared string.
2431	*
2432	* The returned string is shared.
2433	*/
2434	const char *
2435	get_ob_key_value (const object *op, const char *const key)
2436	{
2437	key_value *link;
2438	shstr_cmp canonical_key (key);
2439
2440	if (!canonical_key)
2441	{
2442	/* 1. There being a field named key on any object
2443	* implies there'd be a shared string to find.
2444	* 2. Since there isn't, no object has this field.
2445	* 3. Therefore, *this* object doesn't have this field.
2446	*/
2447	return 0;
2448	}
2449
2450	/* This is copied from get_ob_key_link() above -
2451	* only 4 lines, and saves the function call overhead.
2452	*/
2453	for (link = op->key_values; link; link = link->next)
2454	if (link->key == canonical_key)
2455	return link->value;	2333	return kv->value;
2456		2334
2457	return 0;	2335	return shstr_null;
2458	}	2336	}
2459		2337
2460	/*	2338	void
2461	* Updates the canonical_key in op to value.	2339	object::kv_set (const shstr &key, const shstr &value)
2462	*
2463	* canonical_key is a shared string (value doesn't have to be).
2464	*
2465	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2466	* keys.
2467	*
2468	* Returns TRUE on success.
2469	*/
2470	int
2471	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2472	{	2340	{
2473	key_value *field = NULL, *last = NULL;	2341	for (key_value *kv = key_values; kv; kv = kv->next)
2474		2342	if (kv->key == key)
2475	for (field = op->key_values; field != NULL; field = field->next)
2476	{
2477	if (field->key != canonical_key)
2478	{	2343	{
2479	last = field;	2344	kv->value = value;
2480	continue;	2345	return;
2481	}	2346	}
2482		2347
2483	if (value)	2348	key_value *kv = new key_value;
2484	field->value = value;	2349
2485	else	2350	kv->next = key_values;
		2351	kv->key = key;
		2352	kv->value = value;
		2353
		2354	key_values = kv;
		2355	}
		2356
		2357	void
		2358	object::kv_del (const shstr &key)
		2359	{
		2360	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2361	if ((*kvp)->key == key)
2486	{	2362	{
2487	/* Basically, if the archetype has this key set,	2363	key_value *kv = *kvp;
2488	* we need to store the null value so when we save	2364	*kvp = (*kvp)->next;
2489	* it, we save the empty value so that when we load,	2365	delete kv;
2490	* we get this value back again.	2366	return;
2491	*/
2492	if (get_ob_key_link (op->arch, canonical_key))
2493	field->value = 0;
2494	else
2495	{
2496	if (last)
2497	last->next = field->next;
2498	else
2499	op->key_values = field->next;
2500
2501	delete field;
2502	}
2503	}	2367	}
2504	return TRUE;
2505	}
2506	/* IF we get here, key doesn't exist */
2507
2508	/* No field, we'll have to add it. */
2509
2510	if (!add_key)
2511	return FALSE;
2512
2513	/* There isn't any good reason to store a null
2514	* value in the key/value list. If the archetype has
2515	* this key, then we should also have it, so shouldn't
2516	* be here. If user wants to store empty strings,
2517	* should pass in ""
2518	*/
2519	if (value == NULL)
2520	return TRUE;
2521
2522	field = new key_value;
2523
2524	field->key = canonical_key;
2525	field->value = value;
2526	/* Usual prepend-addition. */
2527	field->next = op->key_values;
2528	op->key_values = field;
2529
2530	return TRUE;
2531	}
2532
2533	/*
2534	* Updates the key in op to value.
2535	*
2536	* If add_key is FALSE, this will only update existing keys,
2537	* and not add new ones.
2538	* In general, should be little reason FALSE is ever passed in for add_key
2539	*
2540	* Returns TRUE on success.
2541	*/
2542	int
2543	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2544	{
2545	shstr key_ (key);
2546
2547	return set_ob_key_value_s (op, key_, value, add_key);
2548	}	2368	}
2549		2369
2550	object::depth_iterator::depth_iterator (object *container)	2370	object::depth_iterator::depth_iterator (object *container)
2551	: iterator_base (container)	2371	: iterator_base (container)
2552	{	2372	{
…		…
2602	{	2422	{
2603	char flagdesc[512];	2423	char flagdesc[512];
2604	char info2[256 * 4];	2424	char info2[256 * 4];
2605	char *p = info;	2425	char *p = info;
2606		2426
2607	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2427	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2608	count, uuid.seq,	2428	count,
		2429	uuid.c_str (),
2609	&name,	2430	&name,
2610	title ? "\",title:\"" : "",	2431	title ? ",title:\"" : "",
2611	title ? (const char *)title : "",	2432	title ? (const char *)title : "",
		2433	title ? "\"" : "",
2612	flag_desc (flagdesc, 512), type);	2434	flag_desc (flagdesc, 512), type);
2613		2435
2614	if (!this->flag[FLAG_REMOVED] && env)	2436	if (!flag[FLAG_REMOVED] && env)
2615	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2437	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2616		2438
2617	if (map)	2439	if (map)
2618	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2440	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2619		2441
…		…
2649	object::open_container (object *new_container)	2471	object::open_container (object *new_container)
2650	{	2472	{
2651	if (container == new_container)	2473	if (container == new_container)
2652	return;	2474	return;
2653		2475
2654	if (object *old_container = container)	2476	object *old_container = container;
		2477
		2478	if (old_container)
2655	{	2479	{
2656	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2480	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2657	return;	2481	return;
2658		2482
2659	#if 0	2483	#if 0
…		…
2661	if (object *closer = old_container->inv)	2485	if (object *closer = old_container->inv)
2662	if (closer->type == CLOSE_CON)	2486	if (closer->type == CLOSE_CON)
2663	closer->destroy ();	2487	closer->destroy ();
2664	#endif	2488	#endif
2665		2489
		2490	// make sure the container is available
		2491	esrv_send_item (this, old_container);
		2492
2666	old_container->flag [FLAG_APPLIED] = 0;	2493	old_container->flag [FLAG_APPLIED] = false;
2667	container = 0;	2494	container = 0;
2668		2495
		2496	// client needs item update to make it work, client bug requires this to be separate
2669	esrv_update_item (UPD_FLAGS, this, old_container);	2497	esrv_update_item (UPD_FLAGS, this, old_container);
		2498
2670	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2499	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2671	play_sound (sound_find ("chest_close"));	2500	play_sound (sound_find ("chest_close"));
2672	}	2501	}
2673		2502
2674	if (new_container)	2503	if (new_container)
…		…
2687	}	2516	}
2688	#endif	2517	#endif
2689		2518
2690	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2519	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2691		2520
		2521	// make sure the container is available, client bug requires this to be separate
		2522	esrv_send_item (this, new_container);
		2523
2692	new_container->flag [FLAG_APPLIED] = 1;	2524	new_container->flag [FLAG_APPLIED] = true;
2693	container = new_container;	2525	container = new_container;
2694		2526
		2527	// client needs flag change
2695	esrv_update_item (UPD_FLAGS, this, new_container);	2528	esrv_update_item (UPD_FLAGS, this, new_container);
2696	esrv_send_inventory (this, new_container);	2529	esrv_send_inventory (this, new_container);
2697	play_sound (sound_find ("chest_open"));	2530	play_sound (sound_find ("chest_open"));
2698	}	2531	}
		2532	// else if (!old_container->env && contr && contr->ns)
		2533	// contr->ns->floorbox_reset ();
2699	}	2534	}
2700		2535
2701	object *	2536	object *
2702	object::force_find (const shstr name)	2537	object::force_find (const shstr name)
2703	{	2538	{
…		…
2729		2564
2730	insert (force);	2565	insert (force);
2731	}	2566	}
2732		2567
2733	void	2568	void
2734	object::play_sound (faceidx sound) const	2569	object::play_sound (faceidx sound)
2735	{	2570	{
2736	if (!sound)	2571	if (!sound)
2737	return;	2572	return;
2738		2573
2739	if (flag [FLAG_REMOVED])	2574	if (flag [FLAG_REMOVED])

Diff Legend

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