HomeSort by: relevance | last modified time | path
    Searched defs:Pairs (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
CloneChecker.cpp 131 std::vector<VariablePattern::SuspiciousClonePair> Pairs;
150 Pairs.push_back(ClonePair);
166 for (VariablePattern::SuspiciousClonePair &Pair : Pairs) {
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
InfoByHwMode.cpp 88 std::vector<const PairType*> Pairs;
90 Pairs.push_back(&P);
91 llvm::sort(Pairs, deref<std::less<PairType>>());
95 for (const PairType *P : Pairs)
177 std::vector<const PairType*> Pairs;
179 Pairs.push_back(&P);
180 llvm::sort(Pairs, deref<std::less<PairType>>());
184 for (const PairType *P : Pairs)
  /src/sys/external/bsd/acpica/dist/common/
acfileio.c 626 * pairs (CR/LF).
635 UINT32 Pairs = 0;
655 Pairs++;
662 if (!Pairs)
671 * NOTE: We can't "fix" the table, because any existing CR/LF pairs in the
673 * meaning that we cannot simply replace CR/LF pairs with LFs.
676 AcpiOsPrintf ("All LFs (%u) were changed to CR/LF pairs\n", Pairs);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
DependenceAnalysis.cpp 35 // 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");
814 void DependenceInfo::unifySubscriptType(ArrayRef<Subscript *> Pairs) {
821 for (Subscript *Pair : Pairs) {
846 for (Subscript *Pair : Pairs) {
3290 // resize Pair to contain as many pairs of subscripts as the delinearization
3291 // has found, and then initialize the pairs following the delinearization
    [all...]

Completed in 26 milliseconds