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.146 by root, Fri May 11 21:07:13 2007 UTC vs.
Revision 1.227 by root, Sat May 3 09:04:17 2008 UTC

1	/*	1	/*
2	* CrossFire, A Multiplayer game	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* This program 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 2 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,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
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, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21	*	20	*
22	* The authors can be reached via e-mail at <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;	144	key_value *wants_field;
142		145
143	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	146	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both
…		…
151	key_value *has_field;	154	key_value *has_field;
152		155
153	/* Look for a field in has with the same key. */	156	/* Look for a field in has with the same key. */
154	has_field = get_ob_key_link (has, wants_field->key);	157	has_field = get_ob_key_link (has, wants_field->key);
155		158
156	if (has_field == NULL)	159	if (!has_field)
157	{
158	/* No field with that name. */	160	return 0; /* No field with that name. */
159	return FALSE;
160	}
161		161
162	/* Found the matching field. */	162	/* Found the matching field. */
163	if (has_field->value != wants_field->value)	163	if (has_field->value != wants_field->value)
164	{
165	/* Values don't match, so this half of the comparison is false. */	164	return 0; /* Values don't match, so this half of the comparison is false. */
166	return FALSE;
167	}
168		165
169	/* If we get here, we found a match. Now for the next field in wants. */	166	/* If we get here, we found a match. Now for the next field in wants. */
170	}	167	}
171		168
172	/* If we get here, every field in wants has a matching field in has. */	169	/* If we get here, every field in wants has a matching field in has. */
173	return TRUE;	170	return 1;
174	}	171	}
175		172
176	/* Returns TRUE if ob1 has the same key_values as ob2. */	173	/* Returns TRUE if ob1 has the same key_values as ob2. */
177	static int	174	static bool
178	compare_ob_value_lists (const object *ob1, const object *ob2)	175	compare_ob_value_lists (const object *ob1, const object *ob2)
179	{	176	{
180	/* However, there may be fields in has which aren't partnered in wants,	177	/* However, there may be fields in has which aren't partnered in wants,
181	* so we need to run the comparison *twice*. :(	178	* so we need to run the comparison *twice*. :(
182	*/	179	*/
…		…
203	|| ob1->speed != ob2->speed	200	|| ob1->speed != ob2->speed
204	|| ob1->value != ob2->value	201	|| ob1->value != ob2->value
205	|| ob1->name != ob2->name)	202	|| ob1->name != ob2->name)
206	return 0;	203	return 0;
207		204
208	//TODO: this ain't working well, use nicer and correct overflow check	205	/* 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	206	* for unsigned overflow (2c), second part checks whether the result
210	* value could not be stored in a sint32 (which unfortunately sometimes is	207	* would fit into a 32 bit signed int, which is often used to hold
211	* used to store nrof).	208	* nrof values.
212	*/	209	*/
213	if (ob1->nrof + ob2->nrof >= 1UL << 31)	210	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
214	return 0;	211	return 0;
215		212
216	/* If the objects have been identified, set the BEEN_APPLIED flag.	213	/* 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	214	* 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	215	* 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	216	* are not equal - just if it has been identified, the been_applied
220	* flags lose any meaning.	217	* flags lose any meaning.
221	*/	218	*/
222	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	219	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
223	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	220	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
224		221
225	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	222	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
226	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	223	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
227		224
228	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	225	if (ob1->arch->name != ob2->arch->name
229	|| ob1->arch != ob2->arch
230	|| ob1->name != ob2->name	226	|| ob1->name != ob2->name
231	|| ob1->title != ob2->title	227	|| ob1->title != ob2->title
232	|| ob1->msg != ob2->msg	228	|| ob1->msg != ob2->msg
233	|| ob1->weight != ob2->weight	229	|| 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	230	|| ob1->attacktype != ob2->attacktype
237	|| ob1->magic != ob2->magic	231	|| ob1->magic != ob2->magic
238	|| ob1->slaying != ob2->slaying	232	|| ob1->slaying != ob2->slaying
239	|| ob1->skill != ob2->skill	233	|| ob1->skill != ob2->skill
240	|| ob1->value != ob2->value	234	|| ob1->value != ob2->value
…		…
247	|| ob1->move_block != ob2->move_block	241	|| ob1->move_block != ob2->move_block
248	|| ob1->move_allow != ob2->move_allow	242	|| ob1->move_allow != ob2->move_allow
249	|| ob1->move_on != ob2->move_on	243	|| ob1->move_on != ob2->move_on
250	|| ob1->move_off != ob2->move_off	244	|| ob1->move_off != ob2->move_off
251	|| ob1->move_slow != ob2->move_slow	245	|| ob1->move_slow != ob2->move_slow
252	|| ob1->move_slow_penalty != ob2->move_slow_penalty)	246	|| ob1->move_slow_penalty != ob2->move_slow_penalty
		247	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
		248	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
253	return 0;	249	return 0;
254		250
		251	if ((ob1->flag ^ ob2->flag)
		252	.reset (FLAG_INV_LOCKED)
		253	.reset (FLAG_CLIENT_SENT)
		254	.reset (FLAG_REMOVED)
		255	.any ())
		256	return 0;
		257
255	/* This is really a spellbook check - really, we should	258	/* This is really a spellbook check - we should in general
256	* check all objects in the inventory.	259	* not merge objects with real inventories, as splitting them
		260	* is hard.
257	*/	261	*/
258	if (ob1->inv || ob2->inv)	262	if (ob1->inv || ob2->inv)
259	{	263	{
260	/* if one object has inventory but the other doesn't, not equiv */	264	if (!(ob1->inv && ob2->inv))
261	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	265	return 0; /* inventories differ in length */
262	return 0;
263		266
264	/* Now check to see if the two inventory objects could merge */	267	if (ob1->inv->below || ob2->inv->below)
		268	return 0; /* more than one object in inv */
		269
265	if (!object::can_merge (ob1->inv, ob2->inv))	270	if (!object::can_merge (ob1->inv, ob2->inv))
266	return 0;	271	return 0; /* inventory objects differ */
267		272
268	/* inventory ok - still need to check rest of this object to see	273	/* inventory ok - still need to check rest of this object to see
269	* if it is valid.	274	* if it is valid.
270	*/	275	*/
271	}	276	}
…		…
290	if (ob1->level != ob2->level)	295	if (ob1->level != ob2->level)
291	return 0;	296	return 0;
292	break;	297	break;
293	}	298	}
294		299
295	if (ob1->key_values != NULL || ob2->key_values != NULL)	300	if (ob1->key_values || ob2->key_values)
296	{	301	{
297	/* At least one of these has key_values. */	302	/* At least one of these has key_values. */
298	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	303	if ((!ob1->key_values) != (!ob2->key_values))
299	/* One has fields, but the other one doesn't. */	304	return 0; /* One has fields, but the other one doesn't. */
		305
		306	if (!compare_ob_value_lists (ob1, ob2))
300	return 0;	307	return 0;
301	else if (!compare_ob_value_lists (ob1, ob2))
302	return 0;
303	}	308	}
304		309
305	//TODO: generate an event or call into perl for additional checks
306	if (ob1->self || ob2->self)	310	if (ob1->self || ob2->self)
307	{	311	{
308	ob1->optimise ();	312	ob1->optimise ();
309	ob2->optimise ();	313	ob2->optimise ();
310		314
311	if (ob1->self || ob2->self)	315	if (ob1->self || ob2->self)
		316	{
		317	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		318	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		319
		320	if (k1 != k2)
312	return 0;	321	return 0;
		322
		323	if (k1 == 0)
		324	return 1;
		325
		326	if (!cfperl_can_merge (ob1, ob2))
		327	return 0;
		328	}
313	}	329	}
314		330
315	/* Everything passes, must be OK. */	331	/* Everything passes, must be OK. */
316	return 1;	332	return 1;
317	}	333	}
318		334
		335	// find player who can see this object
		336	object *
		337	object::visible_to () const
		338	{
		339	if (client_visible () && !flag [FLAG_REMOVED])
		340	{
		341	// see if we are in a container of sorts
		342	if (env)
		343	{
		344	// the player inventory itself is always visible
		345	if (env->type == PLAYER)
		346	return env;
		347
		348	// else a player could have our env open
		349	object *envest = env->outer_env ();
		350
		351	// the player itself is always on a map, so we will find him here
		352	// even if our inv is in a player.
		353	if (envest->is_on_map ())
		354	if (object *pl = envest->ms ().player ())
		355	if (pl->container == env)
		356	return pl;
		357	}
		358	else
		359	{
		360	// maybe there is a player standing on the same mapspace
		361	// this will catch the case where "this" is a player
		362	if (object *pl = ms ().player ())
		363	if (!pl->container || this == pl->container)
		364	return pl;
		365	}
		366	}
		367
		368	return 0;
		369	}
		370
		371	// adjust weight per container type ("of holding")
		372	static sint32
		373	weight_adjust (object *op, sint32 weight)
		374	{
		375	return op->type == CONTAINER
		376	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		377	: weight;
		378	}
		379
