[CIR] Upstream overflow builtins (#166643)
This implements the builtins that handle overflow. This fixes issue https://github.com/llvm/llvm-project/issues/163888
This commit is contained in:
adams381
GitHub
parent
13011fe5c1
commit
5bf7e8a59a
@ -1640,6 +1640,82 @@ def CIR_CmpOp : CIR_Op<"cmp", [Pure, SameTypeOperands]> {
|
||||
let isLLVMLoweringRecursive = true;
|
||||
}
|
||||
|
||||
//===----------------------------------------------------------------------===//
|
||||
// BinOpOverflowOp
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
def CIR_BinOpOverflowKind : CIR_I32EnumAttr<
|
||||
"BinOpOverflowKind", "checked binary arithmetic operation kind", [
|
||||
I32EnumAttrCase<"Add", 0, "add">,
|
||||
I32EnumAttrCase<"Sub", 1, "sub">,
|
||||
I32EnumAttrCase<"Mul", 2, "mul">
|
||||
]>;
|
||||
|
||||
def CIR_BinOpOverflowOp : CIR_Op<"binop.overflow", [Pure, SameTypeOperands]> {
|
||||
let summary = "Perform binary integral arithmetic with overflow checking";
|
||||
let description = [{
|
||||
`cir.binop.overflow` performs binary arithmetic operations with overflow
|
||||
checking on integral operands.
|
||||
|
||||
The `kind` argument specifies the kind of arithmetic operation to perform.
|
||||
It can be either `add`, `sub`, or `mul`. The `lhs` and `rhs` arguments
|
||||
specify the input operands of the arithmetic operation. The types of `lhs`
|
||||
and `rhs` must be the same.
|
||||
|
||||
`cir.binop.overflow` produces two SSA values. `result` is the result of the
|
||||
arithmetic operation truncated to its specified type. `overflow` is a
|
||||
boolean value indicating whether overflow happens during the operation.
|
||||
|
||||
The exact semantic of this operation is as follows:
|
||||
|
||||
- `lhs` and `rhs` are promoted to an imaginary integral type that has
|
||||
infinite precision.
|
||||
- The arithmetic operation is performed on the promoted operands.
|
||||
- The infinite-precision result is truncated to the type of `result`. The
|
||||
truncated result is assigned to `result`.
|
||||
- If the truncated result is equal to the un-truncated result, `overflow`
|
||||
is assigned to false. Otherwise, `overflow` is assigned to true.
|
||||
}];
|
||||
|
||||
let arguments = (ins
|
||||
CIR_BinOpOverflowKind:$kind,
|
||||
CIR_IntType:$lhs,
|
||||
CIR_IntType:$rhs
|
||||
);
|
||||
|
||||
let results = (outs CIR_IntType:$result, CIR_BoolType:$overflow);
|
||||
|
||||
let assemblyFormat = [{
|
||||
`(` $kind `,` $lhs `,` $rhs `)` `:` qualified(type($lhs)) `,`
|
||||
`(` qualified(type($result)) `,` qualified(type($overflow)) `)`
|
||||
attr-dict
|
||||
}];
|
||||
|
||||
let builders = [
|
||||
OpBuilder<(ins "cir::IntType":$resultTy,
|
||||
"cir::BinOpOverflowKind":$kind,
|
||||
"mlir::Value":$lhs,
|
||||
"mlir::Value":$rhs), [{
|
||||
auto overflowTy = cir::BoolType::get($_builder.getContext());
|
||||
build($_builder, $_state, resultTy, overflowTy, kind, lhs, rhs);
|
||||
}]>
|
||||
];
|
||||
|
||||
let extraLLVMLoweringPatternDecl = [{
|
||||
static std::string getLLVMIntrinName(cir::BinOpOverflowKind opKind,
|
||||
bool isSigned, unsigned width);
|
||||
|
||||
struct EncompassedTypeInfo {
|
||||
bool sign;
|
||||
unsigned width;
|
||||
};
|
||||
|
||||
static EncompassedTypeInfo computeEncompassedTypeWidth(cir::IntType operandTy,
|
||||
cir::IntType resultTy);
|
||||
}];
|
||||
}
|
||||
|
||||
|
||||
//===----------------------------------------------------------------------===//
|
||||
// BinOp
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
@ -58,6 +58,45 @@ static RValue emitBuiltinBitOp(CIRGenFunction &cgf, const CallExpr *e,
|
||||
return RValue::get(result);
|
||||
}
|
||||
|
||||
namespace {
|
||||
struct WidthAndSignedness {
|
||||
unsigned width;
|
||||
bool isSigned;
|
||||
};
|
||||
} // namespace
|
||||
|
||||
static WidthAndSignedness
|
||||
getIntegerWidthAndSignedness(const clang::ASTContext &astContext,
|
||||
const clang::QualType type) {
|
||||
assert(type->isIntegerType() && "Given type is not an integer.");
|
||||
unsigned width = type->isBooleanType() ? 1
|
||||
: type->isBitIntType() ? astContext.getIntWidth(type)
|
||||
: astContext.getTypeInfo(type).Width;
|
||||
bool isSigned = type->isSignedIntegerType();
|
||||
return {width, isSigned};
|
||||
}
|
||||
|
||||
// Given one or more integer types, this function produces an integer type that
|
||||
// encompasses them: any value in one of the given types could be expressed in
|
||||
// the encompassing type.
|
||||
static struct WidthAndSignedness
|
||||
EncompassingIntegerType(ArrayRef<struct WidthAndSignedness> types) {
|
||||
assert(types.size() > 0 && "Empty list of types.");
|
||||
|
||||
// If any of the given types is signed, we must return a signed type.
|
||||
bool isSigned = llvm::any_of(types, [](const auto &t) { return t.isSigned; });
|
||||
|
||||
// The encompassing type must have a width greater than or equal to the width
|
||||
// of the specified types. Additionally, if the encompassing type is signed,
|
||||
// its width must be strictly greater than the width of any unsigned types
|
||||
// given.
|
||||
unsigned width = 0;
|
||||
for (const auto &type : types)
|
||||
width = std::max(width, type.width + (isSigned && !type.isSigned));
|
||||
|
||||
return {width, isSigned};
|
||||
}
|
||||
|
||||
RValue CIRGenFunction::emitRotate(const CallExpr *e, bool isRotateLeft) {
|
||||
mlir::Value input = emitScalarExpr(e->getArg(0));
|
||||
mlir::Value amount = emitScalarExpr(e->getArg(1));
|
||||
@ -899,9 +938,85 @@ RValue CIRGenFunction::emitBuiltinExpr(const GlobalDecl &gd, unsigned builtinID,
|
||||
case Builtin::BI__builtin_subc:
|
||||
case Builtin::BI__builtin_subcl:
|
||||
case Builtin::BI__builtin_subcll:
|
||||
return errorBuiltinNYI(*this, e, builtinID);
|
||||
|
||||
case Builtin::BI__builtin_add_overflow:
|
||||
case Builtin::BI__builtin_sub_overflow:
|
||||
case Builtin::BI__builtin_mul_overflow:
|
||||
case Builtin::BI__builtin_mul_overflow: {
|
||||
const clang::Expr *leftArg = e->getArg(0);
|
||||
const clang::Expr *rightArg = e->getArg(1);
|
||||
const clang::Expr *resultArg = e->getArg(2);
|
||||
|
||||
clang::QualType resultQTy =
|
||||
resultArg->getType()->castAs<clang::PointerType>()->getPointeeType();
|
||||
|
||||
WidthAndSignedness leftInfo =
|
||||
getIntegerWidthAndSignedness(cgm.getASTContext(), leftArg->getType());
|
||||
WidthAndSignedness rightInfo =
|
||||
getIntegerWidthAndSignedness(cgm.getASTContext(), rightArg->getType());
|
||||
WidthAndSignedness resultInfo =
|
||||
getIntegerWidthAndSignedness(cgm.getASTContext(), resultQTy);
|
||||
|
||||
// Note we compute the encompassing type with the consideration to the
|
||||
// result type, so later in LLVM lowering we don't get redundant integral
|
||||
// extension casts.
|
||||
WidthAndSignedness encompassingInfo =
|
||||
EncompassingIntegerType({leftInfo, rightInfo, resultInfo});
|
||||
|
||||
auto encompassingCIRTy = cir::IntType::get(
|
||||
&getMLIRContext(), encompassingInfo.width, encompassingInfo.isSigned);
|
||||
auto resultCIRTy = mlir::cast<cir::IntType>(cgm.convertType(resultQTy));
|
||||
|
||||
mlir::Value left = emitScalarExpr(leftArg);
|
||||
mlir::Value right = emitScalarExpr(rightArg);
|
||||
Address resultPtr = emitPointerWithAlignment(resultArg);
|
||||
|
||||
// Extend each operand to the encompassing type, if necessary.
|
||||
if (left.getType() != encompassingCIRTy)
|
||||
left =
|
||||
builder.createCast(cir::CastKind::integral, left, encompassingCIRTy);
|
||||
if (right.getType() != encompassingCIRTy)
|
||||
right =
|
||||
builder.createCast(cir::CastKind::integral, right, encompassingCIRTy);
|
||||
|
||||
// Perform the operation on the extended values.
|
||||
cir::BinOpOverflowKind opKind;
|
||||
switch (builtinID) {
|
||||
default:
|
||||
llvm_unreachable("Unknown overflow builtin id.");
|
||||
case Builtin::BI__builtin_add_overflow:
|
||||
opKind = cir::BinOpOverflowKind::Add;
|
||||
break;
|
||||
case Builtin::BI__builtin_sub_overflow:
|
||||
opKind = cir::BinOpOverflowKind::Sub;
|
||||
break;
|
||||
case Builtin::BI__builtin_mul_overflow:
|
||||
opKind = cir::BinOpOverflowKind::Mul;
|
||||
break;
|
||||
}
|
||||
|
||||
mlir::Location loc = getLoc(e->getSourceRange());
|
||||
auto arithOp = cir::BinOpOverflowOp::create(builder, loc, resultCIRTy,
|
||||
opKind, left, right);
|
||||
|
||||
// Here is a slight difference from the original clang CodeGen:
|
||||
// - In the original clang CodeGen, the checked arithmetic result is
|
||||
// first computed as a value of the encompassing type, and then it is
|
||||
// truncated to the actual result type with a second overflow checking.
|
||||
// - In CIRGen, the checked arithmetic operation directly produce the
|
||||
// checked arithmetic result in its expected type.
|
||||
//
|
||||
// So we don't need a truncation and a second overflow checking here.
|
||||
|
||||
// Finally, store the result using the pointer.
|
||||
bool isVolatile =
|
||||
resultArg->getType()->getPointeeType().isVolatileQualified();
|
||||
builder.createStore(loc, emitToMemory(arithOp.getResult(), resultQTy),
|
||||
resultPtr, isVolatile);
|
||||
|
||||
return RValue::get(arithOp.getOverflow());
|
||||
}
|
||||
|
||||
case Builtin::BI__builtin_uadd_overflow:
|
||||
case Builtin::BI__builtin_uaddl_overflow:
|
||||
case Builtin::BI__builtin_uaddll_overflow:
|
||||
@ -919,7 +1034,61 @@ RValue CIRGenFunction::emitBuiltinExpr(const GlobalDecl &gd, unsigned builtinID,
|
||||
case Builtin::BI__builtin_ssubll_overflow:
|
||||
case Builtin::BI__builtin_smul_overflow:
|
||||
case Builtin::BI__builtin_smull_overflow:
|
||||
case Builtin::BI__builtin_smulll_overflow:
|
||||
case Builtin::BI__builtin_smulll_overflow: {
|
||||
// Scalarize our inputs.
|
||||
mlir::Value x = emitScalarExpr(e->getArg(0));
|
||||
mlir::Value y = emitScalarExpr(e->getArg(1));
|
||||
|
||||
const clang::Expr *resultArg = e->getArg(2);
|
||||
Address resultPtr = emitPointerWithAlignment(resultArg);
|
||||
|
||||
// Decide which of the arithmetic operation we are lowering to:
|
||||
cir::BinOpOverflowKind arithKind;
|
||||
switch (builtinID) {
|
||||
default:
|
||||
llvm_unreachable("Unknown overflow builtin id.");
|
||||
case Builtin::BI__builtin_uadd_overflow:
|
||||
case Builtin::BI__builtin_uaddl_overflow:
|
||||
case Builtin::BI__builtin_uaddll_overflow:
|
||||
case Builtin::BI__builtin_sadd_overflow:
|
||||
case Builtin::BI__builtin_saddl_overflow:
|
||||
case Builtin::BI__builtin_saddll_overflow:
|
||||
arithKind = cir::BinOpOverflowKind::Add;
|
||||
break;
|
||||
case Builtin::BI__builtin_usub_overflow:
|
||||
case Builtin::BI__builtin_usubl_overflow:
|
||||
case Builtin::BI__builtin_usubll_overflow:
|
||||
case Builtin::BI__builtin_ssub_overflow:
|
||||
case Builtin::BI__builtin_ssubl_overflow:
|
||||
case Builtin::BI__builtin_ssubll_overflow:
|
||||
arithKind = cir::BinOpOverflowKind::Sub;
|
||||
break;
|
||||
case Builtin::BI__builtin_umul_overflow:
|
||||
case Builtin::BI__builtin_umull_overflow:
|
||||
case Builtin::BI__builtin_umulll_overflow:
|
||||
case Builtin::BI__builtin_smul_overflow:
|
||||
case Builtin::BI__builtin_smull_overflow:
|
||||
case Builtin::BI__builtin_smulll_overflow:
|
||||
arithKind = cir::BinOpOverflowKind::Mul;
|
||||
break;
|
||||
}
|
||||
|
||||
clang::QualType resultQTy =
|
||||
resultArg->getType()->castAs<clang::PointerType>()->getPointeeType();
|
||||
auto resultCIRTy = mlir::cast<cir::IntType>(cgm.convertType(resultQTy));
|
||||
|
||||
mlir::Location loc = getLoc(e->getSourceRange());
|
||||
cir::BinOpOverflowOp arithOp = cir::BinOpOverflowOp::create(
|
||||
builder, loc, resultCIRTy, arithKind, x, y);
|
||||
|
||||
bool isVolatile =
|
||||
resultArg->getType()->getPointeeType().isVolatileQualified();
|
||||
builder.createStore(loc, emitToMemory(arithOp.getResult(), resultQTy),
|
||||
resultPtr, isVolatile);
|
||||
|
||||
return RValue::get(arithOp.getOverflow());
|
||||
}
|
||||
|
||||
case Builtin::BIaddressof:
|
||||
case Builtin::BI__addressof:
|
||||
case Builtin::BI__builtin_addressof:
|
||||
|
||||
@ -2586,6 +2586,120 @@ mlir::LogicalResult CIRToLLVMCmpOpLowering::matchAndRewrite(
|
||||
return cmpOp.emitError() << "unsupported type for CmpOp: " << type;
|
||||
}
|
||||
|
||||
mlir::LogicalResult CIRToLLVMBinOpOverflowOpLowering::matchAndRewrite(
|
||||
cir::BinOpOverflowOp op, OpAdaptor adaptor,
|
||||
mlir::ConversionPatternRewriter &rewriter) const {
|
||||
mlir::Location loc = op.getLoc();
|
||||
cir::BinOpOverflowKind arithKind = op.getKind();
|
||||
cir::IntType operandTy = op.getLhs().getType();
|
||||
cir::IntType resultTy = op.getResult().getType();
|
||||
|
||||
EncompassedTypeInfo encompassedTyInfo =
|
||||
computeEncompassedTypeWidth(operandTy, resultTy);
|
||||
mlir::IntegerType encompassedLLVMTy =
|
||||
rewriter.getIntegerType(encompassedTyInfo.width);
|
||||
|
||||
mlir::Value lhs = adaptor.getLhs();
|
||||
mlir::Value rhs = adaptor.getRhs();
|
||||
if (operandTy.getWidth() < encompassedTyInfo.width) {
|
||||
if (operandTy.isSigned()) {
|
||||
lhs = mlir::LLVM::SExtOp::create(rewriter, loc, encompassedLLVMTy, lhs);
|
||||
rhs = mlir::LLVM::SExtOp::create(rewriter, loc, encompassedLLVMTy, rhs);
|
||||
} else {
|
||||
lhs = mlir::LLVM::ZExtOp::create(rewriter, loc, encompassedLLVMTy, lhs);
|
||||
rhs = mlir::LLVM::ZExtOp::create(rewriter, loc, encompassedLLVMTy, rhs);
|
||||
}
|
||||
}
|
||||
|
||||
std::string intrinName = getLLVMIntrinName(arithKind, encompassedTyInfo.sign,
|
||||
encompassedTyInfo.width);
|
||||
auto intrinNameAttr = mlir::StringAttr::get(op.getContext(), intrinName);
|
||||
|
||||
mlir::IntegerType overflowLLVMTy = rewriter.getI1Type();
|
||||
auto intrinRetTy = mlir::LLVM::LLVMStructType::getLiteral(
|
||||
rewriter.getContext(), {encompassedLLVMTy, overflowLLVMTy});
|
||||
|
||||
auto callLLVMIntrinOp = mlir::LLVM::CallIntrinsicOp::create(
|
||||
rewriter, loc, intrinRetTy, intrinNameAttr, mlir::ValueRange{lhs, rhs});
|
||||
mlir::Value intrinRet = callLLVMIntrinOp.getResult(0);
|
||||
|
||||
mlir::Value result = mlir::LLVM::ExtractValueOp::create(
|
||||
rewriter, loc, intrinRet, ArrayRef<int64_t>{0})
|
||||
.getResult();
|
||||
mlir::Value overflow = mlir::LLVM::ExtractValueOp::create(
|
||||
rewriter, loc, intrinRet, ArrayRef<int64_t>{1})
|
||||
.getResult();
|
||||
|
||||
if (resultTy.getWidth() < encompassedTyInfo.width) {
|
||||
mlir::Type resultLLVMTy = getTypeConverter()->convertType(resultTy);
|
||||
auto truncResult =
|
||||
mlir::LLVM::TruncOp::create(rewriter, loc, resultLLVMTy, result);
|
||||
|
||||
// Extend the truncated result back to the encompassing type to check for
|
||||
// any overflows during the truncation.
|
||||
mlir::Value truncResultExt;
|
||||
if (resultTy.isSigned())
|
||||
truncResultExt = mlir::LLVM::SExtOp::create(
|
||||
rewriter, loc, encompassedLLVMTy, truncResult);
|
||||
else
|
||||
truncResultExt = mlir::LLVM::ZExtOp::create(
|
||||
rewriter, loc, encompassedLLVMTy, truncResult);
|
||||
auto truncOverflow = mlir::LLVM::ICmpOp::create(
|
||||
rewriter, loc, mlir::LLVM::ICmpPredicate::ne, truncResultExt, result);
|
||||
|
||||
result = truncResult;
|
||||
overflow = mlir::LLVM::OrOp::create(rewriter, loc, overflow, truncOverflow);
|
||||
}
|
||||
|
||||
mlir::Type boolLLVMTy =
|
||||
getTypeConverter()->convertType(op.getOverflow().getType());
|
||||
if (boolLLVMTy != rewriter.getI1Type())
|
||||
overflow = mlir::LLVM::ZExtOp::create(rewriter, loc, boolLLVMTy, overflow);
|
||||
|
||||
rewriter.replaceOp(op, mlir::ValueRange{result, overflow});
|
||||
|
||||
return mlir::success();
|
||||
}
|
||||
|
||||
std::string CIRToLLVMBinOpOverflowOpLowering::getLLVMIntrinName(
|
||||
cir::BinOpOverflowKind opKind, bool isSigned, unsigned width) {
|
||||
// The intrinsic name is `@llvm.{s|u}{opKind}.with.overflow.i{width}`
|
||||
|
||||
std::string name = "llvm.";
|
||||
|
||||
if (isSigned)
|
||||
name.push_back('s');
|
||||
else
|
||||
name.push_back('u');
|
||||
|
||||
switch (opKind) {
|
||||
case cir::BinOpOverflowKind::Add:
|
||||
name.append("add.");
|
||||
break;
|
||||
case cir::BinOpOverflowKind::Sub:
|
||||
name.append("sub.");
|
||||
break;
|
||||
case cir::BinOpOverflowKind::Mul:
|
||||
name.append("mul.");
|
||||
break;
|
||||
}
|
||||
|
||||
name.append("with.overflow.i");
|
||||
name.append(std::to_string(width));
|
||||
|
||||
return name;
|
||||
}
|
||||
|
||||
CIRToLLVMBinOpOverflowOpLowering::EncompassedTypeInfo
|
||||
CIRToLLVMBinOpOverflowOpLowering::computeEncompassedTypeWidth(
|
||||
cir::IntType operandTy, cir::IntType resultTy) {
|
||||
bool sign = operandTy.getIsSigned() || resultTy.getIsSigned();
|
||||
unsigned width =
|
||||
std::max(operandTy.getWidth() + (sign && operandTy.isUnsigned()),
|
||||
resultTy.getWidth() + (sign && resultTy.isUnsigned()));
|
||||
return {sign, width};
|
||||
}
|
||||
|
||||
mlir::LogicalResult CIRToLLVMShiftOpLowering::matchAndRewrite(
|
||||
cir::ShiftOp op, OpAdaptor adaptor,
|
||||
mlir::ConversionPatternRewriter &rewriter) const {
|
||||
|
||||
374
clang/test/CIR/CodeGen/builtins-overflow.cpp
Normal file
374
clang/test/CIR/CodeGen/builtins-overflow.cpp
Normal file
@ -0,0 +1,374 @@
|
||||
// RUN: %clang_cc1 -triple x86_64-unknown-linux-gnu -fclangir -emit-cir %s -o %t.cir
|
||||
// RUN: FileCheck %s --check-prefix=CIR --input-file=%t.cir
|
||||
// RUN: %clang_cc1 -triple x86_64-unknown-linux-gnu -fclangir -emit-llvm %s -o %t-cir.ll
|
||||
// RUN: FileCheck %s --check-prefix=LLVM --input-file=%t-cir.ll
|
||||
// RUN: %clang_cc1 -triple x86_64-unknown-linux-gnu -emit-llvm %s -o %t.ll
|
||||
// RUN: FileCheck %s --check-prefix=OGCG --input-file=%t.ll
|
||||
|
||||
bool test_add_overflow_uint_uint_uint(unsigned x, unsigned y, unsigned *res) {
|
||||
return __builtin_add_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z32test_add_overflow_uint_uint_uintjjPj
|
||||
// CIR: %[[#LHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u32i>, !u32i
|
||||
// CIR-NEXT: %[[#RHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u32i>, !u32i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!u32i>>, !cir.ptr<!u32i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(add, %[[#LHS]], %[[#RHS]]) : !u32i, (!u32i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !u32i, !cir.ptr<!u32i>
|
||||
// CIR: }
|
||||
|
||||
// LLVM: define{{.*}} i1 @_Z32test_add_overflow_uint_uint_uintjjPj(i32{{.*}}, i32{{.*}}, ptr{{.*}})
|
||||
// LLVM: call { i32, i1 } @llvm.uadd.with.overflow.i32(i32 %{{.+}}, i32 %{{.+}})
|
||||
|
||||
// OGCG: define{{.*}} i1 @_Z32test_add_overflow_uint_uint_uintjjPj(i32{{.*}}, i32{{.*}}, ptr{{.*}})
|
||||
// OGCG: call { i32, i1 } @llvm.uadd.with.overflow.i32(i32 %{{.+}}, i32 %{{.+}})
|
||||
|
||||
bool test_add_overflow_int_int_int(int x, int y, int *res) {
|
||||
return __builtin_add_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z29test_add_overflow_int_int_intiiPi
|
||||
// CIR: %[[#LHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#RHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!s32i>>, !cir.ptr<!s32i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(add, %[[#LHS]], %[[#RHS]]) : !s32i, (!s32i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !s32i, !cir.ptr<!s32i>
|
||||
// CIR: }
|
||||
|
||||
bool test_add_overflow_xint31_xint31_xint31(_BitInt(31) x, _BitInt(31) y, _BitInt(31) *res) {
|
||||
return __builtin_add_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z38test_add_overflow_xint31_xint31_xint31DB31_S_PS_
|
||||
// CIR: %[[#LHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.int<s, 31>>, !cir.int<s, 31>
|
||||
// CIR-NEXT: %[[#RHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.int<s, 31>>, !cir.int<s, 31>
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!cir.int<s, 31>>>, !cir.ptr<!cir.int<s, 31>>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(add, %[[#LHS]], %[[#RHS]]) : !cir.int<s, 31>, (!cir.int<s, 31>, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !cir.int<s, 31>, !cir.ptr<!cir.int<s, 31>>
|
||||
// CIR: }
|
||||
|
||||
bool test_sub_overflow_uint_uint_uint(unsigned x, unsigned y, unsigned *res) {
|
||||
return __builtin_sub_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z32test_sub_overflow_uint_uint_uintjjPj
|
||||
// CIR: %[[#LHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u32i>, !u32i
|
||||
// CIR-NEXT: %[[#RHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u32i>, !u32i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!u32i>>, !cir.ptr<!u32i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(sub, %[[#LHS]], %[[#RHS]]) : !u32i, (!u32i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !u32i, !cir.ptr<!u32i>
|
||||
// CIR: }
|
||||
|
||||
bool test_sub_overflow_int_int_int(int x, int y, int *res) {
|
||||
return __builtin_sub_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z29test_sub_overflow_int_int_intiiPi
|
||||
// CIR: %[[#LHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#RHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!s32i>>, !cir.ptr<!s32i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(sub, %[[#LHS]], %[[#RHS]]) : !s32i, (!s32i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !s32i, !cir.ptr<!s32i>
|
||||
// CIR: }
|
||||
|
||||
bool test_sub_overflow_xint31_xint31_xint31(_BitInt(31) x, _BitInt(31) y, _BitInt(31) *res) {
|
||||
return __builtin_sub_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z38test_sub_overflow_xint31_xint31_xint31DB31_S_PS_
|
||||
// CIR: %[[#LHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.int<s, 31>>, !cir.int<s, 31>
|
||||
// CIR-NEXT: %[[#RHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.int<s, 31>>, !cir.int<s, 31>
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!cir.int<s, 31>>>, !cir.ptr<!cir.int<s, 31>>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(sub, %[[#LHS]], %[[#RHS]]) : !cir.int<s, 31>, (!cir.int<s, 31>, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !cir.int<s, 31>, !cir.ptr<!cir.int<s, 31>>
|
||||
// CIR: }
|
||||
|
||||
bool test_mul_overflow_uint_uint_uint(unsigned x, unsigned y, unsigned *res) {
|
||||
return __builtin_mul_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z32test_mul_overflow_uint_uint_uintjjPj
|
||||
// CIR: %[[#LHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u32i>, !u32i
|
||||
// CIR-NEXT: %[[#RHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u32i>, !u32i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!u32i>>, !cir.ptr<!u32i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(mul, %[[#LHS]], %[[#RHS]]) : !u32i, (!u32i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !u32i, !cir.ptr<!u32i>
|
||||
// CIR: }
|
||||
|
||||
bool test_mul_overflow_int_int_int(int x, int y, int *res) {
|
||||
return __builtin_mul_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z29test_mul_overflow_int_int_intiiPi
|
||||
// CIR: %[[#LHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#RHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!s32i>>, !cir.ptr<!s32i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(mul, %[[#LHS]], %[[#RHS]]) : !s32i, (!s32i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !s32i, !cir.ptr<!s32i>
|
||||
// CIR: }
|
||||
|
||||
bool test_mul_overflow_xint31_xint31_xint31(_BitInt(31) x, _BitInt(31) y, _BitInt(31) *res) {
|
||||
return __builtin_mul_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z38test_mul_overflow_xint31_xint31_xint31DB31_S_PS_
|
||||
// CIR: %[[#LHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.int<s, 31>>, !cir.int<s, 31>
|
||||
// CIR-NEXT: %[[#RHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.int<s, 31>>, !cir.int<s, 31>
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!cir.int<s, 31>>>, !cir.ptr<!cir.int<s, 31>>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(mul, %[[#LHS]], %[[#RHS]]) : !cir.int<s, 31>, (!cir.int<s, 31>, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !cir.int<s, 31>, !cir.ptr<!cir.int<s, 31>>
|
||||
// CIR: }
|
||||
|
||||
bool test_mul_overflow_ulong_ulong_long(unsigned long x, unsigned long y, unsigned long *res) {
|
||||
return __builtin_mul_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z34test_mul_overflow_ulong_ulong_longmmPm
|
||||
// CIR: %[[#LHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u64i>, !u64i
|
||||
// CIR-NEXT: %[[#RHS:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u64i>, !u64i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!u64i>>, !cir.ptr<!u64i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(mul, %[[#LHS]], %[[#RHS]]) : !u64i, (!u64i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !u64i, !cir.ptr<!u64i>
|
||||
// CIR: }
|
||||
|
||||
bool test_add_overflow_uint_int_int(unsigned x, int y, int *res) {
|
||||
return __builtin_add_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z30test_add_overflow_uint_int_intjiPi
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u32i>, !u32i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!s32i>>, !cir.ptr<!s32i>
|
||||
// CIR-NEXT: %[[#PROM_X:]] = cir.cast integral %[[#X]] : !u32i -> !cir.int<s, 33>
|
||||
// CIR-NEXT: %[[#PROM_Y:]] = cir.cast integral %[[#Y]] : !s32i -> !cir.int<s, 33>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(add, %[[#PROM_X]], %[[#PROM_Y]]) : !cir.int<s, 33>, (!s32i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !s32i, !cir.ptr<!s32i>
|
||||
// CIR: }
|
||||
|
||||
bool test_add_overflow_volatile(int x, int y, volatile int *res) {
|
||||
return __builtin_add_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z26test_add_overflow_volatileiiPVi
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!s32i>>, !cir.ptr<!s32i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(add, %[[#X]], %[[#Y]]) : !s32i, (!s32i, !cir.bool)
|
||||
// CIR-NEXT: cir.store volatile{{.*}} %[[RES]], %[[#RES_PTR]] : !s32i, !cir.ptr<!s32i>
|
||||
// CIR: }
|
||||
|
||||
bool test_uadd_overflow(unsigned x, unsigned y, unsigned *res) {
|
||||
return __builtin_uadd_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z18test_uadd_overflowjjPj
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u32i>, !u32i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u32i>, !u32i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!u32i>>, !cir.ptr<!u32i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(add, %[[#X]], %[[#Y]]) : !u32i, (!u32i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !u32i, !cir.ptr<!u32i>
|
||||
// CIR: }
|
||||
|
||||
bool test_uaddl_overflow(unsigned long x, unsigned long y, unsigned long *res) {
|
||||
return __builtin_uaddl_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z19test_uaddl_overflowmmPm
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u64i>, !u64i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u64i>, !u64i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!u64i>>, !cir.ptr<!u64i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(add, %[[#X]], %[[#Y]]) : !u64i, (!u64i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !u64i, !cir.ptr<!u64i>
|
||||
// CIR: }
|
||||
|
||||
bool test_uaddll_overflow(unsigned long long x, unsigned long long y, unsigned long long *res) {
|
||||
return __builtin_uaddll_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z20test_uaddll_overflowyyPy
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u64i>, !u64i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u64i>, !u64i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!u64i>>, !cir.ptr<!u64i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(add, %[[#X]], %[[#Y]]) : !u64i, (!u64i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !u64i, !cir.ptr<!u64i>
|
||||
// CIR: }
|
||||
|
||||
bool test_usub_overflow(unsigned x, unsigned y, unsigned *res) {
|
||||
return __builtin_usub_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z18test_usub_overflowjjPj
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u32i>, !u32i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u32i>, !u32i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!u32i>>, !cir.ptr<!u32i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(sub, %[[#X]], %[[#Y]]) : !u32i, (!u32i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !u32i, !cir.ptr<!u32i>
|
||||
// CIR: }
|
||||
|
||||
bool test_usubl_overflow(unsigned long x, unsigned long y, unsigned long *res) {
|
||||
return __builtin_usubl_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z19test_usubl_overflowmmPm
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u64i>, !u64i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u64i>, !u64i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!u64i>>, !cir.ptr<!u64i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(sub, %[[#X]], %[[#Y]]) : !u64i, (!u64i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !u64i, !cir.ptr<!u64i>
|
||||
// CIR: }
|
||||
|
||||
bool test_usubll_overflow(unsigned long long x, unsigned long long y, unsigned long long *res) {
|
||||
return __builtin_usubll_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z20test_usubll_overflowyyPy
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u64i>, !u64i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u64i>, !u64i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!u64i>>, !cir.ptr<!u64i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(sub, %[[#X]], %[[#Y]]) : !u64i, (!u64i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !u64i, !cir.ptr<!u64i>
|
||||
// CIR: }
|
||||
|
||||
bool test_umul_overflow(unsigned x, unsigned y, unsigned *res) {
|
||||
return __builtin_umul_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z18test_umul_overflowjjPj
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u32i>, !u32i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u32i>, !u32i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!u32i>>, !cir.ptr<!u32i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(mul, %[[#X]], %[[#Y]]) : !u32i, (!u32i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !u32i, !cir.ptr<!u32i>
|
||||
// CIR: }
|
||||
|
||||
bool test_umull_overflow(unsigned long x, unsigned long y, unsigned long *res) {
|
||||
return __builtin_umull_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z19test_umull_overflowmmPm
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u64i>, !u64i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u64i>, !u64i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!u64i>>, !cir.ptr<!u64i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(mul, %[[#X]], %[[#Y]]) : !u64i, (!u64i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !u64i, !cir.ptr<!u64i>
|
||||
// CIR: }
|
||||
|
||||
bool test_umulll_overflow(unsigned long long x, unsigned long long y, unsigned long long *res) {
|
||||
return __builtin_umulll_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z20test_umulll_overflowyyPy
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u64i>, !u64i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!u64i>, !u64i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!u64i>>, !cir.ptr<!u64i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(mul, %[[#X]], %[[#Y]]) : !u64i, (!u64i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !u64i, !cir.ptr<!u64i>
|
||||
// CIR: }
|
||||
|
||||
bool test_sadd_overflow(int x, int y, int *res) {
|
||||
return __builtin_sadd_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z18test_sadd_overflowiiPi
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!s32i>>, !cir.ptr<!s32i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(add, %[[#X]], %[[#Y]]) : !s32i, (!s32i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !s32i, !cir.ptr<!s32i>
|
||||
// CIR: }
|
||||
|
||||
bool test_saddl_overflow(long x, long y, long *res) {
|
||||
return __builtin_saddl_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z19test_saddl_overflowllPl
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s64i>, !s64i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s64i>, !s64i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!s64i>>, !cir.ptr<!s64i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(add, %[[#X]], %[[#Y]]) : !s64i, (!s64i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !s64i, !cir.ptr<!s64i>
|
||||
// CIR: }
|
||||
|
||||
bool test_saddll_overflow(long long x, long long y, long long *res) {
|
||||
return __builtin_saddll_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z20test_saddll_overflowxxPx
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s64i>, !s64i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s64i>, !s64i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!s64i>>, !cir.ptr<!s64i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(add, %[[#X]], %[[#Y]]) : !s64i, (!s64i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !s64i, !cir.ptr<!s64i>
|
||||
// CIR: }
|
||||
|
||||
bool test_ssub_overflow(int x, int y, int *res) {
|
||||
return __builtin_ssub_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z18test_ssub_overflowiiPi
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!s32i>>, !cir.ptr<!s32i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(sub, %[[#X]], %[[#Y]]) : !s32i, (!s32i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !s32i, !cir.ptr<!s32i>
|
||||
// CIR: }
|
||||
|
||||
bool test_ssubl_overflow(long x, long y, long *res) {
|
||||
return __builtin_ssubl_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z19test_ssubl_overflowllPl
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s64i>, !s64i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s64i>, !s64i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!s64i>>, !cir.ptr<!s64i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(sub, %[[#X]], %[[#Y]]) : !s64i, (!s64i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !s64i, !cir.ptr<!s64i>
|
||||
// CIR: }
|
||||
|
||||
bool test_ssubll_overflow(long long x, long long y, long long *res) {
|
||||
return __builtin_ssubll_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z20test_ssubll_overflowxxPx
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s64i>, !s64i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s64i>, !s64i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!s64i>>, !cir.ptr<!s64i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(sub, %[[#X]], %[[#Y]]) : !s64i, (!s64i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !s64i, !cir.ptr<!s64i>
|
||||
// CIR: }
|
||||
|
||||
bool test_smul_overflow(int x, int y, int *res) {
|
||||
return __builtin_smul_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z18test_smul_overflowiiPi
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s32i>, !s32i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!s32i>>, !cir.ptr<!s32i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(mul, %[[#X]], %[[#Y]]) : !s32i, (!s32i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !s32i, !cir.ptr<!s32i>
|
||||
// CIR: }
|
||||
|
||||
bool test_smull_overflow(long x, long y, long *res) {
|
||||
return __builtin_smull_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z19test_smull_overflowllPl
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s64i>, !s64i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s64i>, !s64i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!s64i>>, !cir.ptr<!s64i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(mul, %[[#X]], %[[#Y]]) : !s64i, (!s64i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !s64i, !cir.ptr<!s64i>
|
||||
// CIR: }
|
||||
|
||||
bool test_smulll_overflow(long long x, long long y, long long *res) {
|
||||
return __builtin_smulll_overflow(x, y, res);
|
||||
}
|
||||
|
||||
// CIR: cir.func dso_local @_Z20test_smulll_overflowxxPx
|
||||
// CIR: %[[#X:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s64i>, !s64i
|
||||
// CIR-NEXT: %[[#Y:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!s64i>, !s64i
|
||||
// CIR-NEXT: %[[#RES_PTR:]] = cir.load{{.*}} %{{.+}} : !cir.ptr<!cir.ptr<!s64i>>, !cir.ptr<!s64i>
|
||||
// CIR-NEXT: %[[RES:.+]], %{{.+}} = cir.binop.overflow(mul, %[[#X]], %[[#Y]]) : !s64i, (!s64i, !cir.bool)
|
||||
// CIR-NEXT: cir.store{{.*}} %[[RES]], %[[#RES_PTR]] : !s64i, !cir.ptr<!s64i>
|
||||
// CIR: }
|
||||
Loading…
x
Reference in New Issue
Block a user