1 | /* |
1 | /* |
2 | * static char *rcsid_wall_c = |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * "$Id: wall.C,v 1.3 2006/09/03 00:18:42 root Exp $"; |
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
|
|
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
7 | * |
|
|
8 | * Deliantra 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 3 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, see <http://www.gnu.org/licenses/>. |
|
|
20 | * |
|
|
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
4 | */ |
22 | */ |
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 | |
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 | /* Put in the walls and autojoin them. */ |
28 | /* Put in the walls and autojoin them. */ |
34 | |
29 | |
35 | |
|
|
36 | /* given a layout and a coordinate, tell me which squares up/down/right/left |
30 | /* given a layout and a coordinate, tell me which squares up/down/right/left |
37 | are occupied. */ |
31 | are occupied. */ |
38 | |
32 | int |
39 | int surround_flag(char **layout,int i,int j,RMParms *RP){ |
33 | surround_flag (char **layout, int i, int j, random_map_params *RP) |
|
|
34 | { |
40 | /* 1 = wall to left, |
35 | /* 1 = wall to left, |
41 | 2 = wall to right, |
36 | 2 = wall to right, |
42 | 4 = wall above |
37 | 4 = wall above |
43 | 8 = wall below */ |
38 | 8 = wall below */ |
|
|
39 | int surround_index = 0; |
|
|
40 | |
|
|
41 | if ((i > 0) && layout[i - 1][j] != 0) |
44 | int surround_index = 0; |
42 | surround_index |= 1; |
45 | if((i > 0) && layout[i-1][j]!=0) surround_index |=1; |
|
|
46 | if((i < RP->Xsize-1) && layout[i+1][j]!=0) surround_index |=2; |
43 | if ((i < RP->Xsize - 1) && layout[i + 1][j] != 0) |
47 | if((j > 0) && layout[i][j-1]!=0) surround_index |=4; |
44 | surround_index |= 2; |
|
|
45 | if ((j > 0) && layout[i][j - 1] != 0) |
|
|
46 | surround_index |= 4; |
48 | if((j < RP->Ysize-1) && layout[i][j+1]!=0) surround_index |=8; |
47 | if ((j < RP->Ysize - 1) && layout[i][j + 1] != 0) |
|
|
48 | surround_index |= 8; |
49 | return surround_index; |
49 | return surround_index; |
50 | } |
50 | } |
51 | |
51 | |
52 | |
52 | |
53 | /* like surround_flag, but only walls count. |
53 | /* like surround_flag, but only walls count. |
54 | */ |
54 | */ |
55 | |
55 | |
|
|
56 | int |
56 | int surround_flag2(char **layout,int i,int j,RMParms *RP){ |
57 | surround_flag2 (char **layout, int i, int j, random_map_params *RP) |
|
|
58 | { |
57 | /* 1 = wall to left, |
59 | /* 1 = wall to left, |
58 | 2 = wall to right, |
60 | 2 = wall to right, |
59 | 4 = wall above |
61 | 4 = wall above |
60 | 8 = wall below */ |
62 | 8 = wall below */ |
|
|
63 | int surround_index = 0; |
|
|
64 | |
|
|
65 | if ((i > 0) && layout[i - 1][j] == '#') |
61 | int surround_index = 0; |
66 | surround_index |= 1; |
62 | if((i > 0) && layout[i-1][j]=='#') surround_index |=1; |
|
|
63 | if((i < RP->Xsize-1) && layout[i+1][j]=='#') surround_index |=2; |
67 | if ((i < RP->Xsize - 1) && layout[i + 1][j] == '#') |
64 | if((j > 0) && layout[i][j-1]=='#') surround_index |=4; |
68 | surround_index |= 2; |
|
|
69 | if ((j > 0) && layout[i][j - 1] == '#') |
|
|
70 | surround_index |= 4; |
65 | if((j < RP->Ysize-1) && layout[i][j+1]=='#') surround_index |=8; |
71 | if ((j < RP->Ysize - 1) && layout[i][j + 1] == '#') |
|
|
72 | surround_index |= 8; |
66 | return surround_index; |
73 | return surround_index; |
67 | } |
74 | } |
68 | |
75 | |
69 | |
76 | |
70 | /* like surround_flag, except it checks a map, not a layout. |
77 | /* like surround_flag, except it checks a map, not a layout. |
71 | * Since this is part of the random map code, presumption |
78 | * Since this is part of the random map code, presumption |
72 | * is that this is not a tiled map. |
79 | * is that this is not a tiled map. |
73 | * What is considered blocking and not is somewhat hard coded. |
80 | * What is considered blocking and not is somewhat hard coded. |
74 | */ |
81 | */ |
|
|
82 | int |
75 | int surround_flag3(mapstruct *map,sint16 i,sint16 j,RMParms *RP){ |
83 | surround_flag3 (maptile *map, sint16 i, sint16 j, random_map_params *RP) |
|
|
84 | { |
76 | /* |
85 | /* |
77 | * 1 = blocked to left, |
86 | * 1 = blocked to left, |
78 | * 2 = blocked to right, |
87 | * 2 = blocked to right, |
79 | * 4 = blocked above |
88 | * 4 = blocked above |
80 | * 8 = blocked below |
89 | * 8 = blocked below |
81 | */ |
90 | */ |
82 | |
91 | |
83 | int surround_index = 0; |
92 | int surround_index = 0; |
84 | |
93 | |
|
|
94 | // don't forget to update the mapspace! |
|
|
95 | if (i > 0) map->at (i - 1, j ).update (); |
|
|
96 | if (i < RP->Xsize - 1) map->at (i + 1, j ).update (); |
|
|
97 | if (j > 0) map->at (i , j - 1).update (); |
|
|
98 | if (j < RP->Ysize - 1) map->at (i , j + 1).update (); |
|
|
99 | |
85 | if((i > 0) && (GET_MAP_MOVE_BLOCK(map, i-1,j) & ~MOVE_BLOCK_DEFAULT)) |
100 | if ((i > 0) && (GET_MAP_MOVE_BLOCK (map, i - 1, j) & MOVE_WALK)) |
86 | surround_index |=1; |
101 | surround_index |= 1; |
87 | if((i < RP->Xsize-1) && (GET_MAP_MOVE_BLOCK(map, i+1,j) & ~MOVE_BLOCK_DEFAULT)) |
102 | if ((i < RP->Xsize - 1) && (GET_MAP_MOVE_BLOCK (map, i + 1, j) & MOVE_WALK)) |
88 | surround_index |=2; |
103 | surround_index |= 2; |
89 | if((j > 0) && (GET_MAP_MOVE_BLOCK(map, i,j-1) & ~MOVE_BLOCK_DEFAULT)) |
104 | if ((j > 0) && (GET_MAP_MOVE_BLOCK (map, i, j - 1) & MOVE_WALK)) |
90 | surround_index |=4; |
105 | surround_index |= 4; |
91 | if((j < RP->Ysize-1) && (GET_MAP_MOVE_BLOCK(map,i,j+1) & ~MOVE_BLOCK_DEFAULT)) |
106 | if ((j < RP->Ysize - 1) && (GET_MAP_MOVE_BLOCK (map, i, j + 1) & MOVE_WALK)) |
92 | surround_index |=8; |
107 | surround_index |= 8; |
93 | |
108 | |
94 | return surround_index; |
109 | return surround_index; |
95 | } |
110 | } |
96 | |
111 | |
97 | /* like surround_flag2, except it checks a map, not a layout. */ |
112 | /* like surround_flag2, except it checks a map, not a layout. */ |
98 | |
113 | |
99 | int surround_flag4(mapstruct *map,int i,int j,RMParms *RP){ |
114 | int |
|
|
115 | surround_flag4 (maptile *map, int i, int j, random_map_params *RP) |
|
|
116 | { |
100 | /* 1 = blocked to left, |
117 | /* 1 = blocked to left, |
101 | 2 = blocked to right, |
118 | 2 = blocked to right, |
102 | 4 = blocked above |
119 | 4 = blocked above |
103 | 8 = blocked below */ |
120 | 8 = blocked below */ |
|
|
121 | int surround_index = 0; |
|
|
122 | |
|
|
123 | if ((i > 0) && wall_blocked (map, i - 1, j)) |
104 | int surround_index = 0; |
124 | surround_index |= 1; |
105 | |
|
|
106 | if((i > 0) && wall_blocked(map,i-1,j)) surround_index |=1; |
|
|
107 | if((i < RP->Xsize-1) && wall_blocked(map,i+1,j)) surround_index |=2; |
125 | if ((i < RP->Xsize - 1) && wall_blocked (map, i + 1, j)) |
|
|
126 | surround_index |= 2; |
108 | if((j > 0) && wall_blocked(map,i,j-1)) surround_index |=4; |
127 | if ((j > 0) && wall_blocked (map, i, j - 1)) |
|
|
128 | surround_index |= 4; |
109 | if((j < RP->Ysize-1) && wall_blocked(map,i,j+1)) surround_index |=8; |
129 | if ((j < RP->Ysize - 1) && wall_blocked (map, i, j + 1)) |
|
|
130 | surround_index |= 8; |
110 | |
131 | |
111 | return surround_index; |
132 | return surround_index; |
112 | } |
133 | } |
113 | |
134 | |
114 | /* takes a map and a layout, and puts walls in the map (picked from |
135 | /* takes a map and a layout, and puts walls in the map (picked from |
115 | w_style) at '#' marks. */ |
136 | w_style) at '#' marks. */ |
116 | |
137 | |
|
|
138 | void |
117 | void make_map_walls(mapstruct *map,char **layout, char *w_style,RMParms *RP) { |
139 | make_map_walls (maptile *map, char **layout, char *w_style, random_map_params *RP) |
|
|
140 | { |
118 | char styledirname[256]; |
141 | char styledirname[1024]; |
119 | char stylefilepath[256]; |
142 | char stylefilepath[1024]; |
120 | mapstruct *style_map=0; |
143 | maptile *style_map = 0; |
121 | object *the_wall; |
144 | object *the_wall; |
122 | |
145 | |
123 | /* get the style map */ |
146 | /* get the style map */ |
124 | if(!strcmp(w_style,"none")) return; |
147 | if (!strcmp (w_style, "none")) |
|
|
148 | return; |
125 | sprintf(styledirname,"%s","/styles/wallstyles"); |
149 | sprintf (styledirname, "%s", "/styles/wallstyles"); |
126 | sprintf(stylefilepath,"%s/%s",styledirname,w_style); |
150 | sprintf (stylefilepath, "%s/%s", styledirname, w_style); |
127 | style_map = find_style(styledirname,w_style,-1); |
151 | style_map = find_style (styledirname, w_style, -1); |
128 | if(style_map == 0) return; |
152 | if (!style_map) |
|
|
153 | return; |
129 | |
154 | |
130 | /* fill up the map with the given floor style */ |
155 | /* fill up the map with the given floor style */ |
131 | if((the_wall=pick_random_object(style_map))!=NULL) { |
156 | if ((the_wall = style_map->pick_random_object (rmg_rndm))) |
|
|
157 | { |
132 | int i,j; |
158 | int i, j; |
133 | char *cp; |
159 | char *cp; |
134 | int joinedwalls=0; |
160 | int joinedwalls = 0; |
135 | object *thiswall; |
161 | object *thiswall; |
136 | |
162 | |
137 | sprintf(RP->wall_name,"%s", &the_wall->arch->name); |
163 | sprintf (RP->wall_name, "%s", &the_wall->arch->archname); |
138 | if ((cp=strchr(RP->wall_name,'_'))!=NULL) { |
164 | if ((cp = strchr (RP->wall_name, '_')) != NULL) |
|
|
165 | { |
139 | *cp=0; |
166 | *cp = 0; |
140 | joinedwalls=1; |
167 | joinedwalls = 1; |
141 | } |
168 | } |
142 | |
169 | |
143 | for(i=0;i<RP->Xsize;i++) |
170 | for (i = 0; i < RP->Xsize; i++) |
144 | for(j=0;j<RP->Ysize;j++) { |
171 | for (j = 0; j < RP->Ysize; j++) |
|
|
172 | { |
145 | if(layout[i][j]=='#') { |
173 | if (layout[i][j] == '#') |
|
|
174 | { |
146 | if(joinedwalls) |
175 | if (joinedwalls) |
147 | thiswall=pick_joined_wall(the_wall,layout,i,j,RP); |
176 | thiswall = pick_joined_wall (the_wall, layout, i, j, RP); |
148 | else |
177 | else |
149 | thiswall=arch_to_object(the_wall->arch); |
178 | thiswall = arch_to_object (the_wall->arch); |
150 | thiswall->x = i; |
179 | thiswall->x = i; |
151 | thiswall->y = j; |
180 | thiswall->y = j; |
152 | thiswall->move_block = MOVE_ALL; |
181 | thiswall->move_block = MOVE_ALL; |
153 | insert_ob_in_map(thiswall,map,thiswall,INS_NO_MERGE | INS_NO_WALK_ON); |
182 | insert_ob_in_map (thiswall, map, thiswall, INS_NO_MERGE | INS_NO_WALK_ON); |
154 | } |
183 | } |
155 | } |
184 | } |
156 | } |
185 | } |
157 | } |
186 | } |
158 | |
187 | |
159 | |
188 | |
160 | /* picks the right wall type for this square, to make it look nice, |
189 | /* picks the right wall type for this square, to make it look nice, |
161 | and have everything nicely joined. It uses the layout. */ |
190 | and have everything nicely joined. It uses the layout. */ |
162 | |
191 | |
|
|
192 | object * |
163 | object *pick_joined_wall(object *the_wall,char **layout,int i,int j,RMParms *RP) { |
193 | pick_joined_wall (object *the_wall, char **layout, int i, int j, random_map_params *RP) |
|
|
194 | { |
164 | /* 1 = wall to left, |
195 | /* 1 = wall to left, |
165 | 2 = wall to right, |
196 | 2 = wall to right, |
166 | 4 = wall above |
197 | 4 = wall above |
167 | 8 = wall below */ |
198 | 8 = wall below */ |
168 | int surround_index=0; |
199 | int surround_index = 0; |
169 | int l; |
200 | int l; |
170 | char wall_name[64]; |
201 | char wall_name[1024]; |
171 | archetype *wall_arch=0; |
202 | archetype *wall_arch = 0; |
172 | |
203 | |
173 | strcpy(wall_name,the_wall->arch->name); |
204 | assign (wall_name, the_wall->arch->archname); |
174 | |
205 | |
175 | /* conventionally, walls are named like this: |
206 | /* conventionally, walls are named like this: |
176 | wallname_wallcode, where wallcode indicates |
207 | wallname_wallcode, where wallcode indicates |
177 | a joinedness, and wallname is the wall. |
208 | a joinedness, and wallname is the wall. |
178 | this code depends on the convention for |
209 | this code depends on the convention for |
179 | finding the right wall. */ |
210 | finding the right wall. */ |
180 | |
211 | |
181 | /* extract the wall name, which is the text up to the leading _ */ |
212 | /* extract the wall name, which is the text up to the leading _ */ |
182 | for(l=0;l<64;l++) { |
213 | for (l = 0; l < 64; l++) |
|
|
214 | { |
183 | if(wall_name[l]=='_') { |
215 | if (wall_name[l] == '_') |
|
|
216 | { |
184 | wall_name[l] = 0; |
217 | wall_name[l] = 0; |
185 | break; |
|
|
186 | } |
|
|
187 | } |
|
|
188 | |
|
|
189 | surround_index = surround_flag2(layout,i,j,RP); |
|
|
190 | |
|
|
191 | switch(surround_index) { |
|
|
192 | case 0: |
|
|
193 | strcat(wall_name,"_0"); |
|
|
194 | break; |
218 | break; |
195 | case 1: |
219 | } |
|
|
220 | } |
|
|
221 | |
|
|
222 | surround_index = surround_flag2 (layout, i, j, RP); |
|
|
223 | |
|
|
224 | switch (surround_index) |
|
|
225 | { |
|
|
226 | case 0: |
196 | strcat(wall_name,"_1_3"); |
227 | strcat (wall_name, "_0"); |
197 | break; |
228 | break; |
198 | case 2: |
229 | case 1: |
199 | strcat(wall_name,"_1_4"); |
230 | strcat (wall_name, "_1_3"); |
200 | break; |
231 | break; |
201 | case 3: |
232 | case 2: |
202 | strcat(wall_name,"_2_1_2"); |
233 | strcat (wall_name, "_1_4"); |
203 | break; |
234 | break; |
204 | case 4: |
235 | case 3: |
205 | strcat(wall_name,"_1_2"); |
236 | strcat (wall_name, "_2_1_2"); |
206 | break; |
237 | break; |
207 | case 5: |
238 | case 4: |
208 | strcat(wall_name,"_2_2_4"); |
239 | strcat (wall_name, "_1_2"); |
209 | break; |
240 | break; |
210 | case 6: |
241 | case 5: |
211 | strcat(wall_name,"_2_2_1"); |
242 | strcat (wall_name, "_2_2_4"); |
212 | break; |
243 | break; |
213 | case 7: |
244 | case 6: |
214 | strcat(wall_name,"_3_1"); |
245 | strcat (wall_name, "_2_2_1"); |
215 | break; |
246 | break; |
216 | case 8: |
247 | case 7: |
217 | strcat(wall_name,"_1_1"); |
248 | strcat (wall_name, "_3_1"); |
218 | break; |
249 | break; |
219 | case 9: |
250 | case 8: |
220 | strcat(wall_name,"_2_2_3"); |
251 | strcat (wall_name, "_1_1"); |
221 | break; |
252 | break; |
222 | case 10: |
253 | case 9: |
223 | strcat(wall_name,"_2_2_2"); |
254 | strcat (wall_name, "_2_2_3"); |
224 | break; |
255 | break; |
225 | case 11: |
256 | case 10: |
226 | strcat(wall_name,"_3_3"); |
257 | strcat (wall_name, "_2_2_2"); |
227 | break; |
258 | break; |
228 | case 12: |
259 | case 11: |
229 | strcat(wall_name,"_2_1_1"); |
260 | strcat (wall_name, "_3_3"); |
230 | break; |
261 | break; |
231 | case 13: |
262 | case 12: |
232 | strcat(wall_name,"_3_4"); |
263 | strcat (wall_name, "_2_1_1"); |
233 | break; |
264 | break; |
234 | case 14: |
265 | case 13: |
235 | strcat(wall_name,"_3_2"); |
266 | strcat (wall_name, "_3_4"); |
236 | break; |
267 | break; |
237 | case 15: |
268 | case 14: |
238 | strcat(wall_name,"_4"); |
269 | strcat (wall_name, "_3_2"); |
239 | break; |
270 | break; |
|
|
271 | case 15: |
|
|
272 | strcat (wall_name, "_4"); |
|
|
273 | break; |
240 | } |
274 | } |
241 | wall_arch = find_archetype(wall_name); |
275 | wall_arch = archetype::find (wall_name); |
242 | if(wall_arch) return arch_to_object(wall_arch); |
|
|
243 | else { |
|
|
244 | nroferrors--; |
|
|
245 | return arch_to_object(the_wall->arch); |
|
|
246 | } |
|
|
247 | |
276 | |
248 | |
277 | return wall_arch ? arch_to_object (wall_arch) : arch_to_object (the_wall->arch); |
249 | } |
278 | } |
250 | |
279 | |
251 | |
280 | |
252 | /* this takes a map, and changes an existing wall to match what's blocked |
281 | /* this takes a map, and changes an existing wall to match what's blocked |
253 | * around it, counting only doors and walls as blocked. If insert_flag is |
282 | * around it, counting only doors and walls as blocked. If insert_flag is |
254 | * 1, it will go ahead and insert the wall into the map. If not, it |
283 | * 1, it will go ahead and insert the wall into the map. If not, it |
255 | * will only return the wall which would belong there, and doesn't |
284 | * will only return the wall which would belong there, and doesn't |
256 | * remove anything. It depends on the |
285 | * remove anything. It depends on the |
257 | * global, previously-set variable, "wall_name" |
286 | * global, previously-set variable, "wall_name" |
258 | */ |
287 | */ |
259 | |
288 | |
|
|
289 | object * |
260 | object * retrofit_joined_wall(mapstruct *the_map,int i,int j,int insert_flag,RMParms *RP) { |
290 | retrofit_joined_wall (maptile *the_map, int i, int j, int insert_flag, random_map_params *RP) |
|
|
291 | { |
261 | /* 1 = wall to left, |
292 | /* 1 = wall to left, |
262 | * 2 = wall to right, |
293 | * 2 = wall to right, |
263 | * 4 = wall above |
294 | * 4 = wall above |
264 | * 8 = wall below |
295 | * 8 = wall below |
265 | */ |
296 | */ |
266 | int surround_index=0; |
297 | int surround_index = 0; |
267 | int l; |
298 | int l; |
268 | object *the_wall=0; |
299 | object *the_wall = 0; |
269 | object *new_wall=0; |
300 | object *new_wall = 0; |
270 | archetype * wall_arch=0; |
301 | archetype *wall_arch = 0; |
271 | |
302 | |
272 | /* first find the wall */ |
303 | /* first find the wall */ |
273 | for(the_wall = get_map_ob(the_map,i,j);the_wall!=NULL;the_wall=the_wall->above) |
304 | for (the_wall = GET_MAP_OB (the_map, i, j); the_wall != NULL; the_wall = the_wall->above) |
274 | if ((the_wall->move_type & MOVE_WALK) && the_wall->type!=EXIT && the_wall->type!=TELEPORTER) |
305 | if ((the_wall->move_type & MOVE_WALK) && the_wall->type != EXIT && the_wall->type != TELEPORTER) |
275 | break; |
306 | break; |
276 | |
307 | |
277 | |
308 | |
278 | /* if what we found is a door, don't remove it, set the_wall to NULL to |
309 | /* if what we found is a door, don't remove it, set the_wall to NULL to |
279 | * signal that later. |
310 | * signal that later. |
280 | */ |
311 | */ |
281 | if(the_wall && (the_wall->type==DOOR || the_wall->type==LOCKED_DOOR) ) { |
312 | if (the_wall && (the_wall->type == DOOR || the_wall->type == LOCKED_DOOR)) |
|
|
313 | { |
282 | the_wall=NULL; |
314 | the_wall = NULL; |
283 | /* if we're not supposed to insert a new wall where there wasn't one, |
315 | /* if we're not supposed to insert a new wall where there wasn't one, |
284 | * we've gotta leave. |
316 | * we've gotta leave. |
285 | */ |
317 | */ |
286 | if(insert_flag==0) return 0; |
318 | if (insert_flag == 0) |
|
|
319 | return 0; |
287 | } |
320 | } |
288 | else if(the_wall==NULL) return NULL; |
321 | else if (the_wall == NULL) |
|
|
322 | return NULL; |
289 | |
323 | |
290 | /* canonicalize the wall name */ |
324 | /* canonicalize the wall name */ |
291 | for(l=0;l<64;l++) { |
325 | for (l = 0; l < 64; l++) |
|
|
326 | { |
292 | if(RP->wall_name[l]=='_') { |
327 | if (RP->wall_name[l] == '_') |
|
|
328 | { |
293 | RP->wall_name[l] = 0; |
329 | RP->wall_name[l] = 0; |
294 | break; |
330 | break; |
295 | } |
331 | } |
296 | } |
332 | } |
297 | |
333 | |
298 | surround_index = surround_flag4(the_map,i,j,RP); |
334 | surround_index = surround_flag4 (the_map, i, j, RP); |
299 | /* This would be a lot cleaner to just us a lookup table, |
335 | /* This would be a lot cleaner to just us a lookup table, |
300 | * eg, wall_suffix[surround_index] |
336 | * eg, wall_suffix[surround_index] |
301 | */ |
337 | */ |
302 | switch(surround_index) { |
338 | switch (surround_index) |
|
|
339 | { |
303 | case 0: |
340 | case 0: |
304 | strcat(RP->wall_name,"_0"); |
341 | strcat (RP->wall_name, "_0"); |
305 | break; |
342 | break; |
306 | case 1: |
343 | case 1: |
307 | strcat(RP->wall_name,"_1_3"); |
344 | strcat (RP->wall_name, "_1_3"); |
308 | break; |
345 | break; |
309 | case 2: |
346 | case 2: |
310 | strcat(RP->wall_name,"_1_4"); |
347 | strcat (RP->wall_name, "_1_4"); |
311 | break; |
348 | break; |
312 | case 3: |
349 | case 3: |
313 | strcat(RP->wall_name,"_2_1_2"); |
350 | strcat (RP->wall_name, "_2_1_2"); |
314 | break; |
351 | break; |
315 | case 4: |
352 | case 4: |
316 | strcat(RP->wall_name,"_1_2"); |
353 | strcat (RP->wall_name, "_1_2"); |
317 | break; |
354 | break; |
318 | case 5: |
355 | case 5: |
319 | strcat(RP->wall_name,"_2_2_4"); |
356 | strcat (RP->wall_name, "_2_2_4"); |
320 | break; |
357 | break; |
321 | case 6: |
358 | case 6: |
322 | strcat(RP->wall_name,"_2_2_1"); |
359 | strcat (RP->wall_name, "_2_2_1"); |
323 | break; |
360 | break; |
324 | case 7: |
361 | case 7: |
325 | strcat(RP->wall_name,"_3_1"); |
362 | strcat (RP->wall_name, "_3_1"); |
326 | break; |
363 | break; |
327 | case 8: |
364 | case 8: |
328 | strcat(RP->wall_name,"_1_1"); |
365 | strcat (RP->wall_name, "_1_1"); |
329 | break; |
366 | break; |
330 | case 9: |
367 | case 9: |
331 | strcat(RP->wall_name,"_2_2_3"); |
368 | strcat (RP->wall_name, "_2_2_3"); |
332 | break; |
369 | break; |
333 | case 10: |
370 | case 10: |
334 | strcat(RP->wall_name,"_2_2_2"); |
371 | strcat (RP->wall_name, "_2_2_2"); |
335 | break; |
372 | break; |
336 | case 11: |
373 | case 11: |
337 | strcat(RP->wall_name,"_3_3"); |
374 | strcat (RP->wall_name, "_3_3"); |
338 | break; |
375 | break; |
339 | case 12: |
376 | case 12: |
340 | strcat(RP->wall_name,"_2_1_1"); |
377 | strcat (RP->wall_name, "_2_1_1"); |
341 | break; |
378 | break; |
342 | case 13: |
379 | case 13: |
343 | strcat(RP->wall_name,"_3_4"); |
380 | strcat (RP->wall_name, "_3_4"); |
344 | break; |
381 | break; |
345 | case 14: |
382 | case 14: |
346 | strcat(RP->wall_name,"_3_2"); |
383 | strcat (RP->wall_name, "_3_2"); |
347 | break; |
384 | break; |
348 | case 15: |
385 | case 15: |
349 | strcat(RP->wall_name,"_4"); |
386 | strcat (RP->wall_name, "_4"); |
350 | break; |
387 | break; |
351 | } |
388 | } |
|
|
389 | |
352 | wall_arch = find_archetype(RP->wall_name); |
390 | wall_arch = archetype::find (RP->wall_name); |
353 | if(wall_arch!=NULL) { |
391 | |
|
|
392 | if (!wall_arch) |
|
|
393 | { |
354 | new_wall=arch_to_object(wall_arch); |
394 | new_wall = arch_to_object (wall_arch); |
355 | new_wall->x = i; |
395 | new_wall->x = i; |
356 | new_wall->y = j; |
396 | new_wall->y = j; |
|
|
397 | |
357 | if(the_wall && the_wall->map) { |
398 | if (the_wall && the_wall->map) |
358 | remove_ob(the_wall); |
399 | { |
359 | free_object(the_wall); |
400 | the_wall->remove (); |
|
|
401 | the_wall->destroy (); |
360 | } |
402 | } |
|
|
403 | |
361 | the_wall->move_block = MOVE_ALL; |
404 | the_wall->move_block = MOVE_ALL; |
362 | insert_ob_in_map(new_wall,the_map,new_wall,INS_NO_MERGE | INS_NO_WALK_ON); |
405 | insert_ob_in_map (new_wall, the_map, new_wall, INS_NO_MERGE | INS_NO_WALK_ON); |
363 | } |
406 | } |
364 | else |
407 | |
365 | nroferrors--; /* it's OK not to find an arch. */ |
|
|
366 | return new_wall; |
408 | return new_wall; |
367 | } |
409 | } |
368 | |
|
|
369 | |
|
|