| … | |
… | |
| 18 | along with this program; if not, write to the Free Software |
18 | along with this program; if not, write to the Free Software |
| 19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
| 20 | |
20 | |
| 21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
| 22 | */ |
22 | */ |
| 23 | |
|
|
| 24 | |
23 | |
| 25 | #include <global.h> |
24 | #include <global.h> |
| 26 | #include <random_map.h> |
25 | #include <random_map.h> |
| 27 | #include <dirent.h> |
26 | #include <dirent.h> |
| 28 | #include <sys/stat.h> |
27 | #include <sys/stat.h> |
| 29 | #include <unistd.h> |
28 | #include <unistd.h> |
| 30 | #include "../include/autoconf.h" |
29 | #include "../include/autoconf.h" |
| 31 | |
|
|
| 32 | |
30 | |
| 33 | static int |
31 | static int |
| 34 | pointer_strcmp (const void *p1, const void *p2) |
32 | pointer_strcmp (const void *p1, const void *p2) |
| 35 | { |
33 | { |
| 36 | const char *s1 = *(const char **) p1; |
34 | const char *s1 = *(const char **) p1; |
| … | |
… | |
| 93 | |
91 | |
| 94 | *namelist = rn; |
92 | *namelist = rn; |
| 95 | return entries; |
93 | return entries; |
| 96 | } |
94 | } |
| 97 | |
95 | |
| 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 | maptile * |
|
|
| 112 | load_style_map (char *style_name) |
|
|
| 113 | { |
|
|
| 114 | maptile *style_map = maptile::find_map (style_name, 0); |
|
|
| 115 | style_map->load (); |
|
|
| 116 | return style_map; |
|
|
| 117 | } |
|
|
| 118 | |
|
|
| 119 | maptile * |
96 | maptile * |
| 120 | find_style (const char *dirname, const char *stylename, int difficulty) |
97 | find_style (const char *dirname, const char *stylename, int difficulty) |
| 121 | { |
98 | { |
| 122 | char style_file_path[256]; |
99 | char style_file_path[256]; |
| 123 | char style_file_full_path[256]; |
100 | char style_file_full_path[256]; |
| … | |
… | |
| 131 | else /* otherwise, just use the dirname. We'll pick a random stylefile. */ |
108 | else /* otherwise, just use the dirname. We'll pick a random stylefile. */ |
| 132 | sprintf (style_file_path, "%s", dirname); |
109 | sprintf (style_file_path, "%s", dirname); |
| 133 | |
110 | |
| 134 | /* is what we were given a directory, or a file? */ |
111 | /* is what we were given a directory, or a file? */ |
| 135 | sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path); |
112 | sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path); |
|
|
113 | |
| 136 | if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode)) |
114 | if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode)) |
| 137 | { |
|
|
| 138 | style_map = load_style_map (style_file_path); |
115 | style_map = maptile::load_map_sync (style_file_path); |
| 139 | } |
116 | |
| 140 | if (style_map == NULL) /* maybe we were given a directory! */ |
117 | if (!style_map) /* maybe we were given a directory! */ |
| 141 | { |
118 | { |
| 142 | char **namelist; |
119 | char **namelist; |
| 143 | int n; |
120 | int n; |
| 144 | char style_dir_full_path[256]; |
121 | char style_dir_full_path[256]; |
| 145 | |
122 | |
| … | |
… | |
| 166 | * it properly. |
143 | * it properly. |
| 167 | */ |
144 | */ |
| 168 | if (difficulty == -1) |
145 | if (difficulty == -1) |
| 169 | { /* pick a random style from this dir. */ |
146 | { /* pick a random style from this dir. */ |
| 170 | if (only_subdirs) |
147 | if (only_subdirs) |
| 171 | style_map = NULL; |
148 | style_map = 0; |
| 172 | else |
149 | else |
| 173 | { |
150 | { |
| 174 | strcat (style_file_path, "/"); |
151 | strcat (style_file_path, "/"); |
| 175 | strcat (style_file_path, namelist[RANDOM () % n]); |
152 | strcat (style_file_path, namelist[RANDOM () % n]); |
| 176 | style_map = load_style_map (style_file_path); |
153 | style_map = maptile::load_map_sync (style_file_path); |
| 177 | } |
154 | } |
| 178 | } |
155 | } |
| 179 | else |
156 | else |
| 180 | { /* find the map closest in difficulty */ |
157 | { /* find the map closest in difficulty */ |
| 181 | int min_dist = 32000, min_index = -1; |
158 | int min_dist = 32000, min_index = -1; |
| … | |
… | |
| 204 | min_dist = dist; |
181 | min_dist = dist; |
| 205 | min_index = i; |
182 | min_index = i; |
| 206 | } |
183 | } |
| 207 | } |
184 | } |
| 208 | } |
185 | } |
|
|
186 | |
| 209 | /* presumably now we've found the "best" match for the |
187 | /* presumably now we've found the "best" match for the |
| 210 | difficulty. */ |
188 | difficulty. */ |
| 211 | strcat (style_file_path, "/"); |
189 | strcat (style_file_path, "/"); |
| 212 | strcat (style_file_path, namelist[min_index]); |
190 | strcat (style_file_path, namelist[min_index]); |
| 213 | style_map = load_style_map (style_file_path); |
191 | style_map = maptile::load_map_sync (style_file_path); |
| 214 | } |
192 | } |
|
|
193 | |
| 215 | for (i = 0; i < n; i++) |
194 | for (i = 0; i < n; i++) |
| 216 | free (namelist[i]); |
195 | free (namelist[i]); |
|
|
196 | |
| 217 | free (namelist); |
197 | free (namelist); |
| 218 | } |
198 | } |
|
|
199 | |
|
|
200 | if (style_map) |
|
|
201 | style_map->deactivate (); |
|
|
202 | |
| 219 | return style_map; |
203 | return style_map; |
| 220 | |
204 | |
| 221 | } |
205 | } |
| 222 | |
206 | |
| 223 | /* picks a random object from a style map. |
207 | /* picks a random object from a style map. |
| … | |
… | |
| 225 | * variables to generate tables. |
209 | * variables to generate tables. |
| 226 | */ |
210 | */ |
| 227 | object * |
211 | object * |
| 228 | pick_random_object (maptile *style) |
212 | pick_random_object (maptile *style) |
| 229 | { |
213 | { |
| 230 | int x, y, limit = 0; |
|
|
| 231 | object *new_obj; |
|
|
| 232 | |
|
|
| 233 | /* while returning a null object will result in a crash, that |
214 | /* while returning a null object will result in a crash, that |
| 234 | * is actually preferable to an infinite loop. That is because |
215 | * is actually preferable to an infinite loop. That is because |
| 235 | * most servers will automatically restart in case of crash. |
216 | * most servers will automatically restart in case of crash. |
| 236 | * Change the logic on getting the random space - shouldn't make |
217 | * Change the logic on getting the random space - shouldn't make |
| 237 | * any difference, but this seems clearer to me. |
218 | * any difference, but this seems clearer to me. |
| 238 | */ |
219 | */ |
| 239 | do |
220 | for (int i = 1000; --i; ) |
| 240 | { |
221 | { |
| 241 | limit++; |
222 | object *new_obj = style->at (RANDOM () % style->width, RANDOM () % style->height).bot; |
| 242 | x = RANDOM () % style->width; |
223 | |
| 243 | y = RANDOM () % style->height; |
224 | if (new_obj) |
| 244 | new_obj = GET_MAP_OB (style, x, y); |
225 | return new_obj->head_ (); |
| 245 | } |
226 | } |
| 246 | while (new_obj == NULL && limit < 1000); |
|
|
| 247 | |
227 | |
| 248 | if (new_obj->head) |
228 | // instead of crashing in the unlikely case, try to return *something* |
| 249 | return new_obj->head; |
229 | return get_archetype ("blocked"); |
| 250 | else |
|
|
| 251 | return new_obj; |
|
|
| 252 | } |
230 | } |
| 253 | |
231 | |
