//===- RegionUtils.cpp - Region-related transformation utilities ----------===// // // Copyright 2019 The MLIR Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // ============================================================================= #include "mlir/Transforms/RegionUtils.h" #include "mlir/IR/Block.h" #include "mlir/IR/Operation.h" #include "mlir/IR/Value.h" #include "llvm/ADT/SmallSet.h" using namespace mlir; void mlir::replaceAllUsesInRegionWith(Value *orig, Value *replacement, Region ®ion) { for (IROperand &use : llvm::make_early_inc_range(orig->getUses())) { if (region.isAncestor(use.getOwner()->getContainingRegion())) use.set(replacement); } } void mlir::getUsedValuesDefinedAbove(Region ®ion, Region &limit, llvm::SetVector &values) { assert(limit.isAncestor(®ion) && "expected isolation limit to be an ancestor of the given region"); // Collect proper ancestors of `limit` upfront to avoid traversing the region // tree for every value. llvm::SmallPtrSet properAncestors; for (auto *reg = limit.getContainingRegion(); reg != nullptr; reg = reg->getContainingRegion()) { properAncestors.insert(reg); } region.walk([&values, &properAncestors](Operation *op) { for (Value *operand : op->getOperands()) // Collect values that are used by an operation and defined in a proper // ancestor of region. if (properAncestors.count(operand->getContainingRegion())) values.insert(operand); }); }