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.180 by root, Wed Aug 15 04:59:46 2007 UTC vs.
Revision 1.235 by root, Tue May 6 20:00:12 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
965	if (is_head ())	1017	if (is_head ())
966	if (sound_destroy)	1018	if (sound_destroy)
967	play_sound (sound_destroy);	1019	play_sound (sound_destroy);
968	else if (flag [FLAG_MONSTER])	1020	else if (flag [FLAG_MONSTER])
969	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
970		1022
971	attachable::destroy ();	1023	attachable::destroy ();
972	}
973
974	/*
975	* sub_weight() recursively (outwards) subtracts a number from the
976	* weight of an object (and what is carried by it's environment(s)).
977	*/
978	void
979	sub_weight (object *op, signed long weight)
980	{
981	while (op != NULL)
982	{
983	if (op->type == CONTAINER)
984	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
985
986	op->carrying -= weight;
987	op = op->env;
988	}
989	}	1024	}
990		1025
991	/* op->remove ():	1026	/* op->remove ():
992	* 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
993	* 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
…		…
999	object::do_remove ()	1034	object::do_remove ()
1000	{	1035	{
1001	object *tmp, *last = 0;	1036	object *tmp, *last = 0;
1002	object *otmp;	1037	object *otmp;
1003		1038
1004	if (QUERY_FLAG (this, FLAG_REMOVED))	1039	if (flag [FLAG_REMOVED])
1005	return;	1040	return;
1006		1041
1007	SET_FLAG (this, FLAG_REMOVED);
1008	INVOKE_OBJECT (REMOVE, this);	1042	INVOKE_OBJECT (REMOVE, this);
		1043
		1044	flag [FLAG_REMOVED] = true;
1009		1045
1010	if (more)	1046	if (more)
1011	more->remove ();	1047	more->remove ();
1012		1048
1013	/*	1049	/*
1014	* In this case, the object to be removed is in someones	1050	* In this case, the object to be removed is in someones
1015	* inventory.	1051	* inventory.
1016	*/	1052	*/
1017	if (env)	1053	if (env)
1018	{	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
1019	if (nrof)	1064	if (below)
1020	sub_weight (env, weight * nrof);	1065	below->above = above;
1021	else	1066
1022	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;
1023		1077
1024	/* 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
1025	* made to players inventory. If set, avoiding the call	1079	* made to players inventory. If set, avoiding the call
1026	* to save cpu time.	1080	* to save cpu time.
1027	*/	1081	*/
1028	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))
1029	otmp->update_stats ();	1083	otmp->update_stats ();
1030
1031	if (above)
1032	above->below = below;
1033	else
1034	env->inv = below;
1035
1036	if (below)
1037	below->above = above;
1038
1039	/* we set up values so that it could be inserted into
1040	* the map, but we don't actually do that - it is up
1041	* to the caller to decide what we want to do.
1042	*/
1043	x = env->x, y = env->y;
1044	map = env->map;
1045	above = 0, below = 0;
1046	env = 0;
1047	}	1084	}
1048	else if (map)	1085	else if (map)
1049	{	1086	{
1050	if (type == PLAYER)
1051	{
1052	// leaving a spot always closes any open container on the ground
1053	if (container && !container->env)
1054	// this causes spurious floorbox updates, but it ensures
1055	// that the CLOSE event is being sent.
1056	close_container ();
1057
1058	--map->players;
1059	map->touch ();
1060	}
1061
1062	map->dirty = true;	1087	map->dirty = true;
1063	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	}
1064		1111
1065	/* link the object above us */	1112	/* link the object above us */
1066	if (above)	1113	if (above)
1067	above->below = below;	1114	above->below = below;
1068	else	1115	else
…		…
1070		1117
1071	/* Relink the object below us, if there is one */	1118	/* Relink the object below us, if there is one */
1072	if (below)	1119	if (below)
1073	below->above = above;	1120	below->above = above;
1074	else	1121	else
1075	{	1122	ms.bot = above;
1076	/* Nothing below, which means we need to relink map object for this space
1077	* use translated coordinates in case some oddness with map tiling is
1078	* evident
1079	*/
1080	if (GET_MAP_OB (map, x, y) != this)
1081	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 ());
1082
1083	ms.bot = above; /* goes on above it. */
1084	}
1085		1123
1086	above = 0;	1124	above = 0;
1087	below = 0;	1125	below = 0;
1088		1126
1089	if (map->in_memory == MAP_SAVING)	1127	if (map->in_memory == MAP_SAVING)
…		…
1098	* removed (most likely destroyed), update the player view	1136	* removed (most likely destroyed), update the player view
1099	* appropriately.	1137	* appropriately.
1100	*/	1138	*/
1101	pl->close_container ();	1139	pl->close_container ();
1102		1140
		1141	//TODO: the floorbox prev/next might need updating
		1142	//esrv_del_item (pl->contr, count);
		1143	//TODO: update floorbox to preserve ordering
		1144	if (pl->contr->ns)
