| 1 |
/* |
| 2 |
* ircd-hybrid: an advanced, lightweight Internet Relay Chat Daemon (ircd) |
| 3 |
* |
| 4 |
* Copyright (c) 2001-2018 ircd-hybrid development team |
| 5 |
* |
| 6 |
* This program is free software; you can redistribute it and/or modify |
| 7 |
* it under the terms of the GNU General Public License as published by |
| 8 |
* the Free Software Foundation; either version 2 of the License, or |
| 9 |
* (at your option) any later version. |
| 10 |
* |
| 11 |
* This program is distributed in the hope that it will be useful, |
| 12 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 14 |
* GNU General Public License for more details. |
| 15 |
* |
| 16 |
* You should have received a copy of the GNU General Public License |
| 17 |
* along with this program; if not, write to the Free Software |
| 18 |
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 |
| 19 |
* USA |
| 20 |
*/ |
| 21 |
|
| 22 |
/*! \file hostmask.c |
| 23 |
* \brief Code to efficiently find IP & hostmask based configs. |
| 24 |
* \version $Id$ |
| 25 |
*/ |
| 26 |
|
| 27 |
#include "stdinc.h" |
| 28 |
#include "memory.h" |
| 29 |
#include "ircd_defs.h" |
| 30 |
#include "list.h" |
| 31 |
#include "conf.h" |
| 32 |
#include "hostmask.h" |
| 33 |
#include "send.h" |
| 34 |
#include "irc_string.h" |
| 35 |
#include "ircd.h" |
| 36 |
|
| 37 |
|
| 38 |
#define DigitParse(ch) do { \ |
| 39 |
if (ch >= '0' && ch <= '9') \ |
| 40 |
ch = ch - '0'; \ |
| 41 |
else if (ch >= 'A' && ch <= 'F') \ |
| 42 |
ch = ch - 'A' + 10; \ |
| 43 |
else if (ch >= 'a' && ch <= 'f') \ |
| 44 |
ch = ch - 'a' + 10; \ |
| 45 |
} while (0); |
| 46 |
|
| 47 |
/* Hashtable stuff...now external as it's used in m_stats.c */ |
| 48 |
dlink_list atable[ATABLE_SIZE]; |
| 49 |
|
| 50 |
/* The mask parser/type determination code... */ |
| 51 |
|
| 52 |
/* int try_parse_v6_netmask(const char *, struct irc_ssaddr *, int *); |
| 53 |
* Input: A possible IPV6 address as a string. |
| 54 |
* Output: An integer describing whether it is an IPV6 or hostmask, |
| 55 |
* an address(if it is IPV6), a bitlength(if it is IPV6). |
| 56 |
* Side effects: None |
| 57 |
* Comments: Called from parse_netmask |
| 58 |
*/ |
| 59 |
static int |
| 60 |
try_parse_v6_netmask(const char *text, struct irc_ssaddr *addr, int *b) |
| 61 |
{ |
| 62 |
char c; |
| 63 |
int d[8] = { 0, 0, 0, 0, 0, 0, 0, 0 }; |
| 64 |
int dp = 0; |
| 65 |
int nyble = 4; |
| 66 |
int finsert = -1; |
| 67 |
int bits = 128; |
| 68 |
int deficit = 0; |
| 69 |
short dc[8]; |
| 70 |
struct sockaddr_in6 *const v6 = (struct sockaddr_in6 *)addr; |
| 71 |
|
| 72 |
for (const char *p = text; (c = *p); ++p) |
| 73 |
{ |
| 74 |
if (IsXDigit(c)) |
| 75 |
{ |
| 76 |
if (nyble == 0) |
| 77 |
return HM_HOST; |
| 78 |
DigitParse(c); |
| 79 |
d[dp] |= c << (4 * --nyble); |
| 80 |
} |
| 81 |
else if (c == ':') |
| 82 |
{ |
| 83 |
if (p > text && *(p - 1) == ':') |
| 84 |
{ |
| 85 |
if (finsert >= 0) |
| 86 |
return HM_HOST; |
| 87 |
finsert = dp; |
| 88 |
} |
| 89 |
else |
| 90 |
{ |
| 91 |
/* |
| 92 |
* If there were less than 4 hex digits, e.g. :ABC: shift right |
| 93 |
* so we don't interpret it as ABC0 -A1kmm |
| 94 |
*/ |
| 95 |
d[dp] = d[dp] >> 4 * nyble; |
| 96 |
nyble = 4; |
| 97 |
|
| 98 |
if (++dp >= 8) |
| 99 |
return HM_HOST; |
| 100 |
} |
| 101 |
} |
| 102 |
else if (c == '*') |
| 103 |
{ |
| 104 |
/* * must be last, and * is ambiguous if there is a ::... -A1kmm */ |
| 105 |
if (finsert >= 0 || *(p + 1) || dp == 0 || *(p - 1) != ':') |
| 106 |
return HM_HOST; |
| 107 |
bits = dp * 16; |
| 108 |
} |
| 109 |
else if (c == '/') |
| 110 |
{ |
| 111 |
char *after; |
| 112 |
|
| 113 |
d[dp] = d[dp] >> 4 * nyble; |
| 114 |
++dp; |
| 115 |
bits = strtoul(p + 1, &after, 10); |
| 116 |
|
| 117 |
if (bits < 0 || *after) |
| 118 |
return HM_HOST; |
| 119 |
if (bits > dp * 4 && !(finsert >= 0 && bits <= 128)) |
| 120 |
return HM_HOST; |
| 121 |
break; |
| 122 |
} |
| 123 |
else |
| 124 |
return HM_HOST; |
| 125 |
} |
| 126 |
|
| 127 |
d[dp] = d[dp] >> 4 * nyble; |
| 128 |
|
| 129 |
if (c == 0) |
| 130 |
++dp; |
| 131 |
if (finsert < 0 && bits == 0) |
| 132 |
bits = dp * 16; |
| 133 |
|
| 134 |
/* How many words are missing? -A1kmm */ |
| 135 |
deficit = bits / 16 + ((bits % 16) ? 1 : 0) - dp; |
| 136 |
|
| 137 |
/* Now fill in the gaps(from ::) in the copied table... -A1kmm */ |
| 138 |
for (dp = 0, nyble = 0; dp < 8; ++dp) |
| 139 |
{ |
| 140 |
if (nyble == finsert && deficit) |
| 141 |
{ |
| 142 |
dc[dp] = 0; |
| 143 |
deficit--; |
| 144 |
} |
| 145 |
else |
| 146 |
dc[dp] = d[nyble++]; |
| 147 |
} |
| 148 |
|
| 149 |
/* Set unused bits to 0... -A1kmm */ |
| 150 |
if (bits < 128 && (bits % 16 != 0)) |
| 151 |
dc[bits / 16] &= ~((1 << (15 - bits % 16)) - 1); |
| 152 |
for (dp = bits / 16 + (bits % 16 ? 1 : 0); dp < 8; ++dp) |
| 153 |
dc[dp] = 0; |
| 154 |
|
| 155 |
/* And assign... -A1kmm */ |
| 156 |
if (addr) |
| 157 |
{ |
| 158 |
v6->sin6_family = AF_INET6; |
| 159 |
|
| 160 |
for (dp = 0; dp < 8; ++dp) |
| 161 |
/* The cast is a kludge to make netbsd work. */ |
| 162 |
((unsigned short *)&v6->sin6_addr)[dp] = htons(dc[dp]); |
| 163 |
} |
| 164 |
|
| 165 |
if (b) |
| 166 |
*b = bits; |
| 167 |
return HM_IPV6; |
| 168 |
} |
| 169 |
|
| 170 |
/* int try_parse_v4_netmask(const char *, struct irc_ssaddr *, int *); |
| 171 |
* Input: A possible IPV4 address as a string. |
| 172 |
* Output: An integer describing whether it is an IPV4 or hostmask, |
| 173 |
* an address(if it is IPV4), a bitlength(if it is IPV4). |
| 174 |
* Side effects: None |
| 175 |
* Comments: Called from parse_netmask |
| 176 |
*/ |
| 177 |
static int |
| 178 |
try_parse_v4_netmask(const char *text, struct irc_ssaddr *addr, int *b) |
| 179 |
{ |
| 180 |
const char *digits[4]; |
| 181 |
unsigned char addb[4]; |
| 182 |
int n = 0, bits = 0; |
| 183 |
char c; |
| 184 |
struct sockaddr_in *const v4 = (struct sockaddr_in *)addr; |
| 185 |
|
| 186 |
digits[n++] = text; |
| 187 |
|
| 188 |
for (const char *p = text; (c = *p); ++p) |
| 189 |
{ |
| 190 |
if (c >= '0' && c <= '9') /* empty */ |
| 191 |
; |
| 192 |
else if (c == '.') |
| 193 |
{ |
| 194 |
if (n >= 4) |
| 195 |
return HM_HOST; |
| 196 |
|
| 197 |
digits[n++] = p + 1; |
| 198 |
} |
| 199 |
else if (c == '*') |
| 200 |
{ |
| 201 |
if (*(p + 1) || n == 1 || *(p - 1) != '.') |
| 202 |
return HM_HOST; |
| 203 |
|
| 204 |
bits = (n - 1) * 8; |
| 205 |
break; |
| 206 |
} |
| 207 |
else if (c == '/') |
| 208 |
{ |
| 209 |
char *after; |
| 210 |
bits = strtoul(p + 1, &after, 10); |
| 211 |
|
| 212 |
if (bits < 0 || *after) |
| 213 |
return HM_HOST; |
| 214 |
if (bits > n * 8) |
| 215 |
return HM_HOST; |
| 216 |
|
| 217 |
break; |
| 218 |
} |
| 219 |
else |
| 220 |
return HM_HOST; |
| 221 |
} |
| 222 |
|
| 223 |
if (n < 4 && bits == 0) |
| 224 |
bits = n * 8; |
| 225 |
if (bits) |
| 226 |
while (n < 4) |
| 227 |
digits[n++] = "0"; |
| 228 |
|
| 229 |
for (n = 0; n < 4; ++n) |
| 230 |
addb[n] = strtoul(digits[n], NULL, 10); |
| 231 |
|
| 232 |
if (bits == 0) |
| 233 |
bits = 32; |
| 234 |
|
| 235 |
/* Set unused bits to 0... -A1kmm */ |
| 236 |
if (bits < 32 && bits % 8) |
| 237 |
addb[bits / 8] &= ~((1 << (8 - bits % 8)) - 1); |
| 238 |
for (n = bits / 8 + (bits % 8 ? 1 : 0); n < 4; ++n) |
| 239 |
addb[n] = 0; |
| 240 |
if (addr) |
| 241 |
{ |
| 242 |
v4->sin_family = AF_INET; |
| 243 |
v4->sin_addr.s_addr = |
| 244 |
htonl(addb[0] << 24 | addb[1] << 16 | addb[2] << 8 | addb[3]); |
| 245 |
} |
| 246 |
|
| 247 |
if (b) |
| 248 |
*b = bits; |
| 249 |
return HM_IPV4; |
| 250 |
} |
| 251 |
|
| 252 |
/* int parse_netmask(const char *, struct irc_ssaddr *, int *); |
| 253 |
* Input: A hostmask, or an IPV4/6 address. |
| 254 |
* Output: An integer describing whether it is an IPV4, IPV6 address or a |
| 255 |
* hostmask, an address(if it is an IP mask), |
| 256 |
* a bitlength(if it is IP mask). |
| 257 |
* Side effects: None |
| 258 |
*/ |
| 259 |
int |
| 260 |
parse_netmask(const char *text, struct irc_ssaddr *addr, int *b) |
| 261 |
{ |
| 262 |
if (addr) |
| 263 |
memset(addr, 0, sizeof(*addr)); |
| 264 |
|
| 265 |
if (strchr(text, '.')) |
| 266 |
return try_parse_v4_netmask(text, addr, b); |
| 267 |
if (strchr(text, ':')) |
| 268 |
return try_parse_v6_netmask(text, addr, b); |
| 269 |
|
| 270 |
return HM_HOST; |
| 271 |
} |
| 272 |
|
| 273 |
/* The address matching stuff... */ |
| 274 |
/* int match_ipv6(struct irc_ssaddr *, struct irc_ssaddr *, int) |
| 275 |
* Input: An IP address, an IP mask, the number of bits in the mask. |
| 276 |
* Output: if match, -1 else 0 |
| 277 |
* Side effects: None |
| 278 |
*/ |
| 279 |
int |
| 280 |
match_ipv6(const struct irc_ssaddr *addr, const struct irc_ssaddr *mask, int bits) |
| 281 |
{ |
| 282 |
int i, m, n = bits / 8; |
| 283 |
const struct sockaddr_in6 *const v6 = (const struct sockaddr_in6 *)addr; |
| 284 |
const struct sockaddr_in6 *const v6mask = (const struct sockaddr_in6 *)mask; |
| 285 |
|
| 286 |
for (i = 0; i < n; ++i) |
| 287 |
if (v6->sin6_addr.s6_addr[i] != v6mask->sin6_addr.s6_addr[i]) |
| 288 |
return 0; |
| 289 |
|
| 290 |
if ((m = bits % 8) == 0) |
| 291 |
return -1; |
| 292 |
if ((v6->sin6_addr.s6_addr[n] & ~((1 << (8 - m)) - 1)) == |
| 293 |
v6mask->sin6_addr.s6_addr[n]) |
| 294 |
return -1; |
| 295 |
return 0; |
| 296 |
} |
| 297 |
|
| 298 |
/* int match_ipv4(struct irc_ssaddr *, struct irc_ssaddr *, int) |
| 299 |
* Input: An IP address, an IP mask, the number of bits in the mask. |
| 300 |
* Output: if match, -1 else 0 |
| 301 |
* Side Effects: None |
| 302 |
*/ |
| 303 |
int |
| 304 |
match_ipv4(const struct irc_ssaddr *addr, const struct irc_ssaddr *mask, int bits) |
| 305 |
{ |
| 306 |
const struct sockaddr_in *const v4 = (const struct sockaddr_in *)addr; |
| 307 |
const struct sockaddr_in *const v4mask = (const struct sockaddr_in *)mask; |
| 308 |
|
| 309 |
if ((ntohl(v4->sin_addr.s_addr) & ~((1 << (32 - bits)) - 1)) != |
| 310 |
ntohl(v4mask->sin_addr.s_addr)) |
| 311 |
return 0; |
| 312 |
return -1; |
| 313 |
} |
| 314 |
|
| 315 |
/* unsigned long hash_ipv4(struct irc_ssaddr*) |
| 316 |
* Input: An IP address. |
| 317 |
* Output: A hash value of the IP address. |
| 318 |
* Side effects: None |
| 319 |
*/ |
| 320 |
static uint32_t |
| 321 |
hash_ipv4(const struct irc_ssaddr *addr, int bits) |
| 322 |
{ |
| 323 |
if (bits) |
| 324 |
{ |
| 325 |
const struct sockaddr_in *const v4 = (const struct sockaddr_in *)addr; |
| 326 |
uint32_t av = ntohl(v4->sin_addr.s_addr) & ~((1 << (32 - bits)) - 1); |
| 327 |
|
| 328 |
return (av ^ (av >> 12) ^ (av >> 24)) & (ATABLE_SIZE - 1); |
| 329 |
} |
| 330 |
|
| 331 |
return 0; |
| 332 |
} |
| 333 |
|
| 334 |
/* unsigned long hash_ipv6(struct irc_ssaddr*) |
| 335 |
* Input: An IP address. |
| 336 |
* Output: A hash value of the IP address. |
| 337 |
* Side effects: None |
| 338 |
*/ |
| 339 |
static uint32_t |
| 340 |
hash_ipv6(const struct irc_ssaddr *addr, int bits) |
| 341 |
{ |
| 342 |
uint32_t v = 0, n; |
| 343 |
const struct sockaddr_in6 *const v6 = (const struct sockaddr_in6 *)addr; |
| 344 |
|
| 345 |
for (n = 0; n < 16; ++n) |
| 346 |
{ |
| 347 |
if (bits >= 8) |
| 348 |
{ |
| 349 |
v ^= v6->sin6_addr.s6_addr[n]; |
| 350 |
bits -= 8; |
| 351 |
} |
| 352 |
else if (bits) |
| 353 |
{ |
| 354 |
v ^= v6->sin6_addr.s6_addr[n] & ~((1 << (8 - bits)) - 1); |
| 355 |
return v & (ATABLE_SIZE - 1); |
| 356 |
} |
| 357 |
else |
| 358 |
return v & (ATABLE_SIZE - 1); |
| 359 |
} |
| 360 |
|
| 361 |
return v & (ATABLE_SIZE - 1); |
| 362 |
} |
| 363 |
|
| 364 |
/* int hash_text(const char *start) |
| 365 |
* Input: The start of the text to hash. |
| 366 |
* Output: The hash of the string between 1 and (TH_MAX-1) |
| 367 |
* Side-effects: None. |
| 368 |
*/ |
| 369 |
static uint32_t |
| 370 |
hash_text(const char *start) |
| 371 |
{ |
| 372 |
uint32_t h = 0; |
| 373 |
|
| 374 |
for (const char *p = start; *p; ++p) |
| 375 |
h = (h << 4) - (h + ToLower(*p)); |
| 376 |
|
| 377 |
return h & (ATABLE_SIZE - 1); |
| 378 |
} |
| 379 |
|
| 380 |
/* unsigned long get_hash_mask(const char *) |
| 381 |
* Input: The text to hash. |
| 382 |
* Output: The hash of the string right of the first '.' past the last |
| 383 |
* wildcard in the string. |
| 384 |
* Side-effects: None. |
| 385 |
*/ |
| 386 |
static uint32_t |
| 387 |
get_mask_hash(const char *text) |
| 388 |
{ |
| 389 |
const char *hp = "", *p; |
| 390 |
|
| 391 |
for (p = text + strlen(text) - 1; p >= text; --p) |
| 392 |
if (IsMWildChar(*p)) |
| 393 |
return hash_text(hp); |
| 394 |
else if (*p == '.') |
| 395 |
hp = p + 1; |
| 396 |
return hash_text(text); |
| 397 |
} |
| 398 |
|
| 399 |
/* struct MaskItem *find_conf_by_address(const char *, struct irc_ssaddr *, |
| 400 |
* int type, int fam, const char *username) |
| 401 |
* Input: The hostname, the address, the type of mask to find, the address |
| 402 |
* family, the username. |
| 403 |
* Output: The matching value with the highest precedence. |
| 404 |
* Side-effects: None |
| 405 |
* Note: Setting bit 0 of the type means that the username is ignored. |
| 406 |
* Warning: IsNeedPassword for everything that is not an auth{} entry |
| 407 |
* should always be true (i.e. conf->flags & CONF_FLAGS_NEED_PASSWORD == 0) |
| 408 |
*/ |
| 409 |
struct MaskItem * |
| 410 |
find_conf_by_address(const char *name, const struct irc_ssaddr *addr, unsigned int type, |
| 411 |
int fam, const char *username, const char *password, int do_match) |
| 412 |
{ |
| 413 |
unsigned int hprecv = 0; |
| 414 |
dlink_node *node; |
| 415 |
struct MaskItem *hprec = NULL; |
| 416 |
struct AddressRec *arec = NULL; |
| 417 |
int (*cmpfunc)(const char *, const char *) = do_match ? match : irccmp; |
| 418 |
|
| 419 |
if (addr) |
| 420 |
{ |
| 421 |
/* Check for IPV6 matches... */ |
| 422 |
if (fam == AF_INET6) |
| 423 |
{ |
| 424 |
for (int b = 128; b >= 0; b -= 16) |
| 425 |
{ |
| 426 |
DLINK_FOREACH(node, atable[hash_ipv6(addr, b)].head) |
| 427 |
{ |
| 428 |
arec = node->data; |
| 429 |
|
| 430 |
if ((arec->type == type) && |
| 431 |
arec->precedence > hprecv && |
| 432 |
arec->masktype == HM_IPV6 && |
| 433 |
match_ipv6(addr, &arec->Mask.ipa.addr, |
| 434 |
arec->Mask.ipa.bits) && |
| 435 |
(!username || !cmpfunc(arec->username, username)) && |
| 436 |
(IsNeedPassword(arec->conf) || arec->conf->passwd == NULL || |
| 437 |
match_conf_password(password, arec->conf))) |
| 438 |
{ |
| 439 |
hprecv = arec->precedence; |
| 440 |
hprec = arec->conf; |
| 441 |
} |
| 442 |
} |
| 443 |
} |
| 444 |
} |
| 445 |
else if (fam == AF_INET) |
| 446 |
{ |
| 447 |
for (int b = 32; b >= 0; b -= 8) |
| 448 |
{ |
| 449 |
DLINK_FOREACH(node, atable[hash_ipv4(addr, b)].head) |
| 450 |
{ |
| 451 |
arec = node->data; |
| 452 |
|
| 453 |
if ((arec->type == type) && |
| 454 |
arec->precedence > hprecv && |
| 455 |
arec->masktype == HM_IPV4 && |
| 456 |
match_ipv4(addr, &arec->Mask.ipa.addr, |
| 457 |
arec->Mask.ipa.bits) && |
| 458 |
(!username || !cmpfunc(arec->username, username)) && |
| 459 |
(IsNeedPassword(arec->conf) || arec->conf->passwd == NULL || |
| 460 |
match_conf_password(password, arec->conf))) |
| 461 |
{ |
| 462 |
hprecv = arec->precedence; |
| 463 |
hprec = arec->conf; |
| 464 |
} |
| 465 |
} |
| 466 |
} |
| 467 |
} |
| 468 |
} |
| 469 |
|
| 470 |
if (name) |
| 471 |
{ |
| 472 |
const char *p = name; |
| 473 |
|
| 474 |
while (1) |
| 475 |
{ |
| 476 |
DLINK_FOREACH(node, atable[hash_text(p)].head) |
| 477 |
{ |
| 478 |
arec = node->data; |
| 479 |
if ((arec->type == type) && |
| 480 |
arec->precedence > hprecv && |
| 481 |
(arec->masktype == HM_HOST) && |
| 482 |
!cmpfunc(arec->Mask.hostname, name) && |
| 483 |
(!username || !cmpfunc(arec->username, username)) && |
| 484 |
(IsNeedPassword(arec->conf) || arec->conf->passwd == NULL || |
| 485 |
match_conf_password(password, arec->conf))) |
| 486 |
{ |
| 487 |
hprecv = arec->precedence; |
| 488 |
hprec = arec->conf; |
| 489 |
} |
| 490 |
} |
| 491 |
|
| 492 |
if ((p = strchr(p, '.')) == NULL) |
| 493 |
break; |
| 494 |
++p; |
| 495 |
} |
| 496 |
|
| 497 |
DLINK_FOREACH(node, atable[0].head) |
| 498 |
{ |
| 499 |
arec = node->data; |
| 500 |
|
| 501 |
if (arec->type == type && |
| 502 |
arec->precedence > hprecv && |
| 503 |
arec->masktype == HM_HOST && |
| 504 |
!cmpfunc(arec->Mask.hostname, name) && |
| 505 |
(!username || !cmpfunc(arec->username, username)) && |
| 506 |
(IsNeedPassword(arec->conf) || arec->conf->passwd == NULL || |
| 507 |
match_conf_password(password, arec->conf))) |
| 508 |
{ |
| 509 |
hprecv = arec->precedence; |
| 510 |
hprec = arec->conf; |
| 511 |
} |
| 512 |
} |
| 513 |
} |
| 514 |
|
| 515 |
return hprec; |
| 516 |
} |
| 517 |
|
| 518 |
/* struct MaskItem* find_address_conf(const char*, const char*, |
| 519 |
* struct irc_ssaddr*, int, char *); |
| 520 |
* Input: The hostname, username, address, address family. |
| 521 |
* Output: The applicable MaskItem. |
| 522 |
* Side-effects: None |
| 523 |
*/ |
| 524 |
struct MaskItem * |
| 525 |
find_address_conf(const char *host, const char *user, const struct irc_ssaddr *ip, |
| 526 |
int aftype, const char *password) |
| 527 |
{ |
| 528 |
struct MaskItem *authcnf = NULL, *killcnf = NULL; |
| 529 |
|
| 530 |
/* Find the best auth{} block... If none, return NULL -A1kmm */ |
| 531 |
if ((authcnf = find_conf_by_address(host, ip, CONF_CLIENT, aftype, user, password, 1)) == NULL) |
| 532 |
return NULL; |
| 533 |
|
| 534 |
/* If they are exempt from K-lines, return the best auth{} block. -A1kmm */ |
| 535 |
if (IsConfExemptKline(authcnf)) |
| 536 |
return authcnf; |
| 537 |
|
| 538 |
/* Find the best K-line... -A1kmm */ |
| 539 |
killcnf = find_conf_by_address(host, ip, CONF_KLINE, aftype, user, NULL, 1); |
| 540 |
|
| 541 |
/* |
| 542 |
* If they are K-lined, return the K-line. Otherwise, return the |
| 543 |
* auth {} block. -A1kmm |
| 544 |
*/ |
| 545 |
if (killcnf) |
| 546 |
return killcnf; |
| 547 |
|
| 548 |
return authcnf; |
| 549 |
} |
| 550 |
|
| 551 |
/* struct MaskItem* find_dline_conf(struct irc_ssaddr*, int) |
| 552 |
* |
| 553 |
* Input: An address, an address family. |
| 554 |
* Output: The best matching D-line or exempt line. |
| 555 |
* Side effects: None. |
| 556 |
*/ |
| 557 |
struct MaskItem * |
| 558 |
find_dline_conf(const struct irc_ssaddr *addr, int aftype) |
| 559 |
{ |
| 560 |
struct MaskItem *eline; |
| 561 |
|
| 562 |
eline = find_conf_by_address(NULL, addr, CONF_EXEMPT, aftype, NULL, NULL, 1); |
| 563 |
if (eline) |
| 564 |
return eline; |
| 565 |
|
| 566 |
return find_conf_by_address(NULL, addr, CONF_DLINE, aftype, NULL, NULL, 1); |
| 567 |
} |
| 568 |
|
| 569 |
/* void add_conf_by_address(int, struct MaskItem *aconf) |
| 570 |
* Input: |
| 571 |
* Output: None |
| 572 |
* Side-effects: Adds this entry to the hash table. |
| 573 |
*/ |
| 574 |
struct AddressRec * |
| 575 |
add_conf_by_address(const unsigned int type, struct MaskItem *conf) |
| 576 |
{ |
| 577 |
const char *const hostname = conf->host; |
| 578 |
const char *const username = conf->user; |
| 579 |
static unsigned int prec_value = UINT_MAX; |
| 580 |
int bits = 0; |
| 581 |
|
| 582 |
assert(type && !EmptyString(hostname)); |
| 583 |
|
| 584 |
struct AddressRec *arec = xcalloc(sizeof(*arec)); |
| 585 |
arec->masktype = parse_netmask(hostname, &arec->Mask.ipa.addr, &bits); |
| 586 |
arec->Mask.ipa.bits = bits; |
| 587 |
arec->username = username; |
| 588 |
arec->conf = conf; |
| 589 |
arec->precedence = prec_value--; |
| 590 |
arec->type = type; |
| 591 |
|
| 592 |
switch (arec->masktype) |
| 593 |
{ |
| 594 |
case HM_IPV4: |
| 595 |
/* We have to do this, since we do not re-hash for every bit -A1kmm. */ |
| 596 |
bits -= bits % 8; |
| 597 |
dlinkAdd(arec, &arec->node, &atable[hash_ipv4(&arec->Mask.ipa.addr, bits)]); |
| 598 |
break; |
| 599 |
case HM_IPV6: |
| 600 |
/* We have to do this, since we do not re-hash for every bit -A1kmm. */ |
| 601 |
bits -= bits % 16; |
| 602 |
dlinkAdd(arec, &arec->node, &atable[hash_ipv6(&arec->Mask.ipa.addr, bits)]); |
| 603 |
break; |
| 604 |
default: /* HM_HOST */ |
| 605 |
arec->Mask.hostname = hostname; |
| 606 |
dlinkAdd(arec, &arec->node, &atable[get_mask_hash(hostname)]); |
| 607 |
break; |
| 608 |
} |
| 609 |
|
| 610 |
return arec; |
| 611 |
} |
| 612 |
|
| 613 |
/* void delete_one_address(const char*, struct MaskItem*) |
| 614 |
* Input: An address string, the associated MaskItem. |
| 615 |
* Output: None |
| 616 |
* Side effects: Deletes an address record. Frees the MaskItem if there |
| 617 |
* is nothing referencing it, sets it as illegal otherwise. |
| 618 |
*/ |
| 619 |
void |
| 620 |
delete_one_address_conf(const char *address, struct MaskItem *conf) |
| 621 |
{ |
| 622 |
int bits = 0; |
| 623 |
uint32_t hv = 0; |
| 624 |
dlink_node *node; |
| 625 |
struct irc_ssaddr addr; |
| 626 |
|
| 627 |
switch (parse_netmask(address, &addr, &bits)) |
| 628 |
{ |
| 629 |
case HM_IPV4: |
| 630 |
/* We have to do this, since we do not re-hash for every bit -A1kmm. */ |
| 631 |
bits -= bits % 8; |
| 632 |
hv = hash_ipv4(&addr, bits); |
| 633 |
break; |
| 634 |
case HM_IPV6: |
| 635 |
/* We have to do this, since we do not re-hash for every bit -A1kmm. */ |
| 636 |
bits -= bits % 16; |
| 637 |
hv = hash_ipv6(&addr, bits); |
| 638 |
break; |
| 639 |
default: /* HM_HOST */ |
| 640 |
hv = get_mask_hash(address); |
| 641 |
break; |
| 642 |
} |
| 643 |
|
| 644 |
DLINK_FOREACH(node, atable[hv].head) |
| 645 |
{ |
| 646 |
struct AddressRec *arec = node->data; |
| 647 |
|
| 648 |
if (arec->conf == conf) |
| 649 |
{ |
| 650 |
dlinkDelete(&arec->node, &atable[hv]); |
| 651 |
|
| 652 |
if (conf->ref_count == 0) |
| 653 |
conf_free(conf); |
| 654 |
|
| 655 |
xfree(arec); |
| 656 |
return; |
| 657 |
} |
| 658 |
} |
| 659 |
} |
| 660 |
|
| 661 |
/* void clear_out_address_conf(void) |
| 662 |
* Input: None |
| 663 |
* Output: None |
| 664 |
* Side effects: Clears out all address records in the hash table, |
| 665 |
* frees them, and frees the MaskItems if nothing references |
| 666 |
* them, otherwise sets them as illegal. |
| 667 |
*/ |
| 668 |
void |
| 669 |
clear_out_address_conf(void) |
| 670 |
{ |
| 671 |
dlink_node *node, *node_next; |
| 672 |
|
| 673 |
for (unsigned int i = 0; i < ATABLE_SIZE; ++i) |
| 674 |
{ |
| 675 |
DLINK_FOREACH_SAFE(node, node_next, atable[i].head) |
| 676 |
{ |
| 677 |
struct AddressRec *arec = node->data; |
| 678 |
|
| 679 |
/* |
| 680 |
* Destroy the ircd.conf items and keep those that are in the databases |
| 681 |
*/ |
| 682 |
if (IsConfDatabase(arec->conf)) |
| 683 |
continue; |
| 684 |
|
| 685 |
dlinkDelete(&arec->node, &atable[i]); |
| 686 |
arec->conf->active = 0; |
| 687 |
|
| 688 |
if (arec->conf->ref_count == 0) |
| 689 |
conf_free(arec->conf); |
| 690 |
xfree(arec); |
| 691 |
} |
| 692 |
} |
| 693 |
} |
| 694 |
|
| 695 |
static void |
| 696 |
hostmask_send_expiration(const struct AddressRec *const arec) |
| 697 |
{ |
| 698 |
char ban_type = '?'; |
| 699 |
|
| 700 |
if (ConfigGeneral.tkline_expire_notices == 0) |
| 701 |
return; |
| 702 |
|
| 703 |
switch (arec->type) |
| 704 |
{ |
| 705 |
case CONF_KLINE: |
| 706 |
ban_type = 'K'; |
| 707 |
break; |
| 708 |
case CONF_DLINE: |
| 709 |
ban_type = 'D'; |
| 710 |
break; |
| 711 |
default: break; |
| 712 |
} |
| 713 |
|
| 714 |
sendto_realops_flags(UMODE_SERVNOTICE, L_ALL, SEND_NOTICE, |
| 715 |
"Temporary %c-line for [%s@%s] expired", ban_type, |
| 716 |
(arec->conf->user) ? arec->conf->user : "*", |
| 717 |
(arec->conf->host) ? arec->conf->host : "*"); |
| 718 |
} |
| 719 |
|
| 720 |
void |
| 721 |
hostmask_expire_temporary(void) |
| 722 |
{ |
| 723 |
dlink_node *node, *node_next; |
| 724 |
|
| 725 |
for (unsigned int i = 0; i < ATABLE_SIZE; ++i) |
| 726 |
{ |
| 727 |
DLINK_FOREACH_SAFE(node, node_next, atable[i].head) |
| 728 |
{ |
| 729 |
struct AddressRec *arec = node->data; |
| 730 |
|
| 731 |
if (arec->conf->until == 0 || arec->conf->until > CurrentTime) |
| 732 |
continue; |
| 733 |
|
| 734 |
switch (arec->type) |
| 735 |
{ |
| 736 |
case CONF_KLINE: |
| 737 |
case CONF_DLINE: |
| 738 |
hostmask_send_expiration(arec); |
| 739 |
|
| 740 |
dlinkDelete(&arec->node, &atable[i]); |
| 741 |
conf_free(arec->conf); |
| 742 |
xfree(arec); |
| 743 |
break; |
| 744 |
default: break; |
| 745 |
} |
| 746 |
} |
| 747 |
} |
| 748 |
} |
