| /external/compiler-rt/lib/tsan/output_tests/ |
| static_init2.cc | 5 struct Cache {
7 explicit Cache(int x)
12 void foo(Cache *my) {
13 static Cache *c = my ? my : new Cache(rand());
19 foo(new Cache(rand()));
|
| static_init3.cc | 6 struct Cache {
10 Cache g_cache;
12 Cache *CreateCache() {
17 _Atomic(Cache*) queue;
20 static Cache *c = CreateCache();
26 Cache *c = 0;
|
| static_init4.cc | 6 struct Cache {
8 explicit Cache(int x)
15 Cache *CreateCache() {
17 return new Cache(rand());
21 static Cache *c = CreateCache();
|
| static_init5.cc | 6 struct Cache {
8 explicit Cache(int x)
14 return new Cache((int)(long)p);
17 Cache *CreateCache() {
22 return (Cache*)res;
26 static Cache *c = CreateCache();
|
| /external/webkit/Source/WebCore/platform/text/ |
| AtomicStringKeyedMRUCache.h | 67 typedef Vector<Entry, capacity> Cache;
68 Cache m_cache;
|
| /external/llvm/lib/VMCore/ |
| LeaksContext.h | 33 Cache(0), Name(name) { }
36 Cache = 0;
51 if (Cache) {
52 assert(Cache != o && "Object already in set!");
53 Ts.insert(Cache);
55 Cache = o;
59 if (o == Cache)
60 Cache = 0; // Cache hit
66 addGarbage(0); // Flush the Cache
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/cache/ |
| Cache.java | 17 package com.android.gallery3d.filtershow.cache;
24 public interface Cache {
|
| /external/guava/guava/src/com/google/common/cache/ |
| Cache.java | 17 package com.google.common.cache;
33 * A semi-persistent mapping from keys to values. Cache entries are manually added using
34 * {@link #get(K, Callable)} or {@link #put(K, V)}, and are stored in the cache until either
37 * <p><b>Note:</b> in release 12.0, all methods moved from {@code Cache} to {@link LoadingCache}
38 * will be deleted from {@code Cache}. As part of this transition {@code Cache} will no longer
51 public interface Cache<K, V> extends Function<K, V> {
54 * Returns the value associated with {@code key} in this cache, or {@code null} if there is no
63 * Returns the value associated with {@code key} in this cache, obtaining that value from
64 * {@code valueLoader} if necessary. No observable state associated with this cache is modifie
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineLoopRanges.h | 92 CacheMap Cache;
|
| /external/webkit/Source/WebCore/svg/properties/ |
| SVGAnimatedProperty.h | 49 typedef HashMap<SVGAnimatedPropertyDescription, RefPtr<SVGAnimatedProperty>, SVGAnimatedPropertyDescriptionHash, SVGAnimatedPropertyDescriptionHashTraits> Cache;
53 // Remove wrapper from cache.
54 Cache* cache = animatedPropertyCache(); local
55 const Cache::const_iterator end = cache->end();
56 for (Cache::const_iterator it = cache->begin(); it != end; ++it) {
58 cache->remove(it->first);
92 static Cache* animatedPropertyCache(
[all...] |
| /frameworks/support/volley/src/com/android/volley/ |
| Cache.java | 20 * An interface for a cache keyed by a String with a byte array as data.
22 public interface Cache {
24 * Retrieves an entry from the cache.
25 * @param key Cache key
26 * @return An {@link Entry} or null in the event of a cache miss
31 * Adds or replaces an entry to the cache.
32 * @param key Cache key
33 * @param entry Data to store and metadata for cache coherency, TTL, etc.
38 * Performs any potentially long-running actions needed to initialize the cache;
44 * Invalidates an entry in the cache
[all...] |
| /external/llvm/lib/Support/ |
| SourceMgr.cpp | 38 // Delete the line # cache if allocated.
39 if (LineNoCacheTy *Cache = getCache(LineNoCache))
40 delete Cache;
98 // If we have a line number cache, and if the query is to a later point in the
101 if (LineNoCacheTy *Cache = getCache(LineNoCache))
102 if (Cache->LastQueryBufferID == BufferID &&
103 Cache->LastQuery <= Loc.getPointer()) {
104 Ptr = Cache->LastQuery;
105 LineNo = Cache->LineNoOfQuery;
113 // Allocate the line number cache if it doesn't exist
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/security/provider/cert/ |
| Cache.java | 36 * objects they are returned from the cache, if not - newly generated
37 * objects can be saved in the cache.<br>
45 * determine whether object to be generated is in the cache or not.
65 * If it is so - the cached object is returned from the cache,
66 * if not - new object should be generated and saved in the cache.<br>
71 public class Cache {
92 // size of the cache
103 // to the object cached at cache[N]
110 private final Object[] cache; field in class:Cache
112 // This array is used to speed up the process of the search in the cache
[all...] |
| /external/javassist/src/main/javassist/ |
| CtMember.java | 30 static class Cache extends CtMember {
49 Cache(CtClassType decl) {
|
| /external/llvm/include/llvm/ADT/ |
| ImmutableList.h | 145 CacheTy Cache;
168 // Profile the new list to see if it already exists in our cache.
174 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
177 // The list does not exist in our cache. Create it.
182 // Insert the new list into the cache.
183 Cache.InsertNode(L, InsertPos);
|
| ImmutableSet.h | 350 factory->Cache[factory->maskCacheIndex(computeDigest())] = next;
373 CacheTy Cache;
619 TreeTy *&entry = Cache[maskCacheIndex(digest)];
[all...] |
| /external/llvm/tools/bugpoint/ |
| Miscompilation.cpp | [all...] |
| /packages/apps/Mms/src/com/android/mms/data/ |
| Conversation.java | 141 Conversation conv = Cache.get(threadId);
147 Cache.put(conv);
149 LogTag.error("Tried to add duplicate Conversation to Cache (from threadId): " + conv);
150 if (!Cache.replace(conv)) {
151 LogTag.error("get by threadId cache.replace failed on " + conv);
170 Conversation conv = Cache.get(recipients);
184 Cache.put(conv);
186 LogTag.error("Tried to add duplicate Conversation to Cache (from recipients): " + conv);
187 if (!Cache.replace(conv)) {
188 LogTag.error("get by recipients cache.replace failed on " + conv)
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| CallEvent.h | 856 /// stack" as if they were value objects by keeping a cache of CallEvent-sized
864 SmallVector<void *, 8> Cache;
867 Cache.push_back(const_cast<void *>(Memory));
872 if (Cache.empty())
875 return Cache.pop_back_val();
|
| /external/clang/lib/Lex/ |
| PTHLexer.cpp | 520 // Get the location of the spelling cache.
528 // Get the number of IdentifierInfos and pre-allocate the identifier cache.
531 // Pre-allocate the persistent ID -> IdentifierInfo* cache. We use calloc()
570 // Store the new IdentifierInfo in the cache.
675 CacheTy Cache;
679 Cache(FL.getNumBuckets(), FL.getNumEntries(), FL.getBuckets(),
687 CacheTy::iterator I = Cache.find(Path);
690 if (I == Cache.end())
|
| /external/clang/lib/Sema/ |
| Sema.cpp | 438 RecordCompleteMap::iterator Cache = MNCComplete.find(RD);
439 if (Cache != MNCComplete.end())
440 return Cache->second;
475 RecordCompleteMap::iterator Cache = RecordsComplete.find(RD);
476 if (Cache != RecordsComplete.end())
477 return Cache->second;
[all...] |
| /external/doclava/src/com/google/doclava/ |
| Converter.java | 221 private static Cache mClasses = new Cache() {
331 private static Cache mMethods = new Cache() {
417 private static Cache mFields = new Cache() {
435 private static Cache mPackagees = new Cache() {
447 private static Cache mTypes = new Cache() {
[all...] |
| /external/llvm/lib/Analysis/ |
| MemoryDependenceAnalysis.cpp | 588 /// cache arrays are properly kept sorted.
589 static void AssertSorted(MemoryDependenceAnalysis::NonLocalDepInfo &Cache,
591 if (Count == -1) Count = Cache.size();
595 assert(!(Cache[i] < Cache[i-1]) && "Cache isn't sorted!");
616 NonLocalDepInfo &Cache = CacheP.first;
624 if (!Cache.empty()) {
625 // Okay, we have a cache entry. If we know it is not dirty, just return it
629 return Cache;
[all...] |
| /bionic/libc/netbsd/resolv/ |
| res_cache.c | 47 /* This code implements a small and *simple* DNS resolver cache.
49 * It is only used to cache DNS answers for a time defined by the smallest TTL
51 * to be a full DNS cache, since we plan to implement that in the future in a
63 * to keep an answer in the cache.
66 * (and should be solved by the later full DNS cache process).
72 * that a full DNS cache is expected to do.
76 * - the client calls _resolv_cache_get() to obtain a handle to the cache.
77 * this will initialize the cache on first usage. the result can be NULL
78 * if the cache is disabled.
87 * answer to the cache
1196 Cache* cache; member in struct:resolv_cache_info
1371 struct resolv_cache* cache; local
1790 struct resolv_cache *cache; local
1824 struct resolv_cache* cache = _find_named_cache_locked(ifname); local
1869 struct resolv_cache* cache = _get_res_cache_for_iface_locked(ifname); local
1911 struct resolv_cache* cache = _find_named_cache_locked(ifname); local
[all...] |
| /external/clang/lib/AST/ |
| Type.cpp | [all...] |
