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.292 by root, Mon Oct 19 21:48:49 2009 UTC vs.
Revision 1.365 by root, Sat Nov 17 23:33:17 2018 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,2011,2012,2013,2014,2015,2016 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 it under	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* the terms of the Affero GNU General Public License as published by the	9	* the terms of the Affero GNU General Public License as published by the
10	* Free Software Foundation, either version 3 of the License, or (at your	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* 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 Affero GNU General Public License	18	* You should have received a copy of the Affero GNU General Public License
19	* and the GNU General Public License along with this program. If not, see	19	* and the GNU General Public License along with this program. If not, see
20	* <http://www.gnu.org/licenses/>.	20	* <http://www.gnu.org/licenses/>.
21	*	21	*
22	* 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>
23	*/	23	*/
24		24
25	#include <global.h>	25	#include <global.h>
26	#include <stdio.h>	26	#include <stdio.h>
27	#include <sys/types.h>	27	#include <sys/types.h>
28	#include <sys/uio.h>	28	#include <sys/uio.h>
29	#include <object.h>	29	#include <object.h>
30	#include <sproto.h>	30	#include <sproto.h>
31	#include <loader.h>
32		31
33	#include <bitset>	32	#include <bitset>
34		33
35	UUID UUID::cur;	34	UUID UUID::cur;
36	static uint64_t seq_next_save;	35	static uint64_t seq_next_save;
…		…
38	uint32_t mapspace::smellcount = 10000;	37	uint32_t mapspace::smellcount = 10000;
39		38
40	objectvec objects;	39	objectvec objects;
41	activevec actives;	40	activevec actives;
42		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
		49
43	short freearr_x[SIZEOFFREE] = {	50	int freearr_x[SIZEOFFREE] = {
44	0,	51	0,
45	0, 1, 1, 1, 0, -1, -1, -1,	52	0, 1, 1, 1, 0, -1, -1, -1,
46	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,
47	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	54	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
48	};	55	};
49	short freearr_y[SIZEOFFREE] = {	56	int freearr_y[SIZEOFFREE] = {
50	0,	57	0,
51	-1, -1, 0, 1, 1, 1, 0, -1,	58	-1, -1, 0, 1, 1, 1, 0, -1,
52	-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,
53	-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
54	};
55	int maxfree[SIZEOFFREE] = {
56	0,
57	9, 10, 13, 14, 17, 18, 21, 22,
58	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
59	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
60	};	61	};
61	int freedir[SIZEOFFREE] = {	62	int freedir[SIZEOFFREE] = {
62	0,	63	0,
63	1, 2, 3, 4, 5, 6, 7, 8,	64	1, 2, 3, 4, 5, 6, 7, 8,
64	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,
65	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
66	};	67	};
67		68
		69	static int maxfree[SIZEOFFREE] = {
		70	0,
		71	9, 10, 13, 14, 17, 18, 21, 22,
		72	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
		73	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
		74	};
		75
		76	const char *wall_suffix[16] = {
		77	"0",
		78	"1_3",
		79	"1_4",
		80	"2_1_2",
		81	"1_2",
		82	"2_2_4",
		83	"2_2_1",
		84	"3_1",
		85	"1_1",
		86	"2_2_3",
		87	"2_2_2",
		88	"3_3",
		89	"2_1_1",
		90	"3_4",
		91	"3_2",
		92	"4"
		93	};
		94
68	static void	95	static void
69	write_uuid (uval64 skip, bool sync)	96	write_uuid (uval64 skip, bool sync)
70	{	97	{
71	CALL_BEGIN (2);	98	CALL_BEGIN (2);
72	CALL_ARG_SV (newSVval64 (skip));	99	CALL_ARG_SV (newSVval64 (skip));
…		…
74	CALL_CALL ("cf::write_uuid", G_DISCARD);	101	CALL_CALL ("cf::write_uuid", G_DISCARD);
75	CALL_END;	102	CALL_END;
76	}	103	}
77		104
78	static void	105	static void
79	read_uuid (void)	106	read_uuid ()
80	{	107	{
81	char filename[MAX_BUF];	108	char filename[MAX_BUF];
82		109
83	sprintf (filename, "%s/uuid", settings.localdir);	110	sprintf (filename, "%s/uuid", settings.localdir);
84		111
…		…
98		125
99	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	126	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100	_exit (1);	127	_exit (1);
101	}	128	}
102		129
103	UUID::BUF buf;	130	char buf [UUID::MAX_LEN];
104	buf[0] = 0;	131	buf[0] = 0;
105	fgets (buf, sizeof (buf), fp);	132	fgets (buf, sizeof (buf), fp);
106		133
107	if (!UUID::cur.parse (buf))	134	if (!UUID::cur.parse (buf))
108	{	135	{
…		…
135		162
136	void	163	void
137	UUID::init ()	164	UUID::init ()
138	{	165	{
139	read_uuid ();	166	read_uuid ();
		167	}
		168
		169	bool
		170	UUID::parse (const char *s)
		171	{
		172	if (*s++ != '<' || *s++ != '1' || *s++ != '.')
		173	return false;
		174
		175	seq = 0;
		176
		177	while (*s != '>')
		178	{
		179	if (*s < '0')
		180	return false;
		181
		182	// this gives nice branchless code with gcc
		183	assert ('0' < 'a' && '0' == 48 && 'a' == 97);
		184	int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
		185
		186	seq = (seq << 4) | digit;
		187
		188	++s;
		189	}
		190
		191	return true;
		192	}
		193
		194	char *
		195	UUID::append (char *buf) const
		196	{
		197	*buf++ = '<';
		198	*buf++ = '1';
		199	*buf++ = '.';
		200
		201	uint64_t seq = this->seq;
		202	const int bits = 64;
		203	char nz = 0;
		204	static const char tohex [] = "0123456789abcdef";
		205
		206	// assert (len >= 3 + bits / 4 + 1 + 1);
		207	for (int i = bits / 4; --i; )
		208	{
		209	uint8_t digit = seq >> (bits - 4);
		210
		211	*buf = tohex [digit];
		212	nz |= digit;
		213	buf += nz ? 1 : 0;
		214	seq <<= 4;
		215	}
		216
		217	// last digit is special - always emit
		218	uint8_t digit = seq >> (bits - 4);
		219	*buf++ = tohex [digit];
		220
		221	*buf++ = '>';
		222
		223	return buf;
		224	}
		225
		226	char *
		227	UUID::c_str () const
		228	{
		229	static char buf [MAX_LEN];
		230	*append (buf) = 0;
		231	return buf;
140	}	232	}
141		233
142	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	234	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
143	static bool	235	static bool
144	compare_ob_value_lists_one (const object *wants, const object *has)	236	compare_ob_value_lists_one (const object *wants, const object *has)
145	{	237	{
146	/* n-squared behaviour (see kv_get), but I'm hoping both	238	/* n-squared behaviour (see kv.get), but I'm hoping both
147	* objects with lists are rare, and lists stay short. If not, use a	239	* objects with lists are rare, and lists stay short. If not, use a
148	* different structure or at least keep the lists sorted...	240	* different structure or at least keep the lists sorted...
149	*/	241	*/
150		242
151	/* For each field in wants, */	243	/* For each field in wants, */
152	for (key_value *kv = wants->key_values; kv; kv = kv->next)	244	for (key_value *kv = wants->kv.first; kv; kv = kv->next)
153	if (has->kv_get (kv->key) != kv->value)	245	if (has->kv.get (kv->key) != kv->value)
154	return false;	246	return false;
155		247
156	/* If we get here, every field in wants has a matching field in has. */	248	/* If we get here, every field in wants has a matching field in has. */
157	return true;	249	return true;
158	}	250	}
…		…
180	* Improvements made with merge: Better checking on potion, and also	272	* Improvements made with merge: Better checking on potion, and also
181	* check weight	273	* check weight
182	*/	274	*/
183	bool object::can_merge_slow (object *ob1, object *ob2)	275	bool object::can_merge_slow (object *ob1, object *ob2)
184	{	276	{
185	/* A couple quicksanity checks */	277	/* A couple quick sanity checks */
186	if (ob1 == ob2	278	if (ob1 == ob2
187	|| ob1->type != ob2->type	279	|| ob1->type != ob2->type
188	|| ob1->speed != ob2->speed
189	|| ob1->value != ob2->value	280	|| ob1->value != ob2->value
190	|| ob1->name != ob2->name)	281	|| ob1->name != ob2->name
		282	|| ob1->custom_name != ob2->custom_name
		283	|| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
191	return 0;	284	return 0;
192		285
193	/* Do not merge objects if nrof would overflow, assume nrof	286	/* Do not merge objects if nrof would overflow, assume nrof
194	* is always 0 .. 2**31-1 */	287	* is always 0 .. 2**31-1 */
195	if (ob1->nrof > 0x7fffffff - ob2->nrof)	288	if (ob1->nrof > 0x7fffffff - ob2->nrof)
…		…
199	* This is to the comparison of the flags below will be OK. We	292	* This is to the comparison of the flags below will be OK. We
200	* just can't ignore the been applied or identified flags, as they	293	* just can't ignore the been applied or identified flags, as they
201	* are not equal - just if it has been identified, the been_applied	294	* are not equal - just if it has been identified, the been_applied
202	* flags lose any meaning.	295	* flags lose any meaning.
203	*/	296	*/
204	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	297	if (ob1->flag [FLAG_IDENTIFIED])
205	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	298	ob1->set_flag (FLAG_BEEN_APPLIED);
206		299
207	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	300	if (ob2->flag [FLAG_IDENTIFIED])
208	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	301	ob2->set_flag (FLAG_BEEN_APPLIED);
209		302
210	if (ob1->arch->archname != ob2->arch->archname	303	if (ob1->arch->archname != ob2->arch->archname
211	|| ob1->name != ob2->name	304	|| ob1->name != ob2->name
212	|| ob1->title != ob2->title	305	|| ob1->title != ob2->title
213	|| ob1->msg != ob2->msg	306	|| ob1->msg != ob2->msg
…		…
216	|| ob1->magic != ob2->magic	309	|| ob1->magic != ob2->magic
217	|| ob1->slaying != ob2->slaying	310	|| ob1->slaying != ob2->slaying
218	|| ob1->skill != ob2->skill	311	|| ob1->skill != ob2->skill
219	|| ob1->value != ob2->value	312	|| ob1->value != ob2->value
220	|| ob1->animation_id != ob2->animation_id	313	|| ob1->animation_id != ob2->animation_id
221	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other	314	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
222	|| ob1->client_type != ob2->client_type	315	|| ob1->client_type != ob2->client_type
223	|| ob1->materialname != ob2->materialname	316	|| ob1->material != ob2->material
224	|| ob1->lore != ob2->lore	317	|| ob1->lore != ob2->lore
225	|| ob1->subtype != ob2->subtype	318	|| ob1->subtype != ob2->subtype
226	|| ob1->move_type != ob2->move_type	319	|| ob1->move_type != ob2->move_type
227	|| ob1->move_block != ob2->move_block	320	|| ob1->move_block != ob2->move_block
228	|| ob1->move_allow != ob2->move_allow	321	|| ob1->move_allow != ob2->move_allow
229	|| ob1->move_on != ob2->move_on	322	|| ob1->move_on != ob2->move_on
230	|| ob1->move_off != ob2->move_off	323	|| ob1->move_off != ob2->move_off
231	|| ob1->move_slow != ob2->move_slow	324	|| ob1->move_slow != ob2->move_slow
232	|| ob1->move_slow_penalty != ob2->move_slow_penalty	325	|| fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
233	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))	326	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
234	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	327	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
235	return 0;	328	return 0;
236		329
237	if ((ob1->flag ^ ob2->flag)	330	if ((ob1->flag ^ ob2->flag)
…		…
258	/* inventory ok - still need to check rest of this object to see	351	/* inventory ok - still need to check rest of this object to see
259	* if it is valid.	352	* if it is valid.
260	*/	353	*/
261	}	354	}
262		355
263	/* Don't merge objects that are applied. With the new 'body' code,	356	/* Don't merge objects that are applied. With the new 'body' code,
264	* it is possible for most any character to have more than one of	357	* it is possible for most any character to have more than one of
265	* some items equipped, and we don't want those to merge.	358	* some items equipped, and we don't want those to merge.
266	*/	359	*/
267	if (QUERY_FLAG (ob1, FLAG_APPLIED) || QUERY_FLAG (ob2, FLAG_APPLIED))	360	if (ob1->flag [FLAG_APPLIED] || ob2->flag [FLAG_APPLIED])
268	return 0;	361	return 0;
269		362
270	/* Note sure why the following is the case - either the object has to	363	/* Not sure why the following is the case - either the object has to
271	* be animated or have a very low speed. Is this an attempted monster	364	* be animated or have a very low speed. Is this an attempted monster
272	* check?	365	* check?
273	*/	366	*/
274	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())	367	if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ())
275	return 0;	368	return 0;
276		369
277	switch (ob1->type)	370	switch (ob1->type)
278	{	371	{
279	case SCROLL:	372	case SCROLL:
280	if (ob1->level != ob2->level)	373	if (ob1->level != ob2->level)
281	return 0;	374	return 0;
282	break;	375	break;
283	}	376	}
284		377
285	if (ob1->key_values || ob2->key_values)	378	if (!ob1->kv.empty () || !ob2->kv.empty ())
286	{	379	{
287	/* At least one of these has key_values. */	380	/* At least one of these has key_values. */
288	if ((!ob1->key_values) != (!ob2->key_values))	381	if (ob1->kv.empty () != ob2->kv.empty ())
289	return 0; /* One has fields, but the other one doesn't. */	382	return 0; /* One has fields, but the other one doesn't. */
290		383
291	if (!compare_ob_value_lists (ob1, ob2))	384	if (!compare_ob_value_lists (ob1, ob2))
292	return 0;	385	return 0;
293	}	386	}
…		…
353		446
354	return 0;	447	return 0;
355	}	448	}
356		449
357	// adjust weight per container type ("of holding")	450	// adjust weight per container type ("of holding")
358	static sint32	451	static weight_t
359	weight_adjust_for (object *op, sint32 weight)	452	weight_adjust_for (object *op, weight_t weight)
360	{	453	{
361	return op->type == CONTAINER	454	if (op->type == CONTAINER)
362	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	455	weight -= weight * op->stats.Str / 100;
363	: weight;
364	}
365		456
		457	return weight;
		458	}
		459
366	/*	460	/*
367	* adjust_weight(object, weight) adds the specified weight to an object,	461	* subtracts, then adds, the specified weight to an object,
368	* and also updates how much the environment(s) is/are carrying.	462	* and also updates how much the environment(s) is/are carrying.
369	*/	463	*/
370	static void	464	static void
371	adjust_weight (object *op, sint32 weight)	465	adjust_weight (object *op, weight_t sub, weight_t add)
372	{	466	{
373	while (op)	467	while (op)
374	{	468	{
375	// adjust by actual difference to account for rounding errors	469	weight_t carrying = (weight_t)op->carrying
376	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct	470	- weight_adjust_for (op, sub)
377	weight = weight_adjust_for (op, op->carrying)	471	+ weight_adjust_for (op, add);
378	- weight_adjust_for (op, op->carrying - weight);
379		472
380	if (!weight)	473	sub = op->carrying;
381	return;
382
383	op->carrying += weight;	474	op->carrying = carrying;
		475	add = op->carrying;
384		476
385	if (object *pl = op->visible_to ())	477	if (object *pl = op->visible_to ())
386	if (pl != op) // player is handled lazily	478	if (pl != op) // player is handled lazily
387	esrv_update_item (UPD_WEIGHT, pl, op);	479	esrv_update_item (UPD_WEIGHT, pl, op);
388		480
…		…
396	* containers are carrying, and sums it up.	488	* containers are carrying, and sums it up.
397	*/	489	*/
398	void	490	void
399	object::update_weight ()	491	object::update_weight ()
400	{	492	{
401	sint32 sum = 0;	493	weight_t sum = 0;
402		494
403	for (object *op = inv; op; op = op->below)	495	for (object *op = inv; op; op = op->below)
404	{	496	{
405	if (op->inv)
406	op->update_weight ();	497	op->update_weight ();
407		498
408	sum += op->total_weight ();	499	sum += weight_adjust_for (this, op->total_weight ());
409	}	500	}
410
411	sum = weight_adjust_for (this, sum);
412		501
413	if (sum != carrying)	502	if (sum != carrying)
414	{	503	{
		504	if (carrying != sum && carrying)//D
		505	LOG (llevDebug, "updating carrying got %ld, expected %ld (%s)\n",
		506	(long long)sum, (long long)carrying, debug_desc ());
		507
415	carrying = sum;	508	carrying = sum;
416		509
417	if (object *pl = visible_to ())	510	if (object *pl = visible_to ())
418	if (pl != this) // player is handled lazily	511	if (pl != this) // player is handled lazily
419	esrv_update_item (UPD_WEIGHT, pl, this);	512	esrv_update_item (UPD_WEIGHT, pl, this);
…		…
439	{	532	{
440	return dump_object (this);	533	return dump_object (this);
441	}	534	}
442		535
443	/*	536	/*
444	* get_nearest_part(multi-object, object 2) returns the part of the
445	* multi-object 1 which is closest to the second object.
446	* If it's not a multi-object, it is returned.
447	*/
448	object *
449	get_nearest_part (object *op, const object *pl)
450	{
451	object *tmp, *closest;
452	int last_dist, i;
453
454	if (!op->more)
455	return op;
456
457	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
458	tmp;
459	tmp = tmp->more)
460	if ((i = distance (tmp, pl)) < last_dist)
461	closest = tmp, last_dist = i;
462
463	return closest;
464	}
465
466	/*
467	* Returns the object which has the count-variable equal to the argument.	537	* Returns the object which has the count-variable equal to the argument.
468	* VERRRY slow.	538	* VERRRY slow.
469	*/	539	*/
470	object *	540	object *
471	find_object (tag_t i)	541	find_object (tag_t i)
472	{	542	{
473	for_all_objects (op)	543	for_all_objects (op)
474	if (op->count == i)	544	if (op->count == i)
		545	return op;
		546
		547	return 0;
		548	}
		549
		550	/*
		551	* Returns the object which has the uuid equal to the argument.
		552	* MOAR VERRRY slow.
		553	*/
		554
		555	object *
		556	find_object_uuid (UUID i)
		557	{
		558	for_all_objects (op)
		559	if (op->uuid == i)
475	return op;	560	return op;
476		561
477	return 0;	562	return 0;
478	}	563	}
479		564
…		…
513	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());	598	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
514	return;	599	return;
515	}	600	}
516		601
517	this->owner = owner;	602	this->owner = owner;
518	}
519
520	int
521	object::slottype () const
522	{
523	if (type == SKILL)
524	{
525	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
526	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
527	}
528	else
529	{
530	if (slot [body_combat].info) return slot_combat;
531	if (slot [body_range ].info) return slot_ranged;
532	}
533
534	return slot_none;
535	}
536
537	bool
538	object::change_weapon (object *ob)
539	{
540	if (current_weapon == ob)
541	return true;
542
543	if (chosen_skill)
544	chosen_skill->flag [FLAG_APPLIED] = false;
545
546	current_weapon = ob;
547	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
548
549	if (chosen_skill)
550	chosen_skill->flag [FLAG_APPLIED] = true;
551
552	update_stats ();
553
554	if (ob)
555	{
556	// now check wether any body locations became invalid, in which case
557	// we cannot apply the weapon at the moment.
558	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
559	if (slot[i].used < 0)
560	{
561	current_weapon = chosen_skill = 0;
562	update_stats ();
563
564	new_draw_info_format (NDI_UNIQUE, 0, this,
565	"You try to balance all your items at once, "
566	"but the %s is just too much for your body. "
567	"[You need to unapply some items first - use the 'body' command to see "
568	"how many items you cna wera on a specific body part.]", &ob->name);
569	return false;
570	}
571
572	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
573	}
574	else
575	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
576
577	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
578	{
579	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
580	&name, ob->debug_desc ());
581	return false;
582	}
583
584	return true;
585	}
586
587	/* Zero the key_values on op, decrementing the shared-string
588	* refcounts and freeing the links.
589	*/
590	static void
591	free_key_values (object *op)
592	{
593	for (key_value *i = op->key_values; i; )
594	{
595	key_value *next = i->next;
596	delete i;
597
598	i = next;
599	}
600
601	op->key_values = 0;
602	}	603	}
603		604
604	/*	605	/*
605	* copy_to first frees everything allocated by the dst object,	606	* copy_to first frees everything allocated by the dst object,
606	* and then copies the contents of itself into the second	607	* and then copies the contents of itself into the second
…		…
612	void	613	void
613	object::copy_to (object *dst)	614	object::copy_to (object *dst)
614	{	615	{
615	dst->remove ();	616	dst->remove ();
616	*(object_copy *)dst = *this;	617	*(object_copy *)dst = *this;
		618
		619	// maybe move to object_copy?
		620	dst->kv = kv;
		621
617	dst->flag [FLAG_REMOVED] = true;	622	dst->flag [FLAG_REMOVED] = true;
618
619	/* Copy over key_values, if any. */
620	if (key_values)
621	{
622	key_value *tail = 0;
623	dst->key_values = 0;
624
625	for (key_value *i = key_values; i; i = i->next)
626	{
627	key_value *new_link = new key_value;
628
629	new_link->next = 0;
630	new_link->key = i->key;
631	new_link->value = i->value;
632
633	/* Try and be clever here, too. */
634	if (!dst->key_values)
635	{
636	dst->key_values = new_link;
637	tail = new_link;
638	}
639	else
640	{
641	tail->next = new_link;
642	tail = new_link;
643	}
644	}
645	}
646
647	if (speed < 0)
648	dst->speed_left -= rndm ();
649
650	dst->activate ();	623	dst->activate ();
651	}	624	}
652		625
653	void	626	void
654	object::instantiate ()	627	object::instantiate ()
655	{	628	{
656	if (!uuid.seq) // HACK	629	if (!uuid.seq) // HACK
657	uuid = UUID::gen ();	630	uuid = UUID::gen ();
658		631
		632	// TODO: unclean state changes, should not be done in copy_to AND instantiate
		633	if (flag [FLAG_RANDOM_SPEED] && speed)
		634	speed_left = - speed - rndm (); // TODO animation
		635	else
659	speed_left = -0.1f;	636	speed_left = -1.;
		637
660	/* copy the body_info to the body_used - this is only really	638	/* copy the body_info to the body_used - this is only really
661	* need for monsters, but doesn't hurt to do it for everything.	639	* need for monsters, but doesn't hurt to do it for everything.
662	* by doing so, when a monster is created, it has good starting	640	* by doing so, when a monster is created, it has good starting
663	* values for the body_used info, so when items are created	641	* values for the body_used info, so when items are created
664	* for it, they can be properly equipped.	642	* for it, they can be properly equipped.
665	*/	643	*/
666	for (int i = NUM_BODY_LOCATIONS; i--; )	644	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
667	slot[i].used = slot[i].info;	645	slot[i].used = slot[i].info;
668		646
669	attachable::instantiate ();	647	attachable::instantiate ();
670	}	648	}
671		649
672	object *	650	object *
673	object::clone ()	651	object::clone ()
674	{	652	{
675	object *neu = create ();	653	object *neu = create ();
676	copy_to (neu);	654	copy_to (neu);
		655
		656	// TODO: unclean state changes, should not be done in clone AND instantiate
		657	if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
		658	neu->speed_left = - neu->speed - rndm (); // TODO animation
		659
677	neu->map = map; // not copied by copy_to	660	neu->map = map; // not copied by copy_to
678	return neu;	661	return neu;
679	}	662	}
680		663
681	/*	664	/*
…		…
684	* be called to update the face variable, _and_ how it looks on the map.	667	* be called to update the face variable, _and_ how it looks on the map.
685	*/	668	*/
686	void	669	void
687	update_turn_face (object *op)	670	update_turn_face (object *op)
688	{	671	{
689	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)	672	if (!op->flag [FLAG_IS_TURNABLE] || !op->arch)
690	return;	673	return;
691		674
692	SET_ANIMATION (op, op->direction);	675	SET_ANIMATION (op, op->direction);
693	update_object (op, UP_OBJ_FACE);	676	update_object (op, UP_OBJ_FACE);
694	}	677	}
…		…
699	* This function needs to be called whenever the speed of an object changes.	682	* This function needs to be called whenever the speed of an object changes.
700	*/	683	*/
701	void	684	void
702	object::set_speed (float speed)	685	object::set_speed (float speed)
703	{	686	{
704	if (flag [FLAG_FREED] && speed)
705	{
706	LOG (llevError, "Object %s is freed but has speed.\n", &name);
707	speed = 0;
708	}
709
710	this->speed = speed;	687	this->speed = speed;
711		688
712	if (has_active_speed ())	689	if (has_active_speed ())
713	activate ();	690	activate ();
714	else	691	else
…		…
761	}	738	}
762		739
763	mapspace &m = op->ms ();	740	mapspace &m = op->ms ();
764		741
765	if (!(m.flags_ & P_UPTODATE))	742	if (!(m.flags_ & P_UPTODATE))
766	/* nop */;	743	m.update_up (); // nothing to do except copy up
767	else if (action == UP_OBJ_INSERT)	744	else if (action == UP_OBJ_INSERT)
768	{	745	{
		746	#if 0
769	// this is likely overkill, TODO: revisit (schmorp)	747	// this is likely overkill, TODO: revisit (schmorp)
770	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	748	if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW))
771	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	749	|| (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC))
772	|| (op->is_player () && !(m.flags_ & P_PLAYER))	750	|| (op->is_player () && !(m.flags_ & P_PLAYER))
773	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	751	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
774	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	752	|| (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE))
775	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	753	|| (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC))
776	|| (m.move_on | op->move_on ) != m.move_on	754	|| (m.move_on | op->move_on ) != m.move_on
777	|| (m.move_off | op->move_off ) != m.move_off	755	|| (m.move_off | op->move_off ) != m.move_off
778	|| (m.move_slow | op->move_slow) != m.move_slow	756	|| (m.move_slow | op->move_slow) != m.move_slow
779	/* This isn't perfect, but I don't expect a lot of objects to	757	/* This isn't perfect, but I don't expect a lot of objects to
780	* have move_allow right now.	758	* have move_allow right now.
781	*/	759	*/
782	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	760	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
783	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
784	m.invalidate ();	761	m.invalidate ();
		762	#else
		763	// the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
		764	m.invalidate ();
		765	#endif
