| /development/ndk/platforms/android-3/arch-arm/include/asm/ |
| procinfo.h | 35 struct cpu_cache_fns *cache; member in struct:proc_info_list
|
| /development/tools/idegen/src/com/android/idegen/ |
| ModuleCache.java | 28 * Cache to hold built modules.
34 private static ModuleCache cache = new ModuleCache(); field in class:ModuleCache
46 return cache;
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Interval.java | 34 static Interval[] cache = new Interval[INTERVAL_POOL_MAX_VALUE+1]; field in class:Interval
54 // cache just a..a
58 if ( cache[a]==null ) {
59 cache[a] = new Interval(a,a);
61 return cache[a];
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
| ASN1Enumerated.java | 145 private static ASN1Enumerated[] cache = new ASN1Enumerated[12]; field in class:ASN1Enumerated
160 if (value >= cache.length)
165 ASN1Enumerated possibleMatch = cache[value];
169 possibleMatch = cache[value] = new ASN1Enumerated(Arrays.clone(enc));
|
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| sanitizer_allocator_testlib.cc | 48 static THREADLOCAL AllocatorCache cache; member in namespace:__anon8450
57 allocator.SwallowCache(&cache);
68 cache.Init();
76 void *p = allocator.Allocate(&cache, size, 8);
85 allocator.Deallocate(&cache, p);
92 void *p = allocator.Allocate(&cache, size, 8, false);
104 p = allocator.Reallocate(&cache, p, size, 8);
114 void *p = allocator.Allocate(&cache, size, alignment);
122 *memptr = allocator.Allocate(&cache, size, alignment);
132 void *p = allocator.Allocate(&cache, size, GetPageSizeCached())
[all...] |
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_dense_alloc.h | 13 // DenseSlabAllocCache is a thread-local cache for DenseSlabAlloc.
32 IndexT cache[kSize]; member in class:__tsan::DenseSlabAllocCache
39 typedef DenseSlabAllocCache Cache;
40 typedef typename Cache::IndexT IndexT;
61 IndexT Alloc(Cache *c) {
64 return c->cache[--c->pos];
67 void Free(Cache *c, IndexT idx) {
69 if (c->pos == Cache::kSize)
71 c->cache[c->pos++] = idx;
80 void FlushCache(Cache *c)
[all...] |
| /external/curl/lib/ |
| pingpong.h | 46 * It holds response cache and non-blocking sending data.
49 char *cache; /* data cache between getresponse()-calls */ member in struct:pingpong
50 size_t cache_size; /* size of cache in bytes */
145 * Returns whether there are still more data in the cache and so a call
|
| /external/dexmaker/src/dx/java/com/android/dx/rop/cst/ |
| CstInteger.java | 28 private static final CstInteger[] cache = new CstInteger[511]; field in class:CstInteger
64 int idx = (value & 0x7fffffff) % cache.length;
65 CstInteger obj = cache[idx];
72 cache[idx] = obj;
|
| /external/e2fsprogs/lib/blkid/ |
| dev.c | 101 * This series of functions iterate over all devices in a blkid cache
107 blkid_cache cache; member in struct:blkid_struct_dev_iterate
113 extern blkid_dev_iterate blkid_dev_iterate_begin(blkid_cache cache)
120 iter->cache = cache;
121 iter->p = cache->bic_devs.next;
163 while (iter->p != &iter->cache->bic_devs) {
202 blkid_cache cache = NULL; local
234 if ((ret = blkid_get_cache(&cache, file)) != 0) {
235 fprintf(stderr, "%s: error creating cache (%d)\n"
[all...] |
| /external/glide/library/src/main/java/com/bumptech/glide/util/ |
| LruCache.java | 7 * A general purpose size limited cache that evicts items using an LRU algorithm. By default every item is assumed to
14 private final LinkedHashMap<T, Y> cache = new LinkedHashMap<T, Y>(100, 0.75f, true); field in class:LruCache
22 * @param size The maximum size of the cache, the units must match the units used in {@link #getSize(Object)}.
31 * cache. If the new size is less than the current size, entries will be evicted until the current size is less
55 * A callback called whenever an item is evicted from the cache. Subclasses can override.
65 * Returns the current maximum size of the cache in bytes.
72 * Returns the sum of the sizes of all items in the cache.
79 * Returns true if there is a value for the given key in the cache.
85 return cache.containsKey(key);
89 * Returns the item in the cache for the given key or null if no such item exists
[all...] |
| /external/guava/guava/src/com/google/common/cache/ |
| CacheStats.java | 17 package com.google.common.cache;
31 * Statistics about the performance of a {@link Cache}. Instances of this class are immutable.
33 * <p>Cache statistics are incremented according to the following rules:
36 * <li>When a cache lookup encounters an existing cache entry {@code hitCount} is incremented.
37 * <li>When a cache lookup first encounters a missing cache entry, a new entry is loaded.
45 * <li>Cache lookups that encounter a missing cache entry that is still loading will wait
48 * <li>When an entry is evicted from the cache, {@code evictionCount} is incremented
[all...] |
| RemovalNotification.java | 17 package com.google.common.cache;
34 * strong references to the key and value, regardless of the type of references the cache may be
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| MapMakerSingleThreadBenchmark.java | 47 Map<Integer, Integer> cache; field in class:MapMakerSingleThreadBenchmark
59 cache = new MapMaker()
69 // To start, fill up the cache.
73 while (cache.get(nextRandomKey()) < maximumSize) {}
82 dummy += cache.get(nextRandomKey());
|
| /external/guava/guava-tests/test/com/google/common/cache/ |
| CacheBuilderFactory.java | 15 package com.google.common.cache;
22 import com.google.common.cache.LocalCache.Strength;
|
| CacheLoaderTest.java | 17 package com.google.common.cache;
|
| /external/icu/icu4c/source/common/ |
| locutil.cpp | 213 Hashtable *cache = LocaleUtility_cache; local
214 if (cache == NULL) {
221 htp = (Hashtable*) cache->get(bundleID);
244 Hashtable *t = static_cast<Hashtable *>(cache->get(bundleID));
246 // Another thread raced through this code, creating the cache entry first.
252 cache->put(bundleID, (void*)htp, status);
|
| /external/libnl/lib/ |
| cache_mngr.c | 2 * lib/cache_mngr.c Cache Manager
17 * The purpose of a cache manager is to keep track of caches and
23 * nature of a manager, it is not possible to have a cache maintain
24 * two instances of the same cache type. The socket is subscribed
25 * to the event notification group of each cache and also put into
33 * | | Cache Manager | | [ (IFF_UP | IFF_RUNNING) ]
48 * @par 1) Creating a new cache manager
52 * // Allocate a new cache manager for RTNETLINK and automatically
57 * @par 2) Keep track of a cache
59 * struct nl_cache *cache;
213 struct nl_cache *cache; local
[all...] |
| /external/libnl/lib/route/ |
| cls.c | 70 static int cls_request_update(struct nl_cache *cache, struct nl_sock *sk)
74 .tcm_ifindex = cache->c_iarg1,
75 .tcm_parent = cache->c_iarg2,
274 * @name Cache Management
279 * Build a classifier cache including all classifiers attached to the
285 * @arg result Pointer to store resulting cache.
287 * Allocates a new cache, initializes it properly and updates it to
291 * cache after using it.
296 struct nl_cache * cache; local
299 if (!(cache = nl_cache_alloc(&rtnl_cls_ops))
[all...] |
| /external/libopus/celt/ |
| modes.h | 79 PulseCache cache; member in struct:OpusCustomMode
|
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pt_emit.c | 42 struct translate_cache *cache; member in struct:pt_emit
112 emit->translate = translate_cache_find(emit->cache, &hw_key);
278 emit->cache = translate_cache_create();
279 if (!emit->cache) {
291 if (emit->cache)
292 translate_cache_destroy(emit->cache);
|
| draw_pt_fetch_emit.c | 82 /* Cache point size somewhere it's address won't change:
86 struct translate_cache *cache; member in struct:fetch_emit_middle_end
157 feme->translate = translate_cache_find(feme->cache,
359 if (feme->cache)
360 translate_cache_destroy(feme->cache);
372 fetch_emit->cache = translate_cache_create();
373 if (!fetch_emit->cache) {
|
| /external/mesa3d/src/mesa/program/ |
| prog_cache.c | 82 rehash(struct gl_program_cache *cache)
88 cache->last = NULL;
90 size = cache->size * 3;
94 for (i = 0; i < cache->size; i++)
95 for (c = cache->items[i]; c; c = next) {
101 free(cache->items);
102 cache->items = items;
103 cache->size = size;
108 clear_cache(struct gl_context *ctx, struct gl_program_cache *cache,
114 cache->last = NULL
141 struct gl_program_cache *cache = CALLOC_STRUCT(gl_program_cache); local
[all...] |
| /external/mockito/cglib-and-asm/src/org/mockito/cglib/core/ |
| AbstractClassGenerator.java | 51 Map cache = new WeakHashMap(); field in class:AbstractClassGenerator.Source
81 return (Set)((Map)source.cache.get(loader)).get(NAME_KEY);
116 * Whether use and update the static cache of generated classes
194 cache2 = (Map)source.cache.get(loader);
198 source.cache.put(loader, cache2);
|
| /external/skia/src/core/ |
| SkGlyphCache_Globals.h | 37 SkGlyphCache* cache = fHead; local
38 while (cache) {
39 SkGlyphCache* next = cache->fNext;
40 delete cache;
41 cache = next;
65 // returns true if this cache is over-budget either due to size limit
|
| /external/squashfs-tools/kernel/fs/squashfs/ |
| cache.c | 21 * cache.c
28 * This file implements a generic cache implementation used for both caches,
29 * plus functions layered ontop of the generic cache implementation to
32 * To avoid out of memory and fragmentation isssues with vmalloc the cache
35 * It should be noted that the cache is not used for file datablocks, these
36 * are decompressed and cached in the page-cache in the normal way. The
37 * cache is only used to temporarily cache fragment and metadata blocks
63 * Look-up block in cache, and increment usage count. If not in cache, rea
186 struct squashfs_cache *cache = entry->cache; local
237 struct squashfs_cache *cache = kzalloc(sizeof(*cache), GFP_KERNEL); local
[all...] |
