ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/region.C
(Generate patch)

Comparing deliantra/server/common/region.C (file contents):
Revision 1.19 by root, Mon Jan 29 14:46:01 2007 UTC vs.
Revision 1.36 by root, Thu Aug 30 07:28:25 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT is free software: you can redistribute it and/or modify
9 * 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
10 * the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your option) any later version.
12 * 12 *
13 * 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,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * 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
19 * along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 22 */
24 23
25#include <global.h> 24#include <global.h>
26#include <unistd.h> 25#include <unistd.h>
27 26
27regionvec regions;
28
28region * 29region *
29region::default_region () 30region::default_region ()
30{ 31{
31 for (region *reg = first_region; reg; reg = reg->next) 32 for_all_regions (rgn)
32 if (reg->fallback) 33 if (rgn->fallback)
33 return reg; 34 return rgn;
34 35
35 return first_region; 36 return regions [0];
36} 37}
37 38
38/* 39/*
39 * Pass a char array, returns a pointer to the region of the same name. 40 * Pass a char array, returns a pointer to the region of the same name.
40 * if it can't find a region of the same name it returns the first region 41 * if it can't find a region of the same name it returns the first region
… …
44 * used by the map parsing code. 45 * used by the map parsing code.
45 */ 46 */
46region * 47region *
47region::find (const char *name) 48region::find (const char *name)
48{ 49{
49 for (region *reg = first_region; reg; reg = reg->next) 50 for_all_regions (rgn)
50 if (!strcmp (reg->name, name)) 51 if (!strcmp (rgn->name, name))
51 return reg; 52 return rgn;
52 53
53 LOG (llevError, "region called %s requested, but not found, using fallback.\n", name); 54 LOG (llevError, "region called %s requested, but not found, using fallback.\n", name);
54 55
55 return default_region (); 56 return default_region ();
56} 57}
… …
68 * 69 *
69 */ 70 */
70region * 71region *
71region::find_fuzzy (const char *name) 72region::find_fuzzy (const char *name)
72{ 73{
73 region *reg; 74 if (!name)
74 char *substr; 75 return default_region ();
75 char *p;
76 76
77 if (name == NULL)
78 {
79 for (reg = first_region; reg->parent; reg = reg->parent)
80 ;
81
82 return reg;
83 }
84
85 p = strchr (name, '\n'); 77 char *p = strchr (name, '\n');
86 if (p) 78 if (p)
87 *p = '\0'; 79 *p = '\0';
88 80
89 for (reg = first_region; reg; reg = reg->next) 81 for_all_regions (rgn)
90 if (!strcasecmp (reg->name, name)) 82 if (!strcasecmp (rgn->name, name))
91 return reg; 83 return rgn;
92 84
93 for (reg = first_region; reg; reg = reg->next) 85 for_all_regions (rgn)
94 if (reg->longname) 86 if (rgn->longname)
95 if (!strcasecmp (reg->longname, name)) 87 if (!strcasecmp (rgn->longname, name))
96 return reg; 88 return rgn;
97 89
98 substr = NULL; 90 for_all_regions (rgn)
99 for (reg = first_region; reg; reg = reg->next)
100 if (reg->longname) 91 if (rgn->longname)
101 { 92 {
102 substr = strstr (reg->longname, name); 93 if (strstr (rgn->longname, name))
103 if (substr)
104 return reg; 94 return rgn;
105 } 95 }
106 96
107 for (reg = first_region; reg; reg = reg->next) 97 for_all_regions (rgn)
108 if (reg->longname) 98 if (rgn->longname)
109 { 99 {
110 /* 100 /*
111 * This is not a bug, we want the region that is most identifiably a discrete 101 * This is not a bug, we want the region that is most identifiably a discrete
112 * area in the game, eg if we have 'scor', we want to return 'scorn' and not 102 * area in the game, eg if we have 'scor', we want to return 'scorn' and not
113 * 'scornarena', regardless of their order on the list so we only look at those 103 * 'scornarena', regardless of their order on the list so we only look at those
114 * regions with a longname set. 104 * regions with a longname set.
115 */ 105 */
116 substr = strstr (reg->name, name); 106 if (strstr (rgn->name, name))
117 if (substr)
118 return reg; 107 return rgn;
119 } 108 }
120 109
121 for (reg = first_region; reg; reg = reg->next) 110 for_all_regions (rgn)
122 { 111 {
123 substr = strstr (reg->name, name); 112 if (strstr (rgn->name, name))
124 if (substr)
125 return reg; 113 return rgn;
126 }
127
128 /* if we are still here, we are going to have to give up, and give the top level region */
129 for (reg = first_region; reg->parent; reg = reg->parent)
130 ; 114 }
131 115
132 return reg; 116 return default_region ();
117}
118
119void
120region::do_destroy ()
121{
122 regions.erase (this);
123
124 attachable::do_destroy ();
125
126 refcnt_dec ();
133} 127}
134 128
135/* 129/*
136 * returns 1 if the player is in the region reg, or a child region thereof 130 * returns 1 if the player is in the region reg, or a child region thereof
137 * otherwise returns 0 131 * otherwise returns 0
138 * if passed a NULL region returns -1 132 * if passed a NULL region returns -1
139 */ 133 */
140
141static int 134static int
142region_is_child_of_region (const region * child, const region * r) 135region_is_child_of_region (const region * child, const region * r)
143{ 136{
144 137
145 if (r == NULL) 138 if (r == NULL)
… …
189 } 182 }
190 else 183 else
191 reg = reg->parent; 184 reg = reg->parent;
192 } 185 }
193 186
194 LOG (llevDebug, "No suitable jailmap for region %s was found.\n", &reg->name); 187 LOG (llevError, "No suitable jailmap for region %s was found.\n", &reg->name);
188
195 return NULL; 189 return 0;
196} 190}
197 191
198static void 192region *
199assign_region_parents (void) 193region::read (object_thawer &f)
200{ 194{
201 region *reg; 195 assert (f.kw == KW_region);
202 uint32 parent_count = 0;
203 uint32 region_count = 0;
204 196
205 for (reg = first_region; reg && reg->next; reg = reg->next) 197 region *rgn = new region;
198 rgn->refcnt_inc ();
199
200 f.get (rgn->name);
201 f.next ();
202
203 for (;;)
206 { 204 {
207 if (reg->parent_name) 205 switch (f.kw)
208 { 206 {
207 case KW_parent:
209 reg->parent = region::find (reg->parent_name); 208 rgn->parent = region::find (f.get_str ());
210 parent_count++; 209 break;
210
211 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break;
212 case KW_longname: f.get (rgn->longname); break;
213 case KW_jail_map: f.get (rgn->jailmap); break;
214 case KW_jail_x: f.get (rgn->jailx); break;
215 case KW_jail_y: f.get (rgn->jaily); break;
216 case KW_portal_map: f.get (rgn->portalmap);break;
217 case KW_portal_x: f.get (rgn->portalx); break;
218 case KW_portal_y: f.get (rgn->portaly); break;
219 case KW_fallback: f.get (rgn->fallback); break;
220 case KW_chance: f.get (rgn->treasure_density); break;
221
222 case KW_randomitems:
223 rgn->treasure = treasurelist::get (f.get_str ());
224 break;
225
226 case KW_end:
227 f.next ();
228
229 // cannot use find as that will request the default region
230 for_all_regions (old)
231 if (old->name == rgn->name)
232 {
233 old->destroy ();
234 break;
235 }
236
237 // just append
238 regions.push_back (rgn);
239 return rgn;
240
241 case KW_ERROR:
242 rgn->set_key_text (f.kw_str, f.value);
243 //fprintf (stderr, "region addkv(%s,%s)\n", f.kw_str, f.value);//D
244 break;
245
246 default:
247 if (!f.parse_error ("region", rgn->name))
248 {
249 rgn->destroy ();
250 return 0;
251 }
252 break;
211 } 253 }
212 254
213 region_count++; 255 f.next ();
214 } 256 }
215
216 LOG (llevDebug, "Assigned %u regions with %u parents.\n", region_count, parent_count);
217} 257}
218 258
219/* 259/*
220 * First initialises the archtype hash-table (init_archetable()). 260 * First initialises the archtype hash-table (init_archetable()).
221 * Reads and parses the archetype file (with the first and second-pass 261 * Reads and parses the archetype file (with the first and second-pass
222 * functions). 262 * functions).
223 * Then initialises treasures by calling load_treasures().
224 */ 263 */
225void 264void
226init_regions (void) 265init_regions (void)
227{ 266{
228 FILE *fp; 267 if (!regions.size ())
229 char filename[MAX_BUF]; 268 {
230 int comp;
231
232 if (first_region != NULL) /* Only do this once */
233 return;
234
235 // make sure one region is always available 269 // make sure one region is always available
236 first_region = new region; 270 region *rgn = new region;
237 first_region->name = "<builtin>"; 271 rgn->name = "<builtin>";
238 first_region->longname = strdup ("Built-in Region"); 272 rgn->longname = "Built-in Region";
239 273 regions.push_back (rgn);
240 sprintf (filename, "%s/%s/%s", settings.datadir, settings.mapdir, settings.regions);
241 LOG (llevDebug, "Reading regions from %s...\n", filename);
242 if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)
243 { 274 }
244 LOG (llevError, " Can't open regions file %s in init_regions.\n", filename);
245 return;
246 }
247
248 parse_regions (fp);
249 assign_region_parents ();
250 LOG (llevDebug, " done\n");
251
252 close_and_delete (fp, comp);
253} 275}
254 276
255/*
256 * Reads/parses the region file, and copies into a linked list
257 * of region structs.
258 */
259void
260parse_regions (FILE * fp)
261{
262 region *newreg;
263 region *reg;
264
265 char buf[HUGE_BUF], msgbuf[HUGE_BUF], *key = NULL, *value, *end;
266 int msgpos = 0;
267
268 newreg = NULL;
269 while (fgets (buf, HUGE_BUF - 1, fp) != NULL)
270 {
271 buf[HUGE_BUF - 1] = 0;
272 key = buf;
273 while (isspace (*key))
274 key++;
275 if (*key == 0)
276 continue; /* empty line */
277 value = strchr (key, ' ');
278 if (!value)
279 {
280 end = strchr (key, '\n');
281 *end = 0;
282 }
283 else
284 {
285 *value = 0;
286 value++;
287 while (isspace (*value))
288 value++;
289 end = strchr (value, '\n');
290 }
291
292 /*
293 * This is a bizzare mutated form of the map and archetype parser
294 * rolled into one. Key is the field name, value is what it should
295 * be set to.
296 * We've already done the work to null terminate key,
297 * and strip off any leading spaces for both of these.
298 * We have not touched the newline at the end of the line -
299 * these might be needed for some values. the end pointer
300 * points to the first of the newlines.
301 * value could be NULL! It would be easy enough to just point
302 * this to "" to prevent cores, but that would let more errors slide
303 * through.
304 */
305 if (!strcmp (key, "region"))
306 {
307 *end = 0;
308 newreg = new region;
309 newreg->name = value;
310 }
311 else if (!strcmp (key, "parent"))
312 {
313 /*
314 * Note that this is in the initialisation code, so we don't actually
315 * assign the pointer to the parent yet, because it might not have been
316 * parsed.
317 */
318 *end = 0;
319 newreg->parent_name = value;
320 }
321 else if (!strcmp (key, "longname"))
322 {
323 *end = 0;
324 newreg->longname = strdup (value);
325 }
326 else if (!strcmp (key, "jail"))
327 {
328 /* jail entries are of the form: /path/to/map x y */
329 char path[MAX_BUF];
330 int x, y;
331
332 if (sscanf (value, "%[^ ] %d %d\n", path, &x, &y) != 3)
333 {
334 LOG (llevError, "region.c: malformated regions entry: jail %s\n", value);
335 continue;
336 }
337 newreg->jailmap = strdup (path);
338 newreg->jailx = x;
339 newreg->jaily = y;
340 }
341 else if (!strcmp (key, "msg"))
342 {
343 while (fgets (buf, HUGE_BUF - 1, fp) != NULL)
344 {
345 if (!strcmp (buf, "endmsg\n"))
346 break;
347 else
348 {
349 strcpy (msgbuf + msgpos, buf);
350 msgpos += strlen (buf);
351 }
352 }
353 /*
354 * There may be regions with empty messages (eg, msg/endmsg
355 * with nothing between). When maps are loaded, this is done
356 * so better do it here too...
357 */
358 if (msgpos != 0)
359 newreg->msg = strdup (msgbuf);
360
361 /* we have to reset msgpos, or the next region will store both msg blocks. */
362 msgpos = 0;
363 }
364 else if (!strcmp (key, "fallback"))
365 {
366 *end = 0;
367 newreg->fallback = atoi (value);
368 }
369 else if (!strcmp (key, "end"))
370 {
371 /* Place this new region last on the list, if the list is empty put it first */
372 for (reg = first_region; reg != NULL && reg->next != NULL; reg = reg->next);
373
374 if (reg == NULL)
375 first_region = newreg;
376 else
377 reg->next = newreg;
378 newreg = NULL;
379 }
380 else if (!strcmp (key, "nomore"))
381 {
382 /* we have reached the end of the region specs.... */
383 break;
384 }
385 else
386 {
387 /* we should never get here, if we have, then something is wrong */
388 LOG (llevError, "Got unknown value in region file: %s %s\n", key, value);
389 }
390 }
391 if (!key || strcmp (key, "nomore"))
392 LOG (llevError, "Got premature eof on regions file!\n");
393}
394

Diff Legend

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