Searched refs:Leaves (Results 1 – 7 of 7) sorted by relevance
| /freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/ |
| HD | GIMatchTree.cpp | 213 Partitioner->repartition(Leaves); in evaluatePartitioners()
221 for (const auto &Leaf : Leaves) { in runStep()
240 auto FullyTestedLeafI = Leaves.end(); in runStep()
241 for (auto LeafI = Leaves.begin(), LeafE = Leaves.end(); in runStep()
245 else if (FullyTestedLeafI != Leaves.end()) { in runStep()
264 if (Leaves.size() > 1) { in runStep()
268 std::find_if(Leaves.begin(), Leaves.end(), in runStep()
273 if (FirstFullyTested != Leaves.end()) in runStep()
277 for (auto &Leaf : make_range(Leaves.begin(), FirstFullyTested)) in runStep()
279 for (const auto &Leaf : make_range(FirstFullyTested, Leaves.end())) in runStep()
[all …]
|
| HD | GIMatchTree.h | 394 LeafVec Leaves;
426 Leaves.emplace_back(*this, Name, RootIdx, MatchDag, Data); in addLeaf()
428 void addLeaf(const GIMatchTreeBuilderLeafInfo &L) { Leaves.push_back(L); } in addLeaf()
435 LeafVec &getPossibleLeaves() { return Leaves; } in getPossibleLeaves()
490 virtual void repartition(GIMatchTreeBuilder::LeafVec &Leaves) = 0;
578 void repartition(GIMatchTreeBuilder::LeafVec &Leaves) override;
619 void repartition(GIMatchTreeBuilder::LeafVec &Leaves) override;
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| HD | HexagonISelDAGToDAG.cpp | 1936 LeafPrioQueue Leaves(NOpcode); in balanceSubTree() local
2008 Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++)); in balanceSubTree()
2019 Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++)); in balanceSubTree()
2071 Leaves.push(WeightedLeaf(New, Weight, Mul1.InsertionOrder)); in balanceSubTree()
2075 Leaves.push(Mul1); in balanceSubTree()
2077 Leaves.push(Mul2); in balanceSubTree()
2085 if (NOpcode == ISD::ADD && GA.Value.getNode() && Leaves.hasConst() && in balanceSubTree()
2089 ConstantSDNode *Offset = cast<ConstantSDNode>(Leaves.top().Value); in balanceSubTree()
2103 GA.Weight += Leaves.top().Weight; in balanceSubTree()
2108 Leaves.pop(); // Remove the offset constant from the queue in balanceSubTree()
[all …]
|
| /freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/ASTDiff/ |
| HD | ASTDiff.cpp | 133 std::vector<NodeId> Leaves; member in clang::diff::SyntaxTree::Impl
226 Tree.Leaves.push_back(MyId); in PostTraverse()
319 for (NodeId Leaf : Leaves) { in setLeftMostDescendants()
539 void computeKeyRoots(int Leaves) { in computeKeyRoots() argument
540 KeyRoots.resize(Leaves); in computeKeyRoots()
542 int K = Leaves - 1; in computeKeyRoots()
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| HD | Reassociate.cpp | 492 LeafMap Leaves; // Leaf -> Total weight so far. in LinearizeExprTree() local
518 LeafMap::iterator It = Leaves.find(Op); in LinearizeExprTree()
519 if (It == Leaves.end()) { in LinearizeExprTree()
528 Leaves[Op] = Weight; in LinearizeExprTree()
534 assert(It != Leaves.end() && Visited.count(Op) && in LinearizeExprTree()
554 Leaves.erase(It); in LinearizeExprTree()
566 Leaves.erase(It); // Since the value may be morphed below. in LinearizeExprTree()
599 Leaves[Op] = Weight; in LinearizeExprTree()
607 LeafMap::iterator It = Leaves.find(V); in LinearizeExprTree()
608 if (It == Leaves.end()) in LinearizeExprTree()
|
| /freebsd-11-stable/share/misc/ |
| HD | flowers | 22 Leaves (dead):Melancholy.
|
| /freebsd-11-stable/usr.bin/fortune/datfiles/ |
| HD | fortunes | 8473 Leaves (dead): Melancholy
32146 Leaves, like the things of man,
45206 Leaves Her Husband in Tucson --
|