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.37 by root, Thu Nov 8 19:43:23 2007 UTC vs.
Revision 1.58 by root, Sat Nov 17 23:40:00 2018 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team 6 * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 7 * Copyright (©) 1992 Frank Tore Johansen
7 * 8 *
8 * Deliantra 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 3 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, see <http://www.gnu.org/licenses/>. 20 * and the GNU General Public License along with this program. If not, see
21 * <http://www.gnu.org/licenses/>.
20 * 22 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 23 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 24 */
23 25
24#include <global.h> 26#include <global.h>
25#include <unistd.h> 27#include <unistd.h>
… …
34 return rgn; 36 return rgn;
35 37
36 return regions [0]; 38 return regions [0];
37} 39}
38 40
39/*
40 * Pass a char array, returns a pointer to the region of the same name.
41 * if it can't find a region of the same name it returns the first region
42 * with the 'fallback' property set.
43 * if it can't find a matching name /or/ a fallback region it logs an info message
44 * message and returns NULL
45 * used by the map parsing code.
46 */
47region * 41region *
48region::find (const char *name) 42region::find (shstr_cmp name)
49{ 43{
50 for_all_regions (rgn) 44 for_all_regions (rgn)
51 if (!strcmp (rgn->name, name)) 45 if (rgn->name == name)
52 return rgn; 46 return rgn;
53 47
54 LOG (llevError, "region called %s requested, but not found, using fallback.\n", name);
55
56 return default_region (); 48 return default_region ();
57} 49}
58 50
59/* 51void
60 * Tries to find a region that 'name' corresponds to. 52object_thawer::get (region_ptr &r) const
61 * It looks, in order, for:
62 * an exact match to region name (case insensitive)
63 * an exact match to longname (case insensitive)
64 * a substring that matches to the longname (eg Kingdom)
65 * a substring that matches to the region name (eg nav)
66 * if it can find none of these it returns the first parentless region
67 * (there should be only one of these - the top level one)
68 * If we got a NULL, then just return the top level region
69 *
70 */
71region *
72region::find_fuzzy (const char *name)
73{ 53{
74 if (!name) 54 shstr_cmp name = get_str ();
75 return default_region ();
76
77 char *p = strchr (name, '\n');
78 if (p)
79 *p = '\0';
80 55
81 for_all_regions (rgn) 56 for_all_regions (rgn)
82 if (!strcasecmp (rgn->name, name))
83 return rgn;
84
85 for_all_regions (rgn)
86 if (rgn->longname) 57 if (rgn->name == name)
87 if (!strcasecmp (rgn->longname, name))
88 return rgn;
89
90 for_all_regions (rgn)
91 if (rgn->longname)
92 { 58 {
93 if (strstr (rgn->longname, name)) 59 r = rgn;
94 return rgn; 60 return;
95 } 61 }
96 62
97 for_all_regions (rgn) 63 parse_error (format ("region called %s requested, but not found, using fallback.\n", get_str ()));
98 if (rgn->longname)
99 {
100 /*
101 * This is not a bug, we want the region that is most identifiably a discrete
102 * area in the game, eg if we have 'scor', we want to return 'scorn' and not
103 * 'scornarena', regardless of their order on the list so we only look at those
104 * regions with a longname set.
105 */
106 if (strstr (rgn->name, name))
107 return rgn;
108 }
109 64
110 for_all_regions (rgn)
111 {
112 if (strstr (rgn->name, name))
113 return rgn;
114 }
115
116 return default_region (); 65 r = region::default_region ();
117} 66}
118 67
119void 68void
120region::do_destroy () 69region::do_destroy ()
121{ 70{
… …
124 attachable::do_destroy (); 73 attachable::do_destroy ();
125 74
126 refcnt_dec (); 75 refcnt_dec ();
127} 76}
128 77
78//+GPL
79
129/* 80/*
130 * 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
131 * otherwise returns 0 82 * otherwise returns 0
132 * if passed a NULL region returns -1 83 * if passed a NULL region returns -1
133 */ 84 */
134static int 85static int
135region_is_child_of_region (const region * child, const region * r) 86region_is_child_of_region (const region * child, const region * r)
136{ 87{
137 88 if (!r)
138 if (r == NULL)
139 return -1; 89 return -1;
140 90
141 if (child == NULL) 91 if (!child)
142 return 0; 92 return 0;
143 93
144 if (!strcmp (child->name, r->name)) 94 if (child->name == r->name)
145 return 1; 95 return 1;
146 96
147 else if (child->parent != NULL) 97 if (child->parent)
148 return region_is_child_of_region (child->parent, r); 98 return region_is_child_of_region (child->parent, r);
149 else 99
150 return 0; 100 return 0;
151} 101}
152 102
153/** 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
154 * 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
155 * 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
156 * created by this function. 106 * created by this function.
157 */ 107 */
158object * 108object *
159get_jail_exit (object *op) 109get_jail_exit (object *op)
160{ 110{
161 region *reg;
162 object *exit;
163
164 if (op->type != PLAYER) 111 if (op->type != PLAYER)
165 { 112 {
166 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");
167 return NULL; 114 return NULL;
168 } 115 }
169 116
170 reg = op->region (); 117 region *reg = op->region ();
171 while (reg) 118 while (reg)
172 { 119 {
173 if (reg->jailmap) 120 if (reg->jailmap)
174 { 121 {
175 exit = object::create (); 122 object *exit = object::create ();
176 EXIT_PATH (exit) = reg->jailmap; 123 EXIT_PATH (exit) = reg->jailmap;
177 /* 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 */
178 SET_FLAG (exit, FLAG_DAMNED); 125 exit->set_flag (FLAG_DAMNED);
179 EXIT_X (exit) = reg->jailx; 126 EXIT_X (exit) = reg->jailx;
180 EXIT_Y (exit) = reg->jaily; 127 EXIT_Y (exit) = reg->jaily;
181 return exit; 128 return exit;
182 } 129 }
183 else 130 else
… …
187 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);
188 135
189 return 0; 136 return 0;
190} 137}
191 138
139//-GPL
140
192region * 141region *
193region::read (object_thawer &f) 142region::read (object_thawer &f)
194{ 143{
195 assert (f.kw == KW_region); 144 assert (f.kw == KW_region);
196 145
… …
203 for (;;) 152 for (;;)
204 { 153 {
205 switch (f.kw) 154 switch (f.kw)
206 { 155 {
207 case KW_parent: 156 case KW_parent:
208 rgn->parent = region::find (f.get_str ()); 157 f.get (rgn->parent);
209 break; 158 break;
210 159
211 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; 160 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break;
212 case KW_longname: f.get (rgn->longname); break; 161 case KW_longname: f.get (rgn->longname); break;
213 case KW_jail_map: f.get (rgn->jailmap); break; 162 case KW_jail_map: f.get (rgn->jailmap); break;
214 case KW_jail_x: f.get (rgn->jailx); break; 163 case KW_jail_x: f.get (rgn->jailx); break;
215 case KW_jail_y: f.get (rgn->jaily); break; 164 case KW_jail_y: f.get (rgn->jaily); break;
216 case KW_portal_map: f.get (rgn->portalmap);break; 165 case KW_portal_map: f.get (rgn->portalmap);break;
217 case KW_portal_x: f.get (rgn->portalx); break;
218 case KW_portal_y: f.get (rgn->portaly); break;
219 case KW_fallback: f.get (rgn->fallback); break; 166 case KW_fallback: f.get (rgn->fallback); break;
220 case KW_chance: f.get (rgn->treasure_density); break; 167 case KW_chance: f.get (rgn->treasure_density); break;
221 168
222 case KW_randomitems: 169 case KW_randomitems:
223 rgn->treasure = treasurelist::get (f.get_str ()); 170 rgn->treasure = treasurelist::get (f.get_str ());
… …
254 201
255 f.next (); 202 f.next ();
256 } 203 }
257} 204}
258 205
259/*
260 * First initialises the archtype hash-table (init_archetable()).
261 * Reads and parses the archetype file (with the first and second-pass
262 * functions).
263 */
264void
265init_regions (void)
266{
267 if (!regions.size ())
268 {
269 // make sure one region is always available
270 region *rgn = new region;
271 rgn->name = "<builtin>";
272 rgn->longname = "Built-in Region";
273 regions.push_back (rgn);
274 }
275}
276

Diff Legend

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