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 <andersen@codepoet.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>
37 /* some "globals" shared across this file */
38 static char com_fl, del_fl, sq_fl;
39 static short in_index, out_index;
40 /* these last are pointers to static buffers declared in tr_main */
41 static unsigned char *poutput;
42 static unsigned char *pvector;
43 static unsigned char *pinvec, *poutvec;
45 #define input bb_common_bufsiz1
47 static void convert(void)
54 if (in_index == read_chars) {
55 if ((read_chars = read(0, input, BUFSIZ)) <= 0) {
56 if (write(1, (char *) poutput, out_index) != out_index)
57 bb_error_msg(bb_msg_write_error);
62 c = input[in_index++];
64 if (del_fl && pinvec[c])
66 if (sq_fl && last == coded && (pinvec[c] || poutvec[coded]))
68 poutput[out_index++] = last = coded;
69 if (out_index == BUFSIZ) {
70 if (write(1, (char *) poutput, out_index) != out_index)
71 bb_error_msg_and_die(bb_msg_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
96 * Character classes, e.g. [:upper:] ==> A ... Z
98 static unsigned int expand(const char *arg, register unsigned char *buffer)
100 unsigned char *buffer_start = buffer;
106 *buffer++ = bb_process_escape_sequence(&arg);
107 } else if (*(arg+1) == '-') {
116 arg += 3; /* Skip the assumed a-z */
117 } else if (*arg == '[') {
120 if (ENABLE_FEATURE_TR_CLASSES && i == ':') {
121 if (strncmp(arg, "alpha", 5) == 0) {
122 for (i = 'A'; i <= 'Z'; i++)
124 for (i = 'a'; i <= 'z'; i++)
127 else if (strncmp(arg, "alnum", 5) == 0) {
128 for (i = '0'; i <= '9'; i++)
130 for (i = 'A'; i <= 'Z'; i++)
132 for (i = 'a'; i <= 'z'; i++)
135 else if (strncmp(arg, "digit", 5) == 0)
136 for (i = '0'; i <= '9'; i++)
138 else if (strncmp(arg, "lower", 5) == 0)
139 for (i = 'a'; i <= 'z'; i++)
141 else if (strncmp(arg, "upper", 5) == 0)
142 for (i = 'A'; i <= 'Z'; i++)
144 else if (strncmp(arg, "space", 5) == 0) {
145 const char s[] = "\t\n\v\f\r ";
146 strcat((char*)buffer, s);
147 buffer += sizeof(s) - 1;
149 else if (strncmp(arg, "blank", 5) == 0) {
153 /* gcc gives a warning if braces aren't used here */
154 else if (strncmp(arg, "punct", 5) == 0) {
155 for (i = 0; i <= ASCII; i++)
156 if (isprint(i) && (!isalnum(i)) && (!isspace(i)))
159 else if (strncmp(arg, "cntrl", 5) == 0) {
160 for (i = 0; i <= ASCII; i++)
171 if (ENABLE_FEATURE_TR_EQUIV && i == '=') {
173 /* skip the closing =] */
185 arg++; /* Skip the assumed ']' */
190 return (buffer - buffer_start);
193 static int complement(unsigned char *buffer, int buffer_len)
195 register short i, j, ix;
196 char conv[ASCII + 2];
199 for (i = 0; i <= ASCII; i++) {
200 for (j = 0; j < buffer_len; j++)
204 conv[ix++] = i & ASCII;
206 memcpy(buffer, conv, ix);
210 int tr_main(int argc, char **argv)
212 register unsigned char *ptr;
213 int output_length=0, input_length;
216 RESERVE_CONFIG_BUFFER(output, BUFSIZ);
217 RESERVE_CONFIG_BUFFER(vector, ASCII+1);
218 RESERVE_CONFIG_BUFFER(invec, ASCII+1);
219 RESERVE_CONFIG_BUFFER(outvec, ASCII+1);
221 /* ... but make them available globally */
222 poutput = (unsigned char*)output;
223 pvector = (unsigned char*)vector;
224 pinvec = (unsigned char*)invec;
225 poutvec = (unsigned char*)outvec;
227 if (argc > 1 && argv[idx][0] == '-') {
228 for (ptr = (unsigned char *) &argv[idx][1]; *ptr; ptr++) {
245 for (i = 0; i <= ASCII; i++) {
247 invec[i] = outvec[i] = FALSE;
250 if (argv[idx] != NULL) {
251 input_length = expand(argv[idx++], (unsigned char*)input);
253 input_length = complement((unsigned char*)input, input_length);
254 if (argv[idx] != NULL) {
255 if (*argv[idx] == '\0')
256 bb_error_msg_and_die("STRING2 cannot be empty");
257 output_length = expand(argv[idx], (unsigned char*)output);
258 map((unsigned char*)input, input_length, (unsigned char*)output, output_length);
260 for (i = 0; i < input_length; i++)
261 invec[(unsigned char)input[i]] = TRUE;
262 for (i = 0; i < output_length; i++)
263 outvec[(unsigned char)output[i]] = TRUE;
270 * Copyright (c) 1987,1997, Prentice Hall
271 * All rights reserved.
273 * Redistribution and use of the MINIX operating system in source and
274 * binary forms, with or without modification, are permitted provided
275 * that the following conditions are met:
277 * Redistributions of source code must retain the above copyright
278 * notice, this list of conditions and the following disclaimer.
280 * Redistributions in binary form must reproduce the above
281 * copyright notice, this list of conditions and the following
282 * disclaimer in the documentation and/or other materials provided
283 * with the distribution.
285 * Neither the name of Prentice Hall nor the names of the software
286 * authors or contributors may be used to endorse or promote
287 * products derived from this software without specific prior
288 * written permission.
290 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS, AUTHORS, AND
291 * CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
292 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
293 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
294 * IN NO EVENT SHALL PRENTICE HALL OR ANY AUTHORS OR CONTRIBUTORS BE
295 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
296 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
297 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
298 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
299 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
300 * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
301 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.