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.31 by root, Tue May 22 10:49:59 2007 UTC vs.
Revision 1.58 by root, Sat Nov 17 23:40:00 2018 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 (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
5 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 6 * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 7 * Copyright (©) 1992 Frank Tore Johansen
7 * 8 *
8 * This program is free software; you can redistribute it and/or modify 9 * 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 10 * 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 11 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 12 * option) any later version.
12 * 13 *
13 * This program is distributed in the hope that it will be useful, 14 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 17 * GNU General Public License for more details.
17 * 18 *
18 * You should have received a copy of the GNU General Public License 19 * 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 20 * and the GNU General Public License along with this program. If not, see
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 21 * <http://www.gnu.org/licenses/>.
21 * 22 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 23 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 24 */
24 25
25#include <global.h> 26#include <global.h>
26#include <unistd.h> 27#include <unistd.h>
27 28
… …
35 return rgn; 36 return rgn;
36 37
37 return regions [0]; 38 return regions [0];
38} 39}
39 40
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 * 41region *
49region::find (const char *name) 42region::find (shstr_cmp name)
50{ 43{
51 for_all_regions (rgn) 44 for_all_regions (rgn)
52 if (!strcmp (rgn->name, name)) 45 if (rgn->name == name)
53 return rgn; 46 return rgn;
54 47
55 LOG (llevError, "region called %s requested, but not found, using fallback.\n", name);
56
57 return default_region (); 48 return default_region ();
58} 49}
59 50
51void
52object_thawer::get (region_ptr &r) const
53{
54 shstr_cmp name = get_str ();
55
56 for_all_regions (rgn)
57 if (rgn->name == name)
58 {
59 r = rgn;
60 return;
61 }
62
63 parse_error (format ("region called %s requested, but not found, using fallback.\n", get_str ()));
64
65 r = region::default_region ();
66}
67
68void
69region::do_destroy ()
70{
71 regions.erase (this);
72
73 attachable::do_destroy ();
74
75 refcnt_dec ();
76}
77
78//+GPL
79
60/* 80/*
61 * Tries to find a region that 'name' corresponds to.
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{
75 if (!name)
76 return default_region ();
77
78 char *p = strchr (name, '\n');
79 if (p)
80 *p = '\0';
81
82 for_all_regions (rgn)
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}
119
120/*
121 * returns 1 if the player is in the region reg, or a child region thereof 81 * returns 1 if the player is in the region reg, or a child region thereof
122 * otherwise returns 0 82 * otherwise returns 0
123 * if passed a NULL region returns -1 83 * if passed a NULL region returns -1
124 */ 84 */
125
126static int 85static int
127region_is_child_of_region (const region * child, const region * r) 86region_is_child_of_region (const region * child, const region * r)
128{ 87{
129 88 if (!r)
130 if (r == NULL)
131 return -1; 89 return -1;
132 90
133 if (child == NULL) 91 if (!child)
134 return 0; 92 return 0;
135 93
136 if (!strcmp (child->name, r->name)) 94 if (child->name == r->name)
137 return 1; 95 return 1;
138 96
139 else if (child->parent != NULL) 97 if (child->parent)
140 return region_is_child_of_region (child->parent, r); 98 return region_is_child_of_region (child->parent, r);
141 else 99
142 return 0; 100 return 0;
143} 101}
144 102
145/** Returns an object which is an exit through which the player represented by op should be 103/** 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 104 * 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 105 * constructed, then NULL will be returned. The caller is responsible for freeing the object
148 * created by this function. 106 * created by this function.
149 */ 107 */
150object * 108object *
151get_jail_exit (object *op) 109get_jail_exit (object *op)
152{ 110{
153 region *reg;
154 object *exit;
155
156 if (op->type != PLAYER) 111 if (op->type != PLAYER)
157 { 112 {
158 LOG (llevError, "region.c: get_jail_exit called against non-player object.\n"); 113 LOG (llevError, "region.c: get_jail_exit called against non-player object.\n");
159 return NULL; 114 return NULL;
160 } 115 }
161 116
162 reg = op->region (); 117 region *reg = op->region ();
163 while (reg) 118 while (reg)
164 { 119 {
165 if (reg->jailmap) 120 if (reg->jailmap)
166 { 121 {
167 exit = object::create (); 122 object *exit = object::create ();
168 EXIT_PATH (exit) = reg->jailmap; 123 EXIT_PATH (exit) = reg->jailmap;
169 /* damned exits reset savebed and remove teleports, so the prisoner can't escape */ 124 /* damned exits reset savebed and remove teleports, so the prisoner can't escape */
170 SET_FLAG (exit, FLAG_DAMNED); 125 exit->set_flag (FLAG_DAMNED);
171 EXIT_X (exit) = reg->jailx; 126 EXIT_X (exit) = reg->jailx;
172 EXIT_Y (exit) = reg->jaily; 127 EXIT_Y (exit) = reg->jaily;
173 return exit; 128 return exit;
174 } 129 }
175 else 130 else
… …
179 LOG (llevError, "No suitable jailmap for region %s was found.\n", &reg->name); 134 LOG (llevError, "No suitable jailmap for region %s was found.\n", &reg->name);
180 135
181 return 0; 136 return 0;
182} 137}
183 138
139//-GPL
140
184region * 141region *
185region::read (object_thawer &f) 142region::read (object_thawer &f)
186{ 143{
187 assert (f.kw == KW_region); 144 assert (f.kw == KW_region);
188 145
189 region *rgn = new region; 146 region *rgn = new region;
147 rgn->refcnt_inc ();
148
190 f.get (rgn->name); 149 f.get (rgn->name);
191 f.next (); 150 f.next ();
192 151
193 for (;;) 152 for (;;)
194 { 153 {
195 switch (f.kw) 154 switch (f.kw)
196 { 155 {
197 case KW_parent: 156 case KW_parent:
198 rgn->parent = region::find (f.get_str ()); 157 f.get (rgn->parent);
199 break; 158 break;
200 159
201 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; 160 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break;
202 case KW_longname: f.get (rgn->longname); break; 161 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; 162 case KW_jail_map: f.get (rgn->jailmap); break;
205 case KW_jail_x: f.get (rgn->jailx); break; 163 case KW_jail_x: f.get (rgn->jailx); break;
206 case KW_jail_y: f.get (rgn->jaily); break; 164 case KW_jail_y: f.get (rgn->jaily); break;
207 case KW_portal_map: f.get (rgn->portalmap);break; 165 case KW_portal_map: f.get (rgn->portalmap);break;
208 case KW_portal_x: f.get (rgn->portalx); break;
209 case KW_portal_y: f.get (rgn->portaly); break;
210 case KW_fallback: f.get (rgn->fallback); break; 166 case KW_fallback: f.get (rgn->fallback); break;
211 case KW_chance: f.get (rgn->treasure_density); break; 167 case KW_chance: f.get (rgn->treasure_density); break;
212 168
213 case KW_randomitems: 169 case KW_randomitems:
214 rgn->treasure = treasurelist::get (f.get_str ()); 170 rgn->treasure = treasurelist::get (f.get_str ());
215 break; 171 break;
216 172
217 case KW_end: 173 case KW_end:
218 f.next (); 174 f.next ();
219 175
176 // cannot use find as that will request the default region
220 for_all_regions (old) 177 for_all_regions (old)
221 if (old->name == rgn->name) 178 if (old->name == rgn->name)
222 { 179 {
223 // replace, copy new values (ugly) 180 old->destroy ();
224 rgn->index = old->index;
225 *old = *rgn;
226 delete rgn;
227
228 return old; 181 break;
229 } 182 }
230 183
231 // just append 184 // just append
232 regions.push_back (rgn); 185 regions.push_back (rgn);
233 return rgn; 186 return rgn;
234 187
188 case KW_ERROR:
189 rgn->set_key_text (f.kw_str, f.value);
190 //fprintf (stderr, "region addkv(%s,%s)\n", f.kw_str, f.value);//D
191 break;
192
235 default: 193 default:
236 if (!f.parse_error ("region", rgn->name)) 194 if (!f.parse_error ("region", rgn->name))
237 { 195 {
238 delete rgn; 196 rgn->destroy ();
239 return 0; 197 return 0;
240 } 198 }
241 break; 199 break;
242 } 200 }
243 201
244 f.next (); 202 f.next ();
245 } 203 }
246} 204}
247 205
248/*
249 * First initialises the archtype hash-table (init_archetable()).
250 * Reads and parses the archetype file (with the first and second-pass
251 * functions).
252 */
253void
254init_regions (void)
255{
256 if (!regions.size ())
257 {
258 // make sure one region is always available
259 region *rgn = new region;
260 rgn->name = "<builtin>";
261 rgn->longname = "Built-in Region";
262 regions.push_back (rgn);
263 }
264}
265

Diff Legend

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