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

Diff Legend

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