785	}	766	}
786	/* if the object is being removed, we can't make intelligent	767	/* if the object is being removed, we can't make intelligent
787	* decisions, because remove_ob can't really pass the object	768	* decisions, because remove_ob can't really pass the object
788	* that is being removed.	769	* that is being removed.
789	*/	770	*/
790	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	771	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
791	m.invalidate ();	772	m.invalidate ();
792	else if (action == UP_OBJ_FACE)	773	else if (action == UP_OBJ_FACE)
793	/* Nothing to do for that case */ ;	774	m.update_up (); // nothing to do for that case, except copy up
794	else	775	else
795	LOG (llevError, "update_object called with invalid action: %d\n", action);	776	LOG (llevError, "update_object called with invalid action: %d\n", action);
796		777
797	if (op->more)	778	if (op->more)
798	update_object (op->more, action);	779	update_object (op->more, action);
799	}	780	}
800		781
801	object::object ()	782	object::object ()
802	{	783	{
803	SET_FLAG (this, FLAG_REMOVED);	784	this->set_flag (FLAG_REMOVED);
804		785
805	//expmul = 1.0; declared const for the time being	786	//expmul = 1.0; declared const for the time being
806	face = blank_face;	787	face = blank_face;
		788	material = MATERIAL_NULL;
807	}	789	}
808		790
809	object::~object ()	791	object::~object ()
810	{	792	{
811	unlink ();	793	unlink ();
812		794
813	free_key_values (this);	795	kv.clear ();
814	}	796	}
815
816	static int object_count;
817		797
818	void object::link ()	798	void object::link ()
819	{	799	{
820	assert (!index);//D	800	assert (!index);//D
821	uuid = UUID::gen ();	801	uuid = UUID::gen ();
822	count = ++object_count;
823		802
824	refcnt_inc ();	803	refcnt_inc ();
825	objects.insert (this);	804	objects.insert (this);
		805
		806	++create_count;
		807
826	}	808	}
827		809
828	void object::unlink ()	810	void object::unlink ()
829	{	811	{
830	if (!index)	812	if (!index)
831	return;	813	return;
		814
		815	++destroy_count;
832		816
833	objects.erase (this);	817	objects.erase (this);
834	refcnt_dec ();	818	refcnt_dec ();
835	}	819	}
836		820
…		…
859	op->activate_recursive ();	843	op->activate_recursive ();
860	}	844	}
861		845
862	/* This function removes object 'op' from the list of active	846	/* This function removes object 'op' from the list of active
863	* objects.	847	* objects.
864	* This should only be used for style maps or other such	848	* This should only be used for style maps or other such
865	* reference maps where you don't want an object that isn't	849	* reference maps where you don't want an object that isn't
866	* in play chewing up cpu time getting processed.	850	* in play chewing up cpu time getting processed.
867	* The reverse of this is to call update_ob_speed, which	851	* The reverse of this is to call update_ob_speed, which
868	* will do the right thing based on the speed of the object.	852	* will do the right thing based on the speed of the object.
869	*/	853	*/
…		…
915	* if some form of movement is allowed, let objects	899	* if some form of movement is allowed, let objects
916	* drop on that space.	900	* drop on that space.
917	*/	901	*/
918	if (!drop_to_ground	902	if (!drop_to_ground
919	|| !map	903	|| !map
920	|| map->in_memory != MAP_ACTIVE	904	|| !map->linkable ()
921	|| map->no_drop	905	|| map->no_drop
922	|| ms ().move_block == MOVE_ALL)	906	|| ms ().move_block == MOVE_ALL)
923	{	907	{
924	while (inv)	908	while (inv)
925	inv->destroy ();	909	inv->destroy ();
…		…
941	map->insert (op, x, y);	925	map->insert (op, x, y);
942	}	926	}
943	}	927	}
944	}	928	}
945		929
		930	/*
		931	* Remove and free all objects in the inventory of the given object.
		932	* Unlike destroy_inv, this assumes the *this is destroyed as well
		933	* well, so we can (and have to!) take shortcuts.
		934	*/
		935	void
		936	object::destroy_inv_fast ()
		937	{
		938	while (object *op = inv)
		939	{
		940	// remove from object the fast way
		941	op->flag [FLAG_REMOVED] = true;
		942	op->env = 0;
		943	if ((inv = inv->below))
		944	inv->above = 0;
		945
		946	// then destroy
		947	op->destroy ();
		948	}
		949	}
		950
		951	void
		952	object::freelist_free (int count)
		953	{
		954	while (count-- && freelist)
		955	{
		956	freelist_item *next = freelist->next;
		957	// count is being "destroyed"
		958
		959	sfree ((char *)freelist, sizeof (object));
		960
		961	freelist = next;
		962	--free_count;
		963	}
		964	}
		965
		966	object *
