ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/random_maps/wall.C
(Generate patch)

Comparing deliantra/server/random_maps/wall.C (file contents):
Revision 1.3 by root, Sun Sep 3 00:18:42 2006 UTC vs.
Revision 1.49 by root, Mon Oct 29 23:55:54 2012 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines