Home
last modified time | relevance | path

Searched refs:re (Results 1 – 25 of 281) sorted by relevance

12345678910>>...12

/titanic_51/usr/src/lib/libast/common/comp/
H A Dregcmp.c39 regex_t re; member
51 register Regex_t* re = (Regex_t*)handle; in block() local
53 if (data || (size = roundof(size, ALIGN_BOUND2)) > (re->buf + re->size - re->cur)) in block()
55 data = (void*)re->cur; in block()
56 re->cur += size; in block()
64 register Regex_t* re; in regcmp() local
154 re = 0; in regcmp()
158 if ((n += INC) > TOT || !(re = newof(re, Regex_t, 0, n))) in regcmp()
160 if (re) in regcmp()
161 free(re); in regcmp()
[all …]
H A Dregexp.c36 regex_t re; member
55 _re_comp(regexp_t* re, const char* pattern, char* handle, unsigned int size) in _re_comp() argument
65 n = regcomp(&env->re, pattern, REG_LENIENT|REG_NULL); in _re_comp()
89 re->re_nbra = env->re.re_nsub; in _re_comp()
94 _re_exec(regexp_t* re, const char* subject, const char* handle, int anchor) in _re_exec() argument
98 regmatch_t match[elementsof(re->re_braslist)+1]; in _re_exec()
100 if (regexec(&env->re, subject, elementsof(match), match, 0) || anchor && match[0].rm_so) in _re_exec()
102 re->re_loc1 = (char*)subject + match[0].rm_so; in _re_exec()
103 re->re_loc2 = (char*)subject + match[0].rm_eo; in _re_exec()
104 for (n = 1; n <= env->re.re_nsub; n++) in _re_exec()
[all …]
H A Dfnmatch.c57 regex_t re; in fnmatch() local
65 if (!(reflags = regcomp(&re, pattern, reflags))) in fnmatch()
67 reflags = regexec(&re, subject, 1, &match, 0); in fnmatch()
68 regfree(&re); in fnmatch()
73 else if (!(reflags = regcomp(&re, pattern, reflags|REG_RIGHT))) in fnmatch()
75 reflags = regexec(&re, subject, 0, NiL, 0); in fnmatch()
76 regfree(&re); in fnmatch()
/titanic_51/usr/src/contrib/ast/src/lib/libast/comp/
H A Dregcmp.c39 regex_t re; member
51 register Regex_t* re = (Regex_t*)handle; in block() local
53 if (data || (size = roundof(size, ALIGN_BOUND2)) > (re->buf + re->size - re->cur)) in block()
55 data = (void*)re->cur; in block()
56 re->cur += size; in block()
64 register Regex_t* re; in regcmp() local
161 re = 0; in regcmp()
165 if ((n += INC) > TOT || !(re in regcmp()
192 register Regex_t* re; regex() local
[all...]
H A Dregexp.c36 regex_t re; member
55 _re_comp(regexp_t* re, const char* pattern, char* handle, unsigned int size) in _re_comp() argument
65 n = regcomp(&env->re, pattern, REG_LENIENT|REG_NULL); in _re_comp()
89 re->re_nbra = env->re.re_nsub; in _re_comp()
94 _re_exec(regexp_t* re, const char* subject, const char* handle, int anchor) in _re_exec() argument
98 regmatch_t match[elementsof(re->re_braslist)+1]; in _re_exec()
100 if (regexec(&env->re, subject, elementsof(match), match, 0) || anchor && match[0].rm_so) in _re_exec()
102 re->re_loc1 = (char*)subject + match[0].rm_so; in _re_exec()
103 re in _re_exec()
[all...]
H A Dfnmatch.c57 regex_t re; in fnmatch() local
65 if (!(reflags = regcomp(&re, pattern, reflags))) in fnmatch()
67 reflags = regexec(&re, subject, 1, &match, 0); in fnmatch()
68 regfree(&re); in fnmatch()
73 else if (!(reflags = regcomp(&re, pattern, reflags|REG_RIGHT))) in fnmatch()
75 reflags = regexec(&re, subject, 0, NiL, 0); in fnmatch()
76 regfree(&re); in fnmatch()
/titanic_51/usr/src/lib/libc/port/locale/
H A Dnextwctype.c47 const _RuneEntry *base, *re; in nextwctype_l() local
71 re = base + (lim >> 1); in nextwctype_l()
72 if (re->__min <= wc && wc <= re->__max) in nextwctype_l()
74 else if (wc > re->__max) { in nextwctype_l()
75 base = re + 1; in nextwctype_l()
83 if (re->__min <= wc && wc <= re->__max) { in nextwctype_l()
84 if (re->__types != NULL) { in nextwctype_l()
85 for (; wc <= re in nextwctype_l()
[all...]
H A Drunetype.c45 const _RuneEntry *base, *re; in __runetype() local
53 re = base + (lim >> 1); in __runetype()
54 if (re->__min <= c && c <= re->__max) { in __runetype()
55 if (re->__types) in __runetype()
56 return (re->__types[c - re->__min]); in __runetype()
58 return (re->__map); in __runetype()
59 } else if (c > re->__max) { in __runetype()
60 base = re in __runetype()
[all...]
H A Dtowlower.c52 const _RuneEntry *base, *re; in change_case_ext() local
63 re = base + (lim >> 1); in change_case_ext()
64 if (re->__min <= c && c <= re->__max) { in change_case_ext()
65 return (re->__map + c - re->__min); in change_case_ext()
66 } else if (c > re->__max) { in change_case_ext()
67 base = re + 1; in change_case_ext()
/titanic_51/usr/src/contrib/ast/src/lib/libast/regex/
H A Dregnexec.c237 #define matchpush(e,x) ((x)->re.group.number?_matchpush(e,x):0)
238 #define matchcopy(e,x) do if ((x)->re.group.number) { Match_frame_t* fp = (void*)stkframe(stkstd)->data; memcpy(fp->match, fp->save, fp->size); } while (0)
239 #define matchpop(e,x) do if ((x)->re.group.number) { Match_frame_t* fp = (void*)stkframe(stkstd)->data; memcpy(fp->match, fp->save, fp->size); stkpop(stkstd); } while (0)
256 if (rex->re.group.number <= 0 || (num = rex->re.group.last - rex->re.group.number + 1) <= 0) in _matchpush()
264 f->match = m = env->match + rex->re.group.number; in _matchpush()
408 DEBUG_TEST(0x0010,(sfprintf(sfstdout, "AHA#%04d 0x%04x parserep %s %d %d %d %d `%-.*s'\n", __LINE__, debug_flag, rexname(rex->re.group.expr.rex), rex->re.group.number, rex->lo, n, rex->hi, env->end - s, s)),(0)); in parserep()
431 catcher.re in parserep()
[all...]
H A Dregcomp.c119 unsigned char* cursor; /* curent point in re */
161 e->re.data = (char*)e + sizeof(Rex_t); in node()
203 drop(disc, e->re.group.expr.binary.left); in drop()
204 drop(disc, e->re.group.expr.binary.right); in drop()
214 drop(disc, e->re.group.expr.rex); in drop()
218 triedrop(disc, e->re.trie.root[i]); in drop()
246 if (e->re.group.expr.binary.left) in mark()
247 mark(e->re.group.expr.binary.left, set); in mark()
248 if (e->re.group.expr.binary.right) in mark()
249 mark(e->re in mark()
[all...]
H A Dregdecomp.c94 if (decomp(e->re.group.expr.binary.left, sp, type, delimiter, flags)) in decomp()
97 if (e->re.group.expr.binary.right && decomp(e->re.group.expr.binary.right, sp, type, delimiter, flags)) in decomp()
147 if (decomp(e->re.group.expr.rex, sp, type, delimiter, flags)) in decomp()
157 if (settst(e->re.charclass, m)) in decomp()
265 meta(sp, e->re.onechar, type, 0, delimiter); in decomp()
300 t = (s = e->re.string.base) + e->re.string.size; in decomp()
310 if (e->re.trie.root[c]) in decomp()
318 detrie(e->re in decomp()
[all...]
/titanic_51/usr/src/lib/libast/common/regex/
H A Dregnexec.c238 #define matchpush(e,x) ((x)->re.group.number?_matchpush(e,x):0)
239 #define matchcopy(e,x) ((x)->re.group.number?memcpy(matchframe->match,matchframe->save,matchframe->…
240 #define matchpop(e,x) ((x)->re.group.number?memcpy(matchframe->match,matchframe->save,matchframe->s…
257 if (rex->re.group.number <= 0 || (num = rex->re.group.last - rex->re.group.number + 1) <= 0) in _matchpush()
265 f->match = m = env->match + rex->re.group.number; in _matchpush()
409 … %s %d %d %d %d `%-.*s'\n", __LINE__, debug_flag, rexname(rex->re.group.expr.rex), rex->re.group.n… in parserep()
432 catcher.re.rep_catch.ref = rex; in parserep()
433 catcher.re.rep_catch.cont = cont; in parserep()
434 catcher.re.rep_catch.beg = s; in parserep()
435 catcher.re.rep_catch.n = n + 1; in parserep()
[all …]
H A Dregcomp.c157 e->re.data = (char*)e + sizeof(Rex_t); in node()
194 drop(disc, e->re.group.expr.binary.left); in drop()
195 drop(disc, e->re.group.expr.binary.right); in drop()
205 drop(disc, e->re.group.expr.rex); in drop()
209 triedrop(disc, e->re.trie.root[i]); in drop()
237 if (e->re.group.expr.binary.left) in mark()
238 mark(e->re.group.expr.binary.left, set); in mark()
239 if (e->re.group.expr.binary.right) in mark()
240 mark(e->re.group.expr.binary.right, set); in mark()
251 mark(e->re.group.expr.rex, set); in mark()
[all …]
H A Dregdecomp.c94 if (decomp(e->re.group.expr.binary.left, sp, type, delimiter, flags)) in decomp()
97 …if (e->re.group.expr.binary.right && decomp(e->re.group.expr.binary.right, sp, type, delimiter, fl… in decomp()
147 if (decomp(e->re.group.expr.rex, sp, type, delimiter, flags)) in decomp()
157 if (settst(e->re.charclass, m)) in decomp()
265 meta(sp, e->re.onechar, type, 0, delimiter); in decomp()
300 t = (s = e->re.string.base) + e->re.string.size; in decomp()
310 if (e->re.trie.root[c]) in decomp()
318 detrie(e->re.trie.root[c], sp, pfx, pfx, &pfx[sizeof(pfx)], delimiter); in decomp()
324 if (decomp(e->re.group.expr.rex, sp, type, delimiter, flags)) in decomp()
332 if (decomp(e->re.group.expr.binary.left, sp, type, delimiter, flags)) in decomp()
[all …]
/titanic_51/usr/src/lib/libdwarf/common/
H A Ddwarf_ranges.c90 struct ranges_entry * re = calloc(sizeof(struct ranges_entry),1); in dwarf_get_ranges_a() local
91 if(!re) { in dwarf_get_ranges_a()
103 READ_UNALIGNED(dbg,re->cur.dwr_addr1, in dwarf_get_ranges_a()
107 READ_UNALIGNED(dbg,re->cur.dwr_addr2 , in dwarf_get_ranges_a()
112 base = re; in dwarf_get_ranges_a()
113 last = re; in dwarf_get_ranges_a()
115 last->next = re; in dwarf_get_ranges_a()
116 last = re; in dwarf_get_ranges_a()
118 if(re->cur.dwr_addr1 == 0 && re in dwarf_get_ranges_a()
[all...]
/titanic_51/usr/src/contrib/ast/src/cmd/ksh93/tests/
H A Dquoting.sh306 re='@(?*)/@(?*)/@(?*)'
307 [[ ${subject/${re}/\3} != words ]] && err_exit 'string replacement with \3 not working'
308 [[ ${subject/${re}/'\3'} != '\3' ]] && err_exit 'string replacement with '"'\3'"' not working'
309 [[ ${subject/${re}/"\\3"} != '\3' ]] && err_exit 'string replacement with "\\3" not working'
310 [[ ${subject/${re}/"\3"} != '\3' ]] && err_exit 'string replacement with "\3" not working'
312 [[ ${subject/${re}/${string}} != words ]] && err_exit 'string replacement with $string not working with string=\3'
313 [[ $(print -r "${subject/${re}/${string}}") != words ]] && err_exit 'string replacement with $string not working with string=\3 using print'
314 [[ ${subject/${re}/"${string}"} != '\3' ]] && err_exit 'string replacement with "$string" not working with string=\3'
315 [[ $(print -r "${subject/${re}/"${string}"}") != '\3' ]] && err_exit 'string replacement with "$string" not working with string=\3 using print'
317 [[ ${subject/${re}/
[all...]
/titanic_51/usr/src/lib/libshell/common/tests/
H A Dquoting.sh306 [[ ${subject/${re}/\3} != words ]] && err_exit 'string replacement with \3 not working'
307 [[ ${subject/${re}/'\3'} != '\3' ]] && err_exit 'string replacement with '"'\3'"' not working'
308 [[ ${subject/${re}/"\\3"} != '\3' ]] && err_exit 'string replacement with "\\3" not working'
309 [[ ${subject/${re}/"\3"} != '\3' ]] && err_exit 'string replacement with "\3" not working'
311 [[ ${subject/${re}/${string}} != words ]] && err_exit 'string replacement with $string not working …
312 [[ $(print -r "${subject/${re}/${string}}") != words ]] && err_exit 'string replacement with $strin…
313 [[ ${subject/${re}/"${string}"} != '\3' ]] && err_exit 'string replacement with "$string" not worki…
314 [[ $(print -r "${subject/${re}/"${string}"}") != '\3' ]] && err_exit 'string replacement with "$str…
316 [[ ${subject/${re}/${string}} != '\3' ]] && err_exit 'string replacement with $string not working w…
317 [[ ${subject/${re}/"${string}"} != '\\3' ]] && err_exit 'string replacement with "$string" not work…
[all …]
/titanic_51/usr/src/cmd/vi/port/
H A Dex_re.c39 * The compiled-regular-expression storage areas (re, scanre, and subre)
66 * Very similar to ed, with some re extensions and
91 * Hence you're only in a global command if inglobal==2. This
102 error(value(vi_TERSE) ? gettext("Global needs re") :
320 error(value(vi_TERSE) ? gettext("Substitute needs re") : in compsub()
333 if (re == NULL || re->Expbuf[1] == 0) in compsub()
334 error(value(vi_TERSE) ? gettext("No previous re") : in compsub()
337 error(value(vi_TERSE) ? gettext("No previous substitute re") : in compsub()
641 if(re ! in dosub()
[all...]
/titanic_51/usr/src/tools/onbld/Checks/
H A DHdrChk.py70 import re, os, sys
110 if self.lenient and re.search(r'^\s*//', line):
114 if not re.search(r'^\s*/\*', line):
117 while not re.search(r'\*/', line):
153 IDENT = re.compile(r'(%s)' % '|'.join(idents))
187 match = re.search(r'^#ifndef\s([a-zA-Z0-9_]+)$', line)
206 if not re.search(r'^_.*%s[_]?$' % guardname, guard):
212 if not re.search(r'#define\s%s$' % guard, line):
247 match = re.search(r'^#include(.*)$', line)
253 if not lenient and not re
[all...]
/titanic_51/usr/src/lib/libast/sparc/include/ast/
H A Dregexp.h90 …regexp_t* re, const char* instring, char* ep, const char* endbuf, int seof), (re, instring, ep, en… in __OTORP__()
99 re->re_nodelim = 0;
105 re->re_nodelim = 1;
107 if (!re->re_sed && !prev)
117 if (re->re_sed)
120 re->re_nodelim = 1;
131 if (c = _re_comp(re, _re_putc(0), ep, (char*)endbuf - ep))
/titanic_51/usr/src/lib/libast/i386/include/ast/
H A Dregexp.h90 …regexp_t* re, const char* instring, char* ep, const char* endbuf, int seof), (re, instring, ep, en… in __OTORP__()
99 re->re_nodelim = 0;
105 re->re_nodelim = 1;
107 if (!re->re_sed && !prev)
117 if (re->re_sed)
120 re->re_nodelim = 1;
131 if (c = _re_comp(re, _re_putc(0), ep, (char*)endbuf - ep))
/titanic_51/usr/src/lib/libast/amd64/include/ast/
H A Dregexp.h90 …regexp_t* re, const char* instring, char* ep, const char* endbuf, int seof), (re, instring, ep, en… in __OTORP__()
99 re->re_nodelim = 0;
105 re->re_nodelim = 1;
107 if (!re->re_sed && !prev)
117 if (re->re_sed)
120 re->re_nodelim = 1;
131 if (c = _re_comp(re, _re_putc(0), ep, (char*)endbuf - ep))
/titanic_51/usr/src/lib/libast/sparcv9/include/ast/
H A Dregexp.h90 …regexp_t* re, const char* instring, char* ep, const char* endbuf, int seof), (re, instring, ep, en… in __OTORP__()
99 re->re_nodelim = 0;
105 re->re_nodelim = 1;
107 if (!re->re_sed && !prev)
117 if (re->re_sed)
120 re->re_nodelim = 1;
131 if (c = _re_comp(re, _re_putc(0), ep, (char*)endbuf - ep))
/titanic_51/usr/src/cmd/sort/common/
H A Dinternal.c96 ssize_t re; /* boundary of right equal partition */ in tqs_algorithm() local
122 r = re = n - 1; in tqs_algorithm()
135 swap((void **)&X[r], (void **)&X[re--]); in tqs_algorithm()
150 p = MIN(re - r, n - re - 1); in tqs_algorithm()
157 q = re - r; in tqs_algorithm()
194 ssize_t re; /* boundary of right equal partition */ in rqs_algorithm() local
220 r = re = n - 1; in rqs_algorithm()
238 X[r] = X[re]; in rqs_algorithm()
239 X[re] in rqs_algorithm()
[all...]

12345678910>>...12