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 |
9 | * 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 |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * (at your option) any later version. |
11 | * (at your 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 GNU General Public License |
19 | * along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | #include <global.h> |
24 | #include <global.h> |
26 | #include <unistd.h> |
25 | #include <unistd.h> |
27 | |
26 | |
… | |
… | |
44 | * 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 |
45 | * message and returns NULL |
44 | * message and returns NULL |
46 | * used by the map parsing code. |
45 | * used by the map parsing code. |
47 | */ |
46 | */ |
48 | region * |
47 | region * |
49 | region::find (const char *name) |
48 | region::find (shstr_cmp name) |
50 | { |
49 | { |
51 | for_all_regions (rgn) |
50 | for_all_regions (rgn) |
52 | if (!strcmp (rgn->name, name)) |
51 | if (rgn->name == name) |
53 | return rgn; |
52 | return rgn; |
54 | |
53 | |
55 | LOG (llevError, "region called %s requested, but not found, using fallback.\n", name); |
54 | LOG (llevError, "region called %s requested, but not found, using fallback.\n", &name); |
56 | |
55 | |
57 | return default_region (); |
56 | return default_region (); |
58 | } |
57 | } |
59 | |
58 | |
60 | /* |
59 | void |
61 | * Tries to find a region that 'name' corresponds to. |
60 | 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 | { |
61 | { |
75 | if (!name) |
62 | regions.erase (this); |
76 | return default_region (); |
|
|
77 | |
63 | |
78 | char *p = strchr (name, '\n'); |
64 | attachable::do_destroy (); |
79 | if (p) |
|
|
80 | *p = '\0'; |
|
|
81 | |
65 | |
82 | for_all_regions (rgn) |
66 | refcnt_dec (); |
83 | if (!strcasecmp (rgn->name, name)) |
|
|
84 | return rgn; |
|
|
85 | |
|
|
86 | for_all_regions (rgn) |
|
|
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 | } |
67 | } |
119 | |
68 | |
120 | /* |
69 | /* |
121 | * returns 1 if the player is in the region reg, or a child region thereof |
70 | * returns 1 if the player is in the region reg, or a child region thereof |
122 | * otherwise returns 0 |
71 | * otherwise returns 0 |
123 | * if passed a NULL region returns -1 |
72 | * if passed a NULL region returns -1 |
124 | */ |
73 | */ |
125 | |
|
|
126 | static int |
74 | static int |
127 | region_is_child_of_region (const region * child, const region * r) |
75 | region_is_child_of_region (const region * child, const region * r) |
128 | { |
76 | { |
129 | |
77 | if (!r) |
130 | if (r == NULL) |
|
|
131 | return -1; |
78 | return -1; |
132 | |
79 | |
133 | if (child == NULL) |
80 | if (!child) |
134 | return 0; |
81 | return 0; |
135 | |
82 | |
136 | if (!strcmp (child->name, r->name)) |
83 | if (child->name == r->name) |
137 | return 1; |
84 | return 1; |
138 | |
85 | |
139 | else if (child->parent != NULL) |
86 | if (child->parent) |
140 | return region_is_child_of_region (child->parent, r); |
87 | return region_is_child_of_region (child->parent, r); |
141 | else |
88 | |
142 | return 0; |
89 | return 0; |
143 | } |
90 | } |
144 | |
91 | |
145 | /** Returns an object which is an exit through which the player represented by op should be |
92 | /** 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 |
93 | * 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 |
94 | * constructed, then NULL will be returned. The caller is responsible for freeing the object |
148 | * created by this function. |
95 | * created by this function. |
149 | */ |
96 | */ |
150 | object * |
97 | object * |
151 | get_jail_exit (object *op) |
98 | get_jail_exit (object *op) |
152 | { |
99 | { |
153 | region *reg; |
|
|
154 | object *exit; |
|
|
155 | |
|
|
156 | if (op->type != PLAYER) |
100 | if (op->type != PLAYER) |
157 | { |
101 | { |
158 | LOG (llevError, "region.c: get_jail_exit called against non-player object.\n"); |
102 | LOG (llevError, "region.c: get_jail_exit called against non-player object.\n"); |
159 | return NULL; |
103 | return NULL; |
160 | } |
104 | } |
161 | |
105 | |
162 | reg = op->region (); |
106 | region *reg = op->region (); |
163 | while (reg) |
107 | while (reg) |
164 | { |
108 | { |
165 | if (reg->jailmap) |
109 | if (reg->jailmap) |
166 | { |
110 | { |
167 | exit = object::create (); |
111 | object *exit = object::create (); |
168 | EXIT_PATH (exit) = reg->jailmap; |
112 | EXIT_PATH (exit) = reg->jailmap; |
169 | /* damned exits reset savebed and remove teleports, so the prisoner can't escape */ |
113 | /* damned exits reset savebed and remove teleports, so the prisoner can't escape */ |
170 | SET_FLAG (exit, FLAG_DAMNED); |
114 | SET_FLAG (exit, FLAG_DAMNED); |
171 | EXIT_X (exit) = reg->jailx; |
115 | EXIT_X (exit) = reg->jailx; |
172 | EXIT_Y (exit) = reg->jaily; |
116 | EXIT_Y (exit) = reg->jaily; |
… | |
… | |
185 | region::read (object_thawer &f) |
129 | region::read (object_thawer &f) |
186 | { |
130 | { |
187 | assert (f.kw == KW_region); |
131 | assert (f.kw == KW_region); |
188 | |
132 | |
189 | region *rgn = new region; |
133 | region *rgn = new region; |
|
|
134 | rgn->refcnt_inc (); |
|
|
135 | |
190 | f.get (rgn->name); |
136 | f.get (rgn->name); |
191 | f.next (); |
137 | f.next (); |
192 | |
138 | |
193 | for (;;) |
139 | for (;;) |
194 | { |
140 | { |
… | |
… | |
196 | { |
142 | { |
197 | case KW_parent: |
143 | case KW_parent: |
198 | rgn->parent = region::find (f.get_str ()); |
144 | rgn->parent = region::find (f.get_str ()); |
199 | break; |
145 | break; |
200 | |
146 | |
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; |
147 | case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; |
|
|
148 | case KW_longname: f.get (rgn->longname); break; |
|
|
149 | case KW_jail_map: f.get (rgn->jailmap); break; |
|
|
150 | case KW_jail_x: f.get (rgn->jailx); break; |
|
|
151 | case KW_jail_y: f.get (rgn->jaily); break; |
|
|
152 | case KW_portal_map: f.get (rgn->portalmap);break; |
|
|
153 | case KW_portal_x: f.get (rgn->portalx); break; |
|
|
154 | case KW_portal_y: f.get (rgn->portaly); break; |
|
|
155 | case KW_fallback: f.get (rgn->fallback); break; |
|
|
156 | case KW_chance: f.get (rgn->treasure_density); break; |
|
|
157 | |
|
|
158 | case KW_randomitems: |
|
|
159 | rgn->treasure = treasurelist::get (f.get_str ()); |
|
|
160 | break; |
208 | |
161 | |
209 | case KW_end: |
162 | case KW_end: |
|
|
163 | f.next (); |
|
|
164 | |
|
|
165 | // cannot use find as that will request the default region |
210 | for_all_regions (old) |
166 | for_all_regions (old) |
211 | if (old->name == rgn->name) |
167 | if (old->name == rgn->name) |
212 | { |
168 | { |
213 | // replace, copy new values (ugly) |
169 | old->destroy (); |
214 | rgn->index = old->index; |
|
|
215 | *old = *rgn; |
|
|
216 | delete rgn; |
|
|
217 | |
|
|
218 | return old; |
170 | break; |
219 | } |
171 | } |
220 | |
172 | |
221 | // just append |
173 | // just append |
222 | regions.push_back (rgn); |
174 | regions.push_back (rgn); |
223 | return rgn; |
175 | return rgn; |
224 | |
176 | |
|
|
177 | case KW_ERROR: |
|
|
178 | rgn->set_key_text (f.kw_str, f.value); |
|
|
179 | //fprintf (stderr, "region addkv(%s,%s)\n", f.kw_str, f.value);//D |
|
|
180 | break; |
|
|
181 | |
225 | default: |
182 | default: |
226 | if (!f.parse_error ("region", rgn->name)) |
183 | if (!f.parse_error ("region", rgn->name)) |
227 | { |
184 | { |
228 | delete rgn; |
185 | rgn->destroy (); |
229 | return 0; |
186 | return 0; |
230 | } |
187 | } |
231 | break; |
188 | break; |
232 | } |
189 | } |
233 | |
190 | |
… | |
… | |
237 | |
194 | |
238 | /* |
195 | /* |
239 | * First initialises the archtype hash-table (init_archetable()). |
196 | * First initialises the archtype hash-table (init_archetable()). |
240 | * Reads and parses the archetype file (with the first and second-pass |
197 | * Reads and parses the archetype file (with the first and second-pass |
241 | * functions). |
198 | * functions). |
242 | * Then initialises treasures by calling load_treasures(). |
|
|
243 | */ |
199 | */ |
244 | void |
200 | void |
245 | init_regions (void) |
201 | init_regions (void) |
246 | { |
202 | { |
247 | if (!regions.size ()) |
203 | if (!regions.size ()) |