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

  /bionic/libc/upstream-netbsd/lib/libc/regex/
regex2.h 202 sopno nplus; /* how deep does it nest +s? */ member in struct:re_guts
engine.c 115 const char **lastpos; /* [nplus+1] */
274 if (g->nplus > 0 && m->lastpos == NULL)
275 m->lastpos = malloc((g->nplus+1) *
277 if (g->nplus > 0 && m->lastpos == NULL) {
289 assert(g->nplus == 0 || m->lastpos != NULL);
698 assert(lev+1 <= m->g->nplus);
regcomp.c 318 g->nplus = pluscount(p, g);
    [all...]
  /external/llvm/lib/Support/
regex2.h 153 sopno nplus; /* how deep does it nest +s? */ member in struct:re_guts
regengine.inc 79 const char **lastpos; /* [nplus+1] */
222 if (g->nplus > 0 && m->lastpos == NULL)
223 m->lastpos = (const char **)malloc((g->nplus+1) *
225 if (g->nplus > 0 && m->lastpos == NULL) {
238 assert(g->nplus == 0 || m->lastpos != NULL);
610 assert(lev+1 <= m->g->nplus);
regcomp.c 244 g->nplus = pluscount(p, g);
    [all...]
  /ndk/sources/host-tools/ndk-stack/regex/
regex2.h 150 sopno nplus; /* how deep does it nest +s? */ member in struct:re_guts
engine.c 79 char **lastpos; /* [nplus+1] */
218 if (g->nplus > 0 && m->lastpos == NULL)
219 m->lastpos = (char **)malloc((g->nplus+1) *
221 if (g->nplus > 0 && m->lastpos == NULL) {
234 assert(g->nplus == 0 || m->lastpos != NULL);
601 assert(lev+1 <= m->g->nplus);
regcomp.c 228 g->nplus = pluscount(p, g);
    [all...]

Completed in 1431 milliseconds