summaryrefslogtreecommitdiffstats
path: root/mlir/lib/Conversion/LoopToStandard/ConvertLoopToStandard.cpp
diff options
context:
space:
mode:
authorRiver Riddle <riverriddle@google.com>2019-12-22 21:59:55 -0800
committerA. Unique TensorFlower <gardener@tensorflow.org>2019-12-22 22:00:23 -0800
commit35807bc4c5c9d8abc31ba0b2f955a82abf276e12 (patch)
treed083d37d993a774239081509a50e3e6c65366421 /mlir/lib/Conversion/LoopToStandard/ConvertLoopToStandard.cpp
parent22954a0e408afde1d8686dffb3a3dcab107a2cd3 (diff)
downloadbcm5719-llvm-35807bc4c5c9d8abc31ba0b2f955a82abf276e12.tar.gz
bcm5719-llvm-35807bc4c5c9d8abc31ba0b2f955a82abf276e12.zip
NFC: Introduce new ValuePtr/ValueRef typedefs to simplify the transition to Value being value-typed.
This is an initial step to refactoring the representation of OpResult as proposed in: https://groups.google.com/a/tensorflow.org/g/mlir/c/XXzzKhqqF_0/m/v6bKb08WCgAJ This change will make it much simpler to incrementally transition all of the existing code to use value-typed semantics. PiperOrigin-RevId: 286844725
Diffstat (limited to 'mlir/lib/Conversion/LoopToStandard/ConvertLoopToStandard.cpp')
-rw-r--r--mlir/lib/Conversion/LoopToStandard/ConvertLoopToStandard.cpp18
1 files changed, 9 insertions, 9 deletions
diff --git a/mlir/lib/Conversion/LoopToStandard/ConvertLoopToStandard.cpp b/mlir/lib/Conversion/LoopToStandard/ConvertLoopToStandard.cpp
index ff93ce58fd4..d8df7487e71 100644
--- a/mlir/lib/Conversion/LoopToStandard/ConvertLoopToStandard.cpp
+++ b/mlir/lib/Conversion/LoopToStandard/ConvertLoopToStandard.cpp
@@ -182,22 +182,22 @@ ForLowering::matchAndRewrite(ForOp forOp, PatternRewriter &rewriter) const {
rewriter.splitBlock(conditionBlock, conditionBlock->begin());
auto *lastBodyBlock = &forOp.region().back();
rewriter.inlineRegionBefore(forOp.region(), endBlock);
- auto *iv = conditionBlock->getArgument(0);
+ auto iv = conditionBlock->getArgument(0);
// Append the induction variable stepping logic to the last body block and
// branch back to the condition block. Construct an expression f :
// (x -> x+step) and apply this expression to the induction variable.
rewriter.setInsertionPointToEnd(lastBodyBlock);
- auto *step = forOp.step();
- auto *stepped = rewriter.create<AddIOp>(loc, iv, step).getResult();
+ auto step = forOp.step();
+ auto stepped = rewriter.create<AddIOp>(loc, iv, step).getResult();
if (!stepped)
return matchFailure();
rewriter.create<BranchOp>(loc, conditionBlock, stepped);
// Compute loop bounds before branching to the condition.
rewriter.setInsertionPointToEnd(initBlock);
- Value *lowerBound = forOp.lowerBound();
- Value *upperBound = forOp.upperBound();
+ ValuePtr lowerBound = forOp.lowerBound();
+ ValuePtr upperBound = forOp.upperBound();
if (!lowerBound || !upperBound)
return matchFailure();
rewriter.create<BranchOp>(loc, conditionBlock, lowerBound);
@@ -208,8 +208,8 @@ ForLowering::matchAndRewrite(ForOp forOp, PatternRewriter &rewriter) const {
rewriter.create<CmpIOp>(loc, CmpIPredicate::slt, iv, upperBound);
rewriter.create<CondBranchOp>(loc, comparison, firstBodyBlock,
- ArrayRef<Value *>(), endBlock,
- ArrayRef<Value *>());
+ ArrayRef<ValuePtr>(), endBlock,
+ ArrayRef<ValuePtr>());
// Ok, we're done!
rewriter.eraseOp(forOp);
return matchSuccess();
@@ -248,8 +248,8 @@ IfLowering::matchAndRewrite(IfOp ifOp, PatternRewriter &rewriter) const {
rewriter.setInsertionPointToEnd(condBlock);
rewriter.create<CondBranchOp>(loc, ifOp.condition(), thenBlock,
- /*trueArgs=*/ArrayRef<Value *>(), elseBlock,
- /*falseArgs=*/ArrayRef<Value *>());
+ /*trueArgs=*/ArrayRef<ValuePtr>(), elseBlock,
+ /*falseArgs=*/ArrayRef<ValuePtr>());
// Ok, we're done!
rewriter.eraseOp(ifOp);
OpenPOWER on IntegriCloud