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.1 by elmex, Sun Aug 13 17:16:03 2006 UTC vs.
Revision 1.26 by root, Thu Nov 8 19:43:25 2007 UTC

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

Diff Legend

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