src/gallium/drivers/freedreno/ir3/ir3_cache.c

   1 /*
   2  * Copyright (C) 2015 Rob Clark <robclark@freedesktop.org>
   3  *
   4  * Permission is hereby granted, free of charge, to any person obtaining a
   5  * copy of this software and associated documentation files (the "Software"),
   6  * to deal in the Software without restriction, including without limitation
   7  * the rights to use, copy, modify, merge, publish, distribute, sublicense,
   8  * and/or sell copies of the Software, and to permit persons to whom the
   9  * Software is furnished to do so, subject to the following conditions:
  10  *
  11  * The above copyright notice and this permission notice (including the next
  12  * paragraph) shall be included in all copies or substantial portions of the
  13  * Software.
  14  *
  15  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  16  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  17  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
  18  * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  19  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  20  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  21  * SOFTWARE.
  22  *
  23  * Authors:
  24  *    Rob Clark <robclark@freedesktop.org>
  25  */
  26
  27 #include "util/ralloc.h"
  28 #include "util/hash_table.h"
  29
  30 #include "ir3_cache.h"
  31 #include "ir3_gallium.h"
  32
  33
  34 static uint32_t
  35 key_hash(const void *_key)
  36 {
  37         const struct ir3_cache_key *key = _key;
  38         uint32_t hash = _mesa_fnv32_1a_offset_bias;
  39         hash = _mesa_fnv32_1a_accumulate_block(hash, key, sizeof(*key));
  40         return hash;
  41 }
  42
  43 static bool
  44 key_equals(const void *_a, const void *_b)
  45 {
  46         const struct ir3_cache_key *a = _a;
  47         const struct ir3_cache_key *b = _b;
  48         // TODO we could optimize the key shader-variant key comparison by not
  49         // ignoring has_per_samp.. not really sure if that helps..
  50         return memcmp(a, b, sizeof(struct ir3_cache_key)) == 0;
  51 }
  52
  53 struct ir3_cache {
  54         /* cache mapping gallium/etc shader state-objs + shader-key to backend
  55          * specific state-object
  56          */
  57         struct hash_table *ht;
  58
  59         const struct ir3_cache_funcs *funcs;
  60         void *data;
  61 };
  62
  63 struct ir3_cache * ir3_cache_create(const struct ir3_cache_funcs *funcs, void *data)
  64 {
  65         struct ir3_cache *cache = rzalloc(NULL, struct ir3_cache);
  66
  67         cache->ht = _mesa_hash_table_create(cache, key_hash, key_equals);
  68         cache->funcs = funcs;
  69         cache->data = data;
  70
  71         return cache;
  72 }
  73
  74 void ir3_cache_destroy(struct ir3_cache *cache)
  75 {
  76         /* _mesa_hash_table_destroy is so *almost* useful.. */
  77         hash_table_foreach(cache->ht, entry) {
  78                 cache->funcs->destroy_state(cache->data, entry->data);
  79         }
  80
  81         ralloc_free(cache);
  82 }
  83
  84 struct ir3_program_state *
  85 ir3_cache_lookup(struct ir3_cache *cache, const struct ir3_cache_key *key,
  86                 struct pipe_debug_callback *debug)
  87 {
  88         uint32_t hash = key_hash(key);
  89         struct hash_entry *entry =
  90                 _mesa_hash_table_search_pre_hashed(cache->ht, hash, key);
  91
  92         if (entry) {
  93                 return entry->data;
  94         }
  95
  96         struct ir3_shader_variant *bs = ir3_shader_variant(key->vs, key->key, true, debug);
  97         struct ir3_shader_variant *vs = ir3_shader_variant(key->vs, key->key, false, debug);
  98         struct ir3_shader_variant *fs = ir3_shader_variant(key->fs, key->key, false, debug);
  99
 100         if (!bs || !vs || !fs) {
 101                 return NULL;
 102         }
 103
 104         struct ir3_program_state *state =
 105                 cache->funcs->create_state(cache->data, bs, vs, fs, &key->key);
 106         state->key = *key;
 107
 108         /* NOTE: uses copy of key in state obj, because pointer passed by caller
 109          * is probably on the stack
 110          */
 111         _mesa_hash_table_insert_pre_hashed(cache->ht, hash, &state->key, state);
 112
 113         return state;
 114 }
 115
 116 /* call when an API level state object is destroyed, to invalidate
 117  * cache entries which reference that state object.
 118  */
 119 void ir3_cache_invalidate(struct ir3_cache *cache, void *stobj)
 120 {
 121         hash_table_foreach(cache->ht, entry) {
 122                 const struct ir3_cache_key *key = entry->key;
 123                 if ((key->fs == stobj) || (key->vs == stobj)) {
 124                         cache->funcs->destroy_state(cache->data, entry->data);
 125                         _mesa_hash_table_remove(cache->ht, entry);
 126                         return;
 127                 }
 128         }
 129 }