946	object *object::create ()	967	object::create ()
947	{	968	{
948	object *op = new object;	969	object *op;
		970
		971	if (freelist)
		972	{
		973	freelist_item li = *freelist;
		974	memset (freelist, 0, sizeof (object));
		975
		976	op = new (freelist) object;
		977	op->count = li.count;
		978
		979	freelist = li.next;
		980	--free_count;
		981	}
		982	else
		983	{
		984	void *ni = salloc0<char> (sizeof (object));
		985
		986	op = new(ni) object;
		987
		988	op->count = ++object_count;
		989	}
		990
949	op->link ();	991	op->link ();
		992
950	return op;	993	return op;
951	}	994	}
952		995
953	static struct freed_map : maptile	996	void
		997	object::do_delete ()
954	{	998	{
955	freed_map ()	999	uint32_t count = this->count;
956	{
957	path = "<freed objects map>";
958	name = "/internal/freed_objects_map";
959	width = 3;
960	height = 3;
961	no_drop = 1;
962	no_reset = 1;
963		1000
964	alloc ();	1001	this->~object ();
965	in_memory = MAP_ACTIVE;
966	}
967		1002
968	~freed_map ()	1003	freelist_item *li = (freelist_item *)this;
969	{	1004	li->next = freelist;
970	destroy ();	1005	li->count = count;
971	}	1006
972	} freed_map; // freed objects are moved here to avoid crashes	1007	freelist = li;
		1008	++free_count;
		1009	}
