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.172 by root, Wed Aug 1 20:44:11 2007 UTC vs.
Revision 1.236 by root, Tue May 6 20:08: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)
…		…
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);
964		1016
		1017	if (is_head ())
965	if (sound_destroy)	1018	if (sound_destroy)
966	play_sound (sound_destroy);	1019	play_sound (sound_destroy);
967	else if (flag [FLAG_MONSTER])	1020	else if (flag [FLAG_MONSTER])
968	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
969		1022
970	attachable::destroy ();	1023	attachable::destroy ();
971	}
972
973	/*
974	* sub_weight() recursively (outwards) subtracts a number from the
975	* weight of an object (and what is carried by it's environment(s)).
976	*/
977	void
978	sub_weight (object *op, signed long weight)
979	{
980	while (op != NULL)
981	{
982	if (op->type == CONTAINER)
983	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
984
985	op->carrying -= weight;
986	op = op->env;
987	}
988	}	1024	}
989		1025
990	/* op->remove ():	1026	/* op->remove ():
991	* 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
992	* 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
…		…
998	object::do_remove ()	1034	object::do_remove ()
999	{	1035	{
1000	object *tmp, *last = 0;	1036	object *tmp, *last = 0;
1001	object *otmp;	1037	object *otmp;
1002		1038
1003	if (QUERY_FLAG (this, FLAG_REMOVED))	1039	if (flag [FLAG_REMOVED])
1004	return;	1040	return;
1005		1041
1006	SET_FLAG (this, FLAG_REMOVED);
1007	INVOKE_OBJECT (REMOVE, this);	1042	INVOKE_OBJECT (REMOVE, this);
		1043
		1044	flag [FLAG_REMOVED] = true;
1008		1045
1009	if (more)	1046	if (more)
1010	more->remove ();	1047	more->remove ();
1011		1048
1012	/*	1049	/*
1013	* In this case, the object to be removed is in someones	1050	* In this case, the object to be removed is in someones
1014	* inventory.	1051	* inventory.
1015	*/	1052	*/
1016	if (env)	1053	if (env)
1017	{	1054	{
1018	if (nrof)	1055	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1019	sub_weight (env, weight * nrof);	1056	if (object *pl = visible_to ())
1020	else	1057	esrv_del_item (pl->contr, count);
1021	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	// make sure cmov optimisation is applicable
		1063	*(above ? &above->below : &env->inv) = below;
		1064	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1065
		1066	above = 0;
		1067	below = 0;
		1068	env = 0;
		1069
		1070	/* we set up values so that it could be inserted into
		1071	* the map, but we don't actually do that - it is up
		1072	* to the caller to decide what we want to do.
		1073	*/
		1074	map = env->map;
		1075	x = env->x;
		1076	y = env->y;
1022		1077
1023	/* 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
1024	* made to players inventory. If set, avoiding the call	1079	* made to players inventory. If set, avoiding the call
1025	* to save cpu time.	1080	* to save cpu time.
1026	*/	1081	*/
1027	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))
1028	otmp->update_stats ();	1083	otmp->update_stats ();
1029
1030	if (above)
1031	above->below = below;
1032	else
1033	env->inv = below;
1034
1035	if (below)
1036	below->above = above;
1037
1038	/* we set up values so that it could be inserted into
1039	* the map, but we don't actually do that - it is up
1040	* to the caller to decide what we want to do.
1041	*/
1042	x = env->x, y = env->y;
1043	map = env->map;
1044	above = 0, below = 0;
1045	env = 0;
1046	}	1084	}
1047	else if (map)	1085	else if (map)
1048	{	1086	{
1049	if (type == PLAYER)
1050	{
1051	// leaving a spot always closes any open container on the ground
1052	if (container && !container->env)
1053	// this causes spurious floorbox updates, but it ensures
1054	// that the CLOSE event is being sent.
1055	close_container ();
1056
1057	--map->players;
1058	map->touch ();
1059	}
1060
1061	map->dirty = true;	1087	map->dirty = true;
1062	mapspace &ms = this->ms ();	1088	mapspace &ms = this->ms ();
1063		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
1064	/* link the object above us */	1112	/* link the object above us */
1065	if (above)	1113	// re-link, make sure compiler can easily use cmove
1066	above->below = below;	1114	*(above ? &above->below : &ms.top) = below;
1067	else	1115	*(below ? &below->above : &ms.bot) = above;
1068	ms.top = below; /* we were top, set new top */
1069
1070	/* Relink the object below us, if there is one */
1071	if (below)
1072	below->above = above;
1073	else
1074	{
1075	/* Nothing below, which means we need to relink map object for this space
1076	* use translated coordinates in case some oddness with map tiling is
1077	* evident
1078	*/
1079	if (GET_MAP_OB (map, x, y) != this)
1080	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 ());
1081
1082	ms.bot = above; /* goes on above it. */
1083	}
1084		1116
1085	above = 0;	1117	above = 0;
1086	below = 0;	1118	below = 0;
1087		1119
1088	if (map->in_memory == MAP_SAVING)	1120	if (map->in_memory == MAP_SAVING)
1089	return;	1121	return;
1090		1122
1091	int check_walk_off = !flag [FLAG_NO_APPLY];	1123	int check_walk_off = !flag [FLAG_NO_APPLY];
		1124
		1125	if (object *pl = ms.player ())
		1126	{
		1127	if (pl->container == this)
		1128	/* If a container that the player is currently using somehow gets
		1129	* removed (most likely destroyed), update the player view
		1130	* appropriately.
		1131	*/
		1132	pl->close_container ();
		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)
		1138	pl->contr->ns->floorbox_update ();
		1139	}
