tr.c revision 118399 
1/*
2 * Copyright (c) 1988, 1993
3 *	The Regents of the University of California.  All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 *    must display the following acknowledgement:
15 *	This product includes software developed by the University of
16 *	California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 *    may be used to endorse or promote products derived from this software
19 *    without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34#include <sys/cdefs.h>
35
36__FBSDID("$FreeBSD: head/usr.bin/tr/tr.c 118399 2003-08-03 22:02:49Z ache $");
37
38#ifndef lint
39static const char copyright[] =
40"@(#) Copyright (c) 1988, 1993\n\
41	The Regents of the University of California.  All rights reserved.\n";
42#endif
43
44#ifndef lint
45static const char sccsid[] = "@(#)tr.c	8.2 (Berkeley) 5/4/95";
46#endif
47
48#include <sys/types.h>
49
50#include <ctype.h>
51#include <err.h>
52#include <locale.h>
53#include <stdio.h>
54#include <stdlib.h>
55#include <string.h>
56#include <unistd.h>
57
58#include "extern.h"
59
60/*
61 * For -C option: determine whether a byte is a valid character in the
62 * current character set (as defined by LC_CTYPE).
63 */
64#define ISCHAR(c) (iscntrl(c) || isprint(c))
65
66static int string1[NCHARS] = {
67	0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07,		/* ASCII */
68	0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f,
69	0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17,
70	0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f,
71	0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27,
72	0x28, 0x29, 0x2a, 0x2b, 0x2c, 0x2d, 0x2e, 0x2f,
73	0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37,
74	0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f,
75	0x40, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47,
76	0x48, 0x49, 0x4a, 0x4b, 0x4c, 0x4d, 0x4e, 0x4f,
77	0x50, 0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57,
78	0x58, 0x59, 0x5a, 0x5b, 0x5c, 0x5d, 0x5e, 0x5f,
79	0x60, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67,
80	0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e, 0x6f,
81	0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
82	0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f,
83	0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87,
84	0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x8e, 0x8f,
85	0x90, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97,
86	0x98, 0x99, 0x9a, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f,
87	0xa0, 0xa1, 0xa2, 0xa3, 0xa4, 0xa5, 0xa6, 0xa7,
88	0xa8, 0xa9, 0xaa, 0xab, 0xac, 0xad, 0xae, 0xaf,
89	0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7,
90	0xb8, 0xb9, 0xba, 0xbb, 0xbc, 0xbd, 0xbe, 0xbf,
91	0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5, 0xc6, 0xc7,
92	0xc8, 0xc9, 0xca, 0xcb, 0xcc, 0xcd, 0xce, 0xcf,
93	0xd0, 0xd1, 0xd2, 0xd3, 0xd4, 0xd5, 0xd6, 0xd7,
94	0xd8, 0xd9, 0xda, 0xdb, 0xdc, 0xdd, 0xde, 0xdf,
95	0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7,
96	0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef,
97	0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7,
98	0xf8, 0xf9, 0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xff,
99}, string2[NCHARS];
100
101STR s1 = { STRING1, NORMAL, 0, OOBCH, { 0, OOBCH }, NULL, NULL };
102STR s2 = { STRING2, NORMAL, 0, OOBCH, { 0, OOBCH }, NULL, NULL };
103
104static void setup(int *, char *, STR *, int, int);
105static void usage(void);
106
107int
108main(int argc, char **argv)
109{
110	static int carray[NCHARS];
111	int ch, cnt, n, lastch, *p;
112	int Cflag, cflag, dflag, sflag, isstring2;
113
114	(void)setlocale(LC_ALL, "");
115
116	Cflag = cflag = dflag = sflag = 0;
117	while ((ch = getopt(argc, argv, "Ccdsu")) != -1)
118		switch((char)ch) {
119		case 'C':
120			Cflag = 1;
121			cflag = 0;
122			break;
123		case 'c':
124			cflag = 1;
125			Cflag = 0;
126			break;
127		case 'd':
128			dflag = 1;
129			break;
130		case 's':
131			sflag = 1;
132			break;
133		case 'u':
134			setbuf(stdout, (char *)NULL);
135			break;
136		case '?':
137		default:
138			usage();
139		}
140	argc -= optind;
141	argv += optind;
142
143	switch(argc) {
144	case 0:
145	default:
146		usage();
147		/* NOTREACHED */
148	case 1:
149		isstring2 = 0;
150		break;
151	case 2:
152		isstring2 = 1;
153		break;
154	}
155
156	/*
157	 * tr -ds [-Cc] string1 string2
158	 * Delete all characters (or complemented characters) in string1.
159	 * Squeeze all characters in string2.
160	 */
161	if (dflag && sflag) {
162		if (!isstring2)
163			usage();
164
165		setup(string1, argv[0], &s1, cflag, Cflag);
166		setup(string2, argv[1], &s2, 0, 0);
167
168		for (lastch = OOBCH; (ch = getchar()) != EOF;)
169			if (!string1[ch] && (!string2[ch] || lastch != ch)) {
170				lastch = ch;
171				(void)putchar(ch);
172			}
173		exit(0);
174	}
175
176	/*
177	 * tr -d [-Cc] string1
178	 * Delete all characters (or complemented characters) in string1.
179	 */
180	if (dflag) {
181		if (isstring2)
182			usage();
183
184		setup(string1, argv[0], &s1, cflag, Cflag);
185
186		while ((ch = getchar()) != EOF)
187			if (!string1[ch])
188				(void)putchar(ch);
189		exit(0);
190	}
191
192	/*
193	 * tr -s [-Cc] string1
194	 * Squeeze all characters (or complemented characters) in string1.
195	 */
196	if (sflag && !isstring2) {
197		setup(string1, argv[0], &s1, cflag, Cflag);
198
199		for (lastch = OOBCH; (ch = getchar()) != EOF;)
200			if (!string1[ch] || lastch != ch) {
201				lastch = ch;
202				(void)putchar(ch);
203			}
204		exit(0);
205	}
206
207	/*
208	 * tr [-Ccs] string1 string2
209	 * Replace all characters (or complemented characters) in string1 with
210	 * the character in the same position in string2.  If the -s option is
211	 * specified, squeeze all the characters in string2.
212	 */
213	if (!isstring2)
214		usage();
215
216	s1.str = argv[0];
217	if ((s2.str = strdup(argv[1])) == NULL)
218		errx(2, "strdup(argv[1])");
219
220	if (cflag || Cflag)
221		for (cnt = NCHARS, p = string1; cnt--;)
222			*p++ = OOBCH;
223
224	if (!next(&s2))
225		errx(1, "empty string2");
226
227	/*
228	 * For -s result will contain only those characters defined
229	 * as the second characters in each of the toupper or tolower
230	 * pairs.
231	 */
232
233	/* If string2 runs out of characters, use the last one specified. */
234	while (next(&s1)) {
235	again:
236		if (s1.state == SET_LOWER &&
237		    s2.state == SET_UPPER &&
238		    s1.cnt == 1 && s2.cnt == 1) {
239			do {
240				string1[s1.lastch] = ch = toupper(s1.lastch);
241				if (sflag && isupper(ch))
242					string2[ch] = 1;
243				if (!next(&s1))
244					goto endloop;
245			} while (s1.state == SET_LOWER && s1.cnt > 1);
246			/* skip upper set */
247			do {
248				if (!next(&s2))
249					break;
250			} while (s2.state == SET_UPPER && s2.cnt > 1);
251			goto again;
252		} else if (s1.state == SET_UPPER &&
253			   s2.state == SET_LOWER &&
254			   s1.cnt == 1 && s2.cnt == 1) {
255			do {
256				string1[s1.lastch] = ch = tolower(s1.lastch);
257				if (sflag && islower(ch))
258					string2[ch] = 1;
259				if (!next(&s1))
260					goto endloop;
261			} while (s1.state == SET_UPPER && s1.cnt > 1);
262			/* skip lower set */
263			do {
264				if (!next(&s2))
265					break;
266			} while (s2.state == SET_LOWER && s2.cnt > 1);
267			goto again;
268		} else {
269			string1[s1.lastch] = s2.lastch;
270			if (sflag)
271				string2[s2.lastch] = 1;
272		}
273		(void)next(&s2);
274	}
275endloop:
276	if (cflag || Cflag) {
277		for (p = carray, cnt = 0; cnt < NCHARS; cnt++) {
278			if (string1[cnt] == OOBCH && (!Cflag || ISCHAR(cnt)))
279				*p++ = cnt;
280			else
281				string1[cnt] = cnt;
282		}
283		n = p - carray;
284		if (Cflag && n > 1)
285			(void)mergesort(carray, n, sizeof(*carray), charcoll);
286
287		s2.str = argv[1];
288		s2.state = NORMAL;
289		for (cnt = 0; cnt < n; cnt++) {
290			(void)next(&s2);
291			string1[carray[cnt]] = s2.lastch;
292		}
293	}
294
295	if (sflag)
296		for (lastch = OOBCH; (ch = getchar()) != EOF;) {
297			ch = string1[ch];
298			if (!string2[ch] || lastch != ch) {
299				lastch = ch;
300				(void)putchar(ch);
301			}
302		}
303	else
304		while ((ch = getchar()) != EOF)
305			(void)putchar(string1[ch]);
306	exit (0);
307}
308
309static void
310setup(int *string, char *arg, STR *str, int cflag, int Cflag)
311{
312	int cnt, *p;
313
314	str->str = arg;
315	bzero(string, NCHARS * sizeof(int));
316	while (next(str))
317		string[str->lastch] = 1;
318	if (cflag)
319		for (p = string, cnt = NCHARS; cnt--; ++p)
320			*p = !*p;
321	else if (Cflag)
322		for (cnt = 0; cnt < NCHARS; cnt++)
323			string[cnt] = !string[cnt] && ISCHAR(cnt);
324}
325
326int
327charcoll(const void *a, const void *b)
328{
329	static char sa[2], sb[2];
330
331	sa[0] = *(const int *)a;
332	sb[0] = *(const int *)b;
333	return (strcoll(sa, sb));
334}
335
336static void
337usage(void)
338{
339	(void)fprintf(stderr, "%s\n%s\n%s\n%s\n",
340		"usage: tr [-Ccsu] string1 string2",
341		"       tr [-Ccu] -d string1",
342		"       tr [-Ccu] -s string1",
343		"       tr [-Ccu] -ds string1 string2");
344	exit(1);
345}
346