| 1 |
/* |
| 2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 |
* |
| 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 |
| 6 |
* Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team |
| 7 |
* Copyright (©) 1992 Frank Tore Johansen |
| 8 |
* |
| 9 |
* Deliantra is free software: you can redistribute it and/or modify it under |
| 10 |
* the terms of the Affero GNU General Public License as published by the |
| 11 |
* Free Software Foundation, either version 3 of the License, or (at your |
| 12 |
* option) any later version. |
| 13 |
* |
| 14 |
* This program is distributed in the hope that it will be useful, |
| 15 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 16 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 17 |
* GNU General Public License for more details. |
| 18 |
* |
| 19 |
* You should have received a copy of the Affero GNU General Public License |
| 20 |
* and the GNU General Public License along with this program. If not, see |
| 21 |
* <http://www.gnu.org/licenses/>. |
| 22 |
* |
| 23 |
* The authors can be reached via e-mail to <support@deliantra.net> |
| 24 |
*/ |
| 25 |
|
| 26 |
#include <global.h> |
| 27 |
#include <unistd.h> |
| 28 |
|
| 29 |
regionvec regions; |
| 30 |
|
| 31 |
region * |
| 32 |
region::default_region () |
| 33 |
{ |
| 34 |
for_all_regions (rgn) |
| 35 |
if (rgn->fallback) |
| 36 |
return rgn; |
| 37 |
|
| 38 |
return regions [0]; |
| 39 |
} |
| 40 |
|
| 41 |
region * |
| 42 |
region::find (shstr_cmp name) |
| 43 |
{ |
| 44 |
for_all_regions (rgn) |
| 45 |
if (rgn->name == name) |
| 46 |
return rgn; |
| 47 |
|
| 48 |
return default_region (); |
| 49 |
} |
| 50 |
|
| 51 |
void |
| 52 |
object_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 |
|
| 68 |
void |
| 69 |
region::do_destroy () |
| 70 |
{ |
| 71 |
regions.erase (this); |
| 72 |
|
| 73 |
attachable::do_destroy (); |
| 74 |
|
| 75 |
refcnt_dec (); |
| 76 |
} |
| 77 |
|
| 78 |
//+GPL |
| 79 |
|
| 80 |
/* |
| 81 |
* returns 1 if the player is in the region reg, or a child region thereof |
| 82 |
* otherwise returns 0 |
| 83 |
* if passed a NULL region returns -1 |
| 84 |
*/ |
| 85 |
static int |
| 86 |
region_is_child_of_region (const region * child, const region * r) |
| 87 |
{ |
| 88 |
if (!r) |
| 89 |
return -1; |
| 90 |
|
| 91 |
if (!child) |
| 92 |
return 0; |
| 93 |
|
| 94 |
if (child->name == r->name) |
| 95 |
return 1; |
| 96 |
|
| 97 |
if (child->parent) |
| 98 |
return region_is_child_of_region (child->parent, r); |
| 99 |
|
| 100 |
return 0; |
| 101 |
} |
| 102 |
|
| 103 |
/** Returns an object which is an exit through which the player represented by op should be |
| 104 |
* sent in order to be imprisoned. If there is no suitable place to which an exit can be |
| 105 |
* constructed, then NULL will be returned. The caller is responsible for freeing the object |
| 106 |
* created by this function. |
| 107 |
*/ |
| 108 |
object * |
| 109 |
get_jail_exit (object *op) |
| 110 |
{ |
| 111 |
if (op->type != PLAYER) |
| 112 |
{ |
| 113 |
LOG (llevError, "region.c: get_jail_exit called against non-player object.\n"); |
| 114 |
return NULL; |
| 115 |
} |
| 116 |
|
| 117 |
region *reg = op->region (); |
| 118 |
while (reg) |
| 119 |
{ |
| 120 |
if (reg->jailmap) |
| 121 |
{ |
| 122 |
object *exit = object::create (); |
| 123 |
EXIT_PATH (exit) = reg->jailmap; |
| 124 |
/* damned exits reset savebed and remove teleports, so the prisoner can't escape */ |
| 125 |
exit->set_flag (FLAG_DAMNED); |
| 126 |
EXIT_X (exit) = reg->jailx; |
| 127 |
EXIT_Y (exit) = reg->jaily; |
| 128 |
return exit; |
| 129 |
} |
| 130 |
else |
| 131 |
reg = reg->parent; |
| 132 |
} |
| 133 |
|
| 134 |
LOG (llevError, "No suitable jailmap for region %s was found.\n", ®->name); |
| 135 |
|
| 136 |
return 0; |
| 137 |
} |
| 138 |
|
| 139 |
//-GPL |
| 140 |
|
| 141 |
region * |
| 142 |
region::read (object_thawer &f) |
| 143 |
{ |
| 144 |
assert (f.kw == KW_region); |
| 145 |
|
| 146 |
region *rgn = new region; |
| 147 |
rgn->refcnt_inc (); |
| 148 |
|
| 149 |
f.get (rgn->name); |
| 150 |
f.next (); |
| 151 |
|
| 152 |
for (;;) |
| 153 |
{ |
| 154 |
switch (f.kw) |
| 155 |
{ |
| 156 |
case KW_parent: |
| 157 |
f.get (rgn->parent); |
| 158 |
break; |
| 159 |
|
| 160 |
case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break; |
| 161 |
case KW_longname: f.get (rgn->longname); break; |
| 162 |
case KW_jail_map: f.get (rgn->jailmap); break; |
| 163 |
case KW_jail_x: f.get (rgn->jailx); break; |
| 164 |
case KW_jail_y: f.get (rgn->jaily); break; |
| 165 |
case KW_portal_map: f.get (rgn->portalmap);break; |
| 166 |
case KW_fallback: f.get (rgn->fallback); break; |
| 167 |
case KW_chance: f.get (rgn->treasure_density); break; |
| 168 |
|
| 169 |
case KW_randomitems: |
| 170 |
rgn->treasure = treasurelist::get (f.get_str ()); |
| 171 |
break; |
| 172 |
|
| 173 |
case KW_end: |
| 174 |
f.next (); |
| 175 |
|
| 176 |
// cannot use find as that will request the default region |
| 177 |
for_all_regions (old) |
| 178 |
if (old->name == rgn->name) |
| 179 |
{ |
| 180 |
old->destroy (); |
| 181 |
break; |
| 182 |
} |
| 183 |
|
| 184 |
// just append |
| 185 |
regions.push_back (rgn); |
| 186 |
return rgn; |
| 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 |
|
| 193 |
default: |
| 194 |
if (!f.parse_error ("region", rgn->name)) |
| 195 |
{ |
| 196 |
rgn->destroy (); |
| 197 |
return 0; |
| 198 |
} |
| 199 |
break; |
| 200 |
} |
| 201 |
|
| 202 |
f.next (); |
| 203 |
} |
| 204 |
} |
| 205 |
|
