ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/random_maps/style.C
(Generate patch)

Comparing deliantra/server/random_maps/style.C (file contents):
Revision 1.5 by root, Sat Sep 16 22:24:13 2006 UTC vs.
Revision 1.25 by root, Mon Jun 4 13:04:00 2007 UTC

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#ifndef WIN32 /* ---win32 exclude headers */
28# include <dirent.h> 27#include <dirent.h>
29# include <sys/stat.h> 28#include <sys/stat.h>
30# include <unistd.h> 29#include <unistd.h>
31# include "../include/autoconf.h" 30#include "../include/autoconf.h"
32#endif /* win32 */
33 31
32// NAME_MAX may not be defined on POSIX systems
33#ifndef NAME_MAX
34# define NAME_MAX 255
35#endif
34 36
35static int 37static int
36pointer_strcmp (const void *p1, const void *p2) 38pointer_strcmp (const void *p1, const void *p2)
37{ 39{
38 const char *s1 = *(const char **) p1; 40 const char *s1 = *(const char **) p1;
… …
63 int entries = 0, entry_size = 0; 65 int entries = 0, entry_size = 0;
64 char name[NAME_MAX + 1], **rn = NULL; 66 char name[NAME_MAX + 1], **rn = NULL;
65 struct stat sb; 67 struct stat sb;
66 68
67 dp = opendir (dir); 69 dp = opendir (dir);
68 if (dp == NULL) 70 if (!dp)
69 return -1; 71 return -1;
70 72
71 while ((d = readdir (dp)) != NULL) 73 while ((d = readdir (dp)))
72 { 74 {
73 sprintf (name, "%s/%s", dir, d->d_name); 75 sprintf (name, "%s/%s", dir, d->d_name);
74 if (skip_dirs) 76 if (skip_dirs)
75 { 77 {
76 stat (name, &sb); 78 stat (name, &sb);
77 if (S_ISDIR (sb.st_mode)) 79 if (S_ISDIR (sb.st_mode))
78 {
79 continue; 80 continue;
80 }
81 } 81 }
82 82
83 if (entries == entry_size) 83 if (entries == entry_size)
84 { 84 {
85 entry_size += 10; 85 entry_size += 10;
86 rn = (char **) realloc (rn, sizeof (char *) * entry_size); 86 rn = (char **) realloc (rn, sizeof (char *) * entry_size);
87 } 87 }
88 rn[entries] = strdup_local (d->d_name); 88 rn[entries] = strdup (d->d_name);
89 entries++; 89 entries++;
90 90
91 } 91 }
92 (void) closedir (dp); 92 (void) closedir (dp);
93 93
… …
95 95
96 *namelist = rn; 96 *namelist = rn;
97 return entries; 97 return entries;
98} 98}
99 99
100
101
102
103
104/* this function loads and returns the map requested.
105 * dirname, for example, is "/styles/wallstyles", stylename, is,
106 * for example, "castle", difficulty is -1 when difficulty is
107 * irrelevant to the style. If dirname is given, but stylename
108 * isn't, and difficult is -1, it returns a random style map.
109 * Otherwise, it tries to match the difficulty given with a style
110 * file, named style_name_# where # is an integer
111 */
112
113/* remove extern, so visible to command_style_map_info function */
114maptile *styles = NULL;
115
116
117maptile *
118load_style_map (char *style_name)
119{
120 maptile *style_map;
121
122 /* Given a file. See if its in memory */
123 for (style_map = styles; style_map != NULL; style_map = style_map->next)
124 {
125 if (!strcmp (style_name, style_map->path))
126 return style_map;
127 }
128 style_map = load_original_map (style_name, MAP_STYLE);
129 /* Remove it from global list, put it on our local list */
130 if (style_map)
131 {
132 maptile *tmp;
133
134 if (style_map == first_map)
135 first_map = style_map->next;
136 else
137 {
138 for (tmp = first_map; tmp && tmp->next != style_map; tmp = tmp->next);
139 if (tmp)
140 tmp->next = style_map->next;
141 }
142 style_map->next = styles;
143 styles = style_map;
144 }
145 return style_map;
146}
147
148maptile * 100maptile *
149find_style (const char *dirname, const char *stylename, int difficulty) 101find_style (const char *dirname, const char *stylename, int difficulty)
150{ 102{
151 char style_file_path[256]; 103 char style_file_path[1024];
152 char style_file_full_path[256]; 104 char style_file_full_path[1024];
153 maptile *style_map = NULL; 105 maptile *style_map = NULL;
154 struct stat file_stat; 106 struct stat file_stat;
155 int i, only_subdirs = 0; 107 int i, only_subdirs = 0;
156 108
157 /* if stylename exists, set style_file_path to that file. */ 109 /* if stylename exists, set style_file_path to that file. */
… …
159 sprintf (style_file_path, "%s/%s", dirname, stylename); 111 sprintf (style_file_path, "%s/%s", dirname, stylename);
160 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. */
161 sprintf (style_file_path, "%s", dirname); 113 sprintf (style_file_path, "%s", dirname);
162 114
163 /* is what we were given a directory, or a file? */ 115 /* is what we were given a directory, or a file? */
164 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
165 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))
166 {
167 style_map = load_style_map (style_file_path); 119 style_map = maptile::find_sync (style_file_path);
168 } 120
169 if (style_map == NULL) /* maybe we were given a directory! */ 121 if (!style_map) /* maybe we were given a directory! */
170 { 122 {
171 char **namelist; 123 char **namelist;
172 int n; 124 int n;
173 char style_dir_full_path[256]; 125 char style_dir_full_path[256];
174 126
… …
195 * it properly. 147 * it properly.
196 */ 148 */
197 if (difficulty == -1) 149 if (difficulty == -1)
198 { /* pick a random style from this dir. */ 150 { /* pick a random style from this dir. */
199 if (only_subdirs) 151 if (only_subdirs)
200 style_map = NULL; 152 style_map = 0;
201 else 153 else
202 { 154 {
203 strcat (style_file_path, "/"); 155 strcat (style_file_path, "/");
204 strcat (style_file_path, namelist[RANDOM () % n]); 156 strcat (style_file_path, namelist[rndm (n)]);
205 style_map = load_style_map (style_file_path); 157 style_map = maptile::find_sync (style_file_path);
206 } 158 }
207 } 159 }
208 else 160 else
209 { /* find the map closest in difficulty */ 161 { /* find the map closest in difficulty */
210 int min_dist = 32000, min_index = -1; 162 int min_dist = 32000, min_index = -1;
… …
217 if ((mfile_name - 1) == NULL) 169 if ((mfile_name - 1) == NULL)
218 { /* since there isn't a sequence, */ 170 { /* since there isn't a sequence, */
219 int q; 171 int q;
220 172
221 /*pick one at random to recurse */ 173 /*pick one at random to recurse */
222 style_map = find_style (style_file_path, namelist[RANDOM () % n], difficulty); 174 style_map = find_style (style_file_path, namelist[rndm (n)], difficulty);
223 for (q = 0; q < n; q++) 175 for (q = 0; q < n; q++)
224 free (namelist[q]); 176 free (namelist[q]);
225 free (namelist); 177 free (namelist);
226 return style_map; 178 return style_map;
227 } 179 }
… …
233 min_dist = dist; 185 min_dist = dist;
234 min_index = i; 186 min_index = i;
235 } 187 }
236 } 188 }
237 } 189 }
190
238 /* presumably now we've found the "best" match for the 191 /* presumably now we've found the "best" match for the
239 difficulty. */ 192 difficulty. */
240 strcat (style_file_path, "/"); 193 strcat (style_file_path, "/");
241 strcat (style_file_path, namelist[min_index]); 194 strcat (style_file_path, namelist[min_index]);
242 style_map = load_style_map (style_file_path); 195 style_map = maptile::find_sync (style_file_path);
243 } 196 }
197
244 for (i = 0; i < n; i++) 198 for (i = 0; i < n; i++)
245 free (namelist[i]); 199 free (namelist[i]);
200
246 free (namelist); 201 free (namelist);
247 } 202 }
203
204 if (style_map)
205 {
206 style_map->load_sync ();
207 style_map->deactivate ();
208 }
209
248 return style_map; 210 return style_map;
249
250} 211}
251
252
253/* picks a random object from a style map.
254 * Redone by MSW so it should be faster and not use static
255 * variables to generate tables.
256 */
257object *
258pick_random_object (maptile *style)
259{
260 int x, y, limit = 0;
261 object *new_obj;
262
263 /* while returning a null object will result in a crash, that
264 * is actually preferable to an infinite loop. That is because
265 * most servers will automatically restart in case of crash.
266 * Change the logic on getting the random space - shouldn't make
267 * any difference, but this seems clearer to me.
268 */
269 do
270 {
271 limit++;
272 x = RANDOM () % MAP_WIDTH (style);
273 y = RANDOM () % MAP_HEIGHT (style);
274 new_obj = get_map_ob (style, x, y);
275 }
276 while (new_obj == NULL && limit < 1000);
277 if (new_obj->head)
278 return new_obj->head;
279 else
280 return new_obj;
281}
282
283
284void
285free_style_maps (void)
286{
287 maptile *next;
288 int style_maps = 0;
289
290 /* delete_map will try to free it from the linked list,
291 * but won't find it, so we need to do it ourselves
292 */
293 while (styles)
294 {
295 next = styles->next;
296 delete_map (styles);
297 styles = next;
298 style_maps++;
299 }
300 LOG (llevDebug, "free_style_maps: Freed %d maps\n", style_maps);
301}

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines