1 |
/* |
2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
* |
4 |
* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 |
* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 |
* Copyright (©) 1992,2007 Frank Tore Johansen |
7 |
* |
8 |
* Deliantra is free software: you can redistribute it and/or modify |
9 |
* it under the terms of the GNU General Public License as published by |
10 |
* the Free Software Foundation, either version 3 of the License, or |
11 |
* (at your option) any later version. |
12 |
* |
13 |
* This program is distributed in the hope that it will be useful, |
14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 |
* GNU General Public License for more details. |
17 |
* |
18 |
* You should have received a copy of the GNU General Public License |
19 |
* along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 |
* |
21 |
* The authors can be reached via e-mail to <support@deliantra.net> |
22 |
*/ |
23 |
|
24 |
#include <global.h> |
25 |
#include <unistd.h> |
26 |
|
27 |
regionvec regions; |
28 |
|
29 |
region * |
30 |
region::default_region () |
31 |
{ |
32 |
for_all_regions (rgn) |
33 |
if (rgn->fallback) |
34 |
return rgn; |
35 |
|
36 |
return regions [0]; |
37 |
} |
38 |
|
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 |
*/ |
47 |
region * |
48 |
region::find (const char *name) |
49 |
{ |
50 |
for_all_regions (rgn) |
51 |
if (!strcmp (rgn->name, name)) |
52 |
return rgn; |
53 |
|
54 |
LOG (llevError, "region called %s requested, but not found, using fallback.\n", name); |
55 |
|
56 |
return default_region (); |
57 |
} |
58 |
|
59 |
/* |
60 |
* Tries to find a region that 'name' corresponds to. |
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 |
*/ |
71 |
region * |
72 |
region::find_fuzzy (const char *name) |
73 |
{ |
74 |
if (!name) |
75 |
return default_region (); |
76 |
|
77 |
char *p = strchr (name, '\n'); |
78 |
if (p) |
79 |
*p = '\0'; |
80 |
|
81 |
for_all_regions (rgn) |
82 |
if (!strcasecmp (rgn->name, name)) |
83 |
return rgn; |
84 |
|
85 |
for_all_regions (rgn) |
86 |
if (rgn->longname) |
87 |
if (!strcasecmp (rgn->longname, name)) |
88 |
return rgn; |
89 |
|
90 |
for_all_regions (rgn) |
91 |
if (rgn->longname) |
92 |
{ |
93 |
if (strstr (rgn->longname, name)) |
94 |
return rgn; |
95 |
} |
96 |
|
97 |
for_all_regions (rgn) |
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 |
|
110 |
for_all_regions (rgn) |
111 |
{ |
112 |
if (strstr (rgn->name, name)) |
113 |
return rgn; |
114 |
} |
115 |
|
116 |
return default_region (); |
117 |
} |
118 |
|
119 |
void |
120 |
region::do_destroy () |
121 |
{ |
122 |
regions.erase (this); |
123 |
|
124 |
attachable::do_destroy (); |
125 |
|
126 |
refcnt_dec (); |
127 |
} |
128 |
|
129 |
/* |
130 |
* returns 1 if the player is in the region reg, or a child region thereof |
131 |
* otherwise returns 0 |
132 |
* if passed a NULL region returns -1 |
133 |
*/ |
134 |
static int |
135 |
region_is_child_of_region (const region * child, const region * r) |
136 |
{ |
137 |
|
138 |
if (r == NULL) |
139 |
return -1; |
140 |
|
141 |
if (child == NULL) |
142 |
return 0; |
143 |
|
144 |
if (!strcmp (child->name, r->name)) |
145 |
return 1; |
146 |
|
147 |
else if (child->parent != NULL) |
148 |
return region_is_child_of_region (child->parent, r); |
149 |
else |
150 |
return 0; |
151 |
} |
152 |
|
153 |
/** 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 |
155 |
* constructed, then NULL will be returned. The caller is responsible for freeing the object |
156 |
* created by this function. |
157 |
*/ |
158 |
object * |
159 |
get_jail_exit (object *op) |
160 |
{ |
161 |
if (op->type != PLAYER) |
162 |
{ |
163 |
LOG (llevError, "region.c: get_jail_exit called against non-player object.\n"); |
164 |
return NULL; |
165 |
} |
166 |
|
167 |
region *reg = op->region (); |
168 |
while (reg) |
169 |
{ |
170 |
if (reg->jailmap) |
171 |
{ |
172 |
object *exit = object::create (); |
173 |
EXIT_PATH (exit) = reg->jailmap; |
174 |
/* damned exits reset savebed and remove teleports, so the prisoner can't escape */ |
175 |
SET_FLAG (exit, FLAG_DAMNED); |
176 |
EXIT_X (exit) = reg->jailx; |
177 |
EXIT_Y (exit) = reg->jaily; |
178 |
return exit; |
179 |
} |
180 |
else |
181 |
reg = reg->parent; |
182 |
} |
183 |
|
184 |
LOG (llevError, "No suitable jailmap for region %s was found.\n", ®->name); |
185 |
|
186 |
return 0; |
187 |
} |
188 |
|
189 |
region * |
190 |
region::read (object_thawer &f) |
191 |
{ |
192 |
assert (f.kw == KW_region); |
193 |
|
194 |
region *rgn = new region; |
195 |
rgn->refcnt_inc (); |
196 |
|
197 |
f.get (rgn->name); |
198 |
f.next (); |
199 |
|
200 |
for (;;) |
201 |
{ |
202 |
switch (f.kw) |
203 |
{ |
204 |
case KW_parent: |
205 |
rgn->parent = region::find (f.get_str ()); |
206 |
break; |
207 |
|
208 |
case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; |
209 |
case KW_longname: f.get (rgn->longname); break; |
210 |
case KW_jail_map: f.get (rgn->jailmap); break; |
211 |
case KW_jail_x: f.get (rgn->jailx); break; |
212 |
case KW_jail_y: f.get (rgn->jaily); break; |
213 |
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; |
217 |
case KW_chance: f.get (rgn->treasure_density); break; |
218 |
|
219 |
case KW_randomitems: |
220 |
rgn->treasure = treasurelist::get (f.get_str ()); |
221 |
break; |
222 |
|
223 |
case KW_end: |
224 |
f.next (); |
225 |
|
226 |
// cannot use find as that will request the default region |
227 |
for_all_regions (old) |
228 |
if (old->name == rgn->name) |
229 |
{ |
230 |
old->destroy (); |
231 |
break; |
232 |
} |
233 |
|
234 |
// just append |
235 |
regions.push_back (rgn); |
236 |
return rgn; |
237 |
|
238 |
case KW_ERROR: |
239 |
rgn->set_key_text (f.kw_str, f.value); |
240 |
//fprintf (stderr, "region addkv(%s,%s)\n", f.kw_str, f.value);//D |
241 |
break; |
242 |
|
243 |
default: |
244 |
if (!f.parse_error ("region", rgn->name)) |
245 |
{ |
246 |
rgn->destroy (); |
247 |
return 0; |
248 |
} |
249 |
break; |
250 |
} |
251 |
|
252 |
f.next (); |
253 |
} |
254 |
} |
255 |
|
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 |
*/ |
261 |
void |
262 |
init_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 |
|