[ViewVC] Diff of: cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.287 by root, Sat Oct 3 20:11:12 2009 UTC vs.
Revision 1.333 by root, Thu Apr 22 03:53:40 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,2009 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	uint32_t mapspace::smellcount = 10000;
38		38
39	objectvec objects;	39	objectvec objects;
40	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
41		49
42	short freearr_x[SIZEOFFREE] = {	50	short freearr_x[SIZEOFFREE] = {
43	0,	51	0,
44	0, 1, 1, 1, 0, -1, -1, -1,	52	0, 1, 1, 1, 0, -1, -1, -1,
45	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,
49	0,	57	0,
50	-1, -1, 0, 1, 1, 1, 0, -1,	58	-1, -1, 0, 1, 1, 1, 0, -1,
51	-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,
52	-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
53	};	61	};
54	int maxfree[SIZEOFFREE] = {
55	0,
56	9, 10, 13, 14, 17, 18, 21, 22,
57	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
58	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
59	};
60	int freedir[SIZEOFFREE] = {	62	int freedir[SIZEOFFREE] = {
61	0,	63	0,
62	1, 2, 3, 4, 5, 6, 7, 8,	64	1, 2, 3, 4, 5, 6, 7, 8,
63	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,
64	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
65	};	67	};
66		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
67	static void	76	static void
68	write_uuid (uval64 skip, bool sync)	77	write_uuid (uval64 skip, bool sync)
69	{	78	{
70	CALL_BEGIN (2);	79	CALL_BEGIN (2);
71	CALL_ARG_SV (newSVval64 (skip));	80	CALL_ARG_SV (newSVval64 (skip));
…		…
73	CALL_CALL ("cf::write_uuid", G_DISCARD);	82	CALL_CALL ("cf::write_uuid", G_DISCARD);
74	CALL_END;	83	CALL_END;
75	}	84	}
76		85
77	static void	86	static void
78	read_uuid (void)	87	read_uuid ()
79	{	88	{
80	char filename[MAX_BUF];	89	char filename[MAX_BUF];
81		90
82	sprintf (filename, "%s/uuid", settings.localdir);	91	sprintf (filename, "%s/uuid", settings.localdir);
83		92
…		…
97		106
98	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	107	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
99	_exit (1);	108	_exit (1);
100	}	109	}
101		110
102	UUID::BUF buf;	111	char buf [UUID::MAX_LEN];
103	buf[0] = 0;	112	buf[0] = 0;
104	fgets (buf, sizeof (buf), fp);	113	fgets (buf, sizeof (buf), fp);
105		114
106	if (!UUID::cur.parse (buf))	115	if (!UUID::cur.parse (buf))
107	{	116	{
…		…
134		143
135	void	144	void
136	UUID::init ()	145	UUID::init ()
137	{	146	{
138	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;
139	}	213	}
140		214
141	/* 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. */
142	static bool	216	static bool
143	compare_ob_value_lists_one (const object wants, const object has)	217	compare_ob_value_lists_one (const object wants, const object has)
…		…
179	* Improvements made with merge: Better checking on potion, and also	253	* Improvements made with merge: Better checking on potion, and also
180	* check weight	254	* check weight
181	*/	255	*/
182	bool object::can_merge_slow (object ob1, object ob2)	256	bool object::can_merge_slow (object ob1, object ob2)
183	{	257	{
184	/* A couple quicksanity checks */	258	/* A couple quick sanity checks */
185	if (ob1 == ob2	259	if (ob1 == ob2
186	\|\| ob1->type != ob2->type	260	\|\| ob1->type != ob2->type
187	\|\| ob1->speed != ob2->speed
188	\|\| ob1->value != ob2->value	261	\|\| ob1->value != ob2->value
189	\|\| ob1->name != ob2->name)	262	\|\| ob1->name != ob2->name
		263	\|\| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
190	return 0;	264	return 0;
191		265
192	/* Do not merge objects if nrof would overflow, assume nrof	266	/* Do not merge objects if nrof would overflow, assume nrof
193	* is always 0 .. 2*31-1 /	267	* is always 0 .. 2*31-1 /
194	if (ob1->nrof > 0x7fffffff - ob2->nrof)	268	if (ob1->nrof > 0x7fffffff - ob2->nrof)
…		…
198	* 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
199	* 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
200	* 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
201	* flags lose any meaning.	275	* flags lose any meaning.
202	*/	276	*/
203	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	277	if (ob1->flag [FLAG_IDENTIFIED])
204	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	278	ob1->set_flag (FLAG_BEEN_APPLIED);
205		279
206	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	280	if (ob2->flag [FLAG_IDENTIFIED])
207	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	281	ob2->set_flag (FLAG_BEEN_APPLIED);
208		282
209	if (ob1->arch->archname != ob2->arch->archname	283	if (ob1->arch->archname != ob2->arch->archname
210	\|\| ob1->name != ob2->name	284	\|\| ob1->name != ob2->name
211	\|\| ob1->title != ob2->title	285	\|\| ob1->title != ob2->title
212	\|\| ob1->msg != ob2->msg	286	\|\| ob1->msg != ob2->msg
…		…
215	\|\| ob1->magic != ob2->magic	289	\|\| ob1->magic != ob2->magic
216	\|\| ob1->slaying != ob2->slaying	290	\|\| ob1->slaying != ob2->slaying
217	\|\| ob1->skill != ob2->skill	291	\|\| ob1->skill != ob2->skill
218	\|\| ob1->value != ob2->value	292	\|\| ob1->value != ob2->value
219	\|\| ob1->animation_id != ob2->animation_id	293	\|\| ob1->animation_id != ob2->animation_id
220	\|\| (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
221	\|\| ob1->client_type != ob2->client_type	295	\|\| ob1->client_type != ob2->client_type
222	\|\| ob1->materialname != ob2->materialname	296	\|\| ob1->material != ob2->material
223	\|\| ob1->lore != ob2->lore	297	\|\| ob1->lore != ob2->lore
224	\|\| ob1->subtype != ob2->subtype	298	\|\| ob1->subtype != ob2->subtype
225	\|\| ob1->move_type != ob2->move_type	299	\|\| ob1->move_type != ob2->move_type
226	\|\| ob1->move_block != ob2->move_block	300	\|\| ob1->move_block != ob2->move_block
227	\|\| ob1->move_allow != ob2->move_allow	301	\|\| ob1->move_allow != ob2->move_allow
228	\|\| ob1->move_on != ob2->move_on	302	\|\| ob1->move_on != ob2->move_on
229	\|\| ob1->move_off != ob2->move_off	303	\|\| ob1->move_off != ob2->move_off
230	\|\| ob1->move_slow != ob2->move_slow	304	\|\| ob1->move_slow != ob2->move_slow
231	\|\| ob1->move_slow_penalty != ob2->move_slow_penalty	305	\|\| fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
232	\|\| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))	306	\|\| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
233	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	307	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
234	return 0;	308	return 0;
235		309
236	if ((ob1->flag ^ ob2->flag)	310	if ((ob1->flag ^ ob2->flag)
…		…
261		335
262	/* 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,
263	* 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
264	* some items equipped, and we don't want those to merge.	338	* some items equipped, and we don't want those to merge.
265	*/	339	*/
266	if (QUERY_FLAG (ob1, FLAG_APPLIED) \|\| QUERY_FLAG (ob2, FLAG_APPLIED))	340	if (ob1->flag [FLAG_APPLIED] \|\| ob2->flag [FLAG_APPLIED])
267	return 0;	341	return 0;
268		342
269	/* 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
270	* 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
271	* check?	345	* check?
272	*/	346	*/
273	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())	347	if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ())
274	return 0;	348	return 0;
275		349
276	switch (ob1->type)	350	switch (ob1->type)
277	{	351	{
278	case SCROLL:	352	case SCROLL:
…		…
334		408
335	// 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
336	// even if our inv is in a player.	410	// even if our inv is in a player.
337	if (envest->is_on_map ())	411	if (envest->is_on_map ())
338	if (object *pl = envest->ms ().player ())	412	if (object *pl = envest->ms ().player ())
339	if (pl->container == env)	413	if (pl->container_ () == env)
340	return pl;	414	return pl;
341	}	415	}
342	else	416	else
343	{	417	{
344	// maybe there is a player standing on the same mapspace	418	// maybe there is a player standing on the same mapspace
345	// this will catch the case where "this" is a player	419	// this will catch the case where "this" is a player
346	if (object *pl = ms ().player ())	420	if (object *pl = ms ().player ())
347	if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look)	421	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
348	\|\| this == pl->container)	422	\|\| pl->container_ () == this)
349	return pl;	423	return pl;
350	}	424	}
351	}	425	}
352		426
353	return 0;	427	return 0;
…		…
371	{	445	{
372	while (op)	446	while (op)
373	{	447	{
374	// adjust by actual difference to account for rounding errors	448	// adjust by actual difference to account for rounding errors
375	// 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
376	weight = weight_adjust_for (op, op->carrying)	450	weight = weight_adjust_for (op, op->carrying + weight)
377	- weight_adjust_for (op, op->carrying - weight);	451	- weight_adjust_for (op, op->carrying);
378		452
379	if (!weight)	453	if (!weight)
380	return;	454	return;
381		455
382	op->carrying += weight;	456	op->carrying += weight;
…		…
409		483
410	sum = weight_adjust_for (this, sum);	484	sum = weight_adjust_for (this, sum);
411		485
412	if (sum != carrying)	486	if (sum != carrying)
413	{	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
414	carrying = sum;	492	carrying = sum;
415		493
416	if (object *pl = visible_to ())	494	if (object *pl = visible_to ())
417	if (pl != this) // player is handled lazily	495	if (pl != this) // player is handled lazily
418	esrv_update_item (UPD_WEIGHT, pl, this);	496	esrv_update_item (UPD_WEIGHT, pl, this);
…		…
431	object_freezer freezer;	509	object_freezer freezer;
432	op->write (freezer);	510	op->write (freezer);
433	return freezer.as_string ();	511	return freezer.as_string ();
434	}	512	}
435		513
436	/*	514	char *
437	* get_nearest_part(multi-object, object 2) returns the part of the	515	object::as_string ()
438	* multi-object 1 which is closest to the second object.
439	* If it's not a multi-object, it is returned.
440	*/
441	object *
442	get_nearest_part (object op, const object pl)
443	{	516	{
444	object tmp, closest;	517	return dump_object (this);
445	int last_dist, i;
446
447	if (!op->more)
448	return op;
449
450	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
451	tmp;
452	tmp = tmp->more)
453	if ((i = distance (tmp, pl)) < last_dist)
454	closest = tmp, last_dist = i;
455
456	return closest;
457	}	518	}
458		519
459	/*	520	/*
460	* 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.
461	* VERRRY slow.	522	* VERRRY slow.
…		…
463	object *	524	object *
464	find_object (tag_t i)	525	find_object (tag_t i)
465	{	526	{
466	for_all_objects (op)	527	for_all_objects (op)
467	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)
468	return op;	544	return op;
469		545
470	return 0;	546	return 0;
471	}	547	}
472		548
…		…
506	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 ());
507	return;	583	return;
508	}	584	}
509		585
510	this->owner = owner;	586	this->owner = owner;
511	}
512
513	int
514	object::slottype () const
515	{
516	if (type == SKILL)
517	{
518	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
519	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
520	}
521	else
522	{
523	if (slot [body_combat].info) return slot_combat;
524	if (slot [body_range ].info) return slot_ranged;
525	}
526
527	return slot_none;
528	}
529
530	bool
531	object::change_weapon (object *ob)
532	{
533	if (current_weapon == ob)
534	return true;
535
536	if (chosen_skill)
537	chosen_skill->flag [FLAG_APPLIED] = false;
538
539	current_weapon = ob;
540	chosen_skill = !ob \|\| ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
541
542	if (chosen_skill)
543	chosen_skill->flag [FLAG_APPLIED] = true;
544
545	update_stats ();
546
547	if (ob)
548	{
549	// now check wether any body locations became invalid, in which case
550	// we cannot apply the weapon at the moment.
551	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
552	if (slot[i].used < 0)
553	{
554	current_weapon = chosen_skill = 0;
555	update_stats ();
556
557	new_draw_info_format (NDI_UNIQUE, 0, this,
558	"You try to balance all your items at once, "
559	"but the %s is just too much for your body. "
560	"[You need to unapply some items first.]", &ob->name);
561	return false;
562	}
563
564	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
565	}
566	else
567	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
568
569	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
570	{
571	LOG (llevError \| logBacktrace, "%s changed to unapplied weapon %s",
572	&name, ob->debug_desc ());
573	return false;
574	}
575
576	return true;
577	}	587	}
578		588
579	/* Zero the key_values on op, decrementing the shared-string	589	/* Zero the key_values on op, decrementing the shared-string
580	* refcounts and freeing the links.	590	* refcounts and freeing the links.
581	*/	591	*/
…		…
634	tail = new_link;	644	tail = new_link;
635	}	645	}
636	}	646	}
637	}	647	}
638		648
639	if (speed < 0)
640	dst->speed_left -= rndm ();
641
642	dst->activate ();	649	dst->activate ();
643	}	650	}
644		651
645	void	652	void
646	object::instantiate ()	653	object::instantiate ()
647	{	654	{
648	if (!uuid.seq) // HACK	655	if (!uuid.seq) // HACK
649	uuid = UUID::gen ();	656	uuid = UUID::gen ();
650		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
651	speed_left = -0.1f;	662	speed_left = -1.;
		663
652	/* 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
653	* 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.
654	* 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
655	* values for the body_used info, so when items are created	667	* values for the body_used info, so when items are created
656	* for it, they can be properly equipped.	668	* for it, they can be properly equipped.
…		…
664	object *	676	object *
665	object::clone ()	677	object::clone ()
666	{	678	{
667	object *neu = create ();	679	object *neu = create ();
668	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
669	neu->map = map; // not copied by copy_to	686	neu->map = map; // not copied by copy_to
670	return neu;	687	return neu;
671	}	688	}
672		689
673	/*	690	/*
…		…
676	* 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.
677	*/	694	*/
678	void	695	void
679	update_turn_face (object *op)	696	update_turn_face (object *op)
680	{	697	{
681	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) \|\| !op->arch)	698	if (!op->flag [FLAG_IS_TURNABLE] \|\| !op->arch)
682	return;	699	return;
683		700
684	SET_ANIMATION (op, op->direction);	701	SET_ANIMATION (op, op->direction);
685	update_object (op, UP_OBJ_FACE);	702	update_object (op, UP_OBJ_FACE);
686	}	703	}
…		…
691	* 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.
692	*/	709	*/
693	void	710	void
694	object::set_speed (float speed)	711	object::set_speed (float speed)
695	{	712	{
696	if (flag [FLAG_FREED] && speed)
697	{
698	LOG (llevError, "Object %s is freed but has speed.\n", &name);
699	speed = 0;
700	}
701
702	this->speed = speed;	713	this->speed = speed;
703		714
704	if (has_active_speed ())	715	if (has_active_speed ())
705	activate ();	716	activate ();
706	else	717	else
…		…
756		767
757	if (!(m.flags_ & P_UPTODATE))	768	if (!(m.flags_ & P_UPTODATE))
758	/* nop */;	769	/* nop */;
759	else if (action == UP_OBJ_INSERT)	770	else if (action == UP_OBJ_INSERT)
760	{	771	{
		772	#if 0
761	// this is likely overkill, TODO: revisit (schmorp)	773	// this is likely overkill, TODO: revisit (schmorp)
762	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	774	if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW))
763	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	775	\|\| (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC))
764	\|\| (op->is_player () && !(m.flags_ & P_PLAYER))	776	\|\| (op->is_player () && !(m.flags_ & P_PLAYER))
765	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	777	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
766	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	778	\|\| (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE))
767	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	779	\|\| (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC))
768	\|\| (m.move_on \| op->move_on ) != m.move_on	780	\|\| (m.move_on \| op->move_on ) != m.move_on
769	\|\| (m.move_off \| op->move_off ) != m.move_off	781	\|\| (m.move_off \| op->move_off ) != m.move_off
770	\|\| (m.move_slow \| op->move_slow) != m.move_slow	782	\|\| (m.move_slow \| op->move_slow) != m.move_slow
771	/* 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
772	* have move_allow right now.	784	* have move_allow right now.
773	*/	785	*/
774	\|\| ((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
775	\|\| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
776	m.invalidate ();	787	m.invalidate ();
		788	#else
		789	// the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
		790	m.invalidate ();
		791	#endif
777	}	792	}
778	/* if the object is being removed, we can't make intelligent	793	/* if the object is being removed, we can't make intelligent
779	* decisions, because remove_ob can't really pass the object	794	* decisions, because remove_ob can't really pass the object
780	* that is being removed.	795	* that is being removed.
781	*/	796	*/
…		…
790	update_object (op->more, action);	805	update_object (op->more, action);
791	}	806	}
792		807
793	object::object ()	808	object::object ()
794	{	809	{
795	SET_FLAG (this, FLAG_REMOVED);	810	this->set_flag (FLAG_REMOVED);
796		811
797	//expmul = 1.0; declared const for the time being	812	//expmul = 1.0; declared const for the time being
798	face = blank_face;	813	face = blank_face;
		814	material = MATERIAL_NULL;
799	}	815	}
800		816
801	object::~object ()	817	object::~object ()
802	{	818	{
803	unlink ();	819	unlink ();
804		820
805	free_key_values (this);	821	free_key_values (this);
806	}	822	}
807
808	static int object_count;
809		823
810	void object::link ()	824	void object::link ()
811	{	825	{
812	assert (!index);//D	826	assert (!index);//D
813	uuid = UUID::gen ();	827	uuid = UUID::gen ();
814	count = ++object_count;
815		828
816	refcnt_inc ();	829	refcnt_inc ();
817	objects.insert (this);	830	objects.insert (this);
		831
		832	++create_count;
		833
818	}	834	}
819		835
820	void object::unlink ()	836	void object::unlink ()
821	{	837	{
822	if (!index)	838	if (!index)
823	return;	839	return;
		840
		841	++destroy_count;
824		842
825	objects.erase (this);	843	objects.erase (this);
826	refcnt_dec ();	844	refcnt_dec ();
827	}	845	}
828		846
…		…
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	{
…		…
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 ();	1103	head->destroy ();
1014	return;	1104	return;
1015	}	1105	}
1016		1106
1017	destroy_inv (false);	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
…		…
1077		1164
1078	above = 0;	1165	above = 0;
1079	below = 0;	1166	below = 0;
1080	env = 0;	1167	env = 0;
1081		1168
1082	/* NO_FIX_PLAYER is set when a great many changes are being	1169	if (pl && pl->is_player ())
1083	* made to players inventory. If set, avoiding the call
1084	* to save cpu time.
1085	*/	1170	{
1086	if (pl)	1171	if (expect_false (pl->contr->combat_ob == this))
1087	if (pl->is_player () && (glow_radius \|\| !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
1088	{	1172	{
1089	pl->update_stats ();	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	}
1090		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
1091	if (glow_radius && pl->is_on_map ())	1187	if (expect_false (glow_radius) && pl->is_on_map ())
1092	update_all_los (pl->map, pl->x, pl->y);	1188	update_all_los (pl->map, pl->x, pl->y);
1093	}	1189	}
1094	}	1190	}
1095	else if (map)	1191	else if (map)
1096	{	1192	{
1097	map->dirty = true;	1193	map->dirty = true;
1098	mapspace &ms = this->ms ();	1194	mapspace &ms = this->ms ();
…		…
1111	close_container ();	1207	close_container ();
1112		1208
1113	--map->players;	1209	--map->players;
1114	map->touch ();	1210	map->touch ();
1115	}	1211	}
1116	else if (pl->container == this)	1212	else if (pl->container_ () == this)
1117	{	1213	{
1118	// removing a container should close it	1214	// removing a container should close it
1119	close_container ();	1215	close_container ();
1120	}	1216	}
1121		1217	else
1122	esrv_del_item (pl->contr, count);	1218	esrv_del_item (pl->contr, count);
1123	}	1219	}
1124		1220
1125	/* link the object above us */	1221	/* link the object above us */
1126	// re-link, make sure compiler can easily use cmove	1222	// re-link, make sure compiler can easily use cmove
1127	*(above ? &above->below : &ms.top) = below;	1223	*(above ? &above->below : &ms.top) = below;
…		…
1137		1233
1138	int check_walk_off = !flag [FLAG_NO_APPLY];	1234	int check_walk_off = !flag [FLAG_NO_APPLY];
1139		1235
1140	if (object *pl = ms.player ())	1236	if (object *pl = ms.player ())
1141	{	1237	{
1142	if (pl->container == this)	1238	if (pl->container_ () == this)
1143	/* If a container that the player is currently using somehow gets	1239	/* If a container that the player is currently using somehow gets
1144	* removed (most likely destroyed), update the player view	1240	* removed (most likely destroyed), update the player view
1145	* appropriately.	1241	* appropriately.
1146	*/	1242	*/
1147	pl->close_container ();	1243	pl->close_container ();
…		…
1151	//TODO: update floorbox to preserve ordering	1247	//TODO: update floorbox to preserve ordering
1152	if (pl->contr->ns)	1248	if (pl->contr->ns)
1153	pl->contr->ns->floorbox_update ();	1249	pl->contr->ns->floorbox_update ();
1154	}	1250	}
1155		1251
		1252	if (check_walk_off)
