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
30 #include <sys/cdefs.h>
32 __FBSDID("$FreeBSD$");
35 static const char copyright[] =
36 "@(#) Copyright (c) 1988, 1993\n\
37 The Regents of the University of California. All rights reserved.\n";
41 static const char sccsid[] = "@(#)tr.c 8.2 (Berkeley) 5/4/95";
44 #include <sys/types.h>
45 #include <sys/capsicum.h>
47 #include <capsicum_helpers.h>
64 static STR s1 = { STRING1, NORMAL, 0, OOBCH, 0, { 0, OOBCH }, NULL, NULL };
65 static STR s2 = { STRING2, NORMAL, 0, OOBCH, 0, { 0, OOBCH }, NULL, NULL };
67 static struct cset *setup(char *, STR *, int, int);
68 static void usage(void);
71 main(int argc, char **argv)
73 static int carray[NCHARS_SB];
75 struct cset *delete, *squeeze;
77 int Cflag, cflag, dflag, sflag, isstring2;
78 wint_t ch, cnt, lastch;
80 (void)setlocale(LC_ALL, "");
82 if (caph_limit_stdio() == -1)
83 err(1, "unable to limit stdio");
85 if (cap_enter() < 0 && errno != ENOSYS)
86 err(1, "unable to enter capability mode");
88 Cflag = cflag = dflag = sflag = 0;
89 while ((ch = getopt(argc, argv, "Ccdsu")) != -1)
106 setbuf(stdout, (char *)NULL);
129 * tr -ds [-Cc] string1 string2
130 * Delete all characters (or complemented characters) in string1.
131 * Squeeze all characters in string2.
133 if (dflag && sflag) {
137 delete = setup(argv[0], &s1, cflag, Cflag);
138 squeeze = setup(argv[1], &s2, 0, 0);
140 for (lastch = OOBCH; (ch = getwchar()) != WEOF;)
141 if (!cset_in(delete, ch) &&
142 (lastch != ch || !cset_in(squeeze, ch))) {
152 * tr -d [-Cc] string1
153 * Delete all characters (or complemented characters) in string1.
159 delete = setup(argv[0], &s1, cflag, Cflag);
161 while ((ch = getwchar()) != WEOF)
162 if (!cset_in(delete, ch))
170 * tr -s [-Cc] string1
171 * Squeeze all characters (or complemented characters) in string1.
173 if (sflag && !isstring2) {
174 squeeze = setup(argv[0], &s1, cflag, Cflag);
176 for (lastch = OOBCH; (ch = getwchar()) != WEOF;)
177 if (lastch != ch || !cset_in(squeeze, ch)) {
187 * tr [-Ccs] string1 string2
188 * Replace all characters (or complemented characters) in string1 with
189 * the character in the same position in string2. If the -s option is
190 * specified, squeeze all the characters in string2.
198 squeeze = cset_alloc();
204 if (Cflag || cflag) {
205 cmap_default(map, OOBCH);
206 if ((s2.str = strdup(argv[1])) == NULL)
207 errx(1, "strdup(argv[1])");
212 errx(1, "empty string2");
215 * For -s result will contain only those characters defined
216 * as the second characters in each of the toupper or tolower
220 /* If string2 runs out of characters, use the last one specified. */
223 if (s1.state == CCLASS_LOWER &&
224 s2.state == CCLASS_UPPER &&
225 s1.cnt == 1 && s2.cnt == 1) {
227 ch = towupper(s1.lastch);
228 cmap_add(map, s1.lastch, ch);
229 if (sflag && iswupper(ch))
230 cset_add(squeeze, ch);
233 } while (s1.state == CCLASS_LOWER && s1.cnt > 1);
238 } while (s2.state == CCLASS_UPPER && s2.cnt > 1);
240 } else if (s1.state == CCLASS_UPPER &&
241 s2.state == CCLASS_LOWER &&
242 s1.cnt == 1 && s2.cnt == 1) {
244 ch = towlower(s1.lastch);
245 cmap_add(map, s1.lastch, ch);
246 if (sflag && iswlower(ch))
247 cset_add(squeeze, ch);
250 } while (s1.state == CCLASS_UPPER && s1.cnt > 1);
255 } while (s2.state == CCLASS_LOWER && s2.cnt > 1);
258 cmap_add(map, s1.lastch, s2.lastch);
260 cset_add(squeeze, s2.lastch);
265 if (cflag || (Cflag && MB_CUR_MAX > 1)) {
267 * This is somewhat tricky: since the character set is
268 * potentially huge, we need to avoid allocating a map
269 * entry for every character. Our strategy is to set the
270 * default mapping to the last character of string #2
271 * (= the one that gets automatically repeated), then to
272 * add back identity mappings for characters that should
273 * remain unchanged. We don't waste space on identity mappings
274 * for non-characters with the -C option; those are simulated
279 for (cnt = 0; cnt < WINT_MAX; cnt++) {
280 if (Cflag && !iswrune(cnt))
282 if (cmap_lookup(map, cnt) == OOBCH) {
284 cmap_add(map, cnt, s2.lastch);
286 cset_add(squeeze, s2.lastch);
289 cmap_add(map, cnt, cnt);
290 if ((s2.state == EOS || s2.state == INFINITE) &&
291 cnt >= cmap_max(map))
294 cmap_default(map, s2.lastch);
296 for (p = carray, cnt = 0; cnt < NCHARS_SB; cnt++) {
297 if (cmap_lookup(map, cnt) == OOBCH && iswrune(cnt))
300 cmap_add(map, cnt, cnt);
304 (void)mergesort(carray, n, sizeof(*carray), charcoll);
308 for (cnt = 0; cnt < n; cnt++) {
310 cmap_add(map, carray[cnt], s2.lastch);
312 * Chars taken from s2 can be different this time
313 * due to lack of complex upper/lower processing,
314 * so fill string2 again to not miss some.
317 cset_add(squeeze, s2.lastch);
325 for (lastch = OOBCH; (ch = getwchar()) != WEOF;) {
326 if (!Cflag || iswrune(ch))
327 ch = cmap_lookup(map, ch);
328 if (lastch != ch || !cset_in(squeeze, ch)) {
334 while ((ch = getwchar()) != WEOF) {
335 if (!Cflag || iswrune(ch))
336 ch = cmap_lookup(map, ch);
345 setup(char *arg, STR *str, int cflag, int Cflag)
354 cset_add(cs, str->lastch);
356 cset_addclass(cs, wctype("rune"), true);
364 charcoll(const void *a, const void *b)
366 static char sa[2], sb[2];
368 sa[0] = *(const int *)a;
369 sb[0] = *(const int *)b;
370 return (strcoll(sa, sb));
376 (void)fprintf(stderr, "%s\n%s\n%s\n%s\n",
377 "usage: tr [-Ccsu] string1 string2",
378 " tr [-Ccu] -d string1",
379 " tr [-Ccu] -s string1",
380 " tr [-Ccu] -ds string1 string2");