1103	pl->contr->ns->floorbox_update ();	1145	pl->contr->ns->floorbox_update ();
1104	}	1146	}
1105		1147
1106	for (tmp = ms.bot; tmp; tmp = tmp->above)	1148	for (tmp = ms.bot; tmp; tmp = tmp->above)
1107	{	1149	{
1108	/* No point updating the players look faces if he is the object	1150	/* No point updating the players look faces if he is the object
…		…
1147	merge_ob (object *op, object *top)	1189	merge_ob (object *op, object *top)
1148	{	1190	{
1149	if (!op->nrof)	1191	if (!op->nrof)
1150	return 0;	1192	return 0;
1151		1193
1152	if (top)	1194	if (!top)
1153	for (top = op; top && top->above; top = top->above)	1195	for (top = op; top && top->above; top = top->above)
1154	;	1196	;
1155		1197
1156	for (; top; top = top->below)	1198	for (; top; top = top->below)
1157	{
1158	if (top == op)
1159	continue;
1160
1161	if (object::can_merge (op, top))	1199	if (object::can_merge (op, top))
1162	{	1200	{
1163	top->nrof += op->nrof;	1201	top->nrof += op->nrof;
1164		1202
1165	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1203	if (object *pl = top->visible_to ())
1166	op->weight = 0; /* Don't want any adjustements now */	1204	esrv_update_item (UPD_NROF, pl, top);
		1205
		1206	op->weight = 0; // cancel the addition above
		1207	op->carrying = 0; // must be 0 already
		1208
1167	op->destroy ();	1209	op->destroy (1);
		1210
1168	return top;	1211	return top;
1169	}	1212	}
1170	}
1171		1213
1172	return 0;	1214	return 0;
1173	}	1215	}
1174		1216
1175	void	1217	void
…		…
1234	object *	1276	object *
1235	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1277	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1236	{	1278	{
1237	assert (!op->flag [FLAG_FREED]);	1279	assert (!op->flag [FLAG_FREED]);
1238		1280
1239	object *top, *floor = NULL;
1240
1241	op->remove ();	1281	op->remove ();
1242
1243	if (out_of_map (m, op->x, op->y))
1244	{
1245	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1246	#ifdef MANY_CORES
1247	/* Better to catch this here, as otherwise the next use of this object
1248	* is likely to cause a crash. Better to find out where it is getting
1249	* improperly inserted.
1250	*/
1251	abort ();
1252	#endif
1253	return op;
1254	}
1255
1256	if (object *more = op->more)
1257	if (!insert_ob_in_map (more, m, originator, flag))
1258	return 0;
1259
1260	CLEAR_FLAG (op, FLAG_REMOVED);
1261		1282
1262	/* Ideally, the caller figures this out. However, it complicates a lot	1283	/* Ideally, the caller figures this out. However, it complicates a lot
1263	* of areas of callers (eg, anything that uses find_free_spot would now	1284	* of areas of callers (eg, anything that uses find_free_spot would now
1264	* need extra work	1285	* need extra work
1265	*/	1286	*/
1266	if (!xy_normalise (m, op->x, op->y))	1287	if (!xy_normalise (m, op->x, op->y))
		1288	{
		1289	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1267	return 0;	1290	return 0;
		1291	}
		1292
		1293	if (object *more = op->more)
		1294	if (!insert_ob_in_map (more, m, originator, flag))
		1295	return 0;
		1296
		1297	CLEAR_FLAG (op, FLAG_REMOVED);
1268		1298
1269	op->map = m;	1299	op->map = m;
1270	mapspace &ms = op->ms ();	1300	mapspace &ms = op->ms ();
1271		1301
1272	/* this has to be done after we translate the coordinates.	1302	/* this has to be done after we translate the coordinates.
1273	*/	1303	*/
1274	if (op->nrof && !(flag & INS_NO_MERGE))	1304	if (op->nrof && !(flag & INS_NO_MERGE))
1275	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1305	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1276	if (object::can_merge (op, tmp))	1306	if (object::can_merge (op, tmp))
1277	{	1307	{
		1308	// TODO: we atcually want to update tmp, not op,
		1309	// but some caller surely breaks when we return tmp
		1310	// from here :/
1278	op->nrof += tmp->nrof;	1311	op->nrof += tmp->nrof;
1279	tmp->destroy ();	1312	tmp->destroy (1);
1280	}	1313	}
1281		1314
1282	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1315	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1283	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1316	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1284		1317
…		…
1304	/* since *below* originator, no need to update top */	1337	/* since *below* originator, no need to update top */
1305	originator->below = op;	1338	originator->below = op;
1306	}	1339	}
1307	else	1340	else
1308	{	1341	{
		1342	object *top, *floor = NULL;
		1343
1309	top = ms.bot;	1344	top = ms.bot;
1310		1345
1311	/* If there are other objects, then */	1346	/* If there are other objects, then */
1312	if ((!(flag & INS_MAP_LOAD)) && top)	1347	if (top)
1313	{	1348	{
1314	object *last = 0;	1349	object *last = 0;
1315		1350
1316	/*	1351	/*
1317	* If there are multiple objects on this space, we do some trickier handling.	1352	* If there are multiple objects on this space, we do some trickier handling.
…		…
1369	*/	1404	*/
1370	if (last && last->below && last != floor)	1405	if (last && last->below && last != floor)
1371	top = last->below;	1406	top = last->below;
1372	}	1407	}
1373	} /* If objects on this space */	1408	} /* If objects on this space */
1374	if (flag & INS_MAP_LOAD)
1375	top = ms.top;
1376		1409
1377	if (flag & INS_ABOVE_FLOOR_ONLY)	1410	if (flag & INS_ABOVE_FLOOR_ONLY)
1378	top = floor;	1411	top = floor;
1379		1412
1380	/* Top is the object that our object (op) is going to get inserted above.	1413	/* Top is the object that our object (op) is going to get inserted above.
…		…
1413	op->map->touch ();	1446	op->map->touch ();
1414	}	1447	}
1415		1448
1416	op->map->dirty = true;	1449	op->map->dirty = true;
1417		1450
1418	if (!(flag & INS_MAP_LOAD))
1419	if (object *pl = ms.player ())	1451	if (object *pl = ms.player ())
		1452	//TODO: the floorbox prev/next might need updating
		1453	//esrv_send_item (pl, op);
		1454	//TODO: update floorbox to preserve ordering
		1455	if (pl->contr->ns)
1420	pl->contr->ns->floorbox_update ();	1456	pl->contr->ns->floorbox_update ();
1421		1457
1422	/* If this object glows, it may affect lighting conditions that are	1458	/* If this object glows, it may affect lighting conditions that are
1423	* visible to others on this map. But update_all_los is really	1459	* visible to others on this map. But update_all_los is really
1424	* an inefficient way to do this, as it means los for all players	1460	* an inefficient way to do this, as it means los for all players
…		…
1467	* op is the object to insert it under: supplies x and the map.	1503	* op is the object to insert it under: supplies x and the map.
1468	*/	1504	*/
1469	void	1505	void
1470	replace_insert_ob_in_map (const char *arch_string, object *op)	1506	replace_insert_ob_in_map (const char *arch_string, object *op)
1471	{	1507	{
1472	object *tmp, *tmp1;
1473
1474	/* first search for itself and remove any old instances */	1508	/* first search for itself and remove any old instances */
1475		1509
1476	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1510	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1477	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1511	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1478	tmp->destroy ();	1512	tmp->destroy (1);
1479		1513
1480	tmp1 = arch_to_object (archetype::find (arch_string));	1514	object *tmp = arch_to_object (archetype::find (arch_string));
1481		1515
1482	tmp1->x = op->x;	1516	tmp->x = op->x;
1483	tmp1->y = op->y;	1517	tmp->y = op->y;
		1518
1484	insert_ob_in_map (tmp1, op->map, op, 0);	1519	insert_ob_in_map (tmp, op->map, op, 0);
1485	}	1520	}
1486		1521
1487	object *	1522	object *
1488	object::insert_at (object *where, object *originator, int flags)	1523	object::insert_at (object *where, object *originator, int flags)
1489	{	1524	{
		1525	if (where->env)
		1526	return where->env->insert (this);
		1527	else
1490	return where->map->insert (this, where->x, where->y, originator, flags);	1528	return where->map->insert (this, where->x, where->y, originator, flags);
1491	}	1529	}
1492		1530
1493	/*	1531	/*
1494	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1495	* is returned contains nr objects, and the remaining parts contains
1496	* the rest (or is removed and freed if that number is 0).
1497	* On failure, NULL is returned, and the reason put into the
1498	* global static errmsg array.
1499	*/
1500	object *
1501	get_split_ob (object *orig_ob, uint32 nr)
1502	{
1503	object *newob;
1504	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1505
1506	if (orig_ob->nrof < nr)
1507	{
1508	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1509	return NULL;
1510	}
1511
1512	newob = object_create_clone (orig_ob);
1513
1514	if ((orig_ob->nrof -= nr) < 1)
1515	orig_ob->destroy (1);
1516	else if (!is_removed)
1517	{
1518	if (orig_ob->env != NULL)
1519	sub_weight (orig_ob->env, orig_ob->weight * nr);
1520	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1521	{
1522	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1523	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1524	return NULL;
1525	}
1526	}
1527
1528	newob->nrof = nr;
1529
1530	return newob;
1531	}
1532
1533	/*
1534	* decrease_ob_nr(object, number) decreases a specified number from	1532	* decrease(object, number) decreases a specified number from
1535	* the amount of an object. If the amount reaches 0, the object	1533	* the amount of an object. If the amount reaches 0, the object
1536	* is subsequently removed and freed.	1534	* is subsequently removed and freed.
1537	*	1535	*
1538	* Return value: 'op' if something is left, NULL if the amount reached 0	1536	* Return value: 'op' if something is left, NULL if the amount reached 0
1539	*/	1537	*/
		1538	bool
		1539	object::decrease (sint32 nr)
		1540	{
		1541	if (!nr)
		1542	return true;
		1543
		1544	nr = min (nr, nrof);
		1545
		1546	nrof -= nr;
		1547
		1548	if (nrof)
		1549	{
		1550	adjust_weight (env, -weight * nr); // carrying == 0
		1551
		1552	if (object *pl = visible_to ())
		1553	esrv_update_item (UPD_NROF, pl, this);
		1554
		1555	return true;
		1556	}
		1557	else
		1558	{
		1559	destroy (1);
		1560	return false;
		1561	}
		1562	}
		1563
		1564	/*
		1565	* split(ob,nr) splits up ob into two parts. The part which
		1566	* is returned contains nr objects, and the remaining parts contains
		1567	* the rest (or is removed and returned if that number is 0).
		1568	* On failure, NULL is returned.
		1569	*/
