2006-07-03 01:17:05 +05:30
|
|
|
/* vi: set sw=4 ts=4: */
|
2000-05-13 01:11:47 +05:30
|
|
|
/*
|
2000-08-03 00:00:11 +05:30
|
|
|
* cut.c - minimalist version of cut
|
2000-05-13 01:11:47 +05:30
|
|
|
*
|
2001-01-27 15:03:39 +05:30
|
|
|
* Copyright (C) 1999,2000,2001 by Lineo, inc.
|
2004-03-15 13:59:22 +05:30
|
|
|
* Written by Mark Whitley <markw@codepoet.org>
|
2000-05-13 01:11:47 +05:30
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
2000-08-03 00:00:11 +05:30
|
|
|
*
|
2000-05-13 01:11:47 +05:30
|
|
|
*/
|
|
|
|
|
2000-08-03 00:00:11 +05:30
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
2003-06-20 14:31:58 +05:30
|
|
|
#include <unistd.h>
|
2000-05-13 01:11:47 +05:30
|
|
|
#include <string.h>
|
2001-05-19 04:34:51 +05:30
|
|
|
#include <limits.h>
|
2000-09-26 03:15:58 +05:30
|
|
|
#include "busybox.h"
|
2000-05-13 01:11:47 +05:30
|
|
|
|
|
|
|
|
2001-05-19 04:34:51 +05:30
|
|
|
/* option vars */
|
2003-06-20 14:31:58 +05:30
|
|
|
static const char optstring[] = "b:c:f:d:sn";
|
|
|
|
#define OPT_BYTE_FLGS 1
|
|
|
|
#define OPT_CHAR_FLGS 2
|
|
|
|
#define OPT_FIELDS_FLGS 4
|
|
|
|
#define OPT_DELIM_FLGS 8
|
|
|
|
#define OPT_SUPRESS_FLGS 16
|
|
|
|
static char part; /* (b)yte, (c)har, (f)ields */
|
|
|
|
static unsigned int supress_non_delimited_lines;
|
2001-05-19 04:34:51 +05:30
|
|
|
static char delim = '\t'; /* delimiter, default is tab */
|
|
|
|
|
|
|
|
struct cut_list {
|
|
|
|
int startpos;
|
|
|
|
int endpos;
|
|
|
|
};
|
|
|
|
|
2006-03-11 00:52:06 +05:30
|
|
|
enum {
|
|
|
|
BOL = 0,
|
|
|
|
EOL = INT_MAX,
|
|
|
|
NON_RANGE = -1
|
|
|
|
};
|
2001-05-19 04:34:51 +05:30
|
|
|
|
|
|
|
static struct cut_list *cut_lists = NULL; /* growable array holding a series of lists */
|
|
|
|
static unsigned int nlists = 0; /* number of elements in above list */
|
|
|
|
|
|
|
|
|
|
|
|
static int cmpfunc(const void *a, const void *b)
|
|
|
|
{
|
|
|
|
struct cut_list *la = (struct cut_list *)a;
|
|
|
|
struct cut_list *lb = (struct cut_list *)b;
|
|
|
|
|
|
|
|
if (la->startpos > lb->startpos)
|
|
|
|
return 1;
|
|
|
|
if (la->startpos < lb->startpos)
|
|
|
|
return -1;
|
|
|
|
return 0;
|
|
|
|
}
|
2000-05-13 01:11:47 +05:30
|
|
|
|
|
|
|
|
2000-08-03 00:00:11 +05:30
|
|
|
/*
|
2001-05-19 04:34:51 +05:30
|
|
|
* parse_lists() - parses a list and puts values into startpos and endpos.
|
2004-03-15 13:59:22 +05:30
|
|
|
* valid list formats: N, N-, N-M, -M
|
2004-04-14 23:21:38 +05:30
|
|
|
* more than one list can be separated by commas
|
2000-08-03 00:00:11 +05:30
|
|
|
*/
|
2001-05-19 04:34:51 +05:30
|
|
|
static void parse_lists(char *lists)
|
2000-05-13 01:11:47 +05:30
|
|
|
{
|
2001-05-19 04:34:51 +05:30
|
|
|
char *ltok = NULL;
|
|
|
|
char *ntok = NULL;
|
|
|
|
char *junk;
|
|
|
|
int s = 0, e = 0;
|
2000-05-13 01:11:47 +05:30
|
|
|
|
2004-04-14 23:21:38 +05:30
|
|
|
/* take apart the lists, one by one (they are separated with commas */
|
2001-05-19 04:34:51 +05:30
|
|
|
while ((ltok = strsep(&lists, ",")) != NULL) {
|
|
|
|
|
|
|
|
/* it's actually legal to pass an empty list */
|
|
|
|
if (strlen(ltok) == 0)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* get the start pos */
|
|
|
|
ntok = strsep(<ok, "-");
|
|
|
|
if (ntok == NULL) {
|
|
|
|
fprintf(stderr, "Help ntok is null for starting position! What do I do?\n");
|
|
|
|
} else if (strlen(ntok) == 0) {
|
|
|
|
s = BOL;
|
|
|
|
} else {
|
|
|
|
s = strtoul(ntok, &junk, 10);
|
|
|
|
if(*junk != '\0' || s < 0)
|
2003-03-19 14:43:01 +05:30
|
|
|
bb_error_msg_and_die("invalid byte or field list");
|
2004-03-15 13:59:22 +05:30
|
|
|
|
2001-05-19 04:34:51 +05:30
|
|
|
/* account for the fact that arrays are zero based, while the user
|
|
|
|
* expects the first char on the line to be char # 1 */
|
|
|
|
if (s != 0)
|
|
|
|
s--;
|
2000-08-03 00:00:11 +05:30
|
|
|
}
|
2001-05-19 04:34:51 +05:30
|
|
|
|
|
|
|
/* get the end pos */
|
|
|
|
ntok = strsep(<ok, "-");
|
|
|
|
if (ntok == NULL) {
|
|
|
|
e = NON_RANGE;
|
|
|
|
} else if (strlen(ntok) == 0) {
|
|
|
|
e = EOL;
|
|
|
|
} else {
|
|
|
|
e = strtoul(ntok, &junk, 10);
|
|
|
|
if(*junk != '\0' || e < 0)
|
2003-03-19 14:43:01 +05:30
|
|
|
bb_error_msg_and_die("invalid byte or field list");
|
2001-05-19 04:34:51 +05:30
|
|
|
/* if the user specified and end position of 0, that means "til the
|
|
|
|
* end of the line */
|
|
|
|
if (e == 0)
|
|
|
|
e = INT_MAX;
|
|
|
|
e--; /* again, arrays are zero based, lines are 1 based */
|
|
|
|
if (e == s)
|
|
|
|
e = NON_RANGE;
|
2000-08-03 00:00:11 +05:30
|
|
|
}
|
2001-05-19 04:34:51 +05:30
|
|
|
|
|
|
|
/* if there's something left to tokenize, the user past an invalid list */
|
|
|
|
if (ltok)
|
2003-03-19 14:43:01 +05:30
|
|
|
bb_error_msg_and_die("invalid byte or field list");
|
2004-03-15 13:59:22 +05:30
|
|
|
|
2001-05-19 04:34:51 +05:30
|
|
|
/* add the new list */
|
|
|
|
cut_lists = xrealloc(cut_lists, sizeof(struct cut_list) * (++nlists));
|
|
|
|
cut_lists[nlists-1].startpos = s;
|
|
|
|
cut_lists[nlists-1].endpos = e;
|
2000-08-03 00:00:11 +05:30
|
|
|
}
|
2000-05-13 01:11:47 +05:30
|
|
|
|
2001-05-19 04:34:51 +05:30
|
|
|
/* make sure we got some cut positions out of all that */
|
|
|
|
if (nlists == 0)
|
2003-03-19 14:43:01 +05:30
|
|
|
bb_error_msg_and_die("missing list of positions");
|
2001-05-19 04:34:51 +05:30
|
|
|
|
|
|
|
/* now that the lists are parsed, we need to sort them to make life easier
|
|
|
|
* on us when it comes time to print the chars / fields / lines */
|
|
|
|
qsort(cut_lists, nlists, sizeof(struct cut_list), cmpfunc);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void cut_line_by_chars(const char *line)
|
|
|
|
{
|
|
|
|
int c, l;
|
|
|
|
/* set up a list so we can keep track of what's been printed */
|
|
|
|
char *printed = xcalloc(strlen(line), sizeof(char));
|
|
|
|
|
|
|
|
/* print the chars specified in each cut list */
|
|
|
|
for (c = 0; c < nlists; c++) {
|
|
|
|
l = cut_lists[c].startpos;
|
|
|
|
while (l < strlen(line)) {
|
|
|
|
if (!printed[l]) {
|
|
|
|
putchar(line[l]);
|
|
|
|
printed[l] = 'X';
|
|
|
|
}
|
|
|
|
l++;
|
|
|
|
if (cut_lists[c].endpos == NON_RANGE || l > cut_lists[c].endpos)
|
|
|
|
break;
|
2000-08-03 00:00:11 +05:30
|
|
|
}
|
|
|
|
}
|
2001-05-19 04:34:51 +05:30
|
|
|
putchar('\n'); /* cuz we were handed a chomped line */
|
|
|
|
free(printed);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void cut_line_by_fields(char *line)
|
|
|
|
{
|
|
|
|
int c, f;
|
|
|
|
int ndelim = -1; /* zero-based / one-based problem */
|
|
|
|
int nfields_printed = 0;
|
|
|
|
char *field = NULL;
|
|
|
|
char d[2] = { delim, 0 };
|
|
|
|
char *printed;
|
2000-05-13 01:11:47 +05:30
|
|
|
|
2001-05-19 04:34:51 +05:30
|
|
|
/* test the easy case first: does this line contain any delimiters? */
|
|
|
|
if (strchr(line, delim) == NULL) {
|
|
|
|
if (!supress_non_delimited_lines)
|
|
|
|
puts(line);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* set up a list so we can keep track of what's been printed */
|
|
|
|
printed = xcalloc(strlen(line), sizeof(char));
|
|
|
|
|
|
|
|
/* process each list on this line, for as long as we've got a line to process */
|
|
|
|
for (c = 0; c < nlists && line; c++) {
|
|
|
|
f = cut_lists[c].startpos;
|
|
|
|
do {
|
|
|
|
|
|
|
|
/* find the field we're looking for */
|
|
|
|
while (line && ndelim < f) {
|
|
|
|
field = strsep(&line, d);
|
|
|
|
ndelim++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* we found it, and it hasn't been printed yet */
|
|
|
|
if (field && ndelim == f && !printed[ndelim]) {
|
|
|
|
/* if this isn't our first time through, we need to print the
|
|
|
|
* delimiter after the last field that was printed */
|
|
|
|
if (nfields_printed > 0)
|
|
|
|
putchar(delim);
|
|
|
|
fputs(field, stdout);
|
|
|
|
printed[ndelim] = 'X';
|
|
|
|
nfields_printed++;
|
|
|
|
}
|
|
|
|
|
|
|
|
f++;
|
|
|
|
|
|
|
|
/* keep going as long as we have a line to work with, this is a
|
|
|
|
* list, and we're not at the end of that list */
|
|
|
|
} while (line && cut_lists[c].endpos != NON_RANGE && f <= cut_lists[c].endpos);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* if we printed anything at all, we need to finish it with a newline cuz
|
|
|
|
* we were handed a chomped line */
|
|
|
|
putchar('\n');
|
|
|
|
|
|
|
|
free(printed);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void cut_file_by_lines(const char *line, unsigned int linenum)
|
|
|
|
{
|
|
|
|
static int c = 0;
|
|
|
|
static int l = -1;
|
2004-03-15 13:59:22 +05:30
|
|
|
|
2001-05-19 04:34:51 +05:30
|
|
|
/* I can't initialize this above cuz the "initializer isn't
|
|
|
|
* constant" *sigh* */
|
|
|
|
if (l == -1)
|
|
|
|
l = cut_lists[c].startpos;
|
|
|
|
|
|
|
|
/* get out if we have no more lists to process or if the lines are lower
|
|
|
|
* than what we're interested in */
|
|
|
|
if (c >= nlists || linenum < l)
|
|
|
|
return;
|
|
|
|
|
|
|
|
/* if the line we're looking for is lower than the one we were passed, it
|
|
|
|
* means we displayed it already, so move on */
|
|
|
|
while (l < linenum) {
|
|
|
|
l++;
|
|
|
|
/* move on to the next list if we're at the end of this one */
|
|
|
|
if (cut_lists[c].endpos == NON_RANGE || l > cut_lists[c].endpos) {
|
|
|
|
c++;
|
|
|
|
/* get out if there's no more lists to process */
|
|
|
|
if (c >= nlists)
|
|
|
|
return;
|
|
|
|
l = cut_lists[c].startpos;
|
|
|
|
/* get out if the current line is lower than the one we just became
|
|
|
|
* interested in */
|
|
|
|
if (linenum < l)
|
|
|
|
return;
|
2000-05-13 01:11:47 +05:30
|
|
|
}
|
|
|
|
}
|
2001-05-19 04:34:51 +05:30
|
|
|
|
|
|
|
/* If we made it here, it means we've found the line we're looking for, so print it */
|
|
|
|
puts(line);
|
2000-05-13 01:11:47 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-08-03 00:00:11 +05:30
|
|
|
/*
|
|
|
|
* snippy-snip
|
|
|
|
*/
|
|
|
|
static void cut_file(FILE *file)
|
2000-05-13 01:11:47 +05:30
|
|
|
{
|
2001-05-19 04:34:51 +05:30
|
|
|
char *line = NULL;
|
|
|
|
unsigned int linenum = 0; /* keep these zero-based to be consistent */
|
2000-08-03 00:00:11 +05:30
|
|
|
|
|
|
|
/* go through every line in the file */
|
2003-03-19 14:43:01 +05:30
|
|
|
while ((line = bb_get_chomped_line_from_file(file)) != NULL) {
|
2001-05-19 04:34:51 +05:30
|
|
|
|
|
|
|
/* cut based on chars/bytes XXX: only works when sizeof(char) == byte */
|
2003-06-20 14:31:58 +05:30
|
|
|
if ((part & (OPT_CHAR_FLGS | OPT_BYTE_FLGS)))
|
2001-05-19 04:34:51 +05:30
|
|
|
cut_line_by_chars(line);
|
|
|
|
|
2000-08-03 00:00:11 +05:30
|
|
|
/* cut based on fields */
|
2003-06-20 14:31:58 +05:30
|
|
|
else {
|
2001-05-19 04:34:51 +05:30
|
|
|
if (delim == '\n')
|
|
|
|
cut_file_by_lines(line, linenum);
|
|
|
|
else
|
|
|
|
cut_line_by_fields(line);
|
2000-05-13 01:11:47 +05:30
|
|
|
}
|
2001-05-19 04:34:51 +05:30
|
|
|
|
|
|
|
linenum++;
|
|
|
|
free(line);
|
2000-05-13 01:11:47 +05:30
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-05-19 04:34:51 +05:30
|
|
|
|
2006-03-07 02:17:33 +05:30
|
|
|
int cut_main(int argc, char **argv)
|
2000-05-13 01:11:47 +05:30
|
|
|
{
|
2003-06-20 14:31:58 +05:30
|
|
|
unsigned long opt;
|
|
|
|
char *sopt, *sdopt;
|
|
|
|
|
2005-10-14 15:26:52 +05:30
|
|
|
bb_opt_complementally = "b--bcf:c--bcf:f--bcf";
|
2003-06-20 14:31:58 +05:30
|
|
|
opt = bb_getopt_ulflags(argc, argv, optstring, &sopt, &sopt, &sopt, &sdopt);
|
|
|
|
part = opt & (OPT_BYTE_FLGS|OPT_CHAR_FLGS|OPT_FIELDS_FLGS);
|
|
|
|
if(part == 0)
|
|
|
|
bb_error_msg_and_die("you must specify a list of bytes, characters, or fields");
|
2005-05-11 06:09:03 +05:30
|
|
|
if(opt & BB_GETOPT_ERROR)
|
2003-06-20 14:46:00 +05:30
|
|
|
bb_error_msg_and_die("only one type of list may be specified");
|
2003-06-20 14:31:58 +05:30
|
|
|
parse_lists(sopt);
|
|
|
|
if((opt & (OPT_DELIM_FLGS))) {
|
|
|
|
if (strlen(sdopt) > 1) {
|
2003-06-20 14:46:00 +05:30
|
|
|
bb_error_msg_and_die("the delimiter must be a single character");
|
|
|
|
}
|
2003-06-20 14:31:58 +05:30
|
|
|
delim = sdopt[0];
|
2000-08-03 00:00:11 +05:30
|
|
|
}
|
2003-06-20 14:31:58 +05:30
|
|
|
supress_non_delimited_lines = opt & OPT_SUPRESS_FLGS;
|
2000-08-03 00:00:11 +05:30
|
|
|
|
2001-05-19 04:34:51 +05:30
|
|
|
/* non-field (char or byte) cutting has some special handling */
|
2003-06-20 14:31:58 +05:30
|
|
|
if (part != OPT_FIELDS_FLGS) {
|
2001-05-19 04:34:51 +05:30
|
|
|
if (supress_non_delimited_lines) {
|
2003-03-19 14:43:01 +05:30
|
|
|
bb_error_msg_and_die("suppressing non-delimited lines makes sense"
|
2001-05-19 04:34:51 +05:30
|
|
|
" only when operating on fields");
|
|
|
|
}
|
2003-06-20 14:31:58 +05:30
|
|
|
if (delim != '\t') {
|
2003-03-19 14:43:01 +05:30
|
|
|
bb_error_msg_and_die("a delimiter may be specified only when operating on fields");
|
2001-05-19 04:34:51 +05:30
|
|
|
}
|
2000-08-03 00:00:11 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
/* argv[(optind)..(argc-1)] should be names of file to process. If no
|
|
|
|
* files were specified or '-' was specified, take input from stdin.
|
|
|
|
* Otherwise, we process all the files specified. */
|
|
|
|
if (argv[optind] == NULL || (strcmp(argv[optind], "-") == 0)) {
|
|
|
|
cut_file(stdin);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
int i;
|
|
|
|
FILE *file;
|
|
|
|
for (i = optind; i < argc; i++) {
|
2003-03-19 14:43:01 +05:30
|
|
|
file = bb_wfopen(argv[i], "r");
|
2001-08-02 10:32:46 +05:30
|
|
|
if(file) {
|
2000-08-03 00:00:11 +05:30
|
|
|
cut_file(file);
|
|
|
|
fclose(file);
|
2000-05-13 01:11:47 +05:30
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-12-01 08:25:13 +05:30
|
|
|
return EXIT_SUCCESS;
|
2000-05-13 01:11:47 +05:30
|
|
|
}
|