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