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,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001 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 | #include <global.h> |
25 | #include <global.h> |
… | |
… | |
26 | #include <sproto.h> |
27 | #include <sproto.h> |
27 | #include <rproto.h> |
28 | #include <rproto.h> |
28 | |
29 | |
29 | /* find a character in the layout. fx and fy are pointers to |
30 | /* find a character in the layout. fx and fy are pointers to |
30 | where to find the char. fx,fy = -1 if not found. */ |
31 | where to find the char. fx,fy = -1 if not found. */ |
31 | void |
32 | static void |
32 | find_in_layout (int mode, char target, int *fx, int *fy, char **layout, random_map_params *RP) |
33 | find_in_layout (int mode, char target, int *fx, int *fy, char **layout, random_map_params *RP) |
33 | { |
34 | { |
34 | int M; |
35 | int M; |
35 | int i, j; |
36 | int i, j; |
36 | |
37 | |
… | |
… | |
114 | 4 means leftward |
115 | 4 means leftward |
115 | 5 means northward |
116 | 5 means northward |
116 | 6 means southward |
117 | 6 means southward |
117 | */ |
118 | */ |
118 | void |
119 | void |
119 | place_exits (maptile *map, char **maze, char *exitstyle, int orientation, random_map_params *RP) |
120 | place_exits (maptile *map, char **maze, const char *exitstyle, int orientation, random_map_params *RP) |
120 | { |
121 | { |
121 | char styledirname[1024]; |
|
|
122 | maptile *style_map_down = 0; /* harder maze */ |
122 | maptile *style_map_down = 0; /* harder maze */ |
123 | maptile *style_map_up = 0; /* easier maze */ |
123 | maptile *style_map_up = 0; /* easier maze */ |
124 | object *the_exit_down; /* harder maze */ |
124 | object *the_exit_down; /* harder maze */ |
125 | object *the_exit_up; /* easier maze */ |
125 | object *the_exit_up; /* easier maze */ |
126 | int cx = -1, cy = -1; /* location of a map center */ |
126 | int cx = -1, cy = -1; /* location of a map center */ |
… | |
… | |
137 | |
137 | |
138 | switch (orientation) |
138 | switch (orientation) |
139 | { |
139 | { |
140 | case 1: |
140 | case 1: |
141 | { |
141 | { |
142 | sprintf (styledirname, "/styles/exitstyles/up"); |
|
|
143 | style_map_up = find_style (styledirname, exitstyle, -1); |
142 | style_map_up = find_style ("/styles/exitstyles/up" , exitstyle, RP->difficulty); |
144 | sprintf (styledirname, "/styles/exitstyles/down"); |
|
|
145 | style_map_down = find_style (styledirname, exitstyle, -1); |
143 | style_map_down = find_style ("/styles/exitstyles/down", exitstyle, RP->difficulty); |
146 | break; |
144 | break; |
147 | } |
145 | } |
148 | |
146 | |
149 | case 2: |
147 | case 2: |
150 | { |
148 | { |
151 | sprintf (styledirname, "/styles/exitstyles/down"); |
|
|
152 | style_map_up = find_style (styledirname, exitstyle, -1); |
149 | style_map_up = find_style ("/styles/exitstyles/down", exitstyle, RP->difficulty); |
153 | sprintf (styledirname, "/styles/exitstyles/up"); |
|
|
154 | style_map_down = find_style (styledirname, exitstyle, -1); |
150 | style_map_down = find_style ("/styles/exitstyles/up" , exitstyle, RP->difficulty); |
155 | break; |
151 | break; |
156 | } |
152 | } |
157 | |
153 | |
158 | default: |
154 | default: |
159 | { |
155 | { |
160 | sprintf (styledirname, "/styles/exitstyles/generic"); |
156 | style_map_up = |
161 | style_map_up = find_style (styledirname, exitstyle, -1); |
157 | style_map_down = find_style ("/styles/exitstyles/generic", exitstyle, RP->difficulty); |
162 | style_map_down = style_map_up; |
|
|
163 | break; |
158 | break; |
164 | } |
159 | } |
165 | } |
160 | } |
166 | |
161 | |
167 | the_exit_up = style_map_up |
162 | the_exit_up = style_map_up |
… | |
… | |
281 | if (downx == -1) |
276 | if (downx == -1) |
282 | find_in_layout (0, 0, &downx, &downy, maze, RP); |
277 | find_in_layout (0, 0, &downx, &downy, maze, RP); |
283 | |
278 | |
284 | if (the_exit_down) |
279 | if (the_exit_down) |
285 | { |
280 | { |
286 | char buf[16384]; |
|
|
287 | |
|
|
288 | int i = find_free_spot (the_exit_down, map, downx, downy, 1, SIZEOFFREE1 + 1); |
281 | int i = rmg_find_free_spot (the_exit_down, map, downx, downy, 1, SIZEOFFREE1 + 1); |
289 | the_exit_down->x = downx + freearr_x[i]; |
282 | the_exit_down->x = downx + freearr_x[i]; |
290 | the_exit_down->y = downy + freearr_y[i]; |
283 | the_exit_down->y = downy + freearr_y[i]; |
291 | RP->origin_x = the_exit_down->x; |
284 | RP->origin_x = the_exit_down->x; |
292 | RP->origin_y = the_exit_down->y; |
285 | RP->origin_y = the_exit_down->y; |
293 | write_map_parameters_to_string (buf, RP); |
286 | |
294 | the_exit_down->msg = buf; |
287 | the_exit_down->msg = RP->as_shstr (); |
295 | |
288 | |
296 | /* the identifier for making a random map. */ |
289 | /* the identifier for making a random map. */ |
297 | if (RP->dungeon_level >= RP->dungeon_depth && *RP->final_map) |
290 | if (RP->dungeon_level >= RP->dungeon_depth && *RP->final_map) |
298 | { |
291 | { |
299 | maptile *new_map; |
292 | maptile *new_map; |
300 | object *the_exit_back = arch_to_object (the_exit_up->arch); |
293 | object *the_exit_back = the_exit_up->arch->instance (); |
301 | |
294 | |
302 | /* load it */ |
295 | /* load it */ |
303 | if (!(new_map = maptile::find_sync (RP->final_map))) |
296 | if (!(new_map = maptile::find_sync (RP->final_map))) |
304 | return; |
297 | return; |
305 | |
298 | |
… | |
… | |
311 | /* Remove exit back to previous random map. There should only be one |
304 | /* Remove exit back to previous random map. There should only be one |
312 | * which is why we break out. To try to process more than one |
305 | * which is why we break out. To try to process more than one |
313 | * would require keeping a 'next' pointer, ad free_object kills tmp, which |
306 | * would require keeping a 'next' pointer, ad free_object kills tmp, which |
314 | * breaks the for loop. |
307 | * breaks the for loop. |
315 | */ |
308 | */ |
316 | if (tmp->type == EXIT && EXIT_PATH (tmp) && !strncmp (EXIT_PATH (tmp), "?random/", 8)) |
309 | if (tmp->type == EXIT && EXIT_PATH (tmp).starts_with ("?random/")) |
317 | { |
310 | { |
318 | tmp->destroy (true); |
311 | tmp->destroy (); |
319 | break; |
312 | break; |
320 | } |
313 | } |
321 | |
314 | |
322 | if (final_map_exit == 1) |
315 | if (final_map_exit == 1) |
323 | { |
316 | { |
… | |
… | |
330 | |
323 | |
331 | insert_ob_in_map (the_exit_back, new_map, NULL, 0); |
324 | insert_ob_in_map (the_exit_back, new_map, NULL, 0); |
332 | } |
325 | } |
333 | } |
326 | } |
334 | else |
327 | else |
335 | the_exit_down->slaying = "/!"; |
328 | the_exit_down->slaying = shstr_random_map_exit; |
336 | |
329 | |
337 | /* Block the exit so things don't get dumped on top of it. */ |
330 | /* Block the exit so things don't get dumped on top of it. */ |
338 | the_exit_down->move_block = MOVE_ALL; |
331 | the_exit_down->move_block = MOVE_ALL; |
339 | insert_ob_in_map (the_exit_down, map, NULL, 0); |
332 | insert_ob_in_map (the_exit_down, map, NULL, 0); |
340 | maze[the_exit_down->x][the_exit_down->y] = '>'; |
333 | maze[the_exit_down->x][the_exit_down->y] = '>'; |