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.70 by root, Tue Dec 19 05:12:52 2006 UTC vs.
Revision 1.141 by root, Sun Apr 29 21:44:34 2007 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* CrossFire, A Multiplayer game
3		3	*
		4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (C) 2001 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (C) 1992 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* This program 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 2 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, write to the Free Software
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20		21	*
21	The authors can be reached via e-mail at <crossfire@schmorp.de>	22	* The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	23	*/
23		24
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying	26	sub/add_weight will transcend the environment updating the carrying
26	variable. */	27	variable. */
27	#include <global.h>	28	#include <global.h>
…		…
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:
…		…
312		313
313	/* Everything passes, must be OK. */	314	/* Everything passes, must be OK. */
314	return 1;	315	return 1;
315	}	316	}
316		317
		318	void
		319	player::set_range (rangetype r)
		320	{
		321	shoottype = r;
		322	}
		323
317	/*	324	/*
318	* sum_weight() is a recursive function which calculates the weight	325	* sum_weight() is a recursive function which calculates the weight
319	* an object is carrying. It goes through in figures out how much	326	* an object is carrying. It goes through in figures out how much
320	* containers are carrying, and sums it up.	327	* containers are carrying, and sums it up.
321	*/	328	*/
…		…
352	op = op->env;	359	op = op->env;
353	return op;	360	return op;
354	}	361	}
355		362
356	/*	363	/*
357	* Eneq(@csd.uu.se): Since we can have items buried in a character we need
358	* a better check. We basically keeping traversing up until we can't
359	* or find a player.
360	*/
361
362	object *
363	is_player_inv (object *op)
364	{
365	for (; op != NULL && op->type != PLAYER; op = op->env)
366	if (op->env == op)
367	op->env = NULL;
368	return op;
369	}
370
371	/*
372	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	364	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
373	* Some error messages.	365	* Some error messages.
374	* The result of the dump is stored in the static global errmsg array.	366	* The result of the dump is stored in the static global errmsg array.
375	*/	367	*/
376
377	char *	368	char *
378	dump_object (object *op)	369	dump_object (object *op)
379	{	370	{
380	if (!op)	371	if (!op)
381	return strdup ("[NULLOBJ]");	372	return strdup ("[NULLOBJ]");
382		373
383	object_freezer freezer;	374	object_freezer freezer;
384	save_object (freezer, op, 3);	375	op->write (freezer);
385	return freezer.as_string ();	376	return freezer.as_string ();
386	}	377	}
387		378
388	/*	379	/*
389	* get_nearest_part(multi-object, object 2) returns the part of the	380	* get_nearest_part(multi-object, object 2) returns the part of the
…		…
406	}	397	}
407		398
408	/*	399	/*
409	* Returns the object which has the count-variable equal to the argument.	400	* Returns the object which has the count-variable equal to the argument.
410	*/	401	*/
411
412	object *	402	object *
413	find_object (tag_t i)	403	find_object (tag_t i)
414	{	404	{
415	for (object *op = object::first; op; op = op->next)	405	for_all_objects (op)
416	if (op->count == i)	406	if (op->count == i)
417	return op;	407	return op;
418		408
419	return 0;	409	return 0;
420	}	410	}
421		411
422	/*	412	/*
423	* Returns the first object which has a name equal to the argument.	413	* Returns the first object which has a name equal to the argument.
424	* Used only by the patch command, but not all that useful.	414	* Used only by the patch command, but not all that useful.
425	* Enables features like "patch <name-of-other-player> food 999"	415	* Enables features like "patch <name-of-other-player> food 999"
426	*/	416	*/
427
428	object *	417	object *
429	find_object_name (const char *str)	418	find_object_name (const char *str)
430	{	419	{
431	shstr_cmp str_ (str);	420	shstr_cmp str_ (str);
432	object *op;	421	object *op;
433		422
434	for (op = object::first; op != NULL; op = op->next)	423	for_all_objects (op)
435	if (op->name == str_)	424	if (op->name == str_)
436	break;	425	break;
437		426
438	return op;	427	return op;
439	}	428	}
…		…
471	* refcounts and freeing the links.	460	* refcounts and freeing the links.
472	*/	461	*/
473	static void	462	static void
474	free_key_values (object *op)	463	free_key_values (object *op)
475	{	464	{
476	for (key_value *i = op->key_values; i != 0;)	465	for (key_value *i = op->key_values; i; )
477	{	466	{
478	key_value *next = i->next;	467	key_value *next = i->next;
479	delete i;	468	delete i;
480		469
481	i = next;	470	i = next;
482	}	471	}
483		472
484	op->key_values = 0;	473	op->key_values = 0;
485	}	474	}
486		475
487	void object::clear ()	476	object &
		477	object::operator =(const object &src)
488	{	478	{
489	attachable_base::clear ();	479	bool is_freed = flag [FLAG_FREED];
		480	bool is_removed = flag [FLAG_REMOVED];
490		481
491	free_key_values (this);
492
493	owner = 0;
494	name = 0;
495	name_pl = 0;
496	title = 0;
497	race = 0;
498	slaying = 0;
499	skill = 0;
500	msg = 0;
501	lore = 0;
502	custom_name = 0;
503	materialname = 0;
504	contr = 0;
505	below = 0;
506	above = 0;
507	inv = 0;
508	container = 0;
509	env = 0;
510	more = 0;
511	head = 0;
512	map = 0;
513	active_next = 0;
514	active_prev = 0;
515
516	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
517
518	SET_FLAG (this, FLAG_REMOVED);
519
520	/* What is not cleared is next, prev, and count */
521
522	expmul = 1.0;
523	face = blank_face;
524
525	if (settings.casting_time)
526	casting_time = -1;
527	}
528
529	/*
530	* copy_to first frees everything allocated by the dst object,
531	* and then copies the contents of itself into the second
532	* object, allocating what needs to be allocated. Basically, any
533	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
534	* if the first object is freed, the pointers in the new object
535	* will point at garbage.
536	*/
537	void
538	object::copy_to (object *dst)
539	{
540	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
541	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
542
543	*(object_copy *)dst = *this;	482	*(object_copy *)this = src;
544	*(object_pod *)dst = *this;
545		483
546	if (self || cb)	484	flag [FLAG_FREED] = is_freed;
547	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst));	485	flag [FLAG_REMOVED] = is_removed;
548
549	if (is_freed)
550	SET_FLAG (dst, FLAG_FREED);
551
552	if (is_removed)
553	SET_FLAG (dst, FLAG_REMOVED);
554
555	if (speed < 0)
556	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
557		486
558	/* Copy over key_values, if any. */	487	/* Copy over key_values, if any. */
559	if (key_values)	488	if (src.key_values)
560	{	489	{
561	key_value *tail = 0;	490	key_value *tail = 0;
562	key_value *i;
563
564	dst->key_values = 0;	491	key_values = 0;
565		492
566	for (i = key_values; i; i = i->next)	493	for (key_value *i = src.key_values; i; i = i->next)
567	{	494	{
568	key_value *new_link = new key_value;	495	key_value *new_link = new key_value;
569		496
570	new_link->next = 0;	497	new_link->next = 0;
571	new_link->key = i->key;	498	new_link->key = i->key;
572	new_link->value = i->value;	499	new_link->value = i->value;
573		500
574	/* Try and be clever here, too. */	501	/* Try and be clever here, too. */
575	if (!dst->key_values)	502	if (!key_values)
576	{	503	{
577	dst->key_values = new_link;	504	key_values = new_link;
578	tail = new_link;	505	tail = new_link;
579	}	506	}
580	else	507	else
581	{	508	{
582	tail->next = new_link;	509	tail->next = new_link;
583	tail = new_link;	510	tail = new_link;
584	}	511	}
585	}	512	}
586	}	513	}
		514	}
