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 <fcntl.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <dirent.h>
|
2019-06-11 23:27:04 +01:00
|
|
|
#include <inttypes.h>
|
2019-10-31 20:26:00 +00:00
|
|
|
|
2017-02-24 04:14:56 +00:00
|
|
|
#include "util/crc32.h"
|
2017-09-08 10:49:45 +01:00
|
|
|
#include "util/debug.h"
|
2017-03-21 08:35:22 +00:00
|
|
|
#include "util/rand_xor.h"
|
2016-09-27 23:55:02 +01:00
|
|
|
#include "util/u_atomic.h"
|
|
|
|
#include "util/mesa-sha1.h"
|
|
|
|
#include "util/ralloc.h"
|
2020-03-26 01:11:44 +00:00
|
|
|
#include "util/compiler.h"
|
2016-09-27 23:55:02 +01:00
|
|
|
|
2016-11-13 15:38:01 +00:00
|
|
|
#include "disk_cache.h"
|
2020-07-30 05:50:02 +01:00
|
|
|
#include "disk_cache_os.h"
|
2016-09-27 23:55:02 +01:00
|
|
|
|
2017-08-24 02:11:40 +01:00
|
|
|
/* The cache version should be bumped whenever a change is made to the
|
|
|
|
* structure of cache entries or the index. This will give any 3rd party
|
|
|
|
* applications reading the cache entries a chance to adjust to the changes.
|
|
|
|
*
|
|
|
|
* - The cache version is checked internally when reading a cache entry. If we
|
|
|
|
* ever have a mismatch we are in big trouble as this means we had a cache
|
|
|
|
* collision. In case of such an event please check the skys for giant
|
|
|
|
* asteroids and that the entire Mesa team hasn't been eaten by wolves.
|
|
|
|
*
|
|
|
|
* - There is no strict requirement that cache versions be backwards
|
|
|
|
* compatible but effort should be taken to limit disruption where possible.
|
|
|
|
*/
|
|
|
|
#define CACHE_VERSION 1
|
|
|
|
|
2018-02-09 05:37:49 +00:00
|
|
|
#define DRV_KEY_CPY(_dst, _src, _src_size) \
|
|
|
|
do { \
|
|
|
|
memcpy(_dst, _src, _src_size); \
|
|
|
|
_dst += _src_size; \
|
|
|
|
} while (0);
|
|
|
|
|
|
|
|
struct disk_cache *
|
2018-09-19 01:21:05 +01:00
|
|
|
disk_cache_create(const char *gpu_name, const char *driver_id,
|
2018-02-09 05:37:49 +00:00
|
|
|
uint64_t driver_flags)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
2018-02-09 05:37:49 +00:00
|
|
|
void *local;
|
|
|
|
struct disk_cache *cache = NULL;
|
2020-07-30 05:50:02 +01:00
|
|
|
char *max_size_str;
|
2018-02-09 05:37:49 +00:00
|
|
|
uint64_t max_size;
|
2016-09-27 23:55:02 +01:00
|
|
|
|
2018-02-09 05:37:49 +00:00
|
|
|
uint8_t cache_version = CACHE_VERSION;
|
|
|
|
size_t cv_size = sizeof(cache_version);
|
|
|
|
|
2020-07-31 02:16:43 +01:00
|
|
|
if (!disk_cache_enabled())
|
2018-02-09 05:37:49 +00:00
|
|
|
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;
|
|
|
|
|
2018-02-09 05:37:49 +00:00
|
|
|
cache = rzalloc(NULL, struct disk_cache);
|
|
|
|
if (cache == NULL)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
/* Assume failure. */
|
|
|
|
cache->path_init_failed = true;
|
|
|
|
|
2020-09-18 18:42:52 +01:00
|
|
|
#ifdef ANDROID
|
|
|
|
/* Android needs the "disk cache" to be enabled for
|
|
|
|
* EGL_ANDROID_blob_cache's callbacks to be called, but it doesn't actually
|
|
|
|
* want any storing to disk to happen inside of the driver.
|
|
|
|
*/
|
|
|
|
goto path_fail;
|
|
|
|
#endif
|
|
|
|
|
2020-10-01 11:02:59 +01:00
|
|
|
char *path = disk_cache_generate_cache_dir(local, gpu_name, driver_id);
|
2020-07-30 05:50:02 +01:00
|
|
|
if (!path)
|
|
|
|
goto path_fail;
|
2016-09-27 23:55:02 +01:00
|
|
|
|
2020-11-02 02:31:32 +00:00
|
|
|
cache->path = ralloc_strdup(cache, path);
|
|
|
|
if (cache->path == NULL)
|
|
|
|
goto path_fail;
|
|
|
|
|
2020-10-01 11:02:59 +01:00
|
|
|
if (env_var_as_boolean("MESA_DISK_CACHE_SINGLE_FILE", false)) {
|
2021-02-25 10:15:22 +00:00
|
|
|
if (!disk_cache_load_cache_index(local, cache))
|
2020-10-01 11:02:59 +01:00
|
|
|
goto path_fail;
|
|
|
|
}
|
|
|
|
|
2020-07-31 05:23:56 +01:00
|
|
|
if (!disk_cache_mmap_cache_index(local, cache, path))
|
2018-02-09 05:37:49 +00:00
|
|
|
goto path_fail;
|
2016-09-27 23:55:02 +01:00
|
|
|
|
|
|
|
max_size = 0;
|
|
|
|
|
2022-03-14 17:47:37 +00:00
|
|
|
max_size_str = getenv("MESA_SHADER_CACHE_MAX_SIZE");
|
|
|
|
|
|
|
|
if (!max_size_str) {
|
|
|
|
max_size_str = getenv("MESA_GLSL_CACHE_MAX_SIZE");
|
|
|
|
if (max_size_str)
|
|
|
|
fprintf(stderr,
|
|
|
|
"*** MESA_GLSL_CACHE_MAX_SIZE is deprecated; "
|
|
|
|
"use MESA_SHADER_CACHE_MAX_SIZE instead ***\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef MESA_SHADER_CACHE_MAX_SIZE
|
2020-10-17 21:43:59 +01:00
|
|
|
if( !max_size_str ) {
|
2022-03-14 17:47:37 +00:00
|
|
|
max_size_str = MESA_SHADER_CACHE_MAX_SIZE;
|
2020-10-17 21:43:59 +01:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2016-09-27 23:55:02 +01:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-04-28 04:05:52 +01:00
|
|
|
/* Default to 1GB for maximum cache size. */
|
2017-03-06 16:17:32 +00:00
|
|
|
if (max_size == 0) {
|
2017-04-28 04:05:52 +01:00
|
|
|
max_size = 1024*1024*1024;
|
2017-03-06 16:17:32 +00:00
|
|
|
}
|
2016-09-27 23:55:02 +01:00
|
|
|
|
|
|
|
cache->max_size = max_size;
|
|
|
|
|
2019-09-03 05:13:05 +01:00
|
|
|
/* 4 threads were chosen below because just about all modern CPUs currently
|
|
|
|
* available that run Mesa have *at least* 4 cores. For these CPUs allowing
|
|
|
|
* more threads can result in the queue being processed faster, thus
|
|
|
|
* avoiding excessive memory use due to a backlog of cache entrys building
|
|
|
|
* up in the queue. Since we set the UTIL_QUEUE_INIT_USE_MINIMUM_PRIORITY
|
|
|
|
* flag this should have little negative impact on low core systems.
|
2018-02-09 05:37:49 +00:00
|
|
|
*
|
|
|
|
* The queue will resize automatically when it's full, so adding new jobs
|
|
|
|
* doesn't stall.
|
|
|
|
*/
|
2021-02-11 13:27:39 +00:00
|
|
|
if (!util_queue_init(&cache->cache_queue, "disk$", 32, 4,
|
2021-06-09 12:52:36 +01:00
|
|
|
UTIL_QUEUE_INIT_SCALE_THREADS |
|
2021-02-11 13:27:39 +00:00
|
|
|
UTIL_QUEUE_INIT_RESIZE_IF_FULL |
|
|
|
|
UTIL_QUEUE_INIT_USE_MINIMUM_PRIORITY |
|
2021-06-09 23:14:29 +01:00
|
|
|
UTIL_QUEUE_INIT_SET_FULL_THREAD_AFFINITY, NULL))
|
2021-02-11 13:27:39 +00:00
|
|
|
goto fail;
|
2018-02-09 05:37:49 +00:00
|
|
|
|
|
|
|
cache->path_init_failed = false;
|
|
|
|
|
|
|
|
path_fail:
|
|
|
|
|
2017-08-24 02:11:40 +01:00
|
|
|
cache->driver_keys_blob_size = cv_size;
|
|
|
|
|
2017-03-15 23:09:29 +00:00
|
|
|
/* Create driver id keys */
|
2018-09-19 01:21:05 +01:00
|
|
|
size_t id_size = strlen(driver_id) + 1;
|
2017-03-15 23:09:31 +00:00
|
|
|
size_t gpu_name_size = strlen(gpu_name) + 1;
|
2018-09-19 01:21:05 +01:00
|
|
|
cache->driver_keys_blob_size += id_size;
|
2017-03-15 23:09:31 +00:00
|
|
|
cache->driver_keys_blob_size += gpu_name_size;
|
|
|
|
|
|
|
|
/* We sometimes store entire structs that contains a pointers in the cache,
|
|
|
|
* use pointer size as a key to avoid hard to debug issues.
|
|
|
|
*/
|
|
|
|
uint8_t ptr_size = sizeof(void *);
|
|
|
|
size_t ptr_size_size = sizeof(ptr_size);
|
|
|
|
cache->driver_keys_blob_size += ptr_size_size;
|
2017-03-15 23:09:29 +00:00
|
|
|
|
2017-05-20 02:06:25 +01:00
|
|
|
size_t driver_flags_size = sizeof(driver_flags);
|
|
|
|
cache->driver_keys_blob_size += driver_flags_size;
|
|
|
|
|
2017-03-15 23:09:29 +00:00
|
|
|
cache->driver_keys_blob =
|
|
|
|
ralloc_size(cache, cache->driver_keys_blob_size);
|
2018-02-09 05:37:49 +00:00
|
|
|
if (!cache->driver_keys_blob)
|
|
|
|
goto fail;
|
2017-03-15 23:09:29 +00:00
|
|
|
|
2017-08-24 02:11:40 +01:00
|
|
|
uint8_t *drv_key_blob = cache->driver_keys_blob;
|
|
|
|
DRV_KEY_CPY(drv_key_blob, &cache_version, cv_size)
|
2018-09-19 01:21:05 +01:00
|
|
|
DRV_KEY_CPY(drv_key_blob, driver_id, id_size)
|
2017-08-24 02:11:40 +01:00
|
|
|
DRV_KEY_CPY(drv_key_blob, gpu_name, gpu_name_size)
|
|
|
|
DRV_KEY_CPY(drv_key_blob, &ptr_size, ptr_size_size)
|
|
|
|
DRV_KEY_CPY(drv_key_blob, &driver_flags, driver_flags_size)
|
2017-03-15 23:09:29 +00:00
|
|
|
|
2017-03-21 08:35:22 +00:00
|
|
|
/* Seed our rand function */
|
|
|
|
s_rand_xorshift128plus(cache->seed_xorshift128plus, true);
|
|
|
|
|
2018-02-09 05:37:49 +00:00
|
|
|
ralloc_free(local);
|
|
|
|
|
2016-09-27 23:55:02 +01:00
|
|
|
return cache;
|
2018-02-09 05:37:49 +00:00
|
|
|
|
|
|
|
fail:
|
|
|
|
if (cache)
|
|
|
|
ralloc_free(cache);
|
|
|
|
ralloc_free(local);
|
|
|
|
|
|
|
|
return NULL;
|
2016-09-27 23:55:02 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2016-11-13 15:54:38 +00:00
|
|
|
disk_cache_destroy(struct disk_cache *cache)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
2018-02-09 05:37:49 +00:00
|
|
|
if (cache && !cache->path_init_failed) {
|
2019-10-23 21:15:37 +01:00
|
|
|
util_queue_finish(&cache->cache_queue);
|
2017-03-08 23:51:01 +00:00
|
|
|
util_queue_destroy(&cache->cache_queue);
|
2020-10-01 11:02:59 +01:00
|
|
|
|
|
|
|
if (env_var_as_boolean("MESA_DISK_CACHE_SINGLE_FILE", false))
|
|
|
|
foz_destroy(&cache->foz_db);
|
|
|
|
|
2020-07-31 05:29:12 +01:00
|
|
|
disk_cache_destroy_mmap(cache);
|
2017-03-08 23:51:01 +00:00
|
|
|
}
|
2016-09-27 23:55:02 +01:00
|
|
|
|
|
|
|
ralloc_free(cache);
|
|
|
|
}
|
|
|
|
|
2020-03-10 21:52:42 +00:00
|
|
|
void
|
|
|
|
disk_cache_wait_for_idle(struct disk_cache *cache)
|
|
|
|
{
|
|
|
|
util_queue_finish(&cache->cache_queue);
|
|
|
|
}
|
|
|
|
|
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
|
|
|
{
|
2020-08-05 05:35:12 +01:00
|
|
|
char *filename = disk_cache_get_cache_filename(cache, key);
|
2016-04-26 05:56:22 +01:00
|
|
|
if (filename == NULL) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2020-08-05 05:46:42 +01:00
|
|
|
disk_cache_evict_item(cache, filename);
|
2016-04-26 05:56:22 +01:00
|
|
|
}
|
|
|
|
|
2017-03-12 23:14:35 +00:00
|
|
|
static struct disk_cache_put_job *
|
|
|
|
create_put_job(struct disk_cache *cache, const cache_key key,
|
2021-05-10 12:37:09 +01:00
|
|
|
void *data, size_t size,
|
|
|
|
struct cache_item_metadata *cache_item_metadata,
|
|
|
|
bool take_ownership)
|
2017-03-12 23:14:35 +00:00
|
|
|
{
|
|
|
|
struct disk_cache_put_job *dc_job = (struct disk_cache_put_job *)
|
2021-05-10 12:37:09 +01:00
|
|
|
malloc(sizeof(struct disk_cache_put_job) + (take_ownership ? 0 : size));
|
2017-03-12 23:14:35 +00:00
|
|
|
|
|
|
|
if (dc_job) {
|
|
|
|
dc_job->cache = cache;
|
|
|
|
memcpy(dc_job->key, key, sizeof(cache_key));
|
2021-05-10 12:37:09 +01:00
|
|
|
if (take_ownership) {
|
|
|
|
dc_job->data = data;
|
|
|
|
} else {
|
|
|
|
dc_job->data = dc_job + 1;
|
|
|
|
memcpy(dc_job->data, data, size);
|
|
|
|
}
|
2017-03-12 23:14:35 +00:00
|
|
|
dc_job->size = size;
|
2017-07-31 04:00:35 +01:00
|
|
|
|
|
|
|
/* Copy the cache item metadata */
|
|
|
|
if (cache_item_metadata) {
|
|
|
|
dc_job->cache_item_metadata.type = cache_item_metadata->type;
|
|
|
|
if (cache_item_metadata->type == CACHE_ITEM_TYPE_GLSL) {
|
|
|
|
dc_job->cache_item_metadata.num_keys =
|
|
|
|
cache_item_metadata->num_keys;
|
|
|
|
dc_job->cache_item_metadata.keys = (cache_key *)
|
|
|
|
malloc(cache_item_metadata->num_keys * sizeof(cache_key));
|
|
|
|
|
|
|
|
if (!dc_job->cache_item_metadata.keys)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
memcpy(dc_job->cache_item_metadata.keys,
|
|
|
|
cache_item_metadata->keys,
|
|
|
|
sizeof(cache_key) * cache_item_metadata->num_keys);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
dc_job->cache_item_metadata.type = CACHE_ITEM_TYPE_UNKNOWN;
|
|
|
|
dc_job->cache_item_metadata.keys = NULL;
|
|
|
|
}
|
2017-03-12 23:14:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return dc_job;
|
2017-07-31 04:00:35 +01:00
|
|
|
|
|
|
|
fail:
|
|
|
|
free(dc_job);
|
|
|
|
|
|
|
|
return NULL;
|
2017-03-12 23:14:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2021-06-09 23:14:29 +01:00
|
|
|
destroy_put_job(void *job, void *gdata, int thread_index)
|
2017-03-12 23:14:35 +00:00
|
|
|
{
|
|
|
|
if (job) {
|
2017-07-31 04:00:35 +01:00
|
|
|
struct disk_cache_put_job *dc_job = (struct disk_cache_put_job *) job;
|
|
|
|
free(dc_job->cache_item_metadata.keys);
|
2017-03-12 23:14:35 +00:00
|
|
|
free(job);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-05-10 12:37:09 +01:00
|
|
|
static void
|
2021-06-09 23:14:29 +01:00
|
|
|
destroy_put_job_nocopy(void *job, void *gdata, int thread_index)
|
2021-05-10 12:37:09 +01:00
|
|
|
{
|
|
|
|
struct disk_cache_put_job *dc_job = (struct disk_cache_put_job *) job;
|
|
|
|
free(dc_job->data);
|
2021-06-09 23:14:29 +01:00
|
|
|
destroy_put_job(job, gdata, thread_index);
|
2021-05-10 12:37:09 +01:00
|
|
|
}
|
|
|
|
|
2017-03-13 00:07:30 +00:00
|
|
|
static void
|
2021-06-09 23:14:29 +01:00
|
|
|
cache_put(void *job, void *gdata, int thread_index)
|
2016-09-27 23:55:02 +01:00
|
|
|
{
|
2017-03-13 00:07:30 +00:00
|
|
|
assert(job);
|
|
|
|
|
2017-03-06 16:17:31 +00:00
|
|
|
unsigned i = 0;
|
2020-08-05 05:21:24 +01:00
|
|
|
char *filename = NULL;
|
2017-03-13 00:07:30 +00:00
|
|
|
struct disk_cache_put_job *dc_job = (struct disk_cache_put_job *) job;
|
2016-09-27 23:55:02 +01:00
|
|
|
|
2020-10-01 11:02:59 +01:00
|
|
|
if (env_var_as_boolean("MESA_DISK_CACHE_SINGLE_FILE", false)) {
|
|
|
|
disk_cache_write_item_to_disk_foz(dc_job);
|
|
|
|
} else {
|
|
|
|
filename = disk_cache_get_cache_filename(dc_job->cache, dc_job->key);
|
|
|
|
if (filename == NULL)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
/* If the cache is too large, evict something else first. */
|
|
|
|
while (*dc_job->cache->size + dc_job->size > dc_job->cache->max_size &&
|
|
|
|
i < 8) {
|
|
|
|
disk_cache_evict_lru_item(dc_job->cache);
|
|
|
|
i++;
|
|
|
|
}
|
2017-03-15 18:53:56 +00:00
|
|
|
|
2020-10-01 11:02:59 +01:00
|
|
|
disk_cache_write_item_to_disk(dc_job, filename);
|
2017-02-24 04:14:56 +00:00
|
|
|
|
2020-08-05 05:21:24 +01:00
|
|
|
done:
|
2020-10-01 11:02:59 +01:00
|
|
|
free(filename);
|
|
|
|
}
|
2016-09-27 23:55:02 +01:00
|
|
|
}
|
|
|
|
|
2017-03-13 00:07:30 +00:00
|
|
|
void
|
|
|
|
disk_cache_put(struct disk_cache *cache, const cache_key key,
|
2017-08-23 07:33:00 +01:00
|
|
|
const void *data, size_t size,
|
|
|
|
struct cache_item_metadata *cache_item_metadata)
|
2017-03-13 00:07:30 +00:00
|
|
|
{
|
2018-02-07 06:13:00 +00:00
|
|
|
if (cache->blob_put_cb) {
|
|
|
|
cache->blob_put_cb(key, CACHE_KEY_SIZE, data, size);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2018-02-09 05:37:49 +00:00
|
|
|
if (cache->path_init_failed)
|
2018-01-22 09:55:06 +00:00
|
|
|
return;
|
|
|
|
|
2017-03-13 00:07:30 +00:00
|
|
|
struct disk_cache_put_job *dc_job =
|
2021-05-10 12:37:09 +01:00
|
|
|
create_put_job(cache, key, (void*)data, size, cache_item_metadata, false);
|
2017-03-13 00:07:30 +00:00
|
|
|
|
|
|
|
if (dc_job) {
|
|
|
|
util_queue_fence_init(&dc_job->fence);
|
|
|
|
util_queue_add_job(&cache->cache_queue, dc_job, &dc_job->fence,
|
2019-09-03 05:22:50 +01:00
|
|
|
cache_put, destroy_put_job, dc_job->size);
|
2017-03-13 00:07:30 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-05-10 12:37:09 +01:00
|
|
|
void
|
|
|
|
disk_cache_put_nocopy(struct disk_cache *cache, const cache_key key,
|
|
|
|
void *data, size_t size,
|
|
|
|
struct cache_item_metadata *cache_item_metadata)
|
|
|
|
{
|
|
|
|
if (cache->blob_put_cb) {
|
|
|
|
cache->blob_put_cb(key, CACHE_KEY_SIZE, data, size);
|
|
|
|
free(data);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cache->path_init_failed) {
|
|
|
|
free(data);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct disk_cache_put_job *dc_job =
|
|
|
|
create_put_job(cache, key, data, size, cache_item_metadata, true);
|
|
|
|
|
|
|
|
if (dc_job) {
|
|
|
|
util_queue_fence_init(&dc_job->fence);
|
|
|
|
util_queue_add_job(&cache->cache_queue, dc_job, &dc_job->fence,
|
|
|
|
cache_put, destroy_put_job_nocopy, dc_job->size);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
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
|
|
|
{
|
|
|
|
if (size)
|
|
|
|
*size = 0;
|
|
|
|
|
2018-02-07 06:13:00 +00:00
|
|
|
if (cache->blob_get_cb) {
|
|
|
|
/* This is what Android EGL defines as the maxValueSize in egl_cache_t
|
|
|
|
* class implementation.
|
|
|
|
*/
|
|
|
|
const signed long max_blob_size = 64 * 1024;
|
|
|
|
void *blob = malloc(max_blob_size);
|
|
|
|
if (!blob)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
signed long bytes =
|
|
|
|
cache->blob_get_cb(key, CACHE_KEY_SIZE, blob, max_blob_size);
|
|
|
|
|
|
|
|
if (!bytes) {
|
|
|
|
free(blob);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (size)
|
|
|
|
*size = bytes;
|
|
|
|
return blob;
|
|
|
|
}
|
|
|
|
|
2020-10-01 11:02:59 +01:00
|
|
|
if (env_var_as_boolean("MESA_DISK_CACHE_SINGLE_FILE", false)) {
|
|
|
|
return disk_cache_load_item_foz(cache, key, size);
|
|
|
|
} else {
|
|
|
|
char *filename = disk_cache_get_cache_filename(cache, key);
|
|
|
|
if (filename == NULL)
|
|
|
|
return NULL;
|
2016-09-27 23:55:02 +01:00
|
|
|
|
2020-10-01 11:02:59 +01:00
|
|
|
return disk_cache_load_item(cache, filename, size);
|
|
|
|
}
|
2016-09-27 23:55:02 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
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;
|
2017-11-23 18:41:34 +00:00
|
|
|
int i = CPU_TO_LE32(*key_chunk) & CACHE_INDEX_KEY_MASK;
|
2016-09-27 23:55:02 +01:00
|
|
|
unsigned char *entry;
|
|
|
|
|
2018-02-07 06:13:00 +00:00
|
|
|
if (cache->blob_put_cb) {
|
|
|
|
cache->blob_put_cb(key, CACHE_KEY_SIZE, key_chunk, sizeof(uint32_t));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2018-02-09 05:37:49 +00:00
|
|
|
if (cache->path_init_failed)
|
2018-01-22 09:55:06 +00:00
|
|
|
return;
|
|
|
|
|
2017-03-18 22:46:39 +00:00
|
|
|
entry = &cache->stored_keys[i * CACHE_KEY_SIZE];
|
2016-09-27 23:55:02 +01:00
|
|
|
|
|
|
|
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;
|
2017-11-23 18:41:34 +00:00
|
|
|
int i = CPU_TO_LE32(*key_chunk) & CACHE_INDEX_KEY_MASK;
|
2016-09-27 23:55:02 +01:00
|
|
|
unsigned char *entry;
|
|
|
|
|
2018-02-07 06:13:00 +00:00
|
|
|
if (cache->blob_get_cb) {
|
|
|
|
uint32_t blob;
|
|
|
|
return cache->blob_get_cb(key, CACHE_KEY_SIZE, &blob, sizeof(uint32_t));
|
|
|
|
}
|
|
|
|
|
2018-02-09 05:37:49 +00:00
|
|
|
if (cache->path_init_failed)
|
2018-01-22 09:55:06 +00:00
|
|
|
return false;
|
|
|
|
|
2017-03-18 22:46:39 +00:00
|
|
|
entry = &cache->stored_keys[i * CACHE_KEY_SIZE];
|
2016-09-27 23:55:02 +01:00
|
|
|
|
|
|
|
return memcmp(entry, key, CACHE_KEY_SIZE) == 0;
|
|
|
|
}
|
2017-01-18 19:40:31 +00:00
|
|
|
|
2017-03-15 23:09:27 +00:00
|
|
|
void
|
|
|
|
disk_cache_compute_key(struct disk_cache *cache, const void *data, size_t size,
|
|
|
|
cache_key key)
|
|
|
|
{
|
2017-03-15 23:09:29 +00:00
|
|
|
struct mesa_sha1 ctx;
|
|
|
|
|
|
|
|
_mesa_sha1_init(&ctx);
|
|
|
|
_mesa_sha1_update(&ctx, cache->driver_keys_blob,
|
|
|
|
cache->driver_keys_blob_size);
|
|
|
|
_mesa_sha1_update(&ctx, data, size);
|
|
|
|
_mesa_sha1_final(&ctx, key);
|
2017-03-15 23:09:27 +00:00
|
|
|
}
|
|
|
|
|
2018-02-07 06:13:00 +00:00
|
|
|
void
|
|
|
|
disk_cache_set_callbacks(struct disk_cache *cache, disk_cache_put_cb put,
|
|
|
|
disk_cache_get_cb get)
|
|
|
|
{
|
|
|
|
cache->blob_put_cb = put;
|
|
|
|
cache->blob_get_cb = get;
|
|
|
|
}
|
|
|
|
|
2017-01-18 19:40:31 +00:00
|
|
|
#endif /* ENABLE_SHADER_CACHE */
|