--- deliantra/server/common/region.C 2007/01/29 15:04:21 1.20 +++ deliantra/server/common/region.C 2008/05/06 16:55:25 1.39 @@ -1,38 +1,39 @@ /* - * CrossFire, A Multiplayer game for X-windows + * This file is part of Deliantra, the Roguelike Realtime MMORPG. * - * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team - * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team - * Copyright (C) 1992 Frank Tore Johansen + * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team + * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team + * Copyright (©) 1992,2007 Frank Tore Johansen * - * This program is free software; you can redistribute it and/or modify + * Deliantra is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or + * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License - * along with this program; if not, write to the Free Software - * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. - * - * The authors can be reached via e-mail at + * along with this program. If not, see . + * + * The authors can be reached via e-mail to */ #include #include +regionvec regions; + region * region::default_region () { - for (region *reg = first_region; reg; reg = reg->next) - if (reg->fallback) - return reg; + for_all_regions (rgn) + if (rgn->fallback) + return rgn; - return first_region; + return regions [0]; } /* @@ -46,9 +47,9 @@ region * region::find (const char *name) { - for (region *reg = first_region; reg; reg = reg->next) - if (!strcmp (reg->name, name)) - return reg; + for_all_regions (rgn) + if (!strcmp (rgn->name, name)) + return rgn; LOG (llevError, "region called %s requested, but not found, using fallback.\n", name); @@ -70,42 +71,31 @@ region * region::find_fuzzy (const char *name) { - region *reg; - char *substr; - char *p; - - if (name == NULL) - { - for (reg = first_region; reg->parent; reg = reg->parent) - ; + if (!name) + return default_region (); - return reg; - } - - p = strchr (name, '\n'); + char *p = strchr (name, '\n'); if (p) *p = '\0'; - for (reg = first_region; reg; reg = reg->next) - if (!strcasecmp (reg->name, name)) - return reg; - - for (reg = first_region; reg; reg = reg->next) - if (reg->longname) - if (!strcasecmp (reg->longname, name)) - return reg; - - substr = NULL; - for (reg = first_region; reg; reg = reg->next) - if (reg->longname) + for_all_regions (rgn) + if (!strcasecmp (rgn->name, name)) + return rgn; + + for_all_regions (rgn) + if (rgn->longname) + if (!strcasecmp (rgn->longname, name)) + return rgn; + + for_all_regions (rgn) + if (rgn->longname) { - substr = strstr (reg->longname, name); - if (substr) - return reg; + if (strstr (rgn->longname, name)) + return rgn; } - for (reg = first_region; reg; reg = reg->next) - if (reg->longname) + for_all_regions (rgn) + if (rgn->longname) { /* * This is not a bug, we want the region that is most identifiably a discrete @@ -113,23 +103,27 @@ * 'scornarena', regardless of their order on the list so we only look at those * regions with a longname set. */ - substr = strstr (reg->name, name); - if (substr) - return reg; + if (strstr (rgn->name, name)) + return rgn; } - for (reg = first_region; reg; reg = reg->next) + for_all_regions (rgn) { - substr = strstr (reg->name, name); - if (substr) - return reg; + if (strstr (rgn->name, name)) + return rgn; } - /* if we are still here, we are going to have to give up, and give the top level region */ - for (reg = first_region; reg->parent; reg = reg->parent) - ; + return default_region (); +} - return reg; +void +region::do_destroy () +{ + regions.erase (this); + + attachable::do_destroy (); + + refcnt_dec (); } /* @@ -137,7 +131,6 @@ * otherwise returns 0 * if passed a NULL region returns -1 */ - static int region_is_child_of_region (const region * child, const region * r) { @@ -165,21 +158,18 @@ object * get_jail_exit (object *op) { - region *reg; - object *exit; - if (op->type != PLAYER) { LOG (llevError, "region.c: get_jail_exit called against non-player object.\n"); return NULL; } - reg = op->region (); + region *reg = op->region (); while (reg) { if (reg->jailmap) { - exit = object::create (); + object *exit = object::create (); EXIT_PATH (exit) = reg->jailmap; /* damned exits reset savebed and remove teleports, so the prisoner can't escape */ SET_FLAG (exit, FLAG_DAMNED); @@ -191,117 +181,75 @@ reg = reg->parent; } - LOG (llevDebug, "No suitable jailmap for region %s was found.\n", ®->name); - return NULL; + LOG (llevError, "No suitable jailmap for region %s was found.\n", ®->name); + + return 0; } -static void -assign_region_parents (void) +region * +region::read (object_thawer &f) { - region *reg; - uint32 parent_count = 0; - uint32 region_count = 0; + assert (f.kw == KW_region); - for (reg = first_region; reg && reg->next; reg = reg->next) - { - if (reg->parent_name) - { - reg->parent = region::find (reg->parent_name); - parent_count++; - } + region *rgn = new region; + rgn->refcnt_inc (); - region_count++; - } - - LOG (llevDebug, "Assigned %u regions with %u parents.\n", region_count, parent_count); -} - -/* - * Reads/parses the region file, and copies into a linked list - * of region structs. - */ -static bool -parse_regions (object_thawer &fp) -{ - region *newreg; - region *reg; + f.get (rgn->name); + f.next (); - newreg = NULL; for (;;) { - keyword kw = fp.get_kv (); - - switch (kw) + switch (f.kw) { - case KW_EOF: - if (newreg) - { - LOG (llevError, "%s: end of file while reading regions.\n", fp.name); - return false; - } - else - return true; - - case KW_end: - /* Place this new region last on the list, if the list is empty put it first */ - for (reg = first_region; reg && reg->next; reg = reg->next) - ; - - if (!reg) - first_region = newreg; - else - reg->next = newreg; - - newreg = 0; + case KW_parent: + rgn->parent = region::find (f.get_str ()); break; - default: - case KW_ERROR: - LOG (llevError, "%s: skipping errornous line (%s) while reading regions.\n", fp.name, fp.last_keyword); - break; + case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; + case KW_longname: f.get (rgn->longname); break; + case KW_jail_map: f.get (rgn->jailmap); break; + case KW_jail_x: f.get (rgn->jailx); break; + case KW_jail_y: f.get (rgn->jaily); break; + case KW_portal_map: f.get (rgn->portalmap);break; + case KW_portal_x: f.get (rgn->portalx); break; + case KW_portal_y: f.get (rgn->portaly); break; + case KW_fallback: f.get (rgn->fallback); break; + case KW_chance: f.get (rgn->treasure_density); break; - case KW_region: - newreg = new region; - fp.get (newreg->name); + case KW_randomitems: + rgn->treasure = treasurelist::get (f.get_str ()); break; - case KW_parent: - /* - * Note that this is in the initialisation code, so we don't actually - * assign the pointer to the parent yet, because it might not have been - * parsed. - */ - fp.get (newreg->parent_name); - break; + case KW_end: + f.next (); - case KW_longname: - newreg->longname = strdup (fp.get_str ()); - break; - - case KW_jail_map: - fp.get (newreg->jailmap); - break; - - case KW_jail_x: - fp.get (newreg->jailx); - break; - - case KW_jail_y: - fp.get (newreg->jaily); - break; + // cannot use find as that will request the default region + for_all_regions (old) + if (old->name == rgn->name) + { + old->destroy (); + break; + } + + // just append + regions.push_back (rgn); + return rgn; - case KW_msg: - fp.get_ml (KW_endmsg, newreg->msg); + case KW_ERROR: + rgn->set_key_text (f.kw_str, f.value); + //fprintf (stderr, "region addkv(%s,%s)\n", f.kw_str, f.value);//D break; - case KW_fallback: - fp.get (newreg->fallback); + default: + if (!f.parse_error ("region", rgn->name)) + { + rgn->destroy (); + return 0; + } break; - - case KW_nomore: - /* we have reached the end of the region specs.... */ - return true; } + + f.next (); } } @@ -309,35 +257,17 @@ * First initialises the archtype hash-table (init_archetable()). * Reads and parses the archetype file (with the first and second-pass * functions). - * Then initialises treasures by calling load_treasures(). */ void init_regions (void) { - char filename[MAX_BUF]; - int comp; - - if (first_region != NULL) /* Only do this once */ - return; - - // make sure one region is always available - first_region = new region; - first_region->name = ""; - first_region->longname = strdup ("Built-in Region"); - - sprintf (filename, "%s/%s/%s", settings.datadir, settings.mapdir, settings.regions); - LOG (llevDebug, "Reading regions from %s...\n", filename); - - object_thawer fp (filename); - - if (!fp) + if (!regions.size ()) { - LOG (llevError, " Can't open regions file %s in init_regions.\n", filename); - return; + // make sure one region is always available + region *rgn = new region; + rgn->name = ""; + rgn->longname = "Built-in Region"; + regions.push_back (rgn); } - - parse_regions (fp); - - assign_region_parents (); - LOG (llevDebug, " done\n"); } +