| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | 89 TraversableEdges(MatchDag.getNumEdges()), in GIMatchTreeBuilderLeafInfo()
164 TraversableEdges.set(E.index()); in declareOperand()
671 for (unsigned EIdx : Leaf.value().TraversableEdges.set_bits()) { in repartition()
723 Leaf.TraversableEdges.reset(TraversedEdgesForLeaf); in applyForPartition()
|
| H A D | GIMatchTree.h | 279 BitVector TraversableEdges; variable
377 OS << TraversableEdges.count() << " edges could be traversed\n"; in dump()
|
| /dports/devel/llvm11/llvm-11.0.1.src/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | 89 TraversableEdges(MatchDag.getNumEdges()), in GIMatchTreeBuilderLeafInfo()
164 TraversableEdges.set(E.index()); in declareOperand()
671 for (unsigned EIdx : Leaf.value().TraversableEdges.set_bits()) { in repartition()
723 Leaf.TraversableEdges.reset(TraversedEdgesForLeaf); in applyForPartition()
|
| H A D | GIMatchTree.h | 279 BitVector TraversableEdges; variable
377 OS << TraversableEdges.count() << " edges could be traversed\n"; in dump()
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | 89 TraversableEdges(MatchDag.getNumEdges()), in GIMatchTreeBuilderLeafInfo()
163 TraversableEdges.set(E.index()); in declareOperand()
668 for (unsigned EIdx : Leaf.value().TraversableEdges.set_bits()) { in repartition()
720 Leaf.TraversableEdges.reset(TraversedEdgesForLeaf); in applyForPartition()
|
| H A D | GIMatchTree.h | 279 BitVector TraversableEdges; variable
374 OS << TraversableEdges.count() << " edges could be traversed\n"; in dump()
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | 89 TraversableEdges(MatchDag.getNumEdges()), in GIMatchTreeBuilderLeafInfo()
163 TraversableEdges.set(E.index()); in declareOperand()
668 for (unsigned EIdx : Leaf.value().TraversableEdges.set_bits()) { in repartition()
720 Leaf.TraversableEdges.reset(TraversedEdgesForLeaf); in applyForPartition()
|
| H A D | GIMatchTree.h | 279 BitVector TraversableEdges; variable
374 OS << TraversableEdges.count() << " edges could be traversed\n"; in dump()
|
| /dports/devel/llvm10/llvm-10.0.1.src/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | 88 TraversableEdges(MatchDag.getNumEdges()), in GIMatchTreeBuilderLeafInfo()
163 TraversableEdges.set(E.index()); in declareOperand()
665 for (unsigned EIdx : Leaf.value().TraversableEdges.set_bits()) { in repartition()
717 Leaf.TraversableEdges.reset(TraversedEdgesForLeaf); in applyForPartition()
|
| H A D | GIMatchTree.h | 279 BitVector TraversableEdges; variable
377 OS << TraversableEdges.count() << " edges could be traversed\n"; in dump()
|
| /dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | 89 TraversableEdges(MatchDag.getNumEdges()), in GIMatchTreeBuilderLeafInfo()
163 TraversableEdges.set(E.index()); in declareOperand()
668 for (unsigned EIdx : Leaf.value().TraversableEdges.set_bits()) { in repartition()
720 Leaf.TraversableEdges.reset(TraversedEdgesForLeaf); in applyForPartition()
|
| H A D | GIMatchTree.h | 279 BitVector TraversableEdges; variable
374 OS << TraversableEdges.count() << " edges could be traversed\n"; in dump()
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | 89 TraversableEdges(MatchDag.getNumEdges()), in GIMatchTreeBuilderLeafInfo()
163 TraversableEdges.set(E.index()); in declareOperand()
668 for (unsigned EIdx : Leaf.value().TraversableEdges.set_bits()) { in repartition()
720 Leaf.TraversableEdges.reset(TraversedEdgesForLeaf); in applyForPartition()
|
| H A D | GIMatchTree.h | 279 BitVector TraversableEdges; variable
374 OS << TraversableEdges.count() << " edges could be traversed\n"; in dump()
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | 89 TraversableEdges(MatchDag.getNumEdges()), in GIMatchTreeBuilderLeafInfo()
163 TraversableEdges.set(E.index()); in declareOperand()
668 for (unsigned EIdx : Leaf.value().TraversableEdges.set_bits()) { in repartition()
720 Leaf.TraversableEdges.reset(TraversedEdgesForLeaf); in applyForPartition()
|
| H A D | GIMatchTree.h | 279 BitVector TraversableEdges; variable
374 OS << TraversableEdges.count() << " edges could be traversed\n"; in dump()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | 89 TraversableEdges(MatchDag.getNumEdges()), in GIMatchTreeBuilderLeafInfo()
164 TraversableEdges.set(E.index()); in declareOperand()
671 for (unsigned EIdx : Leaf.value().TraversableEdges.set_bits()) { in repartition()
723 Leaf.TraversableEdges.reset(TraversedEdgesForLeaf); in applyForPartition()
|
| H A D | GIMatchTree.h | 279 BitVector TraversableEdges; variable
377 OS << TraversableEdges.count() << " edges could be traversed\n"; in dump()
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | 88 TraversableEdges(MatchDag.getNumEdges()), in GIMatchTreeBuilderLeafInfo()
163 TraversableEdges.set(E.index()); in declareOperand()
665 for (unsigned EIdx : Leaf.value().TraversableEdges.set_bits()) { in repartition()
717 Leaf.TraversableEdges.reset(TraversedEdgesForLeaf); in applyForPartition()
|
| H A D | GIMatchTree.h | 279 BitVector TraversableEdges; variable
377 OS << TraversableEdges.count() << " edges could be traversed\n"; in dump()
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | 89 TraversableEdges(MatchDag.getNumEdges()), in GIMatchTreeBuilderLeafInfo()
163 TraversableEdges.set(E.index()); in declareOperand()
668 for (unsigned EIdx : Leaf.value().TraversableEdges.set_bits()) { in repartition()
720 Leaf.TraversableEdges.reset(TraversedEdgesForLeaf); in applyForPartition()
|
| H A D | GIMatchTree.h | 279 BitVector TraversableEdges; variable
374 OS << TraversableEdges.count() << " edges could be traversed\n"; in dump()
|
| /dports/graphics/llvm-mesa/llvm-13.0.1.src/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | 89 TraversableEdges(MatchDag.getNumEdges()), in GIMatchTreeBuilderLeafInfo()
163 TraversableEdges.set(E.index()); in declareOperand()
668 for (unsigned EIdx : Leaf.value().TraversableEdges.set_bits()) { in repartition()
720 Leaf.TraversableEdges.reset(TraversedEdgesForLeaf); in applyForPartition()
|
| H A D | GIMatchTree.h | 279 BitVector TraversableEdges; variable
374 OS << TraversableEdges.count() << " edges could be traversed\n"; in dump()
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | 89 TraversableEdges(MatchDag.getNumEdges()), in GIMatchTreeBuilderLeafInfo()
163 TraversableEdges.set(E.index()); in declareOperand()
668 for (unsigned EIdx : Leaf.value().TraversableEdges.set_bits()) { in repartition()
720 Leaf.TraversableEdges.reset(TraversedEdgesForLeaf); in applyForPartition()
|