1 /* vi: set sw=4 ts=4: */
3 * cut implementation for busybox
5 * Copyright (c) Michael J. Holme
7 * This version of cut is adapted from Minix cut and was modified
8 * by Erik Andersen <andersee@debian.org> to be used in busybox.
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation; either version 2 of the License, or
13 * (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with this program; if not, write to the Free Software
22 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
24 * Original copyright notice is retained at the end of this file.
28 #include <sys/types.h>
34 #define BB_DECLARE_EXTERN
38 #define MAX_FIELD 80 /* Pointers to the beginning of each field
39 * are stored in columns[], if a line holds
40 * more than MAX_FIELD columns the array
41 * boundary is exceed. But unlikely at 80 */
43 #define MAX_ARGS 32 /* Maximum number of fields following -f or
45 int args[MAX_ARGS * 2];
48 /* Lots of new defines, should easen maintainance... */
49 #define DUMP_STDIN 0 /* define for mode: no options */
50 #define OPTIONF 1 /* define for mode: option -f */
51 #define OPTIONC 2 /* define for mode: option -c */
52 #define OPTIONB 3 /* define for mode: option -b */
53 #define NOTSET 0 /* option not selected */
54 #define SET 1 /* option selected */
55 #define OPTIONS 1 /*define option -s */
56 /* Defines for the warnings */
57 #define DELIMITER_NOT_APPLICABLE 0
58 #define OVERRIDING_PREVIOUS_MODE 1
59 #define OPTION_NOT_APPLICABLE 2
60 #define UNKNOWN_OPTION 3
61 #define FILE_NOT_READABLE 4
62 /* Defines for the fatal errors */
63 #define SYNTAX_ERROR 101
64 #define POSITION_ERROR 102
65 #define LINE_TO_LONG_ERROR 103
66 #define RANGE_ERROR 104
67 #define MAX_FIELDS_EXEEDED_ERROR 105
68 #define MAX_ARGS_EXEEDED_ERROR 106
71 int mode; /* 0 = dump stdin to stdout, 1=-f, 2=-c */
72 char delim = '\t'; /* default delimiting character */
77 int option = 0; /* for -s option */
79 int cut_main(int argc, char **argv);
80 void warn(int warn_number, char *option);
81 void cuterror(int err);
85 void warn(int warn_number, char *option)
87 static char *warn_msg[] = {
88 "%s: Option -%s allowed only with -f\n",
89 "%s: -%s overrides earlier option\n",
90 "%s: -%s not allowed in current mode\n",
91 "%s: Cannot open %s\n"
94 fprintf(stderr, warn_msg[warn_number], name, option);
95 exit_status = warn_number + 1;
99 void cuterror(int err)
101 static char *err_mes[] = {
102 "%s: syntax error\n",
103 "%s: position must be >0\n",
104 "%s: line longer than BUFSIZ\n",
105 "%s: range must not decrease from left to right\n",
106 "%s: MAX_FIELD exceeded\n",
107 "%s: MAX_ARGS exceeded\n"
110 fprintf(stderr, err_mes[err - 101], name);
123 if (num_args == MAX_ARGS)
124 cuterror(MAX_ARGS_EXEEDED_ERROR);
125 if (!isdigit(line[i]) && line[i] != '-')
126 cuterror(SYNTAX_ERROR);
129 args[arg_ptr + 1] = BUFSIZ;
132 while (line[i] != ',' && line[i] != 0) {
133 if (isdigit(line[i])) {
135 while (isdigit(line[i]))
136 args[arg_ptr] = 10 * args[arg_ptr] + line[i++] - '0';
138 cuterror(POSITION_ERROR);
141 if (line[i] == '-') {
147 if (flag && arg_ptr & 1)
148 args[arg_ptr] = args[arg_ptr - 1];
149 if (args[num_args * 2] > args[num_args * 2 + 1])
150 cuterror(RANGE_ERROR);
152 arg_ptr = num_args * 2;
160 int i, j, length, maxcol=0;
161 char *columns[MAX_FIELD];
163 while (fgets(line, BUFSIZ, fd)) {
165 length = strlen(line) - 1;
166 *(line + length) = 0;
172 columns[maxcol++] = line;
173 for (i = 0; i < length; i++) {
174 if (*(line + i) == delim) {
176 if (maxcol == MAX_FIELD)
177 cuterror(MAX_FIELDS_EXEEDED_ERROR);
178 columns[maxcol] = line + i + 1;
183 for (i = 0; i < num_args; i++) {
184 for (j = args[i * 2]; j <= args[i * 2 + 1]; j++)
187 printf("%s", columns[j - 1]);
189 if (i != num_args - 1 || j != args[i * 2 + 1])
193 } else if (option != OPTIONS) {
198 for (i = 0; i < num_args; i++) {
199 for (j = args[i * 2];
200 j <= (args[i * 2 + 1] >
201 length ? length : args[i * 2 + 1]); j++)
202 putchar(*(line + j - 1));
211 int cut_main(int argc, char **argv)
214 int numberFilenames = 0;
218 if (argc == 1 || strcmp(argv[1], dash_dash_help)==0)
219 usage( "cut [OPTION]... [FILE]...\n"
220 #ifndef BB_FEATURE_TRIVIAL_HELP
221 "\nPrints selected fields from each input FILE to standard output.\n\n"
223 "\t-b LIST\tOutput only bytes from LIST\n"
224 "\t-c LIST\tOutput only characters from LIST\n"
225 "\t-d CHAR\tUse CHAR instead of tab as the field delimiter\n"
226 "\t-s\tOnly output Lines if the include DELIM\n"
227 "\t-f N\tPrint only these fields\n"
233 if (argv[i][0] == '-') {
234 switch (argv[i++][1]) {
236 if (mode == OPTIONC || mode == OPTIONB)
237 warn(DELIMITER_NOT_APPLICABLE, "d");
239 delim = argv[i++][0];
241 cuterror(SYNTAX_ERROR);
244 sprintf(line, "%s", argv[i++]);
245 if (mode == OPTIONC || mode == OPTIONB)
246 warn(OVERRIDING_PREVIOUS_MODE, "f");
250 sprintf(line, "%s", argv[i++]);
251 if (mode == OPTIONF || mode == OPTIONC)
252 warn(OVERRIDING_PREVIOUS_MODE, "b");
256 sprintf(line, "%s", argv[i++]);
257 if (mode == OPTIONF || mode == OPTIONB)
258 warn(OVERRIDING_PREVIOUS_MODE, "c");
265 case '\0': /* - means: read from stdin */
268 case 'n': /* needed for Posix, but no effect here */
270 warn(OPTION_NOT_APPLICABLE, "n");
273 warn(UNKNOWN_OPTION, &(argv[i - 1][1]));
281 /* Here follow the checks, if the selected options are reasonable. */
282 if (mode == OPTIONB) /* since in Minix char := byte */
285 if (mode != OPTIONF && option == OPTIONS)
286 warn(DELIMITER_NOT_APPLICABLE,"s");
288 if (numberFilenames != 0) {
291 if (argv[i][0] == '-') {
292 switch (argv[i][1]) {
313 if ((fd = fopen(argv[i++], "r")) == NULL) {
314 warn(FILE_NOT_READABLE, argv[i - 1]);
329 /* cut - extract columns from a file or stdin. Author: Michael J. Holme
331 * Copyright 1989, Michael John Holme, All rights reserved.
332 * This code may be freely distributed, provided that this notice
335 * V1.1: 6th September 1989
337 * Bugs, criticisms, etc,
339 * JANET sq79@uk.ac.liv
340 * ARPA sq79%liv.ac.uk@nsfnet-relay.ac.uk
341 * UUCP ...!mcvax!ukc!liv.ac.uk!sq79
342 *-------------------------------------------------------------------------
343 * Changed for POSIX1003.2/Draft10 conformance
344 * Thomas Brupbacher (tobr@mw.lpc.ethz.ch), September 1990.
346 * - separation of error messages ( stderr) and output (stdout).
347 * - support for -b and -n (no effect, -b acts as -c)
349 *-------------------------------------------------------------------------
353 * Copyright (c) 1987,1997, Prentice Hall
354 * All rights reserved.
356 * Redistribution and use of the MINIX operating system in source and
357 * binary forms, with or without modification, are permitted provided
358 * that the following conditions are met:
360 * Redistributions of source code must retain the above copyright
361 * notice, this list of conditions and the following disclaimer.
363 * Redistributions in binary form must reproduce the above
364 * copyright notice, this list of conditions and the following
365 * disclaimer in the documentation and/or other materials provided
366 * with the distribution.
368 * Neither the name of Prentice Hall nor the names of the software
369 * authors or contributors may be used to endorse or promote
370 * products derived from this software without specific prior
371 * written permission.
373 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS, AUTHORS, AND
374 * CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
375 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
376 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
377 * IN NO EVENT SHALL PRENTICE HALL OR ANY AUTHORS OR CONTRIBUTORS BE
378 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
379 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
380 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
381 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
382 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
383 * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
384 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.