1 /* lib.c - various reusable stuff.
2 *
3 * Copyright 2006 Rob Landley <rob@landley.net>
4 */
5
6 #define SYSLOG_NAMES
7 #include "toys.h"
8
verror_msg(char * msg,int err,va_list va)9 void verror_msg(char *msg, int err, va_list va)
10 {
11 char *s = ": %s";
12
13 fprintf(stderr, "%s: ", toys.which->name);
14 if (msg) vfprintf(stderr, msg, va);
15 else s+=2;
16 if (err>0) fprintf(stderr, s, strerror(err));
17 if (err<0 && CFG_TOYBOX_HELP)
18 fprintf(stderr, " (see \"%s --help\")", toys.which->name);
19 if (msg || err) putc('\n', stderr);
20 if (!toys.exitval) toys.exitval++;
21 }
22
23 // These functions don't collapse together because of the va_stuff.
24
error_msg(char * msg,...)25 void error_msg(char *msg, ...)
26 {
27 va_list va;
28
29 va_start(va, msg);
30 verror_msg(msg, 0, va);
31 va_end(va);
32 }
33
perror_msg(char * msg,...)34 void perror_msg(char *msg, ...)
35 {
36 va_list va;
37
38 va_start(va, msg);
39 verror_msg(msg, errno, va);
40 va_end(va);
41 }
42
43 // Die with an error message.
error_exit(char * msg,...)44 void error_exit(char *msg, ...)
45 {
46 va_list va;
47
48 va_start(va, msg);
49 verror_msg(msg, 0, va);
50 va_end(va);
51
52 xexit();
53 }
54
55 // Die with an error message and strerror(errno)
perror_exit(char * msg,...)56 void perror_exit(char *msg, ...)
57 {
58 // Die silently if our pipeline exited.
59 if (errno != EPIPE) {
60 va_list va;
61
62 va_start(va, msg);
63 verror_msg(msg, errno, va);
64 va_end(va);
65 }
66
67 xexit();
68 }
69
70 // Exit with an error message after showing help text.
help_exit(char * msg,...)71 void help_exit(char *msg, ...)
72 {
73 va_list va;
74
75 if (!msg) show_help(stdout);
76 else {
77 va_start(va, msg);
78 verror_msg(msg, -1, va);
79 va_end(va);
80 }
81
82 xexit();
83 }
84
85 // If you want to explicitly disable the printf() behavior (because you're
86 // printing user-supplied data, or because android's static checker produces
87 // false positives for 'char *s = x ? "blah1" : "blah2"; printf(s);' and it's
88 // -Werror there for policy reasons).
error_msg_raw(char * msg)89 void error_msg_raw(char *msg)
90 {
91 error_msg("%s", msg);
92 }
93
perror_msg_raw(char * msg)94 void perror_msg_raw(char *msg)
95 {
96 perror_msg("%s", msg);
97 }
98
error_exit_raw(char * msg)99 void error_exit_raw(char *msg)
100 {
101 error_exit("%s", msg);
102 }
103
perror_exit_raw(char * msg)104 void perror_exit_raw(char *msg)
105 {
106 perror_exit("%s", msg);
107 }
108
109 // Keep reading until full or EOF
readall(int fd,void * buf,size_t len)110 ssize_t readall(int fd, void *buf, size_t len)
111 {
112 size_t count = 0;
113
114 while (count<len) {
115 int i = read(fd, (char *)buf+count, len-count);
116 if (!i) break;
117 if (i<0) return i;
118 count += i;
119 }
120
121 return count;
122 }
123
124 // Keep writing until done or EOF
writeall(int fd,void * buf,size_t len)125 ssize_t writeall(int fd, void *buf, size_t len)
126 {
127 size_t count = 0;
128
129 while (count<len) {
130 int i = write(fd, count+(char *)buf, len-count);
131 if (i<1) return i;
132 count += i;
133 }
134
135 return count;
136 }
137
138 // skip this many bytes of input. Return 0 for success, >0 means this much
139 // left after input skipped.
lskip(int fd,off_t offset)140 off_t lskip(int fd, off_t offset)
141 {
142 off_t cur = lseek(fd, 0, SEEK_CUR);
143
144 if (cur != -1) {
145 off_t end = lseek(fd, 0, SEEK_END) - cur;
146
147 if (end > 0 && end < offset) return offset - end;
148 end = offset+cur;
149 if (end == lseek(fd, end, SEEK_SET)) return 0;
150 perror_exit("lseek");
151 }
152
153 while (offset>0) {
154 int try = offset>sizeof(libbuf) ? sizeof(libbuf) : offset, or;
155
156 or = readall(fd, libbuf, try);
157 if (or < 0) perror_exit("lskip to %lld", (long long)offset);
158 else offset -= or;
159 if (or < try) break;
160 }
161
162 return offset;
163 }
164
165 // flags: 1=make last dir (with mode lastmode, otherwise skips last component)
166 // 2=make path (already exists is ok)
167 // 4=verbose
168 // returns 0 = path ok, 1 = error
mkpathat(int atfd,char * dir,mode_t lastmode,int flags)169 int mkpathat(int atfd, char *dir, mode_t lastmode, int flags)
170 {
171 struct stat buf;
172 char *s;
173
174 // mkdir -p one/two/three is not an error if the path already exists,
175 // but is if "three" is a file. The others we dereference and catch
176 // not-a-directory along the way, but the last one we must explicitly
177 // test for. Might as well do it up front.
178
179 if (!fstatat(atfd, dir, &buf, 0) && !S_ISDIR(buf.st_mode)) {
180 errno = EEXIST;
181 return 1;
182 }
183
184 for (s = dir; ;s++) {
185 char save = 0;
186 mode_t mode = (0777&~toys.old_umask)|0300;
187
188 // find next '/', but don't try to mkdir "" at start of absolute path
189 if (*s == '/' && (flags&2) && s != dir) {
190 save = *s;
191 *s = 0;
192 } else if (*s) continue;
193
194 // Use the mode from the -m option only for the last directory.
195 if (!save) {
196 if (flags&1) mode = lastmode;
197 else break;
198 }
199
200 if (mkdirat(atfd, dir, mode)) {
201 if (!(flags&2) || errno != EEXIST) return 1;
202 } else if (flags&4)
203 fprintf(stderr, "%s: created directory '%s'\n", toys.which->name, dir);
204
205 if (!(*s = save)) break;
206 }
207
208 return 0;
209 }
210
211 // The common case
mkpath(char * dir)212 int mkpath(char *dir)
213 {
214 return mkpathat(AT_FDCWD, dir, 0, MKPATHAT_MAKE);
215 }
216
217 // Split a path into linked list of components, tracking head and tail of list.
218 // Filters out // entries with no contents.
splitpath(char * path,struct string_list ** list)219 struct string_list **splitpath(char *path, struct string_list **list)
220 {
221 char *new = path;
222
223 *list = 0;
224 do {
225 int len;
226
227 if (*path && *path != '/') continue;
228 len = path-new;
229 if (len > 0) {
230 *list = xmalloc(sizeof(struct string_list) + len + 1);
231 (*list)->next = 0;
232 memcpy((*list)->str, new, len);
233 (*list)->str[len] = 0;
234 list = &(*list)->next;
235 }
236 new = path+1;
237 } while (*path++);
238
239 return list;
240 }
241
242 // Find all file in a colon-separated path with access type "type" (generally
243 // X_OK or R_OK). Returns a list of absolute paths to each file found, in
244 // order.
245
find_in_path(char * path,char * filename)246 struct string_list *find_in_path(char *path, char *filename)
247 {
248 struct string_list *rlist = NULL, **prlist=&rlist;
249 char *cwd;
250
251 if (!path) return 0;
252
253 cwd = xgetcwd();
254 for (;;) {
255 char *res, *next = strchr(path, ':');
256 int len = next ? next-path : strlen(path);
257 struct string_list *rnext;
258 struct stat st;
259
260 rnext = xmalloc(sizeof(void *) + strlen(filename)
261 + (len ? len : strlen(cwd)) + 2);
262 if (!len) sprintf(rnext->str, "%s/%s", cwd, filename);
263 else {
264 memcpy(res = rnext->str, path, len);
265 res += len;
266 *(res++) = '/';
267 strcpy(res, filename);
268 }
269
270 // Confirm it's not a directory.
271 if (!stat(rnext->str, &st) && S_ISREG(st.st_mode)) {
272 *prlist = rnext;
273 rnext->next = NULL;
274 prlist = &(rnext->next);
275 } else free(rnext);
276
277 if (!next) break;
278 path += len;
279 path++;
280 }
281 free(cwd);
282
283 return rlist;
284 }
285
estrtol(char * str,char ** end,int base)286 long long estrtol(char *str, char **end, int base)
287 {
288 errno = 0;
289
290 return strtoll(str, end, base);
291 }
292
xstrtol(char * str,char ** end,int base)293 long long xstrtol(char *str, char **end, int base)
294 {
295 long long l = estrtol(str, end, base);
296
297 if (errno) perror_exit_raw(str);
298
299 return l;
300 }
301
302 // atol() with the kilo/mega/giga/tera/peta/exa extensions, plus word and block.
303 // (zetta and yotta don't fit in 64 bits.)
atolx(char * numstr)304 long long atolx(char *numstr)
305 {
306 char *c = numstr, *suffixes="cwbkmgtpe", *end;
307 long long val;
308
309 val = xstrtol(numstr, &c, 0);
310 if (c != numstr && *c && (end = strchr(suffixes, tolower(*c)))) {
311 int shift = end-suffixes-2;
312 ++c;
313 if (shift==-1) val *= 2;
314 else if (!shift) val *= 512;
315 else if (shift>0) {
316 if (*c && tolower(*c++)=='d') while (shift--) val *= 1000;
317 else val *= 1LL<<(shift*10);
318 }
319 }
320 while (isspace(*c)) c++;
321 if (c==numstr || *c) error_exit("not integer: %s", numstr);
322
323 return val;
324 }
325
atolx_range(char * numstr,long long low,long long high)326 long long atolx_range(char *numstr, long long low, long long high)
327 {
328 long long val = atolx(numstr);
329
330 if (val < low) error_exit("%lld < %lld", val, low);
331 if (val > high) error_exit("%lld > %lld", val, high);
332
333 return val;
334 }
335
stridx(char * haystack,char needle)336 int stridx(char *haystack, char needle)
337 {
338 char *off;
339
340 if (!needle) return -1;
341 off = strchr(haystack, needle);
342 if (!off) return -1;
343
344 return off-haystack;
345 }
346
347 // Convert utf8 sequence to a unicode wide character
utf8towc(unsigned * wc,char * str,unsigned len)348 int utf8towc(unsigned *wc, char *str, unsigned len)
349 {
350 unsigned result, mask, first;
351 char *s, c;
352
353 // fast path ASCII
354 if (len && *str<128) return !!(*wc = *str);
355
356 result = first = *(s = str++);
357 if (result<0xc2 || result>0xf4) return -1;
358 for (mask = 6; (first&0xc0)==0xc0; mask += 5, first <<= 1) {
359 if (!--len) return -2;
360 if (((c = *(str++))&0xc0) != 0x80) return -1;
361 result = (result<<6)|(c&0x3f);
362 }
363 result &= (1<<mask)-1;
364 c = str-s;
365
366 // Avoid overlong encodings
367 if (result<(unsigned []){0x80,0x800,0x10000}[c-2]) return -1;
368
369 // Limit unicode so it can't encode anything UTF-16 can't.
370 if (result>0x10ffff || (result>=0xd800 && result<=0xdfff)) return -1;
371 *wc = result;
372
373 return str-s;
374 }
375
strlower(char * s)376 char *strlower(char *s)
377 {
378 char *try, *new;
379
380 if (!CFG_TOYBOX_I18N) {
381 try = new = xstrdup(s);
382 for (; *s; s++) *(new++) = tolower(*s);
383 } else {
384 // I can't guarantee the string _won't_ expand during reencoding, so...?
385 try = new = xmalloc(strlen(s)*2+1);
386
387 while (*s) {
388 unsigned c;
389 int len = utf8towc(&c, s, MB_CUR_MAX);
390
391 if (len < 1) *(new++) = *(s++);
392 else {
393 s += len;
394 // squash title case too
395 c = towlower(c);
396
397 // if we had a valid utf8 sequence, convert it to lower case, and can't
398 // encode back to utf8, something is wrong with your libc. But just
399 // in case somebody finds an exploit...
400 len = wcrtomb(new, c, 0);
401 if (len < 1) error_exit("bad utf8 %x", (int)c);
402 new += len;
403 }
404 }
405 *new = 0;
406 }
407
408 return try;
409 }
410
411 // strstr but returns pointer after match
strafter(char * haystack,char * needle)412 char *strafter(char *haystack, char *needle)
413 {
414 char *s = strstr(haystack, needle);
415
416 return s ? s+strlen(needle) : s;
417 }
418
419 // Remove trailing \n
chomp(char * s)420 char *chomp(char *s)
421 {
422 char *p = strrchr(s, '\n');
423
424 if (p && !p[1]) *p = 0;
425 return s;
426 }
427
unescape(char c)428 int unescape(char c)
429 {
430 char *from = "\\abefnrtv", *to = "\\\a\b\033\f\n\r\t\v";
431 int idx = stridx(from, c);
432
433 return (idx == -1) ? 0 : to[idx];
434 }
435
436 // If string ends with suffix return pointer to start of suffix in string,
437 // else NULL
strend(char * str,char * suffix)438 char *strend(char *str, char *suffix)
439 {
440 long a = strlen(str), b = strlen(suffix);
441
442 if (a>b && !strcmp(str += a-b, suffix)) return str;
443
444 return 0;
445 }
446
447 // If *a starts with b, advance *a past it and return 1, else return 0;
strstart(char ** a,char * b)448 int strstart(char **a, char *b)
449 {
450 char *c = *a;
451
452 while (*b && *c == *b) b++, c++;
453 if (!*b) *a = c;
454
455 return !*b;
456 }
457
458 // If *a starts with b, advance *a past it and return 1, else return 0;
strcasestart(char ** a,char * b)459 int strcasestart(char **a, char *b)
460 {
461 int len = strlen(b), i = !strncasecmp(*a, b, len);
462
463 if (i) *a += len;
464
465 return i;
466 }
467
same_file(struct stat * st1,struct stat * st2)468 int same_file(struct stat *st1, struct stat *st2)
469 {
470 return st1->st_ino==st2->st_ino && st1->st_dev==st2->st_dev;
471 }
472
473 // Return how long the file at fd is, if there's any way to determine it.
fdlength(int fd)474 off_t fdlength(int fd)
475 {
476 struct stat st;
477 off_t base = 0, range = 1, expand = 1, old;
478
479 if (!fstat(fd, &st) && S_ISREG(st.st_mode)) return st.st_size;
480
481 // If the ioctl works for this, return it.
482 // TODO: is blocksize still always 512, or do we stat for it?
483 // unsigned int size;
484 // if (ioctl(fd, BLKGETSIZE, &size) >= 0) return size*512L;
485
486 // If not, do a binary search for the last location we can read. (Some
487 // block devices don't do BLKGETSIZE right.) This should probably have
488 // a CONFIG option...
489
490 // If not, do a binary search for the last location we can read.
491
492 old = lseek(fd, 0, SEEK_CUR);
493 do {
494 char temp;
495 off_t pos = base + range / 2;
496
497 if (lseek(fd, pos, 0)>=0 && read(fd, &temp, 1)==1) {
498 off_t delta = (pos + 1) - base;
499
500 base += delta;
501 if (expand) range = (expand <<= 1) - base;
502 else range -= delta;
503 } else {
504 expand = 0;
505 range = pos - base;
506 }
507 } while (range > 0);
508
509 lseek(fd, old, SEEK_SET);
510
511 return base;
512 }
513
514 // Read contents of file as a single nul-terminated string.
515 // measure file size if !len, allocate buffer if !buf
516 // Existing buffers need len in *plen
517 // Returns amount of data read in *plen
readfileat(int dirfd,char * name,char * ibuf,off_t * plen)518 char *readfileat(int dirfd, char *name, char *ibuf, off_t *plen)
519 {
520 off_t len, rlen;
521 int fd;
522 char *buf, *rbuf;
523
524 // Unsafe to probe for size with a supplied buffer, don't ever do that.
525 if (CFG_TOYBOX_DEBUG && (ibuf ? !*plen : *plen)) error_exit("bad readfileat");
526
527 if (-1 == (fd = openat(dirfd, name, O_RDONLY))) return 0;
528
529 // If we dunno the length, probe it. If we can't probe, start with 1 page.
530 if (!*plen) {
531 if ((len = fdlength(fd))>0) *plen = len;
532 else len = 4096;
533 } else len = *plen-1;
534
535 if (!ibuf) buf = xmalloc(len+1);
536 else buf = ibuf;
537
538 for (rbuf = buf;;) {
539 rlen = readall(fd, rbuf, len);
540 if (*plen || rlen<len) break;
541
542 // If reading unknown size, expand buffer by 1.5 each time we fill it up.
543 rlen += rbuf-buf;
544 buf = xrealloc(buf, len = (rlen*3)/2);
545 rbuf = buf+rlen;
546 len -= rlen;
547 }
548 *plen = len = rlen+(rbuf-buf);
549 close(fd);
550
551 if (rlen<0) {
552 if (ibuf != buf) free(buf);
553 buf = 0;
554 } else buf[len] = 0;
555
556 return buf;
557 }
558
readfile(char * name,char * ibuf,off_t len)559 char *readfile(char *name, char *ibuf, off_t len)
560 {
561 return readfileat(AT_FDCWD, name, ibuf, &len);
562 }
563
564 // Sleep for this many thousandths of a second
msleep(long milliseconds)565 void msleep(long milliseconds)
566 {
567 struct timespec ts;
568
569 ts.tv_sec = milliseconds/1000;
570 ts.tv_nsec = (milliseconds%1000)*1000000;
571 nanosleep(&ts, &ts);
572 }
573
574 // Adjust timespec by nanosecond offset
nanomove(struct timespec * ts,long long offset)575 void nanomove(struct timespec *ts, long long offset)
576 {
577 long long nano = ts->tv_nsec + offset, secs = nano/1000000000;
578
579 ts->tv_sec += secs;
580 nano %= 1000000000;
581 if (nano<0) {
582 ts->tv_sec--;
583 nano += 1000000000;
584 }
585 ts->tv_nsec = nano;
586 }
587
588 // return difference between two timespecs in nanosecs
nanodiff(struct timespec * old,struct timespec * new)589 long long nanodiff(struct timespec *old, struct timespec *new)
590 {
591 return (new->tv_sec - old->tv_sec)*1000000000LL+(new->tv_nsec - old->tv_nsec);
592 }
593
594 // return 1<<x of highest bit set
highest_bit(unsigned long l)595 int highest_bit(unsigned long l)
596 {
597 int i;
598
599 for (i = 0; l; i++) l >>= 1;
600
601 return i-1;
602 }
603
604 // Inefficient, but deals with unaligned access
peek_le(void * ptr,unsigned size)605 int64_t peek_le(void *ptr, unsigned size)
606 {
607 int64_t ret = 0;
608 char *c = ptr;
609 int i;
610
611 for (i=0; i<size; i++) ret |= ((int64_t)c[i])<<(i*8);
612 return ret;
613 }
614
peek_be(void * ptr,unsigned size)615 int64_t peek_be(void *ptr, unsigned size)
616 {
617 int64_t ret = 0;
618 char *c = ptr;
619 int i;
620
621 for (i=0; i<size; i++) ret = (ret<<8)|(c[i]&0xff);
622 return ret;
623 }
624
peek(void * ptr,unsigned size)625 int64_t peek(void *ptr, unsigned size)
626 {
627 return (IS_BIG_ENDIAN ? peek_be : peek_le)(ptr, size);
628 }
629
poke_le(void * ptr,long long val,unsigned size)630 void poke_le(void *ptr, long long val, unsigned size)
631 {
632 char *c = ptr;
633
634 while (size--) {
635 *c++ = val&255;
636 val >>= 8;
637 }
638 }
639
poke_be(void * ptr,long long val,unsigned size)640 void poke_be(void *ptr, long long val, unsigned size)
641 {
642 char *c = ptr + size;
643
644 while (size--) {
645 *--c = val&255;
646 val >>=8;
647 }
648 }
649
poke(void * ptr,long long val,unsigned size)650 void poke(void *ptr, long long val, unsigned size)
651 {
652 (IS_BIG_ENDIAN ? poke_be : poke_le)(ptr, val, size);
653 }
654
655 // Iterate through an array of files, opening each one and calling a function
656 // on that filehandle and name. The special filename "-" means stdin if
657 // flags is O_RDONLY, stdout otherwise. An empty argument list calls
658 // function() on just stdin/stdout.
659 //
660 // Note: pass O_CLOEXEC to automatically close filehandles when function()
661 // returns, otherwise filehandles must be closed by function().
662 // pass WARN_ONLY to produce warning messages about files it couldn't
663 // open/create, and skip them. Otherwise function is called with fd -1.
loopfiles_rw(char ** argv,int flags,int permissions,void (* function)(int fd,char * name))664 void loopfiles_rw(char **argv, int flags, int permissions,
665 void (*function)(int fd, char *name))
666 {
667 int fd, failok = !(flags&WARN_ONLY);
668
669 flags &= ~WARN_ONLY;
670
671 // If no arguments, read from stdin.
672 if (!*argv) function((flags & O_ACCMODE) != O_RDONLY ? 1 : 0, "-");
673 else do {
674 // Filename "-" means read from stdin.
675 // Inability to open a file prints a warning, but doesn't exit.
676
677 if (!strcmp(*argv, "-")) fd = 0;
678 else if (0>(fd = notstdio(open(*argv, flags, permissions))) && !failok) {
679 perror_msg_raw(*argv);
680 continue;
681 }
682 function(fd, *argv);
683 if ((flags & O_CLOEXEC) && fd) close(fd);
684 } while (*++argv);
685 }
686
687 // Call loopfiles_rw with O_RDONLY|O_CLOEXEC|WARN_ONLY (common case)
loopfiles(char ** argv,void (* function)(int fd,char * name))688 void loopfiles(char **argv, void (*function)(int fd, char *name))
689 {
690 loopfiles_rw(argv, O_RDONLY|O_CLOEXEC|WARN_ONLY, 0, function);
691 }
692
693 // glue to call do_lines() from loopfiles
694 static void (*do_lines_bridge)(char **pline, long len);
loopfile_lines_bridge(int fd,char * name)695 static void loopfile_lines_bridge(int fd, char *name)
696 {
697 do_lines(fd, '\n', do_lines_bridge);
698 }
699
loopfiles_lines(char ** argv,void (* function)(char ** pline,long len))700 void loopfiles_lines(char **argv, void (*function)(char **pline, long len))
701 {
702 do_lines_bridge = function;
703 // No O_CLOEXEC because we need to call fclose.
704 loopfiles_rw(argv, O_RDONLY|WARN_ONLY, 0, loopfile_lines_bridge);
705 }
706
707 // Slow, but small.
get_line(int fd)708 char *get_line(int fd)
709 {
710 char c, *buf = NULL;
711 long len = 0;
712
713 for (;;) {
714 if (1>read(fd, &c, 1)) break;
715 if (!(len & 63)) buf=xrealloc(buf, len+65);
716 if ((buf[len++]=c) == '\n') break;
717 }
718 if (buf) {
719 buf[len]=0;
720 if (buf[--len]=='\n') buf[len]=0;
721 }
722
723 return buf;
724 }
725
wfchmodat(int fd,char * name,mode_t mode)726 int wfchmodat(int fd, char *name, mode_t mode)
727 {
728 int rc = fchmodat(fd, name, mode, 0);
729
730 if (rc) {
731 perror_msg("chmod '%s' to %04o", name, mode);
732 toys.exitval=1;
733 }
734 return rc;
735 }
736
737 static char *tempfile2zap;
tempfile_handler(void)738 static void tempfile_handler(void)
739 {
740 if (1 < (long)tempfile2zap) unlink(tempfile2zap);
741 }
742
743 // Open a temporary file to copy an existing file into.
copy_tempfile(int fdin,char * name,char ** tempname)744 int copy_tempfile(int fdin, char *name, char **tempname)
745 {
746 struct stat statbuf;
747 int fd = xtempfile(name, tempname), ignored __attribute__((__unused__));
748
749 // Record tempfile for exit cleanup if interrupted
750 if (!tempfile2zap) sigatexit(tempfile_handler);
751 tempfile2zap = *tempname;
752
753 // Set permissions of output file.
754 if (!fstat(fdin, &statbuf)) fchmod(fd, statbuf.st_mode);
755
756 // We chmod before chown, which strips the suid bit. Caller has to explicitly
757 // switch it back on if they want to keep suid.
758
759 // Suppress warn-unused-result. Both gcc and clang clutch their pearls about
760 // this but it's _supposed_ to fail when we're not root.
761 ignored = fchown(fd, statbuf.st_uid, statbuf.st_gid);
762
763 return fd;
764 }
765
766 // Abort the copy and delete the temporary file.
delete_tempfile(int fdin,int fdout,char ** tempname)767 void delete_tempfile(int fdin, int fdout, char **tempname)
768 {
769 close(fdin);
770 close(fdout);
771 if (*tempname) unlink(*tempname);
772 tempfile2zap = (char *)1;
773 free(*tempname);
774 *tempname = NULL;
775 }
776
777 // Copy the rest of the data and replace the original with the copy.
replace_tempfile(int fdin,int fdout,char ** tempname)778 void replace_tempfile(int fdin, int fdout, char **tempname)
779 {
780 char *temp = xstrdup(*tempname);
781
782 temp[strlen(temp)-6]=0;
783 if (fdin != -1) {
784 xsendfile(fdin, fdout);
785 xclose(fdin);
786 }
787 xclose(fdout);
788 xrename(*tempname, temp);
789 tempfile2zap = (char *)1;
790 free(*tempname);
791 free(temp);
792 *tempname = NULL;
793 }
794
795 // Create a 256 entry CRC32 lookup table.
796
crc_init(unsigned int * crc_table,int little_endian)797 void crc_init(unsigned int *crc_table, int little_endian)
798 {
799 unsigned int i;
800
801 // Init the CRC32 table (big endian)
802 for (i=0; i<256; i++) {
803 unsigned int j, c = little_endian ? i : i<<24;
804 for (j=8; j; j--)
805 if (little_endian) c = (c&1) ? (c>>1)^0xEDB88320 : c>>1;
806 else c=c&0x80000000 ? (c<<1)^0x04c11db7 : (c<<1);
807 crc_table[i] = c;
808 }
809 }
810
811 // Init base64 table
812
base64_init(char * p)813 void base64_init(char *p)
814 {
815 int i;
816
817 for (i = 'A'; i != ':'; i++) {
818 if (i == 'Z'+1) i = 'a';
819 if (i == 'z'+1) i = '0';
820 *(p++) = i;
821 }
822 *(p++) = '+';
823 *(p++) = '/';
824 }
825
yesno(int def)826 int yesno(int def)
827 {
828 return fyesno(stdin, def);
829 }
830
fyesno(FILE * in,int def)831 int fyesno(FILE *in, int def)
832 {
833 char buf;
834
835 fprintf(stderr, " (%c/%c):", def ? 'Y' : 'y', def ? 'n' : 'N');
836 fflush(stderr);
837 while (fread(&buf, 1, 1, in)) {
838 int new;
839
840 // The letter changes the value, the newline (or space) returns it.
841 if (isspace(buf)) break;
842 if (-1 != (new = stridx("ny", tolower(buf)))) def = new;
843 }
844
845 return def;
846 }
847
848 // Handler that sets toys.signal, and writes to toys.signalfd if set
generic_signal(int sig)849 void generic_signal(int sig)
850 {
851 if (toys.signalfd) {
852 char c = sig;
853
854 writeall(toys.signalfd, &c, 1);
855 }
856 toys.signal = sig;
857 }
858
exit_signal(int sig)859 void exit_signal(int sig)
860 {
861 if (sig) toys.exitval = sig|128;
862 xexit();
863 }
864
865 // Install the same handler on every signal that defaults to killing the
866 // process, calling the handler on the way out. Calling multiple times
867 // adds the handlers to a list, to be called in order.
sigatexit(void * handler)868 void sigatexit(void *handler)
869 {
870 xsignal_all_killers(handler ? exit_signal : SIG_DFL);
871
872 if (handler) {
873 struct arg_list *al = xmalloc(sizeof(struct arg_list));
874
875 al->next = toys.xexit;
876 al->arg = handler;
877 toys.xexit = al;
878 } else {
879 llist_traverse(toys.xexit, free);
880 toys.xexit = 0;
881 }
882 }
883
884 // Output a nicely formatted 80-column table of all the signals.
list_signals()885 void list_signals()
886 {
887 int i = 0, count = 0;
888 char *name;
889
890 for (; i<=NSIG; i++) {
891 if ((name = num_to_sig(i))) {
892 printf("%2d) SIG%-9s", i, name);
893 if (++count % 5 == 0) putchar('\n');
894 }
895 }
896 putchar('\n');
897 }
898
899 // premute mode bits based on posix mode strings.
string_to_mode(char * modestr,mode_t mode)900 mode_t string_to_mode(char *modestr, mode_t mode)
901 {
902 char *whos = "ogua", *hows = "=+-", *whats = "xwrstX", *whys = "ogu",
903 *s, *str = modestr;
904 mode_t extrabits = mode & ~(07777);
905
906 // Handle octal mode
907 if (isdigit(*str)) {
908 mode = estrtol(str, &s, 8);
909 if (errno || *s || (mode & ~(07777))) goto barf;
910
911 return mode | extrabits;
912 }
913
914 // Gaze into the bin of permission...
915 for (;;) {
916 int i, j, dowho, dohow, dowhat, amask;
917
918 dowho = dohow = dowhat = amask = 0;
919
920 // Find the who, how, and what stanzas, in that order
921 while (*str && (s = strchr(whos, *str))) {
922 dowho |= 1<<(s-whos);
923 str++;
924 }
925 // If who isn't specified, like "a" but honoring umask.
926 if (!dowho) {
927 dowho = 8;
928 umask(amask=umask(0));
929 }
930 if (!*str || !(s = strchr(hows, *str))) goto barf;
931 dohow = *(str++);
932
933 if (!dohow) goto barf;
934 while (*str && (s = strchr(whats, *str))) {
935 dowhat |= 1<<(s-whats);
936 str++;
937 }
938
939 // Convert X to x for directory or if already executable somewhere
940 if ((dowhat&32) && (S_ISDIR(mode) || (mode&0111))) dowhat |= 1;
941
942 // Copy mode from another category?
943 if (!dowhat && *str && (s = strchr(whys, *str))) {
944 dowhat = (mode>>(3*(s-whys)))&7;
945 str++;
946 }
947
948 // Are we ready to do a thing yet?
949 if (*str && *(str++) != ',') goto barf;
950
951 // Ok, apply the bits to the mode.
952 for (i=0; i<4; i++) {
953 for (j=0; j<3; j++) {
954 mode_t bit = 0;
955 int where = 1<<((3*i)+j);
956
957 if (amask & where) continue;
958
959 // Figure out new value at this location
960 if (i == 3) {
961 // suid/sticky bit.
962 if (j) {
963 if ((dowhat & 8) && (dowho&(8|(1<<i)))) bit++;
964 } else if (dowhat & 16) bit++;
965 } else {
966 if (!(dowho&(8|(1<<i)))) continue;
967 if (dowhat&(1<<j)) bit++;
968 }
969
970 // When selection active, modify bit
971
972 if (dohow == '=' || (bit && dohow == '-')) mode &= ~where;
973 if (bit && dohow != '-') mode |= where;
974 }
975 }
976
977 if (!*str) break;
978 }
979
980 return mode|extrabits;
981 barf:
982 error_exit("bad mode '%s'", modestr);
983 }
984
985 // Format access mode into a drwxrwxrwx string
mode_to_string(mode_t mode,char * buf)986 void mode_to_string(mode_t mode, char *buf)
987 {
988 char c, d;
989 int i, bit;
990
991 buf[10]=0;
992 for (i=0; i<9; i++) {
993 bit = mode & (1<<i);
994 c = i%3;
995 if (!c && (mode & (1<<((d=i/3)+9)))) {
996 c = "tss"[d];
997 if (!bit) c &= ~0x20;
998 } else c = bit ? "xwr"[c] : '-';
999 buf[9-i] = c;
1000 }
1001
1002 if (S_ISDIR(mode)) c = 'd';
1003 else if (S_ISBLK(mode)) c = 'b';
1004 else if (S_ISCHR(mode)) c = 'c';
1005 else if (S_ISLNK(mode)) c = 'l';
1006 else if (S_ISFIFO(mode)) c = 'p';
1007 else if (S_ISSOCK(mode)) c = 's';
1008 else c = '-';
1009 *buf = c;
1010 }
1011
1012 // dirname() can modify its argument or return a pointer to a constant string
1013 // This always returns a malloc() copy of everyting before last (run of ) '/'.
getdirname(char * name)1014 char *getdirname(char *name)
1015 {
1016 char *s = xstrdup(name), *ss = strrchr(s, '/');
1017
1018 while (ss && *ss && *ss == '/' && s != ss) *ss-- = 0;
1019
1020 return s;
1021 }
1022
1023 // basename() can modify its argument or return a pointer to a constant string
1024 // This just gives after the last '/' or the whole stirng if no /
getbasename(char * name)1025 char *getbasename(char *name)
1026 {
1027 char *s = strrchr(name, '/');
1028
1029 if (s) return s+1;
1030
1031 return name;
1032 }
1033
1034 // Return pointer to xabspath(file) if file is under dir, else 0
fileunderdir(char * file,char * dir)1035 char *fileunderdir(char *file, char *dir)
1036 {
1037 char *s1 = xabspath(dir, 1), *s2 = xabspath(file, -1), *ss = s2;
1038 int rc = s1 && s2 && strstart(&ss, s1) && (!s1[1] || s2[strlen(s1)] == '/');
1039
1040 free(s1);
1041 if (!rc) free(s2);
1042
1043 return rc ? s2 : 0;
1044 }
1045
1046 // Execute a callback for each PID that matches a process name from a list.
names_to_pid(char ** names,int (* callback)(pid_t pid,char * name),int scripts)1047 void names_to_pid(char **names, int (*callback)(pid_t pid, char *name),
1048 int scripts)
1049 {
1050 DIR *dp;
1051 struct dirent *entry;
1052
1053 if (!(dp = opendir("/proc"))) perror_exit("no /proc");
1054
1055 while ((entry = readdir(dp))) {
1056 unsigned u = atoi(entry->d_name);
1057 char *cmd = 0, *comm = 0, **cur;
1058 off_t len;
1059
1060 if (!u) continue;
1061
1062 // Comm is original name of executable (argv[0] could be #! interpreter)
1063 // but it's limited to 15 characters
1064 if (scripts) {
1065 sprintf(libbuf, "/proc/%u/comm", u);
1066 len = sizeof(libbuf);
1067 if (!(comm = readfileat(AT_FDCWD, libbuf, libbuf, &len)) || !len)
1068 continue;
1069 if (libbuf[len-1] == '\n') libbuf[--len] = 0;
1070 }
1071
1072 for (cur = names; *cur; cur++) {
1073 struct stat st1, st2;
1074 char *bb = getbasename(*cur);
1075 off_t len = strlen(bb);
1076
1077 // Fast path: only matching a filename (no path) that fits in comm.
1078 // `len` must be 14 or less because with a full 15 bytes we don't
1079 // know whether the name fit or was truncated.
1080 if (scripts && len<=14 && bb==*cur && !strcmp(comm, bb)) goto match;
1081
1082 // If we have a path to existing file only match if same inode
1083 if (bb!=*cur && !stat(*cur, &st1)) {
1084 char buf[32];
1085
1086 sprintf(buf, "/proc/%u/exe", u);
1087 if (stat(buf, &st2)) continue;
1088 if (st1.st_dev != st2.st_dev || st1.st_ino != st2.st_ino) continue;
1089 goto match;
1090 }
1091
1092 // Nope, gotta read command line to confirm
1093 if (!cmd) {
1094 sprintf(cmd = libbuf+16, "/proc/%u/cmdline", u);
1095 len = sizeof(libbuf)-17;
1096 if (!(cmd = readfileat(AT_FDCWD, cmd, cmd, &len))) continue;
1097 // readfile only guarantees one null terminator and we need two
1098 // (yes the kernel should do this for us, don't care)
1099 cmd[len] = 0;
1100 }
1101 if (!strcmp(bb, getbasename(cmd))) goto match;
1102 if (scripts && !strcmp(bb, getbasename(cmd+strlen(cmd)+1))) goto match;
1103 continue;
1104 match:
1105 if (callback(u, *cur)) break;
1106 }
1107 }
1108 closedir(dp);
1109 }
1110
1111 // display first "dgt" many digits of number plus unit (kilo-exabytes)
human_readable_long(char * buf,unsigned long long num,int dgt,int unit,int style)1112 int human_readable_long(char *buf, unsigned long long num, int dgt, int unit,
1113 int style)
1114 {
1115 unsigned long long snap = 0;
1116 int len, divisor = (style&HR_1000) ? 1000 : 1024;
1117
1118 // Divide rounding up until we have 3 or fewer digits. Since the part we
1119 // print is decimal, the test is 999 even when we divide by 1024.
1120 // The largest unit we can detect is 1<<64 = 18 Exabytes, but we added
1121 // Zettabyte and Yottabyte in case "unit" starts above zero.
1122 for (;;unit++) {
1123 if ((len = snprintf(0, 0, "%llu", num))<=dgt) break;
1124 num = ((snap = num)+(divisor/2))/divisor;
1125 }
1126 if (CFG_TOYBOX_DEBUG && unit>8) return sprintf(buf, "%.*s", dgt, "TILT");
1127
1128 len = sprintf(buf, "%llu", num);
1129 if (!(style & HR_NODOT) && unit && len == 1) {
1130 // Redo rounding for 1.2M case, this works with and without HR_1000.
1131 num = snap/divisor;
1132 snap -= num*divisor;
1133 snap = ((snap*100)+50)/divisor;
1134 snap /= 10;
1135 len = sprintf(buf, "%llu.%llu", num, snap);
1136 }
1137 if (style & HR_SPACE) buf[len++] = ' ';
1138 if (unit) {
1139 unit = " kMGTPEZY"[unit];
1140
1141 if (!(style&HR_1000)) unit = toupper(unit);
1142 buf[len++] = unit;
1143 } else if (style & HR_B) buf[len++] = 'B';
1144 buf[len] = 0;
1145
1146 return len;
1147 }
1148
1149 // Give 3 digit estimate + units ala 999M or 1.7T
human_readable(char * buf,unsigned long long num,int style)1150 int human_readable(char *buf, unsigned long long num, int style)
1151 {
1152 return human_readable_long(buf, num, 3, 0, style);
1153 }
1154
1155 // The qsort man page says you can use alphasort, the posix committee
1156 // disagreed, and doubled down: http://austingroupbugs.net/view.php?id=142
1157 // So just do our own. (The const is entirely to humor the stupid compiler.)
qstrcmp(const void * a,const void * b)1158 int qstrcmp(const void *a, const void *b)
1159 {
1160 return strcmp(*(char **)a, *(char **)b);
1161 }
1162
1163 // See https://tools.ietf.org/html/rfc4122, specifically section 4.4
1164 // "Algorithms for Creating a UUID from Truly Random or Pseudo-Random
1165 // Numbers".
create_uuid(char * uuid)1166 void create_uuid(char *uuid)
1167 {
1168 // "Set all the ... bits to randomly (or pseudo-randomly) chosen values".
1169 xgetrandom(uuid, 16, 0);
1170
1171 // "Set the four most significant bits ... of the time_hi_and_version
1172 // field to the 4-bit version number [4]".
1173 uuid[6] = (uuid[6] & 0x0F) | 0x40;
1174 // "Set the two most significant bits (bits 6 and 7) of
1175 // clock_seq_hi_and_reserved to zero and one, respectively".
1176 uuid[8] = (uuid[8] & 0x3F) | 0x80;
1177 }
1178
show_uuid(char * uuid)1179 char *show_uuid(char *uuid)
1180 {
1181 char *out = libbuf;
1182 int i;
1183
1184 for (i=0; i<16; i++) out+=sprintf(out, "-%02x"+!(0x550&(1<<i)), uuid[i]);
1185 *out = 0;
1186
1187 return libbuf;
1188 }
1189
1190 // Returns pointer to letter at end, 0 if none. *start = initial %
next_printf(char * s,char ** start)1191 char *next_printf(char *s, char **start)
1192 {
1193 for (; *s; s++) {
1194 if (*s != '%') continue;
1195 if (*++s == '%') continue;
1196 if (start) *start = s-1;
1197 while (0 <= stridx("0'#-+ ", *s)) s++;
1198 while (isdigit(*s)) s++;
1199 if (*s == '.') s++;
1200 while (isdigit(*s)) s++;
1201
1202 return s;
1203 }
1204
1205 return 0;
1206 }
1207
dev_minor(int dev)1208 int dev_minor(int dev)
1209 {
1210 return ((dev&0xfff00000)>>12)|(dev&0xff);
1211 }
1212
dev_major(int dev)1213 int dev_major(int dev)
1214 {
1215 return (dev&0xfff00)>>8;
1216 }
1217
dev_makedev(int major,int minor)1218 int dev_makedev(int major, int minor)
1219 {
1220 return (minor&0xff)|((major&0xfff)<<8)|((minor&0xfff00)<<12);
1221 }
1222
1223 // Return cached passwd entries.
bufgetpwuid(uid_t uid)1224 struct passwd *bufgetpwuid(uid_t uid)
1225 {
1226 struct pwuidbuf_list {
1227 struct pwuidbuf_list *next;
1228 struct passwd pw;
1229 } *list = 0;
1230 struct passwd *temp;
1231 static struct pwuidbuf_list *pwuidbuf;
1232 unsigned size = 256;
1233
1234 // If we already have this one, return it.
1235 for (list = pwuidbuf; list; list = list->next)
1236 if (list->pw.pw_uid == uid) return &(list->pw);
1237
1238 for (;;) {
1239 list = xrealloc(list, size *= 2);
1240 errno = getpwuid_r(uid, &list->pw, sizeof(*list)+(char *)list,
1241 size-sizeof(*list), &temp);
1242 if (errno != ERANGE) break;
1243 }
1244
1245 if (!temp) {
1246 free(list);
1247
1248 return 0;
1249 }
1250 list->next = pwuidbuf;
1251 pwuidbuf = list;
1252
1253 return &list->pw;
1254 }
1255
1256 // Return cached group entries.
bufgetgrgid(gid_t gid)1257 struct group *bufgetgrgid(gid_t gid)
1258 {
1259 struct grgidbuf_list {
1260 struct grgidbuf_list *next;
1261 struct group gr;
1262 } *list = 0;
1263 struct group *temp;
1264 static struct grgidbuf_list *grgidbuf;
1265 unsigned size = 256;
1266
1267 for (list = grgidbuf; list; list = list->next)
1268 if (list->gr.gr_gid == gid) return &(list->gr);
1269
1270 for (;;) {
1271 list = xrealloc(list, size *= 2);
1272 errno = getgrgid_r(gid, &list->gr, sizeof(*list)+(char *)list,
1273 size-sizeof(*list), &temp);
1274 if (errno != ERANGE) break;
1275 }
1276 if (!temp) {
1277 free(list);
1278
1279 return 0;
1280 }
1281 list->next = grgidbuf;
1282 grgidbuf = list;
1283
1284 return &list->gr;
1285 }
1286
1287 // Always null terminates, returns 0 for failure, len for success
readlinkat0(int dirfd,char * path,char * buf,int len)1288 int readlinkat0(int dirfd, char *path, char *buf, int len)
1289 {
1290 if (!len) return 0;
1291
1292 len = readlinkat(dirfd, path, buf, len-1);
1293 if (len<0) len = 0;
1294 buf[len] = 0;
1295
1296 return len;
1297 }
1298
readlink0(char * path,char * buf,int len)1299 int readlink0(char *path, char *buf, int len)
1300 {
1301 return readlinkat0(AT_FDCWD, path, buf, len);
1302 }
1303
1304 // Do regex matching with len argument to handle embedded NUL bytes in string
regexec0(regex_t * preg,char * string,long len,int nmatch,regmatch_t * pmatch,int eflags)1305 int regexec0(regex_t *preg, char *string, long len, int nmatch,
1306 regmatch_t *pmatch, int eflags)
1307 {
1308 regmatch_t backup;
1309
1310 if (!nmatch) pmatch = &backup;
1311 pmatch->rm_so = 0;
1312 pmatch->rm_eo = len;
1313 return regexec(preg, string, nmatch, pmatch, eflags|REG_STARTEND);
1314 }
1315
1316 // Return user name or string representation of number, returned buffer
1317 // lasts until next call.
getusername(uid_t uid)1318 char *getusername(uid_t uid)
1319 {
1320 struct passwd *pw = bufgetpwuid(uid);
1321 static char unum[12];
1322
1323 sprintf(unum, "%u", (unsigned)uid);
1324 return pw ? pw->pw_name : unum;
1325 }
1326
1327 // Return group name or string representation of number, returned buffer
1328 // lasts until next call.
getgroupname(gid_t gid)1329 char *getgroupname(gid_t gid)
1330 {
1331 struct group *gr = bufgetgrgid(gid);
1332 static char gnum[12];
1333
1334 sprintf(gnum, "%u", (unsigned)gid);
1335 return gr ? gr->gr_name : gnum;
1336 }
1337
1338 // Iterate over lines in file, calling function. Function can write 0 to
1339 // the line pointer if they want to keep it, or 1 to terminate processing,
1340 // otherwise line is freed. Passed file descriptor is closed at the end.
1341 // At EOF calls function(0, 0)
do_lines(int fd,char delim,void (* call)(char ** pline,long len))1342 void do_lines(int fd, char delim, void (*call)(char **pline, long len))
1343 {
1344 FILE *fp = fd ? xfdopen(fd, "r") : stdin;
1345
1346 for (;;) {
1347 char *line = 0;
1348 ssize_t len;
1349
1350 len = getdelim(&line, (void *)&len, delim, fp);
1351 if (len > 0) {
1352 call(&line, len);
1353 if (line == (void *)1) break;
1354 free(line);
1355 } else break;
1356 }
1357 call(0, 0);
1358
1359 if (fd) fclose(fp);
1360 }
1361
1362 // Return unix time in milliseconds
millitime(void)1363 long long millitime(void)
1364 {
1365 struct timespec ts;
1366
1367 clock_gettime(CLOCK_MONOTONIC, &ts);
1368 return ts.tv_sec*1000+ts.tv_nsec/1000000;
1369 }
1370
1371 // Formats `ts` in ISO format ("2018-06-28 15:08:58.846386216 -0700").
format_iso_time(char * buf,size_t len,struct timespec * ts)1372 char *format_iso_time(char *buf, size_t len, struct timespec *ts)
1373 {
1374 char *s = buf;
1375
1376 s += strftime(s, len, "%F %T", localtime(&(ts->tv_sec)));
1377 s += sprintf(s, ".%09ld ", ts->tv_nsec);
1378 s += strftime(s, len-strlen(buf), "%z", localtime(&(ts->tv_sec)));
1379
1380 return buf;
1381 }
1382
1383 // Syslog with the openlog/closelog, autodetecting daemon status via no tty
1384
loggit(int priority,char * format,...)1385 void loggit(int priority, char *format, ...)
1386 {
1387 int i, facility = LOG_DAEMON;
1388 va_list va;
1389
1390 for (i = 0; i<3; i++) if (isatty(i)) facility = LOG_AUTH;
1391 openlog(toys.which->name, LOG_PID, facility);
1392 va_start(va, format);
1393 vsyslog(priority, format, va);
1394 va_end(va);
1395 closelog();
1396 }
1397
1398 // Calculate tar packet checksum, with cksum field treated as 8 spaces
tar_cksum(void * data)1399 unsigned tar_cksum(void *data)
1400 {
1401 unsigned i, cksum = 8*' ';
1402
1403 for (i = 0; i<500; i += (i==147) ? 9 : 1) cksum += ((char *)data)[i];
1404
1405 return cksum;
1406 }
1407
1408 // is this a valid tar header?
is_tar_header(void * pkt)1409 int is_tar_header(void *pkt)
1410 {
1411 char *p = pkt;
1412 int i = 0;
1413
1414 if (p[257] && smemcmp("ustar", p+257, 5)) return 0;
1415 if (p[148] != '0' && p[148] != ' ') return 0;
1416 sscanf(p+148, "%8o", &i);
1417
1418 return i && tar_cksum(pkt) == i;
1419 }
1420
1421 // ASAN flips out about memcmp("a", "abc", 4) but the result is well-defined.
1422 // This one's guaranteed to stop at len _or_ the first difference.
smemcmp(char * one,char * two,unsigned long len)1423 int smemcmp(char *one, char *two, unsigned long len)
1424 {
1425 int ii = 0;
1426
1427 // NULL sorts after anything else
1428 if (one == two) return 0;
1429 if (!one) return 1;
1430 if (!two) return -1;
1431
1432 while (len--) if ((ii = *one++ - *two++)) break;
1433
1434 return ii;
1435 }