3354   Idx i, j;  in build_trtable()  local
3451       for (j = 0; j < dests_node[i].nelem; ++j)  in build_trtable()
3453 	  next_node = dfa->nexts[dests_node[i].elems[j]];  in build_trtable()
3509 	      for (j = 0; (dests_ch[j][i] & mask) == 0; ++j)  in build_trtable()
3514 		trtable[ch] = dest_states_word[j];  in build_trtable()
3516 		trtable[ch] = dest_states[j];  in build_trtable()
3540 	      for (j = 0; (dests_ch[j][i] & mask) == 0; ++j)  in build_trtable()
3544 	      trtable[ch] = dest_states[j];  in build_trtable()
3545 	      trtable[ch + SBC_MAX] = dest_states_word[j];  in build_trtable()
3553       for (j = 0; j < ndests; ++j)  in build_trtable()
3554 	if (bitset_contain (dests_ch[j], NEWLINE_CHAR))  in build_trtable()
3557 	    trtable[NEWLINE_CHAR] = dest_states_nl[j];  in build_trtable()
3559 	      trtable[NEWLINE_CHAR + SBC_MAX] = dest_states_nl[j];  in build_trtable()
3591   Idx i, j, k;  in group_nodes_into_DFAstates()  local
3670 		for (j = 0; j < BITSET_WORDS; ++j)  in group_nodes_into_DFAstates()
3671 		  any_set |= (accepts[j] &= (dfa->word_char[j] | ~dfa->sb_char[j]));  in group_nodes_into_DFAstates()
3674 		for (j = 0; j < BITSET_WORDS; ++j)  in group_nodes_into_DFAstates()
3675 		  any_set |= (accepts[j] &= dfa->word_char[j]);  in group_nodes_into_DFAstates()
3689 		for (j = 0; j < BITSET_WORDS; ++j)  in group_nodes_into_DFAstates()
3690 		  any_set |= (accepts[j] &= ~(dfa->word_char[j] & dfa->sb_char[j]));  in group_nodes_into_DFAstates()
3693 		for (j = 0; j < BITSET_WORDS; ++j)  in group_nodes_into_DFAstates()
3694 		  any_set |= (accepts[j] &= ~dfa->word_char[j]);  in group_nodes_into_DFAstates()
3702       for (j = 0; j < ndests; ++j)  in group_nodes_into_DFAstates()
3710 	  if (type == CHARACTER && !bitset_contain (dests_ch[j], node->opr.c))  in group_nodes_into_DFAstates()
3716 	    has_intersec |= intersec[k] = accepts[k] & dests_ch[j][k];  in group_nodes_into_DFAstates()
3725 	      not_subset |= remains[k] = ~accepts[k] & dests_ch[j][k];  in group_nodes_into_DFAstates()
3726 	      not_consumed |= accepts[k] = accepts[k] & ~dests_ch[j][k];  in group_nodes_into_DFAstates()
3734 	      bitset_copy (dests_ch[j], intersec);  in group_nodes_into_DFAstates()
3735 	      err = re_node_set_init_copy (dests_node + ndests, &dests_node[j]);  in group_nodes_into_DFAstates()
3742 	  ok = re_node_set_insert (&dests_node[j], cur_nodes->elems[i]);  in group_nodes_into_DFAstates()
3751       if (j == ndests)  in group_nodes_into_DFAstates()
3763   for (j = 0; j < ndests; ++j)  in group_nodes_into_DFAstates()
3764     re_node_set_free (dests_node + j);  in group_nodes_into_DFAstates()
3863       Idx j;  in check_node_accept_bytes()  local
3912 	      for (j = 0; j < *coll_sym; j++)  in check_node_accept_bytes()
3913 		if (pin[j] != coll_sym[1 + j])  in check_node_accept_bytes()
3915 	      if (j == *coll_sym)  in check_node_accept_bytes()
3918 		  match_len = j;  in check_node_accept_bytes()