ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/random_maps/style.C
Revision: 1.24
Committed: Sat Feb 17 23:32:11 2007 UTC (17 years, 4 months ago) by root
Content type: text/plain
Branch: MAIN
CVS Tags: rel-2_0, rel-2_1
Changes since 1.23: +0 -26 lines
Log Message:
- prepare find_style_map rewrite
- move pick_random_object to maptile::
- make pick_random_object fair overe the numbe rof monsters and
  no longer prefer big monsters.

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.3 static int
33     pointer_strcmp (const void *p1, const void *p2)
34 elmex 1.1 {
35 root 1.3 const char *s1 = *(const char **) p1;
36     const char *s2 = *(const char **) p2;
37 elmex 1.1
38 root 1.3 return (strcmp (s1, s2));
39 elmex 1.1 }
40    
41     /* This is our own version of scandir/select_regular_files/sort.
42     * To support having subdirectories in styles, we need to know
43     * if in fact the directory we read is a subdirectory. However,
44     * we can't get that through the normal dirent entry. So
45     * instead, we do our own where we do have the full directory
46     * path so can do stat calls to see if in fact it is a directory.
47     * dir is the name of the director to scan.
48     * namelist is the array of file names returned. IT needs to be
49     * freed by the caller.
50     * skip_dirs controls our behavioru - if nonzero, we don't
51     * skip any subdirectories - if zero, we store those away,
52     * since there are cases where we want to choose a random
53     * directory.
54     */
55 root 1.3 int
56     load_dir (const char *dir, char ***namelist, int skip_dirs)
57 elmex 1.1 {
58 root 1.3 DIR *dp;
59     struct dirent *d;
60     int entries = 0, entry_size = 0;
61     char name[NAME_MAX + 1], **rn = NULL;
62     struct stat sb;
63    
64     dp = opendir (dir);
65 root 1.23 if (!dp)
66 root 1.3 return -1;
67    
68 root 1.23 while ((d = readdir (dp)))
69 root 1.3 {
70     sprintf (name, "%s/%s", dir, d->d_name);
71     if (skip_dirs)
72     {
73     stat (name, &sb);
74     if (S_ISDIR (sb.st_mode))
75 root 1.23 continue;
76 root 1.2 }
77    
78 root 1.3 if (entries == entry_size)
79     {
80     entry_size += 10;
81     rn = (char **) realloc (rn, sizeof (char *) * entry_size);
82 root 1.2 }
83 root 1.7 rn[entries] = strdup (d->d_name);
84 root 1.3 entries++;
85 elmex 1.1
86     }
87 root 1.3 (void) closedir (dp);
88 elmex 1.1
89 root 1.3 qsort (rn, entries, sizeof (char *), pointer_strcmp);
90 elmex 1.1
91 root 1.3 *namelist = rn;
92     return entries;
93 elmex 1.1 }
94    
95 root 1.5 maptile *
96 root 1.3 find_style (const char *dirname, const char *stylename, int difficulty)
97     {
98 root 1.18 char style_file_path[1024];
99     char style_file_full_path[1024];
100 root 1.5 maptile *style_map = NULL;
101 root 1.3 struct stat file_stat;
102     int i, only_subdirs = 0;
103    
104     /* if stylename exists, set style_file_path to that file. */
105     if (stylename && strlen (stylename) > 0)
106     sprintf (style_file_path, "%s/%s", dirname, stylename);
107     else /* otherwise, just use the dirname. We'll pick a random stylefile. */
108     sprintf (style_file_path, "%s", dirname);
109    
110     /* is what we were given a directory, or a file? */
111 root 1.23 sprintf (style_file_full_path, "%s/maps%s.map", settings.datadir, style_file_path);
112 root 1.14
113 root 1.3 if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode))
114 root 1.19 style_map = maptile::find_sync (style_file_path);
115 root 1.13
116 root 1.17 if (!style_map) /* maybe we were given a directory! */
117 elmex 1.1 {
118 root 1.3 char **namelist;
119     int n;
120     char style_dir_full_path[256];
121    
122     /* get the names of all the files in that directory */
123     sprintf (style_dir_full_path, "%s/maps%s", settings.datadir, style_file_path);
124    
125     /* First, skip subdirectories. If we don't find anything, then try again
126     * without skipping subdirs.
127     */
128     n = load_dir (style_dir_full_path, &namelist, 1);
129    
130     if (n <= 0)
131     {
132     n = load_dir (style_dir_full_path, &namelist, 0);
133     only_subdirs = 1;
134 root 1.2 }
135    
136 root 1.3 if (n <= 0)
137     return 0; /* nothing to load. Bye. */
138 root 1.2
139 root 1.3 /* Picks a random map. Note that if this is all directories,
140     * we know it won't be able to load, so save a few ticks.
141     * the door handling checks for this failure and handles
142     * it properly.
143     */
144     if (difficulty == -1)
145     { /* pick a random style from this dir. */
146     if (only_subdirs)
147 root 1.13 style_map = 0;
148 root 1.3 else
149     {
150     strcat (style_file_path, "/");
151 root 1.22 strcat (style_file_path, namelist[rndm (n)]);
152 root 1.19 style_map = maptile::find_sync (style_file_path);
153 root 1.2 }
154     }
155 root 1.3 else
156     { /* find the map closest in difficulty */
157     int min_dist = 32000, min_index = -1;
158    
159     for (i = 0; i < n; i++)
160     {
161     int dist;
162     char *mfile_name = strrchr (namelist[i], '_') + 1;
163    
164     if ((mfile_name - 1) == NULL)
165     { /* since there isn't a sequence, */
166     int q;
167    
168     /*pick one at random to recurse */
169 root 1.22 style_map = find_style (style_file_path, namelist[rndm (n)], difficulty);
170 root 1.3 for (q = 0; q < n; q++)
171     free (namelist[q]);
172     free (namelist);
173     return style_map;
174     }
175     else
176     {
177     dist = abs (difficulty - atoi (mfile_name));
178     if (dist < min_dist)
179     {
180     min_dist = dist;
181     min_index = i;
182 root 1.2 }
183     }
184     }
185 root 1.15
186 root 1.3 /* presumably now we've found the "best" match for the
187     difficulty. */
188     strcat (style_file_path, "/");
189     strcat (style_file_path, namelist[min_index]);
190 root 1.19 style_map = maptile::find_sync (style_file_path);
191 root 1.2 }
192 root 1.13
193 root 1.3 for (i = 0; i < n; i++)
194     free (namelist[i]);
195 root 1.13
196 root 1.3 free (namelist);
197 elmex 1.1 }
198 root 1.13
199 root 1.15 if (style_map)
200 root 1.19 {
201     style_map->load_sync ();
202     style_map->deactivate ();
203     }
204 root 1.15
205 elmex 1.1 return style_map;
206     }