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

Diff Legend

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