1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109
|
/*
* ircaux.c: some extra routines... not specific to irc... that I needed
*
* Written By Michael Sandrof
*
* Copyright (c) 1990, 1991 Michael Sandrof.
* Copyright (c) 1991, 1992 Troy Rollo.
* Copyright (c) 1992-2021 Matthew R. Green.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include "irc.h"
IRCII_RCSID("@(#)$eterna: ircaux.c,v 1.131 2021/03/14 18:22:31 mrg Exp $");
#ifdef HAVE_SYS_UN_H
#include <sys/un.h>
#endif /* HAVE_SYS_UN_H */
#include <pwd.h>
#include <assert.h>
#include "ircaux.h"
#include "output.h"
#include "ircterm.h"
#include "newio.h"
#include "server.h"
static int bind_local_addr(u_char *, int, int);
#ifdef DO_USER2
#define MASK_EXTRA sigaddset(&sigs, SIGUSR2);
#else
#define MASK_EXTRA /* nothing */
#endif /* DO_USER2 */
#define MASK_DECL sigset_t sigs, osigs;
#define MASK_BLOCK do \
{ \
sigemptyset(&sigs); \
sigaddset(&sigs, SIGUSR1); \
MASK_EXTRA \
sigprocmask(SIG_BLOCK, &sigs, &osigs); \
} while (0);
#define MASK_UNBLOCK sigprocmask(SIG_SETMASK, &osigs, NULL);
/*
* new_free: Why do this? Why not? Saves me a bit of trouble here and
* there
*/
void
new_free(void *iptr)
{
void **ptr = (void **) iptr;
MASK_DECL
/* cheap hack. */
if (*ptr == empty_string() || *ptr == zero() || *ptr == one())
*ptr = NULL;
else if (*ptr)
{
MASK_BLOCK
free(*ptr);
MASK_UNBLOCK
*ptr = NULL;
}
}
#define WAIT_BUFFER 2048
static u_char * wait_pointers[WAIT_BUFFER] = {0}, **current_wait_ptr = wait_pointers;
/*
* wait_new_free: same as new_free() except that free() is postponed.
*/
void
wait_new_free(u_char **ptr)
{
if (*current_wait_ptr)
new_free(current_wait_ptr);
*current_wait_ptr++ = *ptr;
if (current_wait_ptr >= wait_pointers + WAIT_BUFFER)
current_wait_ptr = wait_pointers;
*ptr = NULL;
}
/*
* really_free: really free the data if level == 0
*/
void
really_free(int level)
{
if (level != 0)
return;
for (current_wait_ptr = wait_pointers; current_wait_ptr < wait_pointers + WAIT_BUFFER; current_wait_ptr++)
if (*current_wait_ptr)
new_free(current_wait_ptr);
current_wait_ptr = wait_pointers;
}
void *
new_realloc(void *ptr, size_t size)
{
void *new_ptr;
MASK_DECL
MASK_BLOCK
if ((new_ptr = realloc(ptr, size)) == NULL)
{
fprintf(stderr, "realloc failed (%d): %s\nIrc Aborted!\n",
(int)size, strerror(errno));
exit(1);
}
MASK_UNBLOCK
return (new_ptr);
}
void *
new_malloc(size_t size)
{
void *ptr;
MASK_DECL
MASK_BLOCK
if ((ptr = malloc(size)) == NULL)
{
static char error[] = "Malloc failed: \nIrc Aborted!\n";
(void)write(2, error, my_strlen(error));
(void)write(2, strerror(errno), my_strlen(strerror(errno)));
term_reset();
exit(1);
}
MASK_UNBLOCK
return (ptr);
}
/*
* malloc_strcpy: Mallocs enough space for src to be copied in to where
* ptr points to.
*
* Never call this with ptr pointing to an uninitialised string, as the
* call to new_free() might crash the client... - phone, jan, 1993.
*/
void
malloc_strcpy(u_char **ptr, u_char *src)
{
malloc_strncpy(ptr, src, 0);
}
void
malloc_strncpy(u_char **ptr, u_char *src, size_t extra)
{
/* no point doing anything else */
if (src == *ptr)
return;
new_free(ptr);
/* cheap hack. */
if ((src == empty_string() || src == zero() || src == one()) && extra == 0)
*ptr = src;
else if (src)
{
*ptr = new_malloc(my_strlen(src) + 1 + extra);
my_strcpy(*ptr, src);
}
else
*ptr = NULL;
}
void
malloc_snprintf(u_char **ptr, const char *fmt, ...)
{
va_list ap, ap2;
int rv;
u_char *new;
char b;
if (fmt == NULL)
{
new_free(ptr);
return;
}
va_start(ap, fmt);
va_copy(ap2, ap);
rv = vsnprintf(&b, 0, fmt, ap);
va_end(ap);
new = new_malloc(rv + 1);
rv = vsnprintf(CP(new), rv+1, fmt, ap2);
va_end(ap2);
new_free(ptr);
*ptr = new;
}
void
malloc_vsnprintf(u_char **ptr, const char *fmt, va_list ap)
{
va_list ap2;
int rv;
u_char *new;
char b;
if (fmt == NULL)
{
new_free(ptr);
return;
}
va_copy(ap2, ap);
rv = vsnprintf(&b, 0, fmt, ap);
new = new_malloc(rv + 1);
rv = vsnprintf(CP(new), rv+1, fmt, ap2);
va_end(ap2);
new_free(ptr);
*ptr = new;
}
/* malloc_strcat: Yeah, right */
void
malloc_strcat(u_char **ptr, u_char *src)
{
malloc_strncat(ptr, src, 0);
}
/* malloc_strncat: Yeah, right */
void
malloc_strncat(u_char **ptr, u_char *src, size_t extra)
{
u_char *new = NULL;
if (*ptr)
{
new = new_malloc(my_strlen(*ptr) + my_strlen(src) + 1 + extra);
my_strcpy(new, *ptr);
my_strcat(new, src);
new_free(ptr);
*ptr = new;
}
else
malloc_strcpy(ptr, src);
}
void
malloc_strcat_ue(u_char **ptr, u_char *src)
{
u_char *new;
if (*ptr)
{
size_t len = my_strlen(*ptr) + my_strlen(src) + 1;
new = new_malloc(len);
my_strcpy(new, *ptr);
strmcat_ue(new, src, len);
new_free(ptr);
*ptr = new;
}
else
malloc_strcpy(ptr, src);
}
u_char *
upper(u_char *s)
{
u_char *t = NULL;
if (s)
for (t = s; *s; s++)
if (islower(*s))
*s = toupper(*s);
return (t);
}
u_char *
lower(u_char *s)
{
u_char *t = NULL;
if (s)
for (t = s; *s; s++)
if (isupper(*s))
*s = tolower(*s);
return t;
}
/*
* connect_by_number(): Performs a connecting to socket 'service' on host
* 'host'. Host can be a hostname or ip-address. If 'host' is null, the
* local host is assumed. The parameter full_hostname will, on return,
* contain the expanded hostname (if possible). Note that full_hostname is a
* pointer to a u_char *, and is allocated by connect_by_numbers()
*
* The following special values for service exist:
*
* 0 Create a socket for accepting connections
*
* -2 Connect to the address passed in place of the hostname parameter
*
* Errors:
*
* -1 get service failed
*
* -2 get host failed
*
* -3 socket call failed
*
* -4 connect call failed
*/
int
connect_by_number(int service, u_char *host, int nonblocking, struct addrinfo **oldres, struct addrinfo **oldres0)
{
int s = -1;
u_char buf[100];
int err = -1;
u_char strhost[NI_MAXHOST], strservice[NI_MAXSERV], *serv;
SOCKADDR_STORAGE *server;
struct addrinfo hints, *res, *res0;
u_char *cur_source_host = get_irchost();
int warned_bind = 0;
int saved_errno = -1;
if (service == -2)
{
server = (SOCKADDR_STORAGE *) host;
if (getnameinfo((struct sockaddr *)server,
SA_LEN((struct sockaddr *)server),
CP(strhost), sizeof(strhost),
CP(strservice), sizeof(strservice),
NI_NUMERICHOST|NI_NUMERICSERV))
return -1;
serv = strservice;
host = strhost;
}
else
{
snprintf(CP(strservice), sizeof strservice, "%d", service);
serv = strservice;
if (service > 0)
{
if (host == NULL)
{
gethostname(CP(buf), sizeof(buf));
host = buf;
}
}
}
if (oldres && *oldres && oldres0 && *oldres0)
{
res = *oldres;
res0 = *oldres0;
*oldres = 0;
*oldres0 = 0;
}
else
{
memset(&hints, 0, sizeof hints);
hints.ai_flags = 0;
hints.ai_protocol = 0;
hints.ai_addrlen = 0;
hints.ai_canonname = NULL;
hints.ai_addr = NULL;
hints.ai_next = NULL;
if (service == -1)
hints.ai_socktype = SOCK_DGRAM;
else
hints.ai_socktype = SOCK_STREAM;
hints.ai_family = AF_UNSPEC;
errno = 0;
err = getaddrinfo(CP(host), CP(serv), &hints, &res0);
if (err != 0)
return (-2);
res = res0;
}
for (; res; res = res->ai_next) {
err = 0;
if ((s = socket(res->ai_family, res->ai_socktype, res->ai_protocol)) < 0)
{
saved_errno = errno;
continue;
}
set_socket_options(s);
if (cur_source_host)
{
if (bind_local_addr(cur_source_host, s, res->ai_family) < 0)
{
saved_errno = errno;
if (warned_bind == 0)
{
say("Couldn't bind to IRCHOST");
warned_bind = 1;
cur_source_host = NULL;
}
}
else if (service <= 0 && service != -2 && listen(s, 1) == -1)
err = -4;
if (err)
goto again;
}
#ifdef NON_BLOCKING_CONNECTS
if (nonblocking && set_non_blocking(s) < 0)
{
err = -4;
goto again;
}
#endif /* NON_BLOCKING_CONNECTS */
err = connect(s, res->ai_addr, res->ai_addrlen);
if (err < 0)
{
if (!(errno == EINPROGRESS && nonblocking))
{
err = -4;
goto again;
}
/*
* if we're non blocking, and we got an EINPROGRESS
* save the res0 away so we can re-continue if this
* fails to connect.
*/
if (oldres && oldres0)
{
if (*oldres0)
freeaddrinfo(*oldres0);
*oldres = res->ai_next;
*oldres0 = res0;
res0 = 0;
}
err = 0;
}
again:
if (err == 0)
break;
new_close(s);
}
if (res0)
{
freeaddrinfo(res0);
res0 = 0;
}
if (err < 0) {
new_close(s);
return err;
}
if (s == -1 && saved_errno != -1)
errno = saved_errno;
return s;
}
/*
* Binds to specified socket, host, port using specified family.
* Returns:
* 0 if everythins is OK
* -2 if host wasn't found
* -10 if family type wasn't supported for specified host
*/
static int
bind_local_addr(u_char *localhost, int fd, int family)
{
u_char lbuf[NI_MAXHOST];
u_char *end;
u_char *localport = NULL;
struct addrinfo hintsx, *resx, *res0x;
int err = -1;
/* We often modify this */
my_strmcpy(lbuf, localhost, sizeof lbuf);
localhost = lbuf;
memset(&hintsx, 0, sizeof(hintsx));
hintsx.ai_family = family;
hintsx.ai_socktype = SOCK_STREAM;
hintsx.ai_flags = AI_PASSIVE;
/* Look for IPv6 */
if (*localhost == '[')
{
end = my_index(localhost + 1, ']');
if (end)
{
*end++ = '\0';
localhost++;
hintsx.ai_flags |= AI_NUMERICHOST;
}
}
else
end = my_index(localhost, ':');
/* find port if given */
if (end && end[0] == ':' && end[1])
{
end[0] = '\0';
localport = &end[1];
}
err = getaddrinfo(CP(localhost), CP(localport), &hintsx, &res0x);
if (err != 0)
{
# ifndef EAI_ADDRFAMILY
# ifdef EAI_FAMILY
# define EAI_ADDRFAMILY EAI_FAMILY
# else
# error "no EAI_ADDRFAMILY or EAI_FAMILY"
# endif
# endif
if (err == EAI_ADDRFAMILY)
return -10;
else
return -2;
}
err = -1;
for (resx = res0x; resx; resx = resx->ai_next)
{
if (bind(fd, resx->ai_addr, resx->ai_addrlen) == 0)
{
err = 0;
break;
}
}
freeaddrinfo(res0x);
if (err < 0)
return -2;
return 0;
}
u_char *
next_arg(u_char *str, u_char **new_ptr)
{
u_char *ptr;
if ((ptr = sindex(str, UP("^ "))) != NULL)
{
if ((str = my_index(ptr, ' ')) != NULL)
*str++ = '\0';
else
str = empty_string();
}
else
str = empty_string();
if (new_ptr)
*new_ptr = str;
return ptr;
}
u_char *
new_next_arg(u_char *str, u_char **new_ptr)
{
u_char *ptr,
*start;
if ((ptr = sindex(str, UP("^ \t"))) != NULL)
{
if (*ptr == '"')
{
start = ++ptr;
while ((str = sindex(ptr, UP("\"\\"))) != NULL)
{
switch (*str)
{
case '"':
*str++ = '\0';
if (*str == ' ')
str++;
if (new_ptr)
*new_ptr = str;
return (start);
case '\\':
if (*(str + 1) == '"')
my_strcpy(str, str + 1);
ptr = str + 1;
}
}
str = empty_string();
}
else
{
if ((str = sindex(ptr, UP(" \t"))) != NULL)
*str++ = '\0';
else
str = empty_string();
}
}
else
str = empty_string();
if (new_ptr)
*new_ptr = str;
return ptr;
}
/* my_stricmp: case insensitive version of strcmp */
int
my_stricmp(const u_char *str1, const u_char *str2)
{
int xor;
if (!str1)
return -1;
if (!str2)
return 1;
for (; *str1 || *str2 ; str1++, str2++)
{
if (!*str1 || !*str2)
return (*str1 - *str2);
if (isalpha(*str1) && isalpha(*str2))
{
xor = *str1 ^ *str2;
if (xor != 32 && xor != 0)
return (*str1 - *str2);
}
else
{
if (*str1 != *str2)
return (*str1 - *str2);
}
}
return 0;
}
/* my_strnicmp: case insensitive version of strncmp */
int
my_strnicmp(const u_char *str1, const u_char *str2, size_t n)
{
size_t i;
int xor;
for (i = 0; i < n; i++, str1++, str2++)
{
if (isalpha(*str1) && isalpha(*str2))
{
xor = *str1 ^ *str2;
if (xor != 32 && xor != 0)
return (*str1 - *str2);
}
else
{
if (*str1 != *str2)
return (*str1 - *str2);
}
}
return 0;
}
/*
* strmcpy: Well, it's like this, strncpy doesn't append a trailing nul if
* strlen(str) == maxlen. strmcpy always makes sure there is a trailing nul
*/
void
strmcpy(u_char *dest, u_char *src, size_t maxlen)
{
my_strncpy(dest, src, maxlen);
dest[maxlen-1] = '\0';
}
/*
* strmcat: like strcat, but truncs the dest string to maxlen
*/
void
strmcat(u_char *dest, u_char *src, size_t maxlen)
{
ssize_t len = maxlen;
while (len > 0 && *dest)
len--, dest++; /* we've already used up some of maxlen */
while (len-- > 0 && (*dest++ = *src++))
if (len == 0)
*(dest-1) = '\0';
}
/*
* strmcat_ue: like strcat but unescape backslashes, and truncs the dest string
* to maxlen
*/
void
strmcat_ue(u_char *dest, u_char *src, size_t maxlen)
{
ssize_t len = maxlen;
u_char c;
while (len > 0 && *dest)
len--, dest++; /* we've already used up some of maxlen */
while (len-- > 0 && (c = *dest++ = *src++))
{
if (c == '\\')
{
switch (*src)
{
case '\0':
break;
case 'n':
case 'p':
case 'r':
case '0':
*(dest-1) = '\020';
break;
case '\\':
src++;
break;
default:
*(dest-1) = *src++;
break;
}
}
if (len == 0)
*(dest-1) = '\0';
}
}
/* expand_twiddle: expands ~ in pathnames. return is malloc()ed. */
u_char *
expand_twiddle(u_char *str)
{
u_char *ptr = NULL;
if (*str == '~')
{
str++;
if (*str == '/' || *str == '\0')
{
malloc_snprintf(&ptr, "%s%s",
my_path(), str);
}
else
{
u_char *rest;
struct passwd *entry;
if ((rest = my_index(str, '/')) != NULL)
*rest++ = '\0';
if ((entry = getpwnam(CP(str))) != NULL)
{
malloc_snprintf(&ptr,
"%s%s%s",
entry->pw_dir,
rest ? "/" : "",
rest ? CP(rest) : "");
}
else
malloc_strcpy(&ptr, --str);
}
}
else
malloc_strcpy(&ptr, str);
return (ptr);
}
/*
* sindex: much like strchr(), but it looks for a match of any character in
* the group, and returns that position. If the first character is a ^, then
* this will match the first occurence not in that group.
*/
u_char *
sindex(u_char *string, u_char *group)
{
u_char *ptr;
if (!string || !group)
return NULL;
if (*group == '^')
{
group++;
for (; *string; string++)
{
for (ptr = group; *ptr; ptr++)
{
if (*ptr == *string)
break;
}
if (*ptr == '\0')
return string;
}
}
else
{
for (; *string; string++)
{
for (ptr = group; *ptr; ptr++)
{
if (*ptr == *string)
return string;
}
}
}
return NULL;
}
/*
* srindex: much like strrchr(), but it looks for a match of any character in
* the group, and returns that position. If the first character is a ^, then
* this will match the first occurence not in that group.
*/
u_char *
srindex(u_char *string, u_char *group)
{
u_char *ptr, *str;
if (!string || !group)
return NULL;
str = string + my_strlen(string);
if (*group == '^')
{
group++;
for (; str != (string-1); str--)
{
for (ptr = group; *ptr; ptr++)
{
if (*ptr == *str)
break;
}
if (*ptr == '\0')
return str;
}
}
else
{
for (; str != (string-1); str--)
{
for (ptr = group; *ptr; ptr++)
{
if (*ptr == *str)
return str;
}
}
}
return NULL;
}
/* my_strcpy(): overlapping safe strcpy() */
u_char *
my_strcpy(u_char *dst, const u_char *src)
{
u_char *ret = dst;
for (; (*dst = *src) != '\0'; ++dst, ++src)
/* empty */;
return ret;
}
/* my_strncpy(): overlapping safe strncpy() */
u_char *
my_strncpy(u_char *dst, const u_char *src, size_t len)
{
u_char *ret = dst;
for (; len > 0; len--)
{
*dst++ = *src;
if (*src != '\0')
src++;
}
return ret;
}
/* is_number: returns true if the given string is a number, false otherwise */
int
is_number(u_char *str)
{
while (*str == ' ')
str++;
if (*str == '-')
str++;
if (*str)
{
for (; *str; str++)
{
if (!isdigit((*str)))
return (0);
}
return 1;
}
else
return 0;
}
/* rfgets: exactly like fgets, cept it works backwards through a file! */
char *
rfgets(char *lbuf, int size, FILE *file)
{
char *ptr;
off_t pos;
if (fseek(file, -2L, 1))
return NULL;
do
{
switch (fgetc(file))
{
case EOF:
return NULL;
case '\n':
pos = ftell(file);
ptr = fgets(lbuf, size, file);
fseek(file, (long)pos, 0);
return ptr;
}
}
while (fseek(file, -2L, 1) == 0);
rewind(file);
pos = 0L;
ptr = fgets(lbuf, size, file);
fseek(file, (long)pos, 0);
return ptr;
}
/*
* path_search: given a file called name, this will search each element of
* the given path to locate the file. If found in an element of path, the
* full path name of the file is returned in a static string. If not, null
* is returned. Path is a colon separated list of directories. Return
* value is malloc()ed.
*/
u_char *
path_search(u_char *name, u_char *path)
{
u_char *tpath;
u_char *ptr,
*free_path = NULL;
u_char *buf = NULL;
malloc_strcpy(&free_path, path);
path = free_path;
while (path)
{
if ((ptr = my_index(path, ':')) != NULL)
*(ptr++) = '\0';
if (path[0] == '~')
{
tpath = my_path();
path++;
}
else
tpath = empty_string();
malloc_snprintf(&buf, "%s%s/%s", tpath, path, name);
if (access(CP(buf), F_OK) == 0)
break;
new_free(&buf);
path = ptr;
}
new_free(&free_path);
return buf;
}
/*
* double_quote_work: backend for double_quote(). if dst is NULL, then
* it simply counts. if dst is non-NULL, it writes to it. Returns the
* total length wanted including the trailing nul. may exceed dstlen,
* but shouldn't with proper calling sequence.)
*/
static size_t
double_quote_work(u_char *str, u_char *stuff, u_char *dst, size_t dstlen)
{
u_char c;
size_t pos;
for (pos = 0; (c = *str); str++)
{
if (stuff && my_index(stuff, c))
{
if (dst && pos < dstlen)
{
if (c == '$')
dst[pos] = '$';
else
dst[pos] = '\\';
}
pos++;
}
if (dst && pos < dstlen)
dst[pos] = c;
pos++;
}
if (dst && pos < dstlen)
dst[pos] = '\0';
return pos + 1;
}
/*
* double_quote: Given a str of text, this will quote any character in the
* set stuff with the QUOTE_CHAR. It returns a malloced quoted, null
* terminated string.
*/
u_char *
double_quote(u_char *str, u_char *stuff)
{
u_char *dst;
size_t len, len2;
len = double_quote_work(str, stuff, NULL, 0);
if (len == 1)
return empty_string();
assert(len != 0);
dst = new_malloc(len);
len2 = double_quote_work(str, stuff, dst, len);
if (len != len2)
yell("--- double_quote() error: len %zu len2 %zu", len, len2);
return dst;
}
#ifdef ZCAT
/* Here another interesting stuff:
* it handle zcat of compressed files
* You can manage compressed files in this way:
*
* IN: u_char *name, the compressed file FILENAME
* OUT: a FILE *, from which read the expanded file
*
*/
FILE *
zcat(u_char *name)
{
FILE *fp;
int in[2];
in[0] = -1;
in[1] = -1;
if (pipe(in))
{
say("Unable to start decompression process: %s", strerror(errno));
if(in[0] != -1)
{
new_close(in[0]);
new_close(in[1]);
}
return(NULL);
}
switch(fork())
{
case -1:
say("Unable to start decompression process: %s", strerror(errno));
return(NULL);
case 0:
(void) MY_SIGNAL(SIGINT, (sigfunc *) SIG_IGN, 0);
dup2(in[1], 1);
new_close(in[0]);
(void)setuid(getuid());
(void)setgid(getgid());
#ifdef ZARGS
execlp(ZCAT, ZCAT, ZARGS, name, NULL);
#else
execlp(ZCAT, ZCAT, name, NULL);
#endif /* ZARGS */
exit(0);
default:
new_close(in[1]);
if ((fp = fdopen(in[0], "r")) == NULL)
{
say("Cannot open pipe file descriptor: %s", strerror(errno));
return(NULL);
}
break;
}
return(fp);
}
#endif /* ZCAT */
#ifdef NON_BLOCKING_CONNECTS
int
set_non_blocking(int fd)
{
int res;
if ((res = fcntl(fd, F_GETFL, 0)) == -1)
return -1;
else if (fcntl(fd, F_SETFL, res | O_NONBLOCK) == -1)
return -1;
return 0;
}
int
set_blocking(int fd)
{
int res;
if ((res = fcntl(fd, F_GETFL, 0)) == -1)
return -1;
else if (fcntl(fd, F_SETFL, res & ~O_NONBLOCK) == -1)
return -1;
return 0;
}
#endif /* NON_BLOCKING_CONNECTS */
|