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

Comparing deliantra/server/random_maps/special.C (file contents):
Revision 1.3 by root, Sun Sep 3 00:18:41 2006 UTC vs.
Revision 1.4 by root, Sun Sep 10 16:06:37 2006 UTC

1
1/* 2/*
2 * static char *rcsid_special_c = 3 * static char *rcsid_special_c =
3 * "$Id: special.C,v 1.3 2006/09/03 00:18:41 root Exp $"; 4 * "$Id: special.C,v 1.4 2006/09/10 16:06:37 root Exp $";
4 */ 5 */
5 6
6/* 7/*
7 CrossFire, A Multiplayer game for X-windows 8 CrossFire, A Multiplayer game for X-windows
8 9
… …
45#define NR_OF_HOLE_TYPES 3 46#define NR_OF_HOLE_TYPES 3
46 47
47/* clear map completely of all objects: a rectangular area of xsize, ysize 48/* clear map completely of all objects: a rectangular area of xsize, ysize
48is cleared with the top left corner at xstart, ystart */ 49is cleared with the top left corner at xstart, ystart */
49 50
51void
50void nuke_map_region(mapstruct *map,int xstart,int ystart, int xsize, int ysize) { 52nuke_map_region (mapstruct *map, int xstart, int ystart, int xsize, int ysize)
53{
51 int i,j; 54 int i, j;
52 object *tmp; 55 object *tmp;
56
53 for(i=xstart;i<xstart + xsize;i++) 57 for (i = xstart; i < xstart + xsize; i++)
54 for(j=ystart;j<ystart +ysize;j++) { 58 for (j = ystart; j < ystart + ysize; j++)
59 {
55 for(tmp=get_map_ob(map,i,j);tmp!=NULL;tmp=tmp->above) { 60 for (tmp = get_map_ob (map, i, j); tmp != NULL; tmp = tmp->above)
61 {
56 if(!QUERY_FLAG(tmp,FLAG_IS_FLOOR)) { 62 if (!QUERY_FLAG (tmp, FLAG_IS_FLOOR))
57 if(tmp->head) tmp=tmp->head; 63 {
64 if (tmp->head)
65 tmp = tmp->head;
58 remove_ob(tmp); 66 remove_ob (tmp);
59 free_object(tmp); 67 free_object (tmp);
60 tmp=get_map_ob(map,i,j); 68 tmp = get_map_ob (map, i, j);
69 }
70 if (tmp == NULL)
71 break;
61 } 72 }
62 if(tmp==NULL) break;
63 } 73 }
64 }
65} 74}
66 75
67 76
68 77
69/* copy in_map into dest_map at point x,y */ 78/* copy in_map into dest_map at point x,y */
70 79
71 80
81void
72void include_map_in_map(mapstruct *dest_map, mapstruct *in_map,int x, int y) { 82include_map_in_map (mapstruct *dest_map, mapstruct *in_map, int x, int y)
83{
73 int i,j; 84 int i, j;
74 object *tmp; 85 object *tmp;
75 object *new_ob; 86 object *new_ob;
76 87
77 /* First, splatter everything in the dest map at the location */ 88 /* First, splatter everything in the dest map at the location */
78 nuke_map_region(dest_map,x,y,MAP_WIDTH(in_map),MAP_HEIGHT(in_map)); 89 nuke_map_region (dest_map, x, y, MAP_WIDTH (in_map), MAP_HEIGHT (in_map));
79 90
80 for(i=0;i<MAP_WIDTH(in_map);i++) 91 for (i = 0; i < MAP_WIDTH (in_map); i++)
81 for(j=0;j<MAP_HEIGHT(in_map);j++) { 92 for (j = 0; j < MAP_HEIGHT (in_map); j++)
93 {
82 for(tmp=get_map_ob(in_map,i,j);tmp!=NULL;tmp=tmp->above) { 94 for (tmp = get_map_ob (in_map, i, j); tmp != NULL; tmp = tmp->above)
95 {
83 /* don't copy things with multiple squares: must be dealt with 96 /* don't copy things with multiple squares: must be dealt with
84 specially. */ 97 specially. */
85 if(tmp->head!=NULL) continue; 98 if (tmp->head != NULL)
99 continue;
86 new_ob = arch_to_object(tmp->arch); 100 new_ob = arch_to_object (tmp->arch);
87 copy_object_with_inv(tmp,new_ob); 101 copy_object_with_inv (tmp, new_ob);
88 if(QUERY_FLAG(tmp,FLAG_IS_LINKED)) 102 if (QUERY_FLAG (tmp, FLAG_IS_LINKED))
89 add_button_link(new_ob,dest_map,tmp->path_attuned); 103 add_button_link (new_ob, dest_map, tmp->path_attuned);
90 new_ob->x = i + x; 104 new_ob->x = i + x;
91 new_ob->y = j + y; 105 new_ob->y = j + y;
92 insert_multisquare_ob_in_map(new_ob,dest_map); 106 insert_multisquare_ob_in_map (new_ob, dest_map);
107 }
93 } 108 }
94 }
95} 109}
96 110
111int
97int find_spot_for_submap(mapstruct *map,char **layout,int *ix, int *iy,int xsize, int ysize) { 112find_spot_for_submap (mapstruct *map, char **layout, int *ix, int *iy, int xsize, int ysize)
113{
98 int tries; 114 int tries;
99 int i=0,j=0; /* initialization may not be needed but prevents compiler warnings */ 115 int i = 0, j = 0; /* initialization may not be needed but prevents compiler warnings */
100 int is_occupied=0; 116 int is_occupied = 0;
101 int l,m; 117 int l, m;
118
102 /* don't even try to place a submap into a map if the big map isn't 119 /* don't even try to place a submap into a map if the big map isn't
103 sufficiently large. */ 120 sufficiently large. */
104 if(2*xsize > MAP_WIDTH(map) || 2*ysize > MAP_HEIGHT(map)) return 0; 121 if (2 * xsize > MAP_WIDTH (map) || 2 * ysize > MAP_HEIGHT (map))
105 122 return 0;
123
106 /* search a bit for a completely free spot. */ 124 /* search a bit for a completely free spot. */
107 for(tries=0;tries<20;tries++) { 125 for (tries = 0; tries < 20; tries++)
126 {
108 /* pick a random location in the layout */ 127 /* pick a random location in the layout */
109 i = RANDOM() % (MAP_WIDTH(map) - xsize-2)+1; 128 i = RANDOM () % (MAP_WIDTH (map) - xsize - 2) + 1;
110 j = RANDOM() % (MAP_HEIGHT(map) - ysize-2)+1; 129 j = RANDOM () % (MAP_HEIGHT (map) - ysize - 2) + 1;
111 is_occupied=0; 130 is_occupied = 0;
112 for(l=i;l<i + xsize;l++) 131 for (l = i; l < i + xsize; l++)
113 for(m=j;m<j + ysize;m++) 132 for (m = j; m < j + ysize; m++)
114 is_occupied|=layout[l][m]; 133 is_occupied |= layout[l][m];
115 if(!is_occupied) break; 134 if (!is_occupied)
135 break;
116 } 136 }
117 137
118 138
119 /* if we failed, relax the restrictions */ 139 /* if we failed, relax the restrictions */
120 140
121 if(is_occupied) { /* failure, try a relaxed placer. */ 141 if (is_occupied)
142 { /* failure, try a relaxed placer. */
122 /* pick a random location in the layout */ 143 /* pick a random location in the layout */
123 for(tries=0;tries<10;tries++) { 144 for (tries = 0; tries < 10; tries++)
145 {
124 i = RANDOM() % (MAP_WIDTH(map) - xsize-2)+1; 146 i = RANDOM () % (MAP_WIDTH (map) - xsize - 2) + 1;
125 j = RANDOM() % (MAP_HEIGHT(map) - ysize-2)+1; 147 j = RANDOM () % (MAP_HEIGHT (map) - ysize - 2) + 1;
126 is_occupied=0; 148 is_occupied = 0;
127 for(l=i;l<i + xsize;l++) 149 for (l = i; l < i + xsize; l++)
128 for(m=j;m<j + ysize;m++) 150 for (m = j; m < j + ysize; m++)
129 if(layout[l][m]=='C' || layout[l][m]=='>' || layout[l][m]=='<') 151 if (layout[l][m] == 'C' || layout[l][m] == '>' || layout[l][m] == '<')
130 is_occupied|=1; 152 is_occupied |= 1;
131 } 153 }
132 } 154 }
133 if(is_occupied) return 0; 155 if (is_occupied)
156 return 0;
134 *ix=i; 157 *ix = i;
135 *iy=j; 158 *iy = j;
136 return 1; 159 return 1;
137} 160}
138 161
139 162
163void
140void place_fountain_with_specials(mapstruct *map) { 164place_fountain_with_specials (mapstruct *map)
165{
141 int ix,iy,i=-1,tries=0; 166 int ix, iy, i = -1, tries = 0;
142 mapstruct *fountain_style=find_style("/styles/misc","fountains",-1); 167 mapstruct *fountain_style = find_style ("/styles/misc", "fountains", -1);
143 object *fountain=get_archetype("fountain"); 168 object *fountain = get_archetype ("fountain");
144 object *potion=get_object(); 169 object *potion = get_object ();
170
145 copy_object(pick_random_object(fountain_style),potion); 171 copy_object (pick_random_object (fountain_style), potion);
146 while(i<0 && tries<10) { 172 while (i < 0 && tries < 10)
173 {
147 ix = RANDOM() % (MAP_WIDTH(map) -2) +1; 174 ix = RANDOM () % (MAP_WIDTH (map) - 2) + 1;
148 iy = RANDOM() % (MAP_HEIGHT(map) -2) +1; 175 iy = RANDOM () % (MAP_HEIGHT (map) - 2) + 1;
149 i = find_first_free_spot(fountain,map,ix,iy); 176 i = find_first_free_spot (fountain, map, ix, iy);
150 tries++; 177 tries++;
151 }; 178 };
152 if(i==-1) { /* can't place fountain */ 179 if (i == -1)
180 { /* can't place fountain */
153 free_object(fountain); 181 free_object (fountain);
154 free_object(potion); 182 free_object (potion);
155 return; 183 return;
156 } 184 }
157 ix += freearr_x[i]; 185 ix += freearr_x[i];
158 iy += freearr_y[i]; 186 iy += freearr_y[i];
159 potion->face=fountain->face; 187 potion->face = fountain->face;
160 SET_FLAG(potion,FLAG_NO_PICK); 188 SET_FLAG (potion, FLAG_NO_PICK);
161 SET_FLAG(potion,FLAG_IDENTIFIED); 189 SET_FLAG (potion, FLAG_IDENTIFIED);
162 potion->name = potion->name_pl = "fountain"; 190 potion->name = potion->name_pl = "fountain";
163 potion->x = ix; 191 potion->x = ix;
164 potion->y = iy; 192 potion->y = iy;
165 potion->material=M_ADAMANT; 193 potion->material = M_ADAMANT;
166 fountain->x = ix; 194 fountain->x = ix;
167 fountain->y = iy; 195 fountain->y = iy;
168 insert_ob_in_map(fountain,map,NULL,0); 196 insert_ob_in_map (fountain, map, NULL, 0);
169 insert_ob_in_map(potion,map,NULL,0); 197 insert_ob_in_map (potion, map, NULL, 0);
170 198
171} 199}
172 200
201void
173void place_special_exit(mapstruct * map, int hole_type,RMParms *RP) { 202place_special_exit (mapstruct *map, int hole_type, RMParms * RP)
203{
174 int ix,iy,i=-1; 204 int ix, iy, i = -1;
175 char buf[HUGE_BUF], *style, *decor, *mon; 205 char buf[HUGE_BUF], *style, *decor, *mon;
176 mapstruct *exit_style=find_style("/styles/misc","obscure_exits",-1); 206 mapstruct *exit_style = find_style ("/styles/misc", "obscure_exits", -1);
177 int g_xsize,g_ysize; 207 int g_xsize, g_ysize;
178 208
179 object *the_exit=get_object(); 209 object *the_exit = get_object ();
210
180 if(!exit_style) return; 211 if (!exit_style)
181 212 return;
213
182 copy_object(pick_random_object(exit_style),the_exit); 214 copy_object (pick_random_object (exit_style), the_exit);
183 215
184 while(i<0) { 216 while (i < 0)
217 {
185 ix = RANDOM() % (MAP_WIDTH(map) -2) +1; 218 ix = RANDOM () % (MAP_WIDTH (map) - 2) + 1;
186 iy = RANDOM() % (MAP_HEIGHT(map) -2) +1; 219 iy = RANDOM () % (MAP_HEIGHT (map) - 2) + 1;
187 i = find_first_free_spot(the_exit,map,ix,iy); 220 i = find_first_free_spot (the_exit, map, ix, iy);
188 } 221 }
189 222
190 ix += freearr_x[i]; 223 ix += freearr_x[i];
191 iy += freearr_y[i]; 224 iy += freearr_y[i];
192 the_exit->x = ix; 225 the_exit->x = ix;
193 the_exit->y = iy; 226 the_exit->y = iy;
194 227
228 if (!hole_type)
195 if(!hole_type) hole_type = RANDOM() % NR_OF_HOLE_TYPES + 1 ; 229 hole_type = RANDOM () % NR_OF_HOLE_TYPES + 1;
196 230
197 switch(hole_type) { 231 switch (hole_type)
232 {
198 case GLORY_HOLE: /* treasures */ 233 case GLORY_HOLE: /* treasures */
199 { 234 {
200 g_xsize = RANDOM() %3 + 4 + RP->difficulty/4; 235 g_xsize = RANDOM () % 3 + 4 + RP->difficulty / 4;
201 g_ysize = RANDOM() %3 + 4 + RP->difficulty/4; 236 g_ysize = RANDOM () % 3 + 4 + RP->difficulty / 4;
202 style = "onion"; 237 style = "onion";
203 decor = "wealth2"; 238 decor = "wealth2";
204 mon = "none"; 239 mon = "none";
205 break; 240 break;
206 } 241 }
207 242
208 case ORC_ZONE: /* hole with orcs in it. */ 243 case ORC_ZONE: /* hole with orcs in it. */
209 { 244 {
210 g_xsize = RANDOM() %3 + 4 + RP->difficulty/4; 245 g_xsize = RANDOM () % 3 + 4 + RP->difficulty / 4;
211 g_ysize = RANDOM() %3 + 4 + RP->difficulty/4; 246 g_ysize = RANDOM () % 3 + 4 + RP->difficulty / 4;
212 style = "onion"; 247 style = "onion";
213 decor = "wealth2"; 248 decor = "wealth2";
214 mon = "orc"; 249 mon = "orc";
215 break; 250 break;
216 } 251 }
217 252
218 case MINING_ZONE: /* hole with orcs in it. */ 253 case MINING_ZONE: /* hole with orcs in it. */
219 { 254 {
220 g_xsize = RANDOM() %9 + 4 + RP->difficulty/4; 255 g_xsize = RANDOM () % 9 + 4 + RP->difficulty / 4;
221 g_ysize = RANDOM() %9 + 4 + RP->difficulty/4; 256 g_ysize = RANDOM () % 9 + 4 + RP->difficulty / 4;
222 style = "maze"; 257 style = "maze";
223 decor = "minerals2"; 258 decor = "minerals2";
224 mon = "none"; 259 mon = "none";
225 break; 260 break;
226 } 261 }
227 262
228 default: /* undefined */ 263 default: /* undefined */
229 LOG(llevError, "place_special_exit: undefined hole type %d\n", hole_type); 264 LOG (llevError, "place_special_exit: undefined hole type %d\n", hole_type);
230 return; 265 return;
231 break; 266 break;
232 } 267 }
233 268
234 /* Need to be at least this size, otherwise the load 269 /* Need to be at least this size, otherwise the load
235 * code will generate new size values which are too large. 270 * code will generate new size values which are too large.
236 */ 271 */
237 if (g_xsize < MIN_RANDOM_MAP_SIZE) g_xsize = MIN_RANDOM_MAP_SIZE; 272 if (g_xsize < MIN_RANDOM_MAP_SIZE)
238 if (g_ysize < MIN_RANDOM_MAP_SIZE) g_ysize = MIN_RANDOM_MAP_SIZE; 273 g_xsize = MIN_RANDOM_MAP_SIZE;
274 if (g_ysize < MIN_RANDOM_MAP_SIZE)
275 g_ysize = MIN_RANDOM_MAP_SIZE;
239 276
240 write_parameters_to_string(buf, g_xsize, g_ysize,RP->wallstyle,RP->floorstyle,mon, 277 write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon,
241 "none",style,decor,"none",RP->exitstyle,0,0,0, 278 "none", style, decor, "none", RP->exitstyle, 0, 0, 0,
242 OPT_WALLS_ONLY,0,0,1,RP->dungeon_level,RP->dungeon_level, 279 OPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level,
243 RP->difficulty,RP->difficulty,-1,1,0,0,0,0, RP->difficulty_increase); 280 RP->difficulty, RP->difficulty, -1, 1, 0, 0, 0, 0, RP->difficulty_increase);
244 the_exit->slaying = "/!"; 281 the_exit->slaying = "/!";
245 the_exit->msg = buf; 282 the_exit->msg = buf;
246 283
247 insert_ob_in_map(the_exit,map,NULL,0); 284 insert_ob_in_map (the_exit, map, NULL, 0);
248} 285}
249 286
250 287
288void
251void place_specials_in_map(mapstruct *map, char **layout,RMParms *RP) { 289place_specials_in_map (mapstruct *map, char **layout, RMParms * RP)
290{
252 mapstruct *special_map; 291 mapstruct *special_map;
253 int ix,iy; /* map insertion locatons */ 292 int ix, iy; /* map insertion locatons */
254 int special_type; /* type of special to make */ 293 int special_type; /* type of special to make */
255 294
256 295
257 special_type = RANDOM() % NUM_OF_SPECIAL_TYPES; 296 special_type = RANDOM () % NUM_OF_SPECIAL_TYPES;
258 switch(special_type) { 297 switch (special_type)
298 {
259 299
260 /* includes a special map into the random map being made. */ 300 /* includes a special map into the random map being made. */
261 case SPECIAL_SUBMAP: { 301 case SPECIAL_SUBMAP:
302 {
262 special_map = find_style("/styles/specialmaps",0,RP->difficulty); 303 special_map = find_style ("/styles/specialmaps", 0, RP->difficulty);
263 if(special_map==NULL) return; 304 if (special_map == NULL)
264 305 return;
306
265 if(find_spot_for_submap(map,layout,&ix,&iy,MAP_WIDTH(special_map),MAP_HEIGHT(special_map))) 307 if (find_spot_for_submap (map, layout, &ix, &iy, MAP_WIDTH (special_map), MAP_HEIGHT (special_map)))
266 include_map_in_map(map,special_map,ix,iy); 308 include_map_in_map (map, special_map, ix, iy);
267 break; 309 break;
268 } 310 }
269 311
270 /* Make a special fountain: an unpickable potion disguised as 312 /* Make a special fountain: an unpickable potion disguised as
271 a fountain, or rather, colocated with a fountain. */ 313 a fountain, or rather, colocated with a fountain. */
272 case SPECIAL_FOUNTAIN: { 314 case SPECIAL_FOUNTAIN:
315 {
273 place_fountain_with_specials(map); 316 place_fountain_with_specials (map);
274 break; 317 break;
275 } 318 }
276 319
277 /* Make an exit to another random map, e.g. a gloryhole. */ 320 /* Make an exit to another random map, e.g. a gloryhole. */
278 case SPECIAL_EXIT: { 321 case SPECIAL_EXIT:
322 {
279 place_special_exit(map,0,RP); 323 place_special_exit (map, 0, RP);
280 break; 324 break;
325 }
281 } 326 }
282 } 327
283
284} 328}

Diff Legend

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