MLIR 24.0.0git
InlinerInterfaceImpl.cpp
Go to the documentation of this file.
1//===- InlinerInterfaceImpl.cpp - Inlining for LLVM the dialect -----------===//
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// Logic for inlining LLVM functions and the definition of the
10// LLVMInliningInterface.
11//
12//===----------------------------------------------------------------------===//
13
17#include "mlir/IR/Matchers.h"
21#include "llvm/ADT/ScopeExit.h"
22#include "llvm/Support/Debug.h"
23
24#include "llvm/Support/DebugLog.h"
25
26#define DEBUG_TYPE "llvm-inliner"
27
28using namespace mlir;
29
30/// Check whether the given alloca is an input to a lifetime intrinsic,
31/// optionally passing through one or more casts on the way. This is not
32/// transitive through block arguments.
33static bool hasLifetimeMarkers(LLVM::AllocaOp allocaOp) {
34 SmallVector<Operation *> stack(allocaOp->getUsers().begin(),
35 allocaOp->getUsers().end());
36 while (!stack.empty()) {
37 Operation *op = stack.pop_back_val();
38 if (isa<LLVM::LifetimeStartOp, LLVM::LifetimeEndOp>(op))
39 return true;
40 if (isa<LLVM::BitcastOp>(op))
41 stack.append(op->getUsers().begin(), op->getUsers().end());
42 }
43 return false;
44}
45
46/// Handles alloca operations in the inlined blocks:
47/// - Moves all alloca operations with a constant size in the former entry block
48/// of the callee into the entry block of the caller, so they become part of
49/// the function prologue/epilogue during code generation.
50/// - Inserts lifetime intrinsics that limit the scope of inlined static allocas
51/// to the inlined blocks.
52/// - Inserts StackSave and StackRestore operations if dynamic allocas were
53/// inlined.
54static void
57 // Locate the entry block of the closest callsite ancestor that has either the
58 // IsolatedFromAbove or AutomaticAllocationScope trait. In pure LLVM dialect
59 // programs, this is the LLVMFuncOp containing the call site. However, in
60 // mixed-dialect programs, the callsite might be nested in another operation
61 // that carries one of these traits. In such scenarios, this traversal stops
62 // at the closest ancestor with either trait, ensuring visibility post
63 // relocation and respecting allocation scopes.
64 Block *callerEntryBlock = nullptr;
65 Operation *currentOp = call;
66 while (Operation *parentOp = currentOp->getParentOp()) {
67 if (parentOp->mightHaveTrait<OpTrait::IsIsolatedFromAbove>() ||
68 parentOp->mightHaveTrait<OpTrait::AutomaticAllocationScope>()) {
69 callerEntryBlock = &currentOp->getParentRegion()->front();
70 break;
71 }
72 currentOp = parentOp;
73 }
74
75 // Avoid relocating the alloca operations if the call has been inlined into
76 // the entry block already, which is typically the encompassing
77 // LLVM function, or if the relevant entry block cannot be identified.
78 Block *calleeEntryBlock = &(*inlinedBlocks.begin());
79 if (!callerEntryBlock || callerEntryBlock == calleeEntryBlock)
80 return;
81
83 bool shouldInsertLifetimes = false;
84 bool hasDynamicAlloca = false;
85 // Conservatively only move static alloca operations that are part of the
86 // entry block and do not inspect nested regions, since they may execute
87 // conditionally or have other unknown semantics.
88 for (auto allocaOp : calleeEntryBlock->getOps<LLVM::AllocaOp>()) {
89 IntegerAttr arraySize;
90 if (!matchPattern(allocaOp.getArraySize(), m_Constant(&arraySize))) {
91 hasDynamicAlloca = true;
92 continue;
93 }
94 bool shouldInsertLifetime =
95 arraySize.getValue() != 0 && !hasLifetimeMarkers(allocaOp);
96 shouldInsertLifetimes |= shouldInsertLifetime;
97 allocasToMove.emplace_back(allocaOp, arraySize, shouldInsertLifetime);
98 }
99 // Check the remaining inlined blocks for dynamic allocas as well.
100 for (Block &block : llvm::drop_begin(inlinedBlocks)) {
101 if (hasDynamicAlloca)
102 break;
103 hasDynamicAlloca =
104 llvm::any_of(block.getOps<LLVM::AllocaOp>(), [](auto allocaOp) {
105 return !matchPattern(allocaOp.getArraySize(), m_Constant());
106 });
107 }
108 if (allocasToMove.empty() && !hasDynamicAlloca)
109 return;
110 OpBuilder builder(calleeEntryBlock, calleeEntryBlock->begin());
111 Value stackPtr;
112 if (hasDynamicAlloca) {
113 // This may result in multiple stacksave/stackrestore intrinsics in the same
114 // scope if some are already present in the body of the caller. This is not
115 // invalid IR, but LLVM cleans these up in InstCombineCalls.cpp, along with
116 // other cases where the stacksave/stackrestore is redundant.
117 stackPtr = LLVM::StackSaveOp::create(
118 builder, call->getLoc(),
119 LLVM::LLVMPointerType::get(call->getContext()));
120 }
121 builder.setInsertionPointToStart(callerEntryBlock);
122 for (auto &[allocaOp, arraySize, shouldInsertLifetime] : allocasToMove) {
123 auto newConstant =
124 LLVM::ConstantOp::create(builder, allocaOp->getLoc(),
125 allocaOp.getArraySize().getType(), arraySize);
126 // Insert a lifetime start intrinsic where the alloca was before moving it.
127 if (shouldInsertLifetime) {
128 OpBuilder::InsertionGuard insertionGuard(builder);
129 builder.setInsertionPoint(allocaOp);
130 LLVM::LifetimeStartOp::create(builder, allocaOp.getLoc(),
131 allocaOp.getResult());
132 }
133 allocaOp->moveAfter(newConstant);
134 allocaOp.getArraySizeMutable().assign(newConstant.getResult());
135 }
136 if (!shouldInsertLifetimes && !hasDynamicAlloca)
137 return;
138 // Insert a lifetime end intrinsic before each return in the callee function.
139 for (Block &block : inlinedBlocks) {
140 if (!block.getTerminator()->hasTrait<OpTrait::ReturnLike>())
141 continue;
142 builder.setInsertionPoint(block.getTerminator());
143 if (hasDynamicAlloca)
144 LLVM::StackRestoreOp::create(builder, call->getLoc(), stackPtr);
145 for (auto &[allocaOp, arraySize, shouldInsertLifetime] : allocasToMove) {
146 if (shouldInsertLifetime)
147 LLVM::LifetimeEndOp::create(builder, allocaOp.getLoc(),
148 allocaOp.getResult());
149 }
150 }
151}
152
153/// Maps all alias scopes in the inlined operations to deep clones of the scopes
154/// and domain. This is required for code such as `foo(a, b); foo(a2, b2);` to
155/// not incorrectly return `noalias` for e.g. operations on `a` and `a2`.
156static void
159
160 // Register handles in the walker to create the deep clones.
161 // The walker ensures that an attribute is only ever walked once and does a
162 // post-order walk, ensuring the domain is visited prior to the scope.
163 AttrTypeWalker walker;
164
165 // Perform the deep clones while visiting. Builders create a distinct
166 // attribute to make sure that new instances are always created by the
167 // uniquer.
168 walker.addWalk([&](LLVM::AliasScopeDomainAttr domainAttr) {
169 mapping[domainAttr] = LLVM::AliasScopeDomainAttr::get(
170 domainAttr.getContext(), domainAttr.getDescription());
171 });
172
173 walker.addWalk([&](LLVM::AliasScopeAttr scopeAttr) {
174 mapping[scopeAttr] = LLVM::AliasScopeAttr::get(
175 cast<LLVM::AliasScopeDomainAttr>(mapping.lookup(scopeAttr.getDomain())),
176 scopeAttr.getDescription());
177 });
178
179 // Map an array of scopes to an array of deep clones.
180 auto convertScopeList = [&](ArrayAttr arrayAttr) -> ArrayAttr {
181 if (!arrayAttr)
182 return nullptr;
183
184 // Create the deep clones if necessary.
185 walker.walk(arrayAttr);
186
187 return ArrayAttr::get(arrayAttr.getContext(),
188 llvm::map_to_vector(arrayAttr, [&](Attribute attr) {
189 return mapping.lookup(attr);
190 }));
191 };
192
193 for (Block &block : inlinedBlocks) {
194 block.walk([&](Operation *op) {
195 if (auto aliasInterface = dyn_cast<LLVM::AliasAnalysisOpInterface>(op)) {
196 aliasInterface.setAliasScopes(
197 convertScopeList(aliasInterface.getAliasScopesOrNull()));
198 aliasInterface.setNoAliasScopes(
199 convertScopeList(aliasInterface.getNoAliasScopesOrNull()));
200 }
201
202 if (auto noAliasScope = dyn_cast<LLVM::NoAliasScopeDeclOp>(op)) {
203 // Create the deep clones if necessary.
204 walker.walk(noAliasScope.getScopeAttr());
205
206 noAliasScope.setScopeAttr(cast<LLVM::AliasScopeAttr>(
207 mapping.lookup(noAliasScope.getScopeAttr())));
208 }
209 });
210 }
211}
212
213/// Creates a new ArrayAttr by concatenating `lhs` with `rhs`.
214/// Returns null if both parameters are null. If only one attribute is null,
215/// return the other.
217 if (!lhs)
218 return rhs;
219 if (!rhs)
220 return lhs;
221
223 llvm::append_range(result, lhs);
224 llvm::append_range(result, rhs);
225 return ArrayAttr::get(lhs.getContext(), result);
226}
227
228/// Attempts to return the set of all underlying pointer values that
229/// `pointerValue` is based on. This function traverses through select
230/// operations and block arguments.
231static FailureOr<SmallVector<Value>>
234 WalkContinuation walkResult = walkSlice(pointerValue, [&](Value val) {
235 // Attempt to advance to the source of the underlying view-like operation.
236 // Examples of view-like operations include GEPOp and AddrSpaceCastOp.
237 if (auto viewOp = val.getDefiningOp<ViewLikeOpInterface>()) {
238 if (val == viewOp.getViewDest())
239 return WalkContinuation::advanceTo(viewOp.getViewSource());
240 }
241
242 // Attempt to advance to control flow predecessors.
243 std::optional<SmallVector<Value>> controlFlowPredecessors =
245 if (controlFlowPredecessors)
246 return WalkContinuation::advanceTo(*controlFlowPredecessors);
247
248 // For all non-control flow results, consider `val` an underlying object.
249 if (isa<OpResult>(val)) {
250 result.push_back(val);
251 return WalkContinuation::skip();
252 }
253
254 // If this place is reached, `val` is a block argument that is not
255 // understood. Therefore, we conservatively interrupt.
256 // Note: Dealing with function arguments is not necessary, as the slice
257 // would have to go through an SSACopyOp first.
259 });
260
261 if (walkResult.wasInterrupted())
262 return failure();
263
264 return result;
265}
266
267/// Creates a new AliasScopeAttr for every noalias parameter and attaches it to
268/// the appropriate inlined memory operations in an attempt to preserve the
269/// original semantics of the parameter attribute.
271 Operation *call, iterator_range<Region::iterator> inlinedBlocks) {
272
273 // First, collect all ssa copy operations, which correspond to function
274 // parameters, and additionally store the noalias parameters. All parameters
275 // have been marked by the `handleArgument` implementation by using the
276 // `ssa.copy` intrinsic. Additionally, noalias parameters have an attached
277 // `noalias` attribute to the intrinsics. These intrinsics are only meant to
278 // be temporary and should therefore be deleted after we're done using them
279 // here.
281 SetVector<LLVM::SSACopyOp> noAliasParams;
282 for (Value argument : cast<LLVM::CallOp>(call).getArgOperands()) {
283 for (auto ssaCopy :
284 llvm::make_isa_range<LLVM::SSACopyOp>(argument.getUsers())) {
285 ssaCopies.insert(ssaCopy);
286
287 if (!ssaCopy->hasDiscardableAttr(LLVM::LLVMDialect::getNoAliasAttrName()))
288 continue;
289 noAliasParams.insert(ssaCopy);
290 }
291 }
292
293 // Scope exit block to make it impossible to forget to get rid of the
294 // intrinsics.
295 llvm::scope_exit exit([&] {
296 for (LLVM::SSACopyOp ssaCopyOp : ssaCopies) {
297 ssaCopyOp.replaceAllUsesWith(ssaCopyOp.getOperand());
298 ssaCopyOp->erase();
299 }
300 });
301
302 // If there were no noalias parameters, we have nothing to do here.
303 if (noAliasParams.empty())
304 return;
305
306 // Create a new domain for this specific inlining and a new scope for every
307 // noalias parameter.
308 auto functionDomain = LLVM::AliasScopeDomainAttr::get(
309 call->getContext(), cast<LLVM::CallOp>(call).getCalleeAttr().getAttr());
311 for (LLVM::SSACopyOp copyOp : noAliasParams) {
312 auto scope = LLVM::AliasScopeAttr::get(functionDomain);
313 pointerScopes[copyOp] = scope;
314
315 auto builder = OpBuilder(call);
316 LLVM::NoAliasScopeDeclOp::create(builder, call->getLoc(), scope);
317 }
318
319 // Go through every instruction and attempt to find which noalias parameters
320 // it is definitely based on and definitely not based on.
321 for (Block &inlinedBlock : inlinedBlocks) {
322 inlinedBlock.walk([&](LLVM::AliasAnalysisOpInterface aliasInterface) {
323 // Collect the pointer arguments affected by the alias scopes.
324 SmallVector<Value> pointerArgs = aliasInterface.getAccessedOperands();
325
326 // Find the set of underlying pointers that this pointer is based on.
327 SmallPtrSet<Value, 4> basedOnPointers;
328 for (Value pointer : pointerArgs) {
329 FailureOr<SmallVector<Value>> underlyingObjectSet =
330 getUnderlyingObjectSet(pointer);
331 if (failed(underlyingObjectSet))
332 return;
333 llvm::copy(*underlyingObjectSet,
334 std::inserter(basedOnPointers, basedOnPointers.begin()));
335 }
336
337 bool aliasesOtherKnownObject = false;
338 // Go through the based on pointers and check that they are either:
339 // * Constants that can be ignored (undef, poison, null pointer).
340 // * Based on a pointer parameter.
341 // * Other pointers that we know can't alias with our noalias parameter.
342 //
343 // Any other value might be a pointer based on any noalias parameter that
344 // hasn't been identified. In that case conservatively don't add any
345 // scopes to this operation indicating either aliasing or not aliasing
346 // with any parameter.
347 if (llvm::any_of(basedOnPointers, [&](Value object) {
348 if (matchPattern(object, m_Constant()))
349 return false;
350
351 if (auto ssaCopy = object.getDefiningOp<LLVM::SSACopyOp>()) {
352 // If that value is based on a noalias parameter, it is guaranteed
353 // to not alias with any other object.
354 aliasesOtherKnownObject |= !noAliasParams.contains(ssaCopy);
355 return false;
356 }
357
358 if (isa_and_nonnull<LLVM::AllocaOp, LLVM::AddressOfOp>(
359 object.getDefiningOp())) {
360 aliasesOtherKnownObject = true;
361 return false;
362 }
363 return true;
364 }))
365 return;
366
367 // Add all noalias parameter scopes to the noalias scope list that we are
368 // not based on.
369 SmallVector<Attribute> noAliasScopes;
370 for (LLVM::SSACopyOp noAlias : noAliasParams) {
371 if (basedOnPointers.contains(noAlias))
372 continue;
373
374 noAliasScopes.push_back(pointerScopes[noAlias]);
375 }
376
377 if (!noAliasScopes.empty())
378 aliasInterface.setNoAliasScopes(
379 concatArrayAttr(aliasInterface.getNoAliasScopesOrNull(),
380 ArrayAttr::get(call->getContext(), noAliasScopes)));
381
382 // Don't add alias scopes to call operations or operations that might
383 // operate on pointers not based on any noalias parameter.
384 // Since we add all scopes to an operation's noalias list that it
385 // definitely doesn't alias, we mustn't do the same for the alias.scope
386 // list if other objects are involved.
387 //
388 // Consider the following case:
389 // %0 = llvm.alloca
390 // %1 = select %magic, %0, %noalias_param
391 // store 5, %1 (1) noalias=[scope(...)]
392 // ...
393 // store 3, %0 (2) noalias=[scope(noalias_param), scope(...)]
394 //
395 // We can add the scopes of any noalias parameters that aren't
396 // noalias_param's scope to (1) and add all of them to (2). We mustn't add
397 // the scope of noalias_param to the alias.scope list of (1) since
398 // that would mean (2) cannot alias with (1) which is wrong since both may
399 // store to %0.
400 //
401 // In conclusion, only add scopes to the alias.scope list if all pointers
402 // have a corresponding scope.
403 // Call operations are included in this list since we do not know whether
404 // the callee accesses any memory besides the ones passed as its
405 // arguments.
406 if (aliasesOtherKnownObject ||
407 isa<LLVM::CallOp>(aliasInterface.getOperation()))
408 return;
409
410 SmallVector<Attribute> aliasScopes;
411 for (LLVM::SSACopyOp noAlias : noAliasParams)
412 if (basedOnPointers.contains(noAlias))
413 aliasScopes.push_back(pointerScopes[noAlias]);
414
415 if (!aliasScopes.empty())
416 aliasInterface.setAliasScopes(
417 concatArrayAttr(aliasInterface.getAliasScopesOrNull(),
418 ArrayAttr::get(call->getContext(), aliasScopes)));
419 });
420 }
421}
422
423/// Appends any alias scopes of the call operation to any inlined memory
424/// operation.
425static void
427 iterator_range<Region::iterator> inlinedBlocks) {
428 auto callAliasInterface = dyn_cast<LLVM::AliasAnalysisOpInterface>(call);
429 if (!callAliasInterface)
430 return;
431
432 ArrayAttr aliasScopes = callAliasInterface.getAliasScopesOrNull();
433 ArrayAttr noAliasScopes = callAliasInterface.getNoAliasScopesOrNull();
434 // If the call has neither alias scopes or noalias scopes we have nothing to
435 // do here.
436 if (!aliasScopes && !noAliasScopes)
437 return;
438
439 // Simply append the call op's alias and noalias scopes to any operation
440 // implementing AliasAnalysisOpInterface.
441 for (Block &block : inlinedBlocks) {
442 block.walk([&](LLVM::AliasAnalysisOpInterface aliasInterface) {
443 if (aliasScopes)
444 aliasInterface.setAliasScopes(concatArrayAttr(
445 aliasInterface.getAliasScopesOrNull(), aliasScopes));
446
447 if (noAliasScopes)
448 aliasInterface.setNoAliasScopes(concatArrayAttr(
449 aliasInterface.getNoAliasScopesOrNull(), noAliasScopes));
450 });
451 }
452}
453
454/// Handles all interactions with alias scopes during inlining.
455static void handleAliasScopes(Operation *call,
456 iterator_range<Region::iterator> inlinedBlocks) {
457 deepCloneAliasScopes(inlinedBlocks);
458 createNewAliasScopesFromNoAliasParameter(call, inlinedBlocks);
459 appendCallOpAliasScopes(call, inlinedBlocks);
460}
461
462/// Appends any access groups of the call operation to any inlined memory
463/// operation.
465 iterator_range<Region::iterator> inlinedBlocks) {
466 auto callAccessGroupInterface = dyn_cast<LLVM::AccessGroupOpInterface>(call);
467 if (!callAccessGroupInterface)
468 return;
469
470 auto accessGroups = callAccessGroupInterface.getAccessGroupsOrNull();
471 if (!accessGroups)
472 return;
473
474 // Simply append the call op's access groups to any operation implementing
475 // AccessGroupOpInterface.
476 for (Block &block : inlinedBlocks)
477 for (auto accessGroupOpInterface :
478 block.getOps<LLVM::AccessGroupOpInterface>())
479 accessGroupOpInterface.setAccessGroups(concatArrayAttr(
480 accessGroupOpInterface.getAccessGroupsOrNull(), accessGroups));
481}
482
483/// Updates locations inside loop annotations to reflect that they were inlined.
484static void
486 iterator_range<Region::iterator> inlinedBlocks) {
487 // Attempt to extract a DISubprogram from the callee.
488 auto func = call->getParentOfType<FunctionOpInterface>();
489 if (!func)
490 return;
491 LocationAttr funcLoc = func->getLoc();
492 auto fusedLoc = dyn_cast_if_present<FusedLoc>(funcLoc);
493 if (!fusedLoc)
494 return;
495 auto scope =
496 dyn_cast_if_present<LLVM::DISubprogramAttr>(fusedLoc.getMetadata());
497 if (!scope)
498 return;
499
500 // Helper to build a new fused location that reflects the inlining of the loop
501 // annotation.
502 auto updateLoc = [&](FusedLoc loc) -> FusedLoc {
503 if (!loc)
504 return {};
505 Location callSiteLoc = CallSiteLoc::get(loc, call->getLoc());
506 return FusedLoc::get(loc.getContext(), callSiteLoc, scope);
507 };
508
509 AttrTypeReplacer replacer;
510 replacer.addReplacement([&](LLVM::LoopAnnotationAttr loopAnnotation)
511 -> std::pair<Attribute, WalkResult> {
512 FusedLoc newStartLoc = updateLoc(loopAnnotation.getStartLoc());
513 FusedLoc newEndLoc = updateLoc(loopAnnotation.getEndLoc());
514 if (!newStartLoc && !newEndLoc)
515 return {loopAnnotation, WalkResult::advance()};
516 auto newLoopAnnotation = LLVM::LoopAnnotationAttr::get(
517 loopAnnotation.getContext(), loopAnnotation.getDisableNonforced(),
518 loopAnnotation.getVectorize(), loopAnnotation.getInterleave(),
519 loopAnnotation.getUnroll(), loopAnnotation.getUnrollAndJam(),
520 loopAnnotation.getLicm(), loopAnnotation.getDistribute(),
521 loopAnnotation.getPipeline(), loopAnnotation.getPeeled(),
522 loopAnnotation.getUnswitch(), loopAnnotation.getMustProgress(),
523 loopAnnotation.getIsVectorized(), newStartLoc, newEndLoc,
524 loopAnnotation.getParallelAccesses());
525 // Needs to advance, as loop annotations can be nested.
526 return {newLoopAnnotation, WalkResult::advance()};
527 });
528
529 for (Block &block : inlinedBlocks)
530 for (Operation &op : block)
531 replacer.recursivelyReplaceElementsIn(&op);
532}
533
534/// If `requestedAlignment` is higher than the alignment specified on `alloca`,
535/// realigns `alloca` if this does not exceed the natural stack alignment.
536/// Returns the post-alignment of `alloca`, whether it was realigned or not.
537static uint64_t tryToEnforceAllocaAlignment(LLVM::AllocaOp alloca,
538 uint64_t requestedAlignment,
539 DataLayout const &dataLayout) {
540 uint64_t allocaAlignment = alloca.getAlignment().value_or(1);
541 if (requestedAlignment <= allocaAlignment)
542 // No realignment necessary.
543 return allocaAlignment;
544 uint64_t naturalStackAlignmentBits = dataLayout.getStackAlignment();
545 // If the natural stack alignment is not specified, the data layout returns
546 // zero. Optimistically allow realignment in this case.
547 if (naturalStackAlignmentBits == 0 ||
548 // If the requested alignment exceeds the natural stack alignment, this
549 // will trigger a dynamic stack realignment, so we prefer to copy...
550 8 * requestedAlignment <= naturalStackAlignmentBits ||
551 // ...unless the alloca already triggers dynamic stack realignment. Then
552 // we might as well further increase the alignment to avoid a copy.
553 8 * allocaAlignment > naturalStackAlignmentBits) {
554 alloca.setAlignment(requestedAlignment);
555 allocaAlignment = requestedAlignment;
556 }
557 return allocaAlignment;
558}
559
560/// Tries to find and return the alignment of the pointer `value` by looking for
561/// an alignment attribute on the defining allocation op or function argument.
562/// If the found alignment is lower than `requestedAlignment`, tries to realign
563/// the pointer, then returns the resulting post-alignment, regardless of
564/// whether it was realigned or not. If no existing alignment attribute is
565/// found, returns 1 (i.e., assume that no alignment is guaranteed).
566static uint64_t tryToEnforceAlignment(Value value, uint64_t requestedAlignment,
567 DataLayout const &dataLayout) {
568 if (Operation *definingOp = value.getDefiningOp()) {
569 if (auto alloca = dyn_cast<LLVM::AllocaOp>(definingOp))
570 return tryToEnforceAllocaAlignment(alloca, requestedAlignment,
571 dataLayout);
572 if (auto addressOf = dyn_cast<LLVM::AddressOfOp>(definingOp))
574 definingOp, addressOf.getGlobalNameAttr()))
575 return global.getAlignment().value_or(1);
576 // We don't currently handle this operation; assume no alignment.
577 return 1;
578 }
579 // Since there is no defining op, this is a block argument. Probably this
580 // comes directly from a function argument, so check that this is the case.
581 Operation *parentOp = value.getParentBlock()->getParentOp();
582 if (auto func = dyn_cast<LLVM::LLVMFuncOp>(parentOp)) {
583 // Use the alignment attribute set for this argument in the parent function
584 // if it has been set.
585 auto blockArg = llvm::cast<BlockArgument>(value);
586 if (Attribute alignAttr = func.getArgAttr(
587 blockArg.getArgNumber(), LLVM::LLVMDialect::getAlignAttrName()))
588 return cast<IntegerAttr>(alignAttr).getValue().getLimitedValue();
589 }
590 // We didn't find anything useful; assume no alignment.
591 return 1;
592}
593
594/// Introduces a new alloca and copies the memory pointed to by `argument` to
595/// the address of the new alloca, then returns the value of the new alloca.
597 Value argument, Type elementType,
598 uint64_t elementTypeSize,
599 uint64_t targetAlignment) {
600 // Allocate the new value on the stack.
601 Value allocaOp;
602 {
603 // Walk up from the call site to find the innermost AutomaticAllocationScope
604 // (e.g. an llvm.func or scf.forall). Placing the alloca at the entry block
605 // of that scope keeps it inside parallel regions rather than hoisting it
606 // out, while still landing at the function entry block for the common
607 // non-parallel case.
608 OpBuilder::InsertionGuard insertionGuard(builder);
609 Operation *scope = builder.getInsertionBlock()->getParentOp();
612 Block *entryBlock = &scope->getRegion(0).front();
613 builder.setInsertionPointToStart(entryBlock);
614 Value one = LLVM::ConstantOp::create(builder, loc, builder.getI64Type(),
615 builder.getI64IntegerAttr(1));
616 allocaOp = LLVM::AllocaOp::create(builder, loc, argument.getType(),
617 elementType, one, targetAlignment);
618 }
619 // Copy the pointee to the newly allocated value.
620 Value copySize =
621 LLVM::ConstantOp::create(builder, loc, builder.getI64Type(),
622 builder.getI64IntegerAttr(elementTypeSize));
623 // Preserve the alignment of the destination (alloca) in the memcpy's
624 // arg_attrs.
625 NamedAttribute dstAlignAttr =
626 builder.getNamedAttr(LLVM::LLVMDialect::getAlignAttrName(),
627 builder.getI64IntegerAttr(targetAlignment));
628 ArrayAttr argAttrs =
629 builder.getArrayAttr({builder.getDictionaryAttr({dstAlignAttr})});
630 LLVM::MemcpyOp::create(builder, loc, allocaOp, argument, copySize,
631 /*isVolatile=*/false,
632 /*access_groups=*/nullptr, /*alias_scopes=*/nullptr,
633 /*noalias_scopes=*/nullptr, /*tbaa=*/nullptr, argAttrs,
634 /*res_attrs=*/nullptr);
635 return allocaOp;
636}
637
638/// Handles a function argument marked with the byval attribute by introducing a
639/// memcpy or realigning the defining operation, if required either due to the
640/// pointee being writeable in the callee, and/or due to an alignment mismatch.
641/// `requestedAlignment` specifies the alignment set in the "align" argument
642/// attribute (or 1 if no align attribute was set).
643static Value handleByValArgument(OpBuilder &builder, Operation *callable,
644 Value argument, Type elementType,
645 uint64_t requestedAlignment) {
646 auto func = cast<LLVM::LLVMFuncOp>(callable);
647 LLVM::MemoryEffectsAttr memoryEffects = func.getMemoryEffectsAttr();
648 // If there is no memory effects attribute, assume that the function is
649 // not read-only.
650 bool isReadOnly = memoryEffects &&
651 memoryEffects.getArgMem() != LLVM::ModRefInfo::ModRef &&
652 memoryEffects.getArgMem() != LLVM::ModRefInfo::Mod;
653 // Check if there's an alignment mismatch requiring us to copy.
654 DataLayout dataLayout = DataLayout::closest(callable);
655 uint64_t minimumAlignment = dataLayout.getTypeABIAlignment(elementType);
656 if (isReadOnly) {
657 if (requestedAlignment <= minimumAlignment)
658 return argument;
659 uint64_t currentAlignment =
660 tryToEnforceAlignment(argument, requestedAlignment, dataLayout);
661 if (currentAlignment >= requestedAlignment)
662 return argument;
663 }
664 uint64_t targetAlignment = std::max(requestedAlignment, minimumAlignment);
666 builder, argument.getLoc(), argument, elementType,
667 dataLayout.getTypeSize(elementType), targetAlignment);
668}
669
670namespace {
671struct LLVMInlinerInterface : public DialectInlinerInterface {
672 using DialectInlinerInterface::DialectInlinerInterface;
673
674 LLVMInlinerInterface(Dialect *dialect)
675 : DialectInlinerInterface(dialect),
676 // Cache set of StringAttrs for fast lookup in `isLegalToInline`.
677 disallowedFunctionAttrs({
678 StringAttr::get(dialect->getContext(), "noduplicate"),
679 StringAttr::get(dialect->getContext(), "presplitcoroutine"),
680 StringAttr::get(dialect->getContext(), "returns_twice"),
681 StringAttr::get(dialect->getContext(), "strictfp"),
682 }) {}
683
684 bool isLegalToInline(Operation *call, Operation *callable,
685 bool wouldBeCloned) const final {
686 auto callOp = dyn_cast<LLVM::CallOp>(call);
687 if (!callOp) {
688 LDBG() << "Cannot inline: call is not an '"
689 << LLVM::CallOp::getOperationName() << "' op";
690 return false;
691 }
692 if (callOp.getNoInline()) {
693 LDBG() << "Cannot inline: call is marked no_inline";
694 return false;
695 }
696 auto funcOp = dyn_cast<LLVM::LLVMFuncOp>(callable);
697 if (!funcOp) {
698 LDBG() << "Cannot inline: callable is not an '"
699 << LLVM::LLVMFuncOp::getOperationName() << "' op";
700 return false;
701 }
702 if (funcOp.isNoInline()) {
703 LDBG() << "Cannot inline: function is marked no_inline";
704 return false;
705 }
706 if (funcOp.isVarArg()) {
707 LDBG() << "Cannot inline: callable is variadic";
708 return false;
709 }
710 // TODO: Generate aliasing metadata from noalias result attributes.
711 if (auto attrs = funcOp.getArgAttrs()) {
712 for (DictionaryAttr attrDict : attrs->getAsRange<DictionaryAttr>()) {
713 if (attrDict.contains(LLVM::LLVMDialect::getInAllocaAttrName())) {
714 LDBG() << "Cannot inline " << funcOp.getSymName()
715 << ": inalloca arguments not supported";
716 return false;
717 }
718 }
719 }
720 // TODO: Handle exceptions.
721 if (funcOp.getPersonality()) {
722 LDBG() << "Cannot inline " << funcOp.getSymName()
723 << ": unhandled function personality";
724 return false;
725 }
726 if (funcOp.getPassthrough()) {
727 // TODO: Used attributes should not be passthrough.
728 if (llvm::any_of(*funcOp.getPassthrough(), [&](Attribute attr) {
729 auto stringAttr = dyn_cast<StringAttr>(attr);
730 if (!stringAttr)
731 return false;
732 if (disallowedFunctionAttrs.contains(stringAttr)) {
733 LDBG() << "Cannot inline " << funcOp.getSymName()
734 << ": found disallowed function attribute " << stringAttr;
735 return true;
736 }
737 return false;
738 }))
739 return false;
740 }
741 // Refuse to inline if any block in the callee ends with an op that does
742 // not have the terminator trait. The MLIR verifier conservatively accepts
743 // unregistered ops as potential terminators (via mightHaveTrait), but
744 // handleTerminator uses cast<LLVM::ReturnOp> in the single-block path and
745 // would crash on such ops. Registered terminators from other dialects
746 // (e.g. cf.br) are safe: the multi-block path uses dyn_cast and skips
747 // non-llvm.return ops gracefully.
748 for (Block &block : funcOp.getBody()) {
749 if (!block.empty() && !block.back().hasTrait<OpTrait::IsTerminator>()) {
750 LDBG() << "Cannot inline " << funcOp.getSymName()
751 << ": block ends with non-terminator op";
752 return false;
753 }
754 }
755 return true;
756 }
757
758 bool isLegalToInline(Region *, Region *, bool, IRMapping &) const final {
759 return true;
760 }
761
762 bool isLegalToInline(Operation *op, Region *, bool, IRMapping &) const final {
763 // The inliner cannot handle variadic function arguments and blocktag
764 // operations prevent inlining since they the blockaddress operations
765 // reference them via the callee symbol.
766 return !(isa<LLVM::VaStartOp>(op) || isa<LLVM::BlockTagOp>(op));
767 }
768
769 /// Handle the given inlined return by replacing it with a branch. This
770 /// overload is called when the inlined region has more than one block.
771 void handleTerminator(Operation *op, Block *newDest) const final {
772 // Only return needs to be handled here.
773 auto returnOp = dyn_cast<LLVM::ReturnOp>(op);
774 if (!returnOp)
775 return;
776
777 // Replace the return with a branch to the dest.
778 OpBuilder builder(op);
779 LLVM::BrOp::create(builder, op->getLoc(), returnOp.getOperands(), newDest);
780 op->erase();
781 }
782
783 bool allowSingleBlockOptimization(
784 iterator_range<Region::iterator> inlinedBlocks) const final {
785 return !(!inlinedBlocks.empty() &&
786 isa<LLVM::UnreachableOp>(inlinedBlocks.begin()->getTerminator()));
787 }
788
789 /// Handle the given inlined return by replacing the uses of the call with the
790 /// operands of the return. This overload is called when the inlined region
791 /// only contains one block.
792 void handleTerminator(Operation *op, ValueRange valuesToRepl) const final {
793 // Return will be the only terminator present.
794 auto returnOp = cast<LLVM::ReturnOp>(op);
795
796 // Replace the values directly with the return operands.
797 assert(returnOp.getNumOperands() == valuesToRepl.size());
798 for (auto [dst, src] : llvm::zip(valuesToRepl, returnOp.getOperands()))
799 dst.replaceAllUsesWith(src);
800 }
801
802 Value handleArgument(OpBuilder &builder, Operation *call, Operation *callable,
803 Value argument,
804 DictionaryAttr argumentAttrs) const final {
805 if (std::optional<NamedAttribute> attr =
806 argumentAttrs.getNamed(LLVM::LLVMDialect::getByValAttrName())) {
807 Type elementType = cast<TypeAttr>(attr->getValue()).getValue();
808 uint64_t requestedAlignment = 1;
809 if (std::optional<NamedAttribute> alignAttr =
810 argumentAttrs.getNamed(LLVM::LLVMDialect::getAlignAttrName())) {
811 requestedAlignment = cast<IntegerAttr>(alignAttr->getValue())
812 .getValue()
813 .getLimitedValue();
814 }
815 return handleByValArgument(builder, callable, argument, elementType,
816 requestedAlignment);
817 }
818
819 // This code is essentially a workaround for deficiencies in the inliner
820 // interface: We need to transform operations *after* inlined based on the
821 // argument attributes of the parameters *before* inlining. This method runs
822 // prior to actual inlining and thus cannot transform the post-inlining
823 // code, while `processInlinedCallBlocks` does not have access to
824 // pre-inlining function arguments. Additionally, it is required to
825 // distinguish which parameter an SSA value originally came from. As a
826 // workaround until this is changed: Create an ssa.copy intrinsic with the
827 // noalias attribute (when it was present before) that can easily be found,
828 // and is extremely unlikely to exist in the code prior to inlining, using
829 // this to communicate between this method and `processInlinedCallBlocks`.
830 // TODO: Fix this by refactoring the inliner interface.
831 auto copyOp = LLVM::SSACopyOp::create(builder, call->getLoc(), argument);
832 if (argumentAttrs.contains(LLVM::LLVMDialect::getNoAliasAttrName()))
833 copyOp->setDiscardableAttr(
834 builder.getStringAttr(LLVM::LLVMDialect::getNoAliasAttrName()),
835 builder.getUnitAttr());
836 return copyOp;
837 }
838
839 void processInlinedCallBlocks(
840 Operation *call,
841 iterator_range<Region::iterator> inlinedBlocks) const override {
842 handleInlinedAllocas(call, inlinedBlocks);
843 handleAliasScopes(call, inlinedBlocks);
844 handleAccessGroups(call, inlinedBlocks);
845 handleLoopAnnotations(call, inlinedBlocks);
846 }
847
848 // Keeping this (immutable) state on the interface allows us to look up
849 // StringAttrs instead of looking up strings, since StringAttrs are bound to
850 // the current context and thus cannot be initialized as static fields.
851 const DenseSet<StringAttr> disallowedFunctionAttrs;
852};
853
854} // end anonymous namespace
855
857 registry.addExtension(+[](MLIRContext *ctx, LLVM::LLVMDialect *dialect) {
858 dialect->addInterfaces<LLVMInlinerInterface>();
859 });
860}
static bool hasLifetimeMarkers(LLVM::AllocaOp allocaOp)
Check whether the given alloca is an input to a lifetime intrinsic, optionally passing through one or...
static void appendCallOpAliasScopes(Operation *call, iterator_range< Region::iterator > inlinedBlocks)
Appends any alias scopes of the call operation to any inlined memory operation.
static void handleLoopAnnotations(Operation *call, iterator_range< Region::iterator > inlinedBlocks)
Updates locations inside loop annotations to reflect that they were inlined.
static ArrayAttr concatArrayAttr(ArrayAttr lhs, ArrayAttr rhs)
Creates a new ArrayAttr by concatenating lhs with rhs.
static void createNewAliasScopesFromNoAliasParameter(Operation *call, iterator_range< Region::iterator > inlinedBlocks)
Creates a new AliasScopeAttr for every noalias parameter and attaches it to the appropriate inlined m...
static FailureOr< SmallVector< Value > > getUnderlyingObjectSet(Value pointerValue)
Attempts to return the set of all underlying pointer values that pointerValue is based on.
static void handleAccessGroups(Operation *call, iterator_range< Region::iterator > inlinedBlocks)
Appends any access groups of the call operation to any inlined memory operation.
static Value handleByValArgument(OpBuilder &builder, Operation *callable, Value argument, Type elementType, uint64_t requestedAlignment)
Handles a function argument marked with the byval attribute by introducing a memcpy or realigning the...
static void handleAliasScopes(Operation *call, iterator_range< Region::iterator > inlinedBlocks)
Handles all interactions with alias scopes during inlining.
static uint64_t tryToEnforceAllocaAlignment(LLVM::AllocaOp alloca, uint64_t requestedAlignment, DataLayout const &dataLayout)
If requestedAlignment is higher than the alignment specified on alloca, realigns alloca if this does ...
static uint64_t tryToEnforceAlignment(Value value, uint64_t requestedAlignment, DataLayout const &dataLayout)
Tries to find and return the alignment of the pointer value by looking for an alignment attribute on ...
static void deepCloneAliasScopes(iterator_range< Region::iterator > inlinedBlocks)
Maps all alias scopes in the inlined operations to deep clones of the scopes and domain.
static Value handleByValArgumentInit(OpBuilder &builder, Location loc, Value argument, Type elementType, uint64_t elementTypeSize, uint64_t targetAlignment)
Introduces a new alloca and copies the memory pointed to by argument to the address of the new alloca...
static void handleInlinedAllocas(Operation *call, iterator_range< Region::iterator > inlinedBlocks)
Handles alloca operations in the inlined blocks:
static bool isLegalToInline(InlinerInterface &interface, Region *src, Region *insertRegion, bool shouldCloneInlinedRegion, IRMapping &valueMapping)
Utility to check that all of the operations within 'src' can be inlined.
ArrayAttr()
This is an attribute/type replacer that is naively cached.
void addWalk(WalkFn< Attribute > &&fn)
Register a walk function for a given attribute or type.
WalkResult walk(T element)
Walk the given attribute/type, and recursively walk any sub elements.
Attributes are known-constant values of operations.
Definition Attributes.h:25
Block represents an ordered list of Operations.
Definition Block.h:34
iterator begin()
Definition Block.h:168
auto getOps()
Return an iterator range over the operations within this block that are of 'OpT'.
Definition Block.h:213
Operation * getParentOp()
Returns the closest surrounding operation that contains this block.
Definition Block.cpp:31
IntegerType getI64Type()
Definition Builders.cpp:73
IntegerAttr getI64IntegerAttr(int64_t value)
Definition Builders.cpp:120
Ty getType(Args &&...args)
Get or construct an instance of the type Ty with provided arguments.
Definition Builders.h:94
ArrayAttr getArrayAttr(ArrayRef< Attribute > value)
Definition Builders.cpp:275
DictionaryAttr getDictionaryAttr(ArrayRef< NamedAttribute > value)
Definition Builders.cpp:112
NamedAttribute getNamedAttr(StringRef name, Attribute val)
Definition Builders.cpp:102
The main mechanism for performing data layout queries.
static DataLayout closest(Operation *op)
Returns the layout of the closest parent operation carrying layout info.
llvm::TypeSize getTypeSize(Type t) const
Returns the size of the given type in the current scope.
uint64_t getStackAlignment() const
Returns the natural alignment of the stack in bits.
uint64_t getTypeABIAlignment(Type t) const
Returns the required alignment of the given type in the current scope.
The DialectRegistry maps a dialect namespace to a constructor for the matching dialect.
bool addExtension(TypeID extensionID, std::unique_ptr< DialectExtensionBase > extension)
Add the given extension to the registry.
MLIRContext * getContext() const
Definition Dialect.h:52
This is a utility class for mapping one set of IR entities to another.
Definition IRMapping.h:26
Location objects represent source locations information in MLIR.
Definition Location.h:32
This class defines the main interface for locations in MLIR and acts as a non-nullable wrapper around...
Definition Location.h:76
MLIRContext is the top-level object for a collection of MLIR operations.
Definition MLIRContext.h:63
NamedAttribute represents a combination of a name and an Attribute value.
Definition Attributes.h:164
RAII guard to reset the insertion point of the builder when destroyed.
Definition Builders.h:351
This class helps build Operations.
Definition Builders.h:210
void setInsertionPointToStart(Block *block)
Sets the insertion point to the start of the specified block.
Definition Builders.h:434
void setInsertionPoint(Block *block, Block::iterator insertPoint)
Set the insertion point to the specified location.
Definition Builders.h:401
Block * getInsertionBlock() const
Return the block the current insertion point belongs to.
Definition Builders.h:445
A trait of region holding operations that define a new scope for automatic allocations,...
This class provides the API for ops that are known to be isolated from above.
Operation is the basic unit of execution within MLIR.
Definition Operation.h:87
Region & getRegion(unsigned index)
Returns the region held by this operation at position 'index'.
Definition Operation.h:738
bool mightHaveTrait()
Returns true if the operation might have the provided trait.
Definition Operation.h:809
Operation * getParentWithTrait()
Returns the closest surrounding parent operation with trait Trait.
Definition Operation.h:273
Location getLoc()
The source location the operation was defined or derived from.
Definition Operation.h:240
Operation * getParentOp()
Returns the closest surrounding operation that contains this operation or nullptr if this is a top-le...
Definition Operation.h:251
OpTy getParentOfType()
Return the closest surrounding parent operation that is of type 'OpTy'.
Definition Operation.h:255
user_range getUsers()
Returns a range of all users.
Definition Operation.h:925
Region * getParentRegion()
Returns the region to which the instruction belongs.
Definition Operation.h:247
MLIRContext * getContext()
Return the context this operation is associated with.
Definition Operation.h:233
This class contains a list of basic blocks and a link to the parent operation it is attached to.
Definition Region.h:26
Block & front()
Definition Region.h:65
static Operation * lookupNearestSymbolFrom(Operation *from, StringAttr symbol)
Returns the operation registered with the given symbol name within the closest parent operation of,...
Instances of the Type class are uniqued, have an immutable identifier and an optional mutable compone...
Definition Types.h:74
This class provides an abstraction over the different types of ranges over Values.
Definition ValueRange.h:389
This class represents an instance of an SSA value in the MLIR system, representing a computable value...
Definition Value.h:96
Type getType() const
Return the type of this value.
Definition Value.h:105
Block * getParentBlock()
Return the Block in which this Value is defined.
Definition Value.cpp:46
Location getLoc() const
Return the location of this value.
Definition Value.cpp:24
Operation * getDefiningOp() const
If this value is the result of an operation, return the operation that defines it.
Definition Value.cpp:18
A class to signal how to proceed with the walk of the backward slice:
Definition SliceWalk.h:20
bool wasInterrupted() const
Returns true if the walk was interrupted.
Definition SliceWalk.h:60
static WalkContinuation skip()
Creates a continuation that advances the walk without adding any predecessor values to the work list.
Definition SliceWalk.h:55
static WalkContinuation advanceTo(mlir::ValueRange nextValues)
Creates a continuation that adds the user-specified nextValues to the work list and advances the walk...
Definition SliceWalk.h:49
static WalkContinuation interrupt()
Creates a continuation that interrupts the walk.
Definition SliceWalk.h:43
static WalkResult advance()
Definition WalkResult.h:47
void recursivelyReplaceElementsIn(Operation *op, bool replaceAttrs=true, bool replaceLocs=false, bool replaceTypes=false)
Replace the elements within the given operation, and all nested operations.
void addReplacement(ReplaceFn< Attribute > fn)
AttrTypeReplacerBase.
void registerInlinerInterface(DialectRegistry &registry)
Register the LLVMInlinerInterface implementation of DialectInlinerInterface with the LLVM dialect.
Include the generated interface declarations.
bool matchPattern(Value value, const Pattern &pattern)
Entry point for matching a pattern over a Value.
Definition Matchers.h:490
std::optional< SmallVector< Value > > getControlFlowPredecessors(Value value)
Computes a vector of all control predecessors of value.
Definition SliceWalk.cpp:60
llvm::DenseSet< ValueT, ValueInfoT > DenseSet
Definition LLVM.h:122
llvm::SetVector< T, Vector, Set, N > SetVector
Definition LLVM.h:125
WalkContinuation walkSlice(mlir::ValueRange rootValues, WalkCallback walkCallback)
Walks the slice starting from the rootValues using a depth-first traversal.
Definition SliceWalk.cpp:6
llvm::DenseMap< KeyT, ValueT, KeyInfoT, BucketT > DenseMap
Definition LLVM.h:120
detail::constant_op_matcher m_Constant()
Matches a constant foldable operation.
Definition Matchers.h:369
This trait indicates that a terminator operation is "return-like".