diff options
| author | Tobias Grosser <grosser@fim.uni-passau.de> | 2011-12-20 10:43:14 +0000 |
|---|---|---|
| committer | Tobias Grosser <grosser@fim.uni-passau.de> | 2011-12-20 10:43:14 +0000 |
| commit | a187964bacba696372c612ea8377a204b8d2f273 (patch) | |
| tree | 52e1015b5ebbfc8bacf35feb8c499009c00cb66c /polly/test/CodeGen | |
| parent | 47151c37b674fadc89a9797f3d54d90402a61748 (diff) | |
| download | bcm5719-llvm-a187964bacba696372c612ea8377a204b8d2f273.tar.gz bcm5719-llvm-a187964bacba696372c612ea8377a204b8d2f273.zip | |
Support non-affine access functions in Polly.
In case we can not analyze an access function, we do not discard the SCoP, but
assume conservatively that all memory accesses that can be derived from our base
pointer may be accessed.
Patch provided by: Marcello Maggioni <hayarms@gmail.com>
llvm-svn: 146972
Diffstat (limited to 'polly/test/CodeGen')
| -rw-r--r-- | polly/test/CodeGen/simple_nonaffine_loop.c | 15 | ||||
| -rw-r--r-- | polly/test/CodeGen/simple_nonaffine_loop.ll | 43 |
2 files changed, 58 insertions, 0 deletions
diff --git a/polly/test/CodeGen/simple_nonaffine_loop.c b/polly/test/CodeGen/simple_nonaffine_loop.c new file mode 100644 index 00000000000..4c351451df1 --- /dev/null +++ b/polly/test/CodeGen/simple_nonaffine_loop.c @@ -0,0 +1,15 @@ +#include <stdio.h> +#include <stdlib.h> +#include <math.h> + +int main() +{ + int A[1024*1024]; + int i; + for (i = 0; i < 1024; i++) + A[i*i] = 2*i; + + printf("Random Value: %d", A[rand() % 1024*1024]); + + return 0; +} diff --git a/polly/test/CodeGen/simple_nonaffine_loop.ll b/polly/test/CodeGen/simple_nonaffine_loop.ll new file mode 100644 index 00000000000..b89c86a817a --- /dev/null +++ b/polly/test/CodeGen/simple_nonaffine_loop.ll @@ -0,0 +1,43 @@ +; RUN: opt %loadPolly %defaultOpts -O3 -polly-cloog -polly-allow-nonaffine -analyze %s | FileCheck %s +; ModuleID = 'simple_nonaffine_loop.c' +target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128" +target triple = "x86_64-apple-macosx10.7.2" + +@.str = private unnamed_addr constant [17 x i8] c"Random Value: %d\00", align 1 + +define i32 @main() nounwind uwtable ssp { +entry: + %A = alloca [1048576 x i32], align 16 + br label %entry.split + +entry.split: ; preds = %entry + br label %for.body + +for.body: ; preds = %entry.split, %for.body + %0 = phi i32 [ 0, %entry.split ], [ %1, %for.body ] + %mul = mul i32 %0, 2 + %mul1 = mul nsw i32 %0, %0 + %idxprom1 = zext i32 %mul1 to i64 + %arrayidx = getelementptr inbounds [1048576 x i32]* %A, i64 0, i64 %idxprom1 + store i32 %mul, i32* %arrayidx, align 4 + %1 = add nsw i32 %0, 1 + %exitcond = icmp ne i32 %1, 1024 + br i1 %exitcond, label %for.body, label %for.end + +for.end: ; preds = %for.body + %call = call i32 @rand() nounwind + %rem = srem i32 %call, 1024 + %mul2 = shl nsw i32 %rem, 10 + %idxprom3 = sext i32 %mul2 to i64 + %arrayidx4 = getelementptr inbounds [1048576 x i32]* %A, i64 0, i64 %idxprom3 + %2 = load i32* %arrayidx4, align 16 + %call5 = call i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([17 x i8]* @.str, i64 0, i64 0), i32 %2) nounwind + ret i32 0 +} + +declare i32 @printf(i8*, ...) + +declare i32 @rand() +; CHECK: for (c2=0;c2<=1023;c2++) { +; CHECK: Stmt_for_body(c2); +; CHECK: } |

