/* See LICENSE file for copyright and license details. */ #include #include #include #include "utf.h" #include "util.h" typedef struct Range { size_t min, max; struct Range *next; } Range; static Range *list = NULL; static char mode = 0; static char *delim = "\t"; static size_t delimlen = 1; static int nflag = 0; static int sflag = 0; static void insert(Range *r) { Range *l, *p, *t; for (p = NULL, l = list; l; p = l, l = l->next) { if (r->max && r->max + 1 < l->min) { r->next = l; break; } else if (!l->max || r->min < l->max + 2) { l->min = MIN(r->min, l->min); for (p = l, t = l->next; t; p = t, t = t->next) if (r->max && r->max + 1 < t->min) break; l->max = (p->max && r->max) ? MAX(p->max, r->max) : 0; l->next = t; return; } } if (p) p->next = r; else list = r; } static void parselist(char *str) { char *s; size_t n = 1; Range *r; if (!*str) eprintf("empty list\n"); for (s = str; *s; s++) { if (*s == ' ') *s = ','; if (*s == ',') n++; } r = ereallocarray(NULL, n, sizeof(*r)); for (s = str; n; n--, s++) { r->min = (*s == '-') ? 1 : strtoul(s, &s, 10); r->max = (*s == '-') ? strtoul(s + 1, &s, 10) : r->min; r->next = NULL; if (!r->min || (r->max && r->max < r->min) || (*s && *s != ',')) eprintf("bad list value\n"); insert(r++); } } static size_t seek(const char *s, size_t pos, size_t *prev, size_t count) { const char *t; size_t n = pos - *prev, i; if (mode == 'b') { if ((t = memchr(s, '\0', n))) return t - s; if (nflag) while (n && !UTF8_POINT(s[n])) n--; *prev += n; return n; } else if (mode == 'c') { for (n++, t = s; *t; t++) if (UTF8_POINT(*t) && !--n) break; } else { for (t = (count < delimlen + 1) ? s : s + delimlen; n && *t; ) { if (!strncmp(t, delim, delimlen)) { if (!--n && count) break; t += delimlen; continue; } for (i = 1; !fullrune(t, i); i++); t += i; } } *prev = pos; return t - s; } static void cut(FILE *fp, const char *fname) { static char *buf = NULL; static size_t size = 0; char *s; size_t i, n, p; ssize_t len; Range *r; while ((len = getline(&buf, &size, fp)) > 0) { if (len && buf[len - 1] == '\n') buf[len - 1] = '\0'; if (mode == 'f' && !utfutf(buf, delim)) { if (!sflag) puts(buf); continue; } for (i = 0, p = 1, s = buf, r = list; r; r = r->next, s += n) { s += seek(s, r->min, &p, i); i += (mode == 'f') ? delimlen : 1; if (!*s) break; if (!r->max) { fputs(s, stdout); break; } n = seek(s, r->max + 1, &p, i); i += (mode == 'f') ? delimlen : 1; if (fwrite(s, 1, n, stdout) != n) eprintf("fwrite :"); } putchar('\n'); } if (ferror(fp)) eprintf("getline %s:", fname); } static void usage(void) { eprintf("usage: %s -b list [-n] [file ...]\n" " %s -c list [file ...]\n" " %s -f list [-d delim] [-s] [file ...]\n", argv0, argv0, argv0); } int main(int argc, char *argv[]) { FILE *fp; int ret = 0; ARGBEGIN { case 'b': case 'c': case 'f': mode = ARGC(); parselist(EARGF(usage())); break; case 'd': delim = EARGF(usage()); if (!*delim) eprintf("empty delimiter\n"); delimlen = unescape(delim); break; case 'n': nflag = 1; break; case 's': sflag = 1; break; default: usage(); } ARGEND if (!mode) usage(); if (!argc) cut(stdin, ""); else { for (; *argv; argc--, argv++) { if (!strcmp(*argv, "-")) { *argv = ""; fp = stdin; } else if (!(fp = fopen(*argv, "r"))) { weprintf("fopen %s:", *argv); ret = 1; continue; } cut(fp, *argv); if (fp != stdin && fshut(fp, *argv)) ret = 1; } } ret |= fshut(stdin, "") | fshut(stdout, ""); return ret; }