mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-23 12:40:17 +00:00
bf301d5670
This provides an implementation of CFL alias analysis (including some supporting data structures). Currently, we don't have any extremely fancy features, sans some interprocedural analysis (i.e. no field sensitivity, etc.), and we do best sitting behind BasicAA + TBAA. In such a configuration, we take ~0.6-0.8% of total compile time, and give ~7-8% NoAlias responses to queries TBAA and BasicAA couldn't answer when bootstrapping LLVM. In testing this on other projects, we've seen up to 10.5% of queries dropped by BasicAA+TBAA answered with NoAlias by this algorithm. Patch by George Burgess IV (with minor modifications by me -- mostly adapting some BasicAA tests), thanks! git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@216970 91177308-0d34-0410-b5e6-96231b3b80d8
31 lines
925 B
LLVM
31 lines
925 B
LLVM
; RUN: opt < %s -cfl-aa -aa-eval -print-all-alias-modref-info 2>&1 | FileCheck %s
|
|
|
|
; CFL AA currently returns PartialAlias, BasicAA returns MayAlias, both seem
|
|
; acceptable (although we might decide that we don't want PartialAlias, and if
|
|
; so, we should update this test case accordingly).
|
|
; CHECK: {{PartialAlias|MayAlias}}: double* %p.0.i.0, double* %p3
|
|
|
|
; %p3 is equal to %p.0.i.0 on the second iteration of the loop,
|
|
; so MayAlias is needed.
|
|
|
|
define void @foo([3 x [3 x double]]* noalias %p) {
|
|
entry:
|
|
%p3 = getelementptr [3 x [3 x double]]* %p, i64 0, i64 0, i64 3
|
|
br label %loop
|
|
|
|
loop:
|
|
%i = phi i64 [ 0, %entry ], [ %i.next, %loop ]
|
|
|
|
%p.0.i.0 = getelementptr [3 x [3 x double]]* %p, i64 0, i64 %i, i64 0
|
|
|
|
store volatile double 0.0, double* %p3
|
|
store volatile double 0.1, double* %p.0.i.0
|
|
|
|
%i.next = add i64 %i, 1
|
|
%cmp = icmp slt i64 %i.next, 3
|
|
br i1 %cmp, label %loop, label %exit
|
|
|
|
exit:
|
|
ret void
|
|
}
|