blob: 8e54f3a5a030919ab84047c44d1647a426f5c7d9 [file] [log] [blame]
Brian0ee15e02007-10-30 12:23:22 -06001/**************************************************************************
2 *
3 * Copyright 2003 Tungsten Graphics, Inc., Cedar Park, Texas.
4 * All Rights Reserved.
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
13 *
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
16 * of the Software.
17 *
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
21 * IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
22 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
25 *
26 **************************************************************************/
27
28
29#include "main/glheader.h"
30#include "main/mtypes.h"
31#include "main/imports.h"
32#include "shader/prog_cache.h"
Brian Paula56a59c2008-05-07 08:55:33 -060033#include "shader/program.h"
Brian0ee15e02007-10-30 12:23:22 -060034
35
36struct cache_item
37{
38 GLuint hash;
39 void *key;
40 struct gl_program *program;
41 struct cache_item *next;
42};
43
44struct gl_program_cache
45{
46 struct cache_item **items;
Keith Whitwelld63a36e2008-10-03 16:46:48 +010047 struct cache_item *last;
Brian0ee15e02007-10-30 12:23:22 -060048 GLuint size, n_items;
49};
50
51
52
53/**
54 * Compute hash index from state key.
55 */
56static GLuint
57hash_key(const void *key, GLuint key_size)
58{
59 const GLuint *ikey = (const GLuint *) key;
60 GLuint hash = 0, i;
61
62 assert(key_size >= 4);
63
64 /* Make a slightly better attempt at a hash function:
65 */
66 for (i = 0; i < key_size / sizeof(*ikey); i++)
67 {
68 hash += ikey[i];
69 hash += (hash << 10);
70 hash ^= (hash >> 6);
71 }
72
73 return hash;
74}
75
76
77/**
78 * Rebuild/expand the hash table to accomodate more entries
79 */
80static void
81rehash(struct gl_program_cache *cache)
82{
83 struct cache_item **items;
84 struct cache_item *c, *next;
85 GLuint size, i;
86
Keith Whitwelld63a36e2008-10-03 16:46:48 +010087 cache->last = NULL;
88
Brian0ee15e02007-10-30 12:23:22 -060089 size = cache->size * 3;
90 items = (struct cache_item**) _mesa_malloc(size * sizeof(*items));
Kenneth Graunke26f8fad2010-02-18 23:51:00 -080091 memset(items, 0, size * sizeof(*items));
Brian0ee15e02007-10-30 12:23:22 -060092
93 for (i = 0; i < cache->size; i++)
94 for (c = cache->items[i]; c; c = next) {
95 next = c->next;
96 c->next = items[c->hash % size];
97 items[c->hash % size] = c;
98 }
99
100 _mesa_free(cache->items);
101 cache->items = items;
102 cache->size = size;
103}
104
105
106static void
107clear_cache(GLcontext *ctx, struct gl_program_cache *cache)
108{
109 struct cache_item *c, *next;
110 GLuint i;
Keith Whitwelld63a36e2008-10-03 16:46:48 +0100111
112 cache->last = NULL;
Brian0ee15e02007-10-30 12:23:22 -0600113
114 for (i = 0; i < cache->size; i++) {
115 for (c = cache->items[i]; c; c = next) {
116 next = c->next;
117 _mesa_free(c->key);
Brian Paula56a59c2008-05-07 08:55:33 -0600118 _mesa_reference_program(ctx, &c->program, NULL);
Brian0ee15e02007-10-30 12:23:22 -0600119 _mesa_free(c);
120 }
121 cache->items[i] = NULL;
122 }
123
124
125 cache->n_items = 0;
126}
127
128
129
130struct gl_program_cache *
131_mesa_new_program_cache(void)
132{
133 struct gl_program_cache *cache = CALLOC_STRUCT(gl_program_cache);
134 if (cache) {
135 cache->size = 17;
136 cache->items = (struct cache_item **)
137 _mesa_calloc(cache->size * sizeof(struct cache_item));
138 if (!cache->items) {
139 _mesa_free(cache);
140 return NULL;
141 }
142 }
143 return cache;
144}
145
146
147void
148_mesa_delete_program_cache(GLcontext *ctx, struct gl_program_cache *cache)
149{
150 clear_cache(ctx, cache);
151 _mesa_free(cache->items);
Brianaec6009e2007-12-24 17:39:21 -0700152 _mesa_free(cache);
Brian0ee15e02007-10-30 12:23:22 -0600153}
154
155
156struct gl_program *
Keith Whitwelld63a36e2008-10-03 16:46:48 +0100157_mesa_search_program_cache(struct gl_program_cache *cache,
Brian0ee15e02007-10-30 12:23:22 -0600158 const void *key, GLuint keysize)
159{
Keith Whitwelld63a36e2008-10-03 16:46:48 +0100160 if (cache->last &&
161 memcmp(cache->last->key, key, keysize) == 0) {
162 return cache->last->program;
Brian0ee15e02007-10-30 12:23:22 -0600163 }
Keith Whitwelld63a36e2008-10-03 16:46:48 +0100164 else {
165 const GLuint hash = hash_key(key, keysize);
166 struct cache_item *c;
Brian0ee15e02007-10-30 12:23:22 -0600167
Keith Whitwelld63a36e2008-10-03 16:46:48 +0100168 for (c = cache->items[hash % cache->size]; c; c = c->next) {
169 if (c->hash == hash && memcmp(c->key, key, keysize) == 0) {
170 cache->last = c;
171 return c->program;
172 }
173 }
174
175 return NULL;
176 }
Brian0ee15e02007-10-30 12:23:22 -0600177}
178
179
180void
181_mesa_program_cache_insert(GLcontext *ctx,
182 struct gl_program_cache *cache,
183 const void *key, GLuint keysize,
184 struct gl_program *program)
185{
186 const GLuint hash = hash_key(key, keysize);
187 struct cache_item *c = CALLOC_STRUCT(cache_item);
188
189 c->hash = hash;
190
191 c->key = _mesa_malloc(keysize);
192 memcpy(c->key, key, keysize);
193
Brian Paula56a59c2008-05-07 08:55:33 -0600194 c->program = program; /* no refcount change */
Brian0ee15e02007-10-30 12:23:22 -0600195
196 if (cache->n_items > cache->size * 1.5) {
197 if (cache->size < 1000)
198 rehash(cache);
199 else
200 clear_cache(ctx, cache);
201 }
202
203 cache->n_items++;
204 c->next = cache->items[hash % cache->size];
205 cache->items[hash % cache->size] = c;
206}