| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/ |
| D | SelectionDAGAddressAnalysis.cpp | 46 bool IsMatch = in equalBaseIndex() local
48 if (IsMatch) { in equalBaseIndex()
50 IsMatch = A->getMachineCPVal() == B->getMachineCPVal(); in equalBaseIndex()
52 IsMatch = A->getConstVal() == B->getConstVal(); in equalBaseIndex()
54 if (IsMatch) { in equalBaseIndex()
|
| /external/v8/src/objects/ |
| D | string-table.h | 35 static inline bool IsMatch(Key key, Object* value) { in IsMatch() function
36 return key->IsMatch(value); in IsMatch()
97 static inline bool IsMatch(String* key, Object* value);
|
| D | compilation-cache.h | 19 static inline bool IsMatch(HashTableKey* key, Object* value) { in IsMatch() function
20 return key->IsMatch(value); in IsMatch()
|
| D | dictionary.h | 112 static inline bool IsMatch(Handle<Name> key, Object* other);
204 static inline bool IsMatch(Handle<Name> key, Object* other);
237 static inline bool IsMatch(uint32_t key, Object* other);
|
| D | hash-table.h | 244 virtual bool IsMatch(Object* other) = 0;
263 static inline bool IsMatch(Handle<Object> key, Object* other);
|
| D | string-inl.h | 213 bool IsMatch(Object* string) override { in IsMatch() function
245 bool IsMatch(Object* string) override;
259 bool IsMatch(Object* string) override { in IsMatch() function
273 bool IsMatch(Object* string) override { in IsMatch() function
|
| D | hash-table-inl.h | 91 if (Shape::IsMatch(key, element)) return entry; in FindEntry()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/utils/TableGen/ |
| D | X86EVEX2VEXTablesEmitter.cpp | 103 class IsMatch { class
107 IsMatch(const CodeGenInstruction *EVEXInst) : EVEXInst(EVEXInst) {} in IsMatch() function in __anon2d08d34d0111::IsMatch
230 auto Match = llvm::find_if(VEXInsts[Opcode], IsMatch(EVEXInst)); in run()
|
| D | X86FoldTablesEmitter.cpp | 43 class IsMatch;
309 class IsMatch { class
313 IsMatch(const CodeGenInstruction *Inst, const RecordKeeper &Records) in IsMatch() function in __anon67ff85150111::IsMatch
616 auto Match = find_if(OpcRegInsts, IsMatch(MemInst, Records)); in run()
|
| /external/brotli/c/enc/ |
| D | static_dict.c | 42 static BROTLI_INLINE BROTLI_BOOL IsMatch(const BrotliDictionary* dictionary, in IsMatch() function
282 if (!IsMatch(dictionary->words, w, data, max_length)) { in BrotliFindAllStaticDictionaryMatches()
338 if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) { in BrotliFindAllStaticDictionaryMatches()
382 if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) { in BrotliFindAllStaticDictionaryMatches()
432 IsMatch(dictionary->words, w, &data[2], max_length - 2)) { in BrotliFindAllStaticDictionaryMatches()
461 IsMatch(dictionary->words, w, &data[5], max_length - 5)) { in BrotliFindAllStaticDictionaryMatches()
|
| D | compress_fragment_two_pass.c | 58 static BROTLI_INLINE BROTLI_BOOL IsMatch(const uint8_t* p1, const uint8_t* p2, in IsMatch() function
299 if (IsMatch(ip, candidate, min_match)) { in CreateCommands()
310 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate, min_match))); in CreateCommands()
386 IsMatch(ip, candidate, min_match)) { in CreateCommands()
|
| D | compress_fragment.c | 58 static BROTLI_INLINE BROTLI_BOOL IsMatch(const uint8_t* p1, const uint8_t* p2) { in IsMatch() function
537 if (IsMatch(ip, candidate)) { in BrotliCompressFragmentFastImpl()
548 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate))); in BrotliCompressFragmentFastImpl()
619 while (IsMatch(ip, candidate)) { in BrotliCompressFragmentFastImpl()
|
| /external/lzma/Asm/x86/ |
| D | LzmaDecOpt.asm | 445 UPDATE_0 probs_state_R, 0, IsMatch
487 IsMatch equ (LenCoder + kNumLenProbs) define
488 kAlign equ (IsMatch + (kNumStates2 SHL kNumPosBitsMax))
582 ; prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
592 IF_BIT_1 probs_state_R, pbPos_R, IsMatch, IsMatch_label
746 IF_BIT_0_NOUP probs_state_R, pbPos_R, IsMatch, lit_start
753 UPDATE_1 probs_state_R, pbPos_R, IsMatch
1007 IF_BIT_1_NOUP probs_state_R, pbPos_R, IsMatch, IsMatch_label
1074 IF_BIT_1_NOUP probs_state_R, pbPos_R, IsMatch, IsMatch_label
|
| /external/lzma/CPP/7zip/Bundles/LzmaSpec/ |
| D | LzmaSpec.cpp | 435 CProb IsMatch[kNumStates << kNumPosBitsMax]; member in CLzmaDecoder
450 INIT_PROBS(IsMatch); in Init()
485 if (RangeDec.DecodeBit(&IsMatch[(state << kNumPosBitsMax) + posState]) == 0) in Decode()
|
| /external/toolchain-utils/automation/server/ |
| D | machine_manager.py | 33 available_pool = [m for m in self._machine_pool if mach_spec.IsMatch(m)]
|
| /external/toolchain-utils/automation/common/ |
| D | machine.py | 63 def IsMatch(self, machine): member in MachineSpecification
|
| /external/protobuf/src/google/protobuf/util/ |
| D | message_differencer.h | 299 virtual bool IsMatch(const Message& message1, in IsMatch() function
730 bool IsMatch(const FieldDescriptor* repeated_field,
|
| D | message_differencer.cc | 92 virtual bool IsMatch( in IsMatch() function in google::protobuf::util::MessageDifferencer::MultipleFieldsMapKeyComparator
744 bool MessageDifferencer::IsMatch(const FieldDescriptor* repeated_field, in IsMatch() function in google::protobuf::util::MessageDifferencer
778 match = key_comparator->IsMatch(m1, m2, current_parent_fields); in IsMatch()
1391 this, &MessageDifferencer::IsMatch, in MatchRepeatedFieldIndices()
1415 match = IsMatch(repeated_field, key_comparator, in MatchRepeatedFieldIndices()
|
| /external/u-boot/lib/lzma/ |
| D | LzmaDec.c | 97 #define IsMatch 0 macro
98 #define IsRep (IsMatch + (kNumStates << kNumPosBitsMax))
165 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState; in LzmaDec_DecodeReal()
528 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState; in LzmaDec_TryDummy()
|
| /external/v8/src/snapshot/ |
| D | deserializer.h | 180 bool IsMatch(Object* string) override;
|
| /external/lzma/C/ |
| D | LzmaDec.c | 137 #define IsMatch (LenCoder + kNumLenProbs) macro
138 #define Align (IsMatch + (kNumStates2 << kNumPosBitsMax))
246 prob = probs + IsMatch + COMBINED_PS_STATE; in LZMA_DECODE_REAL()
675 prob = probs + IsMatch + COMBINED_PS_STATE; in LzmaDec_TryDummy()
|
| /external/grpc-grpc/src/csharp/Grpc.Core/ |
| D | Metadata.cs | 362 GrpcPreconditions.CheckArgument(ValidKeyRegex.IsMatch(normalized), in NormalizeKey()
|
| /external/protobuf/csharp/src/Google.Protobuf/Reflection/ |
| D | DescriptorPool.cs | 198 if (!ValidationRegex.IsMatch(descriptor.Name)) in ValidateSymbolName()
|
| /external/v8/src/ast/ |
| D | ast-value-factory.cc | 62 bool IsMatch(Object* other) override { in IsMatch() function in v8::internal::AstRawStringInternalizationKey
|
| /external/lzma/DOC/ |
| D | lzma-specification.txt | 934 CProb IsMatch[kNumStates << kNumPosBitsMax];
962 "IsMatch" and "IsRep0Long" arrays:
970 IsMatch[state2] decode
992 If the value "0" was decoded with IsMatch[state2] decoding, we have "LITERAL" type.
1015 If the value "1" was decoded with IsMatch[state2] decoding,
|