1 |
elmex |
1.1 |
/* |
2 |
|
|
CrossFire, A Multiplayer game for X-windows |
3 |
|
|
|
4 |
pippijn |
1.11 |
Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
5 |
elmex |
1.1 |
Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
6 |
|
|
Copyright (C) 1992 Frank Tore Johansen |
7 |
|
|
|
8 |
|
|
This program is free software; you can redistribute it and/or modify |
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 |
11 |
|
|
(at your option) any later version. |
12 |
|
|
|
13 |
|
|
This program is distributed in the hope that it will be useful, |
14 |
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 |
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 |
|
|
GNU General Public License for more details. |
17 |
|
|
|
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 |
20 |
|
|
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
21 |
|
|
|
22 |
root |
1.4 |
The authors can be reached via e-mail at <crossfire@schmorp.de> |
23 |
elmex |
1.1 |
*/ |
24 |
|
|
|
25 |
|
|
#include <global.h> |
26 |
|
|
#include <random_map.h> |
27 |
|
|
#include <rproto.h> |
28 |
|
|
|
29 |
|
|
/* where are there adjacent doors or walls? */ |
30 |
root |
1.3 |
int |
31 |
|
|
surround_check2 (char **layout, int i, int j, int Xsize, int Ysize) |
32 |
|
|
{ |
33 |
elmex |
1.1 |
/* 1 = door or wall to left, |
34 |
root |
1.3 |
2 = door or wall to right, |
35 |
|
|
4 = door or wall above |
36 |
|
|
8 = door or wall below */ |
37 |
elmex |
1.1 |
int surround_index = 0; |
38 |
root |
1.3 |
|
39 |
|
|
if ((i > 0) && (layout[i - 1][j] == 'D' || layout[i - 1][j] == '#')) |
40 |
|
|
surround_index += 1; |
41 |
|
|
if ((i < Xsize - 1) && (layout[i + 1][j] == 'D' || layout[i + 1][j] == '#')) |
42 |
|
|
surround_index += 2; |
43 |
|
|
if ((j > 0) && (layout[i][j - 1] == 'D' || layout[i][j - 1] == '#')) |
44 |
|
|
surround_index += 4; |
45 |
|
|
if ((j < Ysize - 1) && (layout[i][j + 1] == 'D' && layout[i][j + 1] == '#')) |
46 |
|
|
surround_index += 8; |
47 |
elmex |
1.1 |
return surround_index; |
48 |
|
|
} |
49 |
|
|
|
50 |
root |
1.3 |
void |
51 |
root |
1.9 |
put_doors (maptile *the_map, char **maze, const char *doorstyle, random_map_params *RP) |
52 |
root |
1.3 |
{ |
53 |
|
|
int i, j; |
54 |
root |
1.5 |
maptile *vdoors; |
55 |
|
|
maptile *hdoors; |
56 |
root |
1.10 |
char doorpath[1024]; |
57 |
root |
1.3 |
|
58 |
|
|
if (!strcmp (doorstyle, "none")) |
59 |
|
|
return; |
60 |
root |
1.8 |
|
61 |
root |
1.3 |
vdoors = find_style ("/styles/doorstyles", doorstyle, -1); |
62 |
root |
1.8 |
|
63 |
root |
1.3 |
if (vdoors) |
64 |
|
|
hdoors = vdoors; |
65 |
|
|
else |
66 |
|
|
{ |
67 |
|
|
vdoors = find_style ("/styles/doorstyles/vdoors", doorstyle, -1); |
68 |
|
|
if (!vdoors) |
69 |
|
|
return; |
70 |
|
|
sprintf (doorpath, "/styles/doorstyles/hdoors%s", strrchr (vdoors->path, '/')); |
71 |
|
|
hdoors = find_style (doorpath, 0, -1); |
72 |
|
|
} |
73 |
root |
1.8 |
|
74 |
root |
1.3 |
for (i = 0; i < RP->Xsize; i++) |
75 |
|
|
for (j = 0; j < RP->Ysize; j++) |
76 |
|
|
{ |
77 |
|
|
if (maze[i][j] == 'D') |
78 |
|
|
{ |
79 |
|
|
int sindex; |
80 |
|
|
object *this_door, *new_door; |
81 |
|
|
|
82 |
|
|
sindex = surround_check2 (maze, i, j, RP->Xsize, RP->Ysize); |
83 |
|
|
if (sindex == 3) |
84 |
|
|
this_door = pick_random_object (hdoors); |
85 |
|
|
else |
86 |
|
|
this_door = pick_random_object (vdoors); |
87 |
root |
1.8 |
|
88 |
|
|
if (!this_door) |
89 |
|
|
abort (); |
90 |
|
|
|
91 |
root |
1.3 |
new_door = arch_to_object (this_door->arch); |
92 |
root |
1.6 |
this_door->copy_to (new_door); |
93 |
root |
1.3 |
new_door->x = i; |
94 |
|
|
new_door->y = j; |
95 |
|
|
insert_ob_in_map (new_door, the_map, NULL, 0); |
96 |
|
|
} |
97 |
|
|
} |
98 |
elmex |
1.1 |
} |