1092		1140
1093	for (tmp = ms.bot; tmp; tmp = tmp->above)	1141	for (tmp = ms.bot; tmp; tmp = tmp->above)
1094	{	1142	{
1095	/* 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
1096	* being removed.	1144	* being removed.
1097	*/	1145	*/
1098
1099	if (tmp->type == PLAYER && tmp != this)
1100	{
1101	/* If a container that the player is currently using somehow gets
1102	* removed (most likely destroyed), update the player view
1103	* appropriately.
1104	*/
1105	if (tmp->container == this)
1106	{
1107	flag [FLAG_APPLIED] = 0;
1108	tmp->container = 0;
1109	}
1110
1111	if (tmp->contr->ns)
1112	tmp->contr->ns->floorbox_update ();
1113	}
1114		1146
1115	/* See if object moving off should effect something */	1147	/* See if object moving off should effect something */
1116	if (check_walk_off	1148	if (check_walk_off
1117	&& ((move_type & tmp->move_off)	1149	&& ((move_type & tmp->move_off)
1118	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1150	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1150	merge_ob (object *op, object *top)	1182	merge_ob (object *op, object *top)
1151	{	1183	{
1152	if (!op->nrof)	1184	if (!op->nrof)
1153	return 0;	1185	return 0;
1154		1186
1155	if (top)	1187	if (!top)
1156	for (top = op; top && top->above; top = top->above)	1188	for (top = op; top && top->above; top = top->above)
1157	;	1189	;
1158		1190
1159	for (; top; top = top->below)	1191	for (; top; top = top->below)
1160	{
1161	if (top == op)
1162	continue;
1163
1164	if (object::can_merge (op, top))	1192	if (object::can_merge (op, top))
1165	{	1193	{
1166	top->nrof += op->nrof;	1194	top->nrof += op->nrof;
1167		1195
1168	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1196	if (object *pl = top->visible_to ())
1169	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
1170	op->destroy ();	1202	op->destroy (1);
		1203
1171	return top;	1204	return top;
1172	}	1205	}
1173	}
1174		1206
1175	return 0;	1207	return 0;
1176	}	1208	}
1177		1209
1178	void	1210	void
…		…
1237	object *	1269	object *
1238	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)
1239	{	1271	{
1240	assert (!op->flag [FLAG_FREED]);	1272	assert (!op->flag [FLAG_FREED]);
1241		1273
1242	object *top, *floor = NULL;
1243
1244	op->remove ();	1274	op->remove ();
1245
1246	#if 0
1247	if (!m->active != !op->active)
1248	if (m->active)
1249	op->activate_recursive ();
1250	else
1251	op->deactivate_recursive ();
1252	#endif
1253
1254	if (out_of_map (m, op->x, op->y))
1255	{
1256	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1257	#ifdef MANY_CORES
1258	/* Better to catch this here, as otherwise the next use of this object
1259	* is likely to cause a crash. Better to find out where it is getting
1260	* improperly inserted.
1261	*/
1262	abort ();
1263	#endif
1264	return op;
1265	}
1266
1267	if (object *more = op->more)
1268	if (!insert_ob_in_map (more, m, originator, flag))
1269	return 0;
1270
1271	CLEAR_FLAG (op, FLAG_REMOVED);
1272		1275
1273	/* Ideally, the caller figures this out. However, it complicates a lot	1276	/* Ideally, the caller figures this out. However, it complicates a lot
1274	* of areas of callers (eg, anything that uses find_free_spot would now	1277	* of areas of callers (eg, anything that uses find_free_spot would now
1275	* need extra work	1278	* need extra work
1276	*/	1279	*/
1277	if (!xy_normalise (m, op->x, op->y))	1280	if (!xy_normalise (m, op->x, op->y))
		1281	{
		1282	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1278	return 0;	1283	return 0;
		1284	}
		1285
		1286	if (object *more = op->more)
		1287	if (!insert_ob_in_map (more, m, originator, flag))
		1288	return 0;
		1289
		1290	CLEAR_FLAG (op, FLAG_REMOVED);
1279		1291
1280	op->map = m;	1292	op->map = m;
1281	mapspace &ms = op->ms ();	1293	mapspace &ms = op->ms ();
1282		1294
1283	/* this has to be done after we translate the coordinates.	1295	/* this has to be done after we translate the coordinates.
1284	*/	1296	*/
1285	if (op->nrof && !(flag & INS_NO_MERGE))	1297	if (op->nrof && !(flag & INS_NO_MERGE))
1286	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1298	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1287	if (object::can_merge (op, tmp))	1299	if (object::can_merge (op, tmp))
1288	{	1300	{
		1301	// TODO: we atcually want to update tmp, not op,
		1302	// but some caller surely breaks when we return tmp
		1303	// from here :/
1289	op->nrof += tmp->nrof;	1304	op->nrof += tmp->nrof;
1290	tmp->destroy ();	1305	tmp->destroy (1);
1291	}	1306	}
1292		1307
1293	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1308	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1294	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1309	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1295		1310
…		…
1315	/* since *below* originator, no need to update top */	1330	/* since *below* originator, no need to update top */
1316	originator->below = op;	1331	originator->below = op;
1317	}	1332	}
1318	else	1333	else
1319	{	1334	{
		1335	object *top, *floor = NULL;
		1336
1320	top = ms.bot;	1337	top = ms.bot;
1321		1338
1322	/* If there are other objects, then */	1339	/* If there are other objects, then */
1323	if ((!(flag & INS_MAP_LOAD)) && top)	1340	if (top)
1324	{	1341	{
1325	object *last = 0;	1342	object *last = 0;
1326		1343
1327	/*	1344	/*
1328	* If there are multiple objects on this space, we do some trickier handling.	1345	* If there are multiple objects on this space, we do some trickier handling.
…		…
1380	*/	1397	*/
1381	if (last && last->below && last != floor)	1398	if (last && last->below && last != floor)
1382	top = last->below;	1399	top = last->below;
1383	}	1400	}
1384	} /* If objects on this space */	1401	} /* If objects on this space */
1385	if (flag & INS_MAP_LOAD)
1386	top = ms.top;
1387		1402
1388	if (flag & INS_ABOVE_FLOOR_ONLY)	1403	if (flag & INS_ABOVE_FLOOR_ONLY)
1389	top = floor;	1404	top = floor;
1390		1405
1391	/* Top is the object that our object (op) is going to get inserted above.	1406	/* Top is the object that our object (op) is going to get inserted above.
…		…
1424	op->map->touch ();	1439	op->map->touch ();
1425	}	1440	}
1426		1441
1427	op->map->dirty = true;	1442	op->map->dirty = true;
1428		1443
1429	/* If we have a floor, we know the player, if any, will be above
1430	* it, so save a few ticks and start from there.
1431	*/
1432	if (!(flag & INS_MAP_LOAD))
1433	if (object *pl = ms.player ())	1444	if (object *pl = ms.player ())
		1445	//TODO: the floorbox prev/next might need updating
		1446	//esrv_send_item (pl, op);
		1447	//TODO: update floorbox to preserve ordering
1434	if (pl->contr->ns)	1448	if (pl->contr->ns)
1435	pl->contr->ns->floorbox_update ();	1449	pl->contr->ns->floorbox_update ();
1436		1450
1437	/* If this object glows, it may affect lighting conditions that are	1451	/* If this object glows, it may affect lighting conditions that are
1438	* visible to others on this map. But update_all_los is really	1452	* visible to others on this map. But update_all_los is really
1439	* an inefficient way to do this, as it means los for all players	1453	* an inefficient way to do this, as it means los for all players
1440	* on the map will get recalculated. The players could very well	1454	* on the map will get recalculated. The players could very well
…		…
1482	* op is the object to insert it under: supplies x and the map.	1496	* op is the object to insert it under: supplies x and the map.
1483	*/	1497	*/
1484	void	1498	void
1485	replace_insert_ob_in_map (const char *arch_string, object *op)	1499	replace_insert_ob_in_map (const char *arch_string, object *op)
1486	{	1500	{
1487	object *tmp, *tmp1;
1488
1489	/* first search for itself and remove any old instances */	1501	/* first search for itself and remove any old instances */
1490		1502
1491	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1503	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1492	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1504	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1493	tmp->destroy ();	1505	tmp->destroy (1);
1494		1506
1495	tmp1 = arch_to_object (archetype::find (arch_string));	1507	object *tmp = arch_to_object (archetype::find (arch_string));
1496		1508
1497	tmp1->x = op->x;	1509	tmp->x = op->x;
1498	tmp1->y = op->y;	1510	tmp->y = op->y;
		1511
1499	insert_ob_in_map (tmp1, op->map, op, 0);	1512	insert_ob_in_map (tmp, op->map, op, 0);
1500	}	1513	}
1501		1514
1502	object *	1515	object *
1503	object::insert_at (object *where, object *originator, int flags)	1516	object::insert_at (object *where, object *originator, int flags)
1504	{	1517	{
		1518	if (where->env)
		1519	return where->env->insert (this);
		1520	else
1505	return where->map->insert (this, where->x, where->y, originator, flags);	1521	return where->map->insert (this, where->x, where->y, originator, flags);
1506	}	1522	}
1507		1523
1508	/*	1524	/*
1509	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1510	* is returned contains nr objects, and the remaining parts contains
1511	* the rest (or is removed and freed if that number is 0).
1512	* On failure, NULL is returned, and the reason put into the
1513	* global static errmsg array.
1514	*/
1515	object *
1516	get_split_ob (object *orig_ob, uint32 nr)
1517	{
1518	object *newob;
1519	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1520
1521	if (orig_ob->nrof < nr)
1522	{
1523	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1524	return NULL;
1525	}
1526
1527	newob = object_create_clone (orig_ob);
1528
1529	if ((orig_ob->nrof -= nr) < 1)
1530	orig_ob->destroy (1);
1531	else if (!is_removed)
1532	{
1533	if (orig_ob->env != NULL)
1534	sub_weight (orig_ob->env, orig_ob->weight * nr);
1535	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1536	{
1537	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1538	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1539	return NULL;
1540	}
1541	}
1542
1543	newob->nrof = nr;
1544
1545	return newob;
1546	}
1547
1548	/*
1549	* decrease_ob_nr(object, number) decreases a specified number from	1525	* decrease(object, number) decreases a specified number from
1550	* the amount of an object. If the amount reaches 0, the object	1526	* the amount of an object. If the amount reaches 0, the object
1551	* is subsequently removed and freed.	1527	* is subsequently removed and freed.
1552	*	1528	*
1553	* Return value: 'op' if something is left, NULL if the amount reached 0	1529	* Return value: 'op' if something is left, NULL if the amount reached 0
1554	*/	1530	*/
		1531	bool
		1532	object::decrease (sint32 nr)
		1533	{
		1534	if (!nr)
		1535	return true;
		1536
		1537	nr = min (nr, nrof);
		1538
		1539	nrof -= nr;
		1540
		1541	if (nrof)
		1542	{
		1543	adjust_weight (env, -weight * nr); // carrying == 0
		1544
		1545	if (object *pl = visible_to ())
		1546	esrv_update_item (UPD_NROF, pl, this);
		1547
		1548	return true;
		1549	}
		1550	else
		1551	{
		1552	destroy (1);
		1553	return false;
		1554	}
		1555	}
		1556
		1557	/*
		1558	* split(ob,nr) splits up ob into two parts. The part which
		1559	* is returned contains nr objects, and the remaining parts contains
		1560	* the rest (or is removed and returned if that number is 0).
		1561	* On failure, NULL is returned.
		1562	*/
1555	object *	1563	object *
1556	decrease_ob_nr (object *op, uint32 i)	1564	object::split (sint32 nr)
1557	{	1565	{
1558	object *tmp;	1566	int have = number_of ();
1559		1567
1560	if (i == 0) /* objects with op->nrof require this check */	1568	if (have < nr)
1561	return op;	1569	return 0;
1562		1570	else if (have == nr)
1563	if (i > op->nrof)
1564	i = op->nrof;
1565
1566	if (QUERY_FLAG (op, FLAG_REMOVED))
1567	op->nrof -= i;
1568	else if (op->env)
1569	{	1571	{
1570	/* is this object in the players inventory, or sub container
1571	* therein?
1572	*/
1573	tmp = op->in_player ();
1574	/* nope. Is this a container the player has opened?
1575	* If so, set tmp to that player.
1576	* IMO, searching through all the players will mostly
1577	* likely be quicker than following op->env to the map,
1578	* and then searching the map for a player.
1579	*/
1580	if (!tmp)
1581	for_all_players (pl)
1582	if (pl->ob->container == op->env)
1583	{
1584	tmp = pl->ob;
1585	break;
1586	}
1587
1588	if (i < op->nrof)
1589	{
1590	sub_weight (op->env, op->weight * i);
1591	op->nrof -= i;
1592	if (tmp)
1593	esrv_send_item (tmp, op);
1594	}
1595	else
1596	{
1597	op->remove ();	1572	remove ();
1598	op->nrof = 0;	1573	return this;
1599	if (tmp)
1600	esrv_del_item (tmp->contr, op->count);
1601	}
1602	}	1574	}
1603	else	1575	else
1604	{	1576	{
1605	object *above = op->above;	1577	decrease (nr);
1606		1578
1607	if (i < op->nrof)	1579	object *op = deep_clone ();
1608	op->nrof -= i;	1580	op->nrof = nr;
1609	else
1610	{
1611	op->remove ();
1612	op->nrof = 0;
1613	}
1614
1615	/* Since we just removed op, op->above is null */
1616	for (tmp = above; tmp; tmp = tmp->above)
1617	if (tmp->type == PLAYER)
1618	{
1619	if (op->nrof)
1620	esrv_send_item (tmp, op);
1621	else
1622	esrv_del_item (tmp->contr, op->count);
1623	}
1624	}
1625
1626	if (op->nrof)
1627	return op;	1581	return op;
1628	else
1629	{
1630	op->destroy ();
1631	return 0;
1632	}
1633	}
1634
1635	/*
1636	* add_weight(object, weight) adds the specified weight to an object,
1637	* and also updates how much the environment(s) is/are carrying.
1638	*/
1639	void
1640	add_weight (object *op, signed long weight)
1641	{
1642	while (op != NULL)
1643	{
1644	if (op->type == CONTAINER)
1645	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1646
1647	op->carrying += weight;
1648	op = op->env;
1649	}	1582	}
1650	}	1583	}
1651		1584
1652	object *	1585	object *
1653	insert_ob_in_ob (object *op, object *where)	1586	insert_ob_in_ob (object *op, object *where)
…		…
1678	* be != op, if items are merged. -Tero	1611	* be != op, if items are merged. -Tero
1679	*/	1612	*/
1680	object *	1613	object *
1681	object::insert (object *op)	1614	object::insert (object *op)
1682	{	1615	{
1683	object *tmp, *otmp;
1684
1685	if (!QUERY_FLAG (op, FLAG_REMOVED))
1686	op->remove ();
1687
1688	if (op->more)	1616	if (op->more)
1689	{	1617	{
1690	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1618	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1691	return op;	1619	return op;
1692	}	1620	}
1693		1621
1694	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1622	op->remove ();
1695	CLEAR_FLAG (op, FLAG_REMOVED);	1623
		1624	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1625
1696	if (op->nrof)	1626	if (op->nrof)
1697	{
1698	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1627	for (object *tmp = inv; tmp; tmp = tmp->below)
1699	if (object::can_merge (tmp, op))	1628	if (object::can_merge (tmp, op))
1700	{	1629	{
1701	/* return the original object and remove inserted object	1630	/* return the original object and remove inserted object
1702	(client needs the original object) */	1631	(client needs the original object) */
1703	tmp->nrof += op->nrof;	1632	tmp->nrof += op->nrof;
1704	/* Weight handling gets pretty funky. Since we are adding to	1633
1705	* tmp->nrof, we need to increase the weight.	1634	if (object *pl = tmp->visible_to ())
1706	*/	1635	esrv_update_item (UPD_NROF, pl, tmp);
		1636
1707	add_weight (this, op->weight * op->nrof);	1637	adjust_weight (this, op->total_weight ());
1708	SET_FLAG (op, FLAG_REMOVED);	1638
1709	op->destroy (); /* free the inserted object */	1639	op->destroy (1);
1710	op = tmp;	1640	op = tmp;
1711	op->remove (); /* and fix old object's links */	1641	goto inserted;
1712	CLEAR_FLAG (op, FLAG_REMOVED);
1713	break;
1714	}	1642	}
1715		1643
1716	/* I assume combined objects have no inventory	1644	op->owner = 0; // it's his/hers now. period.
1717	* We add the weight - this object could have just been removed
1718	* (if it was possible to merge). calling remove_ob will subtract
1719	* the weight, so we need to add it in again, since we actually do
1720	* the linking below
1721	*/
1722	add_weight (this, op->weight * op->nrof);
1723	}
1724	else
1725	add_weight (this, (op->weight + op->carrying));
1726
1727	otmp = this->in_player ();
1728	if (otmp && otmp->contr)
1729	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1730	otmp->update_stats ();
1731
1732	op->map = 0;	1645	op->map = 0;
1733	op->env = this;	1646	op->x = 0;
		1647	op->y = 0;
		1648
1734	op->above = 0;	1649	op->above = 0;
1735	op->below = 0;	1650	op->below = inv;
1736	op->x = 0, op->y = 0;	1651	op->env = this;
1737		1652
		1653	if (inv)
		1654	inv->above = op;
		1655
		1656	inv = op;
		1657
		1658	op->flag [FLAG_REMOVED] = 0;
		1659
		1660	if (object *pl = op->visible_to ())
		1661	esrv_send_item (pl, op);
		1662
		1663	adjust_weight (this, op->total_weight ());
		1664
		1665	inserted:
1738	/* reset the light list and los of the players on the map */	1666	/* reset the light list and los of the players on the map */
1739	if ((op->glow_radius != 0) && map)	1667	if (op->glow_radius && map && map->darkness)
1740	{
1741	#ifdef DEBUG_LIGHTS
1742	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1743	#endif /* DEBUG_LIGHTS */
1744	if (map->darkness)
1745	update_all_los (map, x, y);	1668	update_all_los (map, x, y);
1746	}
1747		1669
1748	/* Client has no idea of ordering so lets not bother ordering it here.	1670	// if this is a player's inventory, update stats
1749	* It sure simplifies this function...	1671	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1750	*/	1672	update_stats ();
1751	if (!inv)
1752	inv = op;
1753	else
1754	{
1755	op->below = inv;
1756	op->below->above = op;
1757	inv = op;
1758	}
1759		1673
1760	INVOKE_OBJECT (INSERT, this);	1674	INVOKE_OBJECT (INSERT, this);
1761		1675
1762	return op;	1676	return op;
1763	}	1677	}
…		…
1891	LOG (llevError, "Present_arch called outside map.\n");	1805	LOG (llevError, "Present_arch called outside map.\n");
1892	return NULL;	1806	return NULL;
1893	}	1807	}
1894		1808
1895	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1809	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1896	if (tmp->arch == at)	1810	if (tmp->arch->archname == at->archname)
1897	return tmp;	1811	return tmp;
1898		1812
1899	return NULL;	1813	return NULL;
1900	}	1814	}
1901		1815
…		…
1965	* The first matching object is returned, or NULL if none.	1879	* The first matching object is returned, or NULL if none.
1966	*/	1880	*/
1967	object *	1881	object *
1968	present_arch_in_ob (const archetype *at, const object *op)	1882	present_arch_in_ob (const archetype *at, const object *op)
1969	{	1883	{
1970	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1884	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1971	if (tmp->arch == at)	1885	if (tmp->arch->archname == at->archname)
1972	return tmp;	1886	return tmp;
1973		1887
1974	return NULL;	1888	return NULL;
1975	}	1889	}
1976		1890
…		…
1978	* activate recursively a flag on an object inventory	1892	* activate recursively a flag on an object inventory
1979	*/	1893	*/
1980	void	1894	void
1981	flag_inv (object *op, int flag)	1895	flag_inv (object *op, int flag)
1982	{	1896	{
1983	if (op->inv)
1984	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1897	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1985	{	1898	{
1986	SET_FLAG (tmp, flag);	1899	SET_FLAG (tmp, flag);
1987	flag_inv (tmp, flag);	1900	flag_inv (tmp, flag);
1988	}	1901	}
1989	}	1902	}
1990		1903
1991	/*	1904	/*
1992	* deactivate recursively a flag on an object inventory	1905	* deactivate recursively a flag on an object inventory
1993	*/	1906	*/
1994	void	1907	void
1995	unflag_inv (object *op, int flag)	1908	unflag_inv (object *op, int flag)
1996	{	1909	{
1997	if (op->inv)
1998	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1910	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1999	{	1911	{
2000	CLEAR_FLAG (tmp, flag);	1912	CLEAR_FLAG (tmp, flag);
2001	unflag_inv (tmp, flag);	1913	unflag_inv (tmp, flag);
2002	}	1914	}
2003	}	1915	}
2004		1916
2005	/*	1917	/*
2006	* find_free_spot(object, map, x, y, start, stop) will search for	1918	* find_free_spot(object, map, x, y, start, stop) will search for
2007	* a spot at the given map and coordinates which will be able to contain	1919	* a spot at the given map and coordinates which will be able to contain
…		…
2009	* to search (see the freearr_x/y[] definition).	1921	* to search (see the freearr_x/y[] definition).
2010	* It returns a random choice among the alternatives found.	1922	* It returns a random choice among the alternatives found.
2011	* start and stop are where to start relative to the free_arr array (1,9	1923	* start and stop are where to start relative to the free_arr array (1,9
2012	* does all 4 immediate directions). This returns the index into the	1924	* does all 4 immediate directions). This returns the index into the
2013	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1925	* array of the free spot, -1 if no spot available (dir 0 = x,y)
2014	* Note - this only checks to see if there is space for the head of the
2015	* object - if it is a multispace object, this should be called for all
2016	* pieces.
2017	* Note2: This function does correctly handle tiled maps, but does not	1926	* Note: This function does correctly handle tiled maps, but does not
2018	* inform the caller. However, insert_ob_in_map will update as	1927	* inform the caller. However, insert_ob_in_map will update as
2019	* necessary, so the caller shouldn't need to do any special work.	1928	* necessary, so the caller shouldn't need to do any special work.
2020	* Note - updated to take an object instead of archetype - this is necessary	1929	* Note - updated to take an object instead of archetype - this is necessary
2021	* because arch_blocked (now ob_blocked) needs to know the movement type	1930	* because arch_blocked (now ob_blocked) needs to know the movement type
2022	* to know if the space in question will block the object. We can't use	1931	* to know if the space in question will block the object. We can't use
…		…
2024	* customized, changed states, etc.	1933	* customized, changed states, etc.
2025	*/	1934	*/
2026	int	1935	int
2027	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1936	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2028	{	1937	{
		1938	int altern[SIZEOFFREE];
2029	int index = 0, flag;	1939	int index = 0, flag;
2030	int altern[SIZEOFFREE];
2031		1940
2032	for (int i = start; i < stop; i++)	1941	for (int i = start; i < stop; i++)
2033	{	1942	{
2034	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1943	mapxy pos (m, x, y); pos.move (i);
2035	if (!flag)	1944
		1945	if (!pos.normalise ())
		1946	continue;
		1947
		1948	mapspace &ms = *pos;
		1949
		1950	if (ms.flags () & P_IS_ALIVE)
		1951	continue;
		1952
		1953	/* However, often
		1954	* ob doesn't have any move type (when used to place exits)
		1955	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1956	*/
		1957	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1958	{
2036	altern [index++] = i;	1959	altern [index++] = i;
		1960	continue;
		1961	}
2037		1962
2038	/* Basically, if we find a wall on a space, we cut down the search size.	1963	/* Basically, if we find a wall on a space, we cut down the search size.
2039	* In this way, we won't return spaces that are on another side of a wall.	1964	* In this way, we won't return spaces that are on another side of a wall.
2040	* This mostly work, but it cuts down the search size in all directions -	1965	* This mostly work, but it cuts down the search size in all directions -
2041	* if the space being examined only has a wall to the north and empty	1966	* if the space being examined only has a wall to the north and empty
2042	* spaces in all the other directions, this will reduce the search space	1967	* spaces in all the other directions, this will reduce the search space
2043	* to only the spaces immediately surrounding the target area, and	1968	* to only the spaces immediately surrounding the target area, and
2044	* won't look 2 spaces south of the target space.	1969	* won't look 2 spaces south of the target space.
2045	*/	1970	*/
2046	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1971	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1972	{
2047	stop = maxfree[i];	1973	stop = maxfree[i];
		1974	continue;
		1975	}
		1976
		1977	/* Note it is intentional that we check ob - the movement type of the
		1978	* head of the object should correspond for the entire object.
		1979	*/
		1980	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1981	continue;
		1982
		1983	if (ob->blocked (m, pos.x, pos.y))
		1984	continue;
		1985
		1986	altern [index++] = i;
2048	}	1987	}
2049		1988
2050	if (!index)	1989	if (!index)
2051	return -1;	1990	return -1;
2052		1991
…		…
2061	*/	2000	*/
2062	int	2001	int
2063	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2002	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2064	{	2003	{
2065	for (int i = 0; i < SIZEOFFREE; i++)	2004	for (int i = 0; i < SIZEOFFREE; i++)
2066	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2005	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2067	return i;	2006	return i;
2068		2007
2069	return -1;	2008	return -1;
2070	}	2009	}
2071		2010
…		…
2348	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2287	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2349	* core dumps if they do.	2288	* core dumps if they do.
2350	*	2289	*
2351	* Add a check so we can't pick up invisible objects (0.93.8)	2290	* Add a check so we can't pick up invisible objects (0.93.8)
2352	*/	2291	*/
2353
2354	int	2292	int
2355	can_pick (const object *who, const object *item)	2293	can_pick (const object *who, const object *item)
2356	{	2294	{
2357	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2295	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2358	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2296	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2361		2299
2362	/*	2300	/*
2363	* create clone from object to another	2301	* create clone from object to another
2364	*/	2302	*/
2365	object *	2303	object *
2366	object_create_clone (object *asrc)	2304	object::deep_clone ()
2367	{	2305	{
2368	object *dst = 0, *tmp, *src, *prev, *item;	2306	assert (("deep_clone called on non-head object", is_head ()));
2369		2307
2370	if (!asrc)	2308	object *dst = clone ();
2371	return 0;
2372		2309
2373	src = asrc->head_ ();	2310	object *prev = dst;
2374
2375	prev = 0;
2376	for (object *part = src; part; part = part->more)	2311	for (object *part = this->more; part; part = part->more)
2377	{	2312	{
2378	tmp = part->clone ();	2313	object *tmp = part->clone ();
2379	tmp->x -= src->x;
2380	tmp->y -= src->y;
2381
2382	if (!part->head)
2383	{
2384	dst = tmp;
2385	tmp->head = 0;
2386	}
2387	else
2388	tmp->head = dst;	2314	tmp->head = dst;
2389
2390	tmp->more = 0;
2391
2392	if (prev)
2393	prev->more = tmp;	2315	prev->more = tmp;
2394
2395	prev = tmp;	2316	prev = tmp;
2396	}	2317	}
2397		2318
2398	for (item = src->inv; item; item = item->below)	2319	for (object *item = inv; item; item = item->below)
2399	insert_ob_in_ob (object_create_clone (item), dst);	2320	insert_ob_in_ob (item->deep_clone (), dst);
2400		2321
2401	return dst;	2322	return dst;
2402	}	2323	}
2403		2324
2404	/* This returns the first object in who's inventory that	2325	/* This returns the first object in who's inventory that
…		…
2413	return tmp;	2334	return tmp;
2414		2335
2415	return 0;	2336	return 0;
2416	}	2337	}
2417		2338
2418	/* If ob has a field named key, return the link from the list,	2339	const shstr &
2419	* otherwise return NULL.	2340	object::kv_get (const shstr &key) const
2420	*
2421	* key must be a passed in shared string - otherwise, this won't
2422	* do the desired thing.
2423	*/
2424	key_value *
2425	get_ob_key_link (const object *ob, const char *key)
2426	{	2341	{
2427	for (key_value *link = ob->key_values; link; link = link->next)	2342	for (key_value *kv = key_values; kv; kv = kv->next)
2428	if (link->key == key)	2343	if (kv->key == key)
2429	return link;
2430
2431	return 0;
2432	}
2433
2434	/*
2435	* Returns the value of op has an extra_field for key, or NULL.
2436	*
2437	* The argument doesn't need to be a shared string.
2438	*
2439	* The returned string is shared.
2440	*/
2441	const char *
2442	get_ob_key_value (const object *op, const char *const key)
2443	{
2444	key_value *link;
2445	shstr_cmp canonical_key (key);
2446
2447	if (!canonical_key)
2448	{
2449	/* 1. There being a field named key on any object
2450	* implies there'd be a shared string to find.
2451	* 2. Since there isn't, no object has this field.
2452	* 3. Therefore, *this* object doesn't have this field.
2453	*/
2454	return 0;
2455	}
2456
2457	/* This is copied from get_ob_key_link() above -
2458	* only 4 lines, and saves the function call overhead.
2459	*/
2460	for (link = op->key_values; link; link = link->next)
2461	if (link->key == canonical_key)
2462	return link->value;	2344	return kv->value;
2463		2345
2464	return 0;	2346	return shstr_null;
2465	}	2347	}
2466		2348
2467	/*	2349	void
2468	* Updates the canonical_key in op to value.	2350	object::kv_set (const shstr &key, const shstr &value)
2469	*
2470	* canonical_key is a shared string (value doesn't have to be).
2471	*
2472	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2473	* keys.
2474	*
2475	* Returns TRUE on success.
2476	*/
2477	int
2478	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2479	{	2351	{
2480	key_value *field = NULL, *last = NULL;	2352	for (key_value *kv = key_values; kv; kv = kv->next)
2481		2353	if (kv->key == key)
2482	for (field = op->key_values; field != NULL; field = field->next)
2483	{
2484	if (field->key != canonical_key)
2485	{	2354	{
2486	last = field;	2355	kv->value = value;
2487	continue;	2356	return;
2488	}	2357	}
2489		2358
2490	if (value)	2359	key_value *kv = new key_value;
2491	field->value = value;	2360
2492	else	2361	kv->next = key_values;
		2362	kv->key = key;
		2363	kv->value = value;
		2364
		2365	key_values = kv;
		2366	}
		2367
		2368	void
		2369	object::kv_del (const shstr &key)
		2370	{
		2371	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2372	if ((*kvp)->key == key)
2493	{	2373	{
2494	/* Basically, if the archetype has this key set,	2374	key_value *kv = *kvp;
2495	* we need to store the null value so when we save	2375	*kvp = (*kvp)->next;
2496	* it, we save the empty value so that when we load,	2376	delete kv;
2497	* we get this value back again.	2377	return;
2498	*/
2499	if (get_ob_key_link (op->arch, canonical_key))
2500	field->value = 0;
2501	else
2502	{
2503	if (last)
2504	last->next = field->next;
2505	else
2506	op->key_values = field->next;
2507
2508	delete field;
2509	}
2510	}	2378	}
2511	return TRUE;
2512	}
2513	/* IF we get here, key doesn't exist */
2514
2515	/* No field, we'll have to add it. */
2516
2517	if (!add_key)
2518	return FALSE;
2519
2520	/* There isn't any good reason to store a null
2521	* value in the key/value list. If the archetype has
2522	* this key, then we should also have it, so shouldn't
2523	* be here. If user wants to store empty strings,
2524	* should pass in ""
2525	*/
2526	if (value == NULL)
2527	return TRUE;
2528
2529	field = new key_value;
2530
2531	field->key = canonical_key;
2532	field->value = value;
2533	/* Usual prepend-addition. */
2534	field->next = op->key_values;
2535	op->key_values = field;
2536
2537	return TRUE;
2538	}
2539
2540	/*
2541	* Updates the key in op to value.
2542	*
2543	* If add_key is FALSE, this will only update existing keys,
2544	* and not add new ones.
2545	* In general, should be little reason FALSE is ever passed in for add_key
2546	*
2547	* Returns TRUE on success.
2548	*/
2549	int
2550	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2551	{
2552	shstr key_ (key);
2553
2554	return set_ob_key_value_s (op, key_, value, add_key);
2555	}	2379	}
2556		2380
2557	object::depth_iterator::depth_iterator (object *container)	2381	object::depth_iterator::depth_iterator (object *container)
2558	: iterator_base (container)	2382	: iterator_base (container)
2559	{	2383	{
…		…
2609	{	2433	{
2610	char flagdesc[512];	2434	char flagdesc[512];
2611	char info2[256 * 4];	2435	char info2[256 * 4];
2612	char *p = info;	2436	char *p = info;
2613		2437
2614	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2438	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2615	count, uuid.seq,	2439	count,
		2440	uuid.c_str (),
2616	&name,	2441	&name,
2617	title ? "\",title:\"" : "",	2442	title ? "\",title:\"" : "",
2618	title ? (const char *)title : "",	2443	title ? (const char *)title : "",
2619	flag_desc (flagdesc, 512), type);	2444	flag_desc (flagdesc, 512), type);
2620		2445
2621	if (env)	2446	if (!flag[FLAG_REMOVED] && env)
2622	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2447	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2623		2448
2624	if (map)	2449	if (map)
2625	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2450	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2626		2451
…		…
2656	object::open_container (object *new_container)	2481	object::open_container (object *new_container)
2657	{	2482	{
2658	if (container == new_container)	2483	if (container == new_container)
2659	return;	2484	return;
2660		2485
2661	if (object *old_container = container)	2486	object *old_container = container;
		2487
		2488	if (old_container)
2662	{	2489	{
2663	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2490	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2664	return;	2491	return;
2665		2492
2666	#if 0	2493	#if 0
…		…
2668	if (object *closer = old_container->inv)	2495	if (object *closer = old_container->inv)
2669	if (closer->type == CLOSE_CON)	2496	if (closer->type == CLOSE_CON)
2670	closer->destroy ();	2497	closer->destroy ();
2671	#endif	2498	#endif
2672		2499
		2500	// make sure the container is available
		2501	esrv_send_item (this, old_container);
		2502
2673	old_container->flag [FLAG_APPLIED] = 0;	2503	old_container->flag [FLAG_APPLIED] = false;
2674	container = 0;	2504	container = 0;
2675		2505
		2506	// client needs item update to make it work, client bug requires this to be separate
2676	esrv_update_item (UPD_FLAGS, this, old_container);	2507	esrv_update_item (UPD_FLAGS, this, old_container);
		2508
2677	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2509	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2510	play_sound (sound_find ("chest_close"));
2678	}	2511	}
2679		2512
2680	if (new_container)	2513	if (new_container)
2681	{	2514	{
2682	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))	2515	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
…		…
2693	}	2526	}
2694	#endif	2527	#endif
2695		2528
2696	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2529	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2697		2530
		2531	// make sure the container is available, client bug requires this to be separate
		2532	esrv_send_item (this, new_container);
		2533
2698	new_container->flag [FLAG_APPLIED] = 1;	2534	new_container->flag [FLAG_APPLIED] = true;
2699	container = new_container;	2535	container = new_container;
2700		2536
		2537	// client needs flag change
2701	esrv_update_item (UPD_FLAGS, this, new_container);	2538	esrv_update_item (UPD_FLAGS, this, new_container);
2702	esrv_send_inventory (this, new_container);	2539	esrv_send_inventory (this, new_container);
		2540	play_sound (sound_find ("chest_open"));
2703	}	2541	}
		2542	// else if (!old_container->env && contr && contr->ns)
		2543	// contr->ns->floorbox_reset ();
2704	}	2544	}
2705		2545
2706	object *	2546	object *
2707	object::force_find (const shstr name)	2547	object::force_find (const shstr name)
2708	{	2548	{
…		…
2733	force->flag [FLAG_APPLIED] = true;	2573	force->flag [FLAG_APPLIED] = true;
2734		2574
2735	insert (force);	2575	insert (force);
2736	}	2576	}
2737		2577
		2578	void
		2579	object::play_sound (faceidx sound)
		2580	{
		2581	if (!sound)
		2582	return;
		2583
		2584	if (flag [FLAG_REMOVED])
		2585	return;
		2586
		2587	if (env)
		2588	{
		2589	if (object *pl = in_player ())
		2590	pl->contr->play_sound (sound);
		2591	}
		2592	else
		2593	map->play_sound (sound, x, y);
		2594	}
		2595

Diff Legend

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