anv: Rename anv_pipeline_cache_add_entry() to 'set'

This function is a helper that unconditionally sets a hash table entry
and expects the cache to have enough room. Calling it 'add_entry'
suggests it will grow the cache as needed.
This commit is contained in:
Kristian Høgsberg Kristensen
2016-03-04 12:21:43 -08:00
parent 87967a2c85
commit 07441c344c

View File

@@ -140,7 +140,7 @@ anv_pipeline_cache_search(struct anv_pipeline_cache *cache,
} }
static void static void
anv_pipeline_cache_add_entry(struct anv_pipeline_cache *cache, anv_pipeline_cache_set_entry(struct anv_pipeline_cache *cache,
struct cache_entry *entry, uint32_t entry_offset) struct cache_entry *entry, uint32_t entry_offset)
{ {
const uint32_t mask = cache->table_size - 1; const uint32_t mask = cache->table_size - 1;
@@ -187,7 +187,7 @@ anv_pipeline_cache_grow(struct anv_pipeline_cache *cache)
struct cache_entry *entry = struct cache_entry *entry =
cache->program_stream.block_pool->map + offset; cache->program_stream.block_pool->map + offset;
anv_pipeline_cache_add_entry(cache, entry, offset); anv_pipeline_cache_set_entry(cache, entry, offset);
} }
free(old_table); free(old_table);
@@ -231,7 +231,7 @@ anv_pipeline_cache_upload_kernel(struct anv_pipeline_cache *cache,
* have enough space to add this new kernel. Only add it if there's room. * have enough space to add this new kernel. Only add it if there's room.
*/ */
if (cache->kernel_count < cache->table_size / 2) if (cache->kernel_count < cache->table_size / 2)
anv_pipeline_cache_add_entry(cache, entry, state.offset); anv_pipeline_cache_set_entry(cache, entry, state.offset);
} }
pthread_mutex_unlock(&cache->mutex); pthread_mutex_unlock(&cache->mutex);