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 (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
20 | |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
|
|
22 | */ |
22 | */ |
23 | |
|
|
24 | |
23 | |
25 | #include <global.h> |
24 | #include <global.h> |
26 | #include <unistd.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 | } |
27 | |
38 | |
28 | /* |
39 | /* |
29 | * Pass a char array, returns a pointer to the region of the same name. |
40 | * Pass a char array, returns a pointer to the region of the same name. |
30 | * if it can't find a region of the same name it returns the first region |
41 | * if it can't find a region of the same name it returns the first region |
31 | * with the 'fallback' property set. |
42 | * with the 'fallback' property set. |
32 | * if it can't find a matching name /or/ a fallback region it logs an info message |
43 | * if it can't find a matching name /or/ a fallback region it logs an info message |
33 | * message and returns NULL |
44 | * message and returns NULL |
34 | * used by the map parsing code. |
45 | * used by the map parsing code. |
35 | */ |
46 | */ |
36 | region * |
47 | region * |
37 | get_region_by_name (const char *region_name) |
48 | region::find (const char *name) |
38 | { |
49 | { |
39 | region *reg; |
50 | for_all_regions (rgn) |
40 | char *p = strchr (region_name, '\n'); |
|
|
41 | |
|
|
42 | if (p) |
|
|
43 | *p = '\0'; |
|
|
44 | for (reg = first_region; reg != NULL; reg = reg->next) |
|
|
45 | if (!strcmp (reg->name, region_name)) |
51 | if (!strcmp (rgn->name, name)) |
46 | return reg; |
52 | return rgn; |
47 | |
53 | |
48 | for (reg = first_region; reg != NULL; reg = reg->next) |
|
|
49 | { |
|
|
50 | if (reg->fallback) |
|
|
51 | { |
|
|
52 | LOG (llevDebug, "region called %s requested, but not found, fallback used.\n", region_name); |
54 | LOG (llevError, "region called %s requested, but not found, using fallback.\n", name); |
53 | return reg; |
|
|
54 | } |
|
|
55 | } |
|
|
56 | LOG (llevInfo, "Got no region or fallback for region %s.\n", region_name); |
|
|
57 | return NULL; |
|
|
58 | } |
|
|
59 | |
55 | |
60 | /* This might need optimising at some point. */ |
56 | return default_region (); |
61 | region * |
|
|
62 | get_region_by_map (maptile *m) |
|
|
63 | { |
|
|
64 | return get_region_by_name (get_name_of_region_for_map (m)); |
|
|
65 | } |
|
|
66 | |
|
|
67 | /* |
|
|
68 | * Since we won't assume all maps have a region set properly, we need an |
|
|
69 | * explicit check that it is, this is much nicer here than scattered throughout |
|
|
70 | * the map code. |
|
|
71 | */ |
|
|
72 | |
|
|
73 | const char * |
|
|
74 | get_name_of_region_for_map (const maptile *m) |
|
|
75 | { |
|
|
76 | region *reg; |
|
|
77 | |
|
|
78 | if (m->region != NULL) |
|
|
79 | return m->region->name; |
|
|
80 | for (reg = first_region; reg != NULL; reg = reg->next) |
|
|
81 | { |
|
|
82 | if (reg->fallback) |
|
|
83 | return reg->name; |
|
|
84 | } |
|
|
85 | LOG (llevInfo, "map %s had no region and I couldn't find a fallback to use.\n", m->name); |
|
|
86 | return "unknown"; |
|
|
87 | } |
57 | } |
88 | |
58 | |
89 | /* |
59 | /* |
90 | * Tries to find a region that 'name' corresponds to. |
60 | * Tries to find a region that 'name' corresponds to. |
91 | * It looks, in order, for: |
61 | * It looks, in order, for: |
… | |
… | |
97 | * (there should be only one of these - the top level one) |
67 | * (there should be only one of these - the top level one) |
98 | * If we got a NULL, then just return the top level region |
68 | * If we got a NULL, then just return the top level region |
99 | * |
69 | * |
100 | */ |
70 | */ |
101 | region * |
71 | region * |
102 | get_region_from_string (const char *name) |
72 | region::find_fuzzy (const char *name) |
103 | { |
73 | { |
104 | region *reg; |
74 | if (!name) |
105 | char *substr; |
75 | return default_region (); |
106 | char *p; |
|
|
107 | |
76 | |
108 | if (name == NULL) |
|
|
109 | { |
|
|
110 | for (reg = first_region; reg->parent != NULL; reg = reg->parent); |
|
|
111 | return reg; |
|
|
112 | } |
|
|
113 | p = strchr (name, '\n'); |
77 | char *p = strchr (name, '\n'); |
114 | if (p) |
78 | if (p) |
115 | *p = '\0'; |
79 | *p = '\0'; |
116 | for (reg = first_region; reg != NULL; reg = reg->next) |
80 | |
|
|
81 | for_all_regions (rgn) |
117 | if (!strcasecmp (reg->name, name)) |
82 | if (!strcasecmp (rgn->name, name)) |
118 | return reg; |
83 | return rgn; |
119 | |
84 | |
120 | for (reg = first_region; reg != NULL; reg = reg->next) |
85 | for_all_regions (rgn) |
121 | if (reg->longname != NULL) |
86 | if (rgn->longname) |
|
|
87 | if (!strcasecmp (rgn->longname, name)) |
|
|
88 | return rgn; |
|
|
89 | |
|
|
90 | for_all_regions (rgn) |
|
|
91 | if (rgn->longname) |
122 | { |
92 | { |
123 | if (!strcasecmp (reg->longname, name)) |
93 | if (strstr (rgn->longname, name)) |
124 | return reg; |
94 | return rgn; |
125 | } |
95 | } |
126 | |
96 | |
127 | substr = NULL; |
97 | for_all_regions (rgn) |
128 | for (reg = first_region; reg != NULL; reg = reg->next) |
|
|
129 | if (reg->longname != NULL) |
98 | if (rgn->longname) |
130 | { |
|
|
131 | substr = strstr (reg->longname, name); |
|
|
132 | if (substr != NULL) |
|
|
133 | return reg; |
|
|
134 | } |
|
|
135 | for (reg = first_region; reg != NULL; reg = reg->next) |
|
|
136 | if (reg->longname != NULL) |
|
|
137 | { |
99 | { |
138 | /* |
100 | /* |
139 | * This is not a bug, we want the region that is most identifiably a discrete |
101 | * This is not a bug, we want the region that is most identifiably a discrete |
140 | * area in the game, eg if we have 'scor', we want to return 'scorn' and not |
102 | * area in the game, eg if we have 'scor', we want to return 'scorn' and not |
141 | * 'scornarena', regardless of their order on the list so we only look at those |
103 | * 'scornarena', regardless of their order on the list so we only look at those |
142 | * regions with a longname set. |
104 | * regions with a longname set. |
143 | */ |
105 | */ |
144 | substr = strstr (reg->name, name); |
106 | if (strstr (rgn->name, name)) |
145 | if (substr != NULL) |
|
|
146 | return reg; |
107 | return rgn; |
147 | } |
108 | } |
148 | for (reg = first_region; reg != NULL; reg = reg->next) |
109 | |
|
|
110 | for_all_regions (rgn) |
149 | { |
111 | { |
150 | substr = strstr (reg->name, name); |
112 | if (strstr (rgn->name, name)) |
151 | if (substr != NULL) |
|
|
152 | return reg; |
113 | return rgn; |
153 | } |
114 | } |
154 | /* if we are still here, we are going to have to give up, and give the top level region */ |
115 | |
155 | for (reg = first_region; reg->parent != NULL; reg = reg->parent); |
116 | return default_region (); |
156 | return reg; |
117 | } |
|
|
118 | |
|
|
119 | void |
|
|
120 | region::do_destroy () |
|
|
121 | { |
|
|
122 | regions.erase (this); |
|
|
123 | |
|
|
124 | attachable::do_destroy (); |
|
|
125 | |
|
|
126 | refcnt_dec (); |
157 | } |
127 | } |
158 | |
128 | |
159 | /* |
129 | /* |
160 | * returns 1 if the player is in the region reg, or a child region thereof |
130 | * returns 1 if the player is in the region reg, or a child region thereof |
161 | * otherwise returns 0 |
131 | * otherwise returns 0 |
162 | * if passed a NULL region returns -1 |
132 | * if passed a NULL region returns -1 |
163 | */ |
133 | */ |
164 | |
134 | static int |
165 | int |
|
|
166 | region_is_child_of_region (const region * child, const region * r) |
135 | region_is_child_of_region (const region * child, const region * r) |
167 | { |
136 | { |
168 | |
137 | if (!r) |
169 | if (r == NULL) |
|
|
170 | return -1; |
138 | return -1; |
171 | if (child == NULL) |
139 | |
|
|
140 | if (!child) |
172 | return 0; |
141 | return 0; |
|
|
142 | |
173 | if (!strcmp (child->name, r->name)) |
143 | if (child->name == r->name) |
174 | return 1; |
144 | return 1; |
|
|
145 | |
175 | else if (child->parent != NULL) |
146 | if (child->parent) |
176 | return region_is_child_of_region (child->parent, r); |
147 | return region_is_child_of_region (child->parent, r); |
177 | else |
148 | |
178 | return 0; |
149 | return 0; |
179 | } |
|
|
180 | |
|
|
181 | /* |
|
|
182 | * the longname of a region is not a required field, any given region |
|
|
183 | * may want to not set it and use the parent's one instead. so, we: |
|
|
184 | * 1. check if a longname is set and if so return it. |
|
|
185 | * 2. check if there is a parent and try and call the function against that |
|
|
186 | * 3. return a obviously wrong string if we can't get a longname, this should |
|
|
187 | * never happen. We also log a debug message. |
|
|
188 | */ |
|
|
189 | const char * |
|
|
190 | get_region_longname (const region * r) |
|
|
191 | { |
|
|
192 | |
|
|
193 | if (r->longname != NULL) |
|
|
194 | return r->longname; |
|
|
195 | else if (r->parent != NULL) |
|
|
196 | return get_region_longname (r->parent); |
|
|
197 | else |
|
|
198 | { |
|
|
199 | LOG (llevDebug, "NOTICE region %s has no parent and no longname.\n", r->name); |
|
|
200 | return "no name can be found for the current region"; |
|
|
201 | } |
|
|
202 | } |
|
|
203 | |
|
|
204 | const char * |
|
|
205 | get_region_msg (const region * r) |
|
|
206 | { |
|
|
207 | if (r->msg != NULL) |
|
|
208 | return r->msg; |
|
|
209 | else if (r->parent != NULL) |
|
|
210 | return get_region_msg (r->parent); |
|
|
211 | else |
|
|
212 | { |
|
|
213 | LOG (llevDebug, "NOTICE region %s has no parent and no msg.\n", r->name); |
|
|
214 | return "no description can be found for the current region"; |
|
|
215 | } |
|
|
216 | } |
150 | } |
217 | |
151 | |
218 | /** Returns an object which is an exit through which the player represented by op should be |
152 | /** Returns an object which is an exit through which the player represented by op should be |
219 | * sent in order to be imprisoned. If there is no suitable place to which an exit can be |
153 | * sent in order to be imprisoned. If there is no suitable place to which an exit can be |
220 | * constructed, then NULL will be returned. The caller is responsible for freeing the object |
154 | * constructed, then NULL will be returned. The caller is responsible for freeing the object |
221 | * created by this function. |
155 | * created by this function. |
222 | */ |
156 | */ |
223 | object * |
157 | object * |
224 | get_jail_exit (object *op) |
158 | get_jail_exit (object *op) |
225 | { |
159 | { |
226 | region *reg; |
|
|
227 | object *exit; |
|
|
228 | |
|
|
229 | if (op->type != PLAYER) |
160 | if (op->type != PLAYER) |
230 | { |
161 | { |
231 | LOG (llevError, "region.c: get_jail_exit called against non-player object.\n"); |
162 | LOG (llevError, "region.c: get_jail_exit called against non-player object.\n"); |
232 | return NULL; |
163 | return NULL; |
233 | } |
164 | } |
234 | reg = get_region_by_map (op->map); |
165 | |
|
|
166 | region *reg = op->region (); |
235 | while (reg != NULL) |
167 | while (reg) |
236 | { |
168 | { |
237 | if (reg->jailmap) |
169 | if (reg->jailmap) |
238 | { |
170 | { |
239 | exit = get_object (); |
171 | object *exit = object::create (); |
240 | EXIT_PATH (exit) = reg->jailmap; |
172 | EXIT_PATH (exit) = reg->jailmap; |
241 | /* damned exits reset savebed and remove teleports, so the prisoner can't escape */ |
173 | /* damned exits reset savebed and remove teleports, so the prisoner can't escape */ |
242 | SET_FLAG (exit, FLAG_DAMNED); |
174 | SET_FLAG (exit, FLAG_DAMNED); |
243 | EXIT_X (exit) = reg->jailx; |
175 | EXIT_X (exit) = reg->jailx; |
244 | EXIT_Y (exit) = reg->jaily; |
176 | EXIT_Y (exit) = reg->jaily; |
245 | return exit; |
177 | return exit; |
246 | } |
178 | } |
247 | else |
179 | else |
248 | reg = reg->parent; |
180 | reg = reg->parent; |
249 | } |
181 | } |
|
|
182 | |
250 | LOG (llevDebug, "No suitable jailmap for region %s was found.\n", reg->name); |
183 | LOG (llevError, "No suitable jailmap for region %s was found.\n", ®->name); |
|
|
184 | |
251 | return NULL; |
185 | return 0; |
|
|
186 | } |
|
|
187 | |
|
|
188 | region * |
|
|
189 | region::read (object_thawer &f) |
|
|
190 | { |
|
|
191 | assert (f.kw == KW_region); |
|
|
192 | |
|
|
193 | region *rgn = new region; |
|
|
194 | rgn->refcnt_inc (); |
|
|
195 | |
|
|
196 | f.get (rgn->name); |
|
|
197 | f.next (); |
|
|
198 | |
|
|
199 | for (;;) |
|
|
200 | { |
|
|
201 | switch (f.kw) |
|
|
202 | { |
|
|
203 | case KW_parent: |
|
|
204 | rgn->parent = region::find (f.get_str ()); |
|
|
205 | break; |
|
|
206 | |
|
|
207 | case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; |
|
|
208 | case KW_longname: f.get (rgn->longname); break; |
|
|
209 | case KW_jail_map: f.get (rgn->jailmap); break; |
|
|
210 | case KW_jail_x: f.get (rgn->jailx); break; |
|
|
211 | case KW_jail_y: f.get (rgn->jaily); break; |
|
|
212 | case KW_portal_map: f.get (rgn->portalmap);break; |
|
|
213 | case KW_portal_x: f.get (rgn->portalx); break; |
|
|
214 | case KW_portal_y: f.get (rgn->portaly); break; |
|
|
215 | case KW_fallback: f.get (rgn->fallback); break; |
|
|
216 | case KW_chance: f.get (rgn->treasure_density); break; |
|
|
217 | |
|
|
218 | case KW_randomitems: |
|
|
219 | rgn->treasure = treasurelist::get (f.get_str ()); |
|
|
220 | break; |
|
|
221 | |
|
|
222 | case KW_end: |
|
|
223 | f.next (); |
|
|
224 | |
|
|
225 | // cannot use find as that will request the default region |
|
|
226 | for_all_regions (old) |
|
|
227 | if (old->name == rgn->name) |
|
|
228 | { |
|
|
229 | old->destroy (); |
|
|
230 | break; |
|
|
231 | } |
|
|
232 | |
|
|
233 | // just append |
|
|
234 | regions.push_back (rgn); |
|
|
235 | return rgn; |
|
|
236 | |
|
|
237 | case KW_ERROR: |
|
|
238 | rgn->set_key_text (f.kw_str, f.value); |
|
|
239 | //fprintf (stderr, "region addkv(%s,%s)\n", f.kw_str, f.value);//D |
|
|
240 | break; |
|
|
241 | |
|
|
242 | default: |
|
|
243 | if (!f.parse_error ("region", rgn->name)) |
|
|
244 | { |
|
|
245 | rgn->destroy (); |
|
|
246 | return 0; |
|
|
247 | } |
|
|
248 | break; |
|
|
249 | } |
|
|
250 | |
|
|
251 | f.next (); |
|
|
252 | } |
252 | } |
253 | } |
253 | |
254 | |
254 | /* |
255 | /* |
255 | * First initialises the archtype hash-table (init_archetable()). |
256 | * First initialises the archtype hash-table (init_archetable()). |
256 | * Reads and parses the archetype file (with the first and second-pass |
257 | * Reads and parses the archetype file (with the first and second-pass |
257 | * functions). |
258 | * functions). |
258 | * Then initialises treasures by calling load_treasures(). |
|
|
259 | */ |
259 | */ |
260 | void |
260 | void |
261 | init_regions (void) |
261 | init_regions (void) |
262 | { |
262 | { |
263 | FILE *fp; |
263 | if (!regions.size ()) |
264 | char filename[MAX_BUF]; |
|
|
265 | int comp; |
|
|
266 | |
|
|
267 | if (first_region != NULL) /* Only do this once */ |
|
|
268 | return; |
|
|
269 | |
|
|
270 | sprintf (filename, "%s/%s/%s", settings.datadir, settings.mapdir, settings.regions); |
|
|
271 | LOG (llevDebug, "Reading regions from %s...\n", filename); |
|
|
272 | if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL) |
|
|
273 | { |
|
|
274 | LOG (llevError, " Can't open regions file %s in init_regions.\n", filename); |
|
|
275 | return; |
|
|
276 | } |
264 | { |
277 | parse_regions (fp); |
265 | // make sure one region is always available |
278 | assign_region_parents (); |
266 | region *rgn = new region; |
279 | LOG (llevDebug, " done\n"); |
267 | rgn->name = "<builtin>"; |
280 | |
268 | rgn->longname = "Built-in Region"; |
281 | close_and_delete (fp, comp); |
269 | regions.push_back (rgn); |
282 | } |
|
|
283 | |
|
|
284 | /* |
|
|
285 | * Allocates and zeros a region struct, this isn't free()'d anywhere, so might |
|
|
286 | * be a memory leak, but it shouldn't matter too much since it isn't called that |
|
|
287 | * often.... |
|
|
288 | */ |
|
|
289 | |
|
|
290 | region * |
|
|
291 | get_region_struct (void) |
|
|
292 | { |
|
|
293 | |
|
|
294 | region *reg; |
|
|
295 | |
|
|
296 | reg = (region *) CALLOC (1, sizeof (region)); |
|
|
297 | if (reg == NULL) |
|
|
298 | fatal (OUT_OF_MEMORY); |
|
|
299 | |
|
|
300 | memset (reg, '\0', sizeof (region)); |
|
|
301 | |
|
|
302 | return reg; |
|
|
303 | } |
|
|
304 | |
|
|
305 | /* |
|
|
306 | * Reads/parses the region file, and copies into a linked list |
|
|
307 | * of region structs. |
|
|
308 | */ |
|
|
309 | void |
|
|
310 | parse_regions (FILE * fp) |
|
|
311 | { |
|
|
312 | region *newreg; |
|
|
313 | region *reg; |
|
|
314 | |
|
|
315 | char buf[HUGE_BUF], msgbuf[HUGE_BUF], *key = NULL, *value, *end; |
|
|
316 | int msgpos = 0; |
|
|
317 | |
|
|
318 | newreg = NULL; |
|
|
319 | while (fgets (buf, HUGE_BUF - 1, fp) != NULL) |
|
|
320 | { |
270 | } |
321 | buf[HUGE_BUF - 1] = 0; |
|
|
322 | key = buf; |
|
|
323 | while (isspace (*key)) |
|
|
324 | key++; |
|
|
325 | if (*key == 0) |
|
|
326 | continue; /* empty line */ |
|
|
327 | value = strchr (key, ' '); |
|
|
328 | if (!value) |
|
|
329 | { |
|
|
330 | end = strchr (key, '\n'); |
|
|
331 | *end = 0; |
|
|
332 | } |
|
|
333 | else |
|
|
334 | { |
|
|
335 | *value = 0; |
|
|
336 | value++; |
|
|
337 | while (isspace (*value)) |
|
|
338 | value++; |
|
|
339 | end = strchr (value, '\n'); |
|
|
340 | } |
|
|
341 | |
|
|
342 | /* |
|
|
343 | * This is a bizzare mutated form of the map and archetype parser |
|
|
344 | * rolled into one. Key is the field name, value is what it should |
|
|
345 | * be set to. |
|
|
346 | * We've already done the work to null terminate key, |
|
|
347 | * and strip off any leading spaces for both of these. |
|
|
348 | * We have not touched the newline at the end of the line - |
|
|
349 | * these might be needed for some values. the end pointer |
|
|
350 | * points to the first of the newlines. |
|
|
351 | * value could be NULL! It would be easy enough to just point |
|
|
352 | * this to "" to prevent cores, but that would let more errors slide |
|
|
353 | * through. |
|
|
354 | */ |
|
|
355 | if (!strcmp (key, "region")) |
|
|
356 | { |
|
|
357 | *end = 0; |
|
|
358 | newreg = get_region_struct (); |
|
|
359 | newreg->name = strdup_local (value); |
|
|
360 | } |
|
|
361 | else if (!strcmp (key, "parent")) |
|
|
362 | { |
|
|
363 | /* |
|
|
364 | * Note that this is in the initialisation code, so we don't actually |
|
|
365 | * assign the pointer to the parent yet, because it might not have been |
|
|
366 | * parsed. |
|
|
367 | */ |
|
|
368 | *end = 0; |
|
|
369 | newreg->parent_name = strdup_local (value); |
|
|
370 | } |
|
|
371 | else if (!strcmp (key, "longname")) |
|
|
372 | { |
|
|
373 | *end = 0; |
|
|
374 | newreg->longname = strdup_local (value); |
|
|
375 | } |
|
|
376 | else if (!strcmp (key, "jail")) |
|
|
377 | { |
|
|
378 | /* jail entries are of the form: /path/to/map x y */ |
|
|
379 | char path[MAX_BUF]; |
|
|
380 | int x, y; |
|
|
381 | |
|
|
382 | if (sscanf (value, "%[^ ] %d %d\n", path, &x, &y) != 3) |
|
|
383 | { |
|
|
384 | LOG (llevError, "region.c: malformated regions entry: jail %s\n", value); |
|
|
385 | continue; |
|
|
386 | } |
|
|
387 | newreg->jailmap = strdup_local (path); |
|
|
388 | newreg->jailx = x; |
|
|
389 | newreg->jaily = y; |
|
|
390 | } |
|
|
391 | else if (!strcmp (key, "msg")) |
|
|
392 | { |
|
|
393 | while (fgets (buf, HUGE_BUF - 1, fp) != NULL) |
|
|
394 | { |
|
|
395 | if (!strcmp (buf, "endmsg\n")) |
|
|
396 | break; |
|
|
397 | else |
|
|
398 | { |
|
|
399 | strcpy (msgbuf + msgpos, buf); |
|
|
400 | msgpos += strlen (buf); |
|
|
401 | } |
|
|
402 | } |
|
|
403 | /* |
|
|
404 | * There may be regions with empty messages (eg, msg/endmsg |
|
|
405 | * with nothing between). When maps are loaded, this is done |
|
|
406 | * so better do it here too... |
|
|
407 | */ |
|
|
408 | if (msgpos != 0) |
|
|
409 | newreg->msg = strdup_local (msgbuf); |
|
|
410 | |
|
|
411 | /* we have to reset msgpos, or the next region will store both msg blocks. */ |
|
|
412 | msgpos = 0; |
|
|
413 | } |
|
|
414 | else if (!strcmp (key, "fallback")) |
|
|
415 | { |
|
|
416 | *end = 0; |
|
|
417 | newreg->fallback = atoi (value); |
|
|
418 | } |
|
|
419 | else if (!strcmp (key, "end")) |
|
|
420 | { |
|
|
421 | /* Place this new region last on the list, if the list is empty put it first */ |
|
|
422 | for (reg = first_region; reg != NULL && reg->next != NULL; reg = reg->next); |
|
|
423 | |
|
|
424 | if (reg == NULL) |
|
|
425 | first_region = newreg; |
|
|
426 | else |
|
|
427 | reg->next = newreg; |
|
|
428 | newreg = NULL; |
|
|
429 | } |
|
|
430 | else if (!strcmp (key, "nomore")) |
|
|
431 | { |
|
|
432 | /* we have reached the end of the region specs.... */ |
|
|
433 | break; |
|
|
434 | } |
|
|
435 | else |
|
|
436 | { |
|
|
437 | /* we should never get here, if we have, then something is wrong */ |
|
|
438 | LOG (llevError, "Got unknown value in region file: %s %s\n", key, value); |
|
|
439 | } |
|
|
440 | } |
|
|
441 | if (!key || strcmp (key, "nomore")) |
|
|
442 | LOG (llevError, "Got premature eof on regions file!\n"); |
|
|
443 | } |
271 | } |
444 | |
272 | |
445 | void |
|
|
446 | assign_region_parents (void) |
|
|
447 | { |
|
|
448 | region *reg; |
|
|
449 | uint32 parent_count = 0; |
|
|
450 | uint32 region_count = 0; |
|
|
451 | |
|
|
452 | for (reg = first_region; reg != NULL && reg->next != NULL; reg = reg->next) |
|
|
453 | { |
|
|
454 | if (reg->parent_name != NULL) |
|
|
455 | { |
|
|
456 | reg->parent = get_region_by_name (reg->parent_name); |
|
|
457 | parent_count++; |
|
|
458 | } |
|
|
459 | region_count++; |
|
|
460 | } |
|
|
461 | LOG (llevDebug, "Assigned %u regions with %u parents.", region_count, parent_count); |
|
|
462 | } |
|
|