bin_pos           227 ext/mbstring/oniguruma/st.c #define FIND_ENTRY(table, ptr, hash_val, bin_pos) do {\
bin_pos           228 ext/mbstring/oniguruma/st.c     bin_pos = hash_val%(table)->num_bins;\
bin_pos           229 ext/mbstring/oniguruma/st.c     ptr = (table)->bins[bin_pos];\
bin_pos           245 ext/mbstring/oniguruma/st.c     unsigned int hash_val, bin_pos;
bin_pos           249 ext/mbstring/oniguruma/st.c     FIND_ENTRY(table, ptr, hash_val, bin_pos);
bin_pos           260 ext/mbstring/oniguruma/st.c #define ADD_DIRECT(table, key, value, hash_val, bin_pos)\
bin_pos           265 ext/mbstring/oniguruma/st.c         bin_pos = hash_val % table->num_bins;\
bin_pos           273 ext/mbstring/oniguruma/st.c     entry->next = table->bins[bin_pos];\
bin_pos           274 ext/mbstring/oniguruma/st.c     table->bins[bin_pos] = entry;\
bin_pos           284 ext/mbstring/oniguruma/st.c     unsigned int hash_val, bin_pos;
bin_pos           288 ext/mbstring/oniguruma/st.c     FIND_ENTRY(table, ptr, hash_val, bin_pos);
bin_pos           291 ext/mbstring/oniguruma/st.c 	ADD_DIRECT(table, key, value, hash_val, bin_pos);
bin_pos           306 ext/mbstring/oniguruma/st.c     unsigned int hash_val, bin_pos;
bin_pos           309 ext/mbstring/oniguruma/st.c     bin_pos = hash_val % table->num_bins;
bin_pos           310 ext/mbstring/oniguruma/st.c     ADD_DIRECT(table, key, value, hash_val, bin_pos);