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.38 by root, Sun May 4 15:23:04 2008 UTC vs.
Revision 1.52 by root, Thu Apr 29 12:24:04 2010 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * 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 Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 23 */
23 24
24#include <global.h> 25#include <global.h>
… …
34 return rgn; 35 return rgn;
35 36
36 return regions [0]; 37 return regions [0];
37} 38}
38 39
39/*
40 * Pass a char array, returns a pointer to the region of the same name.
41 * if it can't find a region of the same name it returns the first region
42 * with the 'fallback' property set.
43 * if it can't find a matching name /or/ a fallback region it logs an info message
44 * message and returns NULL
45 * used by the map parsing code.
46 */
47region * 40region *
48region::find (const char *name) 41region::find (shstr_cmp name)
49{ 42{
50 for_all_regions (rgn) 43 for_all_regions (rgn)
51 if (!strcmp (rgn->name, name)) 44 if (rgn->name == name)
52 return rgn; 45 return rgn;
53 46
54 LOG (llevError, "region called %s requested, but not found, using fallback.\n", name);
55
56 return default_region (); 47 return default_region ();
57} 48}
58 49
59/* 50void
60 * Tries to find a region that 'name' corresponds to. 51object_thawer::get (region_ptr &r) const
61 * It looks, in order, for:
62 * an exact match to region name (case insensitive)
63 * an exact match to longname (case insensitive)
64 * a substring that matches to the longname (eg Kingdom)
65 * a substring that matches to the region name (eg nav)
66 * if it can find none of these it returns the first parentless region
67 * (there should be only one of these - the top level one)
68 * If we got a NULL, then just return the top level region
69 *
70 */
71region *
72region::find_fuzzy (const char *name)
73{ 52{
74 if (!name) 53 shstr_cmp name = get_str ();
75 return default_region ();
76
77 char *p = strchr (name, '\n');
78 if (p)
79 *p = '\0';
80 54
81 for_all_regions (rgn) 55 for_all_regions (rgn)
82 if (!strcasecmp (rgn->name, name))
83 return rgn;
84
85 for_all_regions (rgn)
86 if (rgn->longname) 56 if (rgn->name == name)
87 if (!strcasecmp (rgn->longname, name))
88 return rgn;
89
90 for_all_regions (rgn)
91 if (rgn->longname)
92 { 57 {
93 if (strstr (rgn->longname, name)) 58 r = rgn;
94 return rgn; 59 return;
95 } 60 }
96 61
97 for_all_regions (rgn) 62 parse_error (format ("region called %s requested, but not found, using fallback.\n", get_str ()));
98 if (rgn->longname)
99 {
100 /*
101 * This is not a bug, we want the region that is most identifiably a discrete
102 * area in the game, eg if we have 'scor', we want to return 'scorn' and not
103 * 'scornarena', regardless of their order on the list so we only look at those
104 * regions with a longname set.
105 */
106 if (strstr (rgn->name, name))
107 return rgn;
108 }
109 63
110 for_all_regions (rgn)
111 {
112 if (strstr (rgn->name, name))
113 return rgn;
114 }
115
116 return default_region (); 64 r = region::default_region ();
117} 65}
118 66
119void 67void
120region::do_destroy () 68region::do_destroy ()
121{ 69{
… …
123 71
124 attachable::do_destroy (); 72 attachable::do_destroy ();
125 73
126 refcnt_dec (); 74 refcnt_dec ();
127} 75}
76
77//+GPL
128 78
129/* 79/*
130 * returns 1 if the player is in the region reg, or a child region thereof 80 * returns 1 if the player is in the region reg, or a child region thereof
131 * otherwise returns 0 81 * otherwise returns 0
132 * if passed a NULL region returns -1 82 * if passed a NULL region returns -1
133 */ 83 */
134static int 84static int
135region_is_child_of_region (const region * child, const region * r) 85region_is_child_of_region (const region * child, const region * r)
136{ 86{
137 87 if (!r)
138 if (r == NULL)
139 return -1; 88 return -1;
140 89
141 if (child == NULL) 90 if (!child)
142 return 0; 91 return 0;
143 92
144 if (!strcmp (child->name, r->name)) 93 if (child->name == r->name)
145 return 1; 94 return 1;
146 95
147 else if (child->parent != NULL) 96 if (child->parent)
148 return region_is_child_of_region (child->parent, r); 97 return region_is_child_of_region (child->parent, r);
149 else 98
150 return 0; 99 return 0;
151} 100}
152 101
153/** Returns an object which is an exit through which the player represented by op should be 102/** Returns an object which is an exit through which the player represented by op should be
154 * sent in order to be imprisoned. If there is no suitable place to which an exit can be 103 * sent in order to be imprisoned. If there is no suitable place to which an exit can be
155 * constructed, then NULL will be returned. The caller is responsible for freeing the object 104 * constructed, then NULL will be returned. The caller is responsible for freeing the object
… …
170 if (reg->jailmap) 119 if (reg->jailmap)
171 { 120 {
172 object *exit = object::create (); 121 object *exit = object::create ();
173 EXIT_PATH (exit) = reg->jailmap; 122 EXIT_PATH (exit) = reg->jailmap;
174 /* damned exits reset savebed and remove teleports, so the prisoner can't escape */ 123 /* damned exits reset savebed and remove teleports, so the prisoner can't escape */
175 SET_FLAG (exit, FLAG_DAMNED); 124 exit->set_flag (FLAG_DAMNED);
176 EXIT_X (exit) = reg->jailx; 125 EXIT_X (exit) = reg->jailx;
177 EXIT_Y (exit) = reg->jaily; 126 EXIT_Y (exit) = reg->jaily;
178 return exit; 127 return exit;
179 } 128 }
180 else 129 else
… …
184 LOG (llevError, "No suitable jailmap for region %s was found.\n", &reg->name); 133 LOG (llevError, "No suitable jailmap for region %s was found.\n", &reg->name);
185 134
186 return 0; 135 return 0;
187} 136}
188 137
138//-GPL
139
189region * 140region *
190region::read (object_thawer &f) 141region::read (object_thawer &f)
191{ 142{
192 assert (f.kw == KW_region); 143 assert (f.kw == KW_region);
193 144
… …
200 for (;;) 151 for (;;)
201 { 152 {
202 switch (f.kw) 153 switch (f.kw)
203 { 154 {
204 case KW_parent: 155 case KW_parent:
205 rgn->parent = region::find (f.get_str ()); 156 f.get (rgn->parent);
206 break; 157 break;
207 158
208 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; 159 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break;
209 case KW_longname: f.get (rgn->longname); break; 160 case KW_longname: f.get (rgn->longname); break;
210 case KW_jail_map: f.get (rgn->jailmap); break; 161 case KW_jail_map: f.get (rgn->jailmap); break;
211 case KW_jail_x: f.get (rgn->jailx); break; 162 case KW_jail_x: f.get (rgn->jailx); break;
212 case KW_jail_y: f.get (rgn->jaily); break; 163 case KW_jail_y: f.get (rgn->jaily); break;
213 case KW_portal_map: f.get (rgn->portalmap);break; 164 case KW_portal_map: f.get (rgn->portalmap);break;
214 case KW_portal_x: f.get (rgn->portalx); break;
215 case KW_portal_y: f.get (rgn->portaly); break;
216 case KW_fallback: f.get (rgn->fallback); break; 165 case KW_fallback: f.get (rgn->fallback); break;
217 case KW_chance: f.get (rgn->treasure_density); break; 166 case KW_chance: f.get (rgn->treasure_density); break;
218 167
219 case KW_randomitems: 168 case KW_randomitems:
220 rgn->treasure = treasurelist::get (f.get_str ()); 169 rgn->treasure = treasurelist::get (f.get_str ());
… …
251 200
252 f.next (); 201 f.next ();
253 } 202 }
254} 203}
255 204
256/*
257 * First initialises the archtype hash-table (init_archetable()).
258 * Reads and parses the archetype file (with the first and second-pass
259 * functions).
260 */
261void
262init_regions (void)
263{
264 if (!regions.size ())
265 {
266 // make sure one region is always available
267 region *rgn = new region;
268 rgn->name = "<builtin>";
269 rgn->longname = "Built-in Region";
270 regions.push_back (rgn);
271 }
272}
273

Diff Legend

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