1540	object *	1570	object *
1541	decrease_ob_nr (object *op, uint32 i)	1571	object::split (sint32 nr)
1542	{	1572	{
1543	object *tmp;	1573	int have = number_of ();
1544		1574
1545	if (i == 0) /* objects with op->nrof require this check */	1575	if (have < nr)
1546	return op;	1576	return 0;
1547		1577	else if (have == nr)
1548	if (i > op->nrof)
1549	i = op->nrof;
1550
1551	if (QUERY_FLAG (op, FLAG_REMOVED))
1552	op->nrof -= i;
1553	else if (op->env)
1554	{	1578	{
1555	/* is this object in the players inventory, or sub container
1556	* therein?
1557	*/
1558	tmp = op->in_player ();
1559	/* nope. Is this a container the player has opened?
1560	* If so, set tmp to that player.
1561	* IMO, searching through all the players will mostly
1562	* likely be quicker than following op->env to the map,
1563	* and then searching the map for a player.
1564	*/
1565	if (!tmp)
1566	for_all_players (pl)
1567	if (pl->ob->container == op->env)
1568	{
1569	tmp = pl->ob;
1570	break;
1571	}
1572
1573	if (i < op->nrof)
1574	{
1575	sub_weight (op->env, op->weight * i);
1576	op->nrof -= i;
1577	if (tmp)
1578	esrv_send_item (tmp, op);
1579	}
1580	else
1581	{
1582	op->remove ();	1579	remove ();
1583	op->nrof = 0;	1580	return this;
1584	if (tmp)
1585	esrv_del_item (tmp->contr, op->count);
1586	}
1587	}	1581	}
1588	else	1582	else
1589	{	1583	{
1590	object *above = op->above;	1584	decrease (nr);
1591		1585
1592	if (i < op->nrof)	1586	object *op = deep_clone ();
1593	op->nrof -= i;	1587	op->nrof = nr;
1594	else
1595	{
1596	op->remove ();
1597	op->nrof = 0;
1598	}
1599
1600	/* Since we just removed op, op->above is null */
1601	for (tmp = above; tmp; tmp = tmp->above)
1602	if (tmp->type == PLAYER)
1603	{
1604	if (op->nrof)
1605	esrv_send_item (tmp, op);
1606	else
1607	esrv_del_item (tmp->contr, op->count);
1608	}
1609	}
1610
1611	if (op->nrof)
1612	return op;	1588	return op;
1613	else
1614	{
1615	op->destroy ();
1616	return 0;
1617	}
1618	}
1619
1620	/*
1621	* add_weight(object, weight) adds the specified weight to an object,
1622	* and also updates how much the environment(s) is/are carrying.
1623	*/
1624	void
1625	add_weight (object *op, signed long weight)
1626	{
1627	while (op != NULL)
1628	{
1629	if (op->type == CONTAINER)
1630	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1631
1632	op->carrying += weight;
1633	op = op->env;
1634	}	1589	}
1635	}	1590	}
1636		1591
1637	object *	1592	object *
1638	insert_ob_in_ob (object *op, object *where)	1593	insert_ob_in_ob (object *op, object *where)
…		…
1663	* be != op, if items are merged. -Tero	1618	* be != op, if items are merged. -Tero
1664	*/	1619	*/
1665	object *	1620	object *
1666	object::insert (object *op)	1621	object::insert (object *op)
1667	{	1622	{
1668	object *tmp, *otmp;
1669
1670	if (!QUERY_FLAG (op, FLAG_REMOVED))
1671	op->remove ();
1672
1673	if (op->more)	1623	if (op->more)
1674	{	1624	{
1675	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1625	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1676	return op;	1626	return op;
1677	}	1627	}
1678		1628
1679	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1629	op->remove ();
1680	CLEAR_FLAG (op, FLAG_REMOVED);	1630
		1631	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1632
1681	if (op->nrof)	1633	if (op->nrof)
1682	{
1683	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1634	for (object *tmp = inv; tmp; tmp = tmp->below)
1684	if (object::can_merge (tmp, op))	1635	if (object::can_merge (tmp, op))
1685	{	1636	{
1686	/* return the original object and remove inserted object	1637	/* return the original object and remove inserted object
1687	(client needs the original object) */	1638	(client needs the original object) */
1688	tmp->nrof += op->nrof;	1639	tmp->nrof += op->nrof;
1689	/* Weight handling gets pretty funky. Since we are adding to	1640
1690	* tmp->nrof, we need to increase the weight.	1641	if (object *pl = tmp->visible_to ())
1691	*/	1642	esrv_update_item (UPD_NROF, pl, tmp);
		1643
1692	add_weight (this, op->weight * op->nrof);	1644	adjust_weight (this, op->total_weight ());
1693	SET_FLAG (op, FLAG_REMOVED);	1645
1694	op->destroy (); /* free the inserted object */	1646	op->destroy (1);
1695	op = tmp;	1647	op = tmp;
1696	op->remove (); /* and fix old object's links */	1648	goto inserted;
1697	CLEAR_FLAG (op, FLAG_REMOVED);
1698	break;
1699	}	1649	}
1700		1650
1701	/* I assume combined objects have no inventory	1651	op->owner = 0; // it's his/hers now. period.
1702	* We add the weight - this object could have just been removed
1703	* (if it was possible to merge). calling remove_ob will subtract
1704	* the weight, so we need to add it in again, since we actually do
1705	* the linking below
1706	*/
1707	add_weight (this, op->weight * op->nrof);
1708	}
1709	else
1710	add_weight (this, (op->weight + op->carrying));
1711
1712	otmp = this->in_player ();
1713	if (otmp && otmp->contr)
1714	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1715	otmp->update_stats ();
1716
1717	op->map = 0;	1652	op->map = 0;
1718	op->env = this;	1653	op->x = 0;
		1654	op->y = 0;
		1655
1719	op->above = 0;	1656	op->above = 0;
1720	op->below = 0;	1657	op->below = inv;
1721	op->x = 0, op->y = 0;	1658	op->env = this;
1722		1659
		1660	if (inv)
		1661	inv->above = op;
		1662
		1663	inv = op;
		1664
		1665	op->flag [FLAG_REMOVED] = 0;
		1666
		1667	if (object *pl = op->visible_to ())
		1668	esrv_send_item (pl, op);
		1669
		1670	adjust_weight (this, op->total_weight ());
		1671
		1672	inserted:
1723	/* reset the light list and los of the players on the map */	1673	/* reset the light list and los of the players on the map */
1724	if ((op->glow_radius != 0) && map)	1674	if (op->glow_radius && map && map->darkness)
1725	{
1726	#ifdef DEBUG_LIGHTS
1727	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1728	#endif /* DEBUG_LIGHTS */
1729	if (map->darkness)
1730	update_all_los (map, x, y);	1675	update_all_los (map, x, y);
1731	}
1732		1676
1733	/* Client has no idea of ordering so lets not bother ordering it here.	1677	// if this is a player's inventory, update stats
1734	* It sure simplifies this function...	1678	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1735	*/	1679	update_stats ();
1736	if (!inv)
1737	inv = op;
1738	else
1739	{
1740	op->below = inv;
1741	op->below->above = op;
1742	inv = op;
1743	}
1744		1680
1745	INVOKE_OBJECT (INSERT, this);	1681	INVOKE_OBJECT (INSERT, this);
1746		1682
1747	return op;	1683	return op;
1748	}	1684	}
…		…
1876	LOG (llevError, "Present_arch called outside map.\n");	1812	LOG (llevError, "Present_arch called outside map.\n");
1877	return NULL;	1813	return NULL;
1878	}	1814	}
1879		1815
1880	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1816	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1881	if (tmp->arch == at)	1817	if (tmp->arch->archname == at->archname)
1882	return tmp;	1818	return tmp;
1883		1819
1884	return NULL;	1820	return NULL;
1885	}	1821	}
1886		1822
…		…
1950	* The first matching object is returned, or NULL if none.	1886	* The first matching object is returned, or NULL if none.
1951	*/	1887	*/
1952	object *	1888	object *
1953	present_arch_in_ob (const archetype *at, const object *op)	1889	present_arch_in_ob (const archetype *at, const object *op)
1954	{	1890	{
1955	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1891	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1956	if (tmp->arch == at)	1892	if (tmp->arch->archname == at->archname)
1957	return tmp;	1893	return tmp;
1958		1894
1959	return NULL;	1895	return NULL;
1960	}	1896	}
1961		1897
…		…
1963	* activate recursively a flag on an object inventory	1899	* activate recursively a flag on an object inventory
1964	*/	1900	*/
1965	void	1901	void
1966	flag_inv (object *op, int flag)	1902	flag_inv (object *op, int flag)
1967	{	1903	{
1968	if (op->inv)
1969	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1904	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1970	{	1905	{
1971	SET_FLAG (tmp, flag);	1906	SET_FLAG (tmp, flag);
1972	flag_inv (tmp, flag);	1907	flag_inv (tmp, flag);
1973	}	1908	}
1974	}	1909	}
1975		1910
1976	/*	1911	/*
1977	* deactivate recursively a flag on an object inventory	1912	* deactivate recursively a flag on an object inventory
1978	*/	1913	*/
1979	void	1914	void
1980	unflag_inv (object *op, int flag)	1915	unflag_inv (object *op, int flag)
1981	{	1916	{
1982	if (op->inv)
1983	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1917	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1984	{	1918	{
1985	CLEAR_FLAG (tmp, flag);	1919	CLEAR_FLAG (tmp, flag);
1986	unflag_inv (tmp, flag);	1920	unflag_inv (tmp, flag);
1987	}	1921	}
1988	}	1922	}
1989		1923
1990	/*	1924	/*
1991	* find_free_spot(object, map, x, y, start, stop) will search for	1925	* find_free_spot(object, map, x, y, start, stop) will search for
1992	* a spot at the given map and coordinates which will be able to contain	1926	* a spot at the given map and coordinates which will be able to contain
…		…
1994	* to search (see the freearr_x/y[] definition).	1928	* to search (see the freearr_x/y[] definition).
1995	* It returns a random choice among the alternatives found.	1929	* It returns a random choice among the alternatives found.
1996	* start and stop are where to start relative to the free_arr array (1,9	1930	* start and stop are where to start relative to the free_arr array (1,9
1997	* does all 4 immediate directions). This returns the index into the	1931	* does all 4 immediate directions). This returns the index into the
1998	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1932	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1999	* Note - this only checks to see if there is space for the head of the
2000	* object - if it is a multispace object, this should be called for all
2001	* pieces.
2002	* Note2: This function does correctly handle tiled maps, but does not	1933	* Note: This function does correctly handle tiled maps, but does not
2003	* inform the caller. However, insert_ob_in_map will update as	1934	* inform the caller. However, insert_ob_in_map will update as
2004	* necessary, so the caller shouldn't need to do any special work.	1935	* necessary, so the caller shouldn't need to do any special work.
2005	* Note - updated to take an object instead of archetype - this is necessary	1936	* Note - updated to take an object instead of archetype - this is necessary
2006	* because arch_blocked (now ob_blocked) needs to know the movement type	1937	* because arch_blocked (now ob_blocked) needs to know the movement type
2007	* to know if the space in question will block the object. We can't use	1938	* to know if the space in question will block the object. We can't use
…		…
2009	* customized, changed states, etc.	1940	* customized, changed states, etc.
2010	*/	1941	*/
2011	int	1942	int
2012	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1943	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2013	{	1944	{
		1945	int altern[SIZEOFFREE];
2014	int index = 0, flag;	1946	int index = 0, flag;
2015	int altern[SIZEOFFREE];
2016		1947
2017	for (int i = start; i < stop; i++)	1948	for (int i = start; i < stop; i++)
2018	{	1949	{
2019	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1950	mapxy pos (m, x, y); pos.move (i);
2020	if (!flag)	1951
		1952	if (!pos.normalise ())
		1953	continue;
		1954
		1955	mapspace &ms = *pos;
		1956
		1957	if (ms.flags () & P_IS_ALIVE)
		1958	continue;
		1959
		1960	/* However, often
		1961	* ob doesn't have any move type (when used to place exits)
		1962	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1963	*/
		1964	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1965	{
2021	altern [index++] = i;	1966	altern [index++] = i;
		1967	continue;
		1968	}
2022		1969
2023	/* Basically, if we find a wall on a space, we cut down the search size.	1970	/* Basically, if we find a wall on a space, we cut down the search size.
2024	* In this way, we won't return spaces that are on another side of a wall.	1971	* In this way, we won't return spaces that are on another side of a wall.
2025	* This mostly work, but it cuts down the search size in all directions -	1972	* This mostly work, but it cuts down the search size in all directions -
2026	* if the space being examined only has a wall to the north and empty	1973	* if the space being examined only has a wall to the north and empty
2027	* spaces in all the other directions, this will reduce the search space	1974	* spaces in all the other directions, this will reduce the search space
2028	* to only the spaces immediately surrounding the target area, and	1975	* to only the spaces immediately surrounding the target area, and
2029	* won't look 2 spaces south of the target space.	1976	* won't look 2 spaces south of the target space.
2030	*/	1977	*/
2031	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1978	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1979	{
2032	stop = maxfree[i];	1980	stop = maxfree[i];
		1981	continue;
		1982	}
		1983
		1984	/* Note it is intentional that we check ob - the movement type of the
		1985	* head of the object should correspond for the entire object.
		1986	*/
		1987	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1988	continue;
		1989
		1990	if (ob->blocked (m, pos.x, pos.y))
		1991	continue;
		1992
		1993	altern [index++] = i;
2033	}	1994	}
2034		1995
2035	if (!index)	1996	if (!index)
2036	return -1;	1997	return -1;
2037		1998
…		…
2046	*/	2007	*/
2047	int	2008	int
2048	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2009	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2049	{	2010	{
2050	for (int i = 0; i < SIZEOFFREE; i++)	2011	for (int i = 0; i < SIZEOFFREE; i++)
2051	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2012	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2052	return i;	2013	return i;
2053		2014
2054	return -1;	2015	return -1;
2055	}	2016	}
2056		2017
…		…
2345		2306
2346	/*	2307	/*
2347	* create clone from object to another	2308	* create clone from object to another
2348	*/	2309	*/
2349	object *	2310	object *
2350	object_create_clone (object *asrc)	2311	object::deep_clone ()
2351	{	2312	{
2352	object *dst = 0, *tmp, *src, *prev, *item;	2313	assert (("deep_clone called on non-head object", is_head ()));
2353		2314
2354	if (!asrc)	2315	object *dst = clone ();
2355	return 0;
2356		2316
2357	src = asrc->head_ ();	2317	object *prev = dst;
2358
2359	prev = 0;
2360	for (object *part = src; part; part = part->more)	2318	for (object *part = this->more; part; part = part->more)
2361	{	2319	{
2362	tmp = part->clone ();	2320	object *tmp = part->clone ();
2363	tmp->x -= src->x;
2364	tmp->y -= src->y;
2365
2366	if (!part->head)
2367	{
2368	dst = tmp;
2369	tmp->head = 0;
2370	}
2371	else
2372	tmp->head = dst;	2321	tmp->head = dst;
2373
2374	tmp->more = 0;
2375
2376	if (prev)
2377	prev->more = tmp;	2322	prev->more = tmp;
2378
2379	prev = tmp;	2323	prev = tmp;
2380	}	2324	}
2381		2325
2382	for (item = src->inv; item; item = item->below)	2326	for (object *item = inv; item; item = item->below)
2383	insert_ob_in_ob (object_create_clone (item), dst);	2327	insert_ob_in_ob (item->deep_clone (), dst);
2384		2328
2385	return dst;	2329	return dst;
2386	}	2330	}
2387		2331
2388	/* This returns the first object in who's inventory that	2332	/* This returns the first object in who's inventory that
…		…
2397	return tmp;	2341	return tmp;
2398		2342
2399	return 0;	2343	return 0;
2400	}	2344	}
2401		2345
2402	/* If ob has a field named key, return the link from the list,	2346	const shstr &
2403	* otherwise return NULL.	2347	object::kv_get (const shstr &key) const
2404	*
2405	* key must be a passed in shared string - otherwise, this won't
2406	* do the desired thing.
2407	*/
2408	key_value *
2409	get_ob_key_link (const object *ob, const char *key)
2410	{	2348	{
2411	for (key_value *link = ob->key_values; link; link = link->next)	2349	for (key_value *kv = key_values; kv; kv = kv->next)
2412	if (link->key == key)	2350	if (kv->key == key)
2413	return link;
2414
2415	return 0;
2416	}
2417
2418	/*
2419	* Returns the value of op has an extra_field for key, or NULL.
2420	*
2421	* The argument doesn't need to be a shared string.
2422	*
2423	* The returned string is shared.
2424	*/
2425	const char *
2426	get_ob_key_value (const object *op, const char *const key)
2427	{
2428	key_value *link;
2429	shstr_cmp canonical_key (key);
2430
2431	if (!canonical_key)
2432	{
2433	/* 1. There being a field named key on any object
2434	* implies there'd be a shared string to find.
2435	* 2. Since there isn't, no object has this field.
2436	* 3. Therefore, *this* object doesn't have this field.
2437	*/
2438	return 0;
2439	}
2440
2441	/* This is copied from get_ob_key_link() above -
2442	* only 4 lines, and saves the function call overhead.
2443	*/
2444	for (link = op->key_values; link; link = link->next)
2445	if (link->key == canonical_key)
2446	return link->value;	2351	return kv->value;
2447		2352
2448	return 0;	2353	return shstr_null;
2449	}	2354	}
2450		2355
2451	/*	2356	void
2452	* Updates the canonical_key in op to value.	2357	object::kv_set (const shstr &key, const shstr &value)
2453	*
2454	* canonical_key is a shared string (value doesn't have to be).
2455	*
2456	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2457	* keys.
2458	*
2459	* Returns TRUE on success.
2460	*/
2461	int
2462	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2463	{	2358	{
2464	key_value *field = NULL, *last = NULL;	2359	for (key_value *kv = key_values; kv; kv = kv->next)
2465		2360	if (kv->key == key)
2466	for (field = op->key_values; field != NULL; field = field->next)
2467	{
2468	if (field->key != canonical_key)
2469	{	2361	{
2470	last = field;	2362	kv->value = value;
2471	continue;	2363	return;
2472	}	2364	}
2473		2365
2474	if (value)	2366	key_value *kv = new key_value;
2475	field->value = value;	2367
2476	else	2368	kv->next = key_values;
		2369	kv->key = key;
		2370	kv->value = value;
		2371
		2372	key_values = kv;
		2373	}
		2374
		2375	void
		2376	object::kv_del (const shstr &key)
		2377	{
		2378	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2379	if ((*kvp)->key == key)
2477	{	2380	{
2478	/* Basically, if the archetype has this key set,	2381	key_value *kv = *kvp;
2479	* we need to store the null value so when we save	2382	*kvp = (*kvp)->next;
2480	* it, we save the empty value so that when we load,	2383	delete kv;
2481	* we get this value back again.	2384	return;
2482	*/
2483	if (get_ob_key_link (op->arch, canonical_key))
2484	field->value = 0;
2485	else
2486	{
2487	if (last)
2488	last->next = field->next;
2489	else
2490	op->key_values = field->next;
2491
2492	delete field;
2493	}
2494	}	2385	}
2495	return TRUE;
2496	}
2497	/* IF we get here, key doesn't exist */
2498
2499	/* No field, we'll have to add it. */
2500
2501	if (!add_key)
2502	return FALSE;
2503
2504	/* There isn't any good reason to store a null
2505	* value in the key/value list. If the archetype has
2506	* this key, then we should also have it, so shouldn't
2507	* be here. If user wants to store empty strings,
2508	* should pass in ""
2509	*/
2510	if (value == NULL)
2511	return TRUE;
2512
2513	field = new key_value;
2514
2515	field->key = canonical_key;
2516	field->value = value;
2517	/* Usual prepend-addition. */
2518	field->next = op->key_values;
2519	op->key_values = field;
2520
2521	return TRUE;
2522	}
2523
2524	/*
2525	* Updates the key in op to value.
2526	*
2527	* If add_key is FALSE, this will only update existing keys,
2528	* and not add new ones.
2529	* In general, should be little reason FALSE is ever passed in for add_key
2530	*
2531	* Returns TRUE on success.
2532	*/
2533	int
2534	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2535	{
2536	shstr key_ (key);
2537
2538	return set_ob_key_value_s (op, key_, value, add_key);
2539	}	2386	}
2540		2387
2541	object::depth_iterator::depth_iterator (object *container)	2388	object::depth_iterator::depth_iterator (object *container)
2542	: iterator_base (container)	2389	: iterator_base (container)
2543	{	2390	{
…		…
2593	{	2440	{
2594	char flagdesc[512];	2441	char flagdesc[512];
2595	char info2[256 * 4];	2442	char info2[256 * 4];
2596	char *p = info;	2443	char *p = info;
2597		2444
2598	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2445	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2599	count, uuid.seq,	2446	count,
		2447	uuid.c_str (),
2600	&name,	2448	&name,
2601	title ? "\",title:\"" : "",	2449	title ? "\",title:\"" : "",
2602	title ? (const char *)title : "",	2450	title ? (const char *)title : "",
2603	flag_desc (flagdesc, 512), type);	2451	flag_desc (flagdesc, 512), type);
2604		2452
2605	if (env)	2453	if (!flag[FLAG_REMOVED] && env)
2606	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2454	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2607		2455
2608	if (map)	2456	if (map)
2609	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2457	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2610		2458
…		…
2640	object::open_container (object *new_container)	2488	object::open_container (object *new_container)
2641	{	2489	{
2642	if (container == new_container)	2490	if (container == new_container)
2643	return;	2491	return;
2644		2492
2645	if (object *old_container = container)	2493	object *old_container = container;
		2494
		2495	if (old_container)
2646	{	2496	{
2647	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2497	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2648	return;	2498	return;
2649		2499
2650	#if 0	2500	#if 0
…		…
2652	if (object *closer = old_container->inv)	2502	if (object *closer = old_container->inv)
2653	if (closer->type == CLOSE_CON)	2503	if (closer->type == CLOSE_CON)
2654	closer->destroy ();	2504	closer->destroy ();
2655	#endif	2505	#endif
2656		2506
		2507	// make sure the container is available
		2508	esrv_send_item (this, old_container);
		2509
2657	old_container->flag [FLAG_APPLIED] = 0;	2510	old_container->flag [FLAG_APPLIED] = false;
2658	container = 0;	2511	container = 0;
2659		2512
		2513	// client needs item update to make it work, client bug requires this to be separate
2660	esrv_update_item (UPD_FLAGS, this, old_container);	2514	esrv_update_item (UPD_FLAGS, this, old_container);
		2515
2661	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2516	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2662	play_sound (sound_find ("chest_close"));	2517	play_sound (sound_find ("chest_close"));
2663	}	2518	}
2664		2519
2665	if (new_container)	2520	if (new_container)
…		…
2678	}	2533	}
2679	#endif	2534	#endif
2680		2535
2681	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2536	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2682		2537
		2538	// make sure the container is available, client bug requires this to be separate
		2539	esrv_send_item (this, new_container);
		2540
2683	new_container->flag [FLAG_APPLIED] = 1;	2541	new_container->flag [FLAG_APPLIED] = true;
2684	container = new_container;	2542	container = new_container;
2685		2543
		2544	// client needs flag change
2686	esrv_update_item (UPD_FLAGS, this, new_container);	2545	esrv_update_item (UPD_FLAGS, this, new_container);
2687	esrv_send_inventory (this, new_container);	2546	esrv_send_inventory (this, new_container);
2688	play_sound (sound_find ("chest_open"));	2547	play_sound (sound_find ("chest_open"));
2689	}	2548	}
		2549	// else if (!old_container->env && contr && contr->ns)
		2550	// contr->ns->floorbox_reset ();
2690	}	2551	}
2691		2552
2692	object *	2553	object *
2693	object::force_find (const shstr name)	2554	object::force_find (const shstr name)
2694	{	2555	{
…		…
2720		2581
2721	insert (force);	2582	insert (force);
2722	}	2583	}
2723		2584
2724	void	2585	void
2725	object::play_sound (faceidx sound) const	2586	object::play_sound (faceidx sound)
2726	{	2587	{
2727	if (!sound)	2588	if (!sound)
2728	return;	2589	return;
2729		2590
2730	if (flag [FLAG_REMOVED])	2591	if (flag [FLAG_REMOVED])

Diff Legend

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