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.161 by root, Wed Jun 13 21:09:39 2007 UTC vs.
Revision 1.217 by root, Wed Apr 23 07:13:23 2008 UTC

1	/*	1	/*
2	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Crossfire TRT is free software; you can redistribute it and/or modify it	8	* Deliantra is free software: you can redistribute it and/or modify
9	* under the terms of the GNU General Public License as published by the Free	9	* it under the terms of the GNU General Public License as published by
10	* Software Foundation; either version 2 of the License, or (at your option)	10	* the Free Software Foundation, either version 3 of the License, or
11	* any later version.	11	* (at your option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful, but	13	* This program is distributed in the hope that it will be useful,
14	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License along	18	* You should have received a copy of the GNU General Public License
19	* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21	*	20	*
22	* The authors can be reached via e-mail to <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	22	*/
24		23
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying
27	variable. */
28	#include <global.h>	24	#include <global.h>
29	#include <stdio.h>	25	#include <stdio.h>
30	#include <sys/types.h>	26	#include <sys/types.h>
31	#include <sys/uio.h>	27	#include <sys/uio.h>
32	#include <object.h>	28	#include <object.h>
33	#include <funcpoint.h>
34	#include <sproto.h>	29	#include <sproto.h>
35	#include <loader.h>	30	#include <loader.h>
36		31
37	#include <bitset>	32	#include <bitset>
38		33
39	int nrofallocobjects = 0;	34	UUID UUID::cur;
40	static UUID uuid;	35	static uint64_t seq_next_save;
41	const uint64 UUID_SKIP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
42		37
43	objectvec objects;	38	objectvec objects;
44	activevec actives;	39	activevec actives;
45		40
46	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	41	short freearr_x[SIZEOFFREE] = {
		42	0,
		43	0, 1, 1, 1, 0, -1, -1, -1,
		44	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
47	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	45	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
48	};	46	};
49	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	47	short freearr_y[SIZEOFFREE] = {
		48	0,
		49	-1, -1, 0, 1, 1, 1, 0, -1,
		50	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
50	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	51	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
51	};	52	};
52	int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45,	53	int maxfree[SIZEOFFREE] = {
		54	0,
		55	9, 10, 13, 14, 17, 18, 21, 22,
		56	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
53	48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49	57	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
54	};	58	};
55	int freedir[SIZEOFFREE] = {	59	int freedir[SIZEOFFREE] = {
56	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	60	0,
		61	1, 2, 3, 4, 5, 6, 7, 8,
		62	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
57	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	63	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
58	};	64	};
59		65
60	static void	66	static void
61	write_uuid (void)	67	write_uuid (uval64 skip, bool sync)
62	{	68	{
63	char filename1[MAX_BUF], filename2[MAX_BUF];	69	CALL_BEGIN (2);
64		70	CALL_ARG_SV (newSVval64 (skip));
65	sprintf (filename1, "%s/uuid", settings.localdir);	71	CALL_ARG_SV (boolSV (sync));
66	sprintf (filename2, "%s/uuid~", settings.localdir);	72	CALL_CALL ("cf::write_uuid", G_DISCARD);
67		73	CALL_END;
68	FILE *fp;
69
70	if (!(fp = fopen (filename2, "w")))
71	{
72	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
73	return;
74	}
75
76	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
77	fclose (fp);
78	rename (filename2, filename1);
79	}	74	}
80		75
81	static void	76	static void
82	read_uuid (void)	77	read_uuid (void)
83	{	78	{
84	char filename[MAX_BUF];	79	char filename[MAX_BUF];
85		80
86	sprintf (filename, "%s/uuid", settings.localdir);	81	sprintf (filename, "%s/uuid", settings.localdir);
		82
		83	seq_next_save = 0;
87		84
88	FILE *fp;	85	FILE *fp;
89		86
90	if (!(fp = fopen (filename, "r")))	87	if (!(fp = fopen (filename, "r")))
91	{	88	{
92	if (errno == ENOENT)	89	if (errno == ENOENT)
93	{	90	{
94	LOG (llevInfo, "RESET uid to 1\n");	91	LOG (llevInfo, "RESET uid to 1\n");
95	uuid.seq = 0;	92	UUID::cur.seq = 0;
96	write_uuid ();	93	write_uuid (UUID_GAP, true);
97	return;	94	return;
98	}	95	}
99		96
100	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
101	_exit (1);	98	_exit (1);
102	}	99	}
103		100
104	int version;	101	UUID::BUF buf;
105	unsigned long long uid;	102	buf[0] = 0;
106	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	103	fgets (buf, sizeof (buf), fp);
		104
		105	if (!UUID::cur.parse (buf))
107	{	106	{
108	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	107	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
109	_exit (1);	108	_exit (1);
110	}	109	}
111		110
112	uuid.seq = uid;	111	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
113	write_uuid ();	112
114	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	113	write_uuid (UUID_GAP, true);
115	fclose (fp);	114	fclose (fp);
116	}	115	}
117		116
118	UUID	117	UUID
119	gen_uuid ()	118	UUID::gen ()
120	{	119	{
121	UUID uid;	120	UUID uid;
122		121
123	uid.seq = ++uuid.seq;	122	uid.seq = ++cur.seq;
124		123
125	if (!(uuid.seq & (UUID_SKIP - 1)))	124	if (expect_false (cur.seq >= seq_next_save))
126	write_uuid ();	125	{
		126	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		127	write_uuid (UUID_GAP, false);
		128	}
		129
127		130
128	return uid;	131	return uid;
129	}	132	}
130		133
131	void	134	void
132	init_uuid ()	135	UUID::init ()
133	{	136	{
134	read_uuid ();	137	read_uuid ();
135	}	138	}
136		139
137	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	140	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
138	static int	141	static bool
139	compare_ob_value_lists_one (const object *wants, const object *has)	142	compare_ob_value_lists_one (const object *wants, const object *has)
140	{	143	{
141	key_value *wants_field;	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 (!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	return pl;
		364	}
		365	}
		366
		367	return 0;
		368	}
		369
		370	// adjust weight per container type ("of holding")
		371	static sint32
		372	weight_adjust (object *op, sint32 weight)
		373	{
		374	return op->type == CONTAINER
		375	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		376	: weight;
		377	}
		378
