maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/polly/test/IstAstInfo/domain_bounded_only_with_co...

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

51 lines
1.2 KiB
LLVM
Raw Normal View History

[polly] Introduce -polly-print-* passes to replace -analyze. The `opt -analyze` option only works with the legacy pass manager and might be removed in the future, as explained in llvm.org/PR53733. This patch introduced -polly-print-* passes that print what the pass would print with the `-analyze` option and replaces all uses of `-analyze` in the regression tests. There are two exceptions: `CodeGen\single_loop_param_less_equal.ll` and `CodeGen\loop_with_condition_nested.ll` use `-analyze on the `-loops` pass which is not part of Polly. Reviewed By: aeubanks Differential Revision: https://reviews.llvm.org/D120782
2022-03-14 21:39:25 +08:00
; RUN: opt %loadPolly -polly-print-ast -disable-output < %s | FileCheck %s
IslAst: always use the context during ast generation Providing the context to the ast generator allows for additional simplifcations and -- more importantly -- allows to generate loops with only partially bounded domains, assuming the domains are bounded for all parameter configurations that are valid as defined by the context. This change fixes the crash reported in http://llvm.org/PR30956 The original reason why we did not include the context when generating an AST was that CLooG and later isl used to sometimes transfer some of the constraints that bound the size of parameters from the context into the generated AST. This resulted in operations with very large constants, which sometimes introduced problematic integer overflows. The latest versions of the isl AST generator are careful to not introduce such constants. Reported-by: Eli Friedman <efriedma@codeaurora.org> llvm-svn: 286442
2016-11-10 17:39:58 +08:00
; CHECK: {
; CHECK-NEXT: if (p <= -1 || p >= 1)
; CHECK-NEXT: Stmt_preheader();
; CHECK-NEXT: for (int c0 = 0; c0 < 2 * p; c0 += 1)
; CHECK-NEXT: Stmt_loop(c0);
; CHECK-NEXT: if (p <= -1) {
; CHECK-NEXT: for (int c0 = 0; c0 <= 2 * p + 255; c0 += 1)
; CHECK-NEXT: Stmt_loop(c0);
; CHECK-NEXT: } else if (p == 0) {
; CHECK-NEXT: Stmt_side();
; CHECK-NEXT: }
; CHECK-NEXT: }
target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-a:0:32-n32-S64"
define void @zot(float* %A, i32 %arg) {
bb:
%p = ashr i32 %arg, 25
%tmpEven = shl nsw i32 %p, 1
%tmp3 = and i32 %tmpEven, 254
br label %cond
cond:
%tmpEvenTrunc = trunc i32 %tmpEven to i8
%br.cmp = icmp eq i8 %tmpEvenTrunc, 0
br i1 %br.cmp, label %side, label %preheader
preheader:
store float 1.0, float* %A
br label %loop
loop:
%indvar = phi i32 [ %indvar.next, %loop ], [ 1, %preheader ]
store float 1.0, float* %A
%indvar.next = add nuw nsw i32 %indvar, 1
%cmp = icmp eq i32 %indvar, %tmp3
br i1 %cmp, label %exit, label %loop
side:
store float 1.0, float* %A
br label %ret
exit:
br label %ret
ret:
ret void
}