Home | History | Annotate | Line # | Download | only in hack
def.monst.h revision 1.2 
      1  1.2  mycroft /*
      2  1.2  mycroft  * Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985.
      3  1.2  mycroft  *
      4  1.2  mycroft  *	$Id: def.monst.h,v 1.2 1993/08/02 17:16:48 mycroft Exp $
      5  1.2  mycroft  */
      6  1.1      cgd 
      7  1.1      cgd struct monst {
      8  1.1      cgd 	struct monst *nmon;
      9  1.1      cgd 	struct permonst *data;
     10  1.1      cgd 	unsigned m_id;
     11  1.1      cgd 	xchar mx,my;
     12  1.1      cgd 	xchar mdx,mdy;		/* if mdispl then pos where last displayed */
     13  1.1      cgd #define	MTSZ	4
     14  1.1      cgd 	coord mtrack[MTSZ];	/* monster track */
     15  1.1      cgd 	schar mhp,mhpmax;
     16  1.1      cgd 	char mappearance;	/* nonzero for undetected 'M's and for '1's */
     17  1.1      cgd 	Bitfield(mimic,1);	/* undetected mimic */
     18  1.1      cgd 	Bitfield(mdispl,1);	/* mdx,mdy valid */
     19  1.1      cgd 	Bitfield(minvis,1);	/* invisible */
     20  1.1      cgd 	Bitfield(cham,1);	/* shape-changer */
     21  1.1      cgd 	Bitfield(mhide,1);	/* hides beneath objects */
     22  1.1      cgd 	Bitfield(mundetected,1);	/* not seen in present hiding place */
     23  1.1      cgd 	Bitfield(mspeed,2);
     24  1.1      cgd 	Bitfield(msleep,1);
     25  1.1      cgd 	Bitfield(mfroz,1);
     26  1.1      cgd 	Bitfield(mconf,1);
     27  1.1      cgd 	Bitfield(mflee,1);	/* fleeing */
     28  1.1      cgd 	Bitfield(mfleetim,7);	/* timeout for mflee */
     29  1.1      cgd 	Bitfield(mcan,1);	/* has been cancelled */
     30  1.1      cgd 	Bitfield(mtame,1);		/* implies peaceful */
     31  1.1      cgd 	Bitfield(mpeaceful,1);	/* does not attack unprovoked */
     32  1.1      cgd 	Bitfield(isshk,1);	/* is shopkeeper */
     33  1.1      cgd 	Bitfield(isgd,1);	/* is guard */
     34  1.1      cgd 	Bitfield(mcansee,1);	/* cansee 1, temp.blinded 0, blind 0 */
     35  1.1      cgd 	Bitfield(mblinded,7);	/* cansee 0, temp.blinded n, blind 0 */
     36  1.1      cgd 	Bitfield(mtrapped,1);	/* trapped in a pit or bear trap */
     37  1.1      cgd 	Bitfield(mnamelth,6);	/* length of name (following mxlth) */
     38  1.1      cgd #ifndef NOWORM
     39  1.1      cgd 	Bitfield(wormno,5);	/* at most 31 worms on any level */
     40  1.1      cgd #endif NOWORM
     41  1.1      cgd 	unsigned mtrapseen;	/* bitmap of traps we've been trapped in */
     42  1.1      cgd 	long mlstmv;	/* prevent two moves at once */
     43  1.1      cgd 	struct obj *minvent;
     44  1.1      cgd 	long mgold;
     45  1.1      cgd 	unsigned mxlth;		/* length of following data */
     46  1.1      cgd 	/* in order to prevent alignment problems mextra should
     47  1.1      cgd 	   be (or follow) a long int */
     48  1.1      cgd 	long mextra[1];		/* monster dependent info */
     49  1.1      cgd };
     50  1.1      cgd 
     51  1.1      cgd #define newmonst(xl)	(struct monst *) alloc((unsigned)(xl) + sizeof(struct monst))
     52  1.1      cgd 
     53  1.1      cgd extern struct monst *fmon;
     54  1.1      cgd extern struct monst *fallen_down;
     55  1.1      cgd struct monst *m_at();
     56  1.1      cgd 
     57  1.1      cgd /* these are in mspeed */
     58  1.1      cgd #define MSLOW 1 /* slow monster */
     59  1.1      cgd #define MFAST 2 /* speeded monster */
     60  1.1      cgd 
     61  1.1      cgd #define	NAME(mtmp)	(((char *) mtmp->mextra) + mtmp->mxlth)
     62  1.1      cgd #define	MREGEN		"TVi1"
     63  1.1      cgd #define	UNDEAD		"ZVW "
     64