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

Diff Legend

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