mqueues: Add support for _SC_MQ_PRIO_MAX in sysconf(3).
[dragonfly.git] / games / hack / hack.mkmaze.c
blob9c6c7fc39c5b8f70b5ca91d72b64491a5467d045
1 /* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */
2 /* hack.mkmaze.c - version 1.0.2 */
3 /* $FreeBSD: src/games/hack/hack.mkmaze.c,v 1.4 1999/11/16 10:26:37 marcel Exp $ */
4 /* $DragonFly: src/games/hack/hack.mkmaze.c,v 1.3 2006/08/21 19:45:32 pavalos Exp $ */
6 #include "hack.h"
7 extern struct permonst pm_wizard;
8 struct permonst hell_hound =
9 { "hell hound", 'd', 12, 14, 2, 3, 6, 0 };
11 static void walkfrom(int, int);
12 static void move(int *, int *, int);
13 static bool okay(int, int, int);
15 void
16 makemaz(void)
18 int x,y;
19 int zx,zy;
20 coord mm;
21 boolean al = (dlevel >= 30 && !flags.made_amulet);
23 for(x = 2; x < COLNO-1; x++)
24 for(y = 2; y < ROWNO-1; y++)
25 levl[x][y].typ = (x%2 && y%2) ? 0 : HWALL;
26 if(al) {
27 struct monst *mtmp;
29 zx = 2*(COLNO/4) - 1;
30 zy = 2*(ROWNO/4) - 1;
31 for(x = zx-2; x < zx+4; x++) for(y = zy-2; y <= zy+2; y++) {
32 levl[x][y].typ =
33 (y == zy-2 || y == zy+2 || x == zx-2 || x == zx+3) ? POOL :
34 (y == zy-1 || y == zy+1 || x == zx-1 || x == zx+2) ? HWALL:
35 ROOM;
37 mkobj_at(AMULET_SYM, zx, zy);
38 flags.made_amulet = 1;
39 walkfrom(zx+4, zy);
40 if((mtmp = makemon(&hell_hound, zx, zy)))
41 mtmp->msleep = 1;
42 if((mtmp = makemon(PM_WIZARD, zx+1, zy))) {
43 mtmp->msleep = 1;
44 flags.no_of_wizards = 1;
46 } else {
47 mm = mazexy();
48 zx = mm.x;
49 zy = mm.y;
50 walkfrom(zx,zy);
51 mksobj_at(WAN_WISHING, zx, zy);
52 mkobj_at(ROCK_SYM, zx, zy); /* put a rock on top of it */
55 for(x = 2; x < COLNO-1; x++)
56 for(y = 2; y < ROWNO-1; y++) {
57 switch(levl[x][y].typ) {
58 case HWALL:
59 levl[x][y].scrsym = '-';
60 break;
61 case ROOM:
62 levl[x][y].scrsym = '.';
63 break;
66 for(x = rn1(8,11); x; x--) {
67 mm = mazexy();
68 mkobj_at(rn2(2) ? GEM_SYM : 0, mm.x, mm.y);
70 for(x = rn1(10,2); x; x--) {
71 mm = mazexy();
72 mkobj_at(ROCK_SYM, mm.x, mm.y);
74 mm = mazexy();
75 makemon(PM_MINOTAUR, mm.x, mm.y);
76 for(x = rn1(5,7); x; x--) {
77 mm = mazexy();
78 makemon(NULL, mm.x, mm.y);
80 for(x = rn1(6,7); x; x--) {
81 mm = mazexy();
82 mkgold(0L,mm.x,mm.y);
84 for(x = rn1(6,7); x; x--)
85 mktrap(0,1,NULL);
86 mm = mazexy();
87 levl[(xupstair = mm.x)][(yupstair = mm.y)].scrsym = '<';
88 levl[xupstair][yupstair].typ = STAIRS;
89 xdnstair = ydnstair = 0;
92 static void
93 walkfrom(int x, int y)
95 int q,a,dir;
96 int dirs[4];
97 levl[x][y].typ = ROOM;
98 while(1) {
99 q = 0;
100 for(a = 0; a < 4; a++)
101 if(okay(x,y,a)) dirs[q++]= a;
102 if(!q) return;
103 dir = dirs[rn2(q)];
104 move(&x,&y,dir);
105 levl[x][y].typ = ROOM;
106 move(&x,&y,dir);
107 walkfrom(x,y);
111 static void
112 move(int *x, int *y, int dir)
114 switch(dir){
115 case 0: --(*y); break;
116 case 1: (*x)++; break;
117 case 2: (*y)++; break;
118 case 3: --(*x); break;
122 static bool
123 okay(int x, int y, int dir)
125 move(&x,&y,dir);
126 move(&x,&y,dir);
127 if(x<3 || y<3 || x>COLNO-3 || y>ROWNO-3 || levl[x][y].typ != 0)
128 return(0);
129 else
130 return(1);
133 coord
134 mazexy(void)
136 coord mm;
137 mm.x = 3 + 2*rn2(COLNO/2 - 2);
138 mm.y = 3 + 2*rn2(ROWNO/2 - 2);
139 return mm;