Home
last modified time | relevance | path

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

/Linux-v4.19/net/bridge/netfilter/
Debtables.c791 int i, chain_nr = -1, pos = 0, nentries = chain->nentries, verdict; in check_chainloops() local
795 while (pos < nentries || chain_nr != -1) { in check_chainloops()
799 e = cl_s[chain_nr].cs.e; in check_chainloops()
800 if (cl_s[chain_nr].from != -1) in check_chainloops()
802 cl_s[cl_s[chain_nr].from].cs.chaininfo->nentries; in check_chainloops()
805 pos = cl_s[chain_nr].cs.n; in check_chainloops()
807 cl_s[chain_nr].cs.n = 0; in check_chainloops()
808 chain_nr = cl_s[chain_nr].from; in check_chainloops()
844 cl_s[i].from = chain_nr; in check_chainloops()
845 chain_nr = i; in check_chainloops()
/Linux-v4.19/tools/perf/util/
Dmachine.c2065 int chain_nr = min(max_stack, (int)chain->nr), i; in resolve_lbr_callchain_sample() local
2069 for (i = 0; i < chain_nr; i++) { in resolve_lbr_callchain_sample()
2075 if (i != chain_nr) { in resolve_lbr_callchain_sample()
2153 int chain_nr = 0; in thread__resolve_callchain_sample() local
2160 chain_nr = chain->nr; in thread__resolve_callchain_sample()
2242 if (chain_nr == 0) in thread__resolve_callchain_sample()
2245 chain_nr -= nr; in thread__resolve_callchain_sample()
2250 i < chain_nr && nr_entries < max_stack; i++) { in thread__resolve_callchain_sample()