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, unsigned int string1_len,
102 register unsigned char *string2, unsigned int string2_len)
104 unsigned char last = '0';
107 for (j = 0, i = 0; i < string1_len; i++) {
108 if (string2_len <= j)
109 vector[string1[i]] = last;
111 vector[string1[i]] = last = string2[j++];
115 static unsigned int expand(char *arg, register unsigned char *buffer)
117 unsigned char *buffer_start = buffer;
123 *buffer++ = process_escape_sequence(&arg);
124 } else if (*arg == '[') {
135 arg++; /* Skip ']' */
140 return (buffer - buffer_start);
143 static int complement(unsigned char *buffer, int buffer_len)
145 register short i, j, index;
146 char conv[ASCII + 2];
149 for (i = 0; i <= ASCII; i++) {
150 for (j = 0; j < buffer_len; j++)
154 conv[index++] = i & ASCII;
156 memcpy(buffer, conv, index);
160 extern int tr_main(int argc, char **argv)
162 register unsigned char *ptr;
163 int output_length=0, input_length;
167 if (argc > 1 && argv[index][0] == '-') {
168 for (ptr = (unsigned char *) &argv[index][1]; *ptr; ptr++) {
185 for (i = 0; i <= ASCII; i++) {
187 invec[i] = outvec[i] = FALSE;
190 if (argv[index] != NULL) {
191 input_length = expand(argv[index++], input);
193 input_length = complement(input, input_length);
194 if (argv[index] != NULL) {
195 if (*argv[index] == '\0')
196 fatalError("STRING2 cannot be empty\n");
197 output_length = expand(argv[index], output);
198 map(input, input_length, output, output_length);
200 for (i = 0; i < input_length; i++)
201 invec[input[i]] = TRUE;
202 for (i = 0; i < output_length; i++)
203 outvec[output[i]] = TRUE;
210 * Copyright (c) 1987,1997, Prentice Hall
211 * All rights reserved.
213 * Redistribution and use of the MINIX operating system in source and
214 * binary forms, with or without modification, are permitted provided
215 * that the following conditions are met:
217 * Redistributions of source code must retain the above copyright
218 * notice, this list of conditions and the following disclaimer.
220 * Redistributions in binary form must reproduce the above
221 * copyright notice, this list of conditions and the following
222 * disclaimer in the documentation and/or other materials provided
223 * with the distribution.
225 * Neither the name of Prentice Hall nor the names of the software
226 * authors or contributors may be used to endorse or promote
227 * products derived from this software without specific prior
228 * written permission.
230 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS, AUTHORS, AND
231 * CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
232 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
233 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
234 * IN NO EVENT SHALL PRENTICE HALL OR ANY AUTHORS OR CONTRIBUTORS BE
235 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
236 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
237 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
238 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
239 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
240 * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
241 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.