/usr.bin/tr/str.c
C | 354 lines | 277 code | 29 blank | 48 comment | 70 complexity | 0382ac4628eee7dc5820412402d75ae9 MD5 | raw file
- /*-
- * Copyright (c) 1991, 1993
- * The Regents of the University of California. All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * 3. Neither the name of the University nor the names of its contributors
- * may be used to endorse or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- *
- * @(#)str.c 8.2 (Berkeley) 4/28/95
- * $FreeBSD: src/usr.bin/tr/str.c,v 1.10.2.2 2002/07/29 12:59:33 tjr Exp $
- */
- #include <sys/types.h>
- #include <ctype.h>
- #include <err.h>
- #include <stddef.h>
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
- #include "extern.h"
- static int backslash(STR *);
- static int bracket(STR *);
- static int c_class(const void *, const void *);
- static void genclass(STR *);
- static void genequiv(STR *);
- static int genrange(STR *);
- static void genseq(STR *);
- int
- next(STR *s)
- {
- int ch;
- switch (s->state) {
- case EOS:
- return (0);
- case INFINITE:
- return (1);
- case NORMAL:
- switch (ch = (u_char)*s->str) {
- case '\0':
- s->state = EOS;
- return (0);
- case '\\':
- s->lastch = backslash(s);
- break;
- case '[':
- if (bracket(s))
- return (next(s));
- /* FALLTHROUGH */
- default:
- ++s->str;
- s->lastch = ch;
- break;
- }
- /* We can start a range at any time. */
- if (s->str[0] == '-' && genrange(s))
- return (next(s));
- return (1);
- case RANGE:
- if (s->cnt-- == 0) {
- s->state = NORMAL;
- return (next(s));
- }
- ++s->lastch;
- return (1);
- case SEQUENCE:
- if (s->cnt-- == 0) {
- s->state = NORMAL;
- return (next(s));
- }
- return (1);
- case SET:
- if ((s->lastch = s->set[s->cnt++]) == OOBCH) {
- s->state = NORMAL;
- return (next(s));
- }
- return (1);
- default:
- return (0);
- }
- /* NOTREACHED */
- }
- static int
- bracket(STR *s)
- {
- char *p;
- switch (s->str[1]) {
- case ':': /* "[:class:]" */
- if ((p = strchr(s->str + 2, ']')) == NULL)
- return (0);
- if (*(p - 1) != ':' || p - s->str < 4)
- goto repeat;
- *(p - 1) = '\0';
- s->str += 2;
- genclass(s);
- s->str = p + 1;
- return (1);
- case '=': /* "[=equiv=]" */
- if ((p = strchr(s->str + 2, ']')) == NULL)
- return (0);
- if (*(p - 1) != '=' || p - s->str < 4)
- goto repeat;
- s->str += 2;
- genequiv(s);
- return (1);
- default: /* "[\###*n]" or "[#*n]" */
- repeat:
- if ((p = strpbrk(s->str + 2, "*]")) == NULL)
- return (0);
- if (p[0] != '*' || strchr(p, ']') == NULL)
- return (0);
- s->str += 1;
- genseq(s);
- return (1);
- }
- /* NOTREACHED */
- }
- typedef struct {
- const char *name;
- int (*func)(int);
- int *set;
- } CLASS;
- static CLASS classes[] = {
- #undef isalnum
- { "alnum", isalnum, NULL },
- #undef isalpha
- { "alpha", isalpha, NULL },
- #undef isblank
- { "blank", isblank, NULL },
- #undef iscntrl
- { "cntrl", iscntrl, NULL },
- #undef isdigit
- { "digit", isdigit, NULL },
- #undef isgraph
- { "graph", isgraph, NULL },
- #undef islower
- { "lower", islower, NULL },
- #undef isprint
- { "print", isprint, NULL },
- #undef ispunct
- { "punct", ispunct, NULL },
- #undef isspace
- { "space", isspace, NULL },
- #undef isupper
- { "upper", isupper, NULL },
- #undef isxdigit
- { "xdigit", isxdigit, NULL },
- };
- static void
- genclass(STR *s)
- {
- int cnt, (*func)(int);
- CLASS *cp, tmp;
- int *p;
- tmp.name = s->str;
- if ((cp = (CLASS *)bsearch(&tmp, classes, sizeof(classes) /
- sizeof(CLASS), sizeof(CLASS), c_class)) == NULL)
- errx(1, "unknown class %s", s->str);
- if ((cp->set = p = malloc((NCHARS + 1) * sizeof(int))) == NULL)
- err(1, "malloc");
- bzero(p, (NCHARS + 1) * sizeof(int));
- for (cnt = 0, func = cp->func; cnt < NCHARS; ++cnt)
- if ((func)(cnt))
- *p++ = cnt;
- *p = OOBCH;
- s->cnt = 0;
- s->state = SET;
- s->set = cp->set;
- }
- static int
- c_class(const void *a, const void *b)
- {
- return (strcmp(((const CLASS *)a)->name, ((const CLASS *)b)->name));
- }
- static void
- genequiv(STR *s)
- {
- int i, p, pri;
- char src[2], dst[3];
- if (*s->str == '\\') {
- s->equiv[0] = backslash(s);
- if (*s->str != '=')
- errx(1, "misplaced equivalence equals sign");
- s->str += 2;
- } else {
- s->equiv[0] = s->str[0];
- if (s->str[1] != '=')
- errx(1, "misplaced equivalence equals sign");
- s->str += 3;
- }
- /*
- * Calculate the set of all characters in the same equivalence class
- * as the specified character (they will have the same primary
- * collation weights).
- * XXX Knows too much about how strxfrm() is implemented. Assumes
- * it fills the string with primary collation weight bytes. Only one-
- * to-one mappings are supported.
- */
- src[0] = s->equiv[0];
- src[1] = '\0';
- if (strxfrm(dst, src, sizeof(dst)) == 1) {
- pri = (unsigned char)*dst;
- for (p = 1, i = 1; i < NCHARS; i++) {
- *src = i;
- if (strxfrm(dst, src, sizeof(dst)) == 1 && pri &&
- pri == (unsigned char)*dst)
- s->equiv[p++] = i;
- }
- s->equiv[p] = OOBCH;
- }
- s->cnt = 0;
- s->state = SET;
- s->set = s->equiv;
- }
- static int
- genrange(STR *s)
- {
- int stopval;
- char *savestart;
- savestart = s->str;
- stopval = *++s->str == '\\' ? backslash(s) : (u_char)*s->str++;
- if (stopval < (u_char)s->lastch) {
- s->str = savestart;
- return (0);
- }
- s->cnt = stopval - s->lastch + 1;
- s->state = RANGE;
- --s->lastch;
- return (1);
- }
- static void
- genseq(STR *s)
- {
- char *ep;
- if (s->which == STRING1)
- errx(1, "sequences only valid in string2");
- if (*s->str == '\\')
- s->lastch = backslash(s);
- else
- s->lastch = *s->str++;
- if (*s->str != '*')
- errx(1, "misplaced sequence asterisk");
- switch (*++s->str) {
- case '\\':
- s->cnt = backslash(s);
- break;
- case ']':
- s->cnt = 0;
- ++s->str;
- break;
- default:
- if (isdigit((u_char)*s->str)) {
- s->cnt = strtol(s->str, &ep, 0);
- if (*ep == ']') {
- s->str = ep + 1;
- break;
- }
- }
- errx(1, "illegal sequence count");
- /* NOTREACHED */
- }
- s->state = s->cnt ? SEQUENCE : INFINITE;
- }
- /*
- * Translate \??? into a character. Up to 3 octal digits, if no digits either
- * an escape code or a literal character.
- */
- static int
- backslash(STR *s)
- {
- int ch, cnt, val;
- for (cnt = val = 0;;) {
- ch = (u_char)*++s->str;
- if (!isascii(ch) || !isdigit(ch))
- break;
- val = val * 8 + ch - '0';
- if (++cnt == 3) {
- ++s->str;
- break;
- }
- }
- if (cnt)
- return (val);
- if (ch != '\0')
- ++s->str;
- switch (ch) {
- case 'a': /* escape characters */
- return ('\7');
- case 'b':
- return ('\b');
- case 'f':
- return ('\f');
- case 'n':
- return ('\n');
- case 'r':
- return ('\r');
- case 't':
- return ('\t');
- case 'v':
- return ('\13');
- case '\0': /* \" -> \ */
- s->state = EOS;
- return ('\\');
- default: /* \x" -> x */
- return (ch);
- }
- }