Home
last modified time | relevance | path

Searched refs:chain_nr (Results 1 – 2 of 2) sorted by relevance

/Linux-v5.10/net/bridge/netfilter/
Debtables.c764 int i, chain_nr = -1, pos = 0, nentries = chain->nentries, verdict; in check_chainloops() local
768 while (pos < nentries || chain_nr != -1) { in check_chainloops()
772 e = cl_s[chain_nr].cs.e; in check_chainloops()
773 if (cl_s[chain_nr].from != -1) in check_chainloops()
775 cl_s[cl_s[chain_nr].from].cs.chaininfo->nentries; in check_chainloops()
778 pos = cl_s[chain_nr].cs.n; in check_chainloops()
780 cl_s[chain_nr].cs.n = 0; in check_chainloops()
781 chain_nr = cl_s[chain_nr].from; in check_chainloops()
814 cl_s[i].from = chain_nr; in check_chainloops()
815 chain_nr = i; in check_chainloops()
/Linux-v5.10/tools/perf/util/
Dmachine.c2559 int chain_nr = min(max_stack, (int)chain->nr), i; in resolve_lbr_callchain_sample() local
2565 for (i = 0; i < chain_nr; i++) { in resolve_lbr_callchain_sample()
2571 if (i == chain_nr) in resolve_lbr_callchain_sample()
2664 int chain_nr = 0; in thread__resolve_callchain_sample() local
2671 chain_nr = chain->nr; in thread__resolve_callchain_sample()
2756 if (chain_nr == 0) in thread__resolve_callchain_sample()
2759 chain_nr -= nr; in thread__resolve_callchain_sample()
2770 i < chain_nr && nr_entries < max_stack; i++) { in thread__resolve_callchain_sample()