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.2 by root, Tue Aug 29 08:01:36 2006 UTC vs.
Revision 1.12 by root, Sat Dec 30 10:16:11 2006 UTC

1/*
2 * static char *rcsid_style_c =
3 * "$Id: style.C,v 1.2 2006/08/29 08:01:36 root Exp $";
4 */
5
6/* 1/*
7 CrossFire, A Multiplayer game for X-windows 2 CrossFire, A Multiplayer game for X-windows
8 3
9 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 4 Copyright (C) 2002 Mark Wedel & Crossfire Development Team
10 Copyright (C) 1992 Frank Tore Johansen 5 Copyright (C) 1992 Frank Tore Johansen
… …
21 16
22 You should have received a copy of the GNU General Public License 17 You should have received a copy of the GNU General Public License
23 along with this program; if not, write to the Free Software 18 along with this program; if not, write to the Free Software
24 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25 20
26 The authors can be reached via e-mail at crossfire-devel@real-time.com 21 The authors can be reached via e-mail at <crossfire@schmorp.de>
27*/ 22*/
28 23
29 24
30#include <global.h> 25#include <global.h>
31#include <random_map.h> 26#include <random_map.h>
32#ifndef WIN32 /* ---win32 exclude headers */
33#include <dirent.h> 27#include <dirent.h>
34#include <sys/stat.h> 28#include <sys/stat.h>
35#include <unistd.h> 29#include <unistd.h>
36#include "../include/autoconf.h" 30#include "../include/autoconf.h"
37#endif /* win32 */
38 31
39 32
33static int
40static int pointer_strcmp(const void *p1, const void *p2) 34pointer_strcmp (const void *p1, const void *p2)
41{ 35{
42 const char *s1 = *(const char **)p1; 36 const char *s1 = *(const char **) p1;
43 const char *s2 = *(const char **)p2; 37 const char *s2 = *(const char **) p2;
44 38
45 return(strcmp(s1, s2)); 39 return (strcmp (s1, s2));
46} 40}
47 41
48/* This is our own version of scandir/select_regular_files/sort. 42/* This is our own version of scandir/select_regular_files/sort.
49 * To support having subdirectories in styles, we need to know 43 * To support having subdirectories in styles, we need to know
50 * if in fact the directory we read is a subdirectory. However, 44 * if in fact the directory we read is a subdirectory. However,
… …
57 * skip_dirs controls our behavioru - if nonzero, we don't 51 * skip_dirs controls our behavioru - if nonzero, we don't
58 * skip any subdirectories - if zero, we store those away, 52 * skip any subdirectories - if zero, we store those away,
59 * since there are cases where we want to choose a random 53 * since there are cases where we want to choose a random
60 * directory. 54 * directory.
61 */ 55 */
56int
62int load_dir (const char *dir, char ***namelist, int skip_dirs) 57load_dir (const char *dir, char ***namelist, int skip_dirs)
63{ 58{
64 DIR *dp; 59 DIR *dp;
65 struct dirent *d; 60 struct dirent *d;
66 int entries=0, entry_size=0; 61 int entries = 0, entry_size = 0;
67 char name[NAME_MAX+1], **rn=NULL; 62 char name[NAME_MAX + 1], **rn = NULL;
68 struct stat sb; 63 struct stat sb;
69 64
70 dp = opendir (dir); 65 dp = opendir (dir);
71 if (dp == NULL) 66 if (dp == NULL)
72 return -1; 67 return -1;
73 68
74 while ((d = readdir (dp)) != NULL) { 69 while ((d = readdir (dp)) != NULL)
70 {
75 sprintf(name, "%s/%s", dir, d->d_name); 71 sprintf (name, "%s/%s", dir, d->d_name);
76 if (skip_dirs) { 72 if (skip_dirs)
73 {
77 stat(name, &sb); 74 stat (name, &sb);
78 if (S_ISDIR(sb.st_mode)) { 75 if (S_ISDIR (sb.st_mode))
76 {
79 continue; 77 continue;
80 } 78 }
81 } 79 }
82 80
83 if (entries == entry_size) { 81 if (entries == entry_size)
82 {
84 entry_size+=10; 83 entry_size += 10;
85 rn = (char **) realloc(rn, sizeof(char*) * entry_size); 84 rn = (char **) realloc (rn, sizeof (char *) * entry_size);
86 } 85 }
87 rn[entries] = strdup_local(d->d_name); 86 rn[entries] = strdup (d->d_name);
88 entries++; 87 entries++;
89 88
90 } 89 }
91 (void) closedir (dp); 90 (void) closedir (dp);
92 91
93 qsort(rn, entries, sizeof(char*), pointer_strcmp); 92 qsort (rn, entries, sizeof (char *), pointer_strcmp);
94 93
95 *namelist = rn; 94 *namelist = rn;
96 return entries; 95 return entries;
97} 96}
98 97
99 98
100 99
101 100
102 101
103/* this function loads and returns the map requested. 102/* this function loads and returns the map requested.
104 * dirname, for example, is "/styles/wallstyles", stylename, is, 103 * dirname, for example, is "/styles/wallstyles", stylename, is,
105 * for example, "castle", difficulty is -1 when difficulty is 104 * for example, "castle", difficulty is -1 when difficulty is
106 * irrelevant to the style. If dirname is given, but stylename 105 * irrelevant to the style. If dirname is given, but stylename
107 * isn't, and difficult is -1, it returns a random style map. 106 * isn't, and difficult is -1, it returns a random style map.
108 * Otherwise, it tries to match the difficulty given with a style 107 * Otherwise, it tries to match the difficulty given with a style
109 * file, named style_name_# where # is an integer 108 * file, named style_name_# where # is an integer
110 */ 109 */
111 110
112/* remove extern, so visible to command_style_map_info function */ 111maptile *
113mapstruct *styles=NULL;
114
115
116mapstruct *load_style_map(char *style_name) 112load_style_map (char *style_name)
117{ 113{
118 mapstruct *style_map; 114 maptile *style_map = maptile::find_map (style_name, 0);
119 115 style_map->load ();
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)) return style_map;
123 }
124 style_map = load_original_map(style_name,MAP_STYLE);
125 /* Remove it from global list, put it on our local list */
126 if (style_map) {
127 mapstruct *tmp;
128
129 if (style_map == first_map)
130 first_map = style_map->next;
131 else {
132 for (tmp = first_map; tmp && tmp->next != style_map; tmp = tmp->next);
133 if(tmp)
134 tmp->next = style_map->next;
135 }
136 style_map->next = styles;
137 styles = style_map;
138 }
139 return style_map; 116 return style_map;
140} 117}
141 118
119maptile *
142mapstruct *find_style(const char *dirname,const char *stylename,int difficulty) { 120find_style (const char *dirname, const char *stylename, int difficulty)
121{
143 char style_file_path[256]; 122 char style_file_path[256];
144 char style_file_full_path[256]; 123 char style_file_full_path[256];
145 mapstruct *style_map = NULL; 124 maptile *style_map = NULL;
146 struct stat file_stat; 125 struct stat file_stat;
147 int i, only_subdirs=0; 126 int i, only_subdirs = 0;
148 127
149 /* if stylename exists, set style_file_path to that file.*/ 128 /* if stylename exists, set style_file_path to that file. */
150 if(stylename && strlen(stylename)>0) 129 if (stylename && strlen (stylename) > 0)
151 sprintf(style_file_path,"%s/%s",dirname,stylename); 130 sprintf (style_file_path, "%s/%s", dirname, stylename);
152 else /* otherwise, just use the dirname. We'll pick a random stylefile.*/ 131 else /* otherwise, just use the dirname. We'll pick a random stylefile. */
153 sprintf(style_file_path,"%s",dirname); 132 sprintf (style_file_path, "%s", dirname);
154 133
155 /* is what we were given a directory, or a file? */ 134 /* is what we were given a directory, or a file? */
156 sprintf(style_file_full_path,"%s/maps%s",settings.datadir,style_file_path); 135 sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path);
157 if (stat(style_file_full_path, &file_stat) == 0 136 if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode))
158 && !S_ISDIR(file_stat.st_mode)) { 137 {
159 style_map=load_style_map(style_file_path); 138 style_map = load_style_map (style_file_path);
160 } 139 }
161 if(style_map == NULL) /* maybe we were given a directory! */ 140 if (style_map == NULL) /* maybe we were given a directory! */
162 { 141 {
163 char **namelist; 142 char **namelist;
164 int n; 143 int n;
165 char style_dir_full_path[256]; 144 char style_dir_full_path[256];
166 145
167 /* get the names of all the files in that directory */ 146 /* get the names of all the files in that directory */
168 sprintf(style_dir_full_path,"%s/maps%s",settings.datadir,style_file_path); 147 sprintf (style_dir_full_path, "%s/maps%s", settings.datadir, style_file_path);
169 148
170 /* First, skip subdirectories. If we don't find anything, then try again 149 /* First, skip subdirectories. If we don't find anything, then try again
171 * without skipping subdirs. 150 * without skipping subdirs.
172 */ 151 */
173 n = load_dir(style_dir_full_path, &namelist, 1); 152 n = load_dir (style_dir_full_path, &namelist, 1);
174 153
175 if (n<=0) { 154 if (n <= 0)
155 {
176 n = load_dir(style_dir_full_path, &namelist, 0); 156 n = load_dir (style_dir_full_path, &namelist, 0);
177 only_subdirs=1; 157 only_subdirs = 1;
178 } 158 }
179 159
160 if (n <= 0)
180 if (n<=0) return 0; /* nothing to load. Bye. */ 161 return 0; /* nothing to load. Bye. */
181 162
182 /* Picks a random map. Note that if this is all directories, 163 /* Picks a random map. Note that if this is all directories,
183 * we know it won't be able to load, so save a few ticks. 164 * we know it won't be able to load, so save a few ticks.
184 * the door handling checks for this failure and handles 165 * the door handling checks for this failure and handles
185 * it properly. 166 * it properly.
186 */ 167 */
187 if(difficulty==-1) { /* pick a random style from this dir. */ 168 if (difficulty == -1)
169 { /* pick a random style from this dir. */
188 if (only_subdirs) 170 if (only_subdirs)
189 style_map=NULL; 171 style_map = NULL;
190 else { 172 else
173 {
191 strcat(style_file_path,"/"); 174 strcat (style_file_path, "/");
192 strcat(style_file_path,namelist[RANDOM()%n]); 175 strcat (style_file_path, namelist[RANDOM () % n]);
193 style_map = load_style_map(style_file_path); 176 style_map = load_style_map (style_file_path);
194 } 177 }
195 } 178 }
179 else
196 else { /* find the map closest in difficulty */ 180 { /* find the map closest in difficulty */
197 int min_dist=32000,min_index=-1; 181 int min_dist = 32000, min_index = -1;
198 182
199 for(i=0;i<n;i++) { 183 for (i = 0; i < n; i++)
184 {
200 int dist; 185 int dist;
201 char *mfile_name = strrchr(namelist[i],'_')+1; 186 char *mfile_name = strrchr (namelist[i], '_') + 1;
202 187
203 if((mfile_name-1) == NULL) { /* since there isn't a sequence, */ 188 if ((mfile_name - 1) == NULL)
189 { /* since there isn't a sequence, */
204 int q; 190 int q;
191
205 /*pick one at random to recurse */ 192 /*pick one at random to recurse */
206 style_map= find_style(style_file_path, 193 style_map = find_style (style_file_path, namelist[RANDOM () % n], difficulty);
207 namelist[RANDOM()%n],difficulty);
208 for (q=0; q<n; q++) 194 for (q = 0; q < n; q++)
209 free(namelist[q]); 195 free (namelist[q]);
210 free(namelist); 196 free (namelist);
211 return style_map; 197 return style_map;
198 }
212 } else { 199 else
200 {
213 dist = abs(difficulty-atoi(mfile_name)); 201 dist = abs (difficulty - atoi (mfile_name));
214 if(dist<min_dist) { 202 if (dist < min_dist)
203 {
215 min_dist = dist; 204 min_dist = dist;
216 min_index = i; 205 min_index = i;
217 } 206 }
218 } 207 }
219 } 208 }
220 /* presumably now we've found the "best" match for the 209 /* presumably now we've found the "best" match for the
221 difficulty. */ 210 difficulty. */
222 strcat(style_file_path,"/"); 211 strcat (style_file_path, "/");
223 strcat(style_file_path,namelist[min_index]); 212 strcat (style_file_path, namelist[min_index]);
224 style_map = load_style_map(style_file_path); 213 style_map = load_style_map (style_file_path);
225 } 214 }
226 for (i=0; i<n; i++) 215 for (i = 0; i < n; i++)
227 free(namelist[i]); 216 free (namelist[i]);
228 free(namelist); 217 free (namelist);
229 } 218 }
230 return style_map; 219 return style_map;
231 220
232} 221}
233
234 222
235/* picks a random object from a style map. 223/* picks a random object from a style map.
236 * Redone by MSW so it should be faster and not use static 224 * Redone by MSW so it should be faster and not use static
237 * variables to generate tables. 225 * variables to generate tables.
238 */ 226 */
227object *
239object *pick_random_object(mapstruct *style) { 228pick_random_object (maptile *style)
229{
240 int x,y, limit=0; 230 int x, y, limit = 0;
241 object *new_obj; 231 object *new_obj;
242 232
243 /* while returning a null object will result in a crash, that 233 /* while returning a null object will result in a crash, that
244 * is actually preferable to an infinite loop. That is because 234 * is actually preferable to an infinite loop. That is because
245 * most servers will automatically restart in case of crash. 235 * most servers will automatically restart in case of crash.
246 * Change the logic on getting the random space - shouldn't make 236 * Change the logic on getting the random space - shouldn't make
247 * any difference, but this seems clearer to me. 237 * any difference, but this seems clearer to me.
248 */ 238 */
239 do
249 do { 240 {
250 limit++; 241 limit++;
251 x = RANDOM() % MAP_WIDTH(style); 242 x = RANDOM () % style->width;
252 y = RANDOM() % MAP_HEIGHT(style); 243 y = RANDOM () % style->height;
253 new_obj = get_map_ob(style,x,y); 244 new_obj = GET_MAP_OB (style, x, y);
245 }
254 } while (new_obj == NULL && limit<1000); 246 while (new_obj == NULL && limit < 1000);
255 if (new_obj->head) return new_obj->head; 247
248 if (new_obj->head)
249 return new_obj->head;
250 else
256 else return new_obj; 251 return new_obj;
257} 252}
258
259 253
260void free_style_maps(void)
261{
262 mapstruct *next;
263 int style_maps=0;
264
265 /* delete_map will try to free it from the linked list,
266 * but won't find it, so we need to do it ourselves
267 */
268 while (styles) {
269 next = styles->next;
270 delete_map(styles);
271 styles=next;
272 style_maps++;
273 }
274 LOG(llevDebug,"free_style_maps: Freed %d maps\n", style_maps);
275}
276

Diff Legend

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