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.228 by root, Sat May 3 11:14:50 2008 UTC vs.
Revision 1.319 by root, Sat Apr 3 02:29: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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
7	*	7	*
8	* Deliantra is free software: you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation, either version 3 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the Affero GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
20	*	21	*
21	* The authors can be reached via e-mail to <support@deliantra.net>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
23		24
24	#include <global.h>	25	#include <global.h>
25	#include <stdio.h>	26	#include <stdio.h>
26	#include <sys/types.h>	27	#include <sys/types.h>
27	#include <sys/uio.h>	28	#include <sys/uio.h>
28	#include <object.h>	29	#include <object.h>
29	#include <sproto.h>	30	#include <sproto.h>
30	#include <loader.h>
31		31
32	#include <bitset>	32	#include <bitset>
33		33
34	UUID UUID::cur;	34	UUID UUID::cur;
35	static uint64_t seq_next_save;	35	static uint64_t seq_next_save;
36	static const uint64 UUID_GAP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
		37	uint32_t mapspace::smellcount = 10000;
37		38
38	objectvec objects;	39	objectvec objects;
39	activevec actives;	40	activevec actives;
		41
		42	//+GPL
40		43
41	short freearr_x[SIZEOFFREE] = {	44	short freearr_x[SIZEOFFREE] = {
42	0,	45	0,
43	0, 1, 1, 1, 0, -1, -1, -1,	46	0, 1, 1, 1, 0, -1, -1, -1,
44	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	47	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
…		…
48	0,	51	0,
49	-1, -1, 0, 1, 1, 1, 0, -1,	52	-1, -1, 0, 1, 1, 1, 0, -1,
50	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	53	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
51	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	54	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
52	};	55	};
53	int maxfree[SIZEOFFREE] = {
54	0,
55	9, 10, 13, 14, 17, 18, 21, 22,
56	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
57	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
58	};
59	int freedir[SIZEOFFREE] = {	56	int freedir[SIZEOFFREE] = {
60	0,	57	0,
61	1, 2, 3, 4, 5, 6, 7, 8,	58	1, 2, 3, 4, 5, 6, 7, 8,
62	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	59	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
63	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	60	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
64	};	61	};
65		62
		63	static int maxfree[SIZEOFFREE] = {
		64	0,
		65	9, 10, 13, 14, 17, 18, 21, 22,
		66	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
		67	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
		68	};
		69
