pc-hack

PC HACK 3.61 source code (archival)
git clone http://frotz.net/git/pc-hack.git
Log | Files | Refs

makemon.c (5347B)


      1 /* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */
      2 /* makemon.c - version 1.0.2 */
      3 
      4 #include	"hack.h"
      5 extern char fut_geno[];
      6 extern char *index();
      7 extern struct obj *mkobj_at(), *mksobj(), *mkobj();
      8 struct monst zeromonst;
      9 extern boolean in_mklev;
     10 
     11 /*
     12  * called with [x,y] = coordinates;
     13  *	[0,0] means anyplace
     14  *	[u.ux,u.uy] means: call mnexto (if !in_mklev)
     15  *
     16  *	In case we make an Orc or killer bee, we make an entire horde (swarm);
     17  *	note that in this case we return only one of them (the one at [x,y]).
     18  */
     19 struct monst *
     20 makemon(ptr,x,y)
     21 register struct permonst *ptr;
     22 {
     23 	register struct monst *mtmp;
     24 	register tmp, ct;
     25 	boolean anything = (!ptr);
     26 
     27 	if(x != 0 || y != 0) if(m_at(x,y)) return((struct monst *) 0);
     28 	if(ptr){
     29 		if(index(fut_geno, ptr->mlet)) return((struct monst *) 0);
     30 	} else {
     31 		ct = CMNUM - strlen(fut_geno);
     32 		if(index(fut_geno, 'm')) ct++;  /* make only 1 minotaur */
     33 		if(index(fut_geno, '@')) ct++;
     34 		if(ct <= 0) return(0); 		  /* no more monsters! */
     35 		tmp = rn2(ct*dlevel/24 + 7);
     36 		if(tmp < dlevel - 4) tmp = rn2(ct*dlevel/24 + 12);
     37 		if(tmp >= ct) tmp = rn1(ct - ct/2, ct/2);
     38 		for(ct = 0; ct < CMNUM; ct++){
     39 			ptr = &mons[ct];
     40 			if(index(fut_geno, ptr->mlet))
     41 				continue;
     42 			if(!tmp--) goto gotmon;
     43 		}
     44 		panic("makemon?");
     45 	}
     46 gotmon:
     47 	mtmp = newmonst(ptr->pxlth);
     48 	*mtmp = zeromonst;	/* clear all entries in structure */
     49 	for(ct = 0; ct < ptr->pxlth; ct++)
     50 		((char *) &(mtmp->mextra[0]))[ct] = 0;
     51 	mtmp->nmon = fmon;
     52 	fmon = mtmp;
     53 	mtmp->m_id = flags.ident++;
     54 	mtmp->data = ptr;
     55 	mtmp->mxlth = ptr->pxlth;
     56 	if(ptr->mlet == 'D') mtmp->mhpmax = mtmp->mhp = 80;
     57 	else if(!ptr->mlevel) mtmp->mhpmax = mtmp->mhp = rnd(4);
     58 	else mtmp->mhpmax = mtmp->mhp = d(ptr->mlevel, 8);
     59 	mtmp->mx = x;
     60 	mtmp->my = y;
     61 	mtmp->mcansee = 1;
     62 	if(ptr->mlet == 'M'){
     63 		mtmp->mimic = 1;
     64 		mtmp->mappearance = ']';
     65 	}
     66 	if(!in_mklev) {
     67 		if(x == u.ux && y == u.uy && ptr->mlet != ' ')
     68 			mnexto(mtmp);
     69 		if(x == 0 && y == 0)
     70 			rloc(mtmp);
     71 	}
     72 	if(ptr->mlet == 's' || ptr->mlet == 'S') {
     73 		mtmp->mhide = mtmp->mundetected = 1;
     74 		if(in_mklev)
     75 		if(mtmp->mx && mtmp->my)
     76 			(void) mkobj_at(0, mtmp->mx, mtmp->my);
     77 	}
     78 	if(ptr->mlet == ':') {
     79 #ifdef DGK
     80 		/* If you're protected with a ring, don't create
     81 		 * any shape-changing chameleons -dgk
     82 		 */
     83 		if (Protection_from_shape_changers)
     84 			mtmp->cham = 0;
     85 		else {
     86 			mtmp->cham = 1;
     87 			(void) newcham(mtmp,
     88 				&mons[dlevel+14+rn2(CMNUM-14-dlevel)]);
     89 		}
     90 #else
     91 		mtmp->cham = 1;
     92 		(void) newcham(mtmp, &mons[dlevel+14+rn2(CMNUM-14-dlevel)]);
     93 #endif
     94 	}
     95 	if(ptr->mlet == 'I' || ptr->mlet == ';')
     96 		mtmp->minvis = 1;
     97 	if(ptr->mlet == 'L' || ptr->mlet == 'N'
     98 	    || (in_mklev && index("&w;", ptr->mlet) && rn2(5))
     99 	) mtmp->msleep = 1;
    100 
    101 #ifndef NOWORM
    102 	if(ptr->mlet == 'w' && getwn(mtmp))
    103 		initworm(mtmp);
    104 #endif /* NOWORM /**/
    105 
    106 	if(anything) if(ptr->mlet == 'O' || ptr->mlet == 'k') {
    107 		coord enexto();
    108 		coord mm;
    109 		register int cnt = rnd(10);
    110 		mm.x = x;
    111 		mm.y = y;
    112 		while(cnt--) {
    113 			mm = enexto(mm.x, mm.y);
    114 			(void) makemon(ptr, mm.x, mm.y);
    115 		}
    116 	}
    117 #ifdef DGK
    118 	m_initinv(mtmp);
    119 #endif
    120 	return(mtmp);
    121 }
    122 
    123 #ifdef DGK
    124 /* Give some monsters an initial inventory to use */
    125 m_initinv(mtmp)
    126 struct monst *mtmp;
    127 {
    128 	struct obj *otmp;
    129 
    130 	switch (mtmp->data->mlet) {
    131 	case 'K':
    132 		if (!rn2(4)) {
    133 			otmp = mksobj(DART);
    134 			otmp->quan = 2 + rnd(12);
    135 			mpickobj(mtmp, otmp);
    136 		}
    137 		break;
    138 	case 'C':
    139 		if (rn2(2)) {
    140 			otmp = mksobj(CROSSBOW);
    141 			otmp->cursed = rn2(2);
    142 			mpickobj(mtmp, otmp);
    143 			otmp = mksobj(CROSSBOW_BOLT);
    144 			otmp->quan = 2 + rnd(12);
    145 			mpickobj(mtmp, otmp);
    146 		}
    147 		break;
    148 	default:
    149 		break;
    150 	}
    151 }
    152 #endif
    153 
    154 coord
    155 enexto(xx,yy)
    156 register xchar xx,yy;
    157 {
    158 	register xchar x,y;
    159 	coord foo[15], *tfoo;
    160 	int range;
    161 
    162 	tfoo = foo;
    163 	range = 1;
    164 	do {	/* full kludge action. */
    165 		for(x = xx-range; x <= xx+range; x++)
    166 			if(goodpos(x, yy-range)) {
    167 				tfoo->x = x;
    168 				tfoo++->y = yy-range;
    169 				if(tfoo == &foo[15]) goto foofull;
    170 			}
    171 		for(x = xx-range; x <= xx+range; x++)
    172 			if(goodpos(x,yy+range)) {
    173 				tfoo->x = x;
    174 				tfoo++->y = yy+range;
    175 				if(tfoo == &foo[15]) goto foofull;
    176 			}
    177 		for(y = yy+1-range; y < yy+range; y++)
    178 			if(goodpos(xx-range,y)) {
    179 				tfoo->x = xx-range;
    180 				tfoo++->y = y;
    181 				if(tfoo == &foo[15]) goto foofull;
    182 			}
    183 		for(y = yy+1-range; y < yy+range; y++)
    184 			if(goodpos(xx+range,y)) {
    185 				tfoo->x = xx+range;
    186 				tfoo++->y = y;
    187 				if(tfoo == &foo[15]) goto foofull;
    188 			}
    189 		range++;
    190 	} while(tfoo == foo);
    191 foofull:
    192 	return( foo[rn2(tfoo-foo)] );
    193 }
    194 
    195 goodpos(x,y)	/* used only in mnexto and rloc */
    196 {
    197 	return(
    198 	! (x < 1 || x > COLNO-2 || y < 1 || y > ROWNO-2 ||
    199 	   m_at(x,y) || !ACCESSIBLE(levl[x][y].typ)
    200 	   || (x == u.ux && y == u.uy)
    201 	   || sobj_at(ENORMOUS_ROCK, x, y)
    202 	));
    203 }
    204 
    205 rloc(mtmp)
    206 struct monst *mtmp;
    207 {
    208 	register tx,ty;
    209 	register char ch = mtmp->data->mlet;
    210 
    211 #ifndef NOWORM
    212 	if(ch == 'w' && mtmp->mx) return;	/* do not relocate worms */
    213 #endif /* NOWORM /**/
    214 	do {
    215 		tx = rn1(COLNO-3,2);
    216 		ty = rn2(ROWNO);
    217 	} while(!goodpos(tx,ty));
    218 	mtmp->mx = tx;
    219 	mtmp->my = ty;
    220 	if(u.ustuck == mtmp){
    221 		if(u.uswallow) {
    222 			u.ux = tx;
    223 			u.uy = ty;
    224 			docrt();
    225 		} else	u.ustuck = 0;
    226 	}
    227 	pmon(mtmp);
    228 }
    229 
    230 struct monst *
    231 mkmon_at(let,x,y)
    232 char let;
    233 register int x,y;
    234 {
    235 	register int ct;
    236 	register struct permonst *ptr;
    237 
    238 	for(ct = 0; ct < CMNUM; ct++) {
    239 		ptr = &mons[ct];
    240 		if(ptr->mlet == let)
    241 			return(makemon(ptr,x,y));
    242 	}
    243 	return(0);
    244 }