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.249 by root, Tue Jul 15 20:41:58 2008 UTC vs.
Revision 1.343 by root, Sat Apr 23 04:56:46 2011 UTC

1	/*	1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
7	*	7	*
8	* Deliantra is free software: you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation, either version 3 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* 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 Affero GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
20	*	21	*
21	* The authors can be reached via e-mail to <support@deliantra.net>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
23		24
24	#include <global.h>	25	#include <global.h>
25	#include <stdio.h>	26	#include <stdio.h>
26	#include <sys/types.h>	27	#include <sys/types.h>
27	#include <sys/uio.h>	28	#include <sys/uio.h>
28	#include <object.h>	29	#include <object.h>
29	#include <sproto.h>	30	#include <sproto.h>
30	#include <loader.h>
31		31
32	#include <bitset>	32	#include <bitset>
33		33
34	UUID UUID::cur;	34	UUID UUID::cur;
35	static uint64_t seq_next_save;	35	static uint64_t seq_next_save;
36	static const uint64 UUID_GAP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
		37	uint32_t mapspace::smellcount = 10000;
37		38
38	objectvec objects;	39	objectvec objects;
39	activevec actives;	40	activevec actives;
		41
		42	freelist_item *object::freelist;
		43	uint32_t object::object_count;
		44	uint32_t object::free_count;
		45	uint32_t object::create_count;
		46	uint32_t object::destroy_count;
		47
		48	//+GPL
40		49
41	short freearr_x[SIZEOFFREE] = {	50	short freearr_x[SIZEOFFREE] = {
42	0,	51	0,
43	0, 1, 1, 1, 0, -1, -1, -1,	52	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,	53	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
…		…
48	0,	57	0,
49	-1, -1, 0, 1, 1, 1, 0, -1,	58	-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,	59	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
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	60	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
52	};	61	};
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,
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
58	};
59	int freedir[SIZEOFFREE] = {	62	int freedir[SIZEOFFREE] = {
60	0,	63	0,
61	1, 2, 3, 4, 5, 6, 7, 8,	64	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,	65	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 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	66	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
64	};	67	};
65		68
		69	static int maxfree[SIZEOFFREE] = {
		70	0,
		71	9, 10, 13, 14, 17, 18, 21, 22,
		72	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
		73	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
		74	};
		75
		76	const char *wall_suffix[16] = {
		77	"0",
		78	"1_3",
		79	"1_4",
		80	"2_1_2",
		81	"1_2",
		82	"2_2_4",
		83	"2_2_1",
		84	"3_1",
		85	"1_1",
		86	"2_2_3",
		87	"2_2_2",
		88	"3_3",
		89	"2_1_1",
		90	"3_4",
		91	"3_2",
		92	"4"
		93	};
		94
66	static void	95	static void
67	write_uuid (uval64 skip, bool sync)	96	write_uuid (uval64 skip, bool sync)
68	{	97	{
69	CALL_BEGIN (2);	98	CALL_BEGIN (2);
70	CALL_ARG_SV (newSVval64 (skip));	99	CALL_ARG_SV (newSVval64 (skip));
…		…
72	CALL_CALL ("cf::write_uuid", G_DISCARD);	101	CALL_CALL ("cf::write_uuid", G_DISCARD);
73	CALL_END;	102	CALL_END;
74	}	103	}
75		104
76	static void	105	static void
77	read_uuid (void)	106	read_uuid ()
78	{	107	{
79	char filename[MAX_BUF];	108	char filename[MAX_BUF];
80		109
81	sprintf (filename, "%s/uuid", settings.localdir);	110	sprintf (filename, "%s/uuid", settings.localdir);
82		111
…		…
96		125
97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	126	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
98	_exit (1);	127	_exit (1);
99	}	128	}
100		129
101	UUID::BUF buf;	130	char buf [UUID::MAX_LEN];
102	buf[0] = 0;	131	buf[0] = 0;
103	fgets (buf, sizeof (buf), fp);	132	fgets (buf, sizeof (buf), fp);
104		133
105	if (!UUID::cur.parse (buf))	134	if (!UUID::cur.parse (buf))
106	{	135	{
…		…
133		162
134	void	163	void
135	UUID::init ()	164	UUID::init ()
136	{	165	{
137	read_uuid ();	166	read_uuid ();
		167	}
		168
		169	bool
		170	UUID::parse (const char *s)
		171	{
		172	if (*s++ != '<' || *s++ != '1' || *s++ != '.')
		173	return false;
		174
		175	seq = 0;
		176
		177	while (*s != '>')
		178	{
		179	if (*s < '0')
		180	return false;
		181
		182	// this gives nice branchless code with gcc
		183	assert ('0' < 'a' && '0' == 48 && 'a' == 97);
		184	int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
		185
		186	seq = (seq << 4) | digit;
		187
		188	++s;
		189	}
		190
		191	return true;
		192	}
		193
		194	char *
		195	UUID::append (char *buf) const
		196	{
		197	*buf++ = '<';
		198	*buf++ = '1';
		199	*buf++ = '.';
		200
		201	uint64_t seq = this->seq;
		202	const int bits = 64;
		203	char nz = 0;
		204	static const char tohex [] = "0123456789abcdef";
		205
		206	// assert (len >= 3 + bits / 4 + 1 + 1);
		207	for (int i = bits / 4; --i; )
		208	{
		209	uint8_t digit = seq >> (bits - 4);
		210
		211	*buf = tohex [digit];
		212	nz |= digit;
		213	buf += nz ? 1 : 0;
		214	seq <<= 4;
		215	}
		216
		217	// last digit is special - always emit
		218	uint8_t digit = seq >> (bits - 4);
		219	*buf++ = tohex [digit];
		220
		221	*buf++ = '>';
		222
		223	return buf;
		224	}
		225
		226	char *
		227	UUID::c_str () const
		228	{
		229	static char buf [MAX_LEN];
		230	*append (buf) = 0;
		231	return buf;
138	}	232	}
139		233
140	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	234	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
141	static bool	235	static bool
142	compare_ob_value_lists_one (const object *wants, const object *has)	236	compare_ob_value_lists_one (const object *wants, const object *has)
…		…
178	* Improvements made with merge: Better checking on potion, and also	272	* Improvements made with merge: Better checking on potion, and also
179	* check weight	273	* check weight
180	*/	274	*/
181	bool object::can_merge_slow (object *ob1, object *ob2)	275	bool object::can_merge_slow (object *ob1, object *ob2)
182	{	276	{
183	/* A couple quicksanity checks */	277	/* A couple quick sanity checks */
184	if (ob1 == ob2	278	if (ob1 == ob2
185	|| ob1->type != ob2->type	279	|| ob1->type != ob2->type
186	|| ob1->speed != ob2->speed
187	|| ob1->value != ob2->value	280	|| ob1->value != ob2->value
188	|| ob1->name != ob2->name)	281	|| ob1->name != ob2->name
		282	|| ob1->custom_name != ob2->custom_name
		283	|| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
189	return 0;	284	return 0;
190		285
191	/* Do not merge objects if nrof would overflow. First part checks	286	/* Do not merge objects if nrof would overflow, assume nrof
192	* for unsigned overflow (2c), second part checks whether the result	287	* is always 0 .. 2**31-1 */
193	* would fit into a 32 bit signed int, which is often used to hold	288	if (ob1->nrof > 0x7fffffff - ob2->nrof)
194	* nrof values.
195	*/
196	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
197	return 0;	289	return 0;
198		290
199	/* If the objects have been identified, set the BEEN_APPLIED flag.	291	/* If the objects have been identified, set the BEEN_APPLIED flag.
200	* This is to the comparison of the flags below will be OK. We	292	* This is to the comparison of the flags below will be OK. We
201	* just can't ignore the been applied or identified flags, as they	293	* just can't ignore the been applied or identified flags, as they
202	* are not equal - just if it has been identified, the been_applied	294	* are not equal - just if it has been identified, the been_applied
203	* flags lose any meaning.	295	* flags lose any meaning.
204	*/	296	*/
205	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	297	if (ob1->flag [FLAG_IDENTIFIED])
206	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	298	ob1->set_flag (FLAG_BEEN_APPLIED);
207		299
208	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	300	if (ob2->flag [FLAG_IDENTIFIED])
209	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	301	ob2->set_flag (FLAG_BEEN_APPLIED);
210		302
211	if (ob1->arch->archname != ob2->arch->archname	303	if (ob1->arch->archname != ob2->arch->archname
212	|| ob1->name != ob2->name	304	|| ob1->name != ob2->name
213	|| ob1->title != ob2->title	305	|| ob1->title != ob2->title
214	|| ob1->msg != ob2->msg	306	|| ob1->msg != ob2->msg
…		…
217	|| ob1->magic != ob2->magic	309	|| ob1->magic != ob2->magic
218	|| ob1->slaying != ob2->slaying	310	|| ob1->slaying != ob2->slaying
219	|| ob1->skill != ob2->skill	311	|| ob1->skill != ob2->skill
220	|| ob1->value != ob2->value	312	|| ob1->value != ob2->value
221	|| ob1->animation_id != ob2->animation_id	313	|| ob1->animation_id != ob2->animation_id
222	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other	314	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
223	|| ob1->client_type != ob2->client_type	315	|| ob1->client_type != ob2->client_type
224	|| ob1->materialname != ob2->materialname	316	|| ob1->material != ob2->material
225	|| ob1->lore != ob2->lore	317	|| ob1->lore != ob2->lore
226	|| ob1->subtype != ob2->subtype	318	|| ob1->subtype != ob2->subtype
227	|| ob1->move_type != ob2->move_type	319	|| ob1->move_type != ob2->move_type
228	|| ob1->move_block != ob2->move_block	320	|| ob1->move_block != ob2->move_block
229	|| ob1->move_allow != ob2->move_allow	321	|| ob1->move_allow != ob2->move_allow
230	|| ob1->move_on != ob2->move_on	322	|| ob1->move_on != ob2->move_on
231	|| ob1->move_off != ob2->move_off	323	|| ob1->move_off != ob2->move_off
232	|| ob1->move_slow != ob2->move_slow	324	|| ob1->move_slow != ob2->move_slow
233	|| ob1->move_slow_penalty != ob2->move_slow_penalty	325	|| fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
234	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))	326	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
235	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	327	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
236	return 0;	328	return 0;
237		329
238	if ((ob1->flag ^ ob2->flag)	330	if ((ob1->flag ^ ob2->flag)
239	.reset (FLAG_INV_LOCKED)	331	.reset (FLAG_INV_LOCKED)
240	.reset (FLAG_CLIENT_SENT)
241	.reset (FLAG_REMOVED)	332	.reset (FLAG_REMOVED)
242	.any ())	333	.any ())
243	return 0;	334	return 0;
244		335
245	/* This is really a spellbook check - we should in general	336	/* This is really a spellbook check - we should in general
…		…
264		355
265	/* Don't merge objects that are applied. With the new 'body' code,	356	/* Don't merge objects that are applied. With the new 'body' code,
266	* it is possible for most any character to have more than one of	357	* it is possible for most any character to have more than one of
267	* some items equipped, and we don't want those to merge.	358	* some items equipped, and we don't want those to merge.
268	*/	359	*/
269	if (QUERY_FLAG (ob1, FLAG_APPLIED) || QUERY_FLAG (ob2, FLAG_APPLIED))	360	if (ob1->flag [FLAG_APPLIED] || ob2->flag [FLAG_APPLIED])
270	return 0;	361	return 0;
271		362
272	/* Note sure why the following is the case - either the object has to	363	/* Note sure why the following is the case - either the object has to
273	* be animated or have a very low speed. Is this an attempted monster	364	* be animated or have a very low speed. Is this an attempted monster
274	* check?	365	* check?
275	*/	366	*/
276	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())	367	if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ())
277	return 0;	368	return 0;
278		369
279	switch (ob1->type)	370	switch (ob1->type)
280	{	371	{
281	case SCROLL:	372	case SCROLL:
…		…
327	{	418	{
328	// see if we are in a container of sorts	419	// see if we are in a container of sorts
329	if (env)	420	if (env)
330	{	421	{
331	// the player inventory itself is always visible	422	// the player inventory itself is always visible
332	if (env->type == PLAYER)	423	if (env->is_player ())
333	return env;	424	return env;
334		425
335	// else a player could have our env open	426	// else a player could have our env open
336	object *envest = env->outer_env ();	427	object *envest = env->outer_env_or_self ();
337		428
338	// the player itself is always on a map, so we will find him here	429	// the player itself is always on a map, so we will find him here
339	// even if our inv is in a player.	430	// even if our inv is in a player.
340	if (envest->is_on_map ())	431	if (envest->is_on_map ())
341	if (object *pl = envest->ms ().player ())	432	if (object *pl = envest->ms ().player ())
342	if (pl->container == env)	433	if (pl->container_ () == env)
343	return pl;	434	return pl;
344	}	435	}
345	else	436	else
346	{	437	{
347	// maybe there is a player standing on the same mapspace	438	// maybe there is a player standing on the same mapspace
348	// this will catch the case where "this" is a player	439	// this will catch the case where "this" is a player
349	if (object *pl = ms ().player ())	440	if (object *pl = ms ().player ())
350	if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look)	441	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
351	|| this == pl->container)	442	|| pl->container_ () == this)
352	return pl;	443	return pl;
353	}	444	}
354	}	445	}
355		446
356	return 0;	447	return 0;
357	}	448	}
358		449
359	// adjust weight per container type ("of holding")	450	// adjust weight per container type ("of holding")
360	static sint32	451	static uint32
361	weight_adjust_for (object *op, sint32 weight)	452	weight_adjust_for (object *op, uint32 weight)
362	{	453	{
363	return op->type == CONTAINER	454	return op->type == CONTAINER
364	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	455	? weight - weight * op->stats.Str / 100
365	: weight;	456	: weight;
366	}	457	}
367		458
368	/*	459	/*
369	* adjust_weight(object, weight) adds the specified weight to an object,	460	* subtracts, then adds, the specified weight to an object,
370	* and also updates how much the environment(s) is/are carrying.	461	* and also updates how much the environment(s) is/are carrying.
371	*/	462	*/
372	static void	463	static void
373	adjust_weight (object *op, sint32 weight)	464	adjust_weight (object *op, sint32 sub, sint32 add)
374	{	465	{
375	while (op)	466	while (op)
376	{	467	{
377	// adjust by actual difference to account for rounding errors	468	sint32 ocarrying = op->carrying;
378	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
379	weight = weight_adjust_for (op, op->carrying)
380	- weight_adjust_for (op, op->carrying - weight);
381		469
382	if (!weight)	470	op->carrying -= weight_adjust_for (op, sub);
383	return;	471	op->carrying += weight_adjust_for (op, add);
384
385	op->carrying += weight;
386		472
387	if (object *pl = op->visible_to ())	473	if (object *pl = op->visible_to ())
388	if (pl != op) // player is handled lazily	474	if (pl != op) // player is handled lazily
389	esrv_update_item (UPD_WEIGHT, pl, op);	475	esrv_update_item (UPD_WEIGHT, pl, op);
390		476
		477	sub = ocarrying;
		478	add = op->carrying;
		479
391	op = op->env;	480	op = op->env;
392	}	481	}
393	}	482	}
394		483
395	/*	484	/*
…		…
402	{	491	{
403	sint32 sum = 0;	492	sint32 sum = 0;
404		493
405	for (object *op = inv; op; op = op->below)	494	for (object *op = inv; op; op = op->below)
406	{	495	{
407	if (op->inv)
408	op->update_weight ();	496	op->update_weight ();
409		497
410	sum += op->total_weight ();	498	sum += weight_adjust_for (this, op->total_weight ());
411	}	499	}
412
413	sum = weight_adjust_for (this, sum);
414		500
415	if (sum != carrying)	501	if (sum != carrying)
416	{	502	{
		503	if (carrying != sum && carrying)//D
		504	LOG (llevDebug, "updating carrying got %ld, expected %ld (%s)\n",
		505	(long long)sum, (long long)carrying, debug_desc ());
		506
417	carrying = sum;	507	carrying = sum;
418		508
419	if (object *pl = visible_to ())	509	if (object *pl = visible_to ())
420	if (pl != this) // player is handled lazily	510	if (pl != this) // player is handled lazily
421	esrv_update_item (UPD_WEIGHT, pl, this);	511	esrv_update_item (UPD_WEIGHT, pl, this);
…		…
434	object_freezer freezer;	524	object_freezer freezer;
435	op->write (freezer);	525	op->write (freezer);
436	return freezer.as_string ();	526	return freezer.as_string ();
437	}	527	}
438		528
439	/*	529	char *
440	* get_nearest_part(multi-object, object 2) returns the part of the	530	object::as_string ()
441	* multi-object 1 which is closest to the second object.
442	* If it's not a multi-object, it is returned.
443	*/
444	object *
445	get_nearest_part (object *op, const object *pl)
446	{	531	{
447	object *tmp, *closest;	532	return dump_object (this);
448	int last_dist, i;
449
450	if (!op->more)
451	return op;
452
453	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
454	tmp;
455	tmp = tmp->more)
456	if ((i = distance (tmp, pl)) < last_dist)
457	closest = tmp, last_dist = i;
458
459	return closest;
460	}	533	}
461		534
462	/*	535	/*
463	* Returns the object which has the count-variable equal to the argument.	536	* Returns the object which has the count-variable equal to the argument.
464	* VERRRY slow.	537	* VERRRY slow.
…		…
466	object *	539	object *
467	find_object (tag_t i)	540	find_object (tag_t i)
468	{	541	{
469	for_all_objects (op)	542	for_all_objects (op)
470	if (op->count == i)	543	if (op->count == i)
		544	return op;
		545
		546	return 0;
		547	}
		548
		549	/*
		550	* Returns the object which has the uuid equal to the argument.
		551	* MOAR VERRRY slow.
		552	*/
		553
		554	object *
		555	find_object_uuid (UUID i)
		556	{
		557	for_all_objects (op)
		558	if (op->uuid == i)
471	return op;	559	return op;
472		560
473	return 0;	561	return 0;
474	}	562	}
475		563
…		…
509	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());	597	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
510	return;	598	return;
511	}	599	}
512		600
513	this->owner = owner;	601	this->owner = owner;
514	}
515
516	int
517	object::slottype () const
518	{
519	if (type == SKILL)
520	{
521	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
522	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
523	}
524	else
525	{
526	if (slot [body_combat].info) return slot_combat;
527	if (slot [body_range ].info) return slot_ranged;
528	}
529
530	return slot_none;
531	}
532
533	bool
534	object::change_weapon (object *ob)
535	{
536	if (current_weapon == ob)
537	return true;
538
539	if (chosen_skill)
540	chosen_skill->flag [FLAG_APPLIED] = false;
541
542	current_weapon = ob;
543	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
544
545	if (chosen_skill)
546	chosen_skill->flag [FLAG_APPLIED] = true;
547
548	update_stats ();
549
550	if (ob)
551	{
552	// now check wether any body locations became invalid, in which case
553	// we cannot apply the weapon at the moment.
554	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
555	if (slot[i].used < 0)
556	{
557	current_weapon = chosen_skill = 0;
558	update_stats ();
559
560	new_draw_info_format (NDI_UNIQUE, 0, this,
561	"You try to balance all your items at once, "
562	"but the %s is just too much for your body. "
563	"[You need to unapply some items first.]", &ob->name);
564	return false;
565	}
566
567	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
568	}
569	else
570	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
571
572	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
573	{
574	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
575	&name, ob->debug_desc ());
576	return false;
577	}
578
579	return true;
580	}	602	}
581		603
582	/* Zero the key_values on op, decrementing the shared-string	604	/* Zero the key_values on op, decrementing the shared-string
583	* refcounts and freeing the links.	605	* refcounts and freeing the links.
584	*/	606	*/
…		…
637	tail = new_link;	659	tail = new_link;
638	}	660	}
639	}	661	}
640	}	662	}
641		663
642	if (speed < 0)	664	dst->activate ();
643	dst->speed_left -= rndm ();
644
645	dst->set_speed (dst->speed);
646	}	665	}
647		666
648	void	667	void
649	object::instantiate ()	668	object::instantiate ()
650	{	669	{
651	if (!uuid.seq) // HACK	670	if (!uuid.seq) // HACK
652	uuid = UUID::gen ();	671	uuid = UUID::gen ();
653		672
		673	// TODO: unclean state changes, should not be done in copy_to AND instantiate
		674	if (flag [FLAG_RANDOM_SPEED] && speed)
		675	speed_left = - speed - rndm (); // TODO animation
		676	else
654	speed_left = -0.1f;	677	speed_left = -1.;
		678
655	/* copy the body_info to the body_used - this is only really	679	/* copy the body_info to the body_used - this is only really
656	* need for monsters, but doesn't hurt to do it for everything.	680	* need for monsters, but doesn't hurt to do it for everything.
657	* by doing so, when a monster is created, it has good starting	681	* by doing so, when a monster is created, it has good starting
658	* values for the body_used info, so when items are created	682	* values for the body_used info, so when items are created
659	* for it, they can be properly equipped.	683	* for it, they can be properly equipped.
…		…
667	object *	691	object *
668	object::clone ()	692	object::clone ()
669	{	693	{
670	object *neu = create ();	694	object *neu = create ();
671	copy_to (neu);	695	copy_to (neu);
		696
		697	// TODO: unclean state changes, should not be done in clone AND instantiate
		698	if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
		699	neu->speed_left = - neu->speed - rndm (); // TODO animation
		700
672	neu->map = map; // not copied by copy_to	701	neu->map = map; // not copied by copy_to
673	return neu;	702	return neu;
674	}	703	}
675		704
676	/*	705	/*
…		…
679	* be called to update the face variable, _and_ how it looks on the map.	708	* be called to update the face variable, _and_ how it looks on the map.
680	*/	709	*/
681	void	710	void
682	update_turn_face (object *op)	711	update_turn_face (object *op)
683	{	712	{
684	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)	713	if (!op->flag [FLAG_IS_TURNABLE] || !op->arch)
685	return;	714	return;
686		715
687	SET_ANIMATION (op, op->direction);	716	SET_ANIMATION (op, op->direction);
688	update_object (op, UP_OBJ_FACE);	717	update_object (op, UP_OBJ_FACE);
689	}	718	}
…		…
694	* This function needs to be called whenever the speed of an object changes.	723	* This function needs to be called whenever the speed of an object changes.
695	*/	724	*/
696	void	725	void
697	object::set_speed (float speed)	726	object::set_speed (float speed)
698	{	727	{
699	if (flag [FLAG_FREED] && speed)
700	{
701	LOG (llevError, "Object %s is freed but has speed.\n", &name);
702	speed = 0;
703	}
704
705	this->speed = speed;	728	this->speed = speed;
706		729
707	if (has_active_speed ())	730	if (has_active_speed ())
708	activate ();	731	activate ();
709	else	732	else
…		…
759		782
760	if (!(m.flags_ & P_UPTODATE))	783	if (!(m.flags_ & P_UPTODATE))
761	/* nop */;	784	/* nop */;
762	else if (action == UP_OBJ_INSERT)	785	else if (action == UP_OBJ_INSERT)
763	{	786	{
		787	#if 0
764	// this is likely overkill, TODO: revisit (schmorp)	788	// this is likely overkill, TODO: revisit (schmorp)
765	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	789	if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW))
766	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	790	|| (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC))
767	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	791	|| (op->is_player () && !(m.flags_ & P_PLAYER))
768	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	792	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
769	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	793	|| (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE))
770	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	794	|| (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC))
771	|| (m.move_on | op->move_on ) != m.move_on	795	|| (m.move_on | op->move_on ) != m.move_on
772	|| (m.move_off | op->move_off ) != m.move_off	796	|| (m.move_off | op->move_off ) != m.move_off
773	|| (m.move_slow | op->move_slow) != m.move_slow	797	|| (m.move_slow | op->move_slow) != m.move_slow
774	/* This isn't perfect, but I don't expect a lot of objects to	798	/* This isn't perfect, but I don't expect a lot of objects to
775	* to have move_allow right now.	799	* have move_allow right now.
776	*/	800	*/
777	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	801	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
		802	m.invalidate ();
		803	#else
