2 * Copyright (c) 1988, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * @(#) Copyright (c) 1988, 1993 The Regents of the University of California. All rights reserved.
30 * @(#)tr.c 8.2 (Berkeley) 5/4/95
31 * $FreeBSD: head/usr.bin/tr/tr.c 245767 2013-01-22 05:39:34Z andrew $
34 #include <sys/types.h>
52 static STR s1 = { STRING1, NORMAL, 0, OOBCH, 0, { 0, OOBCH }, NULL, NULL };
53 static STR s2 = { STRING2, NORMAL, 0, OOBCH, 0, { 0, OOBCH }, NULL, NULL };
55 static struct cset *setup(char *, STR *, int, int);
56 static void usage(void) __dead2;
59 main(int argc, char **argv)
61 static int carray[NCHARS_SB];
63 struct cset *delete, *squeeze;
65 int Cflag, cflag, dflag, sflag, isstring2;
66 wint_t ch, cnt, lastch;
68 (void)setlocale(LC_ALL, "");
70 Cflag = cflag = dflag = sflag = 0;
71 while ((ch = getopt(argc, argv, "Ccdsu")) != -1)
111 * tr -ds [-Cc] string1 string2
112 * Delete all characters (or complemented characters) in string1.
113 * Squeeze all characters in string2.
115 if (dflag && sflag) {
119 delete = setup(argv[0], &s1, cflag, Cflag);
120 squeeze = setup(argv[1], &s2, 0, 0);
122 for (lastch = OOBCH; (ch = getwchar()) != WEOF;)
123 if (!cset_in(delete, ch) &&
124 (lastch != ch || !cset_in(squeeze, ch))) {
134 * tr -d [-Cc] string1
135 * Delete all characters (or complemented characters) in string1.
141 delete = setup(argv[0], &s1, cflag, Cflag);
143 while ((ch = getwchar()) != WEOF)
144 if (!cset_in(delete, ch))
152 * tr -s [-Cc] string1
153 * Squeeze all characters (or complemented characters) in string1.
155 if (sflag && !isstring2) {
156 squeeze = setup(argv[0], &s1, cflag, Cflag);
158 for (lastch = OOBCH; (ch = getwchar()) != WEOF;)
159 if (lastch != ch || !cset_in(squeeze, ch)) {
169 * tr [-Ccs] string1 string2
170 * Replace all characters (or complemented characters) in string1 with
171 * the character in the same position in string2. If the -s option is
172 * specified, squeeze all the characters in string2.
180 squeeze = cset_alloc();
186 if (Cflag || cflag) {
187 cmap_default(map, OOBCH);
188 if ((s2.str = strdup(argv[1])) == NULL)
189 errx(1, "strdup(argv[1])");
194 errx(1, "empty string2");
197 * For -s result will contain only those characters defined
198 * as the second characters in each of the toupper or tolower
202 /* If string2 runs out of characters, use the last one specified. */
205 if (s1.state == CCLASS_LOWER &&
206 s2.state == CCLASS_UPPER &&
207 s1.cnt == 1 && s2.cnt == 1) {
209 ch = towupper(s1.lastch);
210 cmap_add(map, s1.lastch, ch);
211 if (sflag && iswupper(ch))
212 cset_add(squeeze, ch);
215 } while (s1.state == CCLASS_LOWER && s1.cnt > 1);
220 } while (s2.state == CCLASS_UPPER && s2.cnt > 1);
222 } else if (s1.state == CCLASS_UPPER &&
223 s2.state == CCLASS_LOWER &&
224 s1.cnt == 1 && s2.cnt == 1) {
226 ch = towlower(s1.lastch);
227 cmap_add(map, s1.lastch, ch);
228 if (sflag && iswlower(ch))
229 cset_add(squeeze, ch);
232 } while (s1.state == CCLASS_UPPER && s1.cnt > 1);
237 } while (s2.state == CCLASS_LOWER && s2.cnt > 1);
240 cmap_add(map, s1.lastch, s2.lastch);
242 cset_add(squeeze, s2.lastch);
247 if (cflag || (Cflag && MB_CUR_MAX > 1)) {
249 * This is somewhat tricky: since the character set is
250 * potentially huge, we need to avoid allocating a map
251 * entry for every character. Our strategy is to set the
252 * default mapping to the last character of string #2
253 * (= the one that gets automatically repeated), then to
254 * add back identity mappings for characters that should
255 * remain unchanged. We don't waste space on identity mappings
256 * for non-characters with the -C option; those are simulated
261 for (cnt = 0; cnt < WINT_MAX; cnt++) {
262 if (Cflag && !iswrune(cnt))
264 if (cmap_lookup(map, cnt) == OOBCH) {
266 cmap_add(map, cnt, s2.lastch);
268 cset_add(squeeze, s2.lastch);
270 cmap_add(map, cnt, cnt);
271 if ((s2.state == EOS || s2.state == INFINITE) &&
272 cnt >= cmap_max(map))
275 cmap_default(map, s2.lastch);
277 for (p = carray, cnt = 0; cnt < NCHARS_SB; cnt++) {
278 if (cmap_lookup(map, cnt) == OOBCH && iswrune(cnt))
281 cmap_add(map, cnt, cnt);
285 (void)mergesort(carray, n, sizeof(*carray), charcoll);
289 for (cnt = 0; cnt < n; cnt++) {
291 cmap_add(map, carray[cnt], s2.lastch);
293 * Chars taken from s2 can be different this time
294 * due to lack of complex upper/lower processing,
295 * so fill string2 again to not miss some.
298 cset_add(squeeze, s2.lastch);
306 for (lastch = OOBCH; (ch = getwchar()) != WEOF;) {
307 if (!Cflag || iswrune(ch))
308 ch = cmap_lookup(map, ch);
309 if (lastch != ch || !cset_in(squeeze, ch)) {
315 while ((ch = getwchar()) != WEOF) {
316 if (!Cflag || iswrune(ch))
317 ch = cmap_lookup(map, ch);
326 setup(char *arg, STR *str, int cflag, int Cflag)
335 cset_add(cs, str->lastch);
337 cset_addclass(cs, wctype("rune"), true);
345 charcoll(const void *a, const void *b)
347 static char sa[2], sb[2];
349 sa[0] = *(const int *)a;
350 sb[0] = *(const int *)b;
351 return (strcoll(sa, sb));
357 (void)fprintf(stderr, "%s\n%s\n%s\n%s\n",
358 "usage: tr [-Ccsu] string1 string2",
359 " tr [-Ccu] -d string1",
360 " tr [-Ccu] -s string1",
361 " tr [-Ccu] -ds string1 string2");