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

Diff Legend

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