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.12 by root, Sun Dec 31 19:02:24 2006 UTC vs.
Revision 1.35 by root, Mon Sep 29 10:32:50 2008 UTC

1
2/* 1/*
3 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
4 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 7 *
8 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 (at your option) any later version. 11 * (at your 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 GNU General Public License
19 along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 *
21 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 The authors can be reached via e-mail at <crossfire@schmorp.de>
23*/ 22 */
24 23
25/* Specials in this file: 24/* Specials in this file:
26 included maps */ 25 included maps */
27 26
28#include <global.h> 27#include <global.h>
… …
38#define GLORY_HOLE 1 37#define GLORY_HOLE 1
39#define ORC_ZONE 2 38#define ORC_ZONE 2
40#define MINING_ZONE 3 39#define MINING_ZONE 3
41#define NR_OF_HOLE_TYPES 3 40#define NR_OF_HOLE_TYPES 3
42 41
43/* 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
44is cleared with the top left corner at xstart, ystart */ 44 * is cleared with the top left corner at xstart, ystart
45 45 */
46void 46static void
47nuke_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)
48{ 48{
49 int i, j;
50 object *tmp;
51
52 for (i = xstart; i < xstart + xsize; i++) 49 for (int i = xstart; i < xstart + xsize; i++)
53 for (j = ystart; j < ystart + ysize; j++) 50 for (int j = ystart; j < ystart + ysize; j++)
54 { 51 {
55 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;
56 { 57 else
57 if (!QUERY_FLAG (tmp, FLAG_IS_FLOOR))
58 { 58 {
59 if (tmp->head) 59 object *head = tmp->head_ ();
60 tmp = tmp->head; 60 tmp = tmp->above;
61 tmp->remove ();
62 tmp->destroy (); 61 head->destroy ();
63 tmp = GET_MAP_OB (map, i, j);
64 } 62 }
65 if (tmp == NULL)
66 break;
67 }
68 } 63 }
69} 64}
70 65
71
72
73/* copy in_map into dest_map at point x,y */ 66/* copy in_map into dest_map at point x,y */
74 67static void
75
76void
77include_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)
78{ 69{
79 int i, j;
80 object *tmp;
81 object *new_ob;
82
83 /* First, splatter everything in the dest map at the location */
84 nuke_map_region (dest_map, x, y, in_map->width, in_map->height);
85
86 for (i = 0; i < in_map->width; i++) 70 for (int i = 0; i < in_map->width; i++)
87 for (j = 0; j < in_map->height; j++) 71 for (int j = 0; j < in_map->height; j++)
88 {
89 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)
90 { 73 {
91 /* don't copy things with multiple squares: must be dealt with 74 /* don't copy tails: must be dealt with specially. */
92 specially. */
93 if (tmp->head != NULL) 75 if (!tmp->is_head ())
94 continue; 76 continue;
95 new_ob = arch_to_object (tmp->arch); 77
96 copy_object_with_inv (tmp, new_ob); 78 object *new_ob = tmp->deep_clone ();
79
97 if (QUERY_FLAG (tmp, FLAG_IS_LINKED)) 80 if (QUERY_FLAG (tmp, FLAG_IS_LINKED))
98 add_button_link (new_ob, dest_map, tmp->path_attuned); 81 add_button_link (new_ob, dest_map, tmp->path_attuned);
99 new_ob->x = i + x; 82
100 new_ob->y = j + y; 83 dest_map->insert (new_ob, x + i, y + j, 0, INS_NO_MERGE | INS_NO_WALK_ON);
101 insert_multisquare_ob_in_map (new_ob, dest_map);
102 } 84 }
103 }
104} 85}
105 86
106int 87static int
107find_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)
108{ 89{
109 int tries; 90 int blocked, i, j;
110 int i = 0, j = 0; /* initialization may not be needed but prevents compiler warnings */
111 int is_occupied = 0;
112 int l, m;
113 91
114 /* 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
115 sufficiently large. */ 93 sufficiently large. */
116 if (2 * xsize > map->width || 2 * ysize > map->height) 94 if (2 * xsize > map->width || 2 * ysize > map->height)
117 return 0; 95 return 0;
118 96
119 /* search a bit for a completely free spot. */ 97 /* search a bit for a completely free spot. */
120 for (tries = 0; tries < 20; tries++) 98 for (int tries = 0; tries < 20; tries++)
121 { 99 {
100 blocked = 0;
101
122 /* pick a random location in the layout */ 102 /* pick a random location in the layout */
123 i = RANDOM () % (map->width - xsize - 2) + 1; 103 i = rmg_rndm (1, map->width - xsize - 2);
124 j = RANDOM () % (map->height - ysize - 2) + 1; 104 j = rmg_rndm (1, map->height - ysize - 2);
125 is_occupied = 0; 105
126 for (l = i; l < i + xsize; l++) 106 for (int l = i; l < i + xsize; l++)
127 for (m = j; m < j + ysize; m++) 107 for (int m = j; m < j + ysize; m++)
128 is_occupied |= layout[l][m]; 108 {
129 if (!is_occupied) 109 blocked = 1;
130 break; 110 break;
131 } 111 }
132 112
113 if (!blocked)
114 break;
115 }
133 116
134 /* if we failed, relax the restrictions */ 117 /* if we failed, relax the restrictions */
135 118 if (blocked)
136 if (is_occupied)
137 { /* failure, try a relaxed placer. */ 119 { /* failure, try a relaxed placer. */
138 /* pick a random location in the layout */ 120 /* pick a random location in the layout */
139 for (tries = 0; tries < 10; tries++) 121 for (int tries = 0; tries < 10; tries++)
140 { 122 {
141 i = RANDOM () % (map->width - xsize - 2) + 1; 123 i = rmg_rndm (1, map->width - xsize - 2);
142 j = RANDOM () % (map->height - ysize - 2) + 1; 124 j = rmg_rndm (1, map->height - ysize - 2);
125
143 is_occupied = 0; 126 blocked = 0;
127
144 for (l = i; l < i + xsize; l++) 128 for (int l = i; l < i + xsize; l++)
145 for (m = j; m < j + ysize; m++) 129 for (int m = j; m < j + ysize; m++)
146 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 {
147 is_occupied |= 1; 132 blocked = 1;
133 break;
134 }
148 } 135 }
149 } 136 }
150 if (is_occupied) 137
138 if (blocked)
151 return 0; 139 return 0;
140
152 *ix = i; 141 *ix = i;
153 *iy = j; 142 *iy = j;
143
154 return 1; 144 return 1;
155} 145}
156 146
157 147static void
158void
159place_fountain_with_specials (maptile *map) 148place_fountain_with_specials (maptile *map)
160{ 149{
161 int ix, iy, i = -1, tries = 0; 150 int ix, iy, i = -1, tries = 0;
162 maptile *fountain_style = find_style ("/styles/misc", "fountains", -1); 151 maptile *fountain_style = find_style ("/styles/misc", "fountains", -1);
152
153 if (!fountain_style)
154 {
155 LOG (llevError, "unable to load stylemap /styles/misc fountains\n");
156 return;
157 }
158
163 object *fountain = get_archetype ("fountain"); 159 object *fountain = archetype::get (shstr_fountain);
164 object *potion = object::create (); 160 object *potion = fountain_style->pick_random_object (rmg_rndm)->clone ();
165
166 pick_random_object (fountain_style)->copy_to (potion);
167 161
168 while (i < 0 && tries < 10) 162 while (i < 0 && tries < 10)
169 { 163 {
170 ix = RANDOM () % (map->width - 2) + 1; 164 ix = rmg_rndm (map->width - 2) + 1;
171 iy = RANDOM () % (map->height - 2) + 1; 165 iy = rmg_rndm (map->height - 2) + 1;
172 i = find_first_free_spot (fountain, map, ix, iy); 166 i = find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1);
173 tries++; 167 tries++;
174 } 168 }
175 169
176 if (i == -1) 170 if (i == -1)
177 { /* can't place fountain */ 171 { /* can't place fountain */
… …
186 SET_FLAG (potion, FLAG_NO_PICK); 180 SET_FLAG (potion, FLAG_NO_PICK);
187 SET_FLAG (potion, FLAG_IDENTIFIED); 181 SET_FLAG (potion, FLAG_IDENTIFIED);
188 potion->name = potion->name_pl = "fountain"; 182 potion->name = potion->name_pl = "fountain";
189 potion->x = ix; 183 potion->x = ix;
190 potion->y = iy; 184 potion->y = iy;
191 potion->material = M_ADAMANT; 185 potion->materialname = "adamantium";
192 fountain->x = ix; 186 fountain->x = ix;
193 fountain->y = iy; 187 fountain->y = iy;
194 insert_ob_in_map (fountain, map, NULL, 0); 188 insert_ob_in_map (fountain, map, NULL, 0);
195 insert_ob_in_map (potion, map, NULL, 0); 189 insert_ob_in_map (potion, map, NULL, 0);
196
197} 190}
198 191
199void 192static void
200place_special_exit (maptile *map, int hole_type, random_map_params *RP) 193place_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[HUGE_BUF], *style, *decor, *mon; 196 char buf[16384];
197 const char *style, *decor, *mon;
204 maptile *exit_style = find_style ("/styles/misc", "obscure_exits", -1); 198 maptile *exit_style = find_style ("/styles/misc", "obscure_exits", -1);
205 int g_xsize, g_ysize; 199 int g_xsize, g_ysize;
206 200
207 object *the_exit = object::create (); 201 if (!exit_style)
202 {
203 LOG (llevError, "unable to load stylemap /styles/misc obscure_exits\n");
204 return;
205 }
208 206
209 if (!exit_style) 207 if (!exit_style)
210 return; 208 return;
211 209
212 pick_random_object (exit_style)->copy_to (the_exit); 210 object *the_exit = exit_style->pick_random_object (rmg_rndm)->clone ();
213 211
214 while (i < 0) 212 // put an upper bound here, just in case
215 { 213 for (int repeat = 8192; --repeat; )
216 ix = RANDOM () % (map->width - 2) + 1;
217 iy = RANDOM () % (map->height - 2) + 1;
218 i = find_first_free_spot (the_exit, map, ix, iy);
219 } 214 {
215 ix = rmg_rndm (1, map->width - 2);
216 iy = rmg_rndm (1, map->height - 2);
220 217
218 i = find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1);
219 if (i >= 0)
220 {
221 ix += freearr_x[i]; 221 ix += freearr_x[i];
222 iy += freearr_y[i]; 222 iy += freearr_y[i];
223 break;
224 }
225 }
226
223 the_exit->x = ix; 227 the_exit->x = ix;
224 the_exit->y = iy; 228 the_exit->y = iy;
225 229
226 if (!hole_type) 230 if (!hole_type)
227 hole_type = RANDOM () % NR_OF_HOLE_TYPES + 1; 231 hole_type = rmg_rndm (NR_OF_HOLE_TYPES) + 1;
228 232
229 switch (hole_type) 233 switch (hole_type)
230 { 234 {
231 case GLORY_HOLE: /* treasures */ 235 case GLORY_HOLE: /* treasures */
232 { 236 {
233 g_xsize = RANDOM () % 3 + 4 + RP->difficulty / 4; 237 g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4;
234 g_ysize = RANDOM () % 3 + 4 + RP->difficulty / 4; 238 g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4;
235 style = "onion"; 239 style = "onion";
236 decor = "wealth2"; 240 decor = "wealth2";
237 mon = "none"; 241 mon = "none";
238 break; 242 break;
239 } 243 }
240 244
241 case ORC_ZONE: /* hole with orcs in it. */ 245 case ORC_ZONE: /* hole with orcs in it. */
242 { 246 {
243 g_xsize = RANDOM () % 3 + 4 + RP->difficulty / 4; 247 g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4;
244 g_ysize = RANDOM () % 3 + 4 + RP->difficulty / 4; 248 g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4;
245 style = "onion"; 249 style = "onion";
246 decor = "wealth2"; 250 decor = "wealth2";
247 mon = "orc"; 251 mon = "orc";
248 break; 252 break;
249 } 253 }
250 254
251 case MINING_ZONE: /* hole with orcs in it. */ 255 case MINING_ZONE: /* hole with orcs in it. */
252 { 256 {
253 g_xsize = RANDOM () % 9 + 4 + RP->difficulty / 4; 257 g_xsize = rmg_rndm (9) + 4 + RP->difficulty / 4;
254 g_ysize = RANDOM () % 9 + 4 + RP->difficulty / 4; 258 g_ysize = rmg_rndm (9) + 4 + RP->difficulty / 4;
255 style = "maze"; 259 style = "maze";
256 decor = "minerals2"; 260 decor = "minerals2";
257 mon = "none"; 261 mon = "none";
258 break; 262 break;
259 } 263 }
… …
265 } 269 }
266 270
267 /* Need to be at least this size, otherwise the load 271 /* Need to be at least this size, otherwise the load
268 * code will generate new size values which are too large. 272 * code will generate new size values which are too large.
269 */ 273 */
270 if (g_xsize < MIN_RANDOM_MAP_SIZE) 274 if (g_xsize < MIN_RANDOM_MAP_SIZE) g_xsize = MIN_RANDOM_MAP_SIZE;
271 g_xsize = MIN_RANDOM_MAP_SIZE; 275 if (g_ysize < MIN_RANDOM_MAP_SIZE) g_ysize = MIN_RANDOM_MAP_SIZE;
272 if (g_ysize < MIN_RANDOM_MAP_SIZE)
273 g_ysize = MIN_RANDOM_MAP_SIZE;
274 276
275 write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon, 277 write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon,
276 "none", style, decor, "none", RP->exitstyle, 0, 0, 0, 278 "none", style, decor, "none", RP->exitstyle, 0, 0, 0,
277 RMOPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level, 279 RMOPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level,
278 RP->difficulty, RP->difficulty, -1, 1, 0, 0, 0, 0, RP->difficulty_increase); 280 RP->difficulty, RP->difficulty, -1, 1, 0, 0, 0, 0, RP->difficulty_increase);
… …
280 the_exit->msg = buf; 282 the_exit->msg = buf;
281 283
282 insert_ob_in_map (the_exit, map, NULL, 0); 284 insert_ob_in_map (the_exit, map, NULL, 0);
283} 285}
284 286
285
286void 287void
287place_specials_in_map (maptile *map, char **layout, random_map_params *RP) 288place_specials_in_map (maptile *map, char **layout, random_map_params *RP)
288{ 289{
289 maptile *special_map; 290 switch (rmg_rndm (NUM_OF_SPECIAL_TYPES))
290 int ix, iy; /* map insertion locatons */
291 int special_type; /* type of special to make */
292
293
294 special_type = RANDOM () % NUM_OF_SPECIAL_TYPES;
295 switch (special_type)
296 { 291 {
297
298 /* includes a special map into the random map being made. */
299 case SPECIAL_SUBMAP: 292 case SPECIAL_SUBMAP:
300 { 293 {
294 /* includes a special map into the random map being made. */
301 special_map = find_style ("/styles/specialmaps", 0, RP->difficulty); 295 maptile *special_map = find_style ("/styles/specialmaps", 0, RP->difficulty);
296
302 if (special_map == NULL) 297 if (!special_map)
303 return; 298 break;
299
300 int ix, iy; /* map insertion locatons */
304 301
305 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);
306 include_map_in_map (map, special_map, ix, iy); 306 include_map_in_map (map, special_map, ix, iy);
307 }
308 }
309
307 break; 310 break;
308 }
309 311
312 case SPECIAL_FOUNTAIN:
310 /* Make a special fountain: an unpickable potion disguised as 313 /* Make a special fountain: an unpickable potion disguised as
311 a fountain, or rather, colocated with a fountain. */ 314 a fountain, or rather, colocated with a fountain. */
312 case SPECIAL_FOUNTAIN:
313 {
314 place_fountain_with_specials (map); 315 place_fountain_with_specials (map);
315 break; 316 break;
316 }
317 317
318 case SPECIAL_EXIT:
318 /* Make an exit to another random map, e.g. a gloryhole. */ 319 /* Make an exit to another random map, e.g. a gloryhole. */
319 case SPECIAL_EXIT:
320 {
321 place_special_exit (map, 0, RP); 320 place_special_exit (map, 0, RP);
322 break; 321 break;
323 }
324 } 322 }
325
326} 323}
324

Diff Legend

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