/* * Copyright (c) 1989, 1993 * The Regents of the University of California. All rights reserved. * * This code is derived from software contributed to Berkeley by * Adam S. Moskowitz of Menlo Consulting and Marciano Pitargue. * * 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. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``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 REGENTS OR CONTRIBUTORS 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. * * @(#) Copyright (c) 1989, 1993 The Regents of the University of California. All rights reserved. * @(#)cut.c 8.3 (Berkeley) 5/4/95 * $FreeBSD: src/usr.bin/cut/cut.c,v 1.9.2.3 2001/07/30 09:59:16 dd Exp $ * $DragonFly: src/usr.bin/cut/cut.c,v 1.6 2008/03/09 16:05:39 swildner Exp $ */ #include #include #include #include #include #include #include #include int cflag; char dchar; int dflag; int fflag; int sflag; int wflag; static void c_cut(FILE *, const char *); static void f_cut(FILE *, const char *); static void get_list(char *); static int is_delim(int); static void usage(void); int main(int argc, char **argv) { FILE *fp; void (*fcn) (FILE *, const char *) = NULL; int ch; fcn = NULL; setlocale (LC_ALL, ""); dchar = '\t'; /* default delimiter is \t */ /* Since we don't support multi-byte characters, the -c and -b options are equivalent, and the -n option is meaningless. */ while ((ch = getopt(argc, argv, "b:c:d:f:snw")) != -1) switch(ch) { case 'b': case 'c': fcn = c_cut; get_list(optarg); cflag = 1; break; case 'd': dchar = *optarg; dflag = 1; break; case 'f': get_list(optarg); fcn = f_cut; fflag = 1; break; case 's': sflag = 1; break; case 'n': break; case 'w': wflag = 1; break; case '?': default: usage(); } argc -= optind; argv += optind; if (fflag) { if (cflag || (wflag && dflag)) usage(); } else if (!cflag || dflag || sflag || wflag) usage(); if (*argv) for (; *argv; ++argv) { if (!(fp = fopen(*argv, "r"))) err(1, "%s", *argv); fcn(fp, *argv); (void)fclose(fp); } else fcn(stdin, "stdin"); exit(0); } size_t autostart, autostop, maxval; char positions[_POSIX2_LINE_MAX + 1]; static void get_list(char *list) { size_t setautostart, start, stop; char *pos; char *p; /* * set a byte in the positions array to indicate if a field or * column is to be selected; use +1, it's 1-based, not 0-based. * This parser is less restrictive than the Draft 9 POSIX spec. * POSIX doesn't allow lists that aren't in increasing order or * overlapping lists. We also handle "-3-5" although there's no * real reason too. */ for (; (p = strsep(&list, ", \t")) != NULL;) { setautostart = start = stop = 0; if (*p == '-') { ++p; setautostart = 1; } if (isdigit((unsigned char)*p)) { start = stop = strtol(p, &p, 10); if (setautostart && start > autostart) autostart = start; } if (*p == '-') { if (isdigit((unsigned char)p[1])) stop = strtol(p + 1, &p, 10); if (*p == '-') { ++p; if (!autostop || autostop > stop) autostop = stop; } } if (*p) errx(1, "[-cf] list: illegal list value"); if (!stop || !start) errx(1, "[-cf] list: values may not include zero"); if (stop > _POSIX2_LINE_MAX) errx(1, "[-cf] list: %ld too large (max %d)", (long)stop, _POSIX2_LINE_MAX); if (maxval < stop) maxval = stop; for (pos = positions + start; start++ <= stop; *pos++ = 1); } /* overlapping ranges */ if (autostop && maxval > autostop) maxval = autostop; /* set autostart */ if (autostart) memset(positions + 1, '1', autostart); } /* ARGSUSED */ static void c_cut(FILE *fp, const char *fname) { int ch, col; char *pos; fname = NULL; ch = 0; for (;;) { pos = positions + 1; for (col = maxval; col; --col) { if ((ch = getc(fp)) == EOF) return; if (ch == '\n') break; if (*pos++) (void)putchar(ch); } if (ch != '\n') { if (autostop) while ((ch = getc(fp)) != EOF && ch != '\n') (void)putchar(ch); else while ((ch = getc(fp)) != EOF && ch != '\n'); } (void)putchar('\n'); } } static int is_delim(int ch) { if (wflag) { if (ch == ' ' || ch == '\t') return 1; } else { if (ch == dchar) return 1; } return 0; } static void f_cut(FILE *fp, const char *fname __unused) { int ch, field, isdelim; char *pos, *p, sep; int output; char *lbuf, *mlbuf = NULL; size_t lbuflen; sep = wflag ? ' ' : dchar; while ((lbuf = fgetln(fp, &lbuflen)) != NULL) { /* Assert EOL has a newline. */ if (*(lbuf + lbuflen - 1) != '\n') { /* Can't have > 1 line with no trailing newline. */ mlbuf = malloc(lbuflen + 1); if (mlbuf == NULL) err(1, "malloc"); memcpy(mlbuf, lbuf, lbuflen); *(mlbuf + lbuflen) = '\n'; lbuf = mlbuf; } output = 0; for (isdelim = 0, p = lbuf;; ++p) { ch = *p; /* this should work if newline is delimiter */ if (is_delim(ch)) isdelim = 1; if (ch == '\n') { if (!isdelim && !sflag) (void)fwrite(lbuf, lbuflen, 1, stdout); break; } } if (!isdelim) continue; pos = positions + 1; for (field = maxval, p = lbuf; field; --field, ++pos) { if (*pos) { if (output++) (void)putchar(sep); while ((ch = *p++) != '\n' && !is_delim(ch)) (void)putchar(ch); /* compress whitespace */ if (wflag && ch != '\n') while (is_delim(*p)) p++; } else { while ((ch = *p++) != '\n' && !is_delim(ch)) continue; /* compress whitespace */ if (wflag && ch != '\n') while (is_delim(*p)) p++; } if (ch == '\n') break; } if (ch != '\n') { if (autostop) { if (output) (void)putchar(sep); for (; (ch = *p) != '\n'; ++p) (void)putchar(ch); } else for (; (ch = *p) != '\n'; ++p); } (void)putchar('\n'); } if (mlbuf != NULL) free(mlbuf); } static void usage(void) { (void)fprintf(stderr, "%s\n%s\n%s\n", "usage: cut -b list [-n] [file ...]", " cut -c list [file ...]", " cut -f list [-s] [-w | -d delim] [file ...]"); exit(1); }