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.20 by pippijn, Sat Jan 6 14:42:30 2007 UTC

1
1/* 2/*
2 CrossFire, A Multiplayer game for X-windows 3 CrossFire, A Multiplayer game for X-windows
3 4
5 Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 6 Copyright (C) 2002 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 7 Copyright (C) 1992 Frank Tore Johansen
6 8
7 This program is free software; you can redistribute it and/or modify 9 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 10 it under the terms of the GNU General Public License as published by
… …
18 along with this program; if not, write to the Free Software 20 along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 21 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 22
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 23 The authors can be reached via e-mail at <crossfire@schmorp.de>
22*/ 24*/
23
24 25
25#include <global.h> 26#include <global.h>
26#include <random_map.h> 27#include <random_map.h>
27#include <dirent.h> 28#include <dirent.h>
28#include <sys/stat.h> 29#include <sys/stat.h>
29#include <unistd.h> 30#include <unistd.h>
30#include "../include/autoconf.h" 31#include "../include/autoconf.h"
31
32 32
33static int 33static int
34pointer_strcmp (const void *p1, const void *p2) 34pointer_strcmp (const void *p1, const void *p2)
35{ 35{
36 const char *s1 = *(const char **) p1; 36 const char *s1 = *(const char **) p1;
… …
93 93
94 *namelist = rn; 94 *namelist = rn;
95 return entries; 95 return entries;
96} 96}
97 97
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 * 98maptile *
147find_style (const char *dirname, const char *stylename, int difficulty) 99find_style (const char *dirname, const char *stylename, int difficulty)
148{ 100{
149 char style_file_path[256]; 101 char style_file_path[1024];
150 char style_file_full_path[256]; 102 char style_file_full_path[1024];
151 maptile *style_map = NULL; 103 maptile *style_map = NULL;
152 struct stat file_stat; 104 struct stat file_stat;
153 int i, only_subdirs = 0; 105 int i, only_subdirs = 0;
154 106
155 /* if stylename exists, set style_file_path to that file. */ 107 /* if stylename exists, set style_file_path to that file. */
… …
158 else /* otherwise, just use the dirname. We'll pick a random stylefile. */ 110 else /* otherwise, just use the dirname. We'll pick a random stylefile. */
159 sprintf (style_file_path, "%s", dirname); 111 sprintf (style_file_path, "%s", dirname);
160 112
161 /* is what we were given a directory, or a file? */ 113 /* is what we were given a directory, or a file? */
162 sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path); 114 sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path);
115
163 if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode)) 116 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); 117 style_map = maptile::find_sync (style_file_path);
166 } 118
167 if (style_map == NULL) /* maybe we were given a directory! */ 119 if (!style_map) /* maybe we were given a directory! */
168 { 120 {
169 char **namelist; 121 char **namelist;
170 int n; 122 int n;
171 char style_dir_full_path[256]; 123 char style_dir_full_path[256];
172 124
… …
193 * it properly. 145 * it properly.
194 */ 146 */
195 if (difficulty == -1) 147 if (difficulty == -1)
196 { /* pick a random style from this dir. */ 148 { /* pick a random style from this dir. */
197 if (only_subdirs) 149 if (only_subdirs)
198 style_map = NULL; 150 style_map = 0;
199 else 151 else
200 { 152 {
201 strcat (style_file_path, "/"); 153 strcat (style_file_path, "/");
202 strcat (style_file_path, namelist[RANDOM () % n]); 154 strcat (style_file_path, namelist[RANDOM () % n]);
203 style_map = load_style_map (style_file_path); 155 style_map = maptile::find_sync (style_file_path);
204 } 156 }
205 } 157 }
206 else 158 else
207 { /* find the map closest in difficulty */ 159 { /* find the map closest in difficulty */
208 int min_dist = 32000, min_index = -1; 160 int min_dist = 32000, min_index = -1;
… …
231 min_dist = dist; 183 min_dist = dist;
232 min_index = i; 184 min_index = i;
233 } 185 }
234 } 186 }
235 } 187 }
188
236 /* presumably now we've found the "best" match for the 189 /* presumably now we've found the "best" match for the
237 difficulty. */ 190 difficulty. */
238 strcat (style_file_path, "/"); 191 strcat (style_file_path, "/");
239 strcat (style_file_path, namelist[min_index]); 192 strcat (style_file_path, namelist[min_index]);
240 style_map = load_style_map (style_file_path); 193 style_map = maptile::find_sync (style_file_path);
241 } 194 }
195
242 for (i = 0; i < n; i++) 196 for (i = 0; i < n; i++)
243 free (namelist[i]); 197 free (namelist[i]);
198
244 free (namelist); 199 free (namelist);
245 } 200 }
201
202 if (style_map)
203 {
204 style_map->load_sync ();
205 style_map->deactivate ();
206 }
207
246 return style_map; 208 return style_map;
247 209
248} 210}
249
250 211
251/* picks a random object from a style map. 212/* picks a random object from a style map.
252 * Redone by MSW so it should be faster and not use static 213 * Redone by MSW so it should be faster and not use static
253 * variables to generate tables. 214 * variables to generate tables.
254 */ 215 */
255object * 216object *
256pick_random_object (maptile *style) 217pick_random_object (maptile *style)
257{ 218{
258 int x, y, limit = 0;
259 object *new_obj;
260
261 /* while returning a null object will result in a crash, that 219 /* while returning a null object will result in a crash, that
262 * is actually preferable to an infinite loop. That is because 220 * is actually preferable to an infinite loop. That is because
263 * most servers will automatically restart in case of crash. 221 * most servers will automatically restart in case of crash.
264 * Change the logic on getting the random space - shouldn't make 222 * Change the logic on getting the random space - shouldn't make
265 * any difference, but this seems clearer to me. 223 * any difference, but this seems clearer to me.
266 */ 224 */
267 do 225 for (int i = 1000; --i;)
268 {
269 limit++;
270 x = RANDOM () % MAP_WIDTH (style);
271 y = RANDOM () % MAP_HEIGHT (style);
272 new_obj = GET_MAP_OB (style, x, y);
273 } 226 {
274 while (new_obj == NULL && limit < 1000); 227 object *new_obj = style->at (RANDOM () % style->width, RANDOM () % style->height).bot;
275 if (new_obj->head) 228
229 if (new_obj)
276 return new_obj->head; 230 return new_obj->head_ ();
277 else
278 return new_obj;
279}
280
281
282void
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 { 231 }
293 next = styles->next; 232
294 delete_map (styles); 233 // instead of crashing in the unlikely case, try to return *something*
295 styles = next; 234 return get_archetype ("blocked");
296 style_maps++;
297 }
298 LOG (llevDebug, "free_style_maps: Freed %d maps\n", style_maps);
299} 235}

Diff Legend

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