2 * Copyright © 2014 Intel Corporation
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:
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
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
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
24 #ifdef ENABLE_SHADER_CACHE
32 #include <sys/types.h>
42 #include "util/crc32.h"
43 #include "util/u_atomic.h"
44 #include "util/u_queue.h"
45 #include "util/mesa-sha1.h"
46 #include "util/ralloc.h"
47 #include "main/errors.h"
49 #include "disk_cache.h"
51 /* Number of bits to mask off from a cache key to get an index. */
52 #define CACHE_INDEX_KEY_BITS 16
54 /* Mask for computing an index from a key. */
55 #define CACHE_INDEX_KEY_MASK ((1 << CACHE_INDEX_KEY_BITS) - 1)
57 /* The number of keys that can be stored in the index. */
58 #define CACHE_INDEX_MAX_KEYS (1 << CACHE_INDEX_KEY_BITS)
61 /* The path to the cache directory. */
64 /* Thread queue for compressing and writing cache entries to disk */
65 struct util_queue cache_queue
;
67 /* A pointer to the mmapped index file within the cache directory. */
69 size_t index_mmap_size
;
71 /* Pointer to total size of all objects in cache (within index_mmap) */
74 /* Pointer to stored keys, (within index_mmap). */
77 /* Maximum size of all cached objects (in bytes). */
81 struct disk_cache_put_job
{
82 struct util_queue_fence fence
;
84 struct disk_cache
*cache
;
88 /* Copy of cache data to be compressed and written. */
91 /* Size of data to be compressed and written. */
95 /* Create a directory named 'path' if it does not already exist.
97 * Returns: 0 if path already exists as a directory or if created.
98 * -1 in all other cases.
101 mkdir_if_needed(const char *path
)
105 /* If the path exists already, then our work is done if it's a
106 * directory, but it's an error if it is not.
108 if (stat(path
, &sb
) == 0) {
109 if (S_ISDIR(sb
.st_mode
)) {
112 fprintf(stderr
, "Cannot use %s for shader cache (not a directory)"
113 "---disabling.\n", path
);
118 int ret
= mkdir(path
, 0755);
119 if (ret
== 0 || (ret
== -1 && errno
== EEXIST
))
122 fprintf(stderr
, "Failed to create %s for shader cache (%s)---disabling.\n",
123 path
, strerror(errno
));
128 /* Concatenate an existing path and a new name to form a new path. If the new
129 * path does not exist as a directory, create it then return the resulting
130 * name of the new path (ralloc'ed off of 'ctx').
132 * Returns NULL on any error, such as:
134 * <path> does not exist or is not a directory
135 * <path>/<name> exists but is not a directory
136 * <path>/<name> cannot be created as a directory
139 concatenate_and_mkdir(void *ctx
, const char *path
, const char *name
)
144 if (stat(path
, &sb
) != 0 || ! S_ISDIR(sb
.st_mode
))
147 new_path
= ralloc_asprintf(ctx
, "%s/%s", path
, name
);
149 if (mkdir_if_needed(new_path
) == 0)
156 remove_dir(const char *fpath
, const struct stat
*sb
,
157 int typeflag
, struct FTW
*ftwbuf
)
159 if (S_ISREG(sb
->st_mode
))
161 else if (S_ISDIR(sb
->st_mode
))
168 remove_old_cache_directories(void *mem_ctx
, const char *path
,
169 const char *timestamp
)
171 DIR *dir
= opendir(path
);
173 struct dirent
* d_entry
;
174 while((d_entry
= readdir(dir
)) != NULL
)
177 ralloc_asprintf(mem_ctx
, "%s/%s", path
, d_entry
->d_name
);
180 if (stat(full_path
, &sb
) == 0 && S_ISDIR(sb
.st_mode
) &&
181 strcmp(d_entry
->d_name
, timestamp
) != 0 &&
182 strcmp(d_entry
->d_name
, "..") != 0 &&
183 strcmp(d_entry
->d_name
, ".") != 0) {
184 nftw(full_path
, remove_dir
, 20, FTW_DEPTH
);
192 create_mesa_cache_dir(void *mem_ctx
, const char *path
, const char *timestamp
,
193 const char *gpu_name
)
195 char *new_path
= concatenate_and_mkdir(mem_ctx
, path
, "mesa");
196 if (new_path
== NULL
)
199 /* Create a parent architecture directory so that we don't remove cache
200 * files for other architectures. In theory we could share the cache
201 * between architectures but we have no way of knowing if they were created
202 * by a compatible Mesa version.
204 new_path
= concatenate_and_mkdir(mem_ctx
, new_path
, get_arch_bitness_str());
205 if (new_path
== NULL
)
208 /* Remove cache directories for old Mesa versions */
209 remove_old_cache_directories(mem_ctx
, new_path
, timestamp
);
211 new_path
= concatenate_and_mkdir(mem_ctx
, new_path
, timestamp
);
212 if (new_path
== NULL
)
215 new_path
= concatenate_and_mkdir(mem_ctx
, new_path
, gpu_name
);
216 if (new_path
== NULL
)
223 disk_cache_create(const char *gpu_name
, const char *timestamp
)
226 struct disk_cache
*cache
= NULL
;
227 char *path
, *max_size_str
;
233 /* If running as a users other than the real user disable cache */
234 if (geteuid() != getuid())
237 /* A ralloc context for transient data during this invocation. */
238 local
= ralloc_context(NULL
);
242 /* At user request, disable shader cache entirely. */
243 if (getenv("MESA_GLSL_CACHE_DISABLE"))
246 /* Determine path for cache based on the first defined name as follows:
248 * $MESA_GLSL_CACHE_DIR
249 * $XDG_CACHE_HOME/mesa
250 * <pwd.pw_dir>/.cache/mesa
252 path
= getenv("MESA_GLSL_CACHE_DIR");
254 if (mkdir_if_needed(path
) == -1)
257 path
= create_mesa_cache_dir(local
, path
, timestamp
,
264 char *xdg_cache_home
= getenv("XDG_CACHE_HOME");
266 if (xdg_cache_home
) {
267 if (mkdir_if_needed(xdg_cache_home
) == -1)
270 path
= create_mesa_cache_dir(local
, xdg_cache_home
, timestamp
,
280 struct passwd pwd
, *result
;
282 buf_size
= sysconf(_SC_GETPW_R_SIZE_MAX
);
286 /* Loop until buf_size is large enough to query the directory */
288 buf
= ralloc_size(local
, buf_size
);
290 getpwuid_r(getuid(), &pwd
, buf
, buf_size
, &result
);
294 if (errno
== ERANGE
) {
303 path
= concatenate_and_mkdir(local
, pwd
.pw_dir
, ".cache");
307 path
= create_mesa_cache_dir(local
, path
, timestamp
, gpu_name
);
312 cache
= ralloc(NULL
, struct disk_cache
);
316 cache
->path
= ralloc_strdup(cache
, path
);
317 if (cache
->path
== NULL
)
320 path
= ralloc_asprintf(local
, "%s/index", cache
->path
);
324 fd
= open(path
, O_RDWR
| O_CREAT
| O_CLOEXEC
, 0644);
328 if (fstat(fd
, &sb
) == -1)
331 /* Force the index file to be the expected size. */
332 size
= sizeof(*cache
->size
) + CACHE_INDEX_MAX_KEYS
* CACHE_KEY_SIZE
;
333 if (sb
.st_size
!= size
) {
334 if (ftruncate(fd
, size
) == -1)
338 /* We map this shared so that other processes see updates that we
341 * Note: We do use atomic addition to ensure that multiple
342 * processes don't scramble the cache size recorded in the
343 * index. But we don't use any locking to prevent multiple
344 * processes from updating the same entry simultaneously. The idea
345 * is that if either result lands entirely in the index, then
346 * that's equivalent to a well-ordered write followed by an
347 * eviction and a write. On the other hand, if the simultaneous
348 * writes result in a corrupt entry, that's not really any
349 * different than both entries being evicted, (since within the
350 * guarantees of the cryptographic hash, a corrupt entry is
351 * unlikely to ever match a real cache key).
353 cache
->index_mmap
= mmap(NULL
, size
, PROT_READ
| PROT_WRITE
,
355 if (cache
->index_mmap
== MAP_FAILED
)
357 cache
->index_mmap_size
= size
;
361 cache
->size
= (uint64_t *) cache
->index_mmap
;
362 cache
->stored_keys
= cache
->index_mmap
+ sizeof(uint64_t);
366 max_size_str
= getenv("MESA_GLSL_CACHE_MAX_SIZE");
369 max_size
= strtoul(max_size_str
, &end
, 10);
370 if (end
== max_size_str
) {
380 max_size
*= 1024*1024;
386 max_size
*= 1024*1024*1024;
392 /* Default to 1GB for maximum cache size. */
394 max_size
= 1024*1024*1024;
396 cache
->max_size
= max_size
;
398 /* A limit of 32 jobs was choosen as observations of Deus Ex start-up times
399 * showed that we reached at most 11 jobs on an Intel i5-6400 CPU@2.70GHz
400 * (a fairly modest desktop CPU). 1 thread was chosen because we don't
401 * really care about getting things to disk quickly just that it's not
402 * blocking other tasks.
404 util_queue_init(&cache
->cache_queue
, "disk_cache", 32, 1);
421 disk_cache_destroy(struct disk_cache
*cache
)
424 util_queue_destroy(&cache
->cache_queue
);
425 munmap(cache
->index_mmap
, cache
->index_mmap_size
);
431 /* Return a filename within the cache's directory corresponding to 'key'. The
432 * returned filename is ralloced with 'cache' as the parent context.
434 * Returns NULL if out of memory.
437 get_cache_file(struct disk_cache
*cache
, const cache_key key
)
442 _mesa_sha1_format(buf
, key
);
443 if (asprintf(&filename
, "%s/%c%c/%s", cache
->path
, buf
[0],
444 buf
[1], buf
+ 2) == -1)
450 /* Create the directory that will be needed for the cache file for \key.
452 * Obviously, the implementation here must closely match
453 * _get_cache_file above.
456 make_cache_file_directory(struct disk_cache
*cache
, const cache_key key
)
461 _mesa_sha1_format(buf
, key
);
462 if (asprintf(&dir
, "%s/%c%c", cache
->path
, buf
[0], buf
[1]) == -1)
465 mkdir_if_needed(dir
);
469 /* Given a directory path and predicate function, find the entry with
470 * the oldest access time in that directory for which the predicate
473 * Returns: A malloc'ed string for the path to the chosen file, (or
474 * NULL on any error). The caller should free the string when
478 choose_lru_file_matching(const char *dir_path
,
479 bool (*predicate
)(const struct dirent
*,
480 const char *dir_path
))
483 struct dirent
*entry
;
485 char *lru_name
= NULL
;
486 time_t lru_atime
= 0;
488 dir
= opendir(dir_path
);
493 entry
= readdir(dir
);
496 if (!predicate(entry
, dir_path
))
500 if (fstatat(dirfd(dir
), entry
->d_name
, &sb
, 0) == 0) {
501 if (!lru_atime
|| (sb
.st_atime
< lru_atime
)) {
502 size_t len
= strlen(entry
->d_name
) + 1;
503 char *tmp
= realloc(lru_name
, len
);
506 memcpy(lru_name
, entry
->d_name
, len
);
507 lru_atime
= sb
.st_atime
;
513 if (lru_name
== NULL
) {
518 if (asprintf(&filename
, "%s/%s", dir_path
, lru_name
) < 0)
527 /* Is entry a regular file, and not having a name with a trailing
531 is_regular_non_tmp_file(const struct dirent
*entry
, const char *path
)
534 if (asprintf(&filename
, "%s/%s", path
, entry
->d_name
) == -1)
538 int res
= stat(filename
, &sb
);
541 if (res
== -1 || !S_ISREG(sb
.st_mode
))
544 size_t len
= strlen (entry
->d_name
);
545 if (len
>= 4 && strcmp(&entry
->d_name
[len
-4], ".tmp") == 0)
551 /* Returns the size of the deleted file, (or 0 on any error). */
553 unlink_lru_file_from_directory(const char *path
)
558 filename
= choose_lru_file_matching(path
, is_regular_non_tmp_file
);
559 if (filename
== NULL
)
562 if (stat(filename
, &sb
) == -1) {
573 /* Is entry a directory with a two-character name, (and not the
574 * special name of ".."). We also return false if the dir is empty.
577 is_two_character_sub_directory(const struct dirent
*entry
, const char *path
)
580 if (asprintf(&subdir
, "%s/%s", path
, entry
->d_name
) == -1)
584 int res
= stat(subdir
, &sb
);
585 if (res
== -1 || !S_ISDIR(sb
.st_mode
)) {
590 if (strlen(entry
->d_name
) != 2) {
595 if (strcmp(entry
->d_name
, "..") == 0) {
600 DIR *dir
= opendir(subdir
);
606 unsigned subdir_entries
= 0;
608 while ((d
= readdir(dir
)) != NULL
) {
609 if(++subdir_entries
> 2)
614 /* If dir only contains '.' and '..' it must be empty */
615 if (subdir_entries
<= 2)
622 evict_lru_item(struct disk_cache
*cache
)
624 const char hex
[] = "0123456789abcde";
629 /* With a reasonably-sized, full cache, (and with keys generated
630 * from a cryptographic hash), we can choose two random hex digits
631 * and reasonably expect the directory to exist with a file in it.
632 * Provides pseudo-LRU eviction to reduce checking all cache files.
637 if (asprintf(&dir_path
, "%s/%c%c", cache
->path
, hex
[a
], hex
[b
]) < 0)
640 size
= unlink_lru_file_from_directory(dir_path
);
645 p_atomic_add(cache
->size
, - (uint64_t)size
);
649 /* In the case where the random choice of directory didn't find
650 * something, we choose the least recently accessed from the
651 * existing directories.
653 * Really, the only reason this code exists is to allow the unit
654 * tests to work, (which use an artificially-small cache to be able
655 * to force a single cached item to be evicted).
657 dir_path
= choose_lru_file_matching(cache
->path
,
658 is_two_character_sub_directory
);
659 if (dir_path
== NULL
)
662 size
= unlink_lru_file_from_directory(dir_path
);
667 p_atomic_add(cache
->size
, - (uint64_t)size
);
671 disk_cache_remove(struct disk_cache
*cache
, const cache_key key
)
675 char *filename
= get_cache_file(cache
, key
);
676 if (filename
== NULL
) {
680 if (stat(filename
, &sb
) == -1) {
689 p_atomic_add(cache
->size
, - (uint64_t)sb
.st_size
);
692 /* From the zlib docs:
693 * "If the memory is available, buffers sizes on the order of 128K or 256K
694 * bytes should be used."
696 #define BUFSIZE 256 * 1024
699 * Compresses cache entry in memory and writes it to disk. Returns the size
700 * of the data written to disk.
703 deflate_and_write_to_disk(const void *in_data
, size_t in_data_size
, int dest
,
704 const char *filename
)
706 unsigned char out
[BUFSIZE
];
708 /* allocate deflate state */
710 strm
.zalloc
= Z_NULL
;
712 strm
.opaque
= Z_NULL
;
713 strm
.next_in
= (uint8_t *) in_data
;
714 strm
.avail_in
= in_data_size
;
716 int ret
= deflateInit(&strm
, Z_BEST_COMPRESSION
);
720 /* compress until end of in_data */
721 size_t compressed_size
= 0;
724 int remaining
= in_data_size
- BUFSIZE
;
725 flush
= remaining
> 0 ? Z_NO_FLUSH
: Z_FINISH
;
726 in_data_size
-= BUFSIZE
;
728 /* Run deflate() on input until the output buffer is not full (which
729 * means there is no more data to deflate).
732 strm
.avail_out
= BUFSIZE
;
735 ret
= deflate(&strm
, flush
); /* no bad return value */
736 assert(ret
!= Z_STREAM_ERROR
); /* state not clobbered */
738 size_t have
= BUFSIZE
- strm
.avail_out
;
739 compressed_size
+= have
;
742 for (size_t len
= 0; len
< have
; len
+= written
) {
743 written
= write(dest
, out
+ len
, have
- len
);
745 (void)deflateEnd(&strm
);
749 } while (strm
.avail_out
== 0);
751 /* all input should be used */
752 assert(strm
.avail_in
== 0);
754 } while (flush
!= Z_FINISH
);
756 /* stream should be complete */
757 assert(ret
== Z_STREAM_END
);
759 /* clean up and return */
760 (void)deflateEnd(&strm
);
761 return compressed_size
;
764 static struct disk_cache_put_job
*
765 create_put_job(struct disk_cache
*cache
, const cache_key key
,
766 const void *data
, size_t size
)
768 struct disk_cache_put_job
*dc_job
= (struct disk_cache_put_job
*)
769 malloc(sizeof(struct disk_cache_put_job
) + size
);
772 dc_job
->cache
= cache
;
773 memcpy(dc_job
->key
, key
, sizeof(cache_key
));
774 dc_job
->data
= dc_job
+ 1;
775 memcpy(dc_job
->data
, data
, size
);
783 destroy_put_job(void *job
, int thread_index
)
790 struct cache_entry_file_data
{
792 uint32_t uncompressed_size
;
796 cache_put(void *job
, int thread_index
)
800 int fd
= -1, fd_final
= -1, err
, ret
;
802 char *filename
= NULL
, *filename_tmp
= NULL
;
803 struct disk_cache_put_job
*dc_job
= (struct disk_cache_put_job
*) job
;
805 filename
= get_cache_file(dc_job
->cache
, dc_job
->key
);
806 if (filename
== NULL
)
809 /* Write to a temporary file to allow for an atomic rename to the
810 * final destination filename, (to prevent any readers from seeing
811 * a partially written file).
813 if (asprintf(&filename_tmp
, "%s.tmp", filename
) == -1)
816 fd
= open(filename_tmp
, O_WRONLY
| O_CLOEXEC
| O_CREAT
, 0644);
818 /* Make the two-character subdirectory within the cache as needed. */
823 make_cache_file_directory(dc_job
->cache
, dc_job
->key
);
825 fd
= open(filename_tmp
, O_WRONLY
| O_CLOEXEC
| O_CREAT
, 0644);
830 /* With the temporary file open, we take an exclusive flock on
831 * it. If the flock fails, then another process still has the file
832 * open with the flock held. So just let that file be responsible
833 * for writing the file.
835 err
= flock(fd
, LOCK_EX
| LOCK_NB
);
839 /* Now that we have the lock on the open temporary file, we can
840 * check to see if the destination file already exists. If so,
841 * another process won the race between when we saw that the file
842 * didn't exist and now. In this case, we don't do anything more,
843 * (to ensure the size accounting of the cache doesn't get off).
845 fd_final
= open(filename
, O_RDONLY
| O_CLOEXEC
);
849 /* OK, we're now on the hook to write out a file that we know is
850 * not in the cache, and is also not being written out to the cache
851 * by some other process.
853 * Before we do that, if the cache is too large, evict something
856 if (*dc_job
->cache
->size
+ dc_job
->size
> dc_job
->cache
->max_size
)
857 evict_lru_item(dc_job
->cache
);
859 /* Create CRC of the data and store at the start of the file. We will
860 * read this when restoring the cache and use it to check for corruption.
862 struct cache_entry_file_data cf_data
;
863 cf_data
.crc32
= util_hash_crc32(dc_job
->data
, dc_job
->size
);
864 cf_data
.uncompressed_size
= dc_job
->size
;
866 size_t cf_data_size
= sizeof(cf_data
);
867 for (len
= 0; len
< cf_data_size
; len
+= ret
) {
868 ret
= write(fd
, ((uint8_t *) &cf_data
) + len
, cf_data_size
- len
);
870 unlink(filename_tmp
);
875 /* Now, finally, write out the contents to the temporary file, then
876 * rename them atomically to the destination filename, and also
877 * perform an atomic increment of the total cache size.
879 size_t file_size
= deflate_and_write_to_disk(dc_job
->data
, dc_job
->size
,
881 if (file_size
== 0) {
882 unlink(filename_tmp
);
885 rename(filename_tmp
, filename
);
887 file_size
+= cf_data_size
;
888 p_atomic_add(dc_job
->cache
->size
, file_size
);
893 /* This close finally releases the flock, (now that the final dile
894 * has been renamed into place and the size has been added).
905 disk_cache_put(struct disk_cache
*cache
, const cache_key key
,
906 const void *data
, size_t size
)
908 struct disk_cache_put_job
*dc_job
=
909 create_put_job(cache
, key
, data
, size
);
912 util_queue_fence_init(&dc_job
->fence
);
913 util_queue_add_job(&cache
->cache_queue
, dc_job
, &dc_job
->fence
,
914 cache_put
, destroy_put_job
);
919 * Decompresses cache entry, returns true if successful.
922 inflate_cache_data(uint8_t *in_data
, size_t in_data_size
,
923 uint8_t *out_data
, size_t out_data_size
)
927 /* allocate inflate state */
928 strm
.zalloc
= Z_NULL
;
930 strm
.opaque
= Z_NULL
;
931 strm
.next_in
= in_data
;
932 strm
.avail_in
= in_data_size
;
933 strm
.next_out
= out_data
;
934 strm
.avail_out
= out_data_size
;
936 int ret
= inflateInit(&strm
);
940 ret
= inflate(&strm
, Z_NO_FLUSH
);
941 assert(ret
!= Z_STREAM_ERROR
); /* state not clobbered */
943 /* Unless there was an error we should have decompressed everything in one
944 * go as we know the uncompressed file size.
946 if (ret
!= Z_STREAM_END
) {
947 (void)inflateEnd(&strm
);
950 assert(strm
.avail_out
== 0);
952 /* clean up and return */
953 (void)inflateEnd(&strm
);
958 disk_cache_get(struct disk_cache
*cache
, const cache_key key
, size_t *size
)
960 int fd
= -1, ret
, len
;
962 char *filename
= NULL
;
963 uint8_t *data
= NULL
;
964 uint8_t *uncompressed_data
= NULL
;
969 filename
= get_cache_file(cache
, key
);
970 if (filename
== NULL
)
973 fd
= open(filename
, O_RDONLY
| O_CLOEXEC
);
977 if (fstat(fd
, &sb
) == -1)
980 data
= malloc(sb
.st_size
);
984 /* Load the CRC that was created when the file was written. */
985 struct cache_entry_file_data cf_data
;
986 size_t cf_data_size
= sizeof(cf_data
);
987 assert(sb
.st_size
> cf_data_size
);
988 for (len
= 0; len
< cf_data_size
; len
+= ret
) {
989 ret
= read(fd
, ((uint8_t *) &cf_data
) + len
, cf_data_size
- len
);
994 /* Load the actual cache data. */
995 size_t cache_data_size
= sb
.st_size
- cf_data_size
;
996 for (len
= 0; len
< cache_data_size
; len
+= ret
) {
997 ret
= read(fd
, data
+ len
, cache_data_size
- len
);
1002 /* Uncompress the cache data */
1003 uncompressed_data
= malloc(cf_data
.uncompressed_size
);
1004 if (!inflate_cache_data(data
, cache_data_size
, uncompressed_data
,
1005 cf_data
.uncompressed_size
))
1008 /* Check the data for corruption */
1009 if (cf_data
.crc32
!= util_hash_crc32(uncompressed_data
,
1010 cf_data
.uncompressed_size
))
1018 *size
= cf_data
.uncompressed_size
;
1020 return uncompressed_data
;
1025 if (uncompressed_data
)
1026 free(uncompressed_data
);
1036 disk_cache_put_key(struct disk_cache
*cache
, const cache_key key
)
1038 const uint32_t *key_chunk
= (const uint32_t *) key
;
1039 int i
= *key_chunk
& CACHE_INDEX_KEY_MASK
;
1040 unsigned char *entry
;
1042 entry
= &cache
->stored_keys
[i
+ CACHE_KEY_SIZE
];
1044 memcpy(entry
, key
, CACHE_KEY_SIZE
);
1047 /* This function lets us test whether a given key was previously
1048 * stored in the cache with disk_cache_put_key(). The implement is
1049 * efficient by not using syscalls or hitting the disk. It's not
1050 * race-free, but the races are benign. If we race with someone else
1051 * calling disk_cache_put_key, then that's just an extra cache miss and an
1055 disk_cache_has_key(struct disk_cache
*cache
, const cache_key key
)
1057 const uint32_t *key_chunk
= (const uint32_t *) key
;
1058 int i
= *key_chunk
& CACHE_INDEX_KEY_MASK
;
1059 unsigned char *entry
;
1061 entry
= &cache
->stored_keys
[i
+ CACHE_KEY_SIZE
];
1063 return memcmp(entry
, key
, CACHE_KEY_SIZE
) == 0;
1066 #endif /* ENABLE_SHADER_CACHE */