1 /* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */
2 /* def.monst.h - version 1.0.2 */
9 xchar mdx,mdy; /* if mdispl then pos where last displayed */
11 coord mtrack[MTSZ]; /* monster track */
13 char mappearance; /* nonzero for undetected 'M's and for '1's */
14 Bitfield(mimic,1); /* undetected mimic */
15 Bitfield(mdispl,1); /* mdx,mdy valid */
16 Bitfield(minvis,1); /* invisible */
17 Bitfield(cham,1); /* shape-changer */
18 Bitfield(mhide,1); /* hides beneath objects */
19 Bitfield(mundetected,1); /* not seen in present hiding place */
24 Bitfield(mflee,1); /* fleeing */
25 Bitfield(mfleetim,7); /* timeout for mflee */
26 Bitfield(mcan,1); /* has been cancelled */
27 Bitfield(mtame,1); /* implies peaceful */
28 Bitfield(mpeaceful,1); /* does not attack unprovoked */
29 Bitfield(isshk,1); /* is shopkeeper */
30 Bitfield(isgd,1); /* is guard */
31 Bitfield(mcansee,1); /* cansee 1, temp.blinded 0, blind 0 */
32 Bitfield(mblinded,7); /* cansee 0, temp.blinded n, blind 0 */
33 Bitfield(mtrapped,1); /* trapped in a pit or bear trap */
34 Bitfield(mnamelth,6); /* length of name (following mxlth) */
36 Bitfield(wormno,5); /* at most 31 worms on any level */
38 unsigned mtrapseen; /* bitmap of traps we've been trapped in */
39 long mlstmv; /* prevent two moves at once */
42 unsigned mxlth; /* length of following data */
43 /* in order to prevent alignment problems mextra should
44 be (or follow) a long int */
45 long mextra[1]; /* monster dependent info */
48 #define newmonst(xl) (struct monst *) alloc((unsigned)(xl) + sizeof(struct monst))
50 extern struct monst *fmon;
51 extern struct monst *fallen_down;
54 /* these are in mspeed */
55 #define MSLOW 1 /* slow monster */
56 #define MFAST 2 /* speeded monster */
58 #define NAME(mtmp) (((char *) mtmp->mextra) + mtmp->mxlth)