1 |
|
2 |
/* |
3 |
CrossFire, A Multiplayer game for X-windows |
4 |
|
5 |
Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
6 |
Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
7 |
Copyright (C) 1992 Frank Tore Johansen |
8 |
|
9 |
This program is free software; you can redistribute it and/or modify |
10 |
it under the terms of the GNU General Public License as published by |
11 |
the Free Software Foundation; either version 2 of the License, or |
12 |
(at your option) any later version. |
13 |
|
14 |
This program is distributed in the hope that it will be useful, |
15 |
but WITHOUT ANY WARRANTY; without even the implied warranty of |
16 |
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
17 |
GNU General Public License for more details. |
18 |
|
19 |
You should have received a copy of the GNU General Public License |
20 |
along with this program; if not, write to the Free Software |
21 |
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
22 |
|
23 |
The authors can be reached via e-mail at <crossfire@schmorp.de> |
24 |
*/ |
25 |
|
26 |
#include <global.h> |
27 |
#include <random_map.h> |
28 |
#include <dirent.h> |
29 |
#include <sys/stat.h> |
30 |
#include <unistd.h> |
31 |
#include "../include/autoconf.h" |
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 |
maptile * |
99 |
find_style (const char *dirname, const char *stylename, int difficulty) |
100 |
{ |
101 |
char style_file_path[1024]; |
102 |
char style_file_full_path[1024]; |
103 |
maptile *style_map = NULL; |
104 |
struct stat file_stat; |
105 |
int i, only_subdirs = 0; |
106 |
|
107 |
/* if stylename exists, set style_file_path to that file. */ |
108 |
if (stylename && strlen (stylename) > 0) |
109 |
sprintf (style_file_path, "%s/%s", dirname, stylename); |
110 |
else /* otherwise, just use the dirname. We'll pick a random stylefile. */ |
111 |
sprintf (style_file_path, "%s", dirname); |
112 |
|
113 |
/* is what we were given a directory, or a file? */ |
114 |
sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path); |
115 |
|
116 |
if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode)) |
117 |
style_map = maptile::find_sync (style_file_path); |
118 |
|
119 |
if (!style_map) /* maybe we were given a directory! */ |
120 |
{ |
121 |
char **namelist; |
122 |
int n; |
123 |
char style_dir_full_path[256]; |
124 |
|
125 |
/* get the names of all the files in that directory */ |
126 |
sprintf (style_dir_full_path, "%s/maps%s", settings.datadir, style_file_path); |
127 |
|
128 |
/* First, skip subdirectories. If we don't find anything, then try again |
129 |
* without skipping subdirs. |
130 |
*/ |
131 |
n = load_dir (style_dir_full_path, &namelist, 1); |
132 |
|
133 |
if (n <= 0) |
134 |
{ |
135 |
n = load_dir (style_dir_full_path, &namelist, 0); |
136 |
only_subdirs = 1; |
137 |
} |
138 |
|
139 |
if (n <= 0) |
140 |
return 0; /* nothing to load. Bye. */ |
141 |
|
142 |
/* Picks a random map. Note that if this is all directories, |
143 |
* we know it won't be able to load, so save a few ticks. |
144 |
* the door handling checks for this failure and handles |
145 |
* it properly. |
146 |
*/ |
147 |
if (difficulty == -1) |
148 |
{ /* pick a random style from this dir. */ |
149 |
if (only_subdirs) |
150 |
style_map = 0; |
151 |
else |
152 |
{ |
153 |
strcat (style_file_path, "/"); |
154 |
strcat (style_file_path, namelist[RANDOM () % n]); |
155 |
style_map = maptile::find_sync (style_file_path); |
156 |
} |
157 |
} |
158 |
else |
159 |
{ /* find the map closest in difficulty */ |
160 |
int min_dist = 32000, min_index = -1; |
161 |
|
162 |
for (i = 0; i < n; i++) |
163 |
{ |
164 |
int dist; |
165 |
char *mfile_name = strrchr (namelist[i], '_') + 1; |
166 |
|
167 |
if ((mfile_name - 1) == NULL) |
168 |
{ /* since there isn't a sequence, */ |
169 |
int q; |
170 |
|
171 |
/*pick one at random to recurse */ |
172 |
style_map = find_style (style_file_path, namelist[RANDOM () % n], difficulty); |
173 |
for (q = 0; q < n; q++) |
174 |
free (namelist[q]); |
175 |
free (namelist); |
176 |
return style_map; |
177 |
} |
178 |
else |
179 |
{ |
180 |
dist = abs (difficulty - atoi (mfile_name)); |
181 |
if (dist < min_dist) |
182 |
{ |
183 |
min_dist = dist; |
184 |
min_index = i; |
185 |
} |
186 |
} |
187 |
} |
188 |
|
189 |
/* presumably now we've found the "best" match for the |
190 |
difficulty. */ |
191 |
strcat (style_file_path, "/"); |
192 |
strcat (style_file_path, namelist[min_index]); |
193 |
style_map = maptile::find_sync (style_file_path); |
194 |
} |
195 |
|
196 |
for (i = 0; i < n; i++) |
197 |
free (namelist[i]); |
198 |
|
199 |
free (namelist); |
200 |
} |
201 |
|
202 |
if (style_map) |
203 |
{ |
204 |
style_map->load_sync (); |
205 |
style_map->deactivate (); |
206 |
} |
207 |
|
208 |
return style_map; |
209 |
|
210 |
} |
211 |
|
212 |
/* picks a random object from a style map. |
213 |
* Redone by MSW so it should be faster and not use static |
214 |
* variables to generate tables. |
215 |
*/ |
216 |
object * |
217 |
pick_random_object (maptile *style) |
218 |
{ |
219 |
/* while returning a null object will result in a crash, that |
220 |
* is actually preferable to an infinite loop. That is because |
221 |
* most servers will automatically restart in case of crash. |
222 |
* Change the logic on getting the random space - shouldn't make |
223 |
* any difference, but this seems clearer to me. |
224 |
*/ |
225 |
for (int i = 1000; --i;) |
226 |
{ |
227 |
object *new_obj = style->at (RANDOM () % style->width, RANDOM () % style->height).bot; |
228 |
|
229 |
if (new_obj) |
230 |
return new_obj->head_ (); |
231 |
} |
232 |
|
233 |
// instead of crashing in the unlikely case, try to return *something* |
234 |
return get_archetype ("blocked"); |
235 |
} |