Searched refs:mons (Results 1 - 9 of 9) sorted by relevance

/netbsd-6-1-5-RELEASE/games/hack/
H A Ddef.permonst.h73 extern const struct permonst mons[];
74 #define PM_ACID_BLOB &mons[7]
75 #define PM_ZOMBIE &mons[13]
76 #define PM_PIERCER &mons[17]
77 #define PM_KILLER_BEE &mons[26]
78 #define PM_WRAITH &mons[33]
79 #define PM_MIMIC &mons[37]
80 #define PM_VAMPIRE &mons[43]
81 #define PM_CHAMELEON &mons[47]
82 #define PM_DEMON &mons[5
[all...]
H A Dhack.monst.c73 const struct permonst mons[CMNUM + 2] = { variable in typeref:struct:permonst
H A Dhack.makemon.c110 ptr = &mons[ct];
155 (void) newcham(mtmp, &mons[dlevel + 14 + rn2(CMNUM - 14 - dlevel)]);
272 ptr = &mons[ct];
H A Dhack.main.c294 const struct permonst *pm = mons;
297 while (pm < mons + CMNUM + 2) {
H A Dhack.read.c643 for (mp = mons; mp < &mons[CMNUM + 2]; mp++)
H A Dhack.lev.c165 const struct permonst *monbegin = &mons[0];
H A Dhack.save.c281 differ = (const char *) (&mons[0]) - (const char *) (monbegin);
H A Dhack.mon.c239 (void) newcham(mtmp, &mons[dlevel + 14 + rn2(CMNUM - 14 - dlevel)]);
812 nk = 1; /* in case we cannot find it in mons */
813 tmp = mdat - mons; /* strchr in mons array (if not 'd', '@', ...) */
H A Dhack.zap.c121 if (newcham(mtmp, &mons[rn2(CMNUM)]))

Completed in 60 milliseconds