| 1 | |
|
|
| 2 | /* |
1 | /* |
| 3 | * static char *rcsid_style_c = |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
| 4 | * "$Id: style.C,v 1.3 2006/09/10 16:06:37 root Exp $"; |
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
|
|
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
7 | * |
|
|
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
|
|
9 | * it under the terms of the GNU General Public License as published by |
|
|
10 | * the Free Software Foundation, either version 3 of the License, or |
|
|
11 | * (at your option) any later version. |
|
|
12 | * |
|
|
13 | * This program is distributed in the hope that it will be useful, |
|
|
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
16 | * GNU General Public License for more details. |
|
|
17 | * |
|
|
18 | * You should have received a copy of the GNU General Public License |
|
|
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
|
|
20 | * |
|
|
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
| 5 | */ |
22 | */ |
| 6 | |
|
|
| 7 | /* |
|
|
| 8 | CrossFire, A Multiplayer game for X-windows |
|
|
| 9 | |
|
|
| 10 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
|
|
| 11 | Copyright (C) 1992 Frank Tore Johansen |
|
|
| 12 | |
|
|
| 13 | This program is free software; you can redistribute it and/or modify |
|
|
| 14 | it under the terms of the GNU General Public License as published by |
|
|
| 15 | the Free Software Foundation; either version 2 of the License, or |
|
|
| 16 | (at your option) any later version. |
|
|
| 17 | |
|
|
| 18 | This program is distributed in the hope that it will be useful, |
|
|
| 19 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
| 20 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
| 21 | GNU General Public License for more details. |
|
|
| 22 | |
|
|
| 23 | You should have received a copy of the GNU General Public License |
|
|
| 24 | along with this program; if not, write to the Free Software |
|
|
| 25 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
| 26 | |
|
|
| 27 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
|
|
| 28 | */ |
|
|
| 29 | |
|
|
| 30 | |
23 | |
| 31 | #include <global.h> |
24 | #include <global.h> |
| 32 | #include <random_map.h> |
25 | #include <random_map.h> |
| 33 | #ifndef WIN32 /* ---win32 exclude headers */ |
|
|
| 34 | # include <dirent.h> |
26 | #include <dirent.h> |
| 35 | # include <sys/stat.h> |
27 | #include <sys/stat.h> |
| 36 | # include <unistd.h> |
28 | #include <unistd.h> |
| 37 | # include "../include/autoconf.h" |
29 | #include "../include/autoconf.h" |
| 38 | #endif /* win32 */ |
|
|
| 39 | |
30 | |
|
|
31 | // NAME_MAX may not be defined on POSIX systems |
|
|
32 | #ifndef NAME_MAX |
|
|
33 | # define NAME_MAX 255 |
|
|
34 | #endif |
| 40 | |
35 | |
| 41 | static int |
36 | static int |
| 42 | pointer_strcmp (const void *p1, const void *p2) |
37 | pointer_strcmp (const void *p1, const void *p2) |
| 43 | { |
38 | { |
| 44 | const char *s1 = *(const char **) p1; |
39 | const char *s1 = *(const char **) p1; |
| … | |
… | |
| 69 | int entries = 0, entry_size = 0; |
64 | int entries = 0, entry_size = 0; |
| 70 | char name[NAME_MAX + 1], **rn = NULL; |
65 | char name[NAME_MAX + 1], **rn = NULL; |
| 71 | struct stat sb; |
66 | struct stat sb; |
| 72 | |
67 | |
| 73 | dp = opendir (dir); |
68 | dp = opendir (dir); |
| 74 | if (dp == NULL) |
69 | if (!dp) |
| 75 | return -1; |
70 | return -1; |
| 76 | |
71 | |
| 77 | while ((d = readdir (dp)) != NULL) |
72 | while ((d = readdir (dp))) |
| 78 | { |
73 | { |
| 79 | sprintf (name, "%s/%s", dir, d->d_name); |
74 | sprintf (name, "%s/%s", dir, d->d_name); |
| 80 | if (skip_dirs) |
75 | if (skip_dirs) |
| 81 | { |
76 | { |
| 82 | stat (name, &sb); |
77 | stat (name, &sb); |
| 83 | if (S_ISDIR (sb.st_mode)) |
78 | if (S_ISDIR (sb.st_mode)) |
| 84 | { |
|
|
| 85 | continue; |
79 | continue; |
| 86 | } |
|
|
| 87 | } |
80 | } |
| 88 | |
81 | |
| 89 | if (entries == entry_size) |
82 | if (entries == entry_size) |
| 90 | { |
83 | { |
| 91 | entry_size += 10; |
84 | entry_size += 10; |
| 92 | rn = (char **) realloc (rn, sizeof (char *) * entry_size); |
85 | rn = (char **) realloc (rn, sizeof (char *) * entry_size); |
| 93 | } |
86 | } |
| 94 | rn[entries] = strdup_local (d->d_name); |
87 | rn[entries] = strdup (d->d_name); |
| 95 | entries++; |
88 | entries++; |
| 96 | |
89 | |
| 97 | } |
90 | } |
| 98 | (void) closedir (dp); |
91 | (void) closedir (dp); |
| 99 | |
92 | |
| … | |
… | |
| 101 | |
94 | |
| 102 | *namelist = rn; |
95 | *namelist = rn; |
| 103 | return entries; |
96 | return entries; |
| 104 | } |
97 | } |
| 105 | |
98 | |
| 106 | |
99 | maptile * |
| 107 | |
|
|
| 108 | |
|
|
| 109 | |
|
|
| 110 | /* this function loads and returns the map requested. |
|
|
| 111 | * dirname, for example, is "/styles/wallstyles", stylename, is, |
|
|
| 112 | * for example, "castle", difficulty is -1 when difficulty is |
|
|
| 113 | * irrelevant to the style. If dirname is given, but stylename |
|
|
| 114 | * isn't, and difficult is -1, it returns a random style map. |
|
|
| 115 | * Otherwise, it tries to match the difficulty given with a style |
|
|
| 116 | * file, named style_name_# where # is an integer |
|
|
| 117 | */ |
|
|
| 118 | |
|
|
| 119 | /* remove extern, so visible to command_style_map_info function */ |
|
|
| 120 | mapstruct *styles = NULL; |
|
|
| 121 | |
|
|
| 122 | |
|
|
| 123 | mapstruct * |
|
|
| 124 | load_style_map (char *style_name) |
|
|
| 125 | { |
|
|
| 126 | mapstruct *style_map; |
|
|
| 127 | |
|
|
| 128 | /* Given a file. See if its in memory */ |
|
|
| 129 | for (style_map = styles; style_map != NULL; style_map = style_map->next) |
|
|
| 130 | { |
|
|
| 131 | if (!strcmp (style_name, style_map->path)) |
|
|
| 132 | return style_map; |
|
|
| 133 | } |
|
|
| 134 | style_map = load_original_map (style_name, MAP_STYLE); |
|
|
| 135 | /* Remove it from global list, put it on our local list */ |
|
|
| 136 | if (style_map) |
|
|
| 137 | { |
|
|
| 138 | mapstruct *tmp; |
|
|
| 139 | |
|
|
| 140 | if (style_map == first_map) |
|
|
| 141 | first_map = style_map->next; |
|
|
| 142 | else |
|
|
| 143 | { |
|
|
| 144 | for (tmp = first_map; tmp && tmp->next != style_map; tmp = tmp->next); |
|
|
| 145 | if (tmp) |
|
|
| 146 | tmp->next = style_map->next; |
|
|
| 147 | } |
|
|
| 148 | style_map->next = styles; |
|
|
| 149 | styles = style_map; |
|
|
| 150 | } |
|
|
| 151 | return style_map; |
|
|
| 152 | } |
|
|
| 153 | |
|
|
| 154 | mapstruct * |
|
|
| 155 | find_style (const char *dirname, const char *stylename, int difficulty) |
100 | find_style (const char *dirname, const char *stylename, int difficulty) |
| 156 | { |
101 | { |
| 157 | char style_file_path[256]; |
102 | char style_file_path[1024]; |
| 158 | char style_file_full_path[256]; |
103 | char style_file_full_path[1024]; |
| 159 | mapstruct *style_map = NULL; |
104 | maptile *style_map = NULL; |
| 160 | struct stat file_stat; |
105 | struct stat file_stat; |
| 161 | int i, only_subdirs = 0; |
106 | int i, only_subdirs = 0; |
| 162 | |
107 | |
| 163 | /* if stylename exists, set style_file_path to that file. */ |
108 | /* if stylename exists, set style_file_path to that file. */ |
| 164 | if (stylename && strlen (stylename) > 0) |
109 | if (stylename && strlen (stylename) > 0) |
| 165 | sprintf (style_file_path, "%s/%s", dirname, stylename); |
110 | sprintf (style_file_path, "%s/%s", dirname, stylename); |
| 166 | else /* otherwise, just use the dirname. We'll pick a random stylefile. */ |
111 | else /* otherwise, just use the dirname. We'll pick a random stylefile. */ |
| 167 | sprintf (style_file_path, "%s", dirname); |
112 | sprintf (style_file_path, "%s", dirname); |
| 168 | |
113 | |
| 169 | /* is what we were given a directory, or a file? */ |
114 | /* is what we were given a directory, or a file? */ |
| 170 | sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path); |
115 | sprintf (style_file_full_path, "%s/maps%s.map", settings.datadir, style_file_path); |
|
|
116 | |
| 171 | if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode)) |
117 | if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode)) |
| 172 | { |
|
|
| 173 | style_map = load_style_map (style_file_path); |
118 | style_map = maptile::find_sync (style_file_path); |
| 174 | } |
119 | |
| 175 | if (style_map == NULL) /* maybe we were given a directory! */ |
120 | if (!style_map) /* maybe we were given a directory! */ |
| 176 | { |
121 | { |
| 177 | char **namelist; |
122 | char **namelist; |
| 178 | int n; |
123 | int n; |
| 179 | char style_dir_full_path[256]; |
124 | char style_dir_full_path[256]; |
| 180 | |
125 | |
| … | |
… | |
| 201 | * it properly. |
146 | * it properly. |
| 202 | */ |
147 | */ |
| 203 | if (difficulty == -1) |
148 | if (difficulty == -1) |
| 204 | { /* pick a random style from this dir. */ |
149 | { /* pick a random style from this dir. */ |
| 205 | if (only_subdirs) |
150 | if (only_subdirs) |
| 206 | style_map = NULL; |
151 | style_map = 0; |
| 207 | else |
152 | else |
| 208 | { |
153 | { |
| 209 | strcat (style_file_path, "/"); |
154 | strcat (style_file_path, "/"); |
| 210 | strcat (style_file_path, namelist[RANDOM () % n]); |
155 | strcat (style_file_path, namelist[rndm (n)]); |
| 211 | style_map = load_style_map (style_file_path); |
156 | style_map = maptile::find_sync (style_file_path); |
| 212 | } |
157 | } |
| 213 | } |
158 | } |
| 214 | else |
159 | else |
| 215 | { /* find the map closest in difficulty */ |
160 | { /* find the map closest in difficulty */ |
| 216 | int min_dist = 32000, min_index = -1; |
161 | int min_dist = 32000, min_index = -1; |
| … | |
… | |
| 223 | if ((mfile_name - 1) == NULL) |
168 | if ((mfile_name - 1) == NULL) |
| 224 | { /* since there isn't a sequence, */ |
169 | { /* since there isn't a sequence, */ |
| 225 | int q; |
170 | int q; |
| 226 | |
171 | |
| 227 | /*pick one at random to recurse */ |
172 | /*pick one at random to recurse */ |
| 228 | style_map = find_style (style_file_path, namelist[RANDOM () % n], difficulty); |
173 | style_map = find_style (style_file_path, namelist[rndm (n)], difficulty); |
| 229 | for (q = 0; q < n; q++) |
174 | for (q = 0; q < n; q++) |
| 230 | free (namelist[q]); |
175 | free (namelist[q]); |
| 231 | free (namelist); |
176 | free (namelist); |
| 232 | return style_map; |
177 | return style_map; |
| 233 | } |
178 | } |
| … | |
… | |
| 239 | min_dist = dist; |
184 | min_dist = dist; |
| 240 | min_index = i; |
185 | min_index = i; |
| 241 | } |
186 | } |
| 242 | } |
187 | } |
| 243 | } |
188 | } |
|
|
189 | |
| 244 | /* presumably now we've found the "best" match for the |
190 | /* presumably now we've found the "best" match for the |
| 245 | difficulty. */ |
191 | difficulty. */ |
| 246 | strcat (style_file_path, "/"); |
192 | strcat (style_file_path, "/"); |
| 247 | strcat (style_file_path, namelist[min_index]); |
193 | strcat (style_file_path, namelist[min_index]); |
| 248 | style_map = load_style_map (style_file_path); |
194 | style_map = maptile::find_sync (style_file_path); |
| 249 | } |
195 | } |
|
|
196 | |
| 250 | for (i = 0; i < n; i++) |
197 | for (i = 0; i < n; i++) |
| 251 | free (namelist[i]); |
198 | free (namelist[i]); |
|
|
199 | |
| 252 | free (namelist); |
200 | free (namelist); |
| 253 | } |
201 | } |
|
|
202 | |
|
|
203 | if (style_map) |
|
|
204 | { |
|
|
205 | style_map->load_sync (); |
|
|
206 | style_map->deactivate (); |
|
|
207 | } |
|
|
208 | |
| 254 | return style_map; |
209 | return style_map; |
| 255 | |
|
|
| 256 | } |
210 | } |
| 257 | |
|
|
| 258 | |
|
|
| 259 | /* picks a random object from a style map. |
|
|
| 260 | * Redone by MSW so it should be faster and not use static |
|
|
| 261 | * variables to generate tables. |
|
|
| 262 | */ |
|
|
| 263 | object * |
|
|
| 264 | pick_random_object (mapstruct *style) |
|
|
| 265 | { |
|
|
| 266 | int x, y, limit = 0; |
|
|
| 267 | object *new_obj; |
|
|
| 268 | |
|
|
| 269 | /* while returning a null object will result in a crash, that |
|
|
| 270 | * is actually preferable to an infinite loop. That is because |
|
|
| 271 | * most servers will automatically restart in case of crash. |
|
|
| 272 | * Change the logic on getting the random space - shouldn't make |
|
|
| 273 | * any difference, but this seems clearer to me. |
|
|
| 274 | */ |
|
|
| 275 | do |
|
|
| 276 | { |
|
|
| 277 | limit++; |
|
|
| 278 | x = RANDOM () % MAP_WIDTH (style); |
|
|
| 279 | y = RANDOM () % MAP_HEIGHT (style); |
|
|
| 280 | new_obj = get_map_ob (style, x, y); |
|
|
| 281 | } |
|
|
| 282 | while (new_obj == NULL && limit < 1000); |
|
|
| 283 | if (new_obj->head) |
|
|
| 284 | return new_obj->head; |
|
|
| 285 | else |
|
|
| 286 | return new_obj; |
|
|
| 287 | } |
|
|
| 288 | |
|
|
| 289 | |
|
|
| 290 | void |
|
|
| 291 | free_style_maps (void) |
|
|
| 292 | { |
|
|
| 293 | mapstruct *next; |
|
|
| 294 | int style_maps = 0; |
|
|
| 295 | |
|
|
| 296 | /* delete_map will try to free it from the linked list, |
|
|
| 297 | * but won't find it, so we need to do it ourselves |
|
|
| 298 | */ |
|
|
| 299 | while (styles) |
|
|
| 300 | { |
|
|
| 301 | next = styles->next; |
|
|
| 302 | delete_map (styles); |
|
|
| 303 | styles = next; |
|
|
| 304 | style_maps++; |
|
|
| 305 | } |
|
|
| 306 | LOG (llevDebug, "free_style_maps: Freed %d maps\n", style_maps); |
|
|
| 307 | } |
|
|
