Home
last modified time | relevance | path

Searched +full:lru +full:- +full:cache (Results 1 – 25 of 1003) sorted by relevance

12345678910>>...41

/aosp_15_r20/external/mesa3d/src/gallium/auxiliary/util/
H A Du_cache.c20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
30 * Improved cache implementation.
32 * Fixed size array with linear probing on collision and LRU eviction
74 /** Max entries in the cache */
80 /** Number of entries in the cache */
83 /** Head of list, sorted from Least-recently used to Most-recently used */
84 struct util_cache_entry lru; member
89 ensure_sanity(const struct util_cache *cache);
94 * Create a new cache with 'size' entries. Also provide functions for
103 struct util_cache *cache; in util_cache_create() local
[all …]
/aosp_15_r20/packages/modules/Bluetooth/system/gd/common/
Dlru_cache.h8 * http://www.apache.org/licenses/LICENSE-2.0
34 // An LRU map-cache the evict the oldest item when reaching capacity
37 // - keys are sorted from warmest to coldest
38 // - iterating through the cache won't warm up keys
39 // - operations on iterators won't warm up keys
40 // - find(), contains(), insert_or_assign() will warm up the key
41 // - insert_or_assign() will evict coldest key when cache reaches capacity
42 // - NOT THREAD SAFE
45 // - Key look-up and modification is O(1)
46 // - Memory consumption is:
[all …]
/aosp_15_r20/external/ublksrv/qcow2/
H A DREADME.rst3 ublk-qcow2
9 ublk-qcow2 is started for serving for the four purposes:
11 - building one complicated target from scratch helps libublksrv APIs/functions
15 - there are several attempts of implementing qcow2 driver in kernel, such as
16 ``qloop`` [#qloop]_, ``dm-qcow2`` [#dm_qcow2]_ and
17 ``in kernel qcow2(ro)`` [#in_kernel_qcow2_ro]_, so ublk-qcow2 might useful
20 - performance comparison with qemu-nbd, and it was my 1st thought to evaluate
21 performance of ublk/io_uring backend by writing one ublk-qcow2 since ublksrv
24 - help to abstract common building block or design pattern for writing new ublk
30 ublk add -t qcow2 -f $PATH_QCOW2_IMG
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/core/platform/cloud/
H A Dram_file_block_cache.h7 http://www.apache.org/licenses/LICENSE-2.0
37 /// \brief An LRU block cache of file contents, keyed by {filename, offset}.
39 /// This class should be shared by read-only random access files on a remote
43 /// The callback executed when a block is not found in the cache, and needs to
45 /// cache is constructed. The returned Status should be OK as long as the
61 pruning_thread_.reset(env_->StartThread(ThreadOptions(), "TF_prune_FBC", in block_size_()
64 VLOG(1) << "GCS file block cache is " in block_size_()
83 /// but the read returned a partial block, and the LRU cache contained a
95 // cache. Returns true if the signature doesn't change or the file doesn't
97 // the new one and remove the file from cache.
[all …]
H A Dram_file_block_cache_test.cc7 http://www.apache.org/licenses/LICENSE-2.0
30 Status ReadCache(RamFileBlockCache* cache, const string& filename, in ReadCache() argument
32 out->clear(); in ReadCache()
33 out->resize(n, 0); in ReadCache()
36 cache->Read(filename, offset, n, out->data(), &bytes_transferred); in ReadCache()
38 out->resize(bytes_transferred, n); in ReadCache()
69 RamFileBlockCache cache(16, 32, 0, fetcher); in TEST() local
73 EXPECT_TRUE(cache.ValidateAndUpdateFileSignature(filename, 123)); in TEST()
74 TF_EXPECT_OK(ReadCache(&cache, filename, 0, 16, &out)); in TEST()
77 // Second read. Hit cache. in TEST()
[all …]
H A Dexpiring_lru_cache.h7 http://www.apache.org/licenses/LICENSE-2.0
30 /// \brief An LRU cache of string keys and arbitrary values, with configurable
38 /// that there is no limit on the number of entries in the cache (however, if
39 /// `max_age` is also 0, the cache will not be populated).
77 /// a copy of the output parameter in the cache, and another copy in `value`.
99 /// Clear the cache.
106 /// Accessors for cache parameters.
112 /// The timestamp (seconds) at which the entry was added to the cache.
118 /// A list iterator pointing to the entry's position in the LRU list.
128 lru_list_.erase(it->second.lru_iterator); in LookupLocked()
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/c/experimental/filesystem/plugins/gcs/
H A Dram_file_block_cache.h7 http://www.apache.org/licenses/LICENSE-2.0
36 /// \brief An LRU block cache of file contents, keyed by {filename, offset}.
38 /// This class should be shared by read-only random access files on a remote
42 /// The callback executed when a block is not found in the cache, and needs to
44 /// cache is constructed. It returns total bytes read ( -1 in case of errors
69 TF_VLog(1, "GCS file block cache is %s.\n",
83 /// returns total bytes read ( -1 in case of errors ). This method will set
90 /// but the read returned a partial block, and the LRU cache contained a
106 // cache. Returns true if the signature doesn't change or the file doesn't
108 // the new one and remove the file from cache.
[all …]
H A Dram_file_block_cache_test.cc7 http://www.apache.org/licenses/LICENSE-2.0
31 Status ReadCache(tf_gcs_filesystem::RamFileBlockCache* cache, in ReadCache() argument
34 out->clear(); in ReadCache()
35 out->resize(n, 0); in ReadCache()
38 cache->Read(filename, offset, n, out->data(), &status); in ReadCache()
41 out->resize(bytes_transferred, n); in ReadCache()
48 char* buffer, TF_Status* status) -> int64_t { in TEST()
67 char* buffer, TF_Status* status) -> int64_t { in TEST()
74 tf_gcs_filesystem::RamFileBlockCache cache(16, 32, 0, fetcher); in TEST() local
78 EXPECT_TRUE(cache.ValidateAndUpdateFileSignature(filename, 123)); in TEST()
[all …]
H A Dexpiring_lru_cache.h7 http://www.apache.org/licenses/LICENSE-2.0
32 /// \brief An LRU cache of string keys and arbitrary values, with configurable
40 /// that there is no limit on the number of entries in the cache (however, if
41 /// `max_age` is also 0, the cache will not be populated).
81 /// store a copy of the output parameter in the cache, and another copy in
103 /// Clear the cache.
110 /// Accessors for cache parameters.
116 /// The timestamp (seconds) at which the entry was added to the cache.
122 /// A list iterator pointing to the entry's position in the LRU list.
132 lru_list_.erase(it->second.lru_iterator); in LookupLocked()
[all …]
/aosp_15_r20/external/leveldb/util/
H A Dcache.cc2 // Use of this source code is governed by a BSD-style license that can be
5 #include "leveldb/cache.h"
18 Cache::~Cache() {} in ~Cache()
22 // LRU cache implementation
24 // Cache entries have an "in_cache" boolean indicating whether the cache has a
27 // an element with a duplicate key is inserted, or on destruction of the cache.
29 // The cache keeps two linked lists of items in the cache. All items in the
30 // cache are in one list or the other, and never both. Items still referenced
31 // by clients but erased from the cache are in neither list. The lists are:
32 // - in-use: contains the items currently referenced by clients, in no
[all …]
/aosp_15_r20/external/libwebsockets/include/libwebsockets/
H A Dlws-cache-ttl.h2 * libwebsockets - small server side websockets and web server implementation
4 * Copyright (C) 2010 - 2021 Andy Green <[email protected]>
25 /** \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.
42 * Both expiry and LRU orderings are kept so it is easy to find out usage
46 * you allocate new objects (to keep the whole cache under the specified limit),
[all …]
/aosp_15_r20/external/cronet/net/disk_cache/blockfile/
H A Ddisk_format.h2 // Use of this source code is governed by a BSD-style license that can be
5 // The cache is stored on disk as a collection of block-files, plus an index
10 // will be stored as a series of blocks on a block-file. In any case, CacheAddr
11 // represents the address of the data inside the cache.
15 // by the cache entry.
17 // The last element of the cache is the block-file. A block file is a file
21 // A new cache is initialized with four block files (named data_0 through
26 // entry keeps track of all the information related to the same cache entry,
29 // location on the LRU lists, last access time etc.
31 // The files that store internal information for the cache (blocks and index)
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/core/lib/io/
H A Dcache.cc7 http://www.apache.org/licenses/LICENSE-2.0
16 #include "tensorflow/core/lib/io/cache.h"
30 Cache::~Cache() {} in ~Cache()
34 // LRU cache implementation
36 // Cache entries have an "in_cache" boolean indicating whether the cache has a
39 // an element with a duplicate key is inserted, or on destruction of the cache.
41 // The cache keeps two linked lists of items in the cache. All items in the
42 // cache are in one list or the other, and never both. Items still referenced
43 // by clients but erased from the cache are in neither list. The lists are:
44 // - in-use: contains the items currently referenced by clients, in no
[all …]
/aosp_15_r20/packages/modules/NeuralNetworks/driver/cache/BlobCache/
DBlobCache_test.cpp8 ** http://www.apache.org/licenses/LICENSE-2.0
36 enum { OK = 0, BAD_VALUE = -EINVAL };
57 BlobCache::Policy(BlobCache::Select::LRU, BlobCache::Capacity::HALVE),
60 BlobCache::Policy(BlobCache::Select::LRU, BlobCache::Capacity::FIT),
63 BlobCache::Policy(BlobCache::Select::LRU, BlobCache::Capacity::FIT_HALVE)));
67 mBC->set("abcd", 4, "efgh", 4); in TEST_P()
68 ASSERT_EQ(size_t(4), mBC->get("abcd", 4, buf, 4)); in TEST_P()
77 mBC->set("ab", 2, "cd", 2); in TEST_P()
78 mBC->set("ef", 2, "gh", 2); in TEST_P()
79 ASSERT_EQ(size_t(2), mBC->get("ab", 2, buf, 2)); in TEST_P()
[all …]
/aosp_15_r20/out/soong/.intermediates/external/rust/android-crates-io/crates/lru-cache/liblru_cache/android_arm64_armv8-2a_cortex-a55_rlib_rlib-std/
Dliblru_cache.rlib.d.raw1 …-crates-io/crates/lru-cache/liblru_cache/android_arm64_armv8-2a_cortex-a55_rlib_rlib-std/liblru_ca…
3 …-crates-io/crates/lru-cache/liblru_cache/android_arm64_armv8-2a_cortex-a55_rlib_rlib-std/liblru_ca…
5 external/rust/android-crates-io/crates/lru-cache/src/lib.rs:
/aosp_15_r20/external/tensorflow/tensorflow/compiler/xla/pjrt/
H A Dlru_cache.h7 http://www.apache.org/licenses/LICENSE-2.0
26 // A simple LRU cache. Not thread-safe.
28 // a smart-pointer type.
40 // Multiple LRUCaches can share a LRU list, meaning that the capacity and
41 // eviction policy is shared. The user provides an LRU list
42 // to the cache constructor, and must ensure that it remains alive as long
43 // as the cache does.
70 // Root of a circular doubly-linked list of entries, in order from least
71 // recently used to most recently used. An "empty" cache always contains
72 // this element in the LRU list.
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/compiler/xrt/
H A Dxrt_compilation_cache.h7 http://www.apache.org/licenses/LICENSE-2.0
37 // Returns a non-owned pointer to an immutable executable.
45 // XRTCompilationCacheEntryRef is returned by the cache Lookup methods below,
46 // and ensures the underlying executable is not garbage-collected until the
57 // Cache for compiled XLA executables.
72 // compiled executable were not present in the cache, compile_function would be
84 // auto proto = entry->get();
90 // so the cache defaults to a specific number of entries to determine when to
96 // Ensures there is an entry for key present in the cache. By the time
97 // CompileIfKeyAbsent returns there is guaranteed to be an entry in the cache
[all …]
/aosp_15_r20/external/aws-crt-java/src/main/java/software/amazon/awssdk/crt/mqtt5/
H A DTopicAliasingOptions.java46 …* If outbound topic aliasing is set to LRU, this controls the maximum size of the cache. If outbo…
47 …* aliasing is set to LRU and this is zero or undefined, a sensible default is used (25). If outbo…
48 * aliasing is not set to LRU, then this setting has no effect.
50 * The final size of the cache is determined by the minimum of this setting and the value of the
54 * @param size maximum size to use for the outbound alias cache
79 …* If inbound topic aliasing is enabled, this will control the size of the inbound alias cache. If…
86 * @param size maximum size to use for the inbound alias cache
98 …lias behavior is described in <a href="https://docs.oasis-open.org/mqtt/mqtt/v5.0/os/mqtt-v5.0-os.…
109 * Outbound aliasing is the user's responsibility. Client will cache and use
110 … * previously-established aliases if they fall within the negotiated limits of the connection.
[all …]
/aosp_15_r20/external/rust/android-crates-io/crates/lru-cache/
DMETADATA1 name: "lru-cache"
2 description: "A cache that holds a limited number of key-value pairs"
11 homepage: "https://crates.io/crates/lru-cache"
14 value: "https://static.crates.io/crates/lru-cache/lru-cache-0.1.2.crate"
DCargo.toml9 # issue against the rust-lang/cargo repository. If you're
14 name = "lru-cache" package
17 description = "A cache that holds a limited number of key-value pairs"
18 homepage = "https://github.com/contain-rs/lru-cache"
19 documentation = "https://contain-rs.github.io/lru-cache/lru_cache"
21 keywords = ["data-structures"]
22 license = "MIT/Apache-2.0"
23 repository = "https://github.com/contain-rs/lru-cache"
28 [dependencies.linked-hash-map]
32 heapsize_impl = ["heapsize", "linked-hash-map/heapsize_impl"]
/aosp_15_r20/external/mesa3d/src/virtio/vulkan/
H A Dvn_image.c3 * SPDX-License-Identifier: MIT
13 #include "venus-protocol/vn_protocol_driver_image.h"
14 #include "venus-protocol/vn_protocol_driver_image_view.h"
15 #include "venus-protocol/vn_protocol_driver_sampler.h"
16 #include "venus-protocol/vn_protocol_driver_sampler_ycbcr_conversion.h"
32 if (!(create_info->flags & VK_IMAGE_CREATE_DISJOINT_BIT)) in vn_image_get_plane_count()
36 assert(create_info->tiling != VK_IMAGE_TILING_DRM_FORMAT_MODIFIER_EXT); in vn_image_get_plane_count()
37 return vk_format_get_plane_count(create_info->format); in vn_image_get_plane_count()
64 switch (u.pnext->sType) { in vn_image_fill_reqs()
66 u.two->memoryRequirements = req->memory.memoryRequirements; in vn_image_fill_reqs()
[all …]
/aosp_15_r20/external/cronet/base/containers/
H A Dlru_cache.h2 // Use of this source code is governed by a BSD-style license that can be
5 // This file contains a template for a Least Recently Used cache that allows
6 // constant-time access to items, but easy identification of the
7 // least-recently-used items for removal. Variations exist to support use as a
48 // Base class for the LRU cache specializations defined below.
73 // The max_size is the size at which the cache will prune its members to when
76 // can pass NO_AUTO_EVICT to not restrict the cache size.
80 // might be costly, it's currently move-only to ensure users don't
102 Erase(index_iter->second); in Put()
106 ShrinkToSize(max_size_ - 1); in Put()
[all …]
/aosp_15_r20/external/jemalloc_new/include/jemalloc/internal/
H A Drtree_tsd.h5 * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively. Each
6 * entry supports an entire leaf, so the cache hit rate is typically high even
10 * that this cache can directly cover, the cache will become less effective if
11 * locality of reference is low, but the consequence is merely cache misses
14 * The L1 direct mapped cache offers consistent and low cost on cache hit.
16 * combining with a L2 LRU cache, which requires linear search and re-ordering
17 * on access but suffers no collision. Note that, the cache will itself suffer
18 * cache misses if made overly large, plus the cost of linear search in the LRU
19 * cache.
42 /* Direct mapped cache. */
[all …]
/aosp_15_r20/packages/apps/Camera2/src/com/android/camera/processing/memory/
DLruPool.java8 * http://www.apache.org/licenses/LICENSE-2.0
29 * order of Least Recently Used (LRU). This code is based on the Android
30 * Lru implementation but removes the hard requirement that keys must only
39 * reuse objects that are expensive to create or re-create.
57 * access the cache while this method is executing.
62 * Called after a cache miss to compute a value for the corresponding key.
67 * access the cache while this method is executing.
75 * user-defined units. The default implementation returns 1 so that size
78 * <p>An entry's size must not change while it is in the cache.
112 * Creates and sets the size of the Lru Pool
[all …]
/aosp_15_r20/external/libwebsockets/READMEs/
H A DREADME.lws_cache.md3 lws_cache implements a single- or multi-level cache for generic payload items
6 ![lws_cache overview](../doc-assets/lws_cache-1.png)
8 L1 cache is always stored on heap, but it may be hooked up to additional levels
9 of cache objects with different backing storage. The last level always contains
14 formats and media, while being able to take advantage of a suitably-sized L1
15 heap cache to minimize the cost of repeated access.
17 ![lws_cache overview](../doc-assets/lws_cache-2.png)
20 caches in `minimal-examples/api-tests/api-test-lws_cache`
22 ## Cache size restriction, LRU and TTL
24 The max heap footprint of its items and max number of items can be capped. LRU
[all …]

12345678910>>...41