Home
last modified time | relevance | path

Searched refs:arr1 (Results 1 – 8 of 8) sorted by relevance

/openbmc/linux/tools/testing/selftests/bpf/progs/
H A Diters.c629 long arr1[16], arr2[16], sum = 0; in iter_stack_array_loop() local
640 __bpf_memzero(arr1, sizeof(arr1)); in iter_stack_array_loop()
641 __bpf_memzero(arr2, sizeof(arr1)); in iter_stack_array_loop()
644 bpf_for(i, 0, ARRAY_SIZE(arr1)) { in iter_stack_array_loop()
646 arr1[i] = i; in iter_stack_array_loop()
654 bpf_for(i, 0, ARRAY_SIZE(arr1)) { in iter_stack_array_loop()
655 sum += arr1[i] + arr2[i]; in iter_stack_array_loop()
691 int arr1[16], arr2[32]; in iter_pass_iter_ptr_to_subprog() local
698 n = ARRAY_SIZE(arr1); in iter_pass_iter_ptr_to_subprog()
700 fill(&it, arr1, n, 2); in iter_pass_iter_ptr_to_subprog()
[all …]
H A Dbtf_dump_test_case_syntax.c177 int arr1[13]; member
/openbmc/linux/tools/testing/selftests/bpf/bpf_testmod/
H A Dbpf_testmod_kfunc.h44 short arr1[4]; member
63 char arr1[2]; member
/openbmc/u-boot/lib/bzip2/
H A Dbzlib.c223 s->arr1 = NULL; in BZ_API()
228 s->arr1 = BZALLOC( n * sizeof(UInt32) ); in BZ_API()
232 if (s->arr1 == NULL || s->arr2 == NULL || s->ftab == NULL) { in BZ_API()
233 if (s->arr1 != NULL) BZFREE(s->arr1); in BZ_API()
250 s->mtfv = (UInt16*)s->arr1; in BZ_API()
252 s->ptr = (UInt32*)s->arr1; in BZ_API()
527 if (s->arr1 != NULL) BZFREE(s->arr1); in BZ_API()
H A Dbzlib_private.h242 UInt32* arr1; member
H A Dbzlib_blocksort.c1085 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); in BZ2_blockSort()
1119 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); in BZ2_blockSort()
/openbmc/linux/Documentation/staging/
H A Dspeculation.rst51 int load_dependent_arrays(int *arr1, int *arr2, int index)
55 val1 = load_array(arr1, index);
/openbmc/openbmc/poky/meta/lib/oe/package_manager/
H A D__init__.py437 def _append(arr1, arr2, sep='/'): argument
439 narr1 = [a.rstrip(sep) for a in arr1]