1 | /* |
|
|
2 | * static char *rcsid_door_c = |
|
|
3 | * "$Id: door.C,v 1.2 2006/08/29 08:01:36 root Exp $"; |
|
|
4 | */ |
|
|
5 | |
|
|
6 | /* |
1 | /* |
7 | CrossFire, A Multiplayer game for X-windows |
2 | CrossFire, A Multiplayer game for X-windows |
8 | |
3 | |
9 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
10 | Copyright (C) 1992 Frank Tore Johansen |
5 | Copyright (C) 1992 Frank Tore Johansen |
… | |
… | |
21 | |
16 | |
22 | You should have received a copy of the GNU General Public License |
17 | You should have received a copy of the GNU General Public License |
23 | along with this program; if not, write to the Free Software |
18 | along with this program; if not, write to the Free Software |
24 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
25 | |
20 | |
26 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
27 | */ |
22 | */ |
28 | |
23 | |
29 | #include <global.h> |
24 | #include <global.h> |
30 | #include <random_map.h> |
25 | #include <random_map.h> |
31 | #include <rproto.h> |
26 | #include <rproto.h> |
32 | |
27 | |
33 | /* where are there adjacent doors or walls? */ |
28 | /* where are there adjacent doors or walls? */ |
|
|
29 | int |
34 | int surround_check2(char **layout,int i,int j,int Xsize, int Ysize){ |
30 | surround_check2 (char **layout, int i, int j, int Xsize, int Ysize) |
|
|
31 | { |
35 | /* 1 = door or wall to left, |
32 | /* 1 = door or wall to left, |
36 | 2 = door or wall to right, |
33 | 2 = door or wall to right, |
37 | 4 = door or wall above |
34 | 4 = door or wall above |
38 | 8 = door or wall below */ |
35 | 8 = door or wall below */ |
39 | int surround_index = 0; |
36 | int surround_index = 0; |
|
|
37 | |
40 | if((i > 0) && (layout[i-1][j]=='D'||layout[i-1][j]=='#')) surround_index +=1; |
38 | if ((i > 0) && (layout[i - 1][j] == 'D' || layout[i - 1][j] == '#')) |
|
|
39 | surround_index += 1; |
41 | if((i < Xsize-1) && (layout[i+1][j]=='D'||layout[i+1][j]=='#')) surround_index +=2; |
40 | if ((i < Xsize - 1) && (layout[i + 1][j] == 'D' || layout[i + 1][j] == '#')) |
|
|
41 | surround_index += 2; |
42 | if((j > 0) && (layout[i][j-1]=='D'||layout[i][j-1]=='#')) surround_index +=4; |
42 | if ((j > 0) && (layout[i][j - 1] == 'D' || layout[i][j - 1] == '#')) |
|
|
43 | surround_index += 4; |
43 | if((j < Ysize-1) && (layout[i][j+1]=='D'&&layout[i][j+1]=='#')) surround_index +=8; |
44 | if ((j < Ysize - 1) && (layout[i][j + 1] == 'D' && layout[i][j + 1] == '#')) |
|
|
45 | surround_index += 8; |
44 | return surround_index; |
46 | return surround_index; |
45 | } |
47 | } |
46 | |
48 | |
|
|
49 | void |
47 | void put_doors(mapstruct *the_map, char **maze, const char *doorstyle, RMParms *RP) { |
50 | put_doors (maptile *the_map, char **maze, const char *doorstyle, RMParms * RP) |
48 | int i,j; |
51 | { |
49 | mapstruct *vdoors; |
52 | int i, j; |
50 | mapstruct *hdoors; |
53 | maptile *vdoors; |
|
|
54 | maptile *hdoors; |
51 | char doorpath[128]; |
55 | char doorpath[128]; |
52 | |
56 | |
53 | if(!strcmp(doorstyle,"none")) return; |
57 | if (!strcmp (doorstyle, "none")) |
|
|
58 | return; |
54 | vdoors=find_style("/styles/doorstyles", doorstyle, -1); |
59 | vdoors = find_style ("/styles/doorstyles", doorstyle, -1); |
55 | if(vdoors) |
60 | if (vdoors) |
56 | hdoors=vdoors; |
61 | hdoors = vdoors; |
57 | else{ |
62 | else |
|
|
63 | { |
58 | vdoors = find_style("/styles/doorstyles/vdoors", doorstyle, -1); |
64 | vdoors = find_style ("/styles/doorstyles/vdoors", doorstyle, -1); |
59 | if(!vdoors) return; |
65 | if (!vdoors) |
|
|
66 | return; |
60 | sprintf(doorpath,"/styles/doorstyles/hdoors%s", strrchr(vdoors->path, '/')); |
67 | sprintf (doorpath, "/styles/doorstyles/hdoors%s", strrchr (vdoors->path, '/')); |
61 | hdoors = find_style(doorpath, 0, -1); |
68 | hdoors = find_style (doorpath, 0, -1); |
|
|
69 | } |
|
|
70 | for (i = 0; i < RP->Xsize; i++) |
|
|
71 | for (j = 0; j < RP->Ysize; j++) |
|
|
72 | { |
|
|
73 | if (maze[i][j] == 'D') |
|
|
74 | { |
|
|
75 | int sindex; |
|
|
76 | object *this_door, *new_door; |
|
|
77 | |
|
|
78 | sindex = surround_check2 (maze, i, j, RP->Xsize, RP->Ysize); |
|
|
79 | if (sindex == 3) |
|
|
80 | this_door = pick_random_object (hdoors); |
|
|
81 | else |
|
|
82 | this_door = pick_random_object (vdoors); |
|
|
83 | new_door = arch_to_object (this_door->arch); |
|
|
84 | this_door->copy_to (new_door); |
|
|
85 | new_door->x = i; |
|
|
86 | new_door->y = j; |
|
|
87 | insert_ob_in_map (new_door, the_map, NULL, 0); |
62 | } |
88 | } |
63 | for(i=0; i<RP->Xsize; i++) |
89 | } |
64 | for(j=0; j<RP->Ysize; j++) { |
|
|
65 | if(maze[i][j]=='D') { |
|
|
66 | int sindex; |
|
|
67 | object *this_door, *new_door; |
|
|
68 | sindex = surround_check2(maze, i, j, RP->Xsize, RP->Ysize); |
|
|
69 | if(sindex==3) |
|
|
70 | this_door=pick_random_object(hdoors); |
|
|
71 | else |
|
|
72 | this_door=pick_random_object(vdoors); |
|
|
73 | new_door = arch_to_object(this_door->arch); |
|
|
74 | copy_object(this_door, new_door); |
|
|
75 | new_door->x = i; |
|
|
76 | new_door->y = j; |
|
|
77 | insert_ob_in_map(new_door, the_map, NULL, 0); |
|
|
78 | } |
|
|
79 | } |
|
|
80 | } |
90 | } |