• Home
  • Raw
  • Download

Lines Matching refs:j

504 		int j;  in print_verifier_state()  local
506 for (j = 0; j < BPF_REG_SIZE; j++) { in print_verifier_state()
507 if (state->stack[i].slot_type[j] != STACK_INVALID) in print_verifier_state()
509 types_buf[j] = slot_type_char[ in print_verifier_state()
510 state->stack[i].slot_type[j]]; in print_verifier_state()
1647 int i, j; in mark_all_scalars_precise() local
1655 for (j = 0; j < BPF_REG_FP; j++) { in mark_all_scalars_precise()
1656 reg = &func->regs[j]; in mark_all_scalars_precise()
1661 for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) { in mark_all_scalars_precise()
1662 if (func->stack[j].slot_type[0] != STACK_SPILL) in mark_all_scalars_precise()
1664 reg = &func->stack[j].spilled_ptr; in mark_all_scalars_precise()
2980 int err, min_off, max_off, i, j, slot, spi; in check_stack_boundary() local
3071 for (j = 0; j < BPF_REG_SIZE; j++) in check_stack_boundary()
3072 state->stack[spi].slot_type[j] = STACK_MISC; in check_stack_boundary()
6752 int i, j; in clean_func_state() local
6771 for (j = 0; j < BPF_REG_SIZE; j++) in clean_func_state()
6772 st->stack[i].slot_type[j] = STACK_INVALID; in clean_func_state()
7262 int i, j, err, states_cnt = 0; in is_state_visited() local
7442 for (j = 0; j <= cur->curframe; j++) { in is_state_visited()
7443 for (i = j < cur->curframe ? BPF_REG_6 : 0; i < BPF_REG_FP; i++) in is_state_visited()
7444 cur->frame[j]->regs[i].parent = &new->frame[j]->regs[i]; in is_state_visited()
7446 cur->frame[j]->regs[i].live = REG_LIVE_NONE; in is_state_visited()
7450 for (j = 0; j <= cur->curframe; j++) { in is_state_visited()
7451 struct bpf_func_state *frame = cur->frame[j]; in is_state_visited()
7452 struct bpf_func_state *newframe = new->frame[j]; in is_state_visited()
7928 int i, j, err; in replace_map_fd_with_map_ptr() local
8025 for (j = 0; j < env->used_map_cnt; j++) { in replace_map_fd_with_map_ptr()
8026 if (env->used_maps[j] == map) { in replace_map_fd_with_map_ptr()
8027 aux->map_index = j; in replace_map_fd_with_map_ptr()
8182 int i, j; in adjust_subprog_starts_after_remove() local
8189 for (j = i; j < env->subprog_cnt; j++) in adjust_subprog_starts_after_remove()
8190 if (env->subprog_info[j].start >= off + cnt) in adjust_subprog_starts_after_remove()
8195 if (env->subprog_info[j].start != off + cnt) in adjust_subprog_starts_after_remove()
8196 j--; in adjust_subprog_starts_after_remove()
8198 if (j > i) { in adjust_subprog_starts_after_remove()
8203 move = env->subprog_cnt + 1 - j; in adjust_subprog_starts_after_remove()
8206 env->subprog_info + j, in adjust_subprog_starts_after_remove()
8208 env->subprog_cnt -= j - i; in adjust_subprog_starts_after_remove()
8212 move = aux->func_info_cnt - j; in adjust_subprog_starts_after_remove()
8215 aux->func_info + j, in adjust_subprog_starts_after_remove()
8217 aux->func_info_cnt -= j - i; in adjust_subprog_starts_after_remove()
8399 int j; in opt_remove_dead_code() local
8401 j = 0; in opt_remove_dead_code()
8402 while (i + j < insn_cnt && !aux_data[i + j].seen) in opt_remove_dead_code()
8403 j++; in opt_remove_dead_code()
8404 if (!j) in opt_remove_dead_code()
8407 err = verifier_remove_insns(env, i, j); in opt_remove_dead_code()
8695 int i, j, subprog_start, subprog_end = 0, len, subprog; in jit_subprogs() local
8786 for (j = 0; j < func[i]->len; j++, insn++) { in jit_subprogs()