| 1 |
/* |
| 2 |
* ircd-hybrid: an advanced Internet Relay Chat Daemon(ircd). |
| 3 |
* irc_string.c: IRC string functions. |
| 4 |
* |
| 5 |
* Copyright (C) 2002 by the past and present ircd coders, and others. |
| 6 |
* |
| 7 |
* This program is free software; you can redistribute it and/or modify |
| 8 |
* it under the terms of the GNU General Public License as published by |
| 9 |
* the Free Software Foundation; either version 2 of the License, or |
| 10 |
* (at your option) any later version. |
| 11 |
* |
| 12 |
* This program is distributed in the hope that it will be useful, |
| 13 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 14 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 15 |
* GNU General Public License for more details. |
| 16 |
* |
| 17 |
* You should have received a copy of the GNU General Public License |
| 18 |
* along with this program; if not, write to the Free Software |
| 19 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 |
| 20 |
* USA |
| 21 |
* |
| 22 |
* $Id$ |
| 23 |
*/ |
| 24 |
|
| 25 |
#include "config.h" |
| 26 |
#ifdef HAVE_LIBPCRE |
| 27 |
#include <pcre.h> |
| 28 |
#endif |
| 29 |
|
| 30 |
#include "stdinc.h" |
| 31 |
#include "tools.h" |
| 32 |
#include "irc_string.h" |
| 33 |
#include "sprintf_irc.h" |
| 34 |
#include "client.h" |
| 35 |
#include "list.h" |
| 36 |
#include "memory.h" |
| 37 |
|
| 38 |
#ifndef INADDRSZ |
| 39 |
#define INADDRSZ 4 |
| 40 |
#endif |
| 41 |
|
| 42 |
#ifndef IN6ADDRSZ |
| 43 |
#define IN6ADDRSZ 16 |
| 44 |
#endif |
| 45 |
|
| 46 |
#ifndef INT16SZ |
| 47 |
#define INT16SZ 2 |
| 48 |
#endif |
| 49 |
|
| 50 |
|
| 51 |
/* |
| 52 |
* myctime - This is like standard ctime()-function, but it zaps away |
| 53 |
* the newline from the end of that string. Also, it takes |
| 54 |
* the time value as parameter, instead of pointer to it. |
| 55 |
* Note that it is necessary to copy the string to alternate |
| 56 |
* buffer (who knows how ctime() implements it, maybe it statically |
| 57 |
* has newline there and never 'refreshes' it -- zapping that |
| 58 |
* might break things in other places...) |
| 59 |
* |
| 60 |
* |
| 61 |
* Thu Nov 24 18:22:48 1986 |
| 62 |
*/ |
| 63 |
const char * |
| 64 |
myctime(time_t value) |
| 65 |
{ |
| 66 |
static char buf[32]; |
| 67 |
char *p; |
| 68 |
|
| 69 |
strcpy(buf, ctime(&value)); |
| 70 |
|
| 71 |
if ((p = strchr(buf, '\n')) != NULL) |
| 72 |
*p = '\0'; |
| 73 |
return buf; |
| 74 |
} |
| 75 |
|
| 76 |
/* |
| 77 |
* clean_string - clean up a string possibly containing garbage |
| 78 |
* |
| 79 |
* *sigh* Before the kiddies find this new and exciting way of |
| 80 |
* annoying opers, lets clean up what is sent to local opers |
| 81 |
* -Dianora |
| 82 |
*/ |
| 83 |
char * |
| 84 |
clean_string(char* dest, const unsigned char* src, size_t len) |
| 85 |
{ |
| 86 |
char* d = dest; |
| 87 |
assert(0 != dest); |
| 88 |
assert(0 != src); |
| 89 |
|
| 90 |
if(dest == NULL || src == NULL) |
| 91 |
return NULL; |
| 92 |
|
| 93 |
len -= 3; /* allow for worst case, '^A\0' */ |
| 94 |
|
| 95 |
while (*src && (len > 0)) |
| 96 |
{ |
| 97 |
if (*src & 0x80) /* if high bit is set */ |
| 98 |
{ |
| 99 |
*d++ = '.'; |
| 100 |
--len; |
| 101 |
} |
| 102 |
else if (!IsPrint(*src)) /* if NOT printable */ |
| 103 |
{ |
| 104 |
*d++ = '^'; |
| 105 |
--len; |
| 106 |
*d++ = 0x40 + *src; /* turn it into a printable */ |
| 107 |
} |
| 108 |
else |
| 109 |
*d++ = *src; |
| 110 |
++src, --len; |
| 111 |
} |
| 112 |
*d = '\0'; |
| 113 |
return dest; |
| 114 |
} |
| 115 |
|
| 116 |
/* |
| 117 |
* strip_tabs(dst, src, length) |
| 118 |
* |
| 119 |
* Copies src to dst, while converting all \t (tabs) into spaces. |
| 120 |
*/ |
| 121 |
void |
| 122 |
strip_tabs(char *dest, const char *src, size_t len) |
| 123 |
{ |
| 124 |
char *d = dest; |
| 125 |
|
| 126 |
/* Sanity check; we don't want anything nasty... */ |
| 127 |
assert(dest != NULL); |
| 128 |
assert(src != NULL); |
| 129 |
assert(len > 0); |
| 130 |
|
| 131 |
for (; --len && *src; ++src) |
| 132 |
*d++ = *src == '\t' ? ' ' : *src; |
| 133 |
|
| 134 |
*d = '\0'; /* NUL terminate, thanks and goodbye */ |
| 135 |
} |
| 136 |
|
| 137 |
/* |
| 138 |
* strtoken - walk through a string of tokens, using a set of separators |
| 139 |
* argv 9/90 |
| 140 |
* |
| 141 |
*/ |
| 142 |
#ifndef HAVE_STRTOK_R |
| 143 |
|
| 144 |
char * |
| 145 |
strtoken(char** save, char* str, const char* fs) |
| 146 |
{ |
| 147 |
char* pos = *save; /* keep last position across calls */ |
| 148 |
char* tmp; |
| 149 |
|
| 150 |
if (str) |
| 151 |
pos = str; /* new string scan */ |
| 152 |
|
| 153 |
while (pos && *pos && strchr(fs, *pos) != NULL) |
| 154 |
++pos; /* skip leading separators */ |
| 155 |
|
| 156 |
if (!pos || !*pos) |
| 157 |
return (pos = *save = NULL); /* string contains only sep's */ |
| 158 |
|
| 159 |
tmp = pos; /* now, keep position of the token */ |
| 160 |
|
| 161 |
while (*pos && strchr(fs, *pos) == NULL) |
| 162 |
++pos; /* skip content of the token */ |
| 163 |
|
| 164 |
if (*pos) |
| 165 |
*pos++ = '\0'; /* remove first sep after the token */ |
| 166 |
else |
| 167 |
pos = NULL; /* end of string */ |
| 168 |
|
| 169 |
*save = pos; |
| 170 |
return tmp; |
| 171 |
} |
| 172 |
|
| 173 |
#endif /* !HAVE_STRTOK_R */ |
| 174 |
|
| 175 |
/* |
| 176 |
* From: Thomas Helvey <tomh@inxpress.net> |
| 177 |
*/ |
| 178 |
static const char *IpQuadTab[] = |
| 179 |
{ |
| 180 |
"0", "1", "2", "3", "4", "5", "6", "7", "8", "9", |
| 181 |
"10", "11", "12", "13", "14", "15", "16", "17", "18", "19", |
| 182 |
"20", "21", "22", "23", "24", "25", "26", "27", "28", "29", |
| 183 |
"30", "31", "32", "33", "34", "35", "36", "37", "38", "39", |
| 184 |
"40", "41", "42", "43", "44", "45", "46", "47", "48", "49", |
| 185 |
"50", "51", "52", "53", "54", "55", "56", "57", "58", "59", |
| 186 |
"60", "61", "62", "63", "64", "65", "66", "67", "68", "69", |
| 187 |
"70", "71", "72", "73", "74", "75", "76", "77", "78", "79", |
| 188 |
"80", "81", "82", "83", "84", "85", "86", "87", "88", "89", |
| 189 |
"90", "91", "92", "93", "94", "95", "96", "97", "98", "99", |
| 190 |
"100", "101", "102", "103", "104", "105", "106", "107", "108", "109", |
| 191 |
"110", "111", "112", "113", "114", "115", "116", "117", "118", "119", |
| 192 |
"120", "121", "122", "123", "124", "125", "126", "127", "128", "129", |
| 193 |
"130", "131", "132", "133", "134", "135", "136", "137", "138", "139", |
| 194 |
"140", "141", "142", "143", "144", "145", "146", "147", "148", "149", |
| 195 |
"150", "151", "152", "153", "154", "155", "156", "157", "158", "159", |
| 196 |
"160", "161", "162", "163", "164", "165", "166", "167", "168", "169", |
| 197 |
"170", "171", "172", "173", "174", "175", "176", "177", "178", "179", |
| 198 |
"180", "181", "182", "183", "184", "185", "186", "187", "188", "189", |
| 199 |
"190", "191", "192", "193", "194", "195", "196", "197", "198", "199", |
| 200 |
"200", "201", "202", "203", "204", "205", "206", "207", "208", "209", |
| 201 |
"210", "211", "212", "213", "214", "215", "216", "217", "218", "219", |
| 202 |
"220", "221", "222", "223", "224", "225", "226", "227", "228", "229", |
| 203 |
"230", "231", "232", "233", "234", "235", "236", "237", "238", "239", |
| 204 |
"240", "241", "242", "243", "244", "245", "246", "247", "248", "249", |
| 205 |
"250", "251", "252", "253", "254", "255" |
| 206 |
}; |
| 207 |
|
| 208 |
/* |
| 209 |
* inetntoa - in_addr to string |
| 210 |
* changed name to remove collision possibility and |
| 211 |
* so behaviour is guaranteed to take a pointer arg. |
| 212 |
* -avalon 23/11/92 |
| 213 |
* inet_ntoa -- returned the dotted notation of a given |
| 214 |
* internet number |
| 215 |
* argv 11/90). |
| 216 |
* inet_ntoa -- its broken on some Ultrix/Dynix too. -avalon |
| 217 |
*/ |
| 218 |
const char * |
| 219 |
inetntoa(const char *in) |
| 220 |
{ |
| 221 |
static char buf[16]; |
| 222 |
char *bufptr = buf; |
| 223 |
const unsigned char *a = (const unsigned char *)in; |
| 224 |
const char *n; |
| 225 |
|
| 226 |
n = IpQuadTab[ *a++ ]; |
| 227 |
while (*n) |
| 228 |
*bufptr++ = *n++; |
| 229 |
*bufptr++ = '.'; |
| 230 |
n = IpQuadTab[ *a++ ]; |
| 231 |
while (*n) |
| 232 |
*bufptr++ = *n++; |
| 233 |
*bufptr++ = '.'; |
| 234 |
n = IpQuadTab[ *a++ ]; |
| 235 |
while (*n) |
| 236 |
*bufptr++ = *n++; |
| 237 |
*bufptr++ = '.'; |
| 238 |
n = IpQuadTab[ *a ]; |
| 239 |
while (*n) |
| 240 |
*bufptr++ = *n++; |
| 241 |
*bufptr = '\0'; |
| 242 |
return buf; |
| 243 |
} |
| 244 |
|
| 245 |
/* libio_basename() |
| 246 |
* |
| 247 |
* input - i.e. "/usr/local/ircd/modules/m_whois.so" |
| 248 |
* output - i.e. "m_whois.so" |
| 249 |
* side effects - this will be overwritten on subsequent calls |
| 250 |
*/ |
| 251 |
const char * |
| 252 |
libio_basename(const char *path) |
| 253 |
{ |
| 254 |
const char *s; |
| 255 |
|
| 256 |
if ((s = strrchr(path, '/')) == NULL) |
| 257 |
s = path; |
| 258 |
else |
| 259 |
s++; |
| 260 |
|
| 261 |
return s; |
| 262 |
} |
| 263 |
|
| 264 |
/* |
| 265 |
* Copyright (c) 1996-1999 by Internet Software Consortium. |
| 266 |
* |
| 267 |
* Permission to use, copy, modify, and distribute this software for any |
| 268 |
* purpose with or without fee is hereby granted, provided that the above |
| 269 |
* copyright notice and this permission notice appear in all copies. |
| 270 |
* |
| 271 |
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS |
| 272 |
* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES |
| 273 |
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE |
| 274 |
* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL |
| 275 |
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR |
| 276 |
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS |
| 277 |
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS |
| 278 |
* SOFTWARE. |
| 279 |
*/ |
| 280 |
|
| 281 |
#define SPRINTF(x) ((size_t)ircsprintf x) |
| 282 |
|
| 283 |
/* |
| 284 |
* WARNING: Don't even consider trying to compile this on a system where |
| 285 |
* sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX. |
| 286 |
*/ |
| 287 |
|
| 288 |
static const char *inet_ntop4(const unsigned char *src, char *dst, unsigned int size); |
| 289 |
#ifdef IPV6 |
| 290 |
static const char *inet_ntop6(const unsigned char *src, char *dst, unsigned int size); |
| 291 |
#endif |
| 292 |
|
| 293 |
/* const char * |
| 294 |
* inet_ntop4(src, dst, size) |
| 295 |
* format an IPv4 address |
| 296 |
* return: |
| 297 |
* `dst' (as a const) |
| 298 |
* notes: |
| 299 |
* (1) uses no statics |
| 300 |
* (2) takes a unsigned char* not an in_addr as input |
| 301 |
* author: |
| 302 |
* Paul Vixie, 1996. |
| 303 |
*/ |
| 304 |
static const char * |
| 305 |
inet_ntop4(const unsigned char *src, char *dst, unsigned int size) |
| 306 |
{ |
| 307 |
if (size < 16) |
| 308 |
return NULL; |
| 309 |
|
| 310 |
return strcpy(dst, inetntoa((const char *)src)); |
| 311 |
} |
| 312 |
|
| 313 |
/* const char * |
| 314 |
* inet_ntop6(src, dst, size) |
| 315 |
* convert IPv6 binary address into presentation (printable) format |
| 316 |
* author: |
| 317 |
* Paul Vixie, 1996. |
| 318 |
*/ |
| 319 |
#ifdef IPV6 |
| 320 |
static const char * |
| 321 |
inet_ntop6(const unsigned char *src, char *dst, unsigned int size) |
| 322 |
{ |
| 323 |
/* |
| 324 |
* Note that int32_t and int16_t need only be "at least" large enough |
| 325 |
* to contain a value of the specified size. On some systems, like |
| 326 |
* Crays, there is no such thing as an integer variable with 16 bits. |
| 327 |
* Keep this in mind if you think this function should have been coded |
| 328 |
* to use pointer overlays. All the world's not a VAX. |
| 329 |
*/ |
| 330 |
char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"], *tp; |
| 331 |
struct { int base, len; } best = {0,0}, cur = {0,0}; |
| 332 |
unsigned int words[IN6ADDRSZ / INT16SZ]; |
| 333 |
int i; |
| 334 |
|
| 335 |
/* |
| 336 |
* Preprocess: |
| 337 |
* Copy the input (bytewise) array into a wordwise array. |
| 338 |
* Find the longest run of 0x00's in src[] for :: shorthanding. |
| 339 |
*/ |
| 340 |
memset(words, '\0', sizeof words); |
| 341 |
for (i = 0; i < IN6ADDRSZ; i += 2) |
| 342 |
words[i / 2] = (src[i] << 8) | src[i + 1]; |
| 343 |
best.base = -1; |
| 344 |
cur.base = -1; |
| 345 |
for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++) { |
| 346 |
if (words[i] == 0) { |
| 347 |
if (cur.base == -1) |
| 348 |
cur.base = i, cur.len = 1; |
| 349 |
else |
| 350 |
cur.len++; |
| 351 |
} else { |
| 352 |
if (cur.base != -1) { |
| 353 |
if (best.base == -1 || cur.len > best.len) |
| 354 |
best = cur; |
| 355 |
cur.base = -1; |
| 356 |
} |
| 357 |
} |
| 358 |
} |
| 359 |
if (cur.base != -1) { |
| 360 |
if (best.base == -1 || cur.len > best.len) |
| 361 |
best = cur; |
| 362 |
} |
| 363 |
if (best.base != -1 && best.len < 2) |
| 364 |
best.base = -1; |
| 365 |
|
| 366 |
/* |
| 367 |
* Format the result. |
| 368 |
*/ |
| 369 |
tp = tmp; |
| 370 |
for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++) { |
| 371 |
/* Are we inside the best run of 0x00's? */ |
| 372 |
if (best.base != -1 && i >= best.base && |
| 373 |
i < (best.base + best.len)) { |
| 374 |
if (i == best.base) |
| 375 |
*tp++ = ':'; |
| 376 |
continue; |
| 377 |
} |
| 378 |
/* Are we following an initial run of 0x00s or any real hex? */ |
| 379 |
if (i != 0) |
| 380 |
*tp++ = ':'; |
| 381 |
/* Is this address an encapsulated IPv4? */ |
| 382 |
if (i == 6 && best.base == 0 && |
| 383 |
(best.len == 6 || (best.len == 5 && words[5] == 0xffff))) { |
| 384 |
if (!inet_ntop4(src+12, tp, sizeof tmp - (tp - tmp))) |
| 385 |
return (NULL); |
| 386 |
tp += strlen(tp); |
| 387 |
break; |
| 388 |
} |
| 389 |
tp += SPRINTF((tp, "%x", words[i])); |
| 390 |
} |
| 391 |
/* Was it a trailing run of 0x00's? */ |
| 392 |
if (best.base != -1 && (best.base + best.len) == |
| 393 |
(IN6ADDRSZ / INT16SZ)) |
| 394 |
*tp++ = ':'; |
| 395 |
*tp++ = '\0'; |
| 396 |
|
| 397 |
/* |
| 398 |
* Check for overflow, copy, and we're done. |
| 399 |
*/ |
| 400 |
|
| 401 |
assert (tp - tmp >= 0); |
| 402 |
|
| 403 |
if ((unsigned int)(tp - tmp) > size) { |
| 404 |
return (NULL); |
| 405 |
} |
| 406 |
return strcpy(dst, tmp); |
| 407 |
} |
| 408 |
#endif |
| 409 |
|
| 410 |
/* char * |
| 411 |
* inetntop(af, src, dst, size) |
| 412 |
* convert a network format address to presentation format. |
| 413 |
* return: |
| 414 |
* pointer to presentation format address (`dst'), or NULL (see errno). |
| 415 |
* author: |
| 416 |
* Paul Vixie, 1996. |
| 417 |
*/ |
| 418 |
const char * |
| 419 |
inetntop(int af, const void *src, char *dst, unsigned int size) |
| 420 |
{ |
| 421 |
switch (af) |
| 422 |
{ |
| 423 |
case AF_INET: |
| 424 |
return inet_ntop4(src, dst, size); |
| 425 |
#ifdef IPV6 |
| 426 |
case AF_INET6: |
| 427 |
if (IN6_IS_ADDR_V4MAPPED((const struct in6_addr *)src) || |
| 428 |
IN6_IS_ADDR_V4COMPAT((const struct in6_addr *)src)) |
| 429 |
return inet_ntop4((unsigned char *)&((const struct in6_addr *)src)->s6_addr[12], dst, size); |
| 430 |
else |
| 431 |
return inet_ntop6(src, dst, size); |
| 432 |
#endif |
| 433 |
default: |
| 434 |
return NULL; |
| 435 |
} |
| 436 |
/* NOTREACHED */ |
| 437 |
} |
| 438 |
|
| 439 |
/* |
| 440 |
* strlcat and strlcpy were ripped from openssh 2.5.1p2 |
| 441 |
* They had the following Copyright info: |
| 442 |
* |
| 443 |
* |
| 444 |
* Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com> |
| 445 |
* All rights reserved. |
| 446 |
* |
| 447 |
* Redistribution and use in source and binary forms, with or without |
| 448 |
* modification, are permitted provided that the following conditions |
| 449 |
* are met: |
| 450 |
* 1. Redistributions of source code must retain the above copyright |
| 451 |
* notice, this list of conditions and the following disclaimer. |
| 452 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 453 |
* notice, this list of conditions and the following disclaimer in the |
| 454 |
* documentation and/or other materials provided with the distribution. |
| 455 |
* 3. The name of the author may not be used to endorse or promote products |
| 456 |
* derived from this software without specific prior written permission. |
| 457 |
* |
| 458 |
* THIS SOFTWARE IS PROVIDED `AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, |
| 459 |
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY |
| 460 |
* AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL |
| 461 |
* THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| 462 |
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| 463 |
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
| 464 |
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
| 465 |
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR |
| 466 |
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF |
| 467 |
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 468 |
*/ |
| 469 |
|
| 470 |
#ifndef HAVE_STRLCAT |
| 471 |
size_t |
| 472 |
strlcat(char *dst, const char *src, size_t siz) |
| 473 |
{ |
| 474 |
char *d = dst; |
| 475 |
const char *s = src; |
| 476 |
size_t n = siz, dlen; |
| 477 |
|
| 478 |
while (n-- != 0 && *d != '\0') |
| 479 |
d++; |
| 480 |
|
| 481 |
dlen = d - dst; |
| 482 |
n = siz - dlen; |
| 483 |
|
| 484 |
if (n == 0) |
| 485 |
return(dlen + strlen(s)); |
| 486 |
|
| 487 |
while (*s != '\0') |
| 488 |
{ |
| 489 |
if (n != 1) |
| 490 |
{ |
| 491 |
*d++ = *s; |
| 492 |
n--; |
| 493 |
} |
| 494 |
|
| 495 |
s++; |
| 496 |
} |
| 497 |
|
| 498 |
*d = '\0'; |
| 499 |
return dlen + (s - src); /* count does not include NUL */ |
| 500 |
} |
| 501 |
#endif |
| 502 |
|
| 503 |
#ifndef HAVE_STRLCPY |
| 504 |
size_t |
| 505 |
strlcpy(char *dst, const char *src, size_t siz) |
| 506 |
{ |
| 507 |
char *d = dst; |
| 508 |
const char *s = src; |
| 509 |
size_t n = siz; |
| 510 |
|
| 511 |
/* Copy as many bytes as will fit */ |
| 512 |
if (n != 0 && --n != 0) |
| 513 |
{ |
| 514 |
do |
| 515 |
{ |
| 516 |
if ((*d++ = *s++) == 0) |
| 517 |
break; |
| 518 |
} while (--n != 0); |
| 519 |
} |
| 520 |
|
| 521 |
/* Not enough room in dst, add NUL and traverse rest of src */ |
| 522 |
if (n == 0) |
| 523 |
{ |
| 524 |
if (siz != 0) |
| 525 |
*d = '\0'; /* NUL-terminate dst */ |
| 526 |
while (*s++) |
| 527 |
; |
| 528 |
} |
| 529 |
|
| 530 |
return s - src - 1; /* count does not include NUL */ |
| 531 |
} |
| 532 |
#endif |
| 533 |
|
| 534 |
#ifdef HAVE_LIBPCRE |
| 535 |
void * |
| 536 |
ircd_pcre_compile(const char *pattern, const char **errptr) |
| 537 |
{ |
| 538 |
int erroroffset = 0; |
| 539 |
int options = PCRE_EXTRA; |
| 540 |
|
| 541 |
assert(pattern); |
| 542 |
|
| 543 |
return pcre_compile(pattern, options, errptr, &erroroffset, NULL); |
| 544 |
} |
| 545 |
|
| 546 |
int |
| 547 |
ircd_pcre_exec(const void *code, const char *subject) |
| 548 |
{ |
| 549 |
assert(code && subject); |
| 550 |
|
| 551 |
return pcre_exec(code, NULL, subject, strlen(subject), 0, 0, NULL, 0) < 0; |
| 552 |
} |
| 553 |
#endif |
