NetBSD/games/hack/hack.makemon.c

224 lines
4.8 KiB
C
Raw Normal View History

/* $NetBSD: hack.makemon.c,v 1.5 2001/03/25 20:44:01 jsm Exp $ */
1997-10-19 20:56:41 +04:00
1993-08-02 21:16:36 +04:00
/*
* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985.
*/
1997-10-19 20:56:41 +04:00
#include <sys/cdefs.h>
1993-08-02 21:16:36 +04:00
#ifndef lint
__RCSID("$NetBSD: hack.makemon.c,v 1.5 2001/03/25 20:44:01 jsm Exp $");
1997-10-19 20:56:41 +04:00
#endif /* not lint */
1993-03-21 12:45:37 +03:00
#include "hack.h"
1997-10-19 20:56:41 +04:00
#include "extern.h"
1993-03-21 12:45:37 +03:00
struct monst zeromonst;
/*
* called with [x,y] = coordinates;
* [0,0] means anyplace
* [u.ux,u.uy] means: call mnexto (if !in_mklev)
*
* In case we make an Orc or killer bee, we make an entire horde (swarm);
* note that in this case we return only one of them (the one at [x,y]).
*/
1997-10-19 20:56:41 +04:00
struct monst *
makemon(const struct permonst *ptr, int x, int y)
1993-03-21 12:45:37 +03:00
{
1997-10-19 20:56:41 +04:00
struct monst *mtmp;
int tmp, ct;
boolean anything = (!ptr);
1993-03-21 12:45:37 +03:00
1997-10-19 20:56:41 +04:00
if (x != 0 || y != 0)
if (m_at(x, y))
return ((struct monst *) 0);
if (ptr) {
if (strchr(fut_geno, ptr->mlet))
return ((struct monst *) 0);
1993-03-21 12:45:37 +03:00
} else {
ct = CMNUM - strlen(fut_geno);
1997-10-19 20:56:41 +04:00
if (strchr(fut_geno, 'm'))
ct++; /* make only 1 minotaur */
if (strchr(fut_geno, '@'))
ct++;
if (ct <= 0)
return (0); /* no more monsters! */
tmp = rn2(ct * dlevel / 24 + 7);
if (tmp < dlevel - 4)
tmp = rn2(ct * dlevel / 24 + 12);
if (tmp >= ct)
tmp = rn1(ct - ct / 2, ct / 2);
for (ct = 0; ct < CMNUM; ct++) {
1993-03-21 12:45:37 +03:00
ptr = &mons[ct];
1997-10-19 20:56:41 +04:00
if (strchr(fut_geno, ptr->mlet))
1993-03-21 12:45:37 +03:00
continue;
1997-10-19 20:56:41 +04:00
if (!tmp--)
goto gotmon;
1993-03-21 12:45:37 +03:00
}
panic("makemon?");
}
gotmon:
mtmp = newmonst(ptr->pxlth);
*mtmp = zeromonst; /* clear all entries in structure */
1997-10-19 20:56:41 +04:00
for (ct = 0; ct < ptr->pxlth; ct++)
1993-03-21 12:45:37 +03:00
((char *) &(mtmp->mextra[0]))[ct] = 0;
mtmp->nmon = fmon;
fmon = mtmp;
mtmp->m_id = flags.ident++;
mtmp->data = ptr;
mtmp->mxlth = ptr->pxlth;
1997-10-19 20:56:41 +04:00
if (ptr->mlet == 'D')
mtmp->mhpmax = mtmp->mhp = 80;
else if (!ptr->mlevel)
mtmp->mhpmax = mtmp->mhp = rnd(4);
else
mtmp->mhpmax = mtmp->mhp = d(ptr->mlevel, 8);
1993-03-21 12:45:37 +03:00
mtmp->mx = x;
mtmp->my = y;
mtmp->mcansee = 1;
1997-10-19 20:56:41 +04:00
if (ptr->mlet == 'M') {
1993-03-21 12:45:37 +03:00
mtmp->mimic = 1;
mtmp->mappearance = ']';
}
1997-10-19 20:56:41 +04:00
if (!in_mklev) {
if (x == u.ux && y == u.uy && ptr->mlet != ' ')
1993-03-21 12:45:37 +03:00
mnexto(mtmp);
1997-10-19 20:56:41 +04:00
if (x == 0 && y == 0)
1993-03-21 12:45:37 +03:00
rloc(mtmp);
}
1997-10-19 20:56:41 +04:00
if (ptr->mlet == 's' || ptr->mlet == 'S') {
1993-03-21 12:45:37 +03:00
mtmp->mhide = mtmp->mundetected = 1;
1997-10-19 20:56:41 +04:00
if (in_mklev)
if (mtmp->mx && mtmp->my)
(void) mkobj_at(0, mtmp->mx, mtmp->my);
1993-03-21 12:45:37 +03:00
}
1997-10-19 20:56:41 +04:00
if (ptr->mlet == ':') {
1993-03-21 12:45:37 +03:00
mtmp->cham = 1;
1997-10-19 20:56:41 +04:00
(void) newcham(mtmp, &mons[dlevel + 14 + rn2(CMNUM - 14 - dlevel)]);
1993-03-21 12:45:37 +03:00
}
1997-10-19 20:56:41 +04:00
if (ptr->mlet == 'I' || ptr->mlet == ';')
1993-03-21 12:45:37 +03:00
mtmp->minvis = 1;
1997-10-19 20:56:41 +04:00
if (ptr->mlet == 'L' || ptr->mlet == 'N'
|| (in_mklev && strchr("&w;", ptr->mlet) && rn2(5))
)
mtmp->msleep = 1;
1993-03-21 12:45:37 +03:00
#ifndef NOWORM
1997-10-19 20:56:41 +04:00
if (ptr->mlet == 'w' && getwn(mtmp))
1993-03-21 12:45:37 +03:00
initworm(mtmp);
1997-10-19 20:56:41 +04:00
#endif /* NOWORM */
1993-03-21 12:45:37 +03:00
1997-10-19 20:56:41 +04:00
if (anything)
if (ptr->mlet == 'O' || ptr->mlet == 'k') {
coord mm;
int cnt = rnd(10);
mm.x = x;
mm.y = y;
while (cnt--) {
mm = enexto(mm.x, mm.y);
(void) makemon(ptr, mm.x, mm.y);
}
1993-03-21 12:45:37 +03:00
}
1997-10-19 20:56:41 +04:00
return (mtmp);
1993-03-21 12:45:37 +03:00
}
coord
1997-10-19 20:56:41 +04:00
enexto(xx, yy)
xchar xx, yy;
1993-03-21 12:45:37 +03:00
{
1997-10-19 20:56:41 +04:00
xchar x, y;
coord foo[15], *tfoo;
int range;
1993-03-21 12:45:37 +03:00
tfoo = foo;
range = 1;
1997-10-19 20:56:41 +04:00
do { /* full kludge action. */
for (x = xx - range; x <= xx + range; x++)
if (goodpos(x, yy - range)) {
1993-03-21 12:45:37 +03:00
tfoo->x = x;
1997-10-19 20:56:41 +04:00
tfoo++->y = yy - range;
if (tfoo == &foo[15])
goto foofull;
1993-03-21 12:45:37 +03:00
}
1997-10-19 20:56:41 +04:00
for (x = xx - range; x <= xx + range; x++)
if (goodpos(x, yy + range)) {
1993-03-21 12:45:37 +03:00
tfoo->x = x;
1997-10-19 20:56:41 +04:00
tfoo++->y = yy + range;
if (tfoo == &foo[15])
goto foofull;
1993-03-21 12:45:37 +03:00
}
1997-10-19 20:56:41 +04:00
for (y = yy + 1 - range; y < yy + range; y++)
if (goodpos(xx - range, y)) {
tfoo->x = xx - range;
1993-03-21 12:45:37 +03:00
tfoo++->y = y;
1997-10-19 20:56:41 +04:00
if (tfoo == &foo[15])
goto foofull;
1993-03-21 12:45:37 +03:00
}
1997-10-19 20:56:41 +04:00
for (y = yy + 1 - range; y < yy + range; y++)
if (goodpos(xx + range, y)) {
tfoo->x = xx + range;
1993-03-21 12:45:37 +03:00
tfoo++->y = y;
1997-10-19 20:56:41 +04:00
if (tfoo == &foo[15])
goto foofull;
1993-03-21 12:45:37 +03:00
}
range++;
1997-10-19 20:56:41 +04:00
} while (tfoo == foo);
1993-03-21 12:45:37 +03:00
foofull:
1997-10-19 20:56:41 +04:00
return (foo[rn2(tfoo - foo)]);
1993-03-21 12:45:37 +03:00
}
1997-10-19 20:56:41 +04:00
int
goodpos(int x, int y)
1997-10-19 20:56:41 +04:00
{ /* used only in mnexto and rloc */
return (
!(x < 1 || x > COLNO - 2 || y < 1 || y > ROWNO - 2 ||
m_at(x, y) || !ACCESSIBLE(levl[x][y].typ)
|| (x == u.ux && y == u.uy)
|| sobj_at(ENORMOUS_ROCK, x, y)
));
1993-03-21 12:45:37 +03:00
}
1997-10-19 20:56:41 +04:00
void
1993-03-21 12:45:37 +03:00
rloc(mtmp)
1997-10-19 20:56:41 +04:00
struct monst *mtmp;
1993-03-21 12:45:37 +03:00
{
1997-10-19 20:56:41 +04:00
int tx, ty;
char ch = mtmp->data->mlet;
1993-03-21 12:45:37 +03:00
#ifndef NOWORM
1997-10-19 20:56:41 +04:00
if (ch == 'w' && mtmp->mx)
return; /* do not relocate worms */
#endif /* NOWORM */
1993-03-21 12:45:37 +03:00
do {
1997-10-19 20:56:41 +04:00
tx = rn1(COLNO - 3, 2);
1993-03-21 12:45:37 +03:00
ty = rn2(ROWNO);
1997-10-19 20:56:41 +04:00
} while (!goodpos(tx, ty));
1993-03-21 12:45:37 +03:00
mtmp->mx = tx;
mtmp->my = ty;
1997-10-19 20:56:41 +04:00
if (u.ustuck == mtmp) {
if (u.uswallow) {
1993-03-21 12:45:37 +03:00
u.ux = tx;
u.uy = ty;
docrt();
1997-10-19 20:56:41 +04:00
} else
u.ustuck = 0;
1993-03-21 12:45:37 +03:00
}
pmon(mtmp);
}
1997-10-19 20:56:41 +04:00
struct monst *
mkmon_at(let, x, y)
char let;
int x, y;
1993-03-21 12:45:37 +03:00
{
1997-10-19 20:56:41 +04:00
int ct;
const struct permonst *ptr;
1993-03-21 12:45:37 +03:00
1997-10-19 20:56:41 +04:00
for (ct = 0; ct < CMNUM; ct++) {
1993-03-21 12:45:37 +03:00
ptr = &mons[ct];
1997-10-19 20:56:41 +04:00
if (ptr->mlet == let)
return (makemon(ptr, x, y));
1993-03-21 12:45:37 +03:00
}
1997-10-19 20:56:41 +04:00
return (0);
1993-03-21 12:45:37 +03:00
}