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.8 by root, Wed Dec 20 09:14:22 2006 UTC vs.
Revision 1.18 by root, Sun Dec 31 20:46:17 2006 UTC

1
1/* 2/*
2 CrossFire, A Multiplayer game for X-windows 3 CrossFire, A Multiplayer game for X-windows
3 4
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
… …
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;
… …
93 92
94 *namelist = rn; 93 *namelist = rn;
95 return entries; 94 return entries;
96} 95}
97 96
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 {
123 if (!strcmp (style_name, style_map->path))
124 return style_map;
125 }
126 style_map = load_original_map (style_name, MAP_STYLE);
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 style_map->next = styles;
141 styles = style_map;
142 }
143 return style_map;
144}
145
146maptile * 97maptile *
147find_style (const char *dirname, const char *stylename, int difficulty) 98find_style (const char *dirname, const char *stylename, int difficulty)
148{ 99{
149 char style_file_path[256]; 100 char style_file_path[1024];
150 char style_file_full_path[256]; 101 char style_file_full_path[1024];
151 maptile *style_map = NULL; 102 maptile *style_map = NULL;
152 struct stat file_stat; 103 struct stat file_stat;
153 int i, only_subdirs = 0; 104 int i, only_subdirs = 0;
154 105
155 /* if stylename exists, set style_file_path to that file. */ 106 /* if stylename exists, set style_file_path to that file. */
… …
158 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. */
159 sprintf (style_file_path, "%s", dirname); 110 sprintf (style_file_path, "%s", dirname);
160 111
161 /* is what we were given a directory, or a file? */ 112 /* is what we were given a directory, or a file? */
162 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
163 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))
164 {
165 style_map = load_style_map (style_file_path); 116 style_map = maptile::load_map_sync (style_file_path);
166 } 117
167 if (style_map == NULL) /* maybe we were given a directory! */ 118 if (!style_map) /* maybe we were given a directory! */
168 { 119 {
169 char **namelist; 120 char **namelist;
170 int n; 121 int n;
171 char style_dir_full_path[256]; 122 char style_dir_full_path[256];
172 123
… …
193 * it properly. 144 * it properly.
194 */ 145 */
195 if (difficulty == -1) 146 if (difficulty == -1)
196 { /* pick a random style from this dir. */ 147 { /* pick a random style from this dir. */
197 if (only_subdirs) 148 if (only_subdirs)
198 style_map = NULL; 149 style_map = 0;
199 else 150 else
200 { 151 {
201 strcat (style_file_path, "/"); 152 strcat (style_file_path, "/");
202 strcat (style_file_path, namelist[RANDOM () % n]); 153 strcat (style_file_path, namelist[RANDOM () % n]);
203 style_map = load_style_map (style_file_path); 154 style_map = maptile::load_map_sync (style_file_path);
204 } 155 }
205 } 156 }
206 else 157 else
207 { /* find the map closest in difficulty */ 158 { /* find the map closest in difficulty */
208 int min_dist = 32000, min_index = -1; 159 int min_dist = 32000, min_index = -1;
… …
231 min_dist = dist; 182 min_dist = dist;
232 min_index = i; 183 min_index = i;
233 } 184 }
234 } 185 }
235 } 186 }
187
236 /* presumably now we've found the "best" match for the 188 /* presumably now we've found the "best" match for the
237 difficulty. */ 189 difficulty. */
238 strcat (style_file_path, "/"); 190 strcat (style_file_path, "/");
239 strcat (style_file_path, namelist[min_index]); 191 strcat (style_file_path, namelist[min_index]);
240 style_map = load_style_map (style_file_path); 192 style_map = maptile::load_map_sync (style_file_path);
241 } 193 }
194
242 for (i = 0; i < n; i++) 195 for (i = 0; i < n; i++)
243 free (namelist[i]); 196 free (namelist[i]);
197
244 free (namelist); 198 free (namelist);
245 } 199 }
200
201 if (style_map)
202 style_map->deactivate ();
203
246 return style_map; 204 return style_map;
247 205
248} 206}
249
250 207
251/* picks a random object from a style map. 208/* picks a random object from a style map.
252 * Redone by MSW so it should be faster and not use static 209 * Redone by MSW so it should be faster and not use static
253 * variables to generate tables. 210 * variables to generate tables.
254 */ 211 */
255object * 212object *
256pick_random_object (maptile *style) 213pick_random_object (maptile *style)
257{ 214{
258 int x, y, limit = 0;
259 object *new_obj;
260
261 /* while returning a null object will result in a crash, that 215 /* while returning a null object will result in a crash, that
262 * is actually preferable to an infinite loop. That is because 216 * is actually preferable to an infinite loop. That is because
263 * most servers will automatically restart in case of crash. 217 * most servers will automatically restart in case of crash.
264 * Change the logic on getting the random space - shouldn't make 218 * Change the logic on getting the random space - shouldn't make
265 * any difference, but this seems clearer to me. 219 * any difference, but this seems clearer to me.
266 */ 220 */
267 do 221 for (int i = 1000; --i;)
268 { 222 {
269 limit++; 223 object *new_obj = style->at (RANDOM () % style->width, RANDOM () % style->height).bot;
270 x = RANDOM () % MAP_WIDTH (style); 224
271 y = RANDOM () % MAP_HEIGHT (style); 225 if (new_obj)
272 new_obj = GET_MAP_OB (style, x, y); 226 return new_obj->head_ ();
273 } 227 }
274 while (new_obj == NULL && limit < 1000);
275 if (new_obj->head)
276 return new_obj->head;
277 else
278 return new_obj;
279}
280 228
281 229 // instead of crashing in the unlikely case, try to return *something*
282void 230 return get_archetype ("blocked");
283free_style_maps (void)
284{
285 maptile *next;
286 int style_maps = 0;
287
288 /* delete_map will try to free it from the linked list,
289 * but won't find it, so we need to do it ourselves
290 */
291 while (styles)
292 {
293 next = styles->next;
294 delete_map (styles);
295 styles = next;
296 style_maps++;
297 }
298 LOG (llevDebug, "free_style_maps: Freed %d maps\n", style_maps);
299} 231}

Diff Legend

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