forked from NetHack/NetHack
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrect.c
More file actions
218 lines (183 loc) · 4.49 KB
/
rect.c
File metadata and controls
218 lines (183 loc) · 4.49 KB
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
/* NetHack 3.7 rect.c $NHDT-Date: 1596498203 2020/08/03 23:43:23 $ $NHDT-Branch: NetHack-3.7 $:$NHDT-Revision: 1.14 $ */
/* Copyright (c) 1990 by Jean-Christophe Collet */
/* NetHack may be freely redistributed. See license for details. */
#include "hack.h"
int get_rect_ind(NhRect *);
static boolean intersect(NhRect *, NhRect *, NhRect *);
/*
* In this file, we will handle the various rectangle functions we
* need for room generation.
*/
#define XLIM 4
#define YLIM 3
static NhRect *rect = (NhRect *) 0;
static int n_rects = 0;
static int rect_cnt;
/*
* Initialization of internal structures. Should be called for every
* new level to be build...
*/
void
init_rect(void)
{
if (!rect) {
n_rects = (COLNO * ROWNO) / 30;
rect = (NhRect *) alloc(sizeof(NhRect) * n_rects);
if (!rect)
panic("Could not alloc rect");
}
rect_cnt = 1;
rect[0].lx = rect[0].ly = 0;
rect[0].hx = COLNO - 1;
rect[0].hy = ROWNO - 1;
}
void
free_rect(void)
{
if (rect)
free(rect);
n_rects = rect_cnt = 0;
}
/*
* Search Index of one precise NhRect.
*
*/
int
get_rect_ind(NhRect* r)
{
register NhRect *rectp;
register int lx, ly, hx, hy;
register int i;
lx = r->lx;
ly = r->ly;
hx = r->hx;
hy = r->hy;
for (i = 0, rectp = &rect[0]; i < rect_cnt; i++, rectp++)
if (lx == rectp->lx && ly == rectp->ly && hx == rectp->hx
&& hy == rectp->hy)
return i;
return -1;
}
/*
* Search a free rectangle that include the one given in arg
*/
NhRect *
get_rect(NhRect* r)
{
register NhRect *rectp;
register int lx, ly, hx, hy;
register int i;
lx = r->lx;
ly = r->ly;
hx = r->hx;
hy = r->hy;
for (i = 0, rectp = &rect[0]; i < rect_cnt; i++, rectp++)
if (lx >= rectp->lx && ly >= rectp->ly && hx <= rectp->hx
&& hy <= rectp->hy)
return rectp;
return 0;
}
/*
* Get some random NhRect from the list.
*/
NhRect *
rnd_rect(void)
{
return rect_cnt > 0 ? &rect[rn2(rect_cnt)] : 0;
}
/*
* Search intersection between two rectangles (r1 & r2).
* return TRUE if intersection exist and put it in r3.
* otherwise returns FALSE
*/
static boolean
intersect(NhRect* r1, NhRect* r2, NhRect* r3)
{
if (r2->lx > r1->hx || r2->ly > r1->hy || r2->hx < r1->lx
|| r2->hy < r1->ly)
return FALSE;
r3->lx = (r2->lx > r1->lx ? r2->lx : r1->lx);
r3->ly = (r2->ly > r1->ly ? r2->ly : r1->ly);
r3->hx = (r2->hx > r1->hx ? r1->hx : r2->hx);
r3->hy = (r2->hy > r1->hy ? r1->hy : r2->hy);
if (r3->lx > r3->hx || r3->ly > r3->hy)
return FALSE;
return TRUE;
}
/* Put the rectangle containing both r1 and r2 into r3 */
void
rect_bounds(NhRect r1, NhRect r2, NhRect *r3)
{
r3->lx = min(r1.lx, r2.lx);
r3->ly = min(r1.ly, r2.ly);
r3->hx = max(r1.hx, r2.hx);
r3->hy = max(r1.hy, r2.hy);
}
/*
* Remove a rectangle from the list of free NhRect.
*/
void
remove_rect(NhRect* r)
{
int ind;
ind = get_rect_ind(r);
if (ind >= 0)
rect[ind] = rect[--rect_cnt];
}
/*
* Add a NhRect to the list.
*/
void
add_rect(NhRect* r)
{
if (rect_cnt >= n_rects) {
impossible("n_rects may be too small.");
return;
}
/* Check that this NhRect is not included in another one */
if (get_rect(r))
return;
rect[rect_cnt] = *r;
rect_cnt++;
}
/*
* Okay, here we have two rectangles (r1 & r2).
* r1 was already in the list and r2 is included in r1.
* What we want is to allocate r2, that is split r1 into smaller rectangles
* then remove it.
*/
void
split_rects(NhRect* r1, NhRect* r2)
{
NhRect r, old_r;
int i;
old_r = *r1;
remove_rect(r1);
/* Walk down since rect_cnt & rect[] will change... */
for (i = rect_cnt - 1; i >= 0; i--)
if (intersect(&rect[i], r2, &r))
split_rects(&rect[i], &r);
if (r2->ly - old_r.ly - 1
> (old_r.hy < ROWNO - 1 ? 2 * YLIM : YLIM + 1) + 4) {
r = old_r;
r.hy = r2->ly - 2;
add_rect(&r);
}
if (r2->lx - old_r.lx - 1
> (old_r.hx < COLNO - 1 ? 2 * XLIM : XLIM + 1) + 4) {
r = old_r;
r.hx = r2->lx - 2;
add_rect(&r);
}
if (old_r.hy - r2->hy - 1 > (old_r.ly > 0 ? 2 * YLIM : YLIM + 1) + 4) {
r = old_r;
r.ly = r2->hy + 2;
add_rect(&r);
}
if (old_r.hx - r2->hx - 1 > (old_r.lx > 0 ? 2 * XLIM : XLIM + 1) + 4) {
r = old_r;
r.lx = r2->hx + 2;
add_rect(&r);
}
}
/*rect.c*/