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.16 by root, Sun Dec 31 18:13:27 2006 UTC vs.
Revision 1.28 by root, Fri Apr 11 21:09:53 2008 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version. 11 * (at your option) any later version.
11 12 *
12 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 *
20 21 * The authors can be reached via e-mail to <support@deliantra.net>
21 The authors can be reached via e-mail at <crossfire@schmorp.de>
22*/ 22 */
23 23
24#include <global.h> 24#include <global.h>
25#include <random_map.h> 25#include <random_map.h>
26#include <dirent.h> 26#include <dirent.h>
27#include <sys/stat.h> 27#include <sys/stat.h>
28#include <unistd.h> 28#include <unistd.h>
29#include "../include/autoconf.h" 29#include "../include/autoconf.h"
30
31// NAME_MAX may not be defined on POSIX systems
32#ifndef NAME_MAX
33# define NAME_MAX 255
34#endif
30 35
31static int 36static int
32pointer_strcmp (const void *p1, const void *p2) 37pointer_strcmp (const void *p1, const void *p2)
33{ 38{
34 const char *s1 = *(const char **) p1; 39 const char *s1 = *(const char **) p1;
… …
59 int entries = 0, entry_size = 0; 64 int entries = 0, entry_size = 0;
60 char name[NAME_MAX + 1], **rn = NULL; 65 char name[NAME_MAX + 1], **rn = NULL;
61 struct stat sb; 66 struct stat sb;
62 67
63 dp = opendir (dir); 68 dp = opendir (dir);
64 if (dp == NULL) 69 if (!dp)
65 return -1; 70 return -1;
66 71
67 while ((d = readdir (dp)) != NULL) 72 while ((d = readdir (dp)))
68 { 73 {
69 sprintf (name, "%s/%s", dir, d->d_name); 74 sprintf (name, "%s/%s", dir, d->d_name);
70 if (skip_dirs) 75 if (skip_dirs)
71 { 76 {
72 stat (name, &sb); 77 stat (name, &sb);
73 if (S_ISDIR (sb.st_mode)) 78 if (S_ISDIR (sb.st_mode))
74 {
75 continue; 79 continue;
76 }
77 } 80 }
78 81
79 if (entries == entry_size) 82 if (entries == entry_size)
80 { 83 {
81 entry_size += 10; 84 entry_size += 10;
… …
94} 97}
95 98
96maptile * 99maptile *
97find_style (const char *dirname, const char *stylename, int difficulty) 100find_style (const char *dirname, const char *stylename, int difficulty)
98{ 101{
99 char style_file_path[256]; 102 char style_file_path[1024];
100 char style_file_full_path[256]; 103 char style_file_full_path[1024];
101 maptile *style_map = NULL; 104 maptile *style_map = NULL;
102 struct stat file_stat; 105 struct stat file_stat;
103 int i, only_subdirs = 0; 106 int i, only_subdirs = 0;
104 107
105 /* if stylename exists, set style_file_path to that file. */ 108 /* if stylename exists, set style_file_path to that file. */
… …
107 sprintf (style_file_path, "%s/%s", dirname, stylename); 110 sprintf (style_file_path, "%s/%s", dirname, stylename);
108 else /* otherwise, just use the dirname. We'll pick a random stylefile. */ 111 else /* otherwise, just use the dirname. We'll pick a random stylefile. */
109 sprintf (style_file_path, "%s", dirname); 112 sprintf (style_file_path, "%s", dirname);
110 113
111 /* is what we were given a directory, or a file? */ 114 /* is what we were given a directory, or a file? */
112 sprintf (style_file_full_path, "%s/maps%s", settings.datadir, style_file_path); 115 sprintf (style_file_full_path, "%s/maps%s.map", settings.datadir, style_file_path);
113 116
114 if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode)) 117 if (stat (style_file_full_path, &file_stat) == 0 && !S_ISDIR (file_stat.st_mode))
115 style_map = maptile::load_map_sync (style_file_path); 118 style_map = maptile::find_sync (style_file_path);
116 119
117 if (!style_map) /* maybe we were given a directory! */ 120 if (!style_map) /* maybe we were given a directory! */
118 { 121 {
119 char **namelist; 122 char **namelist;
120 int n; 123 int n;
121 char style_dir_full_path[256]; 124 char style_dir_full_path[256];
122 125
… …
147 if (only_subdirs) 150 if (only_subdirs)
148 style_map = 0; 151 style_map = 0;
149 else 152 else
150 { 153 {
151 strcat (style_file_path, "/"); 154 strcat (style_file_path, "/");
152 strcat (style_file_path, namelist[RANDOM () % n]); 155 strcat (style_file_path, namelist[rndm (n)]);
153 style_map = maptile::load_map_sync (style_file_path); 156 style_map = maptile::find_sync (style_file_path);
154 } 157 }
155 } 158 }
156 else 159 else
157 { /* find the map closest in difficulty */ 160 { /* find the map closest in difficulty */
158 int min_dist = 32000, min_index = -1; 161 int min_dist = 32000, min_index = -1;
… …
165 if ((mfile_name - 1) == NULL) 168 if ((mfile_name - 1) == NULL)
166 { /* since there isn't a sequence, */ 169 { /* since there isn't a sequence, */
167 int q; 170 int q;
168 171
169 /*pick one at random to recurse */ 172 /*pick one at random to recurse */
170 style_map = find_style (style_file_path, namelist[RANDOM () % n], difficulty); 173 style_map = find_style (style_file_path, namelist[rndm (n)], difficulty);
171 for (q = 0; q < n; q++) 174 for (q = 0; q < n; q++)
172 free (namelist[q]); 175 free (namelist[q]);
173 free (namelist); 176 free (namelist);
174 return style_map; 177 return style_map;
175 } 178 }
… …
186 189
187 /* presumably now we've found the "best" match for the 190 /* presumably now we've found the "best" match for the
188 difficulty. */ 191 difficulty. */
189 strcat (style_file_path, "/"); 192 strcat (style_file_path, "/");
190 strcat (style_file_path, namelist[min_index]); 193 strcat (style_file_path, namelist[min_index]);
191 style_map = maptile::load_map_sync (style_file_path); 194 style_map = maptile::find_sync (style_file_path);
192 } 195 }
193 196
194 for (i = 0; i < n; i++) 197 for (i = 0; i < n; i++)
195 free (namelist[i]); 198 free (namelist[i]);
196 199
197 free (namelist); 200 free (namelist);
198 } 201 }
199 202
200 if (style_map) 203 if (style_map)
204 {
205 style_map->load_sync ();
201 style_map->deactivate (); 206 style_map->deactivate ();
207 }
202 208
203 return style_map; 209 return style_map;
204
205} 210}
206
207/* picks a random object from a style map.
208 * Redone by MSW so it should be faster and not use static
209 * variables to generate tables.
210 */
211object *
212pick_random_object (maptile *style)
213{
214 /* while returning a null object will result in a crash, that
215 * is actually preferable to an infinite loop. That is because
216 * most servers will automatically restart in case of crash.
217 * Change the logic on getting the random space - shouldn't make
218 * any difference, but this seems clearer to me.
219 */
220 for (int i = 1000; --i; )
221 {
222 object *new_obj = style->at (RANDOM () % style->width, RANDOM () % style->height).bot;
223
224 if (new_obj)
225 return new_obj->head_ ();
226 }
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