1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-31 20:51:52 +01:00
George Burgess IV 9f9488ba33 [CFLAA] Split into Anders+Steens analysis.
StratifiedSets (as implemented) is very fast, but its accuracy is also
limited. If we take a more aggressive andersens-like approach, we can be
way more accurate, but we'll also end up being slower.

So, we've decided to split CFLAA into CFLSteensAA and CFLAndersAA.

Long-term, we want to end up in a place where CFLSteens is queried
first; if it can provide an answer, great (since queries are basically
map lookups). Otherwise, we'll fall back to CFLAnders, BasicAA, etc.

This patch splits everything out so we can try to do something like
that when we get a reasonable CFLAnders implementation.

Patch by Jia Chen.

Differential Revision: http://reviews.llvm.org/D21910

llvm-svn: 274589
2016-07-06 00:26:41 +00:00

40 lines
1.1 KiB
LLVM

; RUN: opt < %s -disable-basicaa -cfl-steens-aa -aa-eval -print-may-aliases -disable-output 2>&1 | FileCheck %s
; RUN: opt < %s -aa-pipeline=cfl-steens-aa -passes=aa-eval -print-may-aliases -disable-output 2>&1 | FileCheck %s
; CHECK-LABEL: Function: foo
; CHECK: MayAlias: i32* %A, i32* %B
define void @foo(i32* %A, i32* %B) {
entry:
store i32 0, i32* %A, align 4
store i32 0, i32* %B, align 4
ret void
}
; CHECK-LABEL: Function: bar
; CHECK: MayAlias: i32* %A, i32* %B
; CHECK: MayAlias: i32* %A, i32* %arrayidx
; CHECK: MayAlias: i32* %B, i32* %arrayidx
define void @bar(i32* %A, i32* %B) {
entry:
store i32 0, i32* %A, align 4
%arrayidx = getelementptr inbounds i32, i32* %B, i64 1
store i32 0, i32* %arrayidx, align 4
ret void
}
@G = global i32 0
; CHECK-LABEL: Function: baz
; CHECK: MayAlias: i32* %A, i32* @G
define void @baz(i32* %A) {
entry:
store i32 0, i32* %A, align 4
store i32 0, i32* @G, align 4
ret void
}
; CHECK-LABEL: Alias Analysis Evaluator Report
; CHECK: 5 Total Alias Queries Performed
; CHECK: 0 no alias responses
; CHECK: 5 may alias responses