1 |
/* |
2 |
CrossFire, A Multiplayer game for X-windows |
3 |
|
4 |
Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 |
Copyright (C) 1992 Frank Tore Johansen |
6 |
|
7 |
This program is free software; you can redistribute it and/or modify |
8 |
it under the terms of the GNU General Public License as published by |
9 |
the Free Software Foundation; either version 2 of the License, or |
10 |
(at your option) any later version. |
11 |
|
12 |
This program is distributed in the hope that it will be useful, |
13 |
but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 |
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 |
GNU General Public License for more details. |
16 |
|
17 |
You should have received a copy of the GNU General Public License |
18 |
along with this program; if not, write to the Free Software |
19 |
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 |
|
21 |
The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 |
*/ |
23 |
|
24 |
|
25 |
#include <global.h> |
26 |
#include <random_map.h> |
27 |
#include <dirent.h> |
28 |
#include <sys/stat.h> |
29 |
#include <unistd.h> |
30 |
#include "../include/autoconf.h" |
31 |
|
32 |
|
33 |
static int |
34 |
pointer_strcmp (const void *p1, const void *p2) |
35 |
{ |
36 |
const char *s1 = *(const char **) p1; |
37 |
const char *s2 = *(const char **) p2; |
38 |
|
39 |
return (strcmp (s1, s2)); |
40 |
} |
41 |
|
42 |
/* This is our own version of scandir/select_regular_files/sort. |
43 |
* To support having subdirectories in styles, we need to know |
44 |
* if in fact the directory we read is a subdirectory. However, |
45 |
* we can't get that through the normal dirent entry. So |
46 |
* instead, we do our own where we do have the full directory |
47 |
* path so can do stat calls to see if in fact it is a directory. |
48 |
* dir is the name of the director to scan. |
49 |
* namelist is the array of file names returned. IT needs to be |
50 |
* freed by the caller. |
51 |
* skip_dirs controls our behavioru - if nonzero, we don't |
52 |
* skip any subdirectories - if zero, we store those away, |
53 |
* since there are cases where we want to choose a random |
54 |
* directory. |
55 |
*/ |
56 |
int |
57 |
load_dir (const char *dir, char ***namelist, int skip_dirs) |
58 |
{ |
59 |
DIR *dp; |
60 |
struct dirent *d; |
61 |
int entries = 0, entry_size = 0; |
62 |
char name[NAME_MAX + 1], **rn = NULL; |
63 |
struct stat sb; |
64 |
|
65 |
dp = opendir (dir); |
66 |
if (dp == NULL) |
67 |
return -1; |
68 |
|
69 |
while ((d = readdir (dp)) != NULL) |
70 |
{ |
71 |
sprintf (name, "%s/%s", dir, d->d_name); |
72 |
if (skip_dirs) |
73 |
{ |
74 |
stat (name, &sb); |
75 |
if (S_ISDIR (sb.st_mode)) |
76 |
{ |
77 |
continue; |
78 |
} |
79 |
} |
80 |
|
81 |
if (entries == entry_size) |
82 |
{ |
83 |
entry_size += 10; |
84 |
rn = (char **) realloc (rn, sizeof (char *) * entry_size); |
85 |
} |
86 |
rn[entries] = strdup (d->d_name); |
87 |
entries++; |
88 |
|
89 |
} |
90 |
(void) closedir (dp); |
91 |
|
92 |
qsort (rn, entries, sizeof (char *), pointer_strcmp); |
93 |
|
94 |
*namelist = rn; |
95 |
return entries; |
96 |
} |
97 |
|
98 |
|
99 |
|
100 |
|
101 |
|
102 |
/* this function loads and returns the map requested. |
103 |
* dirname, for example, is "/styles/wallstyles", stylename, is, |
104 |
* for example, "castle", difficulty is -1 when difficulty is |
105 |
* irrelevant to the style. If dirname is given, but stylename |
106 |
* isn't, and difficult is -1, it returns a random style map. |
107 |
* Otherwise, it tries to match the difficulty given with a style |
108 |
* file, named style_name_# where # is an integer |
109 |
*/ |
110 |
|
111 |
/* remove extern, so visible to command_style_map_info function */ |
112 |
maptile *styles = NULL; |
113 |
|
114 |
|
115 |
maptile * |
116 |
load_style_map (char *style_name) |
117 |
{ |
118 |
maptile *style_map; |
119 |
|
120 |
/* Given a file. See if its in memory */ |
121 |
for (style_map = styles; style_map != NULL; style_map = style_map->next) |
122 |
{ |
123 |
if (!strcmp (style_name, style_map->path)) |
124 |
return style_map; |
125 |
} |
126 |
style_map = load_original_map (style_name, MAP_STYLE); |
127 |
/* Remove it from global list, put it on our local list */ |
128 |
if (style_map) |
129 |
{ |
130 |
maptile *tmp; |
131 |
|
132 |
if (style_map == first_map) |
133 |
first_map = style_map->next; |
134 |
else |
135 |
{ |
136 |
for (tmp = first_map; tmp && tmp->next != style_map; tmp = tmp->next); |
137 |
if (tmp) |
138 |
tmp->next = style_map->next; |
139 |
} |
140 |
style_map->next = styles; |
141 |
styles = style_map; |
142 |
} |
143 |
return style_map; |
144 |
} |
145 |
|
146 |
maptile * |
147 |
find_style (const char *dirname, const char *stylename, int difficulty) |
148 |
{ |
149 |
char style_file_path[256]; |
150 |
char style_file_full_path[256]; |
151 |
maptile *style_map = NULL; |
152 |
struct stat file_stat; |
153 |
int i, only_subdirs = 0; |
154 |
|
155 |
/* if stylename exists, set style_file_path to that file. */ |
156 |
if (stylename && strlen (stylename) > 0) |
157 |
sprintf (style_file_path, "%s/%s", dirname, stylename); |
158 |
else /* otherwise, just use the dirname. We'll pick a random stylefile. */ |
159 |
sprintf (style_file_path, "%s", dirname); |
160 |
|
161 |
/* is what we were given a directory, or a file? */ |
162 |
sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path); |
163 |
if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode)) |
164 |
{ |
165 |
style_map = load_style_map (style_file_path); |
166 |
} |
167 |
if (style_map == NULL) /* maybe we were given a directory! */ |
168 |
{ |
169 |
char **namelist; |
170 |
int n; |
171 |
char style_dir_full_path[256]; |
172 |
|
173 |
/* get the names of all the files in that directory */ |
174 |
sprintf (style_dir_full_path, "%s/maps%s", settings.datadir, style_file_path); |
175 |
|
176 |
/* First, skip subdirectories. If we don't find anything, then try again |
177 |
* without skipping subdirs. |
178 |
*/ |
179 |
n = load_dir (style_dir_full_path, &namelist, 1); |
180 |
|
181 |
if (n <= 0) |
182 |
{ |
183 |
n = load_dir (style_dir_full_path, &namelist, 0); |
184 |
only_subdirs = 1; |
185 |
} |
186 |
|
187 |
if (n <= 0) |
188 |
return 0; /* nothing to load. Bye. */ |
189 |
|
190 |
/* Picks a random map. Note that if this is all directories, |
191 |
* we know it won't be able to load, so save a few ticks. |
192 |
* the door handling checks for this failure and handles |
193 |
* it properly. |
194 |
*/ |
195 |
if (difficulty == -1) |
196 |
{ /* pick a random style from this dir. */ |
197 |
if (only_subdirs) |
198 |
style_map = NULL; |
199 |
else |
200 |
{ |
201 |
strcat (style_file_path, "/"); |
202 |
strcat (style_file_path, namelist[RANDOM () % n]); |
203 |
style_map = load_style_map (style_file_path); |
204 |
} |
205 |
} |
206 |
else |
207 |
{ /* find the map closest in difficulty */ |
208 |
int min_dist = 32000, min_index = -1; |
209 |
|
210 |
for (i = 0; i < n; i++) |
211 |
{ |
212 |
int dist; |
213 |
char *mfile_name = strrchr (namelist[i], '_') + 1; |
214 |
|
215 |
if ((mfile_name - 1) == NULL) |
216 |
{ /* since there isn't a sequence, */ |
217 |
int q; |
218 |
|
219 |
/*pick one at random to recurse */ |
220 |
style_map = find_style (style_file_path, namelist[RANDOM () % n], difficulty); |
221 |
for (q = 0; q < n; q++) |
222 |
free (namelist[q]); |
223 |
free (namelist); |
224 |
return style_map; |
225 |
} |
226 |
else |
227 |
{ |
228 |
dist = abs (difficulty - atoi (mfile_name)); |
229 |
if (dist < min_dist) |
230 |
{ |
231 |
min_dist = dist; |
232 |
min_index = i; |
233 |
} |
234 |
} |
235 |
} |
236 |
/* presumably now we've found the "best" match for the |
237 |
difficulty. */ |
238 |
strcat (style_file_path, "/"); |
239 |
strcat (style_file_path, namelist[min_index]); |
240 |
style_map = load_style_map (style_file_path); |
241 |
} |
242 |
for (i = 0; i < n; i++) |
243 |
free (namelist[i]); |
244 |
free (namelist); |
245 |
} |
246 |
return style_map; |
247 |
|
248 |
} |
249 |
|
250 |
|
251 |
/* picks a random object from a style map. |
252 |
* Redone by MSW so it should be faster and not use static |
253 |
* variables to generate tables. |
254 |
*/ |
255 |
object * |
256 |
pick_random_object (maptile *style) |
257 |
{ |
258 |
int x, y, limit = 0; |
259 |
object *new_obj; |
260 |
|
261 |
/* while returning a null object will result in a crash, that |
262 |
* is actually preferable to an infinite loop. That is because |
263 |
* most servers will automatically restart in case of crash. |
264 |
* Change the logic on getting the random space - shouldn't make |
265 |
* any difference, but this seems clearer to me. |
266 |
*/ |
267 |
do |
268 |
{ |
269 |
limit++; |
270 |
x = RANDOM () % MAP_WIDTH (style); |
271 |
y = RANDOM () % MAP_HEIGHT (style); |
272 |
new_obj = GET_MAP_OB (style, x, y); |
273 |
} |
274 |
while (new_obj == NULL && limit < 1000); |
275 |
if (new_obj->head) |
276 |
return new_obj->head; |
277 |
else |
278 |
return new_obj; |
279 |
} |
280 |
|
281 |
|
282 |
void |
283 |
free_style_maps (void) |
284 |
{ |
285 |
maptile *next; |
286 |
int style_maps = 0; |
287 |
|
288 |
/* delete_map will try to free it from the linked list, |
289 |
* but won't find it, so we need to do it ourselves |
290 |
*/ |
291 |
while (styles) |
292 |
{ |
293 |
next = styles->next; |
294 |
delete_map (styles); |
295 |
styles = next; |
296 |
style_maps++; |
297 |
} |
298 |
LOG (llevDebug, "free_style_maps: Freed %d maps\n", style_maps); |
299 |
} |