973		1010
974	void	1011	void
975	object::do_destroy ()	1012	object::do_destroy ()
976	{	1013	{
977	if (flag [FLAG_IS_LINKED])	1014	if (flag [FLAG_IS_LINKED])
…		…
1020	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");	1057	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1021	head->destroy ();	1058	head->destroy ();
1022	return;	1059	return;
1023	}	1060	}
1024		1061
1025	destroy_inv (false);	1062	destroy_inv_fast ();
1026		1063
1027	if (is_head ())	1064	if (is_head ())
1028	if (sound_destroy)	1065	if (sound_destroy)
1029	play_sound (sound_destroy);	1066	play_sound (sound_destroy);
1030	else if (flag [FLAG_MONSTER])	1067	else if (flag [FLAG_MONSTER])
…		…
1041	* the previous environment.	1078	* the previous environment.
1042	*/	1079	*/
1043	void	1080	void
1044	object::do_remove ()	1081	object::do_remove ()
1045	{	1082	{
1046	object *tmp, *last = 0;
1047	object *otmp;
1048
1049	if (flag [FLAG_REMOVED])	1083	if (flag [FLAG_REMOVED])
1050	return;	1084	return;
1051		1085
1052	INVOKE_OBJECT (REMOVE, this);	1086	INVOKE_OBJECT (REMOVE, this);
1053		1087
1054	flag [FLAG_REMOVED] = true;	1088	flag [FLAG_REMOVED] = true;
1055		1089
1056	if (more)	1090	if (more)
1057	more->remove ();	1091	more->remove ();
1058		1092
1059	/*	1093	/*
1060	* In this case, the object to be removed is in someones	1094	* In this case, the object to be removed is in someones
1061	* inventory.	1095	* inventory.
1062	*/	1096	*/
1063	if (env)	1097	if (env)
1064	{	1098	{
1065	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed	1099	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1066	if (object *pl = visible_to ())	1100	if (object *pl = visible_to ())
1067	esrv_del_item (pl->contr, count);	1101	esrv_del_item (pl->contr, count);
1068	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1102	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1069		1103
1070	adjust_weight (env, -total_weight ());	1104	adjust_weight (env, total_weight (), 0);
1071		1105
1072	object *pl = in_player ();	1106	object *pl = in_player ();
1073		1107
1074	/* we set up values so that it could be inserted into	1108	/* we set up values so that it could be inserted into
1075	* the map, but we don't actually do that - it is up	1109	* the map, but we don't actually do that - it is up
…		…
1085		1119
1086	above = 0;	1120	above = 0;
1087	below = 0;	1121	below = 0;
1088	env = 0;	1122	env = 0;
1089		1123
1090	/* NO_FIX_PLAYER is set when a great many changes are being	1124	if (pl && pl->is_player ())
1091	* made to players inventory. If set, avoiding the call
1092	* to save cpu time.
1093	*/	1125	{
1094	if (pl)	1126	if (expect_false (pl->contr->combat_ob == this))
1095	if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
1096	{	1127	{
1097	pl->update_stats ();	1128	pl->apply (pl->contr->combat_ob, AP_UNAPPLY | AP_IGNORE_CURSE);
		1129	pl->contr->combat_ob = 0;
		1130	if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);
		1131	}
1098		1132
		1133	if (expect_false (pl->contr->ranged_ob == this))
		1134	{
		1135	pl->apply (pl->contr->ranged_ob, AP_UNAPPLY | AP_IGNORE_CURSE);
		1136	pl->contr->ranged_ob = 0;
		1137	if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);
		1138	}
		1139
		1140	pl->contr->queue_stats_update ();
		1141
1099	if (glow_radius && pl->is_on_map ())	1142	if (expect_false (glow_radius) && pl->is_on_map ())
1100	update_all_los (pl->map, pl->x, pl->y);	1143	update_all_los (pl->map, pl->x, pl->y);
1101	}	1144	}
1102	}	1145	}
1103	else if (map)	1146	else if (map)
1104	{	1147	{
1105	map->dirty = true;	1148	map->dirty = true;
1106	mapspace &ms = this->ms ();	1149	mapspace &ms = this->ms ();
…		…
1124	else if (pl->container_ () == this)	1167	else if (pl->container_ () == this)
1125	{	1168	{
1126	// removing a container should close it	1169	// removing a container should close it
1127	close_container ();	1170	close_container ();
1128	}	1171	}
1129		1172	else
1130	esrv_del_item (pl->contr, count);	1173	esrv_del_item (pl->contr, count);
1131	}	1174	}
1132		1175
1133	/* link the object above us */	1176	/* link the object above us */
1134	// re-link, make sure compiler can easily use cmove	1177	// re-link, make sure compiler can easily use cmove
1135	*(above ? &above->below : &ms.top) = below;	1178	*(above ? &above->below : &ms.top) = below;
…		…
1137		1180
1138	above = 0;	1181	above = 0;
1139	below = 0;	1182	below = 0;
1140		1183
1141	ms.invalidate ();	1184	ms.invalidate ();
1142
1143	if (map->in_memory == MAP_SAVING)
1144	return;
1145		1185
1146	int check_walk_off = !flag [FLAG_NO_APPLY];	1186	int check_walk_off = !flag [FLAG_NO_APPLY];
1147		1187
1148	if (object *pl = ms.player ())	1188	if (object *pl = ms.player ())
1149	{	1189	{
…		…
1159	//TODO: update floorbox to preserve ordering	1199	//TODO: update floorbox to preserve ordering
1160	if (pl->contr->ns)	1200	if (pl->contr->ns)
1161	pl->contr->ns->floorbox_update ();	1201	pl->contr->ns->floorbox_update ();
1162	}	1202	}
1163		1203
		1204	if (check_walk_off)
