init_state         27 maint/gnulib/lib/regcomp.c 				     const re_dfastate_t *init_state,
init_state        270 maint/gnulib/lib/regcomp.c   re_compile_fastmap_iter (bufp, dfa->init_state, fastmap);
init_state        271 maint/gnulib/lib/regcomp.c   if (dfa->init_state != dfa->init_state_word)
init_state        273 maint/gnulib/lib/regcomp.c   if (dfa->init_state != dfa->init_state_nl)
init_state        275 maint/gnulib/lib/regcomp.c   if (dfa->init_state != dfa->init_state_begbuf)
init_state        295 maint/gnulib/lib/regcomp.c re_compile_fastmap_iter (regex_t *bufp, const re_dfastate_t *init_state,
init_state        301 maint/gnulib/lib/regcomp.c   for (node_cnt = 0; node_cnt < init_state->nodes.nelem; ++node_cnt)
init_state        303 maint/gnulib/lib/regcomp.c       Idx node = init_state->nodes.elems[node_cnt];
init_state       1050 maint/gnulib/lib/regcomp.c   dfa->init_state = re_acquire_state_context (&err, dfa, &init_nodes, 0);
init_state       1052 maint/gnulib/lib/regcomp.c   if (__glibc_unlikely (dfa->init_state == NULL))
init_state       1054 maint/gnulib/lib/regcomp.c   if (dfa->init_state->has_constraint)
init_state       1071 maint/gnulib/lib/regcomp.c       = dfa->init_state_begbuf = dfa->init_state;
init_state        649 maint/gnulib/lib/regex_internal.h   re_dfastate_t *init_state;
init_state        611 maint/gnulib/lib/regexec.c   if (__glibc_unlikely (preg->used == 0 || dfa->init_state == NULL
init_state        623 maint/gnulib/lib/regexec.c   if (dfa->init_state->nodes.nelem == 0
init_state       1006 maint/gnulib/lib/regexec.c   if (dfa->init_state->has_constraint)
init_state       1013 maint/gnulib/lib/regexec.c 	return dfa->init_state;
init_state       1022 maint/gnulib/lib/regexec.c 					   dfa->init_state->entrance_nodes,
init_state       1027 maint/gnulib/lib/regexec.c 	return dfa->init_state;
init_state       1030 maint/gnulib/lib/regexec.c     return dfa->init_state;