/external/swiftshader/third_party/LLVM/lib/MC/MCDisassembler/ |
H A D | EDDisassembler.h | 135 CPUKey Key; member in struct:llvm::EDDisassembler
|
/external/swiftshader/third_party/LLVM/lib/VMCore/ |
H A D | DebugLoc.cpp | 175 unsigned DenseMapInfo<DebugLoc>::getHashValue(const DebugLoc &Key) { argument 177 ID.AddInteger(Key.LineCol); 178 ID.AddInteger(Key.ScopeIdx);
|
/external/v8/src/ |
H A D | address-map.h | 25 uintptr_t key = Key(value); 30 uintptr_t key = Key(value); 37 static uintptr_t Key(Type value) { function in class:v8::internal::PointerToIndexHashMap
|
H A D | effects.h | 186 typedef Var Key; typedef in struct:v8::internal::EffectsBase::SplayTreeConfig
|
/external/vulkan-validation-layers/demos/smoke/ |
H A D | Game.h | 56 enum Key { enum in class:Game 66 virtual void on_key(Key key) {}
|
/external/clang/lib/CodeGen/ |
H A D | CodeGenTypes.cpp | 120 const Type *Key = CGT.getContext().getTagDeclType(RD).getTypePtr(); local 123 if (CGT.isRecordLayoutComplete(Key)) return true; 126 if (CGT.isRecordBeingLaidOut(Key)) 661 const Type *Key = Context.getTagDeclType(RD).getTypePtr(); local 663 llvm::StructType *&Entry = RecordDeclTypes[Key]; 685 bool InsertResult = RecordsBeingLaidOut.insert(Key).second; 700 CGRecordLayouts[Key] = Layout; 703 bool EraseResult = RecordsBeingLaidOut.erase(Key); (void)EraseResult; 724 const Type *Key = Context.getTagDeclType(RD).getTypePtr(); local 726 const CGRecordLayout *Layout = CGRecordLayouts.lookup(Key); [all...] |
/external/clang/lib/Serialization/ |
H A D | MultiOnDiskHashTable.h | 145 const internal_key_type &Key = InfoObj.ReadKey(LocalPtr, L.first); local 146 data_type_builder ValueBuilder(Merged->Data[Key]); 147 InfoObj.ReadDataInto(Key, LocalPtr + L.first, L.second, 221 internal_key_type Key = Info::GetInternalKey(EKey); local 222 auto KeyHash = Info::ComputeHash(Key); 225 auto It = M->Data.find(Key); 234 auto It = HT.find_hashed(Key, KeyHash); 236 HT.getInfoObj().ReadDataInto(Key, It.getDataPtr(), It.getDataLen(), 265 const internal_key_type &Key = InfoObj.ReadKey(LocalPtr, L.first); local 266 InfoObj.ReadDataInto(Key, LocalPt 285 insert(typename WriterInfo::key_type_ref Key, typename WriterInfo::data_type_ref Data, WriterInfo &Info) argument [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
H A D | ICUService.java | 61 * fallback. The Key defines the canonical form of the id, and 64 * use. The Key can cache the results of this parsing to save 90 * ICUService by overriding it, for example, to customize the Key and 151 * <p> The default implementation of Key has no fallbacks and 154 public static class Key { class in class:ICUService 160 public Key(String id) { method in class:ICUService.Key 233 * the service's getKey(Key, String[], Factory) method 240 public Object create(Key key, ICUService service); 303 public Object create(Key key, ICUService service) { 356 * Convenience override for get(Key, Strin [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | ICUService.java | 60 * fallback. The Key defines the canonical form of the id, and 63 * use. The Key can cache the results of this parsing to save 89 * ICUService by overriding it, for example, to customize the Key and 149 * <p> The default implementation of Key has no fallbacks and 152 public static class Key { class in class:ICUService 158 public Key(String id) { method in class:ICUService.Key 231 * the service's getKey(Key, String[], Factory) method 238 public Object create(Key key, ICUService service); 301 public Object create(Key key, ICUService service) { 354 * Convenience override for get(Key, Strin [all...] |
/external/llvm/lib/IR/ |
H A D | Module.cpp | 314 MDString *Key = cast<MDString>(Flag->getOperand(1)); local 316 Flags.push_back(ModuleFlagEntry(MFB, Key, Val)); 321 /// Return the corresponding value if Key appears in module flags, otherwise 323 Metadata *Module::getModuleFlag(StringRef Key) const { 327 if (Key == MFE.Key->getString()) 350 void Module::addModuleFlag(ModFlagBehavior Behavior, StringRef Key, argument 355 MDString::get(Context, Key), Val}; 358 void Module::addModuleFlag(ModFlagBehavior Behavior, StringRef Key, argument 360 addModuleFlag(Behavior, Key, ConstantAsMetadat 362 addModuleFlag(ModFlagBehavior Behavior, StringRef Key, uint32_t Val) argument [all...] |
H A D | ConstantsContext.h | 547 /// Key and hash together, so that we compute the hash only once and reuse it. 611 LookupKey Key(Ty, V); 613 LookupKeyHashed Lookup(MapInfo::getHashValue(Key), Key); local 639 LookupKey Key(CP->getType(), ValType(Operands, CP)); 641 LookupKeyHashed Lookup(MapInfo::getHashValue(Key), Key); local
|
/external/spirv-llvm/lib/SPIRV/libSPIRV/ |
H A D | SPIRVUtil.h | 89 static Ty2 map(Ty1 Key) { argument 91 bool Found = find(Key, &Val); 97 static Ty1 rmap(Ty2 Key) { argument 99 bool Found = rfind(Key, &Val); 135 static bool find(Ty1 Key, Ty2 *Val = nullptr) { argument 137 typename MapTy::const_iterator Loc = Map.Map.find(Key); 145 static bool rfind(Ty2 Key, Ty1 *Val = nullptr) { argument 147 typename RevMapTy::const_iterator Loc = Map.RevMap.find(Key); 205 VT map(KT Key) { argument 206 return SPIRVMap<KT, VT>::map(Key); 272 getName(K Key) argument 280 getByName(const std::string &Name, K &Key) argument 432 getOrInsert( MapTy &Map, typename MapTy::key_type Key, FuncTy Func) argument [all...] |
/external/swiftshader/third_party/LLVM/utils/TableGen/ |
H A D | CodeGenRegisters.h | 191 struct Key { struct in class:llvm::CodeGenRegisterClass 196 Key(const Key &O) function in struct:llvm::CodeGenRegisterClass::Key 201 Key(const CodeGenRegister::Set *M, unsigned S = 0, unsigned A = 0) function in struct:llvm::CodeGenRegisterClass::Key 204 Key(const CodeGenRegisterClass &RC) function in struct:llvm::CodeGenRegisterClass::Key 210 bool operator<(const Key&) const; 214 CodeGenRegisterClass(StringRef Name, Key Props); 234 typedef std::map<CodeGenRegisterClass::Key, CodeGenRegisterClass*> RCKeyMap;
|
/external/v8/src/base/ |
H A D | hashmap.h | 27 template <typename Key, typename Value, class MatchFun, class AllocationPolicy> 30 typedef TemplateHashMapEntry<Key, Value> Entry; 47 Entry* Lookup(const Key& key, uint32_t hash) const; 52 Entry* LookupOrInsert(const Key& key, uint32_t hash, 59 Entry* LookupOrInsert(const Key& key, uint32_t hash, const Func& value_func, 62 Entry* InsertNew(const Key& key, uint32_t hash, 68 Value Remove(const Key& key, uint32_t hash); 101 Entry* Probe(const Key& key, uint32_t hash) const; 102 Entry* FillEmptyEntry(Entry* entry, const Key& key, const Value& value, 108 template <typename Key, typenam 267 DCHECK(i < capacity_); DCHECK(occupancy_ < capacity_); while (map_[i].exists() && !match_(hash, map_[i].hash, key, map_[i].key)) { i = (i + 1) & (capacity_ - 1); } return &map_[i]; } template <typename Key, typename Value, typename MatchFun, class AllocationPolicy> typename TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Entry* TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::FillEmptyEntry( Entry* entry, const Key& key, const Value& value, uint32_t hash, AllocationPolicy allocator) { DCHECK(!entry->exists()); new (entry) Entry(key, value, hash); occupancy_++; if (occupancy_ + occupancy_ / 4 >= capacity_) argument [all...] |
/external/guice/extensions/multibindings/src/com/google/inject/multibindings/ |
H A D | MapBinder.java | 42 import com.google.inject.Key; 146 return newRealMapBinder(binder, keyType, valueType, Key.get(mapOf(keyType, valueType)), 167 Key.get(mapOf(keyType, valueType), annotation), 188 Key.get(mapOf(keyType, valueType), annotationType), 242 Key<V> valueTypeAndAnnotation) { 252 TypeLiteral<K> keyType, TypeLiteral<V> valueType, Key<Map<K, V>> mapKey, 317 private final Key<Map<K, V>> mapKey; 318 private final Key<Map<K, javax.inject.Provider<V>>> javaxProviderMapKey; 319 private final Key<Map<K, Provider<V>>> providerMapKey; 320 private final Key<Ma 623 MultimapBinder( Key<Map<K, Set<V>>> multimapKey, Key<Map<K, Set<Provider<V>>>> providerMultimapKey, Key<Set<Entry<K,Provider<V>>>> entrySetKey) argument [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | StringMap.h | 77 unsigned LookupBucketFor(StringRef Key); 82 int FindKey(StringRef Key) const; 90 StringMapEntryBase *RemoveKey(StringRef Key); 152 static StringMapEntry *Create(StringRef Key, AllocatorTy &Allocator, argument 154 unsigned KeyLength = Key.size(); 171 memcpy(StrBuffer, Key.data(), KeyLength); 178 static StringMapEntry *Create(StringRef Key, InitType &&... InitVal) { argument 180 return Create(Key, A, std::forward<InitType>(InitVal)...); 183 static StringMapEntry *Create(StringRef Key) { argument 184 return Create(Key, ValueT 309 find(StringRef Key) argument 332 operator [](StringRef Key) argument 373 emplace_second(StringRef Key, ArgsTy &&... Args) argument 420 erase(StringRef Key) argument [all...] |
/external/llvm/include/llvm/IR/ |
H A D | ValueMap.h | 199 value_type& FindAndConstruct(const KeyT &Key) { argument 200 return Map.FindAndConstruct(Wrap(Key)); 203 ValueT &operator[](const KeyT &Key) { argument 204 return Map[Wrap(Key)]; 245 ValueMapCallbackVH(KeyT Key, ValueMapT *Map) argument 246 : CallbackVH(const_cast<Value*>(static_cast<const Value*>(Key))),
|
/external/llvm/include/llvm/Support/ |
H A D | OnDiskHashTable.h | 45 /// /// Calculate the hash for Key 46 /// static hash_value_type ComputeHash(key_type_ref Key); 47 /// /// Return the lengths, in bytes, of the given Key/Data pair. 49 /// EmitKeyDataLength(raw_ostream &Out, key_type_ref Key, data_type_ref Data); 50 /// /// Write Key to Out. KeyLen is the length from EmitKeyDataLength. 51 /// static void EmitKey(raw_ostream &Out, key_type_ref Key, 54 /// static void EmitData(raw_ostream &Out, key_type_ref Key, 64 typename Info::key_type Key; member in class:llvm::OnDiskChainedHashTableGenerator::Item 69 Item(typename Info::key_type_ref Key, typename Info::data_type_ref Data, argument 71 : Key(Ke 116 insert(typename Info::key_type_ref Key, typename Info::data_type_ref Data) argument 125 insert(typename Info::key_type_ref Key, typename Info::data_type_ref Data, Info &InfoObj) argument 134 contains(typename Info::key_type_ref Key, Info &InfoObj) argument 322 internal_key_type Key; member in class:llvm::OnDiskChainedHashTable::iterator 575 const internal_key_type &Key = InfoObj->ReadKey(LocalPtr, L.first); local [all...] |
H A D | YAMLParser.h | 268 : Node(NK_KeyValue, D, StringRef(), StringRef()), Key(nullptr), 296 Node *Key; member in class:llvm::yaml::final
|
/external/llvm/lib/CodeGen/ |
H A D | TargetLoweringObjectFileImpl.cpp | 482 StringRef Key = MFE.Key->getString(); local 485 if (Key == "Objective-C Image Info Version") { 487 } else if (Key == "Objective-C Garbage Collection" || 488 Key == "Objective-C GC Only" || 489 Key == "Objective-C Is Simulated" || 490 Key == "Objective-C Class Properties" || 491 Key == "Objective-C Image Swift Version") { 493 } else if (Key == "Objective-C Image Info Section") { 495 } else if (Key 1033 StringRef Key = MFE.Key->getString(); local [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | SeparateConstOffsetFromGEP.cpp | 397 /// Find the closest dominator of <Dominatee> that is equivalent to <Key>. 398 Instruction *findClosestMatchingDominator(const SCEV *Key, 1095 const SCEV *Key, Instruction *Dominatee) { 1096 auto Pos = DominatingExprs.find(Key); 1126 const SCEV *Key = local 1128 if (auto *Dom = findClosestMatchingDominator(Key, I)) { 1142 const SCEV *Key = local 1144 DominatingExprs[Key].push_back(I); 1094 findClosestMatchingDominator( const SCEV *Key, Instruction *Dominatee) argument
|
/external/llvm/unittests/ProfileData/ |
H A D | InstrProfTest.cpp | 916 uint64_t Key = IndexedInstrProf::ComputeHash(PGOName); local 918 ProfSymtab.getFuncName(Key)); 919 ASSERT_EQ(StringRef(Funcs[I]), ProfSymtab.getOrigFuncName(Key));
|
/external/protobuf/csharp/src/Google.Protobuf/Collections/ |
H A D | MapField.cs | 47 /// <typeparam name="TKey">Key type in the map. Must be a type supported by Protocol Buffer map keys.</typeparam> 90 clone.Add(pair.Key, ((IDeepCloneable<TValue>)pair.Value).Clone()); 115 throw new ArgumentException("Key already exists in map", "key"); 225 public ICollection<TKey> Keys { get { return new MapView<TKey>(this, pair => pair.Key, ContainsKey); } } 241 Add(pair.Key, pair.Value); 273 Add(item.Key, item.Value); 293 return TryGetValue(item.Key, out value) 315 if (item.Key == null) 317 throw new ArgumentException("Key is null", "item"); 320 if (map.TryGetValue(item.Key, ou 572 public object Key { get { return enumerator.Current.Key; } } property in class:Google.Protobuf.Collections.MapField.DictionaryEnumerator 617 internal TKey Key { get; set; } property in class:Google.Protobuf.Collections.MapField.Codec.MessageAdapter [all...] |
/external/skia/src/gpu/text/ |
H A D | GrStencilAndCoverTextContext.cpp | 30 template<typename Key, typename Val> static void delete_hash_map_entry(const Key&, Val* val) { argument 403 // Key should be valid since we opted out of drawing arbitrary path effects.
|
/external/skia/tools/viewer/sk_app/ |
H A D | Window.h | 61 enum class Key { class in class:sk_app::Window 115 static const int kKeyCount = static_cast<int>(Key::kLast) + 1; 134 typedef bool(*OnKeyFunc)(Key key, InputState state, uint32_t modifiers, void* userData); 184 bool onKey(Key key, InputState state, uint32_t modifiers);
|