ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/region.C
(Generate patch)

Comparing deliantra/server/common/region.C (file contents):
Revision 1.26 by root, Fri Feb 16 19:43:41 2007 UTC vs.
Revision 1.40 by root, Wed Dec 31 17:35:37 2008 UTC

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
… …
115 } 114 }
116 115
117 return default_region (); 116 return default_region ();
118} 117}
119 118
119void
120region::do_destroy ()
121{
122 regions.erase (this);
123
124 attachable::do_destroy ();
125
126 refcnt_dec ();
127}
128
120/* 129/*
121 * 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
122 * otherwise returns 0 131 * otherwise returns 0
123 * if passed a NULL region returns -1 132 * if passed a NULL region returns -1
124 */ 133 */
125
126static int 134static int
127region_is_child_of_region (const region * child, const region * r) 135region_is_child_of_region (const region * child, const region * r)
128{ 136{
129 137 if (!r)
130 if (r == NULL)
131 return -1; 138 return -1;
132 139
133 if (child == NULL) 140 if (!child)
134 return 0; 141 return 0;
135 142
136 if (!strcmp (child->name, r->name)) 143 if (child->name == r->name)
137 return 1; 144 return 1;
138 145
139 else if (child->parent != NULL) 146 if (child->parent)
140 return region_is_child_of_region (child->parent, r); 147 return region_is_child_of_region (child->parent, r);
141 else 148
142 return 0; 149 return 0;
143} 150}
144 151
145/** 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
146 * 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
147 * 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
148 * created by this function. 155 * created by this function.
149 */ 156 */
150object * 157object *
151get_jail_exit (object *op) 158get_jail_exit (object *op)
152{ 159{
153 region *reg;
154 object *exit;
155
156 if (op->type != PLAYER) 160 if (op->type != PLAYER)
157 { 161 {
158 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");
159 return NULL; 163 return NULL;
160 } 164 }
161 165
162 reg = op->region (); 166 region *reg = op->region ();
163 while (reg) 167 while (reg)
164 { 168 {
165 if (reg->jailmap) 169 if (reg->jailmap)
166 { 170 {
167 exit = object::create (); 171 object *exit = object::create ();
168 EXIT_PATH (exit) = reg->jailmap; 172 EXIT_PATH (exit) = reg->jailmap;
169 /* 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 */
170 SET_FLAG (exit, FLAG_DAMNED); 174 SET_FLAG (exit, FLAG_DAMNED);
171 EXIT_X (exit) = reg->jailx; 175 EXIT_X (exit) = reg->jailx;
172 EXIT_Y (exit) = reg->jaily; 176 EXIT_Y (exit) = reg->jaily;
… …
185region::read (object_thawer &f) 189region::read (object_thawer &f)
186{ 190{
187 assert (f.kw == KW_region); 191 assert (f.kw == KW_region);
188 192
189 region *rgn = new region; 193 region *rgn = new region;
194 rgn->refcnt_inc ();
195
190 f.get (rgn->name); 196 f.get (rgn->name);
191 f.next (); 197 f.next ();
192 198
193 for (;;) 199 for (;;)
194 { 200 {
… …
196 { 202 {
197 case KW_parent: 203 case KW_parent:
198 rgn->parent = region::find (f.get_str ()); 204 rgn->parent = region::find (f.get_str ());
199 break; 205 break;
200 206
201 case KW_longname: 207 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break;
202 f.get (rgn->longname); 208 case KW_longname: f.get (rgn->longname); break;
203 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;
204 217
205 case KW_jail_map:
206 f.get (rgn->jailmap);
207 break;
208
209 case KW_jail_x:
210 f.get (rgn->jailx);
211 break;
212
213 case KW_jail_y:
214 f.get (rgn->jaily);
215 break;
216
217 case KW_msg: 218 case KW_randomitems:
218 f.get_ml (KW_endmsg, rgn->msg); 219 rgn->treasure = treasurelist::get (f.get_str ());
219 break;
220
221 case KW_fallback:
222 f.get (rgn->fallback);
223 break; 220 break;
224 221
225 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) 226 for_all_regions (old)
227 if (old->name == rgn->name) 227 if (old->name == rgn->name)
228 { 228 {
229 // replace, copy new values (ugly) 229 old->destroy ();
230 rgn->index = old->index;
231 *old = *rgn;
232 delete rgn;
233
234 return old; 230 break;
235 } 231 }
236 232
237 // just append 233 // just append
238 regions.push_back (rgn); 234 regions.push_back (rgn);
239 return rgn; 235 return rgn;
240 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
241 default: 242 default:
242 if (!f.parse_error ("region", rgn->name)) 243 if (!f.parse_error ("region", rgn->name))
243 { 244 {
244 delete rgn; 245 rgn->destroy ();
245 return 0; 246 return 0;
246 } 247 }
247 break; 248 break;
248 } 249 }
249 250
… …
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 */
260void 260void
261init_regions (void) 261init_regions (void)
262{ 262{
263 if (!regions.size ()) 263 if (!regions.size ())

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines