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.168 by root, Thu Jul 26 00:27:07 2007 UTC vs.
Revision 1.234 by root, Tue May 6 18:47:52 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)
…		…
420	break;	487	break;
421		488
422	return op;	489	return op;
423	}	490	}
424		491
425	void
426	free_all_object_data ()
427	{
428	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
429	}
430
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.
		495	* ACTUALLY NO! investigate! TODO
434	*/	496	*/
435	void	497	void
436	object::set_owner (object *owner)	498	object::set_owner (object *owner)
437	{	499	{
		500	// allow objects which own objects
438	if (!owner)	501	if (owner)
439	return;
440
441	/* next line added to allow objects which own objects */
442	/* Add a check for ownercounts in here, as I got into an endless loop
443	* with the fireball owning a poison cloud which then owned the
444	* fireball. I believe that was caused by one of the objects getting
445	* freed and then another object replacing it. Since the ownercounts
446	* didn't match, this check is valid and I believe that cause is valid.
447	*/
448	while (owner->owner)	502	while (owner->owner)
449	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	}
450		510
451	this->owner = owner;	511	this->owner = owner;
452	}	512	}
453		513
454	int	514	int
…		…
532	}	592	}
533		593
534	op->key_values = 0;	594	op->key_values = 0;
535	}	595	}
536		596
537	object &	597	/*
538	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)
539	{	607	{
540	bool is_freed = flag [FLAG_FREED];	608	dst->remove ();
541	bool is_removed = flag [FLAG_REMOVED];
542
543	*(object_copy *)this = src;	609	*(object_copy *)dst = *this;
544
545	flag [FLAG_FREED] = is_freed;
546	flag [FLAG_REMOVED] = is_removed;	610	dst->flag [FLAG_REMOVED] = true;
547		611
548	/* Copy over key_values, if any. */	612	/* Copy over key_values, if any. */
549	if (src.key_values)	613	if (key_values)
550	{	614	{
551	key_value *tail = 0;	615	key_value *tail = 0;
552	key_values = 0;	616	dst->key_values = 0;
553		617
554	for (key_value *i = src.key_values; i; i = i->next)	618	for (key_value *i = key_values; i; i = i->next)
555	{	619	{
556	key_value *new_link = new key_value;	620	key_value *new_link = new key_value;
557		621
558	new_link->next = 0;	622	new_link->next = 0;
559	new_link->key = i->key;	623	new_link->key = i->key;
560	new_link->value = i->value;	624	new_link->value = i->value;
561		625
562	/* Try and be clever here, too. */	626	/* Try and be clever here, too. */
563	if (!key_values)	627	if (!dst->key_values)
564	{	628	{
565	key_values = new_link;	629	dst->key_values = new_link;
566	tail = new_link;	630	tail = new_link;
567	}	631	}
568	else	632	else
569	{	633	{
570	tail->next = new_link;	634	tail->next = new_link;
571	tail = new_link;	635	tail = new_link;
572	}	636	}
573	}	637	}
574	}	638	}
575	}
576
577	/*
578	* copy_to first frees everything allocated by the dst object,
579	* and then copies the contents of itself into the second
580	* object, allocating what needs to be allocated. Basically, any
581	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
582	* if the first object is freed, the pointers in the new object
583	* will point at garbage.
584	*/
585	void
586	object::copy_to (object *dst)
587	{
588	*dst = *this;
589		639
590	if (speed < 0)	640	if (speed < 0)
591	dst->speed_left = speed_left - rndm ();	641	dst->speed_left -= rndm ();
592		642
593	dst->set_speed (dst->speed);	643	dst->set_speed (dst->speed);
594	}	644	}
595		645
596	void	646	void
597	object::instantiate ()	647	object::instantiate ()
598	{	648	{
599	if (!uuid.seq) // HACK	649	if (!uuid.seq) // HACK
600	uuid = gen_uuid ();	650	uuid = UUID::gen ();
601		651
602	speed_left = -0.1f;	652	speed_left = -0.1f;
603	/* 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
604	* 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.
605	* 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
…		…
615	object *	665	object *
616	object::clone ()	666	object::clone ()
617	{	667	{
618	object *neu = create ();	668	object *neu = create ();
619	copy_to (neu);	669	copy_to (neu);
		670	neu->map = map; // not copied by copy_to
620	return neu;	671	return neu;
621	}	672	}
622		673
623	/*	674	/*
624	* 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
…		…
675	* UP_OBJ_FACE: only the objects face has changed.	726	* UP_OBJ_FACE: only the objects face has changed.
676	*/	727	*/
677	void	728	void
678	update_object (object *op, int action)	729	update_object (object *op, int action)
679	{	730	{
680	if (op == NULL)	731	if (!op)
681	{	732	{
682	/* this should never happen */	733	/* this should never happen */
683	LOG (llevDebug, "update_object() called for NULL object.\n");	734	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
684	return;	735	return;
685	}	736	}
686		737
687	if (op->env)	738	if (!op->is_on_map ())
688	{	739	{
689	/* Animation is currently handled by client, so nothing	740	/* Animation is currently handled by client, so nothing
690	* to do in this case.	741	* to do in this case.
691	*/	742	*/
692	return;	743	return;
693	}	744	}
694
695	/* If the map is saving, don't do anything as everything is
696	* going to get freed anyways.
697	*/
698	if (!op->map || op->map->in_memory == MAP_SAVING)
699	return;
700		745
701	/* make sure the object is within map boundaries */	746	/* make sure the object is within map boundaries */
702	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)	747	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
703	{	748	{
704	LOG (llevError, "update_object() called for object out of map!\n");	749	LOG (llevError, "update_object() called for object out of map!\n");
…		…
764	static int object_count;	809	static int object_count;
765		810
766	void object::link ()	811	void object::link ()
767	{	812	{
768	assert (!index);//D	813	assert (!index);//D
769	uuid = gen_uuid ();	814	uuid = UUID::gen ();
770	count = ++object_count;	815	count = ++object_count;
771		816
772	refcnt_inc ();	817	refcnt_inc ();
773	objects.insert (this);	818	objects.insert (this);
774	}	819	}
…		…
847	object::destroy_inv (bool drop_to_ground)	892	object::destroy_inv (bool drop_to_ground)
848	{	893	{
849	// need to check first, because the checks below might segfault	894	// need to check first, because the checks below might segfault
850	// as we might be on an invalid mapspace and crossfire code	895	// as we might be on an invalid mapspace and crossfire code
851	// is too buggy to ensure that the inventory is empty.	896	// is too buggy to ensure that the inventory is empty.
852	// corollary: if you create arrows etc. with stuff in tis inventory,	897	// corollary: if you create arrows etc. with stuff in its inventory,
853	// cf will crash below with off-map x and y	898	// cf will crash below with off-map x and y
854	if (!inv)	899	if (!inv)
855	return;	900	return;
856		901
857	/* Only if the space blocks everything do we not process -	902	/* Only if the space blocks everything do we not process -
858	* if some form of movement is allowed, let objects	903	* if some form of movement is allowed, let objects
859	* drop on that space.	904	* drop on that space.
860	*/	905	*/
861	if (!drop_to_ground	906	if (!drop_to_ground
862	|| !map	907	|| !map
863	|| map->in_memory != MAP_IN_MEMORY	908	|| map->in_memory != MAP_ACTIVE
864	|| map->nodrop	909	|| map->nodrop
865	|| ms ().move_block == MOVE_ALL)	910	|| ms ().move_block == MOVE_ALL)
866	{	911	{
867	while (inv)	912	while (inv)
868	{	913	{
869	inv->destroy_inv (drop_to_ground);	914	inv->destroy_inv (false);
870	inv->destroy ();	915	inv->destroy ();
871	}	916	}
872	}	917	}
873	else	918	else
874	{ /* Put objects in inventory onto this space */	919	{ /* Put objects in inventory onto this space */
…		…
880	|| op->flag [FLAG_NO_DROP]	925	|| op->flag [FLAG_NO_DROP]
881	|| op->type == RUNE	926	|| op->type == RUNE
882	|| op->type == TRAP	927	|| op->type == TRAP
883	|| op->flag [FLAG_IS_A_TEMPLATE]	928	|| op->flag [FLAG_IS_A_TEMPLATE]
884	|| op->flag [FLAG_DESTROY_ON_DEATH])	929	|| op->flag [FLAG_DESTROY_ON_DEATH])
885	op->destroy ();	930	op->destroy (true);
886	else	931	else
887	map->insert (op, x, y);	932	map->insert (op, x, y);
888	}	933	}
889	}	934	}
890	}	935	}
…		…
894	object *op = new object;	939	object *op = new object;
895	op->link ();	940	op->link ();
896	return op;	941	return op;
897	}	942	}
898		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
899	void	964	void
900	object::do_destroy ()	965	object::do_destroy ()
901	{	966	{
902	attachable::do_destroy ();
903
904	if (flag [FLAG_IS_LINKED])	967	if (flag [FLAG_IS_LINKED])
905	remove_button_link (this);	968	remove_button_link (this);
906		969
907	if (flag [FLAG_FRIENDLY])	970	if (flag [FLAG_FRIENDLY])
908	remove_friendly_object (this);	971	remove_friendly_object (this);
909		972
910	if (!flag [FLAG_REMOVED])
911	remove ();	973	remove ();
912		974
913	destroy_inv (true);	975	attachable::do_destroy ();
914		976
915	deactivate ();	977	deactivate ();
916	unlink ();	978	unlink ();
917		979
918	flag [FLAG_FREED] = 1;	980	flag [FLAG_FREED] = 1;
919		981
920	// hack to ensure that freed objects still have a valid map	982	// hack to ensure that freed objects still have a valid map
921	{
922	static maptile *freed_map; // freed objects are moved here to avoid crashes
923
924	if (!freed_map)
925	{
926	freed_map = new maptile;
927
928	freed_map->name = "/internal/freed_objects_map";
929	freed_map->width = 3;
930	freed_map->height = 3;
931
932	freed_map->alloc ();
933	freed_map->in_memory = MAP_IN_MEMORY;
934	}
935
936	map = freed_map;	983	map = &freed_map;
937	x = 1;	984	x = 1;
938	y = 1;	985	y = 1;
939	}
940		986
941	if (more)	987	if (more)
942	{	988	{
943	more->destroy ();	989	more->destroy ();
944	more = 0;	990	more = 0;
…		…
957	object::destroy (bool destroy_inventory)	1003	object::destroy (bool destroy_inventory)
958	{	1004	{
959	if (destroyed ())	1005	if (destroyed ())
960	return;	1006	return;
961		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
962	if (destroy_inventory)	1015	destroy_inv (!destroy_inventory);
963	destroy_inv (false);	1016
		1017	if (is_head ())
		1018	if (sound_destroy)
		1019	play_sound (sound_destroy);
		1020	else if (flag [FLAG_MONSTER])
		1021	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
964		1022
965	attachable::destroy ();	1023	attachable::destroy ();
966	}
967
968	/*
969	* sub_weight() recursively (outwards) subtracts a number from the
970	* weight of an object (and what is carried by it's environment(s)).
971	*/
972	void
973	sub_weight (object *op, signed long weight)
974	{
975	while (op != NULL)
976	{
977	if (op->type == CONTAINER)
978	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
979
980	op->carrying -= weight;
981	op = op->env;
982	}
983	}	1024	}
984		1025
985	/* op->remove ():	1026	/* op->remove ():
986	* 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
987	* 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
…		…
993	object::do_remove ()	1034	object::do_remove ()
994	{	1035	{
995	object *tmp, *last = 0;	1036	object *tmp, *last = 0;
996	object *otmp;	1037	object *otmp;
997		1038
998	if (QUERY_FLAG (this, FLAG_REMOVED))	1039	if (flag [FLAG_REMOVED])
999	return;	1040	return;
1000		1041
1001	SET_FLAG (this, FLAG_REMOVED);
1002	INVOKE_OBJECT (REMOVE, this);	1042	INVOKE_OBJECT (REMOVE, this);
		1043
		1044	flag [FLAG_REMOVED] = true;
1003		1045
1004	if (more)	1046	if (more)
1005	more->remove ();	1047	more->remove ();
1006		1048
1007	/*	1049	/*
1008	* In this case, the object to be removed is in someones	1050	* In this case, the object to be removed is in someones
1009	* inventory.	1051	* inventory.
1010	*/	1052	*/
1011	if (env)	1053	if (env)
1012	{	1054	{
		1055	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
		1056	if (object *pl = visible_to ())
		1057	esrv_del_item (pl->contr, count);
		1058	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1059
		1060	adjust_weight (env, -total_weight ());
		1061
		1062	*(above ? &above->below : &env->inv) = below;
		1063
1013	if (nrof)	1064	if (below)
1014	sub_weight (env, weight * nrof);	1065	below->above = above;
1015	else	1066
1016	sub_weight (env, weight + carrying);	1067	/* we set up values so that it could be inserted into
		1068	* the map, but we don't actually do that - it is up
		1069	* to the caller to decide what we want to do.
		1070	*/
		1071	map = env->map;
		1072	x = env->x;
		1073	y = env->y;
		1074	above = 0;
		1075	below = 0;
		1076	env = 0;
1017		1077
1018	/* 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
1019	* made to players inventory. If set, avoiding the call	1079	* made to players inventory. If set, avoiding the call
1020	* to save cpu time.	1080	* to save cpu time.
1021	*/	1081	*/
1022	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))
1023	otmp->update_stats ();	1083	otmp->update_stats ();
1024
1025	if (above)
1026	above->below = below;
1027	else
1028	env->inv = below;
1029
1030	if (below)
1031	below->above = above;
1032
1033	/* we set up values so that it could be inserted into
1034	* the map, but we don't actually do that - it is up
1035	* to the caller to decide what we want to do.
1036	*/
1037	x = env->x, y = env->y;
1038	map = env->map;
1039	above = 0, below = 0;
1040	env = 0;
1041	}	1084	}
1042	else if (map)	1085	else if (map)
1043	{	1086	{
1044	if (type == PLAYER)
1045	{
1046	// leaving a spot always closes any open container on the ground
1047	if (container && !container->env)
1048	// this causes spurious floorbox updates, but it ensures
1049	// that the CLOSE event is being sent.
1050	close_container ();
1051
1052	--map->players;
1053	map->touch ();
1054	}
1055
1056	map->dirty = true;	1087	map->dirty = true;
1057	mapspace &ms = this->ms ();	1088	mapspace &ms = this->ms ();
		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	}
1058		1111
1059	/* link the object above us */	1112	/* link the object above us */
1060	if (above)	1113	if (above)
1061	above->below = below;	1114	above->below = below;
1062	else	1115	else
…		…
1083	if (map->in_memory == MAP_SAVING)	1136	if (map->in_memory == MAP_SAVING)
1084	return;	1137	return;
1085		1138
1086	int check_walk_off = !flag [FLAG_NO_APPLY];	1139	int check_walk_off = !flag [FLAG_NO_APPLY];
1087		1140
		1141	if (object *pl = ms.player ())
		1142	{
		1143	if (pl->container == this)
		1144	/* If a container that the player is currently using somehow gets
		1145	* removed (most likely destroyed), update the player view
		1146	* appropriately.
		1147	*/
		1148	pl->close_container ();
		1149
		1150	//TODO: the floorbox prev/next might need updating
		1151	//esrv_del_item (pl->contr, count);
		1152	//TODO: update floorbox to preserve ordering
		1153	if (pl->contr->ns)
		1154	pl->contr->ns->floorbox_update ();
		1155	}
		1156
1088	for (tmp = ms.bot; tmp; tmp = tmp->above)	1157	for (tmp = ms.bot; tmp; tmp = tmp->above)
1089	{	1158	{
1090	/* No point updating the players look faces if he is the object	1159	/* No point updating the players look faces if he is the object
1091	* being removed.	1160	* being removed.
1092	*/	1161	*/
1093
1094	if (tmp->type == PLAYER && tmp != this)
1095	{
1096	/* If a container that the player is currently using somehow gets
1097	* removed (most likely destroyed), update the player view
1098	* appropriately.
1099	*/
1100	if (tmp->container == this)
1101	{
1102	flag [FLAG_APPLIED] = 0;
1103	tmp->container = 0;
1104	}
1105
1106	if (tmp->contr->ns)
1107	tmp->contr->ns->floorbox_update ();
1108	}
1109		1162
1110	/* See if object moving off should effect something */	1163	/* See if object moving off should effect something */
1111	if (check_walk_off	1164	if (check_walk_off
1112	&& ((move_type & tmp->move_off)	1165	&& ((move_type & tmp->move_off)
1113	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1166	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1145	merge_ob (object *op, object *top)	1198	merge_ob (object *op, object *top)
1146	{	1199	{
1147	if (!op->nrof)	1200	if (!op->nrof)
1148	return 0;	1201	return 0;
1149		1202
1150	if (top)	1203	if (!top)
1151	for (top = op; top && top->above; top = top->above)	1204	for (top = op; top && top->above; top = top->above)
1152	;	1205	;
1153		1206
1154	for (; top; top = top->below)	1207	for (; top; top = top->below)
1155	{
1156	if (top == op)
1157	continue;
1158
1159	if (object::can_merge (op, top))	1208	if (object::can_merge (op, top))
1160	{	1209	{
1161	top->nrof += op->nrof;	1210	top->nrof += op->nrof;
1162		1211
1163	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1212	if (object *pl = top->visible_to ())
1164	op->weight = 0; /* Don't want any adjustements now */	1213	esrv_update_item (UPD_NROF, pl, top);
		1214
		1215	op->weight = 0; // cancel the addition above
		1216	op->carrying = 0; // must be 0 already
		1217
1165	op->destroy ();	1218	op->destroy (1);
		1219
1166	return top;	1220	return top;
1167	}	1221	}
1168	}
1169		1222
1170	return 0;	1223	return 0;
1171	}	1224	}
1172		1225
1173	void	1226	void
…		…
1232	object *	1285	object *
1233	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1286	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1234	{	1287	{
1235	assert (!op->flag [FLAG_FREED]);	1288	assert (!op->flag [FLAG_FREED]);
1236		1289
1237	object *top, *floor = NULL;
1238
1239	op->remove ();	1290	op->remove ();
1240
1241	#if 0
1242	if (!m->active != !op->active)
1243	if (m->active)
1244	op->activate_recursive ();
1245	else
1246	op->deactivate_recursive ();
1247	#endif
1248
1249	if (out_of_map (m, op->x, op->y))
1250	{
1251	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1252	#ifdef MANY_CORES
1253	/* Better to catch this here, as otherwise the next use of this object
1254	* is likely to cause a crash. Better to find out where it is getting
1255	* improperly inserted.
1256	*/
1257	abort ();
1258	#endif
1259	return op;
1260	}
1261
1262	if (object *more = op->more)
1263	if (!insert_ob_in_map (more, m, originator, flag))
1264	return 0;
1265
1266	CLEAR_FLAG (op, FLAG_REMOVED);
1267		1291
1268	/* Ideally, the caller figures this out. However, it complicates a lot	1292	/* Ideally, the caller figures this out. However, it complicates a lot
1269	* of areas of callers (eg, anything that uses find_free_spot would now	1293	* of areas of callers (eg, anything that uses find_free_spot would now
1270	* need extra work	1294	* need extra work
1271	*/	1295	*/
1272	if (!xy_normalise (m, op->x, op->y))	1296	if (!xy_normalise (m, op->x, op->y))
		1297	{
		1298	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1273	return 0;	1299	return 0;
		1300	}
		1301
		1302	if (object *more = op->more)
		1303	if (!insert_ob_in_map (more, m, originator, flag))
		1304	return 0;
		1305
		1306	CLEAR_FLAG (op, FLAG_REMOVED);
1274		1307
1275	op->map = m;	1308	op->map = m;
1276	mapspace &ms = op->ms ();	1309	mapspace &ms = op->ms ();
1277		1310
1278	/* this has to be done after we translate the coordinates.	1311	/* this has to be done after we translate the coordinates.
1279	*/	1312	*/
1280	if (op->nrof && !(flag & INS_NO_MERGE))	1313	if (op->nrof && !(flag & INS_NO_MERGE))
1281	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1314	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1282	if (object::can_merge (op, tmp))	1315	if (object::can_merge (op, tmp))
1283	{	1316	{
		1317	// TODO: we atcually want to update tmp, not op,
		1318	// but some caller surely breaks when we return tmp
		1319	// from here :/
1284	op->nrof += tmp->nrof;	1320	op->nrof += tmp->nrof;
1285	tmp->destroy ();	1321	tmp->destroy (1);
1286	}	1322	}
1287		1323
1288	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1324	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1289	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1325	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1290		1326
…		…
1310	/* since *below* originator, no need to update top */	1346	/* since *below* originator, no need to update top */
1311	originator->below = op;	1347	originator->below = op;
1312	}	1348	}
1313	else	1349	else
1314	{	1350	{
		1351	object *top, *floor = NULL;
		1352
1315	top = ms.bot;	1353	top = ms.bot;
1316		1354
1317	/* If there are other objects, then */	1355	/* If there are other objects, then */
1318	if ((!(flag & INS_MAP_LOAD)) && top)	1356	if (top)
1319	{	1357	{
1320	object *last = 0;	1358	object *last = 0;
1321		1359
1322	/*	1360	/*
1323	* If there are multiple objects on this space, we do some trickier handling.	1361	* If there are multiple objects on this space, we do some trickier handling.
…		…
1375	*/	1413	*/
1376	if (last && last->below && last != floor)	1414	if (last && last->below && last != floor)
1377	top = last->below;	1415	top = last->below;
1378	}	1416	}
1379	} /* If objects on this space */	1417	} /* If objects on this space */
1380	if (flag & INS_MAP_LOAD)
1381	top = ms.top;
1382		1418
1383	if (flag & INS_ABOVE_FLOOR_ONLY)	1419	if (flag & INS_ABOVE_FLOOR_ONLY)
1384	top = floor;	1420	top = floor;
1385		1421
1386	/* Top is the object that our object (op) is going to get inserted above.	1422	/* Top is the object that our object (op) is going to get inserted above.
…		…
1419	op->map->touch ();	1455	op->map->touch ();
1420	}	1456	}
1421		1457
1422	op->map->dirty = true;	1458	op->map->dirty = true;
1423		1459
1424	/* If we have a floor, we know the player, if any, will be above
1425	* it, so save a few ticks and start from there.
1426	*/
1427	if (!(flag & INS_MAP_LOAD))
1428	if (object *pl = ms.player ())	1460	if (object *pl = ms.player ())
		1461	//TODO: the floorbox prev/next might need updating
		1462	//esrv_send_item (pl, op);
		1463	//TODO: update floorbox to preserve ordering
1429	if (pl->contr->ns)	1464	if (pl->contr->ns)
1430	pl->contr->ns->floorbox_update ();	1465	pl->contr->ns->floorbox_update ();
1431		1466
1432	/* If this object glows, it may affect lighting conditions that are	1467	/* If this object glows, it may affect lighting conditions that are
1433	* visible to others on this map. But update_all_los is really	1468	* visible to others on this map. But update_all_los is really
1434	* an inefficient way to do this, as it means los for all players	1469	* an inefficient way to do this, as it means los for all players
1435	* on the map will get recalculated. The players could very well	1470	* on the map will get recalculated. The players could very well
…		…
1477	* op is the object to insert it under: supplies x and the map.	1512	* op is the object to insert it under: supplies x and the map.
1478	*/	1513	*/
1479	void	1514	void
1480	replace_insert_ob_in_map (const char *arch_string, object *op)	1515	replace_insert_ob_in_map (const char *arch_string, object *op)
1481	{	1516	{
1482	object *tmp, *tmp1;
1483
1484	/* first search for itself and remove any old instances */	1517	/* first search for itself and remove any old instances */
1485		1518
1486	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1519	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1487	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1520	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1488	tmp->destroy ();	1521	tmp->destroy (1);
1489		1522
1490	tmp1 = arch_to_object (archetype::find (arch_string));	1523	object *tmp = arch_to_object (archetype::find (arch_string));
1491		1524
1492	tmp1->x = op->x;	1525	tmp->x = op->x;
1493	tmp1->y = op->y;	1526	tmp->y = op->y;
		1527
1494	insert_ob_in_map (tmp1, op->map, op, 0);	1528	insert_ob_in_map (tmp, op->map, op, 0);
1495	}	1529	}
1496		1530
1497	object *	1531	object *
1498	object::insert_at (object *where, object *originator, int flags)	1532	object::insert_at (object *where, object *originator, int flags)
1499	{	1533	{
		1534	if (where->env)
		1535	return where->env->insert (this);
		1536	else
1500	return where->map->insert (this, where->x, where->y, originator, flags);	1537	return where->map->insert (this, where->x, where->y, originator, flags);
1501	}	1538	}
1502		1539
1503	/*	1540	/*
1504	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1505	* is returned contains nr objects, and the remaining parts contains
1506	* the rest (or is removed and freed if that number is 0).
1507	* On failure, NULL is returned, and the reason put into the
1508	* global static errmsg array.
1509	*/
1510	object *
1511	get_split_ob (object *orig_ob, uint32 nr)
1512	{
1513	object *newob;
1514	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1515
1516	if (orig_ob->nrof < nr)
1517	{
1518	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1519	return NULL;
1520	}
1521
1522	newob = object_create_clone (orig_ob);
1523
1524	if ((orig_ob->nrof -= nr) < 1)
1525	orig_ob->destroy (1);
1526	else if (!is_removed)
1527	{
1528	if (orig_ob->env != NULL)
1529	sub_weight (orig_ob->env, orig_ob->weight * nr);
1530	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1531	{
1532	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1533	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1534	return NULL;
1535	}
1536	}
1537
1538	newob->nrof = nr;
1539
1540	return newob;
1541	}
1542
1543	/*
1544	* decrease_ob_nr(object, number) decreases a specified number from	1541	* decrease(object, number) decreases a specified number from
1545	* the amount of an object. If the amount reaches 0, the object	1542	* the amount of an object. If the amount reaches 0, the object
1546	* is subsequently removed and freed.	1543	* is subsequently removed and freed.
1547	*	1544	*
1548	* Return value: 'op' if something is left, NULL if the amount reached 0	1545	* Return value: 'op' if something is left, NULL if the amount reached 0
1549	*/	1546	*/
		1547	bool
		1548	object::decrease (sint32 nr)
		1549	{
		1550	if (!nr)
		1551	return true;
		1552
		1553	nr = min (nr, nrof);
		1554
		1555	nrof -= nr;
		1556
		1557	if (nrof)
		1558	{
		1559	adjust_weight (env, -weight * nr); // carrying == 0
		1560
		1561	if (object *pl = visible_to ())
		1562	esrv_update_item (UPD_NROF, pl, this);
		1563
		1564	return true;
		1565	}
		1566	else
		1567	{
		1568	destroy (1);
		1569	return false;
		1570	}
		1571	}
		1572
		1573	/*
		1574	* split(ob,nr) splits up ob into two parts. The part which
		1575	* is returned contains nr objects, and the remaining parts contains
		1576	* the rest (or is removed and returned if that number is 0).
		1577	* On failure, NULL is returned.
		1578	*/
1550	object *	1579	object *
1551	decrease_ob_nr (object *op, uint32 i)	1580	object::split (sint32 nr)
1552	{	1581	{
1553	object *tmp;	1582	int have = number_of ();
1554		1583
1555	if (i == 0) /* objects with op->nrof require this check */	1584	if (have < nr)
1556	return op;	1585	return 0;
1557		1586	else if (have == nr)
1558	if (i > op->nrof)
1559	i = op->nrof;
1560
1561	if (QUERY_FLAG (op, FLAG_REMOVED))
1562	op->nrof -= i;
1563	else if (op->env)
1564	{	1587	{
1565	/* is this object in the players inventory, or sub container
1566	* therein?
1567	*/
1568	tmp = op->in_player ();
1569	/* nope. Is this a container the player has opened?
1570	* If so, set tmp to that player.
1571	* IMO, searching through all the players will mostly
1572	* likely be quicker than following op->env to the map,
1573	* and then searching the map for a player.
1574	*/
1575	if (!tmp)
1576	for_all_players (pl)
1577	if (pl->ob->container == op->env)
1578	{
1579	tmp = pl->ob;
1580	break;
1581	}
1582
1583	if (i < op->nrof)
1584	{
1585	sub_weight (op->env, op->weight * i);
1586	op->nrof -= i;
1587	if (tmp)
1588	esrv_send_item (tmp, op);
1589	}
1590	else
1591	{
1592	op->remove ();	1588	remove ();
1593	op->nrof = 0;	1589	return this;
1594	if (tmp)
1595	esrv_del_item (tmp->contr, op->count);
1596	}
1597	}	1590	}
1598	else	1591	else
1599	{	1592	{
1600	object *above = op->above;	1593	decrease (nr);
1601		1594
1602	if (i < op->nrof)	1595	object *op = deep_clone ();
1603	op->nrof -= i;	1596	op->nrof = nr;
1604	else
1605	{
1606	op->remove ();
1607	op->nrof = 0;
1608	}
1609
1610	/* Since we just removed op, op->above is null */
1611	for (tmp = above; tmp; tmp = tmp->above)
1612	if (tmp->type == PLAYER)
1613	{
1614	if (op->nrof)
1615	esrv_send_item (tmp, op);
1616	else
1617	esrv_del_item (tmp->contr, op->count);
1618	}
1619	}
1620
1621	if (op->nrof)
1622	return op;	1597	return op;
1623	else
1624	{
1625	op->destroy ();
1626	return 0;
1627	}
1628	}
1629
1630	/*
1631	* add_weight(object, weight) adds the specified weight to an object,
1632	* and also updates how much the environment(s) is/are carrying.
1633	*/
1634	void
1635	add_weight (object *op, signed long weight)
1636	{
1637	while (op != NULL)
1638	{
1639	if (op->type == CONTAINER)
1640	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1641
1642	op->carrying += weight;
1643	op = op->env;
1644	}	1598	}
1645	}	1599	}
1646		1600
1647	object *	1601	object *
1648	insert_ob_in_ob (object *op, object *where)	1602	insert_ob_in_ob (object *op, object *where)
…		…
1673	* be != op, if items are merged. -Tero	1627	* be != op, if items are merged. -Tero
1674	*/	1628	*/
1675	object *	1629	object *
1676	object::insert (object *op)	1630	object::insert (object *op)
1677	{	1631	{
1678	object *tmp, *otmp;
1679
1680	if (!QUERY_FLAG (op, FLAG_REMOVED))
1681	op->remove ();
1682
1683	if (op->more)	1632	if (op->more)
1684	{	1633	{
1685	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1634	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1686	return op;	1635	return op;
1687	}	1636	}
1688		1637
1689	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1638	op->remove ();
1690	CLEAR_FLAG (op, FLAG_REMOVED);	1639
		1640	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1641
1691	if (op->nrof)	1642	if (op->nrof)
1692	{
1693	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1643	for (object *tmp = inv; tmp; tmp = tmp->below)
1694	if (object::can_merge (tmp, op))	1644	if (object::can_merge (tmp, op))
1695	{	1645	{
1696	/* return the original object and remove inserted object	1646	/* return the original object and remove inserted object
1697	(client needs the original object) */	1647	(client needs the original object) */
1698	tmp->nrof += op->nrof;	1648	tmp->nrof += op->nrof;
1699	/* Weight handling gets pretty funky. Since we are adding to	1649
1700	* tmp->nrof, we need to increase the weight.	1650	if (object *pl = tmp->visible_to ())
1701	*/	1651	esrv_update_item (UPD_NROF, pl, tmp);
		1652
1702	add_weight (this, op->weight * op->nrof);	1653	adjust_weight (this, op->total_weight ());
1703	SET_FLAG (op, FLAG_REMOVED);	1654
1704	op->destroy (); /* free the inserted object */	1655	op->destroy (1);
1705	op = tmp;	1656	op = tmp;
1706	op->remove (); /* and fix old object's links */	1657	goto inserted;
1707	CLEAR_FLAG (op, FLAG_REMOVED);
1708	break;
1709	}	1658	}
1710		1659
1711	/* I assume combined objects have no inventory	1660	op->owner = 0; // it's his/hers now. period.
1712	* We add the weight - this object could have just been removed
1713	* (if it was possible to merge). calling remove_ob will subtract
1714	* the weight, so we need to add it in again, since we actually do
1715	* the linking below
1716	*/
1717	add_weight (this, op->weight * op->nrof);
1718	}
1719	else
1720	add_weight (this, (op->weight + op->carrying));
1721
1722	otmp = this->in_player ();
1723	if (otmp && otmp->contr)
1724	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1725	otmp->update_stats ();
1726
1727	op->map = 0;	1661	op->map = 0;
1728	op->env = this;	1662	op->x = 0;
		1663	op->y = 0;
		1664
1729	op->above = 0;	1665	op->above = 0;
1730	op->below = 0;	1666	op->below = inv;
1731	op->x = 0, op->y = 0;	1667	op->env = this;
1732		1668
		1669	if (inv)
		1670	inv->above = op;
		1671
		1672	inv = op;
		1673
		1674	op->flag [FLAG_REMOVED] = 0;
		1675
		1676	if (object *pl = op->visible_to ())
		1677	esrv_send_item (pl, op);
		1678
		1679	adjust_weight (this, op->total_weight ());
		1680
		1681	inserted:
1733	/* reset the light list and los of the players on the map */	1682	/* reset the light list and los of the players on the map */
1734	if ((op->glow_radius != 0) && map)	1683	if (op->glow_radius && map && map->darkness)
1735	{
1736	#ifdef DEBUG_LIGHTS
1737	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1738	#endif /* DEBUG_LIGHTS */
1739	if (map->darkness)
1740	update_all_los (map, x, y);	1684	update_all_los (map, x, y);
1741	}
1742		1685
1743	/* Client has no idea of ordering so lets not bother ordering it here.	1686	// if this is a player's inventory, update stats
1744	* It sure simplifies this function...	1687	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1745	*/	1688	update_stats ();
1746	if (!inv)
1747	inv = op;
1748	else
1749	{
1750	op->below = inv;
1751	op->below->above = op;
1752	inv = op;
1753	}
1754		1689
1755	INVOKE_OBJECT (INSERT, this);	1690	INVOKE_OBJECT (INSERT, this);
1756		1691
1757	return op;	1692	return op;
1758	}	1693	}
…		…
1886	LOG (llevError, "Present_arch called outside map.\n");	1821	LOG (llevError, "Present_arch called outside map.\n");
1887	return NULL;	1822	return NULL;
1888	}	1823	}
1889		1824
1890	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1825	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1891	if (tmp->arch == at)	1826	if (tmp->arch->archname == at->archname)
1892	return tmp;	1827	return tmp;
1893		1828
1894	return NULL;	1829	return NULL;
1895	}	1830	}
1896		1831
…		…
1960	* The first matching object is returned, or NULL if none.	1895	* The first matching object is returned, or NULL if none.
1961	*/	1896	*/
1962	object *	1897	object *
1963	present_arch_in_ob (const archetype *at, const object *op)	1898	present_arch_in_ob (const archetype *at, const object *op)
1964	{	1899	{
1965	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1900	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1966	if (tmp->arch == at)	1901	if (tmp->arch->archname == at->archname)
1967	return tmp;	1902	return tmp;
1968		1903
1969	return NULL;	1904	return NULL;
1970	}	1905	}
1971		1906
…		…
1973	* activate recursively a flag on an object inventory	1908	* activate recursively a flag on an object inventory
1974	*/	1909	*/
1975	void	1910	void
1976	flag_inv (object *op, int flag)	1911	flag_inv (object *op, int flag)
1977	{	1912	{
1978	if (op->inv)
1979	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1913	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1980	{	1914	{
1981	SET_FLAG (tmp, flag);	1915	SET_FLAG (tmp, flag);
1982	flag_inv (tmp, flag);	1916	flag_inv (tmp, flag);
1983	}	1917	}
1984	}	1918	}
1985		1919
1986	/*	1920	/*
1987	* deactivate recursively a flag on an object inventory	1921	* deactivate recursively a flag on an object inventory
1988	*/	1922	*/
1989	void	1923	void
1990	unflag_inv (object *op, int flag)	1924	unflag_inv (object *op, int flag)
1991	{	1925	{
1992	if (op->inv)
1993	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1926	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1994	{	1927	{
1995	CLEAR_FLAG (tmp, flag);	1928	CLEAR_FLAG (tmp, flag);
1996	unflag_inv (tmp, flag);	1929	unflag_inv (tmp, flag);
1997	}	1930	}
1998	}	1931	}
1999		1932
2000	/*	1933	/*
2001	* find_free_spot(object, map, x, y, start, stop) will search for	1934	* find_free_spot(object, map, x, y, start, stop) will search for
2002	* a spot at the given map and coordinates which will be able to contain	1935	* a spot at the given map and coordinates which will be able to contain
…		…
2004	* to search (see the freearr_x/y[] definition).	1937	* to search (see the freearr_x/y[] definition).
2005	* It returns a random choice among the alternatives found.	1938	* It returns a random choice among the alternatives found.
2006	* start and stop are where to start relative to the free_arr array (1,9	1939	* start and stop are where to start relative to the free_arr array (1,9
2007	* does all 4 immediate directions). This returns the index into the	1940	* does all 4 immediate directions). This returns the index into the
2008	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1941	* array of the free spot, -1 if no spot available (dir 0 = x,y)
2009	* Note - this only checks to see if there is space for the head of the
2010	* object - if it is a multispace object, this should be called for all
2011	* pieces.
2012	* Note2: This function does correctly handle tiled maps, but does not	1942	* Note: This function does correctly handle tiled maps, but does not
2013	* inform the caller. However, insert_ob_in_map will update as	1943	* inform the caller. However, insert_ob_in_map will update as
2014	* necessary, so the caller shouldn't need to do any special work.	1944	* necessary, so the caller shouldn't need to do any special work.
2015	* Note - updated to take an object instead of archetype - this is necessary	1945	* Note - updated to take an object instead of archetype - this is necessary
2016	* because arch_blocked (now ob_blocked) needs to know the movement type	1946	* because arch_blocked (now ob_blocked) needs to know the movement type
2017	* to know if the space in question will block the object. We can't use	1947	* to know if the space in question will block the object. We can't use
…		…
2019	* customized, changed states, etc.	1949	* customized, changed states, etc.
2020	*/	1950	*/
2021	int	1951	int
2022	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1952	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2023	{	1953	{
		1954	int altern[SIZEOFFREE];
2024	int index = 0, flag;	1955	int index = 0, flag;
2025	int altern[SIZEOFFREE];
2026		1956
2027	for (int i = start; i < stop; i++)	1957	for (int i = start; i < stop; i++)
2028	{	1958	{
2029	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1959	mapxy pos (m, x, y); pos.move (i);
2030	if (!flag)	1960
		1961	if (!pos.normalise ())
		1962	continue;
		1963
		1964	mapspace &ms = *pos;
		1965
		1966	if (ms.flags () & P_IS_ALIVE)
		1967	continue;
		1968
		1969	/* However, often
		1970	* ob doesn't have any move type (when used to place exits)
		1971	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1972	*/
		1973	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1974	{
2031	altern [index++] = i;	1975	altern [index++] = i;
		1976	continue;
		1977	}
2032		1978
2033	/* Basically, if we find a wall on a space, we cut down the search size.	1979	/* Basically, if we find a wall on a space, we cut down the search size.
2034	* In this way, we won't return spaces that are on another side of a wall.	1980	* In this way, we won't return spaces that are on another side of a wall.
2035	* This mostly work, but it cuts down the search size in all directions -	1981	* This mostly work, but it cuts down the search size in all directions -
2036	* if the space being examined only has a wall to the north and empty	1982	* if the space being examined only has a wall to the north and empty
2037	* spaces in all the other directions, this will reduce the search space	1983	* spaces in all the other directions, this will reduce the search space
2038	* to only the spaces immediately surrounding the target area, and	1984	* to only the spaces immediately surrounding the target area, and
2039	* won't look 2 spaces south of the target space.	1985	* won't look 2 spaces south of the target space.
2040	*/	1986	*/
2041	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1987	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1988	{
2042	stop = maxfree[i];	1989	stop = maxfree[i];
		1990	continue;
		1991	}
		1992
		1993	/* Note it is intentional that we check ob - the movement type of the
		1994	* head of the object should correspond for the entire object.
		1995	*/
		1996	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1997	continue;
		1998
		1999	if (ob->blocked (m, pos.x, pos.y))
		2000	continue;
		2001
		2002	altern [index++] = i;
2043	}	2003	}
2044		2004
2045	if (!index)	2005	if (!index)
2046	return -1;	2006	return -1;
2047		2007
…		…
2056	*/	2016	*/
2057	int	2017	int
2058	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2018	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2059	{	2019	{
2060	for (int i = 0; i < SIZEOFFREE; i++)	2020	for (int i = 0; i < SIZEOFFREE; i++)
2061	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2021	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2062	return i;	2022	return i;
2063		2023
2064	return -1;	2024	return -1;
2065	}	2025	}
2066		2026
…		…
2343	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2303	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2344	* core dumps if they do.	2304	* core dumps if they do.
2345	*	2305	*
2346	* Add a check so we can't pick up invisible objects (0.93.8)	2306	* Add a check so we can't pick up invisible objects (0.93.8)
2347	*/	2307	*/
2348
2349	int	2308	int
2350	can_pick (const object *who, const object *item)	2309	can_pick (const object *who, const object *item)
2351	{	2310	{
2352	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2311	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2353	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2312	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2356		2315
2357	/*	2316	/*
2358	* create clone from object to another	2317	* create clone from object to another
2359	*/	2318	*/
2360	object *	2319	object *
2361	object_create_clone (object *asrc)	2320	object::deep_clone ()
2362	{	2321	{
2363	object *dst = 0, *tmp, *src, *prev, *item;	2322	assert (("deep_clone called on non-head object", is_head ()));
2364		2323
2365	if (!asrc)	2324	object *dst = clone ();
2366	return 0;
2367		2325
2368	src = asrc->head_ ();	2326	object *prev = dst;
2369
2370	prev = 0;
2371	for (object *part = src; part; part = part->more)	2327	for (object *part = this->more; part; part = part->more)
2372	{	2328	{
2373	tmp = part->clone ();	2329	object *tmp = part->clone ();
2374	tmp->x -= src->x;
2375	tmp->y -= src->y;
2376
2377	if (!part->head)
2378	{
2379	dst = tmp;
2380	tmp->head = 0;
2381	}
2382	else
2383	tmp->head = dst;	2330	tmp->head = dst;
2384
2385	tmp->more = 0;
2386
2387	if (prev)
2388	prev->more = tmp;	2331	prev->more = tmp;
2389
2390	prev = tmp;	2332	prev = tmp;
2391	}	2333	}
2392		2334
2393	for (item = src->inv; item; item = item->below)	2335	for (object *item = inv; item; item = item->below)
2394	insert_ob_in_ob (object_create_clone (item), dst);	2336	insert_ob_in_ob (item->deep_clone (), dst);
2395		2337
2396	return dst;	2338	return dst;
2397	}	2339	}
2398		2340
2399	/* This returns the first object in who's inventory that	2341	/* This returns the first object in who's inventory that
…		…
2408	return tmp;	2350	return tmp;
2409		2351
2410	return 0;	2352	return 0;
2411	}	2353	}
2412		2354
2413	/* If ob has a field named key, return the link from the list,	2355	const shstr &
2414	* otherwise return NULL.	2356	object::kv_get (const shstr &key) const
2415	*
2416	* key must be a passed in shared string - otherwise, this won't
2417	* do the desired thing.
2418	*/
2419	key_value *
2420	get_ob_key_link (const object *ob, const char *key)
2421	{	2357	{
2422	for (key_value *link = ob->key_values; link; link = link->next)	2358	for (key_value *kv = key_values; kv; kv = kv->next)
2423	if (link->key == key)	2359	if (kv->key == key)
2424	return link;
2425
2426	return 0;
2427	}
2428
2429	/*
2430	* Returns the value of op has an extra_field for key, or NULL.
2431	*
2432	* The argument doesn't need to be a shared string.
2433	*
2434	* The returned string is shared.
2435	*/
2436	const char *
2437	get_ob_key_value (const object *op, const char *const key)
2438	{
2439	key_value *link;
2440	shstr_cmp canonical_key (key);
2441
2442	if (!canonical_key)
2443	{
2444	/* 1. There being a field named key on any object
2445	* implies there'd be a shared string to find.
2446	* 2. Since there isn't, no object has this field.
2447	* 3. Therefore, *this* object doesn't have this field.
2448	*/
2449	return 0;
2450	}
2451
2452	/* This is copied from get_ob_key_link() above -
2453	* only 4 lines, and saves the function call overhead.
2454	*/
2455	for (link = op->key_values; link; link = link->next)
2456	if (link->key == canonical_key)
2457	return link->value;	2360	return kv->value;
2458		2361
2459	return 0;	2362	return shstr_null;
2460	}	2363	}
2461		2364
2462	/*	2365	void
2463	* Updates the canonical_key in op to value.	2366	object::kv_set (const shstr &key, const shstr &value)
2464	*
2465	* canonical_key is a shared string (value doesn't have to be).
2466	*
2467	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2468	* keys.
2469	*
2470	* Returns TRUE on success.
2471	*/
2472	int
2473	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2474	{	2367	{
2475	key_value *field = NULL, *last = NULL;	2368	for (key_value *kv = key_values; kv; kv = kv->next)
2476		2369	if (kv->key == key)
2477	for (field = op->key_values; field != NULL; field = field->next)
2478	{
2479	if (field->key != canonical_key)
2480	{	2370	{
2481	last = field;	2371	kv->value = value;
2482	continue;	2372	return;
2483	}	2373	}
2484		2374
2485	if (value)	2375	key_value *kv = new key_value;
2486	field->value = value;	2376
2487	else	2377	kv->next = key_values;
		2378	kv->key = key;
		2379	kv->value = value;
		2380
		2381	key_values = kv;
		2382	}
		2383
		2384	void
		2385	object::kv_del (const shstr &key)
		2386	{
		2387	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2388	if ((*kvp)->key == key)
2488	{	2389	{
2489	/* Basically, if the archetype has this key set,	2390	key_value *kv = *kvp;
2490	* we need to store the null value so when we save	2391	*kvp = (*kvp)->next;
2491	* it, we save the empty value so that when we load,	2392	delete kv;
2492	* we get this value back again.	2393	return;
2493	*/
2494	if (get_ob_key_link (op->arch, canonical_key))
2495	field->value = 0;
2496	else
2497	{
2498	if (last)
2499	last->next = field->next;
2500	else
2501	op->key_values = field->next;
2502
2503	delete field;
2504	}
2505	}	2394	}
2506	return TRUE;
2507	}
2508	/* IF we get here, key doesn't exist */
2509
2510	/* No field, we'll have to add it. */
2511
2512	if (!add_key)
2513	return FALSE;
2514
2515	/* There isn't any good reason to store a null
2516	* value in the key/value list. If the archetype has
2517	* this key, then we should also have it, so shouldn't
2518	* be here. If user wants to store empty strings,
2519	* should pass in ""
2520	*/
2521	if (value == NULL)
2522	return TRUE;
2523
2524	field = new key_value;
2525
2526	field->key = canonical_key;
2527	field->value = value;
2528	/* Usual prepend-addition. */
2529	field->next = op->key_values;
2530	op->key_values = field;
2531
2532	return TRUE;
2533	}
2534
2535	/*
2536	* Updates the key in op to value.
2537	*
2538	* If add_key is FALSE, this will only update existing keys,
2539	* and not add new ones.
2540	* In general, should be little reason FALSE is ever passed in for add_key
2541	*
2542	* Returns TRUE on success.
2543	*/
2544	int
2545	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2546	{
2547	shstr key_ (key);
2548
2549	return set_ob_key_value_s (op, key_, value, add_key);
2550	}	2395	}
2551		2396
2552	object::depth_iterator::depth_iterator (object *container)	2397	object::depth_iterator::depth_iterator (object *container)
2553	: iterator_base (container)	2398	: iterator_base (container)
2554	{	2399	{
…		…
2604	{	2449	{
2605	char flagdesc[512];	2450	char flagdesc[512];
2606	char info2[256 * 4];	2451	char info2[256 * 4];
2607	char *p = info;	2452	char *p = info;
2608		2453
2609	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2454	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2610	count, uuid.seq,	2455	count,
		2456	uuid.c_str (),
2611	&name,	2457	&name,
2612	title ? "\",title:\"" : "",	2458	title ? "\",title:\"" : "",
2613	title ? (const char *)title : "",	2459	title ? (const char *)title : "",
2614	flag_desc (flagdesc, 512), type);	2460	flag_desc (flagdesc, 512), type);
2615		2461
2616	if (env)	2462	if (!flag[FLAG_REMOVED] && env)
2617	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2463	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2618		2464
2619	if (map)	2465	if (map)
2620	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2466	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2621		2467
…		…
2651	object::open_container (object *new_container)	2497	object::open_container (object *new_container)
2652	{	2498	{
2653	if (container == new_container)	2499	if (container == new_container)
2654	return;	2500	return;
2655		2501
2656	if (object *old_container = container)	2502	object *old_container = container;
		2503
		2504	if (old_container)
2657	{	2505	{
2658	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2506	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2659	return;	2507	return;
2660		2508
2661	#if 0	2509	#if 0
…		…
2663	if (object *closer = old_container->inv)	2511	if (object *closer = old_container->inv)
2664	if (closer->type == CLOSE_CON)	2512	if (closer->type == CLOSE_CON)
2665	closer->destroy ();	2513	closer->destroy ();
2666	#endif	2514	#endif
2667		2515
		2516	// make sure the container is available
		2517	esrv_send_item (this, old_container);
		2518
2668	old_container->flag [FLAG_APPLIED] = 0;	2519	old_container->flag [FLAG_APPLIED] = false;
2669	container = 0;	2520	container = 0;
2670		2521
		2522	// client needs item update to make it work, client bug requires this to be separate
2671	esrv_update_item (UPD_FLAGS, this, old_container);	2523	esrv_update_item (UPD_FLAGS, this, old_container);
		2524
2672	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2525	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2526	play_sound (sound_find ("chest_close"));
2673	}	2527	}
2674		2528
2675	if (new_container)	2529	if (new_container)
2676	{	2530	{
2677	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))	2531	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
…		…
2688	}	2542	}
2689	#endif	2543	#endif
2690		2544
2691	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2545	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2692		2546
		2547	// make sure the container is available, client bug requires this to be separate
		2548	esrv_send_item (this, new_container);
		2549
2693	new_container->flag [FLAG_APPLIED] = 1;	2550	new_container->flag [FLAG_APPLIED] = true;
2694	container = new_container;	2551	container = new_container;
2695		2552
		2553	// client needs flag change
2696	esrv_update_item (UPD_FLAGS, this, new_container);	2554	esrv_update_item (UPD_FLAGS, this, new_container);
2697	esrv_send_inventory (this, new_container);	2555	esrv_send_inventory (this, new_container);
		2556	play_sound (sound_find ("chest_open"));
2698	}	2557	}
		2558	// else if (!old_container->env && contr && contr->ns)
		2559	// contr->ns->floorbox_reset ();
2699	}	2560	}
2700		2561
2701	object *	2562	object *
2702	object::force_find (const shstr name)	2563	object::force_find (const shstr name)
2703	{	2564	{
…		…
2729		2590
2730	insert (force);	2591	insert (force);
2731	}	2592	}
2732		2593
2733	void	2594	void
2734	object::play_sound (faceidx sound) const	2595	object::play_sound (faceidx sound)
2735	{	2596	{
2736	if (map)	2597	if (!sound)
		2598	return;
		2599
		2600	if (flag [FLAG_REMOVED])
		2601	return;
		2602
		2603	if (env)
		2604	{
		2605	if (object *pl = in_player ())
		2606	pl->contr->play_sound (sound);
		2607	}
		2608	else
2737	map->play_sound (sound, x, y);	2609	map->play_sound (sound, x, y);
2738	}	2610	}
		2611

Diff Legend

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