Searched refs:old_table (Results 1 – 7 of 7) sorted by relevance
228 &htab->old_table[record_it].val_ptr, in resize_helper()234 &htab->old_table[record_it].hashval, in resize_helper()256 htab->old_table = htab->table; in resize_master()285 free(htab->old_table); in resize_master()
76 name##_ent *old_table; \
161 struct cache_entry **old_table = cache->hash_table; in tu_pipeline_cache_grow() local174 struct cache_entry *entry = old_table[i]; in tu_pipeline_cache_grow()181 free(old_table); in tu_pipeline_cache_grow()
223 Err(old_table) => { in create_hashtable()229 old_table in create_hashtable()242 let old_table = loop { in grow_hashtable() localVariable270 let mut new_table = HashTable::new(num_threads, old_table); in grow_hashtable()273 for bucket in &old_table.entries[..] { in grow_hashtable()286 for bucket in &old_table.entries[..] { in grow_hashtable()
220 struct cache_entry **old_table = cache->hash_table; in radv_pipeline_cache_grow() local233 struct cache_entry *entry = old_table[i]; in radv_pipeline_cache_grow()240 free(old_table); in radv_pipeline_cache_grow()
770 void** const old_table = table_; in Resize() local777 if (TableEntryIsNonEmptyList(old_table, i)) { in Resize()778 TransferList(old_table, i); in Resize()779 } else if (TableEntryIsTree(old_table, i)) { in Resize()780 TransferTree(old_table, i++); in Resize()783 Dealloc<void*>(old_table, old_table_size); in Resize()
3057 kmp_indirect_lock_t **old_table = __kmp_i_lock_table.table; in __kmp_allocate_indirect_lock() local3059 __kmp_free(old_table); in __kmp_allocate_indirect_lock()