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.30 by root, Thu Apr 19 16:23:46 2007 UTC vs.
Revision 1.52 by root, Thu Apr 29 12:24:04 2010 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 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,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 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 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
… …
35 return rgn; 35 return rgn;
36 36
37 return regions [0]; 37 return regions [0];
38} 38}
39 39
40/*
41 * Pass a char array, returns a pointer to the region of the same name.
42 * if it can't find a region of the same name it returns the first region
43 * with the 'fallback' property set.
44 * if it can't find a matching name /or/ a fallback region it logs an info message
45 * message and returns NULL
46 * used by the map parsing code.
47 */
48region * 40region *
49region::find (const char *name) 41region::find (shstr_cmp name)
50{ 42{
51 for_all_regions (rgn) 43 for_all_regions (rgn)
52 if (!strcmp (rgn->name, name)) 44 if (rgn->name == name)
53 return rgn; 45 return rgn;
54 46
55 LOG (llevError, "region called %s requested, but not found, using fallback.\n", name);
56
57 return default_region (); 47 return default_region ();
58} 48}
59 49
60/* 50void
61 * Tries to find a region that 'name' corresponds to. 51object_thawer::get (region_ptr &r) const
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 */
72region *
73region::find_fuzzy (const char *name)
74{ 52{
75 if (!name) 53 shstr_cmp name = get_str ();
76 return default_region ();
77
78 char *p = strchr (name, '\n');
79 if (p)
80 *p = '\0';
81 54
82 for_all_regions (rgn) 55 for_all_regions (rgn)
83 if (!strcasecmp (rgn->name, name))
84 return rgn;
85
86 for_all_regions (rgn)
87 if (rgn->longname) 56 if (rgn->name == name)
88 if (!strcasecmp (rgn->longname, name))
89 return rgn;
90
91 for_all_regions (rgn)
92 if (rgn->longname)
93 { 57 {
94 if (strstr (rgn->longname, name)) 58 r = rgn;
95 return rgn; 59 return;
96 } 60 }
97 61
98 for_all_regions (rgn) 62 parse_error (format ("region called %s requested, but not found, using fallback.\n", get_str ()));
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 63
111 for_all_regions (rgn)
112 {
113 if (strstr (rgn->name, name))
114 return rgn;
115 }
116
117 return default_region (); 64 r = region::default_region ();
118} 65}
66
67void
68region::do_destroy ()
69{
70 regions.erase (this);
71
72 attachable::do_destroy ();
73
74 refcnt_dec ();
75}
76
77//+GPL
119 78
120/* 79/*
121 * returns 1 if the player is in the region reg, or a child region thereof 80 * returns 1 if the player is in the region reg, or a child region thereof
122 * otherwise returns 0 81 * otherwise returns 0
123 * if passed a NULL region returns -1 82 * if passed a NULL region returns -1
124 */ 83 */
125
126static int 84static int
127region_is_child_of_region (const region * child, const region * r) 85region_is_child_of_region (const region * child, const region * r)
128{ 86{
129 87 if (!r)
130 if (r == NULL)
131 return -1; 88 return -1;
132 89
133 if (child == NULL) 90 if (!child)
134 return 0; 91 return 0;
135 92
136 if (!strcmp (child->name, r->name)) 93 if (child->name == r->name)
137 return 1; 94 return 1;
138 95
139 else if (child->parent != NULL) 96 if (child->parent)
140 return region_is_child_of_region (child->parent, r); 97 return region_is_child_of_region (child->parent, r);
141 else 98
142 return 0; 99 return 0;
143} 100}
144 101
145/** Returns an object which is an exit through which the player represented by op should be 102/** 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 103 * 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 104 * constructed, then NULL will be returned. The caller is responsible for freeing the object
148 * created by this function. 105 * created by this function.
149 */ 106 */
150object * 107object *
151get_jail_exit (object *op) 108get_jail_exit (object *op)
152{ 109{
153 region *reg;
154 object *exit;
155
156 if (op->type != PLAYER) 110 if (op->type != PLAYER)
157 { 111 {
158 LOG (llevError, "region.c: get_jail_exit called against non-player object.\n"); 112 LOG (llevError, "region.c: get_jail_exit called against non-player object.\n");
159 return NULL; 113 return NULL;
160 } 114 }
161 115
162 reg = op->region (); 116 region *reg = op->region ();
163 while (reg) 117 while (reg)
164 { 118 {
165 if (reg->jailmap) 119 if (reg->jailmap)
166 { 120 {
167 exit = object::create (); 121 object *exit = object::create ();
168 EXIT_PATH (exit) = reg->jailmap; 122 EXIT_PATH (exit) = reg->jailmap;
169 /* damned exits reset savebed and remove teleports, so the prisoner can't escape */ 123 /* damned exits reset savebed and remove teleports, so the prisoner can't escape */
170 SET_FLAG (exit, FLAG_DAMNED); 124 exit->set_flag (FLAG_DAMNED);
171 EXIT_X (exit) = reg->jailx; 125 EXIT_X (exit) = reg->jailx;
172 EXIT_Y (exit) = reg->jaily; 126 EXIT_Y (exit) = reg->jaily;
173 return exit; 127 return exit;
174 } 128 }
175 else 129 else
… …
179 LOG (llevError, "No suitable jailmap for region %s was found.\n", &reg->name); 133 LOG (llevError, "No suitable jailmap for region %s was found.\n", &reg->name);
180 134
181 return 0; 135 return 0;
182} 136}
183 137
138//-GPL
139
184region * 140region *
185region::read (object_thawer &f) 141region::read (object_thawer &f)
186{ 142{
187 assert (f.kw == KW_region); 143 assert (f.kw == KW_region);
188 144
189 region *rgn = new region; 145 region *rgn = new region;
146 rgn->refcnt_inc ();
147
190 f.get (rgn->name); 148 f.get (rgn->name);
191 f.next (); 149 f.next ();
192 150
193 for (;;) 151 for (;;)
194 { 152 {
195 switch (f.kw) 153 switch (f.kw)
196 { 154 {
197 case KW_parent: 155 case KW_parent:
198 rgn->parent = region::find (f.get_str ()); 156 f.get (rgn->parent);
199 break; 157 break;
200 158
201 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; 159 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break;
202 case KW_longname: f.get (rgn->longname); break; 160 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; 161 case KW_jail_map: f.get (rgn->jailmap); break;
205 case KW_jail_x: f.get (rgn->jailx); break; 162 case KW_jail_x: f.get (rgn->jailx); break;
206 case KW_jail_y: f.get (rgn->jaily); break; 163 case KW_jail_y: f.get (rgn->jaily); break;
164 case KW_portal_map: f.get (rgn->portalmap);break;
207 case KW_fallback: f.get (rgn->fallback); break; 165 case KW_fallback: f.get (rgn->fallback); break;
208 case KW_chance: f.get (rgn->treasure_density); break; 166 case KW_chance: f.get (rgn->treasure_density); break;
209 167
210 case KW_randomitems: 168 case KW_randomitems:
211 rgn->treasure = treasurelist::get (f.get_str ()); 169 rgn->treasure = treasurelist::get (f.get_str ());
212 break; 170 break;
213 171
214 case KW_end: 172 case KW_end:
215 f.next (); 173 f.next ();
216 174
175 // cannot use find as that will request the default region
217 for_all_regions (old) 176 for_all_regions (old)
218 if (old->name == rgn->name) 177 if (old->name == rgn->name)
219 { 178 {
220 // replace, copy new values (ugly) 179 old->destroy ();
221 rgn->index = old->index;
222 *old = *rgn;
223 delete rgn;
224
225 return old; 180 break;
226 } 181 }
227 182
228 // just append 183 // just append
229 regions.push_back (rgn); 184 regions.push_back (rgn);
230 return rgn; 185 return rgn;
231 186
187 case KW_ERROR:
188 rgn->set_key_text (f.kw_str, f.value);
189 //fprintf (stderr, "region addkv(%s,%s)\n", f.kw_str, f.value);//D
190 break;
191
232 default: 192 default:
233 if (!f.parse_error ("region", rgn->name)) 193 if (!f.parse_error ("region", rgn->name))
234 { 194 {
235 delete rgn; 195 rgn->destroy ();
236 return 0; 196 return 0;
237 } 197 }
238 break; 198 break;
239 } 199 }
240 200
241 f.next (); 201 f.next ();
242 } 202 }
243} 203}
244 204
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 */
250void
251init_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

Diff Legend

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