Searched refs:arr (Results 1 – 5 of 5) sorted by relevance
| /lib/ |
| A D | test_ubsan.c | 83 int arr[4]; in test_ubsan_out_of_bounds() member
92 data.arr[j] = i; in test_ubsan_out_of_bounds()
95 data.arr[k] = i; in test_ubsan_out_of_bounds()
130 volatile char arr[5] __aligned(4) = {1, 2, 3, 4, 5}; in test_ubsan_misaligned_access() local
134 ptr = (int *)(arr + 1); in test_ubsan_misaligned_access()
|
| A D | test_bitmap.c | 648 u32 arr[EXP1_IN_BITS / 32]; in test_bitmap_arr32() local
651 memset(arr, 0xa5, sizeof(arr)); in test_bitmap_arr32()
654 bitmap_to_arr32(arr, exp1, nbits); in test_bitmap_arr32()
655 bitmap_from_arr32(bmap2, arr, nbits); in test_bitmap_arr32()
668 expect_eq_uint(arr[DIV_ROUND_UP(nbits, 32)], in test_bitmap_arr32()
676 u64 arr[EXP1_IN_BITS / 64]; in test_bitmap_arr64() local
679 memset(arr, 0xa5, sizeof(arr)); in test_bitmap_arr64()
682 memset(bmap2, 0xff, sizeof(arr)); in test_bitmap_arr64()
683 bitmap_to_arr64(arr, exp1, nbits); in test_bitmap_arr64()
684 bitmap_from_arr64(bmap2, arr, nbits); in test_bitmap_arr64()
[all …]
|
| A D | test_vmalloc.c | 432 static void shuffle_array(int *arr, int n) in shuffle_array() argument
441 swap(arr[i], arr[j]); in shuffle_array()
|
| /lib/tests/ |
| A D | scanf_kunit.c | 283 #define fill_random_array(arr) \ argument
288 for (i = 0; i < ARRAY_SIZE(arr); i++, neg_pattern >>= 1) { \
289 (arr)[i] = random_for_type(typeof((arr)[0])); \
290 if (is_signed_type(typeof((arr)[0])) && (neg_pattern & 1)) \
291 (arr)[i] = -(arr)[i]; \
330 #define test_array_8(fn, check_data, string, fmt, arr) \ argument
332 BUILD_BUG_ON(ARRAY_SIZE(arr) != 8); \
334 &(arr)[0], &(arr)[1], &(arr)[2], &(arr)[3], \
335 &(arr)[4], &(arr)[5], &(arr)[6], &(arr)[7]); \
|
| /lib/zstd/compress/ |
| A D | huf_compress.c | 59 static size_t showU32(const U32* arr, size_t size) in showU32() argument
63 RAWLOG(6, " %u", arr[u]); (void)arr; in showU32()
573 U32 const pivot = arr[high].count; in HUF_quickSortPartition()
577 if (arr[j].count > pivot) { in HUF_quickSortPartition()
579 HUF_swapNodes(&arr[i], &arr[j]); in HUF_quickSortPartition()
582 HUF_swapNodes(&arr[i + 1], &arr[high]); in HUF_quickSortPartition()
589 static void HUF_simpleQuickSort(nodeElt arr[], int low, int high) { in HUF_simpleQuickSort() argument
592 HUF_insertionSort(arr, low, high); in HUF_simpleQuickSort()
596 int const idx = HUF_quickSortPartition(arr, low, high); in HUF_simpleQuickSort()
598 HUF_simpleQuickSort(arr, low, idx - 1); in HUF_simpleQuickSort()
[all …]
|
Completed in 14 milliseconds