1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
|
/* $NetBSD: hack.makemon.c,v 1.4 1997/10/19 16:58:17 christos Exp $ */
/*
* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985.
*/
#include <sys/cdefs.h>
#ifndef lint
__RCSID("$NetBSD: hack.makemon.c,v 1.4 1997/10/19 16:58:17 christos Exp $");
#endif /* not lint */
#include "hack.h"
#include "extern.h"
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]).
*/
struct monst *
makemon(const struct permonst *ptr, int x, int y)
{
struct monst *mtmp;
int tmp, ct;
boolean anything = (!ptr);
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);
} else {
ct = CMNUM - strlen(fut_geno);
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++) {
ptr = &mons[ct];
if (strchr(fut_geno, ptr->mlet))
continue;
if (!tmp--)
goto gotmon;
}
panic("makemon?");
}
gotmon:
mtmp = newmonst(ptr->pxlth);
*mtmp = zeromonst; /* clear all entries in structure */
for (ct = 0; ct < (int)ptr->pxlth; ct++)
((char *) &(mtmp->mextra[0]))[ct] = 0;
mtmp->nmon = fmon;
fmon = mtmp;
mtmp->m_id = flags.ident++;
mtmp->data = ptr;
mtmp->mxlth = ptr->pxlth;
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);
mtmp->mx = x;
mtmp->my = y;
mtmp->mcansee = 1;
if (ptr->mlet == 'M') {
mtmp->mimic = 1;
mtmp->mappearance = ']';
}
if (!in_mklev) {
if (x == u.ux && y == u.uy && ptr->mlet != ' ')
mnexto(mtmp);
if (x == 0 && y == 0)
rloc(mtmp);
}
if (ptr->mlet == 's' || ptr->mlet == 'S') {
mtmp->mhide = mtmp->mundetected = 1;
if (in_mklev)
if (mtmp->mx && mtmp->my)
(void) mkobj_at(0, mtmp->mx, mtmp->my);
}
if (ptr->mlet == ':') {
mtmp->cham = 1;
(void) newcham(mtmp, &mons[dlevel + 14 + rn2(CMNUM - 14 - dlevel)]);
}
if (ptr->mlet == 'I' || ptr->mlet == ';')
mtmp->minvis = 1;
if (ptr->mlet == 'L' || ptr->mlet == 'N'
|| (in_mklev && strchr("&w;", ptr->mlet) && rn2(5))
)
mtmp->msleep = 1;
#ifndef NOWORM
if (ptr->mlet == 'w' && getwn(mtmp))
initworm(mtmp);
#endif /* NOWORM */
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);
}
}
return (mtmp);
}
coord
enexto(xx, yy)
xchar xx, yy;
{
xchar x, y;
coord foo[15], *tfoo;
int range;
tfoo = foo;
range = 1;
do { /* full kludge action. */
for (x = xx - range; x <= xx + range; x++)
if (goodpos(x, yy - range)) {
tfoo->x = x;
tfoo++->y = yy - range;
if (tfoo == &foo[15])
goto foofull;
}
for (x = xx - range; x <= xx + range; x++)
if (goodpos(x, yy + range)) {
tfoo->x = x;
tfoo++->y = yy + range;
if (tfoo == &foo[15])
goto foofull;
}
for (y = yy + 1 - range; y < yy + range; y++)
if (goodpos(xx - range, y)) {
tfoo->x = xx - range;
tfoo++->y = y;
if (tfoo == &foo[15])
goto foofull;
}
for (y = yy + 1 - range; y < yy + range; y++)
if (goodpos(xx + range, y)) {
tfoo->x = xx + range;
tfoo++->y = y;
if (tfoo == &foo[15])
goto foofull;
}
range++;
} while (tfoo == foo);
foofull:
return (foo[rn2(tfoo - foo)]);
}
int
goodpos(int x, int y)
{ /* 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)
));
}
void
rloc(mtmp)
struct monst *mtmp;
{
int tx, ty;
char ch = mtmp->data->mlet;
#ifndef NOWORM
if (ch == 'w' && mtmp->mx)
return; /* do not relocate worms */
#endif /* NOWORM */
do {
tx = rn1(COLNO - 3, 2);
ty = rn2(ROWNO);
} while (!goodpos(tx, ty));
mtmp->mx = tx;
mtmp->my = ty;
if (u.ustuck == mtmp) {
if (u.uswallow) {
u.ux = tx;
u.uy = ty;
docrt();
} else
u.ustuck = 0;
}
pmon(mtmp);
}
struct monst *
mkmon_at(let, x, y)
char let;
int x, y;
{
int ct;
const struct permonst *ptr;
for (ct = 0; ct < CMNUM; ct++) {
ptr = &mons[ct];
if (ptr->mlet == let)
return (makemon(ptr, x, y));
}
return (0);
}
|
