Home
last modified time | relevance | path

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

/openbmc/linux/net/bridge/netfilter/
H A Debtables.c803 int i, chain_nr = -1, pos = 0, nentries = chain->nentries, verdict; in check_chainloops() local
807 while (pos < nentries || chain_nr != -1) { in check_chainloops()
811 e = cl_s[chain_nr].cs.e; in check_chainloops()
812 if (cl_s[chain_nr].from != -1) in check_chainloops()
814 cl_s[cl_s[chain_nr].from].cs.chaininfo->nentries; in check_chainloops()
817 pos = cl_s[chain_nr].cs.n; in check_chainloops()
819 cl_s[chain_nr].cs.n = 0; in check_chainloops()
820 chain_nr = cl_s[chain_nr].from; in check_chainloops()
853 cl_s[i].from = chain_nr; in check_chainloops()
854 chain_nr = i; in check_chainloops()
/openbmc/linux/tools/perf/util/
H A Dmachine.c2805 int chain_nr = min(max_stack, (int)chain->nr), i; in resolve_lbr_callchain_sample() local
2811 for (i = 0; i < chain_nr; i++) { in resolve_lbr_callchain_sample()
2817 if (i == chain_nr) in resolve_lbr_callchain_sample()
2919 int chain_nr = 0; in thread__resolve_callchain_sample() local
2927 chain_nr = chain->nr; in thread__resolve_callchain_sample()
3012 if (chain_nr == 0) in thread__resolve_callchain_sample()
3015 chain_nr -= nr; in thread__resolve_callchain_sample()
3026 i < chain_nr && nr_entries < max_stack; i++) { in thread__resolve_callchain_sample()