re.c revision 1.13 1 1.1 cgd /* re.c: This file contains the regular expression interface routines for
2 1.1 cgd the ed line editor. */
3 1.1 cgd /*-
4 1.11 alm * Copyright (c) 1993 Andrew Moore, Talke Studio.
5 1.1 cgd * All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd *
16 1.11 alm * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 1.11 alm * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 1.1 cgd * SUCH DAMAGE.
27 1.1 cgd */
28 1.1 cgd
29 1.1 cgd #ifndef lint
30 1.13 alm static char *rcsid = "@(#)re.c,v 1.6 1994/02/01 00:34:43 alm Exp";
31 1.1 cgd #endif /* not lint */
32 1.1 cgd
33 1.13 alm #include "ed.h"
34 1.1 cgd
35 1.1 cgd
36 1.1 cgd extern int patlock;
37 1.1 cgd
38 1.13 alm char errmsg[MAXPATHLEN + 40] = "";
39 1.1 cgd
40 1.12 alm /* get_compiled_pattern: return pointer to compiled pattern from command
41 1.12 alm buffer */
42 1.1 cgd pattern_t *
43 1.12 alm get_compiled_pattern()
44 1.1 cgd {
45 1.1 cgd static pattern_t *exp = NULL;
46 1.1 cgd
47 1.1 cgd char *exps;
48 1.12 alm char delimiter;
49 1.1 cgd int n;
50 1.1 cgd
51 1.12 alm if ((delimiter = *ibufp) == ' ') {
52 1.1 cgd sprintf(errmsg, "invalid pattern delimiter");
53 1.1 cgd return NULL;
54 1.12 alm } else if (delimiter == '\n' || *++ibufp == '\n' || *ibufp == delimiter) {
55 1.8 alm if (!exp) sprintf(errmsg, "no previous pattern");
56 1.1 cgd return exp;
57 1.12 alm } else if ((exps = extract_pattern(delimiter)) == NULL)
58 1.1 cgd return NULL;
59 1.1 cgd /* buffer alloc'd && not reserved */
60 1.1 cgd if (exp && !patlock)
61 1.1 cgd regfree(exp);
62 1.1 cgd else if ((exp = (pattern_t *) malloc(sizeof(pattern_t))) == NULL) {
63 1.3 alm fprintf(stderr, "%s\n", strerror(errno));
64 1.2 cgd sprintf(errmsg, "out of memory");
65 1.1 cgd return NULL;
66 1.1 cgd }
67 1.1 cgd patlock = 0;
68 1.1 cgd if (n = regcomp(exp, exps, 0)) {
69 1.1 cgd regerror(n, exp, errmsg, sizeof errmsg);
70 1.10 alm free(exp);
71 1.10 alm return exp = NULL;
72 1.1 cgd }
73 1.1 cgd return exp;
74 1.1 cgd }
75 1.1 cgd
76 1.1 cgd
77 1.12 alm /* extract_pattern: copy a pattern string from the command buffer; return
78 1.12 alm pointer to the copy */
79 1.1 cgd char *
80 1.12 alm extract_pattern(delimiter)
81 1.12 alm int delimiter;
82 1.1 cgd {
83 1.13 alm static char *lhbuf = NULL; /* buffer */
84 1.13 alm static int lhbufsz = 0; /* buffer size */
85 1.13 alm
86 1.1 cgd char *nd;
87 1.5 alm int len;
88 1.1 cgd
89 1.12 alm for (nd = ibufp; *nd != delimiter && *nd != '\n'; nd++)
90 1.1 cgd switch (*nd) {
91 1.1 cgd default:
92 1.1 cgd break;
93 1.5 alm case '[':
94 1.12 alm if ((nd = parse_char_class(++nd)) == NULL) {
95 1.1 cgd sprintf(errmsg, "unbalanced brackets ([])");
96 1.1 cgd return NULL;
97 1.1 cgd }
98 1.1 cgd break;
99 1.5 alm case '\\':
100 1.1 cgd if (*++nd == '\n') {
101 1.1 cgd sprintf(errmsg, "trailing backslash (\\)");
102 1.1 cgd return NULL;
103 1.1 cgd }
104 1.1 cgd break;
105 1.1 cgd }
106 1.5 alm len = nd - ibufp;
107 1.13 alm REALLOC(lhbuf, lhbufsz, len + 1, NULL);
108 1.5 alm memcpy(lhbuf, ibufp, len);
109 1.5 alm lhbuf[len] = '\0';
110 1.1 cgd ibufp = nd;
111 1.12 alm return (isbinary) ? NUL_TO_NEWLINE(lhbuf, len) : lhbuf;
112 1.1 cgd }
113 1.1 cgd
114 1.1 cgd
115 1.12 alm /* parse_char_class: expand a POSIX character class */
116 1.1 cgd char *
117 1.12 alm parse_char_class(s)
118 1.6 alm char *s;
119 1.1 cgd {
120 1.6 alm int c, d;
121 1.6 alm
122 1.6 alm if (*s == '^')
123 1.6 alm s++;
124 1.6 alm if (*s == ']')
125 1.6 alm s++;
126 1.6 alm for (; *s != ']' && *s != '\n'; s++)
127 1.6 alm if (*s == '[' && ((d = *(s+1)) == '.' || d == ':' || d == '='))
128 1.6 alm for (s++, c = *++s; *s != ']' || c != d; s++)
129 1.6 alm if ((c = *s) == '\n')
130 1.6 alm return NULL;
131 1.6 alm return (*s == ']') ? s : NULL;
132 1.1 cgd }
133