/* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */
/* hack.mkshop.c - version 1.0.3 */
#define ESHK ((struct eshk *)(&(shk->mextra[0])))
extern struct monst
*makemon();
extern struct obj
*mkobj_at();
extern char shtypes
[]; /* = "=/)%?!["; 8 types: 7 specialized, 1 mixed */
schar shprobs
[] = { 3,3,5,5,10,10,14,50 }; /* their probabilities */
register struct mkroom
*sroom
;
register int sh
,sx
,sy
,i
= -1;
register struct monst
*shk
;
/* first determine shoptype */
register char *ep
= getenv("SHOPTYPE");
if(*ep
== 'z' || *ep
== 'Z'){
if(*ep
== 'm' || *ep
== 'M'){
if(*ep
== 'b' || *ep
== 'B'){
if(*ep
== 's' || *ep
== 'S'){
for(i
=0; shtypes
[i
]; i
++)
if(*ep
== shtypes
[i
]) break;
for(sroom
= &rooms
[0], roomno
= 0; ; sroom
++, roomno
++){
if(sroom
->hx
< 0) return;
if(sroom
- rooms
>= nroom
) {
pline("rooms not closed by -1?");
if(sroom
->rtype
) continue;
if(!sroom
->rlit
|| has_dnstairs(sroom
) || has_upstairs(sroom
))
(wizard
&& getenv("SHOPTYPE") && sroom
->doorct
!= 0) ||
sroom
->doorct
<= 2 && sroom
->doorct
> 0) break;
if(i
< 0) { /* shoptype not yet determined */
for(j
= rn2(100), i
= 0; (j
-= shprobs
[i
])>= 0; i
++)
if(!shtypes
[i
]) break; /* superfluous */
if(isbig(sroom
) && i
+ SHOPBASE
== WANDSHOP
)
sroom
->rtype
= i
+ SHOPBASE
;
if(sx
== sroom
->lx
-1) sx
++; else
if(sx
== sroom
->hx
+1) sx
--; else
if(sy
== sroom
->ly
-1) sy
++; else
if(sy
== sroom
->hy
+1) sy
--; else {
/* This is said to happen sometimes, but I've never seen it. */
register int j
= sroom
->doorct
;
pline("Where is shopdoor?");
pline("Room at (%d,%d),(%d,%d).", sroom
->lx
, sroom
->ly
,
pline("doormax=%d doorct=%d fdoor=%d",
doorindex
, sroom
->doorct
, sh
);
pline("door [%d,%d]", doors
[sh
].x
, doors
[sh
].y
);
if(!(shk
= makemon(PM_SHK
,sx
,sy
))) return;
shk
->isshk
= shk
->mpeaceful
= 1;
shk
->mtrapseen
= ~0; /* we know all the traps already */
ESHK
->shoplevel
= dlevel
;
shk
->mgold
= 1000 + 30*rnd(100); /* initial capital */
findname(ESHK
->shknam
, let
);
for(sx
= sroom
->lx
; sx
<= sroom
->hx
; sx
++)
for(sy
= sroom
->ly
; sy
<= sroom
->hy
; sy
++){
register struct monst
*mtmp
;
if((sx
== sroom
->lx
&& doors
[sh
].x
== sx
-1) ||
(sx
== sroom
->hx
&& doors
[sh
].x
== sx
+1) ||
(sy
== sroom
->ly
&& doors
[sh
].y
== sy
-1) ||
(sy
== sroom
->hy
&& doors
[sh
].y
== sy
+1)) continue;
if(rn2(100) < dlevel
&& !m_at(sx
,sy
) &&
(mtmp
= makemon(PM_MIMIC
, sx
, sy
))){
(let
&& rn2(10) < dlevel
) ? let
: ']';
(void) mkobj_at(let
, sx
, sy
);
register struct mkroom
*sroom
;
register struct monst
*mon
;
int goldlim
= 500 * dlevel
;
struct permonst
*morguemon();
for(sroom
= &rooms
[rn2(nroom
)]; ; sroom
++) {
if(sroom
== &rooms
[nroom
])
if(!i
-- || sroom
->hx
< 0)
if(type
== MORGUE
&& sroom
->rlit
)
if(has_upstairs(sroom
) || (has_dnstairs(sroom
) && rn2(3)))
if(sroom
->doorct
== 1 || !rn2(5))
for(sx
= sroom
->lx
; sx
<= sroom
->hx
; sx
++)
for(sy
= sroom
->ly
; sy
<= sroom
->hy
; sy
++){
if((sx
== sroom
->lx
&& doors
[sh
].x
== sx
-1) ||
(sx
== sroom
->hx
&& doors
[sh
].x
== sx
+1) ||
(sy
== sroom
->ly
&& doors
[sh
].y
== sy
-1) ||
(sy
== sroom
->hy
&& doors
[sh
].y
== sy
+1)) continue;
(type
== MORGUE
) ? morguemon() :
(type
== BEEHIVE
) ? PM_KILLER_BEE
: (struct permonst
*) 0,
i
= sq(dist2(sx
,sy
,doors
[sh
].x
,doors
[sh
].y
));
if(i
>= goldlim
) i
= 5*dlevel
;
mkgold((long)(10 + rn2(i
)), sx
, sy
);
/* Usually there is one dead body in the morgue */
mksobj_at(CORPSE
, sx
, sy
);
if(!rn2(3)) mksobj_at(LUMP_OF_ROYAL_JELLY
, sx
, sy
);
extern struct permonst pm_ghost
;
register int i
= rn2(100), hd
= rn2(dlevel
);
if(hd
> 10 && i
< 10) return(PM_DEMON
);
if(hd
> 8 && i
> 85) return(PM_VAMPIRE
);
return((i
< 40) ? PM_GHOST
: (i
< 60) ? PM_WRAITH
: PM_ZOMBIE
);
mkswamp() /* Michiel Huisjes & Fred de Wilde */
register struct mkroom
*sroom
;
register int sx
,sy
,i
,eelct
= 0;
extern struct permonst pm_eel
;
for(i
=0; i
<5; i
++) { /* 5 tries */
sroom
= &rooms
[rn2(nroom
)];
if(sroom
->hx
< 0 || sroom
->rtype
||
has_upstairs(sroom
) || has_dnstairs(sroom
))
/* satisfied; make a swamp */
for(sx
= sroom
->lx
; sx
<= sroom
->hx
; sx
++)
for(sy
= sroom
->ly
; sy
<= sroom
->hy
; sy
++)
if((sx
+sy
)%2 && !o_at(sx
,sy
) && !t_at(sx
,sy
)
&& !m_at(sx
,sy
) && !nexttodoor(sx
,sy
)){
levl
[sx
][sy
].scrsym
= POOL_SYM
;
(void) makemon(PM_EEL
, sx
, sy
);
for(dx
= -1; dx
<= 1; dx
++) for(dy
= -1; dy
<= 1; dy
++)
if((lev
= &levl
[sx
+dx
][sy
+dy
])->typ
== DOOR
||
lev
->typ
== SDOOR
|| lev
->typ
== LDOOR
)
register struct mkroom
*sroom
;
return(sroom
->lx
<= xdnstair
&& xdnstair
<= sroom
->hx
&&
sroom
->ly
<= ydnstair
&& ydnstair
<= sroom
->hy
);
register struct mkroom
*sroom
;
return(sroom
->lx
<= xupstair
&& xupstair
<= sroom
->hx
&&
sroom
->ly
<= yupstair
&& yupstair
<= sroom
->hy
);
register struct mkroom
*sroom
;
register int area
= (sroom
->hx
- sroom
->lx
) * (sroom
->hy
- sroom
->ly
);
return((x0
-x1
)*(x0
-x1
) + (y0
-y1
)*(y0
-y1
));