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.25 by root, Thu Feb 15 21:07:48 2007 UTC vs.
Revision 1.42 by root, Thu Jan 1 20:49:48 2009 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
28#include "loader.h"
29 26
30regionvec regions; 27regionvec regions;
31 28
32region * 29region *
33region::default_region () 30region::default_region ()
… …
46 * 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
47 * message and returns NULL 44 * message and returns NULL
48 * used by the map parsing code. 45 * used by the map parsing code.
49 */ 46 */
50region * 47region *
51region::find (const char *name) 48region::find (shstr_cmp name)
52{ 49{
53 for_all_regions (rgn) 50 for_all_regions (rgn)
54 if (!strcmp (rgn->name, name)) 51 if (rgn->name == name)
55 return rgn; 52 return rgn;
56 53
57 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);
58 55
59 return default_region (); 56 return default_region ();
60} 57}
61 58
62/* 59void
63 * Tries to find a region that 'name' corresponds to. 60region::do_destroy ()
64 * It looks, in order, for:
65 * an exact match to region name (case insensitive)
66 * an exact match to longname (case insensitive)
67 * a substring that matches to the longname (eg Kingdom)
68 * a substring that matches to the region name (eg nav)
69 * if it can find none of these it returns the first parentless region
70 * (there should be only one of these - the top level one)
71 * If we got a NULL, then just return the top level region
72 *
73 */
74region *
75region::find_fuzzy (const char *name)
76{ 61{
77 if (!name) 62 regions.erase (this);
78 return default_region ();
79 63
80 char *p = strchr (name, '\n'); 64 attachable::do_destroy ();
81 if (p)
82 *p = '\0';
83 65
84 for_all_regions (rgn) 66 refcnt_dec ();
85 if (!strcasecmp (rgn->name, name))
86 return rgn;
87
88 for_all_regions (rgn)
89 if (rgn->longname)
90 if (!strcasecmp (rgn->longname, name))
91 return rgn;
92
93 for_all_regions (rgn)
94 if (rgn->longname)
95 {
96 if (strstr (rgn->longname, name))
97 return rgn;
98 }
99
100 for_all_regions (rgn)
101 if (rgn->longname)
102 {
103 /*
104 * This is not a bug, we want the region that is most identifiably a discrete
105 * area in the game, eg if we have 'scor', we want to return 'scorn' and not
106 * 'scornarena', regardless of their order on the list so we only look at those
107 * regions with a longname set.
108 */
109 if (strstr (rgn->name, name))
110 return rgn;
111 }
112
113 for_all_regions (rgn)
114 {
115 if (strstr (rgn->name, name))
116 return rgn;
117 }
118
119 return default_region ();
120} 67}
121 68
122/* 69/*
123 * 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
124 * otherwise returns 0 71 * otherwise returns 0
125 * if passed a NULL region returns -1 72 * if passed a NULL region returns -1
126 */ 73 */
127
128static int 74static int
129region_is_child_of_region (const region * child, const region * r) 75region_is_child_of_region (const region * child, const region * r)
130{ 76{
131 77 if (!r)
132 if (r == NULL)
133 return -1; 78 return -1;
134 79
135 if (child == NULL) 80 if (!child)
136 return 0; 81 return 0;
137 82
138 if (!strcmp (child->name, r->name)) 83 if (child->name == r->name)
139 return 1; 84 return 1;
140 85
141 else if (child->parent != NULL) 86 if (child->parent)
142 return region_is_child_of_region (child->parent, r); 87 return region_is_child_of_region (child->parent, r);
143 else 88
144 return 0; 89 return 0;
145} 90}
146 91
147/** 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
148 * 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
149 * 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
150 * created by this function. 95 * created by this function.
151 */ 96 */
152object * 97object *
153get_jail_exit (object *op) 98get_jail_exit (object *op)
154{ 99{
155 region *reg;
156 object *exit;
157
158 if (op->type != PLAYER) 100 if (op->type != PLAYER)
159 { 101 {
160 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");
161 return NULL; 103 return NULL;
162 } 104 }
163 105
164 reg = op->region (); 106 region *reg = op->region ();
165 while (reg) 107 while (reg)
166 { 108 {
167 if (reg->jailmap) 109 if (reg->jailmap)
168 { 110 {
169 exit = object::create (); 111 object *exit = object::create ();
170 EXIT_PATH (exit) = reg->jailmap; 112 EXIT_PATH (exit) = reg->jailmap;
171 /* 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 */
172 SET_FLAG (exit, FLAG_DAMNED); 114 SET_FLAG (exit, FLAG_DAMNED);
173 EXIT_X (exit) = reg->jailx; 115 EXIT_X (exit) = reg->jailx;
174 EXIT_Y (exit) = reg->jaily; 116 EXIT_Y (exit) = reg->jaily;
… …
182 124
183 return 0; 125 return 0;
184} 126}
185 127
186region * 128region *
187region::load (object_f &f) 129region::read (object_thawer &f)
188{ 130{
131 assert (f.kw == KW_region);
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_kv (); 137 f.next ();
192 138
193 for (;;) 139 for (;;)
194 { 140 {
195 switch (f.kw) 141 switch (f.kw)
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: 147 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break;
202 f.get (rgn->longname); 148 case KW_longname: f.get (rgn->longname); break;
203 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;
204 157
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: 158 case KW_randomitems:
218 f.get_ml (KW_endmsg, rgn->msg); 159 rgn->treasure = treasurelist::get (f.get_str ());
219 break;
220
221 case KW_fallback:
222 f.get (rgn->fallback);
223 break; 160 break;
224 161
225 case KW_end: 162 case KW_end:
163 f.next ();
164
165 // cannot use find as that will request the default region
226 for_all_regions (old) 166 for_all_regions (old)
227 if (old->name == rgn->name) 167 if (old->name == rgn->name)
228 { 168 {
229 // replace, copy new values (ugly) 169 old->destroy ();
230 rgn->index = old->index;
231 *old = *rgn;
232 delete rgn;
233
234 return old; 170 break;
235 } 171 }
236 172
237 // just append 173 // just append
238 regions.push_back (rgn); 174 regions.push_back (rgn);
239 return rgn; 175 return rgn;
240 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
241 default: 182 default:
242 if (!f.parse_error ("region", rgn->name)) 183 if (!f.parse_error ("region", rgn->name))
243 { 184 {
244 delete rgn; 185 rgn->destroy ();
245 return 0; 186 return 0;
246 } 187 }
247 break; 188 break;
248 } 189 }
249 190
250 f.next_kv (); 191 f.next ();
251 } 192 }
252} 193}
253 194
254/* 195/*
255 * First initialises the archtype hash-table (init_archetable()). 196 * First initialises the archtype hash-table (init_archetable()).
256 * 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
257 * functions). 198 * functions).
258 * Then initialises treasures by calling load_treasures().
259 */ 199 */
260void 200void
261init_regions (void) 201init_regions (void)
262{ 202{
263 if (!regions.size ()) 203 if (!regions.size ())

Diff Legend

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