… | |
… | |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <global.h> |
25 | #include <global.h> |
26 | #include <unistd.h> |
26 | #include <unistd.h> |
27 | |
27 | |
|
|
28 | regionvec regions; |
|
|
29 | |
28 | region * |
30 | region * |
29 | region::default_region () |
31 | region::default_region () |
30 | { |
32 | { |
31 | for (region *reg = first_region; reg; reg = reg->next) |
33 | for_all_regions (rgn) |
32 | if (reg->fallback) |
34 | if (rgn->fallback) |
33 | return reg; |
35 | return rgn; |
34 | |
36 | |
35 | return first_region; |
37 | return regions [0]; |
36 | } |
38 | } |
37 | |
39 | |
38 | /* |
40 | /* |
39 | * Pass a char array, returns a pointer to the region of the same name. |
41 | * Pass a char array, returns a pointer to the region of the same name. |
40 | * if it can't find a region of the same name it returns the first region |
42 | * if it can't find a region of the same name it returns the first region |
… | |
… | |
44 | * used by the map parsing code. |
46 | * used by the map parsing code. |
45 | */ |
47 | */ |
46 | region * |
48 | region * |
47 | region::find (const char *name) |
49 | region::find (const char *name) |
48 | { |
50 | { |
49 | for (region *reg = first_region; reg; reg = reg->next) |
51 | for_all_regions (rgn) |
50 | if (!strcmp (reg->name, name)) |
52 | if (!strcmp (rgn->name, name)) |
51 | return reg; |
53 | return rgn; |
52 | |
54 | |
53 | 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); |
54 | |
56 | |
55 | return default_region (); |
57 | return default_region (); |
56 | } |
58 | } |
… | |
… | |
68 | * |
70 | * |
69 | */ |
71 | */ |
70 | region * |
72 | region * |
71 | region::find_fuzzy (const char *name) |
73 | region::find_fuzzy (const char *name) |
72 | { |
74 | { |
73 | region *reg; |
75 | if (!name) |
74 | char *substr; |
76 | return default_region (); |
75 | char *p; |
|
|
76 | |
77 | |
77 | if (name == NULL) |
|
|
78 | { |
|
|
79 | for (reg = first_region; reg->parent; reg = reg->parent) |
|
|
80 | ; |
|
|
81 | |
|
|
82 | return reg; |
|
|
83 | } |
|
|
84 | |
|
|
85 | p = strchr (name, '\n'); |
78 | char *p = strchr (name, '\n'); |
86 | if (p) |
79 | if (p) |
87 | *p = '\0'; |
80 | *p = '\0'; |
88 | |
81 | |
89 | for (reg = first_region; reg; reg = reg->next) |
82 | for_all_regions (rgn) |
90 | if (!strcasecmp (reg->name, name)) |
83 | if (!strcasecmp (rgn->name, name)) |
91 | return reg; |
84 | return rgn; |
92 | |
85 | |
93 | for (reg = first_region; reg; reg = reg->next) |
86 | for_all_regions (rgn) |
94 | if (reg->longname) |
87 | if (rgn->longname) |
95 | if (!strcasecmp (reg->longname, name)) |
88 | if (!strcasecmp (rgn->longname, name)) |
96 | return reg; |
89 | return rgn; |
97 | |
90 | |
98 | substr = NULL; |
91 | for_all_regions (rgn) |
99 | for (reg = first_region; reg; reg = reg->next) |
|
|
100 | if (reg->longname) |
92 | if (rgn->longname) |
101 | { |
93 | { |
102 | substr = strstr (reg->longname, name); |
94 | if (strstr (rgn->longname, name)) |
103 | if (substr) |
|
|
104 | return reg; |
95 | return rgn; |
105 | } |
96 | } |
106 | |
97 | |
107 | for (reg = first_region; reg; reg = reg->next) |
98 | for_all_regions (rgn) |
108 | if (reg->longname) |
99 | if (rgn->longname) |
109 | { |
100 | { |
110 | /* |
101 | /* |
111 | * This is not a bug, we want the region that is most identifiably a discrete |
102 | * This is not a bug, we want the region that is most identifiably a discrete |
112 | * area in the game, eg if we have 'scor', we want to return 'scorn' and not |
103 | * area in the game, eg if we have 'scor', we want to return 'scorn' and not |
113 | * 'scornarena', regardless of their order on the list so we only look at those |
104 | * 'scornarena', regardless of their order on the list so we only look at those |
114 | * regions with a longname set. |
105 | * regions with a longname set. |
115 | */ |
106 | */ |
116 | substr = strstr (reg->name, name); |
107 | if (strstr (rgn->name, name)) |
117 | if (substr) |
|
|
118 | return reg; |
108 | return rgn; |
119 | } |
109 | } |
120 | |
110 | |
121 | for (reg = first_region; reg; reg = reg->next) |
111 | for_all_regions (rgn) |
122 | { |
112 | { |
123 | substr = strstr (reg->name, name); |
113 | if (strstr (rgn->name, name)) |
124 | if (substr) |
|
|
125 | return reg; |
114 | return rgn; |
126 | } |
|
|
127 | |
|
|
128 | /* if we are still here, we are going to have to give up, and give the top level region */ |
|
|
129 | for (reg = first_region; reg->parent; reg = reg->parent) |
|
|
130 | ; |
115 | } |
131 | |
116 | |
132 | return reg; |
117 | return default_region (); |
133 | } |
118 | } |
134 | |
119 | |
135 | /* |
120 | /* |
136 | * returns 1 if the player is in the region reg, or a child region thereof |
121 | * returns 1 if the player is in the region reg, or a child region thereof |
137 | * otherwise returns 0 |
122 | * otherwise returns 0 |
… | |
… | |
189 | } |
174 | } |
190 | else |
175 | else |
191 | reg = reg->parent; |
176 | reg = reg->parent; |
192 | } |
177 | } |
193 | |
178 | |
194 | LOG (llevDebug, "No suitable jailmap for region %s was found.\n", ®->name); |
179 | LOG (llevError, "No suitable jailmap for region %s was found.\n", ®->name); |
|
|
180 | |
195 | return NULL; |
181 | return 0; |
196 | } |
182 | } |
197 | |
183 | |
198 | static void |
184 | region * |
199 | assign_region_parents (void) |
185 | region::read (object_thawer &f) |
200 | { |
186 | { |
201 | region *reg; |
187 | assert (f.kw == KW_region); |
202 | uint32 parent_count = 0; |
|
|
203 | uint32 region_count = 0; |
|
|
204 | |
188 | |
205 | for (reg = first_region; reg && reg->next; reg = reg->next) |
189 | region *rgn = new region; |
|
|
190 | f.get (rgn->name); |
|
|
191 | f.next (); |
|
|
192 | |
|
|
193 | for (;;) |
206 | { |
194 | { |
207 | if (reg->parent_name) |
195 | switch (f.kw) |
208 | { |
196 | { |
|
|
197 | case KW_parent: |
209 | reg->parent = region::find (reg->parent_name); |
198 | rgn->parent = region::find (f.get_str ()); |
210 | parent_count++; |
199 | break; |
|
|
200 | |
|
|
201 | case KW_longname: f.get (rgn->longname); break; |
|
|
202 | case KW_match: f.get (rgn->match); break; |
|
|
203 | case KW_jail_map: f.get (rgn->jailmap); break; |
|
|
204 | case KW_jail_x: f.get (rgn->jailx); break; |
|
|
205 | case KW_jail_y: f.get (rgn->jaily); break; |
|
|
206 | case KW_fallback: f.get (rgn->fallback); break; |
|
|
207 | case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; |
|
|
208 | |
|
|
209 | case KW_end: |
|
|
210 | f.next (); |
|
|
211 | |
|
|
212 | for_all_regions (old) |
|
|
213 | if (old->name == rgn->name) |
|
|
214 | { |
|
|
215 | // replace, copy new values (ugly) |
|
|
216 | rgn->index = old->index; |
|
|
217 | *old = *rgn; |
|
|
218 | delete rgn; |
|
|
219 | |
|
|
220 | return old; |
|
|
221 | } |
|
|
222 | |
|
|
223 | // just append |
|
|
224 | regions.push_back (rgn); |
|
|
225 | return rgn; |
|
|
226 | |
|
|
227 | default: |
|
|
228 | if (!f.parse_error ("region", rgn->name)) |
|
|
229 | { |
|
|
230 | delete rgn; |
|
|
231 | return 0; |
|
|
232 | } |
|
|
233 | break; |
211 | } |
234 | } |
212 | |
235 | |
213 | region_count++; |
236 | f.next (); |
214 | } |
|
|
215 | |
|
|
216 | LOG (llevDebug, "Assigned %u regions with %u parents.\n", region_count, parent_count); |
|
|
217 | } |
|
|
218 | |
|
|
219 | /* |
|
|
220 | * Reads/parses the region file, and copies into a linked list |
|
|
221 | * of region structs. |
|
|
222 | */ |
|
|
223 | static bool |
|
|
224 | parse_regions (object_thawer &fp) |
|
|
225 | { |
|
|
226 | region *newreg; |
|
|
227 | region *reg; |
|
|
228 | |
|
|
229 | newreg = NULL; |
|
|
230 | for (;;) |
|
|
231 | { |
|
|
232 | keyword kw = fp.get_kv (); |
|
|
233 | |
|
|
234 | switch (kw) |
|
|
235 | { |
|
|
236 | case KW_EOF: |
|
|
237 | if (newreg) |
|
|
238 | { |
|
|
239 | LOG (llevError, "%s: end of file while reading regions.\n", fp.name); |
|
|
240 | return false; |
|
|
241 | } |
|
|
242 | else |
|
|
243 | return true; |
|
|
244 | |
|
|
245 | case KW_end: |
|
|
246 | /* Place this new region last on the list, if the list is empty put it first */ |
|
|
247 | for (reg = first_region; reg && reg->next; reg = reg->next) |
|
|
248 | ; |
|
|
249 | |
|
|
250 | if (!reg) |
|
|
251 | first_region = newreg; |
|
|
252 | else |
|
|
253 | reg->next = newreg; |
|
|
254 | |
|
|
255 | newreg = 0; |
|
|
256 | break; |
|
|
257 | |
|
|
258 | default: |
|
|
259 | case KW_ERROR: |
|
|
260 | LOG (llevError, "%s: skipping errornous line (%s) while reading regions.\n", fp.name, fp.last_keyword); |
|
|
261 | break; |
|
|
262 | |
|
|
263 | case KW_region: |
|
|
264 | newreg = new region; |
|
|
265 | fp.get (newreg->name); |
|
|
266 | break; |
|
|
267 | |
|
|
268 | case KW_parent: |
|
|
269 | /* |
|
|
270 | * Note that this is in the initialisation code, so we don't actually |
|
|
271 | * assign the pointer to the parent yet, because it might not have been |
|
|
272 | * parsed. |
|
|
273 | */ |
|
|
274 | fp.get (newreg->parent_name); |
|
|
275 | break; |
|
|
276 | |
|
|
277 | case KW_longname: |
|
|
278 | newreg->longname = strdup (fp.get_str ()); |
|
|
279 | break; |
|
|
280 | |
|
|
281 | case KW_jail_map: |
|
|
282 | fp.get (newreg->jailmap); |
|
|
283 | break; |
|
|
284 | |
|
|
285 | case KW_jail_x: |
|
|
286 | fp.get (newreg->jailx); |
|
|
287 | break; |
|
|
288 | |
|
|
289 | case KW_jail_y: |
|
|
290 | fp.get (newreg->jaily); |
|
|
291 | break; |
|
|
292 | |
|
|
293 | case KW_msg: |
|
|
294 | fp.get_ml (KW_endmsg, newreg->msg); |
|
|
295 | break; |
|
|
296 | |
|
|
297 | case KW_fallback: |
|
|
298 | fp.get (newreg->fallback); |
|
|
299 | break; |
|
|
300 | |
|
|
301 | case KW_nomore: |
|
|
302 | /* we have reached the end of the region specs.... */ |
|
|
303 | return true; |
|
|
304 | } |
|
|
305 | } |
237 | } |
306 | } |
238 | } |
307 | |
239 | |
308 | /* |
240 | /* |
309 | * First initialises the archtype hash-table (init_archetable()). |
241 | * First initialises the archtype hash-table (init_archetable()). |
310 | * Reads and parses the archetype file (with the first and second-pass |
242 | * Reads and parses the archetype file (with the first and second-pass |
311 | * functions). |
243 | * functions). |
312 | * Then initialises treasures by calling load_treasures(). |
|
|
313 | */ |
244 | */ |
314 | void |
245 | void |
315 | init_regions (void) |
246 | init_regions (void) |
316 | { |
247 | { |
317 | char filename[MAX_BUF]; |
248 | if (!regions.size ()) |
318 | int comp; |
249 | { |
319 | |
|
|
320 | if (first_region != NULL) /* Only do this once */ |
|
|
321 | return; |
|
|
322 | |
|
|
323 | // make sure one region is always available |
250 | // make sure one region is always available |
324 | first_region = new region; |
251 | region *rgn = new region; |
325 | first_region->name = "<builtin>"; |
252 | rgn->name = "<builtin>"; |
326 | first_region->longname = strdup ("Built-in Region"); |
253 | rgn->longname = "Built-in Region"; |
327 | |
254 | regions.push_back (rgn); |
328 | sprintf (filename, "%s/%s/%s", settings.datadir, settings.mapdir, settings.regions); |
|
|
329 | LOG (llevDebug, "Reading regions from %s...\n", filename); |
|
|
330 | |
|
|
331 | object_thawer fp (filename); |
|
|
332 | |
|
|
333 | if (!fp) |
|
|
334 | { |
255 | } |
335 | LOG (llevError, " Can't open regions file %s in init_regions.\n", filename); |
|
|
336 | return; |
|
|
337 | } |
|
|
338 | |
|
|
339 | parse_regions (fp); |
|
|
340 | |
|
|
341 | assign_region_parents (); |
|
|
342 | LOG (llevDebug, " done\n"); |
|
|
343 | } |
256 | } |
|
|
257 | |