… | |
… | |
302 | if (downx == -1) |
302 | if (downx == -1) |
303 | find_in_layout (0, 0, &downx, &downy, maze, RP); |
303 | find_in_layout (0, 0, &downx, &downy, maze, RP); |
304 | |
304 | |
305 | if (the_exit_down) |
305 | if (the_exit_down) |
306 | { |
306 | { |
307 | char buf[8192]; |
307 | char buf[16384]; |
308 | |
308 | |
309 | int i = find_first_free_spot (the_exit_down, map, downx, downy); |
309 | int i = find_first_free_spot (the_exit_down, map, downx, downy); |
310 | the_exit_down->x = downx + freearr_x[i]; |
310 | the_exit_down->x = downx + freearr_x[i]; |
311 | the_exit_down->y = downy + freearr_y[i]; |
311 | the_exit_down->y = downy + freearr_y[i]; |
312 | RP->origin_x = the_exit_down->x; |
312 | RP->origin_x = the_exit_down->x; |