587		515
588	update_ob_speed (dst);	516	/*
		517	* copy_to first frees everything allocated by the dst object,
		518	* and then copies the contents of itself into the second
		519	* object, allocating what needs to be allocated. Basically, any
		520	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		521	* if the first object is freed, the pointers in the new object
		522	* will point at garbage.
		523	*/
		524	void
		525	object::copy_to (object *dst)
		526	{
		527	*dst = *this;
		528
		529	if (speed < 0)
		530	dst->speed_left = speed_left - rndm ();
		531
		532	dst->set_speed (dst->speed);
		533	}
		534
		535	void
		536	object::instantiate ()
		537	{
		538	if (!uuid.seq) // HACK
		539	uuid = gen_uuid ();
		540
		541	speed_left = -0.1f;
		542	/* copy the body_info to the body_used - this is only really
		543	* need for monsters, but doesn't hurt to do it for everything.
		544	* by doing so, when a monster is created, it has good starting
		545	* values for the body_used info, so when items are created
		546	* for it, they can be properly equipped.
		547	*/
		548	memcpy (body_used, body_info, sizeof (body_used));
		549
		550	attachable::instantiate ();
589	}	551	}
590		552
591	object *	553	object *
592	object::clone ()	554	object::clone ()
593	{	555	{
…		…
599	/*	561	/*
600	* If an object with the IS_TURNABLE() flag needs to be turned due	562	* If an object with the IS_TURNABLE() flag needs to be turned due
601	* to the closest player being on the other side, this function can	563	* to the closest player being on the other side, this function can
602	* be called to update the face variable, _and_ how it looks on the map.	564	* be called to update the face variable, _and_ how it looks on the map.
603	*/	565	*/
604
605	void	566	void
606	update_turn_face (object *op)	567	update_turn_face (object *op)
607	{	568	{
608	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	569	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
609	return;	570	return;
		571
610	SET_ANIMATION (op, op->direction);	572	SET_ANIMATION (op, op->direction);
611	update_object (op, UP_OBJ_FACE);	573	update_object (op, UP_OBJ_FACE);
612	}	574	}
613		575
614	/*	576	/*
615	* Updates the speed of an object. If the speed changes from 0 to another	577	* Updates the speed of an object. If the speed changes from 0 to another
616	* value, or vice versa, then add/remove the object from the active list.	578	* value, or vice versa, then add/remove the object from the active list.
617	* This function needs to be called whenever the speed of an object changes.	579	* This function needs to be called whenever the speed of an object changes.
618	*/	580	*/
619	void	581	void
620	update_ob_speed (object *op)	582	object::set_speed (float speed)
621	{	583	{
622	extern int arch_init;	584	if (flag [FLAG_FREED] && speed)
623
624	/* No reason putting the archetypes objects on the speed list,
625	* since they never really need to be updated.
626	*/
627
628	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
629	{	585	{
630	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	586	LOG (llevError, "Object %s is freed but has speed.\n", &name);
631	#ifdef MANY_CORES
632	abort ();
633	#else
634	op->speed = 0;	587	speed = 0;
635	#endif
636	}
637
638	if (arch_init)
639	return;
640
641	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
642	{	588	}
643	/* If already on active list, don't do anything */
644	if (op->active_next || op->active_prev || op == active_objects)
645	return;
646		589
647	/* process_events() expects us to insert the object at the beginning	590	this->speed = speed;
648	* of the list. */
649	op->active_next = active_objects;
650		591
651	if (op->active_next != NULL)	592	if (has_active_speed ())
652	op->active_next->active_prev = op;	593	activate ();
653
654	active_objects = op;
655	}
656	else	594	else
657	{	595	deactivate ();
658	/* If not on the active list, nothing needs to be done */
659	if (!op->active_next && !op->active_prev && op != active_objects)
660	return;
661
662	if (op->active_prev == NULL)
663	{
664	active_objects = op->active_next;
665
666	if (op->active_next != NULL)
667	op->active_next->active_prev = NULL;
668	}
669	else
670	{
671	op->active_prev->active_next = op->active_next;
672
673	if (op->active_next)
674	op->active_next->active_prev = op->active_prev;
675	}
676
677	op->active_next = NULL;
678	op->active_prev = NULL;
679	}
680	}	596	}
681		597
682	/* This function removes object 'op' from the list of active
683	* objects.
684	* This should only be used for style maps or other such
685	* reference maps where you don't want an object that isn't
686	* in play chewing up cpu time getting processed.
687	* The reverse of this is to call update_ob_speed, which
688	* will do the right thing based on the speed of the object.
689	*/
690	void
691	remove_from_active_list (object *op)
692	{
693	/* If not on the active list, nothing needs to be done */
694	if (!op->active_next && !op->active_prev && op != active_objects)
695	return;
696
697	if (op->active_prev == NULL)
698	{
699	active_objects = op->active_next;
700	if (op->active_next != NULL)
701	op->active_next->active_prev = NULL;
702	}
703	else
704	{
705	op->active_prev->active_next = op->active_next;
706	if (op->active_next)
707	op->active_next->active_prev = op->active_prev;
708	}
709	op->active_next = NULL;
710	op->active_prev = NULL;
711	}
712
713	/*	598	/*
714	* update_object() updates the array which represents the map.	599	* update_object() updates the the map.
715	* It takes into account invisible objects (and represent squares covered	600	* It takes into account invisible objects (and represent squares covered
716	* by invisible objects by whatever is below them (unless it's another	601	* by invisible objects by whatever is below them (unless it's another
717	* invisible object, etc...)	602	* invisible object, etc...)
718	* If the object being updated is beneath a player, the look-window	603	* If the object being updated is beneath a player, the look-window
719	* of that player is updated (this might be a suboptimal way of	604	* of that player is updated (this might be a suboptimal way of
720	* updating that window, though, since update_object() is called _often_)	605	* updating that window, though, since update_object() is called _often_)
721	*	606	*
722	* action is a hint of what the caller believes need to be done.	607	* action is a hint of what the caller believes need to be done.
723	* For example, if the only thing that has changed is the face (due to
724	* an animation), we don't need to call update_position until that actually
725	* comes into view of a player. OTOH, many other things, like addition/removal
726	* of walls or living creatures may need us to update the flags now.
727	* current action are:	608	* current action are:
728	* UP_OBJ_INSERT: op was inserted	609	* UP_OBJ_INSERT: op was inserted
729	* UP_OBJ_REMOVE: op was removed	610	* UP_OBJ_REMOVE: op was removed
730	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update	611	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
731	* as that is easier than trying to look at what may have changed.	612	* as that is easier than trying to look at what may have changed.
732	* UP_OBJ_FACE: only the objects face has changed.	613	* UP_OBJ_FACE: only the objects face has changed.
733	*/	614	*/
734
735	void	615	void
736	update_object (object *op, int action)	616	update_object (object *op, int action)
737	{	617	{
738	int update_now = 0, flags;
739	MoveType move_on, move_off, move_block, move_slow;
740
741	if (op == NULL)	618	if (op == NULL)
742	{	619	{
743	/* this should never happen */	620	/* this should never happen */
744	LOG (llevDebug, "update_object() called for NULL object.\n");	621	LOG (llevDebug, "update_object() called for NULL object.\n");
745	return;	622	return;
746	}	623	}
747		624
748	if (op->env != NULL)	625	if (op->env)
749	{	626	{
750	/* Animation is currently handled by client, so nothing	627	/* Animation is currently handled by client, so nothing
751	* to do in this case.	628	* to do in this case.
752	*/	629	*/
753	return;	630	return;
…		…
758	*/	635	*/
759	if (!op->map || op->map->in_memory == MAP_SAVING)	636	if (!op->map || op->map->in_memory == MAP_SAVING)
760	return;	637	return;
761		638
762	/* make sure the object is within map boundaries */	639	/* make sure the object is within map boundaries */
763	if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))	640	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
764	{	641	{
765	LOG (llevError, "update_object() called for object out of map!\n");	642	LOG (llevError, "update_object() called for object out of map!\n");
766	#ifdef MANY_CORES	643	#ifdef MANY_CORES
767	abort ();	644	abort ();
768	#endif	645	#endif
769	return;	646	return;
770	}	647	}
771		648
772	flags = GET_MAP_FLAGS (op->map, op->x, op->y);	649	mapspace &m = op->ms ();
773	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
774	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
775	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
776	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
777	move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
778		650
		651	if (!(m.flags_ & P_UPTODATE))
		652	/* nop */;
779	if (action == UP_OBJ_INSERT)	653	else if (action == UP_OBJ_INSERT)
780	{	654	{
		655	// this is likely overkill, TODO: revisit (schmorp)
781	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))	656	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
782	update_now = 1;
783
784	if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))	657	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
785	update_now = 1;	658	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))
786		659	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
		660	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
787	if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))	661	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
788	update_now = 1;
789
790	if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
791	update_now = 1;
792
793	if (op->type == SAFE_GROUND && !(flags & P_SAFE))
794	update_now = 1;
795
796	if ((move_on | op->move_on) != move_on)	662	|| (m.move_on | op->move_on ) != m.move_on
797	update_now = 1;
798
799	if ((move_off | op->move_off) != move_off)	663	|| (m.move_off | op->move_off ) != m.move_off
800	update_now = 1;	664	|| (m.move_slow | op->move_slow) != m.move_slow
801
802	/* This isn't perfect, but I don't expect a lot of objects to	665	/* This isn't perfect, but I don't expect a lot of objects to
803	* to have move_allow right now.	666	* to have move_allow right now.
804	*/	667	*/
805	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	668	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
806	update_now = 1;	669	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
807		670	m.flags_ = 0;
808	if ((move_slow | op->move_slow) != move_slow)
809	update_now = 1;
810	}	671	}
811
812	/* if the object is being removed, we can't make intelligent	672	/* if the object is being removed, we can't make intelligent
813	* decisions, because remove_ob can't really pass the object	673	* decisions, because remove_ob can't really pass the object
814	* that is being removed.	674	* that is being removed.
815	*/	675	*/
816	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	676	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
817	update_now = 1;	677	m.flags_ = 0;
818	else if (action == UP_OBJ_FACE)	678	else if (action == UP_OBJ_FACE)
819	/* Nothing to do for that case */ ;	679	/* Nothing to do for that case */ ;
820	else	680	else
821	LOG (llevError, "update_object called with invalid action: %d\n", action);	681	LOG (llevError, "update_object called with invalid action: %d\n", action);
822		682
823	if (update_now)
824	{
825	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
826	update_position (op->map, op->x, op->y);
827	}
828
829	if (op->more != NULL)	683	if (op->more)
830	update_object (op->more, action);	684	update_object (op->more, action);
831	}
832
833	object::vector object::mortals;
834	object::vector object::objects; // not yet used
835	object *object::first;
836
837	void object::free_mortals ()
838	{
839	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
840	if ((*i)->refcnt)
841	++i; // further delay freeing
842	else
843	{
844	delete *i;
845	mortals.erase (i);
846	}
847	}	685	}
848		686
849	object::object ()	687	object::object ()
850	{	688	{
851	SET_FLAG (this, FLAG_REMOVED);	689	SET_FLAG (this, FLAG_REMOVED);
…		…
854	face = blank_face;	692	face = blank_face;
855	}	693	}
856		694
857	object::~object ()	695	object::~object ()
858	{	696	{
		697	unlink ();
		698
859	free_key_values (this);	699	free_key_values (this);
860	}	700	}
861		701
		702	static int object_count;
		703
862	void object::link ()	704	void object::link ()
863	{	705	{
864	count = ++ob_count;	706	assert (!index);//D
865	uuid = gen_uuid ();	707	uuid = gen_uuid ();
		708	count = ++object_count;
866		709
867	prev = 0;	710	refcnt_inc ();
868	next = object::first;	711	objects.insert (this);
869
870	if (object::first)
871	object::first->prev = this;
872
873	object::first = this;
874	}	712	}
875		713
876	void object::unlink ()	714	void object::unlink ()
877	{	715	{
878	if (this == object::first)	716	if (!index)
879	object::first = next;	717	return;
880		718
881	/* Remove this object from the list of used objects */	719	objects.erase (this);
882	if (prev) prev->next = next;	720	refcnt_dec ();
883	if (next) next->prev = prev;	721	}
884		722
885	prev = 0;	723	void
886	next = 0;	724	object::activate ()
		725	{
		726	/* If already on active list, don't do anything */
		727	if (active)
		728	return;
		729
		730	if (has_active_speed ())
		731	actives.insert (this);
		732	}
		733
		734	void
		735	object::activate_recursive ()
		736	{
		737	activate ();
		738
		739	for (object *op = inv; op; op = op->below)
		740	op->activate_recursive ();
		741	}
		742
		743	/* This function removes object 'op' from the list of active
		744	* objects.
		745	* This should only be used for style maps or other such
		746	* reference maps where you don't want an object that isn't
		747	* in play chewing up cpu time getting processed.
		748	* The reverse of this is to call update_ob_speed, which
		749	* will do the right thing based on the speed of the object.
		750	*/
		751	void
		752	object::deactivate ()
		753	{
		754	/* If not on the active list, nothing needs to be done */
		755	if (!active)
		756	return;
		757
		758	actives.erase (this);
		759	}
		760
		761	void
		762	object::deactivate_recursive ()
		763	{
		764	for (object *op = inv; op; op = op->below)
		765	op->deactivate_recursive ();
		766
		767	deactivate ();
		768	}
		769
		770	void
		771	object::set_flag_inv (int flag, int value)
		772	{
		773	for (object *op = inv; op; op = op->below)
		774	{
		775	op->flag [flag] = value;
		776	op->set_flag_inv (flag, value);
		777	}
		778	}
		779
		780	/*
		781	* Remove and free all objects in the inventory of the given object.
		782	* object.c ?
		783	*/
		784	void
		785	object::destroy_inv (bool drop_to_ground)
		786	{
		787	// need to check first, because the checks below might segfault
		788	// as we might be on an invalid mapspace and crossfire code
		789	// is too buggy to ensure that the inventory is empty.
		790	// corollary: if you create arrows etc. with stuff in tis inventory,
		791	// cf will crash below with off-map x and y
		792	if (!inv)
		793	return;
		794
		795	/* Only if the space blocks everything do we not process -
		796	* if some form of movement is allowed, let objects
		797	* drop on that space.
		798	*/
		799	if (!drop_to_ground
		800	|| !map
		801	|| map->in_memory != MAP_IN_MEMORY
		802	|| map->nodrop
		803	|| ms ().move_block == MOVE_ALL)
		804	{
		805	while (inv)
		806	{
		807	inv->destroy_inv (drop_to_ground);
		808	inv->destroy ();
		809	}
		810	}
		811	else
		812	{ /* Put objects in inventory onto this space */
		813	while (inv)
		814	{
		815	object *op = inv;
		816
		817	if (op->flag [FLAG_STARTEQUIP]
		818	|| op->flag [FLAG_NO_DROP]
		819	|| op->type == RUNE
		820	|| op->type == TRAP
		821	|| op->flag [FLAG_IS_A_TEMPLATE]
		822	|| op->flag [FLAG_DESTROY_ON_DEATH])
		823	op->destroy ();
		824	else
		825	map->insert (op, x, y);
		826	}
		827	}
887	}	828	}
888		829
889	object *object::create ()	830	object *object::create ()
890	{	831	{
891	object *op = new object;	832	object *op = new object;
892	op->link ();	833	op->link ();
893	return op;	834	return op;
894	}	835	}
895		836
896	/*	837	void
897	* free_object() frees everything allocated by an object, removes	838	object::do_destroy ()
898	* it from the list of used objects, and puts it on the list of
899	* free objects. The IS_FREED() flag is set in the object.
900	* The object must have been removed by remove_ob() first for
901	* this function to succeed.
902	*
903	* If destroy_inventory is set, free inventory as well. Else drop items in
904	* inventory to the ground.
905	*/
906	void object::destroy (bool destroy_inventory)
907	{	839	{
908	if (QUERY_FLAG (this, FLAG_FREED))	840	attachable::do_destroy ();
909	return;
910		841
911	if (QUERY_FLAG (this, FLAG_FRIENDLY))	842	if (flag [FLAG_IS_LINKED])
		843	remove_button_link (this);
		844
		845	if (flag [FLAG_FRIENDLY])
912	remove_friendly_object (this);	846	remove_friendly_object (this);
913		847
914	if (!QUERY_FLAG (this, FLAG_REMOVED))	848	if (!flag [FLAG_REMOVED])
915	remove ();	849	remove ();
916		850
917	SET_FLAG (this, FLAG_FREED);	851	destroy_inv (true);
918		852
919	if (more)	853	deactivate ();
920	{	854	unlink ();
921	more->destroy (destroy_inventory);
922	more = 0;
923	}
924		855
925	if (inv)	856	flag [FLAG_FREED] = 1;
926	{
927	/* Only if the space blocks everything do we not process -
928	* if some form of movement is allowed, let objects
929	* drop on that space.
930	*/
931	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
932	{
933	object *op = inv;
934
935	while (op)
936	{
937	object *tmp = op->below;
938	op->destroy (destroy_inventory);
939	op = tmp;
940	}
941	}
942	else
943	{ /* Put objects in inventory onto this space */
944	object *op = inv;
945
946	while (op)
947	{
948	object *tmp = op->below;
949
950	op->remove ();
951
952	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
953	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
954	op->destroy ();
955	else
956	{
957	op->x = x;
958	op->y = y;
959	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
960	}
961
962	op = tmp;
963	}
964	}
965	}
966		857
967	// hack to ensure that freed objects still have a valid map	858	// hack to ensure that freed objects still have a valid map
968	{	859	{
969	static maptile *freed_map; // freed objects are moved here to avoid crashes	860	static maptile *freed_map; // freed objects are moved here to avoid crashes
970		861
…		…
974		865
975	freed_map->name = "/internal/freed_objects_map";	866	freed_map->name = "/internal/freed_objects_map";
976	freed_map->width = 3;	867	freed_map->width = 3;
977	freed_map->height = 3;	868	freed_map->height = 3;
978		869
979	freed_map->allocate ();	870	freed_map->alloc ();
		871	freed_map->in_memory = MAP_IN_MEMORY;
980	}	872	}
981		873
982	map = freed_map;	874	map = freed_map;
983	x = 1;	875	x = 1;
984	y = 1;	876	y = 1;
985	}	877	}
986		878
		879	head = 0;
		880
		881	if (more)
		882	{
		883	more->destroy ();
		884	more = 0;
		885	}
		886
