ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/random_maps/style.C
Revision: 1.25
Committed: Mon Jun 4 13:04:00 2007 UTC (17 years ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.24: +5 -0 lines
Log Message:
- archetype is now a subclass of object.
- store archetypes in an object_vector.
- use a different startegy for archetype loading
  (reloading is MOST CERTAINLY broken).

File Contents

# User Rev Content
1 elmex 1.1 /*
2 pippijn 1.21 * CrossFire, A Multiplayer game for X-windows
3     *
4     * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5     * Copyright (C) 2002 Mark Wedel & Crossfire Development Team
6     * Copyright (C) 1992 Frank Tore Johansen
7     *
8     * This program is free software; you can redistribute it and/or modify
9     * it under the terms of the GNU General Public License as published by
10     * the Free Software Foundation; either version 2 of the License, or
11     * (at your option) any later version.
12     *
13     * This program is distributed in the hope that it will be useful,
14     * but WITHOUT ANY WARRANTY; without even the implied warranty of
15     * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16     * GNU General Public License for more details.
17     *
18     * You should have received a copy of the GNU General Public License
19     * along with this program; if not, write to the Free Software
20     * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21     *
22     * The authors can be reached via e-mail at <crossfire@schmorp.de>
23     */
24 elmex 1.1
25     #include <global.h>
26     #include <random_map.h>
27 pippijn 1.6 #include <dirent.h>
28     #include <sys/stat.h>
29     #include <unistd.h>
30     #include "../include/autoconf.h"
31 elmex 1.1
32 root 1.25 // NAME_MAX may not be defined on POSIX systems
33     #ifndef NAME_MAX
34     # define NAME_MAX 255
35     #endif
36    
37 root 1.3 static int
38     pointer_strcmp (const void *p1, const void *p2)
39 elmex 1.1 {
40 root 1.3 const char *s1 = *(const char **) p1;
41     const char *s2 = *(const char **) p2;
42 elmex 1.1
43 root 1.3 return (strcmp (s1, s2));
44 elmex 1.1 }
45    
46     /* This is our own version of scandir/select_regular_files/sort.
47     * To support having subdirectories in styles, we need to know
48     * if in fact the directory we read is a subdirectory. However,
49     * we can't get that through the normal dirent entry. So
50     * instead, we do our own where we do have the full directory
51     * path so can do stat calls to see if in fact it is a directory.
52     * dir is the name of the director to scan.
53     * namelist is the array of file names returned. IT needs to be
54     * freed by the caller.
55     * skip_dirs controls our behavioru - if nonzero, we don't
56     * skip any subdirectories - if zero, we store those away,
57     * since there are cases where we want to choose a random
58     * directory.
59     */
60 root 1.3 int
61     load_dir (const char *dir, char ***namelist, int skip_dirs)
62 elmex 1.1 {
63 root 1.3 DIR *dp;
64     struct dirent *d;
65     int entries = 0, entry_size = 0;
66     char name[NAME_MAX + 1], **rn = NULL;
67     struct stat sb;
68    
69     dp = opendir (dir);
70 root 1.23 if (!dp)
71 root 1.3 return -1;
72    
73 root 1.23 while ((d = readdir (dp)))
74 root 1.3 {
75     sprintf (name, "%s/%s", dir, d->d_name);
76     if (skip_dirs)
77     {
78     stat (name, &sb);
79     if (S_ISDIR (sb.st_mode))
80 root 1.23 continue;
81 root 1.2 }
82    
83 root 1.3 if (entries == entry_size)
84     {
85     entry_size += 10;
86     rn = (char **) realloc (rn, sizeof (char *) * entry_size);
87 root 1.2 }
88 root 1.7 rn[entries] = strdup (d->d_name);
89 root 1.3 entries++;
90 elmex 1.1
91     }
92 root 1.3 (void) closedir (dp);
93 elmex 1.1
94 root 1.3 qsort (rn, entries, sizeof (char *), pointer_strcmp);
95 elmex 1.1
96 root 1.3 *namelist = rn;
97     return entries;
98 elmex 1.1 }
99    
100 root 1.5 maptile *
101 root 1.3 find_style (const char *dirname, const char *stylename, int difficulty)
102     {
103 root 1.18 char style_file_path[1024];
104     char style_file_full_path[1024];
105 root 1.5 maptile *style_map = NULL;
106 root 1.3 struct stat file_stat;
107     int i, only_subdirs = 0;
108    
109     /* if stylename exists, set style_file_path to that file. */
110     if (stylename && strlen (stylename) > 0)
111     sprintf (style_file_path, "%s/%s", dirname, stylename);
112     else /* otherwise, just use the dirname. We'll pick a random stylefile. */
113     sprintf (style_file_path, "%s", dirname);
114    
115     /* is what we were given a directory, or a file? */
116 root 1.23 sprintf (style_file_full_path, "%s/maps%s.map", settings.datadir, style_file_path);
117 root 1.14
118 root 1.3 if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode))
119 root 1.19 style_map = maptile::find_sync (style_file_path);
120 root 1.13
121 root 1.17 if (!style_map) /* maybe we were given a directory! */
122 elmex 1.1 {
123 root 1.3 char **namelist;
124     int n;
125     char style_dir_full_path[256];
126    
127     /* get the names of all the files in that directory */
128     sprintf (style_dir_full_path, "%s/maps%s", settings.datadir, style_file_path);
129    
130     /* First, skip subdirectories. If we don't find anything, then try again
131     * without skipping subdirs.
132     */
133     n = load_dir (style_dir_full_path, &namelist, 1);
134    
135     if (n <= 0)
136     {
137     n = load_dir (style_dir_full_path, &namelist, 0);
138     only_subdirs = 1;
139 root 1.2 }
140    
141 root 1.3 if (n <= 0)
142     return 0; /* nothing to load. Bye. */
143 root 1.2
144 root 1.3 /* Picks a random map. Note that if this is all directories,
145     * we know it won't be able to load, so save a few ticks.
146     * the door handling checks for this failure and handles
147     * it properly.
148     */
149     if (difficulty == -1)
150     { /* pick a random style from this dir. */
151     if (only_subdirs)
152 root 1.13 style_map = 0;
153 root 1.3 else
154     {
155     strcat (style_file_path, "/");
156 root 1.22 strcat (style_file_path, namelist[rndm (n)]);
157 root 1.19 style_map = maptile::find_sync (style_file_path);
158 root 1.2 }
159     }
160 root 1.3 else
161     { /* find the map closest in difficulty */
162     int min_dist = 32000, min_index = -1;
163    
164     for (i = 0; i < n; i++)
165     {
166     int dist;
167     char *mfile_name = strrchr (namelist[i], '_') + 1;
168    
169     if ((mfile_name - 1) == NULL)
170     { /* since there isn't a sequence, */
171     int q;
172    
173     /*pick one at random to recurse */
174 root 1.22 style_map = find_style (style_file_path, namelist[rndm (n)], difficulty);
175 root 1.3 for (q = 0; q < n; q++)
176     free (namelist[q]);
177     free (namelist);
178     return style_map;
179     }
180     else
181     {
182     dist = abs (difficulty - atoi (mfile_name));
183     if (dist < min_dist)
184     {
185     min_dist = dist;
186     min_index = i;
187 root 1.2 }
188     }
189     }
190 root 1.15
191 root 1.3 /* presumably now we've found the "best" match for the
192     difficulty. */
193     strcat (style_file_path, "/");
194     strcat (style_file_path, namelist[min_index]);
195 root 1.19 style_map = maptile::find_sync (style_file_path);
196 root 1.2 }
197 root 1.13
198 root 1.3 for (i = 0; i < n; i++)
199     free (namelist[i]);
200 root 1.13
201 root 1.3 free (namelist);
202 elmex 1.1 }
203 root 1.13
204 root 1.15 if (style_map)
205 root 1.19 {
206     style_map->load_sync ();
207     style_map->deactivate ();
208     }
209 root 1.15
210 elmex 1.1 return style_map;
211     }