|
|
1 | |
| 1 | /* |
2 | /* |
| 2 | * static char *rcsid_style_c = |
3 | * static char *rcsid_style_c = |
| 3 | * "$Id: style.C,v 1.2 2006/08/29 08:01:36 root Exp $"; |
4 | * "$Id: style.C,v 1.3 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 | |
| … | |
… | |
| 27 | */ |
28 | */ |
| 28 | |
29 | |
| 29 | |
30 | |
| 30 | #include <global.h> |
31 | #include <global.h> |
| 31 | #include <random_map.h> |
32 | #include <random_map.h> |
| 32 | #ifndef WIN32 /* ---win32 exclude headers */ |
33 | #ifndef WIN32 /* ---win32 exclude headers */ |
| 33 | #include <dirent.h> |
34 | # include <dirent.h> |
| 34 | #include <sys/stat.h> |
35 | # include <sys/stat.h> |
| 35 | #include <unistd.h> |
36 | # include <unistd.h> |
| 36 | #include "../include/autoconf.h" |
37 | # include "../include/autoconf.h" |
| 37 | #endif /* win32 */ |
38 | #endif /* win32 */ |
| 38 | |
39 | |
| 39 | |
40 | |
|
|
41 | static int |
| 40 | static int pointer_strcmp(const void *p1, const void *p2) |
42 | pointer_strcmp (const void *p1, const void *p2) |
| 41 | { |
43 | { |
| 42 | const char *s1 = *(const char **)p1; |
44 | const char *s1 = *(const char **) p1; |
| 43 | const char *s2 = *(const char **)p2; |
45 | const char *s2 = *(const char **) p2; |
| 44 | |
46 | |
| 45 | return(strcmp(s1, s2)); |
47 | return (strcmp (s1, s2)); |
| 46 | } |
48 | } |
| 47 | |
49 | |
| 48 | /* This is our own version of scandir/select_regular_files/sort. |
50 | /* This is our own version of scandir/select_regular_files/sort. |
| 49 | * To support having subdirectories in styles, we need to know |
51 | * To support having subdirectories in styles, we need to know |
| 50 | * if in fact the directory we read is a subdirectory. However, |
52 | * if in fact the directory we read is a subdirectory. However, |
| … | |
… | |
| 57 | * skip_dirs controls our behavioru - if nonzero, we don't |
59 | * skip_dirs controls our behavioru - if nonzero, we don't |
| 58 | * skip any subdirectories - if zero, we store those away, |
60 | * skip any subdirectories - if zero, we store those away, |
| 59 | * since there are cases where we want to choose a random |
61 | * since there are cases where we want to choose a random |
| 60 | * directory. |
62 | * directory. |
| 61 | */ |
63 | */ |
|
|
64 | int |
| 62 | int load_dir (const char *dir, char ***namelist, int skip_dirs) |
65 | load_dir (const char *dir, char ***namelist, int skip_dirs) |
| 63 | { |
66 | { |
| 64 | DIR *dp; |
67 | DIR *dp; |
| 65 | struct dirent *d; |
68 | struct dirent *d; |
| 66 | int entries=0, entry_size=0; |
69 | int entries = 0, entry_size = 0; |
| 67 | char name[NAME_MAX+1], **rn=NULL; |
70 | char name[NAME_MAX + 1], **rn = NULL; |
| 68 | struct stat sb; |
71 | struct stat sb; |
| 69 | |
72 | |
| 70 | dp = opendir (dir); |
73 | dp = opendir (dir); |
| 71 | if (dp == NULL) |
74 | if (dp == NULL) |
| 72 | return -1; |
75 | return -1; |
| 73 | |
76 | |
| 74 | while ((d = readdir (dp)) != NULL) { |
77 | while ((d = readdir (dp)) != NULL) |
|
|
78 | { |
| 75 | sprintf(name, "%s/%s", dir, d->d_name); |
79 | sprintf (name, "%s/%s", dir, d->d_name); |
| 76 | if (skip_dirs) { |
80 | if (skip_dirs) |
|
|
81 | { |
| 77 | stat(name, &sb); |
82 | stat (name, &sb); |
| 78 | if (S_ISDIR(sb.st_mode)) { |
83 | if (S_ISDIR (sb.st_mode)) |
|
|
84 | { |
| 79 | continue; |
85 | continue; |
| 80 | } |
86 | } |
| 81 | } |
87 | } |
| 82 | |
88 | |
| 83 | if (entries == entry_size) { |
89 | if (entries == entry_size) |
|
|
90 | { |
| 84 | entry_size+=10; |
91 | entry_size += 10; |
| 85 | rn = (char **) realloc(rn, sizeof(char*) * entry_size); |
92 | rn = (char **) realloc (rn, sizeof (char *) * entry_size); |
| 86 | } |
93 | } |
| 87 | rn[entries] = strdup_local(d->d_name); |
94 | rn[entries] = strdup_local (d->d_name); |
| 88 | entries++; |
95 | entries++; |
| 89 | |
96 | |
| 90 | } |
97 | } |
| 91 | (void) closedir (dp); |
98 | (void) closedir (dp); |
| 92 | |
99 | |
| 93 | qsort(rn, entries, sizeof(char*), pointer_strcmp); |
100 | qsort (rn, entries, sizeof (char *), pointer_strcmp); |
| 94 | |
101 | |
| 95 | *namelist = rn; |
102 | *namelist = rn; |
| 96 | return entries; |
103 | return entries; |
| 97 | } |
104 | } |
| 98 | |
105 | |
| 99 | |
106 | |
| 100 | |
107 | |
| 101 | |
108 | |
| 102 | |
109 | |
| 103 | /* this function loads and returns the map requested. |
110 | /* this function loads and returns the map requested. |
| 104 | * dirname, for example, is "/styles/wallstyles", stylename, is, |
111 | * dirname, for example, is "/styles/wallstyles", stylename, is, |
| 105 | * for example, "castle", difficulty is -1 when difficulty is |
112 | * for example, "castle", difficulty is -1 when difficulty is |
| 106 | * irrelevant to the style. If dirname is given, but stylename |
113 | * irrelevant to the style. If dirname is given, but stylename |
| 107 | * isn't, and difficult is -1, it returns a random style map. |
114 | * isn't, and difficult is -1, it returns a random style map. |
| 108 | * Otherwise, it tries to match the difficulty given with a style |
115 | * Otherwise, it tries to match the difficulty given with a style |
| 109 | * file, named style_name_# where # is an integer |
116 | * file, named style_name_# where # is an integer |
| 110 | */ |
117 | */ |
| 111 | |
118 | |
| 112 | /* remove extern, so visible to command_style_map_info function */ |
119 | /* remove extern, so visible to command_style_map_info function */ |
| 113 | mapstruct *styles=NULL; |
120 | mapstruct *styles = NULL; |
| 114 | |
121 | |
| 115 | |
122 | |
|
|
123 | mapstruct * |
| 116 | mapstruct *load_style_map(char *style_name) |
124 | load_style_map (char *style_name) |
| 117 | { |
125 | { |
| 118 | mapstruct *style_map; |
126 | mapstruct *style_map; |
| 119 | |
127 | |
| 120 | /* Given a file. See if its in memory */ |
128 | /* Given a file. See if its in memory */ |
| 121 | for (style_map = styles; style_map!=NULL; style_map=style_map->next) { |
129 | for (style_map = styles; style_map != NULL; style_map = style_map->next) |
|
|
130 | { |
| 122 | if (!strcmp(style_name, style_map->path)) return style_map; |
131 | if (!strcmp (style_name, style_map->path)) |
|
|
132 | return style_map; |
| 123 | } |
133 | } |
| 124 | style_map = load_original_map(style_name,MAP_STYLE); |
134 | style_map = load_original_map (style_name, MAP_STYLE); |
| 125 | /* Remove it from global list, put it on our local list */ |
135 | /* Remove it from global list, put it on our local list */ |
| 126 | if (style_map) { |
136 | if (style_map) |
|
|
137 | { |
| 127 | mapstruct *tmp; |
138 | mapstruct *tmp; |
| 128 | |
139 | |
| 129 | if (style_map == first_map) |
140 | if (style_map == first_map) |
| 130 | first_map = style_map->next; |
141 | first_map = style_map->next; |
| 131 | else { |
142 | else |
|
|
143 | { |
| 132 | for (tmp = first_map; tmp && tmp->next != style_map; tmp = tmp->next); |
144 | for (tmp = first_map; tmp && tmp->next != style_map; tmp = tmp->next); |
| 133 | if(tmp) |
145 | if (tmp) |
| 134 | tmp->next = style_map->next; |
146 | tmp->next = style_map->next; |
| 135 | } |
147 | } |
| 136 | style_map->next = styles; |
148 | style_map->next = styles; |
| 137 | styles = style_map; |
149 | styles = style_map; |
| 138 | } |
150 | } |
| 139 | return style_map; |
151 | return style_map; |
| 140 | } |
152 | } |
| 141 | |
153 | |
|
|
154 | mapstruct * |
| 142 | mapstruct *find_style(const char *dirname,const char *stylename,int difficulty) { |
155 | find_style (const char *dirname, const char *stylename, int difficulty) |
|
|
156 | { |
| 143 | char style_file_path[256]; |
157 | char style_file_path[256]; |
| 144 | char style_file_full_path[256]; |
158 | char style_file_full_path[256]; |
| 145 | mapstruct *style_map = NULL; |
159 | mapstruct *style_map = NULL; |
| 146 | struct stat file_stat; |
160 | struct stat file_stat; |
| 147 | int i, only_subdirs=0; |
161 | int i, only_subdirs = 0; |
| 148 | |
162 | |
| 149 | /* if stylename exists, set style_file_path to that file.*/ |
163 | /* if stylename exists, set style_file_path to that file. */ |
| 150 | if(stylename && strlen(stylename)>0) |
164 | if (stylename && strlen (stylename) > 0) |
| 151 | sprintf(style_file_path,"%s/%s",dirname,stylename); |
165 | sprintf (style_file_path, "%s/%s", dirname, stylename); |
| 152 | else /* otherwise, just use the dirname. We'll pick a random stylefile.*/ |
166 | else /* otherwise, just use the dirname. We'll pick a random stylefile. */ |
| 153 | sprintf(style_file_path,"%s",dirname); |
167 | sprintf (style_file_path, "%s", dirname); |
| 154 | |
168 | |
| 155 | /* is what we were given a directory, or a file? */ |
169 | /* is what we were given a directory, or a file? */ |
| 156 | sprintf(style_file_full_path,"%s/maps%s",settings.datadir,style_file_path); |
170 | sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path); |
| 157 | if (stat(style_file_full_path, &file_stat) == 0 |
171 | if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode)) |
| 158 | && !S_ISDIR(file_stat.st_mode)) { |
172 | { |
| 159 | style_map=load_style_map(style_file_path); |
173 | style_map = load_style_map (style_file_path); |
| 160 | } |
174 | } |
| 161 | if(style_map == NULL) /* maybe we were given a directory! */ |
175 | if (style_map == NULL) /* maybe we were given a directory! */ |
| 162 | { |
176 | { |
| 163 | char **namelist; |
177 | char **namelist; |
| 164 | int n; |
178 | int n; |
| 165 | char style_dir_full_path[256]; |
179 | char style_dir_full_path[256]; |
| 166 | |
180 | |
| 167 | /* get the names of all the files in that directory */ |
181 | /* get the names of all the files in that directory */ |
| 168 | sprintf(style_dir_full_path,"%s/maps%s",settings.datadir,style_file_path); |
182 | sprintf (style_dir_full_path, "%s/maps%s", settings.datadir, style_file_path); |
| 169 | |
183 | |
| 170 | /* First, skip subdirectories. If we don't find anything, then try again |
184 | /* First, skip subdirectories. If we don't find anything, then try again |
| 171 | * without skipping subdirs. |
185 | * without skipping subdirs. |
| 172 | */ |
186 | */ |
| 173 | n = load_dir(style_dir_full_path, &namelist, 1); |
187 | n = load_dir (style_dir_full_path, &namelist, 1); |
| 174 | |
188 | |
| 175 | if (n<=0) { |
189 | if (n <= 0) |
|
|
190 | { |
| 176 | n = load_dir(style_dir_full_path, &namelist, 0); |
191 | n = load_dir (style_dir_full_path, &namelist, 0); |
| 177 | only_subdirs=1; |
192 | only_subdirs = 1; |
| 178 | } |
193 | } |
| 179 | |
194 | |
|
|
195 | if (n <= 0) |
| 180 | if (n<=0) return 0; /* nothing to load. Bye. */ |
196 | return 0; /* nothing to load. Bye. */ |
| 181 | |
197 | |
| 182 | /* Picks a random map. Note that if this is all directories, |
198 | /* Picks a random map. Note that if this is all directories, |
| 183 | * we know it won't be able to load, so save a few ticks. |
199 | * we know it won't be able to load, so save a few ticks. |
| 184 | * the door handling checks for this failure and handles |
200 | * the door handling checks for this failure and handles |
| 185 | * it properly. |
201 | * it properly. |
| 186 | */ |
202 | */ |
| 187 | if(difficulty==-1) { /* pick a random style from this dir. */ |
203 | if (difficulty == -1) |
|
|
204 | { /* pick a random style from this dir. */ |
| 188 | if (only_subdirs) |
205 | if (only_subdirs) |
| 189 | style_map=NULL; |
206 | style_map = NULL; |
| 190 | else { |
207 | else |
|
|
208 | { |
| 191 | strcat(style_file_path,"/"); |
209 | strcat (style_file_path, "/"); |
| 192 | strcat(style_file_path,namelist[RANDOM()%n]); |
210 | strcat (style_file_path, namelist[RANDOM () % n]); |
| 193 | style_map = load_style_map(style_file_path); |
211 | style_map = load_style_map (style_file_path); |
| 194 | } |
212 | } |
| 195 | } |
213 | } |
|
|
214 | else |
| 196 | else { /* find the map closest in difficulty */ |
215 | { /* find the map closest in difficulty */ |
| 197 | int min_dist=32000,min_index=-1; |
216 | int min_dist = 32000, min_index = -1; |
| 198 | |
217 | |
| 199 | for(i=0;i<n;i++) { |
218 | for (i = 0; i < n; i++) |
|
|
219 | { |
| 200 | int dist; |
220 | int dist; |
| 201 | char *mfile_name = strrchr(namelist[i],'_')+1; |
221 | char *mfile_name = strrchr (namelist[i], '_') + 1; |
| 202 | |
222 | |
| 203 | if((mfile_name-1) == NULL) { /* since there isn't a sequence, */ |
223 | if ((mfile_name - 1) == NULL) |
|
|
224 | { /* since there isn't a sequence, */ |
| 204 | int q; |
225 | int q; |
|
|
226 | |
| 205 | /*pick one at random to recurse */ |
227 | /*pick one at random to recurse */ |
| 206 | style_map= find_style(style_file_path, |
228 | style_map = find_style (style_file_path, namelist[RANDOM () % n], difficulty); |
| 207 | namelist[RANDOM()%n],difficulty); |
|
|
| 208 | for (q=0; q<n; q++) |
229 | for (q = 0; q < n; q++) |
| 209 | free(namelist[q]); |
230 | free (namelist[q]); |
| 210 | free(namelist); |
231 | free (namelist); |
| 211 | return style_map; |
232 | return style_map; |
|
|
233 | } |
| 212 | } else { |
234 | else |
|
|
235 | { |
| 213 | dist = abs(difficulty-atoi(mfile_name)); |
236 | dist = abs (difficulty - atoi (mfile_name)); |
| 214 | if(dist<min_dist) { |
237 | if (dist < min_dist) |
|
|
238 | { |
| 215 | min_dist = dist; |
239 | min_dist = dist; |
| 216 | min_index = i; |
240 | min_index = i; |
| 217 | } |
241 | } |
| 218 | } |
242 | } |
| 219 | } |
243 | } |
| 220 | /* presumably now we've found the "best" match for the |
244 | /* presumably now we've found the "best" match for the |
| 221 | difficulty. */ |
245 | difficulty. */ |
| 222 | strcat(style_file_path,"/"); |
246 | strcat (style_file_path, "/"); |
| 223 | strcat(style_file_path,namelist[min_index]); |
247 | strcat (style_file_path, namelist[min_index]); |
| 224 | style_map = load_style_map(style_file_path); |
248 | style_map = load_style_map (style_file_path); |
| 225 | } |
249 | } |
| 226 | for (i=0; i<n; i++) |
250 | for (i = 0; i < n; i++) |
| 227 | free(namelist[i]); |
251 | free (namelist[i]); |
| 228 | free(namelist); |
252 | free (namelist); |
| 229 | } |
253 | } |
| 230 | return style_map; |
254 | return style_map; |
| 231 | |
255 | |
| 232 | } |
256 | } |
| 233 | |
257 | |
| 234 | |
258 | |
| 235 | /* picks a random object from a style map. |
259 | /* picks a random object from a style map. |
| 236 | * Redone by MSW so it should be faster and not use static |
260 | * Redone by MSW so it should be faster and not use static |
| 237 | * variables to generate tables. |
261 | * variables to generate tables. |
| 238 | */ |
262 | */ |
|
|
263 | object * |
| 239 | object *pick_random_object(mapstruct *style) { |
264 | pick_random_object (mapstruct *style) |
|
|
265 | { |
| 240 | int x,y, limit=0; |
266 | int x, y, limit = 0; |
| 241 | object *new_obj; |
267 | object *new_obj; |
| 242 | |
268 | |
| 243 | /* while returning a null object will result in a crash, that |
269 | /* while returning a null object will result in a crash, that |
| 244 | * is actually preferable to an infinite loop. That is because |
270 | * is actually preferable to an infinite loop. That is because |
| 245 | * most servers will automatically restart in case of crash. |
271 | * most servers will automatically restart in case of crash. |
| 246 | * Change the logic on getting the random space - shouldn't make |
272 | * Change the logic on getting the random space - shouldn't make |
| 247 | * any difference, but this seems clearer to me. |
273 | * any difference, but this seems clearer to me. |
| 248 | */ |
274 | */ |
|
|
275 | do |
| 249 | do { |
276 | { |
| 250 | limit++; |
277 | limit++; |
| 251 | x = RANDOM() % MAP_WIDTH(style); |
278 | x = RANDOM () % MAP_WIDTH (style); |
| 252 | y = RANDOM() % MAP_HEIGHT(style); |
279 | y = RANDOM () % MAP_HEIGHT (style); |
| 253 | new_obj = get_map_ob(style,x,y); |
280 | new_obj = get_map_ob (style, x, y); |
|
|
281 | } |
| 254 | } while (new_obj == NULL && limit<1000); |
282 | while (new_obj == NULL && limit < 1000); |
| 255 | if (new_obj->head) return new_obj->head; |
283 | if (new_obj->head) |
|
|
284 | return new_obj->head; |
|
|
285 | else |
| 256 | else return new_obj; |
286 | return new_obj; |
| 257 | } |
287 | } |
| 258 | |
|
|
| 259 | |
288 | |
|
|
289 | |
|
|
290 | void |
| 260 | void free_style_maps(void) |
291 | free_style_maps (void) |
| 261 | { |
292 | { |
| 262 | mapstruct *next; |
293 | mapstruct *next; |
| 263 | int style_maps=0; |
294 | int style_maps = 0; |
| 264 | |
295 | |
| 265 | /* delete_map will try to free it from the linked list, |
296 | /* delete_map will try to free it from the linked list, |
| 266 | * but won't find it, so we need to do it ourselves |
297 | * but won't find it, so we need to do it ourselves |
| 267 | */ |
298 | */ |
| 268 | while (styles) { |
299 | while (styles) |
|
|
300 | { |
| 269 | next = styles->next; |
301 | next = styles->next; |
| 270 | delete_map(styles); |
302 | delete_map (styles); |
| 271 | styles=next; |
303 | styles = next; |
| 272 | style_maps++; |
304 | style_maps++; |
| 273 | } |
305 | } |
| 274 | LOG(llevDebug,"free_style_maps: Freed %d maps\n", style_maps); |
306 | LOG (llevDebug, "free_style_maps: Freed %d maps\n", style_maps); |
| 275 | } |
307 | } |
| 276 | |
|
|
