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.10 by root, Wed Dec 20 09:14:22 2006 UTC vs.
Revision 1.31 by root, Fri Nov 6 13:03:34 2009 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
8 it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
9 the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
10 (at your option) any later version. 11 * option) any later version.
11 12 *
12 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
18 along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
20 21 *
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22*/ 23 */
23 24
24#include <global.h> 25#include <global.h>
25#include <random_map.h> 26#include <random_map.h>
26#include <rproto.h> 27#include <rproto.h>
27 28
28/* Put in the walls and autojoin them. */ 29/* Put in the walls and autojoin them. */
29 30
30
31/* given a layout and a coordinate, tell me which squares up/down/right/left 31/* given a layout and a coordinate, tell me which squares up/down/right/left
32 are occupied. */ 32 are occupied. */
33
34int 33int
35surround_flag (char **layout, int i, int j, RMParms * RP) 34surround_flag (char **layout, int i, int j, random_map_params *RP)
36{ 35{
37 /* 1 = wall to left, 36 /* 1 = wall to left,
38 2 = wall to right, 37 2 = wall to right,
39 4 = wall above 38 4 = wall above
40 8 = wall below */ 39 8 = wall below */
… …
54 53
55/* like surround_flag, but only walls count. 54/* like surround_flag, but only walls count.
56 */ 55 */
57 56
58int 57int
59surround_flag2 (char **layout, int i, int j, RMParms * RP) 58surround_flag2 (char **layout, int i, int j, random_map_params *RP)
60{ 59{
61 /* 1 = wall to left, 60 /* 1 = wall to left,
62 2 = wall to right, 61 2 = wall to right,
63 4 = wall above 62 4 = wall above
64 8 = wall below */ 63 8 = wall below */
… …
80 * Since this is part of the random map code, presumption 79 * Since this is part of the random map code, presumption
81 * is that this is not a tiled map. 80 * is that this is not a tiled map.
82 * What is considered blocking and not is somewhat hard coded. 81 * What is considered blocking and not is somewhat hard coded.
83 */ 82 */
84int 83int
85surround_flag3 (maptile *map, sint16 i, sint16 j, RMParms * RP) 84surround_flag3 (maptile *map, sint16 i, sint16 j, random_map_params *RP)
86{ 85{
87 /* 86 /*
88 * 1 = blocked to left, 87 * 1 = blocked to left,
89 * 2 = blocked to right, 88 * 2 = blocked to right,
90 * 4 = blocked above 89 * 4 = blocked above
91 * 8 = blocked below 90 * 8 = blocked below
92 */ 91 */
93 92
94 int surround_index = 0; 93 int surround_index = 0;
95 94
95 // don't forget to update the mapspace!
96 if (i > 0) map->at (i - 1, j ).update ();
97 if (i < RP->Xsize - 1) map->at (i + 1, j ).update ();
98 if (j > 0) map->at (i , j - 1).update ();
99 if (j < RP->Ysize - 1) map->at (i , j + 1).update ();
100
96 if ((i > 0) && (GET_MAP_MOVE_BLOCK (map, i - 1, j) & ~MOVE_BLOCK_DEFAULT)) 101 if ((i > 0) && (GET_MAP_MOVE_BLOCK (map, i - 1, j) & MOVE_WALK))
97 surround_index |= 1; 102 surround_index |= 1;
98 if ((i < RP->Xsize - 1) && (GET_MAP_MOVE_BLOCK (map, i + 1, j) & ~MOVE_BLOCK_DEFAULT)) 103 if ((i < RP->Xsize - 1) && (GET_MAP_MOVE_BLOCK (map, i + 1, j) & MOVE_WALK))
99 surround_index |= 2; 104 surround_index |= 2;
100 if ((j > 0) && (GET_MAP_MOVE_BLOCK (map, i, j - 1) & ~MOVE_BLOCK_DEFAULT)) 105 if ((j > 0) && (GET_MAP_MOVE_BLOCK (map, i, j - 1) & MOVE_WALK))
101 surround_index |= 4; 106 surround_index |= 4;
102 if ((j < RP->Ysize - 1) && (GET_MAP_MOVE_BLOCK (map, i, j + 1) & ~MOVE_BLOCK_DEFAULT)) 107 if ((j < RP->Ysize - 1) && (GET_MAP_MOVE_BLOCK (map, i, j + 1) & MOVE_WALK))
103 surround_index |= 8; 108 surround_index |= 8;
104 109
105 return surround_index; 110 return surround_index;
106} 111}
107 112
108/* like surround_flag2, except it checks a map, not a layout. */ 113/* like surround_flag2, except it checks a map, not a layout. */
109 114static int
110int
111surround_flag4 (maptile *map, int i, int j, RMParms * RP) 115surround_flag4 (maptile *map, int i, int j, random_map_params *RP)
112{ 116{
113 /* 1 = blocked to left, 117 /* 1 = blocked to left,
114 2 = blocked to right, 118 2 = blocked to right,
115 4 = blocked above 119 4 = blocked above
116 8 = blocked below */ 120 8 = blocked below */
… …
126 surround_index |= 8; 130 surround_index |= 8;
127 131
128 return surround_index; 132 return surround_index;
129} 133}
130 134
135/* picks the right wall type for this square, to make it look nice,
136 and have everything nicely joined. It uses the layout. */
137static object *
138pick_joined_wall (object *the_wall, char **layout, int i, int j, random_map_params *RP)
139{
140 /* 1 = wall to left,
141 2 = wall to right,
142 4 = wall above
143 8 = wall below */
144 int surround_index = 0;
145 int l;
146 char wall_name[1024];
147 archetype *wall_arch = 0;
148
149 assign (wall_name, the_wall->arch->archname);
150
151 /* conventionally, walls are named like this:
152 wallname_wallcode, where wallcode indicates
153 a joinedness, and wallname is the wall.
154 this code depends on the convention for
155 finding the right wall. */
156
157 /* extract the wall name, which is the text up to the leading _ */
158 for (l = 0; l < 64; l++)
159 {
160 if (wall_name[l] == '_')
161 {
162 wall_name[l] = 0;
163 break;
164 }
165 }
166
167 surround_index = surround_flag2 (layout, i, j, RP);
168
169 switch (surround_index)
170 {
171 case 0:
172 strcat (wall_name, "_0");
173 break;
174 case 1:
175 strcat (wall_name, "_1_3");
176 break;
177 case 2:
178 strcat (wall_name, "_1_4");
179 break;
180 case 3:
181 strcat (wall_name, "_2_1_2");
182 break;
183 case 4:
184 strcat (wall_name, "_1_2");
185 break;
186 case 5:
187 strcat (wall_name, "_2_2_4");
188 break;
189 case 6:
190 strcat (wall_name, "_2_2_1");
191 break;
192 case 7:
193 strcat (wall_name, "_3_1");
194 break;
195 case 8:
196 strcat (wall_name, "_1_1");
197 break;
198 case 9:
199 strcat (wall_name, "_2_2_3");
200 break;
201 case 10:
202 strcat (wall_name, "_2_2_2");
203 break;
204 case 11:
205 strcat (wall_name, "_3_3");
206 break;
207 case 12:
208 strcat (wall_name, "_2_1_1");
209 break;
210 case 13:
211 strcat (wall_name, "_3_4");
212 break;
213 case 14:
214 strcat (wall_name, "_3_2");
215 break;
216 case 15:
217 strcat (wall_name, "_4");
218 break;
219 }
220 wall_arch = archetype::find (wall_name);
221
222 return wall_arch ? arch_to_object (wall_arch) : arch_to_object (the_wall->arch);
223}
224
131/* takes a map and a layout, and puts walls in the map (picked from 225/* takes a map and a layout, and puts walls in the map (picked from
132 w_style) at '#' marks. */ 226 w_style) at '#' marks. */
133
134void 227void
135make_map_walls (maptile *map, char **layout, char *w_style, RMParms * RP) 228make_map_walls (maptile *map, char **layout, char *w_style, random_map_params *RP)
136{ 229{
137 char styledirname[256]; 230 char styledirname[1024];
138 char stylefilepath[256]; 231 char stylefilepath[1024];
139 maptile *style_map = 0; 232 maptile *style_map = 0;
140 object *the_wall; 233 object *the_wall;
141 234
142 /* get the style map */ 235 /* get the style map */
143 if (!strcmp (w_style, "none")) 236 if (!strcmp (w_style, "none"))
144 return; 237 return;
145 sprintf (styledirname, "%s", "/styles/wallstyles"); 238 sprintf (styledirname, "%s", "/styles/wallstyles");
146 sprintf (stylefilepath, "%s/%s", styledirname, w_style); 239 sprintf (stylefilepath, "%s/%s", styledirname, w_style);
147 style_map = find_style (styledirname, w_style, -1); 240 style_map = find_style (styledirname, w_style, -1);
148 if (style_map == 0) 241 if (!style_map)
149 return; 242 return;
150 243
151 /* fill up the map with the given floor style */ 244 /* fill up the map with the given floor style */
152 if ((the_wall = pick_random_object (style_map)) != NULL) 245 if ((the_wall = style_map->pick_random_object (rmg_rndm)))
153 { 246 {
154 int i, j; 247 int i, j;
155 char *cp; 248 char *cp;
156 int joinedwalls = 0; 249 int joinedwalls = 0;
157 object *thiswall; 250 object *thiswall;
158 251
159 sprintf (RP->wall_name, "%s", &the_wall->arch->name); 252 sprintf (RP->wall_name, "%s", &the_wall->arch->archname);
160 if ((cp = strchr (RP->wall_name, '_')) != NULL) 253 if ((cp = strchr (RP->wall_name, '_')) != NULL)
161 { 254 {
162 *cp = 0; 255 *cp = 0;
163 joinedwalls = 1; 256 joinedwalls = 1;
164 } 257 }
… …
170 { 263 {
171 if (joinedwalls) 264 if (joinedwalls)
172 thiswall = pick_joined_wall (the_wall, layout, i, j, RP); 265 thiswall = pick_joined_wall (the_wall, layout, i, j, RP);
173 else 266 else
174 thiswall = arch_to_object (the_wall->arch); 267 thiswall = arch_to_object (the_wall->arch);
268
175 thiswall->x = i; 269 thiswall->x = i;
176 thiswall->y = j; 270 thiswall->y = j;
177 thiswall->move_block = MOVE_ALL; 271 thiswall->move_block = MOVE_ALL;
178 insert_ob_in_map (thiswall, map, thiswall, INS_NO_MERGE | INS_NO_WALK_ON); 272 insert_ob_in_map (thiswall, map, thiswall, INS_NO_MERGE | INS_NO_WALK_ON);
179 } 273 }
180 } 274 }
181 } 275 }
182} 276}
183
184
185/* picks the right wall type for this square, to make it look nice,
186 and have everything nicely joined. It uses the layout. */
187
188object *
189pick_joined_wall (object *the_wall, char **layout, int i, int j, RMParms * RP)
190{
191 /* 1 = wall to left,
192 2 = wall to right,
193 4 = wall above
194 8 = wall below */
195 int surround_index = 0;
196 int l;
197 char wall_name[64];
198 archetype *wall_arch = 0;
199
200 strcpy (wall_name, the_wall->arch->name);
201
202 /* conventionally, walls are named like this:
203 wallname_wallcode, where wallcode indicates
204 a joinedness, and wallname is the wall.
205 this code depends on the convention for
206 finding the right wall. */
207
208 /* extract the wall name, which is the text up to the leading _ */
209 for (l = 0; l < 64; l++)
210 {
211 if (wall_name[l] == '_')
212 {
213 wall_name[l] = 0;
214 break;
215 }
216 }
217
218 surround_index = surround_flag2 (layout, i, j, RP);
219
220 switch (surround_index)
221 {
222 case 0:
223 strcat (wall_name, "_0");
224 break;
225 case 1:
226 strcat (wall_name, "_1_3");
227 break;
228 case 2:
229 strcat (wall_name, "_1_4");
230 break;
231 case 3:
232 strcat (wall_name, "_2_1_2");
233 break;
234 case 4:
235 strcat (wall_name, "_1_2");
236 break;
237 case 5:
238 strcat (wall_name, "_2_2_4");
239 break;
240 case 6:
241 strcat (wall_name, "_2_2_1");
242 break;
243 case 7:
244 strcat (wall_name, "_3_1");
245 break;
246 case 8:
247 strcat (wall_name, "_1_1");
248 break;
249 case 9:
250 strcat (wall_name, "_2_2_3");
251 break;
252 case 10:
253 strcat (wall_name, "_2_2_2");
254 break;
255 case 11:
256 strcat (wall_name, "_3_3");
257 break;
258 case 12:
259 strcat (wall_name, "_2_1_1");
260 break;
261 case 13:
262 strcat (wall_name, "_3_4");
263 break;
264 case 14:
265 strcat (wall_name, "_3_2");
266 break;
267 case 15:
268 strcat (wall_name, "_4");
269 break;
270 }
271 wall_arch = archetype::find (wall_name);
272 if (wall_arch)
273 return arch_to_object (wall_arch);
274 else
275 {
276 nroferrors--;
277 return arch_to_object (the_wall->arch);
278 }
279
280
281}
282
283 277
284/* this takes a map, and changes an existing wall to match what's blocked 278/* this takes a map, and changes an existing wall to match what's blocked
285 * around it, counting only doors and walls as blocked. If insert_flag is 279 * around it, counting only doors and walls as blocked. If insert_flag is
286 * 1, it will go ahead and insert the wall into the map. If not, it 280 * 1, it will go ahead and insert the wall into the map. If not, it
287 * will only return the wall which would belong there, and doesn't 281 * will only return the wall which would belong there, and doesn't
288 * remove anything. It depends on the 282 * remove anything. It depends on the
289 * global, previously-set variable, "wall_name" 283 * global, previously-set variable, "wall_name"
290 */ 284 */
291
292object * 285object *
293retrofit_joined_wall (maptile *the_map, int i, int j, int insert_flag, RMParms * RP) 286retrofit_joined_wall (maptile *the_map, int i, int j, int insert_flag, random_map_params *RP)
294{ 287{
295 /* 1 = wall to left, 288 /* 1 = wall to left,
296 * 2 = wall to right, 289 * 2 = wall to right,
297 * 4 = wall above 290 * 4 = wall above
298 * 8 = wall below 291 * 8 = wall below
… …
338 /* This would be a lot cleaner to just us a lookup table, 331 /* This would be a lot cleaner to just us a lookup table,
339 * eg, wall_suffix[surround_index] 332 * eg, wall_suffix[surround_index]
340 */ 333 */
341 switch (surround_index) 334 switch (surround_index)
342 { 335 {
343 case 0: 336 case 0:
344 strcat (RP->wall_name, "_0"); 337 strcat (RP->wall_name, "_0");
345 break; 338 break;
346 case 1: 339 case 1:
347 strcat (RP->wall_name, "_1_3"); 340 strcat (RP->wall_name, "_1_3");
348 break; 341 break;
349 case 2: 342 case 2:
350 strcat (RP->wall_name, "_1_4"); 343 strcat (RP->wall_name, "_1_4");
351 break; 344 break;
352 case 3: 345 case 3:
353 strcat (RP->wall_name, "_2_1_2"); 346 strcat (RP->wall_name, "_2_1_2");
354 break; 347 break;
355 case 4: 348 case 4:
356 strcat (RP->wall_name, "_1_2"); 349 strcat (RP->wall_name, "_1_2");
357 break; 350 break;
358 case 5: 351 case 5:
359 strcat (RP->wall_name, "_2_2_4"); 352 strcat (RP->wall_name, "_2_2_4");
360 break; 353 break;
361 case 6: 354 case 6:
362 strcat (RP->wall_name, "_2_2_1"); 355 strcat (RP->wall_name, "_2_2_1");
363 break; 356 break;
364 case 7: 357 case 7:
365 strcat (RP->wall_name, "_3_1"); 358 strcat (RP->wall_name, "_3_1");
366 break; 359 break;
367 case 8: 360 case 8:
368 strcat (RP->wall_name, "_1_1"); 361 strcat (RP->wall_name, "_1_1");
369 break; 362 break;
370 case 9: 363 case 9:
371 strcat (RP->wall_name, "_2_2_3"); 364 strcat (RP->wall_name, "_2_2_3");
372 break; 365 break;
373 case 10: 366 case 10:
374 strcat (RP->wall_name, "_2_2_2"); 367 strcat (RP->wall_name, "_2_2_2");
375 break; 368 break;
376 case 11: 369 case 11:
377 strcat (RP->wall_name, "_3_3"); 370 strcat (RP->wall_name, "_3_3");
378 break; 371 break;
379 case 12: 372 case 12:
380 strcat (RP->wall_name, "_2_1_1"); 373 strcat (RP->wall_name, "_2_1_1");
381 break; 374 break;
382 case 13: 375 case 13:
383 strcat (RP->wall_name, "_3_4"); 376 strcat (RP->wall_name, "_3_4");
384 break; 377 break;
385 case 14: 378 case 14:
386 strcat (RP->wall_name, "_3_2"); 379 strcat (RP->wall_name, "_3_2");
387 break; 380 break;
388 case 15: 381 case 15:
389 strcat (RP->wall_name, "_4"); 382 strcat (RP->wall_name, "_4");
390 break; 383 break;
391 } 384 }
385
392 wall_arch = archetype::find (RP->wall_name); 386 wall_arch = archetype::find (RP->wall_name);
387
393 if (wall_arch != NULL) 388 if (!wall_arch)
394 { 389 {
395 new_wall = arch_to_object (wall_arch); 390 new_wall = arch_to_object (wall_arch);
396 new_wall->x = i; 391 new_wall->x = i;
397 new_wall->y = j; 392 new_wall->y = j;
393
398 if (the_wall && the_wall->map) 394 if (the_wall && the_wall->map)
399 {
400 the_wall->remove ();
401 the_wall->destroy (); 395 the_wall->destroy ();
402 } 396
403 the_wall->move_block = MOVE_ALL; 397 the_wall->move_block = MOVE_ALL;
404 insert_ob_in_map (new_wall, the_map, new_wall, INS_NO_MERGE | INS_NO_WALK_ON); 398 insert_ob_in_map (new_wall, the_map, new_wall, INS_NO_MERGE | INS_NO_WALK_ON);
405 } 399 }
406 else 400
407 nroferrors--; /* it's OK not to find an arch. */
408 return new_wall; 401 return new_wall;
409} 402}

Diff Legend

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