Bug Summary

File:build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/mlir/lib/IR/Operation.cpp
Warning:line 85, column 3
Potential leak of memory pointed to by 'mallocMem'

Annotated Source Code

Press '?' to see keyboard shortcuts

clang -cc1 -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -clear-ast-before-backend -disable-llvm-verifier -discard-value-names -main-file-name Operation.cpp -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -analyzer-config-compatibility-mode=true -mrelocation-model pic -pic-level 2 -mframe-pointer=none -fmath-errno -ffp-contract=on -fno-rounding-math -mconstructor-aliases -funwind-tables=2 -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -ffunction-sections -fdata-sections -fcoverage-compilation-dir=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/build-llvm/tools/clang/stage2-bins -resource-dir /usr/lib/llvm-16/lib/clang/16.0.0 -D MLIR_CUDA_CONVERSIONS_ENABLED=1 -D MLIR_ROCM_CONVERSIONS_ENABLED=1 -D _DEBUG -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I tools/mlir/lib/IR -I /build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/mlir/lib/IR -I include -I /build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/llvm/include -I /build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/mlir/include -I tools/mlir/include -D _FORTIFY_SOURCE=2 -D NDEBUG -U NDEBUG -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/c++/10 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/x86_64-linux-gnu/c++/10 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/c++/10/backward -internal-isystem /usr/lib/llvm-16/lib/clang/16.0.0/include -internal-isystem /usr/local/include -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../x86_64-linux-gnu/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -fmacro-prefix-map=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/build-llvm/tools/clang/stage2-bins=build-llvm/tools/clang/stage2-bins -fmacro-prefix-map=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/= -fcoverage-prefix-map=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/build-llvm/tools/clang/stage2-bins=build-llvm/tools/clang/stage2-bins -fcoverage-prefix-map=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/= -O2 -Wno-unused-command-line-argument -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-maybe-uninitialized -Wno-class-memaccess -Wno-redundant-move -Wno-pessimizing-move -Wno-noexcept-type -Wno-comment -Wno-misleading-indentation -std=c++17 -fdeprecated-macro -fdebug-compilation-dir=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/build-llvm/tools/clang/stage2-bins -fdebug-prefix-map=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/build-llvm/tools/clang/stage2-bins=build-llvm/tools/clang/stage2-bins -fdebug-prefix-map=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/= -ferror-limit 19 -fvisibility-inlines-hidden -stack-protector 2 -fgnuc-version=4.2.1 -fcolor-diagnostics -vectorize-loops -vectorize-slp -analyzer-output=html -analyzer-config stable-report-filename=true -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /tmp/scan-build-2022-10-03-140002-15933-1 -x c++ /build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/mlir/lib/IR/Operation.cpp
1//===- Operation.cpp - Operation support code -----------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9#include "mlir/IR/Operation.h"
10#include "mlir/IR/BlockAndValueMapping.h"
11#include "mlir/IR/BuiltinTypes.h"
12#include "mlir/IR/Dialect.h"
13#include "mlir/IR/OpImplementation.h"
14#include "mlir/IR/PatternMatch.h"
15#include "mlir/IR/TypeUtilities.h"
16#include "mlir/Interfaces/FoldInterfaces.h"
17#include "llvm/ADT/StringExtras.h"
18#include <numeric>
19
20using namespace mlir;
21
22//===----------------------------------------------------------------------===//
23// Operation
24//===----------------------------------------------------------------------===//
25
26/// Create a new Operation from operation state.
27Operation *Operation::create(const OperationState &state) {
28 return create(state.location, state.name, state.types, state.operands,
29 state.attributes.getDictionary(state.getContext()),
30 state.successors, state.regions);
31}
32
33/// Create a new Operation with the specific fields.
34Operation *Operation::create(Location location, OperationName name,
35 TypeRange resultTypes, ValueRange operands,
36 NamedAttrList &&attributes, BlockRange successors,
37 RegionRange regions) {
38 unsigned numRegions = regions.size();
39 Operation *op = create(location, name, resultTypes, operands,
40 std::move(attributes), successors, numRegions);
41 for (unsigned i = 0; i < numRegions; ++i)
42 if (regions[i])
43 op->getRegion(i).takeBody(*regions[i]);
44 return op;
45}
46
47/// Overload of create that takes an existing DictionaryAttr to avoid
48/// unnecessarily uniquing a list of attributes.
49Operation *Operation::create(Location location, OperationName name,
50 TypeRange resultTypes, ValueRange operands,
51 NamedAttrList &&attributes, BlockRange successors,
52 unsigned numRegions) {
53 assert(llvm::all_of(resultTypes, [](Type t) { return t; }) &&(static_cast <bool> (llvm::all_of(resultTypes, [](Type t
) { return t; }) && "unexpected null result type") ? void
(0) : __assert_fail ("llvm::all_of(resultTypes, [](Type t) { return t; }) && \"unexpected null result type\""
, "mlir/lib/IR/Operation.cpp", 54, __extension__ __PRETTY_FUNCTION__
))
5
Assuming the condition is true
6
'?' condition is true
54 "unexpected null result type")(static_cast <bool> (llvm::all_of(resultTypes, [](Type t
) { return t; }) && "unexpected null result type") ? void
(0) : __assert_fail ("llvm::all_of(resultTypes, [](Type t) { return t; }) && \"unexpected null result type\""
, "mlir/lib/IR/Operation.cpp", 54, __extension__ __PRETTY_FUNCTION__
))
;
55
56 // We only need to allocate additional memory for a subset of results.
57 unsigned numTrailingResults = OpResult::getNumTrailing(resultTypes.size());
58 unsigned numInlineResults = OpResult::getNumInline(resultTypes.size());
59 unsigned numSuccessors = successors.size();
60 unsigned numOperands = operands.size();
61 unsigned numResults = resultTypes.size();
62
63 // If the operation is known to have no operands, don't allocate an operand
64 // storage.
65 bool needsOperandStorage =
66 operands.empty() ? !name.hasTrait<OpTrait::ZeroOperands>() : true;
7
Assuming the condition is false
8
'?' condition is false
67
68 // Compute the byte size for the operation and the operand storage. This takes
69 // into account the size of the operation, its trailing objects, and its
70 // prefixed objects.
71 size_t byteSize =
72 totalSizeToAlloc<detail::OperandStorage, BlockOperand, Region, OpOperand>(
73 needsOperandStorage
8.1
'needsOperandStorage' is true
? 1 : 0, numSuccessors, numRegions, numOperands);
9
'?' condition is true
74 size_t prefixByteSize = llvm::alignTo(
75 Operation::prefixAllocSize(numTrailingResults, numInlineResults),
76 alignof(Operation));
77 char *mallocMem = reinterpret_cast<char *>(malloc(byteSize + prefixByteSize));
10
Memory is allocated
78 void *rawMem = mallocMem + prefixByteSize;
79
80 // Populate default attributes.
81 if (Optional<RegisteredOperationName> info = name.getRegisteredInfo())
11
Taking false branch
82 info->populateDefaultAttrs(attributes);
83
84 // Create the new Operation.
85 Operation *op = ::new (rawMem) Operation(
12
Potential leak of memory pointed to by 'mallocMem'
86 location, name, numResults, numSuccessors, numRegions,
87 attributes.getDictionary(location.getContext()), needsOperandStorage);
88
89 assert((numSuccessors == 0 || op->mightHaveTrait<OpTrait::IsTerminator>()) &&(static_cast <bool> ((numSuccessors == 0 || op->mightHaveTrait
<OpTrait::IsTerminator>()) && "unexpected successors in a non-terminator operation"
) ? void (0) : __assert_fail ("(numSuccessors == 0 || op->mightHaveTrait<OpTrait::IsTerminator>()) && \"unexpected successors in a non-terminator operation\""
, "mlir/lib/IR/Operation.cpp", 90, __extension__ __PRETTY_FUNCTION__
))
90 "unexpected successors in a non-terminator operation")(static_cast <bool> ((numSuccessors == 0 || op->mightHaveTrait
<OpTrait::IsTerminator>()) && "unexpected successors in a non-terminator operation"
) ? void (0) : __assert_fail ("(numSuccessors == 0 || op->mightHaveTrait<OpTrait::IsTerminator>()) && \"unexpected successors in a non-terminator operation\""
, "mlir/lib/IR/Operation.cpp", 90, __extension__ __PRETTY_FUNCTION__
))
;
91
92 // Initialize the results.
93 auto resultTypeIt = resultTypes.begin();
94 for (unsigned i = 0; i < numInlineResults; ++i, ++resultTypeIt)
95 new (op->getInlineOpResult(i)) detail::InlineOpResult(*resultTypeIt, i);
96 for (unsigned i = 0; i < numTrailingResults; ++i, ++resultTypeIt) {
97 new (op->getOutOfLineOpResult(i))
98 detail::OutOfLineOpResult(*resultTypeIt, i);
99 }
100
101 // Initialize the regions.
102 for (unsigned i = 0; i != numRegions; ++i)
103 new (&op->getRegion(i)) Region(op);
104
105 // Initialize the operands.
106 if (needsOperandStorage) {
107 new (&op->getOperandStorage()) detail::OperandStorage(
108 op, op->getTrailingObjects<OpOperand>(), operands);
109 }
110
111 // Initialize the successors.
112 auto blockOperands = op->getBlockOperands();
113 for (unsigned i = 0; i != numSuccessors; ++i)
114 new (&blockOperands[i]) BlockOperand(op, successors[i]);
115
116 return op;
117}
118
119Operation::Operation(Location location, OperationName name, unsigned numResults,
120 unsigned numSuccessors, unsigned numRegions,
121 DictionaryAttr attributes, bool hasOperandStorage)
122 : location(location), numResults(numResults), numSuccs(numSuccessors),
123 numRegions(numRegions), hasOperandStorage(hasOperandStorage), name(name),
124 attrs(attributes) {
125 assert(attributes && "unexpected null attribute dictionary")(static_cast <bool> (attributes && "unexpected null attribute dictionary"
) ? void (0) : __assert_fail ("attributes && \"unexpected null attribute dictionary\""
, "mlir/lib/IR/Operation.cpp", 125, __extension__ __PRETTY_FUNCTION__
))
;
126#ifndef NDEBUG
127 if (!getDialect() && !getContext()->allowsUnregisteredDialects())
128 llvm::report_fatal_error(
129 name.getStringRef() +
130 " created with unregistered dialect. If this is intended, please call "
131 "allowUnregisteredDialects() on the MLIRContext, or use "
132 "-allow-unregistered-dialect with the MLIR tool used.");
133#endif
134}
135
136// Operations are deleted through the destroy() member because they are
137// allocated via malloc.
138Operation::~Operation() {
139 assert(block == nullptr && "operation destroyed but still in a block")(static_cast <bool> (block == nullptr && "operation destroyed but still in a block"
) ? void (0) : __assert_fail ("block == nullptr && \"operation destroyed but still in a block\""
, "mlir/lib/IR/Operation.cpp", 139, __extension__ __PRETTY_FUNCTION__
))
;
140#ifndef NDEBUG
141 if (!use_empty()) {
142 {
143 InFlightDiagnostic diag =
144 emitOpError("operation destroyed but still has uses");
145 for (Operation *user : getUsers())
146 diag.attachNote(user->getLoc()) << "- use: " << *user << "\n";
147 }
148 llvm::report_fatal_error("operation destroyed but still has uses");
149 }
150#endif
151 // Explicitly run the destructors for the operands.
152 if (hasOperandStorage)
153 getOperandStorage().~OperandStorage();
154
155 // Explicitly run the destructors for the successors.
156 for (auto &successor : getBlockOperands())
157 successor.~BlockOperand();
158
159 // Explicitly destroy the regions.
160 for (auto &region : getRegions())
161 region.~Region();
162}
163
164/// Destroy this operation or one of its subclasses.
165void Operation::destroy() {
166 // Operations may have additional prefixed allocation, which needs to be
167 // accounted for here when computing the address to free.
168 char *rawMem = reinterpret_cast<char *>(this) -
169 llvm::alignTo(prefixAllocSize(), alignof(Operation));
170 this->~Operation();
171 free(rawMem);
172}
173
174/// Return true if this operation is a proper ancestor of the `other`
175/// operation.
176bool Operation::isProperAncestor(Operation *other) {
177 while ((other = other->getParentOp()))
178 if (this == other)
179 return true;
180 return false;
181}
182
183/// Replace any uses of 'from' with 'to' within this operation.
184void Operation::replaceUsesOfWith(Value from, Value to) {
185 if (from == to)
186 return;
187 for (auto &operand : getOpOperands())
188 if (operand.get() == from)
189 operand.set(to);
190}
191
192/// Replace the current operands of this operation with the ones provided in
193/// 'operands'.
194void Operation::setOperands(ValueRange operands) {
195 if (LLVM_LIKELY(hasOperandStorage)__builtin_expect((bool)(hasOperandStorage), true))
196 return getOperandStorage().setOperands(this, operands);
197 assert(operands.empty() && "setting operands without an operand storage")(static_cast <bool> (operands.empty() && "setting operands without an operand storage"
) ? void (0) : __assert_fail ("operands.empty() && \"setting operands without an operand storage\""
, "mlir/lib/IR/Operation.cpp", 197, __extension__ __PRETTY_FUNCTION__
))
;
198}
199
200/// Replace the operands beginning at 'start' and ending at 'start' + 'length'
201/// with the ones provided in 'operands'. 'operands' may be smaller or larger
202/// than the range pointed to by 'start'+'length'.
203void Operation::setOperands(unsigned start, unsigned length,
204 ValueRange operands) {
205 assert((start + length) <= getNumOperands() &&(static_cast <bool> ((start + length) <= getNumOperands
() && "invalid operand range specified") ? void (0) :
__assert_fail ("(start + length) <= getNumOperands() && \"invalid operand range specified\""
, "mlir/lib/IR/Operation.cpp", 206, __extension__ __PRETTY_FUNCTION__
))
206 "invalid operand range specified")(static_cast <bool> ((start + length) <= getNumOperands
() && "invalid operand range specified") ? void (0) :
__assert_fail ("(start + length) <= getNumOperands() && \"invalid operand range specified\""
, "mlir/lib/IR/Operation.cpp", 206, __extension__ __PRETTY_FUNCTION__
))
;
207 if (LLVM_LIKELY(hasOperandStorage)__builtin_expect((bool)(hasOperandStorage), true))
208 return getOperandStorage().setOperands(this, start, length, operands);
209 assert(operands.empty() && "setting operands without an operand storage")(static_cast <bool> (operands.empty() && "setting operands without an operand storage"
) ? void (0) : __assert_fail ("operands.empty() && \"setting operands without an operand storage\""
, "mlir/lib/IR/Operation.cpp", 209, __extension__ __PRETTY_FUNCTION__
))
;
210}
211
212/// Insert the given operands into the operand list at the given 'index'.
213void Operation::insertOperands(unsigned index, ValueRange operands) {
214 if (LLVM_LIKELY(hasOperandStorage)__builtin_expect((bool)(hasOperandStorage), true))
215 return setOperands(index, /*length=*/0, operands);
216 assert(operands.empty() && "inserting operands without an operand storage")(static_cast <bool> (operands.empty() && "inserting operands without an operand storage"
) ? void (0) : __assert_fail ("operands.empty() && \"inserting operands without an operand storage\""
, "mlir/lib/IR/Operation.cpp", 216, __extension__ __PRETTY_FUNCTION__
))
;
217}
218
219//===----------------------------------------------------------------------===//
220// Diagnostics
221//===----------------------------------------------------------------------===//
222
223/// Emit an error about fatal conditions with this operation, reporting up to
224/// any diagnostic handlers that may be listening.
225InFlightDiagnostic Operation::emitError(const Twine &message) {
226 InFlightDiagnostic diag = mlir::emitError(getLoc(), message);
227 if (getContext()->shouldPrintOpOnDiagnostic()) {
228 diag.attachNote(getLoc())
229 .append("see current operation: ")
230 .appendOp(*this, OpPrintingFlags().printGenericOpForm());
231 }
232 return diag;
233}
234
235/// Emit a warning about this operation, reporting up to any diagnostic
236/// handlers that may be listening.
237InFlightDiagnostic Operation::emitWarning(const Twine &message) {
238 InFlightDiagnostic diag = mlir::emitWarning(getLoc(), message);
239 if (getContext()->shouldPrintOpOnDiagnostic())
240 diag.attachNote(getLoc()) << "see current operation: " << *this;
241 return diag;
242}
243
244/// Emit a remark about this operation, reporting up to any diagnostic
245/// handlers that may be listening.
246InFlightDiagnostic Operation::emitRemark(const Twine &message) {
247 InFlightDiagnostic diag = mlir::emitRemark(getLoc(), message);
248 if (getContext()->shouldPrintOpOnDiagnostic())
249 diag.attachNote(getLoc()) << "see current operation: " << *this;
250 return diag;
251}
252
253//===----------------------------------------------------------------------===//
254// Operation Ordering
255//===----------------------------------------------------------------------===//
256
257constexpr unsigned Operation::kInvalidOrderIdx;
258constexpr unsigned Operation::kOrderStride;
259
260/// Given an operation 'other' that is within the same parent block, return
261/// whether the current operation is before 'other' in the operation list
262/// of the parent block.
263/// Note: This function has an average complexity of O(1), but worst case may
264/// take O(N) where N is the number of operations within the parent block.
265bool Operation::isBeforeInBlock(Operation *other) {
266 assert(block && "Operations without parent blocks have no order.")(static_cast <bool> (block && "Operations without parent blocks have no order."
) ? void (0) : __assert_fail ("block && \"Operations without parent blocks have no order.\""
, "mlir/lib/IR/Operation.cpp", 266, __extension__ __PRETTY_FUNCTION__
))
;
267 assert(other && other->block == block &&(static_cast <bool> (other && other->block ==
block && "Expected other operation to have the same parent block."
) ? void (0) : __assert_fail ("other && other->block == block && \"Expected other operation to have the same parent block.\""
, "mlir/lib/IR/Operation.cpp", 268, __extension__ __PRETTY_FUNCTION__
))
268 "Expected other operation to have the same parent block.")(static_cast <bool> (other && other->block ==
block && "Expected other operation to have the same parent block."
) ? void (0) : __assert_fail ("other && other->block == block && \"Expected other operation to have the same parent block.\""
, "mlir/lib/IR/Operation.cpp", 268, __extension__ __PRETTY_FUNCTION__
))
;
269 // If the order of the block is already invalid, directly recompute the
270 // parent.
271 if (!block->isOpOrderValid()) {
272 block->recomputeOpOrder();
273 } else {
274 // Update the order either operation if necessary.
275 updateOrderIfNecessary();
276 other->updateOrderIfNecessary();
277 }
278
279 return orderIndex < other->orderIndex;
280}
281
282/// Update the order index of this operation of this operation if necessary,
283/// potentially recomputing the order of the parent block.
284void Operation::updateOrderIfNecessary() {
285 assert(block && "expected valid parent")(static_cast <bool> (block && "expected valid parent"
) ? void (0) : __assert_fail ("block && \"expected valid parent\""
, "mlir/lib/IR/Operation.cpp", 285, __extension__ __PRETTY_FUNCTION__
))
;
286
287 // If the order is valid for this operation there is nothing to do.
288 if (hasValidOrder())
289 return;
290 Operation *blockFront = &block->front();
291 Operation *blockBack = &block->back();
292
293 // This method is expected to only be invoked on blocks with more than one
294 // operation.
295 assert(blockFront != blockBack && "expected more than one operation")(static_cast <bool> (blockFront != blockBack &&
"expected more than one operation") ? void (0) : __assert_fail
("blockFront != blockBack && \"expected more than one operation\""
, "mlir/lib/IR/Operation.cpp", 295, __extension__ __PRETTY_FUNCTION__
))
;
296
297 // If the operation is at the end of the block.
298 if (this == blockBack) {
299 Operation *prevNode = getPrevNode();
300 if (!prevNode->hasValidOrder())
301 return block->recomputeOpOrder();
302
303 // Add the stride to the previous operation.
304 orderIndex = prevNode->orderIndex + kOrderStride;
305 return;
306 }
307
308 // If this is the first operation try to use the next operation to compute the
309 // ordering.
310 if (this == blockFront) {
311 Operation *nextNode = getNextNode();
312 if (!nextNode->hasValidOrder())
313 return block->recomputeOpOrder();
314 // There is no order to give this operation.
315 if (nextNode->orderIndex == 0)
316 return block->recomputeOpOrder();
317
318 // If we can't use the stride, just take the middle value left. This is safe
319 // because we know there is at least one valid index to assign to.
320 if (nextNode->orderIndex <= kOrderStride)
321 orderIndex = (nextNode->orderIndex / 2);
322 else
323 orderIndex = kOrderStride;
324 return;
325 }
326
327 // Otherwise, this operation is between two others. Place this operation in
328 // the middle of the previous and next if possible.
329 Operation *prevNode = getPrevNode(), *nextNode = getNextNode();
330 if (!prevNode->hasValidOrder() || !nextNode->hasValidOrder())
331 return block->recomputeOpOrder();
332 unsigned prevOrder = prevNode->orderIndex, nextOrder = nextNode->orderIndex;
333
334 // Check to see if there is a valid order between the two.
335 if (prevOrder + 1 == nextOrder)
336 return block->recomputeOpOrder();
337 orderIndex = prevOrder + ((nextOrder - prevOrder) / 2);
338}
339
340//===----------------------------------------------------------------------===//
341// ilist_traits for Operation
342//===----------------------------------------------------------------------===//
343
344auto llvm::ilist_detail::SpecificNodeAccess<
345 typename llvm::ilist_detail::compute_node_options<
346 ::mlir::Operation>::type>::getNodePtr(pointer n) -> node_type * {
347 return NodeAccess::getNodePtr<OptionsT>(n);
348}
349
350auto llvm::ilist_detail::SpecificNodeAccess<
351 typename llvm::ilist_detail::compute_node_options<
352 ::mlir::Operation>::type>::getNodePtr(const_pointer n)
353 -> const node_type * {
354 return NodeAccess::getNodePtr<OptionsT>(n);
355}
356
357auto llvm::ilist_detail::SpecificNodeAccess<
358 typename llvm::ilist_detail::compute_node_options<
359 ::mlir::Operation>::type>::getValuePtr(node_type *n) -> pointer {
360 return NodeAccess::getValuePtr<OptionsT>(n);
361}
362
363auto llvm::ilist_detail::SpecificNodeAccess<
364 typename llvm::ilist_detail::compute_node_options<
365 ::mlir::Operation>::type>::getValuePtr(const node_type *n)
366 -> const_pointer {
367 return NodeAccess::getValuePtr<OptionsT>(n);
368}
369
370void llvm::ilist_traits<::mlir::Operation>::deleteNode(Operation *op) {
371 op->destroy();
372}
373
374Block *llvm::ilist_traits<::mlir::Operation>::getContainingBlock() {
375 size_t offset(size_t(&((Block *)nullptr->*Block::getSublistAccess(nullptr))));
376 iplist<Operation> *anchor(static_cast<iplist<Operation> *>(this));
377 return reinterpret_cast<Block *>(reinterpret_cast<char *>(anchor) - offset);
378}
379
380/// This is a trait method invoked when an operation is added to a block. We
381/// keep the block pointer up to date.
382void llvm::ilist_traits<::mlir::Operation>::addNodeToList(Operation *op) {
383 assert(!op->getBlock() && "already in an operation block!")(static_cast <bool> (!op->getBlock() && "already in an operation block!"
) ? void (0) : __assert_fail ("!op->getBlock() && \"already in an operation block!\""
, "mlir/lib/IR/Operation.cpp", 383, __extension__ __PRETTY_FUNCTION__
))
;
384 op->block = getContainingBlock();
385
386 // Invalidate the order on the operation.
387 op->orderIndex = Operation::kInvalidOrderIdx;
388}
389
390/// This is a trait method invoked when an operation is removed from a block.
391/// We keep the block pointer up to date.
392void llvm::ilist_traits<::mlir::Operation>::removeNodeFromList(Operation *op) {
393 assert(op->block && "not already in an operation block!")(static_cast <bool> (op->block && "not already in an operation block!"
) ? void (0) : __assert_fail ("op->block && \"not already in an operation block!\""
, "mlir/lib/IR/Operation.cpp", 393, __extension__ __PRETTY_FUNCTION__
))
;
394 op->block = nullptr;
395}
396
397/// This is a trait method invoked when an operation is moved from one block
398/// to another. We keep the block pointer up to date.
399void llvm::ilist_traits<::mlir::Operation>::transferNodesFromList(
400 ilist_traits<Operation> &otherList, op_iterator first, op_iterator last) {
401 Block *curParent = getContainingBlock();
402
403 // Invalidate the ordering of the parent block.
404 curParent->invalidateOpOrder();
405
406 // If we are transferring operations within the same block, the block
407 // pointer doesn't need to be updated.
408 if (curParent == otherList.getContainingBlock())
409 return;
410
411 // Update the 'block' member of each operation.
412 for (; first != last; ++first)
413 first->block = curParent;
414}
415
416/// Remove this operation (and its descendants) from its Block and delete
417/// all of them.
418void Operation::erase() {
419 if (auto *parent = getBlock())
420 parent->getOperations().erase(this);
421 else
422 destroy();
423}
424
425/// Remove the operation from its parent block, but don't delete it.
426void Operation::remove() {
427 if (Block *parent = getBlock())
428 parent->getOperations().remove(this);
429}
430
431/// Unlink this operation from its current block and insert it right before
432/// `existingOp` which may be in the same or another block in the same
433/// function.
434void Operation::moveBefore(Operation *existingOp) {
435 moveBefore(existingOp->getBlock(), existingOp->getIterator());
436}
437
438/// Unlink this operation from its current basic block and insert it right
439/// before `iterator` in the specified basic block.
440void Operation::moveBefore(Block *block,
441 llvm::iplist<Operation>::iterator iterator) {
442 block->getOperations().splice(iterator, getBlock()->getOperations(),
443 getIterator());
444}
445
446/// Unlink this operation from its current block and insert it right after
447/// `existingOp` which may be in the same or another block in the same function.
448void Operation::moveAfter(Operation *existingOp) {
449 moveAfter(existingOp->getBlock(), existingOp->getIterator());
450}
451
452/// Unlink this operation from its current block and insert it right after
453/// `iterator` in the specified block.
454void Operation::moveAfter(Block *block,
455 llvm::iplist<Operation>::iterator iterator) {
456 assert(iterator != block->end() && "cannot move after end of block")(static_cast <bool> (iterator != block->end() &&
"cannot move after end of block") ? void (0) : __assert_fail
("iterator != block->end() && \"cannot move after end of block\""
, "mlir/lib/IR/Operation.cpp", 456, __extension__ __PRETTY_FUNCTION__
))
;
457 moveBefore(block, std::next(iterator));
458}
459
460/// This drops all operand uses from this operation, which is an essential
461/// step in breaking cyclic dependences between references when they are to
462/// be deleted.
463void Operation::dropAllReferences() {
464 for (auto &op : getOpOperands())
465 op.drop();
466
467 for (auto &region : getRegions())
468 region.dropAllReferences();
469
470 for (auto &dest : getBlockOperands())
471 dest.drop();
472}
473
474/// This drops all uses of any values defined by this operation or its nested
475/// regions, wherever they are located.
476void Operation::dropAllDefinedValueUses() {
477 dropAllUses();
478
479 for (auto &region : getRegions())
480 for (auto &block : region)
481 block.dropAllDefinedValueUses();
482}
483
484void Operation::setSuccessor(Block *block, unsigned index) {
485 assert(index < getNumSuccessors())(static_cast <bool> (index < getNumSuccessors()) ? void
(0) : __assert_fail ("index < getNumSuccessors()", "mlir/lib/IR/Operation.cpp"
, 485, __extension__ __PRETTY_FUNCTION__))
;
486 getBlockOperands()[index].set(block);
487}
488
489/// Attempt to fold this operation using the Op's registered foldHook.
490LogicalResult Operation::fold(ArrayRef<Attribute> operands,
491 SmallVectorImpl<OpFoldResult> &results) {
492 // If we have a registered operation definition matching this one, use it to
493 // try to constant fold the operation.
494 Optional<RegisteredOperationName> info = getRegisteredInfo();
495 if (info && succeeded(info->foldHook(this, operands, results)))
496 return success();
497
498 // Otherwise, fall back on the dialect hook to handle it.
499 Dialect *dialect = getDialect();
500 if (!dialect)
501 return failure();
502
503 auto *interface = dyn_cast<DialectFoldInterface>(dialect);
504 if (!interface)
505 return failure();
506
507 return interface->fold(this, operands, results);
508}
509
510/// Emit an error with the op name prefixed, like "'dim' op " which is
511/// convenient for verifiers.
512InFlightDiagnostic Operation::emitOpError(const Twine &message) {
513 return emitError() << "'" << getName() << "' op " << message;
514}
515
516//===----------------------------------------------------------------------===//
517// Operation Cloning
518//===----------------------------------------------------------------------===//
519
520Operation::CloneOptions::CloneOptions()
521 : cloneRegionsFlag(false), cloneOperandsFlag(false) {}
522
523Operation::CloneOptions::CloneOptions(bool cloneRegions, bool cloneOperands)
524 : cloneRegionsFlag(cloneRegions), cloneOperandsFlag(cloneOperands) {}
525
526Operation::CloneOptions Operation::CloneOptions::all() {
527 return CloneOptions().cloneRegions().cloneOperands();
528}
529
530Operation::CloneOptions &Operation::CloneOptions::cloneRegions(bool enable) {
531 cloneRegionsFlag = enable;
532 return *this;
533}
534
535Operation::CloneOptions &Operation::CloneOptions::cloneOperands(bool enable) {
536 cloneOperandsFlag = enable;
537 return *this;
538}
539
540/// Create a deep copy of this operation but keep the operation regions empty.
541/// Operands are remapped using `mapper` (if present), and `mapper` is updated
542/// to contain the results. The `mapResults` flag specifies whether the results
543/// of the cloned operation should be added to the map.
544Operation *Operation::cloneWithoutRegions(BlockAndValueMapping &mapper) {
545 return clone(mapper, CloneOptions::all().cloneRegions(false));
546}
547
548Operation *Operation::cloneWithoutRegions() {
549 BlockAndValueMapping mapper;
550 return cloneWithoutRegions(mapper);
551}
552
553/// Create a deep copy of this operation, remapping any operands that use
554/// values outside of the operation using the map that is provided (leaving
555/// them alone if no entry is present). Replaces references to cloned
556/// sub-operations to the corresponding operation that is copied, and adds
557/// those mappings to the map.
558Operation *Operation::clone(BlockAndValueMapping &mapper,
559 CloneOptions options) {
560 SmallVector<Value, 8> operands;
561 SmallVector<Block *, 2> successors;
562
563 // Remap the operands.
564 if (options.shouldCloneOperands()) {
2
Assuming the condition is false
3
Taking false branch
565 operands.reserve(getNumOperands());
566 for (auto opValue : getOperands())
567 operands.push_back(mapper.lookupOrDefault(opValue));
568 }
569
570 // Remap the successors.
571 successors.reserve(getNumSuccessors());
572 for (Block *successor : getSuccessors())
573 successors.push_back(mapper.lookupOrDefault(successor));
574
575 // Create the new operation.
576 auto *newOp = create(getLoc(), getName(), getResultTypes(), operands, attrs,
4
Calling 'Operation::create'
577 successors, getNumRegions());
578
579 // Clone the regions.
580 if (options.shouldCloneRegions()) {
581 for (unsigned i = 0; i != numRegions; ++i)
582 getRegion(i).cloneInto(&newOp->getRegion(i), mapper);
583 }
584
585 // Remember the mapping of any results.
586 for (unsigned i = 0, e = getNumResults(); i != e; ++i)
587 mapper.map(getResult(i), newOp->getResult(i));
588
589 return newOp;
590}
591
592Operation *Operation::clone(CloneOptions options) {
593 BlockAndValueMapping mapper;
594 return clone(mapper, options);
1
Calling 'Operation::clone'
595}
596
597//===----------------------------------------------------------------------===//
598// OpState trait class.
599//===----------------------------------------------------------------------===//
600
601// The fallback for the parser is to try for a dialect operation parser.
602// Otherwise, reject the custom assembly form.
603ParseResult OpState::parse(OpAsmParser &parser, OperationState &result) {
604 if (auto parseFn = result.name.getDialect()->getParseOperationHook(
605 result.name.getStringRef()))
606 return (*parseFn)(parser, result);
607 return parser.emitError(parser.getNameLoc(), "has no custom assembly form");
608}
609
610// The fallback for the printer is to try for a dialect operation printer.
611// Otherwise, it prints the generic form.
612void OpState::print(Operation *op, OpAsmPrinter &p, StringRef defaultDialect) {
613 if (auto printFn = op->getDialect()->getOperationPrinter(op)) {
614 printOpName(op, p, defaultDialect);
615 printFn(op, p);
616 } else {
617 p.printGenericOp(op);
618 }
619}
620
621/// Print an operation name, eliding the dialect prefix if necessary and doesn't
622/// lead to ambiguities.
623void OpState::printOpName(Operation *op, OpAsmPrinter &p,
624 StringRef defaultDialect) {
625 StringRef name = op->getName().getStringRef();
626 if (name.startswith((defaultDialect + ".").str()) && name.count('.') == 1)
627 name = name.drop_front(defaultDialect.size() + 1);
628 p.getStream() << name;
629}
630
631/// Emit an error about fatal conditions with this operation, reporting up to
632/// any diagnostic handlers that may be listening.
633InFlightDiagnostic OpState::emitError(const Twine &message) {
634 return getOperation()->emitError(message);
635}
636
637/// Emit an error with the op name prefixed, like "'dim' op " which is
638/// convenient for verifiers.
639InFlightDiagnostic OpState::emitOpError(const Twine &message) {
640 return getOperation()->emitOpError(message);
641}
642
643/// Emit a warning about this operation, reporting up to any diagnostic
644/// handlers that may be listening.
645InFlightDiagnostic OpState::emitWarning(const Twine &message) {
646 return getOperation()->emitWarning(message);
647}
648
649/// Emit a remark about this operation, reporting up to any diagnostic
650/// handlers that may be listening.
651InFlightDiagnostic OpState::emitRemark(const Twine &message) {
652 return getOperation()->emitRemark(message);
653}
654
655//===----------------------------------------------------------------------===//
656// Op Trait implementations
657//===----------------------------------------------------------------------===//
658
659OpFoldResult OpTrait::impl::foldIdempotent(Operation *op) {
660 if (op->getNumOperands() == 1) {
661 auto *argumentOp = op->getOperand(0).getDefiningOp();
662 if (argumentOp && op->getName() == argumentOp->getName()) {
663 // Replace the outer operation output with the inner operation.
664 return op->getOperand(0);
665 }
666 } else if (op->getOperand(0) == op->getOperand(1)) {
667 return op->getOperand(0);
668 }
669
670 return {};
671}
672
673OpFoldResult OpTrait::impl::foldInvolution(Operation *op) {
674 auto *argumentOp = op->getOperand(0).getDefiningOp();
675 if (argumentOp && op->getName() == argumentOp->getName()) {
676 // Replace the outer involutions output with inner's input.
677 return argumentOp->getOperand(0);
678 }
679
680 return {};
681}
682
683LogicalResult OpTrait::impl::verifyZeroOperands(Operation *op) {
684 if (op->getNumOperands() != 0)
685 return op->emitOpError() << "requires zero operands";
686 return success();
687}
688
689LogicalResult OpTrait::impl::verifyOneOperand(Operation *op) {
690 if (op->getNumOperands() != 1)
691 return op->emitOpError() << "requires a single operand";
692 return success();
693}
694
695LogicalResult OpTrait::impl::verifyNOperands(Operation *op,
696 unsigned numOperands) {
697 if (op->getNumOperands() != numOperands) {
698 return op->emitOpError() << "expected " << numOperands
699 << " operands, but found " << op->getNumOperands();
700 }
701 return success();
702}
703
704LogicalResult OpTrait::impl::verifyAtLeastNOperands(Operation *op,
705 unsigned numOperands) {
706 if (op->getNumOperands() < numOperands)
707 return op->emitOpError()
708 << "expected " << numOperands << " or more operands, but found "
709 << op->getNumOperands();
710 return success();
711}
712
713/// If this is a vector type, or a tensor type, return the scalar element type
714/// that it is built around, otherwise return the type unmodified.
715static Type getTensorOrVectorElementType(Type type) {
716 if (auto vec = type.dyn_cast<VectorType>())
717 return vec.getElementType();
718
719 // Look through tensor<vector<...>> to find the underlying element type.
720 if (auto tensor = type.dyn_cast<TensorType>())
721 return getTensorOrVectorElementType(tensor.getElementType());
722 return type;
723}
724
725LogicalResult OpTrait::impl::verifyIsIdempotent(Operation *op) {
726 // FIXME: Add back check for no side effects on operation.
727 // Currently adding it would cause the shared library build
728 // to fail since there would be a dependency of IR on SideEffectInterfaces
729 // which is cyclical.
730 return success();
731}
732
733LogicalResult OpTrait::impl::verifyIsInvolution(Operation *op) {
734 // FIXME: Add back check for no side effects on operation.
735 // Currently adding it would cause the shared library build
736 // to fail since there would be a dependency of IR on SideEffectInterfaces
737 // which is cyclical.
738 return success();
739}
740
741LogicalResult
742OpTrait::impl::verifyOperandsAreSignlessIntegerLike(Operation *op) {
743 for (auto opType : op->getOperandTypes()) {
744 auto type = getTensorOrVectorElementType(opType);
745 if (!type.isSignlessIntOrIndex())
746 return op->emitOpError() << "requires an integer or index type";
747 }
748 return success();
749}
750
751LogicalResult OpTrait::impl::verifyOperandsAreFloatLike(Operation *op) {
752 for (auto opType : op->getOperandTypes()) {
753 auto type = getTensorOrVectorElementType(opType);
754 if (!type.isa<FloatType>())
755 return op->emitOpError("requires a float type");
756 }
757 return success();
758}
759
760LogicalResult OpTrait::impl::verifySameTypeOperands(Operation *op) {
761 // Zero or one operand always have the "same" type.
762 unsigned nOperands = op->getNumOperands();
763 if (nOperands < 2)
764 return success();
765
766 auto type = op->getOperand(0).getType();
767 for (auto opType : llvm::drop_begin(op->getOperandTypes(), 1))
768 if (opType != type)
769 return op->emitOpError() << "requires all operands to have the same type";
770 return success();
771}
772
773LogicalResult OpTrait::impl::verifyZeroRegions(Operation *op) {
774 if (op->getNumRegions() != 0)
775 return op->emitOpError() << "requires zero regions";
776 return success();
777}
778
779LogicalResult OpTrait::impl::verifyOneRegion(Operation *op) {
780 if (op->getNumRegions() != 1)
781 return op->emitOpError() << "requires one region";
782 return success();
783}
784
785LogicalResult OpTrait::impl::verifyNRegions(Operation *op,
786 unsigned numRegions) {
787 if (op->getNumRegions() != numRegions)
788 return op->emitOpError() << "expected " << numRegions << " regions";
789 return success();
790}
791
792LogicalResult OpTrait::impl::verifyAtLeastNRegions(Operation *op,
793 unsigned numRegions) {
794 if (op->getNumRegions() < numRegions)
795 return op->emitOpError() << "expected " << numRegions << " or more regions";
796 return success();
797}
798
799LogicalResult OpTrait::impl::verifyZeroResults(Operation *op) {
800 if (op->getNumResults() != 0)
801 return op->emitOpError() << "requires zero results";
802 return success();
803}
804
805LogicalResult OpTrait::impl::verifyOneResult(Operation *op) {
806 if (op->getNumResults() != 1)
807 return op->emitOpError() << "requires one result";
808 return success();
809}
810
811LogicalResult OpTrait::impl::verifyNResults(Operation *op,
812 unsigned numOperands) {
813 if (op->getNumResults() != numOperands)
814 return op->emitOpError() << "expected " << numOperands << " results";
815 return success();
816}
817
818LogicalResult OpTrait::impl::verifyAtLeastNResults(Operation *op,
819 unsigned numOperands) {
820 if (op->getNumResults() < numOperands)
821 return op->emitOpError()
822 << "expected " << numOperands << " or more results";
823 return success();
824}
825
826LogicalResult OpTrait::impl::verifySameOperandsShape(Operation *op) {
827 if (failed(verifyAtLeastNOperands(op, 1)))
828 return failure();
829
830 if (failed(verifyCompatibleShapes(op->getOperandTypes())))
831 return op->emitOpError() << "requires the same shape for all operands";
832
833 return success();
834}
835
836LogicalResult OpTrait::impl::verifySameOperandsAndResultShape(Operation *op) {
837 if (failed(verifyAtLeastNOperands(op, 1)) ||
838 failed(verifyAtLeastNResults(op, 1)))
839 return failure();
840
841 SmallVector<Type, 8> types(op->getOperandTypes());
842 types.append(llvm::to_vector<4>(op->getResultTypes()));
843
844 if (failed(verifyCompatibleShapes(types)))
845 return op->emitOpError()
846 << "requires the same shape for all operands and results";
847
848 return success();
849}
850
851LogicalResult OpTrait::impl::verifySameOperandsElementType(Operation *op) {
852 if (failed(verifyAtLeastNOperands(op, 1)))
853 return failure();
854 auto elementType = getElementTypeOrSelf(op->getOperand(0));
855
856 for (auto operand : llvm::drop_begin(op->getOperands(), 1)) {
857 if (getElementTypeOrSelf(operand) != elementType)
858 return op->emitOpError("requires the same element type for all operands");
859 }
860
861 return success();
862}
863
864LogicalResult
865OpTrait::impl::verifySameOperandsAndResultElementType(Operation *op) {
866 if (failed(verifyAtLeastNOperands(op, 1)) ||
867 failed(verifyAtLeastNResults(op, 1)))
868 return failure();
869
870 auto elementType = getElementTypeOrSelf(op->getResult(0));
871
872 // Verify result element type matches first result's element type.
873 for (auto result : llvm::drop_begin(op->getResults(), 1)) {
874 if (getElementTypeOrSelf(result) != elementType)
875 return op->emitOpError(
876 "requires the same element type for all operands and results");
877 }
878
879 // Verify operand's element type matches first result's element type.
880 for (auto operand : op->getOperands()) {
881 if (getElementTypeOrSelf(operand) != elementType)
882 return op->emitOpError(
883 "requires the same element type for all operands and results");
884 }
885
886 return success();
887}
888
889LogicalResult OpTrait::impl::verifySameOperandsAndResultType(Operation *op) {
890 if (failed(verifyAtLeastNOperands(op, 1)) ||
891 failed(verifyAtLeastNResults(op, 1)))
892 return failure();
893
894 auto type = op->getResult(0).getType();
895 auto elementType = getElementTypeOrSelf(type);
896 for (auto resultType : llvm::drop_begin(op->getResultTypes())) {
897 if (getElementTypeOrSelf(resultType) != elementType ||
898 failed(verifyCompatibleShape(resultType, type)))
899 return op->emitOpError()
900 << "requires the same type for all operands and results";
901 }
902 for (auto opType : op->getOperandTypes()) {
903 if (getElementTypeOrSelf(opType) != elementType ||
904 failed(verifyCompatibleShape(opType, type)))
905 return op->emitOpError()
906 << "requires the same type for all operands and results";
907 }
908 return success();
909}
910
911LogicalResult OpTrait::impl::verifyIsTerminator(Operation *op) {
912 Block *block = op->getBlock();
913 // Verify that the operation is at the end of the respective parent block.
914 if (!block || &block->back() != op)
915 return op->emitOpError("must be the last operation in the parent block");
916 return success();
917}
918
919static LogicalResult verifyTerminatorSuccessors(Operation *op) {
920 auto *parent = op->getParentRegion();
921
922 // Verify that the operands lines up with the BB arguments in the successor.
923 for (Block *succ : op->getSuccessors())
924 if (succ->getParent() != parent)
925 return op->emitError("reference to block defined in another region");
926 return success();
927}
928
929LogicalResult OpTrait::impl::verifyZeroSuccessors(Operation *op) {
930 if (op->getNumSuccessors() != 0) {
931 return op->emitOpError("requires 0 successors but found ")
932 << op->getNumSuccessors();
933 }
934 return success();
935}
936
937LogicalResult OpTrait::impl::verifyOneSuccessor(Operation *op) {
938 if (op->getNumSuccessors() != 1) {
939 return op->emitOpError("requires 1 successor but found ")
940 << op->getNumSuccessors();
941 }
942 return verifyTerminatorSuccessors(op);
943}
944LogicalResult OpTrait::impl::verifyNSuccessors(Operation *op,
945 unsigned numSuccessors) {
946 if (op->getNumSuccessors() != numSuccessors) {
947 return op->emitOpError("requires ")
948 << numSuccessors << " successors but found "
949 << op->getNumSuccessors();
950 }
951 return verifyTerminatorSuccessors(op);
952}
953LogicalResult OpTrait::impl::verifyAtLeastNSuccessors(Operation *op,
954 unsigned numSuccessors) {
955 if (op->getNumSuccessors() < numSuccessors) {
956 return op->emitOpError("requires at least ")
957 << numSuccessors << " successors but found "
958 << op->getNumSuccessors();
959 }
960 return verifyTerminatorSuccessors(op);
961}
962
963LogicalResult OpTrait::impl::verifyResultsAreBoolLike(Operation *op) {
964 for (auto resultType : op->getResultTypes()) {
965 auto elementType = getTensorOrVectorElementType(resultType);
966 bool isBoolType = elementType.isInteger(1);
967 if (!isBoolType)
968 return op->emitOpError() << "requires a bool result type";
969 }
970
971 return success();
972}
973
974LogicalResult OpTrait::impl::verifyResultsAreFloatLike(Operation *op) {
975 for (auto resultType : op->getResultTypes())
976 if (!getTensorOrVectorElementType(resultType).isa<FloatType>())
977 return op->emitOpError() << "requires a floating point type";
978
979 return success();
980}
981
982LogicalResult
983OpTrait::impl::verifyResultsAreSignlessIntegerLike(Operation *op) {
984 for (auto resultType : op->getResultTypes())
985 if (!getTensorOrVectorElementType(resultType).isSignlessIntOrIndex())
986 return op->emitOpError() << "requires an integer or index type";
987 return success();
988}
989
990LogicalResult OpTrait::impl::verifyValueSizeAttr(Operation *op,
991 StringRef attrName,
992 StringRef valueGroupName,
993 size_t expectedCount) {
994 auto sizeAttr = op->getAttrOfType<DenseI32ArrayAttr>(attrName);
995 if (!sizeAttr)
996 return op->emitOpError("requires dense i32 array attribute '")
997 << attrName << "'";
998
999 ArrayRef<int32_t> sizes = sizeAttr.asArrayRef();
1000 if (llvm::any_of(sizes, [](int32_t element) { return element < 0; }))
1001 return op->emitOpError("'")
1002 << attrName << "' attribute cannot have negative elements";
1003
1004 size_t totalCount =
1005 std::accumulate(sizes.begin(), sizes.end(), 0,
1006 [](unsigned all, int32_t one) { return all + one; });
1007
1008 if (totalCount != expectedCount)
1009 return op->emitOpError()
1010 << valueGroupName << " count (" << expectedCount
1011 << ") does not match with the total size (" << totalCount
1012 << ") specified in attribute '" << attrName << "'";
1013 return success();
1014}
1015
1016LogicalResult OpTrait::impl::verifyOperandSizeAttr(Operation *op,
1017 StringRef attrName) {
1018 return verifyValueSizeAttr(op, attrName, "operand", op->getNumOperands());
1019}
1020
1021LogicalResult OpTrait::impl::verifyResultSizeAttr(Operation *op,
1022 StringRef attrName) {
1023 return verifyValueSizeAttr(op, attrName, "result", op->getNumResults());
1024}
1025
1026LogicalResult OpTrait::impl::verifyNoRegionArguments(Operation *op) {
1027 for (Region &region : op->getRegions()) {
1028 if (region.empty())
1029 continue;
1030
1031 if (region.getNumArguments() != 0) {
1032 if (op->getNumRegions() > 1)
1033 return op->emitOpError("region #")
1034 << region.getRegionNumber() << " should have no arguments";
1035 return op->emitOpError("region should have no arguments");
1036 }
1037 }
1038 return success();
1039}
1040
1041LogicalResult OpTrait::impl::verifyElementwise(Operation *op) {
1042 auto isMappableType = [](Type type) {
1043 return type.isa<VectorType, TensorType>();
1044 };
1045 auto resultMappableTypes = llvm::to_vector<1>(
1046 llvm::make_filter_range(op->getResultTypes(), isMappableType));
1047 auto operandMappableTypes = llvm::to_vector<2>(
1048 llvm::make_filter_range(op->getOperandTypes(), isMappableType));
1049
1050 // If the op only has scalar operand/result types, then we have nothing to
1051 // check.
1052 if (resultMappableTypes.empty() && operandMappableTypes.empty())
1053 return success();
1054
1055 if (!resultMappableTypes.empty() && operandMappableTypes.empty())
1056 return op->emitOpError("if a result is non-scalar, then at least one "
1057 "operand must be non-scalar");
1058
1059 assert(!operandMappableTypes.empty())(static_cast <bool> (!operandMappableTypes.empty()) ? void
(0) : __assert_fail ("!operandMappableTypes.empty()", "mlir/lib/IR/Operation.cpp"
, 1059, __extension__ __PRETTY_FUNCTION__))
;
1060
1061 if (resultMappableTypes.empty())
1062 return op->emitOpError("if an operand is non-scalar, then there must be at "
1063 "least one non-scalar result");
1064
1065 if (resultMappableTypes.size() != op->getNumResults())
1066 return op->emitOpError(
1067 "if an operand is non-scalar, then all results must be non-scalar");
1068
1069 SmallVector<Type, 4> types = llvm::to_vector<2>(
1070 llvm::concat<Type>(operandMappableTypes, resultMappableTypes));
1071 TypeID expectedBaseTy = types.front().getTypeID();
1072 if (!llvm::all_of(types,
1073 [&](Type t) { return t.getTypeID() == expectedBaseTy; }) ||
1074 failed(verifyCompatibleShapes(types))) {
1075 return op->emitOpError() << "all non-scalar operands/results must have the "
1076 "same shape and base type";
1077 }
1078
1079 return success();
1080}
1081
1082/// Check for any values used by operations regions attached to the
1083/// specified "IsIsolatedFromAbove" operation defined outside of it.
1084LogicalResult OpTrait::impl::verifyIsIsolatedFromAbove(Operation *isolatedOp) {
1085 assert(isolatedOp->hasTrait<OpTrait::IsIsolatedFromAbove>() &&(static_cast <bool> (isolatedOp->hasTrait<OpTrait
::IsIsolatedFromAbove>() && "Intended to check IsolatedFromAbove ops"
) ? void (0) : __assert_fail ("isolatedOp->hasTrait<OpTrait::IsIsolatedFromAbove>() && \"Intended to check IsolatedFromAbove ops\""
, "mlir/lib/IR/Operation.cpp", 1086, __extension__ __PRETTY_FUNCTION__
))
1086 "Intended to check IsolatedFromAbove ops")(static_cast <bool> (isolatedOp->hasTrait<OpTrait
::IsIsolatedFromAbove>() && "Intended to check IsolatedFromAbove ops"
) ? void (0) : __assert_fail ("isolatedOp->hasTrait<OpTrait::IsIsolatedFromAbove>() && \"Intended to check IsolatedFromAbove ops\""
, "mlir/lib/IR/Operation.cpp", 1086, __extension__ __PRETTY_FUNCTION__
))
;
1087
1088 // List of regions to analyze. Each region is processed independently, with
1089 // respect to the common `limit` region, so we can look at them in any order.
1090 // Therefore, use a simple vector and push/pop back the current region.
1091 SmallVector<Region *, 8> pendingRegions;
1092 for (auto &region : isolatedOp->getRegions()) {
1093 pendingRegions.push_back(&region);
1094
1095 // Traverse all operations in the region.
1096 while (!pendingRegions.empty()) {
1097 for (Operation &op : pendingRegions.pop_back_val()->getOps()) {
1098 for (Value operand : op.getOperands()) {
1099 // Check that any value that is used by an operation is defined in the
1100 // same region as either an operation result.
1101 auto *operandRegion = operand.getParentRegion();
1102 if (!operandRegion)
1103 return op.emitError("operation's operand is unlinked");
1104 if (!region.isAncestor(operandRegion)) {
1105 return op.emitOpError("using value defined outside the region")
1106 .attachNote(isolatedOp->getLoc())
1107 << "required by region isolation constraints";
1108 }
1109 }
1110
1111 // Schedule any regions in the operation for further checking. Don't
1112 // recurse into other IsolatedFromAbove ops, because they will check
1113 // themselves.
1114 if (op.getNumRegions() &&
1115 !op.hasTrait<OpTrait::IsIsolatedFromAbove>()) {
1116 for (Region &subRegion : op.getRegions())
1117 pendingRegions.push_back(&subRegion);
1118 }
1119 }
1120 }
1121 }
1122
1123 return success();
1124}
1125
1126bool OpTrait::hasElementwiseMappableTraits(Operation *op) {
1127 return op->hasTrait<Elementwise>() && op->hasTrait<Scalarizable>() &&
1128 op->hasTrait<Vectorizable>() && op->hasTrait<Tensorizable>();
1129}
1130
1131//===----------------------------------------------------------------------===//
1132// CastOpInterface
1133//===----------------------------------------------------------------------===//
1134
1135/// Attempt to fold the given cast operation.
1136LogicalResult
1137impl::foldCastInterfaceOp(Operation *op, ArrayRef<Attribute> attrOperands,
1138 SmallVectorImpl<OpFoldResult> &foldResults) {
1139 OperandRange operands = op->getOperands();
1140 if (operands.empty())
1141 return failure();
1142 ResultRange results = op->getResults();
1143
1144 // Check for the case where the input and output types match 1-1.
1145 if (operands.getTypes() == results.getTypes()) {
1146 foldResults.append(operands.begin(), operands.end());
1147 return success();
1148 }
1149
1150 return failure();
1151}
1152
1153/// Attempt to verify the given cast operation.
1154LogicalResult impl::verifyCastInterfaceOp(
1155 Operation *op, function_ref<bool(TypeRange, TypeRange)> areCastCompatible) {
1156 auto resultTypes = op->getResultTypes();
1157 if (resultTypes.empty())
1158 return op->emitOpError()
1159 << "expected at least one result for cast operation";
1160
1161 auto operandTypes = op->getOperandTypes();
1162 if (!areCastCompatible(operandTypes, resultTypes)) {
1163 InFlightDiagnostic diag = op->emitOpError("operand type");
1164 if (operandTypes.empty())
1165 diag << "s []";
1166 else if (llvm::size(operandTypes) == 1)
1167 diag << " " << *operandTypes.begin();
1168 else
1169 diag << "s " << operandTypes;
1170 return diag << " and result type" << (resultTypes.size() == 1 ? " " : "s ")
1171 << resultTypes << " are cast incompatible";
1172 }
1173
1174 return success();
1175}
1176
1177//===----------------------------------------------------------------------===//
1178// Misc. utils
1179//===----------------------------------------------------------------------===//
1180
1181/// Insert an operation, generated by `buildTerminatorOp`, at the end of the
1182/// region's only block if it does not have a terminator already. If the region
1183/// is empty, insert a new block first. `buildTerminatorOp` should return the
1184/// terminator operation to insert.
1185void impl::ensureRegionTerminator(
1186 Region &region, OpBuilder &builder, Location loc,
1187 function_ref<Operation *(OpBuilder &, Location)> buildTerminatorOp) {
1188 OpBuilder::InsertionGuard guard(builder);
1189 if (region.empty())
1190 builder.createBlock(&region);
1191
1192 Block &block = region.back();
1193 if (!block.empty() && block.back().hasTrait<OpTrait::IsTerminator>())
1194 return;
1195
1196 builder.setInsertionPointToEnd(&block);
1197 builder.insert(buildTerminatorOp(builder, loc));
1198}
1199
1200/// Create a simple OpBuilder and forward to the OpBuilder version of this
1201/// function.
1202void impl::ensureRegionTerminator(
1203 Region &region, Builder &builder, Location loc,
1204 function_ref<Operation *(OpBuilder &, Location)> buildTerminatorOp) {
1205 OpBuilder opBuilder(builder.getContext());
1206 ensureRegionTerminator(region, opBuilder, loc, buildTerminatorOp);
1207}