[mlir][sparse] Refactoring: renaming StorageNewOp to StorageOp

To address comment in https://reviews.llvm.org/D133241

Reviewed By: aartbik

Differential Revision: https://reviews.llvm.org/D133363

Author: Peiming Liu

mlir/include/mlir/Dialect/SparseTensor/IR/SparseTensorOps.td

@@ -629,7 +629,7 @@ def SparseTensor_YieldOp : SparseTensor_Op<"yield", [NoSideEffect, Terminator]>,
 // sparse tensor codegen to progressively lower sparse tensors.
 //===----------------------------------------------------------------------===//
 
-def SparseTensor_StorageNewOp : SparseTensor_Op<"storage", []>,
+def SparseTensor_StorageOp : SparseTensor_Op<"storage", []>,
     Arguments<(ins Variadic<AnyType>:$inputs)>,
     Results<(outs AnyTuple:$result)> {
   let summary = "Pack a list of value into one sparse tensor storage value";

mlir/lib/Dialect/SparseTensor/IR/SparseTensorDialect.cpp

@@ -486,7 +486,7 @@ LogicalResult YieldOp::verify() {
 // Sparse Tensor Storage Operation.
 //===----------------------------------------------------------------------===//
 
-LogicalResult StorageNewOp::verify() {
+LogicalResult StorageOp::verify() {
   auto retTypes = getResult().getType().getTypes();
   if (retTypes.size() != getInputs().size())
     return emitError("The number of inputs is inconsistent with output tuple");

mlir/lib/Dialect/SparseTensor/Transforms/SparseTensorCodegen.cpp

@@ -174,7 +174,7 @@ static Value createTupleGet(OpBuilder &builder, Location loc, Value tuple,
 /// Creates tuple.
 static Value createTupleMake(OpBuilder &builder, Location loc, Type type,
                              ValueRange values) {
-  return builder.create<StorageNewOp>(loc, type, values);
+  return builder.create<StorageOp>(loc, type, values);
 }
 
 /// Create allocation operation.

mlir/lib/Dialect/SparseTensor/Transforms/SparseTensorPasses.cpp

@@ -156,7 +156,7 @@ struct SparseTensorCodegenPass
     ConversionTarget target(*ctx);
     // Almost everything in the sparse dialect must go!
     target.addIllegalDialect<SparseTensorDialect>();
-    target.addLegalOp<StorageGetOp, StorageSetOp, StorageNewOp>();
+    target.addLegalOp<StorageGetOp, StorageSetOp, StorageOp>();
     // All dynamic rules below accept new function, call, return, and various
     // tensor and bufferization operations as legal output of the rewriting
     // provided that all sparse tensor types have been fully rewritten.