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.160 by root, Tue Jun 5 13:05:02 2007 UTC vs.
Revision 1.233 by root, Tue May 6 18:47:32 2008 UTC

1	/*	1	/*
2	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.	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 it	8	* Deliantra is free software: you can redistribute it and/or modify
9	* under the terms of the GNU General Public License as published by the Free	9	* it under the terms of the GNU General Public License as published by
10	* Software Foundation; either version 2 of the License, or (at your option)	10	* the Free Software Foundation, either version 3 of the License, or
11	* 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, but	13	* This program is distributed in the hope that it will be useful,
14	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* 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 along	18	* You should have received a copy of the GNU General Public License
19	* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21	*	20	*
22	* 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>
23	*/	22	*/
24		23
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying
27	variable. */
28	#include <global.h>	24	#include <global.h>
29	#include <stdio.h>	25	#include <stdio.h>
30	#include <sys/types.h>	26	#include <sys/types.h>
31	#include <sys/uio.h>	27	#include <sys/uio.h>
32	#include <object.h>	28	#include <object.h>
33	#include <funcpoint.h>
34	#include <sproto.h>	29	#include <sproto.h>
35	#include <loader.h>	30	#include <loader.h>
36		31
37	#include <bitset>	32	#include <bitset>
38		33
39	int nrofallocobjects = 0;	34	UUID UUID::cur;
40	static UUID uuid;	35	static uint64_t seq_next_save;
41	const uint64 UUID_SKIP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
42		37
43	objectvec objects;	38	objectvec objects;
44	activevec actives;	39	activevec actives;
45		40
46	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,
47	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
48	};	46	};
49	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,
50	-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
51	};	52	};
52	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,
53	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
54	};	58	};
55	int freedir[SIZEOFFREE] = {	59	int freedir[SIZEOFFREE] = {
56	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,
57	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
58	};	64	};
59		65
60	static void	66	static void
61	write_uuid (void)	67	write_uuid (uval64 skip, bool sync)
62	{	68	{
63	char filename1[MAX_BUF], filename2[MAX_BUF];	69	CALL_BEGIN (2);
64		70	CALL_ARG_SV (newSVval64 (skip));
65	sprintf (filename1, "%s/uuid", settings.localdir);	71	CALL_ARG_SV (boolSV (sync));
66	sprintf (filename2, "%s/uuid~", settings.localdir);	72	CALL_CALL ("cf::write_uuid", G_DISCARD);
67		73	CALL_END;
68	FILE *fp;
69
70	if (!(fp = fopen (filename2, "w")))
71	{
72	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
73	return;
74	}
75
76	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
77	fclose (fp);
78	rename (filename2, filename1);
79	}	74	}
80		75
81	static void	76	static void
82	read_uuid (void)	77	read_uuid (void)
83	{	78	{
84	char filename[MAX_BUF];	79	char filename[MAX_BUF];
85		80
86	sprintf (filename, "%s/uuid", settings.localdir);	81	sprintf (filename, "%s/uuid", settings.localdir);
		82
		83	seq_next_save = 0;
87		84
88	FILE *fp;	85	FILE *fp;
89		86
90	if (!(fp = fopen (filename, "r")))	87	if (!(fp = fopen (filename, "r")))
91	{	88	{
92	if (errno == ENOENT)	89	if (errno == ENOENT)
93	{	90	{
94	LOG (llevInfo, "RESET uid to 1\n");	91	LOG (llevInfo, "RESET uid to 1\n");
95	uuid.seq = 0;	92	UUID::cur.seq = 0;
96	write_uuid ();	93	write_uuid (UUID_GAP, true);
97	return;	94	return;
98	}	95	}
99		96
100	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
101	_exit (1);	98	_exit (1);
102	}	99	}
103		100
104	int version;	101	UUID::BUF buf;
105	unsigned long long uid;	102	buf[0] = 0;
106	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	103	fgets (buf, sizeof (buf), fp);
		104
		105	if (!UUID::cur.parse (buf))
107	{	106	{
108	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	107	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
109	_exit (1);	108	_exit (1);
110	}	109	}
111		110
112	uuid.seq = uid;	111	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
113	write_uuid ();	112
114	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	113	write_uuid (UUID_GAP, true);
115	fclose (fp);	114	fclose (fp);
116	}	115	}
117		116
118	UUID	117	UUID
119	gen_uuid ()	118	UUID::gen ()
120	{	119	{
121	UUID uid;	120	UUID uid;
122		121
123	uid.seq = ++uuid.seq;	122	uid.seq = ++cur.seq;
124		123
125	if (!(uuid.seq & (UUID_SKIP - 1)))	124	if (expect_false (cur.seq >= seq_next_save))
126	write_uuid ();	125	{
		126	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		127	write_uuid (UUID_GAP, false);
		128	}
		129
127		130
128	return uid;	131	return uid;
129	}	132	}
130		133
131	void	134	void
132	init_uuid ()	135	UUID::init ()
133	{	136	{
134	read_uuid ();	137	read_uuid ();
135	}	138	}
136		139
137	/* 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. */
138	static int	141	static bool
139	compare_ob_value_lists_one (const object *wants, const object *has)	142	compare_ob_value_lists_one (const object *wants, const object *has)
140	{	143	{
141	key_value *wants_field;
142
143	/* 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
144	* 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
145	* different structure or at least keep the lists sorted...	146	* different structure or at least keep the lists sorted...
146	*/	147	*/
147		148
148	/* For each field in wants, */	149	/* For each field in wants, */
149	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)
150	{	151	if (has->kv_get (kv->key) != kv->value)
151	key_value *has_field;	152	return false;
152
153	/* Look for a field in has with the same key. */
154	has_field = get_ob_key_link (has, wants_field->key);
155
156	if (has_field == NULL)
157	{
158	/* No field with that name. */
159	return FALSE;
160	}
161
162	/* Found the matching field. */
163	if (has_field->value != wants_field->value)
164	{
165	/* Values don't match, so this half of the comparison is false. */
166	return FALSE;
167	}
168
169	/* If we get here, we found a match. Now for the next field in wants. */
170	}
171		153
172	/* 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. */
173	return TRUE;	155	return true;
174	}	156	}
175		157
176	/* Returns TRUE if ob1 has the same key_values as ob2. */	158	/* Returns TRUE if ob1 has the same key_values as ob2. */
177	static int	159	static bool
178	compare_ob_value_lists (const object *ob1, const object *ob2)	160	compare_ob_value_lists (const object *ob1, const object *ob2)
179	{	161	{
180	/* 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,
181	* so we need to run the comparison *twice*. :(	163	* so we need to run the comparison *twice*. :(
182	*/	164	*/
183	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);
184	}	167	}
185		168
186	/* 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
187	* they can be merged together.	170	* they can be merged together.
188	*	171	*
…		…
203	|| ob1->speed != ob2->speed	186	|| ob1->speed != ob2->speed
204	|| ob1->value != ob2->value	187	|| ob1->value != ob2->value
205	|| ob1->name != ob2->name)	188	|| ob1->name != ob2->name)
206	return 0;	189	return 0;
207		190
208	//TODO: this ain't working well, use nicer and correct overflow check	191	/* Do not merge objects if nrof would overflow. First part checks
209	/* 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
210	* 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
211	* used to store nrof).	194	* nrof values.
212	*/	195	*/
213	if (ob1->nrof + ob2->nrof >= 1UL << 31)	196	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
214	return 0;	197	return 0;
215		198
216	/* If the objects have been identified, set the BEEN_APPLIED flag.	199	/* If the objects have been identified, set the BEEN_APPLIED flag.
217	* 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
218	* 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
219	* 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
220	* flags lose any meaning.	203	* flags lose any meaning.
221	*/	204	*/
222	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	205	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
223	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	206	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
224		207
225	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	208	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
226	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	209	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
227		210
228	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	211	if (ob1->arch->name != ob2->arch->name
229	|| ob1->arch != ob2->arch
230	|| ob1->name != ob2->name	212	|| ob1->name != ob2->name
231	|| ob1->title != ob2->title	213	|| ob1->title != ob2->title
232	|| ob1->msg != ob2->msg	214	|| ob1->msg != ob2->msg
233	|| ob1->weight != ob2->weight	215	|| ob1->weight != ob2->weight
234	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
235	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
236	|| ob1->attacktype != ob2->attacktype	216	|| ob1->attacktype != ob2->attacktype
237	|| ob1->magic != ob2->magic	217	|| ob1->magic != ob2->magic
238	|| ob1->slaying != ob2->slaying	218	|| ob1->slaying != ob2->slaying
239	|| ob1->skill != ob2->skill	219	|| ob1->skill != ob2->skill
240	|| ob1->value != ob2->value	220	|| ob1->value != ob2->value
…		…
247	|| ob1->move_block != ob2->move_block	227	|| ob1->move_block != ob2->move_block
248	|| ob1->move_allow != ob2->move_allow	228	|| ob1->move_allow != ob2->move_allow
249	|| ob1->move_on != ob2->move_on	229	|| ob1->move_on != ob2->move_on
250	|| ob1->move_off != ob2->move_off	230	|| ob1->move_off != ob2->move_off
251	|| ob1->move_slow != ob2->move_slow	231	|| ob1->move_slow != ob2->move_slow
252	|| 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)))
253	return 0;	235	return 0;
254		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
255	/* This is really a spellbook check - really, we should	244	/* This is really a spellbook check - we should in general
256	* check all objects in the inventory.	245	* not merge objects with real inventories, as splitting them
		246	* is hard.
257	*/	247	*/
258	if (ob1->inv || ob2->inv)	248	if (ob1->inv || ob2->inv)
259	{	249	{
260	/* if one object has inventory but the other doesn't, not equiv */	250	if (!(ob1->inv && ob2->inv))
261	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	251	return 0; /* inventories differ in length */
262	return 0;
263		252
264	/* 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
265	if (!object::can_merge (ob1->inv, ob2->inv))	256	if (!object::can_merge (ob1->inv, ob2->inv))
266	return 0;	257	return 0; /* inventory objects differ */
267		258
268	/* 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
269	* if it is valid.	260	* if it is valid.
270	*/	261	*/
271	}	262	}
…		…
290	if (ob1->level != ob2->level)	281	if (ob1->level != ob2->level)
291	return 0;	282	return 0;
292	break;	283	break;
293	}	284	}
294		285
295	if (ob1->key_values != NULL || ob2->key_values != NULL)	286	if (ob1->key_values || ob2->key_values)
296	{	287	{
297	/* At least one of these has key_values. */	288	/* At least one of these has key_values. */
298	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	289	if ((!ob1->key_values) != (!ob2->key_values))
299	/* One has fields, but the other one doesn't. */	290	return 0; /* One has fields, but the other one doesn't. */
		291
		292	if (!compare_ob_value_lists (ob1, ob2))
300	return 0;	293	return 0;
301	else if (!compare_ob_value_lists (ob1, ob2))
302	return 0;
303	}	294	}
304		295
305	//TODO: generate an event or call into perl for additional checks
306	if (ob1->self || ob2->self)	296	if (ob1->self || ob2->self)
307	{	297	{
308	ob1->optimise ();	298	ob1->optimise ();
309	ob2->optimise ();	299	ob2->optimise ();
310		300
311	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)
312	return 0;	307	return 0;
		308
		309	if (k1 == 0)
		310	return 1;
		311
		312	if (!cfperl_can_merge (ob1, ob2))
		313	return 0;
		314	}
