Lines Matching refs:arr1
629 long arr1[16], arr2[16], sum = 0;
634 /* zero-init arr1 and arr2 in such a way that verifier doesn't know
636 * all combination of zero/non-zero stack slots for arr1/arr2, which
637 * will lead to O(2^(ARRAY_SIZE(arr1)+ARRAY_SIZE(arr2))) different
640 __bpf_memzero(arr1, sizeof(arr1));
641 __bpf_memzero(arr2, sizeof(arr1));
644 bpf_for(i, 0, ARRAY_SIZE(arr1)) {
646 arr1[i] = i;
654 bpf_for(i, 0, ARRAY_SIZE(arr1)) {
655 sum += arr1[i] + arr2[i];
691 int arr1[16], arr2[32];
697 /* fill arr1 */
698 n = ARRAY_SIZE(arr1);
700 fill(&it, arr1, n, 2);
709 /* sum arr1 */
710 n = ARRAY_SIZE(arr1);
712 sum1 = sum(&it, arr1, n);