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
17 lines
544 B
LLVM
17 lines
544 B
LLVM
; Test case for a bug where we would crash when we were requested to report
|
|
; whether two values that didn't belong to a function (i.e. two globals, etc)
|
|
; aliased.
|
|
|
|
; RUN: opt < %s -cfl-steens-aa -aa-eval -print-may-aliases -disable-output 2>&1 | FileCheck %s
|
|
|
|
@G = private unnamed_addr constant [1 x i8] c"\00", align 1
|
|
|
|
; CHECK: Function: test_no_crash
|
|
; CHECK: 0 no alias responses
|
|
define void @test_no_crash() #0 {
|
|
entry:
|
|
call i8* asm "nop", "=r,r"(
|
|
i8* getelementptr inbounds ([1 x i8], [1 x i8]* @G, i64 0, i64 0))
|
|
ret void
|
|
}
|