mirror of
https://github.com/RPCSX/llvm.git
synced 2024-11-28 06:00:28 +00:00
9146833fa3
with the new pass manager, and no longer relying on analysis groups. This builds essentially a ground-up new AA infrastructure stack for LLVM. The core ideas are the same that are used throughout the new pass manager: type erased polymorphism and direct composition. The design is as follows: - FunctionAAResults is a type-erasing alias analysis results aggregation interface to walk a single query across a range of results from different alias analyses. Currently this is function-specific as we always assume that aliasing queries are *within* a function. - AAResultBase is a CRTP utility providing stub implementations of various parts of the alias analysis result concept, notably in several cases in terms of other more general parts of the interface. This can be used to implement only a narrow part of the interface rather than the entire interface. This isn't really ideal, this logic should be hoisted into FunctionAAResults as currently it will cause a significant amount of redundant work, but it faithfully models the behavior of the prior infrastructure. - All the alias analysis passes are ported to be wrapper passes for the legacy PM and new-style analysis passes for the new PM with a shared result object. In some cases (most notably CFL), this is an extremely naive approach that we should revisit when we can specialize for the new pass manager. - BasicAA has been restructured to reflect that it is much more fundamentally a function analysis because it uses dominator trees and loop info that need to be constructed for each function. All of the references to getting alias analysis results have been updated to use the new aggregation interface. All the preservation and other pass management code has been updated accordingly. The way the FunctionAAResultsWrapperPass works is to detect the available alias analyses when run, and add them to the results object. This means that we should be able to continue to respect when various passes are added to the pipeline, for example adding CFL or adding TBAA passes should just cause their results to be available and to get folded into this. The exception to this rule is BasicAA which really needs to be a function pass due to using dominator trees and loop info. As a consequence, the FunctionAAResultsWrapperPass directly depends on BasicAA and always includes it in the aggregation. This has significant implications for preserving analyses. Generally, most passes shouldn't bother preserving FunctionAAResultsWrapperPass because rebuilding the results just updates the set of known AA passes. The exception to this rule are LoopPass instances which need to preserve all the function analyses that the loop pass manager will end up needing. This means preserving both BasicAAWrapperPass and the aggregating FunctionAAResultsWrapperPass. Now, when preserving an alias analysis, you do so by directly preserving that analysis. This is only necessary for non-immutable-pass-provided alias analyses though, and there are only three of interest: BasicAA, GlobalsAA (formerly GlobalsModRef), and SCEVAA. Usually BasicAA is preserved when needed because it (like DominatorTree and LoopInfo) is marked as a CFG-only pass. I've expanded GlobalsAA into the preserved set everywhere we previously were preserving all of AliasAnalysis, and I've added SCEVAA in the intersection of that with where we preserve SCEV itself. One significant challenge to all of this is that the CGSCC passes were actually using the alias analysis implementations by taking advantage of a pretty amazing set of loop holes in the old pass manager's analysis management code which allowed analysis groups to slide through in many cases. Moving away from analysis groups makes this problem much more obvious. To fix it, I've leveraged the flexibility the design of the new PM components provides to just directly construct the relevant alias analyses for the relevant functions in the IPO passes that need them. This is a bit hacky, but should go away with the new pass manager, and is already in many ways cleaner than the prior state. Another significant challenge is that various facilities of the old alias analysis infrastructure just don't fit any more. The most significant of these is the alias analysis 'counter' pass. That pass relied on the ability to snoop on AA queries at different points in the analysis group chain. Instead, I'm planning to build printing functionality directly into the aggregation layer. I've not included that in this patch merely to keep it smaller. Note that all of this needs a nearly complete rewrite of the AA documentation. I'm planning to do that, but I'd like to make sure the new design settles, and to flesh out a bit more of what it looks like in the new pass manager first. Differential Revision: http://reviews.llvm.org/D12080 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@247167 91177308-0d34-0410-b5e6-96231b3b80d8
106 lines
2.5 KiB
LLVM
106 lines
2.5 KiB
LLVM
; RUN: opt < %s -analyze -basicaa -globals-aa -da | FileCheck %s
|
|
define void @i32_subscript(i32* %a) {
|
|
entry:
|
|
br label %for.body
|
|
|
|
for.body:
|
|
%i = phi i32 [ 0, %entry ], [ %i.inc, %for.body ]
|
|
%a.addr = getelementptr i32, i32* %a, i32 %i
|
|
%a.addr.2 = getelementptr i32, i32* %a, i32 5
|
|
%0 = load i32, i32* %a.addr, align 4
|
|
%1 = add i32 %0, 1
|
|
store i32 %1, i32* %a.addr.2, align 4
|
|
%i.inc = add nsw i32 %i, 1
|
|
%i.inc.ext = sext i32 %i to i64
|
|
%exitcond = icmp ne i64 %i.inc.ext, 100
|
|
br i1 %exitcond, label %for.body, label %for.end
|
|
|
|
for.end:
|
|
ret void
|
|
}
|
|
; CHECK: none
|
|
; CHECK: anti
|
|
; CHECK: output
|
|
|
|
|
|
; Test for a bug, which caused an assert in ScalarEvolution because
|
|
; the Dependence Analyzer attempted to zero extend a type to a smaller
|
|
; type.
|
|
|
|
; void t(unsigned int *a, unsigned int n) {
|
|
; for (unsigned int i = 0; i != n; i++) {
|
|
; a[(unsigned short)i] = g;
|
|
; }}
|
|
|
|
@g = common global i32 0, align 4
|
|
|
|
define void @t(i32* noalias %a, i32 %n) nounwind {
|
|
entry:
|
|
%cmp1 = icmp eq i32 %n, 0
|
|
br i1 %cmp1, label %for.end, label %for.body
|
|
|
|
for.body:
|
|
%i.02 = phi i32 [ %inc, %for.body ], [ 0, %entry ]
|
|
%0 = load i32, i32* @g, align 4
|
|
%idxprom = and i32 %i.02, 65535
|
|
%arrayidx = getelementptr inbounds i32, i32* %a, i32 %idxprom
|
|
store i32 %0, i32* %arrayidx, align 4
|
|
%inc = add i32 %i.02, 1
|
|
%cmp = icmp eq i32 %inc, %n
|
|
br i1 %cmp, label %for.end, label %for.body
|
|
|
|
for.end:
|
|
ret void
|
|
}
|
|
; CHECK: input
|
|
; CHECK: none
|
|
; CHECK: output
|
|
|
|
define void @i16_wrap(i64* %a) {
|
|
entry:
|
|
br label %for.body
|
|
for.body:
|
|
%i = phi i64 [0, %entry], [%i.inc, %for.inc]
|
|
%i.tr = trunc i64 %i to i16
|
|
%idx = getelementptr i64, i64* %a, i16 %i.tr
|
|
%0 = load i64, i64* %idx
|
|
%1 = add i64 %0, 1
|
|
store i64 %1, i64* %idx
|
|
br label %for.inc
|
|
|
|
for.inc:
|
|
%i.inc = add nuw i64 %i, 1
|
|
%cmp = icmp ult i64 %i.inc, 17179869184
|
|
br i1 %cmp, label %for.body, label %for.end
|
|
for.end:
|
|
ret void
|
|
}
|
|
; CHECK: input
|
|
; CHECK: anti
|
|
; CHECK: output
|
|
|
|
define void @i8_stride_wrap(i32* noalias %a, i32* noalias %b) {
|
|
entry:
|
|
br label %for.body
|
|
for.body:
|
|
%i = phi i32 [1,%entry], [%i.inc, %for.inc]
|
|
%i.tr = trunc i32 %i to i8
|
|
%idx = getelementptr i32, i32* %a, i8 %i.tr
|
|
%idx.2 = getelementptr i32, i32* %b, i32 %i
|
|
%0 = load i32, i32* %idx, align 4
|
|
%1 = add i32 %0, 1
|
|
store i32 %1, i32* %idx.2, align 4
|
|
br label %for.inc
|
|
|
|
for.inc:
|
|
%i.inc = add nsw i32 %i, 256
|
|
%exitcond = icmp ult i32 %i, 65536
|
|
br i1 %exitcond, label %for.body, label %for.end
|
|
|
|
for.end:
|
|
ret void
|
|
}
|
|
; CHECK: input
|
|
; CHECK: none
|
|
; CHECK: none
|