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>
34 #include <sys/statvfs.h>
43 #include "util/crc32.h"
44 #include "util/rand_xor.h"
45 #include "util/u_atomic.h"
46 #include "util/u_queue.h"
47 #include "util/mesa-sha1.h"
48 #include "util/ralloc.h"
49 #include "main/errors.h"
50 #include "util/macros.h"
52 #include "disk_cache.h"
54 /* Number of bits to mask off from a cache key to get an index. */
55 #define CACHE_INDEX_KEY_BITS 16
57 /* Mask for computing an index from a key. */
58 #define CACHE_INDEX_KEY_MASK ((1 << CACHE_INDEX_KEY_BITS) - 1)
60 /* The number of keys that can be stored in the index. */
61 #define CACHE_INDEX_MAX_KEYS (1 << CACHE_INDEX_KEY_BITS)
64 /* The path to the cache directory. */
67 /* Thread queue for compressing and writing cache entries to disk */
68 struct util_queue cache_queue
;
70 /* Seed for rand, which is used to pick a random directory */
71 uint64_t seed_xorshift128plus
[2];
73 /* A pointer to the mmapped index file within the cache directory. */
75 size_t index_mmap_size
;
77 /* Pointer to total size of all objects in cache (within index_mmap) */
80 /* Pointer to stored keys, (within index_mmap). */
83 /* Maximum size of all cached objects (in bytes). */
87 struct disk_cache_put_job
{
88 struct util_queue_fence fence
;
90 struct disk_cache
*cache
;
94 /* Copy of cache data to be compressed and written. */
97 /* Size of data to be compressed and written. */
101 /* Create a directory named 'path' if it does not already exist.
103 * Returns: 0 if path already exists as a directory or if created.
104 * -1 in all other cases.
107 mkdir_if_needed(const char *path
)
111 /* If the path exists already, then our work is done if it's a
112 * directory, but it's an error if it is not.
114 if (stat(path
, &sb
) == 0) {
115 if (S_ISDIR(sb
.st_mode
)) {
118 fprintf(stderr
, "Cannot use %s for shader cache (not a directory)"
119 "---disabling.\n", path
);
124 int ret
= mkdir(path
, 0755);
125 if (ret
== 0 || (ret
== -1 && errno
== EEXIST
))
128 fprintf(stderr
, "Failed to create %s for shader cache (%s)---disabling.\n",
129 path
, strerror(errno
));
134 /* Concatenate an existing path and a new name to form a new path. If the new
135 * path does not exist as a directory, create it then return the resulting
136 * name of the new path (ralloc'ed off of 'ctx').
138 * Returns NULL on any error, such as:
140 * <path> does not exist or is not a directory
141 * <path>/<name> exists but is not a directory
142 * <path>/<name> cannot be created as a directory
145 concatenate_and_mkdir(void *ctx
, const char *path
, const char *name
)
150 if (stat(path
, &sb
) != 0 || ! S_ISDIR(sb
.st_mode
))
153 new_path
= ralloc_asprintf(ctx
, "%s/%s", path
, name
);
155 if (mkdir_if_needed(new_path
) == 0)
162 remove_dir(const char *fpath
, const struct stat
*sb
,
163 int typeflag
, struct FTW
*ftwbuf
)
165 if (S_ISREG(sb
->st_mode
))
167 else if (S_ISDIR(sb
->st_mode
))
174 remove_old_cache_directories(void *mem_ctx
, const char *path
,
175 const char *timestamp
)
177 DIR *dir
= opendir(path
);
179 struct dirent
* d_entry
;
180 while((d_entry
= readdir(dir
)) != NULL
)
183 ralloc_asprintf(mem_ctx
, "%s/%s", path
, d_entry
->d_name
);
186 if (stat(full_path
, &sb
) == 0 && S_ISDIR(sb
.st_mode
) &&
187 strcmp(d_entry
->d_name
, timestamp
) != 0 &&
188 strcmp(d_entry
->d_name
, "..") != 0 &&
189 strcmp(d_entry
->d_name
, ".") != 0) {
190 nftw(full_path
, remove_dir
, 20, FTW_DEPTH
);
198 create_mesa_cache_dir(void *mem_ctx
, const char *path
, const char *timestamp
,
199 const char *gpu_name
)
201 char *new_path
= concatenate_and_mkdir(mem_ctx
, path
, "mesa");
202 if (new_path
== NULL
)
205 /* Create a parent architecture directory so that we don't remove cache
206 * files for other architectures. In theory we could share the cache
207 * between architectures but we have no way of knowing if they were created
208 * by a compatible Mesa version.
210 new_path
= concatenate_and_mkdir(mem_ctx
, new_path
, get_arch_bitness_str());
211 if (new_path
== NULL
)
214 /* Remove cache directories for old Mesa versions */
215 remove_old_cache_directories(mem_ctx
, new_path
, timestamp
);
217 new_path
= concatenate_and_mkdir(mem_ctx
, new_path
, timestamp
);
218 if (new_path
== NULL
)
221 new_path
= concatenate_and_mkdir(mem_ctx
, new_path
, gpu_name
);
222 if (new_path
== NULL
)
229 disk_cache_create(const char *gpu_name
, const char *timestamp
)
232 struct disk_cache
*cache
= NULL
;
233 char *path
, *max_size_str
;
237 struct statvfs vfs
= { 0 };
240 /* If running as a users other than the real user disable cache */
241 if (geteuid() != getuid())
244 /* A ralloc context for transient data during this invocation. */
245 local
= ralloc_context(NULL
);
249 /* At user request, disable shader cache entirely. */
250 if (getenv("MESA_GLSL_CACHE_DISABLE"))
253 /* Determine path for cache based on the first defined name as follows:
255 * $MESA_GLSL_CACHE_DIR
256 * $XDG_CACHE_HOME/mesa
257 * <pwd.pw_dir>/.cache/mesa
259 path
= getenv("MESA_GLSL_CACHE_DIR");
261 if (mkdir_if_needed(path
) == -1)
264 path
= create_mesa_cache_dir(local
, path
, timestamp
,
271 char *xdg_cache_home
= getenv("XDG_CACHE_HOME");
273 if (xdg_cache_home
) {
274 if (mkdir_if_needed(xdg_cache_home
) == -1)
277 path
= create_mesa_cache_dir(local
, xdg_cache_home
, timestamp
,
287 struct passwd pwd
, *result
;
289 buf_size
= sysconf(_SC_GETPW_R_SIZE_MAX
);
293 /* Loop until buf_size is large enough to query the directory */
295 buf
= ralloc_size(local
, buf_size
);
297 getpwuid_r(getuid(), &pwd
, buf
, buf_size
, &result
);
301 if (errno
== ERANGE
) {
310 path
= concatenate_and_mkdir(local
, pwd
.pw_dir
, ".cache");
314 path
= create_mesa_cache_dir(local
, path
, timestamp
, gpu_name
);
319 cache
= ralloc(NULL
, struct disk_cache
);
323 cache
->path
= ralloc_strdup(cache
, path
);
324 if (cache
->path
== NULL
)
327 path
= ralloc_asprintf(local
, "%s/index", cache
->path
);
331 fd
= open(path
, O_RDWR
| O_CREAT
| O_CLOEXEC
, 0644);
335 if (fstat(fd
, &sb
) == -1)
338 /* Force the index file to be the expected size. */
339 size
= sizeof(*cache
->size
) + CACHE_INDEX_MAX_KEYS
* CACHE_KEY_SIZE
;
340 if (sb
.st_size
!= size
) {
341 if (ftruncate(fd
, size
) == -1)
345 /* We map this shared so that other processes see updates that we
348 * Note: We do use atomic addition to ensure that multiple
349 * processes don't scramble the cache size recorded in the
350 * index. But we don't use any locking to prevent multiple
351 * processes from updating the same entry simultaneously. The idea
352 * is that if either result lands entirely in the index, then
353 * that's equivalent to a well-ordered write followed by an
354 * eviction and a write. On the other hand, if the simultaneous
355 * writes result in a corrupt entry, that's not really any
356 * different than both entries being evicted, (since within the
357 * guarantees of the cryptographic hash, a corrupt entry is
358 * unlikely to ever match a real cache key).
360 cache
->index_mmap
= mmap(NULL
, size
, PROT_READ
| PROT_WRITE
,
362 if (cache
->index_mmap
== MAP_FAILED
)
364 cache
->index_mmap_size
= size
;
368 cache
->size
= (uint64_t *) cache
->index_mmap
;
369 cache
->stored_keys
= cache
->index_mmap
+ sizeof(uint64_t);
373 max_size_str
= getenv("MESA_GLSL_CACHE_MAX_SIZE");
376 max_size
= strtoul(max_size_str
, &end
, 10);
377 if (end
== max_size_str
) {
387 max_size
*= 1024*1024;
393 max_size
*= 1024*1024*1024;
399 /* Default to 1GB or 10% of filesystem for maximum cache size. */
402 max_size
= MAX2(1024*1024*1024, vfs
.f_blocks
* vfs
.f_bsize
/ 10);
405 cache
->max_size
= max_size
;
407 /* A limit of 32 jobs was choosen as observations of Deus Ex start-up times
408 * showed that we reached at most 11 jobs on an Intel i5-6400 CPU@2.70GHz
409 * (a fairly modest desktop CPU). 1 thread was chosen because we don't
410 * really care about getting things to disk quickly just that it's not
411 * blocking other tasks.
413 util_queue_init(&cache
->cache_queue
, "disk_cache", 32, 1);
415 /* Seed our rand function */
416 s_rand_xorshift128plus(cache
->seed_xorshift128plus
, true);
433 disk_cache_destroy(struct disk_cache
*cache
)
436 util_queue_destroy(&cache
->cache_queue
);
437 munmap(cache
->index_mmap
, cache
->index_mmap_size
);
443 /* Return a filename within the cache's directory corresponding to 'key'. The
444 * returned filename is ralloced with 'cache' as the parent context.
446 * Returns NULL if out of memory.
449 get_cache_file(struct disk_cache
*cache
, const cache_key key
)
454 _mesa_sha1_format(buf
, key
);
455 if (asprintf(&filename
, "%s/%c%c/%s", cache
->path
, buf
[0],
456 buf
[1], buf
+ 2) == -1)
462 /* Create the directory that will be needed for the cache file for \key.
464 * Obviously, the implementation here must closely match
465 * _get_cache_file above.
468 make_cache_file_directory(struct disk_cache
*cache
, const cache_key key
)
473 _mesa_sha1_format(buf
, key
);
474 if (asprintf(&dir
, "%s/%c%c", cache
->path
, buf
[0], buf
[1]) == -1)
477 mkdir_if_needed(dir
);
481 /* Given a directory path and predicate function, find the entry with
482 * the oldest access time in that directory for which the predicate
485 * Returns: A malloc'ed string for the path to the chosen file, (or
486 * NULL on any error). The caller should free the string when
490 choose_lru_file_matching(const char *dir_path
,
491 bool (*predicate
)(const char *dir_path
,
493 const char *, const size_t))
496 struct dirent
*entry
;
498 char *lru_name
= NULL
;
499 time_t lru_atime
= 0;
501 dir
= opendir(dir_path
);
506 entry
= readdir(dir
);
511 if (fstatat(dirfd(dir
), entry
->d_name
, &sb
, 0) == 0) {
512 if (!lru_atime
|| (sb
.st_atime
< lru_atime
)) {
513 size_t len
= strlen(entry
->d_name
);
515 if (!predicate(dir_path
, &sb
, entry
->d_name
, len
))
518 char *tmp
= realloc(lru_name
, len
+ 1);
521 memcpy(lru_name
, entry
->d_name
, len
+ 1);
522 lru_atime
= sb
.st_atime
;
528 if (lru_name
== NULL
) {
533 if (asprintf(&filename
, "%s/%s", dir_path
, lru_name
) < 0)
542 /* Is entry a regular file, and not having a name with a trailing
546 is_regular_non_tmp_file(const char *path
, const struct stat
*sb
,
547 const char *d_name
, const size_t len
)
549 if (!S_ISREG(sb
->st_mode
))
552 if (len
>= 4 && strcmp(&d_name
[len
-4], ".tmp") == 0)
558 /* Returns the size of the deleted file, (or 0 on any error). */
560 unlink_lru_file_from_directory(const char *path
)
565 filename
= choose_lru_file_matching(path
, is_regular_non_tmp_file
);
566 if (filename
== NULL
)
569 if (stat(filename
, &sb
) == -1) {
580 /* Is entry a directory with a two-character name, (and not the
581 * special name of ".."). We also return false if the dir is empty.
584 is_two_character_sub_directory(const char *path
, const struct stat
*sb
,
585 const char *d_name
, const size_t len
)
587 if (!S_ISDIR(sb
->st_mode
))
593 if (strcmp(d_name
, "..") == 0)
597 if (asprintf(&subdir
, "%s/%s", path
, d_name
) == -1)
599 DIR *dir
= opendir(subdir
);
605 unsigned subdir_entries
= 0;
607 while ((d
= readdir(dir
)) != NULL
) {
608 if(++subdir_entries
> 2)
613 /* If dir only contains '.' and '..' it must be empty */
614 if (subdir_entries
<= 2)
621 evict_lru_item(struct disk_cache
*cache
)
625 /* With a reasonably-sized, full cache, (and with keys generated
626 * from a cryptographic hash), we can choose two random hex digits
627 * and reasonably expect the directory to exist with a file in it.
628 * Provides pseudo-LRU eviction to reduce checking all cache files.
630 uint64_t rand64
= rand_xorshift128plus(cache
->seed_xorshift128plus
);
631 if (asprintf(&dir_path
, "%s/%02" PRIx64
, cache
->path
, rand64
& 0xff) < 0)
634 size_t size
= unlink_lru_file_from_directory(dir_path
);
639 p_atomic_add(cache
->size
, - (uint64_t)size
);
643 /* In the case where the random choice of directory didn't find
644 * something, we choose the least recently accessed from the
645 * existing directories.
647 * Really, the only reason this code exists is to allow the unit
648 * tests to work, (which use an artificially-small cache to be able
649 * to force a single cached item to be evicted).
651 dir_path
= choose_lru_file_matching(cache
->path
,
652 is_two_character_sub_directory
);
653 if (dir_path
== NULL
)
656 size
= unlink_lru_file_from_directory(dir_path
);
661 p_atomic_add(cache
->size
, - (uint64_t)size
);
665 disk_cache_remove(struct disk_cache
*cache
, const cache_key key
)
669 char *filename
= get_cache_file(cache
, key
);
670 if (filename
== NULL
) {
674 if (stat(filename
, &sb
) == -1) {
683 p_atomic_add(cache
->size
, - (uint64_t)sb
.st_size
);
687 write_all(int fd
, const void *buf
, size_t count
)
689 const char *out
= buf
;
693 for (done
= 0; done
< count
; done
+= written
) {
694 written
= write(fd
, out
+ done
, count
- done
);
701 /* From the zlib docs:
702 * "If the memory is available, buffers sizes on the order of 128K or 256K
703 * bytes should be used."
705 #define BUFSIZE 256 * 1024
708 * Compresses cache entry in memory and writes it to disk. Returns the size
709 * of the data written to disk.
712 deflate_and_write_to_disk(const void *in_data
, size_t in_data_size
, int dest
,
713 const char *filename
)
715 unsigned char out
[BUFSIZE
];
717 /* allocate deflate state */
719 strm
.zalloc
= Z_NULL
;
721 strm
.opaque
= Z_NULL
;
722 strm
.next_in
= (uint8_t *) in_data
;
723 strm
.avail_in
= in_data_size
;
725 int ret
= deflateInit(&strm
, Z_BEST_COMPRESSION
);
729 /* compress until end of in_data */
730 size_t compressed_size
= 0;
733 int remaining
= in_data_size
- BUFSIZE
;
734 flush
= remaining
> 0 ? Z_NO_FLUSH
: Z_FINISH
;
735 in_data_size
-= BUFSIZE
;
737 /* Run deflate() on input until the output buffer is not full (which
738 * means there is no more data to deflate).
741 strm
.avail_out
= BUFSIZE
;
744 ret
= deflate(&strm
, flush
); /* no bad return value */
745 assert(ret
!= Z_STREAM_ERROR
); /* state not clobbered */
747 size_t have
= BUFSIZE
- strm
.avail_out
;
748 compressed_size
+= have
;
750 ssize_t written
= write_all(dest
, out
, have
);
752 (void)deflateEnd(&strm
);
755 } while (strm
.avail_out
== 0);
757 /* all input should be used */
758 assert(strm
.avail_in
== 0);
760 } while (flush
!= Z_FINISH
);
762 /* stream should be complete */
763 assert(ret
== Z_STREAM_END
);
765 /* clean up and return */
766 (void)deflateEnd(&strm
);
767 return compressed_size
;
770 static struct disk_cache_put_job
*
771 create_put_job(struct disk_cache
*cache
, const cache_key key
,
772 const void *data
, size_t size
)
774 struct disk_cache_put_job
*dc_job
= (struct disk_cache_put_job
*)
775 malloc(sizeof(struct disk_cache_put_job
) + size
);
778 dc_job
->cache
= cache
;
779 memcpy(dc_job
->key
, key
, sizeof(cache_key
));
780 dc_job
->data
= dc_job
+ 1;
781 memcpy(dc_job
->data
, data
, size
);
789 destroy_put_job(void *job
, int thread_index
)
796 struct cache_entry_file_data
{
798 uint32_t uncompressed_size
;
802 cache_put(void *job
, int thread_index
)
806 int fd
= -1, fd_final
= -1, err
, ret
;
808 char *filename
= NULL
, *filename_tmp
= NULL
;
809 struct disk_cache_put_job
*dc_job
= (struct disk_cache_put_job
*) job
;
811 filename
= get_cache_file(dc_job
->cache
, dc_job
->key
);
812 if (filename
== NULL
)
815 /* If the cache is too large, evict something else first. */
816 while (*dc_job
->cache
->size
+ dc_job
->size
> dc_job
->cache
->max_size
&&
818 evict_lru_item(dc_job
->cache
);
822 /* Write to a temporary file to allow for an atomic rename to the
823 * final destination filename, (to prevent any readers from seeing
824 * a partially written file).
826 if (asprintf(&filename_tmp
, "%s.tmp", filename
) == -1)
829 fd
= open(filename_tmp
, O_WRONLY
| O_CLOEXEC
| O_CREAT
, 0644);
831 /* Make the two-character subdirectory within the cache as needed. */
836 make_cache_file_directory(dc_job
->cache
, dc_job
->key
);
838 fd
= open(filename_tmp
, O_WRONLY
| O_CLOEXEC
| O_CREAT
, 0644);
843 /* With the temporary file open, we take an exclusive flock on
844 * it. If the flock fails, then another process still has the file
845 * open with the flock held. So just let that file be responsible
846 * for writing the file.
848 err
= flock(fd
, LOCK_EX
| LOCK_NB
);
852 /* Now that we have the lock on the open temporary file, we can
853 * check to see if the destination file already exists. If so,
854 * another process won the race between when we saw that the file
855 * didn't exist and now. In this case, we don't do anything more,
856 * (to ensure the size accounting of the cache doesn't get off).
858 fd_final
= open(filename
, O_RDONLY
| O_CLOEXEC
);
859 if (fd_final
!= -1) {
860 unlink(filename_tmp
);
864 /* OK, we're now on the hook to write out a file that we know is
865 * not in the cache, and is also not being written out to the cache
866 * by some other process.
868 * Create CRC of the data and store at the start of the file. We will
869 * read this when restoring the cache and use it to check for corruption.
871 struct cache_entry_file_data cf_data
;
872 cf_data
.crc32
= util_hash_crc32(dc_job
->data
, dc_job
->size
);
873 cf_data
.uncompressed_size
= dc_job
->size
;
875 size_t cf_data_size
= sizeof(cf_data
);
876 ret
= write_all(fd
, &cf_data
, cf_data_size
);
878 unlink(filename_tmp
);
882 /* Now, finally, write out the contents to the temporary file, then
883 * rename them atomically to the destination filename, and also
884 * perform an atomic increment of the total cache size.
886 size_t file_size
= deflate_and_write_to_disk(dc_job
->data
, dc_job
->size
,
888 if (file_size
== 0) {
889 unlink(filename_tmp
);
892 ret
= rename(filename_tmp
, filename
);
894 unlink(filename_tmp
);
898 file_size
+= cf_data_size
;
899 p_atomic_add(dc_job
->cache
->size
, file_size
);
904 /* This close finally releases the flock, (now that the final file
905 * has been renamed into place and the size has been added).
916 disk_cache_put(struct disk_cache
*cache
, const cache_key key
,
917 const void *data
, size_t size
)
919 struct disk_cache_put_job
*dc_job
=
920 create_put_job(cache
, key
, data
, size
);
923 util_queue_fence_init(&dc_job
->fence
);
924 util_queue_add_job(&cache
->cache_queue
, dc_job
, &dc_job
->fence
,
925 cache_put
, destroy_put_job
);
930 * Decompresses cache entry, returns true if successful.
933 inflate_cache_data(uint8_t *in_data
, size_t in_data_size
,
934 uint8_t *out_data
, size_t out_data_size
)
938 /* allocate inflate state */
939 strm
.zalloc
= Z_NULL
;
941 strm
.opaque
= Z_NULL
;
942 strm
.next_in
= in_data
;
943 strm
.avail_in
= in_data_size
;
944 strm
.next_out
= out_data
;
945 strm
.avail_out
= out_data_size
;
947 int ret
= inflateInit(&strm
);
951 ret
= inflate(&strm
, Z_NO_FLUSH
);
952 assert(ret
!= Z_STREAM_ERROR
); /* state not clobbered */
954 /* Unless there was an error we should have decompressed everything in one
955 * go as we know the uncompressed file size.
957 if (ret
!= Z_STREAM_END
) {
958 (void)inflateEnd(&strm
);
961 assert(strm
.avail_out
== 0);
963 /* clean up and return */
964 (void)inflateEnd(&strm
);
969 disk_cache_get(struct disk_cache
*cache
, const cache_key key
, size_t *size
)
971 int fd
= -1, ret
, len
;
973 char *filename
= NULL
;
974 uint8_t *data
= NULL
;
975 uint8_t *uncompressed_data
= NULL
;
980 filename
= get_cache_file(cache
, key
);
981 if (filename
== NULL
)
984 fd
= open(filename
, O_RDONLY
| O_CLOEXEC
);
988 if (fstat(fd
, &sb
) == -1)
991 data
= malloc(sb
.st_size
);
995 /* Load the CRC that was created when the file was written. */
996 struct cache_entry_file_data cf_data
;
997 size_t cf_data_size
= sizeof(cf_data
);
998 assert(sb
.st_size
> cf_data_size
);
999 for (len
= 0; len
< cf_data_size
; len
+= ret
) {
1000 ret
= read(fd
, ((uint8_t *) &cf_data
) + len
, cf_data_size
- len
);
1005 /* Load the actual cache data. */
1006 size_t cache_data_size
= sb
.st_size
- cf_data_size
;
1007 for (len
= 0; len
< cache_data_size
; len
+= ret
) {
1008 ret
= read(fd
, data
+ len
, cache_data_size
- len
);
1013 /* Uncompress the cache data */
1014 uncompressed_data
= malloc(cf_data
.uncompressed_size
);
1015 if (!inflate_cache_data(data
, cache_data_size
, uncompressed_data
,
1016 cf_data
.uncompressed_size
))
1019 /* Check the data for corruption */
1020 if (cf_data
.crc32
!= util_hash_crc32(uncompressed_data
,
1021 cf_data
.uncompressed_size
))
1029 *size
= cf_data
.uncompressed_size
;
1031 return uncompressed_data
;
1036 if (uncompressed_data
)
1037 free(uncompressed_data
);
1047 disk_cache_put_key(struct disk_cache
*cache
, const cache_key key
)
1049 const uint32_t *key_chunk
= (const uint32_t *) key
;
1050 int i
= *key_chunk
& CACHE_INDEX_KEY_MASK
;
1051 unsigned char *entry
;
1053 entry
= &cache
->stored_keys
[i
* CACHE_KEY_SIZE
];
1055 memcpy(entry
, key
, CACHE_KEY_SIZE
);
1058 /* This function lets us test whether a given key was previously
1059 * stored in the cache with disk_cache_put_key(). The implement is
1060 * efficient by not using syscalls or hitting the disk. It's not
1061 * race-free, but the races are benign. If we race with someone else
1062 * calling disk_cache_put_key, then that's just an extra cache miss and an
1066 disk_cache_has_key(struct disk_cache
*cache
, const cache_key key
)
1068 const uint32_t *key_chunk
= (const uint32_t *) key
;
1069 int i
= *key_chunk
& CACHE_INDEX_KEY_MASK
;
1070 unsigned char *entry
;
1072 entry
= &cache
->stored_keys
[i
* CACHE_KEY_SIZE
];
1074 return memcmp(entry
, key
, CACHE_KEY_SIZE
) == 0;
1078 disk_cache_compute_key(struct disk_cache
*cache
, const void *data
, size_t size
,
1081 _mesa_sha1_compute(data
, size
, key
);
1084 #endif /* ENABLE_SHADER_CACHE */