/external/glide/library/src/main/java/com/bumptech/glide/load/engine/cache/ |
H A D | MemorySizeCalculator.java | 1 package com.bumptech.glide.load.engine.cache; 51 Log.d(TAG, "Calculated memory cache size: " + toMb(memoryCacheSize) + " pool size: " + toMb(bitmapPoolSize)
|
/external/guava/guava/src/com/google/common/cache/ |
H A D | AbstractCache.java | 17 package com.google.common.cache; 35 * <p>To implement a cache, the programmer needs only to extend this class and provide an 144 * Records cache hits. This should be called when a cache request returns a cached value. 152 * Records cache misses. This should be called when a cache request returns a value that was 153 * not found in the cache. This method should be called by the loading thread, as well as by 165 * Records the successful load of a new entry. This should be called when a cache request 169 * @param loadTime the number of nanoseconds the cache spent computing or retrieving the new 175 * Records the failed load of a new entry. This should be called when a cache reques [all...] |
/external/guava/guava-tests/test/com/google/common/cache/ |
H A D | TestingCacheLoaders.java | 15 package com.google.common.cache;
|
/external/icu/icu4c/source/common/ |
H A D | locutil.cpp | 192 Hashtable* cache; local 194 cache = LocaleUtility_cache; 197 if (cache == NULL) { 198 cache = new Hashtable(status); 199 if (cache == NULL || U_FAILURE(status)) { 202 cache->setValueDeleter(uhash_deleteHashtable); 207 LocaleUtility_cache = h = cache; 208 cache = NULL; 212 if(cache != NULL) { 213 delete cache; [all...] |
/external/icu/icu4c/source/i18n/unicode/ |
H A D | reldatefmt.h | 412 const RelativeDateTimeCacheData* cache; member in class:RelativeDateTimeFormatter
|
/external/libnl/include/ |
H A D | netlink-local.h | 52 #include <netlink/cache.h> 55 #include <netlink/cache-api.h> 164 static inline char *nl_cache_name(struct nl_cache *cache) argument 166 return cache->c_ops ? cache->c_ops->co_name : "unknown";
|
/external/libnl/lib/ |
H A D | cache_mngr.c | 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 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; 61 * // Create a new cache for links/interfaces and ask the manager to 63 * // to initially fill the cache 213 struct nl_cache *cache; local [all...] |
/external/libnl/lib/genl/ |
H A D | ctrl.c | 147 * Look up generic netlink family by id in the provided cache. 148 * @arg cache Generic netlink family cache. 151 * Searches through the cache looking for a registered family 158 struct genl_family *genl_ctrl_search(struct nl_cache *cache, int id) argument 162 if (cache->c_ops != &genl_ctrl_ops) 165 nl_list_for_each_entry(fam, &cache->c_items, ce_list) { 181 * Look up generic netlink family by family name in the provided cache. 182 * @arg cache Generic netlink family cache 192 genl_ctrl_search_by_name(struct nl_cache *cache, const char *name) argument 224 struct nl_cache *cache; local [all...] |
/external/libnl/lib/route/ |
H A D | class.c | 62 static int class_request_update(struct nl_cache *cache, struct nl_sock *sk) argument 66 .tcm_ifindex = cache->c_iarg1, 222 * Build a class cache including all classes attached to the specified interface 227 * Allocates a new cache, initializes it properly and updates it to 230 * @return The cache or NULL if an error has occured. 235 struct nl_cache * cache; local 238 cache = nl_cache_alloc(&rtnl_class_ops); 239 if (!cache) 242 cache->c_iarg1 = ifindex; 244 if (sk && (err = nl_cache_refill(sk, cache)) < 260 rtnl_class_get(struct nl_cache *cache, int ifindex, uint32_t handle) argument [all...] |
H A D | class_obj.c | 133 * @arg cache a qdisc cache including at laest all qdiscs of the 135 * @return The qdisc from the cache or NULL if the class has no leaf qdisc 138 struct nl_cache *cache) 145 leaf = rtnl_qdisc_get_by_parent(cache, class->c_ifindex, 164 * @arg cache a class cache including all classes of the interface 169 void rtnl_class_foreach_child(struct rtnl_class *class, struct nl_cache *cache, argument 182 nl_cache_foreach_filter(cache, (struct nl_object *) filter, cb, arg); 189 * @arg cache 137 rtnl_class_leaf_qdisc(struct rtnl_class *class, struct nl_cache *cache) argument 194 rtnl_class_foreach_cls(struct rtnl_class *class, struct nl_cache *cache, void (*cb)(struct nl_object *, void *), void *arg) argument [all...] |
H A D | cls.c | 70 static int cls_request_update(struct nl_cache *cache, struct nl_sock *sk) argument 74 .tcm_ifindex = cache->c_iarg1, 75 .tcm_parent = cache->c_iarg2, 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))) 302 cache [all...] |
H A D | qdisc.c | 56 * // Qdisc object from a cache can be used. 376 * Build a qdisc cache including all qdiscs currently configured in 381 * Allocates a new cache, initializes it properly and updates it to 392 * Look up qdisc by its parent in the provided cache 393 * @arg cache qdisc cache 396 * @return pointer to qdisc inside the cache or NULL if no match was found. 398 struct rtnl_qdisc * rtnl_qdisc_get_by_parent(struct nl_cache *cache, argument 403 if (cache->c_ops != &rtnl_qdisc_ops) 406 nl_list_for_each_entry(q, &cache 423 rtnl_qdisc_get(struct nl_cache *cache, int ifindex, uint32_t handle) argument [all...] |
H A D | qdisc_obj.c | 129 * @arg cache a class cache including all classes of the interface 134 void rtnl_qdisc_foreach_child(struct rtnl_qdisc *qdisc, struct nl_cache *cache, argument 147 nl_cache_foreach_filter(cache, (struct nl_object *) filter, cb, arg); 155 * @arg cache a filter cache including at least all the filters 160 void rtnl_qdisc_foreach_cls(struct rtnl_qdisc *qdisc, struct nl_cache *cache, argument 172 nl_cache_foreach_filter(cache, (struct nl_object *) filter, cb, arg);
|
H A D | route.c | 21 #include <netlink/cache.h> 63 * Build a route cache holding all routes currently configured in the kernel 68 * Allocates a new cache, initializes it properly and updates it to 72 * cache after using it. 73 * @return The cache or NULL if an error has occured. 78 struct nl_cache *cache; local 81 if (!(cache = nl_cache_alloc(&rtnl_route_ops))) 84 cache->c_iarg1 = family; 85 cache->c_iarg2 = flags; 87 if (sk && (err = nl_cache_refill(sk, cache)) < [all...] |
/external/libnl/src/lib/ |
H A D | route.c | 35 struct nl_cache *cache; local 38 if ((err = rtnl_route_alloc_cache(sk, AF_UNSPEC, flags, &cache)) < 0) 39 nl_cli_fatal(err, "Unable to allocate route cache: %s\n", 42 nl_cache_mngt_provide(cache); 44 return cache;
|
/external/llvm/bindings/python/llvm/ |
H A D | object.py | 45 In addition, we also provide a "cache" method on each class to cache all 47 cache=True to the appropriate get_XXX() method to have this done for you. 74 symbols = list(obj.get_symbols(cache=True)) 123 def get_sections(self, cache=False): 138 if cache: 139 last.cache() 151 def get_symbols(self, cache=False): 166 if cache: 167 last.cache() 271 def cache(self): member in class:Section 344 def cache(self): member in class:Symbol 426 def cache(self): member in class:Relocation [all...] |
/external/mesa3d/src/gallium/auxiliary/draw/ |
H A D | 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);
|
H A D | draw_pt_fetch_emit.c | 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) {
|
H A D | draw_pt_vsplit.c | 61 } cache; member in struct:vsplit_frontend 68 memset(vsplit->cache.fetches, 0xff, sizeof(vsplit->cache.fetches)); 69 vsplit->cache.has_max_fetch = FALSE; 70 vsplit->cache.num_fetch_elts = 0; 71 vsplit->cache.num_draw_elts = 0; 78 vsplit->fetch_elts, vsplit->cache.num_fetch_elts, 79 vsplit->draw_elts, vsplit->cache.num_draw_elts, flags); 95 if (vsplit->cache.fetches[hash] != fetch) { 96 /* update cache */ [all...] |
/external/mesa3d/src/gallium/drivers/softpipe/ |
H A D | sp_tex_sample.h | 102 struct softpipe_tex_tile_cache *cache; member in struct:sp_sampler_variant
|
/external/mesa3d/src/gallium/drivers/svga/ |
H A D | svga_screen_cache.c | 53 * against the cache size limit, so view them as zero-sized. 87 * Search the cache for a surface that matches the key. If a match is 88 * found, remove it from the cache and return the surface pointer. 95 struct svga_host_surface_cache *cache = &svgascreen->cache; local 107 pipe_mutex_lock(cache->mutex); 109 curr = cache->bucket[bucket].next; 111 while (curr != &cache->bucket[bucket]) { 131 LIST_ADD(&entry->head, &cache->empty); 133 /* update the cache siz 168 struct svga_host_surface_cache *cache = &svgascreen->cache; local 205 struct svga_host_surface_cache *cache = &svgascreen->cache; local 300 struct svga_host_surface_cache *cache = &svgascreen->cache; local 341 struct svga_host_surface_cache *cache = &svgascreen->cache; local 366 struct svga_host_surface_cache *cache = &svgascreen->cache; local [all...] |
/external/mockito/cglib-and-asm/src/org/mockito/cglib/core/ |
H A D | 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/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/mdat/ |
H A D | MediaDataBox.java | 64 private Map<Long, Reference<ByteBuffer>> cache = new HashMap<Long, Reference<ByteBuffer>>(); field in class:MediaDataBox 69 * not evicted from the cache. 148 cache.put(0l, new SoftReference<ByteBuffer>(content)); 154 for (Long chacheEntryOffset : cache.keySet()) { 156 ByteBuffer cacheEntry = cache.get(chacheEntryOffset).get(); 177 cache.put(offset, new SoftReference<ByteBuffer>(cacheEntry));
|
/external/skia/bench/ |
H A D | GrResourceCacheBench.cpp | 89 static void populate_cache(GrResourceCache* cache, GrGpu* gpu, int resourceCount) { argument 95 cache->purgeAsNeeded(1, resource->gpuMemorySize()); 96 cache->addResource(key, resource); 105 cache->purgeAsNeeded(1, resource->gpuMemorySize()); 106 cache->addResource(key, resource); 111 static void check_cache_contents_or_die(GrResourceCache* cache, int k) { argument 117 GrCacheable* item = cache->find(key); 119 SkFAIL("cache add does not work as expected"); 123 SkFAIL("cache add does not work as expected"); 131 GrCacheable* item = cache [all...] |
/external/skia/include/core/ |
H A D | SkImageFilter.h | 53 // By default, we cache only image filters with 2 or more children. 64 Context(const SkMatrix& ctm, const SkIRect& clipBounds, Cache* cache) : argument 65 fCTM(ctm), fClipBounds(clipBounds), fCache(cache) { 69 Cache* cache() const { return fCache; } function in class:SkImageFilter::Context 188 * Set an external cache to be used for all image filter processing. This 189 * will replace the default intra-frame cache. 191 static void SetExternalCache(Cache* cache); 194 * Returns the currently-set external cache, or NULL if none is set.
|