HomeSort by relevance Sort by last modified time
    Searched defs:re (Results 1 - 25 of 62) sorted by null

1 2 3

  /onnv/onnv-gate/usr/src/common/openssl/crypto/perlasm/
x86_64-xlate.pl 68 sub re { subroutine
120 sub re { subroutine
144 sub re { subroutine
203 sub re { subroutine
238 sub re { subroutine
278 sub re { subroutine
298 sub re { subroutine
401 if ($label=label->re(\$line)) { print $label->out(); }
403 if (directive->re(\$line)) {
405 } elsif ($opcode=opcode->re(\$line)) { ARGUMENT:
    [all...]
  /onnv/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/ext/re/
re.pm 1 package re; package
7 re - Perl pragma to alter regular expression behaviour
11 use re 'taint';
15 use re 'eval';
19 no re 'taint'; # the default
22 no re 'eval'; # the default
26 use re 'debug'; # NOT lexically scoped (as others are)
30 use re 'debugcolor'; # same as 'debug', but with colored output
37 When C<use re 'taint'> is in effect, and a tainted string is the target
43 When C<use re 'eval'> is in effect, a regex is allowed to contai
    [all...]
  /onnv/onnv-gate/usr/src/lib/libast/common/comp/
re_comp.c 37 regex_t re; member in struct:__anon27
57 regfree(&state.re);
59 if (!(r = regcomp(&state.re, pattern, REG_LENIENT|REG_NOSUB|REG_NULL)))
65 regerror(r, &state.re, state.error, sizeof(state.error));
73 switch (regexec(&state.re, subject, 0, NiL, 0))
fnmatch.c 57 regex_t re; local
65 if (!(reflags = regcomp(&re, pattern, reflags)))
67 reflags = regexec(&re, subject, 1, &match, 0);
68 regfree(&re);
73 else if (!(reflags = regcomp(&re, pattern, reflags|REG_RIGHT)))
75 reflags = regexec(&re, subject, 0, NiL, 0);
76 regfree(&re);
regexp.c 36 regex_t re; member in struct:__anon29
55 _re_comp(regexp_t* re, const char* pattern, char* handle, unsigned int size)
65 n = regcomp(&env->re, pattern, REG_LENIENT|REG_NULL);
89 re->re_nbra = env->re.re_nsub;
94 _re_exec(regexp_t* re, const char* subject, const char* handle, int anchor)
98 regmatch_t match[elementsof(re->re_braslist)+1];
100 if (regexec(&env->re, subject, elementsof(match), match, 0) || anchor && match[0].rm_so)
102 re->re_loc1 = (char*)subject + match[0].rm_so;
103 re->re_loc2 = (char*)subject + match[0].rm_eo
    [all...]
regcmp.c 39 regex_t re; member in struct:__anon28
51 register Regex_t* re = (Regex_t*)handle; local
53 if (data || (size = roundof(size, ALIGN_BOUND2)) > (re->buf + re->size - re->cur))
55 data = (void*)re->cur;
56 re->cur += size;
64 register Regex_t* re; local
154 re = 0;
158 if ((n += INC) > TOT || !(re = newof(re, Regex_t, 0, n))
185 register Regex_t* re; local
    [all...]
  /onnv/onnv-gate/usr/src/cmd/vi/port/
ex_re.h 47 * There are three regular expressions here, the previous (in re),
49 * It would be possible to get rid of "re" by making it a stack parameter
52 var struct regexp *re; /* Last re */ variable in typeref:struct:regexp
53 var struct regexp *scanre; /* Last scanning re */
54 var struct regexp *subre; /* Last substitute re */
  /onnv/onnv-gate/usr/src/cmd/devfsadm/
dcam1394_link.c 102 devfsadm_enumerate_t re[1]; local
120 re[0].re = restring0;
121 re[0].subexp = 1;
122 re[0].flags = MATCH_ALL;
137 if (devfsadm_enumerate_int(p_path, 0, &buf, re, 1)) {
ieee1394_link.c 81 devfsadm_enumerate_t re[] = {"^1394/hba([0-9]+)$", 1, MATCH_ALL}; local
96 if (devfsadm_enumerate_int(p_path, 0, &buf, re, 1)) {
  /onnv/onnv-gate/usr/src/lib/libast/common/string/
strmatch.c 32 * sh pattern egrep RE description
80 register regex_t* re; local
124 if (!(re = regcache(p, reflags, NiL)))
132 if (regexec(re, b, n, matchstate.match, reflags & ~(REG_MINIMAL|REG_SHELL_GROUP|REG_LEFT|REG_RIGHT|REG_ICASE)))
136 i = re->re_nsub;
  /onnv/onnv-gate/usr/src/cmd/bc/
bc.y 58 %type <iptr> slist, re, fprefix, cargs, eora, cons, constant, lora
162 | _IF CRS BLEV '(' re ')' stat
167 | _WHILE CRS '(' re ')' stat BLEV
173 | fprefix CRS re ';' e ')' stat BLEV
231 re : e EQ e label
  /onnv/onnv-gate/usr/src/cmd/man/src/util/instant.src/tptregexp/
timer.c 35 char *re, *str, *ans, *src, *dst; member in struct:try
69 one.re = argv[4];
120 for (i = 0; tests[i].re != NULL; i++) {
135 r = tpt_regcomp(fields.re);
138 complain("tpt_regcomp failure in `%s'", fields.re);
142 complain("unexpected tpt_regcomp success in `%s'", fields.re);
148 r = tpt_regcomp(fields.re);
  /onnv/onnv-gate/usr/src/cmd/sort/common/
internal.c 96 ssize_t re; /* boundary of right equal partition */ local
122 r = re = n - 1;
135 swap((void **)&X[r], (void **)&X[re--]);
150 p = MIN(re - r, n - re - 1);
157 q = re - r;
194 ssize_t re; /* boundary of right equal partition */ local
220 r = re = n - 1;
238 X[r] = X[re];
239 X[re] = t
    [all...]
  /onnv/onnv-gate/usr/src/cmd/fm/fminject/common/
inj_cmds.c 61 inj_randelem_t *re = inj_zalloc(sizeof (inj_randelem_t)); local
63 re->re_event = ev;
64 re->re_prob = prob;
66 return (re);
  /onnv/onnv-gate/usr/src/cmd/logadm/
glob.c 227 char *re; local
255 if ((re = regcmp("^", sp, "$", (char *)0)) == NULL)
273 if (regex(re, dp->d_name, ret0)) {
  /onnv/onnv-gate/usr/src/cmd/man/src/util/nsgmls.src/include/
UnivCharsetDesc.h 38 re = 13, enumerator in enum:SP_NAMESPACE::UnivCharsetDesc::__anon833
  /onnv/onnv-gate/usr/src/lib/libast/common/regex/
regcache.c 32 #define CACHE 8 /* default # cached re's */
47 regex_t re; member in struct:Cache_s
76 regfree(&matchstate.cache[i]->re);
81 * return regcomp() compiled re for pattern and reflags
154 regfree(&matchstate.cache[i]->re);
180 regfree(&cp->re);
193 if (i = regcomp(&cp->re, pattern, cp->reflags))
206 return &cp->re;
  /onnv/onnv-gate/usr/src/lib/libpp/common/
ppexpr.c 114 regex_t re; local
129 else if ((c = regcomp(&re, pp.token, REG_AUGMENTED|REG_LENIENT|REG_NULL)) || (c = regexec(&re, tmp, NiL, 0, 0)) && c != REG_NOMATCH)
130 regfatal(&re, 3, c);
134 regfree(&re);
  /onnv/onnv-gate/usr/src/common/ctf/
ctf_types.c 576 ctf_encoding_t le, re; local
600 ctf_type_encoding(rfp, rtype, &re) == 0 &&
601 bcmp(&le, &re, sizeof (ctf_encoding_t)) == 0);
  /onnv/onnv-gate/usr/src/lib/libdhcpsvc/modules/binfiles/
dhcp_network.c 237 * Virtually reserve all the space we're going to need for
240 * increase in size as we fill in holes). We're guaranteed
350 * container because we're MT-hot here.
605 * We're going to insert `rec' at the head of the `hash' hash
619 * If there's a record currently on the hash chain (i.e, we're
926 * update our neighboring records' record id pointers. If we're
929 * we're changing record id's, then update our neighbors with our
996 * If we're using the temporary record, then set `dnh_tempimage' to
997 * the image that will be active when we're done. This piece of
1110 char *re, **new_listpp, **listpp = NULL; local
    [all...]
  /onnv/onnv-gate/usr/src/lib/libdhcpsvc/modules/files/
dhcp_network.c 201 * If we're searching by client IP address, then build a target
221 * If we're searching by client IP address, locate it
490 * If we're changing the key for this record, make sure the key
491 * we're changing to doesn't already exist.
506 * If we're adding a new record, make sure the record doesn't
520 * If we're deleting or modifying record, make sure the record
522 * check signatures if we're deleting the record and origp->dn_sig
544 * Note the offset of the record we're modifying or deleting
561 * Make a new copy of the container. If we're deleting or
636 char *re, **new_listpp, **listpp = NULL local
    [all...]
  /onnv/onnv-gate/usr/src/lib/libdhcpsvc/modules/files0/
dhcp_network.c 419 * If we're adding a new record or changing a key for an existing
436 * If we're deleting or modifying record, make sure the record
451 * Note the offset of the record we're modifying or deleting
468 * Make a new copy of the container. If we're deleting or
539 char *re, **new_listpp, **listpp = NULL; local
561 re = regcmp("^(([0-9]{1,3}\\_){3}[0-9]{1,3})$0$", (char *)0);
562 if (re == NULL)
566 if (regex(re, result->d_name, ipaddr) != NULL) {
591 free(re);
599 free(re);
    [all...]
  /onnv/onnv-gate/usr/src/lib/libast/common/disc/
sfkeyprintf.c 48 regex_t* re[2]; member in struct:__anon33
287 if (fp->re[x])
288 regfree(fp->re[x]);
290 fp->re[x] = &fp->red[x];
291 if (regcomp(fp->re[x], f.next, REG_DELIMITED|REG_NULL))
293 f.next += fp->re[x]->re_npat;
294 if (regsubcomp(fp->re[x], f.next, NiL, 0, 0))
296 f.next += fp->re[x]->re_npat;
297 if (!regexec(fp->re[x], s, elementsof(match), match, 0) && !regsubexec(fp->re[x], s, elementsof(match), match)
    [all...]
  /onnv/onnv-gate/usr/src/lib/libast/common/misc/
findlib.h 66 regex_t re; member in struct:__anon57
  /onnv/onnv-gate/usr/src/lib/libcmd/common/
expr.c 300 regex_t re; local
312 if (n = regcomp(&re, rp.str, REG_LEFT|REG_LENIENT))
313 regfatal(&re, ERROR_exit(2), n);
314 if (!(n = regexec(&re, cp, elementsof(match), match, 0)))
316 if (re.re_nsub > 0)
334 regfatal(&re, ERROR_exit(2), n);
335 else if (re.re_nsub)
340 regfree(&re);

Completed in 6529 milliseconds

1 2 3