|
DataMuseum.dkPresents historical artifacts from the history of: DKUUG/EUUG Conference tapes |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about DKUUG/EUUG Conference tapes Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - metrics - downloadIndex: T m
Length: 2160 (0x870) Types: TextFile Names: »monst.h«
└─⟦b20c6495f⟧ Bits:30007238 EUUGD18: Wien-båndet, efterår 1987 └─⟦this⟧ »EUUGD18/General/Nethack/monst.h«
/* SCCS Id: @(#)monst.h 2.1 87/09/28 /* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */ struct monst { struct monst *nmon; struct permonst *data; unsigned m_id; xchar mx,my; xchar mdx,mdy; /* if mdispl then pos where last displayed */ #define MTSZ 4 coord mtrack[MTSZ]; /* monster track */ schar mhp,mhpmax; char mappearance; /* nonzero for undetected 'M's and for '1's */ Bitfield(mimic,1); /* undetected mimic */ Bitfield(mdispl,1); /* mdx,mdy valid */ Bitfield(minvis,1); /* invisible */ Bitfield(cham,1); /* shape-changer */ Bitfield(mhide,1); /* hides beneath objects */ Bitfield(mundetected,1); /* not seen in present hiding place */ Bitfield(mspeed,2); Bitfield(mflee,1); /* fleeing */ Bitfield(mfleetim,7); /* timeout for mflee */ Bitfield(msleep,1); Bitfield(mfroz,1); Bitfield(mconf,1); Bitfield(mcan,1); /* has been cancelled */ Bitfield(mtame,1); /* implies peaceful */ Bitfield(mpeaceful,1); /* does not attack unprovoked */ Bitfield(isshk,1); /* is shopkeeper */ Bitfield(isgd,1); /* is guard */ Bitfield(mcansee,1); /* cansee 1, temp.blinded 0, blind 0 */ Bitfield(mblinded,7); /* cansee 0, temp.blinded n, blind 0 */ Bitfield(mtrapped,1); /* trapped in a pit or bear trap */ Bitfield(mnamelth,6); /* length of name (following mxlth) */ #ifndef NOWORM Bitfield(wormno,5); /* at most 31 worms on any level */ #endif #ifdef WALKIES Bitfield(mleashed,1); /* monster is on a leash */ #endif long mtrapseen; /* bitmap of traps we've been trapped in */ long mlstmv; /* prevent two moves at once */ struct obj *minvent; long mgold; unsigned mxlth; /* length of following data */ /* in order to prevent alignment problems mextra should be (or follow) a long int */ long mextra[1]; /* monster dependent info */ }; #define newmonst(xl) (struct monst *) alloc((unsigned)(xl) + sizeof(struct monst)) extern struct monst *fmon; extern struct monst *fallen_down; struct monst *m_at(); /* these are in mspeed */ #define MSLOW 1 /* slow monster */ #define MFAST 2 /* speeded monster */ #define NAME(mtmp) (((char *) mtmp->mextra) + mtmp->mxlth) #define MREGEN "TVi1" #define UNDEAD "ZVW "