blob: 004092477e9e1667bf1fd58ba94572445936fd75 [file] [log] [blame]
Erik Andersenfb002d02000-03-05 08:07:00 +00001/* vi: set sw=4 ts=4: */
2/*
Erik Andersen8f8d6d52000-05-01 22:30:37 +00003 * Mini tr implementation for busybox
Erik Andersenfb002d02000-03-05 08:07:00 +00004 *
Erik Andersen5afc8642000-05-02 00:07:56 +00005 * Copyright (c) Michiel Huisjes
6 *
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.
Erik Andersenfb002d02000-03-05 08:07:00 +00009 *
Erik Andersen8f8d6d52000-05-01 22:30:37 +000010 * 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.
14 *
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.
19 *
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
23 *
24 * Original copyright notice is retained at the end of this file.
Erik Andersenfb002d02000-03-05 08:07:00 +000025 */
26
Erik Andersenfb002d02000-03-05 08:07:00 +000027#include "internal.h"
Erik Andersenfb002d02000-03-05 08:07:00 +000028#include <stdio.h>
Erik Andersenfb002d02000-03-05 08:07:00 +000029#include <string.h>
Erik Andersen8f8d6d52000-05-01 22:30:37 +000030#include <stdlib.h>
Erik Andersenfb002d02000-03-05 08:07:00 +000031#include <unistd.h>
Erik Andersen8f8d6d52000-05-01 22:30:37 +000032#include <sys/types.h>
Erik Andersen330fd2b2000-05-19 05:35:19 +000033#define BB_DECLARE_EXTERN
34#define bb_need_write_error
35#include "messages.c"
36
Erik Andersen8f8d6d52000-05-01 22:30:37 +000037#ifdef TRUE
38#undef TRUE
39#undef FALSE
40#define TRUE 1
41#define FALSE 0
42#endif
Erik Andersenfb002d02000-03-05 08:07:00 +000043
Erik Andersen8f8d6d52000-05-01 22:30:37 +000044#define ASCII 0377
Erik Andersenfb002d02000-03-05 08:07:00 +000045
Erik Andersen8f8d6d52000-05-01 22:30:37 +000046/* some glabals shared across this file */
47static char com_fl, del_fl, sq_fl;
48static unsigned char output[BUFSIZ], input[BUFSIZ];
49static unsigned char vector[ASCII + 1];
50static char invec[ASCII + 1], outvec[ASCII + 1];
51static short in_index, out_index;
Erik Andersenfb002d02000-03-05 08:07:00 +000052
Erik Andersenfb002d02000-03-05 08:07:00 +000053
Erik Andersen8f8d6d52000-05-01 22:30:37 +000054static void convert()
Erik Andersenfb002d02000-03-05 08:07:00 +000055{
Erik Andersen8f8d6d52000-05-01 22:30:37 +000056 short read_chars = 0;
57 short c, coded;
58 short last = -1;
Erik Andersenfb002d02000-03-05 08:07:00 +000059
Erik Andersen8f8d6d52000-05-01 22:30:37 +000060 for (;;) {
61 if (in_index == read_chars) {
62 if ((read_chars = read(0, (char *) input, BUFSIZ)) <= 0) {
63 if (write(1, (char *) output, out_index) != out_index)
Erik Andersen330fd2b2000-05-19 05:35:19 +000064 write(2, write_error, strlen(write_error));
Erik Andersen8f8d6d52000-05-01 22:30:37 +000065 exit(0);
Erik Andersenfb002d02000-03-05 08:07:00 +000066 }
Erik Andersen8f8d6d52000-05-01 22:30:37 +000067 in_index = 0;
68 }
69 c = input[in_index++];
70 coded = vector[c];
71 if (del_fl && invec[c])
72 continue;
73 if (sq_fl && last == coded && outvec[coded])
74 continue;
75 output[out_index++] = last = coded;
76 if (out_index == BUFSIZ) {
77 if (write(1, (char *) output, out_index) != out_index) {
Erik Andersen330fd2b2000-05-19 05:35:19 +000078 write(2, write_error, strlen(write_error));
Erik Andersen8f8d6d52000-05-01 22:30:37 +000079 exit(1);
Erik Andersenfb002d02000-03-05 08:07:00 +000080 }
Erik Andersen8f8d6d52000-05-01 22:30:37 +000081 out_index = 0;
82 }
Erik Andersenfb002d02000-03-05 08:07:00 +000083 }
84
Erik Andersenfb002d02000-03-05 08:07:00 +000085 /* NOTREACHED */
Erik Andersen8f8d6d52000-05-01 22:30:37 +000086}
87
Eric Andersen00143ba2000-07-13 16:40:41 +000088static void map(register unsigned char *string1, unsigned int string1_len,
89 register unsigned char *string2, unsigned int string2_len)
Erik Andersen8f8d6d52000-05-01 22:30:37 +000090{
91 unsigned char last = '0';
Eric Andersen00143ba2000-07-13 16:40:41 +000092 unsigned int i, j;
Erik Andersen8f8d6d52000-05-01 22:30:37 +000093
Eric Andersen00143ba2000-07-13 16:40:41 +000094 for (j = 0, i = 0; i < string1_len; i++) {
95 if (string2_len <= j)
96 vector[string1[i]] = last;
Erik Andersen8f8d6d52000-05-01 22:30:37 +000097 else
Eric Andersen00143ba2000-07-13 16:40:41 +000098 vector[string1[i]] = last = string2[j++];
Erik Andersen8f8d6d52000-05-01 22:30:37 +000099 }
100}
101
Eric Andersen00143ba2000-07-13 16:40:41 +0000102static unsigned int expand(char *arg, register unsigned char *buffer)
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000103{
Eric Andersen00143ba2000-07-13 16:40:41 +0000104 unsigned char *buffer_start = buffer;
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000105 int i, ac;
106
107 while (*arg) {
108 if (*arg == '\\') {
109 arg++;
Eric Andersenf7cf2f72000-07-05 17:26:35 +0000110 *buffer++ = process_escape_sequence(&arg);
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000111 } else if (*arg == '[') {
112 arg++;
113 i = *arg++;
114 if (*arg++ != '-') {
115 *buffer++ = '[';
116 arg -= 2;
117 continue;
118 }
119 ac = *arg++;
120 while (i <= ac)
121 *buffer++ = i++;
122 arg++; /* Skip ']' */
123 } else
124 *buffer++ = *arg++;
125 }
Eric Andersen00143ba2000-07-13 16:40:41 +0000126
127 return (buffer - buffer_start);
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000128}
129
Eric Andersenfad04fd2000-07-14 06:49:52 +0000130static int complement(unsigned char *buffer, int buffer_len)
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000131{
Eric Andersen00143ba2000-07-13 16:40:41 +0000132 register short i, j, index;
Eric Andersenfad04fd2000-07-14 06:49:52 +0000133 char conv[ASCII + 2];
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000134
135 index = 0;
Eric Andersen00143ba2000-07-13 16:40:41 +0000136 for (i = 0; i <= ASCII; i++) {
137 for (j = 0; j < buffer_len; j++)
138 if (buffer[j] == i)
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000139 break;
Eric Andersen00143ba2000-07-13 16:40:41 +0000140 if (j == buffer_len)
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000141 conv[index++] = i & ASCII;
142 }
Eric Andersen00143ba2000-07-13 16:40:41 +0000143 memcpy(buffer, conv, index);
144 return index;
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000145}
146
147extern int tr_main(int argc, char **argv)
148{
149 register unsigned char *ptr;
Eric Andersenfad04fd2000-07-14 06:49:52 +0000150 int output_length=0, input_length;
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000151 int index = 1;
Eric Andersenfad04fd2000-07-14 06:49:52 +0000152 int i;
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000153
154 if (argc > 1 && argv[index][0] == '-') {
155 for (ptr = (unsigned char *) &argv[index][1]; *ptr; ptr++) {
156 switch (*ptr) {
157 case 'c':
158 com_fl = TRUE;
159 break;
160 case 'd':
161 del_fl = TRUE;
162 break;
163 case 's':
164 sq_fl = TRUE;
165 break;
166 default:
Erik Andersen330fd2b2000-05-19 05:35:19 +0000167 usage(tr_usage);
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000168 }
169 }
170 index++;
171 }
172 for (i = 0; i <= ASCII; i++) {
173 vector[i] = i;
174 invec[i] = outvec[i] = FALSE;
175 }
176
177 if (argv[index] != NULL) {
Eric Andersen00143ba2000-07-13 16:40:41 +0000178 input_length = expand(argv[index++], input);
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000179 if (com_fl)
Eric Andersen00143ba2000-07-13 16:40:41 +0000180 input_length = complement(input, input_length);
Eric Andersena03d86c2000-07-10 16:38:50 +0000181 if (argv[index] != NULL) {
182 if (*argv[index] == '\0')
Matt Kraaibe84cd42000-07-12 17:02:35 +0000183 fatalError("STRING2 cannot be empty\n");
Eric Andersen00143ba2000-07-13 16:40:41 +0000184 output_length = expand(argv[index], output);
185 map(input, input_length, output, output_length);
Eric Andersena03d86c2000-07-10 16:38:50 +0000186 }
Eric Andersen00143ba2000-07-13 16:40:41 +0000187 for (i = 0; i < input_length; i++)
188 invec[input[i]] = TRUE;
189 for (i = 0; i < output_length; i++)
190 outvec[output[i]] = TRUE;
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000191 }
192 convert();
Erik Andersenfb002d02000-03-05 08:07:00 +0000193 return (0);
194}
195
Erik Andersenfb002d02000-03-05 08:07:00 +0000196/*
Erik Andersen8f8d6d52000-05-01 22:30:37 +0000197 * Copyright (c) 1987,1997, Prentice Hall
198 * All rights reserved.
199 *
200 * Redistribution and use of the MINIX operating system in source and
201 * binary forms, with or without modification, are permitted provided
202 * that the following conditions are met:
203 *
204 * Redistributions of source code must retain the above copyright
205 * notice, this list of conditions and the following disclaimer.
206 *
207 * Redistributions in binary form must reproduce the above
208 * copyright notice, this list of conditions and the following
209 * disclaimer in the documentation and/or other materials provided
210 * with the distribution.
211 *
212 * Neither the name of Prentice Hall nor the names of the software
213 * authors or contributors may be used to endorse or promote
214 * products derived from this software without specific prior
215 * written permission.
216 *
217 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS, AUTHORS, AND
218 * CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
219 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
220 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
221 * IN NO EVENT SHALL PRENTICE HALL OR ANY AUTHORS OR CONTRIBUTORS BE
222 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
223 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
224 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
225 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
226 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
227 * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
228 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
229 *
Erik Andersenfb002d02000-03-05 08:07:00 +0000230 */
Erik Andersenfb002d02000-03-05 08:07:00 +0000231