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.27 by root, Sat Apr 14 07:22:59 2007 UTC vs.
Revision 1.51 by root, Sun Apr 25 11:23:31 2010 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,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/*
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 * 50region *
73region::find_fuzzy (const char *name) 51region::find (object_thawer &f)
74{ 52{
75 if (!name) 53 shstr_cmp name = f.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)) 56 if (rgn->name == name)
84 return rgn; 57 return rgn;
85 58
86 for_all_regions (rgn) 59 f.parse_error (format ("region called %s requested, but not found, using fallback.\n", f.get_str ()));
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 60
117 return default_region (); 61 return default_region ();
118} 62}
63
64void
65region::do_destroy ()
66{
67 regions.erase (this);
68
69 attachable::do_destroy ();
70
71 refcnt_dec ();
72}
73
74//+GPL
119 75
120/* 76/*
121 * returns 1 if the player is in the region reg, or a child region thereof 77 * returns 1 if the player is in the region reg, or a child region thereof
122 * otherwise returns 0 78 * otherwise returns 0
123 * if passed a NULL region returns -1 79 * if passed a NULL region returns -1
124 */ 80 */
125
126static int 81static int
127region_is_child_of_region (const region * child, const region * r) 82region_is_child_of_region (const region * child, const region * r)
128{ 83{
129 84 if (!r)
130 if (r == NULL)
131 return -1; 85 return -1;
132 86
133 if (child == NULL) 87 if (!child)
134 return 0; 88 return 0;
135 89
136 if (!strcmp (child->name, r->name)) 90 if (child->name == r->name)
137 return 1; 91 return 1;
138 92
139 else if (child->parent != NULL) 93 if (child->parent)
140 return region_is_child_of_region (child->parent, r); 94 return region_is_child_of_region (child->parent, r);
141 else 95
142 return 0; 96 return 0;
143} 97}
144 98
145/** Returns an object which is an exit through which the player represented by op should be 99/** 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 100 * 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 101 * constructed, then NULL will be returned. The caller is responsible for freeing the object
148 * created by this function. 102 * created by this function.
149 */ 103 */
150object * 104object *
151get_jail_exit (object *op) 105get_jail_exit (object *op)
152{ 106{
153 region *reg;
154 object *exit;
155
156 if (op->type != PLAYER) 107 if (op->type != PLAYER)
157 { 108 {
158 LOG (llevError, "region.c: get_jail_exit called against non-player object.\n"); 109 LOG (llevError, "region.c: get_jail_exit called against non-player object.\n");
159 return NULL; 110 return NULL;
160 } 111 }
161 112
162 reg = op->region (); 113 region *reg = op->region ();
163 while (reg) 114 while (reg)
164 { 115 {
165 if (reg->jailmap) 116 if (reg->jailmap)
166 { 117 {
167 exit = object::create (); 118 object *exit = object::create ();
168 EXIT_PATH (exit) = reg->jailmap; 119 EXIT_PATH (exit) = reg->jailmap;
169 /* damned exits reset savebed and remove teleports, so the prisoner can't escape */ 120 /* damned exits reset savebed and remove teleports, so the prisoner can't escape */
170 SET_FLAG (exit, FLAG_DAMNED); 121 exit->set_flag (FLAG_DAMNED);
171 EXIT_X (exit) = reg->jailx; 122 EXIT_X (exit) = reg->jailx;
172 EXIT_Y (exit) = reg->jaily; 123 EXIT_Y (exit) = reg->jaily;
173 return exit; 124 return exit;
174 } 125 }
175 else 126 else
… …
179 LOG (llevError, "No suitable jailmap for region %s was found.\n", &reg->name); 130 LOG (llevError, "No suitable jailmap for region %s was found.\n", &reg->name);
180 131
181 return 0; 132 return 0;
182} 133}
183 134
135//-GPL
136
184region * 137region *
185region::read (object_thawer &f) 138region::read (object_thawer &f)
186{ 139{
187 assert (f.kw == KW_region); 140 assert (f.kw == KW_region);
188 141
189 region *rgn = new region; 142 region *rgn = new region;
143 rgn->refcnt_inc ();
144
190 f.get (rgn->name); 145 f.get (rgn->name);
191 f.next (); 146 f.next ();
192 147
193 for (;;) 148 for (;;)
194 { 149 {
195 switch (f.kw) 150 switch (f.kw)
196 { 151 {
197 case KW_parent: 152 case KW_parent:
198 rgn->parent = region::find (f.get_str ()); 153 rgn->parent = region::find (f);
199 break; 154 break;
200 155
201 case KW_longname: f.get (rgn->longname); break;
202 case KW_match: f.get (rgn->match); break;
203 case KW_jail_map: f.get (rgn->jailmap); break;
204 case KW_jail_x: f.get (rgn->jailx); break;
205 case KW_jail_y: f.get (rgn->jaily); break;
206 case KW_fallback: f.get (rgn->fallback); break;
207 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; 156 case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break;
157 case KW_longname: f.get (rgn->longname); break;
158 case KW_jail_map: f.get (rgn->jailmap); break;
159 case KW_jail_x: f.get (rgn->jailx); break;
160 case KW_jail_y: f.get (rgn->jaily); break;
161 case KW_portal_map: f.get (rgn->portalmap);break;
162 case KW_fallback: f.get (rgn->fallback); break;
163 case KW_chance: f.get (rgn->treasure_density); break;
164
165 case KW_randomitems:
166 rgn->treasure = treasurelist::get (f.get_str ());
167 break;
208 168
209 case KW_end: 169 case KW_end:
170 f.next ();
171
172 // cannot use find as that will request the default region
210 for_all_regions (old) 173 for_all_regions (old)
211 if (old->name == rgn->name) 174 if (old->name == rgn->name)
212 { 175 {
213 // replace, copy new values (ugly) 176 old->destroy ();
214 rgn->index = old->index;
215 *old = *rgn;
216 delete rgn;
217
218 return old; 177 break;
219 } 178 }
220 179
221 // just append 180 // just append
222 regions.push_back (rgn); 181 regions.push_back (rgn);
223 return rgn; 182 return rgn;
224 183
184 case KW_ERROR:
185 rgn->set_key_text (f.kw_str, f.value);
186 //fprintf (stderr, "region addkv(%s,%s)\n", f.kw_str, f.value);//D
187 break;
188
225 default: 189 default:
226 if (!f.parse_error ("region", rgn->name)) 190 if (!f.parse_error ("region", rgn->name))
227 { 191 {
228 delete rgn; 192 rgn->destroy ();
229 return 0; 193 return 0;
230 } 194 }
231 break; 195 break;
232 } 196 }
233 197
234 f.next (); 198 f.next ();
235 } 199 }
236} 200}
237 201
238/*
239 * First initialises the archtype hash-table (init_archetable()).
240 * Reads and parses the archetype file (with the first and second-pass
241 * functions).
242 * Then initialises treasures by calling load_treasures().
243 */
244void
245init_regions (void)
246{
247 if (!regions.size ())
248 {
249 // make sure one region is always available
250 region *rgn = new region;
251 rgn->name = "<builtin>";
252 rgn->longname = "Built-in Region";
253 regions.push_back (rgn);
254 }
255}
256

Diff Legend

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