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.40 by root, Fri Mar 26 00:59:21 2010 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 23 */
23 24
24/* Specials in this file: 25/* Specials in this file:
… …
37#define GLORY_HOLE 1 38#define GLORY_HOLE 1
38#define ORC_ZONE 2 39#define ORC_ZONE 2
39#define MINING_ZONE 3 40#define MINING_ZONE 3
40#define NR_OF_HOLE_TYPES 3 41#define NR_OF_HOLE_TYPES 3
41 42
42/* clear map completely of all objects: a rectangular area of xsize, ysize 43/* clear map completely of all !floor objects:
44 * a rectangular area of xsize, ysize
43is cleared with the top left corner at xstart, ystart */ 45 * is cleared with the top left corner at xstart, ystart
44 46 */
45void 47static void
46nuke_map_region (maptile *map, int xstart, int ystart, int xsize, int ysize) 48nuke_map_region (maptile *map, char **layout, int xstart, int ystart, int xsize, int ysize)
47{ 49{
48 int i, j;
49 object *tmp;
50
51 for (i = xstart; i < xstart + xsize; i++) 50 for (int i = xstart; i < xstart + xsize; i++)
52 for (j = ystart; j < ystart + ysize; j++) 51 for (int j = ystart; j < ystart + ysize; j++)
53 { 52 {
54 for (tmp = GET_MAP_OB (map, i, j); tmp != NULL; tmp = tmp->above) 53 layout[i][j] = 'S';
54
55 for (object *tmp = map->at (i, j).bot; tmp; )
56 if (tmp->flag [FLAG_IS_FLOOR])
57 tmp = tmp->above;
55 { 58 else
56 if (!QUERY_FLAG (tmp, FLAG_IS_FLOOR))
57 { 59 {
58 if (tmp->head) 60 object *head = tmp->head_ ();
59 tmp = tmp->head; 61 tmp = tmp->above;
60 tmp->remove ();
61 tmp->destroy (); 62 head->destroy ();
62 tmp = GET_MAP_OB (map, i, j);
63 } 63 }
64 if (tmp == NULL)
65 break;
66 }
67 } 64 }
68} 65}
69 66
70/* copy in_map into dest_map at point x,y */ 67/* copy in_map into dest_map at point x,y */
71void 68static void
72include_map_in_map (maptile *dest_map, maptile *in_map, int x, int y) 69include_map_in_map (maptile *dest_map, maptile *in_map, int x, int y)
73{ 70{
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++) 71 for (int i = 0; i < in_map->width; i++)
78 for (int j = 0; j < in_map->height; j++) 72 for (int j = 0; j < in_map->height; j++)
79 for (object *tmp = GET_MAP_OB (in_map, i, j); tmp; tmp = tmp->above) 73 for (object *tmp = GET_MAP_OB (in_map, i, j); tmp; tmp = tmp->above)
80 { 74 {
81 /* don't copy things with multiple squares: must be dealt with 75 /* don't copy tails: must be dealt with specially. */
82 specially. */
83 if (!tmp->is_head ()) 76 if (!tmp->is_head ())
84 continue; 77 continue;
85 78
86 object *new_ob = object_create_clone (tmp); 79 object *new_ob = tmp->deep_clone ();
87 80
88 if (QUERY_FLAG (tmp, FLAG_IS_LINKED)) 81 if (QUERY_FLAG (tmp, FLAG_IS_LINKED))
89 add_button_link (new_ob, dest_map, tmp->path_attuned); 82 new_ob->add_link (dest_map, tmp->find_link ()->id);
90 83
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); 84 dest_map->insert (new_ob, x + i, y + j, 0, INS_NO_MERGE | INS_NO_WALK_ON);
94 } 85 }
95} 86}
96 87
97int 88static int
98find_spot_for_submap (maptile *map, char **layout, int *ix, int *iy, int xsize, int ysize) 89find_spot_for_submap (maptile *map, char **layout, int *ix, int *iy, int xsize, int ysize)
99{ 90{
100 int tries; 91 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 92
105 /* don't even try to place a submap into a map if the big map isn't 93 /* don't even try to place a submap into a map if the big map isn't
106 sufficiently large. */ 94 sufficiently large. */
107 if (2 * xsize > map->width || 2 * ysize > map->height) 95 if (2 * xsize > map->width || 2 * ysize > map->height)
108 return 0; 96 return 0;
109 97
110 /* search a bit for a completely free spot. */ 98 /* search a bit for a completely free spot. */
111 for (tries = 0; tries < 20; tries++) 99 for (int tries = 0; tries < 20; tries++)
112 { 100 {
101 blocked = 0;
102
113 /* pick a random location in the layout */ 103 /* pick a random location in the layout */
114 i = rndm (map->width - xsize - 2) + 1; 104 i = rmg_rndm (1, map->width - xsize - 2);
115 j = rndm (map->height - ysize - 2) + 1; 105 j = rmg_rndm (1, map->height - ysize - 2);
116 is_occupied = 0; 106
117 for (l = i; l < i + xsize; l++) 107 for (int l = i; l < i + xsize; l++)
118 for (m = j; m < j + ysize; m++) 108 for (int m = j; m < j + ysize; m++)
119 is_occupied |= layout[l][m]; 109 {
120 if (!is_occupied) 110 blocked = 1;
121 break; 111 break;
122 } 112 }
123 113
114 if (!blocked)
115 break;
116 }
124 117
125 /* if we failed, relax the restrictions */ 118 /* if we failed, relax the restrictions */
126 119 if (blocked)
127 if (is_occupied)
128 { /* failure, try a relaxed placer. */ 120 { /* failure, try a relaxed placer. */
129 /* pick a random location in the layout */ 121 /* pick a random location in the layout */
130 for (tries = 0; tries < 10; tries++) 122 for (int tries = 0; tries < 10; tries++)
131 { 123 {
132 i = rndm (map->width - xsize - 2) + 1; 124 i = rmg_rndm (1, map->width - xsize - 2);
133 j = rndm (map->height - ysize - 2) + 1; 125 j = rmg_rndm (1, map->height - ysize - 2);
126
134 is_occupied = 0; 127 blocked = 0;
128
135 for (l = i; l < i + xsize; l++) 129 for (int l = i; l < i + xsize; l++)
136 for (m = j; m < j + ysize; m++) 130 for (int m = j; m < j + ysize; m++)
137 if (layout[l][m] == 'C' || layout[l][m] == '>' || layout[l][m] == '<') 131 if (layout[l][m] != '#' && layout[l][m] != 'D' && layout[l][m] != 0)
132 {
138 is_occupied |= 1; 133 blocked = 1;
134 break;
135 }
139 } 136 }
140 } 137 }
141 138
142 if (is_occupied) 139 if (blocked)
143 return 0; 140 return 0;
144 141
145 *ix = i; 142 *ix = i;
146 *iy = j; 143 *iy = j;
144
147 return 1; 145 return 1;
148} 146}
149 147
150void 148static void
151place_fountain_with_specials (maptile *map) 149place_fountain_with_specials (maptile *map)
152{ 150{
153 int ix, iy, i = -1, tries = 0; 151 int ix, iy, i = -1, tries = 0;
154 maptile *fountain_style = find_style ("/styles/misc", "fountains", -1); 152 maptile *fountain_style = find_style ("/styles/misc", "fountains", -1);
155 153
… …
157 { 155 {
158 LOG (llevError, "unable to load stylemap /styles/misc fountains\n"); 156 LOG (llevError, "unable to load stylemap /styles/misc fountains\n");
159 return; 157 return;
160 } 158 }
161 159
162 object *fountain = archetype::get ("fountain"); 160 object *fountain = archetype::get (shstr_fountain);
163 object *potion = fountain_style->pick_random_object ()->clone (); 161 object *potion = fountain_style->pick_random_object (rmg_rndm)->clone ();
164 162
165 while (i < 0 && tries < 10) 163 while (i < 0 && tries < 10)
166 { 164 {
167 ix = rndm (map->width - 2) + 1; 165 ix = rmg_rndm (map->width - 2) + 1;
168 iy = rndm (map->height - 2) + 1; 166 iy = rmg_rndm (map->height - 2) + 1;
169 i = find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1); 167 i = find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1);
170 tries++; 168 tries++;
171 } 169 }
172 170
173 if (i == -1) 171 if (i == -1)
… …
180 ix += freearr_x[i]; 178 ix += freearr_x[i];
181 iy += freearr_y[i]; 179 iy += freearr_y[i];
182 potion->face = fountain->face; 180 potion->face = fountain->face;
183 SET_FLAG (potion, FLAG_NO_PICK); 181 SET_FLAG (potion, FLAG_NO_PICK);
184 SET_FLAG (potion, FLAG_IDENTIFIED); 182 SET_FLAG (potion, FLAG_IDENTIFIED);
185 potion->name = potion->name_pl = "fountain"; 183 potion->name = potion->name_pl = shstr_fountain;
186 potion->x = ix; 184 potion->x = ix;
187 potion->y = iy; 185 potion->y = iy;
188 potion->materialname = "adamantium"; 186 potion->material = name_to_material (shstr_adamantium);
189 fountain->x = ix; 187 fountain->x = ix;
190 fountain->y = iy; 188 fountain->y = iy;
191 insert_ob_in_map (fountain, map, NULL, 0); 189 insert_ob_in_map (fountain, map, NULL, 0);
192 insert_ob_in_map (potion, map, NULL, 0); 190 insert_ob_in_map (potion, map, NULL, 0);
193} 191}
194 192
195void 193static void
196place_special_exit (maptile *map, int hole_type, random_map_params *RP) 194place_special_exit (maptile *map, int hole_type, random_map_params *RP)
197{ 195{
198 int ix, iy, i = -1; 196 int ix, iy, i = -1;
199 char buf[16384]; 197 char buf[16384];
200 const char *style, *decor, *mon; 198 const char *style, *decor, *mon;
… …
208 } 206 }
209 207
210 if (!exit_style) 208 if (!exit_style)
211 return; 209 return;
212 210
213 object *the_exit = exit_style->pick_random_object ()->clone (); 211 object *the_exit = exit_style->pick_random_object (rmg_rndm)->clone ();
214 212
215 // put an upper bound here, just in case 213 // put an upper bound here, just in case
216 for (int repeat = 8192; --repeat; ) 214 for (int repeat = 8192; --repeat; )
217 { 215 {
218 ix = rndm (map->width - 2) + 1; 216 ix = rmg_rndm (1, map->width - 2);
219 iy = rndm (map->height - 2) + 1; 217 iy = rmg_rndm (1, map->height - 2);
220 218
221 i = find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1); 219 i = find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1);
222 if (i >= 0) 220 if (i >= 0)
223 { 221 {
224 ix += freearr_x[i]; 222 ix += freearr_x[i];
… …
229 227
230 the_exit->x = ix; 228 the_exit->x = ix;
231 the_exit->y = iy; 229 the_exit->y = iy;
232 230
233 if (!hole_type) 231 if (!hole_type)
234 hole_type = rndm (NR_OF_HOLE_TYPES) + 1; 232 hole_type = rmg_rndm (NR_OF_HOLE_TYPES) + 1;
235 233
236 switch (hole_type) 234 switch (hole_type)
237 { 235 {
238 case GLORY_HOLE: /* treasures */ 236 case GLORY_HOLE: /* treasures */
239 { 237 {
240 g_xsize = rndm (3) + 4 + RP->difficulty / 4; 238 g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4;
241 g_ysize = rndm (3) + 4 + RP->difficulty / 4; 239 g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4;
242 style = "onion"; 240 style = "onion";
243 decor = "wealth2"; 241 decor = "wealth2";
244 mon = "none"; 242 mon = "none";
245 break; 243 break;
246 } 244 }
247 245
248 case ORC_ZONE: /* hole with orcs in it. */ 246 case ORC_ZONE: /* hole with orcs in it. */
249 { 247 {
250 g_xsize = rndm (3) + 4 + RP->difficulty / 4; 248 g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4;
251 g_ysize = rndm (3) + 4 + RP->difficulty / 4; 249 g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4;
252 style = "onion"; 250 style = "onion";
253 decor = "wealth2"; 251 decor = "wealth2";
254 mon = "orc"; 252 mon = "orc";
255 break; 253 break;
256 } 254 }
257 255
258 case MINING_ZONE: /* hole with orcs in it. */ 256 case MINING_ZONE: /* hole with orcs in it. */
259 { 257 {
260 g_xsize = rndm (9) + 4 + RP->difficulty / 4; 258 g_xsize = rmg_rndm (9) + 4 + RP->difficulty / 4;
261 g_ysize = rndm (9) + 4 + RP->difficulty / 4; 259 g_ysize = rmg_rndm (9) + 4 + RP->difficulty / 4;
262 style = "maze"; 260 style = "maze";
263 decor = "minerals2"; 261 decor = "minerals2";
264 mon = "none"; 262 mon = "none";
265 break; 263 break;
266 } 264 }
… …
279 277
280 write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon, 278 write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon,
281 "none", style, decor, "none", RP->exitstyle, 0, 0, 0, 279 "none", style, decor, "none", RP->exitstyle, 0, 0, 0,
282 RMOPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level, 280 RMOPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level,
283 RP->difficulty, RP->difficulty, -1, 1, 0, 0, 0, 0, RP->difficulty_increase); 281 RP->difficulty, RP->difficulty, -1, 1, 0, 0, 0, 0, RP->difficulty_increase);
284 the_exit->slaying = "/!"; 282 the_exit->slaying = shstr_random_map_exit;
285 the_exit->msg = buf; 283 the_exit->msg = buf;
286 284
287 insert_ob_in_map (the_exit, map, NULL, 0); 285 insert_ob_in_map (the_exit, map, NULL, 0);
288} 286}
289 287
290void 288void
291place_specials_in_map (maptile *map, char **layout, random_map_params *RP) 289place_specials_in_map (maptile *map, char **layout, random_map_params *RP)
292{ 290{
293 maptile *special_map; 291 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 { 292 {
301 case SPECIAL_SUBMAP: 293 case SPECIAL_SUBMAP:
294 {
302 /* includes a special map into the random map being made. */ 295 /* includes a special map into the random map being made. */
303 special_map = find_style ("/styles/specialmaps", 0, RP->difficulty); 296 maptile *special_map = find_style ("/styles/specialmaps", 0, RP->difficulty);
304 297
305 if (!special_map) 298 if (!special_map)
306 return; 299 break;
307 300
301 int ix, iy; /* map insertion locatons */
302
308 if (find_spot_for_submap (map, layout, &ix, &iy, special_map->width, special_map->height)) 303 if (find_spot_for_submap (map, layout, &ix, &iy, special_map->width, special_map->height))
304 {
305 /* First, splatter everything in the dest map at the location */
306 nuke_map_region (map, layout, ix, iy, special_map->width, special_map->height);
309 include_map_in_map (map, special_map, ix, iy); 307 include_map_in_map (map, special_map, ix, iy);
308 }
309 }
310 310
311 break; 311 break;
312 312
313 case SPECIAL_FOUNTAIN: 313 case SPECIAL_FOUNTAIN:
314 /* Make a special fountain: an unpickable potion disguised as 314 /* Make a special fountain: an unpickable potion disguised as

Diff Legend

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