1da2e3ebdSchin /***********************************************************************
2da2e3ebdSchin * *
3da2e3ebdSchin * This software is part of the ast package *
4*b30d1939SAndy Fiddaman * Copyright (c) 1985-2012 AT&T Intellectual Property *
5da2e3ebdSchin * and is licensed under the *
6*b30d1939SAndy Fiddaman * Eclipse Public License, Version 1.0 *
77c2fbfb3SApril Chin * by AT&T Intellectual Property *
8da2e3ebdSchin * *
9da2e3ebdSchin * A copy of the License is available at *
10*b30d1939SAndy Fiddaman * http://www.eclipse.org/org/documents/epl-v10.html *
11*b30d1939SAndy Fiddaman * (with md5 checksum b35adb5213ca9657e911e9befb180842) *
12da2e3ebdSchin * *
13da2e3ebdSchin * Information and Software Systems Research *
14da2e3ebdSchin * AT&T Research *
15da2e3ebdSchin * Florham Park NJ *
16da2e3ebdSchin * *
17da2e3ebdSchin * Glenn Fowler <gsf@research.att.com> *
18da2e3ebdSchin * David Korn <dgk@research.att.com> *
19da2e3ebdSchin * Phong Vo <kpv@research.att.com> *
20da2e3ebdSchin * *
21da2e3ebdSchin ***********************************************************************/
22da2e3ebdSchin #pragma prototyped
23da2e3ebdSchin
24da2e3ebdSchin /*
25da2e3ebdSchin * posix regex ed(1) style substitute execute
26da2e3ebdSchin */
27da2e3ebdSchin
28da2e3ebdSchin #include "reglib.h"
29da2e3ebdSchin
30da2e3ebdSchin #define NEED(p,b,n,r) \
31da2e3ebdSchin do \
32da2e3ebdSchin { \
33da2e3ebdSchin if (((b)->re_end - (b)->re_cur) < (n)) \
34da2e3ebdSchin { \
35da2e3ebdSchin size_t o = (b)->re_cur - (b)->re_buf; \
36da2e3ebdSchin size_t a = ((b)->re_end - (b)->re_buf); \
37da2e3ebdSchin if (a < n) \
38da2e3ebdSchin a = roundof(n, 128); \
39da2e3ebdSchin a *= 2; \
40da2e3ebdSchin if (!((b)->re_buf = alloc(p->env->disc, (b)->re_buf, a))) \
41da2e3ebdSchin { \
42da2e3ebdSchin (b)->re_buf = (b)->re_cur = (b)->re_end = 0; \
43da2e3ebdSchin c = REG_ESPACE; \
44da2e3ebdSchin r; \
45da2e3ebdSchin } \
46da2e3ebdSchin (b)->re_cur = (b)->re_buf + o; \
47da2e3ebdSchin (b)->re_end = (b)->re_buf + a; \
48da2e3ebdSchin } \
49da2e3ebdSchin } while (0)
50da2e3ebdSchin
51da2e3ebdSchin #define PUTC(p,b,x,r) \
52da2e3ebdSchin do \
53da2e3ebdSchin { \
54da2e3ebdSchin NEED(p, b, 1, r); \
55da2e3ebdSchin *(b)->re_cur++ = (x); \
56da2e3ebdSchin } while (0)
57da2e3ebdSchin
58da2e3ebdSchin #define PUTS(p,b,x,z,r) \
59da2e3ebdSchin do if (z) \
60da2e3ebdSchin { \
61da2e3ebdSchin NEED(p, b, z, r); \
62da2e3ebdSchin memcpy((b)->re_cur, x, z); \
63da2e3ebdSchin (b)->re_cur += (z); \
64da2e3ebdSchin } while (0)
65da2e3ebdSchin
66da2e3ebdSchin /*
67da2e3ebdSchin * do a single substitution
68da2e3ebdSchin */
69da2e3ebdSchin
70da2e3ebdSchin static int
sub(const regex_t * p,register regsub_t * b,const char * ss,register regsubop_t * op,size_t nmatch,register regmatch_t * match)71da2e3ebdSchin sub(const regex_t* p, register regsub_t* b, const char* ss, register regsubop_t* op, size_t nmatch, register regmatch_t* match)
72da2e3ebdSchin {
73da2e3ebdSchin register char* s;
74da2e3ebdSchin register char* e;
75da2e3ebdSchin register int c;
76da2e3ebdSchin
77da2e3ebdSchin for (;; op++)
78da2e3ebdSchin {
79da2e3ebdSchin switch (op->len)
80da2e3ebdSchin {
81da2e3ebdSchin case -1:
82da2e3ebdSchin break;
83da2e3ebdSchin case 0:
84da2e3ebdSchin if (op->off >= nmatch)
85da2e3ebdSchin return REG_ESUBREG;
86da2e3ebdSchin if ((c = match[op->off].rm_so) < 0)
87da2e3ebdSchin continue;
88da2e3ebdSchin s = (char*)ss + c;
89da2e3ebdSchin if ((c = match[op->off].rm_eo) < 0)
90da2e3ebdSchin continue;
91da2e3ebdSchin e = (char*)ss + c;
92da2e3ebdSchin NEED(p, b, e - s, return c);
93da2e3ebdSchin switch (op->op)
94da2e3ebdSchin {
95da2e3ebdSchin case REG_SUB_UPPER:
96da2e3ebdSchin while (s < e)
97da2e3ebdSchin {
98da2e3ebdSchin c = *s++;
99da2e3ebdSchin if (islower(c))
100da2e3ebdSchin c = toupper(c);
101da2e3ebdSchin *b->re_cur++ = c;
102da2e3ebdSchin }
103da2e3ebdSchin break;
104da2e3ebdSchin case REG_SUB_LOWER:
105da2e3ebdSchin while (s < e)
106da2e3ebdSchin {
107da2e3ebdSchin c = *s++;
108da2e3ebdSchin if (isupper(c))
109da2e3ebdSchin c = tolower(c);
110da2e3ebdSchin *b->re_cur++ = c;
111da2e3ebdSchin }
112da2e3ebdSchin break;
113da2e3ebdSchin case REG_SUB_UPPER|REG_SUB_LOWER:
114da2e3ebdSchin while (s < e)
115da2e3ebdSchin {
116da2e3ebdSchin c = *s++;
117da2e3ebdSchin if (isupper(c))
118da2e3ebdSchin c = tolower(c);
119da2e3ebdSchin else if (islower(c))
120da2e3ebdSchin c = toupper(c);
121da2e3ebdSchin *b->re_cur++ = c;
122da2e3ebdSchin }
123da2e3ebdSchin break;
124da2e3ebdSchin default:
125da2e3ebdSchin while (s < e)
126da2e3ebdSchin *b->re_cur++ = *s++;
127da2e3ebdSchin break;
128da2e3ebdSchin }
129da2e3ebdSchin continue;
130da2e3ebdSchin default:
131da2e3ebdSchin NEED(p, b, op->len, return c);
132da2e3ebdSchin s = b->re_rhs + op->off;
133da2e3ebdSchin e = s + op->len;
134da2e3ebdSchin while (s < e)
135da2e3ebdSchin *b->re_cur++ = *s++;
136da2e3ebdSchin continue;
137da2e3ebdSchin }
138da2e3ebdSchin break;
139da2e3ebdSchin }
140da2e3ebdSchin return 0;
141da2e3ebdSchin }
142da2e3ebdSchin
143da2e3ebdSchin /*
144da2e3ebdSchin * ed(1) style substitute using matches from last regexec()
145da2e3ebdSchin */
146da2e3ebdSchin
147da2e3ebdSchin int
regsubexec(const regex_t * p,const char * s,size_t nmatch,regmatch_t * match)148da2e3ebdSchin regsubexec(const regex_t* p, const char* s, size_t nmatch, regmatch_t* match)
149da2e3ebdSchin {
150da2e3ebdSchin register int c;
151da2e3ebdSchin register regsub_t* b;
152da2e3ebdSchin const char* e;
153da2e3ebdSchin int m;
154da2e3ebdSchin
155da2e3ebdSchin if (!p->env->sub || (p->env->flags & REG_NOSUB) || !nmatch)
156da2e3ebdSchin return fatal(p->env->disc, REG_BADPAT, NiL);
157da2e3ebdSchin b = p->re_sub;
158da2e3ebdSchin m = b->re_min;
159da2e3ebdSchin b->re_cur = b->re_buf;
160da2e3ebdSchin e = (const char*)p->env->end;
1617c2fbfb3SApril Chin c = 0;
162da2e3ebdSchin for (;;)
163da2e3ebdSchin {
164da2e3ebdSchin if (--m > 0)
165da2e3ebdSchin PUTS(p, b, s, match->rm_eo, return fatal(p->env->disc, c, NiL));
166da2e3ebdSchin else
167da2e3ebdSchin {
168da2e3ebdSchin PUTS(p, b, s, match->rm_so, return fatal(p->env->disc, c, NiL));
1697c2fbfb3SApril Chin if (!c && (c = sub(p, b, s, b->re_ops, nmatch, match)))
170da2e3ebdSchin return fatal(p->env->disc, c, NiL);
171da2e3ebdSchin }
172da2e3ebdSchin s += match->rm_eo;
1737c2fbfb3SApril Chin if (m <= 0 && !(b->re_flags & REG_SUB_ALL) || !*s)
174da2e3ebdSchin break;
175da2e3ebdSchin if (c = regnexec(p, s, e - s, nmatch, match, p->env->flags|(match->rm_so == match->rm_eo ? REG_ADVANCE : 0)))
176da2e3ebdSchin {
177da2e3ebdSchin if (c != REG_NOMATCH)
178da2e3ebdSchin return fatal(p->env->disc, c, NiL);
179da2e3ebdSchin break;
180da2e3ebdSchin }
1817c2fbfb3SApril Chin if (!match->rm_so && !match->rm_eo && *s && m <= 1)
1827c2fbfb3SApril Chin {
1837c2fbfb3SApril Chin match->rm_so = match->rm_eo = 1;
1847c2fbfb3SApril Chin c = 1;
1857c2fbfb3SApril Chin }
186da2e3ebdSchin }
187da2e3ebdSchin while (s < e)
188da2e3ebdSchin {
189da2e3ebdSchin c = *s++;
190da2e3ebdSchin PUTC(p, b, c, return fatal(p->env->disc, c, NiL));
191da2e3ebdSchin }
192da2e3ebdSchin NEED(p, b, 1, return fatal(p->env->disc, c, NiL));
193da2e3ebdSchin *b->re_cur = 0;
194da2e3ebdSchin b->re_len = b->re_cur - b->re_buf;
195da2e3ebdSchin return 0;
196da2e3ebdSchin }
197*b30d1939SAndy Fiddaman
198*b30d1939SAndy Fiddaman /*
199*b30d1939SAndy Fiddaman * 20120528: regoff_t changed from int to ssize_t
200*b30d1939SAndy Fiddaman */
201*b30d1939SAndy Fiddaman
202*b30d1939SAndy Fiddaman #if defined(__EXPORT__)
203*b30d1939SAndy Fiddaman #define extern __EXPORT__
204*b30d1939SAndy Fiddaman #endif
205*b30d1939SAndy Fiddaman
206*b30d1939SAndy Fiddaman #undef regsubexec
207*b30d1939SAndy Fiddaman #if _map_libc
208*b30d1939SAndy Fiddaman #define regsubexec _ast_regsubexec
209*b30d1939SAndy Fiddaman #endif
210*b30d1939SAndy Fiddaman
211*b30d1939SAndy Fiddaman extern int
regsubexec(const regex_t * p,const char * s,size_t nmatch,oldregmatch_t * oldmatch)212*b30d1939SAndy Fiddaman regsubexec(const regex_t* p, const char* s, size_t nmatch, oldregmatch_t* oldmatch)
213*b30d1939SAndy Fiddaman {
214*b30d1939SAndy Fiddaman if (oldmatch)
215*b30d1939SAndy Fiddaman {
216*b30d1939SAndy Fiddaman regmatch_t* match;
217*b30d1939SAndy Fiddaman ssize_t i;
218*b30d1939SAndy Fiddaman int r;
219*b30d1939SAndy Fiddaman
220*b30d1939SAndy Fiddaman if (!(match = oldof(0, regmatch_t, nmatch, 0)))
221*b30d1939SAndy Fiddaman return -1;
222*b30d1939SAndy Fiddaman for (i = 0; i < nmatch; i++)
223*b30d1939SAndy Fiddaman {
224*b30d1939SAndy Fiddaman match[i].rm_so = oldmatch[i].rm_so;
225*b30d1939SAndy Fiddaman match[i].rm_eo = oldmatch[i].rm_eo;
226*b30d1939SAndy Fiddaman }
227*b30d1939SAndy Fiddaman if (!(r = regsubexec_20120528(p, s, nmatch, match)))
228*b30d1939SAndy Fiddaman for (i = 0; i < nmatch; i++)
229*b30d1939SAndy Fiddaman {
230*b30d1939SAndy Fiddaman oldmatch[i].rm_so = match[i].rm_so;
231*b30d1939SAndy Fiddaman oldmatch[i].rm_eo = match[i].rm_eo;
232*b30d1939SAndy Fiddaman }
233*b30d1939SAndy Fiddaman free(match);
234*b30d1939SAndy Fiddaman return r;
235*b30d1939SAndy Fiddaman }
236*b30d1939SAndy Fiddaman return regsubexec_20120528(p, s, 0, NiL);
237*b30d1939SAndy Fiddaman }
238