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 | |
|
|
28 | #include "loader.h" |
|
|
29 | |
26 | |
30 | regionvec regions; |
27 | regionvec regions; |
31 | |
28 | |
32 | region * |
29 | region * |
33 | region::default_region () |
30 | region::default_region () |
… | |
… | |
117 | } |
114 | } |
118 | |
115 | |
119 | return default_region (); |
116 | return default_region (); |
120 | } |
117 | } |
121 | |
118 | |
|
|
119 | void |
|
|
120 | region::do_destroy () |
|
|
121 | { |
|
|
122 | regions.erase (this); |
|
|
123 | |
|
|
124 | attachable::do_destroy (); |
|
|
125 | |
|
|
126 | refcnt_dec (); |
|
|
127 | } |
|
|
128 | |
122 | /* |
129 | /* |
123 | * 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 |
124 | * otherwise returns 0 |
131 | * otherwise returns 0 |
125 | * if passed a NULL region returns -1 |
132 | * if passed a NULL region returns -1 |
126 | */ |
133 | */ |
127 | |
|
|
128 | static int |
134 | static int |
129 | region_is_child_of_region (const region * child, const region * r) |
135 | region_is_child_of_region (const region * child, const region * r) |
130 | { |
136 | { |
131 | |
137 | if (!r) |
132 | if (r == NULL) |
|
|
133 | return -1; |
138 | return -1; |
134 | |
139 | |
135 | if (child == NULL) |
140 | if (!child) |
136 | return 0; |
141 | return 0; |
137 | |
142 | |
138 | if (!strcmp (child->name, r->name)) |
143 | if (child->name == r->name) |
139 | return 1; |
144 | return 1; |
140 | |
145 | |
141 | else if (child->parent != NULL) |
146 | if (child->parent) |
142 | return region_is_child_of_region (child->parent, r); |
147 | return region_is_child_of_region (child->parent, r); |
143 | else |
148 | |
144 | return 0; |
149 | return 0; |
145 | } |
150 | } |
146 | |
151 | |
147 | /** 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 |
148 | * 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 |
149 | * 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 |
150 | * created by this function. |
155 | * created by this function. |
151 | */ |
156 | */ |
152 | object * |
157 | object * |
153 | get_jail_exit (object *op) |
158 | get_jail_exit (object *op) |
154 | { |
159 | { |
155 | region *reg; |
|
|
156 | object *exit; |
|
|
157 | |
|
|
158 | if (op->type != PLAYER) |
160 | if (op->type != PLAYER) |
159 | { |
161 | { |
160 | 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"); |
161 | return NULL; |
163 | return NULL; |
162 | } |
164 | } |
163 | |
165 | |
164 | reg = op->region (); |
166 | region *reg = op->region (); |
165 | while (reg) |
167 | while (reg) |
166 | { |
168 | { |
167 | if (reg->jailmap) |
169 | if (reg->jailmap) |
168 | { |
170 | { |
169 | exit = object::create (); |
171 | object *exit = object::create (); |
170 | EXIT_PATH (exit) = reg->jailmap; |
172 | EXIT_PATH (exit) = reg->jailmap; |
171 | /* 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 */ |
172 | SET_FLAG (exit, FLAG_DAMNED); |
174 | SET_FLAG (exit, FLAG_DAMNED); |
173 | EXIT_X (exit) = reg->jailx; |
175 | EXIT_X (exit) = reg->jailx; |
174 | EXIT_Y (exit) = reg->jaily; |
176 | EXIT_Y (exit) = reg->jaily; |
… | |
… | |
181 | LOG (llevError, "No suitable jailmap for region %s was found.\n", ®->name); |
183 | LOG (llevError, "No suitable jailmap for region %s was found.\n", ®->name); |
182 | |
184 | |
183 | return 0; |
185 | return 0; |
184 | } |
186 | } |
185 | |
187 | |
186 | region *loader_region::get_region (const char *name) |
188 | region * |
|
|
189 | region::read (object_thawer &f) |
187 | { |
190 | { |
|
|
191 | assert (f.kw == KW_region); |
|
|
192 | |
188 | region *rgn = new region; |
193 | region *rgn = new region; |
189 | rgn->name = name; |
194 | rgn->refcnt_inc (); |
190 | return rgn; |
|
|
191 | } |
|
|
192 | |
195 | |
193 | void loader_region::put_region (region *rgn) |
196 | f.get (rgn->name); |
194 | { |
197 | 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 | |
198 | |
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 (;;) |
199 | for (;;) |
214 | { |
200 | { |
215 | keyword kw = thawer.get_kv (); |
|
|
216 | |
|
|
217 | switch (kw) |
201 | switch (f.kw) |
218 | { |
202 | { |
219 | case KW_parent: |
203 | case KW_parent: |
220 | rgn->parent = region::find (thawer.get_str ()); |
204 | rgn->parent = region::find (f.get_str ()); |
221 | break; |
|
|
222 | |
|
|
223 | case KW_longname: |
|
|
224 | thawer.get (rgn->longname); |
|
|
225 | break; |
205 | break; |
226 | |
206 | |
227 | case KW_jail_map: |
207 | case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; |
228 | thawer.get (rgn->jailmap); |
208 | case KW_longname: f.get (rgn->longname); break; |
229 | 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; |
230 | |
217 | |
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: |
218 | case KW_randomitems: |
240 | thawer.get_ml (KW_endmsg, rgn->msg); |
219 | rgn->treasure = treasurelist::get (f.get_str ()); |
241 | break; |
|
|
242 | |
|
|
243 | case KW_fallback: |
|
|
244 | thawer.get (rgn->fallback); |
|
|
245 | break; |
220 | break; |
246 | |
221 | |
247 | case KW_end: |
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); |
248 | return true; |
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; |
249 | |
241 | |
250 | default: |
242 | default: |
251 | if (!thawer.parse_error (kw, "region", rgn->name)) |
243 | if (!f.parse_error ("region", rgn->name)) |
|
|
244 | { |
|
|
245 | rgn->destroy (); |
252 | return false; |
246 | return 0; |
|
|
247 | } |
253 | break; |
248 | break; |
254 | } |
249 | } |
|
|
250 | |
|
|
251 | f.next (); |
255 | } |
252 | } |
256 | } |
253 | } |
257 | |
254 | |
258 | /* |
255 | /* |
259 | * First initialises the archtype hash-table (init_archetable()). |
256 | * First initialises the archtype hash-table (init_archetable()). |
260 | * 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 |
261 | * functions). |
258 | * functions). |
262 | * Then initialises treasures by calling load_treasures(). |
|
|
263 | */ |
259 | */ |
264 | void |
260 | void |
265 | init_regions (void) |
261 | init_regions (void) |
266 | { |
262 | { |
267 | if (!regions.size ()) |
263 | if (!regions.size ()) |