134 lines
6.8 KiB
LLVM
134 lines
6.8 KiB
LLVM
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
|
|
; RUN: opt -simplifycfg -simplifycfg-require-and-preserve-domtree=1 -S < %s | FileCheck %s --check-prefix=SIMPLIFYCFG
|
|
; RUN: opt -instcombine -S < %s | FileCheck %s --check-prefix=INSTCOMBINEONLY
|
|
; RUN: opt -instcombine -simplifycfg -simplifycfg-require-and-preserve-domtree=1 -S < %s | FileCheck %s --check-prefix=INSTCOMBINESIMPLIFYCFGONLY
|
|
; RUN: opt -instcombine -simplifycfg -simplifycfg-require-and-preserve-domtree=1 -instcombine -S < %s | FileCheck %s --check-prefix=INSTCOMBINESIMPLIFYCFGINSTCOMBINE
|
|
; RUN: opt -instcombine -simplifycfg -simplifycfg-require-and-preserve-domtree=1 -phi-node-folding-threshold=3 -S < %s | FileCheck %s --check-prefix=INSTCOMBINESIMPLIFYCFGONLY
|
|
; RUN: opt -instcombine -simplifycfg -simplifycfg-require-and-preserve-domtree=1 -instcombine -phi-node-folding-threshold=3 -S < %s | FileCheck %s --check-prefix=INSTCOMBINESIMPLIFYCFGINSTCOMBINE
|
|
|
|
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
|
|
target triple = "x86_64-pc-linux-gnu"
|
|
|
|
; #include <limits>
|
|
; #include <cstdint>
|
|
;
|
|
; using size_type = std::size_t;
|
|
; bool will_not_overflow(size_type size, size_type nmemb) {
|
|
; return (size != 0 && (nmemb > std::numeric_limits<size_type>::max() / size));
|
|
; }
|
|
|
|
define i1 @will_not_overflow(i64 %arg, i64 %arg1) {
|
|
; SIMPLIFYCFG-LABEL: @will_not_overflow(
|
|
; SIMPLIFYCFG-NEXT: bb:
|
|
; SIMPLIFYCFG-NEXT: [[T0:%.*]] = icmp eq i64 [[ARG:%.*]], 0
|
|
; SIMPLIFYCFG-NEXT: br i1 [[T0]], label [[BB5:%.*]], label [[BB2:%.*]]
|
|
; SIMPLIFYCFG: bb2:
|
|
; SIMPLIFYCFG-NEXT: [[T3:%.*]] = udiv i64 -1, [[ARG]]
|
|
; SIMPLIFYCFG-NEXT: [[T4:%.*]] = icmp ult i64 [[T3]], [[ARG1:%.*]]
|
|
; SIMPLIFYCFG-NEXT: br label [[BB5]]
|
|
; SIMPLIFYCFG: bb5:
|
|
; SIMPLIFYCFG-NEXT: [[T6:%.*]] = phi i1 [ false, [[BB:%.*]] ], [ [[T4]], [[BB2]] ]
|
|
; SIMPLIFYCFG-NEXT: ret i1 [[T6]]
|
|
;
|
|
; INSTCOMBINEONLY-LABEL: @will_not_overflow(
|
|
; INSTCOMBINEONLY-NEXT: bb:
|
|
; INSTCOMBINEONLY-NEXT: [[T0:%.*]] = icmp eq i64 [[ARG:%.*]], 0
|
|
; INSTCOMBINEONLY-NEXT: br i1 [[T0]], label [[BB5:%.*]], label [[BB2:%.*]]
|
|
; INSTCOMBINEONLY: bb2:
|
|
; INSTCOMBINEONLY-NEXT: [[UMUL:%.*]] = call { i64, i1 } @llvm.umul.with.overflow.i64(i64 [[ARG]], i64 [[ARG1:%.*]])
|
|
; INSTCOMBINEONLY-NEXT: [[UMUL_OV:%.*]] = extractvalue { i64, i1 } [[UMUL]], 1
|
|
; INSTCOMBINEONLY-NEXT: br label [[BB5]]
|
|
; INSTCOMBINEONLY: bb5:
|
|
; INSTCOMBINEONLY-NEXT: [[T6:%.*]] = phi i1 [ false, [[BB:%.*]] ], [ [[UMUL_OV]], [[BB2]] ]
|
|
; INSTCOMBINEONLY-NEXT: ret i1 [[T6]]
|
|
;
|
|
; INSTCOMBINESIMPLIFYCFGONLY-LABEL: @will_not_overflow(
|
|
; INSTCOMBINESIMPLIFYCFGONLY-NEXT: bb:
|
|
; INSTCOMBINESIMPLIFYCFGONLY-NEXT: [[T0:%.*]] = icmp eq i64 [[ARG:%.*]], 0
|
|
; INSTCOMBINESIMPLIFYCFGONLY-NEXT: [[UMUL:%.*]] = call { i64, i1 } @llvm.umul.with.overflow.i64(i64 [[ARG]], i64 [[ARG1:%.*]])
|
|
; INSTCOMBINESIMPLIFYCFGONLY-NEXT: [[UMUL_OV:%.*]] = extractvalue { i64, i1 } [[UMUL]], 1
|
|
; INSTCOMBINESIMPLIFYCFGONLY-NEXT: [[T6:%.*]] = select i1 [[T0]], i1 false, i1 [[UMUL_OV]]
|
|
; INSTCOMBINESIMPLIFYCFGONLY-NEXT: ret i1 [[T6]]
|
|
;
|
|
; INSTCOMBINESIMPLIFYCFGINSTCOMBINE-LABEL: @will_not_overflow(
|
|
; INSTCOMBINESIMPLIFYCFGINSTCOMBINE-NEXT: bb:
|
|
; INSTCOMBINESIMPLIFYCFGINSTCOMBINE-NEXT: [[ARG1_FR:%.*]] = freeze i64 [[ARG1:%.*]]
|
|
; INSTCOMBINESIMPLIFYCFGINSTCOMBINE-NEXT: [[UMUL:%.*]] = call { i64, i1 } @llvm.umul.with.overflow.i64(i64 [[ARG:%.*]], i64 [[ARG1_FR]])
|
|
; INSTCOMBINESIMPLIFYCFGINSTCOMBINE-NEXT: [[UMUL_OV:%.*]] = extractvalue { i64, i1 } [[UMUL]], 1
|
|
; INSTCOMBINESIMPLIFYCFGINSTCOMBINE-NEXT: ret i1 [[UMUL_OV]]
|
|
;
|
|
bb:
|
|
%t0 = icmp eq i64 %arg, 0
|
|
br i1 %t0, label %bb5, label %bb2
|
|
|
|
bb2: ; preds = %bb
|
|
%t3 = udiv i64 -1, %arg
|
|
%t4 = icmp ult i64 %t3, %arg1
|
|
br label %bb5
|
|
|
|
bb5: ; preds = %bb2, %bb
|
|
%t6 = phi i1 [ false, %bb ], [ %t4, %bb2 ]
|
|
ret i1 %t6
|
|
}
|
|
|
|
; Same as @will_not_overflow, but inverting return value.
|
|
|
|
define i1 @will_overflow(i64 %arg, i64 %arg1) {
|
|
; SIMPLIFYCFG-LABEL: @will_overflow(
|
|
; SIMPLIFYCFG-NEXT: bb:
|
|
; SIMPLIFYCFG-NEXT: [[T0:%.*]] = icmp eq i64 [[ARG:%.*]], 0
|
|
; SIMPLIFYCFG-NEXT: br i1 [[T0]], label [[BB5:%.*]], label [[BB2:%.*]]
|
|
; SIMPLIFYCFG: bb2:
|
|
; SIMPLIFYCFG-NEXT: [[T3:%.*]] = udiv i64 -1, [[ARG]]
|
|
; SIMPLIFYCFG-NEXT: [[T4:%.*]] = icmp ult i64 [[T3]], [[ARG1:%.*]]
|
|
; SIMPLIFYCFG-NEXT: br label [[BB5]]
|
|
; SIMPLIFYCFG: bb5:
|
|
; SIMPLIFYCFG-NEXT: [[T6:%.*]] = phi i1 [ false, [[BB:%.*]] ], [ [[T4]], [[BB2]] ]
|
|
; SIMPLIFYCFG-NEXT: [[T7:%.*]] = xor i1 [[T6]], true
|
|
; SIMPLIFYCFG-NEXT: ret i1 [[T7]]
|
|
;
|
|
; INSTCOMBINEONLY-LABEL: @will_overflow(
|
|
; INSTCOMBINEONLY-NEXT: bb:
|
|
; INSTCOMBINEONLY-NEXT: [[T0:%.*]] = icmp eq i64 [[ARG:%.*]], 0
|
|
; INSTCOMBINEONLY-NEXT: br i1 [[T0]], label [[BB5:%.*]], label [[BB2:%.*]]
|
|
; INSTCOMBINEONLY: bb2:
|
|
; INSTCOMBINEONLY-NEXT: [[UMUL:%.*]] = call { i64, i1 } @llvm.umul.with.overflow.i64(i64 [[ARG]], i64 [[ARG1:%.*]])
|
|
; INSTCOMBINEONLY-NEXT: [[UMUL_OV:%.*]] = extractvalue { i64, i1 } [[UMUL]], 1
|
|
; INSTCOMBINEONLY-NEXT: [[PHI_BO:%.*]] = xor i1 [[UMUL_OV]], true
|
|
; INSTCOMBINEONLY-NEXT: br label [[BB5]]
|
|
; INSTCOMBINEONLY: bb5:
|
|
; INSTCOMBINEONLY-NEXT: [[T6:%.*]] = phi i1 [ true, [[BB:%.*]] ], [ [[PHI_BO]], [[BB2]] ]
|
|
; INSTCOMBINEONLY-NEXT: ret i1 [[T6]]
|
|
;
|
|
; INSTCOMBINESIMPLIFYCFGONLY-LABEL: @will_overflow(
|
|
; INSTCOMBINESIMPLIFYCFGONLY-NEXT: bb:
|
|
; INSTCOMBINESIMPLIFYCFGONLY-NEXT: [[T0:%.*]] = icmp eq i64 [[ARG:%.*]], 0
|
|
; INSTCOMBINESIMPLIFYCFGONLY-NEXT: [[UMUL:%.*]] = call { i64, i1 } @llvm.umul.with.overflow.i64(i64 [[ARG]], i64 [[ARG1:%.*]])
|
|
; INSTCOMBINESIMPLIFYCFGONLY-NEXT: [[UMUL_OV:%.*]] = extractvalue { i64, i1 } [[UMUL]], 1
|
|
; INSTCOMBINESIMPLIFYCFGONLY-NEXT: [[PHI_BO:%.*]] = xor i1 [[UMUL_OV]], true
|
|
; INSTCOMBINESIMPLIFYCFGONLY-NEXT: [[T6:%.*]] = select i1 [[T0]], i1 true, i1 [[PHI_BO]]
|
|
; INSTCOMBINESIMPLIFYCFGONLY-NEXT: ret i1 [[T6]]
|
|
;
|
|
; INSTCOMBINESIMPLIFYCFGINSTCOMBINE-LABEL: @will_overflow(
|
|
; INSTCOMBINESIMPLIFYCFGINSTCOMBINE-NEXT: bb:
|
|
; INSTCOMBINESIMPLIFYCFGINSTCOMBINE-NEXT: [[ARG1_FR:%.*]] = freeze i64 [[ARG1:%.*]]
|
|
; INSTCOMBINESIMPLIFYCFGINSTCOMBINE-NEXT: [[UMUL:%.*]] = call { i64, i1 } @llvm.umul.with.overflow.i64(i64 [[ARG:%.*]], i64 [[ARG1_FR]])
|
|
; INSTCOMBINESIMPLIFYCFGINSTCOMBINE-NEXT: [[UMUL_OV:%.*]] = extractvalue { i64, i1 } [[UMUL]], 1
|
|
; INSTCOMBINESIMPLIFYCFGINSTCOMBINE-NEXT: [[PHI_BO:%.*]] = xor i1 [[UMUL_OV]], true
|
|
; INSTCOMBINESIMPLIFYCFGINSTCOMBINE-NEXT: ret i1 [[PHI_BO]]
|
|
;
|
|
bb:
|
|
%t0 = icmp eq i64 %arg, 0
|
|
br i1 %t0, label %bb5, label %bb2
|
|
|
|
bb2: ; preds = %bb
|
|
%t3 = udiv i64 -1, %arg
|
|
%t4 = icmp ult i64 %t3, %arg1
|
|
br label %bb5
|
|
|
|
bb5: ; preds = %bb2, %bb
|
|
%t6 = phi i1 [ false, %bb ], [ %t4, %bb2 ]
|
|
%t7 = xor i1 %t6, true
|
|
ret i1 %t7
|
|
}
|