Home
last modified time | relevance | path

Searched refs:IsMatch (Results 1 - 25 of 29) sorted by relevance

12

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGAddressAnalysis.cpp49 bool IsMatch = in equalBaseIndex() local
51 if (IsMatch) { in equalBaseIndex()
53 IsMatch = A->getMachineCPVal() == B->getMachineCPVal(); in equalBaseIndex()
55 IsMatch = A->getConstVal() == B->getConstVal(); in equalBaseIndex()
57 if (IsMatch) { in equalBaseIndex()
/third_party/lzma/Asm/arm64/
H A DLzmaDecOpt.S583 add probs, probs_IsMatch, ((\offset) - IsMatch) * PMULT
640 .equ IsMatch , (LenCoder + kNumLenProbs)
641 .equ kAlign , (IsMatch + (kNumStates2 << kNumPosBitsMax))
650 .if kStartOffset != 0 // && IsMatch != 0
686 # prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
695 IF_BIT_1 probs_state, pbPos_R, (IsMatch - IsMatch), IsMatch_label
784 add_big probs_IsMatch, probs_Spec, ((IsMatch - SpecPos) << PSHIFT)
843 IF_BIT_0_NOUP probs_state, pbPos_R, (IsMatch - IsMatch), lit_star
[all...]
/third_party/node/deps/v8/src/objects/
H A Dcompilation-cache-table.h22 static inline bool IsMatch(HashTableKey* key, Object value) { in IsMatch() function in v8::internal::CompilationCacheShape
23 return key->IsMatch(value); in IsMatch()
H A Dhash-table.h43 // static bool IsMatch(Key key, Object other);
55 // // Indicates whether IsMatch can deal with other being the_hole (a
297 virtual bool IsMatch(Object other) = 0;
316 static inline bool IsMatch(Handle<Object> key, Object other);
443 static inline bool IsMatch(Handle<Name> key, Object other);
484 static inline bool IsMatch(Handle<String> key, Object other);
H A Dhash-table-inl.h179 if (Shape::IsMatch(key, element)) return entry; in FindEntry()
275 bool ObjectHashTableShape::IsMatch(Handle<Object> key, Object other) { in IsMatch() function in v8::internal::ObjectHashTableShape
279 bool RegisteredSymbolTableShape::IsMatch(Handle<String> key, Object value) { in IsMatch() function in v8::internal::RegisteredSymbolTableShape
294 bool NameToIndexShape::IsMatch(Handle<Name> key, Object other) { in IsMatch() function in v8::internal::NameToIndexShape
H A Dstring-set-inl.h23 bool StringSetShape::IsMatch(String key, Object value) { in IsMatch() function in v8::internal::StringSetShape
H A Dstring-set.h18 static inline bool IsMatch(String key, Object value);
H A Ddictionary.h120 static inline bool IsMatch(Handle<Name> key, Object other);
209 static inline bool IsMatch(Handle<Name> key, Object other);
256 static inline bool IsMatch(uint32_t key, Object other);
H A Dcompilation-cache-table.cc162 bool IsMatch(Object other) override {
220 // stored value is stored where the key should be. IsMatch then
223 bool IsMatch(Object obj) override {
240 bool IsMatch(Object string) override { return *key_ == string; }
359 // to the stored value with a custom IsMatch function during lookups. in PutRegExp()
H A Ddictionary-inl.h261 bool NumberDictionaryBaseShape::IsMatch(uint32_t key, Object other) { in IsMatch() function in v8::internal::NumberDictionaryBaseShape
295 bool NameDictionaryShape::IsMatch(Handle<Name> key, Object other) { in IsMatch() function in v8::internal::NameDictionaryShape
311 bool GlobalDictionaryShape::IsMatch(Handle<Name> key, Object other) { in IsMatch() function in v8::internal::GlobalDictionaryShape
H A Dstring-table.cc76 return key->IsMatch(isolate, string); in KeyIsMatch()
359 bool IsMatch(Isolate* isolate, String string) { in IsMatch() function in v8::internal::final
/third_party/lzma/CPP/7zip/Bundles/LzmaSpec/
H A DLzmaSpec.cpp435 CProb IsMatch[kNumStates << kNumPosBitsMax]; member in CLzmaDecoder
450 INIT_PROBS(IsMatch); in Init()
485 if (RangeDec.DecodeBit(&IsMatch[(state << kNumPosBitsMax) + posState]) == 0) in Decode()
/third_party/node/deps/brotli/c/enc/
H A Dstatic_dict.c42 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()
H A Dcompress_fragment.c58 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()
H A Dcompress_fragment_two_pass.c58 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()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dstatic_dict.c42 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()
H A Dcompress_fragment.c58 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()
H A Dcompress_fragment_two_pass.c58 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()
/third_party/protobuf/src/google/protobuf/util/
H A Dmessage_differencer.h318 virtual bool IsMatch( in IsMatch() function in google::protobuf::util::MessageDifferencer::MapKeyComparator
321 GOOGLE_CHECK(false) << "IsMatch() is not implemented."; in IsMatch()
497 // will invoke the IsMatch method of the given 'key_comparator' to decide if
711 bool IsMatch(
798 bool IsMatch(const FieldDescriptor* repeated_field,
H A Dmessage_differencer.cc125 bool IsMatch(const Message& message1, const Message& message2,
207 bool MessageDifferencer::MapEntryKeyComparator::IsMatch( in IsMatch() function in google::protobuf::util::MessageDifferencer::MapEntryKeyComparator
876 bool MessageDifferencer::IsMatch( in IsMatch() function in google::protobuf::util::MessageDifferencer
911 match = key_comparator->IsMatch(m1, m2, current_parent_fields); in IsMatch()
1615 return IsMatch(repeated_field, key_comparator, &message1, &message2, in MatchRepeatedFieldIndices()
1634 if (IsMatch(repeated_field, key_comparator, &message1, &message2, in MatchRepeatedFieldIndices()
1659 match = IsMatch(repeated_field, key_comparator, &message1, &message2, in MatchRepeatedFieldIndices()
1662 match = IsMatch(repeated_field, key_comparator, &message1, &message2, in MatchRepeatedFieldIndices()
/third_party/lzma/Asm/x86/
H A DLzmaDecOpt.asm446 UPDATE_0 probs_state_R, 0, IsMatch
488 IsMatch equ (LenCoder + kNumLenProbs) define
489 kAlign equ (IsMatch + (kNumStates2 SHL kNumPosBitsMax))
583 ; prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
593 IF_BIT_1 probs_state_R, pbPos_R, IsMatch, IsMatch_label
747 IF_BIT_0_NOUP probs_state_R, pbPos_R, IsMatch, lit_start
754 UPDATE_1 probs_state_R, pbPos_R, IsMatch
1010 IF_BIT_1_NOUP probs_state_R, pbPos_R, IsMatch, IsMatch_label
1077 IF_BIT_1_NOUP probs_state_R, pbPos_R, IsMatch, IsMatch_label
/third_party/lzma/C/
H A DLzmaDec.c143 #define IsMatch (LenCoder + kNumLenProbs) macro
144 #define Align (IsMatch + (kNumStates2 << kNumPosBitsMax))
262 prob = probs + IsMatch + COMBINED_PS_STATE; in LZMA_DECODE_REAL()
731 prob = probs + IsMatch + COMBINED_PS_STATE; in LzmaDec_TryDummy()
/third_party/protobuf/csharp/src/Google.Protobuf/Reflection/
H A DDescriptorPool.cs198 if (!ValidationRegex.IsMatch(descriptor.Name)) in ValidateSymbolName()
/third_party/libphonenumber/cpp/src/phonenumbers/
H A Dphonenumberutil.cc511 bool IsMatch(const MatcherApi& matcher_api, in IsMatch() function
2544 return IsMatch(*matcher_api_, national_number, number_desc); in IsNumberMatchingDesc()
2869 IsMatch(*matcher_api_, *number, general_desc); in MaybeStripNationalPrefixAndCarrierCode()
2888 !IsMatch(*matcher_api_, number_string_copy, general_desc)) { in MaybeStripNationalPrefixAndCarrierCode()
2906 !IsMatch(*matcher_api_, number_copy_as_string, general_desc)) { in MaybeStripNationalPrefixAndCarrierCode()
3066 if ((!IsMatch(*matcher_api_, *national_number, general_num_desc) && in MaybeExtractCountryCode()
3067 IsMatch( in MaybeExtractCountryCode()
/third_party/node/deps/v8/src/snapshot/
H A Ddeserializer.h287 bool IsMatch(IsolateT* isolate, String string);

Completed in 29 milliseconds

12