| /llvm-project-15.0.7/compiler-rt/test/tsan/ |
| H A D | java_find.cpp | 45 const int size2 = 32; in main() local 46 __tsan_java_alloc(jheap + size1, size2); in main() 48 const jptr addr3 = addr2 + size2; in main() 50 __tsan_java_alloc(jheap + size1 + size2, size3); in main() 55 verify_find(jheap + 8, jheap_end, addr2, size2); in main() 59 __tsan_java_move(addr2, addr4, size2); in main() 61 verify_find(addr3 + 8, jheap_end, addr4, size2); in main()
|
| /llvm-project-15.0.7/libc/fuzzing/string/ |
| H A D | strcmp_fuzz.cpp | 30 const size_t size2 = size - size1; in LLVMFuzzerTestOneInput() local 36 if (!size2) in LLVMFuzzerTestOneInput() 42 uint8_t *data2 = new uint8_t[size2]; in LLVMFuzzerTestOneInput() 51 for (size_t j = 0; j < size2; ++j) in LLVMFuzzerTestOneInput()
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/intseq/intseq.general/ |
| H A D | integer_seq.pass.cpp | 32 using size2 = std::index_sequence_for<int, size_t>; // generates size_t: 0,1 in main() typedef 46 static_assert ( std::is_same<size2::value_type, size_t>::value, "size2 type wrong" ); in main() 47 static_assert ( size2::size () == 2, "size2 size wrong" ); in main() 70 auto t2 = extract ( tup, size2 ()); in main() 71 static_assert ( std::tuple_size<decltype(t2)>::value == size2::size (), "t2 size wrong"); in main()
|
| /llvm-project-15.0.7/lld/test/ELF/lto/ |
| H A D | weak.ll | 9 ; RUN: llvm-as %t/size2.ll -o %t-size2.bc 12 ; RUN: ld.lld %t-size1.bc %t-size2.bc -o %t.so -shared 15 ; RUN: ld.lld %t-size2.bc %t-size1.bc -o %t2.so -shared 38 ;--- size2.ll
|
| /llvm-project-15.0.7/clang/test/CodeGen/ |
| H A D | arm64-microsoft-struct-align.cpp | 5 struct size2 { char str[2]; }; struct 14 struct size2 s2;
|
| /llvm-project-15.0.7/flang/test/Evaluate/ |
| H A D | folding21.f90 | 17 integer, parameter :: size2 = size(nada2) local 26 logical, parameter :: test_size_2 = size2 == 1
|
| /llvm-project-15.0.7/llvm/test/Transforms/MemCpyOpt/ |
| H A D | variable-sized-memcpy-memcpy.ll | 22 define void @negative_test(i8* %src, i64 %size1, i64 %size2) { 31 %dst = alloca i8, i64 %size2 33 call void @llvm.memcpy.p0i8.p0i8.i64(i8* align 8 %dst, i8* align 8 %tmp, i64 %size2, i1 false)
|
| H A D | variable-sized-memset-memcpy.ll | 22 define void @negative_test(i8* %src, i8 %c, i64 %size1, i64 %size2) { 31 %dst2 = alloca i8, i64 %size2 33 call void @llvm.memcpy.p0i8.p0i8.i64(i8* align 8 %dst2, i8* align 8 %dst1, i64 %size2, i1 false)
|
| H A D | variable-sized-memcpy-uninit.ll | 18 define void @test2(i64 %size1, i64 %size2, i64 %cpy_size) { 25 %dst = alloca i8, i64 %size2
|
| /llvm-project-15.0.7/mlir/test/Transforms/ |
| H A D | parametric-tiling.mlir | 33 // TILE_74-NEXT: %[[size2:.*]] = arith.divsi %[[sum2]], %c4 35 // TILE_74-NEXT: %[[step2:.*]] = arith.muli %c2, %[[size2]] 102 // TILE_74-NEXT: %[[size2:.*]] = arith.divsi %[[sum2]], %c4 104 // TILE_74-NEXT: %[[step2:.*]] = arith.muli %c2, %[[size2]]
|
| /llvm-project-15.0.7/llvm/test/Transforms/MergeFunc/ |
| H A D | alloca.ll | 25 ; CHECK-LABEL: define void @size2 27 define void @size2(i8 *%f) {
|
| /llvm-project-15.0.7/llvm/test/CodeGen/ARM/ |
| H A D | machine-cse-cmp.ll | 62 %size2 = sub nsw i32 %size, 0 67 %sub = sub nsw i32 %0, %size2
|
| /llvm-project-15.0.7/clang/test/SemaOpenCL/ |
| H A D | as_type.cl | 23 size_t size2 = as_size_t(l);
|
| /llvm-project-15.0.7/llvm/test/Transforms/NewGVN/ |
| H A D | 2009-01-21-SortInvalidation.ll | 8 …ern_buffer* nocapture %bufp, i8* %string1, i32 %size1, i8* %string2, i32 %size2, i32 %pos, %struct…
|
| /llvm-project-15.0.7/lldb/include/lldb/Expression/ |
| H A D | IRMemoryMap.h | 133 lldb::addr_t addr2, size_t size2);
|
| /llvm-project-15.0.7/llvm/test/Transforms/GVN/ |
| H A D | 2009-01-21-SortInvalidation.ll | 8 …ern_buffer* nocapture %bufp, i8* %string1, i32 %size1, i8* %string2, i32 %size2, i32 %pos, %struct…
|
| /llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_flat_map.h | 101 constexpr uptr size2() const { return kSize2; } in size2() function
|
| /llvm-project-15.0.7/compiler-rt/lib/tsan/rtl/ |
| H A D | tsan_rtl_access.cpp | 512 uptr size2 = size - size1; in UnalignedMemoryAccess() 513 if (LIKELY(size2 == 0)) in UnalignedMemoryAccess() 516 Shadow cur(fast_state, 0, size2, typ); in UnalignedMemoryAccess()
|
| H A D | tsan_rtl_report.cpp | 425 uptr size2) { in IsWithinAccess() argument 426 return addr1 >= addr2 && addr1 + size1 <= addr2 + size2; in IsWithinAccess()
|
| /llvm-project-15.0.7/lldb/source/Expression/ |
| H A D | IRMemoryMap.cpp | 214 lldb::addr_t addr2, size_t size2) { in AllocationsIntersect() argument 225 return (addr2 < (addr1 + size1)) && (addr1 < (addr2 + size2)); in AllocationsIntersect()
|
| /llvm-project-15.0.7/mlir/test/Dialect/MemRef/ |
| H A D | canonicalize.mlir | 711 func.func @reinterpret_of_reinterpret(%arg : memref<?xi8>, %size1: index, %size2: index) -> memref<… 713 …%1 = memref.reinterpret_cast %0 to offset: [0], sizes: [%size2], strides: [1] : memref<?xi8> to me… 735 func.func @reinterpret_of_subview(%arg : memref<?xi8>, %size1: index, %size2: index) -> memref<?xi8… 737 …%1 = memref.reinterpret_cast %0 to offset: [0], sizes: [%size2], strides: [1] : memref<?xi8> to me…
|
| /llvm-project-15.0.7/polly/lib/External/ppcg/ |
| H A D | gpu_group.c | 1314 isl_val *size, *size1, *size2; in smaller_tile() local 1318 size2 = gpu_array_tile_size(tile2); in smaller_tile() 1321 size = isl_val_sub(size, size2); in smaller_tile()
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Linalg/Transforms/ |
| H A D | Vectorization.cpp | 968 auto size2 = afterTrimming.getMixedSizes()[i]; in hasSameTensorSize() local 971 if (isEqualConstantIntOrValue(size1, size2)) in hasSameTensorSize() 976 auto v2 = size2.dyn_cast<Value>(); in hasSameTensorSize()
|
| /llvm-project-15.0.7/compiler-rt/lib/tsan/rtl-old/ |
| H A D | tsan_rtl_report.cpp | 527 uptr size2) { in IsWithinAccess() argument 528 return addr1 >= addr2 && addr1 + size1 <= addr2 + size2; in IsWithinAccess()
|
| /llvm-project-15.0.7/flang/lib/Evaluate/ |
| H A D | characteristics.cpp | 1210 auto size2{args2.size()}; in Rule1DistinguishingArg() local 1211 for (std::size_t i{0}; i < size1 + size2; ++i) { in Rule1DistinguishingArg()
|