2016-09-27 23:55:02 +01:00
|
|
|
/*
|
|
|
|
* Copyright © 2014 Intel Corporation
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
|
|
* copy of this software and associated documentation files (the "Software"),
|
|
|
|
* to deal in the Software without restriction, including without limitation
|
|
|
|
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
|
|
* and/or sell copies of the Software, and to permit persons to whom the
|
|
|
|
* Software is furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice (including the next
|
|
|
|
* paragraph) shall be included in all copies or substantial portions of the
|
|
|
|
* Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
|
|
|
* IN THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
2017-01-18 19:40:31 +00:00
|
|
|
#ifdef ENABLE_SHADER_CACHE
|
|
|
|
|
2016-09-27 23:55:02 +01:00
|
|
|
#include <ctype.h>
|
2017-02-06 22:49:47 +00:00
|
|
|
#include <ftw.h>
|
2016-09-27 23:55:02 +01:00
|
|
|
#include <string.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <sys/file.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <sys/mman.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <pwd.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <dirent.h>
|
2017-03-01 05:04:23 +00:00
|
|
|
#include "zlib.h"
|
2016-09-27 23:55:02 +01:00
|
|
|
|
2017-02-24 04:14:56 +00:00
|
|
|
#include "util/crc32.h"
|
2016-09-27 23:55:02 +01:00
|
|
|
#include "util/u_atomic.h"
|
|
|
|
#include "util/mesa-sha1.h"
|
|
|
|
#include "util/ralloc.h"
|
|
|
|
#include "main/errors.h"
|
|
|
|
|
2016-11-13 15:38:01 +00:00
|
|
|
#include "disk_cache.h"
|
2016-09-27 23:55:02 +01:00
|
|
|
|
|
|
|
/* Number of bits to mask off from a cache key to get an index. */
|
|
|
|
#define CACHE_INDEX_KEY_BITS 16
|
|
|
|
|
|
|
|
/* Mask for computing an index from a key. */
|
|
|
|
#define CACHE_INDEX_KEY_MASK ((1 << CACHE_INDEX_KEY_BITS) - 1)
|
|
|
|
|
|
|
|
/* The number of keys that can be stored in the index. */
|
|
|
|
#define CACHE_INDEX_MAX_KEYS (1 << CACHE_INDEX_KEY_BITS)
|
|
|
|
|
2016-11-13 15:54:38 +00:00
|
|
|
struct disk_cache {
|
2016-09-27 23:55:02 +01:00
|
|
|
/* The path to the cache directory. */
|
|
|
|
char *path;
|
|
|
|
|
|
|
|
/* A pointer to the mmapped index file within the cache directory. */
|
|
|
|
uint8_t *index_mmap;
|
|
|
|
size_t index_mmap_size;
|
|
|
|
|
|
|
|
/* Pointer to total size of all objects in cache (within index_mmap) */
|
|
|
|
uint64_t *size;
|
|
|
|
|
|
|
|
/* Pointer to stored keys, (within index_mmap). */
|
|
|
|
uint8_t *stored_keys;
|
|
|
|
|
|
|
|
/* Maximum size of all cached objects (in bytes). */
|
|
|
|
uint64_t max_size;
|
|
|
|
};
|
|
|
|
|
|
|
|
/* Create a directory named 'path' if it does not already exist.
|
|
|
|
*
|
|
|
|
* Returns: 0 if path already exists as a directory or if created.
|
|
|
|
* -1 in all other cases.
|
|
|
|
*/
|
|
|
|
static int
|
2017-03-05 20:58:52 +00:00
|
|
|
mkdir_if_needed(const char *path)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
|
|
|
struct stat sb;
|
|
|
|
|
|
|
|
/* If the path exists already, then our work is done if it's a
|
|
|
|
* directory, but it's an error if it is not.
|
|
|
|
*/
|
|
|
|
if (stat(path, &sb) == 0) {
|
|
|
|
if (S_ISDIR(sb.st_mode)) {
|
|
|
|
return 0;
|
|
|
|
} else {
|
2016-11-13 15:38:01 +00:00
|
|
|
fprintf(stderr, "Cannot use %s for shader cache (not a directory)"
|
|
|
|
"---disabling.\n", path);
|
2016-09-27 23:55:02 +01:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int ret = mkdir(path, 0755);
|
|
|
|
if (ret == 0 || (ret == -1 && errno == EEXIST))
|
|
|
|
return 0;
|
|
|
|
|
2016-11-13 15:38:01 +00:00
|
|
|
fprintf(stderr, "Failed to create %s for shader cache (%s)---disabling.\n",
|
|
|
|
path, strerror(errno));
|
2016-09-27 23:55:02 +01:00
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Concatenate an existing path and a new name to form a new path. If the new
|
|
|
|
* path does not exist as a directory, create it then return the resulting
|
|
|
|
* name of the new path (ralloc'ed off of 'ctx').
|
|
|
|
*
|
|
|
|
* Returns NULL on any error, such as:
|
|
|
|
*
|
|
|
|
* <path> does not exist or is not a directory
|
|
|
|
* <path>/<name> exists but is not a directory
|
|
|
|
* <path>/<name> cannot be created as a directory
|
|
|
|
*/
|
|
|
|
static char *
|
2017-03-05 20:58:52 +00:00
|
|
|
concatenate_and_mkdir(void *ctx, const char *path, const char *name)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
|
|
|
char *new_path;
|
|
|
|
struct stat sb;
|
|
|
|
|
|
|
|
if (stat(path, &sb) != 0 || ! S_ISDIR(sb.st_mode))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
new_path = ralloc_asprintf(ctx, "%s/%s", path, name);
|
|
|
|
|
|
|
|
if (mkdir_if_needed(new_path) == 0)
|
|
|
|
return new_path;
|
|
|
|
else
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2017-02-06 22:49:47 +00:00
|
|
|
static int
|
|
|
|
remove_dir(const char *fpath, const struct stat *sb,
|
|
|
|
int typeflag, struct FTW *ftwbuf)
|
|
|
|
{
|
|
|
|
if (S_ISREG(sb->st_mode))
|
|
|
|
unlink(fpath);
|
|
|
|
else if (S_ISDIR(sb->st_mode))
|
|
|
|
rmdir(fpath);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2017-03-05 20:58:52 +00:00
|
|
|
remove_old_cache_directories(void *mem_ctx, const char *path,
|
|
|
|
const char *timestamp)
|
2017-02-06 22:49:47 +00:00
|
|
|
{
|
|
|
|
DIR *dir = opendir(path);
|
|
|
|
|
|
|
|
struct dirent* d_entry;
|
|
|
|
while((d_entry = readdir(dir)) != NULL)
|
|
|
|
{
|
2017-02-22 03:16:04 +00:00
|
|
|
char *full_path =
|
|
|
|
ralloc_asprintf(mem_ctx, "%s/%s", path, d_entry->d_name);
|
|
|
|
|
2017-02-06 22:49:47 +00:00
|
|
|
struct stat sb;
|
2017-02-22 03:16:04 +00:00
|
|
|
if (stat(full_path, &sb) == 0 && S_ISDIR(sb.st_mode) &&
|
2017-02-06 22:49:47 +00:00
|
|
|
strcmp(d_entry->d_name, timestamp) != 0 &&
|
|
|
|
strcmp(d_entry->d_name, "..") != 0 &&
|
|
|
|
strcmp(d_entry->d_name, ".") != 0) {
|
|
|
|
nftw(full_path, remove_dir, 20, FTW_DEPTH);
|
|
|
|
}
|
|
|
|
}
|
2017-02-22 03:16:04 +00:00
|
|
|
|
|
|
|
closedir(dir);
|
2017-02-06 22:49:47 +00:00
|
|
|
}
|
|
|
|
|
2017-02-06 01:56:08 +00:00
|
|
|
static char *
|
2017-03-05 20:58:52 +00:00
|
|
|
create_mesa_cache_dir(void *mem_ctx, const char *path, const char *timestamp,
|
2017-02-06 01:56:08 +00:00
|
|
|
const char *gpu_name)
|
|
|
|
{
|
|
|
|
char *new_path = concatenate_and_mkdir(mem_ctx, path, "mesa");
|
|
|
|
if (new_path == NULL)
|
|
|
|
return NULL;
|
2017-03-04 21:07:22 +00:00
|
|
|
|
|
|
|
/* Create a parent architecture directory so that we don't remove cache
|
|
|
|
* files for other architectures. In theory we could share the cache
|
|
|
|
* between architectures but we have no way of knowing if they were created
|
|
|
|
* by a compatible Mesa version.
|
|
|
|
*/
|
|
|
|
new_path = concatenate_and_mkdir(mem_ctx, new_path, get_arch_bitness_str());
|
|
|
|
if (new_path == NULL)
|
|
|
|
return NULL;
|
2017-02-06 01:56:08 +00:00
|
|
|
|
2017-02-06 22:49:47 +00:00
|
|
|
/* Remove cache directories for old Mesa versions */
|
|
|
|
remove_old_cache_directories(mem_ctx, new_path, timestamp);
|
|
|
|
|
2017-02-06 01:56:08 +00:00
|
|
|
new_path = concatenate_and_mkdir(mem_ctx, new_path, timestamp);
|
|
|
|
if (new_path == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
new_path = concatenate_and_mkdir(mem_ctx, new_path, gpu_name);
|
|
|
|
if (new_path == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
return new_path;
|
|
|
|
}
|
|
|
|
|
2016-11-13 15:54:38 +00:00
|
|
|
struct disk_cache *
|
2017-02-06 01:56:08 +00:00
|
|
|
disk_cache_create(const char *gpu_name, const char *timestamp)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
|
|
|
void *local;
|
2016-11-13 15:54:38 +00:00
|
|
|
struct disk_cache *cache = NULL;
|
2016-09-27 23:55:02 +01:00
|
|
|
char *path, *max_size_str;
|
|
|
|
uint64_t max_size;
|
|
|
|
int fd = -1;
|
|
|
|
struct stat sb;
|
|
|
|
size_t size;
|
|
|
|
|
2016-04-30 06:26:43 +01:00
|
|
|
/* If running as a users other than the real user disable cache */
|
|
|
|
if (geteuid() != getuid())
|
|
|
|
return NULL;
|
|
|
|
|
2016-09-27 23:55:02 +01:00
|
|
|
/* A ralloc context for transient data during this invocation. */
|
|
|
|
local = ralloc_context(NULL);
|
|
|
|
if (local == NULL)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
/* At user request, disable shader cache entirely. */
|
|
|
|
if (getenv("MESA_GLSL_CACHE_DISABLE"))
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
/* Determine path for cache based on the first defined name as follows:
|
|
|
|
*
|
|
|
|
* $MESA_GLSL_CACHE_DIR
|
|
|
|
* $XDG_CACHE_HOME/mesa
|
|
|
|
* <pwd.pw_dir>/.cache/mesa
|
|
|
|
*/
|
|
|
|
path = getenv("MESA_GLSL_CACHE_DIR");
|
2017-02-21 05:34:49 +00:00
|
|
|
if (path) {
|
|
|
|
if (mkdir_if_needed(path) == -1)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
path = create_mesa_cache_dir(local, path, timestamp,
|
|
|
|
gpu_name);
|
|
|
|
if (path == NULL)
|
|
|
|
goto fail;
|
2016-09-27 23:55:02 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
if (path == NULL) {
|
|
|
|
char *xdg_cache_home = getenv("XDG_CACHE_HOME");
|
|
|
|
|
|
|
|
if (xdg_cache_home) {
|
|
|
|
if (mkdir_if_needed(xdg_cache_home) == -1)
|
|
|
|
goto fail;
|
|
|
|
|
2017-02-06 01:56:08 +00:00
|
|
|
path = create_mesa_cache_dir(local, xdg_cache_home, timestamp,
|
|
|
|
gpu_name);
|
2016-09-27 23:55:02 +01:00
|
|
|
if (path == NULL)
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (path == NULL) {
|
|
|
|
char *buf;
|
|
|
|
size_t buf_size;
|
|
|
|
struct passwd pwd, *result;
|
|
|
|
|
|
|
|
buf_size = sysconf(_SC_GETPW_R_SIZE_MAX);
|
|
|
|
if (buf_size == -1)
|
|
|
|
buf_size = 512;
|
|
|
|
|
|
|
|
/* Loop until buf_size is large enough to query the directory */
|
|
|
|
while (1) {
|
|
|
|
buf = ralloc_size(local, buf_size);
|
|
|
|
|
|
|
|
getpwuid_r(getuid(), &pwd, buf, buf_size, &result);
|
|
|
|
if (result)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (errno == ERANGE) {
|
|
|
|
ralloc_free(buf);
|
|
|
|
buf = NULL;
|
|
|
|
buf_size *= 2;
|
|
|
|
} else {
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
path = concatenate_and_mkdir(local, pwd.pw_dir, ".cache");
|
|
|
|
if (path == NULL)
|
|
|
|
goto fail;
|
|
|
|
|
2017-02-06 01:56:08 +00:00
|
|
|
path = create_mesa_cache_dir(local, path, timestamp, gpu_name);
|
2016-09-27 23:55:02 +01:00
|
|
|
if (path == NULL)
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
|
2016-11-13 15:54:38 +00:00
|
|
|
cache = ralloc(NULL, struct disk_cache);
|
2016-09-27 23:55:02 +01:00
|
|
|
if (cache == NULL)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
cache->path = ralloc_strdup(cache, path);
|
|
|
|
if (cache->path == NULL)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
path = ralloc_asprintf(local, "%s/index", cache->path);
|
|
|
|
if (path == NULL)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
fd = open(path, O_RDWR | O_CREAT | O_CLOEXEC, 0644);
|
|
|
|
if (fd == -1)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
if (fstat(fd, &sb) == -1)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
/* Force the index file to be the expected size. */
|
|
|
|
size = sizeof(*cache->size) + CACHE_INDEX_MAX_KEYS * CACHE_KEY_SIZE;
|
|
|
|
if (sb.st_size != size) {
|
|
|
|
if (ftruncate(fd, size) == -1)
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* We map this shared so that other processes see updates that we
|
|
|
|
* make.
|
|
|
|
*
|
|
|
|
* Note: We do use atomic addition to ensure that multiple
|
|
|
|
* processes don't scramble the cache size recorded in the
|
|
|
|
* index. But we don't use any locking to prevent multiple
|
|
|
|
* processes from updating the same entry simultaneously. The idea
|
|
|
|
* is that if either result lands entirely in the index, then
|
|
|
|
* that's equivalent to a well-ordered write followed by an
|
|
|
|
* eviction and a write. On the other hand, if the simultaneous
|
|
|
|
* writes result in a corrupt entry, that's not really any
|
|
|
|
* different than both entries being evicted, (since within the
|
|
|
|
* guarantees of the cryptographic hash, a corrupt entry is
|
|
|
|
* unlikely to ever match a real cache key).
|
|
|
|
*/
|
|
|
|
cache->index_mmap = mmap(NULL, size, PROT_READ | PROT_WRITE,
|
|
|
|
MAP_SHARED, fd, 0);
|
|
|
|
if (cache->index_mmap == MAP_FAILED)
|
|
|
|
goto fail;
|
|
|
|
cache->index_mmap_size = size;
|
|
|
|
|
|
|
|
close(fd);
|
|
|
|
|
|
|
|
cache->size = (uint64_t *) cache->index_mmap;
|
|
|
|
cache->stored_keys = cache->index_mmap + sizeof(uint64_t);
|
|
|
|
|
|
|
|
max_size = 0;
|
|
|
|
|
|
|
|
max_size_str = getenv("MESA_GLSL_CACHE_MAX_SIZE");
|
|
|
|
if (max_size_str) {
|
|
|
|
char *end;
|
|
|
|
max_size = strtoul(max_size_str, &end, 10);
|
|
|
|
if (end == max_size_str) {
|
|
|
|
max_size = 0;
|
|
|
|
} else {
|
|
|
|
switch (*end) {
|
|
|
|
case 'K':
|
|
|
|
case 'k':
|
|
|
|
max_size *= 1024;
|
|
|
|
break;
|
|
|
|
case 'M':
|
|
|
|
case 'm':
|
|
|
|
max_size *= 1024*1024;
|
|
|
|
break;
|
|
|
|
case '\0':
|
|
|
|
case 'G':
|
|
|
|
case 'g':
|
|
|
|
default:
|
|
|
|
max_size *= 1024*1024*1024;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Default to 1GB for maximum cache size. */
|
|
|
|
if (max_size == 0)
|
|
|
|
max_size = 1024*1024*1024;
|
|
|
|
|
|
|
|
cache->max_size = max_size;
|
|
|
|
|
|
|
|
ralloc_free(local);
|
|
|
|
|
|
|
|
return cache;
|
|
|
|
|
|
|
|
fail:
|
|
|
|
if (fd != -1)
|
|
|
|
close(fd);
|
|
|
|
if (cache)
|
|
|
|
ralloc_free(cache);
|
|
|
|
ralloc_free(local);
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2016-11-13 15:54:38 +00:00
|
|
|
disk_cache_destroy(struct disk_cache *cache)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
2017-02-07 01:10:19 +00:00
|
|
|
if (cache)
|
|
|
|
munmap(cache->index_mmap, cache->index_mmap_size);
|
2016-09-27 23:55:02 +01:00
|
|
|
|
|
|
|
ralloc_free(cache);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Return a filename within the cache's directory corresponding to 'key'. The
|
|
|
|
* returned filename is ralloced with 'cache' as the parent context.
|
|
|
|
*
|
|
|
|
* Returns NULL if out of memory.
|
|
|
|
*/
|
|
|
|
static char *
|
2017-03-05 20:58:52 +00:00
|
|
|
get_cache_file(struct disk_cache *cache, const cache_key key)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
|
|
|
char buf[41];
|
2017-02-08 22:04:52 +00:00
|
|
|
char *filename;
|
2016-09-27 23:55:02 +01:00
|
|
|
|
|
|
|
_mesa_sha1_format(buf, key);
|
2017-02-09 11:41:15 +00:00
|
|
|
if (asprintf(&filename, "%s/%c%c/%s", cache->path, buf[0],
|
|
|
|
buf[1], buf + 2) == -1)
|
|
|
|
return NULL;
|
2016-09-27 23:55:02 +01:00
|
|
|
|
2017-02-08 22:04:52 +00:00
|
|
|
return filename;
|
2016-09-27 23:55:02 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Create the directory that will be needed for the cache file for \key.
|
|
|
|
*
|
|
|
|
* Obviously, the implementation here must closely match
|
|
|
|
* _get_cache_file above.
|
|
|
|
*/
|
|
|
|
static void
|
2017-03-05 20:58:52 +00:00
|
|
|
make_cache_file_directory(struct disk_cache *cache, const cache_key key)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
|
|
|
char *dir;
|
|
|
|
char buf[41];
|
|
|
|
|
|
|
|
_mesa_sha1_format(buf, key);
|
2017-02-09 11:41:15 +00:00
|
|
|
if (asprintf(&dir, "%s/%c%c", cache->path, buf[0], buf[1]) == -1)
|
|
|
|
return;
|
2016-09-27 23:55:02 +01:00
|
|
|
|
2017-02-09 11:41:15 +00:00
|
|
|
mkdir_if_needed(dir);
|
2017-02-08 22:04:52 +00:00
|
|
|
free(dir);
|
2016-09-27 23:55:02 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Given a directory path and predicate function, count all entries in
|
|
|
|
* that directory for which the predicate returns true. Then choose a
|
|
|
|
* random entry from among those counted.
|
|
|
|
*
|
|
|
|
* Returns: A malloc'ed string for the path to the chosen file, (or
|
|
|
|
* NULL on any error). The caller should free the string when
|
|
|
|
* finished.
|
|
|
|
*/
|
|
|
|
static char *
|
|
|
|
choose_random_file_matching(const char *dir_path,
|
2017-03-05 20:58:52 +00:00
|
|
|
bool (*predicate)(const struct dirent *,
|
2017-02-08 04:05:19 +00:00
|
|
|
const char *dir_path))
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
|
|
|
DIR *dir;
|
|
|
|
struct dirent *entry;
|
|
|
|
unsigned int count, victim;
|
|
|
|
char *filename;
|
|
|
|
|
|
|
|
dir = opendir(dir_path);
|
|
|
|
if (dir == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
count = 0;
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
entry = readdir(dir);
|
|
|
|
if (entry == NULL)
|
|
|
|
break;
|
2017-02-08 04:05:19 +00:00
|
|
|
if (!predicate(entry, dir_path))
|
2016-09-27 23:55:02 +01:00
|
|
|
continue;
|
|
|
|
|
|
|
|
count++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (count == 0) {
|
|
|
|
closedir(dir);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
victim = rand() % count;
|
|
|
|
|
|
|
|
rewinddir(dir);
|
|
|
|
count = 0;
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
entry = readdir(dir);
|
|
|
|
if (entry == NULL)
|
|
|
|
break;
|
2017-02-08 04:05:19 +00:00
|
|
|
if (!predicate(entry, dir_path))
|
2016-09-27 23:55:02 +01:00
|
|
|
continue;
|
|
|
|
if (count == victim)
|
|
|
|
break;
|
|
|
|
|
|
|
|
count++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (entry == NULL) {
|
|
|
|
closedir(dir);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2016-11-03 09:23:17 +00:00
|
|
|
if (asprintf(&filename, "%s/%s", dir_path, entry->d_name) < 0)
|
|
|
|
filename = NULL;
|
2016-09-27 23:55:02 +01:00
|
|
|
|
|
|
|
closedir(dir);
|
|
|
|
|
|
|
|
return filename;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Is entry a regular file, and not having a name with a trailing
|
|
|
|
* ".tmp"
|
|
|
|
*/
|
|
|
|
static bool
|
2017-03-05 20:58:52 +00:00
|
|
|
is_regular_non_tmp_file(const struct dirent *entry, const char *path)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
2017-02-08 04:05:19 +00:00
|
|
|
char *filename;
|
|
|
|
if (asprintf(&filename, "%s/%s", path, entry->d_name) == -1)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
struct stat sb;
|
2017-02-11 11:32:47 +00:00
|
|
|
int res = stat(filename, &sb);
|
2017-02-08 04:05:19 +00:00
|
|
|
free(filename);
|
2016-09-27 23:55:02 +01:00
|
|
|
|
2017-02-11 11:32:47 +00:00
|
|
|
if (res == -1 || !S_ISREG(sb.st_mode))
|
2016-09-27 23:55:02 +01:00
|
|
|
return false;
|
|
|
|
|
2017-02-08 04:05:19 +00:00
|
|
|
size_t len = strlen (entry->d_name);
|
2016-09-27 23:55:02 +01:00
|
|
|
if (len >= 4 && strcmp(&entry->d_name[len-4], ".tmp") == 0)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Returns the size of the deleted file, (or 0 on any error). */
|
|
|
|
static size_t
|
|
|
|
unlink_random_file_from_directory(const char *path)
|
|
|
|
{
|
|
|
|
struct stat sb;
|
|
|
|
char *filename;
|
|
|
|
|
|
|
|
filename = choose_random_file_matching(path, is_regular_non_tmp_file);
|
|
|
|
if (filename == NULL)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (stat(filename, &sb) == -1) {
|
|
|
|
free (filename);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
unlink(filename);
|
|
|
|
|
|
|
|
free (filename);
|
|
|
|
|
|
|
|
return sb.st_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Is entry a directory with a two-character name, (and not the
|
|
|
|
* special name of "..")
|
|
|
|
*/
|
|
|
|
static bool
|
2017-03-05 20:58:52 +00:00
|
|
|
is_two_character_sub_directory(const struct dirent *entry, const char *path)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
2017-02-08 04:05:19 +00:00
|
|
|
char *subdir;
|
|
|
|
if (asprintf(&subdir, "%s/%s", path, entry->d_name) == -1)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
struct stat sb;
|
2017-02-11 11:32:47 +00:00
|
|
|
int res = stat(subdir, &sb);
|
2017-02-08 04:05:19 +00:00
|
|
|
free(subdir);
|
|
|
|
|
2017-02-11 11:32:47 +00:00
|
|
|
if (res == -1 || !S_ISDIR(sb.st_mode))
|
2016-09-27 23:55:02 +01:00
|
|
|
return false;
|
|
|
|
|
|
|
|
if (strlen(entry->d_name) != 2)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (strcmp(entry->d_name, "..") == 0)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2016-11-13 15:54:38 +00:00
|
|
|
evict_random_item(struct disk_cache *cache)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
|
|
|
const char hex[] = "0123456789abcde";
|
|
|
|
char *dir_path;
|
|
|
|
int a, b;
|
|
|
|
size_t size;
|
|
|
|
|
|
|
|
/* With a reasonably-sized, full cache, (and with keys generated
|
|
|
|
* from a cryptographic hash), we can choose two random hex digits
|
|
|
|
* and reasonably expect the directory to exist with a file in it.
|
|
|
|
*/
|
|
|
|
a = rand() % 16;
|
|
|
|
b = rand() % 16;
|
|
|
|
|
2016-11-03 09:23:17 +00:00
|
|
|
if (asprintf(&dir_path, "%s/%c%c", cache->path, hex[a], hex[b]) < 0)
|
2016-09-27 23:55:02 +01:00
|
|
|
return;
|
|
|
|
|
|
|
|
size = unlink_random_file_from_directory(dir_path);
|
|
|
|
|
|
|
|
free(dir_path);
|
|
|
|
|
|
|
|
if (size) {
|
|
|
|
p_atomic_add(cache->size, - size);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* In the case where the random choice of directory didn't find
|
|
|
|
* something, we choose randomly from the existing directories.
|
|
|
|
*
|
|
|
|
* Really, the only reason this code exists is to allow the unit
|
|
|
|
* tests to work, (which use an artificially-small cache to be able
|
|
|
|
* to force a single cached item to be evicted).
|
|
|
|
*/
|
|
|
|
dir_path = choose_random_file_matching(cache->path,
|
|
|
|
is_two_character_sub_directory);
|
|
|
|
if (dir_path == NULL)
|
|
|
|
return;
|
|
|
|
|
|
|
|
size = unlink_random_file_from_directory(dir_path);
|
|
|
|
|
|
|
|
free(dir_path);
|
|
|
|
|
|
|
|
if (size)
|
|
|
|
p_atomic_add(cache->size, - size);
|
|
|
|
}
|
|
|
|
|
2016-04-26 05:56:22 +01:00
|
|
|
void
|
2017-03-05 20:58:52 +00:00
|
|
|
disk_cache_remove(struct disk_cache *cache, const cache_key key)
|
2016-04-26 05:56:22 +01:00
|
|
|
{
|
|
|
|
struct stat sb;
|
|
|
|
|
|
|
|
char *filename = get_cache_file(cache, key);
|
|
|
|
if (filename == NULL) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (stat(filename, &sb) == -1) {
|
2017-02-08 22:04:52 +00:00
|
|
|
free(filename);
|
2016-04-26 05:56:22 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
unlink(filename);
|
2017-02-08 22:04:52 +00:00
|
|
|
free(filename);
|
2016-04-26 05:56:22 +01:00
|
|
|
|
|
|
|
if (sb.st_size)
|
|
|
|
p_atomic_add(cache->size, - sb.st_size);
|
|
|
|
}
|
|
|
|
|
2017-03-01 05:04:23 +00:00
|
|
|
/* From the zlib docs:
|
|
|
|
* "If the memory is available, buffers sizes on the order of 128K or 256K
|
|
|
|
* bytes should be used."
|
|
|
|
*/
|
|
|
|
#define BUFSIZE 256 * 1024
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Compresses cache entry in memory and writes it to disk. Returns the size
|
|
|
|
* of the data written to disk.
|
|
|
|
*/
|
|
|
|
static size_t
|
|
|
|
deflate_and_write_to_disk(const void *in_data, size_t in_data_size, int dest,
|
2017-03-05 20:58:52 +00:00
|
|
|
const char *filename)
|
2017-03-01 05:04:23 +00:00
|
|
|
{
|
|
|
|
unsigned char out[BUFSIZE];
|
|
|
|
|
|
|
|
/* allocate deflate state */
|
|
|
|
z_stream strm;
|
|
|
|
strm.zalloc = Z_NULL;
|
|
|
|
strm.zfree = Z_NULL;
|
|
|
|
strm.opaque = Z_NULL;
|
|
|
|
strm.next_in = (uint8_t *) in_data;
|
|
|
|
strm.avail_in = in_data_size;
|
|
|
|
|
|
|
|
int ret = deflateInit(&strm, Z_BEST_COMPRESSION);
|
|
|
|
if (ret != Z_OK)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* compress until end of in_data */
|
|
|
|
size_t compressed_size = 0;
|
|
|
|
int flush;
|
|
|
|
do {
|
|
|
|
int remaining = in_data_size - BUFSIZE;
|
|
|
|
flush = remaining > 0 ? Z_NO_FLUSH : Z_FINISH;
|
|
|
|
in_data_size -= BUFSIZE;
|
|
|
|
|
|
|
|
/* Run deflate() on input until the output buffer is not full (which
|
|
|
|
* means there is no more data to deflate).
|
|
|
|
*/
|
|
|
|
do {
|
|
|
|
strm.avail_out = BUFSIZE;
|
|
|
|
strm.next_out = out;
|
|
|
|
|
|
|
|
ret = deflate(&strm, flush); /* no bad return value */
|
|
|
|
assert(ret != Z_STREAM_ERROR); /* state not clobbered */
|
|
|
|
|
|
|
|
size_t have = BUFSIZE - strm.avail_out;
|
|
|
|
compressed_size += compressed_size + have;
|
|
|
|
|
|
|
|
size_t written = 0;
|
|
|
|
for (size_t len = 0; len < have; len += written) {
|
|
|
|
written = write(dest, out + len, have - len);
|
|
|
|
if (written == -1) {
|
|
|
|
(void)deflateEnd(&strm);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} while (strm.avail_out == 0);
|
|
|
|
|
|
|
|
/* all input should be used */
|
|
|
|
assert(strm.avail_in == 0);
|
|
|
|
|
|
|
|
} while (flush != Z_FINISH);
|
|
|
|
|
|
|
|
/* stream should be complete */
|
|
|
|
assert(ret == Z_STREAM_END);
|
|
|
|
|
|
|
|
/* clean up and return */
|
|
|
|
(void)deflateEnd(&strm);
|
|
|
|
return compressed_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct cache_entry_file_data {
|
|
|
|
uint32_t crc32;
|
|
|
|
uint32_t uncompressed_size;
|
|
|
|
};
|
|
|
|
|
2016-09-27 23:55:02 +01:00
|
|
|
void
|
2016-11-13 15:54:38 +00:00
|
|
|
disk_cache_put(struct disk_cache *cache,
|
2017-03-05 20:58:52 +00:00
|
|
|
const cache_key key,
|
2016-09-27 23:55:02 +01:00
|
|
|
const void *data,
|
|
|
|
size_t size)
|
|
|
|
{
|
|
|
|
int fd = -1, fd_final = -1, err, ret;
|
|
|
|
size_t len;
|
|
|
|
char *filename = NULL, *filename_tmp = NULL;
|
|
|
|
|
|
|
|
filename = get_cache_file(cache, key);
|
|
|
|
if (filename == NULL)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
/* Write to a temporary file to allow for an atomic rename to the
|
|
|
|
* final destination filename, (to prevent any readers from seeing
|
|
|
|
* a partially written file).
|
|
|
|
*/
|
2017-02-09 11:41:15 +00:00
|
|
|
if (asprintf(&filename_tmp, "%s.tmp", filename) == -1)
|
2016-09-27 23:55:02 +01:00
|
|
|
goto done;
|
|
|
|
|
|
|
|
fd = open(filename_tmp, O_WRONLY | O_CLOEXEC | O_CREAT, 0644);
|
|
|
|
|
|
|
|
/* Make the two-character subdirectory within the cache as needed. */
|
|
|
|
if (fd == -1) {
|
|
|
|
if (errno != ENOENT)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
make_cache_file_directory(cache, key);
|
|
|
|
|
|
|
|
fd = open(filename_tmp, O_WRONLY | O_CLOEXEC | O_CREAT, 0644);
|
|
|
|
if (fd == -1)
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* With the temporary file open, we take an exclusive flock on
|
|
|
|
* it. If the flock fails, then another process still has the file
|
|
|
|
* open with the flock held. So just let that file be responsible
|
|
|
|
* for writing the file.
|
|
|
|
*/
|
|
|
|
err = flock(fd, LOCK_EX | LOCK_NB);
|
|
|
|
if (err == -1)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
/* Now that we have the lock on the open temporary file, we can
|
|
|
|
* check to see if the destination file already exists. If so,
|
|
|
|
* another process won the race between when we saw that the file
|
|
|
|
* didn't exist and now. In this case, we don't do anything more,
|
|
|
|
* (to ensure the size accounting of the cache doesn't get off).
|
|
|
|
*/
|
|
|
|
fd_final = open(filename, O_RDONLY | O_CLOEXEC);
|
|
|
|
if (fd_final != -1)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
/* OK, we're now on the hook to write out a file that we know is
|
|
|
|
* not in the cache, and is also not being written out to the cache
|
|
|
|
* by some other process.
|
|
|
|
*
|
|
|
|
* Before we do that, if the cache is too large, evict something
|
|
|
|
* else first.
|
|
|
|
*/
|
|
|
|
if (*cache->size + size > cache->max_size)
|
|
|
|
evict_random_item(cache);
|
|
|
|
|
2017-02-24 04:14:56 +00:00
|
|
|
/* Create CRC of the data and store at the start of the file. We will
|
|
|
|
* read this when restoring the cache and use it to check for corruption.
|
|
|
|
*/
|
2017-03-01 05:04:23 +00:00
|
|
|
struct cache_entry_file_data cf_data;
|
|
|
|
cf_data.crc32 = util_hash_crc32(data, size);
|
|
|
|
cf_data.uncompressed_size = size;
|
|
|
|
|
|
|
|
size_t cf_data_size = sizeof(cf_data);
|
|
|
|
for (len = 0; len < cf_data_size; len += ret) {
|
|
|
|
ret = write(fd, ((uint8_t *) &cf_data) + len, cf_data_size - len);
|
2017-02-24 04:14:56 +00:00
|
|
|
if (ret == -1) {
|
|
|
|
unlink(filename_tmp);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-09-27 23:55:02 +01:00
|
|
|
/* Now, finally, write out the contents to the temporary file, then
|
|
|
|
* rename them atomically to the destination filename, and also
|
|
|
|
* perform an atomic increment of the total cache size.
|
|
|
|
*/
|
2017-03-01 05:04:23 +00:00
|
|
|
size_t file_size = deflate_and_write_to_disk(data, size, fd, filename_tmp);
|
|
|
|
if (file_size == 0) {
|
|
|
|
unlink(filename_tmp);
|
|
|
|
goto done;
|
2016-09-27 23:55:02 +01:00
|
|
|
}
|
|
|
|
rename(filename_tmp, filename);
|
|
|
|
|
2017-03-01 05:04:23 +00:00
|
|
|
file_size += cf_data_size;
|
|
|
|
p_atomic_add(cache->size, file_size);
|
2016-09-27 23:55:02 +01:00
|
|
|
|
2016-11-21 15:21:23 +00:00
|
|
|
done:
|
|
|
|
if (fd_final != -1)
|
|
|
|
close(fd_final);
|
2016-09-27 23:55:02 +01:00
|
|
|
/* This close finally releases the flock, (now that the final dile
|
|
|
|
* has been renamed into place and the size has been added).
|
|
|
|
*/
|
2016-11-21 15:21:23 +00:00
|
|
|
if (fd != -1)
|
|
|
|
close(fd);
|
2016-09-27 23:55:02 +01:00
|
|
|
if (filename_tmp)
|
2017-02-08 22:04:52 +00:00
|
|
|
free(filename_tmp);
|
2016-09-27 23:55:02 +01:00
|
|
|
if (filename)
|
2017-02-08 22:04:52 +00:00
|
|
|
free(filename);
|
2016-09-27 23:55:02 +01:00
|
|
|
}
|
|
|
|
|
2017-03-01 05:04:23 +00:00
|
|
|
/**
|
|
|
|
* Decompresses cache entry, returns true if successful.
|
|
|
|
*/
|
|
|
|
static bool
|
|
|
|
inflate_cache_data(uint8_t *in_data, size_t in_data_size,
|
|
|
|
uint8_t *out_data, size_t out_data_size)
|
|
|
|
{
|
|
|
|
z_stream strm;
|
|
|
|
|
|
|
|
/* allocate inflate state */
|
|
|
|
strm.zalloc = Z_NULL;
|
|
|
|
strm.zfree = Z_NULL;
|
|
|
|
strm.opaque = Z_NULL;
|
|
|
|
strm.next_in = in_data;
|
|
|
|
strm.avail_in = in_data_size;
|
|
|
|
strm.next_out = out_data;
|
|
|
|
strm.avail_out = out_data_size;
|
|
|
|
|
|
|
|
int ret = inflateInit(&strm);
|
|
|
|
if (ret != Z_OK)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
ret = inflate(&strm, Z_NO_FLUSH);
|
|
|
|
assert(ret != Z_STREAM_ERROR); /* state not clobbered */
|
|
|
|
|
|
|
|
/* Unless there was an error we should have decompressed everything in one
|
|
|
|
* go as we know the uncompressed file size.
|
|
|
|
*/
|
|
|
|
if (ret != Z_STREAM_END) {
|
|
|
|
(void)inflateEnd(&strm);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
assert(strm.avail_out == 0);
|
|
|
|
|
|
|
|
/* clean up and return */
|
|
|
|
(void)inflateEnd(&strm);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2016-09-27 23:55:02 +01:00
|
|
|
void *
|
2017-03-05 20:58:52 +00:00
|
|
|
disk_cache_get(struct disk_cache *cache, const cache_key key, size_t *size)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
|
|
|
int fd = -1, ret, len;
|
|
|
|
struct stat sb;
|
|
|
|
char *filename = NULL;
|
|
|
|
uint8_t *data = NULL;
|
2017-03-01 05:04:23 +00:00
|
|
|
uint8_t *uncompressed_data = NULL;
|
2016-09-27 23:55:02 +01:00
|
|
|
|
|
|
|
if (size)
|
|
|
|
*size = 0;
|
|
|
|
|
|
|
|
filename = get_cache_file(cache, key);
|
|
|
|
if (filename == NULL)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
fd = open(filename, O_RDONLY | O_CLOEXEC);
|
|
|
|
if (fd == -1)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
if (fstat(fd, &sb) == -1)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
data = malloc(sb.st_size);
|
|
|
|
if (data == NULL)
|
|
|
|
goto fail;
|
|
|
|
|
2017-02-24 04:14:56 +00:00
|
|
|
/* Load the CRC that was created when the file was written. */
|
2017-03-01 05:04:23 +00:00
|
|
|
struct cache_entry_file_data cf_data;
|
|
|
|
size_t cf_data_size = sizeof(cf_data);
|
|
|
|
assert(sb.st_size > cf_data_size);
|
|
|
|
for (len = 0; len < cf_data_size; len += ret) {
|
|
|
|
ret = read(fd, ((uint8_t *) &cf_data) + len, cf_data_size - len);
|
2016-09-27 23:55:02 +01:00
|
|
|
if (ret == -1)
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
|
2017-02-24 04:14:56 +00:00
|
|
|
/* Load the actual cache data. */
|
2017-03-01 05:04:23 +00:00
|
|
|
size_t cache_data_size = sb.st_size - cf_data_size;
|
2017-02-24 04:14:56 +00:00
|
|
|
for (len = 0; len < cache_data_size; len += ret) {
|
|
|
|
ret = read(fd, data + len, cache_data_size - len);
|
|
|
|
if (ret == -1)
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
|
2017-03-01 05:04:23 +00:00
|
|
|
/* Uncompress the cache data */
|
|
|
|
uncompressed_data = malloc(cf_data.uncompressed_size);
|
|
|
|
if (!inflate_cache_data(data, cache_data_size, uncompressed_data,
|
|
|
|
cf_data.uncompressed_size))
|
|
|
|
goto fail;
|
|
|
|
|
2017-02-24 04:14:56 +00:00
|
|
|
/* Check the data for corruption */
|
2017-03-01 05:04:23 +00:00
|
|
|
if (cf_data.crc32 != util_hash_crc32(uncompressed_data,
|
|
|
|
cf_data.uncompressed_size))
|
2017-02-24 04:14:56 +00:00
|
|
|
goto fail;
|
|
|
|
|
2017-03-01 05:04:23 +00:00
|
|
|
free(data);
|
2017-02-08 22:04:52 +00:00
|
|
|
free(filename);
|
2016-09-27 23:55:02 +01:00
|
|
|
close(fd);
|
|
|
|
|
|
|
|
if (size)
|
2017-03-01 05:04:23 +00:00
|
|
|
*size = cf_data.uncompressed_size;
|
2016-09-27 23:55:02 +01:00
|
|
|
|
2017-03-01 05:04:23 +00:00
|
|
|
return uncompressed_data;
|
2016-09-27 23:55:02 +01:00
|
|
|
|
|
|
|
fail:
|
|
|
|
if (data)
|
|
|
|
free(data);
|
2017-03-01 05:04:23 +00:00
|
|
|
if (uncompressed_data)
|
|
|
|
free(uncompressed_data);
|
2016-09-27 23:55:02 +01:00
|
|
|
if (filename)
|
2017-02-08 22:04:52 +00:00
|
|
|
free(filename);
|
2016-09-27 23:55:02 +01:00
|
|
|
if (fd != -1)
|
|
|
|
close(fd);
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2017-03-05 20:58:52 +00:00
|
|
|
disk_cache_put_key(struct disk_cache *cache, const cache_key key)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
2017-03-05 20:58:52 +00:00
|
|
|
const uint32_t *key_chunk = (const uint32_t *) key;
|
2016-09-27 23:55:02 +01:00
|
|
|
int i = *key_chunk & CACHE_INDEX_KEY_MASK;
|
|
|
|
unsigned char *entry;
|
|
|
|
|
|
|
|
entry = &cache->stored_keys[i + CACHE_KEY_SIZE];
|
|
|
|
|
|
|
|
memcpy(entry, key, CACHE_KEY_SIZE);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* This function lets us test whether a given key was previously
|
2016-11-13 15:54:38 +00:00
|
|
|
* stored in the cache with disk_cache_put_key(). The implement is
|
2016-09-27 23:55:02 +01:00
|
|
|
* efficient by not using syscalls or hitting the disk. It's not
|
|
|
|
* race-free, but the races are benign. If we race with someone else
|
2016-11-13 15:54:38 +00:00
|
|
|
* calling disk_cache_put_key, then that's just an extra cache miss and an
|
2016-09-27 23:55:02 +01:00
|
|
|
* extra recompile.
|
|
|
|
*/
|
|
|
|
bool
|
2017-03-05 20:58:52 +00:00
|
|
|
disk_cache_has_key(struct disk_cache *cache, const cache_key key)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
2017-03-05 20:58:52 +00:00
|
|
|
const uint32_t *key_chunk = (const uint32_t *) key;
|
2016-09-27 23:55:02 +01:00
|
|
|
int i = *key_chunk & CACHE_INDEX_KEY_MASK;
|
|
|
|
unsigned char *entry;
|
|
|
|
|
|
|
|
entry = &cache->stored_keys[i + CACHE_KEY_SIZE];
|
|
|
|
|
|
|
|
return memcmp(entry, key, CACHE_KEY_SIZE) == 0;
|
|
|
|
}
|
2017-01-18 19:40:31 +00:00
|
|
|
|
|
|
|
#endif /* ENABLE_SHADER_CACHE */
|