1156	for (tmp = ms.bot; tmp; tmp = tmp->above)	1253	for (object above, tmp = ms.bot; tmp; tmp = above)
1157	{	1254	{
		1255	above = tmp->above;
		1256
1158	/* 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
1159	* being removed.	1258	* being removed.
1160	*/	1259	*/
1161		1260
1162	/* See if object moving off should effect something */	1261	/* See if object moving off should effect something */
1163	if (check_walk_off
1164	&& ((move_type & tmp->move_off)	1262	if ((move_type & tmp->move_off)
1165	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1263	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1166	{
1167	move_apply (tmp, this, 0);	1264	move_apply (tmp, this, 0);
1168
1169	if (destroyed ())
1170	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1171	}	1265	}
1172
1173	last = tmp;
1174	}
1175		1266
1176	if (affects_los ())	1267	if (affects_los ())
1177	update_all_los (map, x, y);	1268	update_all_los (map, x, y);
1178	}	1269	}
1179	}	1270	}
…		…
1223		1314
1224	object *prev = this;	1315	object *prev = this;
1225		1316
1226	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)	1317	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)
1227	{	1318	{
1228	object *op = arch_to_object (at);	1319	object *op = at->instance ();
1229		1320
1230	op->name = name;	1321	op->name = name;
1231	op->name_pl = name_pl;	1322	op->name_pl = name_pl;
1232	op->title = title;	1323	op->title = title;
1233		1324
…		…
1271	* 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
1272	* to be set if special handling is needed.	1363	* to be set if special handling is needed.
1273	*	1364	*
1274	* Return value:	1365	* Return value:
1275	* new object if 'op' was merged with other object	1366	* new object if 'op' was merged with other object
1276	* NULL if 'op' was destroyed	1367	* NULL if there was an error (destroyed, blocked etc.)
1277	* just 'op' otherwise	1368	* just 'op' otherwise
1278	*/	1369	*/
1279	object *	1370	object *
1280	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)
1281	{	1372	{
…		…
1318	// from here :/	1409	// from here :/
1319	op->nrof += tmp->nrof;	1410	op->nrof += tmp->nrof;
1320	tmp->destroy ();	1411	tmp->destroy ();
1321	}	1412	}
1322		1413
1323	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 */
1324	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1415	op->clr_flag (FLAG_INV_LOCKED);
1325		1416
1326	if (!QUERY_FLAG (op, FLAG_ALIVE))	1417	if (!op->flag [FLAG_ALIVE])
1327	CLEAR_FLAG (op, FLAG_NO_STEAL);	1418	op->clr_flag (FLAG_NO_STEAL);
1328		1419
1329	if (flag & INS_BELOW_ORIGINATOR)	1420	if (flag & INS_BELOW_ORIGINATOR)
1330	{	1421	{
1331	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)
1332	{	1423	{
…		…
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
…		…
1508		1599
1509	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1600	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1510	if (tmp->arch->archname == archname) /* same archetype */	1601	if (tmp->arch->archname == archname) /* same archetype */
1511	tmp->destroy ();	1602	tmp->destroy ();
1512		1603
1513	object *tmp = arch_to_object (archetype::find (archname));	1604	object *tmp = archetype::find (archname)->instance ();
1514		1605
1515	tmp->x = op->x;	1606	tmp->x = op->x;
1516	tmp->y = op->y;	1607	tmp->y = op->y;
1517		1608
1518	insert_ob_in_map (tmp, op->map, op, 0);	1609	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1523	{	1614	{
1524	if (where->env)	1615	if (where->env)
1525	return where->env->insert (this);	1616	return where->env->insert (this);
1526	else	1617	else
1527	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;
1528	}	1641	}
1529		1642
1530	/*	1643	/*
1531	* decrease(object, number) decreases a specified number from	1644	* decrease(object, number) decreases a specified number from
1532	* 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
…		…
1672	if (op->glow_radius && is_on_map ())	1785	if (op->glow_radius && is_on_map ())
1673	{	1786	{
1674	update_stats ();	1787	update_stats ();
1675	update_all_los (map, x, y);	1788	update_all_los (map, x, y);
1676	}	1789	}
1677	else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])	1790	else if (is_player ())
1678	// if this is a player's inventory, update stats	1791	// if this is a player's inventory, update stats
1679	update_stats ();	1792	contr->queue_stats_update ();
1680		1793
1681	INVOKE_OBJECT (INSERT, this);	1794	INVOKE_OBJECT (INSERT, this);
1682		1795
1683	return op;	1796	return op;
1684	}	1797	}
…		…
1704	* on top.	1817	* on top.
1705	*/	1818	*/
1706	int	1819	int
1707	check_move_on (object op, object originator)	1820	check_move_on (object op, object originator)
1708	{	1821	{
1709	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1822	if (op->flag [FLAG_NO_APPLY])
1710	return 0;	1823	return 0;
1711		1824
1712	object *tmp;	1825	object *tmp;
1713	maptile *m = op->map;	1826	maptile *m = op->map;
1714	int x = op->x, y = op->y;	1827	int x = op->x, y = op->y;
…		…
1751	* Second check makes sure that the movement types not being slowed	1864	* Second check makes sure that the movement types not being slowed
1752	* (~slow_move) is not blocked on this space - just because the	1865	* (~slow_move) is not blocked on this space - just because the
1753	* 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
1754	* 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.
1755	*/	1868	*/
1756	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1869	if (!op->flag [FLAG_WIZPASS])
1757	{	1870	{
1758	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1871	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1759	((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))
1760	{	1873	{
1761	float diff = tmp->move_slow_penalty * fabs (op->speed);	1874	float diff = tmp->move_slow_penalty * fabs (op->speed);
…		…
1892	void	2005	void
1893	flag_inv (object *op, int flag)	2006	flag_inv (object *op, int flag)
1894	{	2007	{
1895	for (object *tmp = op->inv; tmp; tmp = tmp->below)	2008	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1896	{	2009	{
1897	SET_FLAG (tmp, flag);	2010	tmp->set_flag (flag);
1898	flag_inv (tmp, flag);	2011	flag_inv (tmp, flag);
1899	}	2012	}
1900	}	2013	}
1901		2014
1902	/*	2015	/*
…		…
1905	void	2018	void
1906	unflag_inv (object *op, int flag)	2019	unflag_inv (object *op, int flag)
1907	{	2020	{
1908	for (object *tmp = op->inv; tmp; tmp = tmp->below)	2021	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1909	{	2022	{
1910	CLEAR_FLAG (tmp, flag);	2023	tmp->clr_flag (flag);
1911	unflag_inv (tmp, flag);	2024	unflag_inv (tmp, flag);
1912	}	2025	}
1913	}	2026	}
1914		2027
1915	/*	2028	/*
…		…
2105	{	2218	{
2106	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2219	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2107	}	2220	}
2108		2221
2109	/*	2222	/*
2110	* find_dir_2(delta-x,delta-y) will return a direction in which	2223	* find_dir_2(delta-x,delta-y) will return a direction value
2111	* an object which has subtracted the x and y coordinates of another	2224	* for running into direct [dx, dy].
2112	* object, needs to travel toward it.	2225	* (the opposite of crossfire's find_dir_2!)
2113	*/	2226	*/
2114	int	2227	int
2115	find_dir_2 (int x, int y)	2228	find_dir_2 (int x, int y)
2116	{	2229	{
		2230	#if 1 // new algorithm
		2231	// this works by putting x, y into 16 sectors, which
		2232	// are not equal sized, but are a better approximation
		2233	// then the old algorithm, and then using a mapping
		2234	// table to map it into a direction value.
		2235	// basically, it maps these comparisons to each bit
		2236	// bit #3: x < 0
		2237	// bit #2: y < 0
		2238	// bit #1: x > y
		2239	// bit #0: x > 2y
		2240
		2241	static const uint8 dir[16] = {
		2242	4, 5, 4, 3,
		2243	2, 1, 2, 3,
		2244	6, 5, 6, 7,
		2245	8, 1, 8, 7,
		2246	};
		2247	int sector = 0;
		2248
		2249	// this is a bit ugly, but more likely to result in branchless code
		2250	sector \|= x < 0 ? 8 : 0;
		2251	x = x < 0 ? -x : x; // abs
		2252
		2253	sector \|= y < 0 ? 4 : 0;
		2254	y = y < 0 ? -y : y; // abs
		2255
		2256	if (x > y)
		2257	{
		2258	sector \|= 2;
		2259
		2260	if (x > y * 2)
		2261	sector \|= 1;
		2262	}
		2263	else
		2264	{
		2265	if (y > x * 2)
		2266	sector \|= 1;
		2267	else if (!y)
		2268	return 0; // x == 0 here
		2269	}
		2270
		2271	return dir [sector];
		2272	#else // old algorithm
2117	int q;	2273	int q;
2118		2274
2119	if (y)	2275	if (y)
2120	q = x * 100 / y;	2276	q = 128 * x / y;
2121	else if (x)	2277	else if (x)
2122	q = -300 * x;	2278	q = -512 * x; // to make it > 309
2123	else	2279	else
2124	return 0;	2280	return 0;
2125		2281
2126	if (y > 0)	2282	if (y > 0)
2127	{	2283	{
2128	if (q < -242)	2284	if (q < -309) return 7;
		2285	if (q < -52) return 6;
		2286	if (q < 52) return 5;
		2287	if (q < 309) return 4;
		2288
2129	return 3;	2289	return 3;
2130	if (q < -41)	2290	}
2131	return 2;	2291	else
2132	if (q < 41)	2292	{
2133	return 1;	2293	if (q < -309) return 3;
2134	if (q < 242)	2294	if (q < -52) return 2;
2135	return 8;	2295	if (q < 52) return 1;
		2296	if (q < 309) return 8;
		2297
2136	return 7;	2298	return 7;
2137	}	2299	}
2138		2300	#endif
2139	if (q < -242)
2140	return 7;
2141	if (q < -41)
2142	return 6;
2143	if (q < 41)
2144	return 5;
2145	if (q < 242)
2146	return 4;
2147
2148	return 3;
2149	}	2301	}
2150		2302
2151	/*	2303	/*
2152	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2304	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2153	* between two directions (which are expected to be absolute (see absdir())	2305	* between two directions (which are expected to be absolute (see absdir())
2154	*/	2306	*/
2155	int	2307	int
2156	dirdiff (int dir1, int dir2)	2308	dirdiff (int dir1, int dir2)
2157	{	2309	{
2158	int d;
2159
2160	d = abs (dir1 - dir2);	2310	int d = abs (dir1 - dir2);
2161	if (d > 4)
2162	d = 8 - d;
2163		2311
2164	return d;	2312	return d > 4 ? 8 - d : d;
2165	}	2313	}
2166		2314
2167	/* peterm:	2315	/* peterm:
2168	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2316	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
2169	* Basically, this is a table of directions, and what directions	2317	* Basically, this is a table of directions, and what directions
…		…
2171	* This basically means that if direction is 15, then it could either go	2319	* This basically means that if direction is 15, then it could either go
2172	* direction 4, 14, or 16 to get back to where we are.	2320	* direction 4, 14, or 16 to get back to where we are.
2173	* Moved from spell_util.c to object.c with the other related direction	2321	* Moved from spell_util.c to object.c with the other related direction
2174	* functions.	2322	* functions.
2175	*/	2323	*/
2176	const int reduction_dir[SIZEOFFREE][3] = {	2324	static const int reduction_dir[SIZEOFFREE][3] = {
2177	{0, 0, 0}, /* 0 */	2325	{0, 0, 0}, /* 0 */
2178	{0, 0, 0}, /* 1 */	2326	{0, 0, 0}, /* 1 */
2179	{0, 0, 0}, /* 2 */	2327	{0, 0, 0}, /* 2 */
2180	{0, 0, 0}, /* 3 */	2328	{0, 0, 0}, /* 3 */
2181	{0, 0, 0}, /* 4 */	2329	{0, 0, 0}, /* 4 */
…		…
2275	* Add a check so we can't pick up invisible objects (0.93.8)	2423	* Add a check so we can't pick up invisible objects (0.93.8)
2276	*/	2424	*/
2277	int	2425	int
2278	can_pick (const object who, const object item)	2426	can_pick (const object who, const object item)
2279	{	2427	{
2280	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2428	return /who->flag [FLAG_WIZ]\|\| /
2281	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2429	(item->weight > 0 && !item->flag [FLAG_NO_PICK] &&
2282	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () \|\| item->weight < who->weight / 3));	2430	!item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () \|\| item->weight < who->weight / 3));
2283	}	2431	}
2284		2432
2285	/*	2433	/*
2286	* create clone from object to another	2434	* create clone from object to another
2287	*/	2435	*/
…		…
2452	{	2600	{
2453	return map ? map->region (x, y)	2601	return map ? map->region (x, y)
2454	: region::default_region ();	2602	: region::default_region ();
2455	}	2603	}
2456		2604
2457	const materialtype_t *
2458	object::dominant_material () const
2459	{
2460	if (materialtype_t *mt = name_to_material (materialname))
2461	return mt;
2462
2463	return name_to_material (shstr_unknown);
2464	}
2465
2466	void	2605	void
2467	object::open_container (object *new_container)	2606	object::open_container (object *new_container)
2468	{	2607	{
2469	if (container == new_container)	2608	if (container == new_container)
2470	return;	2609	return;
…		…
2504	// TODO: this does not seem to serve any purpose anymore?	2643	// TODO: this does not seem to serve any purpose anymore?
2505	#if 0	2644	#if 0
2506	// insert the "Close Container" object.	2645	// insert the "Close Container" object.
2507	if (archetype *closer = new_container->other_arch)	2646	if (archetype *closer = new_container->other_arch)
2508	{	2647	{
2509	object *closer = arch_to_object (new_container->other_arch);	2648	object *closer = new_container->other_arch->instance ();
2510	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2649	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2511	new_container->insert (closer);	2650	new_container->insert (closer);
2512	}	2651	}
2513	#endif	2652	#endif
2514		2653
…		…
2540	return splay (tmp);	2679	return splay (tmp);
2541		2680
2542	return 0;	2681	return 0;
2543	}	2682	}
2544		2683
		2684	//-GPL
		2685
		2686	void
		2687	object::force_set_timer (int duration)
		2688	{
		2689	this->duration = 1;
		2690	this->speed_left = -1.f;
		2691
		2692	this->set_speed (duration ? 1.f / duration : 0.f);
		2693	}
		2694
2545	object *	2695	object *
2546	object::force_add (shstr_tmp name, int duration)	2696	object::force_add (shstr_tmp name, int duration)
2547	{	2697	{
2548	if (object *force = force_find (name))	2698	if (object *force = force_find (name))
2549	force->destroy ();	2699	force->destroy ();
2550		2700
2551	object *force = get_archetype (FORCE_NAME);	2701	object *force = get_archetype (FORCE_NAME);
2552		2702
2553	force->slaying = name;	2703	force->slaying = name;
2554	force->stats.food = 1;	2704	force->force_set_timer (duration);
2555	force->speed_left = -1.f;
2556
2557	force->set_speed (duration ? 1.f / duration : 0.f);
2558	force->flag [FLAG_IS_USED_UP] = true;
2559	force->flag [FLAG_APPLIED] = true;	2705	force->flag [FLAG_APPLIED] = true;
2560		2706
2561	return insert (force);	2707	return insert (force);
2562	}	2708	}
2563		2709
2564	void	2710	void
…		…
2613		2759
2614	insert (force);	2760	insert (force);
2615	}	2761	}
2616	}	2762	}
2617		2763
		2764	void object::change_move_type (MoveType mt)
		2765	{
		2766	if (move_type == mt)
		2767	return;
		2768
		2769	if (is_on_map ())
		2770	{
		2771	// we are on the map, so handle move_on/off effects
		2772	remove ();
		2773	move_type = mt;
		2774	map->insert (this, x, y, this);
		2775	}
		2776	else
		2777	move_type = mt;
		2778	}
		2779
		2780	/* object should be a player.
		2781	* we return the object the player has marked with the 'mark' command
		2782	* below. If no match is found (or object has changed), we return
		2783	* NULL. We leave it up to the calling function to print messages if
		2784	* nothing is found.
		2785	*/
		2786	object *
		2787	object::mark () const
		2788	{
		2789	if (contr && contr->mark && contr->mark->env == this)
		2790	return contr->mark;
		2791	else
		2792	return 0;
		2793	}
		2794

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.287 by root, Sat Oct 3 20:11:12 2009 UTC vs. Revision 1.333 by root, Thu Apr 22 03:53:40 2010 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.287 by root, Sat Oct 3 20:11:12 2009 UTC vs.
Revision 1.333 by root, Thu Apr 22 03:53:40 2010 UTC