| /external/compiler-rt/lib/tsan/lit_tests/ |
| static_init2.cc | 6 struct Cache {
8 explicit Cache(int x)
13 void foo(Cache *my) {
14 static Cache *c = my ? my : new Cache(rand());
20 foo(new Cache(rand()));
|
| static_init3.cc | 7 struct Cache {
11 Cache g_cache;
13 Cache *CreateCache() {
18 _Atomic(Cache*) queue;
21 static Cache *c = CreateCache();
27 Cache *c = 0;
|
| static_init4.cc | 7 struct Cache {
9 explicit Cache(int x)
16 Cache *CreateCache() {
18 return new Cache(rand());
22 static Cache *c = CreateCache();
|
| static_init5.cc | 7 struct Cache {
9 explicit Cache(int x)
15 return new Cache((int)(long)p);
18 Cache *CreateCache() {
23 return (Cache*)res;
27 static Cache *c = CreateCache();
|
| static_init6.cc | 7 struct Cache {
9 explicit Cache(int x)
15 return new Cache((int)(long)p);
18 Cache *CreateCache() {
23 return (Cache*)res;
27 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/IR/ |
| 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...] |
| /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/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/volley/src/com/android/volley/ |
| Cache.java | 23 * An interface for a cache keyed by a String with a byte array as data.
25 public interface Cache {
27 * Retrieves an entry from the cache.
28 * @param key Cache key
29 * @return An {@link Entry} or null in the event of a cache miss
34 * Adds or replaces an entry to the cache.
35 * @param key Cache key
36 * @param entry Data to store and metadata for cache coherency, TTL, etc.
41 * Performs any potentially long-running actions needed to initialize the cache;
47 * Invalidates an entry in the cache
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_quarantine.h | 43 typedef QuarantineCache<Callback> Cache;
55 void Put(Cache *c, Callback cb, Node *ptr, uptr size) {
61 void NOINLINE Drain(Cache *c, Callback cb) {
79 Cache cache_;
83 Cache tmp;
95 void NOINLINE DoRecycle(Cache *c, Callback cb) {
109 // Per-thread cache of memory blocks.
|
| /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 | 144 CacheTy Cache;
167 // Profile the new list to see if it already exists in our cache.
173 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
176 // The list does not exist in our cache. Create it.
181 // Insert the new list into the cache.
182 Cache.InsertNode(L, InsertPos);
|
| ImmutableSet.h | 349 factory->Cache[factory->maskCacheIndex(computeDigest())] = next;
372 CacheTy Cache;
618 TreeTy *&entry = Cache[maskCacheIndex(digest)];
[all...] |
| /external/llvm/lib/Support/ |
| SourceMgr.cpp | 42 // Delete the line # cache if allocated.
43 if (LineNoCacheTy *Cache = getCache(LineNoCache))
44 delete Cache;
102 // If we have a line number cache, and if the query is to a later point in the
105 if (LineNoCacheTy *Cache = getCache(LineNoCache))
106 if (Cache->LastQueryBufferID == BufferID &&
107 Cache->LastQuery <= Loc.getPointer()) {
108 Ptr = Cache->LastQuery;
109 LineNo = Cache->LineNoOfQuery;
117 // Allocate the line number cache if it doesn't exist
[all...] |
| /external/smack/src/org/jivesoftware/smack/util/ |
| Cache.java | 28 * has an optional expiration time for cache items. The Map is thread-safe.<p>
30 * The algorithm for cache is as follows: a HashMap is maintained for fast
32 * order they are accessed from cache, the other keeps objects in the order
33 * they were originally added to cache. When objects are added to cache, they
40 * of the object in cache. Keeping a reference to the node lets us avoid
43 * To get an object from cache, a hash lookup is performed to get a reference
46 * and any necessary cache cleanups are performed. Cache deletion and expiration
51 public class Cache<K, V> implements Map<K, V>
[all...] |
| /external/llvm/tools/bugpoint/ |
| Miscompilation.cpp | [all...] |
| /packages/apps/Mms/src/com/android/mms/data/ |
| Conversation.java | 146 Conversation conv = Cache.get(threadId);
152 Cache.put(conv);
154 LogTag.error("Tried to add duplicate Conversation to Cache (from threadId): " + conv);
155 if (!Cache.replace(conv)) {
156 LogTag.error("get by threadId cache.replace failed on " + conv);
175 Conversation conv = Cache.get(recipients);
189 Cache.put(conv);
191 LogTag.error("Tried to add duplicate Conversation to Cache (from recipients): " + conv);
192 if (!Cache.replace(conv)) {
193 LogTag.error("get by recipients cache.replace failed on " + conv)
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| CallEvent.h | 922 /// stack" as if they were value objects by keeping a cache of CallEvent-sized
930 SmallVector<void *, 8> Cache;
933 Cache.push_back(const_cast<void *>(Memory));
938 if (Cache.empty())
941 return Cache.pop_back_val();
[all...] |
| /external/clang/lib/Lex/ |
| PTHLexer.cpp | 516 // Get the location of the spelling cache.
524 // Get the number of IdentifierInfos and pre-allocate the identifier cache.
527 // Pre-allocate the persistent ID -> IdentifierInfo* cache. We use calloc()
566 // Store the new IdentifierInfo in the cache.
671 CacheTy Cache;
675 Cache(FL.getNumBuckets(), FL.getNumEntries(), FL.getBuckets(),
683 CacheTy::iterator I = Cache.find(Path);
686 if (I == Cache.end())
|
| /external/clang/lib/Sema/ |
| Sema.cpp | 477 RecordCompleteMap::iterator Cache = MNCComplete.find(RD);
478 if (Cache != MNCComplete.end())
479 return Cache->second;
514 RecordCompleteMap::iterator Cache = RecordsComplete.find(RD);
515 if (Cache != RecordsComplete.end())
516 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 | 604 /// cache arrays are properly kept sorted.
605 static void AssertSorted(MemoryDependenceAnalysis::NonLocalDepInfo &Cache,
607 if (Count == -1) Count = Cache.size();
611 assert(!(Cache[i] < Cache[i-1]) && "Cache isn't sorted!");
632 NonLocalDepInfo &Cache = CacheP.first;
640 if (!Cache.empty()) {
641 // Okay, we have a cache entry. If we know it is not dirty, just return it
645 return Cache;
[all...] |
| /external/smack/src/org/xbill/DNS/ |
| Cache.java | 9 * A cache of DNS records. The cache obeys TTLs, so items are purged after
20 public class Cache {
164 * Creates an empty Cache
166 * @param dclass The DNS class of this cache
170 Cache(int dclass) {
176 * Creates an empty Cache for class IN.
180 Cache() {
185 * Creates a Cache which initially contains all records in the specified file.
188 Cache(String file) throws IOException
[all...] |
