diff options
| author | River Riddle <riverriddle@google.com> | 2019-05-11 15:17:28 -0700 |
|---|---|---|
| committer | Mehdi Amini <joker.eph@gmail.com> | 2019-05-20 13:37:10 -0700 |
| commit | 02e03b9bf4a1fe60b89d4bd662895ebcc374129b (patch) | |
| tree | f300b5e0886e01bd59c6fb7d7042b4e1fbf9ff3d /mlir/lib/Transforms/LoopFusion.cpp | |
| parent | 360f8a209e21b058cc20949fc8600817b0a1044c (diff) | |
| download | bcm5719-llvm-02e03b9bf4a1fe60b89d4bd662895ebcc374129b.tar.gz bcm5719-llvm-02e03b9bf4a1fe60b89d4bd662895ebcc374129b.zip | |
Add support for using llvm::dyn_cast/cast/isa for operation casts and replace usages of Operation::dyn_cast with llvm::dyn_cast.
--
PiperOrigin-RevId: 247778391
Diffstat (limited to 'mlir/lib/Transforms/LoopFusion.cpp')
| -rw-r--r-- | mlir/lib/Transforms/LoopFusion.cpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/mlir/lib/Transforms/LoopFusion.cpp b/mlir/lib/Transforms/LoopFusion.cpp index 796d2164ad9..1c4a4d1f755 100644 --- a/mlir/lib/Transforms/LoopFusion.cpp +++ b/mlir/lib/Transforms/LoopFusion.cpp @@ -644,7 +644,7 @@ bool MemRefDependenceGraph::init(Function &f) { DenseMap<Operation *, unsigned> forToNodeMap; for (auto &op : f.front()) { - if (auto forOp = op.dyn_cast<AffineForOp>()) { + if (auto forOp = dyn_cast<AffineForOp>(op)) { // Create graph node 'id' to represent top-level 'forOp' and record // all loads and store accesses it contains. LoopNestStateCollector collector; @@ -666,14 +666,14 @@ bool MemRefDependenceGraph::init(Function &f) { } forToNodeMap[&op] = node.id; nodes.insert({node.id, node}); - } else if (auto loadOp = op.dyn_cast<LoadOp>()) { + } else if (auto loadOp = dyn_cast<LoadOp>(op)) { // Create graph node for top-level load op. Node node(nextNodeId++, &op); node.loads.push_back(&op); auto *memref = op.cast<LoadOp>().getMemRef(); memrefAccesses[memref].insert(node.id); nodes.insert({node.id, node}); - } else if (auto storeOp = op.dyn_cast<StoreOp>()) { + } else if (auto storeOp = dyn_cast<StoreOp>(op)) { // Create graph node for top-level store op. Node node(nextNodeId++, &op); node.stores.push_back(&op); @@ -2125,7 +2125,7 @@ public: auto *fn = dstNode->op->getFunction(); for (unsigned i = 0, e = fn->getNumArguments(); i != e; ++i) { for (auto &use : fn->getArgument(i)->getUses()) { - if (auto loadOp = use.getOwner()->dyn_cast<LoadOp>()) { + if (auto loadOp = dyn_cast<LoadOp>(use.getOwner())) { // Gather loops surrounding 'use'. SmallVector<AffineForOp, 4> loops; getLoopIVs(*use.getOwner(), &loops); |

