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.3 by root, Sun Sep 10 16:06:37 2006 UTC vs.
Revision 1.19 by root, Thu Jan 4 16:19:32 2007 UTC

1
2/*
3 * static char *rcsid_style_c =
4 * "$Id: style.C,v 1.3 2006/09/10 16:06:37 root Exp $";
5 */
6 1
7/* 2/*
8 CrossFire, A Multiplayer game for X-windows 3 CrossFire, A Multiplayer game for X-windows
9 4
10 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 Copyright (C) 2002 Mark Wedel & Crossfire Development Team
… …
22 17
23 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
24 along with this program; if not, write to the Free Software 19 along with this program; if not, write to the Free Software
25 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
26 21
27 The authors can be reached via e-mail at crossfire-devel@real-time.com 22 The authors can be reached via e-mail at <crossfire@schmorp.de>
28*/ 23*/
29
30 24
31#include <global.h> 25#include <global.h>
32#include <random_map.h> 26#include <random_map.h>
33#ifndef WIN32 /* ---win32 exclude headers */
34# include <dirent.h> 27#include <dirent.h>
35# include <sys/stat.h> 28#include <sys/stat.h>
36# include <unistd.h> 29#include <unistd.h>
37# include "../include/autoconf.h" 30#include "../include/autoconf.h"
38#endif /* win32 */
39
40 31
41static int 32static int
42pointer_strcmp (const void *p1, const void *p2) 33pointer_strcmp (const void *p1, const void *p2)
43{ 34{
44 const char *s1 = *(const char **) p1; 35 const char *s1 = *(const char **) p1;
… …
89 if (entries == entry_size) 80 if (entries == entry_size)
90 { 81 {
91 entry_size += 10; 82 entry_size += 10;
92 rn = (char **) realloc (rn, sizeof (char *) * entry_size); 83 rn = (char **) realloc (rn, sizeof (char *) * entry_size);
93 } 84 }
94 rn[entries] = strdup_local (d->d_name); 85 rn[entries] = strdup (d->d_name);
95 entries++; 86 entries++;
96 87
97 } 88 }
98 (void) closedir (dp); 89 (void) closedir (dp);
99 90
… …
101 92
102 *namelist = rn; 93 *namelist = rn;
103 return entries; 94 return entries;
104} 95}
105 96
106 97maptile *
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 */
120mapstruct *styles = NULL;
121
122
123mapstruct *
124load_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
154mapstruct *
155find_style (const char *dirname, const char *stylename, int difficulty) 98find_style (const char *dirname, const char *stylename, int difficulty)
156{ 99{
157 char style_file_path[256]; 100 char style_file_path[1024];
158 char style_file_full_path[256]; 101 char style_file_full_path[1024];
159 mapstruct *style_map = NULL; 102 maptile *style_map = NULL;
160 struct stat file_stat; 103 struct stat file_stat;
161 int i, only_subdirs = 0; 104 int i, only_subdirs = 0;
162 105
163 /* if stylename exists, set style_file_path to that file. */ 106 /* if stylename exists, set style_file_path to that file. */
164 if (stylename && strlen (stylename) > 0) 107 if (stylename && strlen (stylename) > 0)
… …
166 else /* otherwise, just use the dirname. We'll pick a random stylefile. */ 109 else /* otherwise, just use the dirname. We'll pick a random stylefile. */
167 sprintf (style_file_path, "%s", dirname); 110 sprintf (style_file_path, "%s", dirname);
168 111
169 /* is what we were given a directory, or a file? */ 112 /* is what we were given a directory, or a file? */
170 sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path); 113 sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path);
114
171 if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode)) 115 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); 116 style_map = maptile::find_sync (style_file_path);
174 } 117
175 if (style_map == NULL) /* maybe we were given a directory! */ 118 if (!style_map) /* maybe we were given a directory! */
176 { 119 {
177 char **namelist; 120 char **namelist;
178 int n; 121 int n;
179 char style_dir_full_path[256]; 122 char style_dir_full_path[256];
180 123
… …
201 * it properly. 144 * it properly.
202 */ 145 */
203 if (difficulty == -1) 146 if (difficulty == -1)
204 { /* pick a random style from this dir. */ 147 { /* pick a random style from this dir. */
205 if (only_subdirs) 148 if (only_subdirs)
206 style_map = NULL; 149 style_map = 0;
207 else 150 else
208 { 151 {
209 strcat (style_file_path, "/"); 152 strcat (style_file_path, "/");
210 strcat (style_file_path, namelist[RANDOM () % n]); 153 strcat (style_file_path, namelist[RANDOM () % n]);
211 style_map = load_style_map (style_file_path); 154 style_map = maptile::find_sync (style_file_path);
212 } 155 }
213 } 156 }
214 else 157 else
215 { /* find the map closest in difficulty */ 158 { /* find the map closest in difficulty */
216 int min_dist = 32000, min_index = -1; 159 int min_dist = 32000, min_index = -1;
… …
239 min_dist = dist; 182 min_dist = dist;
240 min_index = i; 183 min_index = i;
241 } 184 }
242 } 185 }
243 } 186 }
187
244 /* presumably now we've found the "best" match for the 188 /* presumably now we've found the "best" match for the
245 difficulty. */ 189 difficulty. */
246 strcat (style_file_path, "/"); 190 strcat (style_file_path, "/");
247 strcat (style_file_path, namelist[min_index]); 191 strcat (style_file_path, namelist[min_index]);
248 style_map = load_style_map (style_file_path); 192 style_map = maptile::find_sync (style_file_path);
249 } 193 }
194
250 for (i = 0; i < n; i++) 195 for (i = 0; i < n; i++)
251 free (namelist[i]); 196 free (namelist[i]);
197
252 free (namelist); 198 free (namelist);
253 } 199 }
200
201 if (style_map)
202 {
203 style_map->load_sync ();
204 style_map->deactivate ();
205 }
206
254 return style_map; 207 return style_map;
255 208
256} 209}
257
258 210
259/* picks a random object from a style map. 211/* picks a random object from a style map.
260 * Redone by MSW so it should be faster and not use static 212 * Redone by MSW so it should be faster and not use static
261 * variables to generate tables. 213 * variables to generate tables.
262 */ 214 */
263object * 215object *
264pick_random_object (mapstruct *style) 216pick_random_object (maptile *style)
265{ 217{
266 int x, y, limit = 0;
267 object *new_obj;
268
269 /* while returning a null object will result in a crash, that 218 /* while returning a null object will result in a crash, that
270 * is actually preferable to an infinite loop. That is because 219 * is actually preferable to an infinite loop. That is because
271 * most servers will automatically restart in case of crash. 220 * most servers will automatically restart in case of crash.
272 * Change the logic on getting the random space - shouldn't make 221 * Change the logic on getting the random space - shouldn't make
273 * any difference, but this seems clearer to me. 222 * any difference, but this seems clearer to me.
274 */ 223 */
275 do 224 for (int i = 1000; --i;)
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 } 225 {
282 while (new_obj == NULL && limit < 1000); 226 object *new_obj = style->at (RANDOM () % style->width, RANDOM () % style->height).bot;
283 if (new_obj->head) 227
228 if (new_obj)
284 return new_obj->head; 229 return new_obj->head_ ();
285 else
286 return new_obj;
287}
288
289
290void
291free_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 { 230 }
301 next = styles->next; 231
302 delete_map (styles); 232 // instead of crashing in the unlikely case, try to return *something*
303 styles = next; 233 return get_archetype ("blocked");
304 style_maps++;
305 }
306 LOG (llevDebug, "free_style_maps: Freed %d maps\n", style_maps);
307} 234}

Diff Legend

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