| /llvm-project/libcxx/test/std/utilities/function.objects/arithmetic.operations/ |
| H A D | divides.pass.cpp | 13 // divides
23 typedef std::divides<int> F; in main()
32 typedef std::divides<> F2; in main()
38 constexpr int foo = std::divides<int> () (3, 2); in main()
41 constexpr double bar = std::divides<> () (3.0, 2); in main()
|
| H A D | transparent.pass.cpp | 44 static_assert ( !is_transparent<std::divides<int>>::value, "" ); in main()
45 static_assert ( !is_transparent<std::divides<std::string>>::value, "" ); in main()
46 static_assert ( is_transparent<std::divides<void>>::value, "" ); in main()
47 static_assert ( is_transparent<std::divides<>>::value, "" ); in main()
|
| /llvm-project/llvm/test/Transforms/LoopUnroll/ |
| H A D | convergent.ll | 29 ; unrolled. The unroll count is the largest power of 2 that divides the
84 ; count 2 divides trip count 4. The loop unroll should respect the pragma.
105 ; count 2 divides trip multiple 2. The loop unroll should respect the pragma.
|
| /llvm-project/libcxx/test/std/utilities/function.objects/ |
| H A D | operations.implicit_ctad.pass.cpp | 33 std::divides f; in main()
34 ASSERT_SAME_TYPE(decltype(f), std::divides<>); in main()
|
| /llvm-project/mlir/test/Dialect/SCF/ |
| H A D | transform-ops-invalid.mlir | 171 // Loop peeling is not beneficial because the step size already divides
196 // Loop peeling is not beneficial because the step size already divides
218 // Loop peeling is not beneficial because the step size already divides
|
| /llvm-project/lldb/bindings/interface/ |
| H A D | SBFileSpecDocstrings.i | 2 "Represents a file specification that divides the path into a directory and
|
| /llvm-project/clang-tools-extra/test/clang-doc/Inputs/basic-project/include/ |
| H A D | Calculator.h | 38 * @brief Divides the first integer by the second.
|
| /llvm-project/compiler-rt/lib/builtins/arm/ |
| H A D | divsf3vfp.S | 14 // Divides two single precision floating point numbers using the Darwin
|
| H A D | divdf3vfp.S | 14 // Divides two double precision floating point numbers using the Darwin
|
| /llvm-project/libcxx/test/libcxx/algorithms/ |
| H A D | half_positive.pass.cpp | 11 // __half_positive divides an integer number by 2 as unsigned number for known types.
|
| /llvm-project/llvm/test/CodeGen/NVPTX/ |
| H A D | bypass-div.ll | 4 ; 64-bit divides and rems should be split into a fast and slow path where
|
| /llvm-project/mlir/include/mlir/Dialect/SCF/Transforms/ |
| H A D | Transforms.h | 54 /// into a for loop where the step divides the iteration space evenly, followed
89 /// * Loop bounds and step size are static, and step already divides the
|
| /llvm-project/libcxx/include/__functional/ |
| H A D | operations.h | 119 struct _LIBCPP_TEMPLATE_VIS divides : __binary_function<_Tp, _Tp, _Tp> {
125 _LIBCPP_CTAD_SUPPORTED_FOR_TYPE(divides);
129 struct _LIBCPP_TEMPLATE_VIS divides<void> {
|
| /llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | BypassSlowDivision.h | 11 // For example, on Intel Atom 32-bit divides are slow enough that during
|
| /llvm-project/libcxx/modules/std/ |
| H A D | functional.inc | 24 using std::divides;
|
| /llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SIMachineScheduler.h | 268 // Divides Blocks having no bottom up or top down dependencies on Reserved groups.
291 // Divides Blocks with important size.
|
| /llvm-project/llvm/docs/ |
| H A D | CompileCudaWithLLVM.rst | 534 * `Bypassing 64-bit divides
538 64-bit integer divides are much slower than 32-bit ones on NVIDIA GPUs.
539 Many of the 64-bit divides in our benchmarks have a divisor and dividend
|
| /llvm-project/mlir/include/mlir/Dialect/SCF/TransformOps/ |
| H A D | SCFTransformOps.td | 150 Otherwise, updates the given loop so that its step evenly divides its range and puts
154 even if the step always divides the range evenly at runtime.
|
| /llvm-project/llvm/test/Transforms/ConstantHoisting/ARM/ |
| H A D | bad-cases.ll | 49 ; We don't want to convert constant divides because the benefit from converting
|
| /llvm-project/clang/test/CodeGen/ |
| H A D | atomic_ops.c | 10 // Check that multiply / divides on atomics produce a cmpxchg loop in foo()
|
| /llvm-project/compiler-rt/lib/builtins/i386/ |
| H A D | udivdi3.S | 16 // currently possible via simulation of integer divides on the x87 unit.
|
| H A D | umoddi3.S | 16 // currently possible via simulation of integer divides on the x87 unit.
|
| /llvm-project/clang-tools-extra/clang-tidy/modernize/ |
| H A D | UseTransparentFunctorsCheck.cpp | 31 "::std::divides", "::std::modulus", "::std::negate", in registerMatchers()
|
| /llvm-project/mlir/lib/Dialect/SCF/Transforms/ |
| H A D | LoopSpecialization.cpp | 109 /// into a for loop where the step divides the iteration space evenly, followed
131 // No specialization necessary if step already divides upper bound evenly. in peelForLoop()
|
| /llvm-project/mlir/include/mlir/Dialect/Linalg/TransformOps/ |
| H A D | GPUHeuristics.h | 67 /// Asserts that `elementalBitwidth` divides `numContiguousElements`.
|