1 /* lib.c - various reusable stuff. 2 * 3 * Copyright 2006 Rob Landley <rob (at) landley.net> 4 */ 5 6 #include "toys.h" 7 8 void verror_msg(char *msg, int err, va_list va) 9 { 10 char *s = ": %s"; 11 12 fprintf(stderr, "%s: ", toys.which->name); 13 if (msg) vfprintf(stderr, msg, va); 14 else s+=2; 15 if (err) fprintf(stderr, s, strerror(err)); 16 if (msg || err) putc('\n', stderr); 17 if (!toys.exitval) toys.exitval++; 18 } 19 20 // These functions don't collapse together because of the va_stuff. 21 22 void error_msg(char *msg, ...) 23 { 24 va_list va; 25 26 va_start(va, msg); 27 verror_msg(msg, 0, va); 28 va_end(va); 29 } 30 31 void perror_msg(char *msg, ...) 32 { 33 va_list va; 34 35 va_start(va, msg); 36 verror_msg(msg, errno, va); 37 va_end(va); 38 } 39 40 // Die with an error message. 41 void error_exit(char *msg, ...) 42 { 43 va_list va; 44 45 va_start(va, msg); 46 verror_msg(msg, 0, va); 47 va_end(va); 48 49 xexit(); 50 } 51 52 // Die with an error message and strerror(errno) 53 void perror_exit(char *msg, ...) 54 { 55 va_list va; 56 57 va_start(va, msg); 58 verror_msg(msg, errno, va); 59 va_end(va); 60 61 xexit(); 62 } 63 64 // Exit with an error message after showing help text. 65 void help_exit(char *msg, ...) 66 { 67 va_list va; 68 69 if (CFG_TOYBOX_HELP) show_help(stderr); 70 71 if (msg) { 72 va_start(va, msg); 73 verror_msg(msg, 0, va); 74 va_end(va); 75 } 76 77 xexit(); 78 } 79 80 // If you want to explicitly disable the printf() behavior (because you're 81 // printing user-supplied data, or because android's static checker produces 82 // false positives for 'char *s = x ? "blah1" : "blah2"; printf(s);' and it's 83 // -Werror there for policy reasons). 84 void error_msg_raw(char *msg) 85 { 86 error_msg("%s", msg); 87 } 88 89 void perror_msg_raw(char *msg) 90 { 91 perror_msg("%s", msg); 92 } 93 94 void error_exit_raw(char *msg) 95 { 96 error_exit("%s", msg); 97 } 98 99 void perror_exit_raw(char *msg) 100 { 101 perror_exit("%s", msg); 102 } 103 104 // Keep reading until full or EOF 105 ssize_t readall(int fd, void *buf, size_t len) 106 { 107 size_t count = 0; 108 109 while (count<len) { 110 int i = read(fd, (char *)buf+count, len-count); 111 if (!i) break; 112 if (i<0) return i; 113 count += i; 114 } 115 116 return count; 117 } 118 119 // Keep writing until done or EOF 120 ssize_t writeall(int fd, void *buf, size_t len) 121 { 122 size_t count = 0; 123 while (count<len) { 124 int i = write(fd, count+(char *)buf, len-count); 125 if (i<1) return i; 126 count += i; 127 } 128 129 return count; 130 } 131 132 // skip this many bytes of input. Return 0 for success, >0 means this much 133 // left after input skipped. 134 off_t lskip(int fd, off_t offset) 135 { 136 off_t cur = lseek(fd, 0, SEEK_CUR); 137 138 if (cur != -1) { 139 off_t end = lseek(fd, 0, SEEK_END) - cur; 140 141 if (end > 0 && end < offset) return offset - end; 142 end = offset+cur; 143 if (end == lseek(fd, end, SEEK_SET)) return 0; 144 perror_exit("lseek"); 145 } 146 147 while (offset>0) { 148 int try = offset>sizeof(libbuf) ? sizeof(libbuf) : offset, or; 149 150 or = readall(fd, libbuf, try); 151 if (or < 0) perror_exit("lskip to %lld", (long long)offset); 152 else offset -= or; 153 if (or < try) break; 154 } 155 156 return offset; 157 } 158 159 // flags: 1=make last dir (with mode lastmode, otherwise skips last component) 160 // 2=make path (already exists is ok) 161 // 4=verbose 162 // returns 0 = path ok, 1 = error 163 int mkpathat(int atfd, char *dir, mode_t lastmode, int flags) 164 { 165 struct stat buf; 166 char *s; 167 168 // mkdir -p one/two/three is not an error if the path already exists, 169 // but is if "three" is a file. The others we dereference and catch 170 // not-a-directory along the way, but the last one we must explicitly 171 // test for. Might as well do it up front. 172 173 if (!fstatat(atfd, dir, &buf, 0) && !S_ISDIR(buf.st_mode)) { 174 errno = EEXIST; 175 return 1; 176 } 177 178 for (s = dir; ;s++) { 179 char save = 0; 180 mode_t mode = (0777&~toys.old_umask)|0300; 181 182 // find next '/', but don't try to mkdir "" at start of absolute path 183 if (*s == '/' && (flags&2) && s != dir) { 184 save = *s; 185 *s = 0; 186 } else if (*s) continue; 187 188 // Use the mode from the -m option only for the last directory. 189 if (!save) { 190 if (flags&1) mode = lastmode; 191 else break; 192 } 193 194 if (mkdirat(atfd, dir, mode)) { 195 if (!(flags&2) || errno != EEXIST) return 1; 196 } else if (flags&4) 197 fprintf(stderr, "%s: created directory '%s'\n", toys.which->name, dir); 198 199 if (!(*s = save)) break; 200 } 201 202 return 0; 203 } 204 205 // Split a path into linked list of components, tracking head and tail of list. 206 // Filters out // entries with no contents. 207 struct string_list **splitpath(char *path, struct string_list **list) 208 { 209 char *new = path; 210 211 *list = 0; 212 do { 213 int len; 214 215 if (*path && *path != '/') continue; 216 len = path-new; 217 if (len > 0) { 218 *list = xmalloc(sizeof(struct string_list) + len + 1); 219 (*list)->next = 0; 220 memcpy((*list)->str, new, len); 221 (*list)->str[len] = 0; 222 list = &(*list)->next; 223 } 224 new = path+1; 225 } while (*path++); 226 227 return list; 228 } 229 230 // Find all file in a colon-separated path with access type "type" (generally 231 // X_OK or R_OK). Returns a list of absolute paths to each file found, in 232 // order. 233 234 struct string_list *find_in_path(char *path, char *filename) 235 { 236 struct string_list *rlist = NULL, **prlist=&rlist; 237 char *cwd; 238 239 if (!path) return 0; 240 241 cwd = xgetcwd(); 242 for (;;) { 243 char *next = strchr(path, ':'); 244 int len = next ? next-path : strlen(path); 245 struct string_list *rnext; 246 struct stat st; 247 248 rnext = xmalloc(sizeof(void *) + strlen(filename) 249 + (len ? len : strlen(cwd)) + 2); 250 if (!len) sprintf(rnext->str, "%s/%s", cwd, filename); 251 else { 252 char *res = rnext->str; 253 254 memcpy(res, path, len); 255 res += len; 256 *(res++) = '/'; 257 strcpy(res, filename); 258 } 259 260 // Confirm it's not a directory. 261 if (!stat(rnext->str, &st) && S_ISREG(st.st_mode)) { 262 *prlist = rnext; 263 rnext->next = NULL; 264 prlist = &(rnext->next); 265 } else free(rnext); 266 267 if (!next) break; 268 path += len; 269 path++; 270 } 271 free(cwd); 272 273 return rlist; 274 } 275 276 long estrtol(char *str, char **end, int base) 277 { 278 errno = 0; 279 280 return strtol(str, end, base); 281 } 282 283 long xstrtol(char *str, char **end, int base) 284 { 285 long l = estrtol(str, end, base); 286 287 if (errno) perror_exit_raw(str); 288 289 return l; 290 } 291 292 // atol() with the kilo/mega/giga/tera/peta/exa extensions. 293 // (zetta and yotta don't fit in 64 bits.) 294 long atolx(char *numstr) 295 { 296 char *c, *suffixes="cbkmgtpe", *end; 297 long val; 298 299 val = xstrtol(numstr, &c, 0); 300 if (*c) { 301 if (c != numstr && (end = strchr(suffixes, tolower(*c)))) { 302 int shift = end-suffixes-2; 303 if (shift >= 0) val *= 1024L<<(shift*10); 304 } else { 305 while (isspace(*c)) c++; 306 if (*c) error_exit("not integer: %s", numstr); 307 } 308 } 309 310 return val; 311 } 312 313 long atolx_range(char *numstr, long low, long high) 314 { 315 long val = atolx(numstr); 316 317 if (val < low) error_exit("%ld < %ld", val, low); 318 if (val > high) error_exit("%ld > %ld", val, high); 319 320 return val; 321 } 322 323 int stridx(char *haystack, char needle) 324 { 325 char *off; 326 327 if (!needle) return -1; 328 off = strchr(haystack, needle); 329 if (!off) return -1; 330 331 return off-haystack; 332 } 333 334 char *strlower(char *s) 335 { 336 char *try, *new; 337 338 if (!CFG_TOYBOX_I18N) { 339 try = new = xstrdup(s); 340 for (; *s; s++) *(new++) = tolower(*s); 341 } else { 342 // I can't guarantee the string _won't_ expand during reencoding, so...? 343 try = new = xmalloc(strlen(s)*2+1); 344 345 while (*s) { 346 wchar_t c; 347 int len = mbrtowc(&c, s, MB_CUR_MAX, 0); 348 349 if (len < 1) *(new++) = *(s++); 350 else { 351 s += len; 352 // squash title case too 353 c = towlower(c); 354 355 // if we had a valid utf8 sequence, convert it to lower case, and can't 356 // encode back to utf8, something is wrong with your libc. But just 357 // in case somebody finds an exploit... 358 len = wcrtomb(new, c, 0); 359 if (len < 1) error_exit("bad utf8 %x", (int)c); 360 new += len; 361 } 362 } 363 *new = 0; 364 } 365 366 return try; 367 } 368 369 // strstr but returns pointer after match 370 char *strafter(char *haystack, char *needle) 371 { 372 char *s = strstr(haystack, needle); 373 374 return s ? s+strlen(needle) : s; 375 } 376 377 // Remove trailing \n 378 char *chomp(char *s) 379 { 380 char *p = strrchr(s, '\n'); 381 382 if (p && !p[1]) *p = 0; 383 return s; 384 } 385 386 int unescape(char c) 387 { 388 char *from = "\\abefnrtv", *to = "\\\a\b\033\f\n\r\t\v"; 389 int idx = stridx(from, c); 390 391 return (idx == -1) ? 0 : to[idx]; 392 } 393 394 // If *a starts with b, advance *a past it and return 1, else return 0; 395 int strstart(char **a, char *b) 396 { 397 int len = strlen(b), i = !strncmp(*a, b, len); 398 399 if (i) *a += len; 400 401 return i; 402 } 403 404 // Return how long the file at fd is, if there's any way to determine it. 405 off_t fdlength(int fd) 406 { 407 struct stat st; 408 off_t base = 0, range = 1, expand = 1, old; 409 410 if (!fstat(fd, &st) && S_ISREG(st.st_mode)) return st.st_size; 411 412 // If the ioctl works for this, return it. 413 // TODO: is blocksize still always 512, or do we stat for it? 414 // unsigned int size; 415 // if (ioctl(fd, BLKGETSIZE, &size) >= 0) return size*512L; 416 417 // If not, do a binary search for the last location we can read. (Some 418 // block devices don't do BLKGETSIZE right.) This should probably have 419 // a CONFIG option... 420 421 // If not, do a binary search for the last location we can read. 422 423 old = lseek(fd, 0, SEEK_CUR); 424 do { 425 char temp; 426 off_t pos = base + range / 2; 427 428 if (lseek(fd, pos, 0)>=0 && read(fd, &temp, 1)==1) { 429 off_t delta = (pos + 1) - base; 430 431 base += delta; 432 if (expand) range = (expand <<= 1) - base; 433 else range -= delta; 434 } else { 435 expand = 0; 436 range = pos - base; 437 } 438 } while (range > 0); 439 440 lseek(fd, old, SEEK_SET); 441 442 return base; 443 } 444 445 // Read contents of file as a single nul-terminated string. 446 // measure file size if !len, allocate buffer if !buf 447 // note: for existing buffers use len = size-1, will set buf[len] = 0 448 char *readfileat(int dirfd, char *name, char *ibuf, off_t *plen) 449 { 450 off_t len, rlen; 451 int fd; 452 char *buf, *rbuf; 453 454 // Unsafe to probe for size with a supplied buffer, don't ever do that. 455 if (CFG_TOYBOX_DEBUG && (ibuf ? !*plen : *plen)) error_exit("bad readfileat"); 456 457 if (-1 == (fd = openat(dirfd, name, O_RDONLY))) return 0; 458 459 // If we dunno the length, probe it. If we can't probe, start with 1 page. 460 if (!*plen) { 461 if ((len = fdlength(fd))>0) *plen = len; 462 else len = 4096; 463 } else len = *plen-1; 464 465 if (!ibuf) buf = xmalloc(len+1); 466 else buf = ibuf; 467 468 for (rbuf = buf;;) { 469 rlen = readall(fd, rbuf, len); 470 if (*plen || rlen<len) break; 471 472 // If reading unknown size, expand buffer by 1.5 each time we fill it up. 473 rlen += rbuf-buf; 474 buf = xrealloc(buf, len = (rlen*3)/2); 475 rbuf = buf+rlen; 476 len -= rlen; 477 } 478 *plen = len = rlen+(rbuf-buf); 479 close(fd); 480 481 if (rlen<0) { 482 if (ibuf != buf) free(buf); 483 buf = 0; 484 } else buf[len] = 0; 485 486 return buf; 487 } 488 489 char *readfile(char *name, char *ibuf, off_t len) 490 { 491 return readfileat(AT_FDCWD, name, ibuf, &len); 492 } 493 494 // Sleep for this many thousandths of a second 495 void msleep(long miliseconds) 496 { 497 struct timespec ts; 498 499 ts.tv_sec = miliseconds/1000; 500 ts.tv_nsec = (miliseconds%1000)*1000000; 501 nanosleep(&ts, &ts); 502 } 503 504 // Inefficient, but deals with unaligned access 505 int64_t peek_le(void *ptr, unsigned size) 506 { 507 int64_t ret = 0; 508 char *c = ptr; 509 int i; 510 511 for (i=0; i<size; i++) ret |= ((int64_t)c[i])<<(i*8); 512 return ret; 513 } 514 515 int64_t peek_be(void *ptr, unsigned size) 516 { 517 int64_t ret = 0; 518 char *c = ptr; 519 int i; 520 521 for (i=0; i<size; i++) ret = (ret<<8)|(c[i]&0xff); 522 return ret; 523 } 524 525 int64_t peek(void *ptr, unsigned size) 526 { 527 return IS_BIG_ENDIAN ? peek_be(ptr, size) : peek_le(ptr, size); 528 } 529 530 void poke(void *ptr, uint64_t val, int size) 531 { 532 if (size & 8) { 533 volatile uint64_t *p = (uint64_t *)ptr; 534 *p = val; 535 } else if (size & 4) { 536 volatile int *p = (int *)ptr; 537 *p = val; 538 } else if (size & 2) { 539 volatile short *p = (short *)ptr; 540 *p = val; 541 } else { 542 volatile char *p = (char *)ptr; 543 *p = val; 544 } 545 } 546 547 // Iterate through an array of files, opening each one and calling a function 548 // on that filehandle and name. The special filename "-" means stdin if 549 // flags is O_RDONLY, stdout otherwise. An empty argument list calls 550 // function() on just stdin/stdout. 551 // 552 // Note: pass O_CLOEXEC to automatically close filehandles when function() 553 // returns, otherwise filehandles must be closed by function() 554 void loopfiles_rw(char **argv, int flags, int permissions, int failok, 555 void (*function)(int fd, char *name)) 556 { 557 int fd; 558 559 // If no arguments, read from stdin. 560 if (!*argv) function((flags & O_ACCMODE) != O_RDONLY ? 1 : 0, "-"); 561 else do { 562 // Filename "-" means read from stdin. 563 // Inability to open a file prints a warning, but doesn't exit. 564 565 if (!strcmp(*argv, "-")) fd=0; 566 else if (0>(fd = open(*argv, flags, permissions)) && !failok) { 567 perror_msg_raw(*argv); 568 continue; 569 } 570 function(fd, *argv); 571 if (flags & O_CLOEXEC) close(fd); 572 } while (*++argv); 573 } 574 575 // Call loopfiles_rw with O_RDONLY|O_CLOEXEC and !failok (common case). 576 void loopfiles(char **argv, void (*function)(int fd, char *name)) 577 { 578 loopfiles_rw(argv, O_RDONLY|O_CLOEXEC, 0, 0, function); 579 } 580 581 // Slow, but small. 582 583 char *get_rawline(int fd, long *plen, char end) 584 { 585 char c, *buf = NULL; 586 long len = 0; 587 588 for (;;) { 589 if (1>read(fd, &c, 1)) break; 590 if (!(len & 63)) buf=xrealloc(buf, len+65); 591 if ((buf[len++]=c) == end) break; 592 } 593 if (buf) buf[len]=0; 594 if (plen) *plen = len; 595 596 return buf; 597 } 598 599 char *get_line(int fd) 600 { 601 long len; 602 char *buf = get_rawline(fd, &len, '\n'); 603 604 if (buf && buf[--len]=='\n') buf[len]=0; 605 606 return buf; 607 } 608 609 int wfchmodat(int fd, char *name, mode_t mode) 610 { 611 int rc = fchmodat(fd, name, mode, 0); 612 613 if (rc) { 614 perror_msg("chmod '%s' to %04o", name, mode); 615 toys.exitval=1; 616 } 617 return rc; 618 } 619 620 static char *tempfile2zap; 621 static void tempfile_handler(int i) 622 { 623 if (1 < (long)tempfile2zap) unlink(tempfile2zap); 624 _exit(1); 625 } 626 627 // Open a temporary file to copy an existing file into. 628 int copy_tempfile(int fdin, char *name, char **tempname) 629 { 630 struct stat statbuf; 631 int fd; 632 633 *tempname = xmprintf("%s%s", name, "XXXXXX"); 634 if(-1 == (fd = mkstemp(*tempname))) error_exit("no temp file"); 635 if (!tempfile2zap) sigatexit(tempfile_handler); 636 tempfile2zap = *tempname; 637 638 // Set permissions of output file 639 640 fstat(fdin, &statbuf); 641 fchmod(fd, statbuf.st_mode); 642 643 return fd; 644 } 645 646 // Abort the copy and delete the temporary file. 647 void delete_tempfile(int fdin, int fdout, char **tempname) 648 { 649 close(fdin); 650 close(fdout); 651 if (*tempname) unlink(*tempname); 652 tempfile2zap = (char *)1; 653 free(*tempname); 654 *tempname = NULL; 655 } 656 657 // Copy the rest of the data and replace the original with the copy. 658 void replace_tempfile(int fdin, int fdout, char **tempname) 659 { 660 char *temp = xstrdup(*tempname); 661 662 temp[strlen(temp)-6]=0; 663 if (fdin != -1) { 664 xsendfile(fdin, fdout); 665 xclose(fdin); 666 } 667 xclose(fdout); 668 rename(*tempname, temp); 669 tempfile2zap = (char *)1; 670 free(*tempname); 671 free(temp); 672 *tempname = NULL; 673 } 674 675 // Create a 256 entry CRC32 lookup table. 676 677 void crc_init(unsigned int *crc_table, int little_endian) 678 { 679 unsigned int i; 680 681 // Init the CRC32 table (big endian) 682 for (i=0; i<256; i++) { 683 unsigned int j, c = little_endian ? i : i<<24; 684 for (j=8; j; j--) 685 if (little_endian) c = (c&1) ? (c>>1)^0xEDB88320 : c>>1; 686 else c=c&0x80000000 ? (c<<1)^0x04c11db7 : (c<<1); 687 crc_table[i] = c; 688 } 689 } 690 691 // Init base64 table 692 693 void base64_init(char *p) 694 { 695 int i; 696 697 for (i = 'A'; i != ':'; i++) { 698 if (i == 'Z'+1) i = 'a'; 699 if (i == 'z'+1) i = '0'; 700 *(p++) = i; 701 } 702 *(p++) = '+'; 703 *(p++) = '/'; 704 } 705 706 int yesno(int def) 707 { 708 char buf; 709 710 fprintf(stderr, " (%c/%c):", def ? 'Y' : 'y', def ? 'n' : 'N'); 711 fflush(stderr); 712 while (fread(&buf, 1, 1, stdin)) { 713 int new; 714 715 // The letter changes the value, the newline (or space) returns it. 716 if (isspace(buf)) break; 717 if (-1 != (new = stridx("ny", tolower(buf)))) def = new; 718 } 719 720 return def; 721 } 722 723 struct signame { 724 int num; 725 char *name; 726 }; 727 728 // Signals required by POSIX 2008: 729 // http://pubs.opengroup.org/onlinepubs/9699919799/basedefs/signal.h.html 730 731 #define SIGNIFY(x) {SIG##x, #x} 732 733 static struct signame signames[] = { 734 SIGNIFY(ABRT), SIGNIFY(ALRM), SIGNIFY(BUS), 735 SIGNIFY(FPE), SIGNIFY(HUP), SIGNIFY(ILL), SIGNIFY(INT), SIGNIFY(KILL), 736 SIGNIFY(PIPE), SIGNIFY(QUIT), SIGNIFY(SEGV), SIGNIFY(TERM), 737 SIGNIFY(USR1), SIGNIFY(USR2), SIGNIFY(SYS), SIGNIFY(TRAP), 738 SIGNIFY(VTALRM), SIGNIFY(XCPU), SIGNIFY(XFSZ), 739 740 // Start of non-terminal signals 741 742 SIGNIFY(CHLD), SIGNIFY(CONT), SIGNIFY(STOP), SIGNIFY(TSTP), 743 SIGNIFY(TTIN), SIGNIFY(TTOU), SIGNIFY(URG) 744 }; 745 746 // not in posix: SIGNIFY(STKFLT), SIGNIFY(WINCH), SIGNIFY(IO), SIGNIFY(PWR) 747 // obsolete: SIGNIFY(PROF) SIGNIFY(POLL) 748 749 // Handler that sets toys.signal, and writes to toys.signalfd if set 750 void generic_signal(int sig) 751 { 752 if (toys.signalfd) { 753 char c = sig; 754 755 writeall(toys.signalfd, &c, 1); 756 } 757 toys.signal = sig; 758 } 759 760 // Install the same handler on every signal that defaults to killing the process 761 void sigatexit(void *handler) 762 { 763 int i; 764 for (i=0; signames[i].num != SIGCHLD; i++) signal(signames[i].num, handler); 765 } 766 767 // Convert name to signal number. If name == NULL print names. 768 int sig_to_num(char *pidstr) 769 { 770 int i; 771 772 if (pidstr) { 773 char *s; 774 775 i = estrtol(pidstr, &s, 10); 776 if (!errno && !*s) return i; 777 778 if (!strncasecmp(pidstr, "sig", 3)) pidstr+=3; 779 } 780 for (i = 0; i < sizeof(signames)/sizeof(struct signame); i++) 781 if (!pidstr) xputs(signames[i].name); 782 else if (!strcasecmp(pidstr, signames[i].name)) return signames[i].num; 783 784 return -1; 785 } 786 787 char *num_to_sig(int sig) 788 { 789 int i; 790 791 for (i=0; i<sizeof(signames)/sizeof(struct signame); i++) 792 if (signames[i].num == sig) return signames[i].name; 793 return NULL; 794 } 795 796 // premute mode bits based on posix mode strings. 797 mode_t string_to_mode(char *modestr, mode_t mode) 798 { 799 char *whos = "ogua", *hows = "=+-", *whats = "xwrstX", *whys = "ogu", 800 *s, *str = modestr; 801 mode_t extrabits = mode & ~(07777); 802 803 // Handle octal mode 804 if (isdigit(*str)) { 805 mode = estrtol(str, &s, 8); 806 if (errno || *s || (mode & ~(07777))) goto barf; 807 808 return mode | extrabits; 809 } 810 811 // Gaze into the bin of permission... 812 for (;;) { 813 int i, j, dowho, dohow, dowhat, amask; 814 815 dowho = dohow = dowhat = amask = 0; 816 817 // Find the who, how, and what stanzas, in that order 818 while (*str && (s = strchr(whos, *str))) { 819 dowho |= 1<<(s-whos); 820 str++; 821 } 822 // If who isn't specified, like "a" but honoring umask. 823 if (!dowho) { 824 dowho = 8; 825 umask(amask=umask(0)); 826 } 827 if (!*str || !(s = strchr(hows, *str))) goto barf; 828 dohow = *(str++); 829 830 if (!dohow) goto barf; 831 while (*str && (s = strchr(whats, *str))) { 832 dowhat |= 1<<(s-whats); 833 str++; 834 } 835 836 // Convert X to x for directory or if already executable somewhere 837 if ((dowhat&32) && (S_ISDIR(mode) || (mode&0111))) dowhat |= 1; 838 839 // Copy mode from another category? 840 if (!dowhat && *str && (s = strchr(whys, *str))) { 841 dowhat = (mode>>(3*(s-whys)))&7; 842 str++; 843 } 844 845 // Are we ready to do a thing yet? 846 if (*str && *(str++) != ',') goto barf; 847 848 // Ok, apply the bits to the mode. 849 for (i=0; i<4; i++) { 850 for (j=0; j<3; j++) { 851 mode_t bit = 0; 852 int where = 1<<((3*i)+j); 853 854 if (amask & where) continue; 855 856 // Figure out new value at this location 857 if (i == 3) { 858 // suid/sticky bit. 859 if (j) { 860 if ((dowhat & 8) && (dowho&(8|(1<<i)))) bit++; 861 } else if (dowhat & 16) bit++; 862 } else { 863 if (!(dowho&(8|(1<<i)))) continue; 864 if (dowhat&(1<<j)) bit++; 865 } 866 867 // When selection active, modify bit 868 869 if (dohow == '=' || (bit && dohow == '-')) mode &= ~where; 870 if (bit && dohow != '-') mode |= where; 871 } 872 } 873 874 if (!*str) break; 875 } 876 877 return mode|extrabits; 878 barf: 879 error_exit("bad mode '%s'", modestr); 880 } 881 882 // Format access mode into a drwxrwxrwx string 883 void mode_to_string(mode_t mode, char *buf) 884 { 885 char c, d; 886 int i, bit; 887 888 buf[10]=0; 889 for (i=0; i<9; i++) { 890 bit = mode & (1<<i); 891 c = i%3; 892 if (!c && (mode & (1<<((d=i/3)+9)))) { 893 c = "tss"[d]; 894 if (!bit) c &= ~0x20; 895 } else c = bit ? "xwr"[c] : '-'; 896 buf[9-i] = c; 897 } 898 899 if (S_ISDIR(mode)) c = 'd'; 900 else if (S_ISBLK(mode)) c = 'b'; 901 else if (S_ISCHR(mode)) c = 'c'; 902 else if (S_ISLNK(mode)) c = 'l'; 903 else if (S_ISFIFO(mode)) c = 'p'; 904 else if (S_ISSOCK(mode)) c = 's'; 905 else c = '-'; 906 *buf = c; 907 } 908 909 char *basename_r(char *name) 910 { 911 char *s = strrchr(name, '/'); 912 913 if (s) return s+1; 914 return name; 915 } 916 917 // Execute a callback for each PID that matches a process name from a list. 918 void names_to_pid(char **names, int (*callback)(pid_t pid, char *name)) 919 { 920 DIR *dp; 921 struct dirent *entry; 922 923 if (!(dp = opendir("/proc"))) perror_exit("opendir"); 924 925 while ((entry = readdir(dp))) { 926 unsigned u; 927 char *cmd, **curname; 928 929 if (!(u = atoi(entry->d_name))) continue; 930 sprintf(libbuf, "/proc/%u/cmdline", u); 931 if (!(cmd = readfile(libbuf, libbuf, sizeof(libbuf)))) continue; 932 933 for (curname = names; *curname; curname++) 934 if (**curname == '/' ? !strcmp(cmd, *curname) 935 : !strcmp(basename_r(cmd), basename_r(*curname))) 936 if (callback(u, *curname)) break; 937 if (*curname) break; 938 } 939 closedir(dp); 940 } 941 942 // display first few digits of number with power of two units 943 int human_readable(char *buf, unsigned long long num, int style) 944 { 945 unsigned long long snap = 0; 946 int len, unit, divisor = (style&HR_1000) ? 1000 : 1024; 947 948 // Divide rounding up until we have 3 or fewer digits. Since the part we 949 // print is decimal, the test is 999 even when we divide by 1024. 950 // We can't run out of units because 2<<64 is 18 exabytes. 951 // test 5675 is 5.5k not 5.6k. 952 for (unit = 0; num > 999; unit++) num = ((snap = num)+(divisor/2))/divisor; 953 len = sprintf(buf, "%llu", num); 954 if (unit && len == 1) { 955 // Redo rounding for 1.2M case, this works with and without HR_1000. 956 num = snap/divisor; 957 snap -= num*divisor; 958 snap = ((snap*100)+50)/divisor; 959 snap /= 10; 960 len = sprintf(buf, "%llu.%llu", num, snap); 961 } 962 if (style & HR_SPACE) buf[len++] = ' '; 963 if (unit) { 964 unit = " kMGTPE"[unit]; 965 966 if (!(style&HR_1000)) unit = toupper(unit); 967 buf[len++] = unit; 968 } else if (style & HR_B) buf[len++] = 'B'; 969 buf[len] = 0; 970 971 return len; 972 } 973 974 // The qsort man page says you can use alphasort, the posix committee 975 // disagreed, and doubled down: http://austingroupbugs.net/view.php?id=142 976 // So just do our own. (The const is entirely to humor the stupid compiler.) 977 int qstrcmp(const void *a, const void *b) 978 { 979 return strcmp(*(char **)a, *(char **)b); 980 } 981 982 // According to http://www.opengroup.org/onlinepubs/9629399/apdxa.htm 983 // we should generate a uuid structure by reading a clock with 100 nanosecond 984 // precision, normalizing it to the start of the gregorian calendar in 1582, 985 // and looking up our eth0 mac address. 986 // 987 // On the other hand, we have 128 bits to come up with a unique identifier, of 988 // which 6 have a defined value. /dev/urandom it is. 989 990 void create_uuid(char *uuid) 991 { 992 // Read 128 random bits 993 int fd = xopen("/dev/urandom", O_RDONLY); 994 xreadall(fd, uuid, 16); 995 close(fd); 996 997 // Claim to be a DCE format UUID. 998 uuid[6] = (uuid[6] & 0x0F) | 0x40; 999 uuid[8] = (uuid[8] & 0x3F) | 0x80; 1000 1001 // rfc2518 section 6.4.1 suggests if we're not using a macaddr, we should 1002 // set bit 1 of the node ID, which is the mac multicast bit. This means we 1003 // should never collide with anybody actually using a macaddr. 1004 uuid[11] |= 128; 1005 } 1006 1007 char *show_uuid(char *uuid) 1008 { 1009 char *out = libbuf; 1010 int i; 1011 1012 for (i=0; i<16; i++) out+=sprintf(out, "-%02x"+!(0x550&(1<<i)), uuid[i]); 1013 *out = 0; 1014 1015 return libbuf; 1016 } 1017 1018 // Returns pointer to letter at end, 0 if none. *start = initial % 1019 char *next_printf(char *s, char **start) 1020 { 1021 for (; *s; s++) { 1022 if (*s != '%') continue; 1023 if (*++s == '%') continue; 1024 if (start) *start = s-1; 1025 while (0 <= stridx("0'#-+ ", *s)) s++; 1026 while (isdigit(*s)) s++; 1027 if (*s == '.') s++; 1028 while (isdigit(*s)) s++; 1029 1030 return s; 1031 } 1032 1033 return 0; 1034 } 1035 1036 // Posix inexplicably hasn't got this, so find str in line. 1037 char *strnstr(char *line, char *str) 1038 { 1039 long len = strlen(str); 1040 char *s; 1041 1042 for (s = line; *s; s++) if (!strncasecmp(s, str, len)) break; 1043 1044 return *s ? s : 0; 1045 } 1046