778	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	804	// the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
779	m.flags_ = 0;	805	m.invalidate ();
		806	#endif
780	}	807	}
781	/* if the object is being removed, we can't make intelligent	808	/* if the object is being removed, we can't make intelligent
782	* decisions, because remove_ob can't really pass the object	809	* decisions, because remove_ob can't really pass the object
783	* that is being removed.	810	* that is being removed.
784	*/	811	*/
785	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	812	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
786	m.flags_ = 0;	813	m.invalidate ();
787	else if (action == UP_OBJ_FACE)	814	else if (action == UP_OBJ_FACE)
788	/* Nothing to do for that case */ ;	815	/* Nothing to do for that case */ ;
789	else	816	else
790	LOG (llevError, "update_object called with invalid action: %d\n", action);	817	LOG (llevError, "update_object called with invalid action: %d\n", action);
791		818
…		…
793	update_object (op->more, action);	820	update_object (op->more, action);
794	}	821	}
795		822
796	object::object ()	823	object::object ()
797	{	824	{
798	SET_FLAG (this, FLAG_REMOVED);	825	this->set_flag (FLAG_REMOVED);
799		826
800	expmul = 1.0;	827	//expmul = 1.0; declared const for the time being
801	face = blank_face;	828	face = blank_face;
		829	material = MATERIAL_NULL;
802	}	830	}
803		831
804	object::~object ()	832	object::~object ()
805	{	833	{
806	unlink ();	834	unlink ();
807		835
808	free_key_values (this);	836	free_key_values (this);
809	}	837	}
810
811	static int object_count;
812		838
813	void object::link ()	839	void object::link ()
814	{	840	{
815	assert (!index);//D	841	assert (!index);//D
816	uuid = UUID::gen ();	842	uuid = UUID::gen ();
817	count = ++object_count;
818		843
819	refcnt_inc ();	844	refcnt_inc ();
820	objects.insert (this);	845	objects.insert (this);
		846
		847	++create_count;
		848
821	}	849	}
822		850
823	void object::unlink ()	851	void object::unlink ()
824	{	852	{
825	if (!index)	853	if (!index)
826	return;	854	return;
		855
		856	++destroy_count;
827		857
828	objects.erase (this);	858	objects.erase (this);
829	refcnt_dec ();	859	refcnt_dec ();
830	}	860	}
831		861
…		…
835	/* If already on active list, don't do anything */	865	/* If already on active list, don't do anything */
836	if (active)	866	if (active)
837	return;	867	return;
838		868
839	if (has_active_speed ())	869	if (has_active_speed ())
		870	{
		871	if (flag [FLAG_FREED])
		872	LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		873
840	actives.insert (this);	874	actives.insert (this);
		875	}
841	}	876	}
842		877
843	void	878	void
844	object::activate_recursive ()	879	object::activate_recursive ()
845	{	880	{
…		…
910	|| map->in_memory != MAP_ACTIVE	945	|| map->in_memory != MAP_ACTIVE
911	|| map->no_drop	946	|| map->no_drop
912	|| ms ().move_block == MOVE_ALL)	947	|| ms ().move_block == MOVE_ALL)
913	{	948	{
914	while (inv)	949	while (inv)
915	{
916	inv->destroy_inv (false);
917	inv->destroy ();	950	inv->destroy ();
918	}
919	}	951	}
920	else	952	else
921	{ /* Put objects in inventory onto this space */	953	{ /* Put objects in inventory onto this space */
922	while (inv)	954	while (inv)
923	{	955	{
…		…
927	|| op->flag [FLAG_NO_DROP]	959	|| op->flag [FLAG_NO_DROP]
928	|| op->type == RUNE	960	|| op->type == RUNE
929	|| op->type == TRAP	961	|| op->type == TRAP
930	|| op->flag [FLAG_IS_A_TEMPLATE]	962	|| op->flag [FLAG_IS_A_TEMPLATE]
931	|| op->flag [FLAG_DESTROY_ON_DEATH])	963	|| op->flag [FLAG_DESTROY_ON_DEATH])
932	op->destroy (true);	964	op->destroy ();
933	else	965	else
934	map->insert (op, x, y);	966	map->insert (op, x, y);
935	}	967	}
936	}	968	}
937	}	969	}
938		970
		971	/*
		972	* Remove and free all objects in the inventory of the given object.
		973	* Unlike destroy_inv, this assumes the *this is destroyed as well
		974	* well, so we can (and have to!) take shortcuts.
		975	*/
		976	void
		977	object::destroy_inv_fast ()
		978	{
		979	while (object *op = inv)
		980	{
		981	// remove from object the fast way
		982	op->flag [FLAG_REMOVED] = true;
		983	op->env = 0;
		984	if ((inv = inv->below))
		985	inv->above = 0;
		986
		987	// then destroy
		988	op->destroy ();
		989	}
		990	}
		991
		992	void
		993	object::freelist_free (int count)
		994	{
		995	while (count-- && freelist)
		996	{
		997	freelist_item *next = freelist->next;
		998	// count is being "destroyed"
		999
		1000	sfree ((char *)freelist, sizeof (object));
		1001
		1002	freelist = next;
		1003	--free_count;
		1004	}
		1005	}
		1006
		1007	object *
