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 | |
31 | |
|
|
32 | // NAME_MAX may not be defined on POSIX systems |
|
|
33 | #ifndef NAME_MAX |
|
|
34 | # define NAME_MAX 255 |
|
|
35 | #endif |
32 | |
36 | |
33 | static int |
37 | static int |
34 | pointer_strcmp (const void *p1, const void *p2) |
38 | pointer_strcmp (const void *p1, const void *p2) |
35 | { |
39 | { |
36 | const char *s1 = *(const char **) p1; |
40 | const char *s1 = *(const char **) p1; |
… | |
… | |
61 | int entries = 0, entry_size = 0; |
65 | int entries = 0, entry_size = 0; |
62 | char name[NAME_MAX + 1], **rn = NULL; |
66 | char name[NAME_MAX + 1], **rn = NULL; |
63 | struct stat sb; |
67 | struct stat sb; |
64 | |
68 | |
65 | dp = opendir (dir); |
69 | dp = opendir (dir); |
66 | if (dp == NULL) |
70 | if (!dp) |
67 | return -1; |
71 | return -1; |
68 | |
72 | |
69 | while ((d = readdir (dp)) != NULL) |
73 | while ((d = readdir (dp))) |
70 | { |
74 | { |
71 | sprintf (name, "%s/%s", dir, d->d_name); |
75 | sprintf (name, "%s/%s", dir, d->d_name); |
72 | if (skip_dirs) |
76 | if (skip_dirs) |
73 | { |
77 | { |
74 | stat (name, &sb); |
78 | stat (name, &sb); |
75 | if (S_ISDIR (sb.st_mode)) |
79 | if (S_ISDIR (sb.st_mode)) |
76 | { |
|
|
77 | continue; |
80 | continue; |
78 | } |
|
|
79 | } |
81 | } |
80 | |
82 | |
81 | if (entries == entry_size) |
83 | if (entries == entry_size) |
82 | { |
84 | { |
83 | entry_size += 10; |
85 | entry_size += 10; |
… | |
… | |
96 | } |
98 | } |
97 | |
99 | |
98 | maptile * |
100 | maptile * |
99 | find_style (const char *dirname, const char *stylename, int difficulty) |
101 | find_style (const char *dirname, const char *stylename, int difficulty) |
100 | { |
102 | { |
101 | char style_file_path[256]; |
103 | char style_file_path[1024]; |
102 | char style_file_full_path[256]; |
104 | char style_file_full_path[1024]; |
103 | maptile *style_map = NULL; |
105 | maptile *style_map = NULL; |
104 | struct stat file_stat; |
106 | struct stat file_stat; |
105 | int i, only_subdirs = 0; |
107 | int i, only_subdirs = 0; |
106 | |
108 | |
107 | /* if stylename exists, set style_file_path to that file. */ |
109 | /* if stylename exists, set style_file_path to that file. */ |
… | |
… | |
109 | sprintf (style_file_path, "%s/%s", dirname, stylename); |
111 | sprintf (style_file_path, "%s/%s", dirname, stylename); |
110 | else /* otherwise, just use the dirname. We'll pick a random stylefile. */ |
112 | else /* otherwise, just use the dirname. We'll pick a random stylefile. */ |
111 | sprintf (style_file_path, "%s", dirname); |
113 | sprintf (style_file_path, "%s", dirname); |
112 | |
114 | |
113 | /* is what we were given a directory, or a file? */ |
115 | /* is what we were given a directory, or a file? */ |
114 | sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path); |
116 | sprintf (style_file_full_path, "%s/maps%s.map", settings.datadir, style_file_path); |
|
|
117 | |
115 | if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode)) |
118 | if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode)) |
116 | style_map = maptile::load_map_sync (style_file_path); |
119 | style_map = maptile::find_sync (style_file_path); |
117 | |
120 | |
118 | if (!style_map) /* maybe we were given a directory! */ |
121 | if (!style_map) /* maybe we were given a directory! */ |
119 | { |
122 | { |
120 | char **namelist; |
123 | char **namelist; |
121 | int n; |
124 | int n; |
122 | char style_dir_full_path[256]; |
125 | char style_dir_full_path[256]; |
123 | |
126 | |
… | |
… | |
148 | if (only_subdirs) |
151 | if (only_subdirs) |
149 | style_map = 0; |
152 | style_map = 0; |
150 | else |
153 | else |
151 | { |
154 | { |
152 | strcat (style_file_path, "/"); |
155 | strcat (style_file_path, "/"); |
153 | strcat (style_file_path, namelist[RANDOM () % n]); |
156 | strcat (style_file_path, namelist[rndm (n)]); |
154 | style_map = maptile::load_map_sync (style_file_path); |
157 | style_map = maptile::find_sync (style_file_path); |
155 | } |
158 | } |
156 | } |
159 | } |
157 | else |
160 | else |
158 | { /* find the map closest in difficulty */ |
161 | { /* find the map closest in difficulty */ |
159 | int min_dist = 32000, min_index = -1; |
162 | int min_dist = 32000, min_index = -1; |
… | |
… | |
166 | if ((mfile_name - 1) == NULL) |
169 | if ((mfile_name - 1) == NULL) |
167 | { /* since there isn't a sequence, */ |
170 | { /* since there isn't a sequence, */ |
168 | int q; |
171 | int q; |
169 | |
172 | |
170 | /*pick one at random to recurse */ |
173 | /*pick one at random to recurse */ |
171 | style_map = find_style (style_file_path, namelist[RANDOM () % n], difficulty); |
174 | style_map = find_style (style_file_path, namelist[rndm (n)], difficulty); |
172 | for (q = 0; q < n; q++) |
175 | for (q = 0; q < n; q++) |
173 | free (namelist[q]); |
176 | free (namelist[q]); |
174 | free (namelist); |
177 | free (namelist); |
175 | return style_map; |
178 | return style_map; |
176 | } |
179 | } |
… | |
… | |
182 | min_dist = dist; |
185 | min_dist = dist; |
183 | min_index = i; |
186 | min_index = i; |
184 | } |
187 | } |
185 | } |
188 | } |
186 | } |
189 | } |
|
|
190 | |
187 | /* presumably now we've found the "best" match for the |
191 | /* presumably now we've found the "best" match for the |
188 | difficulty. */ |
192 | difficulty. */ |
189 | strcat (style_file_path, "/"); |
193 | strcat (style_file_path, "/"); |
190 | strcat (style_file_path, namelist[min_index]); |
194 | strcat (style_file_path, namelist[min_index]); |
191 | style_map = maptile::load_map_sync (style_file_path); |
195 | style_map = maptile::find_sync (style_file_path); |
192 | } |
196 | } |
193 | |
197 | |
194 | for (i = 0; i < n; i++) |
198 | for (i = 0; i < n; i++) |
195 | free (namelist[i]); |
199 | free (namelist[i]); |
196 | |
200 | |
197 | free (namelist); |
201 | free (namelist); |
198 | } |
202 | } |
199 | |
203 | |
|
|
204 | if (style_map) |
|
|
205 | { |
|
|
206 | style_map->load_sync (); |
|
|
207 | style_map->deactivate (); |
|
|
208 | } |
|
|
209 | |
200 | return style_map; |
210 | return style_map; |
201 | |
|
|
202 | } |
211 | } |
203 | |
|
|
204 | /* picks a random object from a style map. |
|
|
205 | * Redone by MSW so it should be faster and not use static |
|
|
206 | * variables to generate tables. |
|
|
207 | */ |
|
|
208 | object * |
|
|
209 | pick_random_object (maptile *style) |
|
|
210 | { |
|
|
211 | int x, y, limit = 0; |
|
|
212 | object *new_obj; |
|
|
213 | |
|
|
214 | /* while returning a null object will result in a crash, that |
|
|
215 | * is actually preferable to an infinite loop. That is because |
|
|
216 | * most servers will automatically restart in case of crash. |
|
|
217 | * Change the logic on getting the random space - shouldn't make |
|
|
218 | * any difference, but this seems clearer to me. |
|
|
219 | */ |
|
|
220 | do |
|
|
221 | { |
|
|
222 | limit++; |
|
|
223 | x = RANDOM () % style->width; |
|
|
224 | y = RANDOM () % style->height; |
|
|
225 | new_obj = GET_MAP_OB (style, x, y); |
|
|
226 | } |
|
|
227 | while (new_obj == NULL && limit < 1000); |
|
|
228 | |
|
|
229 | if (new_obj->head) |
|
|
230 | return new_obj->head; |
|
|
231 | else |
|
|
232 | return new_obj; |
|
|
233 | } |
|
|
234 | |
|
|