1 /* vi: set sw=4 ts=4: */
3 * Mini tr implementation for busybox
5 * Copyright (c) Michiel Huisjes
7 * This version of tr is adapted from Minix tr 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.
32 #include <sys/types.h>
33 #define BB_DECLARE_EXTERN
34 #define bb_need_write_error
37 const char *tr_usage="tr [-cds] STRING1 [STRING2]\n"
38 #ifndef BB_FEATURE_TRIVIAL_HELP
39 "\nTranslate, squeeze, and/or delete characters from\n"
40 "standard input, writing to standard output.\n\n"
42 "\t-c\ttake complement of STRING1\n"
43 "\t-d\tdelete input characters coded STRING1\n"
44 "\t-s\tsqueeze multiple output characters of STRING2 into one character\n"
59 /* some glabals shared across this file */
60 static char com_fl, del_fl, sq_fl;
61 static unsigned char output[BUFSIZ], input[BUFSIZ];
62 static unsigned char vector[ASCII + 1];
63 static char invec[ASCII + 1], outvec[ASCII + 1];
64 static short in_index, out_index;
74 if (in_index == read_chars) {
75 if ((read_chars = read(0, (char *) input, BUFSIZ)) <= 0) {
76 if (write(1, (char *) output, out_index) != out_index)
77 write(2, write_error, strlen(write_error));
82 c = input[in_index++];
84 if (del_fl && invec[c])
86 if (sq_fl && last == coded && outvec[coded])
88 output[out_index++] = last = coded;
89 if (out_index == BUFSIZ) {
90 if (write(1, (char *) output, out_index) != out_index) {
91 write(2, write_error, strlen(write_error));
101 static void map(register unsigned char *string1, register unsigned char *string2)
103 unsigned char last = '0';
106 if (*string2 == '\0')
107 vector[*string1] = last;
109 vector[*string1] = last = *string2++;
114 static void expand(register char *arg, register unsigned char *buffer)
122 if (*arg >= '0' && *arg <= '7') {
124 ac = (ac << 3) + *arg++ - '0';
126 } while (i < 4 && *arg >= '0' && *arg <= '7');
128 } else if (*arg != '\0')
130 } else if (*arg == '[') {
141 arg++; /* Skip ']' */
147 static void complement(unsigned char *buffer)
149 register unsigned char *ptr;
150 register short i, index;
151 unsigned char conv[ASCII + 2];
154 for (i = 1; i <= ASCII; i++) {
155 for (ptr = buffer; *ptr; ptr++)
159 conv[index++] = i & ASCII;
162 strcpy((char *) buffer, (char *) conv);
165 extern int tr_main(int argc, char **argv)
167 register unsigned char *ptr;
171 if (argc > 1 && argv[index][0] == '-') {
172 for (ptr = (unsigned char *) &argv[index][1]; *ptr; ptr++) {
189 for (i = 0; i <= ASCII; i++) {
191 invec[i] = outvec[i] = FALSE;
194 if (argv[index] != NULL) {
195 expand(argv[index++], input);
198 if (argv[index] != NULL)
199 expand(argv[index], output);
200 if (argv[index] != NULL)
202 for (ptr = input; *ptr; ptr++)
204 for (ptr = output; *ptr; ptr++)
212 * Copyright (c) 1987,1997, Prentice Hall
213 * All rights reserved.
215 * Redistribution and use of the MINIX operating system in source and
216 * binary forms, with or without modification, are permitted provided
217 * that the following conditions are met:
219 * Redistributions of source code must retain the above copyright
220 * notice, this list of conditions and the following disclaimer.
222 * Redistributions in binary form must reproduce the above
223 * copyright notice, this list of conditions and the following
224 * disclaimer in the documentation and/or other materials provided
225 * with the distribution.
227 * Neither the name of Prentice Hall nor the names of the software
228 * authors or contributors may be used to endorse or promote
229 * products derived from this software without specific prior
230 * written permission.
232 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS, AUTHORS, AND
233 * CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
234 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
235 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
236 * IN NO EVENT SHALL PRENTICE HALL OR ANY AUTHORS OR CONTRIBUTORS BE
237 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
238 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
239 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
240 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
241 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
242 * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
243 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.