brintos

brintos / llvm-project-archived public Read only

0
0
Text · 1.6 KiB · 1da4f63 Raw
35 lines · plain
1// RUN: fir-opt --canonicalize %s | FileCheck %s2 3// No folding for !fir.box<none>.4func.func @test_none(%arg0: !fir.box<none>) -> i1 {5  %0 = fir.is_contiguous_box %arg0 whole : (!fir.box<none>) -> i16  return %0 : i17}8// CHECK-LABEL:   func.func @test_none(9// CHECK-SAME:                         %[[VAL_0:[0-9]+|[a-zA-Z$._-][a-zA-Z0-9$._-]*]]: !fir.box<none>) -> i1 {10// CHECK:           %[[VAL_1:.*]] = fir.is_contiguous_box %[[VAL_0]] whole : (!fir.box<none>) -> i111// CHECK:           return %[[VAL_1]] : i112// CHECK:         }13 14// No folding for assumed rank arrays.15func.func @test_assumed_rank(%arg0: !fir.box<!fir.array<*:f32>>) -> i1 {16  %0 = fir.is_contiguous_box %arg0 innermost : (!fir.box<!fir.array<*:f32>>) -> i117  return %0 : i118}19// CHECK-LABEL:   func.func @test_assumed_rank(20// CHECK-SAME:                                 %[[VAL_0:[0-9]+|[a-zA-Z$._-][a-zA-Z0-9$._-]*]]: !fir.box<!fir.array<*:f32>>) -> i1 {21// CHECK:           %[[VAL_1:.*]] = fir.is_contiguous_box %[[VAL_0]] innermost : (!fir.box<!fir.array<*:f32>>) -> i122// CHECK:           return %[[VAL_1]] : i123// CHECK:         }24 25// Scalars are always contiguous.26func.func @test_scalar(%arg0: !fir.class<!fir.type<sometype{i:i32}>>) -> i1 {27  %0 = fir.is_contiguous_box %arg0 whole : (!fir.class<!fir.type<sometype{i:i32}>>) -> i128  return %0 : i129}30// CHECK-LABEL:   func.func @test_scalar(31// CHECK-SAME:                           %[[VAL_0:[0-9]+|[a-zA-Z$._-][a-zA-Z0-9$._-]*]]: !fir.class<!fir.type<sometype{i:i32}>>) -> i1 {32// CHECK:           %[[VAL_1:.*]] = arith.constant true33// CHECK:           return %[[VAL_1]] : i134// CHECK:         }35