Home
last modified time | relevance | path

Searched defs:TraversedEdgesForLeaf (Results 1 – 13 of 13) sorted by relevance

/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp658 BitVector TraversedEdgesForLeaf(Leaf.value().getMatchDag().getNumEdges()); in repartition() local
720 const auto &TraversedEdgesForLeaf = TraversedEdges[EnumeratedLeaf.index()]; in applyForPartition() local
736 auto &TraversedEdgesForLeaf = std::get<1>(I); in applyForPartition() local
/dports/devel/llvm11/llvm-11.0.1.src/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp658 BitVector TraversedEdgesForLeaf(Leaf.value().getMatchDag().getNumEdges()); in repartition() local
720 const auto &TraversedEdgesForLeaf = TraversedEdges[EnumeratedLeaf.index()]; in applyForPartition() local
736 auto &TraversedEdgesForLeaf = std::get<1>(I); in applyForPartition() local
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp655 BitVector TraversedEdgesForLeaf(Leaf.value().getMatchDag().getNumEdges()); in repartition() local
717 const auto &TraversedEdgesForLeaf = TraversedEdges[EnumeratedLeaf.index()]; in applyForPartition() local
733 auto &TraversedEdgesForLeaf = std::get<1>(I); in applyForPartition() local
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp655 BitVector TraversedEdgesForLeaf(Leaf.value().getMatchDag().getNumEdges()); in repartition() local
717 const auto &TraversedEdgesForLeaf = TraversedEdges[EnumeratedLeaf.index()]; in applyForPartition() local
733 auto &TraversedEdgesForLeaf = std::get<1>(I); in applyForPartition() local
/dports/devel/llvm10/llvm-10.0.1.src/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp652 BitVector TraversedEdgesForLeaf(Leaf.value().getMatchDag().getNumEdges()); in repartition() local
714 const auto &TraversedEdgesForLeaf = TraversedEdges[EnumeratedLeaf.index()]; in applyForPartition() local
730 auto &TraversedEdgesForLeaf = std::get<1>(I); in applyForPartition() local
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp655 BitVector TraversedEdgesForLeaf(Leaf.value().getMatchDag().getNumEdges()); in repartition() local
717 const auto &TraversedEdgesForLeaf = TraversedEdges[EnumeratedLeaf.index()]; in applyForPartition() local
733 auto &TraversedEdgesForLeaf = std::get<1>(I); in applyForPartition() local
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp655 BitVector TraversedEdgesForLeaf(Leaf.value().getMatchDag().getNumEdges()); in repartition() local
717 const auto &TraversedEdgesForLeaf = TraversedEdges[EnumeratedLeaf.index()]; in applyForPartition() local
733 auto &TraversedEdgesForLeaf = std::get<1>(I); in applyForPartition() local
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp655 BitVector TraversedEdgesForLeaf(Leaf.value().getMatchDag().getNumEdges()); in repartition() local
717 const auto &TraversedEdgesForLeaf = TraversedEdges[EnumeratedLeaf.index()]; in applyForPartition() local
733 auto &TraversedEdgesForLeaf = std::get<1>(I); in applyForPartition() local
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp658 BitVector TraversedEdgesForLeaf(Leaf.value().getMatchDag().getNumEdges()); in repartition() local
720 const auto &TraversedEdgesForLeaf = TraversedEdges[EnumeratedLeaf.index()]; in applyForPartition() local
736 auto &TraversedEdgesForLeaf = std::get<1>(I); in applyForPartition() local
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp652 BitVector TraversedEdgesForLeaf(Leaf.value().getMatchDag().getNumEdges()); in repartition() local
714 const auto &TraversedEdgesForLeaf = TraversedEdges[EnumeratedLeaf.index()]; in applyForPartition() local
730 auto &TraversedEdgesForLeaf = std::get<1>(I); in applyForPartition() local
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp655 BitVector TraversedEdgesForLeaf(Leaf.value().getMatchDag().getNumEdges()); in repartition() local
717 const auto &TraversedEdgesForLeaf = TraversedEdges[EnumeratedLeaf.index()]; in applyForPartition() local
733 auto &TraversedEdgesForLeaf = std::get<1>(I); in applyForPartition() local
/dports/graphics/llvm-mesa/llvm-13.0.1.src/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp655 BitVector TraversedEdgesForLeaf(Leaf.value().getMatchDag().getNumEdges()); in repartition() local
717 const auto &TraversedEdgesForLeaf = TraversedEdges[EnumeratedLeaf.index()]; in applyForPartition() local
733 auto &TraversedEdgesForLeaf = std::get<1>(I); in applyForPartition() local
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp655 BitVector TraversedEdgesForLeaf(Leaf.value().getMatchDag().getNumEdges()); in repartition() local
717 const auto &TraversedEdgesForLeaf = TraversedEdges[EnumeratedLeaf.index()]; in applyForPartition() local
733 auto &TraversedEdgesForLeaf = std::get<1>(I); in applyForPartition() local