| 1 |
root |
1.1 |
/* |
| 2 |
|
|
* static char *rcsid_door_c = |
| 3 |
elmex |
1.2 |
* "$Id$"; |
| 4 |
root |
1.1 |
*/ |
| 5 |
|
|
|
| 6 |
|
|
/* |
| 7 |
|
|
CrossFire, A Multiplayer game for X-windows |
| 8 |
|
|
|
| 9 |
|
|
Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
| 10 |
|
|
Copyright (C) 1992 Frank Tore Johansen |
| 11 |
|
|
|
| 12 |
|
|
This program is free software; you can redistribute it and/or modify |
| 13 |
|
|
it under the terms of the GNU General Public License as published by |
| 14 |
|
|
the Free Software Foundation; either version 2 of the License, or |
| 15 |
|
|
(at your option) any later version. |
| 16 |
|
|
|
| 17 |
|
|
This program is distributed in the hope that it will be useful, |
| 18 |
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 19 |
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 20 |
|
|
GNU General Public License for more details. |
| 21 |
|
|
|
| 22 |
|
|
You should have received a copy of the GNU General Public License |
| 23 |
|
|
along with this program; if not, write to the Free Software |
| 24 |
|
|
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
| 25 |
|
|
|
| 26 |
|
|
The authors can be reached via e-mail at crossfire-devel@real-time.com |
| 27 |
|
|
*/ |
| 28 |
|
|
|
| 29 |
|
|
#include <global.h> |
| 30 |
|
|
#include <random_map.h> |
| 31 |
|
|
#include <rproto.h> |
| 32 |
|
|
|
| 33 |
|
|
/* where are there adjacent doors or walls? */ |
| 34 |
|
|
int surround_check2(char **layout,int i,int j,int Xsize, int Ysize){ |
| 35 |
|
|
/* 1 = door or wall to left, |
| 36 |
|
|
2 = door or wall to right, |
| 37 |
|
|
4 = door or wall above |
| 38 |
|
|
8 = door or wall below */ |
| 39 |
|
|
int surround_index = 0; |
| 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; |
| 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; |
| 44 |
|
|
return surround_index; |
| 45 |
|
|
} |
| 46 |
|
|
|
| 47 |
|
|
void put_doors(mapstruct *the_map, char **maze, char *doorstyle, RMParms *RP) { |
| 48 |
|
|
int i,j; |
| 49 |
|
|
mapstruct *vdoors; |
| 50 |
|
|
mapstruct *hdoors; |
| 51 |
|
|
char doorpath[128]; |
| 52 |
|
|
|
| 53 |
|
|
if(!strcmp(doorstyle,"none")) return; |
| 54 |
|
|
vdoors=find_style("/styles/doorstyles", doorstyle, -1); |
| 55 |
|
|
if(vdoors) |
| 56 |
|
|
hdoors=vdoors; |
| 57 |
|
|
else{ |
| 58 |
|
|
vdoors = find_style("/styles/doorstyles/vdoors", doorstyle, -1); |
| 59 |
|
|
if(!vdoors) return; |
| 60 |
|
|
sprintf(doorpath,"/styles/doorstyles/hdoors%s", strrchr(vdoors->path, '/')); |
| 61 |
|
|
hdoors = find_style(doorpath, 0, -1); |
| 62 |
|
|
} |
| 63 |
|
|
for(i=0; i<RP->Xsize; i++) |
| 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 |
|
|
} |
