elems 361 maint/gnulib/lib/dfa.c position *elems; /* Elements of this position set. */ elems 372 maint/gnulib/lib/dfa.c position_set elems; /* Positions this state could match. */ elems 2005 maint/gnulib/lib/dfa.c free (dst->elems); elems 2006 maint/gnulib/lib/dfa.c dst->elems = xpalloc (NULL, &dst->alloc, src->nelem - dst->alloc, -1, elems 2007 maint/gnulib/lib/dfa.c sizeof *dst->elems); elems 2011 maint/gnulib/lib/dfa.c memcpy (dst->elems, src->elems, src->nelem * sizeof *dst->elems); elems 2017 maint/gnulib/lib/dfa.c s->elems = xnmalloc (size, sizeof *s->elems); elems 2034 maint/gnulib/lib/dfa.c if (s->elems[mid].index < p.index) elems 2036 maint/gnulib/lib/dfa.c else if (s->elems[mid].index == p.index) elems 2038 maint/gnulib/lib/dfa.c s->elems[mid].constraint |= p.constraint; elems 2045 maint/gnulib/lib/dfa.c s->elems = maybe_realloc (s->elems, count, &s->alloc, -1, sizeof *s->elems); elems 2047 maint/gnulib/lib/dfa.c s->elems[i] = s->elems[i - 1]; elems 2048 maint/gnulib/lib/dfa.c s->elems[lo] = p; elems 2056 maint/gnulib/lib/dfa.c s->elems = maybe_realloc (s->elems, count, &s->alloc, -1, sizeof *s->elems); elems 2057 maint/gnulib/lib/dfa.c s->elems[s->nelem++] = p; elems 2071 maint/gnulib/lib/dfa.c free (m->elems); elems 2073 maint/gnulib/lib/dfa.c m->elems = xpalloc (NULL, &m->alloc, s2->nelem, -1, sizeof *m->elems); elems 2078 maint/gnulib/lib/dfa.c || (i < s1->nelem && s1->elems[i].index <= s2->elems[j].index)) elems 2081 maint/gnulib/lib/dfa.c && s1->elems[i].index == s2->elems[j].index) elems 2082 maint/gnulib/lib/dfa.c ? s2->elems[j++].constraint & c2 elems 2084 maint/gnulib/lib/dfa.c m->elems[m->nelem].index = s1->elems[i].index; elems 2085 maint/gnulib/lib/dfa.c m->elems[m->nelem++].constraint = s1->elems[i++].constraint | c; elems 2089 maint/gnulib/lib/dfa.c if (s2->elems[j].constraint & c2) elems 2091 maint/gnulib/lib/dfa.c m->elems[m->nelem].index = s2->elems[j].index; elems 2092 maint/gnulib/lib/dfa.c m->elems[m->nelem++].constraint = s2->elems[j].constraint & c2; elems 2114 maint/gnulib/lib/dfa.c insert (src->elems[i], dst); elems 2133 maint/gnulib/lib/dfa.c if (s->elems[mid].index < del) elems 2135 maint/gnulib/lib/dfa.c else if (s->elems[mid].index == del) elems 2137 maint/gnulib/lib/dfa.c unsigned int c = s->elems[mid].constraint; elems 2140 maint/gnulib/lib/dfa.c s->elems[i] = s->elems[i + 1]; elems 2176 maint/gnulib/lib/dfa.c idx_t ind = s->elems[i].index; elems 2177 maint/gnulib/lib/dfa.c hash ^= ind + s->elems[i].constraint; elems 2183 maint/gnulib/lib/dfa.c if (hash != d->states[i].hash || s->nelem != d->states[i].elems.nelem elems 2188 maint/gnulib/lib/dfa.c if (s->elems[j].constraint != d->states[i].elems.elems[j].constraint elems 2189 maint/gnulib/lib/dfa.c || s->elems[j].index != d->states[i].elems.elems[j].index) elems 2199 maint/gnulib/lib/dfa.c fprintf (stderr, " %td:", s->elems[j].index); elems 2200 maint/gnulib/lib/dfa.c prtok (d->tokens[s->elems[j].index]); elems 2219 maint/gnulib/lib/dfa.c int c = d->constraints[s->elems[j].index]; elems 2226 maint/gnulib/lib/dfa.c else if (d->tokens[s->elems[j].index] == BACKREF) elems 2235 maint/gnulib/lib/dfa.c alloc_position_set (&d->states[i].elems, s->nelem); elems 2236 maint/gnulib/lib/dfa.c copy (s, &d->states[i].elems); elems 2240 maint/gnulib/lib/dfa.c d->states[i].mbps.elems = NULL; elems 2294 maint/gnulib/lib/dfa.c replace (&d->follows[backward[i].elems[j].index], i, &d->follows[i], elems 2297 maint/gnulib/lib/dfa.c replace (&backward[d->follows[i].elems[j].index], i, &backward[i], elems 2300 maint/gnulib/lib/dfa.c free (tmp.elems); elems 2336 maint/gnulib/lib/dfa.c separate_contexts |= d->separates[s->elems[j].index]; elems 2370 maint/gnulib/lib/dfa.c idx_t sindex = follows[tindex].elems[i].index; elems 2373 maint/gnulib/lib/dfa.c unsigned int iconstraint = follows[tindex].elems[i].constraint; elems 2377 maint/gnulib/lib/dfa.c if (d->tokens[follows[tindex].elems[i].index] <= END) elems 2379 maint/gnulib/lib/dfa.c d->constraints[tindex] |= follows[tindex].elems[i].constraint; elems 2389 maint/gnulib/lib/dfa.c idx_t dindex = follows[tindex].elems[j].index; elems 2394 maint/gnulib/lib/dfa.c if (follows[tindex].elems[j].constraint != iconstraint) elems 2418 maint/gnulib/lib/dfa.c follows[tindex].elems[nelem++] = follows[tindex].elems[i]; elems 2452 maint/gnulib/lib/dfa.c free (d->follows[i].elems); elems 2453 maint/gnulib/lib/dfa.c d->follows[i].elems = NULL; elems 2467 maint/gnulib/lib/dfa.c if (map[d->follows[i].elems[j].index] == -1) elems 2468 maint/gnulib/lib/dfa.c map[d->follows[i].elems[j].index] = nleaves++; elems 2470 maint/gnulib/lib/dfa.c d->follows[i].elems[j].index = map[d->follows[i].elems[j].index]; elems 2473 maint/gnulib/lib/dfa.c qsort (d->follows[i].elems, d->follows[i].nelem, elems 2474 maint/gnulib/lib/dfa.c sizeof *d->follows[i].elems, compare); elems 2505 maint/gnulib/lib/dfa.c if (d->follows[i].elems[j].index == i) elems 2506 maint/gnulib/lib/dfa.c flags[d->follows[i].elems[j].index] |= OPT_REPEAT; elems 2507 maint/gnulib/lib/dfa.c else if (d->follows[i].elems[j].index < i) elems 2508 maint/gnulib/lib/dfa.c flags[d->follows[i].elems[j].index] |= OPT_LPAREN; elems 2509 maint/gnulib/lib/dfa.c else if (flags[d->follows[i].elems[j].index] &= OPT_WALKED) elems 2510 maint/gnulib/lib/dfa.c flags[d->follows[i].elems[j].index] |= OPT_RPAREN; elems 2512 maint/gnulib/lib/dfa.c flags[d->follows[i].elems[j].index] |= OPT_WALKED; elems 2530 maint/gnulib/lib/dfa.c free (merged->elems); elems 2648 maint/gnulib/lib/dfa.c tmp.elems = lastpos - stk[-1].nlastpos; elems 2658 maint/gnulib/lib/dfa.c tmp.elems = firstpos - stk[-1].nfirstpos; elems 2677 maint/gnulib/lib/dfa.c tmp.elems = lastpos - stk[-1].nlastpos - stk[-2].nlastpos; elems 2687 maint/gnulib/lib/dfa.c tmp.elems = firstpos - stk[-1].nfirstpos; elems 2779 maint/gnulib/lib/dfa.c free (backward[i].elems); elems 2796 maint/gnulib/lib/dfa.c fprintf (stderr, " %td:", d->follows[i].elems[j].index); elems 2797 maint/gnulib/lib/dfa.c prtok (d->tokens[d->follows[i].elems[j].index]); elems 2821 maint/gnulib/lib/dfa.c if (prev_newline_dependent (d->follows[i].elems[j].constraint)) elems 2823 maint/gnulib/lib/dfa.c if (prev_letter_dependent (d->follows[i].elems[j].constraint)) elems 2843 maint/gnulib/lib/dfa.c free (merged.elems); elems 2844 maint/gnulib/lib/dfa.c free (tmp.elems); elems 2973 maint/gnulib/lib/dfa.c for (idx_t j = 0; j < d->states[s].elems.nelem; j++) elems 2975 maint/gnulib/lib/dfa.c k < d->follows[d->states[s].elems.elems[j].index].nelem; ++k) elems 2976 maint/gnulib/lib/dfa.c insert (d->follows[d->states[s].elems.elems[j].index].elems[k], elems 2989 maint/gnulib/lib/dfa.c position pos = follows.elems[i]; elems 3108 maint/gnulib/lib/dfa.c mergeit &= d->multibyte_prop[group.elems[j].index]; elems 3111 maint/gnulib/lib/dfa.c merge2 (&group, &d->states[0].elems, &tmp); elems 3181 maint/gnulib/lib/dfa.c free (group.elems); elems 3182 maint/gnulib/lib/dfa.c free (follows.elems); elems 3183 maint/gnulib/lib/dfa.c free (tmp.elems); elems 3292 maint/gnulib/lib/dfa.c merge (&d->states[s1].mbps, &d->states[s].elems, &d->mb_follows); elems 3361 maint/gnulib/lib/dfa.c free (d->states[s].elems.elems); elems 3362 maint/gnulib/lib/dfa.c free (d->states[s].mbps.elems); elems 3588 maint/gnulib/lib/dfa.c free (d->mb_follows.elems); elems 3789 maint/gnulib/lib/dfa.c free (d->states[i].elems.elems); elems 3790 maint/gnulib/lib/dfa.c free (d->states[i].mbps.elems); elems 3797 maint/gnulib/lib/dfa.c free (d->follows[i].elems); elems 303 maint/gnulib/lib/regcomp.c Idx node = init_state->nodes.elems[node_cnt]; elems 1018 maint/gnulib/lib/regcomp.c Idx node_idx = init_nodes.elems[i]; elems 1027 maint/gnulib/lib/regcomp.c clexp_node = dfa->nodes + init_nodes.elems[clexp_idx]; elems 1037 maint/gnulib/lib/regcomp.c Idx dest_idx = dfa->edests[node_idx].elems[0]; elems 1524 maint/gnulib/lib/regcomp.c org_dest = dfa->edests[org_node].elems[0]; elems 1548 maint/gnulib/lib/regcomp.c org_dest = dfa->edests[org_node].elems[0]; elems 1576 maint/gnulib/lib/regcomp.c org_dest = dfa->edests[org_node].elems[1]; elems 1637 maint/gnulib/lib/regcomp.c Idx *elems = dfa->eclosures[src].elems; elems 1640 maint/gnulib/lib/regcomp.c ok = re_node_set_insert_last (dfa->inveclosures + elems[idx], src); elems 1704 maint/gnulib/lib/regcomp.c eclosure.elems[eclosure.nelem++] = node; elems 1714 maint/gnulib/lib/regcomp.c && !dfa->nodes[dfa->edests[node].elems[0]].duplicated) elems 1727 maint/gnulib/lib/regcomp.c Idx edest = dfa->edests[node].elems[i]; elems 973 maint/gnulib/lib/regex_internal.c set->elems = re_malloc (Idx, size); elems 974 maint/gnulib/lib/regex_internal.c if (__glibc_unlikely (set->elems == NULL) elems 986 maint/gnulib/lib/regex_internal.c set->elems = re_malloc (Idx, 1); elems 987 maint/gnulib/lib/regex_internal.c if (__glibc_unlikely (set->elems == NULL)) elems 992 maint/gnulib/lib/regex_internal.c set->elems[0] = elem; elems 1001 maint/gnulib/lib/regex_internal.c set->elems = re_malloc (Idx, 2); elems 1002 maint/gnulib/lib/regex_internal.c if (__glibc_unlikely (set->elems == NULL)) elems 1007 maint/gnulib/lib/regex_internal.c set->elems[0] = elem1; elems 1014 maint/gnulib/lib/regex_internal.c set->elems[0] = elem1; elems 1015 maint/gnulib/lib/regex_internal.c set->elems[1] = elem2; elems 1019 maint/gnulib/lib/regex_internal.c set->elems[0] = elem2; elems 1020 maint/gnulib/lib/regex_internal.c set->elems[1] = elem1; elems 1034 maint/gnulib/lib/regex_internal.c dest->elems = re_malloc (Idx, dest->alloc); elems 1035 maint/gnulib/lib/regex_internal.c if (__glibc_unlikely (dest->elems == NULL)) elems 1040 maint/gnulib/lib/regex_internal.c memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx)); elems 1065 maint/gnulib/lib/regex_internal.c Idx *new_elems = re_realloc (dest->elems, Idx, new_alloc); elems 1068 maint/gnulib/lib/regex_internal.c dest->elems = new_elems; elems 1080 maint/gnulib/lib/regex_internal.c if (src1->elems[i1] == src2->elems[i2]) elems 1083 maint/gnulib/lib/regex_internal.c while (id >= 0 && dest->elems[id] > src1->elems[i1]) elems 1086 maint/gnulib/lib/regex_internal.c if (id < 0 || dest->elems[id] != src1->elems[i1]) elems 1087 maint/gnulib/lib/regex_internal.c dest->elems[--sbase] = src1->elems[i1]; elems 1094 maint/gnulib/lib/regex_internal.c else if (src1->elems[i1] < src2->elems[i2]) elems 1117 maint/gnulib/lib/regex_internal.c if (dest->elems[is] > dest->elems[id]) elems 1120 maint/gnulib/lib/regex_internal.c dest->elems[id + delta--] = dest->elems[is--]; elems 1127 maint/gnulib/lib/regex_internal.c dest->elems[id + delta] = dest->elems[id]; elems 1134 maint/gnulib/lib/regex_internal.c memcpy (dest->elems, dest->elems + sbase, delta * sizeof (Idx)); elems 1151 maint/gnulib/lib/regex_internal.c dest->elems = re_malloc (Idx, dest->alloc); elems 1152 maint/gnulib/lib/regex_internal.c if (__glibc_unlikely (dest->elems == NULL)) elems 1167 maint/gnulib/lib/regex_internal.c if (src1->elems[i1] > src2->elems[i2]) elems 1169 maint/gnulib/lib/regex_internal.c dest->elems[id++] = src2->elems[i2++]; elems 1172 maint/gnulib/lib/regex_internal.c if (src1->elems[i1] == src2->elems[i2]) elems 1174 maint/gnulib/lib/regex_internal.c dest->elems[id++] = src1->elems[i1++]; elems 1178 maint/gnulib/lib/regex_internal.c memcpy (dest->elems + id, src1->elems + i1, elems 1184 maint/gnulib/lib/regex_internal.c memcpy (dest->elems + id, src2->elems + i2, elems 1205 maint/gnulib/lib/regex_internal.c Idx *new_buffer = re_realloc (dest->elems, Idx, new_alloc); elems 1208 maint/gnulib/lib/regex_internal.c dest->elems = new_buffer; elems 1217 maint/gnulib/lib/regex_internal.c DEBUG_ASSERT (dest->elems); elems 1219 maint/gnulib/lib/regex_internal.c memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx)); elems 1228 maint/gnulib/lib/regex_internal.c if (dest->elems[id] == src->elems[is]) elems 1230 maint/gnulib/lib/regex_internal.c else if (dest->elems[id] < src->elems[is]) elems 1231 maint/gnulib/lib/regex_internal.c dest->elems[--sbase] = src->elems[is--]; elems 1240 maint/gnulib/lib/regex_internal.c memcpy (dest->elems + sbase, src->elems, (is + 1) * sizeof (Idx)); elems 1254 maint/gnulib/lib/regex_internal.c if (dest->elems[is] > dest->elems[id]) elems 1257 maint/gnulib/lib/regex_internal.c dest->elems[id + delta--] = dest->elems[is--]; elems 1264 maint/gnulib/lib/regex_internal.c dest->elems[id + delta] = dest->elems[id]; elems 1268 maint/gnulib/lib/regex_internal.c memcpy (dest->elems, dest->elems + sbase, elems 1296 maint/gnulib/lib/regex_internal.c DEBUG_ASSERT (set->elems); elems 1297 maint/gnulib/lib/regex_internal.c set->elems[0] = elem; elems 1307 maint/gnulib/lib/regex_internal.c new_elems = re_realloc (set->elems, Idx, set->alloc); elems 1310 maint/gnulib/lib/regex_internal.c set->elems = new_elems; elems 1315 maint/gnulib/lib/regex_internal.c if (elem < set->elems[0]) elems 1318 maint/gnulib/lib/regex_internal.c set->elems[idx] = set->elems[idx - 1]; elems 1322 maint/gnulib/lib/regex_internal.c for (idx = set->nelem; set->elems[idx - 1] > elem; idx--) elems 1323 maint/gnulib/lib/regex_internal.c set->elems[idx] = set->elems[idx - 1]; elems 1324 maint/gnulib/lib/regex_internal.c DEBUG_ASSERT (set->elems[idx - 1] < elem); elems 1328 maint/gnulib/lib/regex_internal.c set->elems[idx] = elem; elems 1346 maint/gnulib/lib/regex_internal.c new_elems = re_realloc (set->elems, Idx, set->alloc); elems 1349 maint/gnulib/lib/regex_internal.c set->elems = new_elems; elems 1353 maint/gnulib/lib/regex_internal.c set->elems[set->nelem++] = elem; elems 1368 maint/gnulib/lib/regex_internal.c if (set1->elems[i] != set2->elems[i]) elems 1389 maint/gnulib/lib/regex_internal.c if (set->elems[mid] < elem) elems 1394 maint/gnulib/lib/regex_internal.c return set->elems[idx] == elem ? idx + 1 : 0; elems 1404 maint/gnulib/lib/regex_internal.c set->elems[idx] = set->elems[idx + 1]; elems 1471 maint/gnulib/lib/regex_internal.c hash += nodes->elems[i]; elems 1588 maint/gnulib/lib/regex_internal.c Idx elem = newstate->nodes.elems[i]; elems 1650 maint/gnulib/lib/regex_internal.c re_token_t *node = dfa->nodes + nodes->elems[i]; elems 1702 maint/gnulib/lib/regex_internal.c re_token_t *node = dfa->nodes + nodes->elems[i]; elems 236 maint/gnulib/lib/regex_internal.h Idx *elems; elems 689 maint/gnulib/lib/regex_internal.h #define re_node_set_free(set) re_free ((set)->elems) elems 1202 maint/gnulib/lib/regexec.c if (check_halt_node_context (mctx->dfa, state->nodes.elems[i], context)) elems 1203 maint/gnulib/lib/regexec.c return state->nodes.elems[i]; elems 1235 maint/gnulib/lib/regexec.c Idx candidate = edests->elems[i]; elems 1298 maint/gnulib/lib/regexec.c dest_node = dfa->edests[node].elems[0]; elems 1633 maint/gnulib/lib/regexec.c Idx prev_node = cur_src->elems[i]; elems 1792 maint/gnulib/lib/regexec.c dfa->inveclosures + dest_nodes->elems[i]); elems 1812 maint/gnulib/lib/regexec.c Idx cur_node = inv_eclosure->elems[ecl_idx]; elems 1817 maint/gnulib/lib/regexec.c Idx edst1 = dfa->edests[cur_node].elems[0]; elems 1819 maint/gnulib/lib/regexec.c ? dfa->edests[cur_node].elems[1] : -1); elems 1838 maint/gnulib/lib/regexec.c Idx cur_node = inv_eclosure->elems[ecl_idx]; elems 1862 maint/gnulib/lib/regexec.c ent = mctx->bkref_ents + limits->elems[lim_idx]; elems 1865 maint/gnulib/lib/regexec.c dst_pos = check_dst_limits_calc_pos (mctx, limits->elems[lim_idx], elems 1868 maint/gnulib/lib/regexec.c src_pos = check_dst_limits_calc_pos (mctx, limits->elems[lim_idx], elems 1896 maint/gnulib/lib/regexec.c Idx node = eclosures->elems[node_idx]; elems 1922 maint/gnulib/lib/regexec.c dst = dfa->edests[node].elems[0]; elems 2006 maint/gnulib/lib/regexec.c ent = bkref_ents + limits->elems[lim_idx]; elems 2018 maint/gnulib/lib/regexec.c Idx node = dest_nodes->elems[node_idx]; elems 2042 maint/gnulib/lib/regexec.c Idx node = dest_nodes->elems[node_idx]; elems 2062 maint/gnulib/lib/regexec.c Idx node = dest_nodes->elems[node_idx]; elems 2102 maint/gnulib/lib/regexec.c node = candidates->elems[node_idx]; elems 2125 maint/gnulib/lib/regexec.c : dfa->edests[node].elems[0]); elems 2392 maint/gnulib/lib/regexec.c Idx node = cur_nodes->elems[node_idx]; elems 2425 maint/gnulib/lib/regexec.c Idx cur_node = state->nodes.elems[node_cnt]; elems 2459 maint/gnulib/lib/regexec.c Idx cur_node_idx = pstate->nodes.elems[i]; elems 2529 maint/gnulib/lib/regexec.c Idx node_idx = nodes->elems[i]; elems 2566 maint/gnulib/lib/regexec.c ? dfa->eclosures + dfa->edests[node_idx].elems[0] elems 2818 maint/gnulib/lib/regexec.c Idx cls_node = nodes->elems[cls_idx]; elems 3014 maint/gnulib/lib/regexec.c Idx cur_node = cur_nodes->elems[cur_idx]; elems 3093 maint/gnulib/lib/regexec.c Idx cur_node = cur_nodes->elems[idx]; elems 3157 maint/gnulib/lib/regexec.c dfa->edests[cur_node].elems[1], elems 3162 maint/gnulib/lib/regexec.c cur_node = dfa->edests[cur_node].elems[0]; elems 3204 maint/gnulib/lib/regexec.c next_node = dfa->edests[ent->node].elems[0]; elems 3324 maint/gnulib/lib/regexec.c next_node = dfa->nexts[dests_node[i].elems[j]]; elems 3466 maint/gnulib/lib/regexec.c re_token_t *node = &dfa->nodes[cur_nodes->elems[i]]; elems 3607 maint/gnulib/lib/regexec.c ok = re_node_set_insert (&dests_node[j], cur_nodes->elems[i]); elems 3619 maint/gnulib/lib/regexec.c err = re_node_set_init_1 (dests_node + ndests, cur_nodes->elems[i]);