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