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,2008 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 | */ |
|
|
47 | region * |
40 | region * |
48 | region::find (shstr_cmp name) |
41 | region::find (shstr_cmp name) |
49 | { |
42 | { |
50 | for_all_regions (rgn) |
43 | for_all_regions (rgn) |
51 | if (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 | /* |
|
|
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 * |
50 | region * |
72 | region::find_fuzzy (const char *name) |
51 | region::find (object_thawer &f) |
73 | { |
52 | { |
74 | if (!name) |
53 | shstr_cmp name = f.get_str (); |
75 | return default_region (); |
|
|
76 | |
|
|
77 | // TODO: bug, changes possibly const string |
|
|
78 | char *p = strchr (name, '\n'); |
|
|
79 | if (p) |
|
|
80 | *p = '\0'; |
|
|
81 | |
54 | |
82 | for_all_regions (rgn) |
55 | for_all_regions (rgn) |
83 | if (rgn->name.eq_nc (name)) |
56 | if (rgn->name == name) |
84 | return rgn; |
57 | return rgn; |
85 | |
58 | |
86 | for_all_regions (rgn) |
59 | f.parse_error (format ("region called %s requested, but not found, using fallback.\n", f.get_str ())); |
87 | if (rgn->longname.eq_nc (name)) |
|
|
88 | return rgn; |
|
|
89 | |
|
|
90 | for_all_regions (rgn) |
|
|
91 | if (rgn->longname.contains (name)) |
|
|
92 | return rgn; |
|
|
93 | |
|
|
94 | for_all_regions (rgn) |
|
|
95 | /* |
|
|
96 | * This is not a bug, we want the region that is most identifiably a discrete |
|
|
97 | * area in the game, eg if we have 'scor', we want to return 'scorn' and not |
|
|
98 | * 'scornarena', regardless of their order on the list so we only look at those |
|
|
99 | * regions with a longname set. |
|
|
100 | */ |
|
|
101 | if (rgn->longname && rgn->name.contains (name)) |
|
|
102 | return rgn; |
|
|
103 | |
|
|
104 | for_all_regions (rgn) |
|
|
105 | if (rgn->name.contains (name)) |
|
|
106 | return rgn; |
|
|
107 | |
60 | |
108 | return default_region (); |
61 | return default_region (); |
109 | } |
62 | } |
110 | |
63 | |
111 | void |
64 | void |
… | |
… | |
115 | |
68 | |
116 | attachable::do_destroy (); |
69 | attachable::do_destroy (); |
117 | |
70 | |
118 | refcnt_dec (); |
71 | refcnt_dec (); |
119 | } |
72 | } |
|
|
73 | |
|
|
74 | //+GPL |
120 | |
75 | |
121 | /* |
76 | /* |
122 | * returns 1 if the player is in the region reg, or a child region thereof |
77 | * returns 1 if the player is in the region reg, or a child region thereof |
123 | * otherwise returns 0 |
78 | * otherwise returns 0 |
124 | * if passed a NULL region returns -1 |
79 | * if passed a NULL region returns -1 |
… | |
… | |
161 | if (reg->jailmap) |
116 | if (reg->jailmap) |
162 | { |
117 | { |
163 | object *exit = object::create (); |
118 | object *exit = object::create (); |
164 | EXIT_PATH (exit) = reg->jailmap; |
119 | EXIT_PATH (exit) = reg->jailmap; |
165 | /* damned exits reset savebed and remove teleports, so the prisoner can't escape */ |
120 | /* damned exits reset savebed and remove teleports, so the prisoner can't escape */ |
166 | SET_FLAG (exit, FLAG_DAMNED); |
121 | exit->set_flag (FLAG_DAMNED); |
167 | EXIT_X (exit) = reg->jailx; |
122 | EXIT_X (exit) = reg->jailx; |
168 | EXIT_Y (exit) = reg->jaily; |
123 | EXIT_Y (exit) = reg->jaily; |
169 | return exit; |
124 | return exit; |
170 | } |
125 | } |
171 | else |
126 | else |
… | |
… | |
175 | LOG (llevError, "No suitable jailmap for region %s was found.\n", ®->name); |
130 | LOG (llevError, "No suitable jailmap for region %s was found.\n", ®->name); |
176 | |
131 | |
177 | return 0; |
132 | return 0; |
178 | } |
133 | } |
179 | |
134 | |
|
|
135 | //-GPL |
|
|
136 | |
180 | region * |
137 | region * |
181 | region::read (object_thawer &f) |
138 | region::read (object_thawer &f) |
182 | { |
139 | { |
183 | assert (f.kw == KW_region); |
140 | assert (f.kw == KW_region); |
184 | |
141 | |
… | |
… | |
191 | for (;;) |
148 | for (;;) |
192 | { |
149 | { |
193 | switch (f.kw) |
150 | switch (f.kw) |
194 | { |
151 | { |
195 | case KW_parent: |
152 | case KW_parent: |
196 | rgn->parent = region::find (f.get_str ()); |
153 | rgn->parent = region::find (f); |
197 | break; |
154 | break; |
198 | |
155 | |
199 | case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; |
156 | case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; |
200 | case KW_longname: f.get (rgn->longname); break; |
157 | case KW_longname: f.get (rgn->longname); break; |
201 | case KW_jail_map: f.get (rgn->jailmap); break; |
158 | case KW_jail_map: f.get (rgn->jailmap); break; |
202 | case KW_jail_x: f.get (rgn->jailx); break; |
159 | case KW_jail_x: f.get (rgn->jailx); break; |
203 | case KW_jail_y: f.get (rgn->jaily); break; |
160 | case KW_jail_y: f.get (rgn->jaily); break; |
204 | case KW_portal_map: f.get (rgn->portalmap);break; |
161 | case KW_portal_map: f.get (rgn->portalmap);break; |
205 | case KW_portal_x: f.get (rgn->portalx); break; |
|
|
206 | case KW_portal_y: f.get (rgn->portaly); break; |
|
|
207 | case KW_fallback: f.get (rgn->fallback); break; |
162 | case KW_fallback: f.get (rgn->fallback); break; |
208 | case KW_chance: f.get (rgn->treasure_density); break; |
163 | case KW_chance: f.get (rgn->treasure_density); break; |
209 | |
164 | |
210 | case KW_randomitems: |
165 | case KW_randomitems: |
211 | rgn->treasure = treasurelist::get (f.get_str ()); |
166 | rgn->treasure = treasurelist::get (f.get_str ()); |
… | |
… | |
242 | |
197 | |
243 | f.next (); |
198 | f.next (); |
244 | } |
199 | } |
245 | } |
200 | } |
246 | |
201 | |
247 | /* |
|
|
248 | * First initialises the archtype hash-table (init_archetable()). |
|
|
249 | * Reads and parses the archetype file (with the first and second-pass |
|
|
250 | * functions). |
|
|
251 | */ |
|
|
252 | void |
|
|
253 | init_regions (void) |
|
|
254 | { |
|
|
255 | if (!regions.size ()) |
|
|
256 | { |
|
|
257 | // make sure one region is always available |
|
|
258 | region *rgn = new region; |
|
|
259 | rgn->name = "<builtin>"; |
|
|
260 | rgn->longname = "Built-in Region"; |
|
|
261 | regions.push_back (rgn); |
|
|
262 | } |
|
|
263 | } |
|
|
264 | |
|
|