| /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...] |
| /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...] |
| /external/llvm/lib/Support/ |
| SourceMgr.cpp | 38 // Delete the line # cache if allocated.
39 if (LineNoCacheTy *Cache = getCache(LineNoCache))
40 delete Cache;
96 // If we have a line number cache, and if the query is to a later point in the
99 if (LineNoCacheTy *Cache = getCache(LineNoCache))
100 if (Cache->LastQueryBufferID == BufferID &&
101 Cache->LastQuery <= Loc.getPointer()) {
102 Ptr = Cache->LastQuery;
103 LineNo = Cache->LineNoOfQuery;
112 // 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 | 349 factory->Cache[computeDigest()] = next;
372 CacheTy Cache;
613 TreeTy *&entry = Cache[digest];
[all...] |
| /external/llvm/tools/bugpoint/ |
| Miscompilation.cpp | [all...] |
| /packages/apps/Mms/src/com/android/mms/data/ |
| Conversation.java | 136 Conversation conv = Cache.get(threadId);
142 Cache.put(conv);
144 LogTag.error("Tried to add duplicate Conversation to Cache (from threadId): " + conv);
145 if (!Cache.replace(conv)) {
146 LogTag.error("get by threadId cache.replace failed on " + conv);
165 Conversation conv = Cache.get(recipients);
179 Cache.put(conv);
181 LogTag.error("Tried to add duplicate Conversation to Cache (from recipients): " + conv);
182 if (!Cache.replace(conv)) {
183 LogTag.error("get by recipients cache.replace failed on " + conv)
[all...] |
| /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/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 | 566 /// cache arrays are properly kept sorted.
567 static void AssertSorted(MemoryDependenceAnalysis::NonLocalDepInfo &Cache,
569 if (Count == -1) Count = Cache.size();
573 assert(!(Cache[i] < Cache[i-1]) && "Cache isn't sorted!");
594 NonLocalDepInfo &Cache = CacheP.first;
602 if (!Cache.empty()) {
603 // Okay, we have a cache entry. If we know it is not dirty, just return it
607 return Cache;
[all...] |
| /bionic/libc/netbsd/resolv/ |
| res_cache.c | 46 /* This code implements a small and *simple* DNS resolver cache.
48 * It is only used to cache DNS answers for a time defined by the smallest TTL
50 * to be a full DNS cache, since we plan to implement that in the future in a
62 * to keep an answer in the cache.
65 * (and should be solved by the later full DNS cache process).
71 * that a full DNS cache is expected to do.
75 * - the client calls _resolv_cache_get() to obtain a handle to the cache.
76 * this will initialize the cache on first usage. the result can be NULL
77 * if the cache is disabled.
86 * answer to the cache
1175 Cache* cache; member in struct:resolv_cache_info
1236 struct resolv_cache* cache; local
1620 struct resolv_cache *cache; local
1654 struct resolv_cache* cache = _find_named_cache_locked(ifname); local
1699 struct resolv_cache* cache = _get_res_cache_for_iface_locked(ifname); local
1741 struct resolv_cache* cache = _find_named_cache_locked(ifname); local
[all...] |
| /external/clang/lib/AST/ |
| Type.cpp | [all...] |
| ASTImporter.cpp | [all...] |
| /external/clang/lib/Serialization/ |
| ASTReader.cpp | 905 /// \brief stat() cache for precompiled headers.
907 /// This cache is very similar to the stat cache used by pretokenized
911 CacheTy *Cache;
917 : Cache(0), NumStatHits(NumStatHits), NumStatMisses(NumStatMisses) {
918 Cache = CacheTy::Create(Buckets, Base);
921 ~ASTStatCache() { delete Cache; }
926 CacheTy::iterator I = Cache->find(Path);
929 if (I == Cache->end()) {
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/parse-only/ |
| mootools-1.2.2-core-nc.js | [all...] |
| /external/valgrind/main/helgrind/ |
| libhb_core.c | 207 LineZ; /* compressed rep for a cache line */
214 LineF; /* full rep for a cache line */
220 CacheLine-sized chunks of SecMaps are copied into a Cache, being
221 decompressed when moved into the cache and recompressed on the
222 way out. Because of this, the cache must operate as a writeback
223 cache, not a writethrough one.
271 /* ------ Cache ------ */
279 cache so it is empty is to set all the tag values to any value % 8
280 != 0, eg 1. This means all queries in the cache initially miss.
288 Cache;
[all...] |
| /external/mesa3d/src/mesa/main/ |
| mtypes.h | [all...] |
| /development/samples/NFCDemo/libs/ |
| guava-10.0.1.jar | |
| /prebuilt/common/ant/ |
| ant.jar | |
| /prebuilt/common/ecj/ |
| ecj.jar | |
