[polly] r232710 - Add forgotten 'FileCheck' to tiling test cases

Tobias Grosser tobias at grosser.es
Thu Mar 19 00:39:36 PDT 2015


Author: grosser
Date: Thu Mar 19 02:39:34 2015
New Revision: 232710

URL: http://llvm.org/viewvc/llvm-project?rev=232710&view=rev
Log:
Add forgotten 'FileCheck' to tiling test cases

These test cases did not verify the CHECK lines at all. We add the FileCheck
and also fix some broken CHECK lines. Being here, we extend the checks to
cover the whole loop structure.

Modified:
    polly/trunk/test/ScheduleOptimizer/line-tiling-2.ll
    polly/trunk/test/ScheduleOptimizer/line-tiling.ll
    polly/trunk/test/ScheduleOptimizer/rectangular-tiling.ll

Modified: polly/trunk/test/ScheduleOptimizer/line-tiling-2.ll
URL: http://llvm.org/viewvc/llvm-project/polly/trunk/test/ScheduleOptimizer/line-tiling-2.ll?rev=232710&r1=232709&r2=232710&view=diff
==============================================================================
--- polly/trunk/test/ScheduleOptimizer/line-tiling-2.ll (original)
+++ polly/trunk/test/ScheduleOptimizer/line-tiling-2.ll Thu Mar 19 02:39:34 2015
@@ -1,8 +1,10 @@
-; RUN: opt %loadPolly -polly-detect-unprofitable -polly-opt-isl -analyze -polly-no-tiling=0 -polly-ast -polly-tile-sizes=1,64 < %s
-; CHECK: c0 += 1
-; CHECK: c1 += 64
-; CHECK: c1 <= c1 + 63
-; ModuleID = 'line-tiling-2.ll'
+; RUN: opt %loadPolly -polly-detect-unprofitable -polly-opt-isl -analyze -polly-no-tiling=0 -polly-ast -polly-tile-sizes=1,64 < %s | FileCheck %s
+
+; CHECK: for (int c0 = 0; c0 <= 1023; c0 += 1)
+; CHECK:   for (int c1 = 0; c1 <= 511; c1 += 64)
+; CHECK:     for (int c3 = c1; c3 <= c1 + 63; c3 += 1)
+; CHECK:       Stmt_for_body3(c0, c3);
+
 target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"
 
 ; Function Attrs: nounwind

Modified: polly/trunk/test/ScheduleOptimizer/line-tiling.ll
URL: http://llvm.org/viewvc/llvm-project/polly/trunk/test/ScheduleOptimizer/line-tiling.ll?rev=232710&r1=232709&r2=232710&view=diff
==============================================================================
--- polly/trunk/test/ScheduleOptimizer/line-tiling.ll (original)
+++ polly/trunk/test/ScheduleOptimizer/line-tiling.ll Thu Mar 19 02:39:34 2015
@@ -1,8 +1,10 @@
-; RUN: opt %loadPolly -polly-detect-unprofitable -polly-opt-isl -analyze -polly-no-tiling=0 -polly-ast -polly-tile-sizes=64,1 < %s
-; CHECK: c0 += 64
-; CHECK: c1 += 1
-; CHECK: c0 <= c0 + 63
-; ModuleID = 'line-tiling.ll'
+; RUN: opt %loadPolly -polly-detect-unprofitable -polly-opt-isl -analyze -polly-no-tiling=0 -polly-ast -polly-tile-sizes=64,1 < %s | FileCheck %s
+
+; CHECK: for (int c0 = 0; c0 <= 1023; c0 += 64)
+; CHECK:   for (int c1 = 0; c1 <= 511; c1 += 1)
+; CHECK:     for (int c2 = c0; c2 <= c0 + 63; c2 += 1)
+; CHECK:       Stmt_for_body3(c2, c1);
+
 target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"
 
 ; Function Attrs: nounwind

Modified: polly/trunk/test/ScheduleOptimizer/rectangular-tiling.ll
URL: http://llvm.org/viewvc/llvm-project/polly/trunk/test/ScheduleOptimizer/rectangular-tiling.ll?rev=232710&r1=232709&r2=232710&view=diff
==============================================================================
--- polly/trunk/test/ScheduleOptimizer/rectangular-tiling.ll (original)
+++ polly/trunk/test/ScheduleOptimizer/rectangular-tiling.ll Thu Mar 19 02:39:34 2015
@@ -1,9 +1,11 @@
-; RUN: opt %loadPolly -polly-detect-unprofitable -polly-opt-isl -analyze -polly-no-tiling=0 -polly-ast -polly-tile-sizes=256,16 < %s
-; CHECK: c0 += 256
-; CHECK: c1 += 16
-; CHECK: c0 <= c0 + 255
-; CHECK: c1 <= c1 + 15
-; ModuleID = 'rectangular-tiling.ll'
+; RUN: opt %loadPolly -polly-detect-unprofitable -polly-opt-isl -analyze -polly-no-tiling=0 -polly-ast -polly-tile-sizes=256,16 < %s | FileCheck %s
+
+; CHECK: for (int c0 = 0; c0 <= 1023; c0 += 256)
+; CHECK:   for (int c1 = 0; c1 <= 511; c1 += 16)
+; CHECK:     for (int c2 = c0; c2 <= c0 + 255; c2 += 1)
+; CHECK:       for (int c3 = c1; c3 <= c1 + 15; c3 += 1)
+; CHECK:         Stmt_for_body3(c2, c3);
+
 target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"
 
 ; Function Attrs: nounwind





More information about the llvm-commits mailing list