ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/random_maps/special.C
(Generate patch)

Comparing deliantra/server/random_maps/special.C (file contents):
Revision 1.30 by root, Fri May 2 21:22:22 2008 UTC vs.
Revision 1.35 by root, Mon Sep 29 10:32:50 2008 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines