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

Diff Legend

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