bfa401e5ad
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
19 lines
605 B
LLVM
19 lines
605 B
LLVM
; This testcase consists of alias relations which should be completely
|
|
; resolvable by cfl-steens-aa (derived from BasicAA/2003-11-04-SimpleCases.ll).
|
|
|
|
; RUN: opt < %s -cfl-steens-aa -aa-eval -print-may-aliases -disable-output 2>&1 | FileCheck %s
|
|
|
|
%T = type { i32, [10 x i8] }
|
|
|
|
; CHECK: Function: test
|
|
; CHECK-NOT: May:
|
|
|
|
define void @test(%T* %P) {
|
|
%A = getelementptr %T, %T* %P, i64 0
|
|
%B = getelementptr %T, %T* %P, i64 0, i32 0
|
|
%C = getelementptr %T, %T* %P, i64 0, i32 1
|
|
%D = getelementptr %T, %T* %P, i64 0, i32 1, i64 0
|
|
%E = getelementptr %T, %T* %P, i64 0, i32 1, i64 5
|
|
ret void
|
|
}
|