939	object *object::create ()	1008	object::create ()
940	{	1009	{
941	object *op = new object;	1010	object *op;
		1011
		1012	if (freelist)
		1013	{
		1014	freelist_item li = *freelist;
		1015	memset (freelist, 0, sizeof (object));
		1016
		1017	op = new (freelist) object;
		1018	op->count = li.count;
		1019
		1020	freelist = li.next;
		1021	--free_count;
		1022	}
		1023	else
		1024	{
		1025	void *ni = salloc0<char> (sizeof (object));
		1026
		1027	op = new(ni) object;
		1028
		1029	op->count = ++object_count;
		1030	}
		1031
942	op->link ();	1032	op->link ();
		1033
943	return op;	1034	return op;
944	}	1035	}
945		1036
		1037	void
		1038	object::do_delete ()
		1039	{
		1040	uint32_t count = this->count;
		1041
		1042	this->~object ();
		1043
		1044	freelist_item *li = (freelist_item *)this;
		1045	li->next = freelist;
		1046	li->count = count;
		1047
		1048	freelist = li;
		1049	++free_count;
		1050	}
		1051
946	static struct freed_map : maptile	1052	static struct freed_map : maptile
947	{	1053	{
948	freed_map ()	1054	freed_map ()
		1055	: maptile (3, 3)
949	{	1056	{
950	path = "<freed objects map>";	1057	path = "<freed objects map>";
951	name = "/internal/freed_objects_map";	1058	name = "/internal/freed_objects_map";
952	width = 3;
953	height = 3;
954	no_drop = 1;	1059	no_drop = 1;
955	no_reset = 1;	1060	no_reset = 1;
956		1061
957	alloc ();
958	in_memory = MAP_ACTIVE;	1062	in_memory = MAP_ACTIVE;
959	}	1063	}
960		1064
961	~freed_map ()	1065	~freed_map ()
962	{	1066	{
…		…
966		1070
967	void	1071	void
968	object::do_destroy ()	1072	object::do_destroy ()
969	{	1073	{
970	if (flag [FLAG_IS_LINKED])	1074	if (flag [FLAG_IS_LINKED])
971	remove_button_link (this);	1075	remove_link ();
972		1076
973	if (flag [FLAG_FRIENDLY])	1077	if (flag [FLAG_FRIENDLY])
974	remove_friendly_object (this);	1078	remove_friendly_object (this);
975		1079
976	remove ();	1080	remove ();
…		…
1001	attacked_by = 0;	1105	attacked_by = 0;
1002	current_weapon = 0;	1106	current_weapon = 0;
1003	}	1107	}
1004		1108
1005	void	1109	void
1006	object::destroy (bool destroy_inventory)	1110	object::destroy ()
1007	{	1111	{
1008	if (destroyed ())	1112	if (destroyed ())
1009	return;	1113	return;
1010		1114
1011	if (!is_head () && !head->destroyed ())	1115	if (!is_head () && !head->destroyed ())
1012	{	1116	{
1013	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");	1117	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1014	head->destroy (destroy_inventory);	1118	head->destroy ();
1015	return;	1119	return;
1016	}	1120	}
1017		1121
1018	destroy_inv (!destroy_inventory);	1122	destroy_inv_fast ();
1019		1123
1020	if (is_head ())	1124	if (is_head ())
1021	if (sound_destroy)	1125	if (sound_destroy)
1022	play_sound (sound_destroy);	1126	play_sound (sound_destroy);
1023	else if (flag [FLAG_MONSTER])	1127	else if (flag [FLAG_MONSTER])
…		…
1034	* the previous environment.	1138	* the previous environment.
1035	*/	1139	*/
1036	void	1140	void
1037	object::do_remove ()	1141	object::do_remove ()
1038	{	1142	{
1039	object *tmp, *last = 0;
1040	object *otmp;
1041
1042	if (flag [FLAG_REMOVED])	1143	if (flag [FLAG_REMOVED])
1043	return;	1144	return;
1044		1145
1045	INVOKE_OBJECT (REMOVE, this);	1146	INVOKE_OBJECT (REMOVE, this);
1046		1147
…		…
1058	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed	1159	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1059	if (object *pl = visible_to ())	1160	if (object *pl = visible_to ())
1060	esrv_del_item (pl->contr, count);	1161	esrv_del_item (pl->contr, count);
1061	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1162	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1062		1163
1063	adjust_weight (env, -total_weight ());	1164	adjust_weight (env, total_weight (), 0);
		1165
		1166	object *pl = in_player ();
1064		1167
1065	/* we set up values so that it could be inserted into	1168	/* we set up values so that it could be inserted into
1066	* the map, but we don't actually do that - it is up	1169	* the map, but we don't actually do that - it is up
1067	* to the caller to decide what we want to do.	1170	* to the caller to decide what we want to do.
1068	*/	1171	*/
…		…
1076		1179
1077	above = 0;	1180	above = 0;
1078	below = 0;	1181	below = 0;
1079	env = 0;	1182	env = 0;
1080		1183
1081	/* NO_FIX_PLAYER is set when a great many changes are being	1184	if (pl && pl->is_player ())
1082	* made to players inventory. If set, avoiding the call
1083	* to save cpu time.
1084	*/	1185	{
1085	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1186	if (expect_false (pl->contr->combat_ob == this))
1086	otmp->update_stats ();	1187	{
		1188	pl->apply (pl->contr->combat_ob, AP_UNAPPLY | AP_IGNORE_CURSE);
		1189	pl->contr->combat_ob = 0;
		1190	if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);
		1191	}
		1192
		1193	if (expect_false (pl->contr->ranged_ob == this))
		1194	{
		1195	pl->apply (pl->contr->ranged_ob, AP_UNAPPLY | AP_IGNORE_CURSE);
		1196	pl->contr->ranged_ob = 0;
		1197	if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);
		1198	}
		1199
		1200	pl->contr->queue_stats_update ();
		1201
		1202	if (expect_false (glow_radius) && pl->is_on_map ())
		1203	update_all_los (pl->map, pl->x, pl->y);
		1204	}
1087	}	1205	}
1088	else if (map)	1206	else if (map)
1089	{	1207	{
1090	map->dirty = true;	1208	map->dirty = true;
1091	mapspace &ms = this->ms ();	1209	mapspace &ms = this->ms ();
1092		1210
1093	if (object *pl = ms.player ())	1211	if (object *pl = ms.player ())
1094	{	1212	{
1095	if (type == PLAYER) // this == pl(!)	1213	if (is_player ())
1096	{	1214	{
		1215	if (!flag [FLAG_WIZPASS])
		1216	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1217
1097	// leaving a spot always closes any open container on the ground	1218	// leaving a spot always closes any open container on the ground
1098	if (container && !container->env)	1219	if (container && !container->env)
1099	// this causes spurious floorbox updates, but it ensures	1220	// this causes spurious floorbox updates, but it ensures
1100	// that the CLOSE event is being sent.	1221	// that the CLOSE event is being sent.
1101	close_container ();	1222	close_container ();
1102		1223
1103	--map->players;	1224	--map->players;
1104	map->touch ();	1225	map->touch ();
1105	}	1226	}
1106	else if (pl->container == this)	1227	else if (pl->container_ () == this)
1107	{	1228	{
1108	// removing a container should close it	1229	// removing a container should close it
1109	close_container ();	1230	close_container ();
1110	}	1231	}
1111		1232	else
1112	esrv_del_item (pl->contr, count);	1233	esrv_del_item (pl->contr, count);
1113	}	1234	}
1114		1235
1115	/* link the object above us */	1236	/* link the object above us */
1116	// re-link, make sure compiler can easily use cmove	1237	// re-link, make sure compiler can easily use cmove
1117	*(above ? &above->below : &ms.top) = below;	1238	*(above ? &above->below : &ms.top) = below;
1118	*(below ? &below->above : &ms.bot) = above;	1239	*(below ? &below->above : &ms.bot) = above;
1119		1240
1120	above = 0;	1241	above = 0;
1121	below = 0;	1242	below = 0;
1122		1243
		1244	ms.invalidate ();
		1245
1123	if (map->in_memory == MAP_SAVING)	1246	if (map->in_memory == MAP_SAVING)
1124	return;	1247	return;
1125		1248
1126	int check_walk_off = !flag [FLAG_NO_APPLY];	1249	int check_walk_off = !flag [FLAG_NO_APPLY];
1127		1250
1128	if (object *pl = ms.player ())	1251	if (object *pl = ms.player ())
1129	{	1252	{
1130	if (pl->container == this)	1253	if (pl->container_ () == this)
1131	/* If a container that the player is currently using somehow gets	1254	/* If a container that the player is currently using somehow gets
1132	* removed (most likely destroyed), update the player view	1255	* removed (most likely destroyed), update the player view
1133	* appropriately.	1256	* appropriately.
1134	*/	1257	*/
1135	pl->close_container ();	1258	pl->close_container ();
…		…
1139	//TODO: update floorbox to preserve ordering	1262	//TODO: update floorbox to preserve ordering
1140	if (pl->contr->ns)	1263	if (pl->contr->ns)
1141	pl->contr->ns->floorbox_update ();	1264	pl->contr->ns->floorbox_update ();
1142	}	1265	}
1143		1266
		1267	if (check_walk_off)
1144	for (tmp = ms.bot; tmp; tmp = tmp->above)	1268	for (object *above, *tmp = ms.bot; tmp; tmp = above)
1145	{	1269	{
		1270	above = tmp->above;
		1271
1146	/* No point updating the players look faces if he is the object	1272	/* No point updating the players look faces if he is the object
1147	* being removed.	1273	* being removed.
1148	*/	1274	*/
1149		1275
1150	/* See if object moving off should effect something */	1276	/* See if object moving off should effect something */
1151	if (check_walk_off
1152	&& ((move_type & tmp->move_off)	1277	if ((move_type & tmp->move_off)
1153	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1278	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1154	{
1155	move_apply (tmp, this, 0);	1279	move_apply (tmp, this, 0);
1156
1157	if (destroyed ())
1158	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1159	}	1280	}
1160		1281
1161	last = tmp;	1282	if (affects_los ())
1162	}
1163
1164	/* last == NULL if there are no objects on this space */
1165	//TODO: this makes little sense, why only update the topmost object?
1166	if (!last)
1167	map->at (x, y).flags_ = 0;
1168	else
1169	update_object (last, UP_OBJ_REMOVE);
1170
1171	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1172	update_all_los (map, x, y);	1283	update_all_los (map, x, y);
1173	}	1284	}
1174	}	1285	}
1175		1286
1176	/*	1287	/*
…		…
1200	esrv_update_item (UPD_NROF, pl, top);	1311	esrv_update_item (UPD_NROF, pl, top);
1201		1312
1202	op->weight = 0; // cancel the addition above	1313	op->weight = 0; // cancel the addition above
1203	op->carrying = 0; // must be 0 already	1314	op->carrying = 0; // must be 0 already
1204		1315
1205	op->destroy (1);	1316	op->destroy ();
1206		1317
1207	return top;	1318	return top;
1208	}	1319	}
1209		1320
1210	return 0;	1321	return 0;
…		…
1218		1329
1219	object *prev = this;	1330	object *prev = this;
1220		1331
1221	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)	1332	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1222	{	1333	{
1223	object *op = arch_to_object (at);	1334	object *op = at->instance ();
1224		1335
1225	op->name = name;	1336	op->name = name;
1226	op->name_pl = name_pl;	1337	op->name_pl = name_pl;
1227	op->title = title;	1338	op->title = title;
1228		1339
…		…
1266	* Passing 0 for flag gives proper default values, so flag really only needs	1377	* Passing 0 for flag gives proper default values, so flag really only needs
1267	* to be set if special handling is needed.	1378	* to be set if special handling is needed.
1268	*	1379	*
1269	* Return value:	1380	* Return value:
1270	* new object if 'op' was merged with other object	1381	* new object if 'op' was merged with other object
1271	* NULL if 'op' was destroyed	1382	* NULL if there was an error (destroyed, blocked etc.)
1272	* just 'op' otherwise	1383	* just 'op' otherwise
1273	*/	1384	*/
1274	object *	1385	object *
1275	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1386	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1276	{	1387	{
1277	if (op->is_on_map ())
1278	{
1279	LOG (llevError, "insert_ob_in_map called for object already on map");
1280	abort ();
1281	}
1282
1283	if (op->env)
1284	{
1285	LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)");
1286	op->remove ();	1388	op->remove ();
1287	}
1288		1389
1289	if (op->face && !face_info (op->face))//D TODO: remove soon	1390	if (m == &freed_map)//D TODO: remove soon
1290	{//D	1391	{//D
1291	LOG (llevError | logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D	1392	LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
1292	op->face = 1;//D
1293	}//D	1393	}//D
1294		1394
1295	/* Ideally, the caller figures this out. However, it complicates a lot	1395	/* Ideally, the caller figures this out. However, it complicates a lot
1296	* of areas of callers (eg, anything that uses find_free_spot would now	1396	* of areas of callers (eg, anything that uses find_free_spot would now
1297	* need extra work	1397	* need extra work
1298	*/	1398	*/
		1399	maptile *newmap = m;
1299	if (!xy_normalise (m, op->x, op->y))	1400	if (!xy_normalise (newmap, op->x, op->y))
1300	{	1401	{
1301	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found	1402	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1302	return 0;	1403	return 0;
1303	}	1404	}
1304		1405
1305	if (object *more = op->more)	1406	if (object *more = op->more)
1306	if (!insert_ob_in_map (more, m, originator, flag))	1407	if (!insert_ob_in_map (more, m, originator, flag))
1307	return 0;	1408	return 0;
1308		1409
1309	CLEAR_FLAG (op, FLAG_REMOVED);	1410	op->flag [FLAG_REMOVED] = false;
1310		1411	op->env = 0;
1311	op->map = m;	1412	op->map = newmap;
		1413
1312	mapspace &ms = op->ms ();	1414	mapspace &ms = op->ms ();
1313		1415
1314	/* this has to be done after we translate the coordinates.	1416	/* this has to be done after we translate the coordinates.
1315	*/	1417	*/
1316	if (op->nrof && !(flag & INS_NO_MERGE))	1418	if (op->nrof && !(flag & INS_NO_MERGE))
…		…
1319	{	1421	{
1320	// TODO: we actually want to update tmp, not op,	1422	// TODO: we actually want to update tmp, not op,
1321	// but some caller surely breaks when we return tmp	1423	// but some caller surely breaks when we return tmp
1322	// from here :/	1424	// from here :/
1323	op->nrof += tmp->nrof;	1425	op->nrof += tmp->nrof;
1324	tmp->destroy (1);	1426	tmp->destroy ();
1325	}	1427	}
1326		1428
1327	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1429	op->clr_flag (FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1328	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1430	op->clr_flag (FLAG_INV_LOCKED);
1329		1431
1330	if (!QUERY_FLAG (op, FLAG_ALIVE))	1432	if (!op->flag [FLAG_ALIVE])
1331	CLEAR_FLAG (op, FLAG_NO_STEAL);	1433	op->clr_flag (FLAG_NO_STEAL);
1332		1434
1333	if (flag & INS_BELOW_ORIGINATOR)	1435	if (flag & INS_BELOW_ORIGINATOR)
1334	{	1436	{
1335	if (originator->map != op->map || originator->x != op->x || originator->y != op->y)	1437	if (originator->map != op->map || originator->x != op->x || originator->y != op->y)
1336	{	1438	{
1337	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1439	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1338	abort ();	1440	abort ();
1339	}	1441	}
1340		1442
1341	if (!originator->is_on_map ())	1443	if (!originator->is_on_map ())
		1444	{
1342	LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",	1445	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
1343	op->debug_desc (), originator->debug_desc ());	1446	op->debug_desc (), originator->debug_desc ());
		1447	abort ();
		1448	}
1344		1449
1345	op->above = originator;	1450	op->above = originator;
1346	op->below = originator->below;	1451	op->below = originator->below;
1347	originator->below = op;	1452	originator->below = op;
1348		1453
…		…
1368	* when lots of spells are cast in one area. Currently, it is presumed	1473	* when lots of spells are cast in one area. Currently, it is presumed
1369	* that flying non pickable objects are spell objects.	1474	* that flying non pickable objects are spell objects.
1370	*/	1475	*/
1371	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1476	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1372	{	1477	{
1373	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))	1478	if (tmp->flag [FLAG_IS_FLOOR] || tmp->flag [FLAG_OVERLAY_FLOOR])
1374	floor = tmp;	1479	floor = tmp;
1375		1480
1376	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1481	if (tmp->flag [FLAG_NO_PICK] && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !tmp->flag [FLAG_IS_FLOOR])
1377	{	1482	{
1378	/* We insert above top, so we want this object below this */	1483	/* We insert above top, so we want this object below this */
1379	top = tmp->below;	1484	top = tmp->below;
1380	break;	1485	break;
1381	}	1486	}
…		…
1399	&& (op->face && !faces [op->face].visibility))	1504	&& (op->face && !faces [op->face].visibility))
1400	{	1505	{
1401	object *last;	1506	object *last;
1402		1507
1403	for (last = top; last != floor; last = last->below)	1508	for (last = top; last != floor; last = last->below)
1404	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1509	if (last->flag [FLAG_BLOCKSVIEW] && (last->type != EXIT))
1405	break;	1510	break;
1406		1511
1407	/* Check to see if we found the object that blocks view,	1512	/* Check to see if we found the object that blocks view,
1408	* and make sure we have a below pointer for it so that	1513	* and make sure we have a below pointer for it so that
1409	* we can get inserted below this one, which requires we	1514	* we can get inserted below this one, which requires we
…		…
1434	op->below = top;	1539	op->below = top;
1435	*(op->above ? &op->above->below : &ms.top) = op;	1540	*(op->above ? &op->above->below : &ms.top) = op;
1436	}	1541	}
1437	}	1542	}
1438		1543
1439	if (op->type == PLAYER)	1544	if (op->is_player ())
1440	{	1545	{
1441	op->contr->do_los = 1;	1546	op->contr->do_los = 1;
1442	++op->map->players;	1547	++op->map->players;
1443	op->map->touch ();	1548	op->map->touch ();
1444	}	1549	}
…		…
1459	* be far away from this change and not affected in any way -	1564	* be far away from this change and not affected in any way -
1460	* this should get redone to only look for players within range,	1565	* this should get redone to only look for players within range,
1461	* or just updating the P_UPTODATE for spaces within this area	1566	* or just updating the P_UPTODATE for spaces within this area
1462	* of effect may be sufficient.	1567	* of effect may be sufficient.
1463	*/	1568	*/
1464	if (op->map->darkness && (op->glow_radius != 0))	1569	if (op->affects_los ())
		1570	{
		1571	op->ms ().invalidate ();
1465	update_all_los (op->map, op->x, op->y);	1572	update_all_los (op->map, op->x, op->y);
		1573	}
1466		1574
1467	/* updates flags (blocked, alive, no magic, etc) for this map space */	1575	/* updates flags (blocked, alive, no magic, etc) for this map space */
1468	update_object (op, UP_OBJ_INSERT);	1576	update_object (op, UP_OBJ_INSERT);
1469		1577
1470	INVOKE_OBJECT (INSERT, op);	1578	INVOKE_OBJECT (INSERT, op);
…		…
1477	* blocked() and wall() work properly), and these flags are updated by	1585	* blocked() and wall() work properly), and these flags are updated by
1478	* update_object().	1586	* update_object().
1479	*/	1587	*/
1480		1588
1481	/* if this is not the head or flag has been passed, don't check walk on status */	1589	/* if this is not the head or flag has been passed, don't check walk on status */
1482	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1590	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1483	{	1591	{
1484	if (check_move_on (op, originator))	1592	if (check_move_on (op, originator, flag))
1485	return 0;	1593	return 0;
1486		1594
1487	/* If we are a multi part object, lets work our way through the check	1595	/* If we are a multi part object, let's work our way through the check
1488	* walk on's.	1596	* walk on's.
1489	*/	1597	*/
1490	for (object *tmp = op->more; tmp; tmp = tmp->more)	1598	for (object *tmp = op->more; tmp; tmp = tmp->more)
1491	if (check_move_on (tmp, originator))	1599	if (check_move_on (tmp, originator, flag))
1492	return 0;	1600	return 0;
1493	}	1601	}
1494		1602
1495	return op;	1603	return op;
1496	}	1604	}
…		…
1498	/* this function inserts an object in the map, but if it	1606	/* this function inserts an object in the map, but if it
1499	* finds an object of its own type, it'll remove that one first.	1607	* finds an object of its own type, it'll remove that one first.
1500	* op is the object to insert it under: supplies x and the map.	1608	* op is the object to insert it under: supplies x and the map.
1501	*/	1609	*/
1502	void	1610	void
1503	replace_insert_ob_in_map (const char *arch_string, object *op)	1611	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1504	{	1612	{
1505	/* first search for itself and remove any old instances */	1613	/* first search for itself and remove any old instances */
1506		1614
1507	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1615	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1508	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1616	if (tmp->arch->archname == archname) /* same archetype */
1509	tmp->destroy (1);	1617	tmp->destroy ();
1510		1618
1511	object *tmp = arch_to_object (archetype::find (arch_string));	1619	object *tmp = archetype::find (archname)->instance ();
1512		1620
1513	tmp->x = op->x;	1621	tmp->x = op->x;
1514	tmp->y = op->y;	1622	tmp->y = op->y;
1515		1623
1516	insert_ob_in_map (tmp, op->map, op, 0);	1624	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1521	{	1629	{
1522	if (where->env)	1630	if (where->env)
1523	return where->env->insert (this);	1631	return where->env->insert (this);
1524	else	1632	else
1525	return where->map->insert (this, where->x, where->y, originator, flags);	1633	return where->map->insert (this, where->x, where->y, originator, flags);
		1634	}
		1635
		1636	// check whether we can put this into the map, respect max_volume, max_items
		1637	bool
		1638	object::can_drop_at (maptile *m, int x, int y, object *originator)
		1639	{
		1640	mapspace &ms = m->at (x, y);
		1641
		1642	int items = ms.items ();
		1643
		1644	if (!items // testing !items ensures we can drop at least one item
		1645	|| (items < m->max_items
		1646	&& ms.volume () < m->max_volume))
		1647	return true;
		1648
		1649	if (originator && originator->is_player ())
		1650	originator->contr->failmsgf (
		1651	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
		1652	query_name ()
		1653	);
		1654
		1655	return false;
1526	}	1656	}
1527		1657
1528	/*	1658	/*
1529	* decrease(object, number) decreases a specified number from	1659	* decrease(object, number) decreases a specified number from
1530	* the amount of an object. If the amount reaches 0, the object	1660	* the amount of an object. If the amount reaches 0, the object
…		…
1538	if (!nr)	1668	if (!nr)
1539	return true;	1669	return true;
1540		1670
1541	nr = min (nr, nrof);	1671	nr = min (nr, nrof);
1542		1672
		1673	if (nrof > nr)
		1674	{
		1675	sint64 oweight = total_weight ();
		1676
1543	nrof -= nr;	1677	nrof -= nr;
1544
1545	if (nrof)
1546	{
1547	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1548		1678
1549	if (object *pl = visible_to ())	1679	if (object *pl = visible_to ())
1550	esrv_update_item (UPD_NROF, pl, this);	1680	esrv_update_item (UPD_NROF, pl, this);
		1681
		1682	adjust_weight (env, oweight, total_weight ());
1551		1683
1552	return true;	1684	return true;
1553	}	1685	}
1554	else	1686	else
1555	{	1687	{
…		…
1630	if (op->nrof)	1762	if (op->nrof)
1631	for (object *tmp = inv; tmp; tmp = tmp->below)	1763	for (object *tmp = inv; tmp; tmp = tmp->below)
1632	if (object::can_merge (tmp, op))	1764	if (object::can_merge (tmp, op))
1633	{	1765	{
1634	/* return the original object and remove inserted object	1766	/* return the original object and remove inserted object
1635	(client needs the original object) */	1767	(client prefers the original object) */
		1768
		1769	// carring must be 0 for mergable objects
		1770	sint64 oweight = tmp->weight * tmp->nrof;
		1771
1636	tmp->nrof += op->nrof;	1772	tmp->nrof += op->nrof;
1637		1773
1638	if (object *pl = tmp->visible_to ())	1774	if (object *pl = tmp->visible_to ())
1639	esrv_update_item (UPD_NROF, pl, tmp);	1775	esrv_update_item (UPD_NROF, pl, tmp);
1640		1776
1641	adjust_weight (this, op->total_weight ());	1777	adjust_weight (this, oweight, tmp->weight * tmp->nrof);
1642		1778
1643	op->destroy (1);	1779	op->destroy ();
1644	op = tmp;	1780	op = tmp;
1645	goto inserted;	1781	goto inserted;
1646	}	1782	}
1647		1783
1648	op->owner = 0; // it's his/hers now. period.	1784	op->owner = 0; // it's his/hers now. period.
…		…
1662	op->flag [FLAG_REMOVED] = 0;	1798	op->flag [FLAG_REMOVED] = 0;
1663		1799
1664	if (object *pl = op->visible_to ())	1800	if (object *pl = op->visible_to ())
1665	esrv_send_item (pl, op);	1801	esrv_send_item (pl, op);
1666		1802
1667	adjust_weight (this, op->total_weight ());	1803	adjust_weight (this, 0, op->total_weight ());
1668		1804
1669	inserted:	1805	inserted:
1670	/* reset the light list and los of the players on the map */	1806	/* reset the light list and los of the players on the map */
1671	if (op->glow_radius && map && map->darkness)	1807	if (op->glow_radius && is_on_map ())
		1808	{
		1809	update_stats ();
1672	update_all_los (map, x, y);	1810	update_all_los (map, x, y);
1673		1811	}
		1812	else if (is_player ())
1674	// if this is a player's inventory, update stats	1813	// if this is a player's inventory, update stats
1675	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])	1814	contr->queue_stats_update ();
1676	update_stats ();
1677		1815
1678	INVOKE_OBJECT (INSERT, this);	1816	INVOKE_OBJECT (INSERT, this);
1679		1817
1680	return op;	1818	return op;
1681	}	1819	}
…		…
1699	* MSW 2001-07-08: Check all objects on space, not just those below	1837	* MSW 2001-07-08: Check all objects on space, not just those below
1700	* object being inserted. insert_ob_in_map may not put new objects	1838	* object being inserted. insert_ob_in_map may not put new objects
1701	* on top.	1839	* on top.
1702	*/	1840	*/
1703	int	1841	int
1704	check_move_on (object *op, object *originator)	1842	check_move_on (object *op, object *originator, int flags)
1705	{	1843	{
		1844	if (op->flag [FLAG_NO_APPLY])
		1845	return 0;
		1846
1706	object *tmp;	1847	object *tmp;
1707	maptile *m = op->map;	1848	maptile *m = op->map;
1708	int x = op->x, y = op->y;	1849	int x = op->x, y = op->y;
1709		1850
1710	MoveType move_on, move_slow, move_block;	1851	mapspace &ms = m->at (x, y);
1711		1852
1712	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1853	ms.update ();
1713	return 0;
1714		1854
1715	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1855	MoveType move_on = ms.move_on;
1716	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1856	MoveType move_slow = ms.move_slow;
1717	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1857	MoveType move_block = ms.move_block;
1718		1858
1719	/* if nothing on this space will slow op down or be applied,	1859	/* if nothing on this space will slow op down or be applied,
1720	* no need to do checking below. have to make sure move_type	1860	* no need to do checking below. have to make sure move_type
1721	* is set, as lots of objects don't have it set - we treat that	1861	* is set, as lots of objects don't have it set - we treat that
1722	* as walking.	1862	* as walking.
…		…
1733	return 0;	1873	return 0;
1734		1874
1735	/* The objects have to be checked from top to bottom.	1875	/* The objects have to be checked from top to bottom.
1736	* Hence, we first go to the top:	1876	* Hence, we first go to the top:
1737	*/	1877	*/
1738		1878	for (object *next, *tmp = ms.top; tmp; tmp = next)
1739	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1740	{
1741	/* Trim the search when we find the first other spell effect
1742	* this helps performance so that if a space has 50 spell objects,
1743	* we don't need to check all of them.
1744	*/
1745	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1746	break;
1747	}	1879	{
		1880	next = tmp->below;
1748		1881
1749	for (; tmp; tmp = tmp->below)
1750	{
1751	if (tmp == op)	1882	if (tmp == op)
1752	continue; /* Can't apply yourself */	1883	continue; /* Can't apply yourself */
1753		1884
1754	/* Check to see if one of the movement types should be slowed down.	1885	/* Check to see if one of the movement types should be slowed down.
1755	* Second check makes sure that the movement types not being slowed	1886	* Second check makes sure that the movement types not being slowed
1756	* (~slow_move) is not blocked on this space - just because the	1887	* (~slow_move) is not blocked on this space - just because the
1757	* space doesn't slow down swimming (for example), if you can't actually	1888	* space doesn't slow down swimming (for example), if you can't actually
1758	* swim on that space, can't use it to avoid the penalty.	1889	* swim on that space, can't use it to avoid the penalty.
1759	*/	1890	*/
1760	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1891	if (!op->flag [FLAG_WIZPASS])
1761	{	1892	{
1762	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1893	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1763	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1894	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1764	{	1895	{
1765
1766	float
1767	diff = tmp->move_slow_penalty * fabs (op->speed);	1896	float diff = tmp->move_slow_penalty * fabs (op->speed);
1768		1897
1769	if (op->type == PLAYER)	1898	if (op->is_player ())
1770	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1899	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1771	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1900	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1772	diff /= 4.0;	1901	diff /= 4.0;
1773		1902
1774	op->speed_left -= diff;	1903	op->speed_left -= diff;
1775	}	1904	}
1776	}	1905	}
1777		1906
1778	/* Basically same logic as above, except now for actual apply. */	1907	/* Basically same logic as above, except now for actual apply. */
1779	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||	1908	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
1780	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))	1909	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
1781	{	1910	{
		1911	if ((flags & INS_NO_AUTO_EXIT)
		1912	&& (tmp->type == EXIT || tmp->type == TELEPORTER
		1913	|| tmp->type == HOLE || tmp->type == TRAPDOOR)) //TODO: temporary, fix exits instead
		1914	continue;
		1915
1782	move_apply (tmp, op, originator);	1916	move_apply (tmp, op, originator);
1783		1917
1784	if (op->destroyed ())	1918	if (op->destroyed ())
1785	return 1;	1919	return 1;
1786		1920
…		…
1898	void	2032	void
1899	flag_inv (object *op, int flag)	2033	flag_inv (object *op, int flag)
1900	{	2034	{
1901	for (object *tmp = op->inv; tmp; tmp = tmp->below)	2035	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1902	{	2036	{
1903	SET_FLAG (tmp, flag);	2037	tmp->set_flag (flag);
1904	flag_inv (tmp, flag);	2038	flag_inv (tmp, flag);
1905	}	2039	}
1906	}	2040	}
1907		2041
1908	/*	2042	/*
…		…
1911	void	2045	void
1912	unflag_inv (object *op, int flag)	2046	unflag_inv (object *op, int flag)
1913	{	2047	{
1914	for (object *tmp = op->inv; tmp; tmp = tmp->below)	2048	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1915	{	2049	{
1916	CLEAR_FLAG (tmp, flag);	2050	tmp->clr_flag (flag);
1917	unflag_inv (tmp, flag);	2051	unflag_inv (tmp, flag);
1918	}	2052	}
1919	}	2053	}
1920		2054
1921	/*	2055	/*
…		…
1982	* head of the object should correspond for the entire object.	2116	* head of the object should correspond for the entire object.
1983	*/	2117	*/
1984	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	2118	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
1985	continue;	2119	continue;
1986		2120
1987	if (ob->blocked (m, pos.x, pos.y))	2121	if (ob->blocked (pos.m, pos.x, pos.y))
1988	continue;	2122	continue;
1989		2123
1990	altern [index++] = i;	2124	altern [index++] = i;
1991	}	2125	}
1992		2126
…		…
2060	* there is capable of.	2194	* there is capable of.
2061	*/	2195	*/
2062	int	2196	int
2063	find_dir (maptile *m, int x, int y, object *exclude)	2197	find_dir (maptile *m, int x, int y, object *exclude)
2064	{	2198	{
2065	int i, max = SIZEOFFREE, mflags;	2199	int max = SIZEOFFREE, mflags;
2066
2067	sint16 nx, ny;
2068	object *tmp;
2069	maptile *mp;
2070
2071	MoveType blocked, move_type;	2200	MoveType move_type;
2072		2201
2073	if (exclude && exclude->head_ () != exclude)	2202	if (exclude && exclude->head_ () != exclude)
2074	{	2203	{
2075	exclude = exclude->head;	2204	exclude = exclude->head;
2076	move_type = exclude->move_type;	2205	move_type = exclude->move_type;
…		…
2079	{	2208	{
2080	/* If we don't have anything, presume it can use all movement types. */	2209	/* If we don't have anything, presume it can use all movement types. */
2081	move_type = MOVE_ALL;	2210	move_type = MOVE_ALL;
2082	}	2211	}
2083		2212
2084	for (i = 1; i < max; i++)	2213	for (int i = 1; i < max; i++)
2085	{	2214	{
2086	mp = m;	2215	mapxy pos (m, x, y);
2087	nx = x + freearr_x[i];	2216	pos.move (i);
2088	ny = y + freearr_y[i];
2089		2217
2090	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2218	if (!pos.normalise ())
2091
2092	if (mflags & P_OUT_OF_MAP)
2093	max = maxfree[i];	2219	max = maxfree[i];
2094	else	2220	else
2095	{	2221	{
2096	mapspace &ms = mp->at (nx, ny);	2222	mapspace &ms = *pos;
2097		2223
2098	blocked = ms.move_block;
2099
2100	if ((move_type & blocked) == move_type)	2224	if ((move_type & ms.move_block) == move_type)
2101	max = maxfree[i];	2225	max = maxfree [i];
2102	else if (mflags & P_IS_ALIVE)	2226	else if (ms.flags () & P_IS_ALIVE)
2103	{	2227	{
2104	for (tmp = ms.bot; tmp; tmp = tmp->above)	2228	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2105	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2229	if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2106	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2230	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2107	break;
2108
2109	if (tmp)
2110	return freedir[i];	2231	return freedir [i];
2111	}	2232	}
2112	}	2233	}
2113	}	2234	}
2114		2235
2115	return 0;	2236	return 0;
…		…
2124	{	2245	{
2125	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2246	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2126	}	2247	}
2127		2248
2128	/*	2249	/*
2129	* find_dir_2(delta-x,delta-y) will return a direction in which	2250	* find_dir_2(delta-x,delta-y) will return a direction value
2130	* an object which has subtracted the x and y coordinates of another	2251	* for running into direct [dx, dy].
2131	* object, needs to travel toward it.	2252	* (the opposite of crossfire's find_dir_2!)
2132	*/	2253	*/
2133	int	2254	int
2134	find_dir_2 (int x, int y)	2255	find_dir_2 (int x, int y)
2135	{	2256	{
		2257	#if 1 // new algorithm
		2258	// this works by putting x, y into 16 sectors, which
		2259	// are not equal sized, but are a better approximation
		2260	// then the old algorithm, and then using a mapping
		2261	// table to map it into a direction value.
		2262	// basically, it maps these comparisons to each bit
		2263	// bit #3: x < 0
		2264	// bit #2: y < 0
		2265	// bit #1: x > y
		2266	// bit #0: x > 2y
		2267
		2268	static const uint8 dir[16] = {
		2269	4, 5, 4, 3,
		2270	2, 1, 2, 3,
		2271	6, 5, 6, 7,
		2272	8, 1, 8, 7,
		2273	};
		2274	int sector = 0;
		2275
		2276	// this is a bit ugly, but more likely to result in branchless code
		2277	sector |= x < 0 ? 8 : 0;
		2278	x = x < 0 ? -x : x; // abs
		2279
		2280	sector |= y < 0 ? 4 : 0;
		2281	y = y < 0 ? -y : y; // abs
		2282
		2283	if (x > y)
		2284	{
		2285	sector |= 2;
		2286
		2287	if (x > y * 2)
		2288	sector |= 1;
		2289	}
		2290	else
		2291	{
		2292	if (y > x * 2)
		2293	sector |= 1;
		2294	else if (!y)
		2295	return 0; // x == 0 here
		2296	}
		2297
		2298	return dir [sector];
		2299	#else // old algorithm
2136	int q;	2300	int q;
2137		2301
2138	if (y)	2302	if (y)
2139	q = x * 100 / y;	2303	q = 128 * x / y;
2140	else if (x)	2304	else if (x)
2141	q = -300 * x;	2305	q = -512 * x; // to make it > 309
2142	else	2306	else
2143	return 0;	2307	return 0;
2144		2308
2145	if (y > 0)	2309	if (y > 0)
2146	{	2310	{
2147	if (q < -242)	2311	if (q < -309) return 7;
		2312	if (q < -52) return 6;
		2313	if (q < 52) return 5;
		2314	if (q < 309) return 4;
		2315
2148	return 3;	2316	return 3;
2149	if (q < -41)	2317	}
2150	return 2;	2318	else
2151	if (q < 41)	2319	{
2152	return 1;	2320	if (q < -309) return 3;
2153	if (q < 242)	2321	if (q < -52) return 2;
2154	return 8;	2322	if (q < 52) return 1;
		2323	if (q < 309) return 8;
		2324
2155	return 7;	2325	return 7;
2156	}	2326	}
2157		2327	#endif
2158	if (q < -242)
2159	return 7;
2160	if (q < -41)
2161	return 6;
2162	if (q < 41)
2163	return 5;
2164	if (q < 242)
2165	return 4;
2166
2167	return 3;
2168	}	2328	}
2169		2329
2170	/*	2330	/*
2171	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2331	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2172	* between two directions (which are expected to be absolute (see absdir())	2332	* between two directions (which are expected to be absolute (see absdir())
2173	*/	2333	*/
2174	int	2334	int
2175	dirdiff (int dir1, int dir2)	2335	dirdiff (int dir1, int dir2)
2176	{	2336	{
2177	int d;
2178
2179	d = abs (dir1 - dir2);	2337	int d = abs (dir1 - dir2);
2180	if (d > 4)
2181	d = 8 - d;
2182		2338
2183	return d;	2339	return d > 4 ? 8 - d : d;
2184	}	2340	}
2185		2341
2186	/* peterm:	2342	/* peterm:
2187	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2343	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
2188	* Basically, this is a table of directions, and what directions	2344	* Basically, this is a table of directions, and what directions
…		…
2190	* This basically means that if direction is 15, then it could either go	2346	* This basically means that if direction is 15, then it could either go
2191	* direction 4, 14, or 16 to get back to where we are.	2347	* direction 4, 14, or 16 to get back to where we are.
2192	* Moved from spell_util.c to object.c with the other related direction	2348	* Moved from spell_util.c to object.c with the other related direction
2193	* functions.	2349	* functions.
2194	*/	2350	*/
2195	int reduction_dir[SIZEOFFREE][3] = {	2351	static const int reduction_dir[SIZEOFFREE][3] = {
2196	{0, 0, 0}, /* 0 */	2352	{0, 0, 0}, /* 0 */
2197	{0, 0, 0}, /* 1 */	2353	{0, 0, 0}, /* 1 */
2198	{0, 0, 0}, /* 2 */	2354	{0, 0, 0}, /* 2 */
2199	{0, 0, 0}, /* 3 */	2355	{0, 0, 0}, /* 3 */
2200	{0, 0, 0}, /* 4 */	2356	{0, 0, 0}, /* 4 */
…		…
2294	* Add a check so we can't pick up invisible objects (0.93.8)	2450	* Add a check so we can't pick up invisible objects (0.93.8)
2295	*/	2451	*/
2296	int	2452	int
2297	can_pick (const object *who, const object *item)	2453	can_pick (const object *who, const object *item)
2298	{	2454	{
2299	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2455	return /*who->flag [FLAG_WIZ]|| */
2300	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2456	(item->weight > 0 && !item->flag [FLAG_NO_PICK] &&
2301	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2457	!item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2302	}	2458	}
2303		2459
2304	/*	2460	/*
2305	* create clone from object to another	2461	* create clone from object to another
2306	*/	2462	*/
…		…
2338	return tmp;	2494	return tmp;
2339		2495
2340	return 0;	2496	return 0;
2341	}	2497	}
2342		2498
2343	const shstr &	2499	shstr_tmp
2344	object::kv_get (const shstr &key) const	2500	object::kv_get (shstr_tmp key) const
2345	{	2501	{
2346	for (key_value *kv = key_values; kv; kv = kv->next)	2502	for (key_value *kv = key_values; kv; kv = kv->next)
2347	if (kv->key == key)	2503	if (kv->key == key)
2348	return kv->value;	2504	return kv->value;
2349		2505
2350	return shstr_null;	2506	return shstr ();
2351	}	2507	}
2352		2508
2353	void	2509	void
2354	object::kv_set (const shstr &key, const shstr &value)	2510	object::kv_set (shstr_tmp key, shstr_tmp value)
2355	{	2511	{
2356	for (key_value *kv = key_values; kv; kv = kv->next)	2512	for (key_value *kv = key_values; kv; kv = kv->next)
2357	if (kv->key == key)	2513	if (kv->key == key)
2358	{	2514	{
2359	kv->value = value;	2515	kv->value = value;
…		…
2368		2524
2369	key_values = kv;	2525	key_values = kv;
2370	}	2526	}
2371		2527
2372	void	2528	void
2373	object::kv_del (const shstr &key)	2529	object::kv_del (shstr_tmp key)
2374	{	2530	{
2375	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)	2531	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2376	if ((*kvp)->key == key)	2532	if ((*kvp)->key == key)
2377	{	2533	{
2378	key_value *kv = *kvp;	2534	key_value *kv = *kvp;
…		…
2471	{	2627	{
2472	return map ? map->region (x, y)	2628	return map ? map->region (x, y)
2473	: region::default_region ();	2629	: region::default_region ();
2474	}	2630	}
2475		2631
2476	const materialtype_t *
2477	object::dominant_material () const
2478	{
2479	if (materialtype_t *mt = name_to_material (materialname))
2480	return mt;
2481
2482	return name_to_material (shstr_unknown);
2483	}
2484
2485	void	2632	void
2486	object::open_container (object *new_container)	2633	object::open_container (object *new_container)
2487	{	2634	{
2488	if (container == new_container)	2635	if (container == new_container)
2489	return;	2636	return;
…		…
2509	container = 0;	2656	container = 0;
2510		2657
2511	// client needs item update to make it work, client bug requires this to be separate	2658	// client needs item update to make it work, client bug requires this to be separate
2512	esrv_update_item (UPD_FLAGS, this, old_container);	2659	esrv_update_item (UPD_FLAGS, this, old_container);
2513		2660
2514	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2661	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2515	play_sound (sound_find ("chest_close"));	2662	play_sound (sound_find ("chest_close"));
2516	}	2663	}
2517		2664
2518	if (new_container)	2665	if (new_container)
2519	{	2666	{
…		…
2523	// TODO: this does not seem to serve any purpose anymore?	2670	// TODO: this does not seem to serve any purpose anymore?
2524	#if 0	2671	#if 0
2525	// insert the "Close Container" object.	2672	// insert the "Close Container" object.
2526	if (archetype *closer = new_container->other_arch)	2673	if (archetype *closer = new_container->other_arch)
2527	{	2674	{
2528	object *closer = arch_to_object (new_container->other_arch);	2675	object *closer = new_container->other_arch->instance ();
2529	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2676	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2530	new_container->insert (closer);	2677	new_container->insert (closer);
2531	}	2678	}
2532	#endif	2679	#endif
2533		2680
2534	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2681	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2535		2682
2536	// make sure the container is available, client bug requires this to be separate	2683	// make sure the container is available, client bug requires this to be separate
2537	esrv_send_item (this, new_container);	2684	esrv_send_item (this, new_container);
2538		2685
2539	new_container->flag [FLAG_APPLIED] = true;	2686	new_container->flag [FLAG_APPLIED] = true;
…		…
2547	// else if (!old_container->env && contr && contr->ns)	2694	// else if (!old_container->env && contr && contr->ns)
2548	// contr->ns->floorbox_reset ();	2695	// contr->ns->floorbox_reset ();
2549	}	2696	}
2550		2697
2551	object *	2698	object *
2552	object::force_find (const shstr name)	2699	object::force_find (shstr_tmp name)
2553	{	2700	{
2554	/* cycle through his inventory to look for the MARK we want to	2701	/* cycle through his inventory to look for the MARK we want to
2555	* place	2702	* place
2556	*/	2703	*/
2557	for (object *tmp = inv; tmp; tmp = tmp->below)	2704	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2559	return splay (tmp);	2706	return splay (tmp);
2560		2707
2561	return 0;	2708	return 0;
2562	}	2709	}
2563		2710
		2711	//-GPL
		2712
2564	void	2713	void
		2714	object::force_set_timer (int duration)
		2715	{
		2716	this->duration = 1;
		2717	this->speed_left = -1.f;
		2718
		2719	this->set_speed (duration ? 1.f / duration : 0.f);
		2720	}
		2721
		2722	object *
2565	object::force_add (const shstr name, int duration)	2723	object::force_add (shstr_tmp name, int duration)
2566	{	2724	{
2567	if (object *force = force_find (name))	2725	if (object *force = force_find (name))
2568	force->destroy ();	2726	force->destroy ();
2569		2727
2570	object *force = get_archetype (FORCE_NAME);	2728	object *force = get_archetype (FORCE_NAME);
2571		2729
2572	force->slaying = name;	2730	force->slaying = name;
2573	force->stats.food = 1;	2731	force->force_set_timer (duration);
2574	force->speed_left = -1.f;
2575
2576	force->set_speed (duration ? 1.f / duration : 0.f);
2577	force->flag [FLAG_IS_USED_UP] = true;
2578	force->flag [FLAG_APPLIED] = true;	2732	force->flag [FLAG_APPLIED] = true;
2579		2733
2580	insert (force);	2734	return insert (force);
2581	}	2735	}
2582		2736
2583	void	2737	void
2584	object::play_sound (faceidx sound)	2738	object::play_sound (faceidx sound) const
2585	{	2739	{
2586	if (!sound)	2740	if (!sound)
2587	return;	2741	return;
2588		2742
2589	if (flag [FLAG_REMOVED])	2743	if (is_on_map ())
		2744	map->play_sound (sound, x, y);
		2745	else if (object *pl = in_player ())
		2746	pl->contr->play_sound (sound);
		2747	}
		2748
		2749	void
		2750	object::say_msg (const char *msg) const
		2751	{
		2752	if (is_on_map ())
		2753	map->say_msg (msg, x, y);
		2754	else if (object *pl = in_player ())
		2755	pl->contr->play_sound (sound);
		2756	}
		2757
		2758	void
		2759	object::make_noise ()
		2760	{
		2761	// we do not model noise in the map, so instead put
		2762	// a temporary light into the noise source
		2763	// could use the map instead, but that's less reliable for our
		2764	// goal, which is to make invisibility a bit harder to exploit
		2765
		2766	// currently only works sensibly for players
		2767	if (!is_player ())
2590	return;	2768	return;
2591		2769
2592	if (env)	2770	// find old force, or create new one
2593	{	2771	object *force = force_find (shstr_noise_force);
2594	if (object *pl = in_player ())	2772
2595	pl->contr->play_sound (sound);	2773	if (force)
2596	}	2774	force->speed_left = -1.f; // patch old speed up
2597	else	2775	else
2598	map->play_sound (sound, x, y);	2776	{
2599	}	2777	force = archetype::get (shstr_noise_force);
2600		2778
		2779	force->slaying = shstr_noise_force;
		2780	force->stats.food = 1;
		2781	force->speed_left = -1.f;
		2782
		2783	force->set_speed (1.f / 4.f);
		2784	force->flag [FLAG_IS_USED_UP] = true;
		2785	force->flag [FLAG_APPLIED] = true;
		2786
		2787	insert (force);
		2788	}
		2789	}
		2790
		2791	void object::change_move_type (MoveType mt)
		2792	{
		2793	if (move_type == mt)
		2794	return;
		2795
		2796	if (is_on_map ())
		2797	{
		2798	// we are on the map, so handle move_on/off effects
		2799	remove ();
		2800	move_type = mt;
		2801	map->insert (this, x, y, this);
		2802	}
		2803	else
		2804	move_type = mt;
		2805	}
		2806
		2807	/* object should be a player.
		2808	* we return the object the player has marked with the 'mark' command
		2809	* below. If no match is found (or object has changed), we return
		2810	* NULL. We leave it up to the calling function to print messages if
		2811	* nothing is found.
		2812	*/
		2813	object *
		2814	object::mark () const
		2815	{
		2816	if (contr && contr->mark && contr->mark->env == this)
		2817	return contr->mark;
		2818	else
		2819	return 0;
		2820	}
		2821
		2822	// put marked object first in the inventory
		2823	// this is used by identify-like spells so players can influence
		2824	// the order a bit.
		2825	void
		2826	object::splay_marked ()
		2827	{
		2828	if (object *marked = mark ())
		2829	splay (marked);
		2830	}
		2831

Diff Legend

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