HomeSort by relevance Sort by last modified time
    Searched defs:IsMatch (Results 1 - 25 of 25) sorted by null

  /external/toolchain-utils/automation/common/
machine.py 63 def IsMatch(self, machine):
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGAddressAnalysis.cpp 46 bool IsMatch =
48 if (IsMatch) {
50 IsMatch = A->getMachineCPVal() == B->getMachineCPVal();
52 IsMatch = A->getConstVal() == B->getConstVal();
54 if (IsMatch) {
  /external/v8/src/objects/
compilation-cache.h 19 static inline bool IsMatch(HashTableKey* key, Object* value) {
20 return key->IsMatch(value);
string-table.h 35 static inline bool IsMatch(Key key, Object* value) {
36 return key->IsMatch(value);
97 static inline bool IsMatch(String* key, Object* value);
  /external/brotli/c/enc/
static_dict.c 42 static BROTLI_INLINE BROTLI_BOOL IsMatch(const BrotliDictionary* dictionary,
282 if (!IsMatch(dictionary->words, w, data, max_length)) {
338 if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) {
382 if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) {
432 IsMatch(dictionary->words, w, &data[2], max_length - 2)) {
461 IsMatch(dictionary->words, w, &data[5], max_length - 5)) {
compress_fragment_two_pass.c 58 static BROTLI_INLINE BROTLI_BOOL IsMatch(const uint8_t* p1, const uint8_t* p2,
299 if (IsMatch(ip, candidate, min_match)) {
310 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate, min_match)));
386 IsMatch(ip, candidate, min_match)) {
compress_fragment.c 58 static BROTLI_INLINE BROTLI_BOOL IsMatch(const uint8_t* p1, const uint8_t* p2) {
537 if (IsMatch(ip, candidate)) {
548 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate)));
619 while (IsMatch(ip, candidate)) {
  /external/swiftshader/third_party/llvm-7.0/llvm/utils/TableGen/
X86EVEX2VEXTablesEmitter.cpp 103 class IsMatch {
107 IsMatch(const CodeGenInstruction *EVEXInst) : EVEXInst(EVEXInst) {}
220 // (instructions with the same opcode) using function object IsMatch.
230 auto Match = llvm::find_if(VEXInsts[Opcode], IsMatch(EVEXInst));
  /external/protobuf/src/google/protobuf/util/
message_differencer.h 299 virtual bool IsMatch(const Message& message1,
302 GOOGLE_CHECK(false) << "IsMatch() is not implemented.";
466 // will invoke the IsMatch method of the given 'key_comparator' to decide if
    [all...]
message_differencer_unittest.cc     [all...]
message_differencer.cc 92 virtual bool IsMatch(
744 bool MessageDifferencer::IsMatch(const FieldDescriptor* repeated_field,
778 match = key_comparator->IsMatch(m1, m2, current_parent_fields);
    [all...]
  /device/linaro/bootloader/edk2/NetworkPkg/IpSecDxe/Ikev2/
Utility.c     [all...]
  /device/linaro/bootloader/edk2/NetworkPkg/IpSecDxe/
IpSecImpl.c 164 BOOLEAN IsMatch;
166 IsMatch = FALSE;
196 IsMatch = TRUE;
209 IsMatch = TRUE;
213 return IsMatch;
243 BOOLEAN IsMatch;
249 IsMatch = FALSE;
260 IsMatch = (BOOLEAN) (SpdLocalPort == 0 && SpdRemotePort == 0);
261 IsMatch = (BOOLEAN) (IsMatch ||
    [all...]
IpSecConfigImpl.c 186 BOOLEAN IsMatch;
191 IsMatch = TRUE;
209 IsMatch = FALSE;
210 return IsMatch;
225 IsMatch = FALSE;
229 if (IsMatch) {
236 IsMatch = FALSE;
241 if (IsMatch) {
248 IsMatch = FALSE;
253 if (IsMatch) {
    [all...]
  /external/v8/src/snapshot/
deserializer.cc 124 bool StringTableInsertionKey::IsMatch(Object* string) {
    [all...]
  /device/linaro/bootloader/edk2/BaseTools/Source/C/LzmaCompress/Sdk/C/
LzmaDec.c 103 #define IsMatch 0
104 #define IsRep (IsMatch + (kNumStates << kNumPosBitsMax))
169 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
593 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
  /device/linaro/bootloader/edk2/IntelFrameworkModulePkg/Library/LzmaCustomDecompressLib/Sdk/C/
LzmaDec.c 105 #define IsMatch 0
106 #define IsRep (IsMatch + (kNumStates << kNumPosBitsMax))
171 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
595 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
  /device/linaro/bootloader/edk2/MdeModulePkg/Library/LzmaCustomDecompressLib/Sdk/C/
LzmaDec.c 105 #define IsMatch 0
106 #define IsRep (IsMatch + (kNumStates << kNumPosBitsMax))
171 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
595 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
  /external/lzma/C/
LzmaDec.c 137 #define IsMatch (LenCoder + kNumLenProbs)
138 #define Align (IsMatch + (kNumStates2 << kNumPosBitsMax))
246 prob = probs + IsMatch + COMBINED_PS_STATE;
675 prob = probs + IsMatch + COMBINED_PS_STATE;
    [all...]
  /external/lzma/CPP/7zip/Bundles/LzmaSpec/
LzmaSpec.cpp 435 CProb IsMatch[kNumStates << kNumPosBitsMax];
450 INIT_PROBS(IsMatch);
485 if (RangeDec.DecodeBit(&IsMatch[(state << kNumPosBitsMax) + posState]) == 0)
  /external/u-boot/lib/lzma/
LzmaDec.c 97 #define IsMatch 0
98 #define IsRep (IsMatch + (kNumStates << kNumPosBitsMax))
165 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
528 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
  /external/lzma/Asm/x86/
LzmaDecOpt.asm 445 UPDATE_0 probs_state_R, 0, IsMatch
487 IsMatch equ (LenCoder + kNumLenProbs)
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/protobuf/src/google/protobuf/
map.h     [all...]
  /external/v8/src/
objects-inl.h     [all...]
objects.cc     [all...]

Completed in 728 milliseconds