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.103 by root, Tue Jan 2 20:40:34 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 (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
8	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
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
10	(at your option) any later version.	11	* (at your option) any later version.
11		12	*
12	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,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	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
18	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
20		21	* The authors can be reached via e-mail to <support@deliantra.net>
21	The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	22	*/
23		23
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
26	variable. */	26	variable. */
27	#include <global.h>	27	#include <global.h>
28	#include <stdio.h>	28	#include <stdio.h>
29	#include <sys/types.h>	29	#include <sys/types.h>
30	#include <sys/uio.h>	30	#include <sys/uio.h>
31	#include <object.h>	31	#include <object.h>
32	#include <funcpoint.h>	32	#include <funcpoint.h>
		33	#include <sproto.h>
33	#include <loader.h>	34	#include <loader.h>
34		35
35	#include <bitset>	36	#include <bitset>
36		37
37	int nrofallocobjects = 0;	38	UUID UUID::cur;
38	static UUID uuid;	39	static uint64_t seq_next_save;
39	const uint64 UUID_SKIP = 1<<19;	40	static const uint64 UUID_GAP = 1<<19;
40		41
41	object *active_objects; /* List of active objects that need to be processed */	42	objectvec objects;
		43	activevec actives;
42		44
43	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,
44	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
45	};	50	};
46	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,
47	-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
48	};	56	};
49	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,
50	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
51	};	62	};
52	int freedir[SIZEOFFREE] = {	63	int freedir[SIZEOFFREE] = {
53	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,
54	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
55	};	68	};
56		69
57	static void	70	static void
58	write_uuid (void)	71	write_uuid (uval64 skip, bool sync)
59	{	72	{
60	char filename1[MAX_BUF], filename2[MAX_BUF];	73	CALL_BEGIN (2);
61		74	CALL_ARG_SV (newSVval64 (skip));
62	sprintf (filename1, "%s/uuid", settings.localdir);	75	CALL_ARG_SV (boolSV (sync));
63	sprintf (filename2, "%s/uuid~", settings.localdir);	76	CALL_CALL ("cf::write_uuid", G_DISCARD);
64		77	CALL_END;
65	FILE *fp;
66
67	if (!(fp = fopen (filename2, "w")))
68	{
69	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
70	return;
71	}
72
73	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
74	fclose (fp);
75	rename (filename2, filename1);
76	}	78	}
77		79
78	static void	80	static void
79	read_uuid (void)	81	read_uuid (void)
80	{	82	{
81	char filename[MAX_BUF];	83	char filename[MAX_BUF];
82		84
83	sprintf (filename, "%s/uuid", settings.localdir);	85	sprintf (filename, "%s/uuid", settings.localdir);
84		86
		87	seq_next_save = 0;
		88
85	FILE *fp;	89	FILE *fp;
86		90
87	if (!(fp = fopen (filename, "r")))	91	if (!(fp = fopen (filename, "r")))
88	{	92	{
89	if (errno == ENOENT)	93	if (errno == ENOENT)
90	{	94	{
91	LOG (llevInfo, "RESET uid to 1\n");	95	LOG (llevInfo, "RESET uid to 1\n");
92	uuid.seq = 0;	96	UUID::cur.seq = 0;
93	write_uuid ();	97	write_uuid (UUID_GAP, true);
94	return;	98	return;
95	}	99	}
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	int version;	105	UUID::BUF buf;
102	unsigned long long uid;	106	buf[0] = 0;
103	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	107	fgets (buf, sizeof (buf), fp);
		108
		109	if (!UUID::cur.parse (buf))
104	{	110	{
105	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	111	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
106	_exit (1);	112	_exit (1);
107	}	113	}
108		114
109	uuid.seq = uid;	115	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
110	write_uuid ();	116
111	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	117	write_uuid (UUID_GAP, true);
112	fclose (fp);	118	fclose (fp);
113	}	119	}
114		120
115	UUID	121	UUID
116	gen_uuid ()	122	UUID::gen ()
117	{	123	{
118	UUID uid;	124	UUID uid;
119		125
120	uid.seq = ++uuid.seq;	126	uid.seq = ++cur.seq;
121		127
122	if (!(uuid.seq & (UUID_SKIP - 1)))	128	if (expect_false (cur.seq >= seq_next_save))
123	write_uuid ();	129	{
		130	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		131	write_uuid (UUID_GAP, false);
		132	}
		133
124		134
125	return uid;	135	return uid;
126	}	136	}
127		137
128	void	138	void
129	init_uuid ()	139	UUID::init ()
130	{	140	{
131	read_uuid ();	141	read_uuid ();
132	}	142	}
133		143
134	/* 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. */
…		…
252	/* This is really a spellbook check - really, we should	262	/* This is really a spellbook check - really, we should
253	* check all objects in the inventory.	263	* check all objects in the inventory.
254	*/	264	*/
255	if (ob1->inv || ob2->inv)	265	if (ob1->inv || ob2->inv)
256	{	266	{
257	/* if one object has inventory but the other doesn't, not equiv */	267	if (!(ob1->inv && ob2->inv))
258	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	268	return 0; /* inventories differ in length */
259	return 0;
260		269
261	/* 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
262	if (!object::can_merge (ob1->inv, ob2->inv))	273	if (!object::can_merge (ob1->inv, ob2->inv))
263	return 0;	274	return 0; /* inventory objexts differ */
264		275
265	/* 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
266	* if it is valid.	277	* if it is valid.
267	*/	278	*/
268	}	279	}
…		…
297	return 0;	308	return 0;
298	else if (!compare_ob_value_lists (ob1, ob2))	309	else if (!compare_ob_value_lists (ob1, ob2))
299	return 0;	310	return 0;
300	}	311	}
301		312
302	//TODO: generate an event or call into perl for additional checks
303	if (ob1->self || ob2->self)	313	if (ob1->self || ob2->self)
304	{	314	{
305	ob1->optimise ();	315	ob1->optimise ();
306	ob2->optimise ();	316	ob2->optimise ();
307		317
308	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)
309	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	}
310	}	330	}
311		331
312	/* Everything passes, must be OK. */	332	/* Everything passes, must be OK. */
313	return 1;	333	return 1;
314	}	334	}
…		…
322	sum_weight (object *op)	342	sum_weight (object *op)
323	{	343	{
324	long sum;	344	long sum;
325	object *inv;	345	object *inv;
326		346
327	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	347	for (sum = 0, inv = op->inv; inv; inv = inv->below)
328	{	348	{
329	if (inv->inv)	349	if (inv->inv)
330	sum_weight (inv);	350	sum_weight (inv);
		351
331	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	352	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
332	}	353	}
333		354
334	if (op->type == CONTAINER && op->stats.Str)	355	if (op->type == CONTAINER && op->stats.Str)
335	sum = (sum * (100 - op->stats.Str)) / 100;	356	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
355	/*	376	/*
356	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	377	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
357	* Some error messages.	378	* Some error messages.
358	* 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.
359	*/	380	*/
360
361	char *	381	char *
362	dump_object (object *op)	382	dump_object (object *op)
363	{	383	{
364	if (!op)	384	if (!op)
365	return strdup ("[NULLOBJ]");	385	return strdup ("[NULLOBJ]");
366		386
367	object_freezer freezer;	387	object_freezer freezer;
368	save_object (freezer, op, 1);	388	op->write (freezer);
369	return freezer.as_string ();	389	return freezer.as_string ();
370	}	390	}
371		391
372	/*	392	/*
373	* 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
374	* multi-object 1 which is closest to the second object.	394	* multi-object 1 which is closest to the second object.
375	* If it's not a multi-object, it is returned.	395	* If it's not a multi-object, it is returned.
376	*/	396	*/
377
378	object *	397	object *
379	get_nearest_part (object *op, const object *pl)	398	get_nearest_part (object *op, const object *pl)
380	{	399	{
381	object *tmp, *closest;	400	object *tmp, *closest;
382	int last_dist, i;	401	int last_dist, i;
…		…
390	}	409	}
391		410
392	/*	411	/*
393	* 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.
394	*/	413	*/
395
396	object *	414	object *
397	find_object (tag_t i)	415	find_object (tag_t i)
398	{	416	{
399	for (object *op = object::first; op; op = op->next)	417	for_all_objects (op)
400	if (op->count == i)	418	if (op->count == i)
401	return op;	419	return op;
402		420
403	return 0;	421	return 0;
404	}	422	}
405		423
406	/*	424	/*
407	* 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.
408	* Used only by the patch command, but not all that useful.	426	* Used only by the patch command, but not all that useful.
409	* Enables features like "patch <name-of-other-player> food 999"	427	* Enables features like "patch <name-of-other-player> food 999"
410	*/	428	*/
411
412	object *	429	object *
413	find_object_name (const char *str)	430	find_object_name (const char *str)
414	{	431	{
415	shstr_cmp str_ (str);	432	shstr_cmp str_ (str);
416	object *op;	433	object *op;
417		434
418	for (op = object::first; op != NULL; op = op->next)	435	for_all_objects (op)
419	if (op->name == str_)	436	if (op->name == str_)
420	break;	437	break;
421		438
422	return op;	439	return op;
423	}	440	}
424		441
425	void
426	free_all_object_data ()
427	{
428	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
429	}
430
431	/*	442	/*
432	* 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
433	* skill and experience objects.	444	* skill and experience objects.
		445	* ACTUALLY NO! investigate! TODO
434	*/	446	*/
435	void	447	void
436	object::set_owner (object *owner)	448	object::set_owner (object *owner)
437	{	449	{
		450	// allow objects which own objects
438	if (!owner)	451	if (owner)
439	return;
440
441	/* next line added to allow objects which own objects */
442	/* Add a check for ownercounts in here, as I got into an endless loop
443	* with the fireball owning a poison cloud which then owned the
444	* fireball. I believe that was caused by one of the objects getting
445	* freed and then another object replacing it. Since the ownercounts
446	* didn't match, this check is valid and I believe that cause is valid.
447	*/
448	while (owner->owner)	452	while (owner->owner)
449	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	}
450		460
451	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;
452	}	528	}
453		529
454	/* Zero the key_values on op, decrementing the shared-string	530	/* Zero the key_values on op, decrementing the shared-string
455	* refcounts and freeing the links.	531	* refcounts and freeing the links.
456	*/	532	*/
457	static void	533	static void
458	free_key_values (object *op)	534	free_key_values (object *op)
459	{	535	{
460	for (key_value *i = op->key_values; i != 0;)	536	for (key_value *i = op->key_values; i; )
461	{	537	{
462	key_value *next = i->next;	538	key_value *next = i->next;
463	delete i;	539	delete i;
464		540
465	i = next;	541	i = next;
466	}	542	}
467		543
468	op->key_values = 0;	544	op->key_values = 0;
469	}	545	}
470		546
471	/*	547	object &
472	* copy_to first frees everything allocated by the dst object,	548	object::operator =(const object &src)
473	* and then copies the contents of itself into the second
474	* object, allocating what needs to be allocated. Basically, any
475	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
476	* if the first object is freed, the pointers in the new object
477	* will point at garbage.
478	*/
479	void
480	object::copy_to (object *dst)
481	{	549	{
482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	550	bool is_freed = flag [FLAG_FREED];
483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	551	bool is_removed = flag [FLAG_REMOVED];
484		552
485	*(object_copy *)dst = *this;	553	*(object_copy *)this = src;
486		554
487	if (is_freed)	555	flag [FLAG_FREED] = is_freed;
488	SET_FLAG (dst, FLAG_FREED);	556	flag [FLAG_REMOVED] = is_removed;
489
490	if (is_removed)
491	SET_FLAG (dst, FLAG_REMOVED);
492
493	if (speed < 0)
494	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
495		557
496	/* Copy over key_values, if any. */	558	/* Copy over key_values, if any. */
497	if (key_values)	559	if (src.key_values)
498	{	560	{
499	key_value *tail = 0;	561	key_value *tail = 0;
500	key_value *i;
501
502	dst->key_values = 0;	562	key_values = 0;
503		563
504	for (i = key_values; i; i = i->next)	564	for (key_value *i = src.key_values; i; i = i->next)
505	{	565	{
506	key_value *new_link = new key_value;	566	key_value *new_link = new key_value;
507		567
508	new_link->next = 0;	568	new_link->next = 0;
509	new_link->key = i->key;	569	new_link->key = i->key;
510	new_link->value = i->value;	570	new_link->value = i->value;
511		571
512	/* Try and be clever here, too. */	572	/* Try and be clever here, too. */
513	if (!dst->key_values)	573	if (!key_values)
514	{	574	{
515	dst->key_values = new_link;	575	key_values = new_link;
516	tail = new_link;	576	tail = new_link;
517	}	577	}
518	else	578	else
519	{	579	{
520	tail->next = new_link;	580	tail->next = new_link;
521	tail = new_link;	581	tail = new_link;
522	}	582	}
523	}	583	}
524	}	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 ();
525		602
526	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 ();
527	}	623	}
528		624
529	object *	625	object *
530	object::clone ()	626	object::clone ()
531	{	627	{
…		…
589	* UP_OBJ_FACE: only the objects face has changed.	685	* UP_OBJ_FACE: only the objects face has changed.
590	*/	686	*/
591	void	687	void
592	update_object (object *op, int action)	688	update_object (object *op, int action)
593	{	689	{
594	MoveType move_on, move_off, move_block, move_slow;
595
596	if (op == NULL)	690	if (op == NULL)
597	{	691	{
598	/* this should never happen */	692	/* this should never happen */
599	LOG (llevDebug, "update_object() called for NULL object.\n");	693	LOG (llevDebug, "update_object() called for NULL object.\n");
600	return;	694	return;
…		…
660		754
661	if (op->more)	755	if (op->more)
662	update_object (op->more, action);	756	update_object (op->more, action);
663	}	757	}
664		758
665	object *object::first;
666
667	object::object ()	759	object::object ()
668	{	760	{
669	SET_FLAG (this, FLAG_REMOVED);	761	SET_FLAG (this, FLAG_REMOVED);
670		762
671	expmul = 1.0;	763	expmul = 1.0;
672	face = blank_face;	764	face = blank_face;
673	}	765	}
674		766
675	object::~object ()	767	object::~object ()
676	{	768	{
		769	unlink ();
		770
677	free_key_values (this);	771	free_key_values (this);
678	}	772	}
679		773
		774	static int object_count;
		775
680	void object::link ()	776	void object::link ()
681	{	777	{
		778	assert (!index);//D
		779	uuid = UUID::gen ();
682	count = ++ob_count;	780	count = ++object_count;
683	uuid = gen_uuid ();
684		781
685	prev = 0;	782	refcnt_inc ();
686	next = object::first;	783	objects.insert (this);
687
688	if (object::first)
689	object::first->prev = this;
690
691	object::first = this;
692	}	784	}
693		785
694	void object::unlink ()	786	void object::unlink ()
695	{	787	{
696	if (this == object::first)	788	if (!index)
697	object::first = next;	789	return;
698		790
699	/* Remove this object from the list of used objects */	791	objects.erase (this);
700	if (prev) prev->next = next;	792	refcnt_dec ();
701	if (next) next->prev = prev;
702
703	prev = 0;
704	next = 0;
705	}
706
707	bool
708	object::active () const
709	{
710	return active_next || active_prev || this == active_objects;
711	}	793	}
712		794
713	void	795	void
714	object::activate ()	796	object::activate ()
715	{	797	{
716	/* If already on active list, don't do anything */	798	/* If already on active list, don't do anything */
717	if (active ())	799	if (active)
718	return;	800	return;
719		801
720	if (has_active_speed ())	802	if (has_active_speed ())
721	{	803	actives.insert (this);
722	/* process_events() expects us to insert the object at the beginning
723	* of the list. */
724	active_next = active_objects;
725
726	if (active_next)
727	active_next->active_prev = this;
728
729	active_objects = this;
730	}
731	}	804	}
732		805
733	void	806	void
734	object::activate_recursive ()	807	object::activate_recursive ()
735	{	808	{
736	activate ();	809	activate ();
737		810
738	for (object *op = inv; op; op = op->above)	811	for (object *op = inv; op; op = op->below)
739	op->activate_recursive ();	812	op->activate_recursive ();
740	}	813	}
741		814
742	/* This function removes object 'op' from the list of active	815	/* This function removes object 'op' from the list of active
743	* objects.	816	* objects.
…		…
749	*/	822	*/
750	void	823	void
751	object::deactivate ()	824	object::deactivate ()
752	{	825	{
753	/* If not on the active list, nothing needs to be done */	826	/* If not on the active list, nothing needs to be done */
754	if (!active ())	827	if (!active)
755	return;	828	return;
756		829
757	if (active_prev == 0)	830	actives.erase (this);
758	{
759	active_objects = active_next;
760	if (active_next)
761	active_next->active_prev = 0;
762	}
763	else
764	{
765	active_prev->active_next = active_next;
766	if (active_next)
767	active_next->active_prev = active_prev;
768	}
769
770	active_next = 0;
771	active_prev = 0;
772	}	831	}
773		832
774	void	833	void
775	object::deactivate_recursive ()	834	object::deactivate_recursive ()
776	{	835	{
777	for (object *op = inv; op; op = op->above)	836	for (object *op = inv; op; op = op->below)
778	op->deactivate_recursive ();	837	op->deactivate_recursive ();
779		838
780	deactivate ();	839	deactivate ();
		840	}
		841
		842	void
		843	object::set_flag_inv (int flag, int value)
		844	{
		845	for (object *op = inv; op; op = op->below)
		846	{
		847	op->flag [flag] = value;
		848	op->set_flag_inv (flag, value);
		849	}
781	}	850	}
782		851
783	/*	852	/*
784	* Remove and free all objects in the inventory of the given object.	853	* Remove and free all objects in the inventory of the given object.
785	* object.c ?	854	* object.c ?
…		…
800	* drop on that space.	869	* drop on that space.
801	*/	870	*/
802	if (!drop_to_ground	871	if (!drop_to_ground
803	|| !map	872	|| !map
804	|| map->in_memory != MAP_IN_MEMORY	873	|| map->in_memory != MAP_IN_MEMORY
		874	|| map->nodrop
805	|| ms ().move_block == MOVE_ALL)	875	|| ms ().move_block == MOVE_ALL)
806	{	876	{
807	while (inv)	877	while (inv)
808	{	878	{
809	inv->destroy_inv (drop_to_ground);	879	inv->destroy_inv (drop_to_ground);
…		…
818		888
819	if (op->flag [FLAG_STARTEQUIP]	889	if (op->flag [FLAG_STARTEQUIP]
820	|| op->flag [FLAG_NO_DROP]	890	|| op->flag [FLAG_NO_DROP]
821	|| op->type == RUNE	891	|| op->type == RUNE
822	|| op->type == TRAP	892	|| op->type == TRAP
823	|| op->flag [FLAG_IS_A_TEMPLATE])	893	|| op->flag [FLAG_IS_A_TEMPLATE]
		894	|| op->flag [FLAG_DESTROY_ON_DEATH])
824	op->destroy ();	895	op->destroy ();
825	else	896	else
826	map->insert (op, x, y);	897	map->insert (op, x, y);
827	}	898	}
828	}	899	}
…		…
836	}	907	}
837		908
838	void	909	void
839	object::do_destroy ()	910	object::do_destroy ()
840	{	911	{
		912	attachable::do_destroy ();
		913
841	if (flag [FLAG_IS_LINKED])	914	if (flag [FLAG_IS_LINKED])
842	remove_button_link (this);	915	remove_button_link (this);
843		916
844	if (flag [FLAG_FRIENDLY])	917	if (flag [FLAG_FRIENDLY])
845	remove_friendly_object (this);	918	remove_friendly_object (this);
846		919
847	if (!flag [FLAG_REMOVED])	920	if (!flag [FLAG_REMOVED])
848	remove ();	921	remove ();
849		922
850	if (flag [FLAG_FREED])	923	destroy_inv (true);
851	return;
852		924
853	set_speed (0);	925	deactivate ();
		926	unlink ();
854		927
855	flag [FLAG_FREED] = 1;	928	flag [FLAG_FREED] = 1;
856
857	attachable::do_destroy ();
858
859	destroy_inv (true);
860	unlink ();
861		929
862	// hack to ensure that freed objects still have a valid map	930	// hack to ensure that freed objects still have a valid map
863	{	931	{
864	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
865		933
866	if (!freed_map)	934	if (!freed_map)
867	{	935	{
868	freed_map = new maptile;	936	freed_map = new maptile;
869		937
		938	freed_map->path = "<freed objects map>";
870	freed_map->name = "/internal/freed_objects_map";	939	freed_map->name = "/internal/freed_objects_map";
871	freed_map->width = 3;	940	freed_map->width = 3;
872	freed_map->height = 3;	941	freed_map->height = 3;
		942	freed_map->nodrop = 1;
873		943
874	freed_map->alloc ();	944	freed_map->alloc ();
875	freed_map->in_memory = MAP_IN_MEMORY;	945	freed_map->in_memory = MAP_IN_MEMORY;
876	}	946	}
877		947
878	map = freed_map;	948	map = freed_map;
879	x = 1;	949	x = 1;
880	y = 1;	950	y = 1;
881	}	951	}
882		952
883	head = 0;
884
885	if (more)	953	if (more)
886	{	954	{
887	more->destroy ();	955	more->destroy ();
888	more = 0;	956	more = 0;
889	}	957	}
890		958
		959	head = 0;
		960
891	// clear those pointers that likely might have circular references to us	961	// clear those pointers that likely might cause circular references
892	owner = 0;	962	owner = 0;
893	enemy = 0;	963	enemy = 0;
894	attacked_by = 0;	964	attacked_by = 0;
895		965	current_weapon = 0;
896	// only relevant for players(?), but make sure of it anyways
897	contr = 0;
898	}	966	}
899		967
900	void	968	void
901	object::destroy (bool destroy_inventory)	969	object::destroy (bool destroy_inventory)
902	{	970	{
903	if (destroyed ())	971	if (destroyed ())
904	return;	972	return;
905		973
906	if (destroy_inventory)	974	if (destroy_inventory)
907	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
908		982
909	attachable::destroy ();	983	attachable::destroy ();
910	}	984	}
911		985
912	/*	986	/*
…		…
930	* 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
931	* 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
932	* object will have no environment. If the object previously had an	1006	* object will have no environment. If the object previously had an
933	* environment, the x and y coordinates will be updated to	1007	* environment, the x and y coordinates will be updated to
934	* the previous environment.	1008	* the previous environment.
935	* Beware: This function is called from the editor as well!
936	*/	1009	*/
937	void	1010	void
938	object::remove ()	1011	object::do_remove ()
939	{	1012	{
940	object *tmp, *last = 0;	1013	object *tmp, *last = 0;
941	object *otmp;	1014	object *otmp;
942		1015
943	if (QUERY_FLAG (this, FLAG_REMOVED))	1016	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
986	}	1059	}
987	else if (map)	1060	else if (map)
988	{	1061	{
989	if (type == PLAYER)	1062	if (type == PLAYER)
990	{	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
991	--map->players;	1070	--map->players;
992	map->touch ();	1071	map->touch ();
993	}	1072	}
994		1073
995	map->dirty = true;	1074	map->dirty = true;
		1075	mapspace &ms = this->ms ();
996		1076
997	/* link the object above us */	1077	/* link the object above us */
998	if (above)	1078	if (above)
999	above->below = below;	1079	above->below = below;
1000	else	1080	else
1001	map->at (x, y).top = below; /* we were top, set new top */	1081	ms.top = below; /* we were top, set new top */
1002		1082
1003	/* Relink the object below us, if there is one */	1083	/* Relink the object below us, if there is one */
1004	if (below)	1084	if (below)
1005	below->above = above;	1085	below->above = above;
1006	else	1086	else
…		…
1008	/* 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
1009	* use translated coordinates in case some oddness with map tiling is	1089	* use translated coordinates in case some oddness with map tiling is
1010	* evident	1090	* evident
1011	*/	1091	*/
1012	if (GET_MAP_OB (map, x, y) != this)	1092	if (GET_MAP_OB (map, x, y) != this)
1013	{
1014	char *dump = dump_object (this);
1015	LOG (llevError,
1016	"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 ());
1017	free (dump);
1018	dump = dump_object (GET_MAP_OB (map, x, y));
1019	LOG (llevError, "%s\n", dump);
1020	free (dump);
1021	}
1022		1094
1023	map->at (x, y).bot = above; /* goes on above it. */	1095	ms.bot = above; /* goes on above it. */
1024	}	1096	}
1025		1097
1026	above = 0;	1098	above = 0;
1027	below = 0;	1099	below = 0;
1028		1100
1029	if (map->in_memory == MAP_SAVING)	1101	if (map->in_memory == MAP_SAVING)
1030	return;	1102	return;
1031		1103
1032	int check_walk_off = !flag [FLAG_NO_APPLY];	1104	int check_walk_off = !flag [FLAG_NO_APPLY];
1033		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
1034	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1118	for (tmp = ms.bot; tmp; tmp = tmp->above)
1035	{	1119	{
1036	/* 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
1037	* being removed.	1121	* being removed.
1038	*/	1122	*/
1039
1040	if (tmp->type == PLAYER && tmp != this)
1041	{
1042	/* If a container that the player is currently using somehow gets
1043	* removed (most likely destroyed), update the player view
1044	* appropriately.
1045	*/
1046	if (tmp->container == this)
1047	{
1048	flag [FLAG_APPLIED] = 0;
1049	tmp->container = 0;
1050	}
1051
1052	if (tmp->contr->ns)
1053	tmp->contr->ns->floorbox_update ();
1054	}
1055		1123
1056	/* See if object moving off should effect something */	1124	/* See if object moving off should effect something */
1057	if (check_walk_off	1125	if (check_walk_off
1058	&& ((move_type & tmp->move_off)	1126	&& ((move_type & tmp->move_off)
1059	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1127	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1062		1130
1063	if (destroyed ())	1131	if (destroyed ())
1064	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 ());
1065	}	1133	}
1066		1134
1067	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1068	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1069	if (tmp->above == tmp)
1070	tmp->above = 0;
1071
1072	last = tmp;	1135	last = tmp;
1073	}	1136	}
1074		1137
1075	/* last == NULL if there are no objects on this space */	1138	/* last == NULL if there are no objects on this space */
1076	//TODO: this makes little sense, why only update the topmost object?	1139	//TODO: this makes little sense, why only update the topmost object?
…		…
1096	merge_ob (object *op, object *top)	1159	merge_ob (object *op, object *top)
1097	{	1160	{
1098	if (!op->nrof)	1161	if (!op->nrof)
1099	return 0;	1162	return 0;
1100		1163
1101	if (top)	1164	if (!top)
1102	for (top = op; top && top->above; top = top->above)	1165	for (top = op; top && top->above; top = top->above)
1103	;	1166	;
1104		1167
1105	for (; top; top = top->below)	1168	for (; top; top = top->below)
1106	{	1169	{
…		…
1119	}	1182	}
1120		1183
1121	return 0;	1184	return 0;
1122	}	1185	}
1123		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
1124	/*	1210	/*
1125	* 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
1126	* job preparing multi-part monsters	1212	* job preparing multi-part monsters.
1127	*/	1213	*/
1128	object *	1214	object *
1129	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)
1130	{	1216	{
1131	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1217	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1132	{	1218	{
1133	tmp->x = x + tmp->arch->clone.x;	1219	tmp->x = x + tmp->arch->x;
1134	tmp->y = y + tmp->arch->clone.y;	1220	tmp->y = y + tmp->arch->y;
1135	}	1221	}
1136		1222
1137	return insert_ob_in_map (op, m, originator, flag);	1223	return insert_ob_in_map (op, m, originator, flag);
1138	}	1224	}
1139		1225
…		…
1158	* just 'op' otherwise	1244	* just 'op' otherwise
1159	*/	1245	*/
1160	object *	1246	object *
1161	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)
1162	{	1248	{
		1249	assert (!op->flag [FLAG_FREED]);
		1250
1163	object *tmp, *top, *floor = NULL;	1251	object *top, *floor = NULL;
1164	sint16 x, y;
1165		1252
1166	if (QUERY_FLAG (op, FLAG_FREED))	1253	op->remove ();
1167	{
1168	LOG (llevError, "Trying to insert freed object!\n");
1169	return NULL;
1170	}
1171
1172	if (!m)
1173	{
1174	char *dump = dump_object (op);
1175	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1176	free (dump);
1177	return op;
1178	}
1179
1180	if (out_of_map (m, op->x, op->y))
1181	{
1182	char *dump = dump_object (op);
1183	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1184	#ifdef MANY_CORES
1185	/* Better to catch this here, as otherwise the next use of this object
1186	* is likely to cause a crash. Better to find out where it is getting
1187	* improperly inserted.
1188	*/
1189	abort ();
1190	#endif
1191	free (dump);
1192	return op;
1193	}
1194
1195	if (!QUERY_FLAG (op, FLAG_REMOVED))
1196	{
1197	char *dump = dump_object (op);
1198	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1199	free (dump);
1200	return op;
1201	}
1202
1203	if (op->more)
1204	{
1205	/* The part may be on a different map. */
1206
1207	object *more = op->more;
1208
1209	/* We really need the caller to normalize coordinates - if
1210	* we set the map, that doesn't work if the location is within
1211	* a map and this is straddling an edge. So only if coordinate
1212	* is clear wrong do we normalize it.
1213	*/
1214	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1215	more->map = get_map_from_coord (m, &more->x, &more->y);
1216	else if (!more->map)
1217	{
1218	/* For backwards compatibility - when not dealing with tiled maps,
1219	* more->map should always point to the parent.
1220	*/
1221	more->map = m;
1222	}
1223
1224	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1225	{
1226	if (!op->head)
1227	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1228
1229	return 0;
1230	}
1231	}
1232
1233	CLEAR_FLAG (op, FLAG_REMOVED);
1234		1254
1235	/* Ideally, the caller figures this out. However, it complicates a lot	1255	/* Ideally, the caller figures this out. However, it complicates a lot
1236	* 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
1237	* need extra work	1257	* need extra work
1238	*/	1258	*/
1239	op->map = get_map_from_coord (m, &op->x, &op->y);	1259	if (!xy_normalise (m, op->x, op->y))
1240	x = op->x;	1260	{
1241	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 ();
1242		1273
1243	/* this has to be done after we translate the coordinates.	1274	/* this has to be done after we translate the coordinates.
1244	*/	1275	*/
1245	if (op->nrof && !(flag & INS_NO_MERGE))	1276	if (op->nrof && !(flag & INS_NO_MERGE))
1246	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1277	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1247	if (object::can_merge (op, tmp))	1278	if (object::can_merge (op, tmp))
1248	{	1279	{
1249	op->nrof += tmp->nrof;	1280	op->nrof += tmp->nrof;
1250	tmp->destroy ();	1281	tmp->destroy ();
1251	}	1282	}
…		…
1268	op->below = originator->below;	1299	op->below = originator->below;
1269		1300
1270	if (op->below)	1301	if (op->below)
1271	op->below->above = op;	1302	op->below->above = op;
1272	else	1303	else
1273	op->ms ().bot = op;	1304	ms.bot = op;
1274		1305
1275	/* since *below* originator, no need to update top */	1306	/* since *below* originator, no need to update top */
1276	originator->below = op;	1307	originator->below = op;
1277	}	1308	}
1278	else	1309	else
1279	{	1310	{
		1311	top = ms.bot;
		1312
1280	/* If there are other objects, then */	1313	/* If there are other objects, then */
1281	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1314	if (top)
1282	{	1315	{
1283	object *last = 0;	1316	object *last = 0;
1284		1317
1285	/*	1318	/*
1286	* 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.
…		…
1292	* 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
1293	* 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
1294	* 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
1295	* that flying non pickable objects are spell objects.	1328	* that flying non pickable objects are spell objects.
1296	*/	1329	*/
1297	while (top)	1330	for (top = ms.bot; top; top = top->above)
1298	{	1331	{
1299	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))
1300	floor = top;	1333	floor = top;
1301		1334
1302	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))
…		…
1305	top = top->below;	1338	top = top->below;
1306	break;	1339	break;
1307	}	1340	}
1308		1341
1309	last = top;	1342	last = top;
1310	top = top->above;
1311	}	1343	}
1312		1344
1313	/* 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 */
1314	top = last;	1346	top = last;
1315		1347
…		…
1317	* looks like instead of lots of conditions here.	1349	* looks like instead of lots of conditions here.
1318	* makes things faster, and effectively the same result.	1350	* makes things faster, and effectively the same result.
1319	*/	1351	*/
1320		1352
1321	/* Have object 'fall below' other objects that block view.	1353	/* Have object 'fall below' other objects that block view.
1322	* Unless those objects are exits, type 66	1354	* Unless those objects are exits.
1323	* If INS_ON_TOP is used, don't do this processing	1355	* If INS_ON_TOP is used, don't do this processing
1324	* Need to find the object that in fact blocks view, otherwise	1356	* Need to find the object that in fact blocks view, otherwise
1325	* stacking is a bit odd.	1357	* stacking is a bit odd.
1326	*/	1358	*/
1327	if (!(flag & INS_ON_TOP) &&	1359	if (!(flag & INS_ON_TOP)
1328	(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))
1329	{	1362	{
1330	for (last = top; last != floor; last = last->below)	1363	for (last = top; last != floor; last = last->below)
1331	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1364	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1332	break;	1365	break;
		1366
1333	/* Check to see if we found the object that blocks view,	1367	/* Check to see if we found the object that blocks view,
1334	* 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
1335	* we can get inserted below this one, which requires we	1369	* we can get inserted below this one, which requires we
1336	* set top to the object below us.	1370	* set top to the object below us.
1337	*/	1371	*/
1338	if (last && last->below && last != floor)	1372	if (last && last->below && last != floor)
1339	top = last->below;	1373	top = last->below;
1340	}	1374	}
1341	} /* If objects on this space */	1375	} /* If objects on this space */
1342		1376
1343	if (flag & INS_MAP_LOAD)
1344	top = GET_MAP_TOP (op->map, op->x, op->y);
1345
1346	if (flag & INS_ABOVE_FLOOR_ONLY)	1377	if (flag & INS_ABOVE_FLOOR_ONLY)
1347	top = floor;	1378	top = floor;
1348		1379
1349	/* 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.
1350	*/	1381	*/
1351		1382
1352	/* First object on this space */	1383	/* First object on this space */
1353	if (!top)	1384	if (!top)
1354	{	1385	{
1355	op->above = GET_MAP_OB (op->map, op->x, op->y);	1386	op->above = ms.bot;
1356		1387
1357	if (op->above)	1388	if (op->above)
1358	op->above->below = op;	1389	op->above->below = op;
1359		1390
1360	op->below = 0;	1391	op->below = 0;
1361	op->ms ().bot = op;	1392	ms.bot = op;
1362	}	1393	}
1363	else	1394	else
1364	{ /* get inserted into the stack above top */	1395	{ /* get inserted into the stack above top */
1365	op->above = top->above;	1396	op->above = top->above;
1366		1397
…		…
1370	op->below = top;	1401	op->below = top;
1371	top->above = op;	1402	top->above = op;
1372	}	1403	}
1373		1404
1374	if (!op->above)	1405	if (!op->above)
1375	op->ms ().top = op;	1406	ms.top = op;
1376	} /* else not INS_BELOW_ORIGINATOR */	1407	} /* else not INS_BELOW_ORIGINATOR */
1377		1408
1378	if (op->type == PLAYER)	1409	if (op->type == PLAYER)
1379	{	1410	{
1380	op->contr->do_los = 1;	1411	op->contr->do_los = 1;
…		…
1382	op->map->touch ();	1413	op->map->touch ();
1383	}	1414	}
1384		1415
1385	op->map->dirty = true;	1416	op->map->dirty = true;
1386		1417
1387	/* If we have a floor, we know the player, if any, will be above
1388	* it, so save a few ticks and start from there.
1389	*/
1390	if (!(flag & INS_MAP_LOAD))
1391	if (object *pl = op->ms ().player ())	1418	if (object *pl = ms.player ())
1392	if (pl->contr->ns)
1393	pl->contr->ns->floorbox_update ();	1419	pl->contr->ns->floorbox_update ();
1394		1420
1395	/* If this object glows, it may affect lighting conditions that are	1421	/* If this object glows, it may affect lighting conditions that are
1396	* 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
1397	* 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
1398	* on the map will get recalculated. The players could very well	1424	* on the map will get recalculated. The players could very well
…		…
1417	* blocked() and wall() work properly), and these flags are updated by	1443	* blocked() and wall() work properly), and these flags are updated by
1418	* update_object().	1444	* update_object().
1419	*/	1445	*/
1420		1446
1421	/* 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 */
1422	if (!(flag & INS_NO_WALK_ON) && !op->head)	1448	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1423	{	1449	{
1424	if (check_move_on (op, originator))	1450	if (check_move_on (op, originator))
1425	return 0;	1451	return 0;
1426		1452
1427	/* 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
1428	* walk on's.	1454	* walk on's.
1429	*/	1455	*/
1430	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1456	for (object *tmp = op->more; tmp; tmp = tmp->more)
1431	if (check_move_on (tmp, originator))	1457	if (check_move_on (tmp, originator))
1432	return 0;	1458	return 0;
1433	}	1459	}
1434		1460
1435	return op;	1461	return op;
…		…
1444	{	1470	{
1445	object *tmp, *tmp1;	1471	object *tmp, *tmp1;
1446		1472
1447	/* first search for itself and remove any old instances */	1473	/* first search for itself and remove any old instances */
1448		1474
1449	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1475	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1450	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1476	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1451	tmp->destroy ();	1477	tmp->destroy ();
1452		1478
1453	tmp1 = arch_to_object (archetype::find (arch_string));	1479	tmp1 = arch_to_object (archetype::find (arch_string));
1454		1480
1455	tmp1->x = op->x;	1481	tmp1->x = op->x;
…		…
1458	}	1484	}
1459		1485
1460	object *	1486	object *
1461	object::insert_at (object *where, object *originator, int flags)	1487	object::insert_at (object *where, object *originator, int flags)
1462	{	1488	{
1463	where->map->insert (this, where->x, where->y, originator, flags);	1489	return where->map->insert (this, where->x, where->y, originator, flags);
1464	}	1490	}
1465		1491
1466	/*	1492	/*
1467	* 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
1468	* is returned contains nr objects, and the remaining parts contains	1494	* is returned contains nr objects, and the remaining parts contains
…		…
1508	* 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
1509	* is subsequently removed and freed.	1535	* is subsequently removed and freed.
1510	*	1536	*
1511	* 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
1512	*/	1538	*/
1513
1514	object *	1539	object *
1515	decrease_ob_nr (object *op, uint32 i)	1540	decrease_ob_nr (object *op, uint32 i)
1516	{	1541	{
1517	object *tmp;	1542	object *tmp;
1518		1543
…		…
1593		1618
1594	/*	1619	/*
1595	* add_weight(object, weight) adds the specified weight to an object,	1620	* add_weight(object, weight) adds the specified weight to an object,
1596	* and also updates how much the environment(s) is/are carrying.	1621	* and also updates how much the environment(s) is/are carrying.
1597	*/	1622	*/
1598
1599	void	1623	void
1600	add_weight (object *op, signed long weight)	1624	add_weight (object *op, signed long weight)
1601	{	1625	{
1602	while (op != NULL)	1626	while (op != NULL)
1603	{	1627	{
…		…
1618	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);
1619	free (dump);	1643	free (dump);
1620	return op;	1644	return op;
1621	}	1645	}
1622		1646
1623	if (where->head)	1647	if (where->head_ () != where)
1624	{	1648	{
1625	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");
1626	where = where->head;	1650	where = where->head;
1627	}	1651	}
1628		1652
1629	return where->insert (op);	1653	return where->insert (op);
1630	}	1654	}
…		…
1635	* inside the object environment.	1659	* inside the object environment.
1636	*	1660	*
1637	* 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
1638	* be != op, if items are merged. -Tero	1662	* be != op, if items are merged. -Tero
1639	*/	1663	*/
1640
1641	object *	1664	object *
1642	object::insert (object *op)	1665	object::insert (object *op)
1643	{	1666	{
1644	object *tmp, *otmp;
1645
1646	if (!QUERY_FLAG (op, FLAG_REMOVED))	1667	if (!QUERY_FLAG (op, FLAG_REMOVED))
1647	op->remove ();	1668	op->remove ();
1648		1669
1649	if (op->more)	1670	if (op->more)
1650	{	1671	{
…		…
1652	return op;	1673	return op;
1653	}	1674	}
1654		1675
1655	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1676	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1656	CLEAR_FLAG (op, FLAG_REMOVED);	1677	CLEAR_FLAG (op, FLAG_REMOVED);
		1678
1657	if (op->nrof)	1679	if (op->nrof)
1658	{	1680	{
1659	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1681	for (object *tmp = inv; tmp; tmp = tmp->below)
1660	if (object::can_merge (tmp, op))	1682	if (object::can_merge (tmp, op))
1661	{	1683	{
1662	/* return the original object and remove inserted object	1684	/* return the original object and remove inserted object
1663	(client needs the original object) */	1685	(client needs the original object) */
1664	tmp->nrof += op->nrof;	1686	tmp->nrof += op->nrof;
…		…
1683	add_weight (this, op->weight * op->nrof);	1705	add_weight (this, op->weight * op->nrof);
1684	}	1706	}
1685	else	1707	else
1686	add_weight (this, (op->weight + op->carrying));	1708	add_weight (this, (op->weight + op->carrying));
1687		1709
1688	otmp = this->in_player ();	1710	if (object *otmp = this->in_player ())
1689	if (otmp && otmp->contr)
1690	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1711	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1691	otmp->update_stats ();	1712	otmp->update_stats ();
1692		1713
		1714	op->owner = 0; // its his/hers now. period.
1693	op->map = 0;	1715	op->map = 0;
1694	op->env = this;	1716	op->env = this;
1695	op->above = 0;	1717	op->above = 0;
1696	op->below = 0;	1718	op->below = 0;
1697	op->x = 0, op->y = 0;	1719	op->x = op->y = 0;
1698		1720
1699	/* 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 */
1700	if ((op->glow_radius != 0) && map)	1722	if (op->glow_radius && map)
1701	{	1723	{
1702	#ifdef DEBUG_LIGHTS	1724	#ifdef DEBUG_LIGHTS
1703	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);
1704	#endif /* DEBUG_LIGHTS */	1726	#endif /* DEBUG_LIGHTS */
1705	if (map->darkness)	1727	if (map->darkness)
…		…
1777		1799
1778	/* The objects have to be checked from top to bottom.	1800	/* The objects have to be checked from top to bottom.
1779	* Hence, we first go to the top:	1801	* Hence, we first go to the top:
1780	*/	1802	*/
1781		1803
1782	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above)	1804	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1783	{	1805	{
1784	/* Trim the search when we find the first other spell effect	1806	/* Trim the search when we find the first other spell effect
1785	* this helps performance so that if a space has 50 spell objects,	1807	* this helps performance so that if a space has 50 spell objects,
1786	* we don't need to check all of them.	1808	* we don't need to check all of them.
1787	*/	1809	*/
…		…
1805	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1827	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1806	((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))
1807	{	1829	{
1808		1830
1809	float	1831	float
1810	diff = tmp->move_slow_penalty * FABS (op->speed);	1832	diff = tmp->move_slow_penalty * fabs (op->speed);
1811		1833
1812	if (op->type == PLAYER)	1834	if (op->type == PLAYER)
1813	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)) ||
1814	(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)))
1815	diff /= 4.0;	1837	diff /= 4.0;
…		…
1845	* The first matching object is returned, or NULL if none.	1867	* The first matching object is returned, or NULL if none.
1846	*/	1868	*/
1847	object *	1869	object *
1848	present_arch (const archetype *at, maptile *m, int x, int y)	1870	present_arch (const archetype *at, maptile *m, int x, int y)
1849	{	1871	{
1850	if (m == NULL || out_of_map (m, x, y))	1872	if (!m || out_of_map (m, x, y))
1851	{	1873	{
1852	LOG (llevError, "Present_arch called outside map.\n");	1874	LOG (llevError, "Present_arch called outside map.\n");
1853	return NULL;	1875	return NULL;
1854	}	1876	}
1855		1877
1856	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1878	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1857	if (tmp->arch == at)	1879	if (tmp->arch == at)
1858	return tmp;	1880	return tmp;
1859		1881
1860	return NULL;	1882	return NULL;
1861	}	1883	}
…		…
1872	{	1894	{
1873	LOG (llevError, "Present called outside map.\n");	1895	LOG (llevError, "Present called outside map.\n");
1874	return NULL;	1896	return NULL;
1875	}	1897	}
1876		1898
1877	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1899	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1878	if (tmp->type == type)	1900	if (tmp->type == type)
1879	return tmp;	1901	return tmp;
1880		1902
1881	return NULL;	1903	return NULL;
1882	}	1904	}
…		…
1939	* activate recursively a flag on an object inventory	1961	* activate recursively a flag on an object inventory
1940	*/	1962	*/
1941	void	1963	void
1942	flag_inv (object *op, int flag)	1964	flag_inv (object *op, int flag)
1943	{	1965	{
1944	if (op->inv)
1945	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1966	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1946	{	1967	{
1947	SET_FLAG (tmp, flag);	1968	SET_FLAG (tmp, flag);
1948	flag_inv (tmp, flag);	1969	flag_inv (tmp, flag);
1949	}	1970	}
1950	}	1971	}
1951		1972
1952	/*	1973	/*
1953	* deactivate recursively a flag on an object inventory	1974	* deactivate recursively a flag on an object inventory
1954	*/	1975	*/
1955	void	1976	void
1956	unflag_inv (object *op, int flag)	1977	unflag_inv (object *op, int flag)
1957	{	1978	{
1958	if (op->inv)
1959	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1979	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1960	{	1980	{
1961	CLEAR_FLAG (tmp, flag);	1981	CLEAR_FLAG (tmp, flag);
1962	unflag_inv (tmp, flag);	1982	unflag_inv (tmp, flag);
1963	}	1983	}
1964	}
1965
1966	/*
1967	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1968	* all it's inventory (recursively).
1969	* If checksums are used, a player will get set_cheat called for
1970	* him/her-self and all object carried by a call to this function.
1971	*/
1972	void
1973	set_cheat (object *op)
1974	{
1975	SET_FLAG (op, FLAG_WAS_WIZ);
1976	flag_inv (op, FLAG_WAS_WIZ);
1977	}	1984	}
1978		1985
1979	/*	1986	/*
1980	* 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
1981	* 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
…		…
1983	* to search (see the freearr_x/y[] definition).	1990	* to search (see the freearr_x/y[] definition).
1984	* It returns a random choice among the alternatives found.	1991	* It returns a random choice among the alternatives found.
1985	* 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
1986	* does all 4 immediate directions). This returns the index into the	1993	* does all 4 immediate directions). This returns the index into the
1987	* 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)
1988	* Note - this only checks to see if there is space for the head of the
1989	* object - if it is a multispace object, this should be called for all
1990	* pieces.
1991	* Note2: This function does correctly handle tiled maps, but does not	1995	* Note: This function does correctly handle tiled maps, but does not
1992	* inform the caller. However, insert_ob_in_map will update as	1996	* inform the caller. However, insert_ob_in_map will update as
1993	* 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.
1994	* 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
1995	* 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
1996	* 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
…		…
1998	* customized, changed states, etc.	2002	* customized, changed states, etc.
1999	*/	2003	*/
2000	int	2004	int
2001	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)
2002	{	2006	{
		2007	int altern[SIZEOFFREE];
2003	int index = 0, flag;	2008	int index = 0, flag;
2004	int altern[SIZEOFFREE];
2005		2009
2006	for (int i = start; i < stop; i++)	2010	for (int i = start; i < stop; i++)
2007	{	2011	{
2008	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2012	mapxy pos (m, x, y); pos.move (i);
2009	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	{
2010	altern [index++] = i;	2028	altern [index++] = i;
		2029	continue;
		2030	}
2011		2031
2012	/* 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.
2013	* 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.
2014	* 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 -
2015	* 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
2016	* 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
2017	* to only the spaces immediately surrounding the target area, and	2037	* to only the spaces immediately surrounding the target area, and
2018	* won't look 2 spaces south of the target space.	2038	* won't look 2 spaces south of the target space.
2019	*/	2039	*/
2020	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2040	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2041	{
2021	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;
2022	}	2056	}
2023		2057
2024	if (!index)	2058	if (!index)
2025	return -1;	2059	return -1;
2026		2060
2027	return altern[RANDOM () % index];	2061	return altern [rndm (index)];
2028	}	2062	}
2029		2063
2030	/*	2064	/*
2031	* find_first_free_spot(archetype, maptile, x, y) works like	2065	* find_first_free_spot(archetype, maptile, x, y) works like
2032	* find_free_spot(), but it will search max number of squares.	2066	* find_free_spot(), but it will search max number of squares.
…		…
2035	*/	2069	*/
2036	int	2070	int
2037	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)
2038	{	2072	{
2039	for (int i = 0; i < SIZEOFFREE; i++)	2073	for (int i = 0; i < SIZEOFFREE; i++)
2040	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]))
2041	return i;	2075	return i;
2042		2076
2043	return -1;	2077	return -1;
2044	}	2078	}
2045		2079
…		…
2053	{	2087	{
2054	arr += begin;	2088	arr += begin;
2055	end -= begin;	2089	end -= begin;
2056		2090
2057	while (--end)	2091	while (--end)
2058	swap (arr [end], arr [RANDOM () % (end + 1)]);	2092	swap (arr [end], arr [rndm (end + 1)]);
2059	}	2093	}
2060		2094
2061	/* new function to make monster searching more efficient, and effective!	2095	/* new function to make monster searching more efficient, and effective!
2062	* This basically returns a randomized array (in the passed pointer) of	2096	* This basically returns a randomized array (in the passed pointer) of
2063	* 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
…		…
2099	object *tmp;	2133	object *tmp;
2100	maptile *mp;	2134	maptile *mp;
2101		2135
2102	MoveType blocked, move_type;	2136	MoveType blocked, move_type;
2103		2137
2104	if (exclude && exclude->head)	2138	if (exclude && exclude->head_ () != exclude)
2105	{	2139	{
2106	exclude = exclude->head;	2140	exclude = exclude->head;
2107	move_type = exclude->move_type;	2141	move_type = exclude->move_type;
2108	}	2142	}
2109	else	2143	else
…		…
2132	max = maxfree[i];	2166	max = maxfree[i];
2133	else if (mflags & P_IS_ALIVE)	2167	else if (mflags & P_IS_ALIVE)
2134	{	2168	{
2135	for (tmp = ms.bot; tmp; tmp = tmp->above)	2169	for (tmp = ms.bot; tmp; tmp = tmp->above)
2136	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2170	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2137	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2171	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2138	break;	2172	break;
2139		2173
2140	if (tmp)	2174	if (tmp)
2141	return freedir[i];	2175	return freedir[i];
2142	}	2176	}
…		…
2197		2231
2198	return 3;	2232	return 3;
2199	}	2233	}
2200		2234
2201	/*	2235	/*
2202	* absdir(int): Returns a number between 1 and 8, which represent
2203	* the "absolute" direction of a number (it actually takes care of
2204	* "overflow" in previous calculations of a direction).
2205	*/
2206
2207	int
2208	absdir (int d)
2209	{
2210	while (d < 1)
2211	d += 8;
2212
2213	while (d > 8)
2214	d -= 8;
2215
2216	return d;
2217	}
2218
2219	/*
2220	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2236	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2221	* between two directions (which are expected to be absolute (see absdir())	2237	* between two directions (which are expected to be absolute (see absdir())
2222	*/	2238	*/
2223
2224	int	2239	int
2225	dirdiff (int dir1, int dir2)	2240	dirdiff (int dir1, int dir2)
2226	{	2241	{
2227	int d;	2242	int d;
2228		2243
…		…
2341	* 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
2342	* core dumps if they do.	2357	* core dumps if they do.
2343	*	2358	*
2344	* 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)
2345	*/	2360	*/
2346
2347	int	2361	int
2348	can_pick (const object *who, const object *item)	2362	can_pick (const object *who, const object *item)
2349	{	2363	{
2350	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2364	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2351	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2365	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2356	* create clone from object to another	2370	* create clone from object to another
2357	*/	2371	*/
2358	object *	2372	object *
2359	object_create_clone (object *asrc)	2373	object_create_clone (object *asrc)
2360	{	2374	{
2361	object *dst = 0, *tmp, *src, *part, *prev, *item;	2375	object *dst = 0, *tmp, *src, *prev, *item;
2362		2376
2363	if (!asrc)	2377	if (!asrc)
2364	return 0;	2378	return 0;
2365		2379
2366	src = asrc;
2367	if (src->head)
2368	src = src->head;	2380	src = asrc->head_ ();
2369		2381
2370	prev = 0;	2382	prev = 0;
2371	for (part = src; part; part = part->more)	2383	for (object *part = src; part; part = part->more)
2372	{	2384	{
2373	tmp = part->clone ();	2385	tmp = part->clone ();
2374	tmp->x -= src->x;	2386	tmp->x -= src->x;
2375	tmp->y -= src->y;	2387	tmp->y -= src->y;
2376		2388
…		…
2392		2404
2393	for (item = src->inv; item; item = item->below)	2405	for (item = src->inv; item; item = item->below)
2394	insert_ob_in_ob (object_create_clone (item), dst);	2406	insert_ob_in_ob (object_create_clone (item), dst);
2395		2407
2396	return dst;	2408	return dst;
2397	}
2398
2399	/* GROS - Creates an object using a string representing its content. */
2400	/* Basically, we save the content of the string to a temp file, then call */
2401	/* load_object on it. I admit it is a highly inefficient way to make things, */
2402	/* but it was simple to make and allows reusing the load_object function. */
2403	/* Remember not to use load_object_str in a time-critical situation. */
2404	/* Also remember that multiparts objects are not supported for now. */
2405	object *
2406	load_object_str (const char *obstr)
2407	{
2408	object *op;
2409	char filename[MAX_BUF];
2410
2411	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2412
2413	FILE *tempfile = fopen (filename, "w");
2414
2415	if (tempfile == NULL)
2416	{
2417	LOG (llevError, "Error - Unable to access load object temp file\n");
2418	return NULL;
2419	}
2420
2421	fprintf (tempfile, obstr);
2422	fclose (tempfile);
2423
2424	op = object::create ();
2425
2426	object_thawer thawer (filename);
2427
2428	if (thawer)
2429	load_object (thawer, op, 0);
2430
2431	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2432	CLEAR_FLAG (op, FLAG_REMOVED);
2433
2434	return op;
2435	}	2409	}
2436		2410
2437	/* This returns the first object in who's inventory that	2411	/* This returns the first object in who's inventory that
2438	* has the same type and subtype match.	2412	* has the same type and subtype match.
2439	* returns NULL if no match.	2413	* returns NULL if no match.
…		…
2494	if (link->key == canonical_key)	2468	if (link->key == canonical_key)
2495	return link->value;	2469	return link->value;
2496		2470
2497	return 0;	2471	return 0;
2498	}	2472	}
2499
2500		2473
2501	/*	2474	/*
2502	* Updates the canonical_key in op to value.	2475	* Updates the canonical_key in op to value.
2503	*	2476	*
2504	* 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).
…		…
2528	/* Basically, if the archetype has this key set,	2501	/* Basically, if the archetype has this key set,
2529	* we need to store the null value so when we save	2502	* we need to store the null value so when we save
2530	* it, we save the empty value so that when we load,	2503	* it, we save the empty value so that when we load,
2531	* we get this value back again.	2504	* we get this value back again.
2532	*/	2505	*/
2533	if (get_ob_key_link (&op->arch->clone, canonical_key))	2506	if (get_ob_key_link (op->arch, canonical_key))
2534	field->value = 0;	2507	field->value = 0;
2535	else	2508	else
2536	{	2509	{
2537	if (last)	2510	if (last)
2538	last->next = field->next;	2511	last->next = field->next;
…		…
2607	}	2580	}
2608	else	2581	else
2609	item = item->env;	2582	item = item->env;
2610	}	2583	}
2611		2584
2612
2613	const char *	2585	const char *
2614	object::flag_desc (char *desc, int len) const	2586	object::flag_desc (char *desc, int len) const
2615	{	2587	{
2616	char *p = desc;	2588	char *p = desc;
2617	bool first = true;	2589	bool first = true;
…		…
2644	{	2616	{
2645	char flagdesc[512];	2617	char flagdesc[512];
2646	char info2[256 * 4];	2618	char info2[256 * 4];
2647	char *p = info;	2619	char *p = info;
2648		2620
2649	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}",
2650	count, uuid.seq,	2622	count,
		2623	uuid.c_str (),
2651	&name,	2624	&name,
2652	title ? "\",title:" : "",	2625	title ? "\",title:\"" : "",
2653	title ? (const char *)title : "",	2626	title ? (const char *)title : "",
2654	flag_desc (flagdesc, 512), type);	2627	flag_desc (flagdesc, 512), type);
2655		2628
2656	if (env)	2629	if (!this->flag[FLAG_REMOVED] && env)
2657	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2630	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2658		2631
2659	if (map)	2632	if (map)
2660	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);
2661		2634
…		…
2663	}	2636	}
2664		2637
2665	const char *	2638	const char *
2666	object::debug_desc () const	2639	object::debug_desc () const
2667	{	2640	{
2668	static char info[256 * 4];	2641	static char info[3][256 * 4];
		2642	static int info_idx;
		2643
2669	return debug_desc (info);	2644	return debug_desc (info [++info_idx % 3]);
2670	}	2645	}
2671		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