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>
33 #define BB_DECLARE_EXTERN
34 #define bb_need_write_error
37 static const int ASCII = 0377;
39 /* some glabals shared across this file */
40 static char com_fl, del_fl, sq_fl;
41 static short in_index, out_index;
42 /* these last are pointers to static buffers declared in tr_main */
43 static unsigned char *poutput, *pinput;
44 static unsigned char *pvector;
45 static char *pinvec, *poutvec;
55 if (in_index == read_chars) {
56 if ((read_chars = read(0, (char *) pinput, BUFSIZ)) <= 0) {
57 if (write(1, (char *) poutput, out_index) != out_index)
58 write(2, write_error, strlen(write_error));
63 c = pinput[in_index++];
65 if (del_fl && pinvec[c])
67 if (sq_fl && last == coded && (pinvec[c] || poutvec[coded]))
69 poutput[out_index++] = last = coded;
70 if (out_index == BUFSIZ) {
71 if (write(1, (char *) poutput, out_index) != out_index) {
72 write(2, write_error, strlen(write_error));
82 static void map(register unsigned char *string1, unsigned int string1_len,
83 register unsigned char *string2, unsigned int string2_len)
85 unsigned char last = '0';
88 for (j = 0, i = 0; i < string1_len; i++) {
90 pvector[string1[i]] = last;
92 pvector[string1[i]] = last = string2[j++];
96 static unsigned int expand(char *arg, register unsigned char *buffer)
98 unsigned char *buffer_start = buffer;
104 *buffer++ = process_escape_sequence(&arg);
105 } else if (*arg == '[') {
116 arg++; /* Skip ']' */
121 return (buffer - buffer_start);
124 static int complement(unsigned char *buffer, int buffer_len)
126 register short i, j, index;
127 char conv[ASCII + 2];
130 for (i = 0; i <= ASCII; i++) {
131 for (j = 0; j < buffer_len; j++)
135 conv[index++] = i & ASCII;
137 memcpy(buffer, conv, index);
141 extern int tr_main(int argc, char **argv)
143 register unsigned char *ptr;
144 int output_length=0, input_length;
147 RESERVE_BB_BUFFER(output, BUFSIZ);
148 RESERVE_BB_BUFFER(input, BUFSIZ);
149 RESERVE_BB_UBUFFER(vector, ASCII+1);
150 RESERVE_BB_BUFFER(invec, ASCII+1);
151 RESERVE_BB_BUFFER(outvec, ASCII+1);
153 /* ... but make them available globally */
160 if (argc > 1 && argv[index][0] == '-') {
161 for (ptr = (unsigned char *) &argv[index][1]; *ptr; ptr++) {
178 for (i = 0; i <= ASCII; i++) {
180 invec[i] = outvec[i] = FALSE;
183 if (argv[index] != NULL) {
184 input_length = expand(argv[index++], input);
186 input_length = complement(input, input_length);
187 if (argv[index] != NULL) {
188 if (*argv[index] == '\0')
189 error_msg_and_die("STRING2 cannot be empty");
190 output_length = expand(argv[index], output);
191 map(input, input_length, output, output_length);
193 for (i = 0; i < input_length; i++)
194 invec[(int)input[i]] = TRUE;
195 for (i = 0; i < output_length; i++)
196 outvec[(int)output[i]] = TRUE;
203 * Copyright (c) 1987,1997, Prentice Hall
204 * All rights reserved.
206 * Redistribution and use of the MINIX operating system in source and
207 * binary forms, with or without modification, are permitted provided
208 * that the following conditions are met:
210 * Redistributions of source code must retain the above copyright
211 * notice, this list of conditions and the following disclaimer.
213 * Redistributions in binary form must reproduce the above
214 * copyright notice, this list of conditions and the following
215 * disclaimer in the documentation and/or other materials provided
216 * with the distribution.
218 * Neither the name of Prentice Hall nor the names of the software
219 * authors or contributors may be used to endorse or promote
220 * products derived from this software without specific prior
221 * written permission.
223 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS, AUTHORS, AND
224 * CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
225 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
226 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
227 * IN NO EVENT SHALL PRENTICE HALL OR ANY AUTHORS OR CONTRIBUTORS BE
228 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
229 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
230 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
231 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
232 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
233 * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
234 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.