301   for (node_cnt = 0; node_cnt < init_state->nodes.nelem; ++node_cnt)  in re_compile_fastmap_iter()
303       Idx node = init_state->nodes.elems[node_cnt];  in re_compile_fastmap_iter()
304       re_token_type_t type = dfa->nodes[node].type;  in re_compile_fastmap_iter()
308 	  re_set_fastmap (fastmap, icase, dfa->nodes[node].opr.c);  in re_compile_fastmap_iter()
318 	      *p++ = dfa->nodes[node].opr.c;  in re_compile_fastmap_iter()
320 		     &&	dfa->nodes[node].type == CHARACTER  in re_compile_fastmap_iter()
321 		     && dfa->nodes[node].mb_partial)  in re_compile_fastmap_iter()
322 		*p++ = dfa->nodes[node].opr.c;  in re_compile_fastmap_iter()
338 	      bitset_word_t w = dfa->nodes[node].opr.sbcset[i];  in re_compile_fastmap_iter()
347 	  re_charset_t *cset = dfa->nodes[node].opr.mbcset;  in re_compile_fastmap_iter()
587   if (dfa->nodes)  in free_dfa_content()
589       free_token (dfa->nodes + i);  in free_dfa_content()
603   re_free (dfa->nodes);  in free_dfa_content()
859   dfa->nodes = re_malloc (re_token_t, dfa->nodes_alloc);  in init_dfa()
918   if (__glibc_unlikely (dfa->nodes == NULL || dfa->state_table == NULL))  in init_dfa()
1019 	re_token_type_t type = dfa->nodes[node_idx].type;  in create_initial_state()
1027 	    clexp_node = dfa->nodes + init_nodes.elems[clexp_idx];  in create_initial_state()
1029 		&& clexp_node->opr.idx == dfa->nodes[node_idx].opr.idx)  in create_initial_state()
1091     switch (dfa->nodes[node].type)  in optimize_utf8()
1094 	if (dfa->nodes[node].opr.c >= ASCII_CHARS)  in optimize_utf8()
1098 	switch (dfa->nodes[node].opr.ctx_type)  in optimize_utf8()
1132 	      if (dfa->nodes[node].opr.sbcset[i] >> rshift != 0)  in optimize_utf8()
1145 	if (dfa->nodes[node].type == CHARACTER  in optimize_utf8()
1146 	    && dfa->nodes[node].opr.c >= ASCII_CHARS)  in optimize_utf8()
1147 	  dfa->nodes[node].mb_partial = 0;  in optimize_utf8()
1148 	else if (dfa->nodes[node].type == OP_PERIOD)  in optimize_utf8()
1149 	  dfa->nodes[node].type = OP_UTF8_PERIOD;  in optimize_utf8()
1397 	dfa->nodes[node->node_idx].constraint = node->token.opr.ctx_type;  in calc_first()
1496       if (dfa->nodes[org_node].type == OP_BACK_REF)  in duplicate_node_closure()
1536 	  constraint |= dfa->nodes[org_node].constraint;  in duplicate_node_closure()
1598   for (idx = dfa->nodes_len - 1; dfa->nodes[idx].duplicated && idx > 0; --idx)  in search_duplicated_node()
1601 	  && constraint == dfa->nodes[idx].constraint)  in search_duplicated_node()
1614   Idx dup_idx = re_dfa_add_node (dfa, dfa->nodes[org_idx]);  in duplicate_node()
1617       dfa->nodes[dup_idx].constraint = constraint;  in duplicate_node()
1618       dfa->nodes[dup_idx].constraint |= dfa->nodes[org_idx].constraint;  in duplicate_node()
1619       dfa->nodes[dup_idx].duplicated = 1;  in duplicate_node()
1712   if (dfa->nodes[node].constraint  in calc_eclosure_iter()
1714       && !dfa->nodes[dfa->edests[node].elems[0]].duplicated)  in calc_eclosure_iter()
1717 				    dfa->nodes[node].constraint);  in calc_eclosure_iter()
1723   if (IS_EPSILON_NODE(dfa->nodes[node].type))  in calc_eclosure_iter()