1 | /* |
1 | /* |
2 | * static char *rcsid_door_c = |
2 | * static char *rcsid_door_c = |
3 | * "$Id: door.C,v 1.1 2006/08/13 17:16:03 elmex Exp $"; |
3 | * "$Id: door.C,v 1.2 2006/08/29 08:01:36 root Exp $"; |
4 | */ |
4 | */ |
5 | |
5 | |
6 | /* |
6 | /* |
7 | CrossFire, A Multiplayer game for X-windows |
7 | CrossFire, A Multiplayer game for X-windows |
8 | |
8 | |
… | |
… | |
31 | #include <rproto.h> |
31 | #include <rproto.h> |
32 | |
32 | |
33 | /* where are there adjacent doors or walls? */ |
33 | /* where are there adjacent doors or walls? */ |
34 | int surround_check2(char **layout,int i,int j,int Xsize, int Ysize){ |
34 | int surround_check2(char **layout,int i,int j,int Xsize, int Ysize){ |
35 | /* 1 = door or wall to left, |
35 | /* 1 = door or wall to left, |
36 | 2 = door or wall to right, |
36 | 2 = door or wall to right, |
37 | 4 = door or wall above |
37 | 4 = door or wall above |
38 | 8 = door or wall below */ |
38 | 8 = door or wall below */ |
39 | int surround_index = 0; |
39 | int surround_index = 0; |
40 | if((i > 0) && (layout[i-1][j]=='D'||layout[i-1][j]=='#')) surround_index +=1; |
40 | if((i > 0) && (layout[i-1][j]=='D'||layout[i-1][j]=='#')) surround_index +=1; |
41 | if((i < Xsize-1) && (layout[i+1][j]=='D'||layout[i+1][j]=='#')) surround_index +=2; |
41 | if((i < Xsize-1) && (layout[i+1][j]=='D'||layout[i+1][j]=='#')) 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]=='#')) surround_index +=4; |
43 | if((j < Ysize-1) && (layout[i][j+1]=='D'&&layout[i][j+1]=='#')) surround_index +=8; |
43 | if((j < Ysize-1) && (layout[i][j+1]=='D'&&layout[i][j+1]=='#')) surround_index +=8; |
44 | return surround_index; |
44 | return surround_index; |
45 | } |
45 | } |
46 | |
46 | |
47 | void put_doors(mapstruct *the_map, char **maze, const char *doorstyle, RMParms *RP) { |
47 | void put_doors(mapstruct *the_map, char **maze, const char *doorstyle, RMParms *RP) { |
48 | int i,j; |
48 | int i,j; |
49 | mapstruct *vdoors; |
49 | mapstruct *vdoors; |
50 | mapstruct *hdoors; |
50 | mapstruct *hdoors; |
51 | char doorpath[128]; |
51 | char doorpath[128]; |
52 | |
52 | |
53 | if(!strcmp(doorstyle,"none")) return; |
53 | if(!strcmp(doorstyle,"none")) return; |
54 | vdoors=find_style("/styles/doorstyles", doorstyle, -1); |
54 | vdoors=find_style("/styles/doorstyles", doorstyle, -1); |
55 | if(vdoors) |
55 | if(vdoors) |
56 | hdoors=vdoors; |
56 | hdoors=vdoors; |
57 | else{ |
57 | else{ |
58 | vdoors = find_style("/styles/doorstyles/vdoors", doorstyle, -1); |
58 | vdoors = find_style("/styles/doorstyles/vdoors", doorstyle, -1); |
59 | if(!vdoors) return; |
59 | if(!vdoors) return; |
60 | sprintf(doorpath,"/styles/doorstyles/hdoors%s", strrchr(vdoors->path, '/')); |
60 | sprintf(doorpath,"/styles/doorstyles/hdoors%s", strrchr(vdoors->path, '/')); |
61 | hdoors = find_style(doorpath, 0, -1); |
61 | hdoors = find_style(doorpath, 0, -1); |
62 | } |
62 | } |
63 | for(i=0; i<RP->Xsize; i++) |
63 | for(i=0; i<RP->Xsize; i++) |
64 | for(j=0; j<RP->Ysize; j++) { |
64 | for(j=0; j<RP->Ysize; j++) { |
65 | if(maze[i][j]=='D') { |
65 | if(maze[i][j]=='D') { |
66 | int sindex; |
66 | int sindex; |
67 | object *this_door, *new_door; |
67 | object *this_door, *new_door; |
68 | sindex = surround_check2(maze, i, j, RP->Xsize, RP->Ysize); |
68 | sindex = surround_check2(maze, i, j, RP->Xsize, RP->Ysize); |
69 | if(sindex==3) |
69 | if(sindex==3) |
70 | this_door=pick_random_object(hdoors); |
70 | this_door=pick_random_object(hdoors); |
71 | else |
71 | else |
72 | this_door=pick_random_object(vdoors); |
72 | this_door=pick_random_object(vdoors); |
73 | new_door = arch_to_object(this_door->arch); |
73 | new_door = arch_to_object(this_door->arch); |
74 | copy_object(this_door, new_door); |
74 | copy_object(this_door, new_door); |
75 | new_door->x = i; |
75 | new_door->x = i; |
76 | new_door->y = j; |
76 | new_door->y = j; |
77 | insert_ob_in_map(new_door, the_map, NULL, 0); |
77 | insert_ob_in_map(new_door, the_map, NULL, 0); |
78 | } |
78 | } |
79 | } |
79 | } |
80 | } |
80 | } |