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.98 by root, Sun Dec 31 17:17:22 2006 UTC vs.
Revision 1.199 by root, Thu Nov 8 19:43:23 2007 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	int nrofallocobjects = 0;
38	static UUID uuid;	39	static UUID uuid;
39	const uint64 UUID_SKIP = 1<<19;	40	const uint64 UUID_SKIP = 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] = { 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,
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	46	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	};	47	};
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,	48	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,
…		…
252	/* This is really a spellbook check - really, we should	254	/* This is really a spellbook check - really, we should
253	* check all objects in the inventory.	255	* check all objects in the inventory.
254	*/	256	*/
255	if (ob1->inv || ob2->inv)	257	if (ob1->inv || ob2->inv)
256	{	258	{
257	/* if one object has inventory but the other doesn't, not equiv */	259	if (!(ob1->inv && ob2->inv))
258	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	260	return 0; /* inventories differ in length */
259	return 0;
260		261
261	/* Now check to see if the two inventory objects could merge */	262	if (ob1->inv->below || ob2->inv->below)
		263	return 0; /* more than one object in inv */
		264
262	if (!object::can_merge (ob1->inv, ob2->inv))	265	if (!object::can_merge (ob1->inv, ob2->inv))
263	return 0;	266	return 0; /* inventory objexts differ */
264		267
265	/* inventory ok - still need to check rest of this object to see	268	/* inventory ok - still need to check rest of this object to see
266	* if it is valid.	269	* if it is valid.
267	*/	270	*/
268	}	271	}
…		…
297	return 0;	300	return 0;
298	else if (!compare_ob_value_lists (ob1, ob2))	301	else if (!compare_ob_value_lists (ob1, ob2))
299	return 0;	302	return 0;
300	}	303	}
301		304
302	//TODO: generate an event or call into perl for additional checks
303	if (ob1->self || ob2->self)	305	if (ob1->self || ob2->self)
304	{	306	{
305	ob1->optimise ();	307	ob1->optimise ();
306	ob2->optimise ();	308	ob2->optimise ();
307		309
308	if (ob1->self || ob2->self)	310	if (ob1->self || ob2->self)
		311	{
		312	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		313	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		314
		315	if (k1 != k2)
309	return 0;	316	return 0;
		317	else if (k1 == 0)
		318	return 1;
		319	else if (!cfperl_can_merge (ob1, ob2))
		320	return 0;
		321	}
310	}	322	}
311		323
312	/* Everything passes, must be OK. */	324	/* Everything passes, must be OK. */
313	return 1;	325	return 1;
314	}	326	}
…		…
322	sum_weight (object *op)	334	sum_weight (object *op)
323	{	335	{
324	long sum;	336	long sum;
325	object *inv;	337	object *inv;
326		338
327	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	339	for (sum = 0, inv = op->inv; inv; inv = inv->below)
328	{	340	{
329	if (inv->inv)	341	if (inv->inv)
330	sum_weight (inv);	342	sum_weight (inv);
		343
331	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	344	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
332	}	345	}
333		346
334	if (op->type == CONTAINER && op->stats.Str)	347	if (op->type == CONTAINER && op->stats.Str)
335	sum = (sum * (100 - op->stats.Str)) / 100;	348	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
355	/*	368	/*
356	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	369	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
357	* Some error messages.	370	* Some error messages.
358	* The result of the dump is stored in the static global errmsg array.	371	* The result of the dump is stored in the static global errmsg array.
359	*/	372	*/
360
361	char *	373	char *
362	dump_object (object *op)	374	dump_object (object *op)
363	{	375	{
364	if (!op)	376	if (!op)
365	return strdup ("[NULLOBJ]");	377	return strdup ("[NULLOBJ]");
366		378
367	object_freezer freezer;	379	object_freezer freezer;
368	save_object (freezer, op, 1);	380	op->write (freezer);
369	return freezer.as_string ();	381	return freezer.as_string ();
370	}	382	}
371		383
372	/*	384	/*
373	* get_nearest_part(multi-object, object 2) returns the part of the	385	* get_nearest_part(multi-object, object 2) returns the part of the
374	* multi-object 1 which is closest to the second object.	386	* multi-object 1 which is closest to the second object.
375	* If it's not a multi-object, it is returned.	387	* If it's not a multi-object, it is returned.
376	*/	388	*/
377
378	object *	389	object *
379	get_nearest_part (object *op, const object *pl)	390	get_nearest_part (object *op, const object *pl)
380	{	391	{
381	object *tmp, *closest;	392	object *tmp, *closest;
382	int last_dist, i;	393	int last_dist, i;
…		…
390	}	401	}
391		402
392	/*	403	/*
393	* Returns the object which has the count-variable equal to the argument.	404	* Returns the object which has the count-variable equal to the argument.
394	*/	405	*/
395
396	object *	406	object *
397	find_object (tag_t i)	407	find_object (tag_t i)
398	{	408	{
399	for (object *op = object::first; op; op = op->next)	409	for_all_objects (op)
400	if (op->count == i)	410	if (op->count == i)
401	return op;	411	return op;
402		412
403	return 0;	413	return 0;
404	}	414	}
405		415
406	/*	416	/*
407	* Returns the first object which has a name equal to the argument.	417	* Returns the first object which has a name equal to the argument.
408	* Used only by the patch command, but not all that useful.	418	* Used only by the patch command, but not all that useful.
409	* Enables features like "patch <name-of-other-player> food 999"	419	* Enables features like "patch <name-of-other-player> food 999"
410	*/	420	*/
411
412	object *	421	object *
413	find_object_name (const char *str)	422	find_object_name (const char *str)
414	{	423	{
415	shstr_cmp str_ (str);	424	shstr_cmp str_ (str);
416	object *op;	425	object *op;
417		426
418	for (op = object::first; op != NULL; op = op->next)	427	for_all_objects (op)
419	if (op->name == str_)	428	if (op->name == str_)
420	break;	429	break;
421		430
422	return op;	431	return op;
423	}	432	}
…		…
429	}	438	}
430		439
431	/*	440	/*
432	* Sets the owner and sets the skill and exp pointers to owner's current	441	* Sets the owner and sets the skill and exp pointers to owner's current
433	* skill and experience objects.	442	* skill and experience objects.
		443	* ACTUALLY NO! investigate! TODO
434	*/	444	*/
435	void	445	void
436	object::set_owner (object *owner)	446	object::set_owner (object *owner)
437	{	447	{
		448	// allow objects which own objects
438	if (!owner)	449	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)	450	while (owner->owner)
449	owner = owner->owner;	451	owner = owner->owner;
		452
		453	if (flag [FLAG_FREED])
		454	{
		455	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		456	return;
		457	}
450		458
451	this->owner = owner;	459	this->owner = owner;
		460	}
		461
		462	int
		463	object::slottype () const
		464	{
		465	if (type == SKILL)
		466	{
		467	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		468	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		469	}
		470	else
		471	{
		472	if (slot [body_combat].info) return slot_combat;
		473	if (slot [body_range ].info) return slot_ranged;
		474	}
		475
		476	return slot_none;
		477	}
		478
		479	bool
		480	object::change_weapon (object *ob)
		481	{
		482	if (current_weapon == ob)
		483	return true;
		484
		485	if (chosen_skill)
		486	chosen_skill->flag [FLAG_APPLIED] = false;
		487
		488	current_weapon = ob;
		489	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		490
		491	if (chosen_skill)
		492	chosen_skill->flag [FLAG_APPLIED] = true;
		493
		494	update_stats ();
		495
		496	if (ob)
		497	{
		498	// now check wether any body locations became invalid, in which case
		499	// we cannot apply the weapon at the moment.
		500	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		501	if (slot[i].used < 0)
		502	{
		503	current_weapon = chosen_skill = 0;
		504	update_stats ();
		505
		506	new_draw_info_format (NDI_UNIQUE, 0, this,
		507	"You try to balance all your items at once, "
		508	"but the %s is just too much for your body. "
		509	"[You need to unapply some items first.]", &ob->name);
		510	return false;
		511	}
		512
		513	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		514	}
		515	else
		516	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		517
		518	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		519	{
		520	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		521	&name, ob->debug_desc ());
		522	return false;
		523	}
		524
		525	return true;