313	}	315	}
314		316
315	/* Everything passes, must be OK. */	317	/* Everything passes, must be OK. */
316	return 1;	318	return 1;
317	}	319	}
318		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
319	/*	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	/*
320	* sum_weight() is a recursive function which calculates the weight	394	* this is a recursive function which calculates the weight
321	* 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
322	* containers are carrying, and sums it up.	396	* containers are carrying, and sums it up.
323	*/	397	*/
324	long	398	void
325	sum_weight (object *op)	399	object::update_weight ()
326	{	400	{
327	long sum;	401	sint32 sum = 0;
328	object *inv;
329		402
330	for (sum = 0, inv = op->inv; inv; inv = inv->below)	403	for (object *op = inv; op; op = op->below)
331	{	404	{
332	if (inv->inv)	405	if (op->inv)
333	sum_weight (inv);	406	op->update_weight ();
334		407
335	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	408	sum += op->total_weight ();
		409	}
		410
		411	sum = weight_adjust (this, sum);
		412
		413	if (sum != carrying)
336	}	414	{
337
338	if (op->type == CONTAINER && op->stats.Str)
339	sum = (sum * (100 - op->stats.Str)) / 100;
340
341	if (op->carrying != sum)
342	op->carrying = sum;	415	carrying = sum;
343		416
344	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	}
345	}	421	}
346		422
347	/**	423	/*
348	* Return the outermost environment object for a given object.	424	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
349	*/
350
351	object *
352	object_get_env_recursive (object *op)
353	{
354	while (op->env != NULL)
355	op = op->env;
356	return op;
357	}
358
359	/*
360	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
361	* Some error messages.
362	* The result of the dump is stored in the static global errmsg array.
363	*/	425	*/
364	char *	426	char *
365	dump_object (object *op)	427	dump_object (object *op)
366	{	428	{
367	if (!op)	429	if (!op)
…		…
375	/*	437	/*
376	* 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
377	* multi-object 1 which is closest to the second object.	439	* multi-object 1 which is closest to the second object.
378	* If it's not a multi-object, it is returned.	440	* If it's not a multi-object, it is returned.
379	*/	441	*/
380
381	object *	442	object *
382	get_nearest_part (object *op, const object *pl)	443	get_nearest_part (object *op, const object *pl)
383	{	444	{
384	object *tmp, *closest;	445	object *tmp, *closest;
385	int last_dist, i;	446	int last_dist, i;
386		447
387	if (op->more == NULL)	448	if (!op->more)
388	return op;	449	return op;
		450
389	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)
390	if ((i = distance (tmp, pl)) < last_dist)	454	if ((i = distance (tmp, pl)) < last_dist)
391	closest = tmp, last_dist = i;	455	closest = tmp, last_dist = i;
		456
392	return closest;	457	return closest;
393	}	458	}
394		459
395	/*	460	/*
396	* 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.
397	*/	463	*/
398	object *	464	object *
399	find_object (tag_t i)	465	find_object (tag_t i)
400	{	466	{
401	for_all_objects (op)	467	for_all_objects (op)
…		…
421	break;	487	break;
422		488
423	return op;	489	return op;
424	}	490	}
425		491
426	void
427	free_all_object_data ()
428	{
429	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
430	}
431
432	/*	492	/*
433	* 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
434	* skill and experience objects.	494	* skill and experience objects.
		495	* ACTUALLY NO! investigate! TODO
435	*/	496	*/
436	void	497	void
437	object::set_owner (object *owner)	498	object::set_owner (object *owner)
438	{	499	{
		500	// allow objects which own objects
439	if (!owner)	501	if (owner)
440	return;
441
442	/* next line added to allow objects which own objects */
443	/* Add a check for ownercounts in here, as I got into an endless loop
444	* with the fireball owning a poison cloud which then owned the
445	* fireball. I believe that was caused by one of the objects getting
446	* freed and then another object replacing it. Since the ownercounts
447	* didn't match, this check is valid and I believe that cause is valid.
448	*/
449	while (owner->owner)	502	while (owner->owner)
450	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	}
451		510
452	this->owner = owner;	511	this->owner = owner;
453	}	512	}
454		513
455	int	514	int
…		…
533	}	592	}
534		593
535	op->key_values = 0;	594	op->key_values = 0;
536	}	595	}
537		596
538	object &	597	/*
539	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)
540	{	607	{
541	bool is_freed = flag [FLAG_FREED];	608	dst->remove ();
542	bool is_removed = flag [FLAG_REMOVED];
543
544	*(object_copy *)this = src;	609	*(object_copy *)dst = *this;
545
546	flag [FLAG_FREED] = is_freed;
547	flag [FLAG_REMOVED] = is_removed;	610	dst->flag [FLAG_REMOVED] = true;
548		611
549	/* Copy over key_values, if any. */	612	/* Copy over key_values, if any. */
550	if (src.key_values)	613	if (key_values)
551	{	614	{
552	key_value *tail = 0;	615	key_value *tail = 0;
553	key_values = 0;	616	dst->key_values = 0;
554		617
555	for (key_value *i = src.key_values; i; i = i->next)	618	for (key_value *i = key_values; i; i = i->next)
556	{	619	{
557	key_value *new_link = new key_value;	620	key_value *new_link = new key_value;
558		621
559	new_link->next = 0;	622	new_link->next = 0;
560	new_link->key = i->key;	623	new_link->key = i->key;
561	new_link->value = i->value;	624	new_link->value = i->value;
562		625
563	/* Try and be clever here, too. */	626	/* Try and be clever here, too. */
564	if (!key_values)	627	if (!dst->key_values)
565	{	628	{
566	key_values = new_link;	629	dst->key_values = new_link;
567	tail = new_link;	630	tail = new_link;
568	}	631	}
569	else	632	else
570	{	633	{
571	tail->next = new_link;	634	tail->next = new_link;
572	tail = new_link;	635	tail = new_link;
573	}	636	}
574	}	637	}
575	}	638	}
576	}
577
578	/*
579	* copy_to first frees everything allocated by the dst object,
580	* and then copies the contents of itself into the second
581	* object, allocating what needs to be allocated. Basically, any
582	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
583	* if the first object is freed, the pointers in the new object
584	* will point at garbage.
585	*/
586	void
587	object::copy_to (object *dst)
588	{
589	*dst = *this;
590		639
591	if (speed < 0)	640	if (speed < 0)
592	dst->speed_left = speed_left - rndm ();	641	dst->speed_left -= rndm ();
593		642
594	dst->set_speed (dst->speed);	643	dst->set_speed (dst->speed);
595	}	644	}
596		645
597	void	646	void
598	object::instantiate ()	647	object::instantiate ()
599	{	648	{
600	if (!uuid.seq) // HACK	649	if (!uuid.seq) // HACK
601	uuid = gen_uuid ();	650	uuid = UUID::gen ();
602		651
603	speed_left = -0.1f;	652	speed_left = -0.1f;
604	/* 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
605	* 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.
606	* 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
…		…
616	object *	665	object *
617	object::clone ()	666	object::clone ()
618	{	667	{
619	object *neu = create ();	668	object *neu = create ();
620	copy_to (neu);	669	copy_to (neu);
		670	neu->map = map; // not copied by copy_to
621	return neu;	671	return neu;
622	}	672	}
623		673
624	/*	674	/*
625	* 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
…		…
676	* UP_OBJ_FACE: only the objects face has changed.	726	* UP_OBJ_FACE: only the objects face has changed.
677	*/	727	*/
678	void	728	void
679	update_object (object *op, int action)	729	update_object (object *op, int action)
680	{	730	{
681	if (op == NULL)	731	if (!op)
682	{	732	{
683	/* this should never happen */	733	/* this should never happen */
684	LOG (llevDebug, "update_object() called for NULL object.\n");	734	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
685	return;	735	return;
686	}	736	}
687		737
688	if (op->env)	738	if (!op->is_on_map ())
689	{	739	{
690	/* Animation is currently handled by client, so nothing	740	/* Animation is currently handled by client, so nothing
691	* to do in this case.	741	* to do in this case.
692	*/	742	*/
693	return;	743	return;
694	}	744	}
695
696	/* If the map is saving, don't do anything as everything is
697	* going to get freed anyways.
698	*/
699	if (!op->map || op->map->in_memory == MAP_SAVING)
700	return;
701		745
702	/* make sure the object is within map boundaries */	746	/* make sure the object is within map boundaries */
703	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)
704	{	748	{
705	LOG (llevError, "update_object() called for object out of map!\n");	749	LOG (llevError, "update_object() called for object out of map!\n");
…		…
765	static int object_count;	809	static int object_count;
766		810
767	void object::link ()	811	void object::link ()
768	{	812	{
769	assert (!index);//D	813	assert (!index);//D
770	uuid = gen_uuid ();	814	uuid = UUID::gen ();
771	count = ++object_count;	815	count = ++object_count;
772		816
773	refcnt_inc ();	817	refcnt_inc ();
774	objects.insert (this);	818	objects.insert (this);
775	}	819	}
…		…
848	object::destroy_inv (bool drop_to_ground)	892	object::destroy_inv (bool drop_to_ground)
849	{	893	{
850	// need to check first, because the checks below might segfault	894	// need to check first, because the checks below might segfault
851	// as we might be on an invalid mapspace and crossfire code	895	// as we might be on an invalid mapspace and crossfire code
852	// is too buggy to ensure that the inventory is empty.	896	// is too buggy to ensure that the inventory is empty.
853	// corollary: if you create arrows etc. with stuff in tis inventory,	897	// corollary: if you create arrows etc. with stuff in its inventory,
854	// cf will crash below with off-map x and y	898	// cf will crash below with off-map x and y
855	if (!inv)	899	if (!inv)
856	return;	900	return;
857		901
858	/* Only if the space blocks everything do we not process -	902	/* Only if the space blocks everything do we not process -
859	* if some form of movement is allowed, let objects	903	* if some form of movement is allowed, let objects
860	* drop on that space.	904	* drop on that space.
861	*/	905	*/
862	if (!drop_to_ground	906	if (!drop_to_ground
863	|| !map	907	|| !map
864	|| map->in_memory != MAP_IN_MEMORY	908	|| map->in_memory != MAP_ACTIVE
865	|| map->nodrop	909	|| map->nodrop
866	|| ms ().move_block == MOVE_ALL)	910	|| ms ().move_block == MOVE_ALL)
867	{	911	{
868	while (inv)	912	while (inv)
869	{	913	{
870	inv->destroy_inv (drop_to_ground);	914	inv->destroy_inv (false);
871	inv->destroy ();	915	inv->destroy ();
872	}	916	}
873	}	917	}
874	else	918	else
875	{ /* Put objects in inventory onto this space */	919	{ /* Put objects in inventory onto this space */
…		…
881	|| op->flag [FLAG_NO_DROP]	925	|| op->flag [FLAG_NO_DROP]
882	|| op->type == RUNE	926	|| op->type == RUNE
883	|| op->type == TRAP	927	|| op->type == TRAP
884	|| op->flag [FLAG_IS_A_TEMPLATE]	928	|| op->flag [FLAG_IS_A_TEMPLATE]
885	|| op->flag [FLAG_DESTROY_ON_DEATH])	929	|| op->flag [FLAG_DESTROY_ON_DEATH])
886	op->destroy ();	930	op->destroy (true);
887	else	931	else
888	map->insert (op, x, y);	932	map->insert (op, x, y);
889	}	933	}
890	}	934	}
891	}	935	}
…		…
895	object *op = new object;	939	object *op = new object;
896	op->link ();	940	op->link ();
897	return op;	941	return op;
898	}	942	}
899		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
900	void	964	void
901	object::do_destroy ()	965	object::do_destroy ()
902	{	966	{
903	attachable::do_destroy ();
904
905	if (flag [FLAG_IS_LINKED])	967	if (flag [FLAG_IS_LINKED])
906	remove_button_link (this);	968	remove_button_link (this);
907		969
908	if (flag [FLAG_FRIENDLY])	970	if (flag [FLAG_FRIENDLY])
909	remove_friendly_object (this);	971	remove_friendly_object (this);
910		972
911	if (!flag [FLAG_REMOVED])
912	remove ();	973	remove ();
913		974
914	destroy_inv (true);	975	attachable::do_destroy ();
915		976
916	deactivate ();	977	deactivate ();
917	unlink ();	978	unlink ();
918		979
919	flag [FLAG_FREED] = 1;	980	flag [FLAG_FREED] = 1;
920		981
921	// hack to ensure that freed objects still have a valid map	982	// hack to ensure that freed objects still have a valid map
922	{
923	static maptile *freed_map; // freed objects are moved here to avoid crashes
924
925	if (!freed_map)
926	{
927	freed_map = new maptile;
928
929	freed_map->name = "/internal/freed_objects_map";
930	freed_map->width = 3;
931	freed_map->height = 3;
932
933	freed_map->alloc ();
934	freed_map->in_memory = MAP_IN_MEMORY;
935	}
936
937	map = freed_map;	983	map = &freed_map;
938	x = 1;	984	x = 1;
939	y = 1;	985	y = 1;
940	}
941
942	head = 0;
943		986
944	if (more)	987	if (more)
945	{	988	{
946	more->destroy ();	989	more->destroy ();
947	more = 0;	990	more = 0;
948	}	991	}
949		992
		993	head = 0;
		994
950	// clear those pointers that likely might have circular references to us	995	// clear those pointers that likely might cause circular references
951	owner = 0;	996	owner = 0;
952	enemy = 0;	997	enemy = 0;
953	attacked_by = 0;	998	attacked_by = 0;
		999	current_weapon = 0;
954	}	1000	}
955		1001
956	void	1002	void
957	object::destroy (bool destroy_inventory)	1003	object::destroy (bool destroy_inventory)
958	{	1004	{
959	if (destroyed ())	1005	if (destroyed ())
960	return;	1006	return;
961		1007
		1008	if (!is_head () && !head->destroyed ())
		1009	{
		1010	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1011	head->destroy (destroy_inventory);
		1012	return;
		1013	}
		1014
962	if (destroy_inventory)	1015	destroy_inv (!destroy_inventory);
963	destroy_inv (false);	1016
		1017	if (is_head ())
		1018	if (sound_destroy)
		1019	play_sound (sound_destroy);
		1020	else if (flag [FLAG_MONSTER])
		1021	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
964		1022
965	attachable::destroy ();	1023	attachable::destroy ();
966	}
967
968	/*
969	* sub_weight() recursively (outwards) subtracts a number from the
970	* weight of an object (and what is carried by it's environment(s)).
971	*/
972	void
973	sub_weight (object *op, signed long weight)
974	{
975	while (op != NULL)
976	{
977	if (op->type == CONTAINER)
978	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
979
980	op->carrying -= weight;
981	op = op->env;
982	}
983	}	1024	}
984		1025
985	/* op->remove ():	1026	/* op->remove ():
986	* This function removes the object op from the linked list of objects	1027	* This function removes the object op from the linked list of objects
987	* which it is currently tied to. When this function is done, the	1028	* which it is currently tied to. When this function is done, the
…		…
993	object::do_remove ()	1034	object::do_remove ()
994	{	1035	{
995	object *tmp, *last = 0;	1036	object *tmp, *last = 0;
996	object *otmp;	1037	object *otmp;
997		1038
998	if (QUERY_FLAG (this, FLAG_REMOVED))	1039	if (flag [FLAG_REMOVED])
999	return;	1040	return;
1000		1041
1001	SET_FLAG (this, FLAG_REMOVED);
1002	INVOKE_OBJECT (REMOVE, this);	1042	INVOKE_OBJECT (REMOVE, this);
		1043
		1044	flag [FLAG_REMOVED] = true;
1003		1045
1004	if (more)	1046	if (more)
1005	more->remove ();	1047	more->remove ();
1006		1048
1007	/*	1049	/*
1008	* In this case, the object to be removed is in someones	1050	* In this case, the object to be removed is in someones
1009	* inventory.	1051	* inventory.
1010	*/	1052	*/
1011	if (env)	1053	if (env)
1012	{	1054	{
		1055	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
		1056	if (object *pl = visible_to ())
		1057	esrv_del_item (pl->contr, count);
		1058	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1059
		1060	adjust_weight (env, -total_weight ());
		1061
		1062	*(above ? &above->below : &env->inv) = below;
		1063
1013	if (nrof)	1064	if (below)
1014	sub_weight (env, weight * nrof);	1065	below->above = above;
1015	else	1066
1016	sub_weight (env, weight + carrying);	1067	/* we set up values so that it could be inserted into
		1068	* the map, but we don't actually do that - it is up
		1069	* to the caller to decide what we want to do.
		1070	*/
		1071	map = env->map;
		1072	x = env->x;
		1073	y = env->y;
		1074	above = 0;
		1075	below = 0;
		1076	env = 0;
1017		1077
1018	/* NO_FIX_PLAYER is set when a great many changes are being	1078	/* NO_FIX_PLAYER is set when a great many changes are being
1019	* made to players inventory. If set, avoiding the call	1079	* made to players inventory. If set, avoiding the call
1020	* to save cpu time.	1080	* to save cpu time.
1021	*/	1081	*/
1022	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1082	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1023	otmp->update_stats ();	1083	otmp->update_stats ();
1024
1025	if (above)
1026	above->below = below;
1027	else
1028	env->inv = below;
1029
1030	if (below)
1031	below->above = above;
1032
1033	/* we set up values so that it could be inserted into
1034	* the map, but we don't actually do that - it is up
1035	* to the caller to decide what we want to do.
1036	*/
1037	x = env->x, y = env->y;
1038	map = env->map;
1039	above = 0, below = 0;
1040	env = 0;
1041	}	1084	}
1042	else if (map)	1085	else if (map)
1043	{	1086	{
1044	if (type == PLAYER)
1045	{
1046	// leaving a spot always closes any open container on the ground
1047	if (container && !container->env)
1048	// this causes spurious floorbox updates, but it ensures
1049	// that the CLOSE event is being sent.
1050	close_container ();
1051
1052	--map->players;
1053	map->touch ();
1054	}
1055
1056	map->dirty = true;	1087	map->dirty = true;
1057	mapspace &ms = this->ms ();	1088	mapspace &ms = this->ms ();
		1089
		1090	if (object *pl = ms.player ())
		1091	{
		1092	if (type == PLAYER) // this == pl(!)
		1093	{
		1094	// leaving a spot always closes any open container on the ground
		1095	if (container && !container->env)
		1096	// this causes spurious floorbox updates, but it ensures
		1097	// that the CLOSE event is being sent.
		1098	close_container ();
		1099
		1100	--map->players;
		1101	map->touch ();
		1102	}
		1103	else if (pl->container == this)
		1104	{
		1105	// removing a container should close it
		1106	close_container ();
		1107	}
		1108
		1109	esrv_del_item (pl->contr, count);
		1110	}
1058		1111
1059	/* link the object above us */	1112	/* link the object above us */
1060	if (above)	1113	if (above)
1061	above->below = below;	1114	above->below = below;
1062	else	1115	else
…		…
1083	if (map->in_memory == MAP_SAVING)	1136	if (map->in_memory == MAP_SAVING)
1084	return;	1137	return;
1085		1138
1086	int check_walk_off = !flag [FLAG_NO_APPLY];	1139	int check_walk_off = !flag [FLAG_NO_APPLY];
1087		1140
		1141	if (object *pl = ms.player ())
		1142	{
		1143	if (pl->container == this)
		1144	/* If a container that the player is currently using somehow gets
		1145	* removed (most likely destroyed), update the player view
		1146	* appropriately.
		1147	*/
		1148	pl->close_container ();
		1149
		1150	//TODO: the floorbox prev/next might need updating
		1151	//esrv_del_item (pl->contr, count);
		1152	//TODO: update floorbox to preserve ordering
		1153	if (pl->contr->ns)
		1154	pl->contr->ns->floorbox_update ();
		1155	}
		1156
1088	for (tmp = ms.bot; tmp; tmp = tmp->above)	1157	for (tmp = ms.bot; tmp; tmp = tmp->above)
1089	{	1158	{
1090	/* No point updating the players look faces if he is the object	1159	/* No point updating the players look faces if he is the object
1091	* being removed.	1160	* being removed.
1092	*/	1161	*/
1093
1094	if (tmp->type == PLAYER && tmp != this)
1095	{
1096	/* If a container that the player is currently using somehow gets
1097	* removed (most likely destroyed), update the player view
1098	* appropriately.
1099	*/
1100	if (tmp->container == this)
1101	{
1102	flag [FLAG_APPLIED] = 0;
1103	tmp->container = 0;
1104	}
1105
1106	if (tmp->contr->ns)
1107	tmp->contr->ns->floorbox_update ();
1108	}
1109		1162
1110	/* See if object moving off should effect something */	1163	/* See if object moving off should effect something */
1111	if (check_walk_off	1164	if (check_walk_off
1112	&& ((move_type & tmp->move_off)	1165	&& ((move_type & tmp->move_off)
1113	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1166	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1116		1169
1117	if (destroyed ())	1170	if (destroyed ())
1118	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1171	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1119	}	1172	}
1120		1173
1121	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1122	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1123	if (tmp->above == tmp)
1124	tmp->above = 0;
1125
1126	last = tmp;	1174	last = tmp;
1127	}	1175	}
1128		1176
1129	/* last == NULL if there are no objects on this space */	1177	/* last == NULL if there are no objects on this space */
1130	//TODO: this makes little sense, why only update the topmost object?	1178	//TODO: this makes little sense, why only update the topmost object?
…		…
1150	merge_ob (object *op, object *top)	1198	merge_ob (object *op, object *top)
1151	{	1199	{
1152	if (!op->nrof)	1200	if (!op->nrof)
1153	return 0;	1201	return 0;
1154		1202
1155	if (top)	1203	if (!top)
1156	for (top = op; top && top->above; top = top->above)	1204	for (top = op; top && top->above; top = top->above)
1157	;	1205	;
1158		1206
1159	for (; top; top = top->below)	1207	for (; top; top = top->below)
1160	{
1161	if (top == op)
1162	continue;
1163
1164	if (object::can_merge (op, top))	1208	if (object::can_merge (op, top))
1165	{	1209	{
1166	top->nrof += op->nrof;	1210	top->nrof += op->nrof;
1167		1211
1168	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1212	if (object *pl = top->visible_to ())
1169	op->weight = 0; /* Don't want any adjustements now */	1213	esrv_update_item (UPD_NROF, pl, top);
		1214
		1215	op->weight = 0; // cancel the addition above
		1216	op->carrying = 0; // must be 0 already
		1217
1170	op->destroy ();	1218	op->destroy (1);
		1219
1171	return top;	1220	return top;
1172	}	1221	}
1173	}
1174		1222
1175	return 0;	1223	return 0;
1176	}	1224	}
1177		1225
1178	void	1226	void
…		…
1237	object *	1285	object *
1238	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1286	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1239	{	1287	{
1240	assert (!op->flag [FLAG_FREED]);	1288	assert (!op->flag [FLAG_FREED]);
1241		1289
1242	object *top, *floor = NULL;
1243
1244	op->remove ();	1290	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		1291
1273	/* Ideally, the caller figures this out. However, it complicates a lot	1292	/* 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	1293	* of areas of callers (eg, anything that uses find_free_spot would now
1275	* need extra work	1294	* need extra work
1276	*/	1295	*/
1277	if (!xy_normalise (m, op->x, op->y))	1296	if (!xy_normalise (m, op->x, op->y))
		1297	{
		1298	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1278	return 0;	1299	return 0;
		1300	}
		1301
		1302	if (object *more = op->more)
		1303	if (!insert_ob_in_map (more, m, originator, flag))
		1304	return 0;
		1305
		1306	CLEAR_FLAG (op, FLAG_REMOVED);
1279		1307
1280	op->map = m;	1308	op->map = m;
1281	mapspace &ms = op->ms ();	1309	mapspace &ms = op->ms ();
1282		1310
1283	/* this has to be done after we translate the coordinates.	1311	/* this has to be done after we translate the coordinates.
1284	*/	1312	*/
1285	if (op->nrof && !(flag & INS_NO_MERGE))	1313	if (op->nrof && !(flag & INS_NO_MERGE))
1286	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1314	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1287	if (object::can_merge (op, tmp))	1315	if (object::can_merge (op, tmp))
1288	{	1316	{
		1317	// TODO: we atcually want to update tmp, not op,
		1318	// but some caller surely breaks when we return tmp
		1319	// from here :/
1289	op->nrof += tmp->nrof;	1320	op->nrof += tmp->nrof;
1290	tmp->destroy ();	1321	tmp->destroy (1);
1291	}	1322	}
1292		1323
1293	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1324	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1294	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1325	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1295		1326
…		…
1315	/* since *below* originator, no need to update top */	1346	/* since *below* originator, no need to update top */
1316	originator->below = op;	1347	originator->below = op;
1317	}	1348	}
1318	else	1349	else
1319	{	1350	{
		1351	object *top, *floor = NULL;
		1352
1320	top = ms.bot;	1353	top = ms.bot;
1321		1354
1322	/* If there are other objects, then */	1355	/* If there are other objects, then */
1323	if ((!(flag & INS_MAP_LOAD)) && top)	1356	if (top)
1324	{	1357	{
1325	object *last = 0;	1358	object *last = 0;
1326		1359
1327	/*	1360	/*
1328	* If there are multiple objects on this space, we do some trickier handling.	1361	* If there are multiple objects on this space, we do some trickier handling.
…		…
1381	if (last && last->below && last != floor)	1414	if (last && last->below && last != floor)
1382	top = last->below;	1415	top = last->below;
1383	}	1416	}
1384	} /* If objects on this space */	1417	} /* If objects on this space */
1385		1418
1386	if (flag & INS_MAP_LOAD)
1387	top = ms.top;
1388
1389	if (flag & INS_ABOVE_FLOOR_ONLY)	1419	if (flag & INS_ABOVE_FLOOR_ONLY)
1390	top = floor;	1420	top = floor;
1391		1421
1392	/* Top is the object that our object (op) is going to get inserted above.	1422	/* Top is the object that our object (op) is going to get inserted above.
1393	*/	1423	*/
…		…
1425	op->map->touch ();	1455	op->map->touch ();
1426	}	1456	}
1427		1457
1428	op->map->dirty = true;	1458	op->map->dirty = true;
1429		1459
1430	/* If we have a floor, we know the player, if any, will be above
1431	* it, so save a few ticks and start from there.
1432	*/
1433	if (!(flag & INS_MAP_LOAD))
1434	if (object *pl = ms.player ())	1460	if (object *pl = ms.player ())
		1461	//TODO: the floorbox prev/next might need updating
		1462	//esrv_send_item (pl, op);
		1463	//TODO: update floorbox to preserve ordering
1435	if (pl->contr->ns)	1464	if (pl->contr->ns)
1436	pl->contr->ns->floorbox_update ();	1465	pl->contr->ns->floorbox_update ();
1437		1466
1438	/* If this object glows, it may affect lighting conditions that are	1467	/* If this object glows, it may affect lighting conditions that are
1439	* visible to others on this map. But update_all_los is really	1468	* visible to others on this map. But update_all_los is really
1440	* an inefficient way to do this, as it means los for all players	1469	* an inefficient way to do this, as it means los for all players
1441	* on the map will get recalculated. The players could very well	1470	* on the map will get recalculated. The players could very well
…		…
1483	* op is the object to insert it under: supplies x and the map.	1512	* op is the object to insert it under: supplies x and the map.
1484	*/	1513	*/
1485	void	1514	void
1486	replace_insert_ob_in_map (const char *arch_string, object *op)	1515	replace_insert_ob_in_map (const char *arch_string, object *op)
1487	{	1516	{
1488	object *tmp, *tmp1;
1489
1490	/* first search for itself and remove any old instances */	1517	/* first search for itself and remove any old instances */
1491		1518
1492	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1519	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1493	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1520	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1494	tmp->destroy ();	1521	tmp->destroy (1);
1495		1522
1496	tmp1 = arch_to_object (archetype::find (arch_string));	1523	object *tmp = arch_to_object (archetype::find (arch_string));
1497		1524
1498	tmp1->x = op->x;	1525	tmp->x = op->x;
1499	tmp1->y = op->y;	1526	tmp->y = op->y;
		1527
1500	insert_ob_in_map (tmp1, op->map, op, 0);	1528	insert_ob_in_map (tmp, op->map, op, 0);
1501	}	1529	}
1502		1530
1503	object *	1531	object *
1504	object::insert_at (object *where, object *originator, int flags)	1532	object::insert_at (object *where, object *originator, int flags)
1505	{	1533	{
		1534	if (where->env)
		1535	return where->env->insert (this);
		1536	else
1506	return where->map->insert (this, where->x, where->y, originator, flags);	1537	return where->map->insert (this, where->x, where->y, originator, flags);
1507	}	1538	}
1508		1539
1509	/*	1540	/*
1510	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1511	* is returned contains nr objects, and the remaining parts contains
1512	* the rest (or is removed and freed if that number is 0).
1513	* On failure, NULL is returned, and the reason put into the
1514	* global static errmsg array.
1515	*/
1516	object *
1517	get_split_ob (object *orig_ob, uint32 nr)
1518	{
1519	object *newob;
1520	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1521
1522	if (orig_ob->nrof < nr)
1523	{
1524	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1525	return NULL;
1526	}
1527
1528	newob = object_create_clone (orig_ob);
1529
1530	if ((orig_ob->nrof -= nr) < 1)
1531	orig_ob->destroy (1);
1532	else if (!is_removed)
1533	{
1534	if (orig_ob->env != NULL)
1535	sub_weight (orig_ob->env, orig_ob->weight * nr);
1536	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1537	{
1538	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1539	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1540	return NULL;
1541	}
1542	}
1543
1544	newob->nrof = nr;
1545
1546	return newob;
1547	}
1548
1549	/*
1550	* decrease_ob_nr(object, number) decreases a specified number from	1541	* decrease(object, number) decreases a specified number from
1551	* the amount of an object. If the amount reaches 0, the object	1542	* the amount of an object. If the amount reaches 0, the object
1552	* is subsequently removed and freed.	1543	* is subsequently removed and freed.
1553	*	1544	*
1554	* Return value: 'op' if something is left, NULL if the amount reached 0	1545	* Return value: 'op' if something is left, NULL if the amount reached 0
1555	*/	1546	*/
		1547	bool
		1548	object::decrease (sint32 nr)
		1549	{
		1550	if (!nr)
		1551	return true;
		1552
		1553	nr = min (nr, nrof);
		1554
		1555	nrof -= nr;
		1556
		1557	if (nrof)
		1558	{
		1559	adjust_weight (env, -weight * nr); // carrying == 0
		1560
		1561	if (object *pl = visible_to ())
		1562	esrv_update_item (UPD_NROF, pl, this);
		1563
		1564	return true;
		1565	}
		1566	else
		1567	{
		1568	destroy (1);
		1569	return false;
		1570	}
		1571	}
		1572
		1573	/*
		1574	* split(ob,nr) splits up ob into two parts. The part which
		1575	* is returned contains nr objects, and the remaining parts contains
		1576	* the rest (or is removed and returned if that number is 0).
		1577	* On failure, NULL is returned.
		1578	*/
1556	object *	1579	object *
1557	decrease_ob_nr (object *op, uint32 i)	1580	object::split (sint32 nr)
1558	{	1581	{
1559	object *tmp;	1582	int have = number_of ();
1560		1583
1561	if (i == 0) /* objects with op->nrof require this check */	1584	if (have < nr)
1562	return op;	1585	return 0;
1563		1586	else if (have == nr)
1564	if (i > op->nrof)
1565	i = op->nrof;
1566
1567	if (QUERY_FLAG (op, FLAG_REMOVED))
1568	op->nrof -= i;
1569	else if (op->env)
1570	{	1587	{
1571	/* is this object in the players inventory, or sub container
1572	* therein?
1573	*/
1574	tmp = op->in_player ();
1575	/* nope. Is this a container the player has opened?
1576	* If so, set tmp to that player.
1577	* IMO, searching through all the players will mostly
1578	* likely be quicker than following op->env to the map,
1579	* and then searching the map for a player.
1580	*/
1581	if (!tmp)
1582	for_all_players (pl)
1583	if (pl->ob->container == op->env)
1584	{
1585	tmp = pl->ob;
1586	break;
1587	}
1588
1589	if (i < op->nrof)
1590	{
1591	sub_weight (op->env, op->weight * i);
1592	op->nrof -= i;
1593	if (tmp)
1594	esrv_send_item (tmp, op);
1595	}
1596	else
1597	{
1598	op->remove ();	1588	remove ();
1599	op->nrof = 0;	1589	return this;
1600	if (tmp)
1601	esrv_del_item (tmp->contr, op->count);
1602	}
1603	}	1590	}
1604	else	1591	else
1605	{	1592	{
1606	object *above = op->above;	1593	decrease (nr);
1607		1594
1608	if (i < op->nrof)	1595	object *op = deep_clone ();
1609	op->nrof -= i;	1596	op->nrof = nr;
1610	else
1611	{
1612	op->remove ();
1613	op->nrof = 0;
1614	}
1615
1616	/* Since we just removed op, op->above is null */
1617	for (tmp = above; tmp; tmp = tmp->above)
1618	if (tmp->type == PLAYER)
1619	{
1620	if (op->nrof)
1621	esrv_send_item (tmp, op);
1622	else
1623	esrv_del_item (tmp->contr, op->count);
1624	}
1625	}
1626
1627	if (op->nrof)
1628	return op;	1597	return op;
1629	else
1630	{
1631	op->destroy ();
1632	return 0;
1633	}
1634	}
1635
1636	/*
1637	* add_weight(object, weight) adds the specified weight to an object,
1638	* and also updates how much the environment(s) is/are carrying.
1639	*/
1640	void
1641	add_weight (object *op, signed long weight)
1642	{
1643	while (op != NULL)
1644	{
1645	if (op->type == CONTAINER)
1646	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1647
1648	op->carrying += weight;
1649	op = op->env;
1650	}	1598	}
1651	}	1599	}
1652		1600
1653	object *	1601	object *
1654	insert_ob_in_ob (object *op, object *where)	1602	insert_ob_in_ob (object *op, object *where)
…		…
1679	* be != op, if items are merged. -Tero	1627	* be != op, if items are merged. -Tero
1680	*/	1628	*/
1681	object *	1629	object *
1682	object::insert (object *op)	1630	object::insert (object *op)
1683	{	1631	{
1684	object *tmp, *otmp;
1685
1686	if (!QUERY_FLAG (op, FLAG_REMOVED))
1687	op->remove ();
1688
1689	if (op->more)	1632	if (op->more)
1690	{	1633	{
1691	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1634	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1692	return op;	1635	return op;
1693	}	1636	}
1694		1637
1695	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1638	op->remove ();
1696	CLEAR_FLAG (op, FLAG_REMOVED);	1639
		1640	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1641
1697	if (op->nrof)	1642	if (op->nrof)
1698	{
1699	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1643	for (object *tmp = inv; tmp; tmp = tmp->below)
1700	if (object::can_merge (tmp, op))	1644	if (object::can_merge (tmp, op))
1701	{	1645	{
1702	/* return the original object and remove inserted object	1646	/* return the original object and remove inserted object
1703	(client needs the original object) */	1647	(client needs the original object) */
1704	tmp->nrof += op->nrof;	1648	tmp->nrof += op->nrof;
1705	/* Weight handling gets pretty funky. Since we are adding to	1649
1706	* tmp->nrof, we need to increase the weight.	1650	if (object *pl = tmp->visible_to ())
1707	*/	1651	esrv_update_item (UPD_NROF, pl, tmp);
		1652
1708	add_weight (this, op->weight * op->nrof);	1653	adjust_weight (this, op->total_weight ());
1709	SET_FLAG (op, FLAG_REMOVED);	1654
1710	op->destroy (); /* free the inserted object */	1655	op->destroy (1);
1711	op = tmp;	1656	op = tmp;
1712	op->remove (); /* and fix old object's links */	1657	goto inserted;
1713	CLEAR_FLAG (op, FLAG_REMOVED);
1714	break;
1715	}	1658	}
1716		1659
1717	/* I assume combined objects have no inventory	1660	op->owner = 0; // it's his/hers now. period.
1718	* We add the weight - this object could have just been removed
1719	* (if it was possible to merge). calling remove_ob will subtract
1720	* the weight, so we need to add it in again, since we actually do
1721	* the linking below
1722	*/
1723	add_weight (this, op->weight * op->nrof);
1724	}
1725	else
1726	add_weight (this, (op->weight + op->carrying));
1727
1728	otmp = this->in_player ();
1729	if (otmp && otmp->contr)
1730	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1731	otmp->update_stats ();
1732
1733	op->map = 0;	1661	op->map = 0;
1734	op->env = this;	1662	op->x = 0;
		1663	op->y = 0;
		1664
1735	op->above = 0;	1665	op->above = 0;
1736	op->below = 0;	1666	op->below = inv;
1737	op->x = 0, op->y = 0;	1667	op->env = this;
1738		1668
		1669	if (inv)
		1670	inv->above = op;
		1671
		1672	inv = op;
		1673
		1674	op->flag [FLAG_REMOVED] = 0;
		1675
		1676	if (object *pl = op->visible_to ())
		1677	esrv_send_item (pl, op);
		1678
		1679	adjust_weight (this, op->total_weight ());
		1680
		1681	inserted:
1739	/* reset the light list and los of the players on the map */	1682	/* reset the light list and los of the players on the map */
1740	if ((op->glow_radius != 0) && map)	1683	if (op->glow_radius && map && map->darkness)
1741	{
1742	#ifdef DEBUG_LIGHTS
1743	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1744	#endif /* DEBUG_LIGHTS */
1745	if (map->darkness)
1746	update_all_los (map, x, y);	1684	update_all_los (map, x, y);
1747	}
1748		1685
1749	/* Client has no idea of ordering so lets not bother ordering it here.	1686	// if this is a player's inventory, update stats
1750	* It sure simplifies this function...	1687	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1751	*/	1688	update_stats ();
1752	if (!inv)
1753	inv = op;
1754	else
1755	{
1756	op->below = inv;
1757	op->below->above = op;
1758	inv = op;
1759	}
1760		1689
1761	INVOKE_OBJECT (INSERT, this);	1690	INVOKE_OBJECT (INSERT, this);
1762		1691
1763	return op;	1692	return op;
1764	}	1693	}
…		…
1892	LOG (llevError, "Present_arch called outside map.\n");	1821	LOG (llevError, "Present_arch called outside map.\n");
1893	return NULL;	1822	return NULL;
1894	}	1823	}
1895		1824
1896	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1825	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1897	if (tmp->arch == at)	1826	if (tmp->arch->archname == at->archname)
1898	return tmp;	1827	return tmp;
1899		1828
1900	return NULL;	1829	return NULL;
1901	}	1830	}
1902		1831
…		…
1966	* The first matching object is returned, or NULL if none.	1895	* The first matching object is returned, or NULL if none.
1967	*/	1896	*/
1968	object *	1897	object *
1969	present_arch_in_ob (const archetype *at, const object *op)	1898	present_arch_in_ob (const archetype *at, const object *op)
1970	{	1899	{
1971	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1900	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1972	if (tmp->arch == at)	1901	if (tmp->arch->archname == at->archname)
1973	return tmp;	1902	return tmp;
1974		1903
1975	return NULL;	1904	return NULL;
1976	}	1905	}
1977		1906
…		…
1979	* activate recursively a flag on an object inventory	1908	* activate recursively a flag on an object inventory
1980	*/	1909	*/
1981	void	1910	void
1982	flag_inv (object *op, int flag)	1911	flag_inv (object *op, int flag)
1983	{	1912	{
1984	if (op->inv)
1985	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1913	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1986	{	1914	{
1987	SET_FLAG (tmp, flag);	1915	SET_FLAG (tmp, flag);
1988	flag_inv (tmp, flag);	1916	flag_inv (tmp, flag);
1989	}	1917	}
1990	}	1918	}
1991		1919
1992	/*	1920	/*
1993	* deactivate recursively a flag on an object inventory	1921	* deactivate recursively a flag on an object inventory
1994	*/	1922	*/
1995	void	1923	void
1996	unflag_inv (object *op, int flag)	1924	unflag_inv (object *op, int flag)
1997	{	1925	{
1998	if (op->inv)
1999	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1926	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2000	{	1927	{
2001	CLEAR_FLAG (tmp, flag);	1928	CLEAR_FLAG (tmp, flag);
2002	unflag_inv (tmp, flag);	1929	unflag_inv (tmp, flag);
2003	}	1930	}
2004	}	1931	}
2005		1932
2006	/*	1933	/*
2007	* find_free_spot(object, map, x, y, start, stop) will search for	1934	* find_free_spot(object, map, x, y, start, stop) will search for
2008	* a spot at the given map and coordinates which will be able to contain	1935	* a spot at the given map and coordinates which will be able to contain
…		…
2010	* to search (see the freearr_x/y[] definition).	1937	* to search (see the freearr_x/y[] definition).
2011	* It returns a random choice among the alternatives found.	1938	* It returns a random choice among the alternatives found.
2012	* start and stop are where to start relative to the free_arr array (1,9	1939	* start and stop are where to start relative to the free_arr array (1,9
2013	* does all 4 immediate directions). This returns the index into the	1940	* does all 4 immediate directions). This returns the index into the
2014	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1941	* array of the free spot, -1 if no spot available (dir 0 = x,y)
2015	* Note - this only checks to see if there is space for the head of the
2016	* object - if it is a multispace object, this should be called for all
2017	* pieces.
2018	* Note2: This function does correctly handle tiled maps, but does not	1942	* Note: This function does correctly handle tiled maps, but does not
2019	* inform the caller. However, insert_ob_in_map will update as	1943	* inform the caller. However, insert_ob_in_map will update as
2020	* necessary, so the caller shouldn't need to do any special work.	1944	* necessary, so the caller shouldn't need to do any special work.
2021	* Note - updated to take an object instead of archetype - this is necessary	1945	* Note - updated to take an object instead of archetype - this is necessary
2022	* because arch_blocked (now ob_blocked) needs to know the movement type	1946	* because arch_blocked (now ob_blocked) needs to know the movement type
2023	* to know if the space in question will block the object. We can't use	1947	* to know if the space in question will block the object. We can't use
…		…
2025	* customized, changed states, etc.	1949	* customized, changed states, etc.
2026	*/	1950	*/
2027	int	1951	int
2028	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1952	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2029	{	1953	{
		1954	int altern[SIZEOFFREE];
2030	int index = 0, flag;	1955	int index = 0, flag;
2031	int altern[SIZEOFFREE];
2032		1956
2033	for (int i = start; i < stop; i++)	1957	for (int i = start; i < stop; i++)
2034	{	1958	{
2035	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1959	mapxy pos (m, x, y); pos.move (i);
2036	if (!flag)	1960
		1961	if (!pos.normalise ())
		1962	continue;
		1963
		1964	mapspace &ms = *pos;
		1965
		1966	if (ms.flags () & P_IS_ALIVE)
		1967	continue;
		1968
		1969	/* However, often
		1970	* ob doesn't have any move type (when used to place exits)
		1971	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1972	*/
		1973	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1974	{
2037	altern [index++] = i;	1975	altern [index++] = i;
		1976	continue;
		1977	}
2038		1978
2039	/* Basically, if we find a wall on a space, we cut down the search size.	1979	/* Basically, if we find a wall on a space, we cut down the search size.
2040	* In this way, we won't return spaces that are on another side of a wall.	1980	* In this way, we won't return spaces that are on another side of a wall.
2041	* This mostly work, but it cuts down the search size in all directions -	1981	* This mostly work, but it cuts down the search size in all directions -
2042	* if the space being examined only has a wall to the north and empty	1982	* if the space being examined only has a wall to the north and empty
2043	* spaces in all the other directions, this will reduce the search space	1983	* spaces in all the other directions, this will reduce the search space
2044	* to only the spaces immediately surrounding the target area, and	1984	* to only the spaces immediately surrounding the target area, and
2045	* won't look 2 spaces south of the target space.	1985	* won't look 2 spaces south of the target space.
2046	*/	1986	*/
2047	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1987	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1988	{
2048	stop = maxfree[i];	1989	stop = maxfree[i];
		1990	continue;
		1991	}
		1992
		1993	/* Note it is intentional that we check ob - the movement type of the
		1994	* head of the object should correspond for the entire object.
		1995	*/
		1996	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1997	continue;
		1998
		1999	if (ob->blocked (m, pos.x, pos.y))
		2000	continue;
		2001
		2002	altern [index++] = i;
2049	}	2003	}
2050		2004
2051	if (!index)	2005	if (!index)
2052	return -1;	2006	return -1;
2053		2007
…		…
2062	*/	2016	*/
2063	int	2017	int
2064	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2018	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2065	{	2019	{
2066	for (int i = 0; i < SIZEOFFREE; i++)	2020	for (int i = 0; i < SIZEOFFREE; i++)
2067	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2021	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2068	return i;	2022	return i;
2069		2023
2070	return -1;	2024	return -1;
2071	}	2025	}
2072		2026
…		…
2349	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2303	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2350	* core dumps if they do.	2304	* core dumps if they do.
2351	*	2305	*
2352	* Add a check so we can't pick up invisible objects (0.93.8)	2306	* Add a check so we can't pick up invisible objects (0.93.8)
2353	*/	2307	*/
2354
2355	int	2308	int
2356	can_pick (const object *who, const object *item)	2309	can_pick (const object *who, const object *item)
2357	{	2310	{
2358	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2311	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2359	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2312	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2362		2315
2363	/*	2316	/*
2364	* create clone from object to another	2317	* create clone from object to another
2365	*/	2318	*/
2366	object *	2319	object *
2367	object_create_clone (object *asrc)	2320	object::deep_clone ()
2368	{	2321	{
2369	object *dst = 0, *tmp, *src, *prev, *item;	2322	assert (("deep_clone called on non-head object", is_head ()));
2370		2323
2371	if (!asrc)	2324	object *dst = clone ();
2372	return 0;
2373		2325
2374	src = asrc->head_ ();	2326	object *prev = dst;
2375
2376	prev = 0;
2377	for (object *part = src; part; part = part->more)	2327	for (object *part = this->more; part; part = part->more)
2378	{	2328	{
2379	tmp = part->clone ();	2329	object *tmp = part->clone ();
2380	tmp->x -= src->x;
2381	tmp->y -= src->y;
2382
2383	if (!part->head)
2384	{
2385	dst = tmp;
2386	tmp->head = 0;
2387	}
2388	else
2389	tmp->head = dst;	2330	tmp->head = dst;
2390
2391	tmp->more = 0;
2392
2393	if (prev)
2394	prev->more = tmp;	2331	prev->more = tmp;
2395
2396	prev = tmp;	2332	prev = tmp;
2397	}	2333	}
2398		2334
2399	for (item = src->inv; item; item = item->below)	2335	for (object *item = inv; item; item = item->below)
2400	insert_ob_in_ob (object_create_clone (item), dst);	2336	insert_ob_in_ob (item->deep_clone (), dst);
2401		2337
2402	return dst;	2338	return dst;
2403	}	2339	}
2404		2340
2405	/* This returns the first object in who's inventory that	2341	/* This returns the first object in who's inventory that
…		…
2414	return tmp;	2350	return tmp;
2415		2351
2416	return 0;	2352	return 0;
2417	}	2353	}
2418		2354
2419	/* If ob has a field named key, return the link from the list,	2355	const shstr &
2420	* otherwise return NULL.	2356	object::kv_get (const shstr &key) const
2421	*
2422	* key must be a passed in shared string - otherwise, this won't
2423	* do the desired thing.
2424	*/
2425	key_value *
2426	get_ob_key_link (const object *ob, const char *key)
2427	{	2357	{
2428	for (key_value *link = ob->key_values; link; link = link->next)	2358	for (key_value *kv = key_values; kv; kv = kv->next)
2429	if (link->key == key)	2359	if (kv->key == key)
2430	return link;
2431
2432	return 0;
2433	}
2434
2435	/*
2436	* Returns the value of op has an extra_field for key, or NULL.
2437	*
2438	* The argument doesn't need to be a shared string.
2439	*
2440	* The returned string is shared.
2441	*/
2442	const char *
2443	get_ob_key_value (const object *op, const char *const key)
2444	{
2445	key_value *link;
2446	shstr_cmp canonical_key (key);
2447
2448	if (!canonical_key)
2449	{
2450	/* 1. There being a field named key on any object
2451	* implies there'd be a shared string to find.
2452	* 2. Since there isn't, no object has this field.
2453	* 3. Therefore, *this* object doesn't have this field.
2454	*/
2455	return 0;
2456	}
2457
2458	/* This is copied from get_ob_key_link() above -
2459	* only 4 lines, and saves the function call overhead.
2460	*/
2461	for (link = op->key_values; link; link = link->next)
2462	if (link->key == canonical_key)
2463	return link->value;	2360	return kv->value;
2464		2361
2465	return 0;	2362	return shstr_null;
2466	}	2363	}
2467		2364
2468	/*	2365	void
2469	* Updates the canonical_key in op to value.	2366	object::kv_set (const shstr &key, const shstr &value)
2470	*
2471	* canonical_key is a shared string (value doesn't have to be).
2472	*
2473	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2474	* keys.
2475	*
2476	* Returns TRUE on success.
2477	*/
2478	int
2479	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2480	{	2367	{
2481	key_value *field = NULL, *last = NULL;	2368	for (key_value *kv = key_values; kv; kv = kv->next)
2482		2369	if (kv->key == key)
2483	for (field = op->key_values; field != NULL; field = field->next)
2484	{
2485	if (field->key != canonical_key)
2486	{	2370	{
2487	last = field;	2371	kv->value = value;
2488	continue;	2372	return;
2489	}	2373	}
2490		2374
2491	if (value)	2375	key_value *kv = new key_value;
2492	field->value = value;	2376
2493	else	2377	kv->next = key_values;
		2378	kv->key = key;
		2379	kv->value = value;
		2380
		2381	key_values = kv;
		2382	}
		2383
		2384	void
		2385	object::kv_del (const shstr &key)
		2386	{
		2387	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2388	if ((*kvp)->key == key)
2494	{	2389	{
2495	/* Basically, if the archetype has this key set,	2390	key_value *kv = *kvp;
2496	* we need to store the null value so when we save	2391	*kvp = (*kvp)->next;
2497	* it, we save the empty value so that when we load,	2392	delete kv;
2498	* we get this value back again.	2393	return;
2499	*/
2500	if (get_ob_key_link (op->arch, canonical_key))
2501	field->value = 0;
2502	else
2503	{
2504	if (last)
2505	last->next = field->next;
2506	else
2507	op->key_values = field->next;
2508
2509	delete field;
2510	}
2511	}	2394	}
2512	return TRUE;
2513	}
2514	/* IF we get here, key doesn't exist */
2515
2516	/* No field, we'll have to add it. */
2517
2518	if (!add_key)
2519	return FALSE;
2520
2521	/* There isn't any good reason to store a null
2522	* value in the key/value list. If the archetype has
2523	* this key, then we should also have it, so shouldn't
2524	* be here. If user wants to store empty strings,
2525	* should pass in ""
2526	*/
2527	if (value == NULL)
2528	return TRUE;
2529
2530	field = new key_value;
2531
2532	field->key = canonical_key;
2533	field->value = value;
2534	/* Usual prepend-addition. */
2535	field->next = op->key_values;
2536	op->key_values = field;
2537
2538	return TRUE;
2539	}
2540
2541	/*
2542	* Updates the key in op to value.
2543	*
2544	* If add_key is FALSE, this will only update existing keys,
2545	* and not add new ones.
2546	* In general, should be little reason FALSE is ever passed in for add_key
2547	*
2548	* Returns TRUE on success.
2549	*/
2550	int
2551	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2552	{
2553	shstr key_ (key);
2554
2555	return set_ob_key_value_s (op, key_, value, add_key);
2556	}	2395	}
2557		2396
2558	object::depth_iterator::depth_iterator (object *container)	2397	object::depth_iterator::depth_iterator (object *container)
2559	: iterator_base (container)	2398	: iterator_base (container)
2560	{	2399	{
…		…
2573	item = item->inv;	2412	item = item->inv;
2574	}	2413	}
2575	else	2414	else
2576	item = item->env;	2415	item = item->env;
2577	}	2416	}
2578
2579		2417
2580	const char *	2418	const char *
2581	object::flag_desc (char *desc, int len) const	2419	object::flag_desc (char *desc, int len) const
2582	{	2420	{
2583	char *p = desc;	2421	char *p = desc;
…		…
2611	{	2449	{
2612	char flagdesc[512];	2450	char flagdesc[512];
2613	char info2[256 * 4];	2451	char info2[256 * 4];
2614	char *p = info;	2452	char *p = info;
2615		2453
2616	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2454	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2617	count, uuid.seq,	2455	count,
		2456	uuid.c_str (),
2618	&name,	2457	&name,
2619	title ? "\",title:\"" : "",	2458	title ? "\",title:\"" : "",
2620	title ? (const char *)title : "",	2459	title ? (const char *)title : "",
2621	flag_desc (flagdesc, 512), type);	2460	flag_desc (flagdesc, 512), type);
2622		2461
2623	if (env)	2462	if (!flag[FLAG_REMOVED] && env)
2624	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2463	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2625		2464
2626	if (map)	2465	if (map)
2627	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2466	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2628		2467
…		…
2646	}	2485	}
2647		2486
2648	const materialtype_t *	2487	const materialtype_t *
2649	object::dominant_material () const	2488	object::dominant_material () const
2650	{	2489	{
2651	if (materialtype_t *mat = name_to_material (materialname))	2490	if (materialtype_t *mt = name_to_material (materialname))
2652	return mat;	2491	return mt;
2653		2492
2654	// omfg this is slow, this has to be temporary :)
2655	shstr unknown ("unknown");
2656
2657	return name_to_material (unknown);	2493	return name_to_material (shstr_unknown);
2658	}	2494	}
2659		2495
2660	void	2496	void
2661	object::open_container (object *new_container)	2497	object::open_container (object *new_container)
2662	{	2498	{
2663	if (container == new_container)	2499	if (container == new_container)
2664	return;	2500	return;
2665		2501
2666	if (object *old_container = container)	2502	object *old_container = container;
		2503
		2504	if (old_container)
2667	{	2505	{
2668	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2506	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2669	return;	2507	return;
2670		2508
2671	#if 0	2509	#if 0
…		…
2673	if (object *closer = old_container->inv)	2511	if (object *closer = old_container->inv)
2674	if (closer->type == CLOSE_CON)	2512	if (closer->type == CLOSE_CON)
2675	closer->destroy ();	2513	closer->destroy ();
2676	#endif	2514	#endif
2677		2515
		2516	// make sure the container is available
		2517	esrv_send_item (this, old_container);
		2518
2678	old_container->flag [FLAG_APPLIED] = 0;	2519	old_container->flag [FLAG_APPLIED] = false;
2679	container = 0;	2520	container = 0;
2680		2521
		2522	// client needs item update to make it work, client bug requires this to be separate
2681	esrv_update_item (UPD_FLAGS, this, old_container);	2523	esrv_update_item (UPD_FLAGS, this, old_container);
		2524
2682	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2525	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2526	play_sound (sound_find ("chest_close"));
2683	}	2527	}
2684		2528
2685	if (new_container)	2529	if (new_container)
2686	{	2530	{
2687	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))	2531	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
…		…
2698	}	2542	}
2699	#endif	2543	#endif
2700		2544
2701	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2545	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2702		2546
		2547	// make sure the container is available, client bug requires this to be separate
		2548	esrv_send_item (this, new_container);
		2549
2703	new_container->flag [FLAG_APPLIED] = 1;	2550	new_container->flag [FLAG_APPLIED] = true;
2704	container = new_container;	2551	container = new_container;
2705		2552
		2553	// client needs flag change
2706	esrv_update_item (UPD_FLAGS, this, new_container);	2554	esrv_update_item (UPD_FLAGS, this, new_container);
2707	esrv_send_inventory (this, new_container);	2555	esrv_send_inventory (this, new_container);
		2556	play_sound (sound_find ("chest_open"));
		2557	}
		2558	// else if (!old_container->env && contr && contr->ns)
		2559	// contr->ns->floorbox_reset ();
		2560	}
		2561
		2562	object *
		2563	object::force_find (const shstr name)
		2564	{
		2565	/* cycle through his inventory to look for the MARK we want to
		2566	* place
		2567	*/
		2568	for (object *tmp = inv; tmp; tmp = tmp->below)
		2569	if (tmp->type == FORCE && tmp->slaying == name)
		2570	return splay (tmp);
		2571
		2572	return 0;
		2573	}
		2574
		2575	void
		2576	object::force_add (const shstr name, int duration)
		2577	{
		2578	if (object *force = force_find (name))
		2579	force->destroy ();
		2580
		2581	object *force = get_archetype (FORCE_NAME);
		2582
		2583	force->slaying = name;
		2584	force->stats.food = 1;
		2585	force->speed_left = -1.f;
		2586
		2587	force->set_speed (duration ? 1.f / duration : 0.f);
		2588	force->flag [FLAG_IS_USED_UP] = true;
		2589	force->flag [FLAG_APPLIED] = true;
		2590
		2591	insert (force);
		2592	}
		2593
		2594	void
		2595	object::play_sound (faceidx sound)
		2596	{
		2597	if (!sound)
		2598	return;
		2599
		2600	if (flag [FLAG_REMOVED])
		2601	return;
		2602
		2603	if (env)
2708	}	2604	{
		2605	if (object *pl = in_player ())
		2606	pl->contr->play_sound (sound);
		2607	}
		2608	else
		2609	map->play_sound (sound, x, y);
2709	}	2610	}
2710		2611
2711

Diff Legend

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