Searched defs:Key (Results 1 - 25 of 77) sorted by relevance

1234

/external/clang/lib/AST/
H A DLambdaMangleContext.cpp26 QualType Key = Context.getFunctionType(Context.VoidTy, local
30 Key = Context.getCanonicalType(Key);
31 return ++ManglingNumbers[Key->castAs<FunctionProtoType>()];
/external/chromium/base/
H A Dglobal_descriptors_posix.h39 typedef uint32_t Key; typedef in class:base::GlobalDescriptors
40 typedef std::vector<std::pair<Key, int> > Mapping;
42 // Often we want a canonical descriptor for a given Key. In this case, we add
50 int Get(Key key) const;
53 int MaybeGet(Key key) const;
56 void Set(Key key, int fd);
/external/llvm/lib/Support/
H A DStringPool.cpp25 PooledStringPtr StringPool::intern(StringRef Key) { argument
26 table_t::iterator I = InternTable.find(Key);
30 entry_t *S = entry_t::Create(Key.begin(), Key.end());
H A DStringMap.cpp116 int StringMapImpl::FindKey(StringRef Key) const {
119 unsigned FullHashValue = HashString(Key);
141 if (Key == StringRef(ItemStr, BucketItem->getKeyLength())) {
167 StringMapEntryBase *StringMapImpl::RemoveKey(StringRef Key) { argument
168 int Bucket = FindKey(Key);
/external/clang/tools/diagtool/
H A DDiagnosticNames.cpp54 DiagnosticRecord Key = {0, DiagID, 0}; local
59 Key, orderByID);
H A DTreeView.cpp60 GroupRecord Key = { RootGroup.size(), RootGroup.data(), 0, 0 }; local
62 std::lower_bound(AllGroups.begin(), AllGroups.end(), Key);
/external/llvm/include/llvm/MC/
H A DSubtargetFeature.h35 const char *Key; // K-V key string member in struct:llvm::SubtargetFeatureKV
42 return strcmp(Key, S.Key) < 0;
52 const char *Key; // K-V key string member in struct:llvm::SubtargetInfoKV
57 return strcmp(Key, S.Key) < 0;
/external/llvm/lib/MC/
H A DMCRegisterInfo.cpp50 DwarfLLVMRegPair Key = { RegNum, 0 }; local
51 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key);
61 DwarfLLVMRegPair Key = { RegNum, 0 }; local
62 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key);
/external/chromium/net/base/
H A Dhost_cache.h41 struct Key { struct in class:net::HostCache
42 Key(const std::string& hostname, AddressFamily address_family, function in struct:net::HostCache::Key
48 bool operator==(const Key& other) const {
57 bool operator<(const Key& other) const {
73 typedef std::map<Key, scoped_refptr<Entry> > EntryMap;
86 const Entry* Lookup(const Key& key, base::TimeTicks now) const;
92 Entry* Set(const Key& key,
H A Dhost_cache_unittest.cc23 HostCache::Key Key(const std::string& hostname) { function in namespace:net::__anon2797
24 return HostCache::Key(hostname, ADDRESS_FAMILY_UNSPECIFIED, 0);
41 EXPECT_TRUE(cache.Lookup(Key("foobar.com"), base::TimeTicks()) == NULL);
42 cache.Set(Key("foobar.com"), OK, AddressList(), now);
43 entry1 = cache.Lookup(Key("foobar.com"), base::TimeTicks());
51 EXPECT_TRUE(cache.Lookup(Key("foobar2.com"), base::TimeTicks()) == NULL);
52 cache.Set(Key("foobar2.com"), OK, AddressList(), now);
53 entry2 = cache.Lookup(Key("foobar2.com"), base::TimeTicks());
61 EXPECT_EQ(entry1, cache.Lookup(Key("fooba
[all...]
H A Dhost_resolver_impl.h137 typedef HostCache::Key Key; typedef in class:net::HostResolverImpl
138 typedef std::map<Key, scoped_refptr<Job> > JobMap;
151 Job* FindOutstandingJob(const Key& key);
212 Key GetEffectiveKeyForRequest(const RequestInfo& info) const;
/external/guava/guava-tests/test/com/google/common/cache/
H A DCacheReferencesTest.java40 private static final CacheLoader<Key,String> KEY_TO_STRING_LOADER =
41 new CacheLoader<Key, String>() {
42 @Override public String load(Key key) {
53 private Iterable<LoadingCache<Key, String>> caches() {
56 new Function<CacheBuilder<Object, Object>, LoadingCache<Key, String>>() {
57 @Override public LoadingCache<Key, String> apply(CacheBuilder<Object, Object> builder) {
64 for (LoadingCache<Key, String> cache : caches()) {
66 Key key = new Key(1);
76 for (LoadingCache<Key, Strin
185 static class Key { class in class:CacheReferencesTest
189 Key(int value) { method in class:CacheReferencesTest.Key
[all...]
/external/skia/src/gpu/
H A DGrTextStrike_impl.h14 class GrFontCache::Key { class in class:GrFontCache
16 Key(GrFontScaler* scaler) { function in class:GrFontCache::Key
22 static bool LT(const GrTextStrike& strike, const Key& key) {
25 static bool EQ(const GrTextStrike& strike, const Key& key) {
54 Key key(scaler);
76 * This Key just wraps a glyphID, and matches the protocol need for
79 class GrTextStrike::Key { class in class:GrTextStrike
81 Key(GrGlyph::PackedID id) : fPackedID(id) {} function in class:GrTextStrike::Key
85 static bool LT(const GrGlyph& glyph, const Key& key) {
88 static bool EQ(const GrGlyph& glyph, const Key
[all...]
/external/smali/baksmali/src/main/java/org/jf/baksmali/Adaptors/Format/
H A DSparseSwitchMethodItem.java58 sparseSwitchLabelTarget.Key = target.key;
71 sparseSwitchOffsetTarget.Key = target.key;
84 IntegerRenderer.writeTo(writer, target.Key);
95 public int Key; field in class:SparseSwitchMethodItem.SparseSwitchTarget
/external/openfst/src/include/fst/
H A Dgeneric-register.h43 typedef KeyType Key; typedef in class:fst::GenericRegister
141 // given RegisterType template parameter. This type must define types Key
148 typedef typename RegisterType::Key Key; typedef in class:fst::GenericRegisterer
151 GenericRegisterer(Key key, Entry entry) {
/external/v8/src/
H A Dscopeinfo.h83 struct Key { struct in class:v8::internal::ContextSlotCache
125 Key keys_[kLength];
H A Dsplay-tree.h40 // typedef Key: the key type
44 // int (Compare)(Key& a, Key& b) -> {-1, 0, 1}: comparison function
56 typedef typename Config::Key Key; typedef in class:v8::internal::SplayTree
72 bool Insert(const Key& key, Locator* locator);
77 bool Find(const Key& key, Locator* locator);
81 bool FindGreatestLessThan(const Key& key, Locator* locator);
88 bool FindLeastGreaterThan(const Key& key, Locator* locator);
94 bool Move(const Key
[all...]
/external/dropbear/libtomcrypt/
H A Dcrypt.tex408 \subsection{Key Scheduling}
458 \subsection{Key Sizing}
460 \index{Key Sizing}
543 \mysection{Key Sizes and Number of Rounds}
609 \hline \textbf{Name} & \textbf{Descriptor Name} & \textbf{Block Size} & \textbf{Key Range} & \textbf{Rounds} \\
2200 OMAC\footnote{\url{http://crypt.cis.ibaraki.ac.jp/omac/omac.html}}, which stands for \textit{One-Key CBC MAC} is an
2664 used to expand a shorter bit string into a longer bit string. PRNGs are used wherever random data is required such as Public Key (PK)
3054 \chapter{RSA Public Key Cryptography}
3057 RSA wrote the PKCS \#1 specifications which detail RSA Public Key Cryptography. In the specifications are
3222 \mysection{RSA Key Operation
[all...]
/external/llvm/lib/VMCore/
H A DDebugLoc.cpp153 unsigned DenseMapInfo<DebugLoc>::getHashValue(const DebugLoc &Key) { argument
154 return static_cast<unsigned>(hash_combine(Key.LineCol, Key.ScopeIdx));
/external/openssh/
H A Dkey.h36 typedef struct Key Key; typedef in typeref:struct:Key
73 Key *signature_key;
76 struct Key { struct
90 Key *key_new(int);
91 void key_add_private(Key *);
92 Key *key_new_private(int);
93 void key_free(Key *);
94 Key *key_demote(const Key *);
[all...]
/external/stlport/test/unit/
H A Dfind_test.cpp51 struct Key struct
90 Key keys[10] = { {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0} };
91 Key const* k = find(keys + 0, keys + 10, 5);
/external/webkit/Source/JavaScriptCore/runtime/
H A DStructureTransitionTable.h44 typedef std::pair<RefPtr<StringImpl>, unsigned> Key; typedef in struct:JSC::StructureTransitionTable::Hash
45 static unsigned hash(const Key& p)
50 static bool equal(const Key& a, const Key& b)
73 static void* finalizerContextFor(Hash::Key)
78 static inline Hash::Key keyForFinalizer(void* context, Structure* structure)
84 typedef WeakGCMap<Hash::Key, Structure, WeakGCMapFinalizerCallback, Hash, HashTraits> TransitionMap;
86 static Hash::Key keyForWeakGCMapFinalizer(void* context, Structure*);
/external/chromium/chrome/browser/resources/keyboard/
H A Dmain.js154 function Key(key, shift, num, symbol) { class
166 Key.prototype = {
224 * A Key that remains the same through all modes.
511 new Key(C('q'), C('Q'), C('1'), C('`')),
512 new Key(C('w'), C('W'), C('2'), C('~')),
513 new Key(C('e'), C('E'), C('3'), new Character('<', 'LessThan')),
514 new Key(C('r'), C('R'), C('4'), new Character('>', 'GreaterThan')),
515 new Key(C('t'), C('T'), C('5'), C('[')),
516 new Key(C('y'), C('Y'), C('6'), C(']')),
517 new Key(
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Collections/
H A DHashList.cs58 Key, enumerator in enum:Antlr.Runtime.Collections.HashList.HashListEnumerator.EnumerationMode
94 public object Key property in class:Antlr.Runtime.Collections.HashList.HashListEnumerator
154 if (_mode == EnumerationMode.Key)
273 return new HashListEnumerator(_hashList, HashListEnumerator.EnumerationMode.Key);
/external/clang/test/CodeGen/
H A D2008-03-24-BitField-And-Alloca.c63 } Key; typedef in typeref:union:_Key
65 static void foo(const Key iospec, int* ret)
86 __attribute__ ((unused)) Key iospec = (Key) key_token2;

Completed in 767 milliseconds

1234