Searched refs:nsub (Results 1 – 8 of 8) sorted by relevance
41 int nsub; member71 int nsub; in regcmp() local84 nsub = 0; in regcmp()135 if (nsub <= j) in regcmp()137 if (!nsub) in regcmp()139 nsub = j + 1; in regcmp()177 if (re->nsub = nsub) in regcmp()178 memcpy(re->sub, sub, (nsub + 1) * sizeof(sub[0])); in regcmp()196 for (n = 0; n < re->nsub; n++) in regex()201 for (n = 0; n < re->nsub; n++) in regex()
286 m->pmatch = (regmatch_t *)malloc((m->g->nsub + 1) * in matcher()292 for (i = 1; i <= m->g->nsub; i++) in matcher()325 for (i = 1; i <= m->g->nsub; i++) { in matcher()353 if (i <= m->g->nsub) in matcher()536 assert(0 < i && i <= m->g->nsub); in dissect()541 assert(0 < i && i <= m->g->nsub); in dissect()665 assert(0 < i && i <= m->g->nsub); in backref()724 assert(0 < i && i <= m->g->nsub); in backref()734 assert(0 < i && i <= m->g->nsub); in backref()
227 g->nsub = 0; in regcomp()259 preg->re_nsub = g->nsub; in regcomp()340 p->g->nsub++; in p_ere_exp()341 subno = p->g->nsub; in p_ere_exp()570 p->g->nsub++; in p_simp_re()571 subno = p->g->nsub; in p_simp_re()601 assert(i <= p->g->nsub); in p_simp_re()
185 size_t nsub; /* copy of re_nsub */ member
1570 size_t nsub, /* number of subexpressions */ in int_regwexec() argument1582 if (nsub > 0 && sub) { in int_regwexec()1583 if ((mbsub = malloc(nsub * sizeof (regmatch_t))) == NULL) in int_regwexec()1589 i = regexec(&rcp->re, mbs, nsub, mbsub, flags); in int_regwexec()1592 if (i == REG_OK && nsub > 0 && mbsub) { in int_regwexec()1595 for (j = 0; j < nsub; j++) { in int_regwexec()
388 … ");for (i = 0; i <= env->nsub; i++)showmatch(&env->best[i]);sfprintf(sfstdout, "\n new … in _better()1040 r = env->nsub; in parse()1877 n = env->nsub; in regnexec()1951 n = env->nsub; in regnexec()1965 n = env->nsub; in regnexec()
541 size_t nsub; /* internal re_nsub */ member
3363 p->env->nsub = env.stats.p + env.stats.u; in regcomp()