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.119 by root, Fri Jan 19 18:06:51 2007 UTC vs.
Revision 1.220 by root, Thu Apr 24 00:30:52 2008 UTC

1	/*	1	/*
2	* CrossFire, A Multiplayer game for X-windows	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>	29	#include <sproto.h>
34	#include <loader.h>	30	#include <loader.h>
35		31
36	#include <bitset>	32	#include <bitset>
37		33
38	int nrofallocobjects = 0;	34	UUID UUID::cur;
39	static UUID uuid;	35	static uint64_t seq_next_save;
40	const uint64 UUID_SKIP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
41		37
42	objectvec objects;	38	objectvec objects;
43	activevec actives;	39	activevec actives;
44		40
45	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	41	short freearr_x[SIZEOFFREE] = {
		42	0,
		43	0, 1, 1, 1, 0, -1, -1, -1,
		44	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
46	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	45	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
47	};	46	};
48	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	47	short freearr_y[SIZEOFFREE] = {
		48	0,
		49	-1, -1, 0, 1, 1, 1, 0, -1,
		50	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
49	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	51	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
50	};	52	};
51	int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45,	53	int maxfree[SIZEOFFREE] = {
		54	0,
		55	9, 10, 13, 14, 17, 18, 21, 22,
		56	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
52	48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49	57	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
53	};	58	};
54	int freedir[SIZEOFFREE] = {	59	int freedir[SIZEOFFREE] = {
55	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	60	0,
		61	1, 2, 3, 4, 5, 6, 7, 8,
		62	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
56	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	63	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
57	};	64	};
58		65
59	static void	66	static void
60	write_uuid (void)	67	write_uuid (uval64 skip, bool sync)
61	{	68	{
62	char filename1[MAX_BUF], filename2[MAX_BUF];	69	CALL_BEGIN (2);
63		70	CALL_ARG_SV (newSVval64 (skip));
64	sprintf (filename1, "%s/uuid", settings.localdir);	71	CALL_ARG_SV (boolSV (sync));
65	sprintf (filename2, "%s/uuid~", settings.localdir);	72	CALL_CALL ("cf::write_uuid", G_DISCARD);
66		73	CALL_END;
67	FILE *fp;
68
69	if (!(fp = fopen (filename2, "w")))
70	{
71	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
72	return;
73	}
74
75	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
76	fclose (fp);
77	rename (filename2, filename1);
78	}	74	}
79		75
80	static void	76	static void
81	read_uuid (void)	77	read_uuid (void)
82	{	78	{
83	char filename[MAX_BUF];	79	char filename[MAX_BUF];
84		80
85	sprintf (filename, "%s/uuid", settings.localdir);	81	sprintf (filename, "%s/uuid", settings.localdir);
		82
		83	seq_next_save = 0;
86		84
87	FILE *fp;	85	FILE *fp;
88		86
89	if (!(fp = fopen (filename, "r")))	87	if (!(fp = fopen (filename, "r")))
90	{	88	{
91	if (errno == ENOENT)	89	if (errno == ENOENT)
92	{	90	{
93	LOG (llevInfo, "RESET uid to 1\n");	91	LOG (llevInfo, "RESET uid to 1\n");
94	uuid.seq = 0;	92	UUID::cur.seq = 0;
95	write_uuid ();	93	write_uuid (UUID_GAP, true);
96	return;	94	return;
97	}	95	}
98		96
99	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100	_exit (1);	98	_exit (1);
101	}	99	}
102		100
103	int version;	101	UUID::BUF buf;
104	unsigned long long uid;	102	buf[0] = 0;
105	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	103	fgets (buf, sizeof (buf), fp);
		104
		105	if (!UUID::cur.parse (buf))
106	{	106	{
107	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	107	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
108	_exit (1);	108	_exit (1);
109	}	109	}
110		110
111	uuid.seq = uid;	111	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
112	write_uuid ();	112
113	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	113	write_uuid (UUID_GAP, true);
114	fclose (fp);	114	fclose (fp);
115	}	115	}
116		116
117	UUID	117	UUID
118	gen_uuid ()	118	UUID::gen ()
119	{	119	{
120	UUID uid;	120	UUID uid;
121		121
122	uid.seq = ++uuid.seq;	122	uid.seq = ++cur.seq;
123		123
124	if (!(uuid.seq & (UUID_SKIP - 1)))	124	if (expect_false (cur.seq >= seq_next_save))
125	write_uuid ();	125	{
		126	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		127	write_uuid (UUID_GAP, false);
		128	}
		129
126		130
127	return uid;	131	return uid;
128	}	132	}
129		133
130	void	134	void
131	init_uuid ()	135	UUID::init ()
132	{	136	{
133	read_uuid ();	137	read_uuid ();
134	}	138	}
135		139
136	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	140	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
137	static int	141	static bool
138	compare_ob_value_lists_one (const object *wants, const object *has)	142	compare_ob_value_lists_one (const object *wants, const object *has)
139	{	143	{
140	key_value *wants_field;	144	key_value *wants_field;
141		145
142	/* 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
…		…
150	key_value *has_field;	154	key_value *has_field;
151		155
152	/* Look for a field in has with the same key. */	156	/* Look for a field in has with the same key. */
153	has_field = get_ob_key_link (has, wants_field->key);	157	has_field = get_ob_key_link (has, wants_field->key);
154		158
155	if (has_field == NULL)	159	if (!has_field)
156	{
157	/* No field with that name. */	160	return 0; /* No field with that name. */
158	return FALSE;
159	}
160		161
161	/* Found the matching field. */	162	/* Found the matching field. */
162	if (has_field->value != wants_field->value)	163	if (has_field->value != wants_field->value)
163	{
164	/* 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. */
165	return FALSE;
166	}
167		165
168	/* 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. */
169	}	167	}
170		168
171	/* 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. */
172	return TRUE;	170	return 1;
173	}	171	}
174		172
175	/* Returns TRUE if ob1 has the same key_values as ob2. */	173	/* Returns TRUE if ob1 has the same key_values as ob2. */
176	static int	174	static bool
177	compare_ob_value_lists (const object *ob1, const object *ob2)	175	compare_ob_value_lists (const object *ob1, const object *ob2)
178	{	176	{
179	/* 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,
180	* so we need to run the comparison *twice*. :(	178	* so we need to run the comparison *twice*. :(
181	*/	179	*/
…		…
202	|| ob1->speed != ob2->speed	200	|| ob1->speed != ob2->speed
203	|| ob1->value != ob2->value	201	|| ob1->value != ob2->value
204	|| ob1->name != ob2->name)	202	|| ob1->name != ob2->name)
205	return 0;	203	return 0;
206		204
207	//TODO: this ain't working well, use nicer and correct overflow check	205	/* Do not merge objects if nrof would overflow. First part checks
208	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	206	* for unsigned overflow (2c), second part checks whether the result
209	* 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
210	* used to store nrof).	208	* nrof values.
211	*/	209	*/
212	if (ob1->nrof + ob2->nrof >= 1UL << 31)	210	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
213	return 0;	211	return 0;
214		212
215	/* If the objects have been identified, set the BEEN_APPLIED flag.	213	/* If the objects have been identified, set the BEEN_APPLIED flag.
216	* This is to the comparison of the flags below will be OK. We	214	* This is to the comparison of the flags below will be OK. We
217	* just can't ignore the been applied or identified flags, as they	215	* just can't ignore the been applied or identified flags, as they
218	* are not equal - just if it has been identified, the been_applied	216	* are not equal - just if it has been identified, the been_applied
219	* flags lose any meaning.	217	* flags lose any meaning.
220	*/	218	*/
221	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	219	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
222	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	220	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
223		221
224	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	222	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
225	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	223	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
226		224
227	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	225	if (ob1->arch->name != ob2->arch->name
228	|| ob1->arch != ob2->arch
229	|| ob1->name != ob2->name	226	|| ob1->name != ob2->name
230	|| ob1->title != ob2->title	227	|| ob1->title != ob2->title
231	|| ob1->msg != ob2->msg	228	|| ob1->msg != ob2->msg
232	|| ob1->weight != ob2->weight	229	|| ob1->weight != ob2->weight
233	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
234	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
235	|| ob1->attacktype != ob2->attacktype	230	|| ob1->attacktype != ob2->attacktype
236	|| ob1->magic != ob2->magic	231	|| ob1->magic != ob2->magic
237	|| ob1->slaying != ob2->slaying	232	|| ob1->slaying != ob2->slaying
238	|| ob1->skill != ob2->skill	233	|| ob1->skill != ob2->skill
239	|| ob1->value != ob2->value	234	|| ob1->value != ob2->value
…		…
246	|| ob1->move_block != ob2->move_block	241	|| ob1->move_block != ob2->move_block
247	|| ob1->move_allow != ob2->move_allow	242	|| ob1->move_allow != ob2->move_allow
248	|| ob1->move_on != ob2->move_on	243	|| ob1->move_on != ob2->move_on
249	|| ob1->move_off != ob2->move_off	244	|| ob1->move_off != ob2->move_off
250	|| ob1->move_slow != ob2->move_slow	245	|| ob1->move_slow != ob2->move_slow
251	|| 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)))
252	return 0;	249	return 0;
253		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
254	/* This is really a spellbook check - really, we should	258	/* This is really a spellbook check - we should in general
255	* check all objects in the inventory.	259	* not merge objects with real inventories, as splitting them
		260	* is hard.
256	*/	261	*/
257	if (ob1->inv || ob2->inv)	262	if (ob1->inv || ob2->inv)
258	{	263	{
259	/* if one object has inventory but the other doesn't, not equiv */	264	if (!(ob1->inv && ob2->inv))
260	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	265	return 0; /* inventories differ in length */
261	return 0;
262		266
263	/* 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
264	if (!object::can_merge (ob1->inv, ob2->inv))	270	if (!object::can_merge (ob1->inv, ob2->inv))
265	return 0;	271	return 0; /* inventory objects differ */
266		272
267	/* 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
268	* if it is valid.	274	* if it is valid.
269	*/	275	*/
270	}	276	}
…		…
289	if (ob1->level != ob2->level)	295	if (ob1->level != ob2->level)
290	return 0;	296	return 0;
291	break;	297	break;
292	}	298	}
293		299
294	if (ob1->key_values != NULL || ob2->key_values != NULL)	300	if (ob1->key_values || ob2->key_values)
295	{	301	{
296	/* At least one of these has key_values. */	302	/* At least one of these has key_values. */
297	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	303	if ((!ob1->key_values) != (!ob2->key_values))
298	/* 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))
299	return 0;	307	return 0;
300	else if (!compare_ob_value_lists (ob1, ob2))
301	return 0;
302	}	308	}
303		309
304	//TODO: generate an event or call into perl for additional checks
305	if (ob1->self || ob2->self)	310	if (ob1->self || ob2->self)
306	{	311	{
307	ob1->optimise ();	312	ob1->optimise ();
308	ob2->optimise ();	313	ob2->optimise ();
309		314
310	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)
311	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	}
312	}	329	}
313		330
314	/* Everything passes, must be OK. */	331	/* Everything passes, must be OK. */
315	return 1;	332	return 1;
316	}	333	}
317		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
318	/*	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	/*
319	* sum_weight() is a recursive function which calculates the weight	405	* this is a recursive function which calculates the weight
320	* 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
321	* containers are carrying, and sums it up.	407	* containers are carrying, and sums it up.
322	*/	408	*/
323	long	409	void
324	sum_weight (object *op)	410	object::update_weight ()
325	{	411	{
326	long sum;	412	sint32 sum = 0;
327	object *inv;
328		413
329	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	414	for (object *op = inv; op; op = op->below)
330	{	415	{
331	if (inv->inv)	416	if (op->inv)
332	sum_weight (inv);	417	op->update_weight ();
333	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	418
		419	sum += op->total_weight ();
		420	}
		421
		422	sum = weight_adjust (this, sum);
		423
		424	if (sum != carrying)
334	}	425	{
335
336	if (op->type == CONTAINER && op->stats.Str)
337	sum = (sum * (100 - op->stats.Str)) / 100;
338
339	if (op->carrying != sum)
340	op->carrying = sum;	426	carrying = sum;
341		427
342	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	}
343	}	432	}
344		433
345	/**	434	/*
346	* Return the outermost environment object for a given object.	435	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
347	*/	436	*/
348
349	object *
350	object_get_env_recursive (object *op)
351	{
352	while (op->env != NULL)
353	op = op->env;
354	return op;
355	}
356
357	/*
358	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
359	* Some error messages.
360	* The result of the dump is stored in the static global errmsg array.
361	*/
362
363	char *	437	char *
364	dump_object (object *op)	438	dump_object (object *op)
365	{	439	{
366	if (!op)	440	if (!op)
367	return strdup ("[NULLOBJ]");	441	return strdup ("[NULLOBJ]");
368		442
369	object_freezer freezer;	443	object_freezer freezer;
370	save_object (freezer, op, 1);	444	op->write (freezer);
371	return freezer.as_string ();	445	return freezer.as_string ();
372	}	446	}
373		447
374	/*	448	/*
375	* 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
376	* multi-object 1 which is closest to the second object.	450	* multi-object 1 which is closest to the second object.
377	* If it's not a multi-object, it is returned.	451	* If it's not a multi-object, it is returned.
378	*/	452	*/
379
380	object *	453	object *
381	get_nearest_part (object *op, const object *pl)	454	get_nearest_part (object *op, const object *pl)
382	{	455	{
383	object *tmp, *closest;	456	object *tmp, *closest;
384	int last_dist, i;	457	int last_dist, i;
385		458
386	if (op->more == NULL)	459	if (!op->more)
387	return op;	460	return op;
		461
388	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)
389	if ((i = distance (tmp, pl)) < last_dist)	465	if ((i = distance (tmp, pl)) < last_dist)
390	closest = tmp, last_dist = i;	466	closest = tmp, last_dist = i;
		467
391	return closest;	468	return closest;
392	}	469	}
393		470
394	/*	471	/*
395	* 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.
396	*/	474	*/
397	object *	475	object *
398	find_object (tag_t i)	476	find_object (tag_t i)
399	{	477	{
400	for_all_objects (op)	478	for_all_objects (op)
…		…
420	break;	498	break;
421		499
422	return op;	500	return op;
423	}	501	}
424		502
425	void
426	free_all_object_data ()
427	{
428	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
429	}
430
431	/*	503	/*
432	* 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
433	* skill and experience objects.	505	* skill and experience objects.
		506	* ACTUALLY NO! investigate! TODO
434	*/	507	*/
435	void	508	void
436	object::set_owner (object *owner)	509	object::set_owner (object *owner)
437	{	510	{
		511	// allow objects which own objects
438	if (!owner)	512	if (owner)
439	return;
440
441	/* next line added to allow objects which own objects */
442	/* Add a check for ownercounts in here, as I got into an endless loop
443	* with the fireball owning a poison cloud which then owned the
444	* fireball. I believe that was caused by one of the objects getting
445	* freed and then another object replacing it. Since the ownercounts
446	* didn't match, this check is valid and I believe that cause is valid.
447	*/
448	while (owner->owner)	513	while (owner->owner)
449	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	}
450		521
451	this->owner = owner;	522	this->owner = owner;
		523	}
		524
		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
		543	object::change_weapon (object *ob)
		544	{
		545	if (current_weapon == ob)
		546	return true;
		547
		548	if (chosen_skill)
		549	chosen_skill->flag [FLAG_APPLIED] = false;
		550
		551	current_weapon = ob;
		552	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		553
		554	if (chosen_skill)
		555	chosen_skill->flag [FLAG_APPLIED] = true;
		556
		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;
452	}	589	}
453		590
454	/* Zero the key_values on op, decrementing the shared-string	591	/* Zero the key_values on op, decrementing the shared-string
455	* refcounts and freeing the links.	592	* refcounts and freeing the links.
456	*/	593	*/
457	static void	594	static void
458	free_key_values (object *op)	595	free_key_values (object *op)
459	{	596	{
460	for (key_value *i = op->key_values; i != 0;)	597	for (key_value *i = op->key_values; i; )
461	{	598	{
462	key_value *next = i->next;	599	key_value *next = i->next;
463	delete i;	600	delete i;
464		601
465	i = next;	602	i = next;
466	}	603	}
467		604
468	op->key_values = 0;	605	op->key_values = 0;
469	}	606	}
470		607
471	/*	608	object &
472	* copy_to first frees everything allocated by the dst object,	609	object::operator =(const object &src)
473	* and then copies the contents of itself into the second
474	* object, allocating what needs to be allocated. Basically, any
475	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
476	* if the first object is freed, the pointers in the new object
477	* will point at garbage.
478	*/
479	void
480	object::copy_to (object *dst)
481	{	610	{
482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	611	bool is_freed = flag [FLAG_FREED];
483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	612	bool is_removed = flag [FLAG_REMOVED];
484		613
485	*(object_copy *)dst = *this;	614	*(object_copy *)this = src;
486		615
487	if (is_freed)	616	flag [FLAG_FREED] = is_freed;
488	SET_FLAG (dst, FLAG_FREED);	617	flag [FLAG_REMOVED] = is_removed;
489
490	if (is_removed)
491	SET_FLAG (dst, FLAG_REMOVED);
492
493	if (speed < 0)
494	dst->speed_left = speed_left - rndm ();
495		618
496	/* Copy over key_values, if any. */	619	/* Copy over key_values, if any. */
497	if (key_values)	620	if (src.key_values)
498	{	621	{
499	key_value *tail = 0;	622	key_value *tail = 0;
500	key_value *i;
501
502	dst->key_values = 0;	623	key_values = 0;
503		624
504	for (i = key_values; i; i = i->next)	625	for (key_value *i = src.key_values; i; i = i->next)
505	{	626	{
506	key_value *new_link = new key_value;	627	key_value *new_link = new key_value;
507		628
508	new_link->next = 0;	629	new_link->next = 0;
509	new_link->key = i->key;	630	new_link->key = i->key;
510	new_link->value = i->value;	631	new_link->value = i->value;
511		632
512	/* Try and be clever here, too. */	633	/* Try and be clever here, too. */
513	if (!dst->key_values)	634	if (!key_values)
514	{	635	{
515	dst->key_values = new_link;	636	key_values = new_link;
516	tail = new_link;	637	tail = new_link;
517	}	638	}
518	else	639	else
519	{	640	{
520	tail->next = new_link;	641	tail->next = new_link;
521	tail = new_link;	642	tail = new_link;
522	}	643	}
523	}	644	}
524	}	645	}
		646	}
		647
		648	/*
		649	* copy_to first frees everything allocated by the dst object,
		650	* and then copies the contents of itself into the second
		651	* object, allocating what needs to be allocated. Basically, any
		652	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		653	* if the first object is freed, the pointers in the new object
		654	* will point at garbage.
		655	*/
		656	void
		657	object::copy_to (object *dst)
		658	{
		659	*dst = *this;
		660
		661	if (speed < 0)
		662	dst->speed_left -= rndm ();
525		663
526	dst->set_speed (dst->speed);	664	dst->set_speed (dst->speed);
		665	}
		666
		667	void
		668	object::instantiate ()
		669	{
		670	if (!uuid.seq) // HACK
		671	uuid = UUID::gen ();
		672
		673	speed_left = -0.1f;
		674	/* copy the body_info to the body_used - this is only really
		675	* need for monsters, but doesn't hurt to do it for everything.
		676	* by doing so, when a monster is created, it has good starting
		677	* values for the body_used info, so when items are created
		678	* for it, they can be properly equipped.
		679	*/
		680	for (int i = NUM_BODY_LOCATIONS; i--; )
		681	slot[i].used = slot[i].info;
		682
		683	attachable::instantiate ();
527	}	684	}
528		685
529	object *	686	object *
530	object::clone ()	687	object::clone ()
531	{	688	{
…		…
589	* UP_OBJ_FACE: only the objects face has changed.	746	* UP_OBJ_FACE: only the objects face has changed.
590	*/	747	*/
591	void	748	void
592	update_object (object *op, int action)	749	update_object (object *op, int action)
593	{	750	{
594	MoveType move_on, move_off, move_block, move_slow;
595
596	if (op == NULL)	751	if (op == NULL)
597	{	752	{
598	/* this should never happen */	753	/* this should never happen */
599	LOG (llevDebug, "update_object() called for NULL object.\n");	754	LOG (llevDebug, "update_object() called for NULL object.\n");
600	return;	755	return;
…		…
670	face = blank_face;	825	face = blank_face;
671	}	826	}
672		827
673	object::~object ()	828	object::~object ()
674	{	829	{
675	if (index)
676	unlink ();	830	unlink ();
677		831
678	free_key_values (this);	832	free_key_values (this);
679	}	833	}
680		834
681	static int object_count;	835	static int object_count;
682		836
683	void object::link ()	837	void object::link ()
684	{	838	{
685	assert (!index);//D	839	assert (!index);//D
686	uuid = gen_uuid ();	840	uuid = UUID::gen ();
687	count = ++object_count;	841	count = ++object_count;
688		842
689	refcnt_inc ();	843	refcnt_inc ();
690	objects.insert (this);	844	objects.insert (this);
691	}	845	}
692		846
693	void object::unlink ()	847	void object::unlink ()
694	{	848	{
695	assert (index);//D	849	if (!index)
		850	return;
		851
696	objects.erase (this);	852	objects.erase (this);
697	refcnt_dec ();	853	refcnt_dec ();
698	}	854	}
699		855
700	void	856	void
…		…
762	object::destroy_inv (bool drop_to_ground)	918	object::destroy_inv (bool drop_to_ground)
763	{	919	{
764	// need to check first, because the checks below might segfault	920	// need to check first, because the checks below might segfault
765	// as we might be on an invalid mapspace and crossfire code	921	// as we might be on an invalid mapspace and crossfire code
766	// is too buggy to ensure that the inventory is empty.	922	// is too buggy to ensure that the inventory is empty.
767	// corollary: if you create arrows etc. with stuff in tis inventory,	923	// corollary: if you create arrows etc. with stuff in its inventory,
768	// cf will crash below with off-map x and y	924	// cf will crash below with off-map x and y
769	if (!inv)	925	if (!inv)
770	return;	926	return;
771		927
772	/* Only if the space blocks everything do we not process -	928	/* Only if the space blocks everything do we not process -
773	* if some form of movement is allowed, let objects	929	* if some form of movement is allowed, let objects
774	* drop on that space.	930	* drop on that space.
775	*/	931	*/
776	if (!drop_to_ground	932	if (!drop_to_ground
777	|| !map	933	|| !map
778	|| map->in_memory != MAP_IN_MEMORY	934	|| map->in_memory != MAP_ACTIVE
		935	|| map->nodrop
779	|| ms ().move_block == MOVE_ALL)	936	|| ms ().move_block == MOVE_ALL)
780	{	937	{
781	while (inv)	938	while (inv)
782	{	939	{
783	inv->destroy_inv (drop_to_ground);	940	inv->destroy_inv (false);
784	inv->destroy ();	941	inv->destroy ();
785	}	942	}
786	}	943	}
787	else	944	else
788	{ /* Put objects in inventory onto this space */	945	{ /* Put objects in inventory onto this space */
…		…
794	|| op->flag [FLAG_NO_DROP]	951	|| op->flag [FLAG_NO_DROP]
795	|| op->type == RUNE	952	|| op->type == RUNE
796	|| op->type == TRAP	953	|| op->type == TRAP
797	|| op->flag [FLAG_IS_A_TEMPLATE]	954	|| op->flag [FLAG_IS_A_TEMPLATE]
798	|| op->flag [FLAG_DESTROY_ON_DEATH])	955	|| op->flag [FLAG_DESTROY_ON_DEATH])
799	op->destroy ();	956	op->destroy (true);
800	else	957	else
801	map->insert (op, x, y);	958	map->insert (op, x, y);
802	}	959	}
803	}	960	}
804	}	961	}
…		…
811	}	968	}
812		969
813	void	970	void
814	object::do_destroy ()	971	object::do_destroy ()
815	{	972	{
816	attachable::do_destroy ();
817
818	if (flag [FLAG_IS_LINKED])	973	if (flag [FLAG_IS_LINKED])
819	remove_button_link (this);	974	remove_button_link (this);
820		975
821	if (flag [FLAG_FRIENDLY])	976	if (flag [FLAG_FRIENDLY])
822	remove_friendly_object (this);	977	remove_friendly_object (this);
823		978
824	if (!flag [FLAG_REMOVED])
825	remove ();	979	remove ();
826		980
827	destroy_inv (true);	981	attachable::do_destroy ();
828		982
829	deactivate ();	983	deactivate ();
830	unlink ();	984	unlink ();
831		985
832	flag [FLAG_FREED] = 1;	986	flag [FLAG_FREED] = 1;
…		…
837		991
838	if (!freed_map)	992	if (!freed_map)
839	{	993	{
840	freed_map = new maptile;	994	freed_map = new maptile;
841		995
		996	freed_map->path = "<freed objects map>";
842	freed_map->name = "/internal/freed_objects_map";	997	freed_map->name = "/internal/freed_objects_map";
843	freed_map->width = 3;	998	freed_map->width = 3;
844	freed_map->height = 3;	999	freed_map->height = 3;
		1000	freed_map->nodrop = 1;
845		1001
846	freed_map->alloc ();	1002	freed_map->alloc ();
847	freed_map->in_memory = MAP_IN_MEMORY;	1003	freed_map->in_memory = MAP_ACTIVE;
848	}	1004	}
849		1005
850	map = freed_map;	1006	map = freed_map;
851	x = 1;	1007	x = 1;
852	y = 1;	1008	y = 1;
853	}	1009	}
854		1010
855	head = 0;
856
857	if (more)	1011	if (more)
858	{	1012	{
859	more->destroy ();	1013	more->destroy ();
860	more = 0;	1014	more = 0;
861	}	1015	}
862		1016
		1017	head = 0;
		1018