319	/*	380	/*
		381	* adjust_weight(object, weight) adds the specified weight to an object,
		382	* and also updates how much the environment(s) is/are carrying.
		383	*/
		384	static void
		385	adjust_weight (object *op, sint32 weight)
		386	{
		387	while (op)
		388	{
		389	weight = weight_adjust (op, weight);
		390
		391	if (!weight)
		392	return;
		393
		394	op->carrying += weight;
		395
		396	if (object *pl = op->visible_to ())
		397	if (pl != op) // player is handled lazily
		398	esrv_update_item (UPD_WEIGHT, pl, op);
		399
		400	op = op->env;
		401	}
		402	}
		403
		404	/*
320	* sum_weight() is a recursive function which calculates the weight	405	* this is a recursive function which calculates the weight
321	* an object is carrying. It goes through in figures out how much	406	* an object is carrying. It goes through op and figures out how much
322	* containers are carrying, and sums it up.	407	* containers are carrying, and sums it up.
323	*/	408	*/
324	long	409	void
325	sum_weight (object *op)	410	object::update_weight ()
326	{	411	{
327	long sum;	412	sint32 sum = 0;
328	object *inv;
329		413
330	for (sum = 0, inv = op->inv; inv; inv = inv->below)	414	for (object *op = inv; op; op = op->below)
331	{	415	{
332	if (inv->inv)	416	if (op->inv)
333	sum_weight (inv);	417	op->update_weight ();
334		418
335	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	419	sum += op->total_weight ();
		420	}
		421
		422	sum = weight_adjust (this, sum);
		423
		424	if (sum != carrying)
336	}	425	{
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;	426	carrying = sum;
343		427
344	return sum;	428	if (object *pl = visible_to ())
		429	if (pl != this) // player is handled lazily
		430	esrv_update_item (UPD_WEIGHT, pl, this);
		431	}
345	}	432	}
346		433
347	/**	434	/*
348	* Return the outermost environment object for a given object.	435	* 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	*/	436	*/
364	char *	437	char *
365	dump_object (object *op)	438	dump_object (object *op)
366	{	439	{
367	if (!op)	440	if (!op)
…		…
375	/*	448	/*
376	* get_nearest_part(multi-object, object 2) returns the part of the	449	* get_nearest_part(multi-object, object 2) returns the part of the
377	* multi-object 1 which is closest to the second object.	450	* multi-object 1 which is closest to the second object.
378	* If it's not a multi-object, it is returned.	451	* If it's not a multi-object, it is returned.
379	*/	452	*/
380
381	object *	453	object *
382	get_nearest_part (object *op, const object *pl)	454	get_nearest_part (object *op, const object *pl)
383	{	455	{
384	object *tmp, *closest;	456	object *tmp, *closest;
385	int last_dist, i;	457	int last_dist, i;
386		458
387	if (op->more == NULL)	459	if (!op->more)
388	return op;	460	return op;
		461
389	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	462	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		463	tmp;
		464	tmp = tmp->more)
390	if ((i = distance (tmp, pl)) < last_dist)	465	if ((i = distance (tmp, pl)) < last_dist)
391	closest = tmp, last_dist = i;	466	closest = tmp, last_dist = i;
		467
392	return closest;	468	return closest;
393	}	469	}
394		470
395	/*	471	/*
396	* Returns the object which has the count-variable equal to the argument.	472	* Returns the object which has the count-variable equal to the argument.
		473	* VERRRY slow.
397	*/	474	*/
398	object *	475	object *
399	find_object (tag_t i)	476	find_object (tag_t i)
400	{	477	{
401	for_all_objects (op)	478	for_all_objects (op)
…		…
421	break;	498	break;
422		499
423	return op;	500	return op;
424	}	501	}
425		502
426	void
427	free_all_object_data ()
428	{
429	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
430	}
431
432	/*	503	/*
433	* Sets the owner and sets the skill and exp pointers to owner's current	504	* Sets the owner and sets the skill and exp pointers to owner's current
434	* skill and experience objects.	505	* skill and experience objects.
		506	* ACTUALLY NO! investigate! TODO
435	*/	507	*/
436	void	508	void
437	object::set_owner (object *owner)	509	object::set_owner (object *owner)
438	{	510	{
		511	// allow objects which own objects
439	if (!owner)	512	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)	513	while (owner->owner)
450	owner = owner->owner;	514	owner = owner->owner;
		515
		516	if (flag [FLAG_FREED])
		517	{
		518	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		519	return;
		520	}
451		521
452	this->owner = owner;	522	this->owner = owner;
453	}	523	}
454		524
455	void	525	int
		526	object::slottype () const
		527	{
		528	if (type == SKILL)
		529	{
		530	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		531	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		532	}
		533	else
		534	{
		535	if (slot [body_combat].info) return slot_combat;
		536	if (slot [body_range ].info) return slot_ranged;
		537	}
		538
		539	return slot_none;
		540	}
		541
		542	bool
456	object::set_weapon (object *ob)	543	object::change_weapon (object *ob)
457	{	544	{
458	if (current_weapon == ob)	545	if (current_weapon == ob)
459	return;	546	return true;
460
461	new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
462		547
463	if (chosen_skill)	548	if (chosen_skill)
464	chosen_skill->flag [FLAG_APPLIED] = false;	549	chosen_skill->flag [FLAG_APPLIED] = false;
465		550
466	current_weapon = ob;	551	current_weapon = ob;
467	chosen_skill = ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);	552	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
468		553
469	if (chosen_skill)	554	if (chosen_skill)
470	chosen_skill->flag [FLAG_APPLIED] = true;	555	chosen_skill->flag [FLAG_APPLIED] = true;
471		556
472	update_stats ();	557	update_stats ();
		558
		559	if (ob)
		560	{
		561	// now check wether any body locations became invalid, in which case
		562	// we cannot apply the weapon at the moment.
		563	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		564	if (slot[i].used < 0)
		565	{
		566	current_weapon = chosen_skill = 0;
		567	update_stats ();
		568
		569	new_draw_info_format (NDI_UNIQUE, 0, this,
		570	"You try to balance all your items at once, "
		571	"but the %s is just too much for your body. "
		572	"[You need to unapply some items first.]", &ob->name);
		573	return false;
		574	}
		575
		576	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		577	}
		578	else
		579	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		580
		581	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		582	{
		583	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		584	&name, ob->debug_desc ());
		585	return false;
		586	}
		587
		588	return true;
473	}	589	}
474		590
475	/* Zero the key_values on op, decrementing the shared-string	591	/* Zero the key_values on op, decrementing the shared-string
476	* refcounts and freeing the links.	592	* refcounts and freeing the links.
477	*/	593	*/
…		…
487	}	603	}
488		604
489	op->key_values = 0;	605	op->key_values = 0;
490	}	606	}
491		607
492	object &	608	/*
493	object::operator =(const object &src)	609	* copy_to first frees everything allocated by the dst object,
		610	* and then copies the contents of itself into the second
		611	* object, allocating what needs to be allocated. Basically, any
		612	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		613	* if the first object is freed, the pointers in the new object
		614	* will point at garbage.
		615	*/
		616	void
		617	object::copy_to (object *dst)
494	{	618	{
495	bool is_freed = flag [FLAG_FREED];	619	dst->remove ();
496	bool is_removed = flag [FLAG_REMOVED];
497
498	*(object_copy *)this = src;	620	*(object_copy *)dst = *this;
499
500	flag [FLAG_FREED] = is_freed;
501	flag [FLAG_REMOVED] = is_removed;	621	dst->flag [FLAG_REMOVED] = true;
502		622
503	/* Copy over key_values, if any. */	623	/* Copy over key_values, if any. */
504	if (src.key_values)	624	if (key_values)
505	{	625	{
506	key_value *tail = 0;	626	key_value *tail = 0;
507	key_values = 0;	627	dst->key_values = 0;
508		628
509	for (key_value *i = src.key_values; i; i = i->next)	629	for (key_value *i = key_values; i; i = i->next)
510	{	630	{
511	key_value *new_link = new key_value;	631	key_value *new_link = new key_value;
512		632
513	new_link->next = 0;	633	new_link->next = 0;
514	new_link->key = i->key;	634	new_link->key = i->key;
515	new_link->value = i->value;	635	new_link->value = i->value;
516		636
517	/* Try and be clever here, too. */	637	/* Try and be clever here, too. */
518	if (!key_values)	638	if (!dst->key_values)
519	{	639	{
520	key_values = new_link;	640	dst->key_values = new_link;
521	tail = new_link;	641	tail = new_link;
522	}	642	}
523	else	643	else
524	{	644	{
525	tail->next = new_link;	645	tail->next = new_link;
526	tail = new_link;	646	tail = new_link;
527	}	647	}
528	}	648	}
529	}	649	}
530	}
531
532	/*
533	* copy_to first frees everything allocated by the dst object,
534	* and then copies the contents of itself into the second
535	* object, allocating what needs to be allocated. Basically, any
536	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
537	* if the first object is freed, the pointers in the new object
538	* will point at garbage.
539	*/
540	void
541	object::copy_to (object *dst)
542	{
543	*dst = *this;
544		650
545	if (speed < 0)	651	if (speed < 0)
546	dst->speed_left = speed_left - rndm ();	652	dst->speed_left -= rndm ();
547		653
548	dst->set_speed (dst->speed);	654	dst->set_speed (dst->speed);
549	}	655	}
550		656
551	void	657	void
552	object::instantiate ()	658	object::instantiate ()
553	{	659	{
554	if (!uuid.seq) // HACK	660	if (!uuid.seq) // HACK
555	uuid = gen_uuid ();	661	uuid = UUID::gen ();
556		662
557	speed_left = -0.1f;	663	speed_left = -0.1f;
558	/* copy the body_info to the body_used - this is only really	664	/* copy the body_info to the body_used - this is only really
559	* need for monsters, but doesn't hurt to do it for everything.	665	* need for monsters, but doesn't hurt to do it for everything.
560	* by doing so, when a monster is created, it has good starting	666	* by doing so, when a monster is created, it has good starting
…		…
570	object *	676	object *
571	object::clone ()	677	object::clone ()
572	{	678	{
573	object *neu = create ();	679	object *neu = create ();
574	copy_to (neu);	680	copy_to (neu);
		681	neu->map = map; // not copied by copy_to
575	return neu;	682	return neu;
576	}	683	}
577		684
578	/*	685	/*
579	* If an object with the IS_TURNABLE() flag needs to be turned due	686	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
630	* UP_OBJ_FACE: only the objects face has changed.	737	* UP_OBJ_FACE: only the objects face has changed.
631	*/	738	*/
632	void	739	void
633	update_object (object *op, int action)	740	update_object (object *op, int action)
634	{	741	{
635	if (op == NULL)	742	if (!op)
636	{	743	{
637	/* this should never happen */	744	/* this should never happen */
638	LOG (llevDebug, "update_object() called for NULL object.\n");	745	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
639	return;	746	return;
640	}	747	}
641		748
642	if (op->env)	749	if (!op->is_on_map ())
643	{	750	{
644	/* Animation is currently handled by client, so nothing	751	/* Animation is currently handled by client, so nothing
645	* to do in this case.	752	* to do in this case.
646	*/	753	*/
647	return;	754	return;
648	}	755	}
649
650	/* If the map is saving, don't do anything as everything is
651	* going to get freed anyways.
652	*/
653	if (!op->map || op->map->in_memory == MAP_SAVING)
654	return;
655		756
656	/* make sure the object is within map boundaries */	757	/* make sure the object is within map boundaries */
657	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)	758	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
658	{	759	{
659	LOG (llevError, "update_object() called for object out of map!\n");	760	LOG (llevError, "update_object() called for object out of map!\n");
…		…
719	static int object_count;	820	static int object_count;
720		821
721	void object::link ()	822	void object::link ()
722	{	823	{
723	assert (!index);//D	824	assert (!index);//D
724	uuid = gen_uuid ();	825	uuid = UUID::gen ();
725	count = ++object_count;	826	count = ++object_count;
726		827
727	refcnt_inc ();	828	refcnt_inc ();
728	objects.insert (this);	829	objects.insert (this);
729	}	830	}
…		…
802	object::destroy_inv (bool drop_to_ground)	903	object::destroy_inv (bool drop_to_ground)
803	{	904	{
804	// need to check first, because the checks below might segfault	905	// need to check first, because the checks below might segfault
805	// as we might be on an invalid mapspace and crossfire code	906	// as we might be on an invalid mapspace and crossfire code
806	// is too buggy to ensure that the inventory is empty.	907	// is too buggy to ensure that the inventory is empty.
807	// corollary: if you create arrows etc. with stuff in tis inventory,	908	// corollary: if you create arrows etc. with stuff in its inventory,
808	// cf will crash below with off-map x and y	909	// cf will crash below with off-map x and y
809	if (!inv)	910	if (!inv)
810	return;	911	return;
811		912
812	/* Only if the space blocks everything do we not process -	913	/* Only if the space blocks everything do we not process -
813	* if some form of movement is allowed, let objects	914	* if some form of movement is allowed, let objects
814	* drop on that space.	915	* drop on that space.
815	*/	916	*/
816	if (!drop_to_ground	917	if (!drop_to_ground
817	|| !map	918	|| !map
818	|| map->in_memory != MAP_IN_MEMORY	919	|| map->in_memory != MAP_ACTIVE
819	|| map->nodrop	920	|| map->nodrop
820	|| ms ().move_block == MOVE_ALL)	921	|| ms ().move_block == MOVE_ALL)
821	{	922	{
822	while (inv)	923	while (inv)
823	{	924	{
824	inv->destroy_inv (drop_to_ground);	925	inv->destroy_inv (false);
825	inv->destroy ();	926	inv->destroy ();
826	}	927	}
827	}	928	}
828	else	929	else
829	{ /* Put objects in inventory onto this space */	930	{ /* Put objects in inventory onto this space */
…		…
835	|| op->flag [FLAG_NO_DROP]	936	|| op->flag [FLAG_NO_DROP]
836	|| op->type == RUNE	937	|| op->type == RUNE
837	|| op->type == TRAP	938	|| op->type == TRAP
838	|| op->flag [FLAG_IS_A_TEMPLATE]	939	|| op->flag [FLAG_IS_A_TEMPLATE]
839	|| op->flag [FLAG_DESTROY_ON_DEATH])	940	|| op->flag [FLAG_DESTROY_ON_DEATH])
840	op->destroy ();	941	op->destroy (true);
841	else	942	else
842	map->insert (op, x, y);	943	map->insert (op, x, y);
843	}	944	}
844	}	945	}
845	}	946	}
…		…
849	object *op = new object;	950	object *op = new object;
850	op->link ();	951	op->link ();
851	return op;	952	return op;
852	}	953	}
853		954
		955	static struct freed_map : maptile
		956	{
		957	freed_map ()
		958	{
		959	path = "<freed objects map>";
		960	name = "/internal/freed_objects_map";
		961	width = 3;
		962	height = 3;
		963	nodrop = 1;
		964
		965	alloc ();
		966	in_memory = MAP_ACTIVE;
		967	}
		968	} freed_map; // freed objects are moved here to avoid crashes
		969
