a004da0d77
This provides a sizable compile time improvement by seeding the worklist in an order that leads to less iterations of the worklist. This patch only changes the behavior of the Canonicalize pass itself, it does not affect other passes that use the GreedyPatternRewrite driver Differential Revision: https://reviews.llvm.org/D103053
45 lines
1.9 KiB
MLIR
45 lines
1.9 KiB
MLIR
// RUN: mlir-opt %s --test-loop-unrolling="unroll-factor=3" -split-input-file -canonicalize | FileCheck %s
|
|
|
|
// CHECK-LABEL: scf_loop_unroll_single
|
|
func @scf_loop_unroll_single(%arg0 : f32, %arg1 : f32) -> f32 {
|
|
%from = constant 0 : index
|
|
%to = constant 10 : index
|
|
%step = constant 1 : index
|
|
%sum = scf.for %iv = %from to %to step %step iter_args(%sum_iter = %arg0) -> (f32) {
|
|
%next = addf %sum_iter, %arg1 : f32
|
|
scf.yield %next : f32
|
|
}
|
|
// CHECK: %[[SUM:.*]] = scf.for %{{.*}} = %{{.*}} to %{{.*}} step %{{.*}} iter_args(%[[V0:.*]] =
|
|
// CHECK-NEXT: %[[V1:.*]] = addf %[[V0]]
|
|
// CHECK-NEXT: %[[V2:.*]] = addf %[[V1]]
|
|
// CHECK-NEXT: %[[V3:.*]] = addf %[[V2]]
|
|
// CHECK-NEXT: scf.yield %[[V3]]
|
|
// CHECK-NEXT: }
|
|
// CHECK-NEXT: %[[RES:.*]] = addf %[[SUM]],
|
|
// CHECK-NEXT: return %[[RES]]
|
|
return %sum : f32
|
|
}
|
|
|
|
// CHECK-LABEL: scf_loop_unroll_double_symbolic_ub
|
|
// CHECK-SAME: (%{{.*}}: f32, %{{.*}}: f32, %[[N:.*]]: index)
|
|
func @scf_loop_unroll_double_symbolic_ub(%arg0 : f32, %arg1 : f32, %n : index) -> (f32,f32) {
|
|
%from = constant 0 : index
|
|
%step = constant 1 : index
|
|
%sum:2 = scf.for %iv = %from to %n step %step iter_args(%i0 = %arg0, %i1 = %arg1) -> (f32, f32) {
|
|
%sum0 = addf %i0, %arg0 : f32
|
|
%sum1 = addf %i1, %arg1 : f32
|
|
scf.yield %sum0, %sum1 : f32, f32
|
|
}
|
|
return %sum#0, %sum#1 : f32, f32
|
|
// CHECK-DAG: %[[C0:.*]] = constant 0 : index
|
|
// CHECK-DAG: %[[C1:.*]] = constant 1 : index
|
|
// CHECK-DAG: %[[C3:.*]] = constant 3 : index
|
|
// CHECK-NEXT: %[[REM:.*]] = remi_signed %[[N]], %[[C3]]
|
|
// CHECK-NEXT: %[[UB:.*]] = subi %[[N]], %[[REM]]
|
|
// CHECK-NEXT: %[[SUM:.*]]:2 = scf.for {{.*}} = %[[C0]] to %[[UB]] step %[[C3]] iter_args
|
|
// CHECK: }
|
|
// CHECK-NEXT: %[[SUM1:.*]]:2 = scf.for {{.*}} = %[[UB]] to %[[N]] step %[[C1]] iter_args(%[[V1:.*]] = %[[SUM]]#0, %[[V2:.*]] = %[[SUM]]#1)
|
|
// CHECK: }
|
|
// CHECK-NEXT: return %[[SUM1]]#0, %[[SUM1]]#1
|
|
}
|