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.10 by root, Wed Dec 27 09:28:02 2006 UTC vs.
Revision 1.23 by root, Wed Feb 14 01:33:24 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#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
33static int 32static int
34pointer_strcmp (const void *p1, const void *p2) 33pointer_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 */
112maptile *styles = NULL;
113
114
115maptile *
116load_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 if (!strcmp (style_name, style_map->path))
123 return style_map;
124
125 style_map = load_original_map (style_name, MAP_STYLE);
126
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
141 style_map->next = styles;
142 styles = style_map;
143 }
144
145 return style_map;
146}
147
148maptile * 95maptile *
149find_style (const char *dirname, const char *stylename, int difficulty) 96find_style (const char *dirname, const char *stylename, int difficulty)
150{ 97{
151 char style_file_path[256]; 98 char style_file_path[1024];
152 char style_file_full_path[256]; 99 char style_file_full_path[1024];
153 maptile *style_map = NULL; 100 maptile *style_map = NULL;
154 struct stat file_stat; 101 struct stat file_stat;
155 int i, only_subdirs = 0; 102 int i, only_subdirs = 0;
156 103
157 /* if stylename exists, set style_file_path to that file. */ 104 /* if stylename exists, set style_file_path to that file. */
… …
159 sprintf (style_file_path, "%s/%s", dirname, stylename); 106 sprintf (style_file_path, "%s/%s", dirname, stylename);
160 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. */
161 sprintf (style_file_path, "%s", dirname); 108 sprintf (style_file_path, "%s", dirname);
162 109
163 /* is what we were given a directory, or a file? */ 110 /* is what we were given a directory, or a file? */
164 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
165 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))
166 {
167 style_map = load_style_map (style_file_path); 114 style_map = maptile::find_sync (style_file_path);
168 } 115
169 if (style_map == NULL) /* maybe we were given a directory! */ 116 if (!style_map) /* maybe we were given a directory! */
170 { 117 {
171 char **namelist; 118 char **namelist;
172 int n; 119 int n;
173 char style_dir_full_path[256]; 120 char style_dir_full_path[256];
174 121
… …
195 * it properly. 142 * it properly.
196 */ 143 */
197 if (difficulty == -1) 144 if (difficulty == -1)
198 { /* pick a random style from this dir. */ 145 { /* pick a random style from this dir. */
199 if (only_subdirs) 146 if (only_subdirs)
200 style_map = NULL; 147 style_map = 0;
201 else 148 else
202 { 149 {
203 strcat (style_file_path, "/"); 150 strcat (style_file_path, "/");
204 strcat (style_file_path, namelist[RANDOM () % n]); 151 strcat (style_file_path, namelist[rndm (n)]);
205 style_map = load_style_map (style_file_path); 152 style_map = maptile::find_sync (style_file_path);
206 } 153 }
207 } 154 }
208 else 155 else
209 { /* find the map closest in difficulty */ 156 { /* find the map closest in difficulty */
210 int min_dist = 32000, min_index = -1; 157 int min_dist = 32000, min_index = -1;
… …
217 if ((mfile_name - 1) == NULL) 164 if ((mfile_name - 1) == NULL)
218 { /* since there isn't a sequence, */ 165 { /* since there isn't a sequence, */
219 int q; 166 int q;
220 167
221 /*pick one at random to recurse */ 168 /*pick one at random to recurse */
222 style_map = find_style (style_file_path, namelist[RANDOM () % n], difficulty); 169 style_map = find_style (style_file_path, namelist[rndm (n)], difficulty);
223 for (q = 0; q < n; q++) 170 for (q = 0; q < n; q++)
224 free (namelist[q]); 171 free (namelist[q]);
225 free (namelist); 172 free (namelist);
226 return style_map; 173 return style_map;
227 } 174 }
… …
233 min_dist = dist; 180 min_dist = dist;
234 min_index = i; 181 min_index = i;
235 } 182 }
236 } 183 }
237 } 184 }
185
238 /* presumably now we've found the "best" match for the 186 /* presumably now we've found the "best" match for the
239 difficulty. */ 187 difficulty. */
240 strcat (style_file_path, "/"); 188 strcat (style_file_path, "/");
241 strcat (style_file_path, namelist[min_index]); 189 strcat (style_file_path, namelist[min_index]);
242 style_map = load_style_map (style_file_path); 190 style_map = maptile::find_sync (style_file_path);
243 } 191 }
192
244 for (i = 0; i < n; i++) 193 for (i = 0; i < n; i++)
245 free (namelist[i]); 194 free (namelist[i]);
195
246 free (namelist); 196 free (namelist);
247 } 197 }
198
199 if (style_map)
200 {
201 style_map->load_sync ();
202 style_map->deactivate ();
203 }
204
248 return style_map; 205 return style_map;
249 206
250} 207}
251
252 208
253/* picks a random object from a style map. 209/* picks a random object from a style map.
254 * 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
255 * variables to generate tables. 211 * variables to generate tables.
256 */ 212 */
257object * 213object *
258pick_random_object (maptile *style) 214pick_random_object (maptile *style)
259{ 215{
260 int x, y, limit = 0;
261 object *new_obj;
262
263 /* while returning a null object will result in a crash, that 216 /* while returning a null object will result in a crash, that
264 * is actually preferable to an infinite loop. That is because 217 * is actually preferable to an infinite loop. That is because
265 * most servers will automatically restart in case of crash. 218 * most servers will automatically restart in case of crash.
266 * Change the logic on getting the random space - shouldn't make 219 * Change the logic on getting the random space - shouldn't make
267 * any difference, but this seems clearer to me. 220 * any difference, but this seems clearer to me.
268 */ 221 */
269 do 222 for (int i = 1000; --i;)
270 {
271 limit++;
272 x = RANDOM () % style->width;
273 y = RANDOM () % style->height;
274 new_obj = GET_MAP_OB (style, x, y);
275 } 223 {
276 while (new_obj == NULL && limit < 1000); 224 object *new_obj = style->at (rndm (style->width), rndm (style->height)).bot;
277 if (new_obj->head) 225
226 if (new_obj)
278 return new_obj->head; 227 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 { 228 }
295 next = styles->next; 229
296 delete_map (styles); 230 // instead of crashing in the unlikely case, try to return *something*
297 styles = next; 231 return get_archetype ("blocked");
298 style_maps++;
299 }
300 LOG (llevDebug, "free_style_maps: Freed %d maps\n", style_maps);
301} 232}

Diff Legend

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