66	static void	70	static void
67	write_uuid (uval64 skip, bool sync)	71	write_uuid (uval64 skip, bool sync)
68	{	72	{
69	CALL_BEGIN (2);	73	CALL_BEGIN (2);
70	CALL_ARG_SV (newSVval64 (skip));	74	CALL_ARG_SV (newSVval64 (skip));
…		…
72	CALL_CALL ("cf::write_uuid", G_DISCARD);	76	CALL_CALL ("cf::write_uuid", G_DISCARD);
73	CALL_END;	77	CALL_END;
74	}	78	}
75		79
76	static void	80	static void
77	read_uuid (void)	81	read_uuid ()
78	{	82	{
79	char filename[MAX_BUF];	83	char filename[MAX_BUF];
80		84
81	sprintf (filename, "%s/uuid", settings.localdir);	85	sprintf (filename, "%s/uuid", settings.localdir);
82		86
…		…
96		100
97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	101	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
98	_exit (1);	102	_exit (1);
99	}	103	}
100		104
101	UUID::BUF buf;	105	char buf [UUID::MAX_LEN];
102	buf[0] = 0;	106	buf[0] = 0;
103	fgets (buf, sizeof (buf), fp);	107	fgets (buf, sizeof (buf), fp);
104		108
105	if (!UUID::cur.parse (buf))	109	if (!UUID::cur.parse (buf))
106	{	110	{
…		…
133		137
134	void	138	void
135	UUID::init ()	139	UUID::init ()
136	{	140	{
137	read_uuid ();	141	read_uuid ();
		142	}
		143
		144	bool
		145	UUID::parse (const char *s)
		146	{
		147	if (*s++ != '<' || *s++ != '1' || *s++ != '.')
		148	return false;
		149
		150	seq = 0;
		151
		152	while (*s != '>')
		153	{
		154	if (*s < '0')
		155	return false;
		156
		157	// this gives nice branchless code with gcc
		158	assert ('0' < 'a' && '0' == 48 && 'a' == 97);
		159	int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
		160
		161	seq = (seq << 4) | digit;
		162
		163	++s;
		164	}
		165
		166	return true;
		167	}
		168
		169	char *
		170	UUID::append (char *buf) const
		171	{
		172	*buf++ = '<';
		173	*buf++ = '1';
		174	*buf++ = '.';
		175
		176	uint64_t seq = this->seq;
		177	const int bits = 64;
		178	char nz = 0;
		179	static const char tohex [] = "0123456789abcdef";
		180
		181	// assert (len >= 3 + bits / 4 + 1 + 1);
		182	for (int i = bits / 4; --i; )
		183	{
		184	uint8_t digit = seq >> (bits - 4);
		185
		186	*buf = tohex [digit];
		187	nz |= digit;
		188	buf += nz ? 1 : 0;
		189	seq <<= 4;
		190	}
		191
		192	// last digit is special - always emit
		193	uint8_t digit = seq >> (bits - 4);
		194	*buf++ = tohex [digit];
		195
		196	*buf++ = '>';
		197
		198	return buf;
		199	}
		200
		201	char *
		202	UUID::c_str () const
		203	{
		204	static char buf [MAX_LEN];
		205	*append (buf) = 0;
		206	return buf;
138	}	207	}
139		208
140	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	209	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
141	static bool	210	static bool
142	compare_ob_value_lists_one (const object *wants, const object *has)	211	compare_ob_value_lists_one (const object *wants, const object *has)
…		…
178	* Improvements made with merge: Better checking on potion, and also	247	* Improvements made with merge: Better checking on potion, and also
179	* check weight	248	* check weight
180	*/	249	*/
181	bool object::can_merge_slow (object *ob1, object *ob2)	250	bool object::can_merge_slow (object *ob1, object *ob2)
182	{	251	{
183	/* A couple quicksanity checks */	252	/* A couple quick sanity checks */
184	if (ob1 == ob2	253	if (ob1 == ob2
185	|| ob1->type != ob2->type	254	|| ob1->type != ob2->type
186	|| ob1->speed != ob2->speed
187	|| ob1->value != ob2->value	255	|| ob1->value != ob2->value
188	|| ob1->name != ob2->name)	256	|| ob1->name != ob2->name
		257	|| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
189	return 0;	258	return 0;
190		259
191	/* Do not merge objects if nrof would overflow. First part checks	260	/* Do not merge objects if nrof would overflow, assume nrof
192	* for unsigned overflow (2c), second part checks whether the result	261	* is always 0 .. 2**31-1 */
193	* would fit into a 32 bit signed int, which is often used to hold	262	if (ob1->nrof > 0x7fffffff - ob2->nrof)
194	* nrof values.
195	*/
196	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
197	return 0;	263	return 0;
198		264
199	/* If the objects have been identified, set the BEEN_APPLIED flag.	265	/* If the objects have been identified, set the BEEN_APPLIED flag.
200	* This is to the comparison of the flags below will be OK. We	266	* This is to the comparison of the flags below will be OK. We
201	* just can't ignore the been applied or identified flags, as they	267	* just can't ignore the been applied or identified flags, as they
…		…
206	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	272	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
207		273
208	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	274	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
209	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	275	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
210		276
211	if (ob1->arch->name != ob2->arch->name	277	if (ob1->arch->archname != ob2->arch->archname
212	|| ob1->name != ob2->name	278	|| ob1->name != ob2->name
213	|| ob1->title != ob2->title	279	|| ob1->title != ob2->title
214	|| ob1->msg != ob2->msg	280	|| ob1->msg != ob2->msg
215	|| ob1->weight != ob2->weight	281	|| ob1->weight != ob2->weight
216	|| ob1->attacktype != ob2->attacktype	282	|| ob1->attacktype != ob2->attacktype
217	|| ob1->magic != ob2->magic	283	|| ob1->magic != ob2->magic
218	|| ob1->slaying != ob2->slaying	284	|| ob1->slaying != ob2->slaying
219	|| ob1->skill != ob2->skill	285	|| ob1->skill != ob2->skill
220	|| ob1->value != ob2->value	286	|| ob1->value != ob2->value
221	|| ob1->animation_id != ob2->animation_id	287	|| ob1->animation_id != ob2->animation_id
		288	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
222	|| ob1->client_type != ob2->client_type	289	|| ob1->client_type != ob2->client_type
223	|| ob1->materialname != ob2->materialname	290	|| ob1->material != ob2->material
224	|| ob1->lore != ob2->lore	291	|| ob1->lore != ob2->lore
225	|| ob1->subtype != ob2->subtype	292	|| ob1->subtype != ob2->subtype
226	|| ob1->move_type != ob2->move_type	293	|| ob1->move_type != ob2->move_type
227	|| ob1->move_block != ob2->move_block	294	|| ob1->move_block != ob2->move_block
228	|| ob1->move_allow != ob2->move_allow	295	|| ob1->move_allow != ob2->move_allow
229	|| ob1->move_on != ob2->move_on	296	|| ob1->move_on != ob2->move_on
230	|| ob1->move_off != ob2->move_off	297	|| ob1->move_off != ob2->move_off
231	|| ob1->move_slow != ob2->move_slow	298	|| ob1->move_slow != ob2->move_slow
232	|| ob1->move_slow_penalty != ob2->move_slow_penalty	299	|| fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
233	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))	300	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
234	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	301	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
235	return 0;	302	return 0;
236		303
237	if ((ob1->flag ^ ob2->flag)	304	if ((ob1->flag ^ ob2->flag)
238	.reset (FLAG_INV_LOCKED)	305	.reset (FLAG_INV_LOCKED)
239	.reset (FLAG_CLIENT_SENT)
240	.reset (FLAG_REMOVED)	306	.reset (FLAG_REMOVED)
241	.any ())	307	.any ())
242	return 0;	308	return 0;
243		309
244	/* This is really a spellbook check - we should in general	310	/* This is really a spellbook check - we should in general
…		…
326	{	392	{
327	// see if we are in a container of sorts	393	// see if we are in a container of sorts
328	if (env)	394	if (env)
329	{	395	{
330	// the player inventory itself is always visible	396	// the player inventory itself is always visible
331	if (env->type == PLAYER)	397	if (env->is_player ())
332	return env;	398	return env;
333		399
334	// else a player could have our env open	400	// else a player could have our env open
335	object *envest = env->outer_env ();	401	object *envest = env->outer_env_or_self ();
336		402
337	// the player itself is always on a map, so we will find him here	403	// the player itself is always on a map, so we will find him here
338	// even if our inv is in a player.	404	// even if our inv is in a player.
339	if (envest->is_on_map ())	405	if (envest->is_on_map ())
340	if (object *pl = envest->ms ().player ())	406	if (object *pl = envest->ms ().player ())
341	if (pl->container == env)	407	if (pl->container_ () == env)
342	return pl;	408	return pl;
343	}	409	}
344	else	410	else
345	{	411	{
346	// maybe there is a player standing on the same mapspace	412	// maybe there is a player standing on the same mapspace
347	// this will catch the case where "this" is a player	413	// this will catch the case where "this" is a player
348	if (object *pl = ms ().player ())	414	if (object *pl = ms ().player ())
349	if (!pl->container || this == pl->container)	415	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
		416	|| pl->container_ () == this)
350	return pl;	417	return pl;
351	}	418	}
352	}	419	}
353		420
354	return 0;	421	return 0;
355	}	422	}
356		423
357	// adjust weight per container type ("of holding")	424	// adjust weight per container type ("of holding")
358	static sint32	425	static sint32
359	weight_adjust (object *op, sint32 weight)	426	weight_adjust_for (object *op, sint32 weight)
360	{	427	{
361	return op->type == CONTAINER	428	return op->type == CONTAINER
362	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	429	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
363	: weight;	430	: weight;
364	}	431	}
…		…
370	static void	437	static void
371	adjust_weight (object *op, sint32 weight)	438	adjust_weight (object *op, sint32 weight)
372	{	439	{
373	while (op)	440	while (op)
374	{	441	{
		442	// adjust by actual difference to account for rounding errors
		443	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
375	weight = weight_adjust (op, weight);	444	weight = weight_adjust_for (op, op->carrying)
		445	- weight_adjust_for (op, op->carrying - weight);
376		446
377	if (!weight)	447	if (!weight)
378	return;	448	return;
379		449
380	op->carrying += weight;	450	op->carrying += weight;
…		…
403	op->update_weight ();	473	op->update_weight ();
404		474
405	sum += op->total_weight ();	475	sum += op->total_weight ();
406	}	476	}
407		477
408	sum = weight_adjust (this, sum);	478	sum = weight_adjust_for (this, sum);
409		479
410	if (sum != carrying)	480	if (sum != carrying)
411	{	481	{
412	carrying = sum;	482	carrying = sum;
413		483
…		…
429	object_freezer freezer;	499	object_freezer freezer;
430	op->write (freezer);	500	op->write (freezer);
431	return freezer.as_string ();	501	return freezer.as_string ();
432	}	502	}
433		503
434	/*	504	char *
435	* get_nearest_part(multi-object, object 2) returns the part of the	505	object::as_string ()
436	* multi-object 1 which is closest to the second object.
437	* If it's not a multi-object, it is returned.
438	*/
439	object *
440	get_nearest_part (object *op, const object *pl)
441	{	506	{
442	object *tmp, *closest;	507	return dump_object (this);
443	int last_dist, i;
444
445	if (!op->more)
446	return op;
447
448	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
449	tmp;
450	tmp = tmp->more)
451	if ((i = distance (tmp, pl)) < last_dist)
452	closest = tmp, last_dist = i;
453
454	return closest;
455	}	508	}
456		509
457	/*	510	/*
458	* Returns the object which has the count-variable equal to the argument.	511	* Returns the object which has the count-variable equal to the argument.
459	* VERRRY slow.	512	* VERRRY slow.
…		…
467		520
468	return 0;	521	return 0;
469	}	522	}
470		523
471	/*	524	/*
		525	* Returns the object which has the uuid equal to the argument.
		526	* MOAR VERRRY slow.
		527	*/
		528
		529	object *
		530	find_object_uuid (UUID i)
		531	{
		532	for_all_objects (op)
		533	if (op->uuid == i)
		534	return op;
		535
		536	return 0;
		537	}
		538
		539	/*
472	* Returns the first object which has a name equal to the argument.	540	* Returns the first object which has a name equal to the argument.
473	* Used only by the patch command, but not all that useful.	541	* Used only by the patch command, but not all that useful.
474	* Enables features like "patch <name-of-other-player> food 999"	542	* Enables features like "patch <name-of-other-player> food 999"
475	*/	543	*/
476	object *	544	object *
477	find_object_name (const char *str)	545	find_object_name (const char *str)
478	{	546	{
479	shstr_cmp str_ (str);	547	shstr_cmp str_ (str);
480	object *op;
481		548
		549	if (str_)
482	for_all_objects (op)	550	for_all_objects (op)
483	if (op->name == str_)	551	if (op->name == str_)
484	break;	552	return op;
485		553
486	return op;	554	return 0;
487	}	555	}
488		556
489	/*	557	/*
490	* Sets the owner and sets the skill and exp pointers to owner's current	558	* Sets the owner and sets the skill and exp pointers to owner's current
491	* skill and experience objects.	559	* skill and experience objects.
…		…
504	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());	572	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
505	return;	573	return;
506	}	574	}
507		575
508	this->owner = owner;	576	this->owner = owner;
509	}
510
511	int
512	object::slottype () const
513	{
514	if (type == SKILL)
515	{
516	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
517	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
518	}
519	else
520	{
521	if (slot [body_combat].info) return slot_combat;
522	if (slot [body_range ].info) return slot_ranged;
523	}
524
525	return slot_none;
526	}
527
528	bool
529	object::change_weapon (object *ob)
530	{
531	if (current_weapon == ob)
532	return true;
533
534	if (chosen_skill)
535	chosen_skill->flag [FLAG_APPLIED] = false;
536
537	current_weapon = ob;
538	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
539
540	if (chosen_skill)
541	chosen_skill->flag [FLAG_APPLIED] = true;
542
543	update_stats ();
544
545	if (ob)
546	{
547	// now check wether any body locations became invalid, in which case
548	// we cannot apply the weapon at the moment.
549	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
550	if (slot[i].used < 0)
551	{
552	current_weapon = chosen_skill = 0;
553	update_stats ();
554
555	new_draw_info_format (NDI_UNIQUE, 0, this,
556	"You try to balance all your items at once, "
557	"but the %s is just too much for your body. "
558	"[You need to unapply some items first.]", &ob->name);
559	return false;
560	}
561
562	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
563	}
564	else
565	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
566
567	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
568	{
569	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
570	&name, ob->debug_desc ());
571	return false;
572	}
573
574	return true;
575	}	577	}
576		578
577	/* Zero the key_values on op, decrementing the shared-string	579	/* Zero the key_values on op, decrementing the shared-string
578	* refcounts and freeing the links.	580	* refcounts and freeing the links.
579	*/	581	*/
…		…
632	tail = new_link;	634	tail = new_link;
633	}	635	}
634	}	636	}
635	}	637	}
636		638
637	if (speed < 0)	639	dst->activate ();
638	dst->speed_left -= rndm ();
639
640	dst->set_speed (dst->speed);
641	}	640	}
642		641
643	void	642	void
644	object::instantiate ()	643	object::instantiate ()
645	{	644	{
646	if (!uuid.seq) // HACK	645	if (!uuid.seq) // HACK
647	uuid = UUID::gen ();	646	uuid = UUID::gen ();
648		647
		648	// TODO: unclean state changes, should nt be done in copy_to AND instantiate
		649	if (flag [FLAG_RANDOM_SPEED] && speed)
		650	speed_left = - speed - rndm (); // TODO animation
		651	else
649	speed_left = -0.1f;	652	speed_left = -1.;
		653
650	/* copy the body_info to the body_used - this is only really	654	/* copy the body_info to the body_used - this is only really
651	* need for monsters, but doesn't hurt to do it for everything.	655	* need for monsters, but doesn't hurt to do it for everything.
652	* by doing so, when a monster is created, it has good starting	656	* by doing so, when a monster is created, it has good starting
653	* values for the body_used info, so when items are created	657	* values for the body_used info, so when items are created
654	* for it, they can be properly equipped.	658	* for it, they can be properly equipped.
…		…
662	object *	666	object *
663	object::clone ()	667	object::clone ()
664	{	668	{
665	object *neu = create ();	669	object *neu = create ();
666	copy_to (neu);	670	copy_to (neu);
		671
		672	// TODO: unclean state changes, should not be done in clone AND instantiate
		673	if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
		674	neu->speed_left = - neu->speed - rndm (); // TODO animation
		675
667	neu->map = map; // not copied by copy_to	676	neu->map = map; // not copied by copy_to
668	return neu;	677	return neu;
669	}	678	}
670		679
671	/*	680	/*
…		…
689	* This function needs to be called whenever the speed of an object changes.	698	* This function needs to be called whenever the speed of an object changes.
690	*/	699	*/
691	void	700	void
692	object::set_speed (float speed)	701	object::set_speed (float speed)
693	{	702	{
694	if (flag [FLAG_FREED] && speed)
695	{
696	LOG (llevError, "Object %s is freed but has speed.\n", &name);
697	speed = 0;
698	}
699
700	this->speed = speed;	703	this->speed = speed;
701		704
702	if (has_active_speed ())	705	if (has_active_speed ())
703	activate ();	706	activate ();
704	else	707	else
…		…
754		757
755	if (!(m.flags_ & P_UPTODATE))	758	if (!(m.flags_ & P_UPTODATE))
756	/* nop */;	759	/* nop */;
757	else if (action == UP_OBJ_INSERT)	760	else if (action == UP_OBJ_INSERT)
758	{	761	{
		762	#if 0
759	// this is likely overkill, TODO: revisit (schmorp)	763	// this is likely overkill, TODO: revisit (schmorp)
760	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	764	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
761	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	765	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
762	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	766	|| (op->is_player () && !(m.flags_ & P_PLAYER))
763	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	767	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
764	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	768	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
765	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	769	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
766	|| (m.move_on | op->move_on ) != m.move_on	770	|| (m.move_on | op->move_on ) != m.move_on
767	|| (m.move_off | op->move_off ) != m.move_off	771	|| (m.move_off | op->move_off ) != m.move_off
768	|| (m.move_slow | op->move_slow) != m.move_slow	772	|| (m.move_slow | op->move_slow) != m.move_slow
769	/* This isn't perfect, but I don't expect a lot of objects to	773	/* This isn't perfect, but I don't expect a lot of objects to
770	* to have move_allow right now.	774	* have move_allow right now.
771	*/	775	*/
772	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	776	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
		777	m.invalidate ();
		778	#else
773	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	779	// the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
774	m.flags_ = 0;	780	m.invalidate ();
		781	#endif
775	}	782	}
776	/* if the object is being removed, we can't make intelligent	783	/* if the object is being removed, we can't make intelligent
777	* decisions, because remove_ob can't really pass the object	784	* decisions, because remove_ob can't really pass the object
778	* that is being removed.	785	* that is being removed.
779	*/	786	*/
780	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	787	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
781	m.flags_ = 0;	788	m.invalidate ();
782	else if (action == UP_OBJ_FACE)	789	else if (action == UP_OBJ_FACE)
783	/* Nothing to do for that case */ ;	790	/* Nothing to do for that case */ ;
784	else	791	else
785	LOG (llevError, "update_object called with invalid action: %d\n", action);	792	LOG (llevError, "update_object called with invalid action: %d\n", action);
786		793
…		…
790		797
791	object::object ()	798	object::object ()
792	{	799	{
793	SET_FLAG (this, FLAG_REMOVED);	800	SET_FLAG (this, FLAG_REMOVED);
794		801
795	expmul = 1.0;	802	//expmul = 1.0; declared const for the time being
796	face = blank_face;	803	face = blank_face;
		804	material = MATERIAL_NULL;
797	}	805	}
798		806
799	object::~object ()	807	object::~object ()
800	{	808	{
801	unlink ();	809	unlink ();
…		…
830	/* If already on active list, don't do anything */	838	/* If already on active list, don't do anything */
831	if (active)	839	if (active)
832	return;	840	return;
833		841
834	if (has_active_speed ())	842	if (has_active_speed ())
		843	{
		844	if (flag [FLAG_FREED])
		845	LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		846
835	actives.insert (this);	847	actives.insert (this);
		848	}
836	}	849	}
837		850
838	void	851	void
839	object::activate_recursive ()	852	object::activate_recursive ()
840	{	853	{
…		…
901	* drop on that space.	914	* drop on that space.
902	*/	915	*/
903	if (!drop_to_ground	916	if (!drop_to_ground
904	|| !map	917	|| !map
905	|| map->in_memory != MAP_ACTIVE	918	|| map->in_memory != MAP_ACTIVE
906	|| map->nodrop	919	|| map->no_drop
907	|| ms ().move_block == MOVE_ALL)	920	|| ms ().move_block == MOVE_ALL)
908	{	921	{
909	while (inv)	922	while (inv)
910	{
911	inv->destroy_inv (false);
912	inv->destroy ();	923	inv->destroy ();
913	}
914	}	924	}
915	else	925	else
916	{ /* Put objects in inventory onto this space */	926	{ /* Put objects in inventory onto this space */
917	while (inv)	927	while (inv)
918	{	928	{
…		…
922	|| op->flag [FLAG_NO_DROP]	932	|| op->flag [FLAG_NO_DROP]
923	|| op->type == RUNE	933	|| op->type == RUNE
924	|| op->type == TRAP	934	|| op->type == TRAP
925	|| op->flag [FLAG_IS_A_TEMPLATE]	935	|| op->flag [FLAG_IS_A_TEMPLATE]
926	|| op->flag [FLAG_DESTROY_ON_DEATH])	936	|| op->flag [FLAG_DESTROY_ON_DEATH])
927	op->destroy (true);	937	op->destroy ();
928	else	938	else
929	map->insert (op, x, y);	939	map->insert (op, x, y);
930	}	940	}
931	}	941	}
932	}	942	}
…		…
940		950
941	static struct freed_map : maptile	951	static struct freed_map : maptile
942	{	952	{
943	freed_map ()	953	freed_map ()
944	{	954	{
945	path = "<freed objects map>";	955	path = "<freed objects map>";
946	name = "/internal/freed_objects_map";	956	name = "/internal/freed_objects_map";
947	width = 3;	957	width = 3;
948	height = 3;	958	height = 3;
949	nodrop = 1;	959	no_drop = 1;
		960	no_reset = 1;
950		961
951	alloc ();	962	alloc ();
952	in_memory = MAP_ACTIVE;	963	in_memory = MAP_ACTIVE;
953	}	964	}
		965
		966	~freed_map ()
		967	{
		968	destroy ();
		969	}
954	} freed_map; // freed objects are moved here to avoid crashes	970	} freed_map; // freed objects are moved here to avoid crashes
955		971
956	void	972	void
957	object::do_destroy ()	973	object::do_destroy ()
958	{	974	{
959	if (flag [FLAG_IS_LINKED])	975	if (flag [FLAG_IS_LINKED])
960	remove_button_link (this);	976	remove_link ();
961		977
962	if (flag [FLAG_FRIENDLY])	978	if (flag [FLAG_FRIENDLY])
963	remove_friendly_object (this);	979	remove_friendly_object (this);
964		980
965	remove ();	981	remove ();
…		…
990	attacked_by = 0;	1006	attacked_by = 0;
991	current_weapon = 0;	1007	current_weapon = 0;
992	}	1008	}
993		1009
994	void	1010	void
995	object::destroy (bool destroy_inventory)	1011	object::destroy ()
996	{	1012	{
997	if (destroyed ())	1013	if (destroyed ())
998	return;	1014	return;
999		1015
1000	if (!is_head () && !head->destroyed ())	1016	if (!is_head () && !head->destroyed ())
1001	{	1017	{
1002	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");	1018	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1003	head->destroy (destroy_inventory);	1019	head->destroy ();
1004	return;	1020	return;
1005	}	1021	}
1006		1022
1007	destroy_inv (!destroy_inventory);	1023	destroy_inv (false);
1008		1024
1009	if (is_head ())	1025	if (is_head ())
1010	if (sound_destroy)	1026	if (sound_destroy)
1011	play_sound (sound_destroy);	1027	play_sound (sound_destroy);
1012	else if (flag [FLAG_MONSTER])	1028	else if (flag [FLAG_MONSTER])
…		…
1023	* the previous environment.	1039	* the previous environment.
1024	*/	1040	*/
1025	void	1041	void
1026	object::do_remove ()	1042	object::do_remove ()
1027	{	1043	{
1028	object *tmp, *last = 0;
1029	object *otmp;
1030
1031	if (flag [FLAG_REMOVED])	1044	if (flag [FLAG_REMOVED])
1032	return;	1045	return;
1033		1046
1034	INVOKE_OBJECT (REMOVE, this);	1047	INVOKE_OBJECT (REMOVE, this);
1035		1048
…		…
1049	esrv_del_item (pl->contr, count);	1062	esrv_del_item (pl->contr, count);
1050	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1063	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1051		1064
1052	adjust_weight (env, -total_weight ());	1065	adjust_weight (env, -total_weight ());
1053		1066
1054	*(above ? &above->below : &env->inv) = below;	1067	object *pl = in_player ();
1055
1056	if (below)
1057	below->above = above;
1058		1068
1059	/* we set up values so that it could be inserted into	1069	/* we set up values so that it could be inserted into
1060	* the map, but we don't actually do that - it is up	1070	* the map, but we don't actually do that - it is up
1061	* to the caller to decide what we want to do.	1071	* to the caller to decide what we want to do.
1062	*/	1072	*/
1063	map = env->map;	1073	map = env->map;
1064	x = env->x;	1074	x = env->x;
1065	y = env->y;	1075	y = env->y;
		1076
		1077	// make sure cmov optimisation is applicable
		1078	*(above ? &above->below : &env->inv) = below;
		1079	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1080
1066	above = 0;	1081	above = 0;
1067	below = 0;	1082	below = 0;
1068	env = 0;	1083	env = 0;
1069		1084
1070	/* NO_FIX_PLAYER is set when a great many changes are being	1085	if (pl && pl->is_player ())
1071	* made to players inventory. If set, avoiding the call
1072	* to save cpu time.
1073	*/	1086	{
1074	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1087	if (expect_false (pl->contr->combat_ob == this))
1075	otmp->update_stats ();	1088	{
		1089	pl->apply (pl->contr->combat_ob, AP_UNAPPLY);
		1090	pl->contr->combat_ob = 0;
		1091	if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);
		1092	}
		1093
		1094	if (expect_false (pl->contr->ranged_ob == this))
		1095	{
		1096	pl->apply (pl->contr->ranged_ob, AP_UNAPPLY);
		1097	pl->contr->ranged_ob = 0;
		1098	if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);
		1099	}
		1100
		1101	pl->contr->queue_stats_update ();
		1102
		1103	if (expect_false (glow_radius) && pl->is_on_map ())
		1104	update_all_los (pl->map, pl->x, pl->y);
		1105	}
1076	}	1106	}
1077	else if (map)	1107	else if (map)
1078	{	1108	{
1079	map->dirty = true;	1109	map->dirty = true;
1080	mapspace &ms = this->ms ();	1110	mapspace &ms = this->ms ();
1081		1111
1082	if (object *pl = ms.player ())	1112	if (object *pl = ms.player ())
1083	{	1113	{
1084	if (type == PLAYER) // this == pl(!)	1114	if (is_player ())
1085	{	1115	{
		1116	if (!flag [FLAG_WIZPASS])
		1117	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1118
1086	// leaving a spot always closes any open container on the ground	1119	// leaving a spot always closes any open container on the ground
1087	if (container && !container->env)	1120	if (container && !container->env)
1088	// this causes spurious floorbox updates, but it ensures	1121	// this causes spurious floorbox updates, but it ensures
1089	// that the CLOSE event is being sent.	1122	// that the CLOSE event is being sent.
1090	close_container ();	1123	close_container ();
1091		1124
1092	--map->players;	1125	--map->players;
1093	map->touch ();	1126	map->touch ();
1094	}	1127	}
1095	else if (pl->container == this)	1128	else if (pl->container_ () == this)
1096	{	1129	{
1097	// removing a container should close it	1130	// removing a container should close it
1098	close_container ();	1131	close_container ();
1099	}	1132	}
1100		1133
1101	esrv_del_item (pl->contr, count);	1134	esrv_del_item (pl->contr, count);
1102	}	1135	}
1103		1136
1104	/* link the object above us */	1137	/* link the object above us */
1105	if (above)	1138	// re-link, make sure compiler can easily use cmove
1106	above->below = below;	1139	*(above ? &above->below : &ms.top) = below;
1107	else	1140	*(below ? &below->above : &ms.bot) = above;
1108	ms.top = below; /* we were top, set new top */
1109
1110	/* Relink the object below us, if there is one */
1111	if (below)
1112	below->above = above;
1113	else
1114	{
1115	/* Nothing below, which means we need to relink map object for this space
1116	* use translated coordinates in case some oddness with map tiling is
1117	* evident
1118	*/
1119	if (GET_MAP_OB (map, x, y) != this)
1120	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1121
1122	ms.bot = above; /* goes on above it. */
1123	}
1124		1141
1125	above = 0;	1142	above = 0;
1126	below = 0;	1143	below = 0;
1127		1144
		1145	ms.invalidate ();
		1146
1128	if (map->in_memory == MAP_SAVING)	1147	if (map->in_memory == MAP_SAVING)
1129	return;	1148	return;
1130		1149
1131	int check_walk_off = !flag [FLAG_NO_APPLY];	1150	int check_walk_off = !flag [FLAG_NO_APPLY];
1132		1151
1133	if (object *pl = ms.player ())	1152	if (object *pl = ms.player ())
1134	{	1153	{
1135	if (pl->container == this)	1154	if (pl->container_ () == this)
1136	/* If a container that the player is currently using somehow gets	1155	/* If a container that the player is currently using somehow gets
1137	* removed (most likely destroyed), update the player view	1156	* removed (most likely destroyed), update the player view
1138	* appropriately.	1157	* appropriately.
1139	*/	1158	*/
1140	pl->close_container ();	1159	pl->close_container ();
…		…
1144	//TODO: update floorbox to preserve ordering	1163	//TODO: update floorbox to preserve ordering
1145	if (pl->contr->ns)	1164	if (pl->contr->ns)
1146	pl->contr->ns->floorbox_update ();	1165	pl->contr->ns->floorbox_update ();
1147	}	1166	}
1148		1167
		1168	if (check_walk_off)
1149	for (tmp = ms.bot; tmp; tmp = tmp->above)	1169	for (object *above, *tmp = ms.bot; tmp; tmp = above)
1150	{	1170	{
		1171	above = tmp->above;
		1172
1151	/* No point updating the players look faces if he is the object	1173	/* No point updating the players look faces if he is the object
1152	* being removed.	1174	* being removed.
1153	*/	1175	*/
1154		1176
1155	/* See if object moving off should effect something */	1177	/* See if object moving off should effect something */
1156	if (check_walk_off
1157	&& ((move_type & tmp->move_off)	1178	if ((move_type & tmp->move_off)
1158	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1179	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1159	{
1160	move_apply (tmp, this, 0);	1180	move_apply (tmp, this, 0);
1161
1162	if (destroyed ())
1163	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1164	}	1181	}
1165		1182
1166	last = tmp;	1183	if (affects_los ())
1167	}
1168
1169	/* last == NULL if there are no objects on this space */
1170	//TODO: this makes little sense, why only update the topmost object?
1171	if (!last)
1172	map->at (x, y).flags_ = 0;
1173	else
1174	update_object (last, UP_OBJ_REMOVE);
1175
1176	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1177	update_all_los (map, x, y);	1184	update_all_los (map, x, y);
1178	}	1185	}
1179	}	1186	}
1180		1187
1181	/*	1188	/*
…		…
1205	esrv_update_item (UPD_NROF, pl, top);	1212	esrv_update_item (UPD_NROF, pl, top);
1206		1213
1207	op->weight = 0; // cancel the addition above	1214	op->weight = 0; // cancel the addition above
1208	op->carrying = 0; // must be 0 already	1215	op->carrying = 0; // must be 0 already
1209		1216
1210	op->destroy (1);	1217	op->destroy ();
1211		1218
1212	return top;	1219	return top;
1213	}	1220	}
1214		1221
1215	return 0;	1222	return 0;
…		…
1223		1230
1224	object *prev = this;	1231	object *prev = this;
1225		1232
1226	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)	1233	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1227	{	1234	{
1228	object *op = arch_to_object (at);	1235	object *op = at->instance ();
1229		1236
1230	op->name = name;	1237	op->name = name;
1231	op->name_pl = name_pl;	1238	op->name_pl = name_pl;
1232	op->title = title;	1239	op->title = title;
1233		1240
…		…
1243	* job preparing multi-part monsters.	1250	* job preparing multi-part monsters.
1244	*/	1251	*/
1245	object *	1252	object *
1246	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1253	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1247	{	1254	{
		1255	op->remove ();
		1256
1248	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1257	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1249	{	1258	{
1250	tmp->x = x + tmp->arch->x;	1259	tmp->x = x + tmp->arch->x;
1251	tmp->y = y + tmp->arch->y;	1260	tmp->y = y + tmp->arch->y;
1252	}	1261	}
…		…
1269	* Passing 0 for flag gives proper default values, so flag really only needs	1278	* Passing 0 for flag gives proper default values, so flag really only needs
1270	* to be set if special handling is needed.	1279	* to be set if special handling is needed.
1271	*	1280	*
1272	* Return value:	1281	* Return value:
1273	* new object if 'op' was merged with other object	1282	* new object if 'op' was merged with other object
1274	* NULL if 'op' was destroyed	1283	* NULL if there was an error (destroyed, blocked etc.)
1275	* just 'op' otherwise	1284	* just 'op' otherwise
1276	*/	1285	*/
1277	object *	1286	object *
1278	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1287	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1279	{	1288	{
1280	assert (!op->flag [FLAG_FREED]);
1281
1282	op->remove ();	1289	op->remove ();
		1290
		1291	if (m == &freed_map)//D TODO: remove soon
		1292	{//D
		1293	LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
		1294	}//D
1283		1295
1284	/* Ideally, the caller figures this out. However, it complicates a lot	1296	/* Ideally, the caller figures this out. However, it complicates a lot
1285	* of areas of callers (eg, anything that uses find_free_spot would now	1297	* of areas of callers (eg, anything that uses find_free_spot would now
1286	* need extra work	1298	* need extra work
1287	*/	1299	*/
		1300	maptile *newmap = m;
1288	if (!xy_normalise (m, op->x, op->y))	1301	if (!xy_normalise (newmap, op->x, op->y))
1289	{	1302	{
1290	op->destroy (1);	1303	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1291	return 0;	1304	return 0;
1292	}	1305	}
1293		1306
1294	if (object *more = op->more)	1307	if (object *more = op->more)
1295	if (!insert_ob_in_map (more, m, originator, flag))	1308	if (!insert_ob_in_map (more, m, originator, flag))
1296	return 0;	1309	return 0;
1297		1310
1298	CLEAR_FLAG (op, FLAG_REMOVED);	1311	op->flag [FLAG_REMOVED] = false;
1299		1312	op->env = 0;
1300	op->map = m;	1313	op->map = newmap;
		1314
1301	mapspace &ms = op->ms ();	1315	mapspace &ms = op->ms ();
1302		1316
1303	/* this has to be done after we translate the coordinates.	1317	/* this has to be done after we translate the coordinates.
1304	*/	1318	*/
1305	if (op->nrof && !(flag & INS_NO_MERGE))	1319	if (op->nrof && !(flag & INS_NO_MERGE))
1306	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1320	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1307	if (object::can_merge (op, tmp))	1321	if (object::can_merge (op, tmp))
1308	{	1322	{
1309	// TODO: we atcually want to update tmp, not op,	1323	// TODO: we actually want to update tmp, not op,
1310	// but some caller surely breaks when we return tmp	1324	// but some caller surely breaks when we return tmp
1311	// from here :/	1325	// from here :/
1312	op->nrof += tmp->nrof;	1326	op->nrof += tmp->nrof;
1313	tmp->destroy (1);	1327	tmp->destroy ();
1314	}	1328	}
1315		1329
1316	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1330	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1317	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1331	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1318		1332
…		…
1325	{	1339	{
1326	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1340	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1327	abort ();	1341	abort ();
1328	}	1342	}
1329		1343
		1344	if (!originator->is_on_map ())
		1345	{
		1346	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1347	op->debug_desc (), originator->debug_desc ());
		1348	abort ();
		1349	}
		1350
1330	op->above = originator;	1351	op->above = originator;
1331	op->below = originator->below;	1352	op->below = originator->below;
1332
1333	if (op->below)
1334	op->below->above = op;
1335	else
1336	ms.bot = op;
1337
1338	/* since *below* originator, no need to update top */
1339	originator->below = op;	1353	originator->below = op;
		1354
		1355	*(op->below ? &op->below->above : &ms.bot) = op;
1340	}	1356	}
1341	else	1357	else
1342	{	1358	{
1343	object *top, *floor = NULL;	1359	object *floor = 0;
1344		1360	object *top = ms.top;
1345	top = ms.bot;
1346		1361
1347	/* If there are other objects, then */	1362	/* If there are other objects, then */
1348	if (top)	1363	if (top)
1349	{	1364	{
1350	object *last = 0;
1351
1352	/*	1365	/*
1353	* If there are multiple objects on this space, we do some trickier handling.	1366	* If there are multiple objects on this space, we do some trickier handling.
1354	* We've already dealt with merging if appropriate.	1367	* We've already dealt with merging if appropriate.
1355	* Generally, we want to put the new object on top. But if	1368	* Generally, we want to put the new object on top. But if
1356	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1369	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1359	* once we get to them. This reduces the need to traverse over all of	1372	* once we get to them. This reduces the need to traverse over all of
1360	* them when adding another one - this saves quite a bit of cpu time	1373	* them when adding another one - this saves quite a bit of cpu time
1361	* when lots of spells are cast in one area. Currently, it is presumed	1374	* when lots of spells are cast in one area. Currently, it is presumed
1362	* that flying non pickable objects are spell objects.	1375	* that flying non pickable objects are spell objects.
1363	*/	1376	*/
1364	for (top = ms.bot; top; top = top->above)	1377	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1365	{	1378	{
1366	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1379	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1367	floor = top;	1380	floor = tmp;
1368		1381
1369	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1382	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1370	{	1383	{
1371	/* We insert above top, so we want this object below this */	1384	/* We insert above top, so we want this object below this */
1372	top = top->below;	1385	top = tmp->below;
1373	break;	1386	break;
1374	}	1387	}
1375		1388
1376	last = top;	1389	top = tmp;
1377	}	1390	}
1378
1379	/* Don't want top to be NULL, so set it to the last valid object */
1380	top = last;
1381		1391
1382	/* We let update_position deal with figuring out what the space	1392	/* We let update_position deal with figuring out what the space
1383	* looks like instead of lots of conditions here.	1393	* looks like instead of lots of conditions here.
1384	* makes things faster, and effectively the same result.	1394	* makes things faster, and effectively the same result.
1385	*/	1395	*/
…		…
1392	*/	1402	*/
1393	if (!(flag & INS_ON_TOP)	1403	if (!(flag & INS_ON_TOP)
1394	&& ms.flags () & P_BLOCKSVIEW	1404	&& ms.flags () & P_BLOCKSVIEW
1395	&& (op->face && !faces [op->face].visibility))	1405	&& (op->face && !faces [op->face].visibility))
1396	{	1406	{
		1407	object *last;
		1408
1397	for (last = top; last != floor; last = last->below)	1409	for (last = top; last != floor; last = last->below)
1398	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1410	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1399	break;	1411	break;
1400		1412
1401	/* Check to see if we found the object that blocks view,	1413	/* Check to see if we found the object that blocks view,
…		…
1409	} /* If objects on this space */	1421	} /* If objects on this space */
1410		1422
1411	if (flag & INS_ABOVE_FLOOR_ONLY)	1423	if (flag & INS_ABOVE_FLOOR_ONLY)
1412	top = floor;	1424	top = floor;
1413		1425
1414	/* Top is the object that our object (op) is going to get inserted above.	1426	// insert object above top, or bottom-most if top = 0
1415	*/
1416
1417	/* First object on this space */
1418	if (!top)	1427	if (!top)
1419	{	1428	{
		1429	op->below = 0;
1420	op->above = ms.bot;	1430	op->above = ms.bot;
1421
1422	if (op->above)
1423	op->above->below = op;
1424
1425	op->below = 0;
1426	ms.bot = op;	1431	ms.bot = op;
		1432
		1433	*(op->above ? &op->above->below : &ms.top) = op;
1427	}	1434	}
1428	else	1435	else
1429	{ /* get inserted into the stack above top */	1436	{
1430	op->above = top->above;	1437	op->above = top->above;
1431
1432	if (op->above)
1433	op->above->below = op;	1438	top->above = op;
1434		1439
1435	op->below = top;	1440	op->below = top;
1436	top->above = op;	1441	*(op->above ? &op->above->below : &ms.top) = op;
1437	}	1442	}
		1443	}
1438		1444
1439	if (!op->above)	1445	if (op->is_player ())
1440	ms.top = op;
1441	} /* else not INS_BELOW_ORIGINATOR */
1442
1443	if (op->type == PLAYER)
1444	{	1446	{
1445	op->contr->do_los = 1;	1447	op->contr->do_los = 1;
1446	++op->map->players;	1448	++op->map->players;
1447	op->map->touch ();	1449	op->map->touch ();
1448	}	1450	}
…		…
1463	* be far away from this change and not affected in any way -	1465	* be far away from this change and not affected in any way -
1464	* this should get redone to only look for players within range,	1466	* this should get redone to only look for players within range,
1465	* or just updating the P_UPTODATE for spaces within this area	1467	* or just updating the P_UPTODATE for spaces within this area
1466	* of effect may be sufficient.	1468	* of effect may be sufficient.
1467	*/	1469	*/
1468	if (op->map->darkness && (op->glow_radius != 0))	1470	if (op->affects_los ())
		1471	{
		1472	op->ms ().invalidate ();
1469	update_all_los (op->map, op->x, op->y);	1473	update_all_los (op->map, op->x, op->y);
		1474	}
1470		1475
1471	/* updates flags (blocked, alive, no magic, etc) for this map space */	1476	/* updates flags (blocked, alive, no magic, etc) for this map space */
1472	update_object (op, UP_OBJ_INSERT);	1477	update_object (op, UP_OBJ_INSERT);
1473		1478
1474	INVOKE_OBJECT (INSERT, op);	1479	INVOKE_OBJECT (INSERT, op);
…		…
1481	* blocked() and wall() work properly), and these flags are updated by	1486	* blocked() and wall() work properly), and these flags are updated by
1482	* update_object().	1487	* update_object().
1483	*/	1488	*/
1484		1489
1485	/* if this is not the head or flag has been passed, don't check walk on status */	1490	/* if this is not the head or flag has been passed, don't check walk on status */
1486	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1491	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1487	{	1492	{
1488	if (check_move_on (op, originator))	1493	if (check_move_on (op, originator))
1489	return 0;	1494	return 0;
1490		1495
1491	/* If we are a multi part object, lets work our way through the check	1496	/* If we are a multi part object, lets work our way through the check
…		…
1502	/* this function inserts an object in the map, but if it	1507	/* this function inserts an object in the map, but if it
1503	* finds an object of its own type, it'll remove that one first.	1508	* finds an object of its own type, it'll remove that one first.
1504	* op is the object to insert it under: supplies x and the map.	1509	* op is the object to insert it under: supplies x and the map.
1505	*/	1510	*/
1506	void	1511	void
1507	replace_insert_ob_in_map (const char *arch_string, object *op)	1512	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1508	{	1513	{
1509	/* first search for itself and remove any old instances */	1514	/* first search for itself and remove any old instances */
1510		1515
1511	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1516	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1512	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1517	if (tmp->arch->archname == archname) /* same archetype */
1513	tmp->destroy (1);	1518	tmp->destroy ();
1514		1519
1515	object *tmp = arch_to_object (archetype::find (arch_string));	1520	object *tmp = archetype::find (archname)->instance ();
1516		1521
1517	tmp->x = op->x;	1522	tmp->x = op->x;
1518	tmp->y = op->y;	1523	tmp->y = op->y;
1519		1524
1520	insert_ob_in_map (tmp, op->map, op, 0);	1525	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1525	{	1530	{
1526	if (where->env)	1531	if (where->env)
1527	return where->env->insert (this);	1532	return where->env->insert (this);
1528	else	1533	else
1529	return where->map->insert (this, where->x, where->y, originator, flags);	1534	return where->map->insert (this, where->x, where->y, originator, flags);
		1535	}
		1536
		1537	// check whether we can put this into the map, respect max_volume, max_items
		1538	bool
		1539	object::can_drop_at (maptile *m, int x, int y, object *originator)
		1540	{
		1541	mapspace &ms = m->at (x, y);
		1542
		1543	int items = ms.items ();
		1544
		1545	if (!items // testing !items ensures we can drop at least one item
		1546	|| (items < m->max_items
		1547	&& ms.volume () < m->max_volume))
		1548	return true;
		1549
		1550	if (originator && originator->is_player ())
		1551	originator->contr->failmsg (format (
		1552	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
		1553	query_name ()
		1554	));
		1555
		1556	return false;
1530	}	1557	}
1531		1558
1532	/*	1559	/*
1533	* decrease(object, number) decreases a specified number from	1560	* decrease(object, number) decreases a specified number from
1534	* the amount of an object. If the amount reaches 0, the object	1561	* the amount of an object. If the amount reaches 0, the object
…		…
1542	if (!nr)	1569	if (!nr)
1543	return true;	1570	return true;
1544		1571
1545	nr = min (nr, nrof);	1572	nr = min (nr, nrof);
1546		1573
		1574	if (nrof > nr)
		1575	{
1547	nrof -= nr;	1576	nrof -= nr;
1548
1549	if (nrof)
1550	{
1551	adjust_weight (env, -weight * nr); // carrying == 0	1577	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1552		1578
1553	if (object *pl = visible_to ())	1579	if (object *pl = visible_to ())
1554	esrv_update_item (UPD_NROF, pl, this);	1580	esrv_update_item (UPD_NROF, pl, this);
1555		1581
1556	return true;	1582	return true;
1557	}	1583	}
1558	else	1584	else
1559	{	1585	{
1560	destroy (1);	1586	destroy ();
1561	return false;	1587	return false;
1562	}	1588	}
1563	}	1589	}
1564		1590
1565	/*	1591	/*
…		…
1582	}	1608	}
1583	else	1609	else
1584	{	1610	{
1585	decrease (nr);	1611	decrease (nr);
1586		1612
1587	object *op = object_create_clone (this);	1613	object *op = deep_clone ();
1588	op->nrof = nr;	1614	op->nrof = nr;
1589	return op;	1615	return op;
1590	}	1616	}
1591	}	1617	}
1592		1618
…		…
1642	if (object *pl = tmp->visible_to ())	1668	if (object *pl = tmp->visible_to ())
1643	esrv_update_item (UPD_NROF, pl, tmp);	1669	esrv_update_item (UPD_NROF, pl, tmp);
1644		1670
1645	adjust_weight (this, op->total_weight ());	1671	adjust_weight (this, op->total_weight ());
1646		1672
1647	op->destroy (1);	1673	op->destroy ();
1648	op = tmp;	1674	op = tmp;
1649	goto inserted;	1675	goto inserted;
1650	}	1676	}
1651		1677
1652	op->owner = 0; // it's his/hers now. period.	1678	op->owner = 0; // it's his/hers now. period.
…		…
1670		1696
1671	adjust_weight (this, op->total_weight ());	1697	adjust_weight (this, op->total_weight ());
1672		1698
1673	inserted:	1699	inserted:
1674	/* reset the light list and los of the players on the map */	1700	/* reset the light list and los of the players on the map */
1675	if (op->glow_radius && map && map->darkness)	1701	if (op->glow_radius && is_on_map ())
		1702	{
		1703	update_stats ();
1676	update_all_los (map, x, y);	1704	update_all_los (map, x, y);
1677		1705	}
		1706	else if (is_player ())
1678	// if this is a player's inventory, update stats	1707	// if this is a player's inventory, update stats
1679	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])	1708	contr->queue_stats_update ();
1680	update_stats ();
1681		1709
1682	INVOKE_OBJECT (INSERT, this);	1710	INVOKE_OBJECT (INSERT, this);
1683		1711
1684	return op;	1712	return op;
1685	}	1713	}
…		…
1705	* on top.	1733	* on top.
1706	*/	1734	*/
1707	int	1735	int
1708	check_move_on (object *op, object *originator)	1736	check_move_on (object *op, object *originator)
1709	{	1737	{
		1738	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1739	return 0;
		1740
1710	object *tmp;	1741	object *tmp;
1711	maptile *m = op->map;	1742	maptile *m = op->map;
1712	int x = op->x, y = op->y;	1743	int x = op->x, y = op->y;
1713		1744
1714	MoveType move_on, move_slow, move_block;	1745	mapspace &ms = m->at (x, y);
1715		1746
1716	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1747	ms.update ();
1717	return 0;
1718		1748
1719	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1749	MoveType move_on = ms.move_on;
1720	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1750	MoveType move_slow = ms.move_slow;
1721	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1751	MoveType move_block = ms.move_block;
1722		1752
1723	/* if nothing on this space will slow op down or be applied,	1753	/* if nothing on this space will slow op down or be applied,
1724	* no need to do checking below. have to make sure move_type	1754	* no need to do checking below. have to make sure move_type
1725	* is set, as lots of objects don't have it set - we treat that	1755	* is set, as lots of objects don't have it set - we treat that
1726	* as walking.	1756	* as walking.
…		…
1737	return 0;	1767	return 0;
1738		1768
1739	/* The objects have to be checked from top to bottom.	1769	/* The objects have to be checked from top to bottom.
1740	* Hence, we first go to the top:	1770	* Hence, we first go to the top:
1741	*/	1771	*/
1742		1772	for (object *next, *tmp = ms.top; tmp; tmp = next)
1743	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1744	{
1745	/* Trim the search when we find the first other spell effect
1746	* this helps performance so that if a space has 50 spell objects,
1747	* we don't need to check all of them.
1748	*/
1749	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1750	break;
1751	}	1773	{
		1774	next = tmp->below;
1752		1775
1753	for (; tmp; tmp = tmp->below)
1754	{
1755	if (tmp == op)	1776	if (tmp == op)
1756	continue; /* Can't apply yourself */	1777	continue; /* Can't apply yourself */
1757		1778
1758	/* Check to see if one of the movement types should be slowed down.	1779	/* Check to see if one of the movement types should be slowed down.
1759	* Second check makes sure that the movement types not being slowed	1780	* Second check makes sure that the movement types not being slowed
…		…
1764	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1785	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1765	{	1786	{
1766	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1787	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))	1788	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1768	{	1789	{
1769
1770	float
1771	diff = tmp->move_slow_penalty * fabs (op->speed);	1790	float diff = tmp->move_slow_penalty * fabs (op->speed);
1772		1791
1773	if (op->type == PLAYER)	1792	if (op->is_player ())
1774	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1793	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1775	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1794	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1776	diff /= 4.0;	1795	diff /= 4.0;
1777		1796
1778	op->speed_left -= diff;	1797	op->speed_left -= diff;
1779	}	1798	}
1780	}	1799	}
…		…
1813	LOG (llevError, "Present_arch called outside map.\n");	1832	LOG (llevError, "Present_arch called outside map.\n");
1814	return NULL;	1833	return NULL;
1815	}	1834	}
1816		1835
1817	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1836	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1818	if (tmp->arch == at)	1837	if (tmp->arch->archname == at->archname)
1819	return tmp;	1838	return tmp;
1820		1839
1821	return NULL;	1840	return NULL;
1822	}	1841	}
1823		1842
…		…
1887	* The first matching object is returned, or NULL if none.	1906	* The first matching object is returned, or NULL if none.
1888	*/	1907	*/
1889	object *	1908	object *
1890	present_arch_in_ob (const archetype *at, const object *op)	1909	present_arch_in_ob (const archetype *at, const object *op)
1891	{	1910	{
1892	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1911	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1893	if (tmp->arch == at)	1912	if (tmp->arch->archname == at->archname)
1894	return tmp;	1913	return tmp;
1895		1914
1896	return NULL;	1915	return NULL;
1897	}	1916	}
1898		1917
…		…
1986	* head of the object should correspond for the entire object.	2005	* head of the object should correspond for the entire object.
1987	*/	2006	*/
1988	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	2007	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
1989	continue;	2008	continue;
1990		2009
1991	if (ob->blocked (m, pos.x, pos.y))	2010	if (ob->blocked (pos.m, pos.x, pos.y))
1992	continue;	2011	continue;
1993		2012
1994	altern [index++] = i;	2013	altern [index++] = i;
1995	}	2014	}
1996		2015
…		…
2064	* there is capable of.	2083	* there is capable of.
2065	*/	2084	*/
2066	int	2085	int
2067	find_dir (maptile *m, int x, int y, object *exclude)	2086	find_dir (maptile *m, int x, int y, object *exclude)
2068	{	2087	{
2069	int i, max = SIZEOFFREE, mflags;	2088	int max = SIZEOFFREE, mflags;
2070
2071	sint16 nx, ny;
2072	object *tmp;
2073	maptile *mp;
2074
2075	MoveType blocked, move_type;	2089	MoveType move_type;
2076		2090
2077	if (exclude && exclude->head_ () != exclude)	2091	if (exclude && exclude->head_ () != exclude)
2078	{	2092	{
2079	exclude = exclude->head;	2093	exclude = exclude->head;
2080	move_type = exclude->move_type;	2094	move_type = exclude->move_type;
…		…
2083	{	2097	{
2084	/* If we don't have anything, presume it can use all movement types. */	2098	/* If we don't have anything, presume it can use all movement types. */
2085	move_type = MOVE_ALL;	2099	move_type = MOVE_ALL;
2086	}	2100	}
2087		2101
2088	for (i = 1; i < max; i++)	2102	for (int i = 1; i < max; i++)
2089	{	2103	{
2090	mp = m;	2104	mapxy pos (m, x, y);
2091	nx = x + freearr_x[i];	2105	pos.move (i);
2092	ny = y + freearr_y[i];
2093		2106
2094	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2107	if (!pos.normalise ())
2095
2096	if (mflags & P_OUT_OF_MAP)
2097	max = maxfree[i];	2108	max = maxfree[i];
2098	else	2109	else
2099	{	2110	{
2100	mapspace &ms = mp->at (nx, ny);	2111	mapspace &ms = *pos;
2101		2112
2102	blocked = ms.move_block;
2103
2104	if ((move_type & blocked) == move_type)	2113	if ((move_type & ms.move_block) == move_type)
2105	max = maxfree[i];	2114	max = maxfree [i];
2106	else if (mflags & P_IS_ALIVE)	2115	else if (ms.flags () & P_IS_ALIVE)
2107	{	2116	{
2108	for (tmp = ms.bot; tmp; tmp = tmp->above)	2117	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2109	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2118	if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2110	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2119	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2111	break;
2112
2113	if (tmp)
2114	return freedir[i];	2120	return freedir [i];
2115	}	2121	}
2116	}	2122	}
2117	}	2123	}
2118		2124
2119	return 0;	2125	return 0;
…		…
2194	* This basically means that if direction is 15, then it could either go	2200	* This basically means that if direction is 15, then it could either go
2195	* direction 4, 14, or 16 to get back to where we are.	2201	* direction 4, 14, or 16 to get back to where we are.
2196	* Moved from spell_util.c to object.c with the other related direction	2202	* Moved from spell_util.c to object.c with the other related direction
2197	* functions.	2203	* functions.
2198	*/	2204	*/
2199	int reduction_dir[SIZEOFFREE][3] = {	2205	static const int reduction_dir[SIZEOFFREE][3] = {
2200	{0, 0, 0}, /* 0 */	2206	{0, 0, 0}, /* 0 */
2201	{0, 0, 0}, /* 1 */	2207	{0, 0, 0}, /* 1 */
2202	{0, 0, 0}, /* 2 */	2208	{0, 0, 0}, /* 2 */
2203	{0, 0, 0}, /* 3 */	2209	{0, 0, 0}, /* 3 */
2204	{0, 0, 0}, /* 4 */	2210	{0, 0, 0}, /* 4 */
…		…
2300	int	2306	int
2301	can_pick (const object *who, const object *item)	2307	can_pick (const object *who, const object *item)
2302	{	2308	{
2303	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2309	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2304	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2310	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2305	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2311	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2306	}	2312	}
2307		2313
2308	/*	2314	/*
2309	* create clone from object to another	2315	* create clone from object to another
2310	*/	2316	*/
2311	object *	2317	object *
2312	object_create_clone (object *asrc)	2318	object::deep_clone ()
2313	{	2319	{
		2320	assert (("deep_clone called on non-head object", is_head ()));
		2321
2314	object *dst = 0;	2322	object *dst = clone ();
2315		2323
2316	if (!asrc)
2317	return 0;
2318
2319	object *src = asrc->head_ ();
2320
2321	object *prev = 0;	2324	object *prev = dst;
2322	for (object *part = src; part; part = part->more)	2325	for (object *part = this->more; part; part = part->more)
2323	{	2326	{
2324	object *tmp = part->clone ();	2327	object *tmp = part->clone ();
2325
2326	tmp->x -= src->x;
2327	tmp->y -= src->y;
2328
2329	if (!part->head)
2330	{
2331	dst = tmp;
2332	tmp->head = 0;
2333	}
2334	else
2335	tmp->head = dst;	2328	tmp->head = dst;
2336
2337	tmp->more = 0;
2338
2339	if (prev)
2340	prev->more = tmp;	2329	prev->more = tmp;
2341
2342	prev = tmp;	2330	prev = tmp;
2343	}	2331	}
2344		2332
2345	for (object *item = src->inv; item; item = item->below)	2333	for (object *item = inv; item; item = item->below)
2346	insert_ob_in_ob (object_create_clone (item), dst);	2334	insert_ob_in_ob (item->deep_clone (), dst);
2347		2335
2348	return dst;	2336	return dst;
2349	}	2337	}
2350		2338
2351	/* This returns the first object in who's inventory that	2339	/* This returns the first object in who's inventory that
…		…
2360	return tmp;	2348	return tmp;
2361		2349
2362	return 0;	2350	return 0;
2363	}	2351	}
2364		2352
2365	const shstr &	2353	shstr_tmp
2366	object::kv_get (const shstr &key) const	2354	object::kv_get (shstr_tmp key) const
2367	{	2355	{
2368	for (key_value *kv = key_values; kv; kv = kv->next)	2356	for (key_value *kv = key_values; kv; kv = kv->next)
2369	if (kv->key == key)	2357	if (kv->key == key)
2370	return kv->value;	2358	return kv->value;
2371		2359
2372	return shstr_null;	2360	return shstr ();
2373	}	2361	}
2374		2362
2375	void	2363	void
2376	object::kv_set (const shstr &key, const shstr &value)	2364	object::kv_set (shstr_tmp key, shstr_tmp value)
2377	{	2365	{
2378	for (key_value *kv = key_values; kv; kv = kv->next)	2366	for (key_value *kv = key_values; kv; kv = kv->next)
2379	if (kv->key == key)	2367	if (kv->key == key)
2380	{	2368	{
2381	kv->value = value;	2369	kv->value = value;
…		…
2390		2378
2391	key_values = kv;	2379	key_values = kv;
2392	}	2380	}
2393		2381
2394	void	2382	void
2395	object::kv_del (const shstr &key)	2383	object::kv_del (shstr_tmp key)
2396	{	2384	{
2397	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)	2385	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2398	if ((*kvp)->key == key)	2386	if ((*kvp)->key == key)
2399	{	2387	{
2400	key_value *kv = *kvp;	2388	key_value *kv = *kvp;
…		…
2459	{	2447	{
2460	char flagdesc[512];	2448	char flagdesc[512];
2461	char info2[256 * 4];	2449	char info2[256 * 4];
2462	char *p = info;	2450	char *p = info;
2463		2451
2464	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2452	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2465	count,	2453	count,
2466	uuid.c_str (),	2454	uuid.c_str (),
2467	&name,	2455	&name,
2468	title ? "\",title:\"" : "",	2456	title ? ",title:\"" : "",
2469	title ? (const char *)title : "",	2457	title ? (const char *)title : "",
		2458	title ? "\"" : "",
2470	flag_desc (flagdesc, 512), type);	2459	flag_desc (flagdesc, 512), type);
2471		2460
2472	if (!flag[FLAG_REMOVED] && env)	2461	if (!flag[FLAG_REMOVED] && env)
2473	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2462	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2474		2463
…		…
2490	struct region *	2479	struct region *
2491	object::region () const	2480	object::region () const
2492	{	2481	{
2493	return map ? map->region (x, y)	2482	return map ? map->region (x, y)
2494	: region::default_region ();	2483	: region::default_region ();
2495	}
2496
2497	const materialtype_t *
2498	object::dominant_material () const
2499	{
2500	if (materialtype_t *mt = name_to_material (materialname))
2501	return mt;
2502
2503	return name_to_material (shstr_unknown);
2504	}	2484	}
2505		2485
2506	void	2486	void
2507	object::open_container (object *new_container)	2487	object::open_container (object *new_container)
2508	{	2488	{
…		…
2530	container = 0;	2510	container = 0;
2531		2511
2532	// client needs item update to make it work, client bug requires this to be separate	2512	// client needs item update to make it work, client bug requires this to be separate
2533	esrv_update_item (UPD_FLAGS, this, old_container);	2513	esrv_update_item (UPD_FLAGS, this, old_container);
2534		2514
2535	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2515	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2536	play_sound (sound_find ("chest_close"));	2516	play_sound (sound_find ("chest_close"));
2537	}	2517	}
2538		2518
2539	if (new_container)	2519	if (new_container)
2540	{	2520	{
…		…
2544	// TODO: this does not seem to serve any purpose anymore?	2524	// TODO: this does not seem to serve any purpose anymore?
2545	#if 0	2525	#if 0
2546	// insert the "Close Container" object.	2526	// insert the "Close Container" object.
2547	if (archetype *closer = new_container->other_arch)	2527	if (archetype *closer = new_container->other_arch)
2548	{	2528	{
2549	object *closer = arch_to_object (new_container->other_arch);	2529	object *closer = new_container->other_arch->instance ();
2550	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2530	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2551	new_container->insert (closer);	2531	new_container->insert (closer);
2552	}	2532	}
2553	#endif	2533	#endif
2554		2534
2555	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2535	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2556		2536
2557	// make sure the container is available, client bug requires this to be separate	2537	// make sure the container is available, client bug requires this to be separate
2558	esrv_send_item (this, new_container);	2538	esrv_send_item (this, new_container);
2559		2539
2560	new_container->flag [FLAG_APPLIED] = true;	2540	new_container->flag [FLAG_APPLIED] = true;
…		…
2568	// else if (!old_container->env && contr && contr->ns)	2548	// else if (!old_container->env && contr && contr->ns)
2569	// contr->ns->floorbox_reset ();	2549	// contr->ns->floorbox_reset ();
2570	}	2550	}
2571		2551
2572	object *	2552	object *
2573	object::force_find (const shstr name)	2553	object::force_find (shstr_tmp name)
2574	{	2554	{
2575	/* cycle through his inventory to look for the MARK we want to	2555	/* cycle through his inventory to look for the MARK we want to
2576	* place	2556	* place
2577	*/	2557	*/
2578	for (object *tmp = inv; tmp; tmp = tmp->below)	2558	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2580	return splay (tmp);	2560	return splay (tmp);
2581		2561
2582	return 0;	2562	return 0;
2583	}	2563	}
2584		2564
		2565	//-GPL
		2566
2585	void	2567	void
		2568	object::force_set_timer (int duration)
		2569	{
		2570	this->duration = 1;
		2571	this->speed_left = -1.f;
		2572
		2573	this->set_speed (duration ? 1.f / duration : 0.f);
		2574	}
		2575
		2576	object *
2586	object::force_add (const shstr name, int duration)	2577	object::force_add (shstr_tmp name, int duration)
2587	{	2578	{
2588	if (object *force = force_find (name))	2579	if (object *force = force_find (name))
2589	force->destroy ();	2580	force->destroy ();
2590		2581
2591	object *force = get_archetype (FORCE_NAME);	2582	object *force = get_archetype (FORCE_NAME);
2592		2583
2593	force->slaying = name;	2584	force->slaying = name;
2594	force->stats.food = 1;	2585	force->force_set_timer (duration);
2595	force->speed_left = -1.f;
2596
2597	force->set_speed (duration ? 1.f / duration : 0.f);
2598	force->flag [FLAG_IS_USED_UP] = true;
2599	force->flag [FLAG_APPLIED] = true;	2586	force->flag [FLAG_APPLIED] = true;
2600		2587
2601	insert (force);	2588	return insert (force);
2602	}	2589	}
2603		2590
2604	void	2591	void
2605	object::play_sound (faceidx sound)	2592	object::play_sound (faceidx sound) const
2606	{	2593	{
2607	if (!sound)	2594	if (!sound)
2608	return;	2595	return;
2609		2596
2610	if (flag [FLAG_REMOVED])	2597	if (is_on_map ())
		2598	map->play_sound (sound, x, y);
		2599	else if (object *pl = in_player ())
		2600	pl->contr->play_sound (sound);
		2601	}
		2602
		2603	void
		2604	object::say_msg (const char *msg) const
		2605	{
		2606	if (is_on_map ())
		2607	map->say_msg (msg, x, y);
		2608	else if (object *pl = in_player ())
		2609	pl->contr->play_sound (sound);
		2610	}
		2611
		2612	void
		2613	object::make_noise ()
		2614	{
		2615	// we do not model noise in the map, so instead put
		2616	// a temporary light into the noise source
		2617	// could use the map instead, but that's less reliable for our
		2618	// goal, which is to make invisibility a bit harder to exploit
		2619
		2620	// currently only works sensibly for players
		2621	if (!is_player ())
2611	return;	2622	return;
2612		2623
2613	if (env)	2624	// find old force, or create new one
2614	{	2625	object *force = force_find (shstr_noise_force);
2615	if (object *pl = in_player ())	2626
2616	pl->contr->play_sound (sound);	2627	if (force)
2617	}	2628	force->speed_left = -1.f; // patch old speed up
2618	else	2629	else
2619	map->play_sound (sound, x, y);	2630	{
2620	}	2631	force = archetype::get (shstr_noise_force);
2621		2632
		2633	force->slaying = shstr_noise_force;
		2634	force->stats.food = 1;
		2635	force->speed_left = -1.f;
		2636
		2637	force->set_speed (1.f / 4.f);
		2638	force->flag [FLAG_IS_USED_UP] = true;
		2639	force->flag [FLAG_APPLIED] = true;
		2640
		2641	insert (force);
		2642	}
		2643	}
		2644
		2645	void object::change_move_type (MoveType mt)
		2646	{
		2647	if (move_type == mt)
		2648	return;
		2649
		2650	if (is_on_map ())
		2651	{
		2652	// we are on the map, so handle move_on/off effects
		2653	remove ();
		2654	move_type = mt;
		2655	map->insert (this, x, y, this);
		2656	}
		2657	else
		2658	move_type = mt;
		2659	}
		2660

Diff Legend

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