HomeSort by: relevance | last modified time | path
    Searched refs:Terms (Results 1 - 7 of 7) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/ProfileData/Coverage/
CoverageMapping.cpp 58 SmallVectorImpl<Term> &Terms) {
63 Terms.emplace_back(C.getCounterID(), Factor);
67 extractTerms(E.LHS, Factor, Terms);
69 E.RHS, E.Kind == CounterExpression::Subtract ? -Factor : Factor, Terms);
75 // Gather constant terms.
76 SmallVector<Term, 32> Terms;
77 extractTerms(ExpressionTree, +1, Terms);
79 // If there are no terms, this is just a zero. The algorithm below assumes at
81 if (Terms.size() == 0)
84 // Group the terms by counter ID
    [all...]
  /src/share/locale/ctype/
gen_ctype_utf8.pl 57 * Distributed under the Terms of Use in
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
ScalarEvolution.cpp 234 "be costly in terms of compile time"));
593 /// Compare the two values \p LV and \p RV in terms of their "complexity" where
3312 // that there's a factor provided by one of the other terms. We need to
11641 SmallVectorImpl<const SCEV *> &Terms;
11643 SCEVCollectTerms(SmallVectorImpl<const SCEV *> &T) : Terms(T) {}
11649 Terms.push_back(S);
11698 SmallVectorImpl<const SCEV *> &Terms;
11702 : Terms(T), SE(SE) {}
11727 Terms.push_back(SE.getMulExpr(Operands));
11741 /// Find parametric terms in this SCEVAddRecExpr. We first for parameters i
    [all...]
DependenceAnalysis.cpp 1126 // In the presence of symbolic terms, we can sometimes make progress.
3049 // in terms of dependence), set consistent to false.
3078 // in terms of dependence), set consistent to false.
3104 // in terms of dependence), set consistent to false.
3422 // First step: collect parametric terms in both array references.
3423 SmallVector<const SCEV *, 4> Terms;
3424 SE->collectParametricTerms(SrcAR, Terms);
3425 SE->collectParametricTerms(DstAR, Terms);
3429 SE->findArrayDimensions(Terms, Sizes, ElementSize);
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
ScalarEvolution.h 711 /// Implemented in terms of the \c getSmallConstantTripCount overload with
734 /// Implemented in terms of the \c getSmallConstantTripMultiple overload with
747 /// The terms "backedge taken count" and "exit count" are used
1054 /// Compute the array dimensions Sizes from the set of Terms extracted from
1057 void findArrayDimensions(SmallVectorImpl<const SCEV *> &Terms,
1066 /// Collect parametric terms occurring in step expressions (first step of
1069 SmallVectorImpl<const SCEV *> &Terms);
1097 /// 1. Find the terms in the step functions
1106 /// object, one can collect in step 1 all the step terms for all the memory
1126 /// 1. Find the different terms in the step functions
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/ProfileData/Coverage/
CoverageMapping.h 183 /// Gather the terms of the expression tree for processing.
188 void extractTerms(Counter C, int Sign, SmallVectorImpl<Term> &Terms);
  /src/external/apache2/llvm/dist/clang/lib/Sema/
SemaTemplate.cpp 3518 /// Collect all of the separable terms in the given condition, which
3525 SmallVectorImpl<Expr *> &Terms) {
3528 collectConjunctionTerms(BinOp->getLHS(), Terms);
3529 collectConjunctionTerms(BinOp->getRHS(), Terms);
3535 Terms.push_back(Clause);
3610 // Separate out all of the terms in a conjunction.
3611 SmallVector<Expr *, 4> Terms;
3612 collectConjunctionTerms(Cond, Terms);
3616 for (Expr *Term : Terms) {

Completed in 42 milliseconds