1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242
|
//===- AttrTypeSubElements.cpp - Attr and Type SubElement Interfaces ------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
#include "mlir/IR/Operation.h"
#include <optional>
using namespace mlir;
//===----------------------------------------------------------------------===//
// AttrTypeWalker
//===----------------------------------------------------------------------===//
WalkResult AttrTypeWalker::walkImpl(Attribute attr, WalkOrder order) {
return walkImpl(attr, attrWalkFns, order);
}
WalkResult AttrTypeWalker::walkImpl(Type type, WalkOrder order) {
return walkImpl(type, typeWalkFns, order);
}
template <typename T, typename WalkFns>
WalkResult AttrTypeWalker::walkImpl(T element, WalkFns &walkFns,
WalkOrder order) {
// Check if we've already walk this element before.
auto key = std::make_pair(element.getAsOpaquePointer(), (int)order);
auto it = visitedAttrTypes.find(key);
if (it != visitedAttrTypes.end())
return it->second;
visitedAttrTypes.try_emplace(key, WalkResult::advance());
// If we are walking in post order, walk the sub elements first.
if (order == WalkOrder::PostOrder) {
if (walkSubElements(element, order).wasInterrupted())
return visitedAttrTypes[key] = WalkResult::interrupt();
}
// Walk this element, bailing if skipped or interrupted.
for (auto &walkFn : llvm::reverse(walkFns)) {
WalkResult walkResult = walkFn(element);
if (walkResult.wasInterrupted())
return visitedAttrTypes[key] = WalkResult::interrupt();
if (walkResult.wasSkipped())
return WalkResult::advance();
}
// If we are walking in pre-order, walk the sub elements last.
if (order == WalkOrder::PreOrder) {
if (walkSubElements(element, order).wasInterrupted())
return WalkResult::interrupt();
}
return WalkResult::advance();
}
template <typename T>
WalkResult AttrTypeWalker::walkSubElements(T interface, WalkOrder order) {
WalkResult result = WalkResult::advance();
auto walkFn = [&](auto element) {
if (element && !result.wasInterrupted())
result = walkImpl(element, order);
};
interface.walkImmediateSubElements(walkFn, walkFn);
return result.wasInterrupted() ? result : WalkResult::advance();
}
//===----------------------------------------------------------------------===//
/// AttrTypeReplacer
//===----------------------------------------------------------------------===//
void AttrTypeReplacer::addReplacement(ReplaceFn<Attribute> fn) {
attrReplacementFns.emplace_back(std::move(fn));
}
void AttrTypeReplacer::addReplacement(ReplaceFn<Type> fn) {
typeReplacementFns.push_back(std::move(fn));
}
void AttrTypeReplacer::replaceElementsIn(Operation *op, bool replaceAttrs,
bool replaceLocs, bool replaceTypes) {
// Functor that replaces the given element if the new value is different,
// otherwise returns nullptr.
auto replaceIfDifferent = [&](auto element) {
auto replacement = replace(element);
return (replacement && replacement != element) ? replacement : nullptr;
};
// Update the attribute dictionary.
if (replaceAttrs) {
if (auto newAttrs = replaceIfDifferent(op->getAttrDictionary()))
op->setAttrs(cast<DictionaryAttr>(newAttrs));
}
// If we aren't updating locations or types, we're done.
if (!replaceTypes && !replaceLocs)
return;
// Update the location.
if (replaceLocs) {
if (Attribute newLoc = replaceIfDifferent(op->getLoc()))
op->setLoc(cast<LocationAttr>(newLoc));
}
// Update the result types.
if (replaceTypes) {
for (OpResult result : op->getResults())
if (Type newType = replaceIfDifferent(result.getType()))
result.setType(newType);
}
// Update any nested block arguments.
for (Region ®ion : op->getRegions()) {
for (Block &block : region) {
for (BlockArgument &arg : block.getArguments()) {
if (replaceLocs) {
if (Attribute newLoc = replaceIfDifferent(arg.getLoc()))
arg.setLoc(cast<LocationAttr>(newLoc));
}
if (replaceTypes) {
if (Type newType = replaceIfDifferent(arg.getType()))
arg.setType(newType);
}
}
}
}
}
void AttrTypeReplacer::recursivelyReplaceElementsIn(Operation *op,
bool replaceAttrs,
bool replaceLocs,
bool replaceTypes) {
op->walk([&](Operation *nestedOp) {
replaceElementsIn(nestedOp, replaceAttrs, replaceLocs, replaceTypes);
});
}
template <typename T>
static void updateSubElementImpl(T element, AttrTypeReplacer &replacer,
SmallVectorImpl<T> &newElements,
FailureOr<bool> &changed) {
// Bail early if we failed at any point.
if (failed(changed))
return;
// Guard against potentially null inputs. We always map null to null.
if (!element) {
newElements.push_back(nullptr);
return;
}
// Replace the element.
if (T result = replacer.replace(element)) {
newElements.push_back(result);
if (result != element)
changed = true;
} else {
changed = failure();
}
}
template <typename T>
T AttrTypeReplacer::replaceSubElements(T interface) {
// Walk the current sub-elements, replacing them as necessary.
SmallVector<Attribute, 16> newAttrs;
SmallVector<Type, 16> newTypes;
FailureOr<bool> changed = false;
interface.walkImmediateSubElements(
[&](Attribute element) {
updateSubElementImpl(element, *this, newAttrs, changed);
},
[&](Type element) {
updateSubElementImpl(element, *this, newTypes, changed);
});
if (failed(changed))
return nullptr;
// If any sub-elements changed, use the new elements during the replacement.
T result = interface;
if (*changed)
result = interface.replaceImmediateSubElements(newAttrs, newTypes);
return result;
}
/// Shared implementation of replacing a given attribute or type element.
template <typename T, typename ReplaceFns>
T AttrTypeReplacer::replaceImpl(T element, ReplaceFns &replaceFns) {
const void *opaqueElement = element.getAsOpaquePointer();
auto [it, inserted] = attrTypeMap.try_emplace(opaqueElement, opaqueElement);
if (!inserted)
return T::getFromOpaquePointer(it->second);
T result = element;
WalkResult walkResult = WalkResult::advance();
for (auto &replaceFn : llvm::reverse(replaceFns)) {
if (std::optional<std::pair<T, WalkResult>> newRes = replaceFn(element)) {
std::tie(result, walkResult) = *newRes;
break;
}
}
// If an error occurred, return nullptr to indicate failure.
if (walkResult.wasInterrupted() || !result) {
attrTypeMap[opaqueElement] = nullptr;
return nullptr;
}
// Handle replacing sub-elements if this element is also a container.
if (!walkResult.wasSkipped()) {
// Replace the sub elements of this element, bailing if we fail.
if (!(result = replaceSubElements(result))) {
attrTypeMap[opaqueElement] = nullptr;
return nullptr;
}
}
attrTypeMap[opaqueElement] = result.getAsOpaquePointer();
return result;
}
Attribute AttrTypeReplacer::replace(Attribute attr) {
return replaceImpl(attr, attrReplacementFns);
}
Type AttrTypeReplacer::replace(Type type) {
return replaceImpl(type, typeReplacementFns);
}
//===----------------------------------------------------------------------===//
// AttrTypeImmediateSubElementWalker
//===----------------------------------------------------------------------===//
void AttrTypeImmediateSubElementWalker::walk(Attribute element) {
if (element)
walkAttrsFn(element);
}
void AttrTypeImmediateSubElementWalker::walk(Type element) {
if (element)
walkTypesFn(element);
}
|