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

12345678

/external/llvm/include/llvm/Support/
H A DTypeName.h32 StringRef Key = "DesiredTypeName = "; local
33 Name = Name.substr(Name.find(Key));
35 Name = Name.drop_front(Key.size());
42 StringRef Key = "getTypeName<";
43 Name = Name.substr(Name.find(Key));
45 Name = Name.drop_front(Key.size());
/external/llvm/lib/Support/
H A DOptions.cpp25 void OptionRegistry::addOption(void *Key, cl::Option *O) { argument
26 assert(Options.find(Key) == Options.end() &&
28 Options.insert(std::make_pair(Key, O));
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);
/external/swiftshader/third_party/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());
/external/llvm/include/llvm/ADT/
H A DStringSet.h32 std::pair<typename base::iterator, bool> insert(StringRef Key) { argument
33 assert(!Key.empty());
34 return base::insert(std::make_pair(Key, '\0'));
/external/llvm/lib/IR/
H A DMetadataImpl.h24 const typename InfoT::KeyTy &Key) {
25 auto I = Store.find_as(Key);
23 getUniqued(DenseSet<T *, InfoT> &Store, const typename InfoT::KeyTy &Key) argument
H A DProfileSummary.cpp27 // Return an MDTuple with two elements. The first element is a string Key and
29 static Metadata *getKeyValMD(LLVMContext &Context, const char *Key, argument
32 Metadata *Ops[2] = {MDString::get(Context, Key),
37 // Return an MDTuple with two elements. The first element is a string Key and
39 static Metadata *getKeyValMD(LLVMContext &Context, const char *Key, argument
41 Metadata *Ops[2] = {MDString::get(Context, Key), MDString::get(Context, Val)};
87 // Parse an MDTuple representing (Key, Val) pair.
88 static bool getVal(MDTuple *MD, const char *Key, uint64_t &Val) { argument
97 if (!KeyMD->getString().equals(Key))
103 // Check if an MDTuple represents a (Key, Va
104 isKeyValuePair(MDTuple *MD, const char *Key, const char *Val) argument
[all...]
/external/syslinux/gnu-efi/gnu-efi-3.0/lib/
H A Dconsole.c59 EFI_INPUT_KEY Key; local
71 Status = uefi_call_wrapper(ConIn->ReadKeyStroke, 2, ConIn, &Key);
77 if (Key.UnicodeChar == '\n' ||
78 Key.UnicodeChar == '\r') {
82 if (Key.UnicodeChar == '\b') {
90 if (Key.UnicodeChar >= ' ') {
92 InStr[Len] = Key.UnicodeChar;
/external/giflib/
H A Dgif_hash.c63 void _InsertHashTable(GifHashTableType *HashTable, uint32_t Key, int Code) argument
65 int HKey = KeyItem(Key);
79 HTable[HKey] = HT_PUT_KEY(Key) | HT_PUT_CODE(Code);
83 Routine to test if given Key exists in HashTable and if so returns its code *
86 int _ExistsHashTable(GifHashTableType *HashTable, uint32_t Key) argument
88 int HKey = KeyItem(Key);
100 if (Key == HTKey) return HT_GET_CODE(HTable[HKey]);
109 The given Key is assumed to be 20 bits as follows: lower 8 bits are the *
/external/glide/library/src/main/java/com/bumptech/glide/load/
H A DKey.java13 public interface Key { interface
/external/libchrome/base/posix/
H A Dglobal_descriptors.h39 typedef uint32_t Key; typedef in class:base::GlobalDescriptors
41 Descriptor(Key key, int fd);
42 Descriptor(Key key, int fd, base::MemoryMappedFile::Region region);
45 Key key;
53 // Often we want a canonical descriptor for a given Key. In this case, we add
72 int Get(Key key) const;
75 int MaybeGet(Key key) const;
78 base::MemoryMappedFile::Region GetRegion(Key key) const;
82 void Set(Key key, int fd);
85 void Set(Key ke
[all...]
/external/libcxx/test/std/containers/associative/map/
H A Dcompare.pass.cpp12 // template <class Key, class T, class Compare = less<Key>,
13 // class Allocator = allocator<pair<const Key, T>>>
23 struct Key { struct
24 template <typename T> Key(const T&) {} function in struct:Key
25 bool operator< (const Key&) const { return false; }
30 typedef std::map<Key, int> MapT;
36 m_contains[Key(0)] = 42;
38 Iter it = m_empty.find(Key(0));
40 it = m_contains.find(Key(
[all...]
/external/libcxx/test/std/containers/unord/unord.map/
H A Dcompare.pass.cpp12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
13 // class Alloc = allocator<pair<const Key, T>>>
22 struct Key { struct
23 template <typename T> Key(const T&) {} function in struct:Key
24 bool operator== (const Key&) const { return true; }
30 struct hash<Key>
32 size_t operator()(Key const &) const {return 0;}
39 typedef std::unordered_map<Key, in
[all...]
/external/llvm/include/llvm/MC/
H A DSubtargetFeature.h54 const char *Key; // K-V key string member in struct:llvm::SubtargetFeatureKV
61 return StringRef(Key) < S;
66 return StringRef(Key) < StringRef(Other.Key);
76 const char *Key; // K-V key string member in struct:llvm::SubtargetInfoKV
81 return StringRef(Key) < S;
/external/pdfium/xfa/fwl/
H A Dcfwl_message.h20 enum class Type { Key, KillFocus, Mouse, MouseWheel, SetFocus }; member in class:CFWL_Message::Type
/external/swiftshader/third_party/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/v8/src/
H A Dlookup-cache.h43 struct Key { struct in class:v8::internal::DescriptorLookupCache
48 Key keys_[kLength];
/external/clang/include/clang/Lex/
H A DHeaderMapTypes.h24 uint32_t Key; // Offset (into strings) of key. member in struct:clang::HMapBucket
/external/guava/guava-tests/test/com/google/common/cache/
H A DCacheReferencesTest.java39 private static final CacheLoader<Key,String> KEY_TO_STRING_LOADER =
40 new CacheLoader<Key, String>() {
41 @Override public String load(Key key) {
52 private Iterable<LoadingCache<Key, String>> caches() {
55 new Function<CacheBuilder<Object, Object>, LoadingCache<Key, String>>() {
56 @Override public LoadingCache<Key, String> apply(CacheBuilder<Object, Object> builder) {
63 for (LoadingCache<Key, String> cache : caches()) {
65 Key key = new Key(1);
75 for (LoadingCache<Key, Strin
156 static class Key { class in class:CacheReferencesTest
160 Key(int value) { method in class:CacheReferencesTest.Key
[all...]
/external/llvm/unittests/ADT/
H A DFoldingSet.cpp39 unsigned Key = 0; member in struct:__anon13571::TrivialPair
41 TrivialPair(unsigned K, unsigned V) : FoldingSetNode(), Key(K), Value(V) {}
44 ID.AddInteger(Key);
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/pool/
H A DTypeListPool.java37 import org.jf.dexlib2.writer.pool.TypeListPool.Key;
44 public class TypeListPool extends BaseNullableOffsetPool<Key<? extends Collection<? extends CharSequence>>>
45 implements TypeListSection<CharSequence, Key<? extends Collection<? extends CharSequence>>> {
54 Key<? extends Collection<? extends CharSequence>> key = new Key<Collection<? extends CharSequence>>(types);
65 public Collection<? extends CharSequence> getTypes(Key<? extends Collection<? extends CharSequence>> typesKey) {
72 @Override public int getNullableItemOffset(@Nullable Key<? extends Collection<? extends CharSequence>> key) {
80 public static class Key<TypeCollection extends Collection<? extends CharSequence>> class in class:TypeListPool
81 implements Comparable<Key<? extends Collection<? extends CharSequence>>> {
84 public Key( method in class:TypeListPool.Key
[all...]
/external/clang/lib/AST/
H A DItaniumCXXABI.cpp66 QualType Key = variable
69 Key = Context.getCanonicalType(Key);
70 return ++ManglingNumbers[Key->castAs<FunctionProtoType>()];
/external/clang/tools/diagtool/
H A DDiagnosticNames.cpp53 DiagnosticRecord Key = {nullptr, DiagID, 0}; local
58 Key, orderByID);
/external/eigen/demos/opengl/
H A Dicosphere.cpp63 typedef unsigned long long Key; typedef
64 std::map<Key,int> edgeMap;
81 Key edgeKey = Key(e0) | (Key(e1)<<32);
82 std::map<Key,int>::iterator it = edgeMap.find(edgeKey);
/external/libcxx/test/std/containers/
H A Dmap_allocator_requirement_test_templates.h36 typedef typename Container::key_type Key; typedef
164 typedef typename Container::key_type Key; typedef
166 typedef typename std::pair<Key, Mapped> NonConstKeyPair;
255 CHECKPOINT("Testing C::insert(p, pair<Key, Mapped> const&)");
272 CHECKPOINT("Testing C::insert(p, pair<Key, Mapped>&&)");
297 typedef typename Container::key_type Key; typedef
299 typedef typename std::pair<Key, Mapped> NonConstKeyPair;
357 CHECKPOINT("Testing C::emplace(pair<Key, Mapped> const&)");
370 CHECKPOINT("Testing C::emplace(pair<Key, Mapped> &&)");
383 CHECKPOINT("Testing C::emplace(const Key
445 typedef typename Container::key_type Key; typedef
[all...]

Completed in 752 milliseconds

12345678