| /llvm-project-15.0.7/clang/test/CodeGen/ |
| H A D | exceptions-seh.c | 12 void try_body(int numerator, int denominator, int *myres) { in try_body() argument
13 *myres = numerator / denominator; in try_body()
20 int safe_div(int numerator, int denominator, int *res) { in safe_div() argument
24 try_body(numerator, denominator, &myres); in safe_div()
|
| /llvm-project-15.0.7/compiler-rt/test/asan/TestCases/Windows/ |
| H A D | integer_divide_by_zero.cpp | 11 volatile int numerator = 1; in main() local
13 return numerator / divisor; in main()
|
| /llvm-project-15.0.7/clang/tools/scan-build-py/tests/functional/src/ |
| H A D | emit-one.c | 3 int div(int numerator, int denominator) in div() argument
5 return numerator / denominator; in div()
|
| /llvm-project-15.0.7/llvm/test/Transforms/CodeGenPrepare/NVPTX/ |
| H A D | bypass-slow-div-constant-numerator.ll | 6 ; When we bypass slow div with a constant numerator which fits into the bypass
7 ; width, we still emit the bypass code, but we don't 'or' the numerator with
20 ; When we try to bypass slow div with a constant numerator which *doesn't* fit
|
| H A D | bypass-slow-div-not-exact.ll | 8 ; numerator is a multiple of the denominator).
|
| /llvm-project-15.0.7/flang/include/flang/Common/ |
| H A D | uint128.h | 158 Int128 numerator{};
161 numerator <<= 1;
163 numerator.low_ |= 1;
167 if (numerator >= that) {
169 numerator -= that;
|
| /llvm-project-15.0.7/third-party/benchmark/test/ |
| H A D | benchmark_test.cc | 36 double numerator = static_cast<double>(((i % 2) * 2) - 1); in CalculatePi() local
38 pi += numerator / denominator; in CalculatePi()
|
| /llvm-project-15.0.7/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | MallocOverflowSecurityChecker.cpp | 199 const Expr *numerator = BOp->getLHS()->IgnoreParenImpCasts(); in CheckAssignmentExpr() local
200 if (numerator->isEvaluatable(Context)) in CheckAssignmentExpr()
|
| /llvm-project-15.0.7/mlir/test/Integration/Dialect/Standard/CPU/ |
| H A D | test-ceil-floor-pos-neg.mlir | 23 // print numerator
|
| /llvm-project-15.0.7/mlir/test/Conversion/ComplexToStandard/ |
| H A D | convert-to-standard.mlir | 100 // Case 1. Zero denominator, numerator contains at most one NaN value.
116 // Case 2. Infinite numerator, finite denominator.
140 // Case 3. Finite numerator, infinite denominator.
562 // Case 1. Zero denominator, numerator contains at most one NaN value.
578 // Case 2. Infinite numerator, finite denominator.
602 // Case 3. Finite numerator, infinite denominator.
|
| /llvm-project-15.0.7/mlir/lib/Conversion/TosaToLinalg/ |
| H A D | TosaToLinalgNamed.cpp | 906 int64_t numerator = ((1 << 30) + 1); in matchAndRewrite() local
910 loc, rewriter.getI32IntegerAttr(numerator)); in matchAndRewrite()
|
| /llvm-project-15.0.7/mlir/lib/Conversion/SPIRVToLLVM/ |
| H A D | SPIRVToLLVM.cpp | 1237 Value numerator = in matchAndRewrite() local
1241 rewriter.replaceOpWithNewOp<LLVM::FDivOp>(tanhOp, dstType, numerator, in matchAndRewrite()
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | ratio | 252 static_assert(__static_abs<_Num>::value >= 0, "ratio numerator is out of range");
|
| /llvm-project-15.0.7/mlir/lib/Conversion/ComplexToStandard/ |
| H A D | ComplexToStandard.cpp | 877 Value numerator = in matchAndRewrite() local
883 rewriter.replaceOpWithNewOp<complex::DivOp>(op, numerator, denominator); in matchAndRewrite()
|
| /llvm-project-15.0.7/polly/lib/External/isl/imath/ |
| H A D | doc.md.in | 305 with the convention that the sign of the numerator is the sign of the rational
|
| H A D | ChangeLog | 368 Made mp_int_rat() use mp_int_init() to initialize numerator and
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstCombine/ |
| H A D | div.ll | 897 ; Division by -1 may be UB (if numerator is the signed min val), but div-by-1 can be simplified.
|
| /llvm-project-15.0.7/polly/lib/External/isl/doc/ |
| H A D | user.pod | 732 numerator of C<v>.
871 The numerator and denominator of a rational value can be extracted as
2977 set the I<numerator> of the constant or coefficient, while
2984 the numerator.
|