Skip to content

Commit

Permalink
Browse files Browse the repository at this point in the history
  • Loading branch information
sdasgup3 authored Jan 19, 2024
1 parent 7669d3a commit 2025586
Show file tree
Hide file tree
Showing 4 changed files with 8 additions and 8 deletions.
4 changes: 2 additions & 2 deletions WORKSPACE.bazel
Original file line number Diff line number Diff line change
Expand Up @@ -28,9 +28,9 @@ http_archive(
],
)

LLVM_COMMIT = "baba0a4cb43181a78881fce683e3a5016daa8ce6"
LLVM_COMMIT = "3a82a1c3f6bdc9259cc4641f66fc76d1e171e382"

LLVM_SHA256 = "a81c8c08b7fc11a9668b2ed3e37a3e98ad8f9e4e4f6ba2c8b0b36e105a775d4e"
LLVM_SHA256 = "c525cdb14bb239695852d696bcd13a6d47e579be18386ba2048515fe7f059153"

http_archive(
name = "llvm-raw",
Expand Down
2 changes: 1 addition & 1 deletion build_tools/llvm_version.txt
Original file line number Diff line number Diff line change
@@ -1 +1 @@
baba0a4cb43181a78881fce683e3a5016daa8ce6
3a82a1c3f6bdc9259cc4641f66fc76d1e171e382
2 changes: 1 addition & 1 deletion stablehlo/conversions/linalg/tests/reduce.mlir
Original file line number Diff line number Diff line change
Expand Up @@ -29,7 +29,7 @@ func.func @reduce_add(%arg0: tensor<5x4xi32>, %arg1: tensor<i32>) -> tensor<5xi3
// CHECK-PRIMITIVE-DAG: %[[INIT:.*]] = tensor.extract %{{.*}} : tensor<i32>
// CHECK-PRIMITIVE-DAG: %[[INIT_TENSOR:.*]] = tensor.empty()
// CHECK-PRIMITIVE-DAG: %[[FILL_TENSOR:.*]] = linalg.fill ins(%[[INIT]]{{.*}}outs(%[[INIT_TENSOR]]
// CHECK-PRIMITIVE: linalg.reduce { arith.addi }
// CHECK-PRIMITIVE: linalg.reduce { arith.addi {overflowFlags = #arith.overflow<none>} }
// CHECK-PRIMITIVE-SAME: ins(%{{.*}}tensor<5x4xi32>)
// CHECK-PRIMITIVE-SAME: outs(%[[FILL_TENSOR]] : tensor<5xi32>)
// CHECK-PRIMITIVE-SAME: dimensions = [1] {someattr}
Expand Down
8 changes: 4 additions & 4 deletions stablehlo/transforms/StablehloRefineShapes.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -967,16 +967,16 @@ struct RefineWhileOpPattern : public OpRewritePattern<WhileOp> {
// better error reporting for this case.
// This serves the current use cases well, so the implementation of more
// sophisticated refinement algorithm is left for future work.
rewriter.startRootUpdate(op);
rewriter.startOpModification(op);
auto condStatus = refineValues(rewriter, op, op.getCond().getArguments(),
op.getOperandTypes());
auto bodyStatus = refineValues(rewriter, op, op.getBody().getArguments(),
op.getOperandTypes());
if (succeeded(condStatus) || succeeded(bodyStatus)) {
rewriter.finalizeRootUpdate(op);
rewriter.finalizeOpModification(op);
return success();
} else {
rewriter.cancelRootUpdate(op);
rewriter.cancelOpModification(op);
return failure();
}
}
Expand Down Expand Up @@ -1055,7 +1055,7 @@ struct UpdateRegionTypePattern : public OpRewritePattern<ReturnOp> {
if (!needsUpdate)
return rewriter.notifyMatchFailure(op, "doesn't need update");

rewriter.updateRootInPlace(op->getParentOp(), [&]() { return; });
rewriter.modifyOpInPlace(op->getParentOp(), [&]() { return; });
return success();
}
};
Expand Down

0 comments on commit 2025586

Please sign in to comment.