Lines Matching refs:Terms
59 SmallVectorImpl<Term> &Terms) {
64 Terms.emplace_back(C.getCounterID(), Factor);
68 extractTerms(E.LHS, Factor, Terms);
70 E.RHS, E.Kind == CounterExpression::Subtract ? -Factor : Factor, Terms);
76 // Gather constant terms.
77 SmallVector<Term, 32> Terms;
78 extractTerms(ExpressionTree, +1, Terms);
80 // If there are no terms, this is just a zero. The algorithm below assumes at
82 if (Terms.size() == 0)
85 // Group the terms by counter ID.
86 llvm::sort(Terms.begin(), Terms.end(), [](const Term &LHS, const Term &RHS) {
90 // Combine terms by counter ID to eliminate counters that sum to zero.
91 auto Prev = Terms.begin();
92 for (auto I = Prev + 1, E = Terms.end(); I != E; ++I) {
100 Terms.erase(++Prev, Terms.end());
105 for (auto T : Terms) {
117 for (auto T : Terms) {