1164	for (tmp = ms.bot; tmp; tmp = tmp->above)	1205	for (object *above, *tmp = ms.bot; tmp; tmp = above)
1165	{	1206	{
		1207	above = tmp->above;
		1208
1166	/* No point updating the players look faces if he is the object	1209	/* No point updating the players look faces if he is the object
1167	* being removed.	1210	* being removed.
1168	*/	1211	*/
1169		1212
1170	/* See if object moving off should effect something */	1213	/* See if object moving off should effect something */
1171	if (check_walk_off
1172	&& ((move_type & tmp->move_off)	1214	if ((move_type & tmp->move_off)
1173	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1215	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1174	{
1175	move_apply (tmp, this, 0);	1216	move_apply (tmp, this, 0);
1176
1177	if (destroyed ())
1178	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1179	}	1217	}
1180
1181	last = tmp;
1182	}
1183		1218
1184	if (affects_los ())	1219	if (affects_los ())
1185	update_all_los (map, x, y);	1220	update_all_los (map, x, y);
1186	}	1221	}
1187	}	1222	}
…		…
1231		1266
1232	object *prev = this;	1267	object *prev = this;
1233		1268
1234	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)	1269	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1235	{	1270	{
1236	object *op = arch_to_object (at);	1271	object *op = at->instance ();
1237		1272
1238	op->name = name;	1273	op->name = name;
1239	op->name_pl = name_pl;	1274	op->name_pl = name_pl;
1240	op->title = title;	1275	op->title = title;
1241		1276
…		…
1279	* Passing 0 for flag gives proper default values, so flag really only needs	1314	* Passing 0 for flag gives proper default values, so flag really only needs
1280	* to be set if special handling is needed.	1315	* to be set if special handling is needed.
1281	*	1316	*
1282	* Return value:	1317	* Return value:
1283	* new object if 'op' was merged with other object	1318	* new object if 'op' was merged with other object
1284	* NULL if 'op' was destroyed	1319	* NULL if there was an error (destroyed, blocked etc.)
1285	* just 'op' otherwise	1320	* just 'op' otherwise
1286	*/	1321	*/
1287	object *	1322	object *
1288	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1323	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1289	{	1324	{
1290	op->remove ();	1325	op->remove ();
1291		1326
1292	if (m == &freed_map)//D TODO: remove soon	1327	if (m == &freed_map)//D TODO: remove soon
1293	{//D	1328	{//D
1294	LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D	1329	LOG (llevError | logBacktrace, "tries to insert object on freed objects map: %s", op->debug_desc ());//D
1295	}//D	1330	}//D
1296		1331
1297	/* Ideally, the caller figures this out. However, it complicates a lot	1332	/* Ideally, the caller figures this out. However, it complicates a lot
1298	* of areas of callers (eg, anything that uses find_free_spot would now	1333	* of areas of callers (eg, anything that uses find_free_spot would now
1299	* need extra work	1334	* need extra work
…		…
1326	// from here :/	1361	// from here :/
1327	op->nrof += tmp->nrof;	1362	op->nrof += tmp->nrof;
1328	tmp->destroy ();	1363	tmp->destroy ();
1329	}	1364	}
1330		1365
1331	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1366	op->clr_flag (FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1332	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1367	op->clr_flag (FLAG_INV_LOCKED);
1333		1368
1334	if (!QUERY_FLAG (op, FLAG_ALIVE))	1369	if (!op->flag [FLAG_ALIVE])
1335	CLEAR_FLAG (op, FLAG_NO_STEAL);	1370	op->clr_flag (FLAG_NO_STEAL);
1336		1371
1337	if (flag & INS_BELOW_ORIGINATOR)	1372	if (flag & INS_BELOW_ORIGINATOR)
1338	{	1373	{
1339	if (originator->map != op->map || originator->x != op->x || originator->y != op->y)	1374	if (originator->map != op->map || originator->x != op->x || originator->y != op->y)
1340	{	1375	{
…		…
1368	* We've already dealt with merging if appropriate.	1403	* We've already dealt with merging if appropriate.
1369	* Generally, we want to put the new object on top. But if	1404	* Generally, we want to put the new object on top. But if
1370	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1405	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
1371	* floor, we want to insert above that and no further.	1406	* floor, we want to insert above that and no further.
1372	* Also, if there are spell objects on this space, we stop processing	1407	* Also, if there are spell objects on this space, we stop processing
1373	* once we get to them. This reduces the need to traverse over all of	1408	* once we get to them. This reduces the need to traverse over all of
1374	* them when adding another one - this saves quite a bit of cpu time	1409	* them when adding another one - this saves quite a bit of cpu time
1375	* when lots of spells are cast in one area. Currently, it is presumed	1410	* when lots of spells are cast in one area. Currently, it is presumed
1376	* that flying non pickable objects are spell objects.	1411	* that flying non pickable objects are spell objects.
1377	*/	1412	*/
1378	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1413	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1379	{	1414	{
1380	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))	1415	if (tmp->flag [FLAG_IS_FLOOR] || tmp->flag [FLAG_OVERLAY_FLOOR])
1381	floor = tmp;	1416	floor = tmp;
1382		1417
1383	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1418	if (tmp->flag [FLAG_NO_PICK] && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !tmp->flag [FLAG_IS_FLOOR])
1384	{	1419	{
1385	/* We insert above top, so we want this object below this */	1420	/* We insert above top, so we want this object below this */
1386	top = tmp->below;	1421	top = tmp->below;
1387	break;	1422	break;
1388	}	1423	}
…		…
1406	&& (op->face && !faces [op->face].visibility))	1441	&& (op->face && !faces [op->face].visibility))
1407	{	1442	{
1408	object *last;	1443	object *last;
1409		1444
1410	for (last = top; last != floor; last = last->below)	1445	for (last = top; last != floor; last = last->below)
1411	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1446	if (last->flag [FLAG_BLOCKSVIEW] && (last->type != EXIT))
1412	break;	1447	break;
1413		1448
1414	/* Check to see if we found the object that blocks view,	1449	/* Check to see if we found the object that blocks view,
1415	* and make sure we have a below pointer for it so that	1450	* and make sure we have a below pointer for it so that
1416	* we can get inserted below this one, which requires we	1451	* we can get inserted below this one, which requires we
…		…
1489	*/	1524	*/
1490		1525
1491	/* if this is not the head or flag has been passed, don't check walk on status */	1526	/* if this is not the head or flag has been passed, don't check walk on status */
1492	if (!(flag & INS_NO_WALK_ON) && op->is_head ())	1527	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1493	{	1528	{
1494	if (check_move_on (op, originator))	1529	if (check_move_on (op, originator, flag))
1495	return 0;	1530	return 0;
1496		1531
1497	/* If we are a multi part object, lets work our way through the check	1532	/* If we are a multi part object, let's work our way through the check
1498	* walk on's.	1533	* walk on's.
1499	*/	1534	*/
1500	for (object *tmp = op->more; tmp; tmp = tmp->more)	1535	for (object *tmp = op->more; tmp; tmp = tmp->more)
1501	if (check_move_on (tmp, originator))	1536	if (check_move_on (tmp, originator, flag))
1502	return 0;	1537	return 0;
1503	}	1538	}
1504		1539
1505	return op;	1540	return op;
1506	}	1541	}
1507		1542
1508	/* this function inserts an object in the map, but if it	1543	/* this function inserts an object in the map, but if it
1509	* finds an object of its own type, it'll remove that one first.	1544	* finds an object of its own type, it'll remove that one first.
1510	* op is the object to insert it under: supplies x and the map.	1545	* op is the object to insert it under: supplies x and the map.
1511	*/	1546	*/
1512	void	1547	void
1513	replace_insert_ob_in_map (shstr_tmp archname, object *op)	1548	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1514	{	1549	{
…		…
1516		1551
1517	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1552	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1518	if (tmp->arch->archname == archname) /* same archetype */	1553	if (tmp->arch->archname == archname) /* same archetype */
1519	tmp->destroy ();	1554	tmp->destroy ();
1520		1555
1521	object *tmp = arch_to_object (archetype::find (archname));	1556	object *tmp = archetype::find (archname)->instance ();
1522		1557
1523	tmp->x = op->x;	1558	tmp->x = op->x;
1524	tmp->y = op->y;	1559	tmp->y = op->y;
1525		1560
1526	insert_ob_in_map (tmp, op->map, op, 0);	1561	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1531	{	1566	{
1532	if (where->env)	1567	if (where->env)
1533	return where->env->insert (this);	1568	return where->env->insert (this);
1534	else	1569	else
1535	return where->map->insert (this, where->x, where->y, originator, flags);	1570	return where->map->insert (this, where->x, where->y, originator, flags);
		1571	}
		1572
		1573	// check whether we can put this into the map, respect max_volume, max_items
		1574	bool
		1575	object::can_drop_at (maptile *m, int x, int y, object *originator)
		1576	{
		1577	mapspace &ms = m->at (x, y);
		1578
		1579	int items = ms.items ();
		1580
		1581	if (!items // testing !items ensures we can drop at least one item
		1582	|| (items < m->max_items
		1583	&& ms.volume () < m->max_volume))
		1584	return true;
		1585
		1586	if (originator)
		1587	originator->failmsgf (
		1588	"No matter how hard you try, you just cannot put the %s here! H<Try to remove some items from the floor first.>",
		1589	query_name ()
		1590	);
		1591
		1592	return false;
1536	}	1593	}
1537		1594
1538	/*	1595	/*
1539	* decrease(object, number) decreases a specified number from	1596	* decrease(object, number) decreases a specified number from
1540	* the amount of an object. If the amount reaches 0, the object	1597	* the amount of an object. If the amount reaches 0, the object
…		…
1550		1607
1551	nr = min (nr, nrof);	1608	nr = min (nr, nrof);
1552		1609
1553	if (nrof > nr)	1610	if (nrof > nr)
1554	{	1611	{
		1612	weight_t oweight = total_weight ();
		1613
1555	nrof -= nr;	1614	nrof -= nr;
1556	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1557		1615
1558	if (object *pl = visible_to ())	1616	if (object *pl = visible_to ())
1559	esrv_update_item (UPD_NROF, pl, this);	1617	esrv_update_item (UPD_NROF, pl, this);
		1618
		1619	adjust_weight (env, oweight, total_weight ());
1560		1620
1561	return true;	1621	return true;
1562	}	1622	}
1563	else	1623	else
1564	{	1624	{
…		…
1618	/*	1678	/*
1619	* env->insert (op)	1679	* env->insert (op)
1620	* This function inserts the object op in the linked list	1680	* This function inserts the object op in the linked list
1621	* inside the object environment.	1681	* inside the object environment.
1622	*	1682	*
1623	* The function returns now pointer to inserted item, and return value can	1683	* The function returns now pointer to inserted item, and return value can
1624	* be != op, if items are merged. -Tero	1684	* be != op, if items are merged. -Tero
1625	*/	1685	*/
1626	object *	1686	object *
1627	object::insert (object *op)	1687	object::insert (object *op)
1628	{	1688	{
…		…
1639	if (op->nrof)	1699	if (op->nrof)
1640	for (object *tmp = inv; tmp; tmp = tmp->below)	1700	for (object *tmp = inv; tmp; tmp = tmp->below)
1641	if (object::can_merge (tmp, op))	1701	if (object::can_merge (tmp, op))
1642	{	1702	{
1643	/* return the original object and remove inserted object	1703	/* return the original object and remove inserted object
1644	(client needs the original object) */	1704	(client prefers the original object) */
		1705
		1706	// carrying must be 0 for mergable objects
		1707	weight_t oweight = weight_t (tmp->weight) * tmp->nrof;
		1708
1645	tmp->nrof += op->nrof;	1709	tmp->nrof += op->nrof;
1646		1710
1647	if (object *pl = tmp->visible_to ())	1711	if (object *pl = tmp->visible_to ())
1648	esrv_update_item (UPD_NROF, pl, tmp);	1712	esrv_update_item (UPD_NROF, pl, tmp);
1649		1713
1650	adjust_weight (this, op->total_weight ());	1714	adjust_weight (this, oweight, weight_t (tmp->weight) * tmp->nrof);
1651		1715
1652	op->destroy ();	1716	op->destroy ();
1653	op = tmp;	1717	op = tmp;
1654	goto inserted;	1718	goto inserted;
1655	}	1719	}
…		…
1671	op->flag [FLAG_REMOVED] = 0;	1735	op->flag [FLAG_REMOVED] = 0;
1672		1736
1673	if (object *pl = op->visible_to ())	1737	if (object *pl = op->visible_to ())
1674	esrv_send_item (pl, op);	1738	esrv_send_item (pl, op);
1675		1739
1676	adjust_weight (this, op->total_weight ());	1740	adjust_weight (this, 0, op->total_weight ());
1677		1741
1678	inserted:	1742	inserted:
1679	/* reset the light list and los of the players on the map */	1743	/* reset the light list and los of the players on the map */
1680	if (op->glow_radius && is_on_map ())	1744	if (op->glow_radius && is_on_map ())
1681	{	1745	{
1682	update_stats ();	1746	update_stats ();
1683	update_all_los (map, x, y);	1747	update_all_los (map, x, y);
1684	}	1748	}
1685	else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])	1749	else if (is_player ())
1686	// if this is a player's inventory, update stats	1750	// if this is a player's inventory, update stats
1687	update_stats ();	1751	contr->queue_stats_update ();
1688		1752
1689	INVOKE_OBJECT (INSERT, this);	1753	INVOKE_OBJECT (INSERT, this);
1690		1754
1691	return op;	1755	return op;
1692	}	1756	}
…		…
1710	* MSW 2001-07-08: Check all objects on space, not just those below	1774	* MSW 2001-07-08: Check all objects on space, not just those below
1711	* object being inserted. insert_ob_in_map may not put new objects	1775	* object being inserted. insert_ob_in_map may not put new objects
1712	* on top.	1776	* on top.
1713	*/	1777	*/
1714	int	1778	int
1715	check_move_on (object *op, object *originator)	1779	check_move_on (object *op, object *originator, int flags)
1716	{	1780	{
1717	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1781	if (op->flag [FLAG_NO_APPLY])
1718	return 0;	1782	return 0;
1719		1783
1720	object *tmp;	1784	object *tmp;
1721	maptile *m = op->map;	1785	maptile *m = op->map;
1722	int x = op->x, y = op->y;	1786	int x = op->x, y = op->y;
…		…
1744	*/	1808	*/
1745	if ((op->move_type & ~move_on & ~move_block) != 0 && (op->move_type & ~move_slow & ~move_block) != 0)	1809	if ((op->move_type & ~move_on & ~move_block) != 0 && (op->move_type & ~move_slow & ~move_block) != 0)
1746	return 0;	1810	return 0;
1747		1811
1748	/* The objects have to be checked from top to bottom.	1812	/* The objects have to be checked from top to bottom.
1749	* Hence, we first go to the top:	1813	* Hence, we first go to the top:
1750	*/	1814	*/
1751	for (object *next, *tmp = ms.top; tmp; tmp = next)	1815	for (object *next, *tmp = ms.top; tmp; tmp = next)
1752	{	1816	{
1753	next = tmp->below;	1817	next = tmp->below;
1754		1818
…		…
1759	* Second check makes sure that the movement types not being slowed	1823	* Second check makes sure that the movement types not being slowed
1760	* (~slow_move) is not blocked on this space - just because the	1824	* (~slow_move) is not blocked on this space - just because the
1761	* space doesn't slow down swimming (for example), if you can't actually	1825	* space doesn't slow down swimming (for example), if you can't actually
1762	* swim on that space, can't use it to avoid the penalty.	1826	* swim on that space, can't use it to avoid the penalty.
1763	*/	1827	*/
1764	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1828	if (!op->flag [FLAG_WIZPASS])
1765	{	1829	{
1766	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1830	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1767	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1831	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1768	{	1832	{
1769	float diff = tmp->move_slow_penalty * fabs (op->speed);	1833	float diff = tmp->move_slow_penalty * fabs (op->speed);
…		…
1779		1843
1780	/* Basically same logic as above, except now for actual apply. */	1844	/* Basically same logic as above, except now for actual apply. */
1781	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||	1845	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
1782	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))	1846	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
1783	{	1847	{
		1848	if ((flags & INS_NO_AUTO_EXIT)
		1849	&& (tmp->type == EXIT || tmp->type == TELEPORTER
		1850	|| tmp->type == HOLE || tmp->type == TRAPDOOR)) //TODO: temporary, fix exits instead
		1851	continue;
		1852
1784	move_apply (tmp, op, originator);	1853	move_apply (tmp, op, originator);
1785		1854
1786	if (op->destroyed ())	1855	if (op->destroyed ())
1787	return 1;	1856	return 1;
1788		1857
…		…
1900	void	1969	void
1901	flag_inv (object *op, int flag)	1970	flag_inv (object *op, int flag)
1902	{	1971	{
1903	for (object *tmp = op->inv; tmp; tmp = tmp->below)	1972	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1904	{	1973	{
1905	SET_FLAG (tmp, flag);	1974	tmp->set_flag (flag);
1906	flag_inv (tmp, flag);	1975	flag_inv (tmp, flag);
1907	}	1976	}
1908	}	1977	}
1909		1978
1910	/*	1979	/*
…		…
1913	void	1982	void
1914	unflag_inv (object *op, int flag)	1983	unflag_inv (object *op, int flag)
1915	{	1984	{
1916	for (object *tmp = op->inv; tmp; tmp = tmp->below)	1985	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1917	{	1986	{
1918	CLEAR_FLAG (tmp, flag);	1987	tmp->clr_flag (flag);
1919	unflag_inv (tmp, flag);	1988	unflag_inv (tmp, flag);
1920	}	1989	}
1921	}	1990	}
1922		1991
1923	/*	1992	/*
…		…
1933	* inform the caller. However, insert_ob_in_map will update as	2002	* inform the caller. However, insert_ob_in_map will update as
1934	* necessary, so the caller shouldn't need to do any special work.	2003	* necessary, so the caller shouldn't need to do any special work.
1935	* Note - updated to take an object instead of archetype - this is necessary	2004	* Note - updated to take an object instead of archetype - this is necessary
1936	* because arch_blocked (now ob_blocked) needs to know the movement type	2005	* because arch_blocked (now ob_blocked) needs to know the movement type
1937	* to know if the space in question will block the object. We can't use	2006	* to know if the space in question will block the object. We can't use
1938	* the archetype because that isn't correct if the monster has been	2007	* the archetype because that isn't correct if the monster has been
1939	* customized, changed states, etc.	2008	* customized, changed states, etc.
1940	*/	2009	*/
1941	int	2010	int
1942	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	2011	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
1943	{	2012	{
1944	int altern[SIZEOFFREE];	2013	int altern[SIZEOFFREE];
1945	int index = 0, flag;	2014	int index = 0;
1946		2015
1947	for (int i = start; i < stop; i++)	2016	for (int i = start; i < stop; i++)
1948	{	2017	{
1949	mapxy pos (m, x, y); pos.move (i);	2018	mapxy pos (m, x, y); pos.move (i);
1950		2019
…		…
1966	continue;	2035	continue;
1967	}	2036	}
1968		2037
1969	/* Basically, if we find a wall on a space, we cut down the search size.	2038	/* Basically, if we find a wall on a space, we cut down the search size.
1970	* In this way, we won't return spaces that are on another side of a wall.	2039	* In this way, we won't return spaces that are on another side of a wall.
1971	* This mostly work, but it cuts down the search size in all directions -	2040	* This mostly work, but it cuts down the search size in all directions -
1972	* if the space being examined only has a wall to the north and empty	2041	* if the space being examined only has a wall to the north and empty
1973	* spaces in all the other directions, this will reduce the search space	2042	* spaces in all the other directions, this will reduce the search space
1974	* to only the spaces immediately surrounding the target area, and	2043	* to only the spaces immediately surrounding the target area, and
1975	* won't look 2 spaces south of the target space.	2044	* won't look 2 spaces south of the target space.
1976	*/	2045	*/
…		…
2006	*/	2075	*/
2007	int	2076	int
2008	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2077	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2009	{	2078	{
2010	for (int i = 0; i < SIZEOFFREE; i++)	2079	for (int i = 0; i < SIZEOFFREE; i++)
2011	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))	2080	if (!ob->blocked (m, x + DIRX (i), y + DIRY (i)))
2012	return i;	2081	return i;
2013		2082
2014	return -1;	2083	return -1;
2015	}	2084	}
2016		2085
…		…
2027		2096
2028	while (--end)	2097	while (--end)
2029	swap (arr [end], arr [rndm (end + 1)]);	2098	swap (arr [end], arr [rndm (end + 1)]);
2030	}	2099	}
2031		2100
2032	/* new function to make monster searching more efficient, and effective!	2101	/* new function to make monster searching more efficient, and effective!
2033	* This basically returns a randomized array (in the passed pointer) of	2102	* This basically returns a randomized array (in the passed pointer) of
2034	* the spaces to find monsters. In this way, it won't always look for	2103	* the spaces to find monsters. In this way, it won't always look for
2035	* monsters to the north first. However, the size of the array passed	2104	* monsters to the north first. However, the size of the array passed
2036	* covers all the spaces, so within that size, all the spaces within	2105	* covers all the spaces, so within that size, all the spaces within
2037	* the 3x3 area will be searched, just not in a predictable order.	2106	* the 3x3 area will be searched, just not in a predictable order.
…		…
2062	* there is capable of.	2131	* there is capable of.
2063	*/	2132	*/
2064	int	2133	int
2065	find_dir (maptile *m, int x, int y, object *exclude)	2134	find_dir (maptile *m, int x, int y, object *exclude)
2066	{	2135	{
2067	int max = SIZEOFFREE, mflags;	2136	int max = SIZEOFFREE;
2068	MoveType move_type;	2137	MoveType move_type;
2069		2138
2070	if (exclude && exclude->head_ () != exclude)	2139	if (exclude && exclude->head_ () != exclude)
2071	{	2140	{
2072	exclude = exclude->head;	2141	exclude = exclude->head;
…		…
2113	{	2182	{
2114	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2183	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2115	}	2184	}
2116		2185
2117	/*	2186	/*
2118	* find_dir_2(delta-x,delta-y) will return a direction in which	2187	* find_dir_2(delta-x,delta-y) will return a direction value
2119	* an object which has subtracted the x and y coordinates of another	2188	* for running into direct [dx, dy].
2120	* object, needs to travel toward it.	2189	* (the opposite of crossfire's find_dir_2!)
2121	*/	2190	*/
2122	int	2191	int
2123	find_dir_2 (int x, int y)	2192	find_dir_2 (int x, int y)
2124	{	2193	{
		2194	#if 1 // new algorithm
		2195	// this works by putting x, y into 16 sectors, which
		2196	// are not equal sized, but are a better approximation
		2197	// then the old algorithm, and then using a mapping
		2198	// table to map it into a direction value.
		2199	// basically, it maps these comparisons to each bit
		2200	// bit #3: x < 0
		2201	// bit #2: y < 0
		2202	// bit #1: x > y
		2203	// bit #0: x > 2y
		2204
		2205	static const uint8 dir[16] = {
		2206	4, 5, 4, 3,
		2207	2, 1, 2, 3,
		2208	6, 5, 6, 7,
		2209	8, 1, 8, 7,
		2210	};
		2211	int sector = 0;
		2212
		2213	// this is a bit ugly, but more likely to result in branchless code
		2214	sector |= x < 0 ? 8 : 0;
		2215	x = x < 0 ? -x : x; // abs
		2216
		2217	sector |= y < 0 ? 4 : 0;
		2218	y = y < 0 ? -y : y; // abs
		2219
		2220	if (x > y)
		2221	{
		2222	sector |= 2;
		2223
		2224	if (x > y * 2)
		2225	sector |= 1;
		2226	}
		2227	else
		2228	{
		2229	if (y > x * 2)
		2230	sector |= 1;
		2231	else if (!y)
		2232	return 0; // x == 0 here
		2233	}
		2234
		2235	return dir [sector];
		2236	#else // old algorithm
2125	int q;	2237	int q;
2126		2238
2127	if (y)	2239	if (y)
2128	q = x * 100 / y;	2240	q = 128 * x / y;
2129	else if (x)	2241	else if (x)
2130	q = -300 * x;	2242	q = -512 * x; // to make it > 309
2131	else	2243	else
2132	return 0;	2244	return 0;
2133		2245
2134	if (y > 0)	2246	if (y > 0)
2135	{	2247	{
2136	if (q < -242)	2248	if (q < -309) return 7;
		2249	if (q < -52) return 6;
		2250	if (q < 52) return 5;
		2251	if (q < 309) return 4;
		2252
2137	return 3;	2253	return 3;
2138	if (q < -41)	2254	}
2139	return 2;	2255	else
2140	if (q < 41)	2256	{
2141	return 1;	2257	if (q < -309) return 3;
2142	if (q < 242)	2258	if (q < -52) return 2;
2143	return 8;	2259	if (q < 52) return 1;
		2260	if (q < 309) return 8;
		2261
2144	return 7;	2262	return 7;
2145	}	2263	}
2146		2264	#endif
2147	if (q < -242)
2148	return 7;
2149	if (q < -41)
2150	return 6;
2151	if (q < 41)
2152	return 5;
2153	if (q < 242)
2154	return 4;
2155
2156	return 3;
2157	}	2265	}
2158		2266
2159	/*	2267	/*
2160	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2268	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2161	* between two directions (which are expected to be absolute (see absdir())	2269	* between two directions (which are expected to be absolute (see absdir())
2162	*/	2270	*/
2163	int	2271	int
2164	dirdiff (int dir1, int dir2)	2272	dirdiff (int dir1, int dir2)
2165	{	2273	{
2166	int d;
2167
2168	d = abs (dir1 - dir2);	2274	int d = abs (dir1 - dir2);
2169	if (d > 4)
2170	d = 8 - d;
2171		2275
2172	return d;	2276	return d > 4 ? 8 - d : d;
2173	}	2277	}
2174		2278
2175	/* peterm:	2279	/* peterm:
2176	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2280	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
2177	* Basically, this is a table of directions, and what directions	2281	* Basically, this is a table of directions, and what directions
…		…
2179	* This basically means that if direction is 15, then it could either go	2283	* This basically means that if direction is 15, then it could either go
2180	* direction 4, 14, or 16 to get back to where we are.	2284	* direction 4, 14, or 16 to get back to where we are.
2181	* Moved from spell_util.c to object.c with the other related direction	2285	* Moved from spell_util.c to object.c with the other related direction
2182	* functions.	2286	* functions.
2183	*/	2287	*/
2184	const int reduction_dir[SIZEOFFREE][3] = {	2288	static const int reduction_dir[SIZEOFFREE][3] = {
2185	{0, 0, 0}, /* 0 */	2289	{0, 0, 0}, /* 0 */
2186	{0, 0, 0}, /* 1 */	2290	{0, 0, 0}, /* 1 */
2187	{0, 0, 0}, /* 2 */	2291	{0, 0, 0}, /* 2 */
2188	{0, 0, 0}, /* 3 */	2292	{0, 0, 0}, /* 3 */
2189	{0, 0, 0}, /* 4 */	2293	{0, 0, 0}, /* 4 */
…		…
2246	int mflags;	2350	int mflags;
2247		2351
2248	if (dir < 0)	2352	if (dir < 0)
2249	return 0; /* exit condition: invalid direction */	2353	return 0; /* exit condition: invalid direction */
2250		2354
2251	dx = x + freearr_x[dir];	2355	dx = x + DIRX (dir);
2252	dy = y + freearr_y[dir];	2356	dy = y + DIRY (dir);
2253		2357
2254	mflags = get_map_flags (m, &m, dx, dy, &dx, &dy);	2358	mflags = get_map_flags (m, &m, dx, dy, &dx, &dy);
2255		2359
2256	/* This functional arguably was incorrect before - it was	2360	/* This functional arguably was incorrect before - it was
2257	* checking for P_WALL - that was basically seeing if	2361	* checking for P_WALL - that was basically seeing if
…		…
2283	* Add a check so we can't pick up invisible objects (0.93.8)	2387	* Add a check so we can't pick up invisible objects (0.93.8)
2284	*/	2388	*/
2285	int	2389	int
2286	can_pick (const object *who, const object *item)	2390	can_pick (const object *who, const object *item)
2287	{	2391	{
2288	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2392	return /*who->flag [FLAG_WIZ]|| */
2289	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2393	(item->weight > 0 && !item->flag [FLAG_NO_PICK] &&
2290	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));	2394	!item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2291	}	2395	}
		2396
		2397	//-GPL
2292		2398
2293	/*	2399	/*
2294	* create clone from object to another	2400	* create clone from object to another
2295	*/	2401	*/
2296	object *	2402	object *
…		…
2327	return tmp;	2433	return tmp;
2328		2434
2329	return 0;	2435	return 0;
2330	}	2436	}
2331		2437
		2438	/* Zero the key_values on op, decrementing the shared-string
		2439	* refcounts and freeing the links.
		2440	*/
		2441	void
		2442	key_values::clear ()
		2443	{
		2444	for (key_value *kvp = first; kvp; )
		2445	{
		2446	key_value *next = kvp->next;
		2447	delete kvp;
		2448	kvp = next;
		2449	}
		2450
		2451	first = 0;
		2452	}
		2453
2332	shstr_tmp	2454	shstr_tmp
2333	object::kv_get (shstr_tmp key) const	2455	key_values::get (shstr_tmp key) const
2334	{	2456	{
2335	for (key_value *kv = key_values; kv; kv = kv->next)	2457	for (key_value *kv = first; kv; kv = kv->next)
2336	if (kv->key == key)	2458	if (kv->key == key)
2337	return kv->value;	2459	return kv->value;
2338		2460
2339	return shstr ();	2461	return shstr ();
2340	}	2462	}
2341		2463
2342	void	2464	void
		2465	key_values::add (shstr_tmp key, shstr_tmp value)
		2466	{
		2467	key_value *kv = new key_value;
		2468
		2469	kv->next = first;
		2470	kv->key = key;
		2471	kv->value = value;
		2472
		2473	first = kv;
		2474	}
		2475
		2476	void
2343	object::kv_set (shstr_tmp key, shstr_tmp value)	2477	key_values::set (shstr_tmp key, shstr_tmp value)
2344	{	2478	{
2345	for (key_value *kv = key_values; kv; kv = kv->next)	2479	for (key_value *kv = first; kv; kv = kv->next)
2346	if (kv->key == key)	2480	if (kv->key == key)
2347	{	2481	{
2348	kv->value = value;	2482	kv->value = value;
2349	return;	2483	return;
2350	}	2484	}
2351		2485
2352	key_value *kv = new key_value;	2486	add (key, value);
2353
2354	kv->next = key_values;
2355	kv->key = key;
2356	kv->value = value;
2357
2358	key_values = kv;
2359	}	2487	}
2360		2488
2361	void	2489	void
2362	object::kv_del (shstr_tmp key)	2490	key_values::del (shstr_tmp key)
2363	{	2491	{
2364	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)	2492	for (key_value **kvp = &first; *kvp; kvp = &(*kvp)->next)
2365	if ((*kvp)->key == key)	2493	if ((*kvp)->key == key)
2366	{	2494	{
2367	key_value *kv = *kvp;	2495	key_value *kv = *kvp;
2368	*kvp = (*kvp)->next;	2496	*kvp = (*kvp)->next;
2369	delete kv;	2497	delete kv;
2370	return;	2498	return;
2371	}	2499	}
		2500	}
		2501
		2502	void
		2503	key_values::reverse ()
		2504	{
		2505	key_value *prev = 0;
		2506	key_value *head = first;
		2507
		2508	while (head)
		2509	{
		2510	key_value *node = head;
		2511	head = head->next;
		2512	node->next = prev;
		2513	prev = node;
		2514	}
		2515
		2516	first = prev;
		2517	}
		2518
		2519	key_values &
		2520	key_values::operator =(const key_values &kv)
		2521	{
		2522	clear ();
		2523
		2524	for (key_value *kvp = kv.first; kvp; kvp = kvp->next)
		2525	add (kvp->key, kvp->value);
		2526
		2527	reverse ();
2372	}	2528	}
2373		2529
2374	object::depth_iterator::depth_iterator (object *container)	2530	object::depth_iterator::depth_iterator (object *container)
2375	: iterator_base (container)	2531	: iterator_base (container)
2376	{	2532	{
…		…
2460	{	2616	{
2461	return map ? map->region (x, y)	2617	return map ? map->region (x, y)
2462	: region::default_region ();	2618	: region::default_region ();
2463	}	2619	}
2464		2620
2465	const materialtype_t *	2621	//+GPL
2466	object::dominant_material () const
2467	{
2468	if (materialtype_t *mt = name_to_material (materialname))
2469	return mt;
2470
2471	return name_to_material (shstr_unknown);
2472	}
2473		2622
2474	void	2623	void
2475	object::open_container (object *new_container)	2624	object::open_container (object *new_container)
2476	{	2625	{
2477	if (container == new_container)	2626	if (container == new_container)
…		…
2512	// TODO: this does not seem to serve any purpose anymore?	2661	// TODO: this does not seem to serve any purpose anymore?
2513	#if 0	2662	#if 0
2514	// insert the "Close Container" object.	2663	// insert the "Close Container" object.
2515	if (archetype *closer = new_container->other_arch)	2664	if (archetype *closer = new_container->other_arch)
2516	{	2665	{
2517	object *closer = arch_to_object (new_container->other_arch);	2666	object *closer = new_container->other_arch->instance ();
2518	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2667	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2519	new_container->insert (closer);	2668	new_container->insert (closer);
2520	}	2669	}
2521	#endif	2670	#endif
2522		2671
…		…
2535	}	2684	}
2536	// else if (!old_container->env && contr && contr->ns)	2685	// else if (!old_container->env && contr && contr->ns)
2537	// contr->ns->floorbox_reset ();	2686	// contr->ns->floorbox_reset ();
2538	}	2687	}
2539		2688
		2689	//-GPL
		2690
		2691	// prefetch some flat area around the player
		2692	static void
		2693	prefetch_surrounding_area (object *op, maptile *map, int range)
		2694	{
		2695	for (maprect *rect = map->split_to_tiles (mapwalk_buf,
		2696	op->x - range , op->y - range ,
		2697	op->x + range + 1, op->y + range + 1);
		2698	rect->m;
		2699	++rect)
		2700	{
		2701	rect->m->touch ();
		2702	rect->m->activate ();
		2703	}
		2704	}
		2705
		2706	// prefetch a generous area around the player, also up and down
		2707	void
		2708	object::prefetch_surrounding_maps ()
		2709	{
		2710	prefetch_surrounding_area (this, map, 40);
		2711
		2712	if (maptile *m = map->tile_available (TILE_DOWN))
		2713	prefetch_surrounding_area (this, m, 20);
		2714
		2715	if (maptile *m = map->tile_available (TILE_UP))
		2716	prefetch_surrounding_area (this, m, 20);
		2717	}
		2718
		2719	//+GPL
		2720
2540	object *	2721	object *
2541	object::force_find (shstr_tmp name)	2722	object::force_find (shstr_tmp name)
2542	{	2723	{
2543	/* cycle through his inventory to look for the MARK we want to	2724	/* cycle through his inventory to look for the MARK we want to
2544	* place	2725	* place
2545	*/	2726	*/
2546	for (object *tmp = inv; tmp; tmp = tmp->below)	2727	for (object *tmp = inv; tmp; tmp = tmp->below)
2547	if (tmp->type == FORCE && tmp->slaying == name)	2728	if (tmp->type == FORCE && tmp->slaying == name)
2548	return splay (tmp);	2729	return splay (tmp);
2549		2730
…		…
2563	object::force_add (shstr_tmp name, int duration)	2744	object::force_add (shstr_tmp name, int duration)
2564	{	2745	{
2565	if (object *force = force_find (name))	2746	if (object *force = force_find (name))
2566	force->destroy ();	2747	force->destroy ();
2567		2748
2568	object *force = get_archetype (FORCE_NAME);	2749	object *force = archetype::get (FORCE_NAME);
2569		2750
2570	force->slaying = name;	2751	force->slaying = name;
2571
2572	force->force_set_timer (duration);	2752	force->force_set_timer (duration);
2573
2574	force->flag [FLAG_APPLIED] = true;	2753	force->flag [FLAG_APPLIED] = true;
2575		2754
2576	return insert (force);	2755	return insert (force);
2577	}	2756	}
2578		2757
2579	void	2758	void
…		…
2628		2807
2629	insert (force);	2808	insert (force);
2630	}	2809	}
2631	}	2810	}
2632		2811
		2812	void object::change_move_type (MoveType mt)
		2813	{
		2814	if (move_type == mt)
		2815	return;
		2816
		2817	if (is_on_map ())
		2818	{
		2819	// we are on the map, so handle move_on/off effects
		2820	remove ();
		2821	move_type = mt;
		2822	map->insert (this, x, y, this);
		2823	}
		2824	else
		2825	move_type = mt;
		2826	}
		2827
		2828	/* object should be a player.
		2829	* we return the object the player has marked with the 'mark' command
		2830	* below. If no match is found (or object has changed), we return
		2831	* NULL. We leave it up to the calling function to print messages if
		2832	* nothing is found.
		2833	*/
		2834	object *
		2835	object::mark () const
		2836	{
		2837	if (contr && contr->mark && contr->mark->env == this)
		2838	return contr->mark;
		2839	else
		2840	return 0;
		2841	}
		2842
		2843	// put marked object first in the inventory
		2844	// this is used by identify-like spells so players can influence
		2845	// the order a bit.
		2846	void
		2847	object::splay_marked ()
		2848	{
		2849	if (object *marked = mark ())
		2850	splay (marked);
		2851	}
		2852

Diff Legend

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