987	// clear those pointers that likely might have circular references to us	887	// clear those pointers that likely might have circular references to us
988	owner = 0;	888	owner = 0;
989	enemy = 0;	889	enemy = 0;
990	attacked_by = 0;	890	attacked_by = 0;
		891	}
991		892
992	// only relevant for players(?), but make sure of it anyways	893	void
993	contr = 0;	894	object::destroy (bool destroy_inventory)
		895	{
		896	if (destroyed ())
		897	return;
994		898
995	/* Remove object from the active list */	899	if (destroy_inventory)
996	speed = 0;	900	destroy_inv (false);
997	update_ob_speed (this);
998		901
999	unlink ();	902	attachable::destroy ();
1000
1001	mortals.push_back (this);
1002	}	903	}
1003		904
1004	/*	905	/*
1005	* sub_weight() recursively (outwards) subtracts a number from the	906	* sub_weight() recursively (outwards) subtracts a number from the
1006	* weight of an object (and what is carried by it's environment(s)).	907	* weight of an object (and what is carried by it's environment(s)).
…		…
1022	* This function removes the object op from the linked list of objects	923	* This function removes the object op from the linked list of objects
1023	* which it is currently tied to. When this function is done, the	924	* which it is currently tied to. When this function is done, the
1024	* object will have no environment. If the object previously had an	925	* object will have no environment. If the object previously had an
1025	* environment, the x and y coordinates will be updated to	926	* environment, the x and y coordinates will be updated to
1026	* the previous environment.	927	* the previous environment.
1027	* Beware: This function is called from the editor as well!
1028	*/	928	*/
1029	void	929	void
1030	object::remove ()	930	object::do_remove ()
1031	{	931	{
1032	object *tmp, *last = 0;	932	object *tmp, *last = 0;
1033	object *otmp;	933	object *otmp;
1034		934
1035	int check_walk_off;
1036
1037	if (QUERY_FLAG (this, FLAG_REMOVED))	935	if (QUERY_FLAG (this, FLAG_REMOVED))
1038	return;	936	return;
1039		937
1040	SET_FLAG (this, FLAG_REMOVED);	938	SET_FLAG (this, FLAG_REMOVED);
		939	INVOKE_OBJECT (REMOVE, this);
1041		940
1042	if (more)	941	if (more)
1043	more->remove ();	942	more->remove ();
1044		943
1045	/*	944	/*
…		…
1055		954
1056	/* NO_FIX_PLAYER is set when a great many changes are being	955	/* NO_FIX_PLAYER is set when a great many changes are being
1057	* made to players inventory. If set, avoiding the call	956	* made to players inventory. If set, avoiding the call
1058	* to save cpu time.	957	* to save cpu time.
1059	*/	958	*/
1060	if ((otmp = is_player_inv (env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	959	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1061	fix_player (otmp);	960	otmp->update_stats ();
1062		961
1063	if (above != NULL)	962	if (above)
1064	above->below = below;	963	above->below = below;
1065	else	964	else
1066	env->inv = below;	965	env->inv = below;
1067		966
1068	if (below != NULL)	967	if (below)
1069	below->above = above;	968	below->above = above;
1070		969
1071	/* we set up values so that it could be inserted into	970	/* we set up values so that it could be inserted into
1072	* the map, but we don't actually do that - it is up	971	* the map, but we don't actually do that - it is up
1073	* to the caller to decide what we want to do.	972	* to the caller to decide what we want to do.
…		…
1077	above = 0, below = 0;	976	above = 0, below = 0;
1078	env = 0;	977	env = 0;
1079	}	978	}
1080	else if (map)	979	else if (map)
1081	{	980	{
1082	/* Re did the following section of code - it looks like it had	981	if (type == PLAYER)
1083	* lots of logic for things we no longer care about
1084	*/	982	{
		983	// leaving a spot always closes any open container on the ground
		984	if (container && !container->env)
		985	// this causes spurious floorbox updates, but it ensures
		986	// that the CLOSE event is being sent.
		987	close_container ();
		988
		989	--map->players;
		990	map->touch ();
		991	}
		992
		993	map->dirty = true;
		994	mapspace &ms = this->ms ();
1085		995
1086	/* link the object above us */	996	/* link the object above us */
1087	if (above)	997	if (above)
1088	above->below = below;	998	above->below = below;
1089	else	999	else
1090	SET_MAP_TOP (map, x, y, below); /* we were top, set new top */	1000	ms.top = below; /* we were top, set new top */
1091		1001
1092	/* Relink the object below us, if there is one */	1002	/* Relink the object below us, if there is one */
1093	if (below)	1003	if (below)
1094	below->above = above;	1004	below->above = above;
1095	else	1005	else
…		…
1097	/* Nothing below, which means we need to relink map object for this space	1007	/* Nothing below, which means we need to relink map object for this space
1098	* use translated coordinates in case some oddness with map tiling is	1008	* use translated coordinates in case some oddness with map tiling is
1099	* evident	1009	* evident
1100	*/	1010	*/
1101	if (GET_MAP_OB (map, x, y) != this)	1011	if (GET_MAP_OB (map, x, y) != this)
1102	{
1103	char *dump = dump_object (this);
1104	LOG (llevError,
1105	"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);	1012	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 ());
1106	free (dump);
1107	dump = dump_object (GET_MAP_OB (map, x, y));
1108	LOG (llevError, "%s\n", dump);
1109	free (dump);
1110	}
1111		1013
1112	SET_MAP_OB (map, x, y, above); /* goes on above it. */	1014	ms.bot = above; /* goes on above it. */
1113	}	1015	}
1114		1016
1115	above = 0;	1017	above = 0;
1116	below = 0;	1018	below = 0;
1117		1019
1118	if (map->in_memory == MAP_SAVING)	1020	if (map->in_memory == MAP_SAVING)
1119	return;	1021	return;
1120		1022
1121	check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);	1023	int check_walk_off = !flag [FLAG_NO_APPLY];
1122		1024
1123	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	1025	for (tmp = ms.bot; tmp; tmp = tmp->above)
1124	{	1026	{
1125	/* No point updating the players look faces if he is the object	1027	/* No point updating the players look faces if he is the object
1126	* being removed.	1028	* being removed.
1127	*/	1029	*/
1128		1030
…		…
1132	* removed (most likely destroyed), update the player view	1034	* removed (most likely destroyed), update the player view
1133	* appropriately.	1035	* appropriately.
1134	*/	1036	*/
1135	if (tmp->container == this)	1037	if (tmp->container == this)
1136	{	1038	{
1137	CLEAR_FLAG (this, FLAG_APPLIED);	1039	flag [FLAG_APPLIED] = 0;
1138	tmp->container = 0;	1040	tmp->container = 0;
1139	}	1041	}
1140		1042
		1043	if (tmp->contr->ns)
1141	tmp->contr->socket->floorbox_update ();	1044	tmp->contr->ns->floorbox_update ();
1142	}	1045	}
1143		1046
1144	/* See if player moving off should effect something */	1047	/* See if object moving off should effect something */
1145	if (check_walk_off	1048	if (check_walk_off
1146	&& ((move_type & tmp->move_off)	1049	&& ((move_type & tmp->move_off)
1147	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1050	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1148	{	1051	{
1149	move_apply (tmp, this, 0);	1052	move_apply (tmp, this, 0);
…		…
1151	if (destroyed ())	1054	if (destroyed ())
1152	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1055	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1153	}	1056	}
1154		1057
1155	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1058	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1156		1059	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1157	if (tmp->above == tmp)	1060	if (tmp->above == tmp)
1158	tmp->above = 0;	1061	tmp->above = 0;
1159		1062
1160	last = tmp;	1063	last = tmp;
1161	}	1064	}
1162		1065
1163	/* last == NULL of there are no objects on this space */	1066	/* last == NULL if there are no objects on this space */
		1067	//TODO: this makes little sense, why only update the topmost object?
1164	if (!last)	1068	if (!last)
1165	{	1069	map->at (x, y).flags_ = 0;
1166	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1167	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1168	* those out anyways, and if there are any flags set right now, they won't
1169	* be correct anyways.
1170	*/
1171	SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE);
1172	update_position (map, x, y);
1173	}
1174	else	1070	else
1175	update_object (last, UP_OBJ_REMOVE);	1071	update_object (last, UP_OBJ_REMOVE);
1176		1072
1177	if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)	1073	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1178	update_all_los (map, x, y);	1074	update_all_los (map, x, y);
1179	}	1075	}
1180	}	1076	}
1181		1077
1182	/*	1078	/*
…		…
1191	merge_ob (object *op, object *top)	1087	merge_ob (object *op, object *top)
1192	{	1088	{
1193	if (!op->nrof)	1089	if (!op->nrof)
1194	return 0;	1090	return 0;
1195		1091
1196	if (top == NULL)	1092	if (top)
1197	for (top = op; top != NULL && top->above != NULL; top = top->above);	1093	for (top = op; top && top->above; top = top->above)
		1094	;
1198		1095
1199	for (; top != NULL; top = top->below)	1096	for (; top; top = top->below)
1200	{	1097	{
1201	if (top == op)	1098	if (top == op)
1202	continue;	1099	continue;
1203		1100
1204	if (object::can_merge (op, top))	1101	if (object::can_merge (op, top))
…		…
1213	}	1110	}
1214		1111
1215	return 0;	1112	return 0;
1216	}	1113	}
1217		1114
		1115	void
		1116	object::expand_tail ()
		1117	{
		1118	if (more)
		1119	return;
		1120
		1121	object *prev = this;
		1122
		1123	for (archetype *at = arch->more; at; at = at->more)
		1124	{
		1125	object *op = arch_to_object (at);
		1126
		1127	op->name = name;
		1128	op->name_pl = name_pl;
		1129	op->title = title;
		1130
		1131	op->head = this;
		1132	prev->more = op;
		1133
		1134	prev = op;
		1135	}
		1136	}
		1137
1218	/*	1138	/*
1219	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1139	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1220	* job preparing multi-part monsters	1140	* job preparing multi-part monsters.
1221	*/	1141	*/
1222	object *	1142	object *
1223	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1143	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1224	{	1144	{
1225	object *tmp;
1226
1227	if (op->head)
1228	op = op->head;
1229
1230	for (tmp = op; tmp; tmp = tmp->more)	1145	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1231	{	1146	{
1232	tmp->x = x + tmp->arch->clone.x;	1147	tmp->x = x + tmp->arch->clone.x;
1233	tmp->y = y + tmp->arch->clone.y;	1148	tmp->y = y + tmp->arch->clone.y;
1234	}	1149	}
1235		1150
…		…
1254	* Return value:	1169	* Return value:
1255	* new object if 'op' was merged with other object	1170	* new object if 'op' was merged with other object
1256	* NULL if 'op' was destroyed	1171	* NULL if 'op' was destroyed
1257	* just 'op' otherwise	1172	* just 'op' otherwise
1258	*/	1173	*/
1259
1260	object *	1174	object *
1261	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1175	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1262	{	1176	{
		1177	assert (!op->flag [FLAG_FREED]);
		1178
1263	object *tmp, *top, *floor = NULL;	1179	object *tmp, *top, *floor = NULL;
1264	sint16 x, y;
1265		1180
1266	if (QUERY_FLAG (op, FLAG_FREED))	1181	op->remove ();
1267	{
1268	LOG (llevError, "Trying to insert freed object!\n");
1269	return NULL;
1270	}
1271		1182
1272	if (m == NULL)	1183	#if 0
1273	{	1184	if (!m->active != !op->active)
1274	char *dump = dump_object (op);	1185	if (m->active)
1275	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1186	op->activate_recursive ();
1276	free (dump);	1187	else
1277	return op;	1188	op->deactivate_recursive ();
1278	}	1189	#endif
1279		1190
1280	if (out_of_map (m, op->x, op->y))	1191	if (out_of_map (m, op->x, op->y))
1281	{	1192	{
1282	char *dump = dump_object (op);
1283	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);	1193	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1284	#ifdef MANY_CORES	1194	#ifdef MANY_CORES
1285	/* Better to catch this here, as otherwise the next use of this object	1195	/* Better to catch this here, as otherwise the next use of this object
1286	* is likely to cause a crash. Better to find out where it is getting	1196	* is likely to cause a crash. Better to find out where it is getting
1287	* improperly inserted.	1197	* improperly inserted.
1288	*/	1198	*/
1289	abort ();	1199	abort ();
1290	#endif	1200	#endif
1291	free (dump);
1292	return op;	1201	return op;
1293	}	1202	}
1294		1203
1295	if (!QUERY_FLAG (op, FLAG_REMOVED))
1296	{
1297	char *dump = dump_object (op);
1298	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1299	free (dump);
1300	return op;
1301	}
1302
1303	if (op->more != NULL)
1304	{
1305	/* The part may be on a different map. */
1306
1307	object *more = op->more;	1204	if (object *more = op->more)
1308		1205	{
1309	/* We really need the caller to normalize coordinates - if
1310	* we set the map, that doesn't work if the location is within
1311	* a map and this is straddling an edge. So only if coordinate
1312	* is clear wrong do we normalize it.
1313	*/
1314	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1315	more->map = get_map_from_coord (m, &more->x, &more->y);
1316	else if (!more->map)
1317	{
1318	/* For backwards compatibility - when not dealing with tiled maps,
1319	* more->map should always point to the parent.
1320	*/
1321	more->map = m;
1322	}
1323
1324	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1206	if (!insert_ob_in_map (more, m, originator, flag))
1325	{	1207	{
1326	if (!op->head)	1208	if (!op->head)
1327	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1209	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1328		1210
1329	return NULL;	1211	return 0;
1330	}	1212	}
1331	}	1213	}
1332		1214
1333	CLEAR_FLAG (op, FLAG_REMOVED);	1215	CLEAR_FLAG (op, FLAG_REMOVED);
1334		1216
1335	/* Ideally, the caller figures this out. However, it complicates a lot	1217	/* Ideally, the caller figures this out. However, it complicates a lot
1336	* of areas of callers (eg, anything that uses find_free_spot would now	1218	* of areas of callers (eg, anything that uses find_free_spot would now
1337	* need extra work	1219	* need extra work
1338	*/	1220	*/
1339	op->map = get_map_from_coord (m, &op->x, &op->y);	1221	if (!xy_normalise (m, op->x, op->y))
1340	x = op->x;	1222	return 0;
1341	y = op->y;	1223
		1224	op->map = m;
		1225	mapspace &ms = op->ms ();
1342		1226
1343	/* this has to be done after we translate the coordinates.	1227	/* this has to be done after we translate the coordinates.
1344	*/	1228	*/
1345	if (op->nrof && !(flag & INS_NO_MERGE))	1229	if (op->nrof && !(flag & INS_NO_MERGE))
1346	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1230	for (tmp = ms.bot; tmp; tmp = tmp->above)
1347	if (object::can_merge (op, tmp))	1231	if (object::can_merge (op, tmp))
1348	{	1232	{
1349	op->nrof += tmp->nrof;	1233	op->nrof += tmp->nrof;
1350	tmp->destroy ();	1234	tmp->destroy ();
1351	}	1235	}
…		…
1368	op->below = originator->below;	1252	op->below = originator->below;
1369		1253
1370	if (op->below)	1254	if (op->below)
1371	op->below->above = op;	1255	op->below->above = op;
1372	else	1256	else
1373	SET_MAP_OB (op->map, op->x, op->y, op);	1257	ms.bot = op;
1374		1258
1375	/* since *below* originator, no need to update top */	1259	/* since *below* originator, no need to update top */
1376	originator->below = op;	1260	originator->below = op;
1377	}	1261	}
1378	else	1262	else
1379	{	1263	{
		1264	top = ms.bot;
		1265
1380	/* If there are other objects, then */	1266	/* If there are other objects, then */
1381	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1267	if ((!(flag & INS_MAP_LOAD)) && top)
1382	{	1268	{
1383	object *last = NULL;	1269	object *last = 0;
1384		1270
1385	/*	1271	/*
1386	* If there are multiple objects on this space, we do some trickier handling.	1272	* If there are multiple objects on this space, we do some trickier handling.
1387	* We've already dealt with merging if appropriate.	1273	* We've already dealt with merging if appropriate.
1388	* Generally, we want to put the new object on top. But if	1274	* Generally, we want to put the new object on top. But if
…		…
1392	* once we get to them. This reduces the need to traverse over all of	1278	* once we get to them. This reduces the need to traverse over all of
1393	* them when adding another one - this saves quite a bit of cpu time	1279	* them when adding another one - this saves quite a bit of cpu time
1394	* when lots of spells are cast in one area. Currently, it is presumed	1280	* when lots of spells are cast in one area. Currently, it is presumed
1395	* that flying non pickable objects are spell objects.	1281	* that flying non pickable objects are spell objects.
1396	*/	1282	*/
1397		1283	for (top = ms.bot; top; top = top->above)
1398	while (top != NULL)
1399	{	1284	{
1400	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1285	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1401	floor = top;	1286	floor = top;
1402		1287
1403	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1288	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1406	top = top->below;	1291	top = top->below;
1407	break;	1292	break;
1408	}	1293	}
1409		1294
1410	last = top;	1295	last = top;
1411	top = top->above;
1412	}	1296	}
1413		1297
1414	/* Don't want top to be NULL, so set it to the last valid object */	1298	/* Don't want top to be NULL, so set it to the last valid object */
1415	top = last;	1299	top = last;
1416		1300
…		…
1418	* looks like instead of lots of conditions here.	1302	* looks like instead of lots of conditions here.
1419	* makes things faster, and effectively the same result.	1303	* makes things faster, and effectively the same result.
1420	*/	1304	*/
1421		1305
1422	/* Have object 'fall below' other objects that block view.	1306	/* Have object 'fall below' other objects that block view.
1423	* Unless those objects are exits, type 66	1307	* Unless those objects are exits.
1424	* If INS_ON_TOP is used, don't do this processing	1308	* If INS_ON_TOP is used, don't do this processing
1425	* Need to find the object that in fact blocks view, otherwise	1309	* Need to find the object that in fact blocks view, otherwise
1426	* stacking is a bit odd.	1310	* stacking is a bit odd.
1427	*/	1311	*/
1428	if (!(flag & INS_ON_TOP) &&	1312	if (!(flag & INS_ON_TOP)
1429	(get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1313	&& ms.flags () & P_BLOCKSVIEW
		1314	&& (op->face && !faces [op->face].visibility))
1430	{	1315	{
1431	for (last = top; last != floor; last = last->below)	1316	for (last = top; last != floor; last = last->below)
1432	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1317	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1433	break;	1318	break;
		1319
1434	/* Check to see if we found the object that blocks view,	1320	/* Check to see if we found the object that blocks view,
1435	* and make sure we have a below pointer for it so that	1321	* and make sure we have a below pointer for it so that
1436	* we can get inserted below this one, which requires we	1322	* we can get inserted below this one, which requires we
1437	* set top to the object below us.	1323	* set top to the object below us.
1438	*/	1324	*/
…		…
1440	top = last->below;	1326	top = last->below;
1441	}	1327	}
1442	} /* If objects on this space */	1328	} /* If objects on this space */
1443		1329
1444	if (flag & INS_MAP_LOAD)	1330	if (flag & INS_MAP_LOAD)
1445	top = GET_MAP_TOP (op->map, op->x, op->y);	1331	top = ms.top;
1446		1332
1447	if (flag & INS_ABOVE_FLOOR_ONLY)	1333	if (flag & INS_ABOVE_FLOOR_ONLY)
1448	top = floor;	1334	top = floor;
1449		1335
1450	/* Top is the object that our object (op) is going to get inserted above.	1336	/* Top is the object that our object (op) is going to get inserted above.
1451	*/	1337	*/
1452		1338
1453	/* First object on this space */	1339	/* First object on this space */
1454	if (!top)	1340	if (!top)
1455	{	1341	{
1456	op->above = GET_MAP_OB (op->map, op->x, op->y);	1342	op->above = ms.bot;
1457		1343
1458	if (op->above)	1344	if (op->above)
1459	op->above->below = op;	1345	op->above->below = op;
1460		1346
1461	op->below = NULL;	1347	op->below = 0;
1462	SET_MAP_OB (op->map, op->x, op->y, op);	1348	ms.bot = op;
1463	}	1349	}
1464	else	1350	else
1465	{ /* get inserted into the stack above top */	1351	{ /* get inserted into the stack above top */
1466	op->above = top->above;	1352	op->above = top->above;
1467		1353
…		…
1470		1356
1471	op->below = top;	1357	op->below = top;
1472	top->above = op;	1358	top->above = op;
1473	}	1359	}
1474		1360
1475	if (op->above == NULL)	1361	if (!op->above)
1476	SET_MAP_TOP (op->map, op->x, op->y, op);	1362	ms.top = op;
1477	} /* else not INS_BELOW_ORIGINATOR */	1363	} /* else not INS_BELOW_ORIGINATOR */
1478		1364
1479	if (op->type == PLAYER)	1365	if (op->type == PLAYER)
		1366	{
1480	op->contr->do_los = 1;	1367	op->contr->do_los = 1;
		1368	++op->map->players;
		1369	op->map->touch ();
		1370	}
		1371
		1372	op->map->dirty = true;
1481		1373
1482	/* If we have a floor, we know the player, if any, will be above	1374	/* If we have a floor, we know the player, if any, will be above
1483	* it, so save a few ticks and start from there.	1375	* it, so save a few ticks and start from there.
1484	*/	1376	*/
1485	if (!(flag & INS_MAP_LOAD))	1377	if (!(flag & INS_MAP_LOAD))
1486	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1378	if (object *pl = ms.player ())
1487	if (tmp->type == PLAYER)	1379	if (pl->contr->ns)
1488	tmp->contr->socket->floorbox_update ();	1380	pl->contr->ns->floorbox_update ();
1489		1381
1490	/* If this object glows, it may affect lighting conditions that are	1382	/* If this object glows, it may affect lighting conditions that are
1491	* visible to others on this map. But update_all_los is really	1383	* visible to others on this map. But update_all_los is really
1492	* an inefficient way to do this, as it means los for all players	1384	* an inefficient way to do this, as it means los for all players
1493	* on the map will get recalculated. The players could very well	1385	* on the map will get recalculated. The players could very well
1494	* be far away from this change and not affected in any way -	1386	* be far away from this change and not affected in any way -
1495	* this should get redone to only look for players within range,	1387	* this should get redone to only look for players within range,
1496	* or just updating the P_NEED_UPDATE for spaces within this area	1388	* or just updating the P_UPTODATE for spaces within this area
1497	* of effect may be sufficient.	1389	* of effect may be sufficient.
1498	*/	1390	*/
1499	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1391	if (op->map->darkness && (op->glow_radius != 0))
1500	update_all_los (op->map, op->x, op->y);	1392	update_all_los (op->map, op->x, op->y);
1501		1393
1502	/* updates flags (blocked, alive, no magic, etc) for this map space */	1394	/* updates flags (blocked, alive, no magic, etc) for this map space */
1503	update_object (op, UP_OBJ_INSERT);	1395	update_object (op, UP_OBJ_INSERT);
		1396
		1397	INVOKE_OBJECT (INSERT, op);
1504		1398
1505	/* Don't know if moving this to the end will break anything. However,	1399	/* Don't know if moving this to the end will break anything. However,
1506	* we want to have floorbox_update called before calling this.	1400	* we want to have floorbox_update called before calling this.
1507	*	1401	*
1508	* check_move_on() must be after this because code called from	1402	* check_move_on() must be after this because code called from
…		…
1513		1407
1514	/* if this is not the head or flag has been passed, don't check walk on status */	1408	/* if this is not the head or flag has been passed, don't check walk on status */
1515	if (!(flag & INS_NO_WALK_ON) && !op->head)	1409	if (!(flag & INS_NO_WALK_ON) && !op->head)
1516	{	1410	{
1517	if (check_move_on (op, originator))	1411	if (check_move_on (op, originator))
1518	return NULL;	1412	return 0;
1519		1413
1520	/* If we are a multi part object, lets work our way through the check	1414	/* If we are a multi part object, lets work our way through the check
1521	* walk on's.	1415	* walk on's.
1522	*/	1416	*/
1523	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1417	for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1524	if (check_move_on (tmp, originator))	1418	if (check_move_on (tmp, originator))
1525	return NULL;	1419	return 0;
1526	}	1420	}
1527		1421
1528	return op;	1422	return op;
1529	}	1423	}
1530		1424
1531	/* this function inserts an object in the map, but if it	1425	/* this function inserts an object in the map, but if it
1532	* finds an object of its own type, it'll remove that one first.	1426	* finds an object of its own type, it'll remove that one first.
1533	* op is the object to insert it under: supplies x and the map.	1427	* op is the object to insert it under: supplies x and the map.
1534	*/	1428	*/
1535	void	1429	void
1536	replace_insert_ob_in_map (const char *arch_string, object *op)	1430	replace_insert_ob_in_map (const char *arch_string, object *op)
1537	{	1431	{
1538	object *	1432	object *tmp, *tmp1;
1539	tmp;
1540	object *
1541	tmp1;
1542		1433
1543	/* first search for itself and remove any old instances */	1434	/* first search for itself and remove any old instances */
1544		1435
1545	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1436	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1546	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1437	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1547	tmp->destroy ();	1438	tmp->destroy ();
1548		1439
1549	tmp1 = arch_to_object (archetype::find (arch_string));	1440	tmp1 = arch_to_object (archetype::find (arch_string));
1550		1441
1551	tmp1->x = op->x;	1442	tmp1->x = op->x;
1552	tmp1->y = op->y;	1443	tmp1->y = op->y;
1553	insert_ob_in_map (tmp1, op->map, op, 0);	1444	insert_ob_in_map (tmp1, op->map, op, 0);
		1445	}
		1446
		1447	object *
		1448	object::insert_at (object *where, object *originator, int flags)
		1449	{
		1450	return where->map->insert (this, where->x, where->y, originator, flags);
1554	}	1451	}
1555		1452
1556	/*	1453	/*
1557	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1454	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1558	* is returned contains nr objects, and the remaining parts contains	1455	* is returned contains nr objects, and the remaining parts contains
1559	* the rest (or is removed and freed if that number is 0).	1456	* the rest (or is removed and freed if that number is 0).
1560	* On failure, NULL is returned, and the reason put into the	1457	* On failure, NULL is returned, and the reason put into the
1561	* global static errmsg array.	1458	* global static errmsg array.
1562	*/	1459	*/
1563
1564	object *	1460	object *
1565	get_split_ob (object *orig_ob, uint32 nr)	1461	get_split_ob (object *orig_ob, uint32 nr)
1566	{	1462	{
1567	object *newob;	1463	object *newob;
1568	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1464	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1599	* the amount of an object. If the amount reaches 0, the object	1495	* the amount of an object. If the amount reaches 0, the object
1600	* is subsequently removed and freed.	1496	* is subsequently removed and freed.
1601	*	1497	*
1602	* Return value: 'op' if something is left, NULL if the amount reached 0	1498	* Return value: 'op' if something is left, NULL if the amount reached 0
1603	*/	1499	*/
1604
1605	object *	1500	object *
1606	decrease_ob_nr (object *op, uint32 i)	1501	decrease_ob_nr (object *op, uint32 i)
1607	{	1502	{
1608	object *tmp;	1503	object *tmp;
1609	player *pl;
1610		1504
1611	if (i == 0) /* objects with op->nrof require this check */	1505	if (i == 0) /* objects with op->nrof require this check */
1612	return op;	1506	return op;
1613		1507
1614	if (i > op->nrof)	1508	if (i > op->nrof)
1615	i = op->nrof;	1509	i = op->nrof;
1616		1510
1617	if (QUERY_FLAG (op, FLAG_REMOVED))	1511	if (QUERY_FLAG (op, FLAG_REMOVED))
1618	op->nrof -= i;	1512	op->nrof -= i;
1619	else if (op->env != NULL)	1513	else if (op->env)
1620	{	1514	{
1621	/* is this object in the players inventory, or sub container	1515	/* is this object in the players inventory, or sub container
1622	* therein?	1516	* therein?
1623	*/	1517	*/
1624	tmp = is_player_inv (op->env);	1518	tmp = op->in_player ();
1625	/* nope. Is this a container the player has opened?	1519	/* nope. Is this a container the player has opened?
1626	* If so, set tmp to that player.	1520	* If so, set tmp to that player.
1627	* IMO, searching through all the players will mostly	1521	* IMO, searching through all the players will mostly
1628	* likely be quicker than following op->env to the map,	1522	* likely be quicker than following op->env to the map,
1629	* and then searching the map for a player.	1523	* and then searching the map for a player.
1630	*/	1524	*/
1631	if (!tmp)	1525	if (!tmp)
1632	{	1526	for_all_players (pl)
1633	for (pl = first_player; pl; pl = pl->next)
1634	if (pl->ob->container == op->env)	1527	if (pl->ob->container == op->env)
		1528	{
		1529	tmp = pl->ob;
1635	break;	1530	break;
1636	if (pl)
1637	tmp = pl->ob;
1638	else
1639	tmp = NULL;
1640	}	1531	}
1641		1532
1642	if (i < op->nrof)	1533	if (i < op->nrof)
1643	{	1534	{
1644	sub_weight (op->env, op->weight * i);	1535	sub_weight (op->env, op->weight * i);
1645	op->nrof -= i;	1536	op->nrof -= i;
1646	if (tmp)	1537	if (tmp)
1647	{
1648	esrv_send_item (tmp, op);	1538	esrv_send_item (tmp, op);
1649	}
1650	}	1539	}
1651	else	1540	else
1652	{	1541	{
1653	op->remove ();	1542	op->remove ();
1654	op->nrof = 0;	1543	op->nrof = 0;
1655	if (tmp)	1544	if (tmp)
1656	{
1657	esrv_del_item (tmp->contr, op->count);	1545	esrv_del_item (tmp->contr, op->count);
1658	}
1659	}	1546	}
1660	}	1547	}
1661	else	1548	else
1662	{	1549	{
1663	object *above = op->above;	1550	object *above = op->above;
…		…
1669	op->remove ();	1556	op->remove ();
1670	op->nrof = 0;	1557	op->nrof = 0;
1671	}	1558	}
1672		1559
1673	/* Since we just removed op, op->above is null */	1560	/* Since we just removed op, op->above is null */
1674	for (tmp = above; tmp != NULL; tmp = tmp->above)	1561	for (tmp = above; tmp; tmp = tmp->above)
1675	if (tmp->type == PLAYER)	1562	if (tmp->type == PLAYER)
1676	{	1563	{
1677	if (op->nrof)	1564	if (op->nrof)
1678	esrv_send_item (tmp, op);	1565	esrv_send_item (tmp, op);
1679	else	1566	else
…		…
1684	if (op->nrof)	1571	if (op->nrof)
1685	return op;	1572	return op;
1686	else	1573	else
1687	{	1574	{
1688	op->destroy ();	1575	op->destroy ();
1689	return NULL;	1576	return 0;
1690	}	1577	}
1691	}	1578	}
1692		1579
1693	/*	1580	/*
1694	* add_weight(object, weight) adds the specified weight to an object,	1581	* add_weight(object, weight) adds the specified weight to an object,
1695	* and also updates how much the environment(s) is/are carrying.	1582	* and also updates how much the environment(s) is/are carrying.
1696	*/	1583	*/
1697
1698	void	1584	void
1699	add_weight (object *op, signed long weight)	1585	add_weight (object *op, signed long weight)
1700	{	1586	{
1701	while (op != NULL)	1587	while (op != NULL)
1702	{	1588	{
…		…
1734	* inside the object environment.	1620	* inside the object environment.
1735	*	1621	*
1736	* The function returns now pointer to inserted item, and return value can	1622	* The function returns now pointer to inserted item, and return value can
1737	* be != op, if items are merged. -Tero	1623	* be != op, if items are merged. -Tero
1738	*/	1624	*/
1739
1740	object *	1625	object *
1741	object::insert (object *op)	1626	object::insert (object *op)
1742	{	1627	{
1743	object *tmp, *otmp;	1628	object *tmp, *otmp;
1744		1629
…		…
1782	add_weight (this, op->weight * op->nrof);	1667	add_weight (this, op->weight * op->nrof);
1783	}	1668	}
1784	else	1669	else
1785	add_weight (this, (op->weight + op->carrying));	1670	add_weight (this, (op->weight + op->carrying));
1786		1671
1787	otmp = is_player_inv (this);	1672	otmp = this->in_player ();
1788	if (otmp && otmp->contr)	1673	if (otmp && otmp->contr)
1789	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1674	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1790	fix_player (otmp);	1675	otmp->update_stats ();
1791		1676
1792	op->map = NULL;	1677	op->map = 0;
1793	op->env = this;	1678	op->env = this;
1794	op->above = NULL;	1679	op->above = 0;
1795	op->below = NULL;	1680	op->below = 0;
1796	op->x = 0, op->y = 0;	1681	op->x = 0, op->y = 0;
1797		1682
1798	/* reset the light list and los of the players on the map */	1683	/* reset the light list and los of the players on the map */
1799	if ((op->glow_radius != 0) && map)	1684	if ((op->glow_radius != 0) && map)
1800	{	1685	{
1801	#ifdef DEBUG_LIGHTS	1686	#ifdef DEBUG_LIGHTS
1802	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1687	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1803	#endif /* DEBUG_LIGHTS */	1688	#endif /* DEBUG_LIGHTS */
1804	if (MAP_DARKNESS (map))	1689	if (map->darkness)
1805	update_all_los (map, x, y);	1690	update_all_los (map, x, y);
1806	}	1691	}
1807		1692
1808	/* Client has no idea of ordering so lets not bother ordering it here.	1693	/* Client has no idea of ordering so lets not bother ordering it here.
1809	* It sure simplifies this function...	1694	* It sure simplifies this function...
…		…
1814	{	1699	{
1815	op->below = inv;	1700	op->below = inv;
1816	op->below->above = op;	1701	op->below->above = op;
1817	inv = op;	1702	inv = op;
1818	}	1703	}
		1704
		1705	INVOKE_OBJECT (INSERT, this);
1819		1706
1820	return op;	1707	return op;
1821	}	1708	}
1822		1709
1823	/*	1710	/*
…		…
1838	*	1725	*
1839	* MSW 2001-07-08: Check all objects on space, not just those below	1726	* MSW 2001-07-08: Check all objects on space, not just those below
1840	* object being inserted. insert_ob_in_map may not put new objects	1727	* object being inserted. insert_ob_in_map may not put new objects
1841	* on top.	1728	* on top.
1842	*/	1729	*/
1843
1844	int	1730	int
1845	check_move_on (object *op, object *originator)	1731	check_move_on (object *op, object *originator)
1846	{	1732	{
1847	object *tmp;	1733	object *tmp;
1848	maptile *m = op->map;	1734	maptile *m = op->map;
…		…
1875		1761
1876	/* The objects have to be checked from top to bottom.	1762	/* The objects have to be checked from top to bottom.
1877	* Hence, we first go to the top:	1763	* Hence, we first go to the top:
1878	*/	1764	*/
1879		1765
1880	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1766	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1881	{	1767	{
1882	/* Trim the search when we find the first other spell effect	1768	/* Trim the search when we find the first other spell effect
1883	* this helps performance so that if a space has 50 spell objects,	1769	* this helps performance so that if a space has 50 spell objects,
1884	* we don't need to check all of them.	1770	* we don't need to check all of them.
1885	*/	1771	*/
…		…
1903	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1789	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1904	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1790	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1905	{	1791	{
1906		1792
1907	float	1793	float
1908	diff = tmp->move_slow_penalty * FABS (op->speed);	1794	diff = tmp->move_slow_penalty * fabs (op->speed);
1909		1795
1910	if (op->type == PLAYER)	1796	if (op->type == PLAYER)
1911	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1797	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1912	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1798	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1913	diff /= 4.0;	1799	diff /= 4.0;
…		…
1940	/*	1826	/*
1941	* present_arch(arch, map, x, y) searches for any objects with	1827	* present_arch(arch, map, x, y) searches for any objects with
1942	* a matching archetype at the given map and coordinates.	1828	* a matching archetype at the given map and coordinates.
1943	* The first matching object is returned, or NULL if none.	1829	* The first matching object is returned, or NULL if none.
1944	*/	1830	*/
1945
1946	object *	1831	object *
1947	present_arch (const archetype *at, maptile *m, int x, int y)	1832	present_arch (const archetype *at, maptile *m, int x, int y)
1948	{	1833	{
1949	object *
1950	tmp;
1951
1952	if (m == NULL || out_of_map (m, x, y))	1834	if (!m || out_of_map (m, x, y))
1953	{	1835	{
1954	LOG (llevError, "Present_arch called outside map.\n");	1836	LOG (llevError, "Present_arch called outside map.\n");
1955	return NULL;	1837	return NULL;
1956	}	1838	}
1957	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1839
		1840	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1958	if (tmp->arch == at)	1841	if (tmp->arch == at)
1959	return tmp;	1842	return tmp;
		1843
1960	return NULL;	1844	return NULL;
1961	}	1845	}
1962		1846
1963	/*	1847	/*
1964	* present(type, map, x, y) searches for any objects with	1848	* present(type, map, x, y) searches for any objects with
1965	* a matching type variable at the given map and coordinates.	1849	* a matching type variable at the given map and coordinates.
1966	* The first matching object is returned, or NULL if none.	1850	* The first matching object is returned, or NULL if none.
1967	*/	1851	*/
1968
1969	object *	1852	object *
1970	present (unsigned char type, maptile *m, int x, int y)	1853	present (unsigned char type, maptile *m, int x, int y)
1971	{	1854	{
1972	object *
1973	tmp;
1974
1975	if (out_of_map (m, x, y))	1855	if (out_of_map (m, x, y))
1976	{	1856	{
1977	LOG (llevError, "Present called outside map.\n");	1857	LOG (llevError, "Present called outside map.\n");
1978	return NULL;	1858	return NULL;
1979	}	1859	}
1980	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1860
		1861	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1981	if (tmp->type == type)	1862	if (tmp->type == type)
1982	return tmp;	1863	return tmp;
		1864
1983	return NULL;	1865	return NULL;
1984	}	1866	}
1985		1867
1986	/*	1868	/*
1987	* present_in_ob(type, object) searches for any objects with	1869	* present_in_ob(type, object) searches for any objects with
1988	* a matching type variable in the inventory of the given object.	1870	* a matching type variable in the inventory of the given object.
1989	* The first matching object is returned, or NULL if none.	1871	* The first matching object is returned, or NULL if none.
1990	*/	1872	*/
1991
1992	object *	1873	object *
1993	present_in_ob (unsigned char type, const object *op)	1874	present_in_ob (unsigned char type, const object *op)
1994	{	1875	{
1995	object *
1996	tmp;
1997
1998	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1876	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1999	if (tmp->type == type)	1877	if (tmp->type == type)
2000	return tmp;	1878	return tmp;
		1879
2001	return NULL;	1880	return NULL;
2002	}	1881	}
2003		1882
2004	/*	1883	/*
2005	* present_in_ob (type, str, object) searches for any objects with	1884	* present_in_ob (type, str, object) searches for any objects with
…		…
2013	* str is the string to match against. Note that we match against	1892	* str is the string to match against. Note that we match against
2014	* the object name, not the archetype name. this is so that the	1893	* the object name, not the archetype name. this is so that the
2015	* spell code can use one object type (force), but change it's name	1894	* spell code can use one object type (force), but change it's name
2016	* to be unique.	1895	* to be unique.
2017	*/	1896	*/
2018
2019	object *	1897	object *
2020	present_in_ob_by_name (int type, const char *str, const object *op)	1898	present_in_ob_by_name (int type, const char *str, const object *op)
2021	{	1899	{
2022	object *
2023	tmp;
2024
2025	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1900	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2026	{
2027	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1901	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2028	return tmp;	1902	return tmp;
2029	}	1903
2030	return NULL;	1904	return 0;
2031	}	1905	}
2032		1906
2033	/*	1907	/*
2034	* present_arch_in_ob(archetype, object) searches for any objects with	1908	* present_arch_in_ob(archetype, object) searches for any objects with
2035	* a matching archetype in the inventory of the given object.	1909	* a matching archetype in the inventory of the given object.
2036	* The first matching object is returned, or NULL if none.	1910	* The first matching object is returned, or NULL if none.
2037	*/	1911	*/
2038
2039	object *	1912	object *
2040	present_arch_in_ob (const archetype *at, const object *op)	1913	present_arch_in_ob (const archetype *at, const object *op)
2041	{	1914	{
2042	object *
2043	tmp;
2044
2045	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1915	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2046	if (tmp->arch == at)	1916	if (tmp->arch == at)
2047	return tmp;	1917	return tmp;
		1918
2048	return NULL;	1919	return NULL;
2049	}	1920	}
2050		1921
2051	/*	1922	/*
2052	* activate recursively a flag on an object inventory	1923	* activate recursively a flag on an object inventory
2053	*/	1924	*/
2054	void	1925	void
2055	flag_inv (object *op, int flag)	1926	flag_inv (object *op, int flag)
2056	{	1927	{
2057	object *
2058	tmp;
2059
2060	if (op->inv)	1928	if (op->inv)
2061	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1929	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2062	{	1930	{
2063	SET_FLAG (tmp, flag);	1931	SET_FLAG (tmp, flag);
2064	flag_inv (tmp, flag);	1932	flag_inv (tmp, flag);
2065	}	1933	}
2066	} /*	1934	}
		1935
		1936	/*
2067	* desactivate recursively a flag on an object inventory	1937	* deactivate recursively a flag on an object inventory
2068	*/	1938	*/
2069	void	1939	void
2070	unflag_inv (object *op, int flag)	1940	unflag_inv (object *op, int flag)
2071	{	1941	{
2072	object *
2073	tmp;
2074
2075	if (op->inv)	1942	if (op->inv)
2076	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1943	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2077	{	1944	{
2078	CLEAR_FLAG (tmp, flag);	1945	CLEAR_FLAG (tmp, flag);
2079	unflag_inv (tmp, flag);	1946	unflag_inv (tmp, flag);
2080	}	1947	}
2081	}	1948	}
…		…
2084	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in	1951	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2085	* all it's inventory (recursively).	1952	* all it's inventory (recursively).
2086	* If checksums are used, a player will get set_cheat called for	1953	* If checksums are used, a player will get set_cheat called for
2087	* him/her-self and all object carried by a call to this function.	1954	* him/her-self and all object carried by a call to this function.
2088	*/	1955	*/
2089
2090	void	1956	void
2091	set_cheat (object *op)	1957	set_cheat (object *op)
2092	{	1958	{
2093	SET_FLAG (op, FLAG_WAS_WIZ);	1959	SET_FLAG (op, FLAG_WAS_WIZ);
2094	flag_inv (op, FLAG_WAS_WIZ);	1960	flag_inv (op, FLAG_WAS_WIZ);
…		…
2113	* because arch_blocked (now ob_blocked) needs to know the movement type	1979	* because arch_blocked (now ob_blocked) needs to know the movement type
2114	* to know if the space in question will block the object. We can't use	1980	* to know if the space in question will block the object. We can't use
2115	* the archetype because that isn't correct if the monster has been	1981	* the archetype because that isn't correct if the monster has been
2116	* customized, changed states, etc.	1982	* customized, changed states, etc.
2117	*/	1983	*/
2118
2119	int	1984	int
2120	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1985	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2121	{	1986	{
2122	int
2123	i,
2124	index = 0, flag;	1987	int index = 0, flag;
2125	static int
2126	altern[SIZEOFFREE];	1988	int altern[SIZEOFFREE];
2127		1989
2128	for (i = start; i < stop; i++)	1990	for (int i = start; i < stop; i++)
2129	{	1991	{
2130	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1992	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2131	if (!flag)	1993	if (!flag)
2132	altern[index++] = i;	1994	altern [index++] = i;
2133		1995
2134	/* Basically, if we find a wall on a space, we cut down the search size.	1996	/* Basically, if we find a wall on a space, we cut down the search size.
2135	* In this way, we won't return spaces that are on another side of a wall.	1997	* In this way, we won't return spaces that are on another side of a wall.
2136	* This mostly work, but it cuts down the search size in all directions -	1998	* This mostly work, but it cuts down the search size in all directions -
2137	* if the space being examined only has a wall to the north and empty	1999	* if the space being examined only has a wall to the north and empty
2138	* spaces in all the other directions, this will reduce the search space	2000	* spaces in all the other directions, this will reduce the search space
2139	* to only the spaces immediately surrounding the target area, and	2001	* to only the spaces immediately surrounding the target area, and
2140	* won't look 2 spaces south of the target space.	2002	* won't look 2 spaces south of the target space.
2141	*/	2003	*/
2142	else if ((flag & AB_NO_PASS) && maxfree[i] < stop)	2004	else if ((flag & P_NO_PASS) && maxfree[i] < stop)
2143	stop = maxfree[i];	2005	stop = maxfree[i];
2144	}	2006	}
		2007
2145	if (!index)	2008	if (!index)
2146	return -1;	2009	return -1;
		2010
2147	return altern[RANDOM () % index];	2011	return altern [rndm (index)];
2148	}	2012	}
2149		2013
2150	/*	2014	/*
2151	* find_first_free_spot(archetype, maptile, x, y) works like	2015	* find_first_free_spot(archetype, maptile, x, y) works like
2152	* find_free_spot(), but it will search max number of squares.	2016	* find_free_spot(), but it will search max number of squares.
2153	* But it will return the first available spot, not a random choice.	2017	* But it will return the first available spot, not a random choice.
2154	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2018	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2155	*/	2019	*/
2156
2157	int	2020	int
2158	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2021	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2159	{	2022	{
2160	int
2161	i;
2162
2163	for (i = 0; i < SIZEOFFREE; i++)	2023	for (int i = 0; i < SIZEOFFREE; i++)
2164	{
2165	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2024	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2166	return i;	2025	return i;
2167	}	2026
2168	return -1;	2027	return -1;
2169	}	2028	}
2170		2029
2171	/*	2030	/*
2172	* The function permute(arr, begin, end) randomly reorders the array	2031	* The function permute(arr, begin, end) randomly reorders the array
2173	* arr[begin..end-1].	2032	* arr[begin..end-1].
		2033	* now uses a fisher-yates shuffle, old permute was broken
2174	*/	2034	*/
2175	static void	2035	static void
2176	permute (int *arr, int begin, int end)	2036	permute (int *arr, int begin, int end)
2177	{	2037	{
2178	int	2038	arr += begin;
2179	i,
2180	j,
2181	tmp,
2182	len;
2183
2184	len = end - begin;	2039	end -= begin;
2185	for (i = begin; i < end; i++)
2186	{
2187	j = begin + RANDOM () % len;
2188		2040
2189	tmp = arr[i];	2041	while (--end)
2190	arr[i] = arr[j];	2042	swap (arr [end], arr [rndm (end + 1)]);
2191	arr[j] = tmp;
2192	}
2193	}	2043	}
2194		2044
2195	/* new function to make monster searching more efficient, and effective!	2045	/* new function to make monster searching more efficient, and effective!
2196	* This basically returns a randomized array (in the passed pointer) of	2046	* This basically returns a randomized array (in the passed pointer) of
2197	* the spaces to find monsters. In this way, it won't always look for	2047	* the spaces to find monsters. In this way, it won't always look for
…		…
2200	* the 3x3 area will be searched, just not in a predictable order.	2050	* the 3x3 area will be searched, just not in a predictable order.
2201	*/	2051	*/
2202	void	2052	void
2203	get_search_arr (int *search_arr)	2053	get_search_arr (int *search_arr)
2204	{	2054	{
2205	int	2055	int i;
2206	i;
2207		2056
2208	for (i = 0; i < SIZEOFFREE; i++)	2057	for (i = 0; i < SIZEOFFREE; i++)
2209	{
2210	search_arr[i] = i;	2058	search_arr[i] = i;
2211	}
2212		2059
2213	permute (search_arr, 1, SIZEOFFREE1 + 1);	2060	permute (search_arr, 1, SIZEOFFREE1 + 1);
2214	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2061	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2215	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2062	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2216	}	2063	}
…		…
2225	* Perhaps incorrectly, but I'm making the assumption that exclude	2072	* Perhaps incorrectly, but I'm making the assumption that exclude
2226	* is actually want is going to try and move there. We need this info	2073	* is actually want is going to try and move there. We need this info
2227	* because we have to know what movement the thing looking to move	2074	* because we have to know what movement the thing looking to move
2228	* there is capable of.	2075	* there is capable of.
2229	*/	2076	*/
2230
2231	int	2077	int
2232	find_dir (maptile *m, int x, int y, object *exclude)	2078	find_dir (maptile *m, int x, int y, object *exclude)
2233	{	2079	{
2234	int
2235	i,
2236	max = SIZEOFFREE, mflags;	2080	int i, max = SIZEOFFREE, mflags;
2237		2081
2238	sint16 nx, ny;	2082	sint16 nx, ny;
2239	object *	2083	object *tmp;
2240	tmp;
2241	maptile *	2084	maptile *mp;
2242	mp;
2243		2085
2244	MoveType blocked, move_type;	2086	MoveType blocked, move_type;
2245		2087
2246	if (exclude && exclude->head)	2088	if (exclude && exclude->head)
2247	{	2089	{
…		…
2259	mp = m;	2101	mp = m;
2260	nx = x + freearr_x[i];	2102	nx = x + freearr_x[i];
2261	ny = y + freearr_y[i];	2103	ny = y + freearr_y[i];
2262		2104
2263	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2105	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
		2106
2264	if (mflags & P_OUT_OF_MAP)	2107	if (mflags & P_OUT_OF_MAP)
2265	{
2266	max = maxfree[i];	2108	max = maxfree[i];
2267	}
2268	else	2109	else
2269	{	2110	{
2270	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2111	mapspace &ms = mp->at (nx, ny);
		2112
		2113	blocked = ms.move_block;
2271		2114
2272	if ((move_type & blocked) == move_type)	2115	if ((move_type & blocked) == move_type)
2273	{
2274	max = maxfree[i];	2116	max = maxfree[i];
2275	}
2276	else if (mflags & P_IS_ALIVE)	2117	else if (mflags & P_IS_ALIVE)
2277	{	2118	{
2278	for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)	2119	for (tmp = ms.bot; tmp; tmp = tmp->above)
2279	{	2120	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2280	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2121	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))
2281	{
2282	break;	2122	break;
2283	}	2123
2284	}
2285	if (tmp)	2124	if (tmp)
2286	{
2287	return freedir[i];	2125	return freedir[i];
2288	}
2289	}	2126	}
2290	}	2127	}
2291	}	2128	}
		2129
2292	return 0;	2130	return 0;
2293	}	2131	}
2294		2132
2295	/*	2133	/*
2296	* distance(object 1, object 2) will return the square of the	2134	* distance(object 1, object 2) will return the square of the
2297	* distance between the two given objects.	2135	* distance between the two given objects.
2298	*/	2136	*/
2299
2300	int	2137	int
2301	distance (const object *ob1, const object *ob2)	2138	distance (const object *ob1, const object *ob2)
2302	{	2139	{
2303	int
2304	i;
2305
2306	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2140	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2307	return i;
2308	}	2141	}
2309		2142
2310	/*	2143	/*
2311	* find_dir_2(delta-x,delta-y) will return a direction in which	2144	* find_dir_2(delta-x,delta-y) will return a direction in which
2312	* an object which has subtracted the x and y coordinates of another	2145	* an object which has subtracted the x and y coordinates of another
2313	* object, needs to travel toward it.	2146	* object, needs to travel toward it.
2314	*/	2147	*/
2315
2316	int	2148	int
2317	find_dir_2 (int x, int y)	2149	find_dir_2 (int x, int y)
2318	{	2150	{
2319	int	2151	int q;
2320	q;
2321		2152
2322	if (y)	2153	if (y)
2323	q = x * 100 / y;	2154	q = x * 100 / y;
2324	else if (x)	2155	else if (x)
2325	q = -300 * x;	2156	q = -300 * x;
…		…
2350		2181
2351	return 3;	2182	return 3;
2352	}	2183	}
2353		2184
2354	/*	2185	/*
2355	* absdir(int): Returns a number between 1 and 8, which represent
2356	* the "absolute" direction of a number (it actually takes care of
2357	* "overflow" in previous calculations of a direction).
2358	*/
2359
2360	int
2361	absdir (int d)
2362	{
2363	while (d < 1)
2364	d += 8;
2365	while (d > 8)
2366	d -= 8;
2367	return d;
2368	}
2369
2370	/*
2371	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2186	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2372	* between two directions (which are expected to be absolute (see absdir())	2187	* between two directions (which are expected to be absolute (see absdir())
2373	*/	2188	*/
2374
2375	int	2189	int
2376	dirdiff (int dir1, int dir2)	2190	dirdiff (int dir1, int dir2)
2377	{	2191	{
2378	int	2192	int d;
2379	d;
2380		2193
2381	d = abs (dir1 - dir2);	2194	d = abs (dir1 - dir2);
2382	if (d > 4)	2195	if (d > 4)
2383	d = 8 - d;	2196	d = 8 - d;
		2197
2384	return d;	2198	return d;
2385	}	2199	}
2386		2200
2387	/* peterm:	2201	/* peterm:
2388	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2202	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2391	* This basically means that if direction is 15, then it could either go	2205	* This basically means that if direction is 15, then it could either go
2392	* direction 4, 14, or 16 to get back to where we are.	2206	* direction 4, 14, or 16 to get back to where we are.
2393	* Moved from spell_util.c to object.c with the other related direction	2207	* Moved from spell_util.c to object.c with the other related direction
2394	* functions.	2208	* functions.
2395	*/	2209	*/
2396
2397	int
2398	reduction_dir[SIZEOFFREE][3] = {	2210	int reduction_dir[SIZEOFFREE][3] = {
2399	{0, 0, 0}, /* 0 */	2211	{0, 0, 0}, /* 0 */
2400	{0, 0, 0}, /* 1 */	2212	{0, 0, 0}, /* 1 */
2401	{0, 0, 0}, /* 2 */	2213	{0, 0, 0}, /* 2 */
2402	{0, 0, 0}, /* 3 */	2214	{0, 0, 0}, /* 3 */
2403	{0, 0, 0}, /* 4 */	2215	{0, 0, 0}, /* 4 */
…		…
2451	* find a path to that monster that we found. If not,	2263	* find a path to that monster that we found. If not,
2452	* we don't bother going toward it. Returns 1 if we	2264	* we don't bother going toward it. Returns 1 if we
2453	* can see a direct way to get it	2265	* can see a direct way to get it
2454	* Modified to be map tile aware -.MSW	2266	* Modified to be map tile aware -.MSW
2455	*/	2267	*/
2456
2457
2458	int	2268	int
2459	can_see_monsterP (maptile *m, int x, int y, int dir)	2269	can_see_monsterP (maptile *m, int x, int y, int dir)
2460	{	2270	{
2461	sint16 dx, dy;	2271	sint16 dx, dy;
2462	int
2463	mflags;	2272	int mflags;
2464		2273
2465	if (dir < 0)	2274	if (dir < 0)
2466	return 0; /* exit condition: invalid direction */	2275	return 0; /* exit condition: invalid direction */
2467		2276
2468	dx = x + freearr_x[dir];	2277	dx = x + freearr_x[dir];
…		…
2481	return 0;	2290	return 0;
2482		2291
2483	/* yes, can see. */	2292	/* yes, can see. */
2484	if (dir < 9)	2293	if (dir < 9)
2485	return 1;	2294	return 1;
		2295
2486	return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |	2296	return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2487	can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);	2297	| can_see_monsterP (m, x, y, reduction_dir[dir][1])
		2298	| can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2488	}	2299	}
2489
2490
2491		2300
2492	/*	2301	/*
2493	* can_pick(picker, item): finds out if an object is possible to be	2302	* can_pick(picker, item): finds out if an object is possible to be
2494	* picked up by the picker. Returnes 1 if it can be	2303	* picked up by the picker. Returnes 1 if it can be
2495	* picked up, otherwise 0.	2304	* picked up, otherwise 0.
…		…
2506	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2315	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2507	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2316	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2508	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2317	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2509	}	2318	}
2510		2319
2511
2512	/*	2320	/*
2513	* create clone from object to another	2321	* create clone from object to another
2514	*/	2322	*/
2515	object *	2323	object *
2516	object_create_clone (object *asrc)	2324	object_create_clone (object *asrc)
…		…
2535	{	2343	{
2536	dst = tmp;	2344	dst = tmp;
2537	tmp->head = 0;	2345	tmp->head = 0;
2538	}	2346	}
2539	else	2347	else
2540	{
2541	tmp->head = dst;	2348	tmp->head = dst;
2542	}
2543		2349
2544	tmp->more = 0;	2350	tmp->more = 0;
2545		2351
2546	if (prev)	2352	if (prev)
2547	prev->more = tmp;	2353	prev->more = tmp;
…		…
2551		2357
2552	for (item = src->inv; item; item = item->below)	2358	for (item = src->inv; item; item = item->below)
2553	insert_ob_in_ob (object_create_clone (item), dst);	2359	insert_ob_in_ob (object_create_clone (item), dst);
2554		2360
2555	return dst;	2361	return dst;
2556	}
2557
2558	/* GROS - Creates an object using a string representing its content. */
2559	/* Basically, we save the content of the string to a temp file, then call */
2560	/* load_object on it. I admit it is a highly inefficient way to make things, */
2561	/* but it was simple to make and allows reusing the load_object function. */
2562	/* Remember not to use load_object_str in a time-critical situation. */
2563	/* Also remember that multiparts objects are not supported for now. */
2564
2565	object *
2566	load_object_str (const char *obstr)
2567	{
2568	object *op;
2569	char filename[MAX_BUF];
2570
2571	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2572
2573	FILE *tempfile = fopen (filename, "w");
2574
2575	if (tempfile == NULL)
2576	{
2577	LOG (llevError, "Error - Unable to access load object temp file\n");
2578	return NULL;
2579	}
2580
2581	fprintf (tempfile, obstr);
2582	fclose (tempfile);
2583
2584	op = object::create ();
2585
2586	object_thawer thawer (filename);
2587
2588	if (thawer)
2589	load_object (thawer, op, 0);
2590
2591	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2592	CLEAR_FLAG (op, FLAG_REMOVED);
2593
2594	return op;
2595	}	2362	}
2596		2363
2597	/* This returns the first object in who's inventory that	2364	/* This returns the first object in who's inventory that
2598	* has the same type and subtype match.	2365	* has the same type and subtype match.
2599	* returns NULL if no match.	2366	* returns NULL if no match.
2600	*/	2367	*/
2601	object *	2368	object *
2602	find_obj_by_type_subtype (const object *who, int type, int subtype)	2369	find_obj_by_type_subtype (const object *who, int type, int subtype)
2603	{	2370	{
2604	object *tmp;
2605
2606	for (tmp = who->inv; tmp; tmp = tmp->below)	2371	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2607	if (tmp->type == type && tmp->subtype == subtype)	2372	if (tmp->type == type && tmp->subtype == subtype)
2608	return tmp;	2373	return tmp;
2609		2374
2610	return NULL;	2375	return 0;
2611	}	2376	}
2612		2377
2613	/* If ob has a field named key, return the link from the list,	2378	/* If ob has a field named key, return the link from the list,
2614	* otherwise return NULL.	2379	* otherwise return NULL.
2615	*	2380	*
…		…
2617	* do the desired thing.	2382	* do the desired thing.
2618	*/	2383	*/
2619	key_value *	2384	key_value *
2620	get_ob_key_link (const object *ob, const char *key)	2385	get_ob_key_link (const object *ob, const char *key)
2621	{	2386	{
2622	key_value *link;
2623
2624	for (link = ob->key_values; link != NULL; link = link->next)	2387	for (key_value *link = ob->key_values; link; link = link->next)
2625	if (link->key == key)	2388	if (link->key == key)
2626	return link;	2389	return link;
2627		2390
2628	return NULL;	2391	return 0;
2629	}	2392	}
2630		2393
2631	/*	2394	/*
2632	* Returns the value of op has an extra_field for key, or NULL.	2395	* Returns the value of op has an extra_field for key, or NULL.
2633	*	2396	*
…		…
2658	if (link->key == canonical_key)	2421	if (link->key == canonical_key)
2659	return link->value;	2422	return link->value;
2660		2423
2661	return 0;	2424	return 0;
2662	}	2425	}
2663
2664		2426
2665	/*	2427	/*
2666	* Updates the canonical_key in op to value.	2428	* Updates the canonical_key in op to value.
2667	*	2429	*
2668	* canonical_key is a shared string (value doesn't have to be).	2430	* canonical_key is a shared string (value doesn't have to be).
…		…
2673	* Returns TRUE on success.	2435	* Returns TRUE on success.
2674	*/	2436	*/
2675	int	2437	int
2676	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2438	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2677	{	2439	{
2678	key_value *
2679	field = NULL, *last = NULL;	2440	key_value *field = NULL, *last = NULL;
2680		2441
2681	for (field = op->key_values; field != NULL; field = field->next)	2442	for (field = op->key_values; field != NULL; field = field->next)
2682	{	2443	{
2683	if (field->key != canonical_key)	2444	if (field->key != canonical_key)
2684	{	2445	{
…		…
2712	/* IF we get here, key doesn't exist */	2473	/* IF we get here, key doesn't exist */
2713		2474
2714	/* No field, we'll have to add it. */	2475	/* No field, we'll have to add it. */
2715		2476
2716	if (!add_key)	2477	if (!add_key)
2717	{
2718	return FALSE;	2478	return FALSE;
2719	}	2479
2720	/* There isn't any good reason to store a null	2480	/* There isn't any good reason to store a null
2721	* value in the key/value list. If the archetype has	2481	* value in the key/value list. If the archetype has
2722	* this key, then we should also have it, so shouldn't	2482	* this key, then we should also have it, so shouldn't
2723	* be here. If user wants to store empty strings,	2483	* be here. If user wants to store empty strings,
2724	* should pass in ""	2484	* should pass in ""
…		…
2773	}	2533	}
2774	else	2534	else
2775	item = item->env;	2535	item = item->env;
2776	}	2536	}
2777		2537
		2538
		2539	const char *
		2540	object::flag_desc (char *desc, int len) const
		2541	{
		2542	char *p = desc;
		2543	bool first = true;
		2544
		2545	*p = 0;
		2546
		2547	for (int i = 0; i < NUM_FLAGS; i++)
		2548	{
		2549	if (len <= 10) // magic constant!
		2550	{
		2551	snprintf (p, len, ",...");
		2552	break;
		2553	}
		2554
		2555	if (flag [i])
		2556	{
		2557	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2558	len -= cnt;
		2559	p += cnt;
		2560	first = false;
		2561	}
		2562	}
		2563
		2564	return desc;
		2565	}
		2566
2778	// return a suitable string describing an objetc in enough detail to find it	2567	// return a suitable string describing an object in enough detail to find it
2779	const char *	2568	const char *
2780	object::debug_desc (char *info) const	2569	object::debug_desc (char *info) const
2781	{	2570	{
		2571	char flagdesc[512];
2782	char info2[256 * 3];	2572	char info2[256 * 4];
2783	char *p = info;	2573	char *p = info;
2784		2574
2785	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2575	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2786	count,	2576	count, uuid.seq,
2787	&name,	2577	&name,
2788	title ? " " : "",	2578	title ? "\",title:\"" : "",
2789	title ? (const char *)title : "");	2579	title ? (const char *)title : "",
		2580	flag_desc (flagdesc, 512), type);
2790		2581
2791	if (env)	2582	if (env)
2792	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2583	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2793		2584
2794	if (map)	2585	if (map)
2795	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2586	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2796		2587
2797	return info;	2588	return info;
2798	}	2589	}
2799		2590
2800	const char *	2591	const char *
2801	object::debug_desc () const	2592	object::debug_desc () const
2802	{	2593	{
2803	static char info[256 * 3];	2594	static char info[256 * 4];
2804	return debug_desc (info);	2595	return debug_desc (info);
2805	}	2596	}
2806		2597
		2598	const char *
		2599	object::debug_desc2 () const
		2600	{
		2601	static char info[256 * 4];
		2602	return debug_desc (info);
		2603	}
		2604
		2605	struct region *
		2606	object::region () const
		2607	{
		2608	return map ? map->region (x, y)
		2609	: region::default_region ();
		2610	}
		2611
		2612	const materialtype_t *
		2613	object::dominant_material () const
		2614	{
		2615	if (materialtype_t *mat = name_to_material (materialname))
		2616	return mat;
		2617
		2618	// omfg this is slow, this has to be temporary :)
		2619	shstr unknown ("unknown");
		2620
		2621	return name_to_material (unknown);
		2622	}
		2623
		2624	void
		2625	object::open_container (object *new_container)
		2626	{
		2627	if (container == new_container)
		2628	return;
		2629
		2630	if (object *old_container = container)
		2631	{
		2632	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2633	return;
		2634
		2635	#if 0
		2636	// remove the "Close old_container" object.
		2637	if (object *closer = old_container->inv)
		2638	if (closer->type == CLOSE_CON)
		2639	closer->destroy ();
		2640	#endif
		2641
		2642	old_container->flag [FLAG_APPLIED] = 0;
		2643	container = 0;
		2644
		2645	esrv_update_item (UPD_FLAGS, this, old_container);
		2646	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2647	}
		2648
		2649	if (new_container)
		2650	{
		2651	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2652	return;
		2653
		2654	// TODO: this does not seem to serve any purpose anymore?
		2655	#if 0
		2656	// insert the "Close Container" object.
		2657	if (archetype *closer = new_container->other_arch)
		2658	{
		2659	object *closer = arch_to_object (new_container->other_arch);
		2660	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2661	new_container->insert (closer);
		2662	}
		2663	#endif
		2664
		2665	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2666
		2667	new_container->flag [FLAG_APPLIED] = 1;
		2668	container = new_container;
		2669
		2670	esrv_update_item (UPD_FLAGS, this, new_container);
		2671	esrv_send_inventory (this, new_container);
		2672	}
		2673	}
		2674
		2675

Diff Legend

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