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.107 by pippijn, Sat Jan 6 14:42:29 2007 UTC vs.
Revision 1.204 by root, Fri Apr 11 17:01:52 2008 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3		3	*
4	Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7		7	*
8	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
9	it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
10	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	(at your option) any later version.	11	* (at your 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 GNU General Public License
19	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
21		21	* The authors can be reached via e-mail to <support@deliantra.net>
22	The authors can be reached via e-mail at <crossfire@schmorp.de>
23	*/	22	*/
24		23
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
27	variable. */	26	variable. */
28	#include <global.h>	27	#include <global.h>
29	#include <stdio.h>	28	#include <stdio.h>
30	#include <sys/types.h>	29	#include <sys/types.h>
31	#include <sys/uio.h>	30	#include <sys/uio.h>
32	#include <object.h>	31	#include <object.h>
33	#include <funcpoint.h>	32	#include <funcpoint.h>
		33	#include <sproto.h>
34	#include <loader.h>	34	#include <loader.h>
35		35
36	#include <bitset>	36	#include <bitset>
37		37
38	int nrofallocobjects = 0;	38	UUID UUID::cur;
39	static UUID uuid;	39	static uint64_t seq_next_save;
40	const uint64 UUID_SKIP = 1<<19;	40	static const uint64 UUID_GAP = 1<<19;
41		41
42	object *active_objects; /* List of active objects that need to be processed */	42	objectvec objects;
		43	activevec actives;
43		44
44	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	45	short freearr_x[SIZEOFFREE] = {
		46	0,
		47	0, 1, 1, 1, 0, -1, -1, -1,
		48	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
45	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	49	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
46	};	50	};
47	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	51	short freearr_y[SIZEOFFREE] = {
		52	0,
		53	-1, -1, 0, 1, 1, 1, 0, -1,
		54	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
48	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	55	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
49	};	56	};
50	int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45,	57	int maxfree[SIZEOFFREE] = {
		58	0,
		59	9, 10, 13, 14, 17, 18, 21, 22,
		60	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
51	48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49	61	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
52	};	62	};
53	int freedir[SIZEOFFREE] = {	63	int freedir[SIZEOFFREE] = {
54	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	64	0,
		65	1, 2, 3, 4, 5, 6, 7, 8,
		66	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
55	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	67	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
56	};	68	};
57		69
58	static void	70	static void
59	write_uuid (void)	71	write_uuid (uval64 skip, bool sync)
60	{	72	{
61	char filename1[MAX_BUF], filename2[MAX_BUF];	73	CALL_BEGIN (2);
62		74	CALL_ARG_SV (newSVval64 (skip));
63	sprintf (filename1, "%s/uuid", settings.localdir);	75	CALL_ARG_SV (boolSV (sync));
64	sprintf (filename2, "%s/uuid~", settings.localdir);	76	CALL_CALL ("cf::write_uuid", G_DISCARD);
65		77	CALL_END;
66	FILE *fp;
67
68	if (!(fp = fopen (filename2, "w")))
69	{
70	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
71	return;
72	}
73
74	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
75	fclose (fp);
76	rename (filename2, filename1);
77	}	78	}
78		79
79	static void	80	static void
80	read_uuid (void)	81	read_uuid (void)
81	{	82	{
82	char filename[MAX_BUF];	83	char filename[MAX_BUF];
83		84
84	sprintf (filename, "%s/uuid", settings.localdir);	85	sprintf (filename, "%s/uuid", settings.localdir);
85		86
		87	seq_next_save = 0;
		88
86	FILE *fp;	89	FILE *fp;
87		90
88	if (!(fp = fopen (filename, "r")))	91	if (!(fp = fopen (filename, "r")))
89	{	92	{
90	if (errno == ENOENT)	93	if (errno == ENOENT)
91	{	94	{
92	LOG (llevInfo, "RESET uid to 1\n");	95	LOG (llevInfo, "RESET uid to 1\n");
93	uuid.seq = 0;	96	UUID::cur.seq = 0;
94	write_uuid ();	97	write_uuid (UUID_GAP, true);
95	return;	98	return;
96	}	99	}
97		100
98	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	101	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
99	_exit (1);	102	_exit (1);
100	}	103	}
101		104
102	int version;	105	UUID::BUF buf;
103	unsigned long long uid;	106	buf[0] = 0;
104	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	107	fgets (buf, sizeof (buf), fp);
		108
		109	if (!UUID::cur.parse (buf))
105	{	110	{
106	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	111	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
107	_exit (1);	112	_exit (1);
108	}	113	}
109		114
110	uuid.seq = uid;	115	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
111	write_uuid ();	116
112	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	117	write_uuid (UUID_GAP, true);
113	fclose (fp);	118	fclose (fp);
114	}	119	}
115		120
116	UUID	121	UUID
117	gen_uuid ()	122	UUID::gen ()
118	{	123	{
119	UUID uid;	124	UUID uid;
120		125
121	uid.seq = ++uuid.seq;	126	uid.seq = ++cur.seq;
122		127
123	if (!(uuid.seq & (UUID_SKIP - 1)))	128	if (expect_false (cur.seq >= seq_next_save))
124	write_uuid ();	129	{
		130	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		131	write_uuid (UUID_GAP, false);
		132	}
		133
125		134
126	return uid;	135	return uid;
127	}	136	}
128		137
129	void	138	void
130	init_uuid ()	139	UUID::init ()
131	{	140	{
132	read_uuid ();	141	read_uuid ();
133	}	142	}
134		143
135	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	144	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
…		…
253	/* This is really a spellbook check - really, we should	262	/* This is really a spellbook check - really, we should
254	* check all objects in the inventory.	263	* check all objects in the inventory.
255	*/	264	*/
256	if (ob1->inv || ob2->inv)	265	if (ob1->inv || ob2->inv)
257	{	266	{
258	/* if one object has inventory but the other doesn't, not equiv */	267	if (!(ob1->inv && ob2->inv))
259	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	268	return 0; /* inventories differ in length */
260	return 0;
261		269
262	/* Now check to see if the two inventory objects could merge */	270	if (ob1->inv->below || ob2->inv->below)
		271	return 0; /* more than one object in inv */
		272
263	if (!object::can_merge (ob1->inv, ob2->inv))	273	if (!object::can_merge (ob1->inv, ob2->inv))
264	return 0;	274	return 0; /* inventory objexts differ */
265		275
266	/* inventory ok - still need to check rest of this object to see	276	/* inventory ok - still need to check rest of this object to see
267	* if it is valid.	277	* if it is valid.
268	*/	278	*/
269	}	279	}
…		…
298	return 0;	308	return 0;
299	else if (!compare_ob_value_lists (ob1, ob2))	309	else if (!compare_ob_value_lists (ob1, ob2))
300	return 0;	310	return 0;
301	}	311	}
302		312
303	//TODO: generate an event or call into perl for additional checks
304	if (ob1->self || ob2->self)	313	if (ob1->self || ob2->self)
305	{	314	{
306	ob1->optimise ();	315	ob1->optimise ();
307	ob2->optimise ();	316	ob2->optimise ();
308		317
309	if (ob1->self || ob2->self)	318	if (ob1->self || ob2->self)
		319	{
		320	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		321	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		322
		323	if (k1 != k2)
310	return 0;	324	return 0;
		325	else if (k1 == 0)
		326	return 1;
		327	else if (!cfperl_can_merge (ob1, ob2))
		328	return 0;
		329	}
311	}	330	}
312		331
313	/* Everything passes, must be OK. */	332	/* Everything passes, must be OK. */
314	return 1;	333	return 1;
315	}	334	}
…		…
323	sum_weight (object *op)	342	sum_weight (object *op)
324	{	343	{
325	long sum;	344	long sum;
326	object *inv;	345	object *inv;
327		346
328	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	347	for (sum = 0, inv = op->inv; inv; inv = inv->below)
329	{	348	{
330	if (inv->inv)	349	if (inv->inv)
331	sum_weight (inv);	350	sum_weight (inv);
		351
332	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	352	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
333	}	353	}
334		354
335	if (op->type == CONTAINER && op->stats.Str)	355	if (op->type == CONTAINER && op->stats.Str)
336	sum = (sum * (100 - op->stats.Str)) / 100;	356	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
356	/*	376	/*
357	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	377	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
358	* Some error messages.	378	* Some error messages.
359	* The result of the dump is stored in the static global errmsg array.	379	* The result of the dump is stored in the static global errmsg array.
360	*/	380	*/
361
362	char *	381	char *
363	dump_object (object *op)	382	dump_object (object *op)
364	{	383	{
365	if (!op)	384	if (!op)
366	return strdup ("[NULLOBJ]");	385	return strdup ("[NULLOBJ]");
367		386
368	object_freezer freezer;	387	object_freezer freezer;
369	save_object (freezer, op, 1);	388	op->write (freezer);
370	return freezer.as_string ();	389	return freezer.as_string ();
371	}	390	}
372		391
373	/*	392	/*
374	* get_nearest_part(multi-object, object 2) returns the part of the	393	* get_nearest_part(multi-object, object 2) returns the part of the
375	* multi-object 1 which is closest to the second object.	394	* multi-object 1 which is closest to the second object.
376	* If it's not a multi-object, it is returned.	395	* If it's not a multi-object, it is returned.
377	*/	396	*/
378
379	object *	397	object *
380	get_nearest_part (object *op, const object *pl)	398	get_nearest_part (object *op, const object *pl)
381	{	399	{
382	object *tmp, *closest;	400	object *tmp, *closest;
383	int last_dist, i;	401	int last_dist, i;
…		…
391	}	409	}
392		410
393	/*	411	/*
394	* Returns the object which has the count-variable equal to the argument.	412	* Returns the object which has the count-variable equal to the argument.
395	*/	413	*/
396
397	object *	414	object *
398	find_object (tag_t i)	415	find_object (tag_t i)
399	{	416	{
400	for (object *op = object::first; op; op = op->next)	417	for_all_objects (op)
401	if (op->count == i)	418	if (op->count == i)
402	return op;	419	return op;
403		420
404	return 0;	421	return 0;
405	}	422	}
406		423
407	/*	424	/*
408	* Returns the first object which has a name equal to the argument.	425	* Returns the first object which has a name equal to the argument.
409	* Used only by the patch command, but not all that useful.	426	* Used only by the patch command, but not all that useful.
410	* Enables features like "patch <name-of-other-player> food 999"	427	* Enables features like "patch <name-of-other-player> food 999"
411	*/	428	*/
412
413	object *	429	object *
414	find_object_name (const char *str)	430	find_object_name (const char *str)
415	{	431	{
416	shstr_cmp str_ (str);	432	shstr_cmp str_ (str);
417	object *op;	433	object *op;
418		434
419	for (op = object::first; op != NULL; op = op->next)	435	for_all_objects (op)
420	if (op->name == str_)	436	if (op->name == str_)
421	break;	437	break;
422		438
423	return op;	439	return op;
424	}	440	}
425		441
426	void
427	free_all_object_data ()
428	{
429	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
430	}
431
432	/*	442	/*
433	* Sets the owner and sets the skill and exp pointers to owner's current	443	* Sets the owner and sets the skill and exp pointers to owner's current
434	* skill and experience objects.	444	* skill and experience objects.
		445	* ACTUALLY NO! investigate! TODO
435	*/	446	*/
436	void	447	void
437	object::set_owner (object *owner)	448	object::set_owner (object *owner)
438	{	449	{
		450	// allow objects which own objects
439	if (!owner)	451	if (owner)
440	return;
441
442	/* next line added to allow objects which own objects */
443	/* Add a check for ownercounts in here, as I got into an endless loop
444	* with the fireball owning a poison cloud which then owned the
445	* fireball. I believe that was caused by one of the objects getting
446	* freed and then another object replacing it. Since the ownercounts
447	* didn't match, this check is valid and I believe that cause is valid.
448	*/
449	while (owner->owner)	452	while (owner->owner)
450	owner = owner->owner;	453	owner = owner->owner;
		454
		455	if (flag [FLAG_FREED])
		456	{
		457	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		458	return;
		459	}
451		460
452	this->owner = owner;	461	this->owner = owner;
		462	}
		463
		464	int
		465	object::slottype () const
		466	{
		467	if (type == SKILL)
		468	{
		469	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		470	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		471	}
		472	else
		473	{
		474	if (slot [body_combat].info) return slot_combat;
		475	if (slot [body_range ].info) return slot_ranged;
		476	}
		477
		478	return slot_none;
		479	}
		480
		481	bool
		482	object::change_weapon (object *ob)
		483	{
		484	if (current_weapon == ob)
		485	return true;
		486
		487	if (chosen_skill)
		488	chosen_skill->flag [FLAG_APPLIED] = false;
		489
		490	current_weapon = ob;
		491	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		492
		493	if (chosen_skill)
		494	chosen_skill->flag [FLAG_APPLIED] = true;
		495
		496	update_stats ();
		497
		498	if (ob)
		499	{
		500	// now check wether any body locations became invalid, in which case
		501	// we cannot apply the weapon at the moment.
		502	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		503	if (slot[i].used < 0)
		504	{
		505	current_weapon = chosen_skill = 0;
		506	update_stats ();
		507
		508	new_draw_info_format (NDI_UNIQUE, 0, this,
		509	"You try to balance all your items at once, "
		510	"but the %s is just too much for your body. "
		511	"[You need to unapply some items first.]", &ob->name);
		512	return false;
		513	}
		514
		515	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		516	}
		517	else
		518	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		519
		520	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		521	{
		522	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		523	&name, ob->debug_desc ());
		524	return false;
		525	}
		526
		527	return true;
453	}	528	}
454		529
455	/* Zero the key_values on op, decrementing the shared-string	530	/* Zero the key_values on op, decrementing the shared-string
456	* refcounts and freeing the links.	531	* refcounts and freeing the links.
457	*/	532	*/
458	static void	533	static void
459	free_key_values (object *op)	534	free_key_values (object *op)
460	{	535	{
461	for (key_value *i = op->key_values; i != 0;)	536	for (key_value *i = op->key_values; i; )
462	{	537	{
463	key_value *next = i->next;	538	key_value *next = i->next;
464	delete i;	539	delete i;
465		540
466	i = next;	541	i = next;
467	}	542	}
468		543
469	op->key_values = 0;	544	op->key_values = 0;
470	}	545	}
471		546
472	/*	547	object &
473	* copy_to first frees everything allocated by the dst object,	548	object::operator =(const object &src)
474	* and then copies the contents of itself into the second
475	* object, allocating what needs to be allocated. Basically, any
476	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
477	* if the first object is freed, the pointers in the new object
478	* will point at garbage.
479	*/
480	void
481	object::copy_to (object *dst)
482	{	549	{
483	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	550	bool is_freed = flag [FLAG_FREED];
484	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	551	bool is_removed = flag [FLAG_REMOVED];
485		552
486	*(object_copy *)dst = *this;	553	*(object_copy *)this = src;
487		554
488	if (is_freed)	555	flag [FLAG_FREED] = is_freed;
489	SET_FLAG (dst, FLAG_FREED);	556	flag [FLAG_REMOVED] = is_removed;
490
491	if (is_removed)
492	SET_FLAG (dst, FLAG_REMOVED);
493
494	if (speed < 0)
495	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
496		557
497	/* Copy over key_values, if any. */	558	/* Copy over key_values, if any. */
498	if (key_values)	559	if (src.key_values)
499	{	560	{
500	key_value *tail = 0;	561	key_value *tail = 0;
501	key_value *i;
502
503	dst->key_values = 0;	562	key_values = 0;
504		563
505	for (i = key_values; i; i = i->next)	564	for (key_value *i = src.key_values; i; i = i->next)
506	{	565	{
507	key_value *new_link = new key_value;	566	key_value *new_link = new key_value;
508		567
509	new_link->next = 0;	568	new_link->next = 0;
510	new_link->key = i->key;	569	new_link->key = i->key;
511	new_link->value = i->value;	570	new_link->value = i->value;
512		571
513	/* Try and be clever here, too. */	572	/* Try and be clever here, too. */
514	if (!dst->key_values)	573	if (!key_values)
515	{	574	{
516	dst->key_values = new_link;	575	key_values = new_link;
517	tail = new_link;	576	tail = new_link;
518	}	577	}
519	else	578	else
520	{	579	{
521	tail->next = new_link;	580	tail->next = new_link;
522	tail = new_link;	581	tail = new_link;
523	}	582	}
524	}	583	}
525	}	584	}
		585	}
		586
		587	/*
		588	* copy_to first frees everything allocated by the dst object,
		589	* and then copies the contents of itself into the second
		590	* object, allocating what needs to be allocated. Basically, any
		591	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		592	* if the first object is freed, the pointers in the new object
		593	* will point at garbage.
		594	*/
		595	void
		596	object::copy_to (object *dst)
		597	{
		598	*dst = *this;
		599
		600	if (speed < 0)
		601	dst->speed_left -= rndm ();
526		602
527	dst->set_speed (dst->speed);	603	dst->set_speed (dst->speed);
		604	}
		605
		606	void
		607	object::instantiate ()
		608	{
		609	if (!uuid.seq) // HACK
		610	uuid = UUID::gen ();
		611
		612	speed_left = -0.1f;
		613	/* copy the body_info to the body_used - this is only really
		614	* need for monsters, but doesn't hurt to do it for everything.
		615	* by doing so, when a monster is created, it has good starting
		616	* values for the body_used info, so when items are created
		617	* for it, they can be properly equipped.
		618	*/
		619	for (int i = NUM_BODY_LOCATIONS; i--; )
		620	slot[i].used = slot[i].info;
		621
		622	attachable::instantiate ();
528	}	623	}
529		624
530	object *	625	object *
531	object::clone ()	626	object::clone ()
532	{	627	{
…		…
590	* UP_OBJ_FACE: only the objects face has changed.	685	* UP_OBJ_FACE: only the objects face has changed.
591	*/	686	*/
592	void	687	void
593	update_object (object *op, int action)	688	update_object (object *op, int action)
594	{	689	{
595	MoveType move_on, move_off, move_block, move_slow;
596
597	if (op == NULL)	690	if (op == NULL)
598	{	691	{
599	/* this should never happen */	692	/* this should never happen */
600	LOG (llevDebug, "update_object() called for NULL object.\n");	693	LOG (llevDebug, "update_object() called for NULL object.\n");
601	return;	694	return;
…		…
661		754
662	if (op->more)	755	if (op->more)
663	update_object (op->more, action);	756	update_object (op->more, action);
664	}	757	}
665		758
666	object *object::first;
667
668	object::object ()	759	object::object ()
669	{	760	{
670	SET_FLAG (this, FLAG_REMOVED);	761	SET_FLAG (this, FLAG_REMOVED);
671		762
672	expmul = 1.0;	763	expmul = 1.0;
673	face = blank_face;	764	face = blank_face;
674	}	765	}
675		766
676	object::~object ()	767	object::~object ()
677	{	768	{
		769	unlink ();
		770
678	free_key_values (this);	771	free_key_values (this);
679	}	772	}
680		773
		774	static int object_count;
		775
681	void object::link ()	776	void object::link ()
682	{	777	{
		778	assert (!index);//D
		779	uuid = UUID::gen ();
683	count = ++ob_count;	780	count = ++object_count;
684	uuid = gen_uuid ();
685		781
686	prev = 0;	782	refcnt_inc ();
687	next = object::first;	783	objects.insert (this);
688
689	if (object::first)
690	object::first->prev = this;
691
692	object::first = this;
693	}	784	}
694		785
695	void object::unlink ()	786	void object::unlink ()
696	{	787	{
697	if (this == object::first)	788	if (!index)
698	object::first = next;	789	return;
699		790
700	/* Remove this object from the list of used objects */	791	objects.erase (this);
701	if (prev) prev->next = next;	792	refcnt_dec ();
702	if (next) next->prev = prev;
703
704	prev = 0;
705	next = 0;
706	}
707
708	bool
709	object::active () const
710	{
711	return active_next || active_prev || this == active_objects;
712	}	793	}
713		794
714	void	795	void
715	object::activate ()	796	object::activate ()
716	{	797	{
717	/* If already on active list, don't do anything */	798	/* If already on active list, don't do anything */
718	if (active ())	799	if (active)
719	return;	800	return;
720		801
721	if (has_active_speed ())	802	if (has_active_speed ())
722	{	803	actives.insert (this);
723	/* process_events() expects us to insert the object at the beginning
724	* of the list. */
725	active_next = active_objects;
726
727	if (active_next)
728	active_next->active_prev = this;
729
730	active_objects = this;
731	}
732	}	804	}
733		805
734	void	806	void
735	object::activate_recursive ()	807	object::activate_recursive ()
736	{	808	{
…		…
750	*/	822	*/
751	void	823	void
752	object::deactivate ()	824	object::deactivate ()
753	{	825	{
754	/* If not on the active list, nothing needs to be done */	826	/* If not on the active list, nothing needs to be done */
755	if (!active ())	827	if (!active)
756	return;	828	return;
757		829
758	if (active_prev == 0)	830	actives.erase (this);
759	{
760	active_objects = active_next;
761	if (active_next)
762	active_next->active_prev = 0;
763	}
764	else
765	{
766	active_prev->active_next = active_next;
767	if (active_next)
768	active_next->active_prev = active_prev;
769	}
770
771	active_next = 0;
772	active_prev = 0;
773	}	831	}
774		832
775	void	833	void
776	object::deactivate_recursive ()	834	object::deactivate_recursive ()
777	{	835	{
…		…
811	* drop on that space.	869	* drop on that space.
812	*/	870	*/
813	if (!drop_to_ground	871	if (!drop_to_ground
814	|| !map	872	|| !map
815	|| map->in_memory != MAP_IN_MEMORY	873	|| map->in_memory != MAP_IN_MEMORY
		874	|| map->nodrop
816	|| ms ().move_block == MOVE_ALL)	875	|| ms ().move_block == MOVE_ALL)
817	{	876	{
818	while (inv)	877	while (inv)
819	{	878	{
820	inv->destroy_inv (drop_to_ground);	879	inv->destroy_inv (drop_to_ground);
…		…
829		888
830	if (op->flag [FLAG_STARTEQUIP]	889	if (op->flag [FLAG_STARTEQUIP]
831	|| op->flag [FLAG_NO_DROP]	890	|| op->flag [FLAG_NO_DROP]
832	|| op->type == RUNE	891	|| op->type == RUNE
833	|| op->type == TRAP	892	|| op->type == TRAP
834	|| op->flag [FLAG_IS_A_TEMPLATE])	893	|| op->flag [FLAG_IS_A_TEMPLATE]
		894	|| op->flag [FLAG_DESTROY_ON_DEATH])
835	op->destroy ();	895	op->destroy ();
836	else	896	else
837	map->insert (op, x, y);	897	map->insert (op, x, y);
838	}	898	}
839	}	899	}
…		…
847	}	907	}
848		908
849	void	909	void
850	object::do_destroy ()	910	object::do_destroy ()
851	{	911	{
		912	attachable::do_destroy ();
		913
852	if (flag [FLAG_IS_LINKED])	914	if (flag [FLAG_IS_LINKED])
853	remove_button_link (this);	915	remove_button_link (this);
854		916
855	if (flag [FLAG_FRIENDLY])	917	if (flag [FLAG_FRIENDLY])
856	remove_friendly_object (this);	918	remove_friendly_object (this);
857		919
858	if (!flag [FLAG_REMOVED])	920	if (!flag [FLAG_REMOVED])
859	remove ();	921	remove ();
860		922
861	if (flag [FLAG_FREED])	923	destroy_inv (true);
862	return;
863		924
864	set_speed (0);	925	deactivate ();
		926	unlink ();
865		927
866	flag [FLAG_FREED] = 1;	928	flag [FLAG_FREED] = 1;
867
868	attachable::do_destroy ();
869
870	destroy_inv (true);
871	unlink ();
872		929
873	// hack to ensure that freed objects still have a valid map	930	// hack to ensure that freed objects still have a valid map
874	{	931	{
875	static maptile *freed_map; // freed objects are moved here to avoid crashes	932	static maptile *freed_map; // freed objects are moved here to avoid crashes
876		933
877	if (!freed_map)	934	if (!freed_map)
878	{	935	{
879	freed_map = new maptile;	936	freed_map = new maptile;
880		937
		938	freed_map->path = "<freed objects map>";
881	freed_map->name = "/internal/freed_objects_map";	939	freed_map->name = "/internal/freed_objects_map";
882	freed_map->width = 3;	940	freed_map->width = 3;
883	freed_map->height = 3;	941	freed_map->height = 3;
		942	freed_map->nodrop = 1;
884		943
885	freed_map->alloc ();	944	freed_map->alloc ();
886	freed_map->in_memory = MAP_IN_MEMORY;	945	freed_map->in_memory = MAP_IN_MEMORY;
887	}	946	}
888		947
889	map = freed_map;	948	map = freed_map;
890	x = 1;	949	x = 1;
891	y = 1;	950	y = 1;
892	}	951	}
893		952
894	head = 0;
895
896	if (more)	953	if (more)
897	{	954	{
898	more->destroy ();	955	more->destroy ();
899	more = 0;	956	more = 0;
900	}	957	}
901		958
		959	head = 0;
		960
902	// clear those pointers that likely might have circular references to us	961	// clear those pointers that likely might cause circular references
903	owner = 0;	962	owner = 0;
904	enemy = 0;	963	enemy = 0;
905	attacked_by = 0;	964	attacked_by = 0;
906		965	current_weapon = 0;
907	// only relevant for players(?), but make sure of it anyways
908	contr = 0;
909	}	966	}
910		967
911	void	968	void
912	object::destroy (bool destroy_inventory)	969	object::destroy (bool destroy_inventory)
913	{	970	{
914	if (destroyed ())	971	if (destroyed ())
915	return;	972	return;
916		973
917	if (destroy_inventory)	974	if (destroy_inventory)
918	destroy_inv (false);	975	destroy_inv (false);
		976
		977	if (is_head ())
		978	if (sound_destroy)
		979	play_sound (sound_destroy);
		980	else if (flag [FLAG_MONSTER])
		981	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
919		982
920	attachable::destroy ();	983	attachable::destroy ();
921	}	984	}
922		985
923	/*	986	/*
…		…
941	* This function removes the object op from the linked list of objects	1004	* This function removes the object op from the linked list of objects
942	* which it is currently tied to. When this function is done, the	1005	* which it is currently tied to. When this function is done, the
943	* object will have no environment. If the object previously had an	1006	* object will have no environment. If the object previously had an
944	* environment, the x and y coordinates will be updated to	1007	* environment, the x and y coordinates will be updated to
945	* the previous environment.	1008	* the previous environment.
946	* Beware: This function is called from the editor as well!
947	*/	1009	*/
948	void	1010	void
949	object::remove ()	1011	object::do_remove ()
950	{	1012	{
951	object *tmp, *last = 0;	1013	object *tmp, *last = 0;
952	object *otmp;	1014	object *otmp;
953		1015
954	if (QUERY_FLAG (this, FLAG_REMOVED))	1016	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
997	}	1059	}
998	else if (map)	1060	else if (map)
999	{	1061	{
1000	if (type == PLAYER)	1062	if (type == PLAYER)
1001	{	1063	{
		1064	// leaving a spot always closes any open container on the ground
		1065	if (container && !container->env)
		1066	// this causes spurious floorbox updates, but it ensures
		1067	// that the CLOSE event is being sent.
		1068	close_container ();
		1069
1002	--map->players;	1070	--map->players;
1003	map->touch ();	1071	map->touch ();
1004	}	1072	}
1005		1073
1006	map->dirty = true;	1074	map->dirty = true;
		1075	mapspace &ms = this->ms ();
1007		1076
1008	/* link the object above us */	1077	/* link the object above us */
1009	if (above)	1078	if (above)
1010	above->below = below;	1079	above->below = below;
1011	else	1080	else
1012	map->at (x, y).top = below; /* we were top, set new top */	1081	ms.top = below; /* we were top, set new top */
1013		1082
1014	/* Relink the object below us, if there is one */	1083	/* Relink the object below us, if there is one */
1015	if (below)	1084	if (below)
1016	below->above = above;	1085	below->above = above;
1017	else	1086	else
…		…
1019	/* Nothing below, which means we need to relink map object for this space	1088	/* Nothing below, which means we need to relink map object for this space
1020	* use translated coordinates in case some oddness with map tiling is	1089	* use translated coordinates in case some oddness with map tiling is
1021	* evident	1090	* evident
1022	*/	1091	*/
1023	if (GET_MAP_OB (map, x, y) != this)	1092	if (GET_MAP_OB (map, x, y) != this)
1024	{
1025	char *dump = dump_object (this);
1026	LOG (llevError,
1027	"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump);	1093	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 ());
1028	free (dump);
1029	dump = dump_object (GET_MAP_OB (map, x, y));
1030	LOG (llevError, "%s\n", dump);
1031	free (dump);
1032	}
1033		1094
1034	map->at (x, y).bot = above; /* goes on above it. */	1095	ms.bot = above; /* goes on above it. */
1035	}	1096	}
1036		1097
1037	above = 0;	1098	above = 0;
1038	below = 0;	1099	below = 0;
1039		1100
1040	if (map->in_memory == MAP_SAVING)	1101	if (map->in_memory == MAP_SAVING)
1041	return;	1102	return;
1042		1103
1043	int check_walk_off = !flag [FLAG_NO_APPLY];	1104	int check_walk_off = !flag [FLAG_NO_APPLY];
1044		1105
		1106	if (object *pl = ms.player ())
		1107	{
		1108	if (pl->container == this)
		1109	/* If a container that the player is currently using somehow gets
		1110	* removed (most likely destroyed), update the player view
		1111	* appropriately.
		1112	*/
		1113	pl->close_container ();
		1114
		1115	pl->contr->ns->floorbox_update ();
		1116	}
		1117
1045	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1118	for (tmp = ms.bot; tmp; tmp = tmp->above)
1046	{	1119	{
1047	/* No point updating the players look faces if he is the object	1120	/* No point updating the players look faces if he is the object
1048	* being removed.	1121	* being removed.
1049	*/	1122	*/
1050
1051	if (tmp->type == PLAYER && tmp != this)
1052	{
1053	/* If a container that the player is currently using somehow gets
1054	* removed (most likely destroyed), update the player view
1055	* appropriately.
1056	*/
1057	if (tmp->container == this)
1058	{
1059	flag [FLAG_APPLIED] = 0;
1060	tmp->container = 0;
1061	}
1062
1063	if (tmp->contr->ns)
1064	tmp->contr->ns->floorbox_update ();
1065	}
1066		1123
1067	/* See if object moving off should effect something */	1124	/* See if object moving off should effect something */
1068	if (check_walk_off	1125	if (check_walk_off
1069	&& ((move_type & tmp->move_off)	1126	&& ((move_type & tmp->move_off)
1070	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1127	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1073		1130
1074	if (destroyed ())	1131	if (destroyed ())
1075	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1132	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1076	}	1133	}
1077		1134
1078	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1079	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1080	if (tmp->above == tmp)
1081	tmp->above = 0;
1082
1083	last = tmp;	1135	last = tmp;
1084	}	1136	}
1085		1137
1086	/* last == NULL if there are no objects on this space */	1138	/* last == NULL if there are no objects on this space */
1087	//TODO: this makes little sense, why only update the topmost object?	1139	//TODO: this makes little sense, why only update the topmost object?
…		…
1107	merge_ob (object *op, object *top)	1159	merge_ob (object *op, object *top)
1108	{	1160	{
1109	if (!op->nrof)	1161	if (!op->nrof)
1110	return 0;	1162	return 0;
1111		1163
1112	if (top)	1164	if (!top)
1113	for (top = op; top && top->above; top = top->above)	1165	for (top = op; top && top->above; top = top->above)
1114	;	1166	;
1115		1167
1116	for (; top; top = top->below)	1168	for (; top; top = top->below)
1117	{	1169	{
…		…
1130	}	1182	}
1131		1183
1132	return 0;	1184	return 0;
1133	}	1185	}
1134		1186
		1187	void
		1188	object::expand_tail ()
		1189	{
		1190	if (more)
		1191	return;
		1192
		1193	object *prev = this;
		1194
		1195	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1196	{
		1197	object *op = arch_to_object (at);
		1198
		1199	op->name = name;
		1200	op->name_pl = name_pl;
		1201	op->title = title;
		1202
		1203	op->head = this;
		1204	prev->more = op;
		1205
		1206	prev = op;
		1207	}
		1208	}
		1209
1135	/*	1210	/*
1136	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1211	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1137	* job preparing multi-part monsters	1212	* job preparing multi-part monsters.
1138	*/	1213	*/
1139	object *	1214	object *
1140	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1215	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1141	{	1216	{
1142	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1217	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1143	{	1218	{
1144	tmp->x = x + tmp->arch->clone.x;	1219	tmp->x = x + tmp->arch->x;
1145	tmp->y = y + tmp->arch->clone.y;	1220	tmp->y = y + tmp->arch->y;
1146	}	1221	}
1147		1222
1148	return insert_ob_in_map (op, m, originator, flag);	1223	return insert_ob_in_map (op, m, originator, flag);
1149	}	1224	}
1150		1225
…		…
1169	* just 'op' otherwise	1244	* just 'op' otherwise
1170	*/	1245	*/
1171	object *	1246	object *
1172	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1247	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1173	{	1248	{
		1249	assert (!op->flag [FLAG_FREED]);
		1250
1174	object *tmp, *top, *floor = NULL;	1251	object *top, *floor = NULL;
1175	sint16 x, y;
1176		1252
1177	if (QUERY_FLAG (op, FLAG_FREED))	1253	op->remove ();
1178	{
1179	LOG (llevError, "Trying to insert freed object!\n");
1180	return NULL;
1181	}
1182
1183	if (!m)
1184	{
1185	char *dump = dump_object (op);
1186	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1187	free (dump);
1188	return op;
1189	}
1190
1191	if (out_of_map (m, op->x, op->y))
1192	{
1193	char *dump = dump_object (op);
1194	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1195	#ifdef MANY_CORES
1196	/* Better to catch this here, as otherwise the next use of this object
1197	* is likely to cause a crash. Better to find out where it is getting
1198	* improperly inserted.
1199	*/
1200	abort ();
1201	#endif
1202	free (dump);
1203	return op;
1204	}
1205
1206	if (!QUERY_FLAG (op, FLAG_REMOVED))
1207	{
1208	char *dump = dump_object (op);
1209	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1210	free (dump);
1211	return op;
1212	}
1213
1214	if (op->more)
1215	{
1216	/* The part may be on a different map. */
1217
1218	object *more = op->more;
1219
1220	/* We really need the caller to normalise coordinates - if
1221	* we set the map, that doesn't work if the location is within
1222	* a map and this is straddling an edge. So only if coordinate
1223	* is clear wrong do we normalise it.
1224	*/
1225	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1226	more->map = get_map_from_coord (m, &more->x, &more->y);
1227	else if (!more->map)
1228	{
1229	/* For backwards compatibility - when not dealing with tiled maps,
1230	* more->map should always point to the parent.
1231	*/
1232	more->map = m;
1233	}
1234
1235	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1236	{
1237	if (!op->head)
1238	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1239
1240	return 0;
1241	}
1242	}
1243
1244	CLEAR_FLAG (op, FLAG_REMOVED);
1245		1254
1246	/* Ideally, the caller figures this out. However, it complicates a lot	1255	/* Ideally, the caller figures this out. However, it complicates a lot
1247	* of areas of callers (eg, anything that uses find_free_spot would now	1256	* of areas of callers (eg, anything that uses find_free_spot would now
1248	* need extra work	1257	* need extra work
1249	*/	1258	*/
1250	op->map = get_map_from_coord (m, &op->x, &op->y);	1259	if (!xy_normalise (m, op->x, op->y))
1251	x = op->x;	1260	{
1252	y = op->y;	1261	op->destroy ();
		1262	return 0;
		1263	}
		1264
		1265	if (object *more = op->more)
		1266	if (!insert_ob_in_map (more, m, originator, flag))
		1267	return 0;
		1268
		1269	CLEAR_FLAG (op, FLAG_REMOVED);
		1270
		1271	op->map = m;
		1272	mapspace &ms = op->ms ();
1253		1273
1254	/* this has to be done after we translate the coordinates.	1274	/* this has to be done after we translate the coordinates.
1255	*/	1275	*/
1256	if (op->nrof && !(flag & INS_NO_MERGE))	1276	if (op->nrof && !(flag & INS_NO_MERGE))
1257	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1277	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1258	if (object::can_merge (op, tmp))	1278	if (object::can_merge (op, tmp))
1259	{	1279	{
1260	op->nrof += tmp->nrof;	1280	op->nrof += tmp->nrof;
1261	tmp->destroy ();	1281	tmp->destroy ();
1262	}	1282	}
…		…
1279	op->below = originator->below;	1299	op->below = originator->below;
1280		1300
1281	if (op->below)	1301	if (op->below)
1282	op->below->above = op;	1302	op->below->above = op;
1283	else	1303	else
1284	op->ms ().bot = op;	1304	ms.bot = op;
1285		1305
1286	/* since *below* originator, no need to update top */	1306	/* since *below* originator, no need to update top */
1287	originator->below = op;	1307	originator->below = op;
1288	}	1308	}
1289	else	1309	else
1290	{	1310	{
		1311	top = ms.bot;
		1312
1291	/* If there are other objects, then */	1313	/* If there are other objects, then */
1292	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1314	if (top)
1293	{	1315	{
1294	object *last = 0;	1316	object *last = 0;
1295		1317
1296	/*	1318	/*
1297	* If there are multiple objects on this space, we do some trickier handling.	1319	* If there are multiple objects on this space, we do some trickier handling.
…		…
1303	* once we get to them. This reduces the need to traverse over all of	1325	* once we get to them. This reduces the need to traverse over all of
1304	* them when adding another one - this saves quite a bit of cpu time	1326	* them when adding another one - this saves quite a bit of cpu time
1305	* when lots of spells are cast in one area. Currently, it is presumed	1327	* when lots of spells are cast in one area. Currently, it is presumed
1306	* that flying non pickable objects are spell objects.	1328	* that flying non pickable objects are spell objects.
1307	*/	1329	*/
1308	while (top)	1330	for (top = ms.bot; top; top = top->above)
1309	{	1331	{
1310	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1332	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1311	floor = top;	1333	floor = top;
1312		1334
1313	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1335	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1316	top = top->below;	1338	top = top->below;
1317	break;	1339	break;
1318	}	1340	}
1319		1341
1320	last = top;	1342	last = top;
1321	top = top->above;
1322	}	1343	}
1323		1344
1324	/* Don't want top to be NULL, so set it to the last valid object */	1345	/* Don't want top to be NULL, so set it to the last valid object */
1325	top = last;	1346	top = last;
1326		1347
…		…
1328	* looks like instead of lots of conditions here.	1349	* looks like instead of lots of conditions here.
1329	* makes things faster, and effectively the same result.	1350	* makes things faster, and effectively the same result.
1330	*/	1351	*/
1331		1352
1332	/* Have object 'fall below' other objects that block view.	1353	/* Have object 'fall below' other objects that block view.
1333	* Unless those objects are exits, type 66	1354	* Unless those objects are exits.
1334	* If INS_ON_TOP is used, don't do this processing	1355	* If INS_ON_TOP is used, don't do this processing
1335	* Need to find the object that in fact blocks view, otherwise	1356	* Need to find the object that in fact blocks view, otherwise
1336	* stacking is a bit odd.	1357	* stacking is a bit odd.
1337	*/	1358	*/
1338	if (!(flag & INS_ON_TOP) &&	1359	if (!(flag & INS_ON_TOP)
1339	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1360	&& ms.flags () & P_BLOCKSVIEW
		1361	&& (op->face && !faces [op->face].visibility))
1340	{	1362	{
1341	for (last = top; last != floor; last = last->below)	1363	for (last = top; last != floor; last = last->below)
1342	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1364	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1343	break;	1365	break;
		1366
1344	/* Check to see if we found the object that blocks view,	1367	/* Check to see if we found the object that blocks view,
1345	* and make sure we have a below pointer for it so that	1368	* and make sure we have a below pointer for it so that
1346	* we can get inserted below this one, which requires we	1369	* we can get inserted below this one, which requires we
1347	* set top to the object below us.	1370	* set top to the object below us.
1348	*/	1371	*/
1349	if (last && last->below && last != floor)	1372	if (last && last->below && last != floor)
1350	top = last->below;	1373	top = last->below;
1351	}	1374	}
1352	} /* If objects on this space */	1375	} /* If objects on this space */
1353		1376
1354	if (flag & INS_MAP_LOAD)
1355	top = GET_MAP_TOP (op->map, op->x, op->y);
1356
1357	if (flag & INS_ABOVE_FLOOR_ONLY)	1377	if (flag & INS_ABOVE_FLOOR_ONLY)
1358	top = floor;	1378	top = floor;
1359		1379
1360	/* Top is the object that our object (op) is going to get inserted above.	1380	/* Top is the object that our object (op) is going to get inserted above.
1361	*/	1381	*/
1362		1382
1363	/* First object on this space */	1383	/* First object on this space */
1364	if (!top)	1384	if (!top)
1365	{	1385	{
1366	op->above = GET_MAP_OB (op->map, op->x, op->y);	1386	op->above = ms.bot;
1367		1387
1368	if (op->above)	1388	if (op->above)
1369	op->above->below = op;	1389	op->above->below = op;
1370		1390
1371	op->below = 0;	1391	op->below = 0;
1372	op->ms ().bot = op;	1392	ms.bot = op;
1373	}	1393	}
1374	else	1394	else
1375	{ /* get inserted into the stack above top */	1395	{ /* get inserted into the stack above top */
1376	op->above = top->above;	1396	op->above = top->above;
1377		1397
…		…
1381	op->below = top;	1401	op->below = top;
1382	top->above = op;	1402	top->above = op;
1383	}	1403	}
1384		1404
1385	if (!op->above)	1405	if (!op->above)
1386	op->ms ().top = op;	1406	ms.top = op;
1387	} /* else not INS_BELOW_ORIGINATOR */	1407	} /* else not INS_BELOW_ORIGINATOR */
1388		1408
1389	if (op->type == PLAYER)	1409	if (op->type == PLAYER)
1390	{	1410	{
1391	op->contr->do_los = 1;	1411	op->contr->do_los = 1;
…		…
1393	op->map->touch ();	1413	op->map->touch ();
1394	}	1414	}
1395		1415
1396	op->map->dirty = true;	1416	op->map->dirty = true;
1397		1417
1398	/* If we have a floor, we know the player, if any, will be above
1399	* it, so save a few ticks and start from there.
1400	*/
1401	if (!(flag & INS_MAP_LOAD))
1402	if (object *pl = op->ms ().player ())	1418	if (object *pl = ms.player ())
1403	if (pl->contr->ns)
1404	pl->contr->ns->floorbox_update ();	1419	pl->contr->ns->floorbox_update ();
1405		1420
1406	/* If this object glows, it may affect lighting conditions that are	1421	/* If this object glows, it may affect lighting conditions that are
1407	* visible to others on this map. But update_all_los is really	1422	* visible to others on this map. But update_all_los is really
1408	* an inefficient way to do this, as it means los for all players	1423	* an inefficient way to do this, as it means los for all players
1409	* on the map will get recalculated. The players could very well	1424	* on the map will get recalculated. The players could very well
…		…
1428	* blocked() and wall() work properly), and these flags are updated by	1443	* blocked() and wall() work properly), and these flags are updated by
1429	* update_object().	1444	* update_object().
1430	*/	1445	*/
1431		1446
1432	/* if this is not the head or flag has been passed, don't check walk on status */	1447	/* if this is not the head or flag has been passed, don't check walk on status */
1433	if (!(flag & INS_NO_WALK_ON) && !op->head)	1448	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1434	{	1449	{
1435	if (check_move_on (op, originator))	1450	if (check_move_on (op, originator))
1436	return 0;	1451	return 0;
1437		1452
1438	/* If we are a multi part object, lets work our way through the check	1453	/* If we are a multi part object, lets work our way through the check
1439	* walk on's.	1454	* walk on's.
1440	*/	1455	*/
1441	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1456	for (object *tmp = op->more; tmp; tmp = tmp->more)
1442	if (check_move_on (tmp, originator))	1457	if (check_move_on (tmp, originator))
1443	return 0;	1458	return 0;
1444	}	1459	}
1445		1460
1446	return op;	1461	return op;
…		…
1456	object *tmp, *tmp1;	1471	object *tmp, *tmp1;
1457		1472
1458	/* first search for itself and remove any old instances */	1473	/* first search for itself and remove any old instances */
1459		1474
1460	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1475	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1461	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1476	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1462	tmp->destroy ();	1477	tmp->destroy ();
1463		1478
1464	tmp1 = arch_to_object (archetype::find (arch_string));	1479	tmp1 = arch_to_object (archetype::find (arch_string));
1465		1480
1466	tmp1->x = op->x;	1481	tmp1->x = op->x;
…		…
1469	}	1484	}
1470		1485
1471	object *	1486	object *
1472	object::insert_at (object *where, object *originator, int flags)	1487	object::insert_at (object *where, object *originator, int flags)
1473	{	1488	{
1474	where->map->insert (this, where->x, where->y, originator, flags);	1489	return where->map->insert (this, where->x, where->y, originator, flags);
1475	}	1490	}
1476		1491
1477	/*	1492	/*
1478	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1493	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1479	* is returned contains nr objects, and the remaining parts contains	1494	* is returned contains nr objects, and the remaining parts contains
…		…
1519	* the amount of an object. If the amount reaches 0, the object	1534	* the amount of an object. If the amount reaches 0, the object
1520	* is subsequently removed and freed.	1535	* is subsequently removed and freed.
1521	*	1536	*
1522	* Return value: 'op' if something is left, NULL if the amount reached 0	1537	* Return value: 'op' if something is left, NULL if the amount reached 0
1523	*/	1538	*/
1524
1525	object *	1539	object *
1526	decrease_ob_nr (object *op, uint32 i)	1540	decrease_ob_nr (object *op, uint32 i)
1527	{	1541	{
1528	object *tmp;	1542	object *tmp;
1529		1543
…		…
1604		1618
1605	/*	1619	/*
1606	* add_weight(object, weight) adds the specified weight to an object,	1620	* add_weight(object, weight) adds the specified weight to an object,
1607	* and also updates how much the environment(s) is/are carrying.	1621	* and also updates how much the environment(s) is/are carrying.
1608	*/	1622	*/
1609
1610	void	1623	void
1611	add_weight (object *op, signed long weight)	1624	add_weight (object *op, signed long weight)
1612	{	1625	{
1613	while (op != NULL)	1626	while (op != NULL)
1614	{	1627	{
…		…
1629	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1642	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1630	free (dump);	1643	free (dump);
1631	return op;	1644	return op;
1632	}	1645	}
1633		1646
1634	if (where->head)	1647	if (where->head_ () != where)
1635	{	1648	{
1636	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1649	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1637	where = where->head;	1650	where = where->head;
1638	}	1651	}
1639		1652
1640	return where->insert (op);	1653	return where->insert (op);
1641	}	1654	}
…		…
1646	* inside the object environment.	1659	* inside the object environment.
1647	*	1660	*
1648	* The function returns now pointer to inserted item, and return value can	1661	* The function returns now pointer to inserted item, and return value can
1649	* be != op, if items are merged. -Tero	1662	* be != op, if items are merged. -Tero
1650	*/	1663	*/
1651
1652	object *	1664	object *
1653	object::insert (object *op)	1665	object::insert (object *op)
1654	{	1666	{
1655	object *tmp, *otmp;
1656
1657	if (!QUERY_FLAG (op, FLAG_REMOVED))	1667	if (!QUERY_FLAG (op, FLAG_REMOVED))
1658	op->remove ();	1668	op->remove ();
1659		1669
1660	if (op->more)	1670	if (op->more)
1661	{	1671	{
…		…
1663	return op;	1673	return op;
1664	}	1674	}
1665		1675
1666	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1676	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1667	CLEAR_FLAG (op, FLAG_REMOVED);	1677	CLEAR_FLAG (op, FLAG_REMOVED);
		1678
1668	if (op->nrof)	1679	if (op->nrof)
1669	{	1680	{
1670	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1681	for (object *tmp = inv; tmp; tmp = tmp->below)
1671	if (object::can_merge (tmp, op))	1682	if (object::can_merge (tmp, op))
1672	{	1683	{
1673	/* return the original object and remove inserted object	1684	/* return the original object and remove inserted object
1674	(client needs the original object) */	1685	(client needs the original object) */
1675	tmp->nrof += op->nrof;	1686	tmp->nrof += op->nrof;
…		…
1694	add_weight (this, op->weight * op->nrof);	1705	add_weight (this, op->weight * op->nrof);
1695	}	1706	}
1696	else	1707	else
1697	add_weight (this, (op->weight + op->carrying));	1708	add_weight (this, (op->weight + op->carrying));
1698		1709
1699	otmp = this->in_player ();	1710	if (object *otmp = this->in_player ())
1700	if (otmp && otmp->contr)
1701	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1711	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1702	otmp->update_stats ();	1712	otmp->update_stats ();
1703		1713
		1714	op->owner = 0; // its his/hers now. period.
1704	op->map = 0;	1715	op->map = 0;
1705	op->env = this;	1716	op->env = this;
1706	op->above = 0;	1717	op->above = 0;
1707	op->below = 0;	1718	op->below = 0;
1708	op->x = 0, op->y = 0;	1719	op->x = op->y = 0;
1709		1720
1710	/* reset the light list and los of the players on the map */	1721	/* reset the light list and los of the players on the map */
1711	if ((op->glow_radius != 0) && map)	1722	if (op->glow_radius && map)
1712	{	1723	{
1713	#ifdef DEBUG_LIGHTS	1724	#ifdef DEBUG_LIGHTS
1714	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1725	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1715	#endif /* DEBUG_LIGHTS */	1726	#endif /* DEBUG_LIGHTS */
1716	if (map->darkness)	1727	if (map->darkness)
…		…
1816	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1827	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1817	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1828	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1818	{	1829	{
1819		1830
1820	float	1831	float
1821	diff = tmp->move_slow_penalty * FABS (op->speed);	1832	diff = tmp->move_slow_penalty * fabs (op->speed);
1822		1833
1823	if (op->type == PLAYER)	1834	if (op->type == PLAYER)
1824	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1835	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1825	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1836	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1826	diff /= 4.0;	1837	diff /= 4.0;
…		…
1950	* activate recursively a flag on an object inventory	1961	* activate recursively a flag on an object inventory
1951	*/	1962	*/
1952	void	1963	void
1953	flag_inv (object *op, int flag)	1964	flag_inv (object *op, int flag)
1954	{	1965	{
1955	if (op->inv)
1956	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1966	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1957	{	1967	{
1958	SET_FLAG (tmp, flag);	1968	SET_FLAG (tmp, flag);
1959	flag_inv (tmp, flag);	1969	flag_inv (tmp, flag);
1960	}	1970	}
1961	}	1971	}
1962		1972
1963	/*	1973	/*
1964	* deactivate recursively a flag on an object inventory	1974	* deactivate recursively a flag on an object inventory
1965	*/	1975	*/
1966	void	1976	void
1967	unflag_inv (object *op, int flag)	1977	unflag_inv (object *op, int flag)
1968	{	1978	{
1969	if (op->inv)
1970	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1979	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1971	{	1980	{
1972	CLEAR_FLAG (tmp, flag);	1981	CLEAR_FLAG (tmp, flag);
1973	unflag_inv (tmp, flag);	1982	unflag_inv (tmp, flag);
1974	}	1983	}
1975	}
1976
1977	/*
1978	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1979	* all it's inventory (recursively).
1980	* If checksums are used, a player will get set_cheat called for
1981	* him/her-self and all object carried by a call to this function.
1982	*/
1983	void
1984	set_cheat (object *op)
1985	{
1986	SET_FLAG (op, FLAG_WAS_WIZ);
1987	flag_inv (op, FLAG_WAS_WIZ);
1988	}	1984	}
1989		1985
1990	/*	1986	/*
1991	* find_free_spot(object, map, x, y, start, stop) will search for	1987	* find_free_spot(object, map, x, y, start, stop) will search for
1992	* a spot at the given map and coordinates which will be able to contain	1988	* a spot at the given map and coordinates which will be able to contain
…		…
1994	* to search (see the freearr_x/y[] definition).	1990	* to search (see the freearr_x/y[] definition).
1995	* It returns a random choice among the alternatives found.	1991	* It returns a random choice among the alternatives found.
1996	* start and stop are where to start relative to the free_arr array (1,9	1992	* start and stop are where to start relative to the free_arr array (1,9
1997	* does all 4 immediate directions). This returns the index into the	1993	* does all 4 immediate directions). This returns the index into the
1998	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1994	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1999	* Note - this only checks to see if there is space for the head of the
2000	* object - if it is a multispace object, this should be called for all
2001	* pieces.
2002	* Note2: This function does correctly handle tiled maps, but does not	1995	* Note: This function does correctly handle tiled maps, but does not
2003	* inform the caller. However, insert_ob_in_map will update as	1996	* inform the caller. However, insert_ob_in_map will update as
2004	* necessary, so the caller shouldn't need to do any special work.	1997	* necessary, so the caller shouldn't need to do any special work.
2005	* Note - updated to take an object instead of archetype - this is necessary	1998	* Note - updated to take an object instead of archetype - this is necessary
2006	* because arch_blocked (now ob_blocked) needs to know the movement type	1999	* because arch_blocked (now ob_blocked) needs to know the movement type
2007	* to know if the space in question will block the object. We can't use	2000	* to know if the space in question will block the object. We can't use
…		…
2009	* customized, changed states, etc.	2002	* customized, changed states, etc.
2010	*/	2003	*/
2011	int	2004	int
2012	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	2005	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2013	{	2006	{
		2007	int altern[SIZEOFFREE];
2014	int index = 0, flag;	2008	int index = 0, flag;
2015	int altern[SIZEOFFREE];
2016		2009
2017	for (int i = start; i < stop; i++)	2010	for (int i = start; i < stop; i++)
2018	{	2011	{
2019	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2012	mapxy pos (m, x, y); pos.move (i);
2020	if (!flag)	2013
		2014	if (!pos.normalise ())
		2015	continue;
		2016
		2017	mapspace &ms = *pos;
		2018
		2019	if (ms.flags () & P_IS_ALIVE)
		2020	continue;
		2021
		2022	/* However, often
		2023	* ob doesn't have any move type (when used to place exits)
		2024	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2025	*/
		2026	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2027	{
2021	altern [index++] = i;	2028	altern [index++] = i;
		2029	continue;
		2030	}
2022		2031
2023	/* Basically, if we find a wall on a space, we cut down the search size.	2032	/* Basically, if we find a wall on a space, we cut down the search size.
2024	* In this way, we won't return spaces that are on another side of a wall.	2033	* In this way, we won't return spaces that are on another side of a wall.
2025	* This mostly work, but it cuts down the search size in all directions -	2034	* This mostly work, but it cuts down the search size in all directions -
2026	* if the space being examined only has a wall to the north and empty	2035	* if the space being examined only has a wall to the north and empty
2027	* spaces in all the other directions, this will reduce the search space	2036	* spaces in all the other directions, this will reduce the search space
2028	* to only the spaces immediately surrounding the target area, and	2037	* to only the spaces immediately surrounding the target area, and
2029	* won't look 2 spaces south of the target space.	2038	* won't look 2 spaces south of the target space.
2030	*/	2039	*/
2031	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2040	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2041	{
2032	stop = maxfree[i];	2042	stop = maxfree[i];
		2043	continue;
		2044	}
		2045
		2046	/* Note it is intentional that we check ob - the movement type of the
		2047	* head of the object should correspond for the entire object.
		2048	*/
		2049	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2050	continue;
		2051
		2052	if (ob->blocked (m, pos.x, pos.y))
		2053	continue;
		2054
		2055	altern [index++] = i;
2033	}	2056	}
2034		2057
2035	if (!index)	2058	if (!index)
2036	return -1;	2059	return -1;
2037		2060
2038	return altern[RANDOM () % index];	2061	return altern [rndm (index)];
2039	}	2062	}
2040		2063
2041	/*	2064	/*
2042	* find_first_free_spot(archetype, maptile, x, y) works like	2065	* find_first_free_spot(archetype, maptile, x, y) works like
2043	* find_free_spot(), but it will search max number of squares.	2066	* find_free_spot(), but it will search max number of squares.
…		…
2046	*/	2069	*/
2047	int	2070	int
2048	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2071	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2049	{	2072	{
2050	for (int i = 0; i < SIZEOFFREE; i++)	2073	for (int i = 0; i < SIZEOFFREE; i++)
2051	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2074	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2052	return i;	2075	return i;
2053		2076
2054	return -1;	2077	return -1;
2055	}	2078	}
2056		2079
…		…
2064	{	2087	{
2065	arr += begin;	2088	arr += begin;
2066	end -= begin;	2089	end -= begin;
2067		2090
2068	while (--end)	2091	while (--end)
2069	swap (arr [end], arr [RANDOM () % (end + 1)]);	2092	swap (arr [end], arr [rndm (end + 1)]);
2070	}	2093	}
2071		2094
2072	/* new function to make monster searching more efficient, and effective!	2095	/* new function to make monster searching more efficient, and effective!
2073	* This basically returns a randomized array (in the passed pointer) of	2096	* This basically returns a randomized array (in the passed pointer) of
2074	* the spaces to find monsters. In this way, it won't always look for	2097	* the spaces to find monsters. In this way, it won't always look for
…		…
2110	object *tmp;	2133	object *tmp;
2111	maptile *mp;	2134	maptile *mp;
2112		2135
2113	MoveType blocked, move_type;	2136	MoveType blocked, move_type;
2114		2137
2115	if (exclude && exclude->head)	2138	if (exclude && exclude->head_ () != exclude)
2116	{	2139	{
2117	exclude = exclude->head;	2140	exclude = exclude->head;
2118	move_type = exclude->move_type;	2141	move_type = exclude->move_type;
2119	}	2142	}
2120	else	2143	else
…		…
2143	max = maxfree[i];	2166	max = maxfree[i];
2144	else if (mflags & P_IS_ALIVE)	2167	else if (mflags & P_IS_ALIVE)
2145	{	2168	{
2146	for (tmp = ms.bot; tmp; tmp = tmp->above)	2169	for (tmp = ms.bot; tmp; tmp = tmp->above)
2147	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2170	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2148	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2171	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2149	break;	2172	break;
2150		2173
2151	if (tmp)	2174	if (tmp)
2152	return freedir[i];	2175	return freedir[i];
2153	}	2176	}
…		…
2208		2231
2209	return 3;	2232	return 3;
2210	}	2233	}
2211		2234
2212	/*	2235	/*
2213	* absdir(int): Returns a number between 1 and 8, which represent
2214	* the "absolute" direction of a number (it actually takes care of
2215	* "overflow" in previous calculations of a direction).
2216	*/
2217
2218	int
2219	absdir (int d)
2220	{
2221	while (d < 1)
2222	d += 8;
2223
2224	while (d > 8)
2225	d -= 8;
2226
2227	return d;
2228	}
2229
2230	/*
2231	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2236	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2232	* between two directions (which are expected to be absolute (see absdir())	2237	* between two directions (which are expected to be absolute (see absdir())
2233	*/	2238	*/
2234
2235	int	2239	int
2236	dirdiff (int dir1, int dir2)	2240	dirdiff (int dir1, int dir2)
2237	{	2241	{
2238	int d;	2242	int d;
2239		2243
…		…
2352	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2356	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2353	* core dumps if they do.	2357	* core dumps if they do.
2354	*	2358	*
2355	* Add a check so we can't pick up invisible objects (0.93.8)	2359	* Add a check so we can't pick up invisible objects (0.93.8)
2356	*/	2360	*/
2357
2358	int	2361	int
2359	can_pick (const object *who, const object *item)	2362	can_pick (const object *who, const object *item)
2360	{	2363	{
2361	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2364	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2362	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2365	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2367	* create clone from object to another	2370	* create clone from object to another
2368	*/	2371	*/
2369	object *	2372	object *
2370	object_create_clone (object *asrc)	2373	object_create_clone (object *asrc)
2371	{	2374	{
2372	object *dst = 0, *tmp, *src, *part, *prev, *item;	2375	object *dst = 0, *tmp, *src, *prev, *item;
2373		2376
2374	if (!asrc)	2377	if (!asrc)
2375	return 0;	2378	return 0;
2376		2379
2377	src = asrc;
2378	if (src->head)
2379	src = src->head;	2380	src = asrc->head_ ();
2380		2381
2381	prev = 0;	2382	prev = 0;
2382	for (part = src; part; part = part->more)	2383	for (object *part = src; part; part = part->more)
2383	{	2384	{
2384	tmp = part->clone ();	2385	tmp = part->clone ();
2385	tmp->x -= src->x;	2386	tmp->x -= src->x;
2386	tmp->y -= src->y;	2387	tmp->y -= src->y;
2387		2388
…		…
2403		2404
2404	for (item = src->inv; item; item = item->below)	2405	for (item = src->inv; item; item = item->below)
2405	insert_ob_in_ob (object_create_clone (item), dst);	2406	insert_ob_in_ob (object_create_clone (item), dst);
2406		2407
2407	return dst;	2408	return dst;
2408	}
2409
2410	/* GROS - Creates an object using a string representing its content. */
2411	/* Basically, we save the content of the string to a temp file, then call */
2412	/* load_object on it. I admit it is a highly inefficient way to make things, */
2413	/* but it was simple to make and allows reusing the load_object function. */
2414	/* Remember not to use load_object_str in a time-critical situation. */
2415	/* Also remember that multiparts objects are not supported for now. */
2416	object *
2417	load_object_str (const char *obstr)
2418	{
2419	object *op;
2420	char filename[MAX_BUF];
2421
2422	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2423
2424	FILE *tempfile = fopen (filename, "w");
2425
2426	if (tempfile == NULL)
2427	{
2428	LOG (llevError, "Error - Unable to access load object temp file\n");
2429	return NULL;
2430	}
2431
2432	fprintf (tempfile, obstr);
2433	fclose (tempfile);
2434
2435	op = object::create ();
2436
2437	object_thawer thawer (filename);
2438
2439	if (thawer)
2440	load_object (thawer, op, 0);
2441
2442	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2443	CLEAR_FLAG (op, FLAG_REMOVED);
2444
2445	return op;
2446	}	2409	}
2447		2410
2448	/* This returns the first object in who's inventory that	2411	/* This returns the first object in who's inventory that
2449	* has the same type and subtype match.	2412	* has the same type and subtype match.
2450	* returns NULL if no match.	2413	* returns NULL if no match.
…		…
2505	if (link->key == canonical_key)	2468	if (link->key == canonical_key)
2506	return link->value;	2469	return link->value;
2507		2470
2508	return 0;	2471	return 0;
2509	}	2472	}
2510
2511		2473
2512	/*	2474	/*
2513	* Updates the canonical_key in op to value.	2475	* Updates the canonical_key in op to value.
2514	*	2476	*
2515	* canonical_key is a shared string (value doesn't have to be).	2477	* canonical_key is a shared string (value doesn't have to be).
…		…
2539	/* Basically, if the archetype has this key set,	2501	/* Basically, if the archetype has this key set,
2540	* we need to store the null value so when we save	2502	* we need to store the null value so when we save
2541	* it, we save the empty value so that when we load,	2503	* it, we save the empty value so that when we load,
2542	* we get this value back again.	2504	* we get this value back again.
2543	*/	2505	*/
2544	if (get_ob_key_link (&op->arch->clone, canonical_key))	2506	if (get_ob_key_link (op->arch, canonical_key))
2545	field->value = 0;	2507	field->value = 0;
2546	else	2508	else
2547	{	2509	{
2548	if (last)	2510	if (last)
2549	last->next = field->next;	2511	last->next = field->next;
…		…
2618	}	2580	}
2619	else	2581	else
2620	item = item->env;	2582	item = item->env;
2621	}	2583	}
2622		2584
2623
2624	const char *	2585	const char *
2625	object::flag_desc (char *desc, int len) const	2586	object::flag_desc (char *desc, int len) const
2626	{	2587	{
2627	char *p = desc;	2588	char *p = desc;
2628	bool first = true;	2589	bool first = true;
…		…
2655	{	2616	{
2656	char flagdesc[512];	2617	char flagdesc[512];
2657	char info2[256 * 4];	2618	char info2[256 * 4];
2658	char *p = info;	2619	char *p = info;
2659		2620
2660	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",	2621	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2661	count, uuid.seq,	2622	count,
		2623	uuid.c_str (),
2662	&name,	2624	&name,
2663	title ? "\",title:" : "",	2625	title ? "\",title:\"" : "",
2664	title ? (const char *)title : "",	2626	title ? (const char *)title : "",
2665	flag_desc (flagdesc, 512), type);	2627	flag_desc (flagdesc, 512), type);
2666		2628
2667	if (env)	2629	if (!this->flag[FLAG_REMOVED] && env)
2668	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2630	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2669		2631
2670	if (map)	2632	if (map)
2671	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2633	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2672		2634
…		…
2674	}	2636	}
2675		2637
2676	const char *	2638	const char *
2677	object::debug_desc () const	2639	object::debug_desc () const
2678	{	2640	{
2679	static char info[256 * 4];	2641	static char info[3][256 * 4];
		2642	static int info_idx;
		2643
2680	return debug_desc (info);	2644	return debug_desc (info [++info_idx % 3]);
2681	}	2645	}
2682		2646
		2647	struct region *
		2648	object::region () const
		2649	{
		2650	return map ? map->region (x, y)
		2651	: region::default_region ();
		2652	}
		2653
		2654	const materialtype_t *
		2655	object::dominant_material () const
		2656	{
		2657	if (materialtype_t *mt = name_to_material (materialname))
		2658	return mt;
		2659
		2660	return name_to_material (shstr_unknown);
		2661	}
		2662
		2663	void
		2664	object::open_container (object *new_container)
		2665	{
		2666	if (container == new_container)
		2667	return;
		2668
		2669	if (object *old_container = container)
		2670	{
		2671	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2672	return;
		2673
		2674	#if 0
		2675	// remove the "Close old_container" object.
		2676	if (object *closer = old_container->inv)
		2677	if (closer->type == CLOSE_CON)
		2678	closer->destroy ();
		2679	#endif
		2680
		2681	old_container->flag [FLAG_APPLIED] = 0;
		2682	container = 0;
		2683
		2684	esrv_update_item (UPD_FLAGS, this, old_container);
		2685	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2686	play_sound (sound_find ("chest_close"));
		2687	}
		2688
		2689	if (new_container)
		2690	{
		2691	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2692	return;
		2693
		2694	// TODO: this does not seem to serve any purpose anymore?
		2695	#if 0
		2696	// insert the "Close Container" object.
		2697	if (archetype *closer = new_container->other_arch)
		2698	{
		2699	object *closer = arch_to_object (new_container->other_arch);
		2700	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2701	new_container->insert (closer);
		2702	}
		2703	#endif
		2704
		2705	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2706
		2707	new_container->flag [FLAG_APPLIED] = 1;
		2708	container = new_container;
		2709
		2710	esrv_update_item (UPD_FLAGS, this, new_container);
		2711	esrv_send_inventory (this, new_container);
		2712	play_sound (sound_find ("chest_open"));
		2713	}
		2714	}
		2715
		2716	object *
		2717	object::force_find (const shstr name)
		2718	{
		2719	/* cycle through his inventory to look for the MARK we want to
		2720	* place
		2721	*/
		2722	for (object *tmp = inv; tmp; tmp = tmp->below)
		2723	if (tmp->type == FORCE && tmp->slaying == name)
		2724	return splay (tmp);
		2725
		2726	return 0;
		2727	}
		2728
		2729	void
		2730	object::force_add (const shstr name, int duration)
		2731	{
		2732	if (object *force = force_find (name))
		2733	force->destroy ();
		2734
		2735	object *force = get_archetype (FORCE_NAME);
		2736
		2737	force->slaying = name;
		2738	force->stats.food = 1;
		2739	force->speed_left = -1.f;
		2740
		2741	force->set_speed (duration ? 1.f / duration : 0.f);
		2742	force->flag [FLAG_IS_USED_UP] = true;
		2743	force->flag [FLAG_APPLIED] = true;
		2744
		2745	insert (force);
		2746	}
		2747
		2748	void
		2749	object::play_sound (faceidx sound) const
		2750	{
		2751	if (!sound)
		2752	return;
		2753
		2754	if (flag [FLAG_REMOVED])
		2755	return;
		2756
		2757	if (env)
		2758	{
		2759	if (object *pl = in_player ())
		2760	pl->contr->play_sound (sound);
		2761	}
		2762	else
		2763	map->play_sound (sound, x, y);
		2764	}
		2765

Diff Legend

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