bins 88 include/ruby/st.h struct st_table_entry **bins; bins 100 st.c #define st_free_bins(bins, size) free(bins) bins 104 st.c bins = (st_table_entry **)realloc(bins, newsize * sizeof(st_table_entry *)); bins 105 st.c MEMZERO(bins, st_table_entry*, newsize); bins 106 st.c return bins; bins 110 st.c #define bins as.big.bins bins 237 st.c tbl->bins = st_alloc_bins(size); bins 300 st.c MEMZERO(table->bins, st_table_entry*, table->num_bins); bins 308 st.c st_free_bins(table->bins, table->num_bins); bins 356 st.c register st_table_entry *ptr = table->bins[bin_pos]; bins 447 st.c entry->next = table->bins[bin_pos]; bins 448 st.c table->bins[bin_pos] = entry; bins 483 st.c MEMZERO(tmp_table.bins, st_table_entry*, tmp_table.num_bins); bins 485 st.c tmp_table.bins = st_realloc_bins(tmp_table.bins, ST_DEFAULT_INIT_TABLE_SIZE, tmp_table.num_bins); bins 611 st.c new_bins = st_realloc_bins(table->bins, new_num_bins, table->num_bins); bins 613 st.c table->bins = new_bins; bins 635 st.c new_table->bins = st_alloc_bins(num_bins); bins 637 st.c if (new_table->bins == 0) { bins 643 st.c MEMCPY(new_table->bins, old_table->bins, st_table_entry*, old_table->num_bins); bins 686 st.c prev = &table->bins[hash_pos(hash_val, table->num_bins)]; bins 722 st.c ptr = table->bins[hash_pos(hash_val, table->num_bins)]; bins 759 st.c prev = &table->bins[hash_pos(old->hash, table->num_bins)]; bins 791 st.c ptr = *(last = &table->bins[i]); bins 872 st.c last = &table->bins[bin_pos]; bins 945 st.c for (tmp = table->bins[i]; tmp != ptr; tmp = tmp->next) { bins 959 st.c last = &table->bins[hash_pos(ptr->hash, table->num_bins)]; bins 1025 st.c last = &table->bins[hash_pos(ptr->hash, table->num_bins)]; bins 1188 st.c for (tmp = table->bins[i]; tmp != ptr; tmp = tmp->next) { bins 1202 st.c last = &table->bins[hash_pos(ptr->hash, table->num_bins)]; bins 1268 st.c last = &table->bins[hash_pos(ptr->hash, table->num_bins)];