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
38 lines
1.2 KiB
LLVM
38 lines
1.2 KiB
LLVM
; This testcase ensures that CFL AA answers queries soundly when callee tries
|
|
; to return an unknown pointer
|
|
|
|
; RUN: opt < %s -disable-basicaa -cfl-steens-aa -aa-eval -print-all-alias-modref-info -disable-output 2>&1 | FileCheck %s
|
|
; RUN: opt < %s -aa-pipeline=cfl-steens-aa -passes=aa-eval -print-all-alias-modref-info -disable-output 2>&1 | FileCheck %s
|
|
|
|
@g = external global i32
|
|
define i32* @return_unknown_callee(i32* %arg1, i32* %arg2) {
|
|
ret i32* @g
|
|
}
|
|
; CHECK-LABEL: Function: test_return_unknown
|
|
; CHECK: NoAlias: i32* %a, i32* %b
|
|
; CHECK: MayAlias: i32* %c, i32* %x
|
|
; CHECK: NoAlias: i32* %a, i32* %c
|
|
; CHECK: NoAlias: i32* %b, i32* %c
|
|
define void @test_return_unknown(i32* %x) {
|
|
%a = alloca i32, align 4
|
|
%b = alloca i32, align 4
|
|
|
|
%c = call i32* @return_unknown_callee(i32* %a, i32* %b)
|
|
|
|
ret void
|
|
}
|
|
|
|
@g2 = external global i32*
|
|
define i32** @return_unknown_callee2() {
|
|
ret i32** @g2
|
|
}
|
|
; CHECK-LABEL: Function: test_return_unknown2
|
|
; CHECK: MayAlias: i32* %x, i32** %a
|
|
; CHECK: MayAlias: i32* %b, i32* %x
|
|
; CHECK: MayAlias: i32* %b, i32** %a
|
|
define void @test_return_unknown2(i32* %x) {
|
|
%a = call i32** @return_unknown_callee2()
|
|
%b = load i32*, i32** %a
|
|
|
|
ret void
|
|
} |