HomeSort by relevance Sort by last modified time
    Searched refs:Pairs (Results 1 - 25 of 27) sorted by null

1 2

  /external/lzma/CPP/Common/
Wildcard.h 123 CObjectVector<CPair> Pairs;
128 { return (Pairs.Size() == 1 && Pairs.Front().Prefix.IsEmpty()); }
Wildcard.cpp 452 FOR_VECTOR (i, Pairs)
453 if (CompareFileNames(Pairs[i].Prefix, prefix) == 0)
607 index = Pairs.Add(CPair(prefix));
628 Pairs[index].Head.AddItem(include, item, ignoreWildcardIndex);
635 FOR_VECTOR (i, Pairs)
638 if (Pairs[i].Head.CheckPath2(isAltStream, path, isFile, include))
652 for (i = 0; i < Pairs.Size(); i++)
653 if (Pairs[i].Prefix.IsEmpty())
655 if (i == Pairs.Size())
658 for (i = 0; i < Pairs.Size(); i++)
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/Analysis/
LoopDependenceAnalysis.h 113 FoldingSet<DependencePair> Pairs;
  /external/spirv-llvm/lib/SPIRV/libSPIRV/
SPIRVInstruction.h 831 Pairs = getIds(ThePairs);
837 return getValues(Pairs);
840 Pairs.push_back(Value->getId());
841 Pairs.push_back(BB->getId());
842 WordCount = Pairs.size() + FixedWordCount;
846 Pairs = getIds(ThePairs);
847 WordCount = Pairs.size() + FixedWordCount;
852 for (size_t I = 0, E = Pairs.size()/2; I != E; ++I) {
854 if (!Module->exist(Pairs[2*I], &Value) ||
855 !Module->exist(Pairs[2*I+1], &BB)
    [all...]
SPIRVModule.cpp     [all...]
  /external/swiftshader/third_party/LLVM/lib/Analysis/
LoopDependenceAnalysis.cpp 42 STATISTIC(NumAnalysed, "Number of distinct dependence pairs analysed");
43 STATISTIC(NumDependent, "Number of pairs with dependent accesses");
44 STATISTIC(NumIndependent, "Number of pairs with independent accesses");
45 STATISTIC(NumUnknown, "Number of pairs with unknown accesses");
131 P = Pairs.FindNodeOrInsertPos(id, insertPos);
135 Pairs.InsertNode(P, insertPos);
254 // Collect GEP operand pairs (FIXME: use GetGEPOperands from BasicAA), adding
279 // Now analyse the collected operand pairs (skipping the GEP ptr offsets).
324 Pairs.clear();
  /external/llvm/lib/Analysis/
DependenceAnalysis.cpp 37 // Some non-linear subscript pairs can be handled by the GCD test
77 STATISTIC(TotalArrayPairs, "Array pairs tested");
78 STATISTIC(SeparableSubscriptPairs, "Separable subscript pairs");
79 STATISTIC(CoupledSubscriptPairs, "Coupled subscript pairs");
80 STATISTIC(NonlinearSubscriptPairs, "Nonlinear subscript pairs");
777 void DependenceInfo::unifySubscriptType(ArrayRef<Subscript *> Pairs) {
784 for (Subscript *Pair : Pairs) {
809 for (Subscript *Pair : Pairs) {
    [all...]
  /external/lzma/CPP/7zip/Bundles/SFXCon/
SfxCon.cpp 373 wildcardCensor.Pairs.Front().Head;
  /external/lzma/CPP/7zip/UI/Common/
Update.cpp 871 FOR_VECTOR (i, censor.Pairs)
874 if (CensorNode_CheckPath2(censor.Pairs[i].Head, item, include))
1217 if (censor.Pairs.Size() == 1)
1220 FString prefix = us2fs(censor.Pairs[0].Prefix);
1222 // UString prefix = censor.Pairs[0].Prefix;
1501 CRecordVector<CRefSortPair> pairs; local
    [all...]
EnumDirItems.cpp 807 FOR_VECTOR (i, censor.Pairs)
809 const NWildcard::CPair &pair = censor.Pairs[i];
ArchiveCommandLine.cpp 673 FOR_VECTOR (i, censor.Pairs)
675 NWildcard::CPair &pair = censor.Pairs[i];
    [all...]
  /external/llvm/include/llvm/Analysis/
DependenceAnalysis.h 532 /// Makes sure all subscript pairs share the same integer type by
536 void unifySubscriptType(ArrayRef<Subscript *> Pairs);
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 522 /// Makes sure all subscript pairs share the same integer type by
526 void unifySubscriptType(ArrayRef<Subscript *> Pairs);
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 522 /// Makes sure all subscript pairs share the same integer type by
526 void unifySubscriptType(ArrayRef<Subscript *> Pairs);
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 522 /// Makes sure all subscript pairs share the same integer type by
526 void unifySubscriptType(ArrayRef<Subscript *> Pairs);
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 522 /// Makes sure all subscript pairs share the same integer type by
526 void unifySubscriptType(ArrayRef<Subscript *> Pairs);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 522 /// Makes sure all subscript pairs share the same integer type by
526 void unifySubscriptType(ArrayRef<Subscript *> Pairs);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 522 /// Makes sure all subscript pairs share the same integer type by
526 void unifySubscriptType(ArrayRef<Subscript *> Pairs);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 522 /// Makes sure all subscript pairs share the same integer type by
526 void unifySubscriptType(ArrayRef<Subscript *> Pairs);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 522 /// Makes sure all subscript pairs share the same integer type by
526 void unifySubscriptType(ArrayRef<Subscript *> Pairs);
    [all...]
  /external/lzma/CPP/7zip/UI/Console/
Main.cpp 918 options.Censor.Pairs.Front().Head,
1035 options.Censor.Pairs.Front().Head,
  /art/compiler/optimizing/
parallel_move_test.cc 278 TYPED_TEST(ParallelMoveTest, Pairs) {
  /external/python/cpython2/Lib/
collections.py 126 'od.items() -> list of (key, value) pairs in od'
139 'od.iteritems -> an iterator over the (key, value) pairs in od'
172 Pairs are returned in LIFO order if last is true or FIFO order if false.
  /external/spirv-llvm/lib/SPIRV/
SPIRVWriter.cpp     [all...]
  /art/runtime/verifier/
reg_type_test.cc 61 TEST_F(RegTypeTest, Pairs) {
    [all...]

Completed in 2854 milliseconds

1 2