452	}	526	}
453		527
454	/* Zero the key_values on op, decrementing the shared-string	528	/* Zero the key_values on op, decrementing the shared-string
455	* refcounts and freeing the links.	529	* refcounts and freeing the links.
456	*/	530	*/
457	static void	531	static void
458	free_key_values (object *op)	532	free_key_values (object *op)
459	{	533	{
460	for (key_value *i = op->key_values; i != 0;)	534	for (key_value *i = op->key_values; i; )
461	{	535	{
462	key_value *next = i->next;	536	key_value *next = i->next;
463	delete i;	537	delete i;
464		538
465	i = next;	539	i = next;
466	}	540	}
467		541
468	op->key_values = 0;	542	op->key_values = 0;
469	}	543	}
470		544
471	/*	545	object &
472	* copy_to first frees everything allocated by the dst object,	546	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	{	547	{
482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	548	bool is_freed = flag [FLAG_FREED];
483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	549	bool is_removed = flag [FLAG_REMOVED];
484		550
485	*(object_copy *)dst = *this;	551	*(object_copy *)this = src;
486		552
487	if (is_freed)	553	flag [FLAG_FREED] = is_freed;
488	SET_FLAG (dst, FLAG_FREED);	554	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		555
496	/* Copy over key_values, if any. */	556	/* Copy over key_values, if any. */
497	if (key_values)	557	if (src.key_values)
498	{	558	{
499	key_value *tail = 0;	559	key_value *tail = 0;
500	key_value *i;
501
502	dst->key_values = 0;	560	key_values = 0;
503		561
504	for (i = key_values; i; i = i->next)	562	for (key_value *i = src.key_values; i; i = i->next)
505	{	563	{
506	key_value *new_link = new key_value;	564	key_value *new_link = new key_value;
507		565
508	new_link->next = 0;	566	new_link->next = 0;
509	new_link->key = i->key;	567	new_link->key = i->key;
510	new_link->value = i->value;	568	new_link->value = i->value;
511		569
512	/* Try and be clever here, too. */	570	/* Try and be clever here, too. */
513	if (!dst->key_values)	571	if (!key_values)
514	{	572	{
515	dst->key_values = new_link;	573	key_values = new_link;
516	tail = new_link;	574	tail = new_link;
517	}	575	}
518	else	576	else
519	{	577	{
520	tail->next = new_link;	578	tail->next = new_link;
521	tail = new_link;	579	tail = new_link;
522	}	580	}
523	}	581	}
524	}	582	}
		583	}
		584
		585	/*
		586	* copy_to first frees everything allocated by the dst object,
		587	* and then copies the contents of itself into the second
		588	* object, allocating what needs to be allocated. Basically, any
		589	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		590	* if the first object is freed, the pointers in the new object
		591	* will point at garbage.
		592	*/
		593	void
		594	object::copy_to (object *dst)
		595	{
		596	*dst = *this;
		597
		598	if (speed < 0)
		599	dst->speed_left -= rndm ();
525		600
526	dst->set_speed (dst->speed);	601	dst->set_speed (dst->speed);
		602	}
		603
		604	void
		605	object::instantiate ()
		606	{
		607	if (!uuid.seq) // HACK
		608	uuid = gen_uuid ();
		609
		610	speed_left = -0.1f;
		611	/* copy the body_info to the body_used - this is only really
		612	* need for monsters, but doesn't hurt to do it for everything.
		613	* by doing so, when a monster is created, it has good starting
		614	* values for the body_used info, so when items are created
		615	* for it, they can be properly equipped.
		616	*/
		617	for (int i = NUM_BODY_LOCATIONS; i--; )
		618	slot[i].used = slot[i].info;
		619
		620	attachable::instantiate ();
527	}	621	}
528		622
529	object *	623	object *
530	object::clone ()	624	object::clone ()
531	{	625	{
…		…
589	* UP_OBJ_FACE: only the objects face has changed.	683	* UP_OBJ_FACE: only the objects face has changed.
590	*/	684	*/
591	void	685	void
592	update_object (object *op, int action)	686	update_object (object *op, int action)
593	{	687	{
594	MoveType move_on, move_off, move_block, move_slow;
595
596	if (op == NULL)	688	if (op == NULL)
597	{	689	{
598	/* this should never happen */	690	/* this should never happen */
599	LOG (llevDebug, "update_object() called for NULL object.\n");	691	LOG (llevDebug, "update_object() called for NULL object.\n");
600	return;	692	return;
…		…
624	return;	716	return;
625	}	717	}
626		718
627	mapspace &m = op->ms ();	719	mapspace &m = op->ms ();
628		720
629	if (m.flags_ & P_NEED_UPDATE)	721	if (!(m.flags_ & P_UPTODATE))
630	/* nop */;	722	/* nop */;
631	else if (action == UP_OBJ_INSERT)	723	else if (action == UP_OBJ_INSERT)
632	{	724	{
633	// this is likely overkill, TODO: revisit (schmorp)	725	// this is likely overkill, TODO: revisit (schmorp)
634	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	726	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
…		…
643	/* This isn't perfect, but I don't expect a lot of objects to	735	/* This isn't perfect, but I don't expect a lot of objects to
644	* to have move_allow right now.	736	* to have move_allow right now.
645	*/	737	*/
646	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	738	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
647	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	739	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
648	m.flags_ = P_NEED_UPDATE;	740	m.flags_ = 0;
649	}	741	}
650	/* if the object is being removed, we can't make intelligent	742	/* if the object is being removed, we can't make intelligent
651	* decisions, because remove_ob can't really pass the object	743	* decisions, because remove_ob can't really pass the object
652	* that is being removed.	744	* that is being removed.
653	*/	745	*/
654	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	746	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
655	m.flags_ = P_NEED_UPDATE;	747	m.flags_ = 0;
656	else if (action == UP_OBJ_FACE)	748	else if (action == UP_OBJ_FACE)
657	/* Nothing to do for that case */ ;	749	/* Nothing to do for that case */ ;
658	else	750	else
659	LOG (llevError, "update_object called with invalid action: %d\n", action);	751	LOG (llevError, "update_object called with invalid action: %d\n", action);
660		752
661	if (op->more)	753	if (op->more)
662	update_object (op->more, action);	754	update_object (op->more, action);
663	}	755	}
664		756
665	object *object::first;
666
667	object::object ()	757	object::object ()
668	{	758	{
669	SET_FLAG (this, FLAG_REMOVED);	759	SET_FLAG (this, FLAG_REMOVED);
670		760
671	expmul = 1.0;	761	expmul = 1.0;
672	face = blank_face;	762	face = blank_face;
673	}	763	}
674		764
675	object::~object ()	765	object::~object ()
676	{	766	{
		767	unlink ();
		768
677	free_key_values (this);	769	free_key_values (this);
678	}	770	}
679		771
		772	static int object_count;
		773
680	void object::link ()	774	void object::link ()
681	{	775	{
682	count = ++ob_count;	776	assert (!index);//D
683	uuid = gen_uuid ();	777	uuid = gen_uuid ();
		778	count = ++object_count;
684		779
685	prev = 0;	780	refcnt_inc ();
686	next = object::first;	781	objects.insert (this);
687
688	if (object::first)
689	object::first->prev = this;
690
691	object::first = this;
692	}	782	}
693		783
694	void object::unlink ()	784	void object::unlink ()
695	{	785	{
696	if (this == object::first)	786	if (!index)
697	object::first = next;	787	return;
698		788
699	/* Remove this object from the list of used objects */	789	objects.erase (this);
700	if (prev) prev->next = next;	790	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	}	791	}
712		792
713	void	793	void
714	object::activate ()	794	object::activate ()
715	{	795	{
716	/* If already on active list, don't do anything */	796	/* If already on active list, don't do anything */
717	if (active ())	797	if (active)
718	return;	798	return;
719		799
720	if (has_active_speed ())	800	if (has_active_speed ())
721	{	801	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	}	802	}
732		803
733	void	804	void
734	object::activate_recursive ()	805	object::activate_recursive ()
735	{	806	{
736	activate ();	807	activate ();
737		808
738	for (object *op = inv; op; op = op->above)	809	for (object *op = inv; op; op = op->below)
739	op->activate_recursive ();	810	op->activate_recursive ();
740	}	811	}
741		812
742	/* This function removes object 'op' from the list of active	813	/* This function removes object 'op' from the list of active
743	* objects.	814	* objects.
…		…
749	*/	820	*/
750	void	821	void
751	object::deactivate ()	822	object::deactivate ()
752	{	823	{
753	/* If not on the active list, nothing needs to be done */	824	/* If not on the active list, nothing needs to be done */
754	if (!active ())	825	if (!active)
755	return;	826	return;
756		827
757	if (active_prev == 0)	828	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	}	829	}
773		830
774	void	831	void
775	object::deactivate_recursive ()	832	object::deactivate_recursive ()
776	{	833	{
777	for (object *op = inv; op; op = op->above)	834	for (object *op = inv; op; op = op->below)
778	op->deactivate_recursive ();	835	op->deactivate_recursive ();
779		836
780	deactivate ();	837	deactivate ();
		838	}
		839
		840	void
		841	object::set_flag_inv (int flag, int value)
		842	{
		843	for (object *op = inv; op; op = op->below)
		844	{
		845	op->flag [flag] = value;
		846	op->set_flag_inv (flag, value);
		847	}
781	}	848	}
782		849
783	/*	850	/*
784	* Remove and free all objects in the inventory of the given object.	851	* Remove and free all objects in the inventory of the given object.
785	* object.c ?	852	* object.c ?
…		…
800	* drop on that space.	867	* drop on that space.
801	*/	868	*/
802	if (!drop_to_ground	869	if (!drop_to_ground
803	|| !map	870	|| !map
804	|| map->in_memory != MAP_IN_MEMORY	871	|| map->in_memory != MAP_IN_MEMORY
		872	|| map->nodrop
805	|| ms ().move_block == MOVE_ALL)	873	|| ms ().move_block == MOVE_ALL)
806	{	874	{
807	while (inv)	875	while (inv)
808	{	876	{
809	inv->destroy_inv (drop_to_ground);	877	inv->destroy_inv (drop_to_ground);
…		…
818		886
819	if (op->flag [FLAG_STARTEQUIP]	887	if (op->flag [FLAG_STARTEQUIP]
820	|| op->flag [FLAG_NO_DROP]	888	|| op->flag [FLAG_NO_DROP]
821	|| op->type == RUNE	889	|| op->type == RUNE
822	|| op->type == TRAP	890	|| op->type == TRAP
823	|| op->flag [FLAG_IS_A_TEMPLATE])	891	|| op->flag [FLAG_IS_A_TEMPLATE]
		892	|| op->flag [FLAG_DESTROY_ON_DEATH])
824	op->destroy ();	893	op->destroy ();
825	else	894	else
826	map->insert (op, x, y);	895	map->insert (op, x, y);
827	}	896	}
828	}	897	}
…		…
836	}	905	}
837		906
838	void	907	void
839	object::do_destroy ()	908	object::do_destroy ()
840	{	909	{
		910	attachable::do_destroy ();
		911
841	if (flag [FLAG_IS_LINKED])	912	if (flag [FLAG_IS_LINKED])
842	remove_button_link (this);	913	remove_button_link (this);
843		914
844	if (flag [FLAG_FRIENDLY])	915	if (flag [FLAG_FRIENDLY])
845	remove_friendly_object (this);	916	remove_friendly_object (this);
846		917
847	if (!flag [FLAG_REMOVED])	918	if (!flag [FLAG_REMOVED])
848	remove ();	919	remove ();
849		920
850	if (flag [FLAG_FREED])	921	destroy_inv (true);
851	return;
852		922
853	set_speed (0);	923	deactivate ();
		924	unlink ();
854		925
855	flag [FLAG_FREED] = 1;	926	flag [FLAG_FREED] = 1;
856
857	attachable::do_destroy ();
858
859	destroy_inv (true);
860	unlink ();
861		927
862	// hack to ensure that freed objects still have a valid map	928	// hack to ensure that freed objects still have a valid map
863	{	929	{
864	static maptile *freed_map; // freed objects are moved here to avoid crashes	930	static maptile *freed_map; // freed objects are moved here to avoid crashes
865		931
866	if (!freed_map)	932	if (!freed_map)
867	{	933	{
868	freed_map = new maptile;	934	freed_map = new maptile;
869		935
		936	freed_map->path = "<freed objects map>";
870	freed_map->name = "/internal/freed_objects_map";	937	freed_map->name = "/internal/freed_objects_map";
871	freed_map->width = 3;	938	freed_map->width = 3;
872	freed_map->height = 3;	939	freed_map->height = 3;
873		940
874	freed_map->alloc ();	941	freed_map->alloc ();
		942	freed_map->in_memory = MAP_IN_MEMORY;
875	}	943	}
876		944
877	map = freed_map;	945	map = freed_map;
878	x = 1;	946	x = 1;
879	y = 1;	947	y = 1;
880	}	948	}
881		949
882	head = 0;
883
884	if (more)	950	if (more)
885	{	951	{
886	more->destroy ();	952	more->destroy ();
887	more = 0;	953	more = 0;
888	}	954	}
889		955
		956	head = 0;
		957
890	// clear those pointers that likely might have circular references to us	958	// clear those pointers that likely might cause circular references
891	owner = 0;	959	owner = 0;
892	enemy = 0;	960	enemy = 0;
893	attacked_by = 0;	961	attacked_by = 0;
894		962	current_weapon = 0;
895	// only relevant for players(?), but make sure of it anyways
896	contr = 0;
897	}	963	}
898		964
899	void	965	void
900	object::destroy (bool destroy_inventory)	966	object::destroy (bool destroy_inventory)
901	{	967	{
902	if (destroyed ())	968	if (destroyed ())
903	return;	969	return;
904		970
905	if (destroy_inventory)	971	if (destroy_inventory)
906	destroy_inv (false);	972	destroy_inv (false);
		973
		974	if (is_head ())
		975	if (sound_destroy)
		976	play_sound (sound_destroy);
		977	else if (flag [FLAG_MONSTER])
		978	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
907		979
908	attachable::destroy ();	980	attachable::destroy ();
909	}	981	}
910		982
911	/*	983	/*
…		…
929	* This function removes the object op from the linked list of objects	1001	* This function removes the object op from the linked list of objects
930	* which it is currently tied to. When this function is done, the	1002	* which it is currently tied to. When this function is done, the
931	* object will have no environment. If the object previously had an	1003	* object will have no environment. If the object previously had an
932	* environment, the x and y coordinates will be updated to	1004	* environment, the x and y coordinates will be updated to
933	* the previous environment.	1005	* the previous environment.
934	* Beware: This function is called from the editor as well!
935	*/	1006	*/
936	void	1007	void
937	object::remove ()	1008	object::do_remove ()
938	{	1009	{
939	object *tmp, *last = 0;	1010	object *tmp, *last = 0;
940	object *otmp;	1011	object *otmp;
941		1012
942	if (QUERY_FLAG (this, FLAG_REMOVED))	1013	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
985	}	1056	}
986	else if (map)	1057	else if (map)
987	{	1058	{
988	if (type == PLAYER)	1059	if (type == PLAYER)
989	{	1060	{
		1061	// leaving a spot always closes any open container on the ground
		1062	if (container && !container->env)
		1063	// this causes spurious floorbox updates, but it ensures
		1064	// that the CLOSE event is being sent.
		1065	close_container ();
		1066
990	--map->players;	1067	--map->players;
991	map->last_access = runtime;	1068	map->touch ();
992	}	1069	}
993		1070
994	map->dirty = true;	1071	map->dirty = true;
		1072	mapspace &ms = this->ms ();
995		1073
996	/* link the object above us */	1074	/* link the object above us */
997	if (above)	1075	if (above)
998	above->below = below;	1076	above->below = below;
999	else	1077	else
1000	map->at (x, y).top = below; /* we were top, set new top */	1078	ms.top = below; /* we were top, set new top */
1001		1079
1002	/* Relink the object below us, if there is one */	1080	/* Relink the object below us, if there is one */
1003	if (below)	1081	if (below)
1004	below->above = above;	1082	below->above = above;
1005	else	1083	else
…		…
1007	/* Nothing below, which means we need to relink map object for this space	1085	/* Nothing below, which means we need to relink map object for this space
1008	* use translated coordinates in case some oddness with map tiling is	1086	* use translated coordinates in case some oddness with map tiling is
1009	* evident	1087	* evident
1010	*/	1088	*/
1011	if (GET_MAP_OB (map, x, y) != this)	1089	if (GET_MAP_OB (map, x, y) != this)
1012	{
1013	char *dump = dump_object (this);
1014	LOG (llevError,
1015	"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);	1090	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 ());
1016	free (dump);
1017	dump = dump_object (GET_MAP_OB (map, x, y));
1018	LOG (llevError, "%s\n", dump);
1019	free (dump);
1020	}
1021		1091
1022	map->at (x, y).bot = above; /* goes on above it. */	1092	ms.bot = above; /* goes on above it. */
1023	}	1093	}
1024		1094
1025	above = 0;	1095	above = 0;
1026	below = 0;	1096	below = 0;
1027		1097
1028	if (map->in_memory == MAP_SAVING)	1098	if (map->in_memory == MAP_SAVING)
1029	return;	1099	return;
1030		1100
1031	int check_walk_off = !flag [FLAG_NO_APPLY];	1101	int check_walk_off = !flag [FLAG_NO_APPLY];
1032		1102
		1103	if (object *pl = ms.player ())
		1104	{
		1105	if (pl->container == this)
		1106	/* If a container that the player is currently using somehow gets
		1107	* removed (most likely destroyed), update the player view
		1108	* appropriately.
		1109	*/
		1110	pl->close_container ();
		1111
		1112	pl->contr->ns->floorbox_update ();
		1113	}
		1114
1033	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1115	for (tmp = ms.bot; tmp; tmp = tmp->above)
1034	{	1116	{
1035	/* No point updating the players look faces if he is the object	1117	/* No point updating the players look faces if he is the object
1036	* being removed.	1118	* being removed.
1037	*/	1119	*/
1038
1039	if (tmp->type == PLAYER && tmp != this)
1040	{
1041	/* If a container that the player is currently using somehow gets
1042	* removed (most likely destroyed), update the player view
1043	* appropriately.
1044	*/
1045	if (tmp->container == this)
1046	{
1047	flag [FLAG_APPLIED] = 0;
1048	tmp->container = 0;
1049	}
1050
1051	if (tmp->contr->ns)
1052	tmp->contr->ns->floorbox_update ();
1053	}
1054		1120
1055	/* See if object moving off should effect something */	1121	/* See if object moving off should effect something */
1056	if (check_walk_off	1122	if (check_walk_off
1057	&& ((move_type & tmp->move_off)	1123	&& ((move_type & tmp->move_off)
1058	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1124	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1061		1127
1062	if (destroyed ())	1128	if (destroyed ())
1063	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1129	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1064	}	1130	}
1065		1131
1066	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1067	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1068	if (tmp->above == tmp)
1069	tmp->above = 0;
1070
1071	last = tmp;	1132	last = tmp;
1072	}	1133	}
1073		1134
1074	/* last == NULL if there are no objects on this space */	1135	/* last == NULL if there are no objects on this space */
1075	//TODO: this makes little sense, why only update the topmost object?	1136	//TODO: this makes little sense, why only update the topmost object?
1076	if (!last)	1137	if (!last)
1077	map->at (x, y).flags_ = P_NEED_UPDATE;	1138	map->at (x, y).flags_ = 0;
1078	else	1139	else
1079	update_object (last, UP_OBJ_REMOVE);	1140	update_object (last, UP_OBJ_REMOVE);
1080		1141
1081	if (flag [FLAG_BLOCKSVIEW] || glow_radius)	1142	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1082	update_all_los (map, x, y);	1143	update_all_los (map, x, y);
…		…
1095	merge_ob (object *op, object *top)	1156	merge_ob (object *op, object *top)
1096	{	1157	{
1097	if (!op->nrof)	1158	if (!op->nrof)
1098	return 0;	1159	return 0;
1099		1160
1100	if (top)	1161	if (!top)
1101	for (top = op; top && top->above; top = top->above)	1162	for (top = op; top && top->above; top = top->above)
1102	;	1163	;
1103		1164
1104	for (; top; top = top->below)	1165	for (; top; top = top->below)
1105	{	1166	{
…		…
1118	}	1179	}
1119		1180
1120	return 0;	1181	return 0;
1121	}	1182	}
1122		1183
		1184	void
		1185	object::expand_tail ()
		1186	{
		1187	if (more)
		1188	return;
		1189
		1190	object *prev = this;
		1191
		1192	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1193	{
		1194	object *op = arch_to_object (at);
		1195
		1196	op->name = name;
		1197	op->name_pl = name_pl;
		1198	op->title = title;
		1199
		1200	op->head = this;
		1201	prev->more = op;
		1202
		1203	prev = op;
		1204	}
		1205	}
		1206
1123	/*	1207	/*
1124	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1208	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1125	* job preparing multi-part monsters	1209	* job preparing multi-part monsters.
1126	*/	1210	*/
1127	object *	1211	object *
1128	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1212	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1129	{	1213	{
1130	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1214	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1131	{	1215	{
1132	tmp->x = x + tmp->arch->clone.x;	1216	tmp->x = x + tmp->arch->x;
1133	tmp->y = y + tmp->arch->clone.y;	1217	tmp->y = y + tmp->arch->y;
1134	}	1218	}
1135		1219
1136	return insert_ob_in_map (op, m, originator, flag);	1220	return insert_ob_in_map (op, m, originator, flag);
1137	}	1221	}
1138		1222
…		…
1157	* just 'op' otherwise	1241	* just 'op' otherwise
1158	*/	1242	*/
1159	object *	1243	object *
1160	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1244	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1161	{	1245	{
		1246	assert (!op->flag [FLAG_FREED]);
		1247
1162	object *tmp, *top, *floor = NULL;	1248	object *top, *floor = NULL;
1163	sint16 x, y;
1164		1249
1165	if (QUERY_FLAG (op, FLAG_FREED))	1250	op->remove ();
1166	{
1167	LOG (llevError, "Trying to insert freed object!\n");
1168	return NULL;
1169	}
1170
1171	if (!m)
1172	{
1173	char *dump = dump_object (op);
1174	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1175	free (dump);
1176	return op;
1177	}
1178
1179	if (out_of_map (m, op->x, op->y))
1180	{
1181	char *dump = dump_object (op);
1182	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1183	#ifdef MANY_CORES
1184	/* Better to catch this here, as otherwise the next use of this object
1185	* is likely to cause a crash. Better to find out where it is getting
1186	* improperly inserted.
1187	*/
1188	abort ();
1189	#endif
1190	free (dump);
1191	return op;
1192	}
1193
1194	if (!QUERY_FLAG (op, FLAG_REMOVED))
1195	{
1196	char *dump = dump_object (op);
1197	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1198	free (dump);
1199	return op;
1200	}
1201
1202	if (op->more)
1203	{
1204	/* The part may be on a different map. */
1205
1206	object *more = op->more;
1207
1208	/* We really need the caller to normalize coordinates - if
1209	* we set the map, that doesn't work if the location is within
1210	* a map and this is straddling an edge. So only if coordinate
1211	* is clear wrong do we normalize it.
1212	*/
1213	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1214	more->map = get_map_from_coord (m, &more->x, &more->y);
1215	else if (!more->map)
1216	{
1217	/* For backwards compatibility - when not dealing with tiled maps,
1218	* more->map should always point to the parent.
1219	*/
1220	more->map = m;
1221	}
1222
1223	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1224	{
1225	if (!op->head)
1226	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1227
1228	return 0;
1229	}
1230	}
1231
1232	CLEAR_FLAG (op, FLAG_REMOVED);
1233		1251
1234	/* Ideally, the caller figures this out. However, it complicates a lot	1252	/* Ideally, the caller figures this out. However, it complicates a lot
1235	* of areas of callers (eg, anything that uses find_free_spot would now	1253	* of areas of callers (eg, anything that uses find_free_spot would now
1236	* need extra work	1254	* need extra work
1237	*/	1255	*/
1238	op->map = get_map_from_coord (m, &op->x, &op->y);	1256	if (!xy_normalise (m, op->x, op->y))
1239	x = op->x;	1257	{
1240	y = op->y;	1258	op->destroy ();
		1259	return 0;
		1260	}
		1261
		1262	if (object *more = op->more)
		1263	if (!insert_ob_in_map (more, m, originator, flag))
		1264	return 0;
		1265
		1266	CLEAR_FLAG (op, FLAG_REMOVED);
		1267
		1268	op->map = m;
		1269	mapspace &ms = op->ms ();
1241		1270
1242	/* this has to be done after we translate the coordinates.	1271	/* this has to be done after we translate the coordinates.
1243	*/	1272	*/
1244	if (op->nrof && !(flag & INS_NO_MERGE))	1273	if (op->nrof && !(flag & INS_NO_MERGE))
1245	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1274	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1246	if (object::can_merge (op, tmp))	1275	if (object::can_merge (op, tmp))
1247	{	1276	{
1248	op->nrof += tmp->nrof;	1277	op->nrof += tmp->nrof;
1249	tmp->destroy ();	1278	tmp->destroy ();
1250	}	1279	}
…		…
1267	op->below = originator->below;	1296	op->below = originator->below;
1268		1297
1269	if (op->below)	1298	if (op->below)
1270	op->below->above = op;	1299	op->below->above = op;
1271	else	1300	else
1272	op->ms ().bot = op;	1301	ms.bot = op;
1273		1302
1274	/* since *below* originator, no need to update top */	1303	/* since *below* originator, no need to update top */
1275	originator->below = op;	1304	originator->below = op;
1276	}	1305	}
1277	else	1306	else
1278	{	1307	{
		1308	top = ms.bot;
		1309
1279	/* If there are other objects, then */	1310	/* If there are other objects, then */
1280	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1311	if (top)
1281	{	1312	{
1282	object *last = 0;	1313	object *last = 0;
1283		1314
1284	/*	1315	/*
1285	* If there are multiple objects on this space, we do some trickier handling.	1316	* If there are multiple objects on this space, we do some trickier handling.
…		…
1291	* once we get to them. This reduces the need to traverse over all of	1322	* once we get to them. This reduces the need to traverse over all of
1292	* them when adding another one - this saves quite a bit of cpu time	1323	* them when adding another one - this saves quite a bit of cpu time
1293	* when lots of spells are cast in one area. Currently, it is presumed	1324	* when lots of spells are cast in one area. Currently, it is presumed
1294	* that flying non pickable objects are spell objects.	1325	* that flying non pickable objects are spell objects.
1295	*/	1326	*/
1296	while (top)	1327	for (top = ms.bot; top; top = top->above)
1297	{	1328	{
1298	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1329	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1299	floor = top;	1330	floor = top;
1300		1331
1301	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1332	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1304	top = top->below;	1335	top = top->below;
1305	break;	1336	break;
1306	}	1337	}
1307		1338
1308	last = top;	1339	last = top;
1309	top = top->above;
1310	}	1340	}
1311		1341
1312	/* Don't want top to be NULL, so set it to the last valid object */	1342	/* Don't want top to be NULL, so set it to the last valid object */
1313	top = last;	1343	top = last;
1314		1344
…		…
1316	* looks like instead of lots of conditions here.	1346	* looks like instead of lots of conditions here.
1317	* makes things faster, and effectively the same result.	1347	* makes things faster, and effectively the same result.
1318	*/	1348	*/
1319		1349
1320	/* Have object 'fall below' other objects that block view.	1350	/* Have object 'fall below' other objects that block view.
1321	* Unless those objects are exits, type 66	1351	* Unless those objects are exits.
1322	* If INS_ON_TOP is used, don't do this processing	1352	* If INS_ON_TOP is used, don't do this processing
1323	* Need to find the object that in fact blocks view, otherwise	1353	* Need to find the object that in fact blocks view, otherwise
1324	* stacking is a bit odd.	1354	* stacking is a bit odd.
1325	*/	1355	*/
1326	if (!(flag & INS_ON_TOP) &&	1356	if (!(flag & INS_ON_TOP)
1327	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1357	&& ms.flags () & P_BLOCKSVIEW
		1358	&& (op->face && !faces [op->face].visibility))
1328	{	1359	{
1329	for (last = top; last != floor; last = last->below)	1360	for (last = top; last != floor; last = last->below)
1330	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1361	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1331	break;	1362	break;
		1363
1332	/* Check to see if we found the object that blocks view,	1364	/* Check to see if we found the object that blocks view,
1333	* and make sure we have a below pointer for it so that	1365	* and make sure we have a below pointer for it so that
1334	* we can get inserted below this one, which requires we	1366	* we can get inserted below this one, which requires we
1335	* set top to the object below us.	1367	* set top to the object below us.
1336	*/	1368	*/
1337	if (last && last->below && last != floor)	1369	if (last && last->below && last != floor)
1338	top = last->below;	1370	top = last->below;
1339	}	1371	}
1340	} /* If objects on this space */	1372	} /* If objects on this space */
1341		1373
1342	if (flag & INS_MAP_LOAD)
1343	top = GET_MAP_TOP (op->map, op->x, op->y);
1344
1345	if (flag & INS_ABOVE_FLOOR_ONLY)	1374	if (flag & INS_ABOVE_FLOOR_ONLY)
1346	top = floor;	1375	top = floor;
1347		1376
1348	/* Top is the object that our object (op) is going to get inserted above.	1377	/* Top is the object that our object (op) is going to get inserted above.
1349	*/	1378	*/
1350		1379
1351	/* First object on this space */	1380	/* First object on this space */
1352	if (!top)	1381	if (!top)
1353	{	1382	{
1354	op->above = GET_MAP_OB (op->map, op->x, op->y);	1383	op->above = ms.bot;
1355		1384
1356	if (op->above)	1385	if (op->above)
1357	op->above->below = op;	1386	op->above->below = op;
1358		1387
1359	op->below = 0;	1388	op->below = 0;
1360	op->ms ().bot = op;	1389	ms.bot = op;
1361	}	1390	}
1362	else	1391	else
1363	{ /* get inserted into the stack above top */	1392	{ /* get inserted into the stack above top */
1364	op->above = top->above;	1393	op->above = top->above;
1365		1394
…		…
1369	op->below = top;	1398	op->below = top;
1370	top->above = op;	1399	top->above = op;
1371	}	1400	}
1372		1401
1373	if (!op->above)	1402	if (!op->above)
1374	op->ms ().top = op;	1403	ms.top = op;
1375	} /* else not INS_BELOW_ORIGINATOR */	1404	} /* else not INS_BELOW_ORIGINATOR */
1376		1405
1377	if (op->type == PLAYER)	1406	if (op->type == PLAYER)
1378	{	1407	{
1379	op->contr->do_los = 1;	1408	op->contr->do_los = 1;
1380	++op->map->players;	1409	++op->map->players;
1381	op->map->last_access = runtime;	1410	op->map->touch ();
1382	}	1411	}
1383		1412
1384	op->map->dirty = true;	1413	op->map->dirty = true;
1385		1414
1386	/* If we have a floor, we know the player, if any, will be above
1387	* it, so save a few ticks and start from there.
1388	*/
1389	if (!(flag & INS_MAP_LOAD))
1390	if (object *pl = op->ms ().player ())	1415	if (object *pl = ms.player ())
1391	if (pl->contr->ns)
1392	pl->contr->ns->floorbox_update ();	1416	pl->contr->ns->floorbox_update ();
1393		1417
1394	/* If this object glows, it may affect lighting conditions that are	1418	/* If this object glows, it may affect lighting conditions that are
1395	* visible to others on this map. But update_all_los is really	1419	* visible to others on this map. But update_all_los is really
1396	* an inefficient way to do this, as it means los for all players	1420	* an inefficient way to do this, as it means los for all players
1397	* on the map will get recalculated. The players could very well	1421	* on the map will get recalculated. The players could very well
1398	* be far away from this change and not affected in any way -	1422	* be far away from this change and not affected in any way -
1399	* this should get redone to only look for players within range,	1423	* this should get redone to only look for players within range,
1400	* or just updating the P_NEED_UPDATE for spaces within this area	1424	* or just updating the P_UPTODATE for spaces within this area
1401	* of effect may be sufficient.	1425	* of effect may be sufficient.
1402	*/	1426	*/
1403	if (op->map->darkness && (op->glow_radius != 0))	1427	if (op->map->darkness && (op->glow_radius != 0))
1404	update_all_los (op->map, op->x, op->y);	1428	update_all_los (op->map, op->x, op->y);
1405		1429
…		…
1416	* blocked() and wall() work properly), and these flags are updated by	1440	* blocked() and wall() work properly), and these flags are updated by
1417	* update_object().	1441	* update_object().
1418	*/	1442	*/
1419		1443
1420	/* if this is not the head or flag has been passed, don't check walk on status */	1444	/* if this is not the head or flag has been passed, don't check walk on status */
1421	if (!(flag & INS_NO_WALK_ON) && !op->head)	1445	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1422	{	1446	{
1423	if (check_move_on (op, originator))	1447	if (check_move_on (op, originator))
1424	return 0;	1448	return 0;
1425		1449
1426	/* If we are a multi part object, lets work our way through the check	1450	/* If we are a multi part object, lets work our way through the check
1427	* walk on's.	1451	* walk on's.
1428	*/	1452	*/
1429	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1453	for (object *tmp = op->more; tmp; tmp = tmp->more)
1430	if (check_move_on (tmp, originator))	1454	if (check_move_on (tmp, originator))
1431	return 0;	1455	return 0;
1432	}	1456	}
1433		1457
1434	return op;	1458	return op;
…		…
1443	{	1467	{
1444	object *tmp, *tmp1;	1468	object *tmp, *tmp1;
1445		1469
1446	/* first search for itself and remove any old instances */	1470	/* first search for itself and remove any old instances */
1447		1471
1448	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1472	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1449	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1473	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1450	tmp->destroy ();	1474	tmp->destroy ();
1451		1475
1452	tmp1 = arch_to_object (archetype::find (arch_string));	1476	tmp1 = arch_to_object (archetype::find (arch_string));
1453		1477
1454	tmp1->x = op->x;	1478	tmp1->x = op->x;
…		…
1457	}	1481	}
1458		1482
1459	object *	1483	object *
1460	object::insert_at (object *where, object *originator, int flags)	1484	object::insert_at (object *where, object *originator, int flags)
1461	{	1485	{
1462	where->map->insert (this, where->x, where->y, originator, flags);	1486	return where->map->insert (this, where->x, where->y, originator, flags);
1463	}	1487	}
1464		1488
1465	/*	1489	/*
1466	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1490	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1467	* is returned contains nr objects, and the remaining parts contains	1491	* is returned contains nr objects, and the remaining parts contains
…		…
1507	* the amount of an object. If the amount reaches 0, the object	1531	* the amount of an object. If the amount reaches 0, the object
1508	* is subsequently removed and freed.	1532	* is subsequently removed and freed.
1509	*	1533	*
1510	* Return value: 'op' if something is left, NULL if the amount reached 0	1534	* Return value: 'op' if something is left, NULL if the amount reached 0
1511	*/	1535	*/
1512
1513	object *	1536	object *
1514	decrease_ob_nr (object *op, uint32 i)	1537	decrease_ob_nr (object *op, uint32 i)
1515	{	1538	{
1516	object *tmp;	1539	object *tmp;
1517		1540
…		…
1592		1615
1593	/*	1616	/*
1594	* add_weight(object, weight) adds the specified weight to an object,	1617	* add_weight(object, weight) adds the specified weight to an object,
1595	* and also updates how much the environment(s) is/are carrying.	1618	* and also updates how much the environment(s) is/are carrying.
1596	*/	1619	*/
1597
1598	void	1620	void
1599	add_weight (object *op, signed long weight)	1621	add_weight (object *op, signed long weight)
1600	{	1622	{
1601	while (op != NULL)	1623	while (op != NULL)
1602	{	1624	{
…		…
1617	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1639	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1618	free (dump);	1640	free (dump);
1619	return op;	1641	return op;
1620	}	1642	}
1621		1643
1622	if (where->head)	1644	if (where->head_ () != where)
1623	{	1645	{
1624	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1646	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1625	where = where->head;	1647	where = where->head;
1626	}	1648	}
1627		1649
1628	return where->insert (op);	1650	return where->insert (op);
1629	}	1651	}
…		…
1634	* inside the object environment.	1656	* inside the object environment.
1635	*	1657	*
1636	* The function returns now pointer to inserted item, and return value can	1658	* The function returns now pointer to inserted item, and return value can
1637	* be != op, if items are merged. -Tero	1659	* be != op, if items are merged. -Tero
1638	*/	1660	*/
1639
1640	object *	1661	object *
1641	object::insert (object *op)	1662	object::insert (object *op)
1642	{	1663	{
1643	object *tmp, *otmp;
1644
1645	if (!QUERY_FLAG (op, FLAG_REMOVED))	1664	if (!QUERY_FLAG (op, FLAG_REMOVED))
1646	op->remove ();	1665	op->remove ();
1647		1666
1648	if (op->more)	1667	if (op->more)
1649	{	1668	{
…		…
1651	return op;	1670	return op;
1652	}	1671	}
1653		1672
1654	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1673	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1655	CLEAR_FLAG (op, FLAG_REMOVED);	1674	CLEAR_FLAG (op, FLAG_REMOVED);
		1675
1656	if (op->nrof)	1676	if (op->nrof)
1657	{	1677	{
1658	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1678	for (object *tmp = inv; tmp; tmp = tmp->below)
1659	if (object::can_merge (tmp, op))	1679	if (object::can_merge (tmp, op))
1660	{	1680	{
1661	/* return the original object and remove inserted object	1681	/* return the original object and remove inserted object
1662	(client needs the original object) */	1682	(client needs the original object) */
1663	tmp->nrof += op->nrof;	1683	tmp->nrof += op->nrof;
…		…
1682	add_weight (this, op->weight * op->nrof);	1702	add_weight (this, op->weight * op->nrof);
1683	}	1703	}
1684	else	1704	else
1685	add_weight (this, (op->weight + op->carrying));	1705	add_weight (this, (op->weight + op->carrying));
1686		1706
1687	otmp = this->in_player ();	1707	if (object *otmp = this->in_player ())
1688	if (otmp && otmp->contr)
1689	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1708	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1690	otmp->update_stats ();	1709	otmp->update_stats ();
1691		1710
		1711	op->owner = 0; // its his/hers now. period.
1692	op->map = 0;	1712	op->map = 0;
1693	op->env = this;	1713	op->env = this;
1694	op->above = 0;	1714	op->above = 0;
1695	op->below = 0;	1715	op->below = 0;
1696	op->x = 0, op->y = 0;	1716	op->x = op->y = 0;
1697		1717
1698	/* reset the light list and los of the players on the map */	1718	/* reset the light list and los of the players on the map */
1699	if ((op->glow_radius != 0) && map)	1719	if (op->glow_radius && map)
1700	{	1720	{
1701	#ifdef DEBUG_LIGHTS	1721	#ifdef DEBUG_LIGHTS
1702	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1722	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1703	#endif /* DEBUG_LIGHTS */	1723	#endif /* DEBUG_LIGHTS */
1704	if (map->darkness)	1724	if (map->darkness)
…		…
1776		1796
1777	/* The objects have to be checked from top to bottom.	1797	/* The objects have to be checked from top to bottom.
1778	* Hence, we first go to the top:	1798	* Hence, we first go to the top:
1779	*/	1799	*/
1780		1800
1781	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above)	1801	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1782	{	1802	{
1783	/* Trim the search when we find the first other spell effect	1803	/* Trim the search when we find the first other spell effect
1784	* this helps performance so that if a space has 50 spell objects,	1804	* this helps performance so that if a space has 50 spell objects,
1785	* we don't need to check all of them.	1805	* we don't need to check all of them.
1786	*/	1806	*/
…		…
1804	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1824	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1805	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1825	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1806	{	1826	{
1807		1827
1808	float	1828	float
1809	diff = tmp->move_slow_penalty * FABS (op->speed);	1829	diff = tmp->move_slow_penalty * fabs (op->speed);
1810		1830
1811	if (op->type == PLAYER)	1831	if (op->type == PLAYER)
1812	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1832	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1813	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1833	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1814	diff /= 4.0;	1834	diff /= 4.0;
…		…
1844	* The first matching object is returned, or NULL if none.	1864	* The first matching object is returned, or NULL if none.
1845	*/	1865	*/
1846	object *	1866	object *
1847	present_arch (const archetype *at, maptile *m, int x, int y)	1867	present_arch (const archetype *at, maptile *m, int x, int y)
1848	{	1868	{
1849	if (m == NULL || out_of_map (m, x, y))	1869	if (!m || out_of_map (m, x, y))
1850	{	1870	{
1851	LOG (llevError, "Present_arch called outside map.\n");	1871	LOG (llevError, "Present_arch called outside map.\n");
1852	return NULL;	1872	return NULL;
1853	}	1873	}
1854		1874
1855	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1875	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1856	if (tmp->arch == at)	1876	if (tmp->arch == at)
1857	return tmp;	1877	return tmp;
1858		1878
1859	return NULL;	1879	return NULL;
1860	}	1880	}
…		…
1871	{	1891	{
1872	LOG (llevError, "Present called outside map.\n");	1892	LOG (llevError, "Present called outside map.\n");
1873	return NULL;	1893	return NULL;
1874	}	1894	}
1875		1895
1876	for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1896	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1877	if (tmp->type == type)	1897	if (tmp->type == type)
1878	return tmp;	1898	return tmp;
1879		1899
1880	return NULL;	1900	return NULL;
1881	}	1901	}
…		…
1938	* activate recursively a flag on an object inventory	1958	* activate recursively a flag on an object inventory
1939	*/	1959	*/
1940	void	1960	void
1941	flag_inv (object *op, int flag)	1961	flag_inv (object *op, int flag)
1942	{	1962	{
1943	if (op->inv)
1944	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1963	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1945	{	1964	{
1946	SET_FLAG (tmp, flag);	1965	SET_FLAG (tmp, flag);
1947	flag_inv (tmp, flag);	1966	flag_inv (tmp, flag);
1948	}	1967	}
1949	}	1968	}
1950		1969
1951	/*	1970	/*
1952	* deactivate recursively a flag on an object inventory	1971	* deactivate recursively a flag on an object inventory
1953	*/	1972	*/
1954	void	1973	void
1955	unflag_inv (object *op, int flag)	1974	unflag_inv (object *op, int flag)
1956	{	1975	{
1957	if (op->inv)
1958	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1976	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1959	{	1977	{
1960	CLEAR_FLAG (tmp, flag);	1978	CLEAR_FLAG (tmp, flag);
1961	unflag_inv (tmp, flag);	1979	unflag_inv (tmp, flag);
1962	}	1980	}
1963	}
1964
1965	/*
1966	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1967	* all it's inventory (recursively).
1968	* If checksums are used, a player will get set_cheat called for
1969	* him/her-self and all object carried by a call to this function.
1970	*/
1971	void
1972	set_cheat (object *op)
1973	{
1974	SET_FLAG (op, FLAG_WAS_WIZ);
1975	flag_inv (op, FLAG_WAS_WIZ);
1976	}	1981	}
1977		1982
1978	/*	1983	/*
1979	* find_free_spot(object, map, x, y, start, stop) will search for	1984	* find_free_spot(object, map, x, y, start, stop) will search for
1980	* a spot at the given map and coordinates which will be able to contain	1985	* a spot at the given map and coordinates which will be able to contain
…		…
1982	* to search (see the freearr_x/y[] definition).	1987	* to search (see the freearr_x/y[] definition).
1983	* It returns a random choice among the alternatives found.	1988	* It returns a random choice among the alternatives found.
1984	* start and stop are where to start relative to the free_arr array (1,9	1989	* start and stop are where to start relative to the free_arr array (1,9
1985	* does all 4 immediate directions). This returns the index into the	1990	* does all 4 immediate directions). This returns the index into the
1986	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1991	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1987	* Note - this only checks to see if there is space for the head of the
1988	* object - if it is a multispace object, this should be called for all
1989	* pieces.
1990	* Note2: This function does correctly handle tiled maps, but does not	1992	* Note: This function does correctly handle tiled maps, but does not
1991	* inform the caller. However, insert_ob_in_map will update as	1993	* inform the caller. However, insert_ob_in_map will update as
1992	* necessary, so the caller shouldn't need to do any special work.	1994	* necessary, so the caller shouldn't need to do any special work.
1993	* Note - updated to take an object instead of archetype - this is necessary	1995	* Note - updated to take an object instead of archetype - this is necessary
1994	* because arch_blocked (now ob_blocked) needs to know the movement type	1996	* because arch_blocked (now ob_blocked) needs to know the movement type
1995	* to know if the space in question will block the object. We can't use	1997	* to know if the space in question will block the object. We can't use
…		…
1997	* customized, changed states, etc.	1999	* customized, changed states, etc.
1998	*/	2000	*/
1999	int	2001	int
2000	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	2002	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2001	{	2003	{
		2004	int altern[SIZEOFFREE];
2002	int index = 0, flag;	2005	int index = 0, flag;
2003	int altern[SIZEOFFREE];
2004		2006
2005	for (int i = start; i < stop; i++)	2007	for (int i = start; i < stop; i++)
2006	{	2008	{
2007	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2009	mapxy pos (m, x, y); pos.move (i);
2008	if (!flag)	2010
		2011	if (!pos.normalise ())
		2012	continue;
		2013
		2014	mapspace &ms = *pos;
		2015
		2016	if (ms.flags () & P_IS_ALIVE)
		2017	continue;
		2018
		2019	/* However, often
		2020	* ob doesn't have any move type (when used to place exits)
		2021	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2022	*/
		2023	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2024	{
2009	altern [index++] = i;	2025	altern [index++] = i;
		2026	continue;
		2027	}
2010		2028
2011	/* Basically, if we find a wall on a space, we cut down the search size.	2029	/* Basically, if we find a wall on a space, we cut down the search size.
2012	* In this way, we won't return spaces that are on another side of a wall.	2030	* In this way, we won't return spaces that are on another side of a wall.
2013	* This mostly work, but it cuts down the search size in all directions -	2031	* This mostly work, but it cuts down the search size in all directions -
2014	* if the space being examined only has a wall to the north and empty	2032	* if the space being examined only has a wall to the north and empty
2015	* spaces in all the other directions, this will reduce the search space	2033	* spaces in all the other directions, this will reduce the search space
2016	* to only the spaces immediately surrounding the target area, and	2034	* to only the spaces immediately surrounding the target area, and
2017	* won't look 2 spaces south of the target space.	2035	* won't look 2 spaces south of the target space.
2018	*/	2036	*/
2019	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2037	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2038	{
2020	stop = maxfree[i];	2039	stop = maxfree[i];
		2040	continue;
		2041	}
		2042
		2043	/* Note it is intentional that we check ob - the movement type of the
		2044	* head of the object should correspond for the entire object.
		2045	*/
		2046	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2047	continue;
		2048
		2049	if (ob->blocked (m, pos.x, pos.y))
		2050	continue;
		2051
		2052	altern [index++] = i;
2021	}	2053	}
2022		2054
2023	if (!index)	2055	if (!index)
2024	return -1;	2056	return -1;
2025		2057
2026	return altern[RANDOM () % index];	2058	return altern [rndm (index)];
2027	}	2059	}
2028		2060
2029	/*	2061	/*
2030	* find_first_free_spot(archetype, maptile, x, y) works like	2062	* find_first_free_spot(archetype, maptile, x, y) works like
2031	* find_free_spot(), but it will search max number of squares.	2063	* find_free_spot(), but it will search max number of squares.
…		…
2034	*/	2066	*/
2035	int	2067	int
2036	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2068	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2037	{	2069	{
2038	for (int i = 0; i < SIZEOFFREE; i++)	2070	for (int i = 0; i < SIZEOFFREE; i++)
2039	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2071	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2040	return i;	2072	return i;
2041		2073
2042	return -1;	2074	return -1;
2043	}	2075	}
2044		2076
…		…
2052	{	2084	{
2053	arr += begin;	2085	arr += begin;
2054	end -= begin;	2086	end -= begin;
2055		2087
2056	while (--end)	2088	while (--end)
2057	swap (arr [end], arr [RANDOM () % (end + 1)]);	2089	swap (arr [end], arr [rndm (end + 1)]);
2058	}	2090	}
2059		2091
2060	/* new function to make monster searching more efficient, and effective!	2092	/* new function to make monster searching more efficient, and effective!
2061	* This basically returns a randomized array (in the passed pointer) of	2093	* This basically returns a randomized array (in the passed pointer) of
2062	* the spaces to find monsters. In this way, it won't always look for	2094	* the spaces to find monsters. In this way, it won't always look for
…		…
2098	object *tmp;	2130	object *tmp;
2099	maptile *mp;	2131	maptile *mp;
2100		2132
2101	MoveType blocked, move_type;	2133	MoveType blocked, move_type;
2102		2134
2103	if (exclude && exclude->head)	2135	if (exclude && exclude->head_ () != exclude)
2104	{	2136	{
2105	exclude = exclude->head;	2137	exclude = exclude->head;
2106	move_type = exclude->move_type;	2138	move_type = exclude->move_type;
2107	}	2139	}
2108	else	2140	else
…		…
2131	max = maxfree[i];	2163	max = maxfree[i];
2132	else if (mflags & P_IS_ALIVE)	2164	else if (mflags & P_IS_ALIVE)
2133	{	2165	{
2134	for (tmp = ms.bot; tmp; tmp = tmp->above)	2166	for (tmp = ms.bot; tmp; tmp = tmp->above)
2135	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2167	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2136	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2168	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2137	break;	2169	break;
2138		2170
2139	if (tmp)	2171	if (tmp)
2140	return freedir[i];	2172	return freedir[i];
2141	}	2173	}
…		…
2196		2228
2197	return 3;	2229	return 3;
2198	}	2230	}
2199		2231
2200	/*	2232	/*
2201	* absdir(int): Returns a number between 1 and 8, which represent
2202	* the "absolute" direction of a number (it actually takes care of
2203	* "overflow" in previous calculations of a direction).
2204	*/
2205
2206	int
2207	absdir (int d)
2208	{
2209	while (d < 1)
2210	d += 8;
2211
2212	while (d > 8)
2213	d -= 8;
2214
2215	return d;
2216	}
2217
2218	/*
2219	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2233	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2220	* between two directions (which are expected to be absolute (see absdir())	2234	* between two directions (which are expected to be absolute (see absdir())
2221	*/	2235	*/
2222
2223	int	2236	int
2224	dirdiff (int dir1, int dir2)	2237	dirdiff (int dir1, int dir2)
2225	{	2238	{
2226	int d;	2239	int d;
2227		2240
…		…
2340	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2353	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2341	* core dumps if they do.	2354	* core dumps if they do.
2342	*	2355	*
2343	* Add a check so we can't pick up invisible objects (0.93.8)	2356	* Add a check so we can't pick up invisible objects (0.93.8)
2344	*/	2357	*/
2345
2346	int	2358	int
2347	can_pick (const object *who, const object *item)	2359	can_pick (const object *who, const object *item)
2348	{	2360	{
2349	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2361	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2350	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2362	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2355	* create clone from object to another	2367	* create clone from object to another
2356	*/	2368	*/
2357	object *	2369	object *
2358	object_create_clone (object *asrc)	2370	object_create_clone (object *asrc)
2359	{	2371	{
2360	object *dst = 0, *tmp, *src, *part, *prev, *item;	2372	object *dst = 0, *tmp, *src, *prev, *item;
2361		2373
2362	if (!asrc)	2374	if (!asrc)
2363	return 0;	2375	return 0;
2364		2376
2365	src = asrc;
2366	if (src->head)
2367	src = src->head;	2377	src = asrc->head_ ();
2368		2378
2369	prev = 0;	2379	prev = 0;
2370	for (part = src; part; part = part->more)	2380	for (object *part = src; part; part = part->more)
2371	{	2381	{
2372	tmp = part->clone ();	2382	tmp = part->clone ();
2373	tmp->x -= src->x;	2383	tmp->x -= src->x;
2374	tmp->y -= src->y;	2384	tmp->y -= src->y;
2375		2385
…		…
2391		2401
2392	for (item = src->inv; item; item = item->below)	2402	for (item = src->inv; item; item = item->below)
2393	insert_ob_in_ob (object_create_clone (item), dst);	2403	insert_ob_in_ob (object_create_clone (item), dst);
2394		2404
2395	return dst;	2405	return dst;
2396	}
2397
2398	/* GROS - Creates an object using a string representing its content. */
2399	/* Basically, we save the content of the string to a temp file, then call */
2400	/* load_object on it. I admit it is a highly inefficient way to make things, */
2401	/* but it was simple to make and allows reusing the load_object function. */
2402	/* Remember not to use load_object_str in a time-critical situation. */
2403	/* Also remember that multiparts objects are not supported for now. */
2404	object *
2405	load_object_str (const char *obstr)
2406	{
2407	object *op;
2408	char filename[MAX_BUF];
2409
2410	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2411
2412	FILE *tempfile = fopen (filename, "w");
2413
2414	if (tempfile == NULL)
2415	{
2416	LOG (llevError, "Error - Unable to access load object temp file\n");
2417	return NULL;
2418	}
2419
2420	fprintf (tempfile, obstr);
2421	fclose (tempfile);
2422
2423	op = object::create ();
2424
2425	object_thawer thawer (filename);
2426
2427	if (thawer)
2428	load_object (thawer, op, 0);
2429
2430	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2431	CLEAR_FLAG (op, FLAG_REMOVED);
2432
2433	return op;
2434	}	2406	}
2435		2407
2436	/* This returns the first object in who's inventory that	2408	/* This returns the first object in who's inventory that
2437	* has the same type and subtype match.	2409	* has the same type and subtype match.
2438	* returns NULL if no match.	2410	* returns NULL if no match.
…		…
2493	if (link->key == canonical_key)	2465	if (link->key == canonical_key)
2494	return link->value;	2466	return link->value;
2495		2467
2496	return 0;	2468	return 0;
2497	}	2469	}
2498
2499		2470
2500	/*	2471	/*
2501	* Updates the canonical_key in op to value.	2472	* Updates the canonical_key in op to value.
2502	*	2473	*
2503	* canonical_key is a shared string (value doesn't have to be).	2474	* canonical_key is a shared string (value doesn't have to be).
…		…
2527	/* Basically, if the archetype has this key set,	2498	/* Basically, if the archetype has this key set,
2528	* we need to store the null value so when we save	2499	* we need to store the null value so when we save
2529	* it, we save the empty value so that when we load,	2500	* it, we save the empty value so that when we load,
2530	* we get this value back again.	2501	* we get this value back again.
2531	*/	2502	*/
2532	if (get_ob_key_link (&op->arch->clone, canonical_key))	2503	if (get_ob_key_link (op->arch, canonical_key))
2533	field->value = 0;	2504	field->value = 0;
2534	else	2505	else
2535	{	2506	{
2536	if (last)	2507	if (last)
2537	last->next = field->next;	2508	last->next = field->next;
…		…
2606	}	2577	}
2607	else	2578	else
2608	item = item->env;	2579	item = item->env;
2609	}	2580	}
2610		2581
2611
2612	const char *	2582	const char *
2613	object::flag_desc (char *desc, int len) const	2583	object::flag_desc (char *desc, int len) const
2614	{	2584	{
2615	char *p = desc;	2585	char *p = desc;
2616	bool first = true;	2586	bool first = true;
2617		2587
		2588	*p = 0;
		2589
2618	for (int i = 0; i < NUM_FLAGS; i++)	2590	for (int i = 0; i < NUM_FLAGS; i++)
2619	{	2591	{
2620	if (len <= 10) // magic constant!	2592	if (len <= 10) // magic constant!
2621	{	2593	{
2622	snprintf (p, len, ",...");	2594	snprintf (p, len, ",...");
2623	break;	2595	break;
2624	}	2596	}
2625		2597
2626	if (flag[i])	2598	if (flag [i])
2627	{	2599	{
2628	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);	2600	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
2629	len -= cnt;	2601	len -= cnt;
2630	p += cnt;	2602	p += cnt;
2631	first = false;	2603	first = false;
…		…
2633	}	2605	}
2634		2606
2635	return desc;	2607	return desc;
2636	}	2608	}
2637		2609
2638	// return a suitable string describing an objetc in enough detail to find it	2610	// return a suitable string describing an object in enough detail to find it
2639	const char *	2611	const char *
2640	object::debug_desc (char *info) const	2612	object::debug_desc (char *info) const
2641	{	2613	{
2642	char flagdesc[512];	2614	char flagdesc[512];
2643	char info2[256 * 4];	2615	char info2[256 * 4];
2644	char *p = info;	2616	char *p = info;
2645		2617
2646	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",	2618	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2647	count, uuid.seq,	2619	count, uuid.seq,
2648	&name,	2620	&name,
2649	title ? "\",title:" : "",	2621	title ? "\",title:\"" : "",
2650	title ? (const char *)title : "",	2622	title ? (const char *)title : "",
2651	flag_desc (flagdesc, 512), type);	2623	flag_desc (flagdesc, 512), type);
2652		2624
2653	if (env)	2625	if (!this->flag[FLAG_REMOVED] && env)
2654	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2626	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2655		2627
2656	if (map)	2628	if (map)
2657	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2629	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2658		2630
…		…
2660	}	2632	}
2661		2633
2662	const char *	2634	const char *
2663	object::debug_desc () const	2635	object::debug_desc () const
2664	{	2636	{
2665	static char info[256 * 3];	2637	static char info[3][256 * 4];
		2638	static int info_idx;
		2639
2666	return debug_desc (info);	2640	return debug_desc (info [++info_idx % 3]);
2667	}	2641	}
2668		2642
		2643	struct region *
		2644	object::region () const
		2645	{
		2646	return map ? map->region (x, y)
		2647	: region::default_region ();
		2648	}
		2649
		2650	const materialtype_t *
		2651	object::dominant_material () const
		2652	{
		2653	if (materialtype_t *mt = name_to_material (materialname))
		2654	return mt;
		2655
		2656	return name_to_material (shstr_unknown);
		2657	}
		2658
		2659	void
		2660	object::open_container (object *new_container)
		2661	{
		2662	if (container == new_container)
		2663	return;
		2664
		2665	if (object *old_container = container)
		2666	{
		2667	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2668	return;
		2669
		2670	#if 0
		2671	// remove the "Close old_container" object.
		2672	if (object *closer = old_container->inv)
		2673	if (closer->type == CLOSE_CON)
		2674	closer->destroy ();
		2675	#endif
		2676
		2677	old_container->flag [FLAG_APPLIED] = 0;
		2678	container = 0;
		2679
		2680	esrv_update_item (UPD_FLAGS, this, old_container);
		2681	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2682	play_sound (sound_find ("chest_close"));
		2683	}
		2684
		2685	if (new_container)
		2686	{
		2687	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2688	return;
		2689
		2690	// TODO: this does not seem to serve any purpose anymore?
		2691	#if 0
		2692	// insert the "Close Container" object.
		2693	if (archetype *closer = new_container->other_arch)
		2694	{
		2695	object *closer = arch_to_object (new_container->other_arch);
		2696	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2697	new_container->insert (closer);
		2698	}
		2699	#endif
		2700
		2701	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2702
		2703	new_container->flag [FLAG_APPLIED] = 1;
		2704	container = new_container;
		2705
		2706	esrv_update_item (UPD_FLAGS, this, new_container);
		2707	esrv_send_inventory (this, new_container);
		2708	play_sound (sound_find ("chest_open"));
		2709	}
		2710	}
		2711
		2712	object *
		2713	object::force_find (const shstr name)
		2714	{
		2715	/* cycle through his inventory to look for the MARK we want to
		2716	* place
		2717	*/
		2718	for (object *tmp = inv; tmp; tmp = tmp->below)
		2719	if (tmp->type == FORCE && tmp->slaying == name)
		2720	return splay (tmp);
		2721
		2722	return 0;
		2723	}
		2724
		2725	void
		2726	object::force_add (const shstr name, int duration)
		2727	{
		2728	if (object *force = force_find (name))
		2729	force->destroy ();
		2730
		2731	object *force = get_archetype (FORCE_NAME);
		2732
		2733	force->slaying = name;
		2734	force->stats.food = 1;
		2735	force->speed_left = -1.f;
		2736
		2737	force->set_speed (duration ? 1.f / duration : 0.f);
		2738	force->flag [FLAG_IS_USED_UP] = true;
		2739	force->flag [FLAG_APPLIED] = true;
		2740
		2741	insert (force);
		2742	}
		2743
		2744	void
		2745	object::play_sound (faceidx sound) const
		2746	{
		2747	if (!sound)
		2748	return;
		2749
		2750	if (flag [FLAG_REMOVED])
		2751	return;
		2752
		2753	if (env)
		2754	{
		2755	if (object *pl = in_player ())
		2756	pl->contr->play_sound (sound);
		2757	}
		2758	else
		2759	map->play_sound (sound, x, y);
		2760	}
		2761

Diff Legend

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