659   int ch;  in re_search_internal()  local
790 	      ch = match_first >= length  in re_search_internal()
792 	      if (!fastmap[t ? t[ch] : ch])  in re_search_internal()
802 	      ch = match_first >= length  in re_search_internal()
804 	      if (fastmap[t ? t[ch] : ch])  in re_search_internal()
832 	      ch = (match_first >= length  in re_search_internal()
834 	      if (fastmap[ch])  in re_search_internal()
2298   unsigned char ch;  in transit_state()  local
2318   ch = re_string_fetch_byte (&mctx->input);  in transit_state()
2323 	return trtable[ch];  in transit_state()
2334 	    return trtable[ch + SBC_MAX];  in transit_state()
2336 	    return trtable[ch];  in transit_state()
3355   int ch;  in build_trtable()  local
3502 	for (ch = i * BITSET_WORD_BITS, elem = acceptable[i], mask = 1;  in build_trtable()
3504 	     mask <<= 1, elem >>= 1, ++ch)  in build_trtable()
3514 		trtable[ch] = dest_states_word[j];  in build_trtable()
3516 		trtable[ch] = dest_states[j];  in build_trtable()
3533 	for (ch = i * BITSET_WORD_BITS, elem = acceptable[i], mask = 1;  in build_trtable()
3535 	     mask <<= 1, elem >>= 1, ++ch)  in build_trtable()
3544 	      trtable[ch] = dest_states[j];  in build_trtable()
3545 	      trtable[ch + SBC_MAX] = dest_states_word[j];  in build_trtable()
4082   unsigned char ch;  in check_node_accept()  local
4083   ch = re_string_byte_at (&mctx->input, idx);  in check_node_accept()
4087       if (node->opr.c != ch)  in check_node_accept()
4092       if (!bitset_contain (node->opr.sbcset, ch))  in check_node_accept()
4098       if (ch >= ASCII_CHARS)  in check_node_accept()
4103       if ((ch == '\n' && !(mctx->dfa->syntax & RE_DOT_NEWLINE))  in check_node_accept()
4104 	  || (ch == '\0' && (mctx->dfa->syntax & RE_DOT_NOT_NULL)))  in check_node_accept()