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.34 by root, Wed Jul 11 16:55:18 2007 UTC vs.
Revision 1.54 by root, Tue Jan 3 11:25:31 2012 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 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 * Crossfire TRT 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 <crossfire@schmorp.de> 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>
25#include <unistd.h> 26#include <unistd.h>
26 27
… …
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}
66
67void
68region::do_destroy ()
69{
70 regions.erase (this);
71
72 attachable::do_destroy ();
73
74 refcnt_dec ();
75}
76
77//+GPL
118 78
119/* 79/*
120 * 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
121 * otherwise returns 0 81 * otherwise returns 0
122 * if passed a NULL region returns -1 82 * if passed a NULL region returns -1
123 */ 83 */
124
125static int 84static int
126region_is_child_of_region (const region * child, const region * r) 85region_is_child_of_region (const region * child, const region * r)
127{ 86{
128 87 if (!r)
129 if (r == NULL)
130 return -1; 88 return -1;
131 89
132 if (child == NULL) 90 if (!child)
133 return 0; 91 return 0;
134 92
135 if (!strcmp (child->name, r->name)) 93 if (child->name == r->name)
136 return 1; 94 return 1;
137 95
138 else if (child->parent != NULL) 96 if (child->parent)
139 return region_is_child_of_region (child->parent, r); 97 return region_is_child_of_region (child->parent, r);
140 else 98
141 return 0; 99 return 0;
142} 100}
143 101
144/** 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
145 * 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
146 * 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
147 * created by this function. 105 * created by this function.
148 */ 106 */
149object * 107object *
150get_jail_exit (object *op) 108get_jail_exit (object *op)
151{ 109{
152 region *reg;
153 object *exit;
154
155 if (op->type != PLAYER) 110 if (op->type != PLAYER)
156 { 111 {
157 LOG (llevError, "region.c: get_jail_exit called against non-player object.\n"); 112 LOG (llevError, "region.c: get_jail_exit called against non-player object.\n");
158 return NULL; 113 return NULL;
159 } 114 }
160 115
161 reg = op->region (); 116 region *reg = op->region ();
162 while (reg) 117 while (reg)
163 { 118 {
164 if (reg->jailmap) 119 if (reg->jailmap)
165 { 120 {
166 exit = object::create (); 121 object *exit = object::create ();
167 EXIT_PATH (exit) = reg->jailmap; 122 EXIT_PATH (exit) = reg->jailmap;
168 /* 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 */
169 SET_FLAG (exit, FLAG_DAMNED); 124 exit->set_flag (FLAG_DAMNED);
170 EXIT_X (exit) = reg->jailx; 125 EXIT_X (exit) = reg->jailx;
171 EXIT_Y (exit) = reg->jaily; 126 EXIT_Y (exit) = reg->jaily;
172 return exit; 127 return exit;
173 } 128 }
174 else 129 else
… …
178 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);
179 134
180 return 0; 135 return 0;
181} 136}
182 137
138//-GPL
139
183region * 140region *
184region::read (object_thawer &f) 141region::read (object_thawer &f)
185{ 142{
186 assert (f.kw == KW_region); 143 assert (f.kw == KW_region);
187 144
188 region *rgn = new region; 145 region *rgn = new region;
146 rgn->refcnt_inc ();
147
189 f.get (rgn->name); 148 f.get (rgn->name);
190 f.next (); 149 f.next ();
191 150
192 for (;;) 151 for (;;)
193 { 152 {
194 switch (f.kw) 153 switch (f.kw)
195 { 154 {
196 case KW_parent: 155 case KW_parent:
197 rgn->parent = region::find (f.get_str ()); 156 f.get (rgn->parent);
198 break; 157 break;
199 158
200 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; 159 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break;
201 case KW_longname: f.get (rgn->longname); break; 160 case KW_longname: f.get (rgn->longname); break;
202 case KW_jail_map: f.get (rgn->jailmap); break; 161 case KW_jail_map: f.get (rgn->jailmap); break;
203 case KW_jail_x: f.get (rgn->jailx); break; 162 case KW_jail_x: f.get (rgn->jailx); break;
204 case KW_jail_y: f.get (rgn->jaily); break; 163 case KW_jail_y: f.get (rgn->jaily); break;
205 case KW_portal_map: f.get (rgn->portalmap);break; 164 case KW_portal_map: f.get (rgn->portalmap);break;
206 case KW_portal_x: f.get (rgn->portalx); break;
207 case KW_portal_y: f.get (rgn->portaly); break;
208 case KW_fallback: f.get (rgn->fallback); break; 165 case KW_fallback: f.get (rgn->fallback); break;
209 case KW_chance: f.get (rgn->treasure_density); break; 166 case KW_chance: f.get (rgn->treasure_density); break;
210 167
211 case KW_randomitems: 168 case KW_randomitems:
212 rgn->treasure = treasurelist::get (f.get_str ()); 169 rgn->treasure = treasurelist::get (f.get_str ());
213 break; 170 break;
214 171
215 case KW_end: 172 case KW_end:
216 f.next (); 173 f.next ();
217 174
175 // cannot use find as that will request the default region
218 for_all_regions (old) 176 for_all_regions (old)
219 if (old->name == rgn->name) 177 if (old->name == rgn->name)
220 { 178 {
221 // replace, copy new values (ugly) 179 old->destroy ();
222 rgn->index = old->index;
223 *old = *rgn;
224 delete rgn;
225
226 return old; 180 break;
227 } 181 }
228 182
229 // just append 183 // just append
230 regions.push_back (rgn); 184 regions.push_back (rgn);
231 return rgn; 185 return rgn;
232 186
233 case KW_ERROR: 187 case KW_ERROR:
234 rgn->set_key (f.kw_str, f.value); 188 rgn->set_key_text (f.kw_str, f.value);
235 //fprintf (stderr, "region addkv(%s,%s)\n", f.kw_str, f.value);//D 189 //fprintf (stderr, "region addkv(%s,%s)\n", f.kw_str, f.value);//D
236 break; 190 break;
237 191
238 default: 192 default:
239 if (!f.parse_error ("region", rgn->name)) 193 if (!f.parse_error ("region", rgn->name))
240 { 194 {
241 delete rgn; 195 rgn->destroy ();
242 return 0; 196 return 0;
243 } 197 }
244 break; 198 break;
245 } 199 }
246 200
247 f.next (); 201 f.next ();
248 } 202 }
249} 203}
250 204
251/*
252 * First initialises the archtype hash-table (init_archetable()).
253 * Reads and parses the archetype file (with the first and second-pass
254 * functions).
255 */
256void
257init_regions (void)
258{
259 if (!regions.size ())
260 {
261 // make sure one region is always available
262 region *rgn = new region;
263 rgn->name = "<builtin>";
264 rgn->longname = "Built-in Region";
265 regions.push_back (rgn);
266 }
267}
268

Diff Legend

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