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/debug.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/compiler.h"
50 #include "main/errors.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)
63 /* The cache version should be bumped whenever a change is made to the
64 * structure of cache entries or the index. This will give any 3rd party
65 * applications reading the cache entries a chance to adjust to the changes.
67 * - The cache version is checked internally when reading a cache entry. If we
68 * ever have a mismatch we are in big trouble as this means we had a cache
69 * collision. In case of such an event please check the skys for giant
70 * asteroids and that the entire Mesa team hasn't been eaten by wolves.
72 * - There is no strict requirement that cache versions be backwards
73 * compatible but effort should be taken to limit disruption where possible.
75 #define CACHE_VERSION 1
78 /* The path to the cache directory. */
80 bool path_init_failed
;
82 /* Thread queue for compressing and writing cache entries to disk */
83 struct util_queue cache_queue
;
85 /* Seed for rand, which is used to pick a random directory */
86 uint64_t seed_xorshift128plus
[2];
88 /* A pointer to the mmapped index file within the cache directory. */
90 size_t index_mmap_size
;
92 /* Pointer to total size of all objects in cache (within index_mmap) */
95 /* Pointer to stored keys, (within index_mmap). */
98 /* Maximum size of all cached objects (in bytes). */
101 /* Driver cache keys. */
102 uint8_t *driver_keys_blob
;
103 size_t driver_keys_blob_size
;
105 disk_cache_put_cb blob_put_cb
;
106 disk_cache_get_cb blob_get_cb
;
109 struct disk_cache_put_job
{
110 struct util_queue_fence fence
;
112 struct disk_cache
*cache
;
116 /* Copy of cache data to be compressed and written. */
119 /* Size of data to be compressed and written. */
122 struct cache_item_metadata cache_item_metadata
;
125 /* Create a directory named 'path' if it does not already exist.
127 * Returns: 0 if path already exists as a directory or if created.
128 * -1 in all other cases.
131 mkdir_if_needed(const char *path
)
135 /* If the path exists already, then our work is done if it's a
136 * directory, but it's an error if it is not.
138 if (stat(path
, &sb
) == 0) {
139 if (S_ISDIR(sb
.st_mode
)) {
142 fprintf(stderr
, "Cannot use %s for shader cache (not a directory)"
143 "---disabling.\n", path
);
148 int ret
= mkdir(path
, 0755);
149 if (ret
== 0 || (ret
== -1 && errno
== EEXIST
))
152 fprintf(stderr
, "Failed to create %s for shader cache (%s)---disabling.\n",
153 path
, strerror(errno
));
158 /* Concatenate an existing path and a new name to form a new path. If the new
159 * path does not exist as a directory, create it then return the resulting
160 * name of the new path (ralloc'ed off of 'ctx').
162 * Returns NULL on any error, such as:
164 * <path> does not exist or is not a directory
165 * <path>/<name> exists but is not a directory
166 * <path>/<name> cannot be created as a directory
169 concatenate_and_mkdir(void *ctx
, const char *path
, const char *name
)
174 if (stat(path
, &sb
) != 0 || ! S_ISDIR(sb
.st_mode
))
177 new_path
= ralloc_asprintf(ctx
, "%s/%s", path
, name
);
179 if (mkdir_if_needed(new_path
) == 0)
185 #define DRV_KEY_CPY(_dst, _src, _src_size) \
187 memcpy(_dst, _src, _src_size); \
192 disk_cache_create(const char *gpu_name
, const char *timestamp
,
193 uint64_t driver_flags
)
196 struct disk_cache
*cache
= NULL
;
197 char *path
, *max_size_str
;
203 uint8_t cache_version
= CACHE_VERSION
;
204 size_t cv_size
= sizeof(cache_version
);
206 /* If running as a users other than the real user disable cache */
207 if (geteuid() != getuid())
210 /* A ralloc context for transient data during this invocation. */
211 local
= ralloc_context(NULL
);
215 /* At user request, disable shader cache entirely. */
216 if (env_var_as_boolean("MESA_GLSL_CACHE_DISABLE", false))
219 cache
= rzalloc(NULL
, struct disk_cache
);
223 /* Assume failure. */
224 cache
->path_init_failed
= true;
226 /* Determine path for cache based on the first defined name as follows:
228 * $MESA_GLSL_CACHE_DIR
229 * $XDG_CACHE_HOME/mesa_shader_cache
230 * <pwd.pw_dir>/.cache/mesa_shader_cache
232 path
= getenv("MESA_GLSL_CACHE_DIR");
234 if (mkdir_if_needed(path
) == -1)
237 path
= concatenate_and_mkdir(local
, path
, CACHE_DIR_NAME
);
243 char *xdg_cache_home
= getenv("XDG_CACHE_HOME");
245 if (xdg_cache_home
) {
246 if (mkdir_if_needed(xdg_cache_home
) == -1)
249 path
= concatenate_and_mkdir(local
, xdg_cache_home
, CACHE_DIR_NAME
);
258 struct passwd pwd
, *result
;
260 buf_size
= sysconf(_SC_GETPW_R_SIZE_MAX
);
264 /* Loop until buf_size is large enough to query the directory */
266 buf
= ralloc_size(local
, buf_size
);
268 getpwuid_r(getuid(), &pwd
, buf
, buf_size
, &result
);
272 if (errno
== ERANGE
) {
281 path
= concatenate_and_mkdir(local
, pwd
.pw_dir
, ".cache");
285 path
= concatenate_and_mkdir(local
, path
, CACHE_DIR_NAME
);
290 cache
->path
= ralloc_strdup(cache
, path
);
291 if (cache
->path
== NULL
)
294 path
= ralloc_asprintf(local
, "%s/index", cache
->path
);
298 fd
= open(path
, O_RDWR
| O_CREAT
| O_CLOEXEC
, 0644);
302 if (fstat(fd
, &sb
) == -1)
305 /* Force the index file to be the expected size. */
306 size
= sizeof(*cache
->size
) + CACHE_INDEX_MAX_KEYS
* CACHE_KEY_SIZE
;
307 if (sb
.st_size
!= size
) {
308 if (ftruncate(fd
, size
) == -1)
312 /* We map this shared so that other processes see updates that we
315 * Note: We do use atomic addition to ensure that multiple
316 * processes don't scramble the cache size recorded in the
317 * index. But we don't use any locking to prevent multiple
318 * processes from updating the same entry simultaneously. The idea
319 * is that if either result lands entirely in the index, then
320 * that's equivalent to a well-ordered write followed by an
321 * eviction and a write. On the other hand, if the simultaneous
322 * writes result in a corrupt entry, that's not really any
323 * different than both entries being evicted, (since within the
324 * guarantees of the cryptographic hash, a corrupt entry is
325 * unlikely to ever match a real cache key).
327 cache
->index_mmap
= mmap(NULL
, size
, PROT_READ
| PROT_WRITE
,
329 if (cache
->index_mmap
== MAP_FAILED
)
331 cache
->index_mmap_size
= size
;
335 cache
->size
= (uint64_t *) cache
->index_mmap
;
336 cache
->stored_keys
= cache
->index_mmap
+ sizeof(uint64_t);
340 max_size_str
= getenv("MESA_GLSL_CACHE_MAX_SIZE");
343 max_size
= strtoul(max_size_str
, &end
, 10);
344 if (end
== max_size_str
) {
354 max_size
*= 1024*1024;
360 max_size
*= 1024*1024*1024;
366 /* Default to 1GB for maximum cache size. */
368 max_size
= 1024*1024*1024;
371 cache
->max_size
= max_size
;
373 /* 1 thread was chosen because we don't really care about getting things
374 * to disk quickly just that it's not blocking other tasks.
376 * The queue will resize automatically when it's full, so adding new jobs
379 util_queue_init(&cache
->cache_queue
, "disk$", 32, 1,
380 UTIL_QUEUE_INIT_RESIZE_IF_FULL
|
381 UTIL_QUEUE_INIT_USE_MINIMUM_PRIORITY
);
383 cache
->path_init_failed
= false;
387 cache
->driver_keys_blob_size
= cv_size
;
389 /* Create driver id keys */
390 size_t ts_size
= strlen(timestamp
) + 1;
391 size_t gpu_name_size
= strlen(gpu_name
) + 1;
392 cache
->driver_keys_blob_size
+= ts_size
;
393 cache
->driver_keys_blob_size
+= gpu_name_size
;
395 /* We sometimes store entire structs that contains a pointers in the cache,
396 * use pointer size as a key to avoid hard to debug issues.
398 uint8_t ptr_size
= sizeof(void *);
399 size_t ptr_size_size
= sizeof(ptr_size
);
400 cache
->driver_keys_blob_size
+= ptr_size_size
;
402 size_t driver_flags_size
= sizeof(driver_flags
);
403 cache
->driver_keys_blob_size
+= driver_flags_size
;
405 cache
->driver_keys_blob
=
406 ralloc_size(cache
, cache
->driver_keys_blob_size
);
407 if (!cache
->driver_keys_blob
)
410 uint8_t *drv_key_blob
= cache
->driver_keys_blob
;
411 DRV_KEY_CPY(drv_key_blob
, &cache_version
, cv_size
)
412 DRV_KEY_CPY(drv_key_blob
, timestamp
, ts_size
)
413 DRV_KEY_CPY(drv_key_blob
, gpu_name
, gpu_name_size
)
414 DRV_KEY_CPY(drv_key_blob
, &ptr_size
, ptr_size_size
)
415 DRV_KEY_CPY(drv_key_blob
, &driver_flags
, driver_flags_size
)
417 /* Seed our rand function */
418 s_rand_xorshift128plus(cache
->seed_xorshift128plus
, true);
435 disk_cache_destroy(struct disk_cache
*cache
)
437 if (cache
&& !cache
->path_init_failed
) {
438 util_queue_destroy(&cache
->cache_queue
);
439 munmap(cache
->index_mmap
, cache
->index_mmap_size
);
445 /* Return a filename within the cache's directory corresponding to 'key'. The
446 * returned filename is ralloced with 'cache' as the parent context.
448 * Returns NULL if out of memory.
451 get_cache_file(struct disk_cache
*cache
, const cache_key key
)
456 if (cache
->path_init_failed
)
459 _mesa_sha1_format(buf
, key
);
460 if (asprintf(&filename
, "%s/%c%c/%s", cache
->path
, buf
[0],
461 buf
[1], buf
+ 2) == -1)
467 /* Create the directory that will be needed for the cache file for \key.
469 * Obviously, the implementation here must closely match
470 * _get_cache_file above.
473 make_cache_file_directory(struct disk_cache
*cache
, const cache_key key
)
478 _mesa_sha1_format(buf
, key
);
479 if (asprintf(&dir
, "%s/%c%c", cache
->path
, buf
[0], buf
[1]) == -1)
482 mkdir_if_needed(dir
);
486 /* Given a directory path and predicate function, find the entry with
487 * the oldest access time in that directory for which the predicate
490 * Returns: A malloc'ed string for the path to the chosen file, (or
491 * NULL on any error). The caller should free the string when
495 choose_lru_file_matching(const char *dir_path
,
496 bool (*predicate
)(const char *dir_path
,
498 const char *, const size_t))
501 struct dirent
*entry
;
503 char *lru_name
= NULL
;
504 time_t lru_atime
= 0;
506 dir
= opendir(dir_path
);
511 entry
= readdir(dir
);
516 if (fstatat(dirfd(dir
), entry
->d_name
, &sb
, 0) == 0) {
517 if (!lru_atime
|| (sb
.st_atime
< lru_atime
)) {
518 size_t len
= strlen(entry
->d_name
);
520 if (!predicate(dir_path
, &sb
, entry
->d_name
, len
))
523 char *tmp
= realloc(lru_name
, len
+ 1);
526 memcpy(lru_name
, entry
->d_name
, len
+ 1);
527 lru_atime
= sb
.st_atime
;
533 if (lru_name
== NULL
) {
538 if (asprintf(&filename
, "%s/%s", dir_path
, lru_name
) < 0)
547 /* Is entry a regular file, and not having a name with a trailing
551 is_regular_non_tmp_file(const char *path
, const struct stat
*sb
,
552 const char *d_name
, const size_t len
)
554 if (!S_ISREG(sb
->st_mode
))
557 if (len
>= 4 && strcmp(&d_name
[len
-4], ".tmp") == 0)
563 /* Returns the size of the deleted file, (or 0 on any error). */
565 unlink_lru_file_from_directory(const char *path
)
570 filename
= choose_lru_file_matching(path
, is_regular_non_tmp_file
);
571 if (filename
== NULL
)
574 if (stat(filename
, &sb
) == -1) {
582 return sb
.st_blocks
* 512;
585 /* Is entry a directory with a two-character name, (and not the
586 * special name of ".."). We also return false if the dir is empty.
589 is_two_character_sub_directory(const char *path
, const struct stat
*sb
,
590 const char *d_name
, const size_t len
)
592 if (!S_ISDIR(sb
->st_mode
))
598 if (strcmp(d_name
, "..") == 0)
602 if (asprintf(&subdir
, "%s/%s", path
, d_name
) == -1)
604 DIR *dir
= opendir(subdir
);
610 unsigned subdir_entries
= 0;
612 while ((d
= readdir(dir
)) != NULL
) {
613 if(++subdir_entries
> 2)
618 /* If dir only contains '.' and '..' it must be empty */
619 if (subdir_entries
<= 2)
626 evict_lru_item(struct disk_cache
*cache
)
630 /* With a reasonably-sized, full cache, (and with keys generated
631 * from a cryptographic hash), we can choose two random hex digits
632 * and reasonably expect the directory to exist with a file in it.
633 * Provides pseudo-LRU eviction to reduce checking all cache files.
635 uint64_t rand64
= rand_xorshift128plus(cache
->seed_xorshift128plus
);
636 if (asprintf(&dir_path
, "%s/%02" PRIx64
, cache
->path
, rand64
& 0xff) < 0)
639 size_t size
= unlink_lru_file_from_directory(dir_path
);
644 p_atomic_add(cache
->size
, - (uint64_t)size
);
648 /* In the case where the random choice of directory didn't find
649 * something, we choose the least recently accessed from the
650 * existing directories.
652 * Really, the only reason this code exists is to allow the unit
653 * tests to work, (which use an artificially-small cache to be able
654 * to force a single cached item to be evicted).
656 dir_path
= choose_lru_file_matching(cache
->path
,
657 is_two_character_sub_directory
);
658 if (dir_path
== NULL
)
661 size
= unlink_lru_file_from_directory(dir_path
);
666 p_atomic_add(cache
->size
, - (uint64_t)size
);
670 disk_cache_remove(struct disk_cache
*cache
, const cache_key key
)
674 char *filename
= get_cache_file(cache
, key
);
675 if (filename
== NULL
) {
679 if (stat(filename
, &sb
) == -1) {
688 p_atomic_add(cache
->size
, - (uint64_t)sb
.st_blocks
* 512);
692 read_all(int fd
, void *buf
, size_t count
)
698 for (done
= 0; done
< count
; done
+= read_ret
) {
699 read_ret
= read(fd
, in
+ done
, count
- done
);
700 if (read_ret
== -1 || read_ret
== 0)
707 write_all(int fd
, const void *buf
, size_t count
)
709 const char *out
= buf
;
713 for (done
= 0; done
< count
; done
+= written
) {
714 written
= write(fd
, out
+ done
, count
- done
);
721 /* From the zlib docs:
722 * "If the memory is available, buffers sizes on the order of 128K or 256K
723 * bytes should be used."
725 #define BUFSIZE 256 * 1024
728 * Compresses cache entry in memory and writes it to disk. Returns the size
729 * of the data written to disk.
732 deflate_and_write_to_disk(const void *in_data
, size_t in_data_size
, int dest
,
733 const char *filename
)
735 unsigned char out
[BUFSIZE
];
737 /* allocate deflate state */
739 strm
.zalloc
= Z_NULL
;
741 strm
.opaque
= Z_NULL
;
742 strm
.next_in
= (uint8_t *) in_data
;
743 strm
.avail_in
= in_data_size
;
745 int ret
= deflateInit(&strm
, Z_BEST_COMPRESSION
);
749 /* compress until end of in_data */
750 size_t compressed_size
= 0;
753 int remaining
= in_data_size
- BUFSIZE
;
754 flush
= remaining
> 0 ? Z_NO_FLUSH
: Z_FINISH
;
755 in_data_size
-= BUFSIZE
;
757 /* Run deflate() on input until the output buffer is not full (which
758 * means there is no more data to deflate).
761 strm
.avail_out
= BUFSIZE
;
764 ret
= deflate(&strm
, flush
); /* no bad return value */
765 assert(ret
!= Z_STREAM_ERROR
); /* state not clobbered */
767 size_t have
= BUFSIZE
- strm
.avail_out
;
768 compressed_size
+= have
;
770 ssize_t written
= write_all(dest
, out
, have
);
772 (void)deflateEnd(&strm
);
775 } while (strm
.avail_out
== 0);
777 /* all input should be used */
778 assert(strm
.avail_in
== 0);
780 } while (flush
!= Z_FINISH
);
782 /* stream should be complete */
783 assert(ret
== Z_STREAM_END
);
785 /* clean up and return */
786 (void)deflateEnd(&strm
);
787 return compressed_size
;
790 static struct disk_cache_put_job
*
791 create_put_job(struct disk_cache
*cache
, const cache_key key
,
792 const void *data
, size_t size
,
793 struct cache_item_metadata
*cache_item_metadata
)
795 struct disk_cache_put_job
*dc_job
= (struct disk_cache_put_job
*)
796 malloc(sizeof(struct disk_cache_put_job
) + size
);
799 dc_job
->cache
= cache
;
800 memcpy(dc_job
->key
, key
, sizeof(cache_key
));
801 dc_job
->data
= dc_job
+ 1;
802 memcpy(dc_job
->data
, data
, size
);
805 /* Copy the cache item metadata */
806 if (cache_item_metadata
) {
807 dc_job
->cache_item_metadata
.type
= cache_item_metadata
->type
;
808 if (cache_item_metadata
->type
== CACHE_ITEM_TYPE_GLSL
) {
809 dc_job
->cache_item_metadata
.num_keys
=
810 cache_item_metadata
->num_keys
;
811 dc_job
->cache_item_metadata
.keys
= (cache_key
*)
812 malloc(cache_item_metadata
->num_keys
* sizeof(cache_key
));
814 if (!dc_job
->cache_item_metadata
.keys
)
817 memcpy(dc_job
->cache_item_metadata
.keys
,
818 cache_item_metadata
->keys
,
819 sizeof(cache_key
) * cache_item_metadata
->num_keys
);
822 dc_job
->cache_item_metadata
.type
= CACHE_ITEM_TYPE_UNKNOWN
;
823 dc_job
->cache_item_metadata
.keys
= NULL
;
836 destroy_put_job(void *job
, int thread_index
)
839 struct disk_cache_put_job
*dc_job
= (struct disk_cache_put_job
*) job
;
840 free(dc_job
->cache_item_metadata
.keys
);
846 struct cache_entry_file_data
{
848 uint32_t uncompressed_size
;
852 cache_put(void *job
, int thread_index
)
856 int fd
= -1, fd_final
= -1, err
, ret
;
858 char *filename
= NULL
, *filename_tmp
= NULL
;
859 struct disk_cache_put_job
*dc_job
= (struct disk_cache_put_job
*) job
;
861 filename
= get_cache_file(dc_job
->cache
, dc_job
->key
);
862 if (filename
== NULL
)
865 /* If the cache is too large, evict something else first. */
866 while (*dc_job
->cache
->size
+ dc_job
->size
> dc_job
->cache
->max_size
&&
868 evict_lru_item(dc_job
->cache
);
872 /* Write to a temporary file to allow for an atomic rename to the
873 * final destination filename, (to prevent any readers from seeing
874 * a partially written file).
876 if (asprintf(&filename_tmp
, "%s.tmp", filename
) == -1)
879 fd
= open(filename_tmp
, O_WRONLY
| O_CLOEXEC
| O_CREAT
, 0644);
881 /* Make the two-character subdirectory within the cache as needed. */
886 make_cache_file_directory(dc_job
->cache
, dc_job
->key
);
888 fd
= open(filename_tmp
, O_WRONLY
| O_CLOEXEC
| O_CREAT
, 0644);
893 /* With the temporary file open, we take an exclusive flock on
894 * it. If the flock fails, then another process still has the file
895 * open with the flock held. So just let that file be responsible
896 * for writing the file.
898 err
= flock(fd
, LOCK_EX
| LOCK_NB
);
902 /* Now that we have the lock on the open temporary file, we can
903 * check to see if the destination file already exists. If so,
904 * another process won the race between when we saw that the file
905 * didn't exist and now. In this case, we don't do anything more,
906 * (to ensure the size accounting of the cache doesn't get off).
908 fd_final
= open(filename
, O_RDONLY
| O_CLOEXEC
);
909 if (fd_final
!= -1) {
910 unlink(filename_tmp
);
914 /* OK, we're now on the hook to write out a file that we know is
915 * not in the cache, and is also not being written out to the cache
916 * by some other process.
919 /* Write the driver_keys_blob, this can be used find information about the
920 * mesa version that produced the entry or deal with hash collisions,
921 * should that ever become a real problem.
923 ret
= write_all(fd
, dc_job
->cache
->driver_keys_blob
,
924 dc_job
->cache
->driver_keys_blob_size
);
926 unlink(filename_tmp
);
930 /* Write the cache item metadata. This data can be used to deal with
931 * hash collisions, as well as providing useful information to 3rd party
932 * tools reading the cache files.
934 ret
= write_all(fd
, &dc_job
->cache_item_metadata
.type
,
937 unlink(filename_tmp
);
941 if (dc_job
->cache_item_metadata
.type
== CACHE_ITEM_TYPE_GLSL
) {
942 ret
= write_all(fd
, &dc_job
->cache_item_metadata
.num_keys
,
945 unlink(filename_tmp
);
949 ret
= write_all(fd
, dc_job
->cache_item_metadata
.keys
[0],
950 dc_job
->cache_item_metadata
.num_keys
*
953 unlink(filename_tmp
);
958 /* Create CRC of the data. We will read this when restoring the cache and
959 * use it to check for corruption.
961 struct cache_entry_file_data cf_data
;
962 cf_data
.crc32
= util_hash_crc32(dc_job
->data
, dc_job
->size
);
963 cf_data
.uncompressed_size
= dc_job
->size
;
965 size_t cf_data_size
= sizeof(cf_data
);
966 ret
= write_all(fd
, &cf_data
, cf_data_size
);
968 unlink(filename_tmp
);
972 /* Now, finally, write out the contents to the temporary file, then
973 * rename them atomically to the destination filename, and also
974 * perform an atomic increment of the total cache size.
976 size_t file_size
= deflate_and_write_to_disk(dc_job
->data
, dc_job
->size
,
978 if (file_size
== 0) {
979 unlink(filename_tmp
);
982 ret
= rename(filename_tmp
, filename
);
984 unlink(filename_tmp
);
989 if (stat(filename
, &sb
) == -1) {
990 /* Something went wrong remove the file */
995 p_atomic_add(dc_job
->cache
->size
, sb
.st_blocks
* 512);
1000 /* This close finally releases the flock, (now that the final file
1001 * has been renamed into place and the size has been added).
1010 disk_cache_put(struct disk_cache
*cache
, const cache_key key
,
1011 const void *data
, size_t size
,
1012 struct cache_item_metadata
*cache_item_metadata
)
1014 if (cache
->blob_put_cb
) {
1015 cache
->blob_put_cb(key
, CACHE_KEY_SIZE
, data
, size
);
1019 if (cache
->path_init_failed
)
1022 struct disk_cache_put_job
*dc_job
=
1023 create_put_job(cache
, key
, data
, size
, cache_item_metadata
);
1026 util_queue_fence_init(&dc_job
->fence
);
1027 util_queue_add_job(&cache
->cache_queue
, dc_job
, &dc_job
->fence
,
1028 cache_put
, destroy_put_job
);
1033 * Decompresses cache entry, returns true if successful.
1036 inflate_cache_data(uint8_t *in_data
, size_t in_data_size
,
1037 uint8_t *out_data
, size_t out_data_size
)
1041 /* allocate inflate state */
1042 strm
.zalloc
= Z_NULL
;
1043 strm
.zfree
= Z_NULL
;
1044 strm
.opaque
= Z_NULL
;
1045 strm
.next_in
= in_data
;
1046 strm
.avail_in
= in_data_size
;
1047 strm
.next_out
= out_data
;
1048 strm
.avail_out
= out_data_size
;
1050 int ret
= inflateInit(&strm
);
1054 ret
= inflate(&strm
, Z_NO_FLUSH
);
1055 assert(ret
!= Z_STREAM_ERROR
); /* state not clobbered */
1057 /* Unless there was an error we should have decompressed everything in one
1058 * go as we know the uncompressed file size.
1060 if (ret
!= Z_STREAM_END
) {
1061 (void)inflateEnd(&strm
);
1064 assert(strm
.avail_out
== 0);
1066 /* clean up and return */
1067 (void)inflateEnd(&strm
);
1072 disk_cache_get(struct disk_cache
*cache
, const cache_key key
, size_t *size
)
1076 char *filename
= NULL
;
1077 uint8_t *data
= NULL
;
1078 uint8_t *uncompressed_data
= NULL
;
1079 uint8_t *file_header
= NULL
;
1084 if (cache
->blob_get_cb
) {
1085 /* This is what Android EGL defines as the maxValueSize in egl_cache_t
1086 * class implementation.
1088 const signed long max_blob_size
= 64 * 1024;
1089 void *blob
= malloc(max_blob_size
);
1094 cache
->blob_get_cb(key
, CACHE_KEY_SIZE
, blob
, max_blob_size
);
1106 filename
= get_cache_file(cache
, key
);
1107 if (filename
== NULL
)
1110 fd
= open(filename
, O_RDONLY
| O_CLOEXEC
);
1114 if (fstat(fd
, &sb
) == -1)
1117 data
= malloc(sb
.st_size
);
1121 size_t ck_size
= cache
->driver_keys_blob_size
;
1122 file_header
= malloc(ck_size
);
1126 if (sb
.st_size
< ck_size
)
1129 ret
= read_all(fd
, file_header
, ck_size
);
1133 /* Check for extremely unlikely hash collisions */
1134 if (memcmp(cache
->driver_keys_blob
, file_header
, ck_size
) != 0) {
1135 assert(!"Mesa cache keys mismatch!");
1139 size_t cache_item_md_size
= sizeof(uint32_t);
1141 ret
= read_all(fd
, &md_type
, cache_item_md_size
);
1145 if (md_type
== CACHE_ITEM_TYPE_GLSL
) {
1147 cache_item_md_size
+= sizeof(uint32_t);
1148 ret
= read_all(fd
, &num_keys
, sizeof(uint32_t));
1152 /* The cache item metadata is currently just used for distributing
1153 * precompiled shaders, they are not used by Mesa so just skip them for
1155 * TODO: pass the metadata back to the caller and do some basic
1158 cache_item_md_size
+= num_keys
* sizeof(cache_key
);
1159 ret
= lseek(fd
, num_keys
* sizeof(cache_key
), SEEK_CUR
);
1164 /* Load the CRC that was created when the file was written. */
1165 struct cache_entry_file_data cf_data
;
1166 size_t cf_data_size
= sizeof(cf_data
);
1167 ret
= read_all(fd
, &cf_data
, cf_data_size
);
1171 /* Load the actual cache data. */
1172 size_t cache_data_size
=
1173 sb
.st_size
- cf_data_size
- ck_size
- cache_item_md_size
;
1174 ret
= read_all(fd
, data
, cache_data_size
);
1178 /* Uncompress the cache data */
1179 uncompressed_data
= malloc(cf_data
.uncompressed_size
);
1180 if (!inflate_cache_data(data
, cache_data_size
, uncompressed_data
,
1181 cf_data
.uncompressed_size
))
1184 /* Check the data for corruption */
1185 if (cf_data
.crc32
!= util_hash_crc32(uncompressed_data
,
1186 cf_data
.uncompressed_size
))
1195 *size
= cf_data
.uncompressed_size
;
1197 return uncompressed_data
;
1202 if (uncompressed_data
)
1203 free(uncompressed_data
);
1215 disk_cache_put_key(struct disk_cache
*cache
, const cache_key key
)
1217 const uint32_t *key_chunk
= (const uint32_t *) key
;
1218 int i
= CPU_TO_LE32(*key_chunk
) & CACHE_INDEX_KEY_MASK
;
1219 unsigned char *entry
;
1221 if (cache
->blob_put_cb
) {
1222 cache
->blob_put_cb(key
, CACHE_KEY_SIZE
, key_chunk
, sizeof(uint32_t));
1226 if (cache
->path_init_failed
)
1229 entry
= &cache
->stored_keys
[i
* CACHE_KEY_SIZE
];
1231 memcpy(entry
, key
, CACHE_KEY_SIZE
);
1234 /* This function lets us test whether a given key was previously
1235 * stored in the cache with disk_cache_put_key(). The implement is
1236 * efficient by not using syscalls or hitting the disk. It's not
1237 * race-free, but the races are benign. If we race with someone else
1238 * calling disk_cache_put_key, then that's just an extra cache miss and an
1242 disk_cache_has_key(struct disk_cache
*cache
, const cache_key key
)
1244 const uint32_t *key_chunk
= (const uint32_t *) key
;
1245 int i
= CPU_TO_LE32(*key_chunk
) & CACHE_INDEX_KEY_MASK
;
1246 unsigned char *entry
;
1248 if (cache
->blob_get_cb
) {
1250 return cache
->blob_get_cb(key
, CACHE_KEY_SIZE
, &blob
, sizeof(uint32_t));
1253 if (cache
->path_init_failed
)
1256 entry
= &cache
->stored_keys
[i
* CACHE_KEY_SIZE
];
1258 return memcmp(entry
, key
, CACHE_KEY_SIZE
) == 0;
1262 disk_cache_compute_key(struct disk_cache
*cache
, const void *data
, size_t size
,
1265 struct mesa_sha1 ctx
;
1267 _mesa_sha1_init(&ctx
);
1268 _mesa_sha1_update(&ctx
, cache
->driver_keys_blob
,
1269 cache
->driver_keys_blob_size
);
1270 _mesa_sha1_update(&ctx
, data
, size
);
1271 _mesa_sha1_final(&ctx
, key
);
1275 disk_cache_set_callbacks(struct disk_cache
*cache
, disk_cache_put_cb put
,
1276 disk_cache_get_cb get
)
1278 cache
->blob_put_cb
= put
;
1279 cache
->blob_get_cb
= get
;
1282 #endif /* ENABLE_SHADER_CACHE */