Home
last modified time | relevance | path

Searched full:cache (Results 1 – 25 of 6386) sorted by relevance

12345678910>>...256

/third_party/libnl/lib/
Dcache.c3 * lib/cache.c Caching Module
15 * @defgroup cache Cache
18 * Cache Management | | Type Specific Cache Operations
27 * 2) destroy old cache +----------- pp_cb ---------|---+
49 * #include <netlink/cache.h>
55 #include <netlink/cache.h>
66 * Return the number of items in the cache
67 * @arg cache cache handle
69 int nl_cache_nitems(struct nl_cache *cache) in nl_cache_nitems() argument
71 return cache->c_nitems; in nl_cache_nitems()
[all …]
Dcache_mngt.c3 * lib/cache_mngt.c Cache Management
25 * #include <netlink/cache.h>
31 #include <netlink/cache.h>
38 * @name Cache Operations Sets
55 * @arg ops Cache operations
64 * @arg ops Cache operations
72 * Lookup cache operations by name
73 * @arg name name of the cache type
78 * @return The cache operations or NULL if not found.
92 * Lookup cache operations by name
[all …]
/third_party/mesa3d/src/gallium/auxiliary/util/
Du_cache.c30 * Improved cache implementation.
76 /** Max entries in the cache */
82 /** Number of entries in the cache */
91 ensure_sanity(const struct util_cache *cache);
96 * Create a new cache with 'size' entries. Also provide functions for
105 struct util_cache *cache; in util_cache_create() local
107 cache = CALLOC_STRUCT(util_cache); in util_cache_create()
108 if (!cache) in util_cache_create()
111 cache->hash = hash; in util_cache_create()
112 cache->compare = compare; in util_cache_create()
[all …]
/third_party/skia/third_party/externals/swiftshader/tests/SystemUnitTests/
DLRUCacheTests.cpp26 template<typename Cache>
27 void checkRange(const Cache &cache, std::vector<std::pair<typename Cache::Key, typename Cache::Data… in checkRange() argument
30 for(auto it : cache) in checkRange()
46 LRUCache<std::string, std::string> cache(8); in TEST() local
47 ASSERT_EQ(cache.lookup(""), ""); in TEST()
48 ASSERT_EQ(cache.lookup("123"), ""); in TEST()
50 for(auto ignored : cache) in TEST()
57 FAIL() << "Should not loop on empty cache"; in TEST()
63 LRUCache<std::string, std::string> cache(4); in TEST() local
65 cache.add("1", "one"); in TEST()
[all …]
/third_party/ntfs-3g/libntfs-3g/
Dcache.c2 * cache.c : deal with LRU caches
35 #include "cache.h"
48 * in the cache. Another function may be provided for invalidating
63 static void inserthashindex(struct CACHE_HEADER *cache, in inserthashindex() argument
70 if (cache->dohash) { in inserthashindex()
71 h = cache->dohash(current); in inserthashindex()
72 if ((h >= 0) && (h < cache->max_hash)) { in inserthashindex()
74 link = cache->free_hash; in inserthashindex()
76 cache->free_hash = link->next; in inserthashindex()
77 first = cache->first_hash[h]; in inserthashindex()
[all …]
/third_party/node/deps/npm/node_modules/cacache/locales/
Den.js16 x.ls = cache => ls(cache) argument
17 x.ls.stream = cache => ls.stream(cache) argument
19 x.get = (cache, key, opts) => get(cache, key, opts) argument
20 x.get.byDigest = (cache, hash, opts) => get.byDigest(cache, hash, opts) argument
21 x.get.sync = (cache, key, opts) => get.sync(cache, key, opts) argument
22 x.get.sync.byDigest = (cache, key, opts) => get.sync.byDigest(cache, key, opts) argument
23 x.get.stream = (cache, key, opts) => get.stream(cache, key, opts) argument
24 x.get.stream.byDigest = (cache, hash, opts) => get.stream.byDigest(cache, hash, opts) argument
25 x.get.copy = (cache, key, dest, opts) => get.copy(cache, key, dest, opts) argument
26 x.get.copy.byDigest = (cache, hash, dest, opts) => get.copy.byDigest(cache, hash, dest, opts) argument
[all …]
Des.js16 x.ls = cache => ls(cache) argument
17 x.ls.flujo = cache => ls.stream(cache) argument
19 x.saca = (cache, clave, ops) => get(cache, clave, ops) argument
20 x.saca.porHacheo = (cache, hacheo, ops) => get.byDigest(cache, hacheo, ops) argument
21 x.saca.sinc = (cache, clave, ops) => get.sync(cache, clave, ops) argument
22 x.saca.sinc.porHacheo = (cache, hacheo, ops) => get.sync.byDigest(cache, hacheo, ops) argument
23 x.saca.flujo = (cache, clave, ops) => get.stream(cache, clave, ops) argument
24 x.saca.flujo.porHacheo = (cache, hacheo, ops) => get.stream.byDigest(cache, hacheo, ops) argument
25 x.sava.copia = (cache, clave, destino, opts) => get.copy(cache, clave, destino, opts) argument
26 x.sava.copia.porHacheo = (cache, hacheo, destino, opts) => get.copy.byDigest(cache, hacheo, destino… argument
[all …]
/third_party/mesa3d/src/broadcom/vulkan/
Dv3dv_pipeline_cache.c55 cache_dump_stats(struct v3dv_pipeline_cache *cache) in cache_dump_stats() argument
57 fprintf(stderr, " NIR cache entries: %d\n", cache->nir_stats.count); in cache_dump_stats()
58 fprintf(stderr, " NIR cache miss count: %d\n", cache->nir_stats.miss); in cache_dump_stats()
59 fprintf(stderr, " NIR cache hit count: %d\n", cache->nir_stats.hit); in cache_dump_stats()
61 fprintf(stderr, " cache entries: %d\n", cache->stats.count); in cache_dump_stats()
62 fprintf(stderr, " cache miss count: %d\n", cache->stats.miss); in cache_dump_stats()
63 fprintf(stderr, " cache hit count: %d\n", cache->stats.hit); in cache_dump_stats()
67 pipeline_cache_lock(struct v3dv_pipeline_cache *cache) in pipeline_cache_lock() argument
69 if (!cache->externally_synchronized) in pipeline_cache_lock()
70 pthread_mutex_lock(&cache->mutex); in pipeline_cache_lock()
[all …]
/third_party/skia/third_party/externals/freetype/src/cache/
Dftccache.c5 * The FreeType internal cache interface (body).
27 #define FT_COMPONENT cache
41 /***** CACHE NODE DEFINITIONS *****/
86 /* get a top bucket for specified hash from cache,
87 * body for FTC_NODE_TOP_FOR_HASH( cache, hash )
90 ftc_get_top_node_for_hash( FTC_Cache cache, in ftc_get_top_node_for_hash() argument
96 idx = hash & cache->mask; in ftc_get_top_node_for_hash()
97 if ( idx < cache->p ) in ftc_get_top_node_for_hash()
98 idx = hash & ( 2 * cache->mask + 1 ); in ftc_get_top_node_for_hash()
100 return cache->buckets + idx; in ftc_get_top_node_for_hash()
[all …]
/third_party/freetype/src/cache/
Dftccache.c5 * The FreeType internal cache interface (body).
27 #define FT_COMPONENT cache
41 /***** CACHE NODE DEFINITIONS *****/
86 /* get a top bucket for specified hash from cache,
87 * body for FTC_NODE_TOP_FOR_HASH( cache, hash )
90 ftc_get_top_node_for_hash( FTC_Cache cache, in ftc_get_top_node_for_hash() argument
97 idx = hash & cache->mask; in ftc_get_top_node_for_hash()
98 if ( idx < cache->p ) in ftc_get_top_node_for_hash()
99 idx = hash & ( 2 * cache->mask + 1 ); in ftc_get_top_node_for_hash()
100 pnode = cache->buckets + idx; in ftc_get_top_node_for_hash()
[all …]
/third_party/flutter/skia/third_party/externals/freetype/src/cache/
Dftccache.c5 * The FreeType internal cache interface (body).
28 #define FT_COMPONENT cache
42 /***** CACHE NODE DEFINITIONS *****/
87 /* get a top bucket for specified hash from cache,
88 * body for FTC_NODE_TOP_FOR_HASH( cache, hash )
91 ftc_get_top_node_for_hash( FTC_Cache cache, in ftc_get_top_node_for_hash() argument
98 idx = hash & cache->mask; in ftc_get_top_node_for_hash()
99 if ( idx < cache->p ) in ftc_get_top_node_for_hash()
100 idx = hash & ( 2 * cache->mask + 1 ); in ftc_get_top_node_for_hash()
101 pnode = cache->buckets + idx; in ftc_get_top_node_for_hash()
[all …]
/third_party/mesa3d/src/freedreno/vulkan/
Dtu_pipeline_cache.c48 tu_pipeline_cache_init(struct tu_pipeline_cache *cache, in tu_pipeline_cache_init() argument
51 cache->device = device; in tu_pipeline_cache_init()
52 pthread_mutex_init(&cache->mutex, NULL); in tu_pipeline_cache_init()
54 cache->modified = false; in tu_pipeline_cache_init()
55 cache->kernel_count = 0; in tu_pipeline_cache_init()
56 cache->total_size = 0; in tu_pipeline_cache_init()
57 cache->table_size = 1024; in tu_pipeline_cache_init()
58 const size_t byte_size = cache->table_size * sizeof(cache->hash_table[0]); in tu_pipeline_cache_init()
59 cache->hash_table = malloc(byte_size); in tu_pipeline_cache_init()
62 * cache. Disable caching when we want to keep shader debug info, since in tu_pipeline_cache_init()
[all …]
/third_party/alsa-utils/axfer/
Dframe-cache.c3 // frame-cache.c - maintainer of cache for data frame.
9 #include "frame-cache.h"
11 static void align_frames_in_i(struct frame_cache *cache, in align_frames_in_i() argument
14 char *buf = cache->buf; in align_frames_in_i()
18 cache->remained_count -= consumed_count; in align_frames_in_i()
20 offset = cache->bytes_per_sample * cache->samples_per_frame * in align_frames_in_i()
22 size = cache->bytes_per_sample * cache->samples_per_frame * in align_frames_in_i()
23 cache->remained_count; in align_frames_in_i()
26 cache->buf_ptr = buf + size; in align_frames_in_i()
29 static void align_frames_in_n(struct frame_cache *cache, in align_frames_in_n() argument
[all …]
/third_party/mesa3d/src/amd/vulkan/
Dradv_pipeline_cache.c46 radv_pipeline_cache_lock(struct radv_pipeline_cache *cache) in radv_pipeline_cache_lock() argument
48 if (cache->flags & VK_PIPELINE_CACHE_CREATE_EXTERNALLY_SYNCHRONIZED_BIT_EXT) in radv_pipeline_cache_lock()
51 mtx_lock(&cache->mutex); in radv_pipeline_cache_lock()
55 radv_pipeline_cache_unlock(struct radv_pipeline_cache *cache) in radv_pipeline_cache_unlock() argument
57 if (cache->flags & VK_PIPELINE_CACHE_CREATE_EXTERNALLY_SYNCHRONIZED_BIT_EXT) in radv_pipeline_cache_unlock()
60 mtx_unlock(&cache->mutex); in radv_pipeline_cache_unlock()
64 radv_pipeline_cache_init(struct radv_pipeline_cache *cache, struct radv_device *device) in radv_pipeline_cache_init() argument
66 vk_object_base_init(&device->vk, &cache->base, VK_OBJECT_TYPE_PIPELINE_CACHE); in radv_pipeline_cache_init()
68 cache->device = device; in radv_pipeline_cache_init()
69 mtx_init(&cache->mutex, mtx_plain); in radv_pipeline_cache_init()
[all …]
/third_party/mesa3d/src/util/
Ddisk_cache.c51 /* The cache version should be bumped whenever a change is made to the
52 * structure of cache entries or the index. This will give any 3rd party
53 * applications reading the cache entries a chance to adjust to the changes.
55 * - The cache version is checked internally when reading a cache entry. If we
56 * ever have a mismatch we are in big trouble as this means we had a cache
60 * - There is no strict requirement that cache versions be backwards
76 struct disk_cache *cache = NULL; in disk_cache_create() local
91 cache = rzalloc(NULL, struct disk_cache); in disk_cache_create()
92 if (cache == NULL) in disk_cache_create()
96 cache->path_init_failed = true; in disk_cache_create()
[all …]
/third_party/node/deps/npm/man/man1/
Dnpm-cache.11 .TH "NPM\-CACHE" "1" "April 2022" "" ""
3 \fBnpm-cache\fR \- Manipulates packages cache
8 npm cache add <tarball file>
9 npm cache add <folder>
10 npm cache add <tarball url>
11 npm cache add <name>@<version>
13 npm cache clean [<path>]
14 aliases: npm cache clear, npm cache rm
16 npm cache verify
21 Used to add, list, or clean the npm cache folder\.
[all …]
/third_party/mesa3d/src/mesa/drivers/dri/i965/
Dbrw_program_cache.c34 * This file implements a simple program cache for 965. The consumers can
37 * data) in return. Objects in the cache may not have relocations
43 * Replacement is not implemented. Instead, when the cache gets too
44 * big we throw out all of the cache data and let it get regenerated.
119 search_cache(struct brw_cache *cache, GLuint hash, in search_cache() argument
127 for (c = cache->items[hash % cache->size]; c; c = c->next) in search_cache()
130 fprintf(stderr, "bucket %d/%d = %d/%d items\n", hash % cache->size, in search_cache()
131 cache->size, bucketcount, cache->n_items); in search_cache()
134 for (c = cache->items[hash % cache->size]; c; c = c->next) { in search_cache()
144 rehash(struct brw_cache *cache) in rehash() argument
[all …]
/third_party/icu/icu4c/source/test/intltest/
Dunifiedcachetest.cpp98 const UnifiedCache *cache = UnifiedCache::getInstance(status); in TestEvictionUnderStress() local
99 int64_t evictedCountBefore = cache->autoEvictedCount(); in TestEvictionUnderStress()
103 int64_t evictedCountAfter = cache->autoEvictedCount(); in TestEvictionUnderStress()
105 dataerrln("%s:%d Items should have been evicted from cache", in TestEvictionUnderStress()
116 // cache API incorrectly by creating their own cache instances. in TestEvictionPolicy()
121 // their own cache! in TestEvictionPolicy()
122 UnifiedCache cache(status); in TestEvictionPolicy() local
126 cache.setEvictionPolicy(0, 100, status); in TestEvictionPolicy()
137 cache.get( in TestEvictionPolicy()
139 &cache, in TestEvictionPolicy()
[all …]
/third_party/mesa3d/src/mesa/program/
Dprog_cache.c84 rehash(struct gl_program_cache *cache) in rehash() argument
90 cache->last = NULL; in rehash()
92 size = cache->size * 3; in rehash()
96 for (i = 0; i < cache->size; i++) in rehash()
97 for (c = cache->items[i]; c; c = next) { in rehash()
103 free(cache->items); in rehash()
104 cache->items = items; in rehash()
105 cache->size = size; in rehash()
110 clear_cache(struct gl_context *ctx, struct gl_program_cache *cache, in clear_cache() argument
116 cache->last = NULL; in clear_cache()
[all …]
/third_party/libwebsockets/lib/misc/cache-ttl/
Dheap.c26 #include "private-lib-misc-cache-ttl.h"
33 update_sul(lws_cache_ttl_lru_t_heap_t *cache);
54 _lws_cache_heap_item_destroy(lws_cache_ttl_lru_t_heap_t *cache, in _lws_cache_heap_item_destroy() argument
57 lwsl_cache("%s: %s (%s)\n", __func__, cache->cache.info.name, in _lws_cache_heap_item_destroy()
63 cache->cache.current_footprint -= item->size; in _lws_cache_heap_item_destroy()
65 update_sul(cache); in _lws_cache_heap_item_destroy()
67 if (cache->cache.info.cb) in _lws_cache_heap_item_destroy()
68 cache->cache.info.cb((void *)((uint8_t *)&item[1]), item->size); in _lws_cache_heap_item_destroy()
74 lws_cache_heap_item_destroy(lws_cache_ttl_lru_t_heap_t *cache, in lws_cache_heap_item_destroy() argument
77 struct lws_cache_ttl_lru *backing = &cache->cache; in lws_cache_heap_item_destroy()
[all …]
/third_party/libwebsockets/include/libwebsockets/
Dlws-cache-ttl.h25 /** \defgroup lws_cache_ttl Cache supporting expiry
26 * ##Cache supporting expiry
29 * that have a "destroy-by date" and cache limits that will be observed.
32 * L1 / heap cache type, it can have parents and grandparents of other types
33 * which are accessible why writing / looking up and getting from the L1 cache.
34 * The outer "cache" layer may persistently store items to a backing store.
46 * you allocate new objects (to keep the whole cache under the specified limit),
56 * lws_cache_write_through() - add a new cache item object in all layers
58 * \param cache: the existing cache to allocate the object in
59 * \param specific_key: a key string that identifies the item in the cache
[all …]
/third_party/node/deps/npm/docs/content/cli-commands/
Dnpm-cache.md3 title: npm-cache
4 description: Manipulates packages cache
7 # npm-cache(1)
9 ## Manipulates packages cache
14 npm cache add <tarball file>
15 npm cache add <folder>
16 npm cache add <tarball url>
17 npm cache add <name>@<version>
19 npm cache clean [<path>]
20 aliases: npm cache clear, npm cache rm
[all …]
/third_party/glib/gio/xdgmime/
Dxdgmimecache.c42 #warning Building xdgmime without MMAP support. Binary "mime.info" cache files will not be used.
84 #define GET_UINT16(cache,offset) (ntohs(*(xdg_uint16_t*)((cache) + (offset)))) argument
85 #define GET_UINT32(cache,offset) (ntohl(*(xdg_uint32_t*)((cache) + (offset)))) argument
88 _xdg_mime_cache_ref (XdgMimeCache *cache) in _xdg_mime_cache_ref() argument
90 cache->ref_count++; in _xdg_mime_cache_ref()
91 return cache; in _xdg_mime_cache_ref()
95 _xdg_mime_cache_unref (XdgMimeCache *cache) in _xdg_mime_cache_unref() argument
97 cache->ref_count--; in _xdg_mime_cache_unref()
99 if (cache->ref_count == 0) in _xdg_mime_cache_unref()
102 munmap (cache->buffer, cache->size); in _xdg_mime_cache_unref()
[all …]
/third_party/mindspore/tests/ut/python/dataset/
Dtest_cache_map.py16 Testing cache operator with mappable datasets
41 @pytest.mark.skipif(os.environ.get('RUN_CACHE_TEST') != 'TRUE', reason="Require to bring up cache s…
44 Test mappable leaf with cache op right over the leaf
50 Cache
55 logger.info("Test cache map basic 1")
64 ds1 = ds.ImageFolderDataset(dataset_dir=DATA_DIR, cache=some_cache)
75 @pytest.mark.skipif(os.environ.get('RUN_CACHE_TEST') != 'TRUE', reason="Require to bring up cache s…
78 Test mappable leaf with the cache op later in the tree above the map(decode)
82 Cache
89 logger.info("Test cache map basic 2")
[all …]
/third_party/libsoup/libsoup/
Dsoup-cache.c3 * soup-cache.c
35 #include "soup-cache.h"
37 #include "soup-cache-client-input-stream.h"
38 #include "soup-cache-input-stream.h"
39 #include "soup-cache-private.h"
46 * SECTION:soup-cache
49 * #SoupCache implements a file-based cache for HTTP resources.
60 of the cache that can be
64 * Version 2: cache is now saved in soup.cache2. Added the version
67 * Version 3: added HTTP status code to the cache entries.
[all …]

12345678910>>...256