854	void	970	void
855	object::do_destroy ()	971	object::do_destroy ()
856	{	972	{
857	attachable::do_destroy ();
858
859	if (flag [FLAG_IS_LINKED])	973	if (flag [FLAG_IS_LINKED])
860	remove_button_link (this);	974	remove_button_link (this);
861		975
862	if (flag [FLAG_FRIENDLY])	976	if (flag [FLAG_FRIENDLY])
863	remove_friendly_object (this);	977	remove_friendly_object (this);
864		978
865	if (!flag [FLAG_REMOVED])
866	remove ();	979	remove ();
867		980
868	destroy_inv (true);	981	attachable::do_destroy ();
869		982
870	deactivate ();	983	deactivate ();
871	unlink ();	984	unlink ();
872		985
873	flag [FLAG_FREED] = 1;	986	flag [FLAG_FREED] = 1;
874		987
875	// hack to ensure that freed objects still have a valid map	988	// hack to ensure that freed objects still have a valid map
876	{
877	static maptile *freed_map; // freed objects are moved here to avoid crashes
878
879	if (!freed_map)
880	{
881	freed_map = new maptile;
882
883	freed_map->name = "/internal/freed_objects_map";
884	freed_map->width = 3;
885	freed_map->height = 3;
886
887	freed_map->alloc ();
888	freed_map->in_memory = MAP_IN_MEMORY;
889	}
890
891	map = freed_map;	989	map = &freed_map;
892	x = 1;	990	x = 1;
893	y = 1;	991	y = 1;
894	}
895
896	head = 0;
897		992
898	if (more)	993	if (more)
899	{	994	{
900	more->destroy ();	995	more->destroy ();
901	more = 0;	996	more = 0;
902	}	997	}
903		998
		999	head = 0;
		1000
904	// clear those pointers that likely might have circular references to us	1001	// clear those pointers that likely might cause circular references
905	owner = 0;	1002	owner = 0;
906	enemy = 0;	1003	enemy = 0;
907	attacked_by = 0;	1004	attacked_by = 0;
		1005	current_weapon = 0;
908	}	1006	}
909		1007
910	void	1008	void
911	object::destroy (bool destroy_inventory)	1009	object::destroy (bool destroy_inventory)
912	{	1010	{
913	if (destroyed ())	1011	if (destroyed ())
914	return;	1012	return;
915		1013
		1014	if (!is_head () && !head->destroyed ())
		1015	{
		1016	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1017	head->destroy (destroy_inventory);
		1018	return;
		1019	}
		1020
916	if (destroy_inventory)	1021	destroy_inv (!destroy_inventory);
917	destroy_inv (false);	1022
		1023	if (is_head ())
		1024	if (sound_destroy)
		1025	play_sound (sound_destroy);
		1026	else if (flag [FLAG_MONSTER])
		1027	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
918		1028
919	attachable::destroy ();	1029	attachable::destroy ();
920	}
921
922	/*
923	* sub_weight() recursively (outwards) subtracts a number from the
924	* weight of an object (and what is carried by it's environment(s)).
925	*/
926	void
927	sub_weight (object *op, signed long weight)
928	{
929	while (op != NULL)
930	{
931	if (op->type == CONTAINER)
932	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
933
934	op->carrying -= weight;
935	op = op->env;
936	}
937	}	1030	}
938		1031
939	/* op->remove ():	1032	/* op->remove ():
940	* This function removes the object op from the linked list of objects	1033	* This function removes the object op from the linked list of objects
941	* which it is currently tied to. When this function is done, the	1034	* which it is currently tied to. When this function is done, the
…		…
947	object::do_remove ()	1040	object::do_remove ()
948	{	1041	{
949	object *tmp, *last = 0;	1042	object *tmp, *last = 0;
950	object *otmp;	1043	object *otmp;
951		1044
952	if (QUERY_FLAG (this, FLAG_REMOVED))	1045	if (flag [FLAG_REMOVED])
953	return;	1046	return;
954		1047
955	SET_FLAG (this, FLAG_REMOVED);
956	INVOKE_OBJECT (REMOVE, this);	1048	INVOKE_OBJECT (REMOVE, this);
		1049
		1050	flag [FLAG_REMOVED] = true;
957		1051
958	if (more)	1052	if (more)
959	more->remove ();	1053	more->remove ();
960		1054
961	/*	1055	/*
962	* In this case, the object to be removed is in someones	1056	* In this case, the object to be removed is in someones
963	* inventory.	1057	* inventory.
964	*/	1058	*/
965	if (env)	1059	if (env)
966	{	1060	{
		1061	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
		1062	if (object *pl = visible_to ())
		1063	esrv_del_item (pl->contr, count);
		1064	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1065
		1066	adjust_weight (env, -total_weight ());
		1067
		1068	*(above ? &above->below : &env->inv) = below;
		1069
967	if (nrof)	1070	if (below)
968	sub_weight (env, weight * nrof);	1071	below->above = above;
969	else	1072
970	sub_weight (env, weight + carrying);	1073	/* we set up values so that it could be inserted into
		1074	* the map, but we don't actually do that - it is up
		1075	* to the caller to decide what we want to do.
		1076	*/
		1077	map = env->map;
		1078	x = env->x;
		1079	y = env->y;
		1080	above = 0;
		1081	below = 0;
		1082	env = 0;
971		1083
972	/* NO_FIX_PLAYER is set when a great many changes are being	1084	/* NO_FIX_PLAYER is set when a great many changes are being
973	* made to players inventory. If set, avoiding the call	1085	* made to players inventory. If set, avoiding the call
974	* to save cpu time.	1086	* to save cpu time.
975	*/	1087	*/
976	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1088	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
977	otmp->update_stats ();	1089	otmp->update_stats ();
978
979	if (above)
980	above->below = below;
981	else
982	env->inv = below;
983
984	if (below)
985	below->above = above;
986
987	/* we set up values so that it could be inserted into
988	* the map, but we don't actually do that - it is up
989	* to the caller to decide what we want to do.
990	*/
991	x = env->x, y = env->y;
992	map = env->map;
993	above = 0, below = 0;
994	env = 0;
995	}	1090	}
996	else if (map)	1091	else if (map)
997	{	1092	{
998	if (type == PLAYER)
999	{
1000	// leaving a spot always closes any open container on the ground
1001	if (container && !container->env)
1002	// this causes spurious floorbox updates, but it ensures
1003	// that the CLOSE event is being sent.
1004	close_container ();
1005
1006	--map->players;
1007	map->touch ();
1008	}
1009
1010	map->dirty = true;	1093	map->dirty = true;
1011	mapspace &ms = this->ms ();	1094	mapspace &ms = this->ms ();
		1095
		1096	if (object *pl = ms.player ())
		1097	{
		1098	if (type == PLAYER) // this == pl(!)
		1099	{
		1100	// leaving a spot always closes any open container on the ground
		1101	if (container && !container->env)
		1102	// this causes spurious floorbox updates, but it ensures
		1103	// that the CLOSE event is being sent.
		1104	close_container ();
		1105
		1106	--map->players;
		1107	map->touch ();
		1108	}
		1109	else if (pl->container == this)
		1110	{
		1111	// removing a container should close it
		1112	close_container ();
		1113	}
		1114
		1115	esrv_del_item (pl->contr, count);
		1116	}
1012		1117
1013	/* link the object above us */	1118	/* link the object above us */
1014	if (above)	1119	if (above)
1015	above->below = below;	1120	above->below = below;
1016	else	1121	else
…		…
1037	if (map->in_memory == MAP_SAVING)	1142	if (map->in_memory == MAP_SAVING)
1038	return;	1143	return;
1039		1144
1040	int check_walk_off = !flag [FLAG_NO_APPLY];	1145	int check_walk_off = !flag [FLAG_NO_APPLY];
1041		1146
		1147	if (object *pl = ms.player ())
		1148	{
		1149	if (pl->container == this)
		1150	/* If a container that the player is currently using somehow gets
		1151	* removed (most likely destroyed), update the player view
		1152	* appropriately.
		1153	*/
		1154	pl->close_container ();
		1155
		1156	//TODO: the floorbox prev/next might need updating
		1157	//esrv_del_item (pl->contr, count);
		1158	//TODO: update floorbox to preserve ordering
		1159	if (pl->contr->ns)
		1160	pl->contr->ns->floorbox_update ();
		1161	}
		1162
1042	for (tmp = ms.bot; tmp; tmp = tmp->above)	1163	for (tmp = ms.bot; tmp; tmp = tmp->above)
1043	{	1164	{
1044	/* No point updating the players look faces if he is the object	1165	/* No point updating the players look faces if he is the object
1045	* being removed.	1166	* being removed.
1046	*/	1167	*/
1047
1048	if (tmp->type == PLAYER && tmp != this)
1049	{
1050	/* If a container that the player is currently using somehow gets
1051	* removed (most likely destroyed), update the player view
1052	* appropriately.
1053	*/
1054	if (tmp->container == this)
1055	{
1056	flag [FLAG_APPLIED] = 0;
1057	tmp->container = 0;
1058	}
1059
1060	if (tmp->contr->ns)
1061	tmp->contr->ns->floorbox_update ();
1062	}
1063		1168
1064	/* See if object moving off should effect something */	1169	/* See if object moving off should effect something */
1065	if (check_walk_off	1170	if (check_walk_off
1066	&& ((move_type & tmp->move_off)	1171	&& ((move_type & tmp->move_off)
1067	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1172	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1070		1175
1071	if (destroyed ())	1176	if (destroyed ())
1072	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1177	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1073	}	1178	}
1074		1179
1075	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1076	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1077	if (tmp->above == tmp)
1078	tmp->above = 0;
1079
1080	last = tmp;	1180	last = tmp;
1081	}	1181	}
1082		1182
1083	/* last == NULL if there are no objects on this space */	1183	/* last == NULL if there are no objects on this space */
1084	//TODO: this makes little sense, why only update the topmost object?	1184	//TODO: this makes little sense, why only update the topmost object?
…		…
1104	merge_ob (object *op, object *top)	1204	merge_ob (object *op, object *top)
1105	{	1205	{
1106	if (!op->nrof)	1206	if (!op->nrof)
1107	return 0;	1207	return 0;
1108		1208
1109	if (top)	1209	if (!top)
1110	for (top = op; top && top->above; top = top->above)	1210	for (top = op; top && top->above; top = top->above)
1111	;	1211	;
1112		1212
1113	for (; top; top = top->below)	1213	for (; top; top = top->below)
1114	{
1115	if (top == op)
1116	continue;
1117
1118	if (object::can_merge (op, top))	1214	if (object::can_merge (op, top))
1119	{	1215	{
1120	top->nrof += op->nrof;	1216	top->nrof += op->nrof;
1121		1217
1122	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1218	if (object *pl = top->visible_to ())
1123	op->weight = 0; /* Don't want any adjustements now */	1219	esrv_update_item (UPD_NROF, pl, top);
		1220
		1221	op->weight = 0; // cancel the addition above
		1222	op->carrying = 0; // must be 0 already
		1223
1124	op->destroy ();	1224	op->destroy (1);
		1225
1125	return top;	1226	return top;
1126	}	1227	}
1127	}
1128		1228
1129	return 0;	1229	return 0;
1130	}	1230	}
1131		1231
1132	void	1232	void
…		…
1135	if (more)	1235	if (more)
1136	return;	1236	return;
1137		1237
1138	object *prev = this;	1238	object *prev = this;
1139		1239
1140	for (archetype *at = arch->more; at; at = at->more)	1240	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1141	{	1241	{
1142	object *op = arch_to_object (at);	1242	object *op = arch_to_object (at);
1143		1243
1144	op->name = name;	1244	op->name = name;
1145	op->name_pl = name_pl;	1245	op->name_pl = name_pl;
…		…
1159	object *	1259	object *
1160	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1260	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1161	{	1261	{
1162	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1262	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1163	{	1263	{
1164	tmp->x = x + tmp->arch->clone.x;	1264	tmp->x = x + tmp->arch->x;
1165	tmp->y = y + tmp->arch->clone.y;	1265	tmp->y = y + tmp->arch->y;
1166	}	1266	}
1167		1267
1168	return insert_ob_in_map (op, m, originator, flag);	1268	return insert_ob_in_map (op, m, originator, flag);
1169	}	1269	}
1170		1270
…		…
1191	object *	1291	object *
1192	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1292	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1193	{	1293	{
1194	assert (!op->flag [FLAG_FREED]);	1294	assert (!op->flag [FLAG_FREED]);
1195		1295
1196	object *tmp, *top, *floor = NULL;
1197
1198	op->remove ();	1296	op->remove ();
1199
1200	#if 0
1201	if (!m->active != !op->active)
1202	if (m->active)
1203	op->activate_recursive ();
1204	else
1205	op->deactivate_recursive ();
1206	#endif
1207
1208	if (out_of_map (m, op->x, op->y))
1209	{
1210	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1211	#ifdef MANY_CORES
1212	/* Better to catch this here, as otherwise the next use of this object
1213	* is likely to cause a crash. Better to find out where it is getting
1214	* improperly inserted.
1215	*/
1216	abort ();
1217	#endif
1218	return op;
1219	}
1220
1221	if (object *more = op->more)
1222	{
1223	if (!insert_ob_in_map (more, m, originator, flag))
1224	{
1225	if (!op->head)
1226	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1227
1228	return 0;
1229	}
1230	}
1231
1232	CLEAR_FLAG (op, FLAG_REMOVED);
1233		1297
1234	/* Ideally, the caller figures this out. However, it complicates a lot	1298	/* Ideally, the caller figures this out. However, it complicates a lot
1235	* of areas of callers (eg, anything that uses find_free_spot would now	1299	* of areas of callers (eg, anything that uses find_free_spot would now
1236	* need extra work	1300	* need extra work
1237	*/	1301	*/
1238	if (!xy_normalise (m, op->x, op->y))	1302	if (!xy_normalise (m, op->x, op->y))
		1303	{
		1304	op->destroy (1);
1239	return 0;	1305	return 0;
		1306	}
		1307
		1308	if (object *more = op->more)
		1309	if (!insert_ob_in_map (more, m, originator, flag))
		1310	return 0;
		1311
		1312	CLEAR_FLAG (op, FLAG_REMOVED);
1240		1313
1241	op->map = m;	1314	op->map = m;
1242	mapspace &ms = op->ms ();	1315	mapspace &ms = op->ms ();
1243		1316
1244	/* this has to be done after we translate the coordinates.	1317	/* this has to be done after we translate the coordinates.
1245	*/	1318	*/
1246	if (op->nrof && !(flag & INS_NO_MERGE))	1319	if (op->nrof && !(flag & INS_NO_MERGE))
1247	for (tmp = ms.bot; tmp; tmp = tmp->above)	1320	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1248	if (object::can_merge (op, tmp))	1321	if (object::can_merge (op, tmp))
1249	{	1322	{
		1323	// TODO: we atcually want to update tmp, not op,
		1324	// but some caller surely breaks when we return tmp
		1325	// from here :/
1250	op->nrof += tmp->nrof;	1326	op->nrof += tmp->nrof;
1251	tmp->destroy ();	1327	tmp->destroy (1);
1252	}	1328	}
1253		1329
1254	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1330	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1255	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1331	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1256		1332
…		…
1276	/* since *below* originator, no need to update top */	1352	/* since *below* originator, no need to update top */
1277	originator->below = op;	1353	originator->below = op;
1278	}	1354	}
1279	else	1355	else
1280	{	1356	{
		1357	object *top, *floor = NULL;
		1358
1281	top = ms.bot;	1359	top = ms.bot;
1282		1360
1283	/* If there are other objects, then */	1361	/* If there are other objects, then */
1284	if ((!(flag & INS_MAP_LOAD)) && top)	1362	if (top)
1285	{	1363	{
1286	object *last = 0;	1364	object *last = 0;
1287		1365
1288	/*	1366	/*
1289	* If there are multiple objects on this space, we do some trickier handling.	1367	* If there are multiple objects on this space, we do some trickier handling.
…		…
1342	if (last && last->below && last != floor)	1420	if (last && last->below && last != floor)
1343	top = last->below;	1421	top = last->below;
1344	}	1422	}
1345	} /* If objects on this space */	1423	} /* If objects on this space */
1346		1424
1347	if (flag & INS_MAP_LOAD)
1348	top = ms.top;
1349
1350	if (flag & INS_ABOVE_FLOOR_ONLY)	1425	if (flag & INS_ABOVE_FLOOR_ONLY)
1351	top = floor;	1426	top = floor;
1352		1427
1353	/* Top is the object that our object (op) is going to get inserted above.	1428	/* Top is the object that our object (op) is going to get inserted above.
1354	*/	1429	*/
…		…
1386	op->map->touch ();	1461	op->map->touch ();
1387	}	1462	}
1388		1463
1389	op->map->dirty = true;	1464	op->map->dirty = true;
1390		1465
1391	/* If we have a floor, we know the player, if any, will be above
1392	* it, so save a few ticks and start from there.
1393	*/
1394	if (!(flag & INS_MAP_LOAD))
1395	if (object *pl = ms.player ())	1466	if (object *pl = ms.player ())
		1467	//TODO: the floorbox prev/next might need updating
		1468	//esrv_send_item (pl, op);
		1469	//TODO: update floorbox to preserve ordering
1396	if (pl->contr->ns)	1470	if (pl->contr->ns)
1397	pl->contr->ns->floorbox_update ();	1471	pl->contr->ns->floorbox_update ();
1398		1472
1399	/* If this object glows, it may affect lighting conditions that are	1473	/* If this object glows, it may affect lighting conditions that are
1400	* visible to others on this map. But update_all_los is really	1474	* visible to others on this map. But update_all_los is really
1401	* an inefficient way to do this, as it means los for all players	1475	* an inefficient way to do this, as it means los for all players
1402	* on the map will get recalculated. The players could very well	1476	* on the map will get recalculated. The players could very well
…		…
1421	* blocked() and wall() work properly), and these flags are updated by	1495	* blocked() and wall() work properly), and these flags are updated by
1422	* update_object().	1496	* update_object().
1423	*/	1497	*/
1424		1498
1425	/* if this is not the head or flag has been passed, don't check walk on status */	1499	/* if this is not the head or flag has been passed, don't check walk on status */
1426	if (!(flag & INS_NO_WALK_ON) && !op->head)	1500	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1427	{	1501	{
1428	if (check_move_on (op, originator))	1502	if (check_move_on (op, originator))
1429	return 0;	1503	return 0;
1430		1504
1431	/* If we are a multi part object, lets work our way through the check	1505	/* If we are a multi part object, lets work our way through the check
1432	* walk on's.	1506	* walk on's.
1433	*/	1507	*/
1434	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1508	for (object *tmp = op->more; tmp; tmp = tmp->more)
1435	if (check_move_on (tmp, originator))	1509	if (check_move_on (tmp, originator))
1436	return 0;	1510	return 0;
1437	}	1511	}
1438		1512
1439	return op;	1513	return op;
…		…
1444	* op is the object to insert it under: supplies x and the map.	1518	* op is the object to insert it under: supplies x and the map.
1445	*/	1519	*/
1446	void	1520	void
1447	replace_insert_ob_in_map (const char *arch_string, object *op)	1521	replace_insert_ob_in_map (const char *arch_string, object *op)
1448	{	1522	{
1449	object *tmp, *tmp1;
1450
1451	/* first search for itself and remove any old instances */	1523	/* first search for itself and remove any old instances */
1452		1524
1453	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1525	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1454	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1526	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1455	tmp->destroy ();	1527	tmp->destroy (1);
1456		1528
1457	tmp1 = arch_to_object (archetype::find (arch_string));	1529	object *tmp = arch_to_object (archetype::find (arch_string));
1458		1530
1459	tmp1->x = op->x;	1531	tmp->x = op->x;
1460	tmp1->y = op->y;	1532	tmp->y = op->y;
		1533
1461	insert_ob_in_map (tmp1, op->map, op, 0);	1534	insert_ob_in_map (tmp, op->map, op, 0);
1462	}	1535	}
1463		1536
1464	object *	1537	object *
1465	object::insert_at (object *where, object *originator, int flags)	1538	object::insert_at (object *where, object *originator, int flags)
1466	{	1539	{
		1540	if (where->env)
		1541	return where->env->insert (this);
		1542	else
1467	return where->map->insert (this, where->x, where->y, originator, flags);	1543	return where->map->insert (this, where->x, where->y, originator, flags);
1468	}	1544	}
1469		1545
1470	/*	1546	/*
1471	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1472	* is returned contains nr objects, and the remaining parts contains
1473	* the rest (or is removed and freed if that number is 0).
1474	* On failure, NULL is returned, and the reason put into the
1475	* global static errmsg array.
1476	*/
1477	object *
1478	get_split_ob (object *orig_ob, uint32 nr)
1479	{
1480	object *newob;
1481	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1482
1483	if (orig_ob->nrof < nr)
1484	{
1485	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1486	return NULL;
1487	}
1488
1489	newob = object_create_clone (orig_ob);
1490
1491	if ((orig_ob->nrof -= nr) < 1)
1492	orig_ob->destroy (1);
1493	else if (!is_removed)
1494	{
1495	if (orig_ob->env != NULL)
1496	sub_weight (orig_ob->env, orig_ob->weight * nr);
1497	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1498	{
1499	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1500	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1501	return NULL;
1502	}
1503	}
1504
1505	newob->nrof = nr;
1506
1507	return newob;
1508	}
1509
1510	/*
1511	* decrease_ob_nr(object, number) decreases a specified number from	1547	* decrease(object, number) decreases a specified number from
1512	* the amount of an object. If the amount reaches 0, the object	1548	* the amount of an object. If the amount reaches 0, the object
1513	* is subsequently removed and freed.	1549	* is subsequently removed and freed.
1514	*	1550	*
1515	* Return value: 'op' if something is left, NULL if the amount reached 0	1551	* Return value: 'op' if something is left, NULL if the amount reached 0
1516	*/	1552	*/
		1553	bool
		1554	object::decrease (sint32 nr)
		1555	{
		1556	if (!nr)
		1557	return true;
		1558
		1559	nr = min (nr, nrof);
		1560
		1561	nrof -= nr;
		1562
		1563	if (nrof)
		1564	{
		1565	adjust_weight (env, -weight * nr); // carrying == 0
		1566
		1567	if (object *pl = visible_to ())
		1568	esrv_update_item (UPD_NROF, pl, this);
		1569
		1570	return true;
		1571	}
		1572	else
		1573	{
		1574	destroy (1);
		1575	return false;
		1576	}
		1577	}
		1578
		1579	/*
		1580	* split(ob,nr) splits up ob into two parts. The part which
		1581	* is returned contains nr objects, and the remaining parts contains
		1582	* the rest (or is removed and returned if that number is 0).
		1583	* On failure, NULL is returned.
		1584	*/
1517	object *	1585	object *
1518	decrease_ob_nr (object *op, uint32 i)	1586	object::split (sint32 nr)
1519	{	1587	{
1520	object *tmp;	1588	int have = number_of ();
1521		1589
1522	if (i == 0) /* objects with op->nrof require this check */	1590	if (have < nr)
1523	return op;	1591	return 0;
1524		1592	else if (have == nr)
1525	if (i > op->nrof)
1526	i = op->nrof;
1527
1528	if (QUERY_FLAG (op, FLAG_REMOVED))
1529	op->nrof -= i;
1530	else if (op->env)
1531	{	1593	{
1532	/* is this object in the players inventory, or sub container
1533	* therein?
1534	*/
1535	tmp = op->in_player ();
1536	/* nope. Is this a container the player has opened?
1537	* If so, set tmp to that player.
1538	* IMO, searching through all the players will mostly
1539	* likely be quicker than following op->env to the map,
1540	* and then searching the map for a player.
1541	*/
1542	if (!tmp)
1543	for_all_players (pl)
1544	if (pl->ob->container == op->env)
1545	{
1546	tmp = pl->ob;
1547	break;
1548	}
1549
1550	if (i < op->nrof)
1551	{
1552	sub_weight (op->env, op->weight * i);
1553	op->nrof -= i;
1554	if (tmp)
1555	esrv_send_item (tmp, op);
1556	}
1557	else
1558	{
1559	op->remove ();	1594	remove ();
1560	op->nrof = 0;	1595	return this;
1561	if (tmp)
1562	esrv_del_item (tmp->contr, op->count);
1563	}
1564	}	1596	}
1565	else	1597	else
1566	{	1598	{
1567	object *above = op->above;	1599	decrease (nr);
1568		1600
1569	if (i < op->nrof)	1601	object *op = object_create_clone (this);
1570	op->nrof -= i;	1602	op->nrof = nr;
1571	else
1572	{
1573	op->remove ();
1574	op->nrof = 0;
1575	}
1576
1577	/* Since we just removed op, op->above is null */
1578	for (tmp = above; tmp; tmp = tmp->above)
1579	if (tmp->type == PLAYER)
1580	{
1581	if (op->nrof)
1582	esrv_send_item (tmp, op);
1583	else
1584	esrv_del_item (tmp->contr, op->count);
1585	}
1586	}
1587
1588	if (op->nrof)
1589	return op;	1603	return op;
1590	else
1591	{
1592	op->destroy ();
1593	return 0;
1594	}
1595	}
1596
1597	/*
1598	* add_weight(object, weight) adds the specified weight to an object,
1599	* and also updates how much the environment(s) is/are carrying.
1600	*/
1601	void
1602	add_weight (object *op, signed long weight)
1603	{
1604	while (op != NULL)
1605	{
1606	if (op->type == CONTAINER)
1607	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1608
1609	op->carrying += weight;
1610	op = op->env;
1611	}	1604	}
1612	}	1605	}
1613		1606
1614	object *	1607	object *
1615	insert_ob_in_ob (object *op, object *where)	1608	insert_ob_in_ob (object *op, object *where)
…		…
1620	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1613	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1621	free (dump);	1614	free (dump);
1622	return op;	1615	return op;
1623	}	1616	}
1624		1617
1625	if (where->head)	1618	if (where->head_ () != where)
1626	{	1619	{
1627	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1620	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1628	where = where->head;	1621	where = where->head;
1629	}	1622	}
1630		1623
1631	return where->insert (op);	1624	return where->insert (op);
1632	}	1625	}
…		…
1640	* be != op, if items are merged. -Tero	1633	* be != op, if items are merged. -Tero
1641	*/	1634	*/
1642	object *	1635	object *
1643	object::insert (object *op)	1636	object::insert (object *op)
1644	{	1637	{
1645	object *tmp, *otmp;
1646
1647	if (!QUERY_FLAG (op, FLAG_REMOVED))
1648	op->remove ();
1649
1650	if (op->more)	1638	if (op->more)
1651	{	1639	{
1652	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1640	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1653	return op;	1641	return op;
1654	}	1642	}
1655		1643
1656	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1644	op->remove ();
1657	CLEAR_FLAG (op, FLAG_REMOVED);	1645
		1646	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1647
1658	if (op->nrof)	1648	if (op->nrof)
1659	{
1660	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1649	for (object *tmp = inv; tmp; tmp = tmp->below)
1661	if (object::can_merge (tmp, op))	1650	if (object::can_merge (tmp, op))
1662	{	1651	{
1663	/* return the original object and remove inserted object	1652	/* return the original object and remove inserted object
1664	(client needs the original object) */	1653	(client needs the original object) */
1665	tmp->nrof += op->nrof;	1654	tmp->nrof += op->nrof;
1666	/* Weight handling gets pretty funky. Since we are adding to	1655
1667	* tmp->nrof, we need to increase the weight.	1656	if (object *pl = tmp->visible_to ())
1668	*/	1657	esrv_update_item (UPD_NROF, pl, tmp);
		1658
1669	add_weight (this, op->weight * op->nrof);	1659	adjust_weight (this, op->total_weight ());
1670	SET_FLAG (op, FLAG_REMOVED);	1660
1671	op->destroy (); /* free the inserted object */	1661	op->destroy (1);
1672	op = tmp;	1662	op = tmp;
1673	op->remove (); /* and fix old object's links */	1663	goto inserted;
1674	CLEAR_FLAG (op, FLAG_REMOVED);
1675	break;
1676	}	1664	}
1677		1665
1678	/* I assume combined objects have no inventory	1666	op->owner = 0; // it's his/hers now. period.
1679	* We add the weight - this object could have just been removed
1680	* (if it was possible to merge). calling remove_ob will subtract
1681	* the weight, so we need to add it in again, since we actually do
1682	* the linking below
1683	*/
1684	add_weight (this, op->weight * op->nrof);
1685	}
1686	else
1687	add_weight (this, (op->weight + op->carrying));
1688
1689	otmp = this->in_player ();
1690	if (otmp && otmp->contr)
1691	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1692	otmp->update_stats ();
1693
1694	op->map = 0;	1667	op->map = 0;
1695	op->env = this;	1668	op->x = 0;
		1669	op->y = 0;
		1670
1696	op->above = 0;	1671	op->above = 0;
1697	op->below = 0;	1672	op->below = inv;
1698	op->x = 0, op->y = 0;	1673	op->env = this;
1699		1674
		1675	if (inv)
		1676	inv->above = op;
		1677
		1678	inv = op;
		1679
		1680	op->flag [FLAG_REMOVED] = 0;
		1681
		1682	if (object *pl = op->visible_to ())
		1683	esrv_send_item (pl, op);
		1684
		1685	adjust_weight (this, op->total_weight ());
		1686
		1687	inserted:
1700	/* reset the light list and los of the players on the map */	1688	/* reset the light list and los of the players on the map */
1701	if ((op->glow_radius != 0) && map)	1689	if (op->glow_radius && map && map->darkness)
1702	{
1703	#ifdef DEBUG_LIGHTS
1704	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1705	#endif /* DEBUG_LIGHTS */
1706	if (map->darkness)
1707	update_all_los (map, x, y);	1690	update_all_los (map, x, y);
1708	}
1709		1691
1710	/* Client has no idea of ordering so lets not bother ordering it here.	1692	// if this is a player's inventory, update stats
1711	* It sure simplifies this function...	1693	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1712	*/	1694	update_stats ();
1713	if (!inv)
1714	inv = op;
1715	else
1716	{
1717	op->below = inv;
1718	op->below->above = op;
1719	inv = op;
1720	}
1721		1695
1722	INVOKE_OBJECT (INSERT, this);	1696	INVOKE_OBJECT (INSERT, this);
1723		1697
1724	return op;	1698	return op;
1725	}	1699	}
…		…
1940	* activate recursively a flag on an object inventory	1914	* activate recursively a flag on an object inventory
1941	*/	1915	*/
1942	void	1916	void
1943	flag_inv (object *op, int flag)	1917	flag_inv (object *op, int flag)
1944	{	1918	{
1945	if (op->inv)
1946	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1919	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1947	{	1920	{
1948	SET_FLAG (tmp, flag);	1921	SET_FLAG (tmp, flag);
1949	flag_inv (tmp, flag);	1922	flag_inv (tmp, flag);
1950	}	1923	}
1951	}	1924	}
1952		1925
1953	/*	1926	/*
1954	* deactivate recursively a flag on an object inventory	1927	* deactivate recursively a flag on an object inventory
1955	*/	1928	*/
1956	void	1929	void
1957	unflag_inv (object *op, int flag)	1930	unflag_inv (object *op, int flag)
1958	{	1931	{
1959	if (op->inv)
1960	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1932	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1961	{	1933	{
1962	CLEAR_FLAG (tmp, flag);	1934	CLEAR_FLAG (tmp, flag);
1963	unflag_inv (tmp, flag);	1935	unflag_inv (tmp, flag);
1964	}	1936	}
1965	}
1966
1967	/*
1968	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1969	* all it's inventory (recursively).
1970	* If checksums are used, a player will get set_cheat called for
1971	* him/her-self and all object carried by a call to this function.
1972	*/
1973	void
1974	set_cheat (object *op)
1975	{
1976	SET_FLAG (op, FLAG_WAS_WIZ);
1977	flag_inv (op, FLAG_WAS_WIZ);
1978	}	1937	}
1979		1938
1980	/*	1939	/*
1981	* find_free_spot(object, map, x, y, start, stop) will search for	1940	* find_free_spot(object, map, x, y, start, stop) will search for
1982	* a spot at the given map and coordinates which will be able to contain	1941	* a spot at the given map and coordinates which will be able to contain
…		…
1984	* to search (see the freearr_x/y[] definition).	1943	* to search (see the freearr_x/y[] definition).
1985	* It returns a random choice among the alternatives found.	1944	* It returns a random choice among the alternatives found.
1986	* start and stop are where to start relative to the free_arr array (1,9	1945	* start and stop are where to start relative to the free_arr array (1,9
1987	* does all 4 immediate directions). This returns the index into the	1946	* does all 4 immediate directions). This returns the index into the
1988	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1947	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1989	* Note - this only checks to see if there is space for the head of the
1990	* object - if it is a multispace object, this should be called for all
1991	* pieces.
1992	* Note2: This function does correctly handle tiled maps, but does not	1948	* Note: This function does correctly handle tiled maps, but does not
1993	* inform the caller. However, insert_ob_in_map will update as	1949	* inform the caller. However, insert_ob_in_map will update as
1994	* necessary, so the caller shouldn't need to do any special work.	1950	* necessary, so the caller shouldn't need to do any special work.
1995	* Note - updated to take an object instead of archetype - this is necessary	1951	* Note - updated to take an object instead of archetype - this is necessary
1996	* because arch_blocked (now ob_blocked) needs to know the movement type	1952	* because arch_blocked (now ob_blocked) needs to know the movement type
1997	* to know if the space in question will block the object. We can't use	1953	* to know if the space in question will block the object. We can't use
…		…
1999	* customized, changed states, etc.	1955	* customized, changed states, etc.
2000	*/	1956	*/
2001	int	1957	int
2002	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1958	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2003	{	1959	{
		1960	int altern[SIZEOFFREE];
2004	int index = 0, flag;	1961	int index = 0, flag;
2005	int altern[SIZEOFFREE];
2006		1962
2007	for (int i = start; i < stop; i++)	1963	for (int i = start; i < stop; i++)
2008	{	1964	{
2009	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1965	mapxy pos (m, x, y); pos.move (i);
2010	if (!flag)	1966
		1967	if (!pos.normalise ())
		1968	continue;
		1969
		1970	mapspace &ms = *pos;
		1971
		1972	if (ms.flags () & P_IS_ALIVE)
		1973	continue;
		1974
		1975	/* However, often
		1976	* ob doesn't have any move type (when used to place exits)
		1977	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1978	*/
		1979	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1980	{
2011	altern [index++] = i;	1981	altern [index++] = i;
		1982	continue;
		1983	}
2012		1984
2013	/* Basically, if we find a wall on a space, we cut down the search size.	1985	/* Basically, if we find a wall on a space, we cut down the search size.
2014	* In this way, we won't return spaces that are on another side of a wall.	1986	* In this way, we won't return spaces that are on another side of a wall.
2015	* This mostly work, but it cuts down the search size in all directions -	1987	* This mostly work, but it cuts down the search size in all directions -
2016	* if the space being examined only has a wall to the north and empty	1988	* if the space being examined only has a wall to the north and empty
2017	* spaces in all the other directions, this will reduce the search space	1989	* spaces in all the other directions, this will reduce the search space
2018	* to only the spaces immediately surrounding the target area, and	1990	* to only the spaces immediately surrounding the target area, and
2019	* won't look 2 spaces south of the target space.	1991	* won't look 2 spaces south of the target space.
2020	*/	1992	*/
2021	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1993	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1994	{
2022	stop = maxfree[i];	1995	stop = maxfree[i];
		1996	continue;
		1997	}
		1998
		1999	/* Note it is intentional that we check ob - the movement type of the
		2000	* head of the object should correspond for the entire object.
		2001	*/
		2002	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2003	continue;
		2004
		2005	if (ob->blocked (m, pos.x, pos.y))
		2006	continue;
		2007
		2008	altern [index++] = i;
2023	}	2009	}
2024		2010
2025	if (!index)	2011	if (!index)
2026	return -1;	2012	return -1;
2027		2013
…		…
2036	*/	2022	*/
2037	int	2023	int
2038	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2024	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2039	{	2025	{
2040	for (int i = 0; i < SIZEOFFREE; i++)	2026	for (int i = 0; i < SIZEOFFREE; i++)
2041	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2027	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2042	return i;	2028	return i;
2043		2029
2044	return -1;	2030	return -1;
2045	}	2031	}
2046		2032
…		…
2100	object *tmp;	2086	object *tmp;
2101	maptile *mp;	2087	maptile *mp;
2102		2088
2103	MoveType blocked, move_type;	2089	MoveType blocked, move_type;
2104		2090
2105	if (exclude && exclude->head)	2091	if (exclude && exclude->head_ () != exclude)
2106	{	2092	{
2107	exclude = exclude->head;	2093	exclude = exclude->head;
2108	move_type = exclude->move_type;	2094	move_type = exclude->move_type;
2109	}	2095	}
2110	else	2096	else
…		…
2133	max = maxfree[i];	2119	max = maxfree[i];
2134	else if (mflags & P_IS_ALIVE)	2120	else if (mflags & P_IS_ALIVE)
2135	{	2121	{
2136	for (tmp = ms.bot; tmp; tmp = tmp->above)	2122	for (tmp = ms.bot; tmp; tmp = tmp->above)
2137	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2123	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2138	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2124	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2139	break;	2125	break;
2140		2126
2141	if (tmp)	2127	if (tmp)
2142	return freedir[i];	2128	return freedir[i];
2143	}	2129	}
…		…
2323	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2309	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2324	* core dumps if they do.	2310	* core dumps if they do.
2325	*	2311	*
2326	* Add a check so we can't pick up invisible objects (0.93.8)	2312	* Add a check so we can't pick up invisible objects (0.93.8)
2327	*/	2313	*/
2328
2329	int	2314	int
2330	can_pick (const object *who, const object *item)	2315	can_pick (const object *who, const object *item)
2331	{	2316	{
2332	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2317	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2333	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2318	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2338	* create clone from object to another	2323	* create clone from object to another
2339	*/	2324	*/
2340	object *	2325	object *
2341	object_create_clone (object *asrc)	2326	object_create_clone (object *asrc)
2342	{	2327	{
2343	object *dst = 0, *tmp, *src, *part, *prev, *item;	2328	object *dst = 0;
2344		2329
2345	if (!asrc)	2330	if (!asrc)
2346	return 0;	2331	return 0;
2347		2332
2348	src = asrc;	2333	object *src = asrc->head_ ();
2349	if (src->head)
2350	src = src->head;
2351		2334
2352	prev = 0;	2335	object *prev = 0;
2353	for (part = src; part; part = part->more)	2336	for (object *part = src; part; part = part->more)
2354	{	2337	{
2355	tmp = part->clone ();	2338	object *tmp = part->clone ();
		2339
2356	tmp->x -= src->x;	2340	tmp->x -= src->x;
2357	tmp->y -= src->y;	2341	tmp->y -= src->y;
2358		2342
2359	if (!part->head)	2343	if (!part->head)
2360	{	2344	{
…		…
2370	prev->more = tmp;	2354	prev->more = tmp;
2371		2355
2372	prev = tmp;	2356	prev = tmp;
2373	}	2357	}
2374		2358
2375	for (item = src->inv; item; item = item->below)	2359	for (object *item = src->inv; item; item = item->below)
2376	insert_ob_in_ob (object_create_clone (item), dst);	2360	insert_ob_in_ob (object_create_clone (item), dst);
2377		2361
2378	return dst;	2362	return dst;
2379	}	2363	}
2380		2364
…		…
2471	/* Basically, if the archetype has this key set,	2455	/* Basically, if the archetype has this key set,
2472	* we need to store the null value so when we save	2456	* we need to store the null value so when we save
2473	* it, we save the empty value so that when we load,	2457	* it, we save the empty value so that when we load,
2474	* we get this value back again.	2458	* we get this value back again.
2475	*/	2459	*/
2476	if (get_ob_key_link (&op->arch->clone, canonical_key))	2460	if (get_ob_key_link (op->arch, canonical_key))
2477	field->value = 0;	2461	field->value = 0;
2478	else	2462	else
2479	{	2463	{
2480	if (last)	2464	if (last)
2481	last->next = field->next;	2465	last->next = field->next;
…		…
2550	}	2534	}
2551	else	2535	else
2552	item = item->env;	2536	item = item->env;
2553	}	2537	}
2554		2538
2555
2556	const char *	2539	const char *
2557	object::flag_desc (char *desc, int len) const	2540	object::flag_desc (char *desc, int len) const
2558	{	2541	{
2559	char *p = desc;	2542	char *p = desc;
2560	bool first = true;	2543	bool first = true;
…		…
2587	{	2570	{
2588	char flagdesc[512];	2571	char flagdesc[512];
2589	char info2[256 * 4];	2572	char info2[256 * 4];
2590	char *p = info;	2573	char *p = info;
2591		2574
2592	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2575	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2593	count, uuid.seq,	2576	count,
		2577	uuid.c_str (),
2594	&name,	2578	&name,
2595	title ? "\",title:\"" : "",	2579	title ? "\",title:\"" : "",
2596	title ? (const char *)title : "",	2580	title ? (const char *)title : "",
2597	flag_desc (flagdesc, 512), type);	2581	flag_desc (flagdesc, 512), type);
2598		2582
2599	if (env)	2583	if (!flag[FLAG_REMOVED] && env)
2600	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2584	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2601		2585
2602	if (map)	2586	if (map)
2603	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2587	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2604		2588
…		…
2622	}	2606	}
2623		2607
2624	const materialtype_t *	2608	const materialtype_t *
2625	object::dominant_material () const	2609	object::dominant_material () const
2626	{	2610	{
2627	if (materialtype_t *mat = name_to_material (materialname))	2611	if (materialtype_t *mt = name_to_material (materialname))
2628	return mat;	2612	return mt;
2629		2613
2630	// omfg this is slow, this has to be temporary :)
2631	shstr unknown ("unknown");
2632
2633	return name_to_material (unknown);	2614	return name_to_material (shstr_unknown);
2634	}	2615	}
2635		2616
2636	void	2617	void
2637	object::open_container (object *new_container)	2618	object::open_container (object *new_container)
2638	{	2619	{
2639	if (container == new_container)	2620	if (container == new_container)
2640	return;	2621	return;
2641		2622
2642	if (object *old_container = container)	2623	object *old_container = container;
		2624
		2625	if (old_container)
2643	{	2626	{
2644	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2627	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2645	return;	2628	return;
2646		2629
2647	#if 0	2630	#if 0
…		…
2649	if (object *closer = old_container->inv)	2632	if (object *closer = old_container->inv)
2650	if (closer->type == CLOSE_CON)	2633	if (closer->type == CLOSE_CON)
2651	closer->destroy ();	2634	closer->destroy ();
2652	#endif	2635	#endif
2653		2636
		2637	// make sure the container is available
		2638	esrv_send_item (this, old_container);
		2639
2654	old_container->flag [FLAG_APPLIED] = 0;	2640	old_container->flag [FLAG_APPLIED] = false;
2655	container = 0;	2641	container = 0;
2656		2642
		2643	// client needs item update to make it work, client bug requires this to be separate
2657	esrv_update_item (UPD_FLAGS, this, old_container);	2644	esrv_update_item (UPD_FLAGS, this, old_container);
		2645
2658	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2646	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2647	play_sound (sound_find ("chest_close"));
2659	}	2648	}
2660		2649
2661	if (new_container)	2650	if (new_container)
2662	{	2651	{
2663	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))	2652	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
…		…
2674	}	2663	}
2675	#endif	2664	#endif
2676		2665
2677	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2666	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2678		2667
		2668	// make sure the container is available, client bug requires this to be separate
		2669	esrv_send_item (this, new_container);
		2670
2679	new_container->flag [FLAG_APPLIED] = 1;	2671	new_container->flag [FLAG_APPLIED] = true;
2680	container = new_container;	2672	container = new_container;
2681		2673
		2674	// client needs flag change
2682	esrv_update_item (UPD_FLAGS, this, new_container);	2675	esrv_update_item (UPD_FLAGS, this, new_container);
2683	esrv_send_inventory (this, new_container);	2676	esrv_send_inventory (this, new_container);
		2677	play_sound (sound_find ("chest_open"));
		2678	}
		2679	// else if (!old_container->env && contr && contr->ns)
		2680	// contr->ns->floorbox_reset ();
		2681	}
		2682
		2683	object *
		2684	object::force_find (const shstr name)
		2685	{
		2686	/* cycle through his inventory to look for the MARK we want to
		2687	* place
		2688	*/
		2689	for (object *tmp = inv; tmp; tmp = tmp->below)
		2690	if (tmp->type == FORCE && tmp->slaying == name)
		2691	return splay (tmp);
		2692
		2693	return 0;
		2694	}
		2695
		2696	void
		2697	object::force_add (const shstr name, int duration)
		2698	{
		2699	if (object *force = force_find (name))
		2700	force->destroy ();
		2701
		2702	object *force = get_archetype (FORCE_NAME);
		2703
		2704	force->slaying = name;
		2705	force->stats.food = 1;
		2706	force->speed_left = -1.f;
		2707
		2708	force->set_speed (duration ? 1.f / duration : 0.f);
		2709	force->flag [FLAG_IS_USED_UP] = true;
		2710	force->flag [FLAG_APPLIED] = true;
		2711
		2712	insert (force);
		2713	}
		2714
		2715	void
		2716	object::play_sound (faceidx sound)
		2717	{
		2718	if (!sound)
		2719	return;
		2720
		2721	if (flag [FLAG_REMOVED])
		2722	return;
		2723
		2724	if (env)
2684	}	2725	{
		2726	if (object *pl = in_player ())
		2727	pl->contr->play_sound (sound);
		2728	}
		2729	else
		2730	map->play_sound (sound, x, y);
2685	}	2731	}
2686		2732
2687

Diff Legend

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