… | |
… | |
37 | #define GLORY_HOLE 1 |
37 | #define GLORY_HOLE 1 |
38 | #define ORC_ZONE 2 |
38 | #define ORC_ZONE 2 |
39 | #define MINING_ZONE 3 |
39 | #define MINING_ZONE 3 |
40 | #define NR_OF_HOLE_TYPES 3 |
40 | #define NR_OF_HOLE_TYPES 3 |
41 | |
41 | |
42 | /* clear map completely of all objects: a rectangular area of xsize, ysize |
42 | /* clear map completely of all !floor objects: |
|
|
43 | * a rectangular area of xsize, ysize |
43 | is cleared with the top left corner at xstart, ystart */ |
44 | * is cleared with the top left corner at xstart, ystart |
44 | |
45 | */ |
45 | void |
46 | static void |
46 | nuke_map_region (maptile *map, int xstart, int ystart, int xsize, int ysize) |
47 | nuke_map_region (maptile *map, char **layout, int xstart, int ystart, int xsize, int ysize) |
47 | { |
48 | { |
48 | int i, j; |
|
|
49 | object *tmp; |
|
|
50 | |
|
|
51 | for (i = xstart; i < xstart + xsize; i++) |
49 | for (int i = xstart; i < xstart + xsize; i++) |
52 | for (j = ystart; j < ystart + ysize; j++) |
50 | for (int j = ystart; j < ystart + ysize; j++) |
53 | { |
51 | { |
54 | for (tmp = GET_MAP_OB (map, i, j); tmp != NULL; tmp = tmp->above) |
52 | layout[i][j] = 'S'; |
|
|
53 | |
|
|
54 | for (object *tmp = map->at (i, j).bot; tmp; ) |
|
|
55 | if (tmp->flag [FLAG_IS_FLOOR]) |
|
|
56 | tmp = tmp->above; |
55 | { |
57 | else |
56 | if (!QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
|
|
57 | { |
58 | { |
58 | if (tmp->head) |
59 | object *head = tmp->head_ (); |
59 | tmp = tmp->head; |
60 | tmp = tmp->above; |
60 | tmp->remove (); |
|
|
61 | tmp->destroy (); |
61 | head->destroy (); |
62 | tmp = GET_MAP_OB (map, i, j); |
|
|
63 | } |
62 | } |
64 | if (tmp == NULL) |
|
|
65 | break; |
|
|
66 | } |
|
|
67 | } |
63 | } |
68 | } |
64 | } |
69 | |
65 | |
70 | /* copy in_map into dest_map at point x,y */ |
66 | /* copy in_map into dest_map at point x,y */ |
71 | void |
67 | static void |
72 | include_map_in_map (maptile *dest_map, maptile *in_map, int x, int y) |
68 | include_map_in_map (maptile *dest_map, maptile *in_map, int x, int y) |
73 | { |
69 | { |
74 | int i, j; |
|
|
75 | object *tmp; |
|
|
76 | object *new_ob; |
|
|
77 | |
|
|
78 | /* First, splatter everything in the dest map at the location */ |
|
|
79 | nuke_map_region (dest_map, x, y, in_map->width, in_map->height); |
|
|
80 | |
|
|
81 | for (i = 0; i < in_map->width; i++) |
70 | for (int i = 0; i < in_map->width; i++) |
82 | for (j = 0; j < in_map->height; j++) |
71 | for (int j = 0; j < in_map->height; j++) |
83 | { |
|
|
84 | for (tmp = GET_MAP_OB (in_map, i, j); tmp != NULL; tmp = tmp->above) |
72 | for (object *tmp = GET_MAP_OB (in_map, i, j); tmp; tmp = tmp->above) |
85 | { |
73 | { |
86 | /* don't copy things with multiple squares: must be dealt with |
74 | /* don't copy tails: must be dealt with specially. */ |
87 | specially. */ |
|
|
88 | if (tmp->head != NULL) |
75 | if (!tmp->is_head ()) |
89 | continue; |
76 | continue; |
90 | new_ob = arch_to_object (tmp->arch); |
77 | |
91 | copy_object_with_inv (tmp, new_ob); |
78 | object *new_ob = tmp->deep_clone (); |
|
|
79 | |
92 | if (QUERY_FLAG (tmp, FLAG_IS_LINKED)) |
80 | if (QUERY_FLAG (tmp, FLAG_IS_LINKED)) |
93 | add_button_link (new_ob, dest_map, tmp->path_attuned); |
81 | add_button_link (new_ob, dest_map, tmp->path_attuned); |
94 | new_ob->x = i + x; |
82 | |
95 | new_ob->y = j + y; |
83 | dest_map->insert (new_ob, x + i, y + j, 0, INS_NO_MERGE | INS_NO_WALK_ON); |
96 | insert_multisquare_ob_in_map (new_ob, dest_map); |
|
|
97 | } |
84 | } |
98 | } |
|
|
99 | } |
85 | } |
100 | |
86 | |
101 | int |
87 | static int |
102 | find_spot_for_submap (maptile *map, char **layout, int *ix, int *iy, int xsize, int ysize) |
88 | find_spot_for_submap (maptile *map, char **layout, int *ix, int *iy, int xsize, int ysize) |
103 | { |
89 | { |
104 | int tries; |
90 | int blocked, i, j; |
105 | int i = 0, j = 0; /* initialization may not be needed but prevents compiler warnings */ |
|
|
106 | int is_occupied = 0; |
|
|
107 | int l, m; |
|
|
108 | |
91 | |
109 | /* don't even try to place a submap into a map if the big map isn't |
92 | /* don't even try to place a submap into a map if the big map isn't |
110 | sufficiently large. */ |
93 | sufficiently large. */ |
111 | if (2 * xsize > map->width || 2 * ysize > map->height) |
94 | if (2 * xsize > map->width || 2 * ysize > map->height) |
112 | return 0; |
95 | return 0; |
113 | |
96 | |
114 | /* search a bit for a completely free spot. */ |
97 | /* search a bit for a completely free spot. */ |
115 | for (tries = 0; tries < 20; tries++) |
98 | for (int tries = 0; tries < 20; tries++) |
116 | { |
99 | { |
|
|
100 | blocked = 0; |
|
|
101 | |
117 | /* pick a random location in the layout */ |
102 | /* pick a random location in the layout */ |
118 | i = rndm (map->width - xsize - 2) + 1; |
103 | i = rmg_rndm (1, map->width - xsize - 2); |
119 | j = rndm (map->height - ysize - 2) + 1; |
104 | j = rmg_rndm (1, map->height - ysize - 2); |
120 | is_occupied = 0; |
105 | |
121 | for (l = i; l < i + xsize; l++) |
106 | for (int l = i; l < i + xsize; l++) |
122 | for (m = j; m < j + ysize; m++) |
107 | for (int m = j; m < j + ysize; m++) |
123 | is_occupied |= layout[l][m]; |
108 | { |
124 | if (!is_occupied) |
109 | blocked = 1; |
125 | break; |
110 | break; |
126 | } |
111 | } |
127 | |
112 | |
|
|
113 | if (!blocked) |
|
|
114 | break; |
|
|
115 | } |
128 | |
116 | |
129 | /* if we failed, relax the restrictions */ |
117 | /* if we failed, relax the restrictions */ |
130 | |
118 | if (blocked) |
131 | if (is_occupied) |
|
|
132 | { /* failure, try a relaxed placer. */ |
119 | { /* failure, try a relaxed placer. */ |
133 | /* pick a random location in the layout */ |
120 | /* pick a random location in the layout */ |
134 | for (tries = 0; tries < 10; tries++) |
121 | for (int tries = 0; tries < 10; tries++) |
135 | { |
122 | { |
136 | i = rndm (map->width - xsize - 2) + 1; |
123 | i = rmg_rndm (1, map->width - xsize - 2); |
137 | j = rndm (map->height - ysize - 2) + 1; |
124 | j = rmg_rndm (1, map->height - ysize - 2); |
|
|
125 | |
138 | is_occupied = 0; |
126 | blocked = 0; |
|
|
127 | |
139 | for (l = i; l < i + xsize; l++) |
128 | for (int l = i; l < i + xsize; l++) |
140 | for (m = j; m < j + ysize; m++) |
129 | for (int m = j; m < j + ysize; m++) |
141 | if (layout[l][m] == 'C' || layout[l][m] == '>' || layout[l][m] == '<') |
130 | if (layout[l][m] != '#' && layout[l][m] != 'D' && layout[l][m] != 0) |
|
|
131 | { |
142 | is_occupied |= 1; |
132 | blocked = 1; |
|
|
133 | break; |
|
|
134 | } |
143 | } |
135 | } |
144 | } |
136 | } |
145 | |
137 | |
146 | if (is_occupied) |
138 | if (blocked) |
147 | return 0; |
139 | return 0; |
148 | |
140 | |
149 | *ix = i; |
141 | *ix = i; |
150 | *iy = j; |
142 | *iy = j; |
|
|
143 | |
151 | return 1; |
144 | return 1; |
152 | } |
145 | } |
153 | |
146 | |
154 | void |
147 | static void |
155 | place_fountain_with_specials (maptile *map) |
148 | place_fountain_with_specials (maptile *map) |
156 | { |
149 | { |
157 | int ix, iy, i = -1, tries = 0; |
150 | int ix, iy, i = -1, tries = 0; |
158 | maptile *fountain_style = find_style ("/styles/misc", "fountains", -1); |
151 | maptile *fountain_style = find_style ("/styles/misc", "fountains", -1); |
159 | |
152 | |
… | |
… | |
161 | { |
154 | { |
162 | LOG (llevError, "unable to load stylemap /styles/misc fountains\n"); |
155 | LOG (llevError, "unable to load stylemap /styles/misc fountains\n"); |
163 | return; |
156 | return; |
164 | } |
157 | } |
165 | |
158 | |
166 | object *fountain = archetype::get ("fountain"); |
159 | object *fountain = archetype::get (shstr_fountain); |
167 | object *potion = fountain_style->pick_random_object ()->clone (); |
160 | object *potion = fountain_style->pick_random_object (rmg_rndm)->clone (); |
168 | |
161 | |
169 | while (i < 0 && tries < 10) |
162 | while (i < 0 && tries < 10) |
170 | { |
163 | { |
171 | ix = rndm (map->width - 2) + 1; |
164 | ix = rmg_rndm (map->width - 2) + 1; |
172 | iy = rndm (map->height - 2) + 1; |
165 | iy = rmg_rndm (map->height - 2) + 1; |
173 | i = find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1); |
166 | i = find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1); |
174 | tries++; |
167 | tries++; |
175 | } |
168 | } |
176 | |
169 | |
177 | if (i == -1) |
170 | if (i == -1) |
… | |
… | |
194 | fountain->y = iy; |
187 | fountain->y = iy; |
195 | insert_ob_in_map (fountain, map, NULL, 0); |
188 | insert_ob_in_map (fountain, map, NULL, 0); |
196 | insert_ob_in_map (potion, map, NULL, 0); |
189 | insert_ob_in_map (potion, map, NULL, 0); |
197 | } |
190 | } |
198 | |
191 | |
199 | void |
192 | static void |
200 | place_special_exit (maptile *map, int hole_type, random_map_params *RP) |
193 | place_special_exit (maptile *map, int hole_type, random_map_params *RP) |
201 | { |
194 | { |
202 | int ix, iy, i = -1; |
195 | int ix, iy, i = -1; |
203 | char buf[16384]; |
196 | char buf[16384]; |
204 | const char *style, *decor, *mon; |
197 | const char *style, *decor, *mon; |
… | |
… | |
212 | } |
205 | } |
213 | |
206 | |
214 | if (!exit_style) |
207 | if (!exit_style) |
215 | return; |
208 | return; |
216 | |
209 | |
217 | object *the_exit = exit_style->pick_random_object ()->clone (); |
210 | object *the_exit = exit_style->pick_random_object (rmg_rndm)->clone (); |
218 | |
211 | |
219 | // put an upper bound here, just in case |
212 | // put an upper bound here, just in case |
220 | for (int repeat = 8192; --repeat; ) |
213 | for (int repeat = 8192; --repeat; ) |
221 | { |
214 | { |
222 | ix = rndm (map->width - 2) + 1; |
215 | ix = rmg_rndm (1, map->width - 2); |
223 | iy = rndm (map->height - 2) + 1; |
216 | iy = rmg_rndm (1, map->height - 2); |
224 | |
217 | |
225 | i = find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1); |
218 | i = find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1); |
226 | if (i >= 0) |
219 | if (i >= 0) |
227 | { |
220 | { |
228 | ix += freearr_x[i]; |
221 | ix += freearr_x[i]; |
… | |
… | |
233 | |
226 | |
234 | the_exit->x = ix; |
227 | the_exit->x = ix; |
235 | the_exit->y = iy; |
228 | the_exit->y = iy; |
236 | |
229 | |
237 | if (!hole_type) |
230 | if (!hole_type) |
238 | hole_type = rndm (NR_OF_HOLE_TYPES) + 1; |
231 | hole_type = rmg_rndm (NR_OF_HOLE_TYPES) + 1; |
239 | |
232 | |
240 | switch (hole_type) |
233 | switch (hole_type) |
241 | { |
234 | { |
242 | case GLORY_HOLE: /* treasures */ |
235 | case GLORY_HOLE: /* treasures */ |
243 | { |
236 | { |
244 | g_xsize = rndm (3) + 4 + RP->difficulty / 4; |
237 | g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
245 | g_ysize = rndm (3) + 4 + RP->difficulty / 4; |
238 | g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
246 | style = "onion"; |
239 | style = "onion"; |
247 | decor = "wealth2"; |
240 | decor = "wealth2"; |
248 | mon = "none"; |
241 | mon = "none"; |
249 | break; |
242 | break; |
250 | } |
243 | } |
251 | |
244 | |
252 | case ORC_ZONE: /* hole with orcs in it. */ |
245 | case ORC_ZONE: /* hole with orcs in it. */ |
253 | { |
246 | { |
254 | g_xsize = rndm (3) + 4 + RP->difficulty / 4; |
247 | g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
255 | g_ysize = rndm (3) + 4 + RP->difficulty / 4; |
248 | g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
256 | style = "onion"; |
249 | style = "onion"; |
257 | decor = "wealth2"; |
250 | decor = "wealth2"; |
258 | mon = "orc"; |
251 | mon = "orc"; |
259 | break; |
252 | break; |
260 | } |
253 | } |
261 | |
254 | |
262 | case MINING_ZONE: /* hole with orcs in it. */ |
255 | case MINING_ZONE: /* hole with orcs in it. */ |
263 | { |
256 | { |
264 | g_xsize = rndm (9) + 4 + RP->difficulty / 4; |
257 | g_xsize = rmg_rndm (9) + 4 + RP->difficulty / 4; |
265 | g_ysize = rndm (9) + 4 + RP->difficulty / 4; |
258 | g_ysize = rmg_rndm (9) + 4 + RP->difficulty / 4; |
266 | style = "maze"; |
259 | style = "maze"; |
267 | decor = "minerals2"; |
260 | decor = "minerals2"; |
268 | mon = "none"; |
261 | mon = "none"; |
269 | break; |
262 | break; |
270 | } |
263 | } |
… | |
… | |
292 | } |
285 | } |
293 | |
286 | |
294 | void |
287 | void |
295 | place_specials_in_map (maptile *map, char **layout, random_map_params *RP) |
288 | place_specials_in_map (maptile *map, char **layout, random_map_params *RP) |
296 | { |
289 | { |
297 | maptile *special_map; |
290 | switch (rmg_rndm (NUM_OF_SPECIAL_TYPES)) |
298 | int ix, iy; /* map insertion locatons */ |
|
|
299 | int special_type; /* type of special to make */ |
|
|
300 | |
|
|
301 | special_type = rndm (NUM_OF_SPECIAL_TYPES); |
|
|
302 | |
|
|
303 | switch (special_type) |
|
|
304 | { |
291 | { |
305 | case SPECIAL_SUBMAP: |
292 | case SPECIAL_SUBMAP: |
|
|
293 | { |
306 | /* includes a special map into the random map being made. */ |
294 | /* includes a special map into the random map being made. */ |
307 | special_map = find_style ("/styles/specialmaps", 0, RP->difficulty); |
295 | maptile *special_map = find_style ("/styles/specialmaps", 0, RP->difficulty); |
308 | |
296 | |
309 | if (!special_map) |
297 | if (!special_map) |
310 | return; |
298 | break; |
311 | |
299 | |
|
|
300 | int ix, iy; /* map insertion locatons */ |
|
|
301 | |
312 | if (find_spot_for_submap (map, layout, &ix, &iy, special_map->width, special_map->height)) |
302 | if (find_spot_for_submap (map, layout, &ix, &iy, special_map->width, special_map->height)) |
|
|
303 | { |
|
|
304 | /* First, splatter everything in the dest map at the location */ |
|
|
305 | nuke_map_region (map, layout, ix, iy, special_map->width, special_map->height); |
313 | include_map_in_map (map, special_map, ix, iy); |
306 | include_map_in_map (map, special_map, ix, iy); |
|
|
307 | } |
|
|
308 | } |
314 | |
309 | |
315 | break; |
310 | break; |
316 | |
311 | |
317 | case SPECIAL_FOUNTAIN: |
312 | case SPECIAL_FOUNTAIN: |
318 | /* Make a special fountain: an unpickable potion disguised as |
313 | /* Make a special fountain: an unpickable potion disguised as |