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