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.78 by root, Fri Dec 22 16:34:00 2006 UTC vs.
Revision 1.192 by root, Fri Oct 12 19:13:25 2007 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3		3	*
		4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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	* Crossfire TRT 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 at <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <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,
…		…
141	* objects with lists are rare, and lists stay short. If not, use a	143	* objects with lists are rare, and lists stay short. If not, use a
142	* different structure or at least keep the lists sorted...	144	* different structure or at least keep the lists sorted...
143	*/	145	*/
144		146
145	/* For each field in wants, */	147	/* For each field in wants, */
146	for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)	148	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)
147	{	149	{
148	key_value *has_field;	150	key_value *has_field;
149		151
150	/* Look for a field in has with the same key. */	152	/* Look for a field in has with the same key. */
151	has_field = get_ob_key_link (has, wants_field->key);	153	has_field = get_ob_key_link (has, wants_field->key);
…		…
190	* Check nrof variable *before* calling can_merge()	192	* Check nrof variable *before* calling can_merge()
191	*	193	*
192	* Improvements made with merge: Better checking on potion, and also	194	* Improvements made with merge: Better checking on potion, and also
193	* check weight	195	* check weight
194	*/	196	*/
195
196	bool object::can_merge_slow (object *ob1, object *ob2)	197	bool object::can_merge_slow (object *ob1, object *ob2)
197	{	198	{
198	/* A couple quicksanity checks */	199	/* A couple quicksanity checks */
199	if (ob1 == ob2	200	if (ob1 == ob2
200	|| ob1->type != ob2->type	201	|| ob1->type != ob2->type
…		…
221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	222	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
222		223
223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	224	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	225	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
225		226
226	if ((ob1->flags ^ ob2->flags).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	227	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
227	|| ob1->arch != ob2->arch	228	|| ob1->arch != ob2->arch
228	|| ob1->name != ob2->name	229	|| ob1->name != ob2->name
229	|| ob1->title != ob2->title	230	|| ob1->title != ob2->title
230	|| ob1->msg != ob2->msg	231	|| ob1->msg != ob2->msg
231	|| ob1->weight != ob2->weight	232	|| ob1->weight != ob2->weight
…		…
277		278
278	/* Note sure why the following is the case - either the object has to	279	/* Note sure why the following is the case - either the object has to
279	* be animated or have a very low speed. Is this an attempted monster	280	* be animated or have a very low speed. Is this an attempted monster
280	* check?	281	* check?
281	*/	282	*/
282	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	283	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
283	return 0;	284	return 0;
284		285
285	switch (ob1->type)	286	switch (ob1->type)
286	{	287	{
287	case SCROLL:	288	case SCROLL:
…		…
298	return 0;	299	return 0;
299	else if (!compare_ob_value_lists (ob1, ob2))	300	else if (!compare_ob_value_lists (ob1, ob2))
300	return 0;	301	return 0;
301	}	302	}
302		303
303	//TODO: generate an event or call into perl for additional checks
304	if (ob1->self || ob2->self)	304	if (ob1->self || ob2->self)
305	{	305	{
306	ob1->optimise ();	306	ob1->optimise ();
307	ob2->optimise ();	307	ob2->optimise ();
308		308
309	if (ob1->self || ob2->self)	309	if (ob1->self || ob2->self)
		310	{
		311	int k1 = ob1->self ? HvTOTALKEYS (SvRV (ob1->self)) : 0;
		312	int k2 = ob2->self ? HvTOTALKEYS (SvRV (ob2->self)) : 0;
		313
		314	if (k1 != k2)
310	return 0;	315	return 0;
		316	else if (k1 == 0)
		317	return 1;
		318	else if (!cfperl_can_merge (ob1, ob2))
		319	return 0;
		320	}
311	}	321	}
312		322
313	/* Everything passes, must be OK. */	323	/* Everything passes, must be OK. */
314	return 1;	324	return 1;
315	}	325	}
…		…
323	sum_weight (object *op)	333	sum_weight (object *op)
324	{	334	{
325	long sum;	335	long sum;
326	object *inv;	336	object *inv;
327		337
328	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	338	for (sum = 0, inv = op->inv; inv; inv = inv->below)
329	{	339	{
330	if (inv->inv)	340	if (inv->inv)
331	sum_weight (inv);	341	sum_weight (inv);
		342
332	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	343	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
333	}	344	}
334		345
335	if (op->type == CONTAINER && op->stats.Str)	346	if (op->type == CONTAINER && op->stats.Str)
336	sum = (sum * (100 - op->stats.Str)) / 100;	347	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
356	/*	367	/*
357	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	368	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
358	* Some error messages.	369	* Some error messages.
359	* The result of the dump is stored in the static global errmsg array.	370	* The result of the dump is stored in the static global errmsg array.
360	*/	371	*/
361
362	char *	372	char *
363	dump_object (object *op)	373	dump_object (object *op)
364	{	374	{
365	if (!op)	375	if (!op)
366	return strdup ("[NULLOBJ]");	376	return strdup ("[NULLOBJ]");
367		377
368	object_freezer freezer;	378	object_freezer freezer;
369	save_object (freezer, op, 3);	379	op->write (freezer);
370	return freezer.as_string ();	380	return freezer.as_string ();
371	}	381	}
372		382
373	/*	383	/*
374	* get_nearest_part(multi-object, object 2) returns the part of the	384	* get_nearest_part(multi-object, object 2) returns the part of the
375	* multi-object 1 which is closest to the second object.	385	* multi-object 1 which is closest to the second object.
376	* If it's not a multi-object, it is returned.	386	* If it's not a multi-object, it is returned.
377	*/	387	*/
378
379	object *	388	object *
380	get_nearest_part (object *op, const object *pl)	389	get_nearest_part (object *op, const object *pl)
381	{	390	{
382	object *tmp, *closest;	391	object *tmp, *closest;
383	int last_dist, i;	392	int last_dist, i;
…		…
391	}	400	}
392		401
393	/*	402	/*
394	* Returns the object which has the count-variable equal to the argument.	403	* Returns the object which has the count-variable equal to the argument.
395	*/	404	*/
396
397	object *	405	object *
398	find_object (tag_t i)	406	find_object (tag_t i)
399	{	407	{
400	for (object *op = object::first; op; op = op->next)	408	for_all_objects (op)
401	if (op->count == i)	409	if (op->count == i)
402	return op;	410	return op;
403		411
404	return 0;	412	return 0;
405	}	413	}
406		414
407	/*	415	/*
408	* Returns the first object which has a name equal to the argument.	416	* Returns the first object which has a name equal to the argument.
409	* Used only by the patch command, but not all that useful.	417	* Used only by the patch command, but not all that useful.
410	* Enables features like "patch <name-of-other-player> food 999"	418	* Enables features like "patch <name-of-other-player> food 999"
411	*/	419	*/
412
413	object *	420	object *
414	find_object_name (const char *str)	421	find_object_name (const char *str)
415	{	422	{
416	shstr_cmp str_ (str);	423	shstr_cmp str_ (str);
417	object *op;	424	object *op;
418		425
419	for (op = object::first; op != NULL; op = op->next)	426	for_all_objects (op)
420	if (op->name == str_)	427	if (op->name == str_)
421	break;	428	break;
422		429
423	return op;	430	return op;
424	}	431	}
…		…
430	}	437	}
431		438
432	/*	439	/*
433	* Sets the owner and sets the skill and exp pointers to owner's current	440	* Sets the owner and sets the skill and exp pointers to owner's current
434	* skill and experience objects.	441	* skill and experience objects.
		442	* ACTUALLY NO! investigate! TODO
435	*/	443	*/
436	void	444	void
437	object::set_owner (object *owner)	445	object::set_owner (object *owner)
438	{	446	{
		447	// allow objects which own objects
439	if (!owner)	448	if (owner)
440	return;
441
442	/* next line added to allow objects which own objects */
443	/* Add a check for ownercounts in here, as I got into an endless loop
444	* with the fireball owning a poison cloud which then owned the
445	* fireball. I believe that was caused by one of the objects getting
446	* freed and then another object replacing it. Since the ownercounts
447	* didn't match, this check is valid and I believe that cause is valid.
448	*/
449	while (owner->owner)	449	while (owner->owner)
450	owner = owner->owner;	450	owner = owner->owner;
451		451
452	this->owner = owner;	452	this->owner = owner;
		453	}
		454
		455	int
		456	object::slottype () const
		457	{
		458	if (type == SKILL)
		459	{
		460	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		461	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		462	}
		463	else
		464	{
		465	if (slot [body_combat].info) return slot_combat;
		466	if (slot [body_range ].info) return slot_ranged;
		467	}
		468
		469	return slot_none;
		470	}
		471
		472	bool
		473	object::change_weapon (object *ob)
		474	{
		475	if (current_weapon == ob)
		476	return true;
		477
		478	if (chosen_skill)
		479	chosen_skill->flag [FLAG_APPLIED] = false;
		480
		481	current_weapon = ob;
		482	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		483
		484	if (chosen_skill)
		485	chosen_skill->flag [FLAG_APPLIED] = true;
		486
		487	update_stats ();
		488
		489	if (ob)
		490	{
		491	// now check wether any body locations became invalid, in which case
		492	// we cannot apply the weapon at the moment.
		493	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		494	if (slot[i].used < 0)
		495	{
		496	current_weapon = chosen_skill = 0;
		497	update_stats ();
		498
		499	new_draw_info_format (NDI_UNIQUE, 0, this,
		500	"You try to balance all your items at once, "
		501	"but the %s is just too much for your body. "
		502	"[You need to unapply some items first.]", &ob->name);
		503	return false;
		504	}
		505
		506	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		507	}
		508	else
		509	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		510
		511	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		512	{
		513	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		514	&name, ob->debug_desc ());
		515	return false;
		516	}
		517
		518	return true;
453	}	519	}
454		520
455	/* Zero the key_values on op, decrementing the shared-string	521	/* Zero the key_values on op, decrementing the shared-string
456	* refcounts and freeing the links.	522	* refcounts and freeing the links.
457	*/	523	*/
458	static void	524	static void
459	free_key_values (object *op)	525	free_key_values (object *op)
460	{	526	{
461	for (key_value *i = op->key_values; i != 0;)	527	for (key_value *i = op->key_values; i; )
462	{	528	{
463	key_value *next = i->next;	529	key_value *next = i->next;
464	delete i;	530	delete i;
465		531
466	i = next;	532	i = next;
467	}	533	}
468		534
469	op->key_values = 0;	535	op->key_values = 0;
470	}	536	}
471		537
472	/*	538	object &
473	* copy_to first frees everything allocated by the dst object,	539	object::operator =(const object &src)
474	* and then copies the contents of itself into the second
475	* object, allocating what needs to be allocated. Basically, any
476	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
477	* if the first object is freed, the pointers in the new object
478	* will point at garbage.
479	*/
480	void
481	object::copy_to (object *dst)
482	{	540	{
483	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	541	bool is_freed = flag [FLAG_FREED];
484	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	542	bool is_removed = flag [FLAG_REMOVED];
485		543
486	*(object_copy *)dst = *this;	544	*(object_copy *)this = src;
487	*(object_pod *)dst = *this;
488		545
489	if (self || cb)	546	flag [FLAG_FREED] = is_freed;
490	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst));	547	flag [FLAG_REMOVED] = is_removed;
491
492	if (is_freed)
493	SET_FLAG (dst, FLAG_FREED);
494
495	if (is_removed)
496	SET_FLAG (dst, FLAG_REMOVED);
497
498	if (speed < 0)
499	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
500		548
501	/* Copy over key_values, if any. */	549	/* Copy over key_values, if any. */
502	if (key_values)	550	if (src.key_values)
503	{	551	{
504	key_value *tail = 0;	552	key_value *tail = 0;
505	key_value *i;
506
507	dst->key_values = 0;	553	key_values = 0;
508		554
509	for (i = key_values; i; i = i->next)	555	for (key_value *i = src.key_values; i; i = i->next)
510	{	556	{
511	key_value *new_link = new key_value;	557	key_value *new_link = new key_value;
512		558
513	new_link->next = 0;	559	new_link->next = 0;
514	new_link->key = i->key;	560	new_link->key = i->key;
515	new_link->value = i->value;	561	new_link->value = i->value;
516		562
517	/* Try and be clever here, too. */	563	/* Try and be clever here, too. */
518	if (!dst->key_values)	564	if (!key_values)
519	{	565	{
520	dst->key_values = new_link;	566	key_values = new_link;
521	tail = new_link;	567	tail = new_link;
522	}	568	}
523	else	569	else
524	{	570	{
525	tail->next = new_link;	571	tail->next = new_link;
526	tail = new_link;	572	tail = new_link;
527	}	573	}
528	}	574	}
529	}	575	}
		576	}
530		577
531	update_ob_speed (dst);	578	/*
		579	* copy_to first frees everything allocated by the dst object,
		580	* and then copies the contents of itself into the second
		581	* object, allocating what needs to be allocated. Basically, any
		582	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		583	* if the first object is freed, the pointers in the new object
		584	* will point at garbage.
		585	*/
		586	void
		587	object::copy_to (object *dst)
		588	{
		589	*dst = *this;
		590
		591	if (speed < 0)
		592	dst->speed_left -= rndm ();
		593
		594	dst->set_speed (dst->speed);
		595	}
		596
		597	void
		598	object::instantiate ()
		599	{
		600	if (!uuid.seq) // HACK
		601	uuid = gen_uuid ();
		602
		603	speed_left = -0.1f;
		604	/* copy the body_info to the body_used - this is only really
		605	* need for monsters, but doesn't hurt to do it for everything.
		606	* by doing so, when a monster is created, it has good starting
		607	* values for the body_used info, so when items are created
		608	* for it, they can be properly equipped.
		609	*/
		610	for (int i = NUM_BODY_LOCATIONS; i--; )
		611	slot[i].used = slot[i].info;
		612
		613	attachable::instantiate ();
532	}	614	}
533		615
534	object *	616	object *
535	object::clone ()	617	object::clone ()
536	{	618	{
…		…
542	/*	624	/*
543	* If an object with the IS_TURNABLE() flag needs to be turned due	625	* If an object with the IS_TURNABLE() flag needs to be turned due
544	* to the closest player being on the other side, this function can	626	* to the closest player being on the other side, this function can
545	* be called to update the face variable, _and_ how it looks on the map.	627	* be called to update the face variable, _and_ how it looks on the map.
546	*/	628	*/
547
548	void	629	void
549	update_turn_face (object *op)	630	update_turn_face (object *op)
550	{	631	{
551	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	632	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
552	return;	633	return;
		634
553	SET_ANIMATION (op, op->direction);	635	SET_ANIMATION (op, op->direction);
554	update_object (op, UP_OBJ_FACE);	636	update_object (op, UP_OBJ_FACE);
555	}	637	}
556		638
557	/*	639	/*
558	* Updates the speed of an object. If the speed changes from 0 to another	640	* Updates the speed of an object. If the speed changes from 0 to another
559	* value, or vice versa, then add/remove the object from the active list.	641	* value, or vice versa, then add/remove the object from the active list.
560	* This function needs to be called whenever the speed of an object changes.	642	* This function needs to be called whenever the speed of an object changes.
561	*/	643	*/
562	void	644	void
563	update_ob_speed (object *op)	645	object::set_speed (float speed)
564	{	646	{
565	extern int arch_init;	647	if (flag [FLAG_FREED] && speed)
566
567	/* No reason putting the archetypes objects on the speed list,
568	* since they never really need to be updated.
569	*/
570
571	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
572	{	648	{
573	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	649	LOG (llevError, "Object %s is freed but has speed.\n", &name);
574	#ifdef MANY_CORES
575	abort ();
576	#else
577	op->speed = 0;	650	speed = 0;
578	#endif
579	}
580
581	if (arch_init)
582	return;
583
584	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
585	{	651	}
586	/* If already on active list, don't do anything */
587	if (op->active_next || op->active_prev || op == active_objects)
588	return;
589		652
590	/* process_events() expects us to insert the object at the beginning	653	this->speed = speed;
591	* of the list. */
592	op->active_next = active_objects;
593		654
594	if (op->active_next != NULL)	655	if (has_active_speed ())
595	op->active_next->active_prev = op;	656	activate ();
596
597	active_objects = op;
598	}
599	else	657	else
600	{	658	deactivate ();
601	/* If not on the active list, nothing needs to be done */
602	if (!op->active_next && !op->active_prev && op != active_objects)
603	return;
604
605	if (op->active_prev == NULL)
606	{
607	active_objects = op->active_next;
608
609	if (op->active_next != NULL)
610	op->active_next->active_prev = NULL;
611	}
612	else
613	{
614	op->active_prev->active_next = op->active_next;
615
616	if (op->active_next)
617	op->active_next->active_prev = op->active_prev;
618	}
619
620	op->active_next = NULL;
621	op->active_prev = NULL;
622	}
623	}
624
625	/* This function removes object 'op' from the list of active
626	* objects.
627	* This should only be used for style maps or other such
628	* reference maps where you don't want an object that isn't
629	* in play chewing up cpu time getting processed.
630	* The reverse of this is to call update_ob_speed, which
631	* will do the right thing based on the speed of the object.
632	*/
633	void
634	remove_from_active_list (object *op)
635	{
636	/* If not on the active list, nothing needs to be done */
637	if (!op->active_next && !op->active_prev && op != active_objects)
638	return;
639
640	if (op->active_prev == NULL)
641	{
642	active_objects = op->active_next;
643	if (op->active_next != NULL)
644	op->active_next->active_prev = NULL;
645	}
646	else
647	{
648	op->active_prev->active_next = op->active_next;
649	if (op->active_next)
650	op->active_next->active_prev = op->active_prev;
651	}
652	op->active_next = NULL;
653	op->active_prev = NULL;
654	}	659	}
655		660
656	/*	661	/*
657	* update_object() updates the the map.	662	* update_object() updates the the map.
658	* It takes into account invisible objects (and represent squares covered	663	* It takes into account invisible objects (and represent squares covered
…		…
671	* UP_OBJ_FACE: only the objects face has changed.	676	* UP_OBJ_FACE: only the objects face has changed.
672	*/	677	*/
673	void	678	void
674	update_object (object *op, int action)	679	update_object (object *op, int action)
675	{	680	{
676	MoveType move_on, move_off, move_block, move_slow;
677
678	if (op == NULL)	681	if (op == NULL)
679	{	682	{
680	/* this should never happen */	683	/* this should never happen */
681	LOG (llevDebug, "update_object() called for NULL object.\n");	684	LOG (llevDebug, "update_object() called for NULL object.\n");
682	return;	685	return;
…		…
695	*/	698	*/
696	if (!op->map || op->map->in_memory == MAP_SAVING)	699	if (!op->map || op->map->in_memory == MAP_SAVING)
697	return;	700	return;
698		701
699	/* make sure the object is within map boundaries */	702	/* make sure the object is within map boundaries */
700	if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))	703	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
701	{	704	{
702	LOG (llevError, "update_object() called for object out of map!\n");	705	LOG (llevError, "update_object() called for object out of map!\n");
703	#ifdef MANY_CORES	706	#ifdef MANY_CORES
704	abort ();	707	abort ();
705	#endif	708	#endif
706	return;	709	return;
707	}	710	}
708		711
709	mapspace &m = op->ms ();	712	mapspace &m = op->ms ();
710		713
711	if (m.flags_ & P_NEED_UPDATE)	714	if (!(m.flags_ & P_UPTODATE))
712	/* nop */;	715	/* nop */;
713	else if (action == UP_OBJ_INSERT)	716	else if (action == UP_OBJ_INSERT)
714	{	717	{
715	// this is likely overkill, TODO: revisit (schmorp)	718	// this is likely overkill, TODO: revisit (schmorp)
716	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	719	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
…		…
725	/* This isn't perfect, but I don't expect a lot of objects to	728	/* This isn't perfect, but I don't expect a lot of objects to
726	* to have move_allow right now.	729	* to have move_allow right now.
727	*/	730	*/
728	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	731	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
729	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	732	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
730	m.flags_ = P_NEED_UPDATE;	733	m.flags_ = 0;
731	}	734	}
732	/* if the object is being removed, we can't make intelligent	735	/* if the object is being removed, we can't make intelligent
733	* decisions, because remove_ob can't really pass the object	736	* decisions, because remove_ob can't really pass the object
734	* that is being removed.	737	* that is being removed.
735	*/	738	*/
736	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	739	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
737	m.flags_ = P_NEED_UPDATE;	740	m.flags_ = 0;
738	else if (action == UP_OBJ_FACE)	741	else if (action == UP_OBJ_FACE)
739	/* Nothing to do for that case */ ;	742	/* Nothing to do for that case */ ;
740	else	743	else
741	LOG (llevError, "update_object called with invalid action: %d\n", action);	744	LOG (llevError, "update_object called with invalid action: %d\n", action);
742		745
743	if (op->more)	746	if (op->more)
744	update_object (op->more, action);	747	update_object (op->more, action);
745	}	748	}
746		749
747	object::vector object::mortals;
748	object::vector object::objects; // not yet used
749	object *object::first;
750
751	void object::free_mortals ()
752	{
753	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
754	if ((*i)->refcnt)
755	++i; // further delay freeing
756	else
757	{
758	delete *i;
759	mortals.erase (i);
760	}
761	}
762
763	object::object ()	750	object::object ()
764	{	751	{
765	SET_FLAG (this, FLAG_REMOVED);	752	SET_FLAG (this, FLAG_REMOVED);
766		753
767	expmul = 1.0;	754	expmul = 1.0;
768	face = blank_face;	755	face = blank_face;
769	}	756	}
770		757
771	object::~object ()	758	object::~object ()
772	{	759	{
		760	unlink ();
		761
773	free_key_values (this);	762	free_key_values (this);
774	}	763	}
775		764
		765	static int object_count;
		766
776	void object::link ()	767	void object::link ()
777	{	768	{
778	count = ++ob_count;	769	assert (!index);//D
779	uuid = gen_uuid ();	770	uuid = gen_uuid ();
		771	count = ++object_count;
780		772
781	prev = 0;	773	refcnt_inc ();
782	next = object::first;	774	objects.insert (this);
783
784	if (object::first)
785	object::first->prev = this;
786
787	object::first = this;
788	}	775	}
789		776
790	void object::unlink ()	777	void object::unlink ()
791	{	778	{
792	if (this == object::first)	779	if (!index)
793	object::first = next;	780	return;
794		781
795	/* Remove this object from the list of used objects */	782	objects.erase (this);
796	if (prev) prev->next = next;	783	refcnt_dec ();
797	if (next) next->prev = prev;	784	}
798		785
799	prev = 0;	786	void
800	next = 0;	787	object::activate ()
		788	{
		789	/* If already on active list, don't do anything */
		790	if (active)
		791	return;
		792
		793	if (has_active_speed ())
		794	actives.insert (this);
		795	}
		796
		797	void
		798	object::activate_recursive ()
		799	{
		800	activate ();
		801
		802	for (object *op = inv; op; op = op->below)
		803	op->activate_recursive ();
		804	}
		805
		806	/* This function removes object 'op' from the list of active
		807	* objects.
		808	* This should only be used for style maps or other such
		809	* reference maps where you don't want an object that isn't
		810	* in play chewing up cpu time getting processed.
		811	* The reverse of this is to call update_ob_speed, which
		812	* will do the right thing based on the speed of the object.
		813	*/
		814	void
		815	object::deactivate ()
		816	{
		817	/* If not on the active list, nothing needs to be done */
		818	if (!active)
		819	return;
		820
		821	actives.erase (this);
		822	}
		823
		824	void
		825	object::deactivate_recursive ()
		826	{
		827	for (object *op = inv; op; op = op->below)
		828	op->deactivate_recursive ();
		829
		830	deactivate ();
		831	}
		832
		833	void
		834	object::set_flag_inv (int flag, int value)
		835	{
		836	for (object *op = inv; op; op = op->below)
		837	{
		838	op->flag [flag] = value;
		839	op->set_flag_inv (flag, value);
		840	}
		841	}
		842
		843	/*
		844	* Remove and free all objects in the inventory of the given object.
		845	* object.c ?
		846	*/
		847	void
		848	object::destroy_inv (bool drop_to_ground)
		849	{
		850	// need to check first, because the checks below might segfault
		851	// as we might be on an invalid mapspace and crossfire code
		852	// is too buggy to ensure that the inventory is empty.
		853	// corollary: if you create arrows etc. with stuff in tis inventory,
		854	// cf will crash below with off-map x and y
		855	if (!inv)
		856	return;
		857
		858	/* Only if the space blocks everything do we not process -
		859	* if some form of movement is allowed, let objects
		860	* drop on that space.
		861	*/
		862	if (!drop_to_ground
		863	|| !map
		864	|| map->in_memory != MAP_IN_MEMORY
		865	|| map->nodrop
		866	|| ms ().move_block == MOVE_ALL)
		867	{
		868	while (inv)
		869	{
		870	inv->destroy_inv (drop_to_ground);
		871	inv->destroy ();
		872	}
		873	}
		874	else
		875	{ /* Put objects in inventory onto this space */
		876	while (inv)
		877	{
		878	object *op = inv;
		879
		880	if (op->flag [FLAG_STARTEQUIP]
		881	|| op->flag [FLAG_NO_DROP]
		882	|| op->type == RUNE
		883	|| op->type == TRAP
		884	|| op->flag [FLAG_IS_A_TEMPLATE]
		885	|| op->flag [FLAG_DESTROY_ON_DEATH])
		886	op->destroy ();
		887	else
		888	map->insert (op, x, y);
		889	}
		890	}
801	}	891	}
802		892
803	object *object::create ()	893	object *object::create ()
804	{	894	{
805	object *op = new object;	895	object *op = new object;
806	op->link ();	896	op->link ();
807	return op;	897	return op;
808	}	898	}
809		899
810	/*	900	void
811	* free_object() frees everything allocated by an object, removes	901	object::do_destroy ()
812	* it from the list of used objects, and puts it on the list of
813	* free objects. The IS_FREED() flag is set in the object.
814	* The object must have been removed by remove_ob() first for
815	* this function to succeed.
816	*
817	* If destroy_inventory is set, free inventory as well. Else drop items in
818	* inventory to the ground.
819	*/
820	void object::destroy (bool destroy_inventory)
821	{	902	{
822	if (QUERY_FLAG (this, FLAG_FREED))	903	attachable::do_destroy ();
823	return;
824		904
825	if (QUERY_FLAG (this, FLAG_FRIENDLY))	905	if (flag [FLAG_IS_LINKED])
		906	remove_button_link (this);
		907
		908	if (flag [FLAG_FRIENDLY])
826	remove_friendly_object (this);	909	remove_friendly_object (this);
827		910
828	if (!QUERY_FLAG (this, FLAG_REMOVED))	911	if (!flag [FLAG_REMOVED])
829	remove ();	912	remove ();
830		913
831	SET_FLAG (this, FLAG_FREED);	914	destroy_inv (true);
832		915
833	if (more)	916	deactivate ();
834	{	917	unlink ();
835	more->destroy (destroy_inventory);
836	more = 0;
837	}
838		918
839	if (inv)	919	flag [FLAG_FREED] = 1;
840	{
841	/* Only if the space blocks everything do we not process -
842	* if some form of movement is allowed, let objects
843	* drop on that space.
844	*/
845	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
846	{
847	object *op = inv;
848
849	while (op)
850	{
851	object *tmp = op->below;
852	op->destroy (destroy_inventory);
853	op = tmp;
854	}
855	}
856	else
857	{ /* Put objects in inventory onto this space */
858	object *op = inv;
859
860	while (op)
861	{
862	object *tmp = op->below;
863
864	op->remove ();
865
866	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
867	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
868	op->destroy ();
869	else
870	{
871	op->x = x;
872	op->y = y;
873	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
874	}
875
876	op = tmp;
877	}
878	}
879	}
880		920
881	// hack to ensure that freed objects still have a valid map	921	// hack to ensure that freed objects still have a valid map
882	{	922	{
883	static maptile *freed_map; // freed objects are moved here to avoid crashes	923	static maptile *freed_map; // freed objects are moved here to avoid crashes
884		924
885	if (!freed_map)	925	if (!freed_map)
886	{	926	{
887	freed_map = new maptile;	927	freed_map = new maptile;
888		928
		929	freed_map->path = "<freed objects map>";
889	freed_map->name = "/internal/freed_objects_map";	930	freed_map->name = "/internal/freed_objects_map";
890	freed_map->width = 3;	931	freed_map->width = 3;
891	freed_map->height = 3;	932	freed_map->height = 3;
892		933
893	freed_map->allocate ();	934	freed_map->alloc ();
		935	freed_map->in_memory = MAP_IN_MEMORY;
894	}	936	}
895		937
896	map = freed_map;	938	map = freed_map;
897	x = 1;	939	x = 1;
898	y = 1;	940	y = 1;
899	}	941	}
900		942
		943	if (more)
		944	{
		945	more->destroy ();
		946	more = 0;
		947	}
		948
		949	head = 0;
		950
901	// clear those pointers that likely might have circular references to us	951	// clear those pointers that likely might cause circular references
902	owner = 0;	952	owner = 0;
903	enemy = 0;	953	enemy = 0;
904	attacked_by = 0;	954	attacked_by = 0;
		955	current_weapon = 0;
		956	}
905		957
906	// only relevant for players(?), but make sure of it anyways	958	void
907	contr = 0;	959	object::destroy (bool destroy_inventory)
		960	{
		961	if (destroyed ())
		962	return;
908		963
909	/* Remove object from the active list */	964	if (destroy_inventory)
910	speed = 0;	965	destroy_inv (false);
911	update_ob_speed (this);
912		966
913	unlink ();	967	if (is_head ())
		968	if (sound_destroy)
		969	play_sound (sound_destroy);
		970	else if (flag [FLAG_MONSTER])
		971	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
914		972
915	mortals.push_back (this);	973	attachable::destroy ();
916	}	974	}
917		975
918	/*	976	/*
919	* sub_weight() recursively (outwards) subtracts a number from the	977	* sub_weight() recursively (outwards) subtracts a number from the
920	* weight of an object (and what is carried by it's environment(s)).	978	* weight of an object (and what is carried by it's environment(s)).
…		…
936	* This function removes the object op from the linked list of objects	994	* This function removes the object op from the linked list of objects
937	* which it is currently tied to. When this function is done, the	995	* which it is currently tied to. When this function is done, the
938	* object will have no environment. If the object previously had an	996	* object will have no environment. If the object previously had an
939	* environment, the x and y coordinates will be updated to	997	* environment, the x and y coordinates will be updated to
940	* the previous environment.	998	* the previous environment.
941	* Beware: This function is called from the editor as well!
942	*/	999	*/
943	void	1000	void
944	object::remove ()	1001	object::do_remove ()
945	{	1002	{
946	object *tmp, *last = 0;	1003	object *tmp, *last = 0;
947	object *otmp;	1004	object *otmp;
948		1005
949	int check_walk_off;
950
951	if (QUERY_FLAG (this, FLAG_REMOVED))	1006	if (QUERY_FLAG (this, FLAG_REMOVED))
952	return;	1007	return;
953		1008
954	SET_FLAG (this, FLAG_REMOVED);	1009	SET_FLAG (this, FLAG_REMOVED);
		1010	INVOKE_OBJECT (REMOVE, this);
955		1011
956	if (more)	1012	if (more)
957	more->remove ();	1013	more->remove ();
958		1014
959	/*	1015	/*
…		…
972	* to save cpu time.	1028	* to save cpu time.
973	*/	1029	*/
974	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1030	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
975	otmp->update_stats ();	1031	otmp->update_stats ();
976		1032
977	if (above != NULL)	1033	if (above)
978	above->below = below;	1034	above->below = below;
979	else	1035	else
980	env->inv = below;	1036	env->inv = below;
981		1037
982	if (below != NULL)	1038	if (below)
983	below->above = above;	1039	below->above = above;
984		1040
985	/* we set up values so that it could be inserted into	1041	/* we set up values so that it could be inserted into
986	* the map, but we don't actually do that - it is up	1042	* the map, but we don't actually do that - it is up
987	* to the caller to decide what we want to do.	1043	* to the caller to decide what we want to do.
…		…
991	above = 0, below = 0;	1047	above = 0, below = 0;
992	env = 0;	1048	env = 0;
993	}	1049	}
994	else if (map)	1050	else if (map)
995	{	1051	{
996	/* Re did the following section of code - it looks like it had	1052	if (type == PLAYER)
997	* lots of logic for things we no longer care about
998	*/	1053	{
		1054	// leaving a spot always closes any open container on the ground
		1055	if (container && !container->env)
		1056	// this causes spurious floorbox updates, but it ensures
		1057	// that the CLOSE event is being sent.
		1058	close_container ();
		1059
		1060	--map->players;
		1061	map->touch ();
		1062	}
		1063
		1064	map->dirty = true;
		1065	mapspace &ms = this->ms ();
999		1066
1000	/* link the object above us */	1067	/* link the object above us */
1001	if (above)	1068	if (above)
1002	above->below = below;	1069	above->below = below;
1003	else	1070	else
1004	map->at (x, y).top = below; /* we were top, set new top */	1071	ms.top = below; /* we were top, set new top */
1005		1072
1006	/* Relink the object below us, if there is one */	1073	/* Relink the object below us, if there is one */
1007	if (below)	1074	if (below)
1008	below->above = above;	1075	below->above = above;
1009	else	1076	else
…		…
1011	/* Nothing below, which means we need to relink map object for this space	1078	/* Nothing below, which means we need to relink map object for this space
1012	* use translated coordinates in case some oddness with map tiling is	1079	* use translated coordinates in case some oddness with map tiling is
1013	* evident	1080	* evident
1014	*/	1081	*/
1015	if (GET_MAP_OB (map, x, y) != this)	1082	if (GET_MAP_OB (map, x, y) != this)
1016	{
1017	char *dump = dump_object (this);
1018	LOG (llevError,
1019	"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);	1083	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 ());
1020	free (dump);
1021	dump = dump_object (GET_MAP_OB (map, x, y));
1022	LOG (llevError, "%s\n", dump);
1023	free (dump);
1024	}
1025		1084
1026	map->at (x, y).bottom = above; /* goes on above it. */	1085	ms.bot = above; /* goes on above it. */
1027	}	1086	}
1028		1087
1029	above = 0;	1088	above = 0;
1030	below = 0;	1089	below = 0;
1031		1090
1032	if (map->in_memory == MAP_SAVING)	1091	if (map->in_memory == MAP_SAVING)
1033	return;	1092	return;
1034		1093
1035	check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);	1094	int check_walk_off = !flag [FLAG_NO_APPLY];
1036		1095
		1096	if (object *pl = ms.player ())
		1097	{
		1098	if (pl->container == this)
		1099	/* If a container that the player is currently using somehow gets
		1100	* removed (most likely destroyed), update the player view
		1101	* appropriately.
		1102	*/
		1103	pl->close_container ();
		1104
		1105	pl->contr->ns->floorbox_update ();
		1106	}
		1107
1037	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	1108	for (tmp = ms.bot; tmp; tmp = tmp->above)
1038	{	1109	{
1039	/* No point updating the players look faces if he is the object	1110	/* No point updating the players look faces if he is the object
1040	* being removed.	1111	* being removed.
1041	*/	1112	*/
1042		1113
1043	if (tmp->type == PLAYER && tmp != this)
1044	{
1045	/* If a container that the player is currently using somehow gets
1046	* removed (most likely destroyed), update the player view
1047	* appropriately.
1048	*/
1049	if (tmp->container == this)
1050	{
1051	CLEAR_FLAG (this, FLAG_APPLIED);
1052	tmp->container = 0;
1053	}
1054
1055	tmp->contr->ns->floorbox_update ();
1056	}
1057
1058	/* See if player moving off should effect something */	1114	/* See if object moving off should effect something */
1059	if (check_walk_off	1115	if (check_walk_off
1060	&& ((move_type & tmp->move_off)	1116	&& ((move_type & tmp->move_off)
1061	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1117	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1062	{	1118	{
1063	move_apply (tmp, this, 0);	1119	move_apply (tmp, this, 0);
1064		1120
1065	if (destroyed ())	1121	if (destroyed ())
1066	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1122	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1067	}	1123	}
1068		1124
1069	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1070
1071	if (tmp->above == tmp)
1072	tmp->above = 0;
1073
1074	last = tmp;	1125	last = tmp;
1075	}	1126	}
1076		1127
1077	/* last == NULL of there are no objects on this space */	1128	/* last == NULL if there are no objects on this space */
		1129	//TODO: this makes little sense, why only update the topmost object?
1078	if (!last)	1130	if (!last)
1079	map->at (x, y).flags_ = P_NEED_UPDATE;	1131	map->at (x, y).flags_ = 0;
1080	else	1132	else
1081	update_object (last, UP_OBJ_REMOVE);	1133	update_object (last, UP_OBJ_REMOVE);
1082		1134
1083	if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)	1135	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1084	update_all_los (map, x, y);	1136	update_all_los (map, x, y);
1085	}	1137	}
1086	}	1138	}
1087		1139
1088	/*	1140	/*
…		…
1097	merge_ob (object *op, object *top)	1149	merge_ob (object *op, object *top)
1098	{	1150	{
1099	if (!op->nrof)	1151	if (!op->nrof)
1100	return 0;	1152	return 0;
1101		1153
1102	if (top == NULL)	1154	if (top)
1103	for (top = op; top != NULL && top->above != NULL; top = top->above);	1155	for (top = op; top && top->above; top = top->above)
		1156	;
1104		1157
1105	for (; top != NULL; top = top->below)	1158	for (; top; top = top->below)
1106	{	1159	{
1107	if (top == op)	1160	if (top == op)
1108	continue;	1161	continue;
1109		1162
1110	if (object::can_merge (op, top))	1163	if (object::can_merge (op, top))
…		…
1119	}	1172	}
1120		1173
1121	return 0;	1174	return 0;
1122	}	1175	}
1123		1176
		1177	void
		1178	object::expand_tail ()
		1179	{
		1180	if (more)
		1181	return;
		1182
		1183	object *prev = this;
		1184
		1185	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1186	{
		1187	object *op = arch_to_object (at);
		1188
		1189	op->name = name;
		1190	op->name_pl = name_pl;
		1191	op->title = title;
		1192
		1193	op->head = this;
		1194	prev->more = op;
		1195
		1196	prev = op;
		1197	}
		1198	}
		1199
1124	/*	1200	/*
1125	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1201	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1126	* job preparing multi-part monsters	1202	* job preparing multi-part monsters.
1127	*/	1203	*/
1128	object *	1204	object *
1129	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1205	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1130	{	1206	{
1131	object *tmp;
1132
1133	if (op->head)
1134	op = op->head;
1135
1136	for (tmp = op; tmp; tmp = tmp->more)	1207	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1137	{	1208	{
1138	tmp->x = x + tmp->arch->clone.x;	1209	tmp->x = x + tmp->arch->x;
1139	tmp->y = y + tmp->arch->clone.y;	1210	tmp->y = y + tmp->arch->y;
1140	}	1211	}
1141		1212
1142	return insert_ob_in_map (op, m, originator, flag);	1213	return insert_ob_in_map (op, m, originator, flag);
1143	}	1214	}
1144		1215
…		…
1160	* Return value:	1231	* Return value:
1161	* new object if 'op' was merged with other object	1232	* new object if 'op' was merged with other object
1162	* NULL if 'op' was destroyed	1233	* NULL if 'op' was destroyed
1163	* just 'op' otherwise	1234	* just 'op' otherwise
1164	*/	1235	*/
1165
1166	object *	1236	object *
1167	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1237	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1168	{	1238	{
		1239	assert (!op->flag [FLAG_FREED]);
		1240
1169	object *tmp, *top, *floor = NULL;	1241	object *top, *floor = NULL;
1170	sint16 x, y;
1171		1242
1172	if (QUERY_FLAG (op, FLAG_FREED))	1243	op->remove ();
1173	{
1174	LOG (llevError, "Trying to insert freed object!\n");
1175	return NULL;
1176	}
1177
1178	if (m == NULL)
1179	{
1180	char *dump = dump_object (op);
1181	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1182	free (dump);
1183	return op;
1184	}
1185
1186	if (out_of_map (m, op->x, op->y))
1187	{
1188	char *dump = dump_object (op);
1189	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1190	#ifdef MANY_CORES
1191	/* Better to catch this here, as otherwise the next use of this object
1192	* is likely to cause a crash. Better to find out where it is getting
1193	* improperly inserted.
1194	*/
1195	abort ();
1196	#endif
1197	free (dump);
1198	return op;
1199	}
1200
1201	if (!QUERY_FLAG (op, FLAG_REMOVED))
1202	{
1203	char *dump = dump_object (op);
1204	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1205	free (dump);
1206	return op;
1207	}
1208
1209	if (op->more != NULL)
1210	{
1211	/* The part may be on a different map. */
1212
1213	object *more = op->more;
1214
1215	/* We really need the caller to normalize coordinates - if
1216	* we set the map, that doesn't work if the location is within
1217	* a map and this is straddling an edge. So only if coordinate
1218	* is clear wrong do we normalize it.
1219	*/
1220	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1221	more->map = get_map_from_coord (m, &more->x, &more->y);
1222	else if (!more->map)
1223	{
1224	/* For backwards compatibility - when not dealing with tiled maps,
1225	* more->map should always point to the parent.
1226	*/
1227	more->map = m;
1228	}
1229
1230	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1231	{
1232	if (!op->head)
1233	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1234
1235	return NULL;
1236	}
1237	}
1238
1239	CLEAR_FLAG (op, FLAG_REMOVED);
1240		1244
1241	/* Ideally, the caller figures this out. However, it complicates a lot	1245	/* Ideally, the caller figures this out. However, it complicates a lot
1242	* of areas of callers (eg, anything that uses find_free_spot would now	1246	* of areas of callers (eg, anything that uses find_free_spot would now
1243	* need extra work	1247	* need extra work
1244	*/	1248	*/
1245	op->map = get_map_from_coord (m, &op->x, &op->y);	1249	if (!xy_normalise (m, op->x, op->y))
1246	x = op->x;	1250	{
1247	y = op->y;	1251	op->destroy ();
		1252	return 0;
		1253	}
		1254
		1255	if (object *more = op->more)
		1256	if (!insert_ob_in_map (more, m, originator, flag))
		1257	return 0;
		1258
		1259	CLEAR_FLAG (op, FLAG_REMOVED);
		1260
		1261	op->map = m;
		1262	mapspace &ms = op->ms ();
1248		1263
1249	/* this has to be done after we translate the coordinates.	1264	/* this has to be done after we translate the coordinates.
1250	*/	1265	*/
1251	if (op->nrof && !(flag & INS_NO_MERGE))	1266	if (op->nrof && !(flag & INS_NO_MERGE))
1252	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1267	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1253	if (object::can_merge (op, tmp))	1268	if (object::can_merge (op, tmp))
1254	{	1269	{
1255	op->nrof += tmp->nrof;	1270	op->nrof += tmp->nrof;
1256	tmp->destroy ();	1271	tmp->destroy ();
1257	}	1272	}
…		…
1274	op->below = originator->below;	1289	op->below = originator->below;
1275		1290
1276	if (op->below)	1291	if (op->below)
1277	op->below->above = op;	1292	op->below->above = op;
1278	else	1293	else
1279	op->ms ().bottom = op;	1294	ms.bot = op;
1280		1295
1281	/* since *below* originator, no need to update top */	1296	/* since *below* originator, no need to update top */
1282	originator->below = op;	1297	originator->below = op;
1283	}	1298	}
1284	else	1299	else
1285	{	1300	{
		1301	top = ms.bot;
		1302
1286	/* If there are other objects, then */	1303	/* If there are other objects, then */
1287	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1304	if (top)
1288	{	1305	{
1289	object *last = NULL;	1306	object *last = 0;
1290		1307
1291	/*	1308	/*
1292	* If there are multiple objects on this space, we do some trickier handling.	1309	* If there are multiple objects on this space, we do some trickier handling.
1293	* We've already dealt with merging if appropriate.	1310	* We've already dealt with merging if appropriate.
1294	* Generally, we want to put the new object on top. But if	1311	* Generally, we want to put the new object on top. But if
…		…
1298	* once we get to them. This reduces the need to traverse over all of	1315	* once we get to them. This reduces the need to traverse over all of
1299	* them when adding another one - this saves quite a bit of cpu time	1316	* them when adding another one - this saves quite a bit of cpu time
1300	* when lots of spells are cast in one area. Currently, it is presumed	1317	* when lots of spells are cast in one area. Currently, it is presumed
1301	* that flying non pickable objects are spell objects.	1318	* that flying non pickable objects are spell objects.
1302	*/	1319	*/
1303		1320	for (top = ms.bot; top; top = top->above)
1304	while (top != NULL)
1305	{	1321	{
1306	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1322	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1307	floor = top;	1323	floor = top;
1308		1324
1309	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1325	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1312	top = top->below;	1328	top = top->below;
1313	break;	1329	break;
1314	}	1330	}
1315		1331
1316	last = top;	1332	last = top;
1317	top = top->above;
1318	}	1333	}
1319		1334
1320	/* Don't want top to be NULL, so set it to the last valid object */	1335	/* Don't want top to be NULL, so set it to the last valid object */
1321	top = last;	1336	top = last;
1322		1337
…		…
1324	* looks like instead of lots of conditions here.	1339	* looks like instead of lots of conditions here.
1325	* makes things faster, and effectively the same result.	1340	* makes things faster, and effectively the same result.
1326	*/	1341	*/
1327		1342
1328	/* Have object 'fall below' other objects that block view.	1343	/* Have object 'fall below' other objects that block view.
1329	* Unless those objects are exits, type 66	1344	* Unless those objects are exits.
1330	* If INS_ON_TOP is used, don't do this processing	1345	* If INS_ON_TOP is used, don't do this processing
1331	* Need to find the object that in fact blocks view, otherwise	1346	* Need to find the object that in fact blocks view, otherwise
1332	* stacking is a bit odd.	1347	* stacking is a bit odd.
1333	*/	1348	*/
1334	if (!(flag & INS_ON_TOP) &&	1349	if (!(flag & INS_ON_TOP)
1335	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1350	&& ms.flags () & P_BLOCKSVIEW
		1351	&& (op->face && !faces [op->face].visibility))
1336	{	1352	{
1337	for (last = top; last != floor; last = last->below)	1353	for (last = top; last != floor; last = last->below)
1338	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1354	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1339	break;	1355	break;
		1356
1340	/* Check to see if we found the object that blocks view,	1357	/* Check to see if we found the object that blocks view,
1341	* and make sure we have a below pointer for it so that	1358	* and make sure we have a below pointer for it so that
1342	* we can get inserted below this one, which requires we	1359	* we can get inserted below this one, which requires we
1343	* set top to the object below us.	1360	* set top to the object below us.
1344	*/	1361	*/
1345	if (last && last->below && last != floor)	1362	if (last && last->below && last != floor)
1346	top = last->below;	1363	top = last->below;
1347	}	1364	}
1348	} /* If objects on this space */	1365	} /* If objects on this space */
1349		1366
1350	if (flag & INS_MAP_LOAD)
1351	top = GET_MAP_TOP (op->map, op->x, op->y);
1352
1353	if (flag & INS_ABOVE_FLOOR_ONLY)	1367	if (flag & INS_ABOVE_FLOOR_ONLY)
1354	top = floor;	1368	top = floor;
1355		1369
1356	/* Top is the object that our object (op) is going to get inserted above.	1370	/* Top is the object that our object (op) is going to get inserted above.
1357	*/	1371	*/
1358		1372
1359	/* First object on this space */	1373	/* First object on this space */
1360	if (!top)	1374	if (!top)
1361	{	1375	{
1362	op->above = GET_MAP_OB (op->map, op->x, op->y);	1376	op->above = ms.bot;
1363		1377
1364	if (op->above)	1378	if (op->above)
1365	op->above->below = op;	1379	op->above->below = op;
1366		1380
1367	op->below = NULL;	1381	op->below = 0;
1368	op->ms ().bottom = op;	1382	ms.bot = op;
1369	}	1383	}
1370	else	1384	else
1371	{ /* get inserted into the stack above top */	1385	{ /* get inserted into the stack above top */
1372	op->above = top->above;	1386	op->above = top->above;
1373		1387
…		…
1376		1390
1377	op->below = top;	1391	op->below = top;
1378	top->above = op;	1392	top->above = op;
1379	}	1393	}
1380		1394
1381	if (op->above == NULL)	1395	if (!op->above)
1382	op->ms ().top = op;	1396	ms.top = op;
1383	} /* else not INS_BELOW_ORIGINATOR */	1397	} /* else not INS_BELOW_ORIGINATOR */
1384		1398
1385	if (op->type == PLAYER)	1399	if (op->type == PLAYER)
		1400	{
1386	op->contr->do_los = 1;	1401	op->contr->do_los = 1;
		1402	++op->map->players;
		1403	op->map->touch ();
		1404	}
1387		1405
1388	/* If we have a floor, we know the player, if any, will be above	1406	op->map->dirty = true;
1389	* it, so save a few ticks and start from there.	1407
1390	*/
1391	if (!(flag & INS_MAP_LOAD))
1392	if (object *pl = op->ms ().player ())	1408	if (object *pl = ms.player ())
1393	pl->contr->ns->floorbox_update ();	1409	pl->contr->ns->floorbox_update ();
1394		1410
1395	/* If this object glows, it may affect lighting conditions that are	1411	/* If this object glows, it may affect lighting conditions that are
1396	* visible to others on this map. But update_all_los is really	1412	* 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	1413	* 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	1414	* on the map will get recalculated. The players could very well
1399	* be far away from this change and not affected in any way -	1415	* be far away from this change and not affected in any way -
1400	* this should get redone to only look for players within range,	1416	* this should get redone to only look for players within range,
1401	* or just updating the P_NEED_UPDATE for spaces within this area	1417	* or just updating the P_UPTODATE for spaces within this area
1402	* of effect may be sufficient.	1418	* of effect may be sufficient.
1403	*/	1419	*/
1404	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1420	if (op->map->darkness && (op->glow_radius != 0))
1405	update_all_los (op->map, op->x, op->y);	1421	update_all_los (op->map, op->x, op->y);
1406		1422
1407	/* updates flags (blocked, alive, no magic, etc) for this map space */	1423	/* updates flags (blocked, alive, no magic, etc) for this map space */
1408	update_object (op, UP_OBJ_INSERT);	1424	update_object (op, UP_OBJ_INSERT);
		1425
		1426	INVOKE_OBJECT (INSERT, op);
1409		1427
1410	/* Don't know if moving this to the end will break anything. However,	1428	/* Don't know if moving this to the end will break anything. However,
1411	* we want to have floorbox_update called before calling this.	1429	* we want to have floorbox_update called before calling this.
1412	*	1430	*
1413	* check_move_on() must be after this because code called from	1431	* check_move_on() must be after this because code called from
…		…
1415	* blocked() and wall() work properly), and these flags are updated by	1433	* blocked() and wall() work properly), and these flags are updated by
1416	* update_object().	1434	* update_object().
1417	*/	1435	*/
1418		1436
1419	/* if this is not the head or flag has been passed, don't check walk on status */	1437	/* if this is not the head or flag has been passed, don't check walk on status */
1420	if (!(flag & INS_NO_WALK_ON) && !op->head)	1438	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1421	{	1439	{
1422	if (check_move_on (op, originator))	1440	if (check_move_on (op, originator))
1423	return NULL;	1441	return 0;
1424		1442
1425	/* If we are a multi part object, lets work our way through the check	1443	/* If we are a multi part object, lets work our way through the check
1426	* walk on's.	1444	* walk on's.
1427	*/	1445	*/
1428	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1446	for (object *tmp = op->more; tmp; tmp = tmp->more)
1429	if (check_move_on (tmp, originator))	1447	if (check_move_on (tmp, originator))
1430	return NULL;	1448	return 0;
1431	}	1449	}
1432		1450
1433	return op;	1451	return op;
1434	}	1452	}
1435		1453
…		…
1442	{	1460	{
1443	object *tmp, *tmp1;	1461	object *tmp, *tmp1;
1444		1462
1445	/* first search for itself and remove any old instances */	1463	/* first search for itself and remove any old instances */
1446		1464
1447	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1465	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1448	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1466	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1449	tmp->destroy ();	1467	tmp->destroy ();
1450		1468
1451	tmp1 = arch_to_object (archetype::find (arch_string));	1469	tmp1 = arch_to_object (archetype::find (arch_string));
1452		1470
1453	tmp1->x = op->x;	1471	tmp1->x = op->x;
1454	tmp1->y = op->y;	1472	tmp1->y = op->y;
1455	insert_ob_in_map (tmp1, op->map, op, 0);	1473	insert_ob_in_map (tmp1, op->map, op, 0);
		1474	}
		1475
		1476	object *
		1477	object::insert_at (object *where, object *originator, int flags)
		1478	{
		1479	return where->map->insert (this, where->x, where->y, originator, flags);
1456	}	1480	}
1457		1481
1458	/*	1482	/*
1459	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1483	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1460	* is returned contains nr objects, and the remaining parts contains	1484	* is returned contains nr objects, and the remaining parts contains
1461	* the rest (or is removed and freed if that number is 0).	1485	* the rest (or is removed and freed if that number is 0).
1462	* On failure, NULL is returned, and the reason put into the	1486	* On failure, NULL is returned, and the reason put into the
1463	* global static errmsg array.	1487	* global static errmsg array.
1464	*/	1488	*/
1465
1466	object *	1489	object *
1467	get_split_ob (object *orig_ob, uint32 nr)	1490	get_split_ob (object *orig_ob, uint32 nr)
1468	{	1491	{
1469	object *newob;	1492	object *newob;
1470	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1493	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1501	* the amount of an object. If the amount reaches 0, the object	1524	* the amount of an object. If the amount reaches 0, the object
1502	* is subsequently removed and freed.	1525	* is subsequently removed and freed.
1503	*	1526	*
1504	* Return value: 'op' if something is left, NULL if the amount reached 0	1527	* Return value: 'op' if something is left, NULL if the amount reached 0
1505	*/	1528	*/
1506
1507	object *	1529	object *
1508	decrease_ob_nr (object *op, uint32 i)	1530	decrease_ob_nr (object *op, uint32 i)
1509	{	1531	{
1510	object *tmp;	1532	object *tmp;
1511	player *pl;
1512		1533
1513	if (i == 0) /* objects with op->nrof require this check */	1534	if (i == 0) /* objects with op->nrof require this check */
1514	return op;	1535	return op;
1515		1536
1516	if (i > op->nrof)	1537	if (i > op->nrof)
…		…
1529	* IMO, searching through all the players will mostly	1550	* IMO, searching through all the players will mostly
1530	* likely be quicker than following op->env to the map,	1551	* likely be quicker than following op->env to the map,
1531	* and then searching the map for a player.	1552	* and then searching the map for a player.
1532	*/	1553	*/
1533	if (!tmp)	1554	if (!tmp)
1534	{	1555	for_all_players (pl)
1535	for (pl = first_player; pl; pl = pl->next)
1536	if (pl->ob->container == op->env)	1556	if (pl->ob->container == op->env)
1537	{	1557	{
1538	tmp = pl->ob;	1558	tmp = pl->ob;
1539	break;	1559	break;
1540	}	1560	}
1541	}
1542		1561
1543	if (i < op->nrof)	1562	if (i < op->nrof)
1544	{	1563	{
1545	sub_weight (op->env, op->weight * i);	1564	sub_weight (op->env, op->weight * i);
1546	op->nrof -= i;	1565	op->nrof -= i;
…		…
1589		1608
1590	/*	1609	/*
1591	* add_weight(object, weight) adds the specified weight to an object,	1610	* add_weight(object, weight) adds the specified weight to an object,
1592	* and also updates how much the environment(s) is/are carrying.	1611	* and also updates how much the environment(s) is/are carrying.
1593	*/	1612	*/
1594
1595	void	1613	void
1596	add_weight (object *op, signed long weight)	1614	add_weight (object *op, signed long weight)
1597	{	1615	{
1598	while (op != NULL)	1616	while (op != NULL)
1599	{	1617	{
…		…
1614	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1632	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1615	free (dump);	1633	free (dump);
1616	return op;	1634	return op;
1617	}	1635	}
1618		1636
1619	if (where->head)	1637	if (where->head_ () != where)
1620	{	1638	{
1621	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1639	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1622	where = where->head;	1640	where = where->head;
1623	}	1641	}
1624		1642
1625	return where->insert (op);	1643	return where->insert (op);
1626	}	1644	}
…		…
1631	* inside the object environment.	1649	* inside the object environment.
1632	*	1650	*
1633	* The function returns now pointer to inserted item, and return value can	1651	* The function returns now pointer to inserted item, and return value can
1634	* be != op, if items are merged. -Tero	1652	* be != op, if items are merged. -Tero
1635	*/	1653	*/
1636
1637	object *	1654	object *
1638	object::insert (object *op)	1655	object::insert (object *op)
1639	{	1656	{
1640	object *tmp, *otmp;
1641
1642	if (!QUERY_FLAG (op, FLAG_REMOVED))	1657	if (!QUERY_FLAG (op, FLAG_REMOVED))
1643	op->remove ();	1658	op->remove ();
1644		1659
1645	if (op->more)	1660	if (op->more)
1646	{	1661	{
…		…
1648	return op;	1663	return op;
1649	}	1664	}
1650		1665
1651	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1666	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1652	CLEAR_FLAG (op, FLAG_REMOVED);	1667	CLEAR_FLAG (op, FLAG_REMOVED);
		1668
1653	if (op->nrof)	1669	if (op->nrof)
1654	{	1670	{
1655	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1671	for (object *tmp = inv; tmp; tmp = tmp->below)
1656	if (object::can_merge (tmp, op))	1672	if (object::can_merge (tmp, op))
1657	{	1673	{
1658	/* return the original object and remove inserted object	1674	/* return the original object and remove inserted object
1659	(client needs the original object) */	1675	(client needs the original object) */
1660	tmp->nrof += op->nrof;	1676	tmp->nrof += op->nrof;
…		…
1679	add_weight (this, op->weight * op->nrof);	1695	add_weight (this, op->weight * op->nrof);
1680	}	1696	}
1681	else	1697	else
1682	add_weight (this, (op->weight + op->carrying));	1698	add_weight (this, (op->weight + op->carrying));
1683		1699
1684	otmp = this->in_player ();	1700	if (object *otmp = this->in_player ())
1685	if (otmp && otmp->contr)
1686	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1701	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1687	otmp->update_stats ();	1702	otmp->update_stats ();
1688		1703
		1704	op->owner = 0; // its his/hers now. period.
1689	op->map = 0;	1705	op->map = 0;
1690	op->env = this;	1706	op->env = this;
1691	op->above = 0;	1707	op->above = 0;
1692	op->below = 0;	1708	op->below = 0;
1693	op->x = 0, op->y = 0;	1709	op->x = op->y = 0;
1694		1710
1695	/* reset the light list and los of the players on the map */	1711	/* reset the light list and los of the players on the map */
1696	if ((op->glow_radius != 0) && map)	1712	if (op->glow_radius && map)
1697	{	1713	{
1698	#ifdef DEBUG_LIGHTS	1714	#ifdef DEBUG_LIGHTS
1699	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1715	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1700	#endif /* DEBUG_LIGHTS */	1716	#endif /* DEBUG_LIGHTS */
1701	if (MAP_DARKNESS (map))	1717	if (map->darkness)
1702	update_all_los (map, x, y);	1718	update_all_los (map, x, y);
1703	}	1719	}
1704		1720
1705	/* Client has no idea of ordering so lets not bother ordering it here.	1721	/* Client has no idea of ordering so lets not bother ordering it here.
1706	* It sure simplifies this function...	1722	* It sure simplifies this function...
…		…
1711	{	1727	{
1712	op->below = inv;	1728	op->below = inv;
1713	op->below->above = op;	1729	op->below->above = op;
1714	inv = op;	1730	inv = op;
1715	}	1731	}
		1732
		1733	INVOKE_OBJECT (INSERT, this);
1716		1734
1717	return op;	1735	return op;
1718	}	1736	}
1719		1737
1720	/*	1738	/*
…		…
1735	*	1753	*
1736	* MSW 2001-07-08: Check all objects on space, not just those below	1754	* MSW 2001-07-08: Check all objects on space, not just those below
1737	* object being inserted. insert_ob_in_map may not put new objects	1755	* object being inserted. insert_ob_in_map may not put new objects
1738	* on top.	1756	* on top.
1739	*/	1757	*/
1740
1741	int	1758	int
1742	check_move_on (object *op, object *originator)	1759	check_move_on (object *op, object *originator)
1743	{	1760	{
1744	object *tmp;	1761	object *tmp;
1745	maptile *m = op->map;	1762	maptile *m = op->map;
…		…
1772		1789
1773	/* The objects have to be checked from top to bottom.	1790	/* The objects have to be checked from top to bottom.
1774	* Hence, we first go to the top:	1791	* Hence, we first go to the top:
1775	*/	1792	*/
1776		1793
1777	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1794	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1778	{	1795	{
1779	/* Trim the search when we find the first other spell effect	1796	/* Trim the search when we find the first other spell effect
1780	* this helps performance so that if a space has 50 spell objects,	1797	* this helps performance so that if a space has 50 spell objects,
1781	* we don't need to check all of them.	1798	* we don't need to check all of them.
1782	*/	1799	*/
…		…
1800	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1817	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1801	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1818	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1802	{	1819	{
1803		1820
1804	float	1821	float
1805	diff = tmp->move_slow_penalty * FABS (op->speed);	1822	diff = tmp->move_slow_penalty * fabs (op->speed);
1806		1823
1807	if (op->type == PLAYER)	1824	if (op->type == PLAYER)
1808	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1825	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1809	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1826	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1810	diff /= 4.0;	1827	diff /= 4.0;
…		…
1837	/*	1854	/*
1838	* present_arch(arch, map, x, y) searches for any objects with	1855	* present_arch(arch, map, x, y) searches for any objects with
1839	* a matching archetype at the given map and coordinates.	1856	* a matching archetype at the given map and coordinates.
1840	* The first matching object is returned, or NULL if none.	1857	* The first matching object is returned, or NULL if none.
1841	*/	1858	*/
1842
1843	object *	1859	object *
1844	present_arch (const archetype *at, maptile *m, int x, int y)	1860	present_arch (const archetype *at, maptile *m, int x, int y)
1845	{	1861	{
1846	object *
1847	tmp;
1848
1849	if (m == NULL || out_of_map (m, x, y))	1862	if (!m || out_of_map (m, x, y))
1850	{	1863	{
1851	LOG (llevError, "Present_arch called outside map.\n");	1864	LOG (llevError, "Present_arch called outside map.\n");
1852	return NULL;	1865	return NULL;
1853	}	1866	}
1854	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1867
		1868	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1855	if (tmp->arch == at)	1869	if (tmp->arch == at)
1856	return tmp;	1870	return tmp;
		1871
1857	return NULL;	1872	return NULL;
1858	}	1873	}
1859		1874
1860	/*	1875	/*
1861	* present(type, map, x, y) searches for any objects with	1876	* present(type, map, x, y) searches for any objects with
1862	* a matching type variable at the given map and coordinates.	1877	* a matching type variable at the given map and coordinates.
1863	* The first matching object is returned, or NULL if none.	1878	* The first matching object is returned, or NULL if none.
1864	*/	1879	*/
1865
1866	object *	1880	object *
1867	present (unsigned char type, maptile *m, int x, int y)	1881	present (unsigned char type, maptile *m, int x, int y)
1868	{	1882	{
1869	object *
1870	tmp;
1871
1872	if (out_of_map (m, x, y))	1883	if (out_of_map (m, x, y))
1873	{	1884	{
1874	LOG (llevError, "Present called outside map.\n");	1885	LOG (llevError, "Present called outside map.\n");
1875	return NULL;	1886	return NULL;
1876	}	1887	}
1877	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1888
		1889	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1878	if (tmp->type == type)	1890	if (tmp->type == type)
1879	return tmp;	1891	return tmp;
		1892
1880	return NULL;	1893	return NULL;
1881	}	1894	}
1882		1895
1883	/*	1896	/*
1884	* present_in_ob(type, object) searches for any objects with	1897	* present_in_ob(type, object) searches for any objects with
1885	* a matching type variable in the inventory of the given object.	1898	* a matching type variable in the inventory of the given object.
1886	* The first matching object is returned, or NULL if none.	1899	* The first matching object is returned, or NULL if none.
1887	*/	1900	*/
1888
1889	object *	1901	object *
1890	present_in_ob (unsigned char type, const object *op)	1902	present_in_ob (unsigned char type, const object *op)
1891	{	1903	{
1892	object *
1893	tmp;
1894
1895	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1904	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1896	if (tmp->type == type)	1905	if (tmp->type == type)
1897	return tmp;	1906	return tmp;
		1907
1898	return NULL;	1908	return NULL;
1899	}	1909	}
1900		1910
1901	/*	1911	/*
1902	* present_in_ob (type, str, object) searches for any objects with	1912	* present_in_ob (type, str, object) searches for any objects with
…		…
1910	* str is the string to match against. Note that we match against	1920	* str is the string to match against. Note that we match against
1911	* the object name, not the archetype name. this is so that the	1921	* the object name, not the archetype name. this is so that the
1912	* spell code can use one object type (force), but change it's name	1922	* spell code can use one object type (force), but change it's name
1913	* to be unique.	1923	* to be unique.
1914	*/	1924	*/
1915
1916	object *	1925	object *
1917	present_in_ob_by_name (int type, const char *str, const object *op)	1926	present_in_ob_by_name (int type, const char *str, const object *op)
1918	{	1927	{
1919	object *
1920	tmp;
1921
1922	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1928	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1923	{
1924	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1929	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
1925	return tmp;	1930	return tmp;
1926	}	1931
1927	return NULL;	1932	return 0;
1928	}	1933	}
1929		1934
1930	/*	1935	/*
1931	* present_arch_in_ob(archetype, object) searches for any objects with	1936	* present_arch_in_ob(archetype, object) searches for any objects with
1932	* a matching archetype in the inventory of the given object.	1937	* a matching archetype in the inventory of the given object.
1933	* The first matching object is returned, or NULL if none.	1938	* The first matching object is returned, or NULL if none.
1934	*/	1939	*/
1935
1936	object *	1940	object *
1937	present_arch_in_ob (const archetype *at, const object *op)	1941	present_arch_in_ob (const archetype *at, const object *op)
1938	{	1942	{
1939	object *
1940	tmp;
1941
1942	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1943	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1943	if (tmp->arch == at)	1944	if (tmp->arch == at)
1944	return tmp;	1945	return tmp;
		1946
1945	return NULL;	1947	return NULL;
1946	}	1948	}
1947		1949
1948	/*	1950	/*
1949	* activate recursively a flag on an object inventory	1951	* activate recursively a flag on an object inventory
1950	*/	1952	*/
1951	void	1953	void
1952	flag_inv (object *op, int flag)	1954	flag_inv (object *op, int flag)
1953	{	1955	{
1954	object *
1955	tmp;
1956
1957	if (op->inv)	1956	if (op->inv)
1958	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1957	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1959	{	1958	{
1960	SET_FLAG (tmp, flag);	1959	SET_FLAG (tmp, flag);
1961	flag_inv (tmp, flag);	1960	flag_inv (tmp, flag);
1962	}	1961	}
1963	} /*	1962	}
		1963
		1964	/*
1964	* desactivate recursively a flag on an object inventory	1965	* deactivate recursively a flag on an object inventory
1965	*/	1966	*/
1966	void	1967	void
1967	unflag_inv (object *op, int flag)	1968	unflag_inv (object *op, int flag)
1968	{	1969	{
1969	object *
1970	tmp;
1971
1972	if (op->inv)	1970	if (op->inv)
1973	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1971	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1974	{	1972	{
1975	CLEAR_FLAG (tmp, flag);	1973	CLEAR_FLAG (tmp, flag);
1976	unflag_inv (tmp, flag);	1974	unflag_inv (tmp, flag);
1977	}	1975	}
1978	}
1979
1980	/*
1981	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1982	* all it's inventory (recursively).
1983	* If checksums are used, a player will get set_cheat called for
1984	* him/her-self and all object carried by a call to this function.
1985	*/
1986
1987	void
1988	set_cheat (object *op)
1989	{
1990	SET_FLAG (op, FLAG_WAS_WIZ);
1991	flag_inv (op, FLAG_WAS_WIZ);
1992	}	1976	}
1993		1977
1994	/*	1978	/*
1995	* find_free_spot(object, map, x, y, start, stop) will search for	1979	* find_free_spot(object, map, x, y, start, stop) will search for
1996	* a spot at the given map and coordinates which will be able to contain	1980	* a spot at the given map and coordinates which will be able to contain
…		…
2010	* because arch_blocked (now ob_blocked) needs to know the movement type	1994	* because arch_blocked (now ob_blocked) needs to know the movement type
2011	* to know if the space in question will block the object. We can't use	1995	* to know if the space in question will block the object. We can't use
2012	* the archetype because that isn't correct if the monster has been	1996	* the archetype because that isn't correct if the monster has been
2013	* customized, changed states, etc.	1997	* customized, changed states, etc.
2014	*/	1998	*/
2015
2016	int	1999	int
2017	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	2000	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2018	{	2001	{
2019	int
2020	i,
2021	index = 0, flag;
2022	static int
2023	altern[SIZEOFFREE];	2002	int altern[SIZEOFFREE];
		2003	int index = 0, flag;
2024		2004
2025	for (i = start; i < stop; i++)	2005	for (int i = start; i < stop; i++)
2026	{	2006	{
2027	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2007	mapxy pos (m, x, y); pos.move (i);
2028	if (!flag)	2008
		2009	if (!pos.normalise ())
		2010	continue;
		2011
		2012	mapspace &ms = *pos;
		2013
		2014	if (ms.flags () & P_IS_ALIVE)
		2015	continue;
		2016
		2017	/* However, often
		2018	* ob doesn't have any move type (when used to place exits)
		2019	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2020	*/
		2021	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2022	{
2029	altern[index++] = i;	2023	altern [index++] = i;
		2024	continue;
		2025	}
2030		2026
2031	/* Basically, if we find a wall on a space, we cut down the search size.	2027	/* Basically, if we find a wall on a space, we cut down the search size.
2032	* In this way, we won't return spaces that are on another side of a wall.	2028	* In this way, we won't return spaces that are on another side of a wall.
2033	* This mostly work, but it cuts down the search size in all directions -	2029	* This mostly work, but it cuts down the search size in all directions -
2034	* if the space being examined only has a wall to the north and empty	2030	* if the space being examined only has a wall to the north and empty
2035	* spaces in all the other directions, this will reduce the search space	2031	* spaces in all the other directions, this will reduce the search space
2036	* to only the spaces immediately surrounding the target area, and	2032	* to only the spaces immediately surrounding the target area, and
2037	* won't look 2 spaces south of the target space.	2033	* won't look 2 spaces south of the target space.
2038	*/	2034	*/
2039	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2035	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2036	{
2040	stop = maxfree[i];	2037	stop = maxfree[i];
		2038	continue;
		2039	}
		2040
		2041	/* Note it is intentional that we check ob - the movement type of the
		2042	* head of the object should correspond for the entire object.
		2043	*/
		2044	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2045	continue;
		2046
		2047	altern [index++] = i;
2041	}	2048	}
2042		2049
2043	if (!index)	2050	if (!index)
2044	return -1;	2051	return -1;
2045		2052
2046	return altern[RANDOM () % index];	2053	return altern [rndm (index)];
2047	}	2054	}
2048		2055
2049	/*	2056	/*
2050	* find_first_free_spot(archetype, maptile, x, y) works like	2057	* find_first_free_spot(archetype, maptile, x, y) works like
2051	* find_free_spot(), but it will search max number of squares.	2058	* find_free_spot(), but it will search max number of squares.
2052	* But it will return the first available spot, not a random choice.	2059	* But it will return the first available spot, not a random choice.
2053	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2060	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2054	*/	2061	*/
2055
2056	int	2062	int
2057	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2063	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2058	{	2064	{
2059	int
2060	i;
2061
2062	for (i = 0; i < SIZEOFFREE; i++)	2065	for (int i = 0; i < SIZEOFFREE; i++)
2063	{
2064	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2066	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2065	return i;	2067	return i;
2066	}	2068
2067	return -1;	2069	return -1;
2068	}	2070	}
2069		2071
2070	/*	2072	/*
2071	* The function permute(arr, begin, end) randomly reorders the array	2073	* The function permute(arr, begin, end) randomly reorders the array
2072	* arr[begin..end-1].	2074	* arr[begin..end-1].
		2075	* now uses a fisher-yates shuffle, old permute was broken
2073	*/	2076	*/
2074	static void	2077	static void
2075	permute (int *arr, int begin, int end)	2078	permute (int *arr, int begin, int end)
2076	{	2079	{
2077	int	2080	arr += begin;
2078	i,
2079	j,
2080	tmp,
2081	len;
2082
2083	len = end - begin;	2081	end -= begin;
2084	for (i = begin; i < end; i++)
2085	{
2086	j = begin + RANDOM () % len;
2087		2082
2088	tmp = arr[i];	2083	while (--end)
2089	arr[i] = arr[j];	2084	swap (arr [end], arr [rndm (end + 1)]);
2090	arr[j] = tmp;
2091	}
2092	}	2085	}
2093		2086
2094	/* new function to make monster searching more efficient, and effective!	2087	/* new function to make monster searching more efficient, and effective!
2095	* This basically returns a randomized array (in the passed pointer) of	2088	* This basically returns a randomized array (in the passed pointer) of
2096	* the spaces to find monsters. In this way, it won't always look for	2089	* the spaces to find monsters. In this way, it won't always look for
…		…
2099	* the 3x3 area will be searched, just not in a predictable order.	2092	* the 3x3 area will be searched, just not in a predictable order.
2100	*/	2093	*/
2101	void	2094	void
2102	get_search_arr (int *search_arr)	2095	get_search_arr (int *search_arr)
2103	{	2096	{
2104	int	2097	int i;
2105	i;
2106		2098
2107	for (i = 0; i < SIZEOFFREE; i++)	2099	for (i = 0; i < SIZEOFFREE; i++)
2108	{
2109	search_arr[i] = i;	2100	search_arr[i] = i;
2110	}
2111		2101
2112	permute (search_arr, 1, SIZEOFFREE1 + 1);	2102	permute (search_arr, 1, SIZEOFFREE1 + 1);
2113	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2103	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2114	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2104	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2115	}	2105	}
…		…
2124	* Perhaps incorrectly, but I'm making the assumption that exclude	2114	* Perhaps incorrectly, but I'm making the assumption that exclude
2125	* is actually want is going to try and move there. We need this info	2115	* is actually want is going to try and move there. We need this info
2126	* because we have to know what movement the thing looking to move	2116	* because we have to know what movement the thing looking to move
2127	* there is capable of.	2117	* there is capable of.
2128	*/	2118	*/
2129
2130	int	2119	int
2131	find_dir (maptile *m, int x, int y, object *exclude)	2120	find_dir (maptile *m, int x, int y, object *exclude)
2132	{	2121	{
2133	int
2134	i,
2135	max = SIZEOFFREE, mflags;	2122	int i, max = SIZEOFFREE, mflags;
2136		2123
2137	sint16 nx, ny;	2124	sint16 nx, ny;
2138	object *	2125	object *tmp;
2139	tmp;
2140	maptile *	2126	maptile *mp;
2141	mp;
2142		2127
2143	MoveType blocked, move_type;	2128	MoveType blocked, move_type;
2144		2129
2145	if (exclude && exclude->head)	2130	if (exclude && exclude->head_ () != exclude)
2146	{	2131	{
2147	exclude = exclude->head;	2132	exclude = exclude->head;
2148	move_type = exclude->move_type;	2133	move_type = exclude->move_type;
2149	}	2134	}
2150	else	2135	else
…		…
2163		2148
2164	if (mflags & P_OUT_OF_MAP)	2149	if (mflags & P_OUT_OF_MAP)
2165	max = maxfree[i];	2150	max = maxfree[i];
2166	else	2151	else
2167	{	2152	{
2168	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2153	mapspace &ms = mp->at (nx, ny);
		2154
		2155	blocked = ms.move_block;
2169		2156
2170	if ((move_type & blocked) == move_type)	2157	if ((move_type & blocked) == move_type)
2171	max = maxfree[i];	2158	max = maxfree[i];
2172	else if (mflags & P_IS_ALIVE)	2159	else if (mflags & P_IS_ALIVE)
2173	{	2160	{
2174	for (tmp = GET_MAP_OB (mp, nx, ny); tmp; tmp = tmp->above)	2161	for (tmp = ms.bot; tmp; tmp = tmp->above)
2175	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2162	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
		2163	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2176	break;	2164	break;
2177		2165
2178	if (tmp)	2166	if (tmp)
2179	return freedir[i];	2167	return freedir[i];
2180	}	2168	}
…		…
2186		2174
2187	/*	2175	/*
2188	* distance(object 1, object 2) will return the square of the	2176	* distance(object 1, object 2) will return the square of the
2189	* distance between the two given objects.	2177	* distance between the two given objects.
2190	*/	2178	*/
2191
2192	int	2179	int
2193	distance (const object *ob1, const object *ob2)	2180	distance (const object *ob1, const object *ob2)
2194	{	2181	{
2195	int i;
2196
2197	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2182	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2198	return i;
2199	}	2183	}
2200		2184
2201	/*	2185	/*
2202	* find_dir_2(delta-x,delta-y) will return a direction in which	2186	* find_dir_2(delta-x,delta-y) will return a direction in which
2203	* an object which has subtracted the x and y coordinates of another	2187	* an object which has subtracted the x and y coordinates of another
2204	* object, needs to travel toward it.	2188	* object, needs to travel toward it.
2205	*/	2189	*/
2206
2207	int	2190	int
2208	find_dir_2 (int x, int y)	2191	find_dir_2 (int x, int y)
2209	{	2192	{
2210	int q;	2193	int q;
2211		2194
…		…
2240		2223
2241	return 3;	2224	return 3;
2242	}	2225	}
2243		2226
2244	/*	2227	/*
2245	* absdir(int): Returns a number between 1 and 8, which represent
2246	* the "absolute" direction of a number (it actually takes care of
2247	* "overflow" in previous calculations of a direction).
2248	*/
2249
2250	int
2251	absdir (int d)
2252	{
2253	while (d < 1)
2254	d += 8;
2255	while (d > 8)
2256	d -= 8;
2257	return d;
2258	}
2259
2260	/*
2261	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2228	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2262	* between two directions (which are expected to be absolute (see absdir())	2229	* between two directions (which are expected to be absolute (see absdir())
2263	*/	2230	*/
2264
2265	int	2231	int
2266	dirdiff (int dir1, int dir2)	2232	dirdiff (int dir1, int dir2)
2267	{	2233	{
2268	int	2234	int d;
2269	d;
2270		2235
2271	d = abs (dir1 - dir2);	2236	d = abs (dir1 - dir2);
2272	if (d > 4)	2237	if (d > 4)
2273	d = 8 - d;	2238	d = 8 - d;
		2239
2274	return d;	2240	return d;
2275	}	2241	}
2276		2242
2277	/* peterm:	2243	/* peterm:
2278	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2244	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2281	* This basically means that if direction is 15, then it could either go	2247	* This basically means that if direction is 15, then it could either go
2282	* direction 4, 14, or 16 to get back to where we are.	2248	* direction 4, 14, or 16 to get back to where we are.
2283	* Moved from spell_util.c to object.c with the other related direction	2249	* Moved from spell_util.c to object.c with the other related direction
2284	* functions.	2250	* functions.
2285	*/	2251	*/
2286
2287	int
2288	reduction_dir[SIZEOFFREE][3] = {	2252	int reduction_dir[SIZEOFFREE][3] = {
2289	{0, 0, 0}, /* 0 */	2253	{0, 0, 0}, /* 0 */
2290	{0, 0, 0}, /* 1 */	2254	{0, 0, 0}, /* 1 */
2291	{0, 0, 0}, /* 2 */	2255	{0, 0, 0}, /* 2 */
2292	{0, 0, 0}, /* 3 */	2256	{0, 0, 0}, /* 3 */
2293	{0, 0, 0}, /* 4 */	2257	{0, 0, 0}, /* 4 */
…		…
2384	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2348	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2385	* core dumps if they do.	2349	* core dumps if they do.
2386	*	2350	*
2387	* Add a check so we can't pick up invisible objects (0.93.8)	2351	* Add a check so we can't pick up invisible objects (0.93.8)
2388	*/	2352	*/
2389
2390	int	2353	int
2391	can_pick (const object *who, const object *item)	2354	can_pick (const object *who, const object *item)
2392	{	2355	{
2393	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2356	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2394	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2357	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2399	* create clone from object to another	2362	* create clone from object to another
2400	*/	2363	*/
2401	object *	2364	object *
2402	object_create_clone (object *asrc)	2365	object_create_clone (object *asrc)
2403	{	2366	{
2404	object *dst = 0, *tmp, *src, *part, *prev, *item;	2367	object *dst = 0, *tmp, *src, *prev, *item;
2405		2368
2406	if (!asrc)	2369	if (!asrc)
2407	return 0;	2370	return 0;
2408		2371
2409	src = asrc;
2410	if (src->head)
2411	src = src->head;	2372	src = asrc->head_ ();
2412		2373
2413	prev = 0;	2374	prev = 0;
2414	for (part = src; part; part = part->more)	2375	for (object *part = src; part; part = part->more)
2415	{	2376	{
2416	tmp = part->clone ();	2377	tmp = part->clone ();
2417	tmp->x -= src->x;	2378	tmp->x -= src->x;
2418	tmp->y -= src->y;	2379	tmp->y -= src->y;
2419		2380
…		…
2437	insert_ob_in_ob (object_create_clone (item), dst);	2398	insert_ob_in_ob (object_create_clone (item), dst);
2438		2399
2439	return dst;	2400	return dst;
2440	}	2401	}
2441		2402
2442	/* GROS - Creates an object using a string representing its content. */
2443	/* Basically, we save the content of the string to a temp file, then call */
2444	/* load_object on it. I admit it is a highly inefficient way to make things, */
2445	/* but it was simple to make and allows reusing the load_object function. */
2446	/* Remember not to use load_object_str in a time-critical situation. */
2447	/* Also remember that multiparts objects are not supported for now. */
2448
2449	object *
2450	load_object_str (const char *obstr)
2451	{
2452	object *op;
2453	char filename[MAX_BUF];
2454
2455	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2456
2457	FILE *tempfile = fopen (filename, "w");
2458
2459	if (tempfile == NULL)
2460	{
2461	LOG (llevError, "Error - Unable to access load object temp file\n");
2462	return NULL;
2463	}
2464
2465	fprintf (tempfile, obstr);
2466	fclose (tempfile);
2467
2468	op = object::create ();
2469
2470	object_thawer thawer (filename);
2471
2472	if (thawer)
2473	load_object (thawer, op, 0);
2474
2475	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2476	CLEAR_FLAG (op, FLAG_REMOVED);
2477
2478	return op;
2479	}
2480
2481	/* This returns the first object in who's inventory that	2403	/* This returns the first object in who's inventory that
2482	* has the same type and subtype match.	2404	* has the same type and subtype match.
2483	* returns NULL if no match.	2405	* returns NULL if no match.
2484	*/	2406	*/
2485	object *	2407	object *
2486	find_obj_by_type_subtype (const object *who, int type, int subtype)	2408	find_obj_by_type_subtype (const object *who, int type, int subtype)
2487	{	2409	{
2488	object *tmp;
2489
2490	for (tmp = who->inv; tmp; tmp = tmp->below)	2410	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2491	if (tmp->type == type && tmp->subtype == subtype)	2411	if (tmp->type == type && tmp->subtype == subtype)
2492	return tmp;	2412	return tmp;
2493		2413
2494	return NULL;	2414	return 0;
2495	}	2415	}
2496		2416
2497	/* If ob has a field named key, return the link from the list,	2417	/* If ob has a field named key, return the link from the list,
2498	* otherwise return NULL.	2418	* otherwise return NULL.
2499	*	2419	*
…		…
2501	* do the desired thing.	2421	* do the desired thing.
2502	*/	2422	*/
2503	key_value *	2423	key_value *
2504	get_ob_key_link (const object *ob, const char *key)	2424	get_ob_key_link (const object *ob, const char *key)
2505	{	2425	{
2506	key_value *link;
2507
2508	for (link = ob->key_values; link != NULL; link = link->next)	2426	for (key_value *link = ob->key_values; link; link = link->next)
2509	if (link->key == key)	2427	if (link->key == key)
2510	return link;	2428	return link;
2511		2429
2512	return NULL;	2430	return 0;
2513	}	2431	}
2514		2432
2515	/*	2433	/*
2516	* Returns the value of op has an extra_field for key, or NULL.	2434	* Returns the value of op has an extra_field for key, or NULL.
2517	*	2435	*
…		…
2542	if (link->key == canonical_key)	2460	if (link->key == canonical_key)
2543	return link->value;	2461	return link->value;
2544		2462
2545	return 0;	2463	return 0;
2546	}	2464	}
2547
2548		2465
2549	/*	2466	/*
2550	* Updates the canonical_key in op to value.	2467	* Updates the canonical_key in op to value.
2551	*	2468	*
2552	* canonical_key is a shared string (value doesn't have to be).	2469	* canonical_key is a shared string (value doesn't have to be).
…		…
2557	* Returns TRUE on success.	2474	* Returns TRUE on success.
2558	*/	2475	*/
2559	int	2476	int
2560	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2477	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2561	{	2478	{
2562	key_value *
2563	field = NULL, *last = NULL;	2479	key_value *field = NULL, *last = NULL;
2564		2480
2565	for (field = op->key_values; field != NULL; field = field->next)	2481	for (field = op->key_values; field != NULL; field = field->next)
2566	{	2482	{
2567	if (field->key != canonical_key)	2483	if (field->key != canonical_key)
2568	{	2484	{
…		…
2577	/* Basically, if the archetype has this key set,	2493	/* Basically, if the archetype has this key set,
2578	* we need to store the null value so when we save	2494	* we need to store the null value so when we save
2579	* it, we save the empty value so that when we load,	2495	* it, we save the empty value so that when we load,
2580	* we get this value back again.	2496	* we get this value back again.
2581	*/	2497	*/
2582	if (get_ob_key_link (&op->arch->clone, canonical_key))	2498	if (get_ob_key_link (op->arch, canonical_key))
2583	field->value = 0;	2499	field->value = 0;
2584	else	2500	else
2585	{	2501	{
2586	if (last)	2502	if (last)
2587	last->next = field->next;	2503	last->next = field->next;
…		…
2596	/* IF we get here, key doesn't exist */	2512	/* IF we get here, key doesn't exist */
2597		2513
2598	/* No field, we'll have to add it. */	2514	/* No field, we'll have to add it. */
2599		2515
2600	if (!add_key)	2516	if (!add_key)
2601	{
2602	return FALSE;	2517	return FALSE;
2603	}	2518
2604	/* There isn't any good reason to store a null	2519	/* There isn't any good reason to store a null
2605	* value in the key/value list. If the archetype has	2520	* value in the key/value list. If the archetype has
2606	* this key, then we should also have it, so shouldn't	2521	* this key, then we should also have it, so shouldn't
2607	* be here. If user wants to store empty strings,	2522	* be here. If user wants to store empty strings,
2608	* should pass in ""	2523	* should pass in ""
…		…
2657	}	2572	}
2658	else	2573	else
2659	item = item->env;	2574	item = item->env;
2660	}	2575	}
2661		2576
		2577	const char *
		2578	object::flag_desc (char *desc, int len) const
		2579	{
		2580	char *p = desc;
		2581	bool first = true;
		2582
		2583	*p = 0;
		2584
		2585	for (int i = 0; i < NUM_FLAGS; i++)
		2586	{
		2587	if (len <= 10) // magic constant!
		2588	{
		2589	snprintf (p, len, ",...");
		2590	break;
		2591	}
		2592
		2593	if (flag [i])
		2594	{
		2595	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2596	len -= cnt;
		2597	p += cnt;
		2598	first = false;
		2599	}
		2600	}
		2601
		2602	return desc;
		2603	}
		2604
2662	// return a suitable string describing an objetc in enough detail to find it	2605	// return a suitable string describing an object in enough detail to find it
2663	const char *	2606	const char *
2664	object::debug_desc (char *info) const	2607	object::debug_desc (char *info) const
2665	{	2608	{
		2609	char flagdesc[512];
2666	char info2[256 * 3];	2610	char info2[256 * 4];
2667	char *p = info;	2611	char *p = info;
2668		2612
2669	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2613	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2670	count,	2614	count, uuid.seq,
2671	&name,	2615	&name,
2672	title ? " " : "",	2616	title ? "\",title:\"" : "",
2673	title ? (const char *)title : "");	2617	title ? (const char *)title : "",
		2618	flag_desc (flagdesc, 512), type);
2674		2619
2675	if (env)	2620	if (!this->flag[FLAG_REMOVED] && env)
2676	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2621	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2677		2622
2678	if (map)	2623	if (map)
2679	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2624	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2680		2625
2681	return info;	2626	return info;
2682	}	2627	}
2683		2628
2684	const char *	2629	const char *
2685	object::debug_desc () const	2630	object::debug_desc () const
2686	{	2631	{
2687	static char info[256 * 3];	2632	static char info[3][256 * 4];
		2633	static int info_idx;
		2634
2688	return debug_desc (info);	2635	return debug_desc (info [++info_idx % 3]);
2689	}	2636	}
2690		2637
		2638	struct region *
		2639	object::region () const
		2640	{
		2641	return map ? map->region (x, y)
		2642	: region::default_region ();
		2643	}
		2644
		2645	const materialtype_t *
		2646	object::dominant_material () const
		2647	{
		2648	if (materialtype_t *mt = name_to_material (materialname))
		2649	return mt;
		2650
		2651	return name_to_material (shstr_unknown);
		2652	}
		2653
		2654	void
		2655	object::open_container (object *new_container)
		2656	{
		2657	if (container == new_container)
		2658	return;
		2659
		2660	if (object *old_container = container)
		2661	{
		2662	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2663	return;
		2664
		2665	#if 0
		2666	// remove the "Close old_container" object.
		2667	if (object *closer = old_container->inv)
		2668	if (closer->type == CLOSE_CON)
		2669	closer->destroy ();
		2670	#endif
		2671
		2672	old_container->flag [FLAG_APPLIED] = 0;
		2673	container = 0;
		2674
		2675	esrv_update_item (UPD_FLAGS, this, old_container);
		2676	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2677	play_sound (sound_find ("chest_close"));
		2678	}
		2679
		2680	if (new_container)
		2681	{
		2682	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2683	return;
		2684
		2685	// TODO: this does not seem to serve any purpose anymore?
		2686	#if 0
		2687	// insert the "Close Container" object.
		2688	if (archetype *closer = new_container->other_arch)
		2689	{
		2690	object *closer = arch_to_object (new_container->other_arch);
		2691	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2692	new_container->insert (closer);
		2693	}
		2694	#endif
		2695
		2696	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2697
		2698	new_container->flag [FLAG_APPLIED] = 1;
		2699	container = new_container;
		2700
		2701	esrv_update_item (UPD_FLAGS, this, new_container);
		2702	esrv_send_inventory (this, new_container);
		2703	play_sound (sound_find ("chest_open"));
		2704	}
		2705	}
		2706
		2707	object *
		2708	object::force_find (const shstr name)
		2709	{
		2710	/* cycle through his inventory to look for the MARK we want to
		2711	* place
		2712	*/
		2713	for (object *tmp = inv; tmp; tmp = tmp->below)
		2714	if (tmp->type == FORCE && tmp->slaying == name)
		2715	return splay (tmp);
		2716
		2717	return 0;
		2718	}
		2719
		2720	void
		2721	object::force_add (const shstr name, int duration)
		2722	{
		2723	if (object *force = force_find (name))
		2724	force->destroy ();
		2725
		2726	object *force = get_archetype (FORCE_NAME);
		2727
		2728	force->slaying = name;
		2729	force->stats.food = 1;
		2730	force->speed_left = -1.f;
		2731
		2732	force->set_speed (duration ? 1.f / duration : 0.f);
		2733	force->flag [FLAG_IS_USED_UP] = true;
		2734	force->flag [FLAG_APPLIED] = true;
		2735
		2736	insert (force);
		2737	}
		2738
		2739	void
		2740	object::play_sound (faceidx sound) const
		2741	{
		2742	if (!sound)
		2743	return;
		2744
		2745	if (flag [FLAG_REMOVED])
		2746	return;
		2747
		2748	if (env)
		2749	{
		2750	if (object *pl = in_player ())
		2751	pl->contr->play_sound (sound);
		2752	}
		2753	else
		2754	map->play_sound (sound, x, y);
		2755	}
		2756

Diff Legend

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