Home
last modified time | relevance | path

Searched refs:IsMatch (Results 1 – 25 of 26) sorted by relevance

12

/external/rust/crates/libfuzzer-sys/libfuzzer/
DFuzzerCommand.h85 auto IsMatch = [&](const std::string &Other) { in hasFlag()
88 return std::any_of(Args.begin(), endMutableArgs(), IsMatch); in hasFlag()
96 auto IsMatch = [&](const std::string &Other) { in getFlagValue()
100 auto j = std::find_if(Args.begin(), i, IsMatch); in getFlagValue()
116 auto IsMatch = [&](const std::string &Other) { in removeFlag()
120 Args.erase(std::remove_if(Args.begin(), i, IsMatch), i); in removeFlag()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
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()
/external/cronet/net/base/
Dlookup_string_in_fixed_set.cc52 bool IsMatch(const unsigned char* offset, char key) { in IsMatch() function
99 bool is_match = IsMatch(pos_, input); in Advance()
128 bool is_match = IsMatch(offset, input); in Advance()
/external/brotli/c/enc/
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()
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()
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()
/external/cronet/third_party/brotli/enc/
Dstatic_dict.c42 static BROTLI_INLINE BROTLI_BOOL IsMatch(const BrotliDictionary* dictionary, in IsMatch() function
297 if (!IsMatch(dictionary->words, w, data, max_length)) { in BrotliFindAllStaticDictionaryMatchesFor()
353 if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) { in BrotliFindAllStaticDictionaryMatchesFor()
397 if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) { in BrotliFindAllStaticDictionaryMatchesFor()
447 IsMatch(dictionary->words, w, &data[2], max_length - 2)) { in BrotliFindAllStaticDictionaryMatchesFor()
476 IsMatch(dictionary->words, w, &data[5], max_length - 5)) { in BrotliFindAllStaticDictionaryMatchesFor()
Dcompress_fragment_two_pass.c57 static BROTLI_INLINE BROTLI_BOOL IsMatch(const uint8_t* p1, const uint8_t* p2, in IsMatch() function
298 if (IsMatch(ip, candidate, min_match)) { in CreateCommands()
309 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate, min_match))); in CreateCommands()
393 IsMatch(ip, candidate, min_match)) { in CreateCommands()
Dcompress_fragment.c56 static BROTLI_INLINE BROTLI_BOOL IsMatch(const uint8_t* p1, const uint8_t* p2) { in IsMatch() function
539 if (IsMatch(ip, candidate)) { in BrotliCompressFragmentFastImpl()
550 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate))); in BrotliCompressFragmentFastImpl()
629 while (IsMatch(ip, candidate)) { in BrotliCompressFragmentFastImpl()
/external/lzma/Asm/x86/
DLzmaDecOpt.asm445 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/webrtc/api/video_codecs/
Dh264_profile_level_id.cc48 bool IsMatch(uint8_t value) const { return masked_value_ == (value & mask_); } in IsMatch() function in webrtc::__anonc78913360111::BitPattern
153 pattern.profile_iop.IsMatch(profile_iop)) { in ParseH264ProfileLevelId()
/external/rust/crates/regex-automata/tests/
Dcollection.rs242 kind: RegexTestFailureKind::IsMatch, in test_is_match()
338 IsMatch, enumerator
394 RegexTestFailureKind::IsMatch => { in fmt()
/external/protobuf/src/google/protobuf/util/
Dmessage_differencer.h315 virtual bool IsMatch( in IsMatch() function
734 bool IsMatch(
841 bool IsMatch(const FieldDescriptor* repeated_field,
Dmessage_differencer.cc155 bool IsMatch(const Message& message1, const Message& message2, in IsMatch() function in google::protobuf::util::MessageDifferencer::MultipleFieldsMapKeyComparator
256 bool MessageDifferencer::MapEntryKeyComparator::IsMatch( in IsMatch() function in google::protobuf::util::MessageDifferencer::MapEntryKeyComparator
934 bool MessageDifferencer::IsMatch( in IsMatch() function in google::protobuf::util::MessageDifferencer
973 match = key_comparator->IsMatch(m1, m2, current_parent_fields); in IsMatch()
1824 return IsMatch(repeated_field, key_comparator, &message1, &message2, in MatchRepeatedFieldIndices()
1843 if (IsMatch(repeated_field, key_comparator, &message1, &message2, in MatchRepeatedFieldIndices()
1868 match = IsMatch(repeated_field, key_comparator, &message1, &message2, in MatchRepeatedFieldIndices()
1871 match = IsMatch(repeated_field, key_comparator, &message1, &message2, in MatchRepeatedFieldIndices()
/external/cronet/third_party/protobuf/src/google/protobuf/util/
Dmessage_differencer.h315 virtual bool IsMatch( in IsMatch() function
734 bool IsMatch(
841 bool IsMatch(const FieldDescriptor* repeated_field,
Dmessage_differencer.cc155 bool IsMatch(const Message& message1, const Message& message2, in IsMatch() function in google::protobuf::util::MessageDifferencer::MultipleFieldsMapKeyComparator
256 bool MessageDifferencer::MapEntryKeyComparator::IsMatch( in IsMatch() function in google::protobuf::util::MessageDifferencer::MapEntryKeyComparator
934 bool MessageDifferencer::IsMatch( in IsMatch() function in google::protobuf::util::MessageDifferencer
973 match = key_comparator->IsMatch(m1, m2, current_parent_fields); in IsMatch()
1824 return IsMatch(repeated_field, key_comparator, &message1, &message2, in MatchRepeatedFieldIndices()
1843 if (IsMatch(repeated_field, key_comparator, &message1, &message2, in MatchRepeatedFieldIndices()
1868 match = IsMatch(repeated_field, key_comparator, &message1, &message2, in MatchRepeatedFieldIndices()
1871 match = IsMatch(repeated_field, key_comparator, &message1, &message2, in MatchRepeatedFieldIndices()
Dmessage_differencer_unittest.cc1909 bool IsMatch(const Message& message1, const Message& message2, in IsMatch() function in google::protobuf::__anond5813e6d0111::ValueProductMapKeyComparator
1970 bool IsMatch(const Message& message1, const Message& message2, in IsMatch() function in google::protobuf::__anond5813e6d0111::OffsetByOneMapKeyComparator
3404 bool IsMatch(const Message& message1, const Message& message2, in IsMatch() function in google::protobuf::__anond5813e6d0111::LengthMapKeyComparator
/external/lzma/CPP/7zip/Bundles/LzmaSpec/
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()
/external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/
Ddfa.cc111 inline bool IsMatch() const { return (flag_ & kFlagMatch) != 0; } in IsMatch() function
1347 if (s->IsMatch()) { in InlinedSearchLoop()
1459 if (s->IsMatch()) { in InlinedSearchLoop()
1531 if (s->IsMatch()) { in InlinedSearchLoop()
1968 s == FullMatchState || s->IsMatch()); in BuildAllStates()
2058 if (ns != DeadState && (ns == FullMatchState || ns->IsMatch())) in PossibleMatchRange()
Dprog.cc196 static bool IsMatch(Prog* prog, Prog::Inst* ip) { in IsMatch() function
272 IsMatch(this, k)) { in Optimize()
276 if (IsMatch(this, j) && in Optimize()
/external/grpc-grpc/src/csharp/Grpc.Core/
DMetadata.cs362 GrpcPreconditions.CheckArgument(ValidKeyRegex.IsMatch(normalized), in NormalizeKey()
/external/lzma/C/
DLzmaDec.c137 #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/protobuf/csharp/src/Google.Protobuf/Reflection/
DDescriptorPool.cs198 if (!ValidationRegex.IsMatch(descriptor.Name)) in ValidateSymbolName()
/external/cronet/third_party/protobuf/csharp/src/Google.Protobuf/Reflection/
DDescriptorPool.cs198 if (!ValidationRegex.IsMatch(descriptor.Name)) in ValidateSymbolName()
/external/lzma/DOC/
Dlzma-specification.txt934 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,

12