1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program 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 2 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, write to the Free Software |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * <http://www.gnu.org/licenses/>. |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <global.h> |
25 | #include <global.h> |
26 | #include <unistd.h> |
26 | #include <unistd.h> |
27 | |
|
|
28 | #include "loader.h" |
|
|
29 | |
27 | |
30 | regionvec regions; |
28 | regionvec regions; |
31 | |
29 | |
32 | region * |
30 | region * |
33 | region::default_region () |
31 | region::default_region () |
… | |
… | |
46 | * if it can't find a matching name /or/ a fallback region it logs an info message |
44 | * if it can't find a matching name /or/ a fallback region it logs an info message |
47 | * message and returns NULL |
45 | * message and returns NULL |
48 | * used by the map parsing code. |
46 | * used by the map parsing code. |
49 | */ |
47 | */ |
50 | region * |
48 | region * |
51 | region::find (const char *name) |
49 | region::find (shstr_cmp name) |
52 | { |
50 | { |
53 | for_all_regions (rgn) |
51 | for_all_regions (rgn) |
54 | if (!strcmp (rgn->name, name)) |
52 | if (rgn->name == name) |
55 | return rgn; |
53 | return rgn; |
56 | |
54 | |
57 | LOG (llevError, "region called %s requested, but not found, using fallback.\n", name); |
55 | LOG (llevError, "region called %s requested, but not found, using fallback.\n", &name); |
58 | |
56 | |
59 | return default_region (); |
57 | return default_region (); |
60 | } |
58 | } |
61 | |
59 | |
62 | /* |
60 | void |
63 | * Tries to find a region that 'name' corresponds to. |
61 | region::do_destroy () |
64 | * It looks, in order, for: |
|
|
65 | * an exact match to region name (case insensitive) |
|
|
66 | * an exact match to longname (case insensitive) |
|
|
67 | * a substring that matches to the longname (eg Kingdom) |
|
|
68 | * a substring that matches to the region name (eg nav) |
|
|
69 | * if it can find none of these it returns the first parentless region |
|
|
70 | * (there should be only one of these - the top level one) |
|
|
71 | * If we got a NULL, then just return the top level region |
|
|
72 | * |
|
|
73 | */ |
|
|
74 | region * |
|
|
75 | region::find_fuzzy (const char *name) |
|
|
76 | { |
62 | { |
77 | if (!name) |
63 | regions.erase (this); |
78 | return default_region (); |
|
|
79 | |
64 | |
80 | char *p = strchr (name, '\n'); |
65 | attachable::do_destroy (); |
81 | if (p) |
|
|
82 | *p = '\0'; |
|
|
83 | |
66 | |
84 | for_all_regions (rgn) |
67 | refcnt_dec (); |
85 | if (!strcasecmp (rgn->name, name)) |
|
|
86 | return rgn; |
|
|
87 | |
|
|
88 | for_all_regions (rgn) |
|
|
89 | if (rgn->longname) |
|
|
90 | if (!strcasecmp (rgn->longname, name)) |
|
|
91 | return rgn; |
|
|
92 | |
|
|
93 | for_all_regions (rgn) |
|
|
94 | if (rgn->longname) |
|
|
95 | { |
|
|
96 | if (strstr (rgn->longname, name)) |
|
|
97 | return rgn; |
|
|
98 | } |
|
|
99 | |
|
|
100 | for_all_regions (rgn) |
|
|
101 | if (rgn->longname) |
|
|
102 | { |
|
|
103 | /* |
|
|
104 | * This is not a bug, we want the region that is most identifiably a discrete |
|
|
105 | * area in the game, eg if we have 'scor', we want to return 'scorn' and not |
|
|
106 | * 'scornarena', regardless of their order on the list so we only look at those |
|
|
107 | * regions with a longname set. |
|
|
108 | */ |
|
|
109 | if (strstr (rgn->name, name)) |
|
|
110 | return rgn; |
|
|
111 | } |
|
|
112 | |
|
|
113 | for_all_regions (rgn) |
|
|
114 | { |
|
|
115 | if (strstr (rgn->name, name)) |
|
|
116 | return rgn; |
|
|
117 | } |
|
|
118 | |
|
|
119 | return default_region (); |
|
|
120 | } |
68 | } |
121 | |
69 | |
122 | /* |
70 | /* |
123 | * returns 1 if the player is in the region reg, or a child region thereof |
71 | * returns 1 if the player is in the region reg, or a child region thereof |
124 | * otherwise returns 0 |
72 | * otherwise returns 0 |
125 | * if passed a NULL region returns -1 |
73 | * if passed a NULL region returns -1 |
126 | */ |
74 | */ |
127 | |
|
|
128 | static int |
75 | static int |
129 | region_is_child_of_region (const region * child, const region * r) |
76 | region_is_child_of_region (const region * child, const region * r) |
130 | { |
77 | { |
131 | |
78 | if (!r) |
132 | if (r == NULL) |
|
|
133 | return -1; |
79 | return -1; |
134 | |
80 | |
135 | if (child == NULL) |
81 | if (!child) |
136 | return 0; |
82 | return 0; |
137 | |
83 | |
138 | if (!strcmp (child->name, r->name)) |
84 | if (child->name == r->name) |
139 | return 1; |
85 | return 1; |
140 | |
86 | |
141 | else if (child->parent != NULL) |
87 | if (child->parent) |
142 | return region_is_child_of_region (child->parent, r); |
88 | return region_is_child_of_region (child->parent, r); |
143 | else |
89 | |
144 | return 0; |
90 | return 0; |
145 | } |
91 | } |
146 | |
92 | |
147 | /** Returns an object which is an exit through which the player represented by op should be |
93 | /** Returns an object which is an exit through which the player represented by op should be |
148 | * sent in order to be imprisoned. If there is no suitable place to which an exit can be |
94 | * sent in order to be imprisoned. If there is no suitable place to which an exit can be |
149 | * constructed, then NULL will be returned. The caller is responsible for freeing the object |
95 | * constructed, then NULL will be returned. The caller is responsible for freeing the object |
150 | * created by this function. |
96 | * created by this function. |
151 | */ |
97 | */ |
152 | object * |
98 | object * |
153 | get_jail_exit (object *op) |
99 | get_jail_exit (object *op) |
154 | { |
100 | { |
155 | region *reg; |
|
|
156 | object *exit; |
|
|
157 | |
|
|
158 | if (op->type != PLAYER) |
101 | if (op->type != PLAYER) |
159 | { |
102 | { |
160 | LOG (llevError, "region.c: get_jail_exit called against non-player object.\n"); |
103 | LOG (llevError, "region.c: get_jail_exit called against non-player object.\n"); |
161 | return NULL; |
104 | return NULL; |
162 | } |
105 | } |
163 | |
106 | |
164 | reg = op->region (); |
107 | region *reg = op->region (); |
165 | while (reg) |
108 | while (reg) |
166 | { |
109 | { |
167 | if (reg->jailmap) |
110 | if (reg->jailmap) |
168 | { |
111 | { |
169 | exit = object::create (); |
112 | object *exit = object::create (); |
170 | EXIT_PATH (exit) = reg->jailmap; |
113 | EXIT_PATH (exit) = reg->jailmap; |
171 | /* damned exits reset savebed and remove teleports, so the prisoner can't escape */ |
114 | /* damned exits reset savebed and remove teleports, so the prisoner can't escape */ |
172 | SET_FLAG (exit, FLAG_DAMNED); |
115 | SET_FLAG (exit, FLAG_DAMNED); |
173 | EXIT_X (exit) = reg->jailx; |
116 | EXIT_X (exit) = reg->jailx; |
174 | EXIT_Y (exit) = reg->jaily; |
117 | EXIT_Y (exit) = reg->jaily; |
… | |
… | |
181 | LOG (llevError, "No suitable jailmap for region %s was found.\n", ®->name); |
124 | LOG (llevError, "No suitable jailmap for region %s was found.\n", ®->name); |
182 | |
125 | |
183 | return 0; |
126 | return 0; |
184 | } |
127 | } |
185 | |
128 | |
186 | region *loader_region::get_region (const char *name) |
129 | region * |
|
|
130 | region::read (object_thawer &f) |
187 | { |
131 | { |
|
|
132 | assert (f.kw == KW_region); |
|
|
133 | |
188 | region *rgn = new region; |
134 | region *rgn = new region; |
189 | rgn->name = name; |
135 | rgn->refcnt_inc (); |
190 | return rgn; |
|
|
191 | } |
|
|
192 | |
136 | |
193 | void loader_region::put_region (region *rgn) |
137 | f.get (rgn->name); |
194 | { |
138 | f.next (); |
195 | for_all_regions (old) |
|
|
196 | if (old->name == rgn->name) |
|
|
197 | { |
|
|
198 | // replace, copy new values (ugly) |
|
|
199 | rgn->index = old->index; |
|
|
200 | *old = *rgn; |
|
|
201 | delete rgn; |
|
|
202 | |
139 | |
203 | return; |
|
|
204 | } |
|
|
205 | |
|
|
206 | // just append |
|
|
207 | regions.push_back (rgn); |
|
|
208 | } |
|
|
209 | |
|
|
210 | bool |
|
|
211 | loader_base::parse_region (object_thawer &thawer, region *rgn) |
|
|
212 | { |
|
|
213 | for (;;) |
140 | for (;;) |
214 | { |
141 | { |
215 | keyword kw = thawer.get_kv (); |
|
|
216 | |
|
|
217 | switch (kw) |
142 | switch (f.kw) |
218 | { |
143 | { |
219 | case KW_parent: |
144 | case KW_parent: |
220 | rgn->parent = region::find (thawer.get_str ()); |
145 | rgn->parent = region::find (f.get_str ()); |
221 | break; |
|
|
222 | |
|
|
223 | case KW_longname: |
|
|
224 | thawer.get (rgn->longname); |
|
|
225 | break; |
146 | break; |
226 | |
147 | |
227 | case KW_jail_map: |
148 | case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; |
228 | thawer.get (rgn->jailmap); |
149 | case KW_longname: f.get (rgn->longname); break; |
229 | break; |
150 | case KW_jail_map: f.get (rgn->jailmap); break; |
|
|
151 | case KW_jail_x: f.get (rgn->jailx); break; |
|
|
152 | case KW_jail_y: f.get (rgn->jaily); break; |
|
|
153 | case KW_portal_map: f.get (rgn->portalmap);break; |
|
|
154 | case KW_portal_x: f.get (rgn->portalx); break; |
|
|
155 | case KW_portal_y: f.get (rgn->portaly); break; |
|
|
156 | case KW_fallback: f.get (rgn->fallback); break; |
|
|
157 | case KW_chance: f.get (rgn->treasure_density); break; |
230 | |
158 | |
231 | case KW_jail_x: |
|
|
232 | thawer.get (rgn->jailx); |
|
|
233 | break; |
|
|
234 | |
|
|
235 | case KW_jail_y: |
|
|
236 | thawer.get (rgn->jaily); |
|
|
237 | break; |
|
|
238 | |
|
|
239 | case KW_msg: |
159 | case KW_randomitems: |
240 | thawer.get_ml (KW_endmsg, rgn->msg); |
160 | rgn->treasure = treasurelist::get (f.get_str ()); |
241 | break; |
|
|
242 | |
|
|
243 | case KW_fallback: |
|
|
244 | thawer.get (rgn->fallback); |
|
|
245 | break; |
161 | break; |
246 | |
162 | |
247 | case KW_end: |
163 | case KW_end: |
|
|
164 | f.next (); |
|
|
165 | |
|
|
166 | // cannot use find as that will request the default region |
|
|
167 | for_all_regions (old) |
|
|
168 | if (old->name == rgn->name) |
|
|
169 | { |
|
|
170 | old->destroy (); |
|
|
171 | break; |
|
|
172 | } |
|
|
173 | |
|
|
174 | // just append |
|
|
175 | regions.push_back (rgn); |
248 | return true; |
176 | return rgn; |
|
|
177 | |
|
|
178 | case KW_ERROR: |
|
|
179 | rgn->set_key_text (f.kw_str, f.value); |
|
|
180 | //fprintf (stderr, "region addkv(%s,%s)\n", f.kw_str, f.value);//D |
|
|
181 | break; |
249 | |
182 | |
250 | default: |
183 | default: |
251 | if (!thawer.parse_error (kw, "region", rgn->name)) |
184 | if (!f.parse_error ("region", rgn->name)) |
|
|
185 | { |
|
|
186 | rgn->destroy (); |
252 | return false; |
187 | return 0; |
|
|
188 | } |
253 | break; |
189 | break; |
254 | } |
190 | } |
|
|
191 | |
|
|
192 | f.next (); |
255 | } |
193 | } |
256 | } |
194 | } |
257 | |
195 | |
258 | /* |
196 | /* |
259 | * First initialises the archtype hash-table (init_archetable()). |
197 | * First initialises the archtype hash-table (init_archetable()). |
260 | * Reads and parses the archetype file (with the first and second-pass |
198 | * Reads and parses the archetype file (with the first and second-pass |
261 | * functions). |
199 | * functions). |
262 | * Then initialises treasures by calling load_treasures(). |
|
|
263 | */ |
200 | */ |
264 | void |
201 | void |
265 | init_regions (void) |
202 | init_regions (void) |
266 | { |
203 | { |
267 | char filename[MAX_BUF]; |
|
|
268 | int comp; |
|
|
269 | |
|
|
270 | if (!regions.size ()) |
204 | if (!regions.size ()) |
271 | { |
205 | { |
272 | // make sure one region is always available |
206 | // make sure one region is always available |
273 | region *rgn = new region; |
207 | region *rgn = new region; |
274 | rgn->name = "<builtin>"; |
208 | rgn->name = "<builtin>"; |
275 | rgn->longname = "Built-in Region"; |
209 | rgn->longname = "Built-in Region"; |
276 | regions.push_back (rgn); |
210 | regions.push_back (rgn); |
277 | } |
211 | } |
278 | |
|
|
279 | sprintf (filename, "%s/%s/%s", settings.datadir, settings.mapdir, settings.regions); |
|
|
280 | LOG (llevDebug, "Reading regions from %s...\n", filename); |
|
|
281 | |
|
|
282 | loader_region loader; |
|
|
283 | |
|
|
284 | if (!loader.load (filename)) |
|
|
285 | { |
|
|
286 | LOG (llevError, "Can't open regions file %s in init_regions.\n", filename); |
|
|
287 | return; |
|
|
288 | } |
|
|
289 | |
|
|
290 | LOG (llevDebug, " done\n"); |
|
|
291 | } |
212 | } |
|
|
213 | |