Lines Matching refs:sum
266 int *v, i = 0, sum = 0; in iter_limit_cond_break_loop() local
273 sum += *v; in iter_limit_cond_break_loop()
281 bpf_printk("ITER_SIMPLE: sum=%d\n", sum); in iter_limit_cond_break_loop()
291 int *v, sum = 0; in iter_obfuscate_counter() local
321 sum += x; in iter_obfuscate_counter()
325 bpf_printk("ITER_OBFUSCATE_COUNTER: sum=%d\n", sum); in iter_obfuscate_counter()
372 int sum, i; in iter_array_fill() local
380 sum = 0; in iter_array_fill()
382 sum += arr[i]; in iter_array_fill()
385 bpf_printk("ITER_ARRAY_FILL: sum=%d (should be %d)\n", sum, 255 * 256); in iter_array_fill()
398 int sum, row, col; in iter_nested_iters() local
409 sum = 0; in iter_nested_iters()
420 sum += arr2d[row][col]; in iter_nested_iters()
426 bpf_printk("ITER_NESTED_ITERS: total sum=%d", sum); in iter_nested_iters()
443 int sum = 0; in iter_nested_deeply_iters() local
452 sum += 1; in iter_nested_deeply_iters()
461 return sum; in iter_nested_deeply_iters()
475 int sum = 0, col; in sum_inner_dimension() local
478 sum += arr2d[row][col]; in sum_inner_dimension()
483 return sum; in sum_inner_dimension()
490 int sum, row, col; in iter_subprog_iters() local
499 sum = 0; in iter_subprog_iters()
509 sum += sum_inner_dimension(row); in iter_subprog_iters()
512 bpf_printk("ITER_SUBPROG_ITERS: total sum=%d", sum); in iter_subprog_iters()
628 long arr1[16], arr2[16], sum = 0; in iter_stack_array_loop() local
654 sum += arr1[i] + arr2[i]; in iter_stack_array_loop()
657 return sum; in iter_stack_array_loop()
672 static __noinline int sum(struct bpf_iter_num *it, int *arr, __u32 n) in sum() function
674 int *t, i, sum = 0; in sum() local
680 sum += arr[i]; in sum()
683 return sum; in sum()
711 sum1 = sum(&it, arr1, n); in iter_pass_iter_ptr_to_subprog()
717 sum2 = sum(&it, arr2, n); in iter_pass_iter_ptr_to_subprog()
1538 int i, n = loop_data.n, sum = 0; in iter_arr_with_actual_elem_count() local
1545 sum += loop_data.data[i]; in iter_arr_with_actual_elem_count()
1548 return sum; in iter_arr_with_actual_elem_count()