HomeSort by relevance Sort by last modified time
    Searched refs:preg (Results 1 - 21 of 21) sorted by null

  /bionic/libc/regex/
regfree.c 49 regfree(regex_t *preg)
53 if (preg->re_magic != MAGIC1) /* oops */
56 g = preg->re_g;
59 preg->re_magic = 0; /* mark it invalid */
regerror.c 79 regerror(int errcode, const regex_t *preg, char *errbuf, size_t errbuf_size)
88 s = regatoi(preg, convbuf, sizeof convbuf);
118 regatoi(const regex_t *preg, char *localbuf, int localbufsize)
123 if (strcmp(r->name, preg->re_endp) == 0)
regexec.c 139 regexec(const regex_t *preg, const char *string, size_t nmatch,
142 struct re_guts *g = preg->re_g;
149 if (preg->re_magic != MAGIC1 || g->magic != MAGIC2)
regcomp.c 149 regcomp(regex_t *preg, const char *pattern, int cflags)
167 if (preg->re_endp < pattern)
169 len = preg->re_endp - pattern;
230 preg->re_nsub = g->nsub;
231 preg->re_g = g;
232 preg->re_magic = MAGIC1;
241 regfree(preg);
    [all...]
  /external/llvm/lib/Support/
regfree.c 50 llvm_regfree(llvm_regex_t *preg)
54 if (preg->re_magic != MAGIC1) /* oops */
57 g = preg->re_g;
60 preg->re_magic = 0; /* mark it invalid */
regerror.c 84 llvm_regerror(int errcode, const llvm_regex_t *preg, char *errbuf, size_t errbuf_size)
93 s = regatoi(preg, convbuf, sizeof convbuf);
123 regatoi(const llvm_regex_t *preg, char *localbuf, int localbufsize)
128 if (strcmp(r->name, preg->re_endp) == 0)
Regex.cpp 24 preg = new llvm_regex();
25 preg->re_endp = regex.end();
30 error = llvm_regcomp(preg, regex.data(), flags|REG_EXTENDED|REG_PEND);
34 llvm_regfree(preg);
35 delete preg;
42 size_t len = llvm_regerror(error, preg, NULL, 0);
45 llvm_regerror(error, preg, &Error[0], len);
52 return preg->re_nsub;
56 unsigned nmatch = Matches ? preg->re_nsub+1 : 0;
64 int rc = llvm_regexec(preg, String.data(), nmatch, pm.data(), REG_STARTEND)
    [all...]
regexec.c 141 llvm_regexec(const llvm_regex_t *preg, const char *string, size_t nmatch,
144 struct re_guts *g = preg->re_g;
151 if (preg->re_magic != MAGIC1 || g->magic != MAGIC2)
regcomp.c 157 llvm_regcomp(llvm_regex_t *preg, const char *pattern, int cflags)
175 if (preg->re_endp < pattern)
177 len = preg->re_endp - pattern;
238 preg->re_nsub = g->nsub;
239 preg->re_g = g;
240 preg->re_magic = MAGIC1;
249 llvm_regfree(preg);
    [all...]
  /ndk/sources/host-tools/ndk-stack/regex/
regfree.c 51 regfree(regex_t *preg)
55 if (preg->re_magic != MAGIC1) /* oops */
58 g = preg->re_g;
61 preg->re_magic = 0; /* mark it invalid */
regerror.c 79 regerror(int errcode, const regex_t *preg, char *errbuf, size_t errbuf_size)
88 s = regatoi(preg, convbuf, sizeof convbuf);
118 regatoi(const regex_t *preg, char *localbuf, int localbufsize)
123 if (strcmp(r->name, preg->re_endp) == 0)
regexec.c 139 regexec(const regex_t *preg, const char *string, size_t nmatch,
142 struct re_guts *g = preg->re_g;
149 if (preg->re_magic != MAGIC1 || g->magic != MAGIC2)
regcomp.c 149 regcomp(regex_t *preg, const char *pattern, int cflags)
167 if (preg->re_endp < pattern)
169 len = preg->re_endp - pattern;
230 preg->re_nsub = g->nsub;
231 preg->re_g = g;
232 preg->re_magic = MAGIC1;
241 regfree(preg);
    [all...]
  /ndk/sources/host-tools/sed-4.2.1/lib/
regex.c 31 # define regfree(preg) __regfree (preg)
33 # define regcomp(preg, pattern, cflags) __regcomp (preg, pattern, cflags)
34 # define regerror(errcode, preg, errbuf, errbuf_size) \
35 __regerror(errcode, preg, errbuf, errbuf_size)
regcomp.c 23 static reg_errcode_t re_compile_internal (regex_t *preg, const char * pattern,
32 static void free_workarea_compile (regex_t *preg);
37 static reg_errcode_t analyze (regex_t *preg);
46 static bin_tree_t *lower_subexp (reg_errcode_t *err, regex_t *preg,
62 static bin_tree_t *parse (re_string_t *regexp, regex_t *preg,
64 static bin_tree_t *parse_reg_exp (re_string_t *regexp, regex_t *preg,
67 static bin_tree_t *parse_branch (re_string_t *regexp, regex_t *preg,
70 static bin_tree_t *parse_expression (re_string_t *regexp, regex_t *preg,
73 static bin_tree_t *parse_sub_exp (re_string_t *regexp, regex_t *preg,
445 PREG is a regex_t *. We do not expect any fields to be initialized
1301 regex_t *preg = (regex_t *) extra; local
    [all...]
regexec.c 41 static reg_errcode_t re_search_internal (const regex_t *preg,
75 static reg_errcode_t set_regs (const regex_t *preg,
212 /* regexec searches for a given pattern, specified by PREG, in the
227 regexec (preg, string, nmatch, pmatch, eflags)
228 const regex_t *_Restrict_ preg;
237 re_dfa_t *dfa = (re_dfa_t *) preg->buffer;
255 if (preg->no_sub)
256 err = re_search_internal (preg, string, length, start, length,
259 err = re_search_internal (preg, string, length, start, length,
274 __compat_regexec (const regex_t *_Restrict_ preg,
    [all...]
  /external/llvm/include/llvm/Support/
Regex.h 76 struct llvm_regex *preg; member in class:llvm::Regex
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 186 assert(isPRegOption(vreg, option) && "Not a preg option.");
207 // Collect the set of preg intervals, record that they're used in the MF.
230 unsigned preg = rawOrder[i]; local
231 if (!reservedRegs.test(preg)) {
232 vrAllowed.push_back(preg);
242 unsigned preg = *pregItr; local
243 const LiveInterval *pregLI = &lis->getInterval(preg);
250 overlappingPRegs.insert(preg);
275 for (unsigned preg = 0; preg < tri->getNumRegs(); ++preg)
283 unsigned preg = *pregItr; local
546 unsigned preg = problem.getPRegForOption(vreg, alloc); local
    [all...]
RenderMachineFunction.cpp 348 for (unsigned preg = 1; preg < tri->getNumRegs(); ++preg) {
349 WorstMapLine &pregLine = prWorst[preg];
361 if (tri->regsOverlap(preg, trcPReg))
    [all...]
  /external/valgrind/main/VEX/priv/
guest_amd64_helpers.c 1512 Int stno, preg; local
1572 Int i, stno, preg; local
1932 Int stno, preg; local
1983 Int i, stno, preg; local
    [all...]
guest_x86_helpers.c 1567 Int stno, preg; local
1627 Int i, stno, preg; local
    [all...]

Completed in 352 milliseconds