Searched refs:bits1 (Results 1 – 10 of 10) sorted by relevance
| /llvm-project-15.0.7/libc/fuzzing/math/ |
| H A D | Compare.h | 19 __llvm_libc::fputil::FPBits<T> bits1(x1); in ValuesEqual()
22 if (bits1.is_nan() || bits2.is_nan()) in ValuesEqual()
26 return bits1.uintval() == bits2.uintval(); in ValuesEqual()
|
| H A D | RemQuoDiff.h | 47 __llvm_libc::fputil::FPBits<T> bits1(remainder1); in RemQuoDiff()
49 if (bits1.uintval() != bits2.uintval()) in RemQuoDiff()
|
| /llvm-project-15.0.7/llvm/test/TableGen/ |
| H A D | cast-string.td | 39 bits<4> bits1 = 0b0101;
41 string str = !cast<string>(bits1) # " and " # !cast<string>(bits2);
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstCombine/ |
| H A D | icmp-ule-of-shl-1-by-bits-and-val-to-icmp-ne-of-lshr-val-by-bits-and-0.ll | 72 define i1 @both(i8 %bits0, i8 %bits1) {
80 %t1 = shl i8 1, %bits1
|
| H A D | icmp-ugt-of-shl-1-by-bits-and-val-to-icmp-eq-of-lshr-val-by-bits-and-0.ll | 72 define i1 @both(i8 %bits0, i8 %bits1) {
80 %t1 = shl i8 1, %bits1
|
| H A D | icmp-ult-of-not-of-shl-allones-by-bits-and-val-to-icmp-ne-of-lshr-val-by-bits-and-0.ll | 100 define i1 @both(i8 %bits0, i8 %bits1) {
109 %t2 = shl i8 -1, %bits1
|
| H A D | icmp-uge-of-not-of-shl-allones-by-bits-and-val-to-icmp-eq-of-lshr-val-by-bits-and-0.ll | 100 define i1 @both(i8 %bits0, i8 %bits1) {
109 %t2 = shl i8 -1, %bits1
|
| H A D | icmp-uge-of-add-of-shl-one-by-bits-to-allones-and-val-to-icmp-eq-of-lshr-val-by-bits-and-0.ll | 124 define i1 @both(i8 %bits0, i8 %bits1) {
138 %t2 = shl i8 1, %bits1
|
| H A D | icmp-ult-of-add-of-shl-one-by-bits-to-allones-and-val-to-icmp-ne-of-lshr-val-by-bits-and-0.ll | 124 define i1 @both(i8 %bits0, i8 %bits1) {
138 %t2 = shl i8 1, %bits1
|
| /llvm-project-15.0.7/flang/lib/Lower/ |
| H A D | IntrinsicCall.cpp | 2347 unsigned bits1 = arg1Ty.getIntOrFloatBitWidth(); in genBitwiseCompare() local
2360 if (bits0 > bits1) in genBitwiseCompare()
2362 else if (bits0 < bits1) in genBitwiseCompare()
|