863	// clear those pointers that likely might have circular references to us	1019	// clear those pointers that likely might cause circular references
864	owner = 0;	1020	owner = 0;
865	enemy = 0;	1021	enemy = 0;
866	attacked_by = 0;	1022	attacked_by = 0;
		1023	current_weapon = 0;
867	}	1024	}
868		1025
869	void	1026	void
870	object::destroy (bool destroy_inventory)	1027	object::destroy (bool destroy_inventory)
871	{	1028	{
872	if (destroyed ())	1029	if (destroyed ())
873	return;	1030	return;
874		1031
		1032	if (!is_head () && !head->destroyed ())
		1033	{
		1034	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1035	head->destroy (destroy_inventory);
		1036	}
		1037
875	if (destroy_inventory)	1038	destroy_inv (!destroy_inventory);
876	destroy_inv (false);	1039
		1040	if (is_head ())
		1041	if (sound_destroy)
		1042	play_sound (sound_destroy);
		1043	else if (flag [FLAG_MONSTER])
		1044	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
877		1045
878	attachable::destroy ();	1046	attachable::destroy ();
879	}
880
881	/*
882	* sub_weight() recursively (outwards) subtracts a number from the
883	* weight of an object (and what is carried by it's environment(s)).
884	*/
885	void
886	sub_weight (object *op, signed long weight)
887	{
888	while (op != NULL)
889	{
890	if (op->type == CONTAINER)
891	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
892
893	op->carrying -= weight;
894	op = op->env;
895	}
896	}	1047	}
897		1048
898	/* op->remove ():	1049	/* op->remove ():
899	* This function removes the object op from the linked list of objects	1050	* This function removes the object op from the linked list of objects
900	* which it is currently tied to. When this function is done, the	1051	* which it is currently tied to. When this function is done, the
901	* object will have no environment. If the object previously had an	1052	* object will have no environment. If the object previously had an
902	* environment, the x and y coordinates will be updated to	1053	* environment, the x and y coordinates will be updated to
903	* the previous environment.	1054	* the previous environment.
904	* Beware: This function is called from the editor as well!
905	*/	1055	*/
906	void	1056	void
907	object::remove_slow ()	1057	object::do_remove ()
908	{	1058	{
909	object *tmp, *last = 0;	1059	object *tmp, *last = 0;
910	object *otmp;	1060	object *otmp;
911		1061
912	if (QUERY_FLAG (this, FLAG_REMOVED))	1062	if (flag [FLAG_REMOVED])
913	return;	1063	return;
914		1064
915	SET_FLAG (this, FLAG_REMOVED);
916	INVOKE_OBJECT (REMOVE, this);	1065	INVOKE_OBJECT (REMOVE, this);
		1066
		1067	flag [FLAG_REMOVED] = true;
917		1068
918	if (more)	1069	if (more)
919	more->remove ();	1070	more->remove ();
920		1071
921	/*	1072	/*
922	* In this case, the object to be removed is in someones	1073	* In this case, the object to be removed is in someones
923	* inventory.	1074	* inventory.
924	*/	1075	*/
925	if (env)	1076	if (env)
926	{	1077	{
		1078	if (object *pl = visible_to ())
		1079	esrv_del_item (pl->contr, count);
		1080
		1081	adjust_weight (env, -total_weight ());
		1082
		1083	*(above ? &above->below : &env->inv) = below;
		1084
927	if (nrof)	1085	if (below)
928	sub_weight (env, weight * nrof);	1086	below->above = above;
929	else	1087
930	sub_weight (env, weight + carrying);	1088	/* we set up values so that it could be inserted into
		1089	* the map, but we don't actually do that - it is up
		1090	* to the caller to decide what we want to do.
		1091	*/
		1092	map = env->map;
		1093	x = env->x;
		1094	y = env->y;
		1095	above = 0;
		1096	below = 0;
		1097	env = 0;
931		1098
932	/* NO_FIX_PLAYER is set when a great many changes are being	1099	/* NO_FIX_PLAYER is set when a great many changes are being
933	* made to players inventory. If set, avoiding the call	1100	* made to players inventory. If set, avoiding the call
934	* to save cpu time.	1101	* to save cpu time.
935	*/	1102	*/
936	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1103	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
937	otmp->update_stats ();	1104	otmp->update_stats ();
938
939	if (above)
940	above->below = below;
941	else
942	env->inv = below;
943
944	if (below)
945	below->above = above;
946
947	/* we set up values so that it could be inserted into
948	* the map, but we don't actually do that - it is up
949	* to the caller to decide what we want to do.
950	*/
951	x = env->x, y = env->y;
952	map = env->map;
953	above = 0, below = 0;
954	env = 0;
955	}	1105	}
956	else if (map)	1106	else if (map)
957	{	1107	{
958	if (type == PLAYER)
959	{
960	--map->players;
961	map->touch ();
962	}
963
964	map->dirty = true;	1108	map->dirty = true;
965	mapspace &ms = this->ms ();	1109	mapspace &ms = this->ms ();
		1110
		1111	if (object *pl = ms.player ())
		1112	{
		1113	if (type == PLAYER) // this == pl(!)
		1114	{
		1115	// leaving a spot always closes any open container on the ground
		1116	if (container && !container->env)
		1117	// this causes spurious floorbox updates, but it ensures
		1118	// that the CLOSE event is being sent.
		1119	close_container ();
		1120
		1121	--map->players;
		1122	map->touch ();
		1123	}
		1124	else if (pl->container == this)
		1125	{
		1126	// removing a container should close it
		1127	close_container ();
		1128	}
		1129
		1130	esrv_del_item (pl->contr, count);
		1131	}
966		1132
967	/* link the object above us */	1133	/* link the object above us */
968	if (above)	1134	if (above)
969	above->below = below;	1135	above->below = below;
970	else	1136	else
…		…
991	if (map->in_memory == MAP_SAVING)	1157	if (map->in_memory == MAP_SAVING)
992	return;	1158	return;
993		1159
994	int check_walk_off = !flag [FLAG_NO_APPLY];	1160	int check_walk_off = !flag [FLAG_NO_APPLY];
995		1161
		1162	if (object *pl = ms.player ())
		1163	{
		1164	if (pl->container == this)
		1165	/* If a container that the player is currently using somehow gets
		1166	* removed (most likely destroyed), update the player view
		1167	* appropriately.
		1168	*/
		1169	pl->close_container ();
		1170
		1171	//TODO: the floorbox prev/next might need updating
		1172	esrv_del_item (pl->contr, count);
		1173	}
		1174
996	for (tmp = ms.bot; tmp; tmp = tmp->above)	1175	for (tmp = ms.bot; tmp; tmp = tmp->above)
997	{	1176	{
998	/* No point updating the players look faces if he is the object	1177	/* No point updating the players look faces if he is the object
999	* being removed.	1178	* being removed.
1000	*/	1179	*/
1001
1002	if (tmp->type == PLAYER && tmp != this)
1003	{
1004	/* If a container that the player is currently using somehow gets
1005	* removed (most likely destroyed), update the player view
1006	* appropriately.
1007	*/
1008	if (tmp->container == this)
1009	{
1010	flag [FLAG_APPLIED] = 0;
1011	tmp->container = 0;
1012	}
1013
1014	if (tmp->contr->ns)
1015	tmp->contr->ns->floorbox_update ();
1016	}
1017		1180
1018	/* See if object moving off should effect something */	1181	/* See if object moving off should effect something */
1019	if (check_walk_off	1182	if (check_walk_off
1020	&& ((move_type & tmp->move_off)	1183	&& ((move_type & tmp->move_off)
1021	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1184	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1024		1187
1025	if (destroyed ())	1188	if (destroyed ())
1026	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1189	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1027	}	1190	}
1028		1191
1029	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1030	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1031	if (tmp->above == tmp)
1032	tmp->above = 0;
1033
1034	last = tmp;	1192	last = tmp;
1035	}	1193	}
1036		1194
1037	/* last == NULL if there are no objects on this space */	1195	/* last == NULL if there are no objects on this space */
1038	//TODO: this makes little sense, why only update the topmost object?	1196	//TODO: this makes little sense, why only update the topmost object?
…		…
1058	merge_ob (object *op, object *top)	1216	merge_ob (object *op, object *top)
1059	{	1217	{
1060	if (!op->nrof)	1218	if (!op->nrof)
1061	return 0;	1219	return 0;
1062		1220
1063	if (top)	1221	if (!top)
1064	for (top = op; top && top->above; top = top->above)	1222	for (top = op; top && top->above; top = top->above)
1065	;	1223	;
1066		1224
1067	for (; top; top = top->below)	1225	for (; top; top = top->below)
1068	{
1069	if (top == op)
1070	continue;
1071
1072	if (object::can_merge (op, top))	1226	if (object::can_merge (op, top))
1073	{	1227	{
1074	top->nrof += op->nrof;	1228	top->nrof += op->nrof;
1075		1229
1076	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1230	if (object *pl = top->visible_to ())
1077	op->weight = 0; /* Don't want any adjustements now */	1231	esrv_update_item (UPD_NROF, pl, top);
		1232
		1233	op->weight = 0; // cancel the addition above
		1234	op->carrying = 0; // must be 0 already
		1235
1078	op->destroy ();	1236	op->destroy (1);
		1237
1079	return top;	1238	return top;
1080	}	1239	}
1081	}
1082		1240
1083	return 0;	1241	return 0;
		1242	}
		1243
		1244	void
		1245	object::expand_tail ()
		1246	{
		1247	if (more)
		1248	return;
		1249
		1250	object *prev = this;
		1251
		1252	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1253	{
		1254	object *op = arch_to_object (at);
		1255
		1256	op->name = name;
		1257	op->name_pl = name_pl;
		1258	op->title = title;
		1259
		1260	op->head = this;
		1261	prev->more = op;
		1262
		1263	prev = op;
		1264	}
1084	}	1265	}
1085		1266
1086	/*	1267	/*
1087	* same as insert_ob_in_map except it handles separate coordinates and does a clean	1268	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1088	* job preparing multi-part monsters.	1269	* job preparing multi-part monsters.
…		…
1090	object *	1271	object *
1091	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1272	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1092	{	1273	{
1093	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1274	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1094	{	1275	{
1095	tmp->x = x + tmp->arch->clone.x;	1276	tmp->x = x + tmp->arch->x;
1096	tmp->y = y + tmp->arch->clone.y;	1277	tmp->y = y + tmp->arch->y;
1097	}	1278	}
1098		1279
1099	return insert_ob_in_map (op, m, originator, flag);	1280	return insert_ob_in_map (op, m, originator, flag);
1100	}	1281	}
1101		1282
…		…
1120	* just 'op' otherwise	1301	* just 'op' otherwise
1121	*/	1302	*/
1122	object *	1303	object *
1123	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1304	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1124	{	1305	{
1125	object *tmp, *top, *floor = NULL;	1306	assert (!op->flag [FLAG_FREED]);
1126
1127	if (QUERY_FLAG (op, FLAG_FREED))
1128	{
1129	LOG (llevError, "Trying to insert freed object!\n");
1130	return NULL;
1131	}
1132
1133	if (!QUERY_FLAG (op, FLAG_REMOVED))
1134	LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1135		1307
1136	op->remove ();	1308	op->remove ();
1137
1138	if (!m)
1139	{
1140	char *dump = dump_object (op);
1141	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1142	free (dump);
1143	return op;
1144	}
1145
1146	if (out_of_map (m, op->x, op->y))
1147	{
1148	char *dump = dump_object (op);
1149	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1150	#ifdef MANY_CORES
1151	/* Better to catch this here, as otherwise the next use of this object
1152	* is likely to cause a crash. Better to find out where it is getting
1153	* improperly inserted.
1154	*/
1155	abort ();
1156	#endif
1157	free (dump);
1158	return op;
1159	}
1160
1161	if (object *more = op->more)
1162	{
1163	if (!insert_ob_in_map (more, m, originator, flag))
1164	{
1165	if (!op->head)
1166	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1167
1168	return 0;
1169	}
1170	}
1171
1172	CLEAR_FLAG (op, FLAG_REMOVED);
1173		1309
1174	/* Ideally, the caller figures this out. However, it complicates a lot	1310	/* Ideally, the caller figures this out. However, it complicates a lot
1175	* of areas of callers (eg, anything that uses find_free_spot would now	1311	* of areas of callers (eg, anything that uses find_free_spot would now
1176	* need extra work	1312	* need extra work
1177	*/	1313	*/
1178	if (!xy_normalise (m, op->x, op->y))	1314	if (!xy_normalise (m, op->x, op->y))
		1315	{
		1316	op->destroy (1);
1179	return 0;	1317	return 0;
		1318	}
		1319
		1320	if (object *more = op->more)
		1321	if (!insert_ob_in_map (more, m, originator, flag))
		1322	return 0;
		1323
		1324	CLEAR_FLAG (op, FLAG_REMOVED);
1180		1325
1181	op->map = m;	1326	op->map = m;
1182	mapspace &ms = op->ms ();	1327	mapspace &ms = op->ms ();
1183		1328
1184	/* this has to be done after we translate the coordinates.	1329	/* this has to be done after we translate the coordinates.
1185	*/	1330	*/
1186	if (op->nrof && !(flag & INS_NO_MERGE))	1331	if (op->nrof && !(flag & INS_NO_MERGE))
1187	for (tmp = ms.bot; tmp; tmp = tmp->above)	1332	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1188	if (object::can_merge (op, tmp))	1333	if (object::can_merge (op, tmp))
1189	{	1334	{
		1335	// TODO: we atcually want to update tmp, not op,
		1336	// but some caller surely breaks when we return tmp
		1337	// from here :/
1190	op->nrof += tmp->nrof;	1338	op->nrof += tmp->nrof;
1191	tmp->destroy ();	1339	tmp->destroy (1);
1192	}	1340	}
1193		1341
1194	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1342	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1195	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1343	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1196		1344
…		…
1216	/* since *below* originator, no need to update top */	1364	/* since *below* originator, no need to update top */
1217	originator->below = op;	1365	originator->below = op;
1218	}	1366	}
1219	else	1367	else
1220	{	1368	{
		1369	object *top, *floor = NULL;
		1370
1221	top = ms.bot;	1371	top = ms.bot;
1222		1372
1223	/* If there are other objects, then */	1373	/* If there are other objects, then */
1224	if ((!(flag & INS_MAP_LOAD)) && top)	1374	if (top)
1225	{	1375	{
1226	object *last = 0;	1376	object *last = 0;
1227		1377
1228	/*	1378	/*
1229	* If there are multiple objects on this space, we do some trickier handling.	1379	* If there are multiple objects on this space, we do some trickier handling.
…		…
1259	* looks like instead of lots of conditions here.	1409	* looks like instead of lots of conditions here.
1260	* makes things faster, and effectively the same result.	1410	* makes things faster, and effectively the same result.
1261	*/	1411	*/
1262		1412
1263	/* Have object 'fall below' other objects that block view.	1413	/* Have object 'fall below' other objects that block view.
1264	* Unless those objects are exits, type 66	1414	* Unless those objects are exits.
1265	* If INS_ON_TOP is used, don't do this processing	1415	* If INS_ON_TOP is used, don't do this processing
1266	* Need to find the object that in fact blocks view, otherwise	1416	* Need to find the object that in fact blocks view, otherwise
1267	* stacking is a bit odd.	1417	* stacking is a bit odd.
1268	*/	1418	*/
1269	if (!(flag & INS_ON_TOP)	1419	if (!(flag & INS_ON_TOP)
1270	&& ms.flags () & P_BLOCKSVIEW	1420	&& ms.flags () & P_BLOCKSVIEW
1271	&& (op->face && !op->face->visibility))	1421	&& (op->face && !faces [op->face].visibility))
1272	{	1422	{
1273	for (last = top; last != floor; last = last->below)	1423	for (last = top; last != floor; last = last->below)
1274	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1424	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1275	break;	1425	break;
1276		1426
…		…
1282	if (last && last->below && last != floor)	1432	if (last && last->below && last != floor)
1283	top = last->below;	1433	top = last->below;
1284	}	1434	}
1285	} /* If objects on this space */	1435	} /* If objects on this space */
1286		1436
1287	if (flag & INS_MAP_LOAD)
1288	top = ms.top;
1289
1290	if (flag & INS_ABOVE_FLOOR_ONLY)	1437	if (flag & INS_ABOVE_FLOOR_ONLY)
1291	top = floor;	1438	top = floor;
1292		1439
1293	/* Top is the object that our object (op) is going to get inserted above.	1440	/* Top is the object that our object (op) is going to get inserted above.
1294	*/	1441	*/
…		…
1326	op->map->touch ();	1473	op->map->touch ();
1327	}	1474	}
1328		1475
1329	op->map->dirty = true;	1476	op->map->dirty = true;
1330		1477
1331	/* If we have a floor, we know the player, if any, will be above
1332	* it, so save a few ticks and start from there.
1333	*/
1334	if (!(flag & INS_MAP_LOAD))
1335	if (object *pl = ms.player ())	1478	if (object *pl = ms.player ())
1336	if (pl->contr->ns)	1479	//TODO: the floorbox prev/next might need updating
1337	pl->contr->ns->floorbox_update ();	1480	esrv_send_item (pl, op);
1338		1481
1339	/* If this object glows, it may affect lighting conditions that are	1482	/* If this object glows, it may affect lighting conditions that are
1340	* visible to others on this map. But update_all_los is really	1483	* visible to others on this map. But update_all_los is really
1341	* an inefficient way to do this, as it means los for all players	1484	* an inefficient way to do this, as it means los for all players
1342	* on the map will get recalculated. The players could very well	1485	* on the map will get recalculated. The players could very well
…		…
1361	* blocked() and wall() work properly), and these flags are updated by	1504	* blocked() and wall() work properly), and these flags are updated by
1362	* update_object().	1505	* update_object().
1363	*/	1506	*/
1364		1507
1365	/* if this is not the head or flag has been passed, don't check walk on status */	1508	/* if this is not the head or flag has been passed, don't check walk on status */
1366	if (!(flag & INS_NO_WALK_ON) && !op->head)	1509	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1367	{	1510	{
1368	if (check_move_on (op, originator))	1511	if (check_move_on (op, originator))
1369	return 0;	1512	return 0;
1370		1513
1371	/* If we are a multi part object, lets work our way through the check	1514	/* If we are a multi part object, lets work our way through the check
1372	* walk on's.	1515	* walk on's.
1373	*/	1516	*/
1374	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1517	for (object *tmp = op->more; tmp; tmp = tmp->more)
1375	if (check_move_on (tmp, originator))	1518	if (check_move_on (tmp, originator))
1376	return 0;	1519	return 0;
1377	}	1520	}
1378		1521
1379	return op;	1522	return op;
…		…
1384	* op is the object to insert it under: supplies x and the map.	1527	* op is the object to insert it under: supplies x and the map.
1385	*/	1528	*/
1386	void	1529	void
1387	replace_insert_ob_in_map (const char *arch_string, object *op)	1530	replace_insert_ob_in_map (const char *arch_string, object *op)
1388	{	1531	{
1389	object *tmp, *tmp1;
1390
1391	/* first search for itself and remove any old instances */	1532	/* first search for itself and remove any old instances */
1392		1533
1393	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1534	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1394	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1535	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1395	tmp->destroy ();	1536	tmp->destroy (1);
1396		1537
1397	tmp1 = arch_to_object (archetype::find (arch_string));	1538	object *tmp = arch_to_object (archetype::find (arch_string));
1398		1539
1399	tmp1->x = op->x;	1540	tmp->x = op->x;
1400	tmp1->y = op->y;	1541	tmp->y = op->y;
		1542
1401	insert_ob_in_map (tmp1, op->map, op, 0);	1543	insert_ob_in_map (tmp, op->map, op, 0);
1402	}	1544	}
1403		1545
1404	object *	1546	object *
1405	object::insert_at (object *where, object *originator, int flags)	1547	object::insert_at (object *where, object *originator, int flags)
1406	{	1548	{
		1549	if (where->env)
		1550	return where->env->insert (this);
		1551	else
1407	where->map->insert (this, where->x, where->y, originator, flags);	1552	return where->map->insert (this, where->x, where->y, originator, flags);
1408	}	1553	}
1409		1554
1410	/*	1555	/*
1411	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1412	* is returned contains nr objects, and the remaining parts contains
1413	* the rest (or is removed and freed if that number is 0).
1414	* On failure, NULL is returned, and the reason put into the
1415	* global static errmsg array.
1416	*/
1417	object *
1418	get_split_ob (object *orig_ob, uint32 nr)
1419	{
1420	object *newob;
1421	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1422
1423	if (orig_ob->nrof < nr)
1424	{
1425	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1426	return NULL;
1427	}
1428
1429	newob = object_create_clone (orig_ob);
1430
1431	if ((orig_ob->nrof -= nr) < 1)
1432	orig_ob->destroy (1);
1433	else if (!is_removed)
1434	{
1435	if (orig_ob->env != NULL)
1436	sub_weight (orig_ob->env, orig_ob->weight * nr);
1437	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1438	{
1439	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1440	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1441	return NULL;
1442	}
1443	}
1444
1445	newob->nrof = nr;
1446
1447	return newob;
1448	}
1449
1450	/*
1451	* decrease_ob_nr(object, number) decreases a specified number from	1556	* decrease(object, number) decreases a specified number from
1452	* the amount of an object. If the amount reaches 0, the object	1557	* the amount of an object. If the amount reaches 0, the object
1453	* is subsequently removed and freed.	1558	* is subsequently removed and freed.
1454	*	1559	*
1455	* Return value: 'op' if something is left, NULL if the amount reached 0	1560	* Return value: 'op' if something is left, NULL if the amount reached 0
1456	*/	1561	*/
		1562	bool
		1563	object::decrease (sint32 nr)
		1564	{
		1565	if (!nr)
		1566	return true;
1457		1567
		1568	nr = min (nr, nrof);
		1569
		1570	nrof -= nr;
		1571
		1572	if (nrof)
		1573	{
		1574	adjust_weight (env, -weight * nr); // carrying == 0
		1575
		1576	if (object *pl = visible_to ())
		1577	esrv_update_item (UPD_NROF, pl, this);
		1578
		1579	return true;
		1580	}
		1581	else
		1582	{
		1583	destroy (1);
		1584	return false;
		1585	}
		1586	}
		1587
		1588	/*
		1589	* split(ob,nr) splits up ob into two parts. The part which
		1590	* is returned contains nr objects, and the remaining parts contains
		1591	* the rest (or is removed and returned if that number is 0).
		1592	* On failure, NULL is returned.
		1593	*/
1458	object *	1594	object *
1459	decrease_ob_nr (object *op, uint32 i)	1595	object::split (sint32 nr)
1460	{	1596	{
1461	object *tmp;	1597	int have = number_of ();
1462		1598
1463	if (i == 0) /* objects with op->nrof require this check */	1599	if (have < nr)
1464	return op;	1600	return 0;
1465		1601	else if (have == nr)
1466	if (i > op->nrof)
1467	i = op->nrof;
1468
1469	if (QUERY_FLAG (op, FLAG_REMOVED))
1470	op->nrof -= i;
1471	else if (op->env)
1472	{	1602	{
1473	/* is this object in the players inventory, or sub container
1474	* therein?
1475	*/
1476	tmp = op->in_player ();
1477	/* nope. Is this a container the player has opened?
1478	* If so, set tmp to that player.
1479	* IMO, searching through all the players will mostly
1480	* likely be quicker than following op->env to the map,
1481	* and then searching the map for a player.
1482	*/
1483	if (!tmp)
1484	for_all_players (pl)
1485	if (pl->ob->container == op->env)
1486	{
1487	tmp = pl->ob;
1488	break;
1489	}
1490
1491	if (i < op->nrof)
1492	{
1493	sub_weight (op->env, op->weight * i);
1494	op->nrof -= i;
1495	if (tmp)
1496	esrv_send_item (tmp, op);
1497	}
1498	else
1499	{
1500	op->remove ();	1603	remove ();
1501	op->nrof = 0;	1604	return this;
1502	if (tmp)
1503	esrv_del_item (tmp->contr, op->count);
1504	}
1505	}	1605	}
1506	else	1606	else
1507	{	1607	{
1508	object *above = op->above;	1608	decrease (nr);
1509		1609
1510	if (i < op->nrof)	1610	object *op = object_create_clone (this);
1511	op->nrof -= i;	1611	op->nrof = nr;
1512	else
1513	{
1514	op->remove ();
1515	op->nrof = 0;
1516	}
1517
1518	/* Since we just removed op, op->above is null */
1519	for (tmp = above; tmp; tmp = tmp->above)
1520	if (tmp->type == PLAYER)
1521	{
1522	if (op->nrof)
1523	esrv_send_item (tmp, op);
1524	else
1525	esrv_del_item (tmp->contr, op->count);
1526	}
1527	}
1528
1529	if (op->nrof)
1530	return op;	1612	return op;
1531	else
1532	{
1533	op->destroy ();
1534	return 0;
1535	}
1536	}
1537
1538	/*
1539	* add_weight(object, weight) adds the specified weight to an object,
1540	* and also updates how much the environment(s) is/are carrying.
1541	*/
1542
1543	void
1544	add_weight (object *op, signed long weight)
1545	{
1546	while (op != NULL)
1547	{
1548	if (op->type == CONTAINER)
1549	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1550
1551	op->carrying += weight;
1552	op = op->env;
1553	}	1613	}
1554	}	1614	}
1555		1615
1556	object *	1616	object *
1557	insert_ob_in_ob (object *op, object *where)	1617	insert_ob_in_ob (object *op, object *where)
…		…
1562	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1622	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1563	free (dump);	1623	free (dump);
1564	return op;	1624	return op;
1565	}	1625	}
1566		1626
1567	if (where->head)	1627	if (where->head_ () != where)
1568	{	1628	{
1569	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1629	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1570	where = where->head;	1630	where = where->head;
1571	}	1631	}
1572		1632
1573	return where->insert (op);	1633	return where->insert (op);
1574	}	1634	}
…		…
1579	* inside the object environment.	1639	* inside the object environment.
1580	*	1640	*
1581	* The function returns now pointer to inserted item, and return value can	1641	* The function returns now pointer to inserted item, and return value can
1582	* be != op, if items are merged. -Tero	1642	* be != op, if items are merged. -Tero
1583	*/	1643	*/
1584
1585	object *	1644	object *
1586	object::insert (object *op)	1645	object::insert (object *op)
1587	{	1646	{
1588	object *tmp, *otmp;
1589
1590	if (!QUERY_FLAG (op, FLAG_REMOVED))
1591	op->remove ();
1592
1593	if (op->more)	1647	if (op->more)
1594	{	1648	{
1595	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1649	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1596	return op;	1650	return op;
1597	}	1651	}
1598		1652
1599	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1653	op->remove ();
1600	CLEAR_FLAG (op, FLAG_REMOVED);	1654
		1655	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1656
1601	if (op->nrof)	1657	if (op->nrof)
1602	{
1603	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1658	for (object *tmp = inv; tmp; tmp = tmp->below)
1604	if (object::can_merge (tmp, op))	1659	if (object::can_merge (tmp, op))
1605	{	1660	{
1606	/* return the original object and remove inserted object	1661	/* return the original object and remove inserted object
1607	(client needs the original object) */	1662	(client needs the original object) */
1608	tmp->nrof += op->nrof;	1663	tmp->nrof += op->nrof;
1609	/* Weight handling gets pretty funky. Since we are adding to	1664
1610	* tmp->nrof, we need to increase the weight.	1665	if (object *pl = tmp->visible_to ())
1611	*/	1666	esrv_update_item (UPD_NROF, pl, tmp);
		1667
1612	add_weight (this, op->weight * op->nrof);	1668	adjust_weight (this, op->total_weight ());
1613	SET_FLAG (op, FLAG_REMOVED);	1669
1614	op->destroy (); /* free the inserted object */	1670	op->destroy (1);
1615	op = tmp;	1671	op = tmp;
1616	op->remove (); /* and fix old object's links */	1672	goto inserted;
1617	CLEAR_FLAG (op, FLAG_REMOVED);
1618	break;
1619	}	1673	}
1620		1674
1621	/* I assume combined objects have no inventory	1675	op->owner = 0; // it's his/hers now. period.
1622	* We add the weight - this object could have just been removed
1623	* (if it was possible to merge). calling remove_ob will subtract
1624	* the weight, so we need to add it in again, since we actually do
1625	* the linking below
1626	*/
1627	add_weight (this, op->weight * op->nrof);
1628	}
1629	else
1630	add_weight (this, (op->weight + op->carrying));
1631
1632	otmp = this->in_player ();
1633	if (otmp && otmp->contr)
1634	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1635	otmp->update_stats ();
1636
1637	op->map = 0;	1676	op->map = 0;
1638	op->env = this;	1677	op->x = 0;
		1678	op->y = 0;
		1679
1639	op->above = 0;	1680	op->above = 0;
1640	op->below = 0;	1681	op->below = inv;
1641	op->x = 0, op->y = 0;	1682	op->env = this;
1642		1683
		1684	if (inv)
		1685	inv->above = op;
		1686
		1687	inv = op;
		1688
		1689	op->flag [FLAG_REMOVED] = 0;
		1690
		1691	if (object *pl = op->visible_to ())
		1692	esrv_send_item (pl, op);
		1693
		1694	adjust_weight (this, op->total_weight ());
		1695
		1696	inserted:
1643	/* reset the light list and los of the players on the map */	1697	/* reset the light list and los of the players on the map */
1644	if ((op->glow_radius != 0) && map)	1698	if (op->glow_radius && map && map->darkness)
1645	{
1646	#ifdef DEBUG_LIGHTS
1647	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1648	#endif /* DEBUG_LIGHTS */
1649	if (map->darkness)
1650	update_all_los (map, x, y);	1699	update_all_los (map, x, y);
1651	}
1652		1700
1653	/* Client has no idea of ordering so lets not bother ordering it here.	1701	// if this is a player's inventory, update stats
1654	* It sure simplifies this function...	1702	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1655	*/	1703	update_stats ();
1656	if (!inv)
1657	inv = op;
1658	else
1659	{
1660	op->below = inv;
1661	op->below->above = op;
1662	inv = op;
1663	}
1664		1704
1665	INVOKE_OBJECT (INSERT, this);	1705	INVOKE_OBJECT (INSERT, this);
1666		1706
1667	return op;	1707	return op;
1668	}	1708	}
…		…
1749	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1789	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1750	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1790	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1751	{	1791	{
1752		1792
1753	float	1793	float
1754	diff = tmp->move_slow_penalty * FABS (op->speed);	1794	diff = tmp->move_slow_penalty * fabs (op->speed);
1755		1795
1756	if (op->type == PLAYER)	1796	if (op->type == PLAYER)
1757	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1797	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1758	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1798	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1759	diff /= 4.0;	1799	diff /= 4.0;
…		…
1883	* activate recursively a flag on an object inventory	1923	* activate recursively a flag on an object inventory
1884	*/	1924	*/
1885	void	1925	void
1886	flag_inv (object *op, int flag)	1926	flag_inv (object *op, int flag)
1887	{	1927	{
1888	if (op->inv)
1889	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1928	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1890	{	1929	{
1891	SET_FLAG (tmp, flag);	1930	SET_FLAG (tmp, flag);
1892	flag_inv (tmp, flag);	1931	flag_inv (tmp, flag);
1893	}	1932	}
1894	}	1933	}
1895		1934
1896	/*	1935	/*
1897	* deactivate recursively a flag on an object inventory	1936	* deactivate recursively a flag on an object inventory
1898	*/	1937	*/
1899	void	1938	void
1900	unflag_inv (object *op, int flag)	1939	unflag_inv (object *op, int flag)
1901	{	1940	{
1902	if (op->inv)
1903	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1941	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1904	{	1942	{
1905	CLEAR_FLAG (tmp, flag);	1943	CLEAR_FLAG (tmp, flag);
1906	unflag_inv (tmp, flag);	1944	unflag_inv (tmp, flag);
1907	}	1945	}
1908	}
1909
1910	/*
1911	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1912	* all it's inventory (recursively).
1913	* If checksums are used, a player will get set_cheat called for
1914	* him/her-self and all object carried by a call to this function.
1915	*/
1916	void
1917	set_cheat (object *op)
1918	{
1919	SET_FLAG (op, FLAG_WAS_WIZ);
1920	flag_inv (op, FLAG_WAS_WIZ);
1921	}	1946	}
1922		1947
1923	/*	1948	/*
1924	* find_free_spot(object, map, x, y, start, stop) will search for	1949	* find_free_spot(object, map, x, y, start, stop) will search for
1925	* a spot at the given map and coordinates which will be able to contain	1950	* a spot at the given map and coordinates which will be able to contain
…		…
1927	* to search (see the freearr_x/y[] definition).	1952	* to search (see the freearr_x/y[] definition).
1928	* It returns a random choice among the alternatives found.	1953	* It returns a random choice among the alternatives found.
1929	* start and stop are where to start relative to the free_arr array (1,9	1954	* start and stop are where to start relative to the free_arr array (1,9
1930	* does all 4 immediate directions). This returns the index into the	1955	* does all 4 immediate directions). This returns the index into the
1931	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1956	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1932	* Note - this only checks to see if there is space for the head of the
1933	* object - if it is a multispace object, this should be called for all
1934	* pieces.
1935	* Note2: This function does correctly handle tiled maps, but does not	1957	* Note: This function does correctly handle tiled maps, but does not
1936	* inform the caller. However, insert_ob_in_map will update as	1958	* inform the caller. However, insert_ob_in_map will update as
1937	* necessary, so the caller shouldn't need to do any special work.	1959	* necessary, so the caller shouldn't need to do any special work.
1938	* Note - updated to take an object instead of archetype - this is necessary	1960	* Note - updated to take an object instead of archetype - this is necessary
1939	* because arch_blocked (now ob_blocked) needs to know the movement type	1961	* because arch_blocked (now ob_blocked) needs to know the movement type
1940	* to know if the space in question will block the object. We can't use	1962	* to know if the space in question will block the object. We can't use
…		…
1942	* customized, changed states, etc.	1964	* customized, changed states, etc.
1943	*/	1965	*/
1944	int	1966	int
1945	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1967	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
1946	{	1968	{
		1969	int altern[SIZEOFFREE];
1947	int index = 0, flag;	1970	int index = 0, flag;
1948	int altern[SIZEOFFREE];
1949		1971
1950	for (int i = start; i < stop; i++)	1972	for (int i = start; i < stop; i++)
1951	{	1973	{
1952	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1974	mapxy pos (m, x, y); pos.move (i);
1953	if (!flag)	1975
		1976	if (!pos.normalise ())
		1977	continue;
		1978
		1979	mapspace &ms = *pos;
		1980
		1981	if (ms.flags () & P_IS_ALIVE)
		1982	continue;
		1983
		1984	/* However, often
		1985	* ob doesn't have any move type (when used to place exits)
		1986	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1987	*/
		1988	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1989	{
1954	altern [index++] = i;	1990	altern [index++] = i;
		1991	continue;
		1992	}
1955		1993
1956	/* Basically, if we find a wall on a space, we cut down the search size.	1994	/* Basically, if we find a wall on a space, we cut down the search size.
1957	* In this way, we won't return spaces that are on another side of a wall.	1995	* In this way, we won't return spaces that are on another side of a wall.
1958	* This mostly work, but it cuts down the search size in all directions -	1996	* This mostly work, but it cuts down the search size in all directions -
1959	* if the space being examined only has a wall to the north and empty	1997	* if the space being examined only has a wall to the north and empty
1960	* spaces in all the other directions, this will reduce the search space	1998	* spaces in all the other directions, this will reduce the search space
1961	* to only the spaces immediately surrounding the target area, and	1999	* to only the spaces immediately surrounding the target area, and
1962	* won't look 2 spaces south of the target space.	2000	* won't look 2 spaces south of the target space.
1963	*/	2001	*/
1964	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2002	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2003	{
1965	stop = maxfree[i];	2004	stop = maxfree[i];
		2005	continue;
		2006	}
		2007
		2008	/* Note it is intentional that we check ob - the movement type of the
		2009	* head of the object should correspond for the entire object.
		2010	*/
		2011	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2012	continue;
		2013
		2014	if (ob->blocked (m, pos.x, pos.y))
		2015	continue;
		2016
		2017	altern [index++] = i;
1966	}	2018	}
1967		2019
1968	if (!index)	2020	if (!index)
1969	return -1;	2021	return -1;
1970		2022
1971	return altern[RANDOM () % index];	2023	return altern [rndm (index)];
1972	}	2024	}
1973		2025
1974	/*	2026	/*
1975	* find_first_free_spot(archetype, maptile, x, y) works like	2027	* find_first_free_spot(archetype, maptile, x, y) works like
1976	* find_free_spot(), but it will search max number of squares.	2028	* find_free_spot(), but it will search max number of squares.
…		…
1979	*/	2031	*/
1980	int	2032	int
1981	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2033	find_first_free_spot (const object *ob, maptile *m, int x, int y)
1982	{	2034	{
1983	for (int i = 0; i < SIZEOFFREE; i++)	2035	for (int i = 0; i < SIZEOFFREE; i++)
1984	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2036	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
1985	return i;	2037	return i;
1986		2038
1987	return -1;	2039	return -1;
1988	}	2040	}
1989		2041
…		…
1997	{	2049	{
1998	arr += begin;	2050	arr += begin;
1999	end -= begin;	2051	end -= begin;
2000		2052
2001	while (--end)	2053	while (--end)
2002	swap (arr [end], arr [RANDOM () % (end + 1)]);	2054	swap (arr [end], arr [rndm (end + 1)]);
2003	}	2055	}
2004		2056
2005	/* new function to make monster searching more efficient, and effective!	2057	/* new function to make monster searching more efficient, and effective!
2006	* This basically returns a randomized array (in the passed pointer) of	2058	* This basically returns a randomized array (in the passed pointer) of
2007	* the spaces to find monsters. In this way, it won't always look for	2059	* the spaces to find monsters. In this way, it won't always look for
…		…
2043	object *tmp;	2095	object *tmp;
2044	maptile *mp;	2096	maptile *mp;
2045		2097
2046	MoveType blocked, move_type;	2098	MoveType blocked, move_type;
2047		2099
2048	if (exclude && exclude->head)	2100	if (exclude && exclude->head_ () != exclude)
2049	{	2101	{
2050	exclude = exclude->head;	2102	exclude = exclude->head;
2051	move_type = exclude->move_type;	2103	move_type = exclude->move_type;
2052	}	2104	}
2053	else	2105	else
…		…
2076	max = maxfree[i];	2128	max = maxfree[i];
2077	else if (mflags & P_IS_ALIVE)	2129	else if (mflags & P_IS_ALIVE)
2078	{	2130	{
2079	for (tmp = ms.bot; tmp; tmp = tmp->above)	2131	for (tmp = ms.bot; tmp; tmp = tmp->above)
2080	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2132	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2081	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2133	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2082	break;	2134	break;
2083		2135
2084	if (tmp)	2136	if (tmp)
2085	return freedir[i];	2137	return freedir[i];
2086	}	2138	}
…		…
2266	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2318	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2267	* core dumps if they do.	2319	* core dumps if they do.
2268	*	2320	*
2269	* Add a check so we can't pick up invisible objects (0.93.8)	2321	* Add a check so we can't pick up invisible objects (0.93.8)
2270	*/	2322	*/
2271
2272	int	2323	int
2273	can_pick (const object *who, const object *item)	2324	can_pick (const object *who, const object *item)
2274	{	2325	{
2275	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2326	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2276	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2327	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2281	* create clone from object to another	2332	* create clone from object to another
2282	*/	2333	*/
2283	object *	2334	object *
2284	object_create_clone (object *asrc)	2335	object_create_clone (object *asrc)
2285	{	2336	{
2286	object *dst = 0, *tmp, *src, *part, *prev, *item;	2337	object *dst = 0, *tmp, *src, *prev, *item;
2287		2338
2288	if (!asrc)	2339	if (!asrc)
2289	return 0;	2340	return 0;
2290		2341
2291	src = asrc;
2292	if (src->head)
2293	src = src->head;	2342	src = asrc->head_ ();
2294		2343
2295	prev = 0;	2344	prev = 0;
2296	for (part = src; part; part = part->more)	2345	for (object *part = src; part; part = part->more)
2297	{	2346	{
2298	tmp = part->clone ();	2347	tmp = part->clone ();
2299	tmp->x -= src->x;	2348	tmp->x -= src->x;
2300	tmp->y -= src->y;	2349	tmp->y -= src->y;
2301		2350
…		…
2319	insert_ob_in_ob (object_create_clone (item), dst);	2368	insert_ob_in_ob (object_create_clone (item), dst);
2320		2369
2321	return dst;	2370	return dst;
2322	}	2371	}
2323		2372
2324	/* GROS - Creates an object using a string representing its content. */
2325	/* Basically, we save the content of the string to a temp file, then call */
2326	/* load_object on it. I admit it is a highly inefficient way to make things, */
2327	/* but it was simple to make and allows reusing the load_object function. */
2328	/* Remember not to use load_object_str in a time-critical situation. */
2329	/* Also remember that multiparts objects are not supported for now. */
2330	object *
2331	load_object_str (const char *obstr)
2332	{
2333	object *op;
2334	char filename[MAX_BUF];
2335
2336	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2337
2338	FILE *tempfile = fopen (filename, "w");
2339
2340	if (tempfile == NULL)
2341	{
2342	LOG (llevError, "Error - Unable to access load object temp file\n");
2343	return NULL;
2344	}
2345
2346	fprintf (tempfile, obstr);
2347	fclose (tempfile);
2348
2349	op = object::create ();
2350
2351	object_thawer thawer (filename);
2352
2353	if (thawer)
2354	load_object (thawer, op, 0);
2355
2356	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2357	CLEAR_FLAG (op, FLAG_REMOVED);
2358
2359	return op;
2360	}
2361
2362	/* This returns the first object in who's inventory that	2373	/* This returns the first object in who's inventory that
2363	* has the same type and subtype match.	2374	* has the same type and subtype match.
2364	* returns NULL if no match.	2375	* returns NULL if no match.
2365	*/	2376	*/
2366	object *	2377	object *
…		…
2419	if (link->key == canonical_key)	2430	if (link->key == canonical_key)
2420	return link->value;	2431	return link->value;
2421		2432
2422	return 0;	2433	return 0;
2423	}	2434	}
2424
2425		2435
2426	/*	2436	/*
2427	* Updates the canonical_key in op to value.	2437	* Updates the canonical_key in op to value.
2428	*	2438	*
2429	* canonical_key is a shared string (value doesn't have to be).	2439	* canonical_key is a shared string (value doesn't have to be).
…		…
2453	/* Basically, if the archetype has this key set,	2463	/* Basically, if the archetype has this key set,
2454	* we need to store the null value so when we save	2464	* we need to store the null value so when we save
2455	* it, we save the empty value so that when we load,	2465	* it, we save the empty value so that when we load,
2456	* we get this value back again.	2466	* we get this value back again.
2457	*/	2467	*/
2458	if (get_ob_key_link (&op->arch->clone, canonical_key))	2468	if (get_ob_key_link (op->arch, canonical_key))
2459	field->value = 0;	2469	field->value = 0;
2460	else	2470	else
2461	{	2471	{
2462	if (last)	2472	if (last)
2463	last->next = field->next;	2473	last->next = field->next;
…		…
2532	}	2542	}
2533	else	2543	else
2534	item = item->env;	2544	item = item->env;
2535	}	2545	}
2536		2546
2537
2538	const char *	2547	const char *
2539	object::flag_desc (char *desc, int len) const	2548	object::flag_desc (char *desc, int len) const
2540	{	2549	{
2541	char *p = desc;	2550	char *p = desc;
2542	bool first = true;	2551	bool first = true;
…		…
2569	{	2578	{
2570	char flagdesc[512];	2579	char flagdesc[512];
2571	char info2[256 * 4];	2580	char info2[256 * 4];
2572	char *p = info;	2581	char *p = info;
2573		2582
2574	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2583	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2575	count, uuid.seq,	2584	count,
		2585	uuid.c_str (),
2576	&name,	2586	&name,
2577	title ? "\",title:\"" : "",	2587	title ? "\",title:\"" : "",
2578	title ? (const char *)title : "",	2588	title ? (const char *)title : "",
2579	flag_desc (flagdesc, 512), type);	2589	flag_desc (flagdesc, 512), type);
2580		2590
2581	if (env)	2591	if (!flag[FLAG_REMOVED] && env)
2582	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2592	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2583		2593
2584	if (map)	2594	if (map)
2585	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2595	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2586		2596
…		…
2588	}	2598	}
2589		2599
2590	const char *	2600	const char *
2591	object::debug_desc () const	2601	object::debug_desc () const
2592	{	2602	{
2593	static char info[256 * 4];	2603	static char info[3][256 * 4];
		2604	static int info_idx;
		2605
2594	return debug_desc (info);	2606	return debug_desc (info [++info_idx % 3]);
2595	}	2607	}
2596		2608
2597	const char *	2609	struct region *
2598	object::debug_desc2 () const	2610	object::region () const
2599	{	2611	{
2600	static char info[256 * 4];	2612	return map ? map->region (x, y)
2601	return debug_desc (info);	2613	: region::default_region ();
2602	}	2614	}
2603		2615
		2616	const materialtype_t *
		2617	object::dominant_material () const
		2618	{
		2619	if (materialtype_t *mt = name_to_material (materialname))
		2620	return mt;
		2621
		2622	return name_to_material (shstr_unknown);
		2623	}
		2624
		2625	void
		2626	object::open_container (object *new_container)
		2627	{
		2628	if (container == new_container)
		2629	return;
		2630
		2631	object *old_container = container;
		2632
		2633	if (old_container)
		2634	{
		2635	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2636	return;
		2637
		2638	#if 0
		2639	// remove the "Close old_container" object.
		2640	if (object *closer = old_container->inv)
		2641	if (closer->type == CLOSE_CON)
		2642	closer->destroy ();
		2643	#endif
		2644
		2645	// make sure the container is available
		2646	esrv_send_item (this, old_container);
		2647
		2648	old_container->flag [FLAG_APPLIED] = false;
		2649	container = 0;
		2650
		2651	// client needs item update to make it work, client bug requires this to be separate
		2652	esrv_update_item (UPD_FLAGS, this, old_container);
		2653
		2654	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2655	play_sound (sound_find ("chest_close"));
		2656	}
		2657
		2658	if (new_container)
		2659	{
		2660	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2661	return;
		2662
		2663	// TODO: this does not seem to serve any purpose anymore?
		2664	#if 0
		2665	// insert the "Close Container" object.
		2666	if (archetype *closer = new_container->other_arch)
		2667	{
		2668	object *closer = arch_to_object (new_container->other_arch);
		2669	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2670	new_container->insert (closer);
		2671	}
		2672	#endif
		2673
		2674	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2675
		2676	// make sure the container is available, client bug requires this to be separate
		2677	esrv_send_item (this, new_container);
		2678
		2679	new_container->flag [FLAG_APPLIED] = true;
		2680	container = new_container;
		2681
		2682	// client needs flag change
		2683	esrv_update_item (UPD_FLAGS, this, new_container);
		2684	esrv_send_inventory (this, new_container);
		2685	play_sound (sound_find ("chest_open"));
		2686	}
		2687	// else if (!old_container->env && contr && contr->ns)
		2688	// contr->ns->floorbox_reset ();
		2689	}
		2690
		2691	object *
		2692	object::force_find (const shstr name)
		2693	{
		2694	/* cycle through his inventory to look for the MARK we want to
		2695	* place
		2696	*/
		2697	for (object *tmp = inv; tmp; tmp = tmp->below)
		2698	if (tmp->type == FORCE && tmp->slaying == name)
		2699	return splay (tmp);
		2700
		2701	return 0;
		2702	}
		2703
		2704	void
		2705	object::force_add (const shstr name, int duration)
		2706	{
		2707	if (object *force = force_find (name))
		2708	force->destroy ();
		2709
		2710	object *force = get_archetype (FORCE_NAME);
		2711
		2712	force->slaying = name;
		2713	force->stats.food = 1;
		2714	force->speed_left = -1.f;
		2715
		2716	force->set_speed (duration ? 1.f / duration : 0.f);
		2717	force->flag [FLAG_IS_USED_UP] = true;
		2718	force->flag [FLAG_APPLIED] = true;
		2719
		2720	insert (force);
		2721	}
		2722
		2723	void
		2724	object::play_sound (faceidx sound)
		2725	{
		2726	if (!sound)
		2727	return;
		2728
		2729	if (flag [FLAG_REMOVED])
		2730	return;
		2731
		2732	if (env)
		2733	{
		2734	if (object *pl = in_player ())
		2735	pl->contr->play_sound (sound);
		2736	}
		2737	else
		2738	map->play_sound (sound, x, y);
		2739	}
		2740

Diff Legend

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