Lines Matching defs:sl
8959 struct bpf_verifier_state_list *sl;
8962 sl = *explored_state(env, insn);
8963 while (sl) {
8964 if (sl->state.branches) {
8967 if (sl->state.insn_idx != insn || sl->state.curframe != cur->curframe) {
8971 if (sl->state.frame[i]->callsite != cur->frame[i]->callsite) {
8975 clean_verifier_state(env, &sl->state);
8977 sl = sl->next;
9410 struct bpf_verifier_state_list *sl, **pprev;
9436 sl = *pprev;
9440 while (sl) {
9442 if (sl->state.insn_idx != insn_idx) {
9445 if (sl->state.branches) {
9446 if (states_maybe_looping(&sl->state, cur) && states_equal(env, &sl->state, cur)) {
9469 if (states_equal(env, &sl->state, cur)) {
9470 sl->hit_cnt++;
9481 err = propagate_liveness(env, &sl->state, cur);
9489 err = err ?: propagate_precision(env, &sl->state);
9503 sl->miss_cnt++;
9510 if (sl->miss_cnt > sl->hit_cnt * 3 + 3) {
9514 *pprev = sl->next;
9515 if (sl->state.frame[0]->regs[0].live & REG_LIVE_DONE) {
9516 u32 br = sl->state.branches;
9519 free_verifier_state(&sl->state, false);
9520 kfree(sl);
9527 sl->next = env->free_list;
9528 env->free_list = sl;
9530 sl = *pprev;
9534 pprev = &sl->next;
9535 sl = *pprev;
9556 * When looping the sl->state.branches will be > 0 and this state
11557 struct bpf_verifier_state_list *sl, *sln;
11560 sl = env->free_list;
11561 while (sl) {
11562 sln = sl->next;
11563 free_verifier_state(&sl->state, false);
11564 kfree(sl);
11565 sl = sln;
11574 sl = env->explored_states[i];
11576 while (sl) {
11577 sln = sl->next;
11578 free_verifier_state(&sl->state, false);
11579 kfree(sl);
11580 sl = sln;