1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * 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 | * 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 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | You should have received a copy of the GNU General Public License |
18 | * 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 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | */ |
23 | */ |
23 | |
|
|
24 | |
24 | |
25 | #include <global.h> |
25 | #include <global.h> |
26 | #include <random_map.h> |
26 | #include <random_map.h> |
27 | #include <dirent.h> |
27 | #include <dirent.h> |
28 | #include <sys/stat.h> |
28 | #include <sys/stat.h> |
29 | #include <unistd.h> |
29 | #include <unistd.h> |
30 | #include "../include/autoconf.h" |
30 | #include "../include/autoconf.h" |
31 | |
|
|
32 | |
31 | |
33 | static int |
32 | static int |
34 | pointer_strcmp (const void *p1, const void *p2) |
33 | pointer_strcmp (const void *p1, const void *p2) |
35 | { |
34 | { |
36 | const char *s1 = *(const char **) p1; |
35 | const char *s1 = *(const char **) p1; |
… | |
… | |
61 | int entries = 0, entry_size = 0; |
60 | int entries = 0, entry_size = 0; |
62 | char name[NAME_MAX + 1], **rn = NULL; |
61 | char name[NAME_MAX + 1], **rn = NULL; |
63 | struct stat sb; |
62 | struct stat sb; |
64 | |
63 | |
65 | dp = opendir (dir); |
64 | dp = opendir (dir); |
66 | if (dp == NULL) |
65 | if (!dp) |
67 | return -1; |
66 | return -1; |
68 | |
67 | |
69 | while ((d = readdir (dp)) != NULL) |
68 | while ((d = readdir (dp))) |
70 | { |
69 | { |
71 | sprintf (name, "%s/%s", dir, d->d_name); |
70 | sprintf (name, "%s/%s", dir, d->d_name); |
72 | if (skip_dirs) |
71 | if (skip_dirs) |
73 | { |
72 | { |
74 | stat (name, &sb); |
73 | stat (name, &sb); |
75 | if (S_ISDIR (sb.st_mode)) |
74 | if (S_ISDIR (sb.st_mode)) |
76 | { |
|
|
77 | continue; |
75 | continue; |
78 | } |
|
|
79 | } |
76 | } |
80 | |
77 | |
81 | if (entries == entry_size) |
78 | if (entries == entry_size) |
82 | { |
79 | { |
83 | entry_size += 10; |
80 | entry_size += 10; |
… | |
… | |
93 | |
90 | |
94 | *namelist = rn; |
91 | *namelist = rn; |
95 | return entries; |
92 | return entries; |
96 | } |
93 | } |
97 | |
94 | |
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 * |
95 | maptile * |
147 | find_style (const char *dirname, const char *stylename, int difficulty) |
96 | find_style (const char *dirname, const char *stylename, int difficulty) |
148 | { |
97 | { |
149 | char style_file_path[256]; |
98 | char style_file_path[1024]; |
150 | char style_file_full_path[256]; |
99 | char style_file_full_path[1024]; |
151 | maptile *style_map = NULL; |
100 | maptile *style_map = NULL; |
152 | struct stat file_stat; |
101 | struct stat file_stat; |
153 | int i, only_subdirs = 0; |
102 | int i, only_subdirs = 0; |
154 | |
103 | |
155 | /* if stylename exists, set style_file_path to that file. */ |
104 | /* if stylename exists, set style_file_path to that file. */ |
… | |
… | |
157 | sprintf (style_file_path, "%s/%s", dirname, stylename); |
106 | sprintf (style_file_path, "%s/%s", dirname, stylename); |
158 | else /* otherwise, just use the dirname. We'll pick a random stylefile. */ |
107 | else /* otherwise, just use the dirname. We'll pick a random stylefile. */ |
159 | sprintf (style_file_path, "%s", dirname); |
108 | sprintf (style_file_path, "%s", dirname); |
160 | |
109 | |
161 | /* is what we were given a directory, or a file? */ |
110 | /* is what we were given a directory, or a file? */ |
162 | sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path); |
111 | sprintf (style_file_full_path, "%s/maps%s.map", settings.datadir, style_file_path); |
|
|
112 | |
163 | if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode)) |
113 | 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); |
114 | style_map = maptile::find_sync (style_file_path); |
166 | } |
115 | |
167 | if (style_map == NULL) /* maybe we were given a directory! */ |
116 | if (!style_map) /* maybe we were given a directory! */ |
168 | { |
117 | { |
169 | char **namelist; |
118 | char **namelist; |
170 | int n; |
119 | int n; |
171 | char style_dir_full_path[256]; |
120 | char style_dir_full_path[256]; |
172 | |
121 | |
… | |
… | |
193 | * it properly. |
142 | * it properly. |
194 | */ |
143 | */ |
195 | if (difficulty == -1) |
144 | if (difficulty == -1) |
196 | { /* pick a random style from this dir. */ |
145 | { /* pick a random style from this dir. */ |
197 | if (only_subdirs) |
146 | if (only_subdirs) |
198 | style_map = NULL; |
147 | style_map = 0; |
199 | else |
148 | else |
200 | { |
149 | { |
201 | strcat (style_file_path, "/"); |
150 | strcat (style_file_path, "/"); |
202 | strcat (style_file_path, namelist[RANDOM () % n]); |
151 | strcat (style_file_path, namelist[rndm (n)]); |
203 | style_map = load_style_map (style_file_path); |
152 | style_map = maptile::find_sync (style_file_path); |
204 | } |
153 | } |
205 | } |
154 | } |
206 | else |
155 | else |
207 | { /* find the map closest in difficulty */ |
156 | { /* find the map closest in difficulty */ |
208 | int min_dist = 32000, min_index = -1; |
157 | int min_dist = 32000, min_index = -1; |
… | |
… | |
215 | if ((mfile_name - 1) == NULL) |
164 | if ((mfile_name - 1) == NULL) |
216 | { /* since there isn't a sequence, */ |
165 | { /* since there isn't a sequence, */ |
217 | int q; |
166 | int q; |
218 | |
167 | |
219 | /*pick one at random to recurse */ |
168 | /*pick one at random to recurse */ |
220 | style_map = find_style (style_file_path, namelist[RANDOM () % n], difficulty); |
169 | style_map = find_style (style_file_path, namelist[rndm (n)], difficulty); |
221 | for (q = 0; q < n; q++) |
170 | for (q = 0; q < n; q++) |
222 | free (namelist[q]); |
171 | free (namelist[q]); |
223 | free (namelist); |
172 | free (namelist); |
224 | return style_map; |
173 | return style_map; |
225 | } |
174 | } |
… | |
… | |
231 | min_dist = dist; |
180 | min_dist = dist; |
232 | min_index = i; |
181 | min_index = i; |
233 | } |
182 | } |
234 | } |
183 | } |
235 | } |
184 | } |
|
|
185 | |
236 | /* presumably now we've found the "best" match for the |
186 | /* presumably now we've found the "best" match for the |
237 | difficulty. */ |
187 | difficulty. */ |
238 | strcat (style_file_path, "/"); |
188 | strcat (style_file_path, "/"); |
239 | strcat (style_file_path, namelist[min_index]); |
189 | strcat (style_file_path, namelist[min_index]); |
240 | style_map = load_style_map (style_file_path); |
190 | style_map = maptile::find_sync (style_file_path); |
241 | } |
191 | } |
|
|
192 | |
242 | for (i = 0; i < n; i++) |
193 | for (i = 0; i < n; i++) |
243 | free (namelist[i]); |
194 | free (namelist[i]); |
|
|
195 | |
244 | free (namelist); |
196 | free (namelist); |
245 | } |
197 | } |
|
|
198 | |
|
|
199 | if (style_map) |
|
|
200 | { |
|
|
201 | style_map->load_sync (); |
|
|
202 | style_map->deactivate (); |
|
|
203 | } |
|
|
204 | |
246 | return style_map; |
205 | return style_map; |
247 | |
206 | |
248 | } |
207 | } |
249 | |
|
|
250 | |
208 | |
251 | /* picks a random object from a style map. |
209 | /* picks a random object from a style map. |
252 | * Redone by MSW so it should be faster and not use static |
210 | * Redone by MSW so it should be faster and not use static |
253 | * variables to generate tables. |
211 | * variables to generate tables. |
254 | */ |
212 | */ |
255 | object * |
213 | object * |
256 | pick_random_object (maptile *style) |
214 | pick_random_object (maptile *style) |
257 | { |
215 | { |
258 | int x, y, limit = 0; |
|
|
259 | object *new_obj; |
|
|
260 | |
|
|
261 | /* while returning a null object will result in a crash, that |
216 | /* while returning a null object will result in a crash, that |
262 | * is actually preferable to an infinite loop. That is because |
217 | * is actually preferable to an infinite loop. That is because |
263 | * most servers will automatically restart in case of crash. |
218 | * most servers will automatically restart in case of crash. |
264 | * Change the logic on getting the random space - shouldn't make |
219 | * Change the logic on getting the random space - shouldn't make |
265 | * any difference, but this seems clearer to me. |
220 | * any difference, but this seems clearer to me. |
266 | */ |
221 | */ |
267 | do |
222 | for (int i = 1000; --i;) |
268 | { |
|
|
269 | limit++; |
|
|
270 | x = RANDOM () % style->width; |
|
|
271 | y = RANDOM () % style->height; |
|
|
272 | new_obj = GET_MAP_OB (style, x, y); |
|
|
273 | } |
223 | { |
274 | while (new_obj == NULL && limit < 1000); |
224 | object *new_obj = style->at (rndm (style->width), rndm (style->height)).bot; |
275 | if (new_obj->head) |
225 | |
|
|
226 | if (new_obj) |
276 | return new_obj->head; |
227 | 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 | { |
228 | } |
293 | next = styles->next; |
229 | |
294 | delete_map (styles); |
230 | // instead of crashing in the unlikely case, try to return *something* |
295 | styles = next; |
231 | return get_archetype ("blocked"); |
296 | style_maps++; |
|
|
297 | } |
|
|
298 | LOG (llevDebug, "free_style_maps: Freed %d maps\n", style_maps); |
|
|
299 | } |
232 | } |