re.c revision 1.6 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.1 cgd * Copyright (c) 1993 The Regents of the University of California.
5 1.1 cgd * All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley
8 1.1 cgd * by Andrew Moore, Talke Studio.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.1 cgd * 3. All advertising materials mentioning features or use of this software
19 1.1 cgd * must display the following acknowledgement:
20 1.1 cgd * This product includes software developed by the University of
21 1.1 cgd * California, Berkeley and its contributors.
22 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
23 1.1 cgd * may be used to endorse or promote products derived from this software
24 1.1 cgd * without specific prior written permission.
25 1.1 cgd *
26 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 cgd * SUCH DAMAGE.
37 1.1 cgd */
38 1.1 cgd
39 1.1 cgd #ifndef lint
40 1.1 cgd static char sccsid[] = "@(#)re.c 5.5 (Berkeley) 3/28/93";
41 1.1 cgd #endif /* not lint */
42 1.1 cgd
43 1.1 cgd #include <stdio.h>
44 1.1 cgd #include <stdlib.h>
45 1.1 cgd #include <string.h>
46 1.1 cgd
47 1.1 cgd #include "ed.h"
48 1.1 cgd
49 1.5 alm extern char *lhbuf;
50 1.5 alm extern int lhbufsz;
51 1.1 cgd extern char *ibufp;
52 1.5 alm extern int ibufsz;
53 1.1 cgd extern int patlock;
54 1.1 cgd
55 1.1 cgd char errmsg[MAXFNAME + 40] = "";
56 1.1 cgd
57 1.1 cgd /* optpat: return pointer to compiled pattern from command buffer */
58 1.1 cgd pattern_t *
59 1.1 cgd optpat()
60 1.1 cgd {
61 1.1 cgd static pattern_t *exp = NULL;
62 1.1 cgd
63 1.1 cgd char *exps;
64 1.1 cgd char delim;
65 1.1 cgd int n;
66 1.1 cgd
67 1.2 cgd if ((delim = *ibufp) == '\n') {
68 1.4 alm if (!exp) sprintf(errmsg, "no previous pattern");
69 1.1 cgd return exp;
70 1.2 cgd } else if (delim == ' ' || *++ibufp == '\n') {
71 1.1 cgd sprintf(errmsg, "invalid pattern delimiter");
72 1.1 cgd return NULL;
73 1.2 cgd } else if (*ibufp == delim) {
74 1.2 cgd sprintf(errmsg, "no previous pattern");
75 1.1 cgd return exp;
76 1.2 cgd } else if ((exps = getlhs(delim)) == NULL)
77 1.1 cgd return NULL;
78 1.1 cgd /* buffer alloc'd && not reserved */
79 1.1 cgd if (exp && !patlock)
80 1.1 cgd regfree(exp);
81 1.1 cgd else if ((exp = (pattern_t *) malloc(sizeof(pattern_t))) == NULL) {
82 1.3 alm fprintf(stderr, "%s\n", strerror(errno));
83 1.2 cgd sprintf(errmsg, "out of memory");
84 1.1 cgd return NULL;
85 1.1 cgd }
86 1.1 cgd patlock = 0;
87 1.1 cgd #ifdef GNU_REGEX
88 1.1 cgd /* initialize pattern buffer */
89 1.1 cgd exp->buffer = NULL;
90 1.1 cgd exp->allocated = 0L;
91 1.1 cgd exp->fastmap = (char *) malloc(FASTMAP_SIZE);
92 1.1 cgd exp->translate = 0;
93 1.1 cgd #endif
94 1.1 cgd if (n = regcomp(exp, exps, 0)) {
95 1.1 cgd regerror(n, exp, errmsg, sizeof errmsg);
96 1.1 cgd return NULL;
97 1.1 cgd }
98 1.1 cgd return exp;
99 1.1 cgd }
100 1.1 cgd
101 1.1 cgd
102 1.5 alm extern int isbinary;
103 1.5 alm
104 1.1 cgd /* getlhs: copy a pattern string from the command buffer; return pointer
105 1.1 cgd to the copy */
106 1.1 cgd char *
107 1.1 cgd getlhs(delim)
108 1.1 cgd int delim;
109 1.1 cgd {
110 1.1 cgd char *nd;
111 1.5 alm int len;
112 1.1 cgd
113 1.1 cgd for (nd = ibufp; *nd != delim && *nd != '\n'; nd++)
114 1.1 cgd switch (*nd) {
115 1.1 cgd default:
116 1.1 cgd break;
117 1.5 alm case '[':
118 1.5 alm if ((nd = ccl(++nd)) == NULL) {
119 1.1 cgd sprintf(errmsg, "unbalanced brackets ([])");
120 1.1 cgd return NULL;
121 1.1 cgd }
122 1.1 cgd break;
123 1.5 alm case '\\':
124 1.1 cgd if (*++nd == '\n') {
125 1.1 cgd sprintf(errmsg, "trailing backslash (\\)");
126 1.1 cgd return NULL;
127 1.1 cgd }
128 1.1 cgd break;
129 1.1 cgd }
130 1.5 alm len = nd - ibufp;
131 1.5 alm CKBUF(lhbuf, lhbufsz, len + 1, NULL);
132 1.5 alm memcpy(lhbuf, ibufp, len);
133 1.5 alm lhbuf[len] = '\0';
134 1.1 cgd ibufp = nd;
135 1.5 alm return (isbinary) ? nultonl(lhbuf, len) : lhbuf;
136 1.1 cgd }
137 1.1 cgd
138 1.1 cgd
139 1.6 alm /* ccl: expand a POSIX character class */
140 1.1 cgd char *
141 1.6 alm ccl(s)
142 1.6 alm char *s;
143 1.1 cgd {
144 1.6 alm int c, d;
145 1.6 alm
146 1.6 alm if (*s == '^')
147 1.6 alm s++;
148 1.6 alm if (*s == ']')
149 1.6 alm s++;
150 1.6 alm for (; *s != ']' && *s != '\n'; s++)
151 1.6 alm if (*s == '[' && ((d = *(s+1)) == '.' || d == ':' || d == '='))
152 1.6 alm for (s++, c = *++s; *s != ']' || c != d; s++)
153 1.6 alm if ((c = *s) == '\n')
154 1.6 alm return NULL;
155 1.6 alm return (*s == ']') ? s : NULL;
156 1.1 cgd }
157