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.
31 #include <sys/types.h>
34 static const int ASCII = 0377;
36 /* some "globals" shared across this file */
37 static char com_fl, del_fl, sq_fl;
38 static short in_index, out_index;
39 /* these last are pointers to static buffers declared in tr_main */
40 static unsigned char *poutput, *pinput;
41 static unsigned char *pvector;
42 static char *pinvec, *poutvec;
52 if (in_index == read_chars) {
53 if ((read_chars = read(0, (char *) pinput, BUFSIZ)) <= 0) {
54 if (write(1, (char *) poutput, out_index) != out_index)
55 write(2, write_error, strlen(write_error));
60 c = pinput[in_index++];
62 if (del_fl && pinvec[c])
64 if (sq_fl && last == coded && (pinvec[c] || poutvec[coded]))
66 poutput[out_index++] = last = coded;
67 if (out_index == BUFSIZ) {
68 if (write(1, (char *) poutput, out_index) != out_index) {
69 write(2, write_error, strlen(write_error));
79 static void map(register unsigned char *string1, unsigned int string1_len,
80 register unsigned char *string2, unsigned int string2_len)
82 unsigned char last = '0';
85 for (j = 0, i = 0; i < string1_len; i++) {
87 pvector[string1[i]] = last;
89 pvector[string1[i]] = last = string2[j++];
93 /* supported constructs:
94 * Ranges, e.g., [0-9] ==> 0123456789
95 * Escapes, e.g., \a ==> Control-G
97 static unsigned int expand(const char *arg, register unsigned char *buffer)
99 unsigned char *buffer_start = buffer;
105 *buffer++ = process_escape_sequence(&arg);
106 } else if (*arg == '[') {
117 arg++; /* Skip the assumed ']' */
122 return (buffer - buffer_start);
125 static int complement(unsigned char *buffer, int buffer_len)
127 register short i, j, ix;
128 char conv[ASCII + 2];
131 for (i = 0; i <= ASCII; i++) {
132 for (j = 0; j < buffer_len; j++)
136 conv[ix++] = i & ASCII;
138 memcpy(buffer, conv, ix);
142 extern int tr_main(int argc, char **argv)
144 register unsigned char *ptr;
145 int output_length=0, input_length;
148 RESERVE_BB_BUFFER(output, BUFSIZ);
149 RESERVE_BB_BUFFER(input, BUFSIZ);
150 RESERVE_BB_UBUFFER(vector, ASCII+1);
151 RESERVE_BB_BUFFER(invec, ASCII+1);
152 RESERVE_BB_BUFFER(outvec, ASCII+1);
154 /* ... but make them available globally */
161 if (argc > 1 && argv[idx][0] == '-') {
162 for (ptr = (unsigned char *) &argv[idx][1]; *ptr; ptr++) {
179 for (i = 0; i <= ASCII; i++) {
181 invec[i] = outvec[i] = FALSE;
184 if (argv[idx] != NULL) {
185 input_length = expand(argv[idx++], input);
187 input_length = complement(input, input_length);
188 if (argv[idx] != NULL) {
189 if (*argv[idx] == '\0')
190 error_msg_and_die("STRING2 cannot be empty");
191 output_length = expand(argv[idx], output);
192 map(input, input_length, output, output_length);
194 for (i = 0; i < input_length; i++)
195 invec[(int)input[i]] = TRUE;
196 for (i = 0; i < output_length; i++)
197 outvec[(int)output[i]] = TRUE;
204 * Copyright (c) 1987,1997, Prentice Hall
205 * All rights reserved.
207 * Redistribution and use of the MINIX operating system in source and
208 * binary forms, with or without modification, are permitted provided
209 * that the following conditions are met:
211 * Redistributions of source code must retain the above copyright
212 * notice, this list of conditions and the following disclaimer.
214 * Redistributions in binary form must reproduce the above
215 * copyright notice, this list of conditions and the following
216 * disclaimer in the documentation and/or other materials provided
217 * with the distribution.
219 * Neither the name of Prentice Hall nor the names of the software
220 * authors or contributors may be used to endorse or promote
221 * products derived from this software without specific prior
222 * written permission.
224 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS, AUTHORS, AND
225 * CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
226 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
227 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
228 * IN NO EVENT SHALL PRENTICE HALL OR ANY AUTHORS OR CONTRIBUTORS BE
229 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
230 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
231 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
232 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
233 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
234 * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
235 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.