319	/*	379	/*
		380	* adjust_weight(object, weight) adds the specified weight to an object,
		381	* and also updates how much the environment(s) is/are carrying.
		382	*/
		383	static void
		384	adjust_weight (object *op, sint32 weight)
		385	{
		386	while (op)
		387	{
		388	weight = weight_adjust (op, weight);
		389
		390	if (!weight)
		391	return;
		392
		393	op->carrying += weight;
		394
		395	if (object *pl = op->visible_to ())
		396	if (pl != op) // player is handled lazily
		397	esrv_update_item (UPD_WEIGHT, pl, op);
		398
		399	op = op->env;
		400	}
		401	}
		402
		403	/*
320	* sum_weight() is a recursive function which calculates the weight	404	* this is a recursive function which calculates the weight
321	* an object is carrying. It goes through in figures out how much	405	* an object is carrying. It goes through op and figures out how much
322	* containers are carrying, and sums it up.	406	* containers are carrying, and sums it up.
323	*/	407	*/
324	long	408	void
325	sum_weight (object *op)	409	object::update_weight ()
326	{	410	{
327	long sum;	411	sint32 sum = 0;
328	object *inv;
329		412
330	for (sum = 0, inv = op->inv; inv; inv = inv->below)	413	for (object *op = inv; op; op = op->below)
331	{	414	{
332	if (inv->inv)	415	if (op->inv)
333	sum_weight (inv);	416	op->update_weight ();
334		417
335	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	418	sum += op->total_weight ();
		419	}
		420
		421	sum = weight_adjust (this, sum);
		422
		423	if (sum != carrying)
336	}	424	{
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;	425	carrying = sum;
343		426
344	return sum;	427	if (object *pl = visible_to ())
		428	if (pl != this) // player is handled lazily
		429	esrv_update_item (UPD_WEIGHT, pl, this);
		430	}
345	}	431	}
346		432
347	/**	433	/*
348	* Return the outermost environment object for a given object.	434	* 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	*/	435	*/
364	char *	436	char *
365	dump_object (object *op)	437	dump_object (object *op)
366	{	438	{
367	if (!op)	439	if (!op)
…		…
375	/*	447	/*
376	* get_nearest_part(multi-object, object 2) returns the part of the	448	* get_nearest_part(multi-object, object 2) returns the part of the
377	* multi-object 1 which is closest to the second object.	449	* multi-object 1 which is closest to the second object.
378	* If it's not a multi-object, it is returned.	450	* If it's not a multi-object, it is returned.
379	*/	451	*/
380
381	object *	452	object *
382	get_nearest_part (object *op, const object *pl)	453	get_nearest_part (object *op, const object *pl)
383	{	454	{
384	object *tmp, *closest;	455	object *tmp, *closest;
385	int last_dist, i;	456	int last_dist, i;
386		457
387	if (op->more == NULL)	458	if (!op->more)
388	return op;	459	return op;
		460
389	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	461	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		462	tmp;
		463	tmp = tmp->more)
390	if ((i = distance (tmp, pl)) < last_dist)	464	if ((i = distance (tmp, pl)) < last_dist)
391	closest = tmp, last_dist = i;	465	closest = tmp, last_dist = i;
		466
392	return closest;	467	return closest;
393	}	468	}
394		469
395	/*	470	/*
396	* Returns the object which has the count-variable equal to the argument.	471	* Returns the object which has the count-variable equal to the argument.
		472	* VERRRY slow.
397	*/	473	*/
398	object *	474	object *
399	find_object (tag_t i)	475	find_object (tag_t i)
400	{	476	{
401	for_all_objects (op)	477	for_all_objects (op)
…		…
421	break;	497	break;
422		498
423	return op;	499	return op;
424	}	500	}
425		501
426	void
427	free_all_object_data ()
428	{
429	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
430	}
431
432	/*	502	/*
433	* Sets the owner and sets the skill and exp pointers to owner's current	503	* Sets the owner and sets the skill and exp pointers to owner's current
434	* skill and experience objects.	504	* skill and experience objects.
		505	* ACTUALLY NO! investigate! TODO
435	*/	506	*/
436	void	507	void
437	object::set_owner (object *owner)	508	object::set_owner (object *owner)
438	{	509	{
		510	// allow objects which own objects
439	if (!owner)	511	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)	512	while (owner->owner)
450	owner = owner->owner;	513	owner = owner->owner;
		514
		515	if (flag [FLAG_FREED])
		516	{
		517	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		518	return;
		519	}
451		520
452	this->owner = owner;	521	this->owner = owner;
453	}	522	}
454		523
455	int	524	int
…		…
587	object::copy_to (object *dst)	656	object::copy_to (object *dst)
588	{	657	{
589	*dst = *this;	658	*dst = *this;
590		659
591	if (speed < 0)	660	if (speed < 0)
592	dst->speed_left = speed_left - rndm ();	661	dst->speed_left -= rndm ();
593		662
594	dst->set_speed (dst->speed);	663	dst->set_speed (dst->speed);
595	}	664	}
596		665
597	void	666	void
598	object::instantiate ()	667	object::instantiate ()
599	{	668	{
600	if (!uuid.seq) // HACK	669	if (!uuid.seq) // HACK
601	uuid = gen_uuid ();	670	uuid = UUID::gen ();
602		671
603	speed_left = -0.1f;	672	speed_left = -0.1f;
604	/* copy the body_info to the body_used - this is only really	673	/* copy the body_info to the body_used - this is only really
605	* need for monsters, but doesn't hurt to do it for everything.	674	* need for monsters, but doesn't hurt to do it for everything.
606	* by doing so, when a monster is created, it has good starting	675	* by doing so, when a monster is created, it has good starting
…		…
765	static int object_count;	834	static int object_count;
766		835
767	void object::link ()	836	void object::link ()
768	{	837	{
769	assert (!index);//D	838	assert (!index);//D
770	uuid = gen_uuid ();	839	uuid = UUID::gen ();
771	count = ++object_count;	840	count = ++object_count;
772		841
773	refcnt_inc ();	842	refcnt_inc ();
774	objects.insert (this);	843	objects.insert (this);
775	}	844	}
…		…
848	object::destroy_inv (bool drop_to_ground)	917	object::destroy_inv (bool drop_to_ground)
849	{	918	{
850	// need to check first, because the checks below might segfault	919	// need to check first, because the checks below might segfault
851	// as we might be on an invalid mapspace and crossfire code	920	// as we might be on an invalid mapspace and crossfire code
852	// is too buggy to ensure that the inventory is empty.	921	// is too buggy to ensure that the inventory is empty.
853	// corollary: if you create arrows etc. with stuff in tis inventory,	922	// corollary: if you create arrows etc. with stuff in its inventory,
854	// cf will crash below with off-map x and y	923	// cf will crash below with off-map x and y
855	if (!inv)	924	if (!inv)
856	return;	925	return;
857		926
858	/* Only if the space blocks everything do we not process -	927	/* Only if the space blocks everything do we not process -
859	* if some form of movement is allowed, let objects	928	* if some form of movement is allowed, let objects
860	* drop on that space.	929	* drop on that space.
861	*/	930	*/
862	if (!drop_to_ground	931	if (!drop_to_ground
863	|| !map	932	|| !map
864	|| map->in_memory != MAP_IN_MEMORY	933	|| map->in_memory != MAP_ACTIVE
865	|| map->nodrop	934	|| map->nodrop
866	|| ms ().move_block == MOVE_ALL)	935	|| ms ().move_block == MOVE_ALL)
867	{	936	{
868	while (inv)	937	while (inv)
869	{	938	{
870	inv->destroy_inv (drop_to_ground);	939	inv->destroy_inv (false);
871	inv->destroy ();	940	inv->destroy ();
872	}	941	}
873	}	942	}
874	else	943	else
875	{ /* Put objects in inventory onto this space */	944	{ /* Put objects in inventory onto this space */
…		…
881	|| op->flag [FLAG_NO_DROP]	950	|| op->flag [FLAG_NO_DROP]
882	|| op->type == RUNE	951	|| op->type == RUNE
883	|| op->type == TRAP	952	|| op->type == TRAP
884	|| op->flag [FLAG_IS_A_TEMPLATE]	953	|| op->flag [FLAG_IS_A_TEMPLATE]
885	|| op->flag [FLAG_DESTROY_ON_DEATH])	954	|| op->flag [FLAG_DESTROY_ON_DEATH])
886	op->destroy ();	955	op->destroy (true);
887	else	956	else
888	map->insert (op, x, y);	957	map->insert (op, x, y);
889	}	958	}
890	}	959	}
891	}	960	}
…		…
898	}	967	}
899		968
900	void	969	void
901	object::do_destroy ()	970	object::do_destroy ()
902	{	971	{
903	attachable::do_destroy ();
904
905	if (flag [FLAG_IS_LINKED])	972	if (flag [FLAG_IS_LINKED])
906	remove_button_link (this);	973	remove_button_link (this);
907		974
908	if (flag [FLAG_FRIENDLY])	975	if (flag [FLAG_FRIENDLY])
909	remove_friendly_object (this);	976	remove_friendly_object (this);
910		977
911	if (!flag [FLAG_REMOVED])
912	remove ();	978	remove ();
913		979
914	destroy_inv (true);	980	attachable::do_destroy ();
915		981
916	deactivate ();	982	deactivate ();
917	unlink ();	983	unlink ();
918		984
919	flag [FLAG_FREED] = 1;	985	flag [FLAG_FREED] = 1;
…		…
924		990
925	if (!freed_map)	991	if (!freed_map)
926	{	992	{
927	freed_map = new maptile;	993	freed_map = new maptile;
928		994
		995	freed_map->path = "<freed objects map>";
929	freed_map->name = "/internal/freed_objects_map";	996	freed_map->name = "/internal/freed_objects_map";
930	freed_map->width = 3;	997	freed_map->width = 3;
931	freed_map->height = 3;	998	freed_map->height = 3;
		999	freed_map->nodrop = 1;
932		1000
933	freed_map->alloc ();	1001	freed_map->alloc ();
934	freed_map->in_memory = MAP_IN_MEMORY;	1002	freed_map->in_memory = MAP_ACTIVE;
935	}	1003	}
936		1004
937	map = freed_map;	1005	map = freed_map;
938	x = 1;	1006	x = 1;
939	y = 1;	1007	y = 1;
940	}	1008	}
941		1009
942	head = 0;
943
944	if (more)	1010	if (more)
945	{	1011	{
946	more->destroy ();	1012	more->destroy ();
947	more = 0;	1013	more = 0;
948	}	1014	}
949		1015
		1016	head = 0;
		1017
950	// clear those pointers that likely might have circular references to us	1018	// clear those pointers that likely might cause circular references
951	owner = 0;	1019	owner = 0;
952	enemy = 0;	1020	enemy = 0;
953	attacked_by = 0;	1021	attacked_by = 0;
		1022	current_weapon = 0;
954	}	1023	}
955		1024
956	void	1025	void
957	object::destroy (bool destroy_inventory)	1026	object::destroy (bool destroy_inventory)
958	{	1027	{
959	if (destroyed ())	1028	if (destroyed ())
960	return;	1029	return;
961		1030
962	if (destroy_inventory)	1031	destroy_inv (!destroy_inventory);
963	destroy_inv (false);	1032
		1033	if (is_head ())
		1034	if (sound_destroy)
		1035	play_sound (sound_destroy);
		1036	else if (flag [FLAG_MONSTER])
		1037	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
964		1038
965	attachable::destroy ();	1039	attachable::destroy ();
966	}
967
968	/*
969	* sub_weight() recursively (outwards) subtracts a number from the
970	* weight of an object (and what is carried by it's environment(s)).
971	*/
972	void
973	sub_weight (object *op, signed long weight)
974	{
975	while (op != NULL)
976	{
977	if (op->type == CONTAINER)
978	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
979
980	op->carrying -= weight;
981	op = op->env;
982	}
983	}	1040	}
984		1041
985	/* op->remove ():	1042	/* op->remove ():
986	* This function removes the object op from the linked list of objects	1043	* This function removes the object op from the linked list of objects
987	* which it is currently tied to. When this function is done, the	1044	* which it is currently tied to. When this function is done, the
…		…
993	object::do_remove ()	1050	object::do_remove ()
994	{	1051	{
995	object *tmp, *last = 0;	1052	object *tmp, *last = 0;
996	object *otmp;	1053	object *otmp;
997		1054
998	if (QUERY_FLAG (this, FLAG_REMOVED))	1055	if (flag [FLAG_REMOVED])
999	return;	1056	return;
1000		1057
1001	SET_FLAG (this, FLAG_REMOVED);
1002	INVOKE_OBJECT (REMOVE, this);	1058	INVOKE_OBJECT (REMOVE, this);
		1059
		1060	if (object *pl = visible_to ())
		1061	esrv_del_item (pl->contr, count);
		1062
		1063	flag [FLAG_REMOVED] = true;
1003		1064
1004	if (more)	1065	if (more)
1005	more->remove ();	1066	more->remove ();
1006		1067
1007	/*	1068	/*
1008	* In this case, the object to be removed is in someones	1069	* In this case, the object to be removed is in someones
1009	* inventory.	1070	* inventory.
1010	*/	1071	*/
1011	if (env)	1072	if (env)
1012	{	1073	{
		1074	adjust_weight (env, -total_weight ());
		1075
		1076	*(above ? &above->below : &env->inv) = below;
		1077
1013	if (nrof)	1078	if (below)
1014	sub_weight (env, weight * nrof);	1079	below->above = above;
1015	else	1080
1016	sub_weight (env, weight + carrying);	1081	/* we set up values so that it could be inserted into
		1082	* the map, but we don't actually do that - it is up
		1083	* to the caller to decide what we want to do.
		1084	*/
		1085	map = env->map;
		1086	x = env->x;
		1087	y = env->y;
		1088	above = 0;
		1089	below = 0;
		1090	env = 0;
1017		1091
1018	/* NO_FIX_PLAYER is set when a great many changes are being	1092	/* NO_FIX_PLAYER is set when a great many changes are being
1019	* made to players inventory. If set, avoiding the call	1093	* made to players inventory. If set, avoiding the call
1020	* to save cpu time.	1094	* to save cpu time.
1021	*/	1095	*/
1022	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1096	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1023	otmp->update_stats ();	1097	otmp->update_stats ();
1024
1025	if (above)
1026	above->below = below;
1027	else
1028	env->inv = below;
1029
1030	if (below)
1031	below->above = above;
1032
1033	/* we set up values so that it could be inserted into
1034	* the map, but we don't actually do that - it is up
1035	* to the caller to decide what we want to do.
1036	*/
1037	x = env->x, y = env->y;
1038	map = env->map;
1039	above = 0, below = 0;
1040	env = 0;
1041	}	1098	}
1042	else if (map)	1099	else if (map)
1043	{	1100	{
1044	if (type == PLAYER)	1101	if (type == PLAYER)
1045	{	1102	{
…		…
1083	if (map->in_memory == MAP_SAVING)	1140	if (map->in_memory == MAP_SAVING)
1084	return;	1141	return;
1085		1142
1086	int check_walk_off = !flag [FLAG_NO_APPLY];	1143	int check_walk_off = !flag [FLAG_NO_APPLY];
1087		1144
		1145	if (object *pl = ms.player ())
		1146	{
		1147	if (pl->container == this)
		1148	/* If a container that the player is currently using somehow gets
		1149	* removed (most likely destroyed), update the player view
		1150	* appropriately.
		1151	*/
		1152	pl->close_container ();
		1153
		1154	esrv_del_item (pl, count);
		1155	}
		1156
1088	for (tmp = ms.bot; tmp; tmp = tmp->above)	1157	for (tmp = ms.bot; tmp; tmp = tmp->above)
1089	{	1158	{
1090	/* No point updating the players look faces if he is the object	1159	/* No point updating the players look faces if he is the object
1091	* being removed.	1160	* being removed.
1092	*/	1161	*/
1093
1094	if (tmp->type == PLAYER && tmp != this)
1095	{
1096	/* If a container that the player is currently using somehow gets
1097	* removed (most likely destroyed), update the player view
1098	* appropriately.
1099	*/
1100	if (tmp->container == this)
1101	{
1102	flag [FLAG_APPLIED] = 0;
1103	tmp->container = 0;
1104	}
1105
1106	if (tmp->contr->ns)
1107	tmp->contr->ns->floorbox_update ();
1108	}
1109		1162
1110	/* See if object moving off should effect something */	1163	/* See if object moving off should effect something */
1111	if (check_walk_off	1164	if (check_walk_off
1112	&& ((move_type & tmp->move_off)	1165	&& ((move_type & tmp->move_off)
1113	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1166	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1145	merge_ob (object *op, object *top)	1198	merge_ob (object *op, object *top)
1146	{	1199	{
1147	if (!op->nrof)	1200	if (!op->nrof)
1148	return 0;	1201	return 0;
1149		1202
1150	if (top)	1203	if (!top)
1151	for (top = op; top && top->above; top = top->above)	1204	for (top = op; top && top->above; top = top->above)
1152	;	1205	;
1153		1206
1154	for (; top; top = top->below)	1207	for (; top; top = top->below)
1155	{
1156	if (top == op)
1157	continue;
1158
1159	if (object::can_merge (op, top))	1208	if (object::can_merge (op, top))
1160	{	1209	{
1161	top->nrof += op->nrof;	1210	top->nrof += op->nrof;
1162		1211
1163	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1212	if (object *pl = top->visible_to ())
1164	op->weight = 0; /* Don't want any adjustements now */	1213	esrv_update_item (UPD_NROF, pl, top);
		1214
		1215	op->weight = 0; // cancel the addition above
		1216	op->carrying = 0; // must be 0 already
		1217
1165	op->destroy ();	1218	op->destroy (1);
		1219
1166	return top;	1220	return top;
1167	}	1221	}
1168	}
1169		1222
1170	return 0;	1223	return 0;
1171	}	1224	}
1172		1225
1173	void	1226	void
…		…
1236		1289
1237	object *top, *floor = NULL;	1290	object *top, *floor = NULL;
1238		1291
1239	op->remove ();	1292	op->remove ();
1240		1293
1241	#if 0
1242	if (!m->active != !op->active)
1243	if (m->active)
1244	op->activate_recursive ();
1245	else
1246	op->deactivate_recursive ();
1247	#endif
1248
1249	if (out_of_map (m, op->x, op->y))
1250	{
1251	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1252	#ifdef MANY_CORES
1253	/* Better to catch this here, as otherwise the next use of this object
1254	* is likely to cause a crash. Better to find out where it is getting
1255	* improperly inserted.
1256	*/
1257	abort ();
1258	#endif
1259	return op;
1260	}
1261
1262	if (object *more = op->more)
1263	if (!insert_ob_in_map (more, m, originator, flag))
1264	return 0;
1265
1266	CLEAR_FLAG (op, FLAG_REMOVED);
1267
1268	/* Ideally, the caller figures this out. However, it complicates a lot	1294	/* Ideally, the caller figures this out. However, it complicates a lot
1269	* of areas of callers (eg, anything that uses find_free_spot would now	1295	* of areas of callers (eg, anything that uses find_free_spot would now
1270	* need extra work	1296	* need extra work
1271	*/	1297	*/
1272	if (!xy_normalise (m, op->x, op->y))	1298	if (!xy_normalise (m, op->x, op->y))
		1299	{
		1300	op->destroy (1);
1273	return 0;	1301	return 0;
		1302	}
		1303
		1304	if (object *more = op->more)
		1305	if (!insert_ob_in_map (more, m, originator, flag))
		1306	return 0;
		1307
		1308	CLEAR_FLAG (op, FLAG_REMOVED);
1274		1309
1275	op->map = m;	1310	op->map = m;
1276	mapspace &ms = op->ms ();	1311	mapspace &ms = op->ms ();
1277		1312
1278	/* this has to be done after we translate the coordinates.	1313	/* this has to be done after we translate the coordinates.
…		…
1280	if (op->nrof && !(flag & INS_NO_MERGE))	1315	if (op->nrof && !(flag & INS_NO_MERGE))
1281	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1316	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1282	if (object::can_merge (op, tmp))	1317	if (object::can_merge (op, tmp))
1283	{	1318	{
1284	op->nrof += tmp->nrof;	1319	op->nrof += tmp->nrof;
1285	tmp->destroy ();	1320	tmp->destroy (1);
1286	}	1321	}
1287		1322
1288	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1323	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1289	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1324	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1290		1325
…		…
1313	else	1348	else
1314	{	1349	{
1315	top = ms.bot;	1350	top = ms.bot;
1316		1351
1317	/* If there are other objects, then */	1352	/* If there are other objects, then */
1318	if ((!(flag & INS_MAP_LOAD)) && top)	1353	if (top)
1319	{	1354	{
1320	object *last = 0;	1355	object *last = 0;
1321		1356
1322	/*	1357	/*
1323	* If there are multiple objects on this space, we do some trickier handling.	1358	* If there are multiple objects on this space, we do some trickier handling.
…		…
1376	if (last && last->below && last != floor)	1411	if (last && last->below && last != floor)
1377	top = last->below;	1412	top = last->below;
1378	}	1413	}
1379	} /* If objects on this space */	1414	} /* If objects on this space */
1380		1415
1381	if (flag & INS_MAP_LOAD)
1382	top = ms.top;
1383
1384	if (flag & INS_ABOVE_FLOOR_ONLY)	1416	if (flag & INS_ABOVE_FLOOR_ONLY)
1385	top = floor;	1417	top = floor;
1386		1418
1387	/* Top is the object that our object (op) is going to get inserted above.	1419	/* Top is the object that our object (op) is going to get inserted above.
1388	*/	1420	*/
…		…
1420	op->map->touch ();	1452	op->map->touch ();
1421	}	1453	}
1422		1454
1423	op->map->dirty = true;	1455	op->map->dirty = true;
1424		1456
1425	/* If we have a floor, we know the player, if any, will be above
1426	* it, so save a few ticks and start from there.
1427	*/
1428	if (!(flag & INS_MAP_LOAD))
1429	if (object *pl = ms.player ())	1457	if (object *pl = ms.player ())
1430	if (pl->contr->ns)	1458	esrv_send_item (pl, op);
1431	pl->contr->ns->floorbox_update ();
1432		1459
1433	/* If this object glows, it may affect lighting conditions that are	1460	/* If this object glows, it may affect lighting conditions that are
1434	* visible to others on this map. But update_all_los is really	1461	* visible to others on this map. But update_all_los is really
1435	* an inefficient way to do this, as it means los for all players	1462	* an inefficient way to do this, as it means los for all players
1436	* on the map will get recalculated. The players could very well	1463	* on the map will get recalculated. The players could very well
…		…
1478	* op is the object to insert it under: supplies x and the map.	1505	* op is the object to insert it under: supplies x and the map.
1479	*/	1506	*/
1480	void	1507	void
1481	replace_insert_ob_in_map (const char *arch_string, object *op)	1508	replace_insert_ob_in_map (const char *arch_string, object *op)
1482	{	1509	{
1483	object *tmp, *tmp1;
1484
1485	/* first search for itself and remove any old instances */	1510	/* first search for itself and remove any old instances */
1486		1511
1487	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1512	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1488	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1513	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1489	tmp->destroy ();	1514	tmp->destroy (1);
1490		1515
1491	tmp1 = arch_to_object (archetype::find (arch_string));	1516	object *tmp = arch_to_object (archetype::find (arch_string));
1492		1517
1493	tmp1->x = op->x;	1518	tmp->x = op->x;
1494	tmp1->y = op->y;	1519	tmp->y = op->y;
		1520
1495	insert_ob_in_map (tmp1, op->map, op, 0);	1521	insert_ob_in_map (tmp, op->map, op, 0);
1496	}	1522	}
1497		1523
1498	object *	1524	object *
1499	object::insert_at (object *where, object *originator, int flags)	1525	object::insert_at (object *where, object *originator, int flags)
1500	{	1526	{
		1527	if (where->env)
		1528	return where->env->insert (this);
		1529	else
1501	return where->map->insert (this, where->x, where->y, originator, flags);	1530	return where->map->insert (this, where->x, where->y, originator, flags);
1502	}	1531	}
1503		1532
1504	/*	1533	/*
1505	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1506	* is returned contains nr objects, and the remaining parts contains
1507	* the rest (or is removed and freed if that number is 0).
1508	* On failure, NULL is returned, and the reason put into the
1509	* global static errmsg array.
1510	*/
1511	object *
1512	get_split_ob (object *orig_ob, uint32 nr)
1513	{
1514	object *newob;
1515	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1516
1517	if (orig_ob->nrof < nr)
1518	{
1519	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1520	return NULL;
1521	}
1522
1523	newob = object_create_clone (orig_ob);
1524
1525	if ((orig_ob->nrof -= nr) < 1)
1526	orig_ob->destroy (1);
1527	else if (!is_removed)
1528	{
1529	if (orig_ob->env != NULL)
1530	sub_weight (orig_ob->env, orig_ob->weight * nr);
1531	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1532	{
1533	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1534	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1535	return NULL;
1536	}
1537	}
1538
1539	newob->nrof = nr;
1540
1541	return newob;
1542	}
1543
1544	/*
1545	* decrease_ob_nr(object, number) decreases a specified number from	1534	* decrease(object, number) decreases a specified number from
1546	* the amount of an object. If the amount reaches 0, the object	1535	* the amount of an object. If the amount reaches 0, the object
1547	* is subsequently removed and freed.	1536	* is subsequently removed and freed.
1548	*	1537	*
1549	* Return value: 'op' if something is left, NULL if the amount reached 0	1538	* Return value: 'op' if something is left, NULL if the amount reached 0
1550	*/	1539	*/
		1540	bool
		1541	object::decrease (sint32 nr)
		1542	{
		1543	if (!nr)
		1544	return true;
		1545
		1546	nr = min (nr, nrof);
		1547
		1548	nrof -= nr;
		1549
		1550	if (nrof)
		1551	{
		1552	adjust_weight (env, -weight * nr); // carrying == 0
		1553
		1554	if (object *pl = visible_to ())
		1555	esrv_update_item (UPD_NROF, pl, this);
		1556
		1557	return true;
		1558	}
		1559	else
		1560	{
		1561	destroy (1);
		1562	return false;
		1563	}
		1564	}
		1565
		1566	/*
		1567	* split(ob,nr) splits up ob into two parts. The part which
		1568	* is returned contains nr objects, and the remaining parts contains
		1569	* the rest (or is removed and returned if that number is 0).
		1570	* On failure, NULL is returned.
		1571	*/
1551	object *	1572	object *
1552	decrease_ob_nr (object *op, uint32 i)	1573	object::split (sint32 nr)
1553	{	1574	{
1554	object *tmp;	1575	int have = number_of ();
1555		1576
1556	if (i == 0) /* objects with op->nrof require this check */	1577	if (have < nr)
1557	return op;	1578	return 0;
1558		1579	else if (have == nr)
1559	if (i > op->nrof)
1560	i = op->nrof;
1561
1562	if (QUERY_FLAG (op, FLAG_REMOVED))
1563	op->nrof -= i;
1564	else if (op->env)
1565	{	1580	{
1566	/* is this object in the players inventory, or sub container
1567	* therein?
1568	*/
1569	tmp = op->in_player ();
1570	/* nope. Is this a container the player has opened?
1571	* If so, set tmp to that player.
1572	* IMO, searching through all the players will mostly
1573	* likely be quicker than following op->env to the map,
1574	* and then searching the map for a player.
1575	*/
1576	if (!tmp)
1577	for_all_players (pl)
1578	if (pl->ob->container == op->env)
1579	{
1580	tmp = pl->ob;
1581	break;
1582	}
1583
1584	if (i < op->nrof)
1585	{
1586	sub_weight (op->env, op->weight * i);
1587	op->nrof -= i;
1588	if (tmp)
1589	esrv_send_item (tmp, op);
1590	}
1591	else
1592	{
1593	op->remove ();	1581	remove ();
1594	op->nrof = 0;	1582	return this;
1595	if (tmp)
1596	esrv_del_item (tmp->contr, op->count);
1597	}
1598	}	1583	}
1599	else	1584	else
1600	{	1585	{
1601	object *above = op->above;	1586	decrease (nr);
1602		1587
1603	if (i < op->nrof)	1588	object *op = object_create_clone (this);
1604	op->nrof -= i;	1589	op->nrof = nr;
1605	else
1606	{
1607	op->remove ();
1608	op->nrof = 0;
1609	}
1610
1611	/* Since we just removed op, op->above is null */
1612	for (tmp = above; tmp; tmp = tmp->above)
1613	if (tmp->type == PLAYER)
1614	{
1615	if (op->nrof)
1616	esrv_send_item (tmp, op);
1617	else
1618	esrv_del_item (tmp->contr, op->count);
1619	}
1620	}
1621
1622	if (op->nrof)
1623	return op;	1590	return op;
1624	else
1625	{
1626	op->destroy ();
1627	return 0;
1628	}
1629	}
1630
1631	/*
1632	* add_weight(object, weight) adds the specified weight to an object,
1633	* and also updates how much the environment(s) is/are carrying.
1634	*/
1635	void
1636	add_weight (object *op, signed long weight)
1637	{
1638	while (op != NULL)
1639	{
1640	if (op->type == CONTAINER)
1641	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1642
1643	op->carrying += weight;
1644	op = op->env;
1645	}	1591	}
1646	}	1592	}
1647		1593
1648	object *	1594	object *
1649	insert_ob_in_ob (object *op, object *where)	1595	insert_ob_in_ob (object *op, object *where)
…		…
1674	* be != op, if items are merged. -Tero	1620	* be != op, if items are merged. -Tero
1675	*/	1621	*/
1676	object *	1622	object *
1677	object::insert (object *op)	1623	object::insert (object *op)
1678	{	1624	{
1679	object *tmp, *otmp;
1680
1681	if (!QUERY_FLAG (op, FLAG_REMOVED))
1682	op->remove ();
1683
1684	if (op->more)	1625	if (op->more)
1685	{	1626	{
1686	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1627	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1687	return op;	1628	return op;
1688	}	1629	}
1689		1630
1690	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1631	op->remove ();
1691	CLEAR_FLAG (op, FLAG_REMOVED);	1632
		1633	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1634
1692	if (op->nrof)	1635	if (op->nrof)
1693	{
1694	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1636	for (object *tmp = inv; tmp; tmp = tmp->below)
1695	if (object::can_merge (tmp, op))	1637	if (object::can_merge (tmp, op))
1696	{	1638	{
1697	/* return the original object and remove inserted object	1639	/* return the original object and remove inserted object
1698	(client needs the original object) */	1640	(client needs the original object) */
1699	tmp->nrof += op->nrof;	1641	tmp->nrof += op->nrof;
1700	/* Weight handling gets pretty funky. Since we are adding to	1642
1701	* tmp->nrof, we need to increase the weight.	1643	if (object *pl = tmp->visible_to ())
1702	*/	1644	esrv_update_item (UPD_NROF, pl, tmp);
		1645
1703	add_weight (this, op->weight * op->nrof);	1646	adjust_weight (this, op->total_weight ());
1704	SET_FLAG (op, FLAG_REMOVED);	1647
1705	op->destroy (); /* free the inserted object */	1648	op->destroy (1);
1706	op = tmp;	1649	op = tmp;
1707	op->remove (); /* and fix old object's links */	1650	goto inserted;
1708	CLEAR_FLAG (op, FLAG_REMOVED);
1709	break;
1710	}	1651	}
1711		1652
1712	/* I assume combined objects have no inventory	1653	op->owner = 0; // it's his/hers now. period.
1713	* We add the weight - this object could have just been removed
1714	* (if it was possible to merge). calling remove_ob will subtract
1715	* the weight, so we need to add it in again, since we actually do
1716	* the linking below
1717	*/
1718	add_weight (this, op->weight * op->nrof);
1719	}
1720	else
1721	add_weight (this, (op->weight + op->carrying));
1722
1723	otmp = this->in_player ();
1724	if (otmp && otmp->contr)
1725	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1726	otmp->update_stats ();
1727
1728	op->map = 0;	1654	op->map = 0;
1729	op->env = this;	1655	op->x = 0;
		1656	op->y = 0;
		1657
1730	op->above = 0;	1658	op->above = 0;
1731	op->below = 0;	1659	op->below = inv;
1732	op->x = 0, op->y = 0;	1660	op->env = this;
1733		1661
		1662	if (inv)
		1663	inv->above = op;
		1664
		1665	inv = op;
		1666
		1667	op->flag [FLAG_REMOVED] = 0;
		1668
		1669	if (object *pl = op->visible_to ())
		1670	esrv_send_item (pl, op);
		1671
		1672	adjust_weight (this, op->total_weight ());
		1673
		1674	inserted:
1734	/* reset the light list and los of the players on the map */	1675	/* reset the light list and los of the players on the map */
1735	if ((op->glow_radius != 0) && map)	1676	if (op->glow_radius && map && map->darkness)
1736	{
1737	#ifdef DEBUG_LIGHTS
1738	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1739	#endif /* DEBUG_LIGHTS */
1740	if (map->darkness)
1741	update_all_los (map, x, y);	1677	update_all_los (map, x, y);
1742	}
1743		1678
1744	/* Client has no idea of ordering so lets not bother ordering it here.	1679	// if this is a player's inventory, update stats
1745	* It sure simplifies this function...	1680	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1746	*/	1681	update_stats ();
1747	if (!inv)
1748	inv = op;
1749	else
1750	{
1751	op->below = inv;
1752	op->below->above = op;
1753	inv = op;
1754	}
1755		1682
1756	INVOKE_OBJECT (INSERT, this);	1683	INVOKE_OBJECT (INSERT, this);
1757		1684
1758	return op;	1685	return op;
1759	}	1686	}
…		…
1974	* activate recursively a flag on an object inventory	1901	* activate recursively a flag on an object inventory
1975	*/	1902	*/
1976	void	1903	void
1977	flag_inv (object *op, int flag)	1904	flag_inv (object *op, int flag)
1978	{	1905	{
1979	if (op->inv)
1980	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1906	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1981	{	1907	{
1982	SET_FLAG (tmp, flag);	1908	SET_FLAG (tmp, flag);
1983	flag_inv (tmp, flag);	1909	flag_inv (tmp, flag);
1984	}	1910	}
1985	}	1911	}
1986		1912
1987	/*	1913	/*
1988	* deactivate recursively a flag on an object inventory	1914	* deactivate recursively a flag on an object inventory
1989	*/	1915	*/
1990	void	1916	void
1991	unflag_inv (object *op, int flag)	1917	unflag_inv (object *op, int flag)
1992	{	1918	{
1993	if (op->inv)
1994	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1919	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1995	{	1920	{
1996	CLEAR_FLAG (tmp, flag);	1921	CLEAR_FLAG (tmp, flag);
1997	unflag_inv (tmp, flag);	1922	unflag_inv (tmp, flag);
1998	}	1923	}
1999	}	1924	}
2000		1925
2001	/*	1926	/*
2002	* find_free_spot(object, map, x, y, start, stop) will search for	1927	* find_free_spot(object, map, x, y, start, stop) will search for
2003	* a spot at the given map and coordinates which will be able to contain	1928	* a spot at the given map and coordinates which will be able to contain
…		…
2005	* to search (see the freearr_x/y[] definition).	1930	* to search (see the freearr_x/y[] definition).
2006	* It returns a random choice among the alternatives found.	1931	* It returns a random choice among the alternatives found.
2007	* start and stop are where to start relative to the free_arr array (1,9	1932	* start and stop are where to start relative to the free_arr array (1,9
2008	* does all 4 immediate directions). This returns the index into the	1933	* does all 4 immediate directions). This returns the index into the
2009	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1934	* array of the free spot, -1 if no spot available (dir 0 = x,y)
2010	* Note - this only checks to see if there is space for the head of the
2011	* object - if it is a multispace object, this should be called for all
2012	* pieces.
2013	* Note2: This function does correctly handle tiled maps, but does not	1935	* Note: This function does correctly handle tiled maps, but does not
2014	* inform the caller. However, insert_ob_in_map will update as	1936	* inform the caller. However, insert_ob_in_map will update as
2015	* necessary, so the caller shouldn't need to do any special work.	1937	* necessary, so the caller shouldn't need to do any special work.
2016	* Note - updated to take an object instead of archetype - this is necessary	1938	* Note - updated to take an object instead of archetype - this is necessary
2017	* because arch_blocked (now ob_blocked) needs to know the movement type	1939	* because arch_blocked (now ob_blocked) needs to know the movement type
2018	* to know if the space in question will block the object. We can't use	1940	* to know if the space in question will block the object. We can't use
…		…
2020	* customized, changed states, etc.	1942	* customized, changed states, etc.
2021	*/	1943	*/
2022	int	1944	int
2023	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1945	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2024	{	1946	{
		1947	int altern[SIZEOFFREE];
2025	int index = 0, flag;	1948	int index = 0, flag;
2026	int altern[SIZEOFFREE];
2027		1949
2028	for (int i = start; i < stop; i++)	1950	for (int i = start; i < stop; i++)
2029	{	1951	{
2030	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1952	mapxy pos (m, x, y); pos.move (i);
2031	if (!flag)	1953
		1954	if (!pos.normalise ())
		1955	continue;
		1956
		1957	mapspace &ms = *pos;
		1958
		1959	if (ms.flags () & P_IS_ALIVE)
		1960	continue;
		1961
		1962	/* However, often
		1963	* ob doesn't have any move type (when used to place exits)
		1964	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1965	*/
		1966	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1967	{
2032	altern [index++] = i;	1968	altern [index++] = i;
		1969	continue;
		1970	}
2033		1971
2034	/* Basically, if we find a wall on a space, we cut down the search size.	1972	/* Basically, if we find a wall on a space, we cut down the search size.
2035	* In this way, we won't return spaces that are on another side of a wall.	1973	* In this way, we won't return spaces that are on another side of a wall.
2036	* This mostly work, but it cuts down the search size in all directions -	1974	* This mostly work, but it cuts down the search size in all directions -
2037	* if the space being examined only has a wall to the north and empty	1975	* if the space being examined only has a wall to the north and empty
2038	* spaces in all the other directions, this will reduce the search space	1976	* spaces in all the other directions, this will reduce the search space
2039	* to only the spaces immediately surrounding the target area, and	1977	* to only the spaces immediately surrounding the target area, and
2040	* won't look 2 spaces south of the target space.	1978	* won't look 2 spaces south of the target space.
2041	*/	1979	*/
2042	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1980	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1981	{
2043	stop = maxfree[i];	1982	stop = maxfree[i];
		1983	continue;
		1984	}
		1985
		1986	/* Note it is intentional that we check ob - the movement type of the
		1987	* head of the object should correspond for the entire object.
		1988	*/
		1989	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1990	continue;
		1991
		1992	if (ob->blocked (m, pos.x, pos.y))
		1993	continue;
		1994
		1995	altern [index++] = i;
2044	}	1996	}
2045		1997
2046	if (!index)	1998	if (!index)
2047	return -1;	1999	return -1;
2048		2000
…		…
2057	*/	2009	*/
2058	int	2010	int
2059	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2011	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2060	{	2012	{
2061	for (int i = 0; i < SIZEOFFREE; i++)	2013	for (int i = 0; i < SIZEOFFREE; i++)
2062	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2014	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2063	return i;	2015	return i;
2064		2016
2065	return -1;	2017	return -1;
2066	}	2018	}
2067		2019
…		…
2344	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2296	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2345	* core dumps if they do.	2297	* core dumps if they do.
2346	*	2298	*
2347	* Add a check so we can't pick up invisible objects (0.93.8)	2299	* Add a check so we can't pick up invisible objects (0.93.8)
2348	*/	2300	*/
2349
2350	int	2301	int
2351	can_pick (const object *who, const object *item)	2302	can_pick (const object *who, const object *item)
2352	{	2303	{
2353	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2304	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2354	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2305	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2569	}	2520	}
2570	else	2521	else
2571	item = item->env;	2522	item = item->env;
2572	}	2523	}
2573		2524
2574
2575	const char *	2525	const char *
2576	object::flag_desc (char *desc, int len) const	2526	object::flag_desc (char *desc, int len) const
2577	{	2527	{
2578	char *p = desc;	2528	char *p = desc;
2579	bool first = true;	2529	bool first = true;
…		…
2606	{	2556	{
2607	char flagdesc[512];	2557	char flagdesc[512];
2608	char info2[256 * 4];	2558	char info2[256 * 4];
2609	char *p = info;	2559	char *p = info;
2610		2560
2611	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2561	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2612	count, uuid.seq,	2562	count,
		2563	uuid.c_str (),
2613	&name,	2564	&name,
2614	title ? "\",title:\"" : "",	2565	title ? "\",title:\"" : "",
2615	title ? (const char *)title : "",	2566	title ? (const char *)title : "",
2616	flag_desc (flagdesc, 512), type);	2567	flag_desc (flagdesc, 512), type);
2617		2568
2618	if (env)	2569	if (!flag[FLAG_REMOVED] && env)
2619	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2570	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2620		2571
2621	if (map)	2572	if (map)
2622	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2573	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2623		2574
…		…
2641	}	2592	}
2642		2593
2643	const materialtype_t *	2594	const materialtype_t *
2644	object::dominant_material () const	2595	object::dominant_material () const
2645	{	2596	{
2646	if (materialtype_t *mat = name_to_material (materialname))	2597	if (materialtype_t *mt = name_to_material (materialname))
2647	return mat;	2598	return mt;
2648		2599
2649	// omfg this is slow, this has to be temporary :)
2650	shstr unknown ("unknown");
2651
2652	return name_to_material (unknown);	2600	return name_to_material (shstr_unknown);
2653	}	2601	}
2654		2602
2655	void	2603	void
2656	object::open_container (object *new_container)	2604	object::open_container (object *new_container)
2657	{	2605	{
…		…
2668	if (object *closer = old_container->inv)	2616	if (object *closer = old_container->inv)
2669	if (closer->type == CLOSE_CON)	2617	if (closer->type == CLOSE_CON)
2670	closer->destroy ();	2618	closer->destroy ();
2671	#endif	2619	#endif
2672		2620
2673	old_container->flag [FLAG_APPLIED] = 0;	2621	old_container->flag [FLAG_APPLIED] = false;
2674	container = 0;	2622	container = 0;
2675		2623
2676	esrv_update_item (UPD_FLAGS, this, old_container);	2624	esrv_update_item (UPD_FLAGS, this, old_container);
2677	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2625	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2626	play_sound (sound_find ("chest_close"));
2678	}	2627	}
2679		2628
2680	if (new_container)	2629	if (new_container)
2681	{	2630	{
2682	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))	2631	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
…		…
2693	}	2642	}
2694	#endif	2643	#endif
2695		2644
2696	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2645	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2697		2646
2698	new_container->flag [FLAG_APPLIED] = 1;	2647	new_container->flag [FLAG_APPLIED] = true;
2699	container = new_container;	2648	container = new_container;
2700		2649
2701	esrv_update_item (UPD_FLAGS, this, new_container);	2650	esrv_update_item (UPD_FLAGS, this, new_container);
2702	esrv_send_inventory (this, new_container);	2651	esrv_send_inventory (this, new_container);
		2652	play_sound (sound_find ("chest_open"));
		2653	}
		2654	}
		2655
		2656	object *
		2657	object::force_find (const shstr name)
		2658	{
		2659	/* cycle through his inventory to look for the MARK we want to
		2660	* place
		2661	*/
		2662	for (object *tmp = inv; tmp; tmp = tmp->below)
		2663	if (tmp->type == FORCE && tmp->slaying == name)
		2664	return splay (tmp);
		2665
		2666	return 0;
		2667	}
		2668
		2669	void
		2670	object::force_add (const shstr name, int duration)
		2671	{
		2672	if (object *force = force_find (name))
		2673	force->destroy ();
		2674
		2675	object *force = get_archetype (FORCE_NAME);
		2676
		2677	force->slaying = name;
		2678	force->stats.food = 1;
		2679	force->speed_left = -1.f;
		2680
		2681	force->set_speed (duration ? 1.f / duration : 0.f);
		2682	force->flag [FLAG_IS_USED_UP] = true;
		2683	force->flag [FLAG_APPLIED] = true;
		2684
		2685	insert (force);
		2686	}
		2687
		2688	void
		2689	object::play_sound (faceidx sound)
		2690	{
		2691	if (!sound)
		2692	return;
		2693
		2694	if (flag [FLAG_REMOVED])
		2695	return;
		2696
		2697	if (env)
2703	}	2698	{
		2699	if (object *pl = in_player ())
		2700	pl->contr->play_sound (sound);
		2701	}
		2702	else
		2703	map->play_sound (sound, x, y);
2704	}	2704	}
2705		2705
2706

Diff Legend

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