Searched refs:n_i (Results 1 - 4 of 4) sorted by relevance
/linux-4.4.14/net/sched/ |
H A D | act_police.c | 64 int err = 0, index = -1, i = 0, s_i = 0, n_i = 0; tcf_act_police_walker() local 93 n_i++; hlist_for_each_entry_rcu() 98 if (n_i) 99 cb->args[0] += n_i; 100 return n_i;
|
H A D | act_api.c | 86 int err = 0, index = -1, i = 0, s_i = 0, n_i = 0; tcf_dump_walker() local 101 a->order = n_i; hlist_for_each_entry_rcu() 113 n_i++; hlist_for_each_entry_rcu() 114 if (n_i >= TCA_ACT_MAX_PRIO) hlist_for_each_entry_rcu() 120 if (n_i) 121 cb->args[0] += n_i; 122 return n_i; 136 int i = 0, n_i = 0; tcf_del_walker() local 151 n_i++; hlist_for_each_entry_safe() 156 if (nla_put_u32(skb, TCA_FCNT, n_i)) 160 return n_i;
|
/linux-4.4.14/kernel/sched/ |
H A D | loadavg.c | 239 * the binary encoding of numbers used by computers: n := \Sum n_i * 2^i, 240 * (where: n_i \elem {0, 1}, the binary vector representing n), 241 * we find: x^n := x^(\Sum n_i * 2^i) := \Prod x^(n_i * 2^i), which is
|
/linux-4.4.14/tools/perf/util/ |
H A D | stat.c | 31 * (\Sum n_i^2) - ((\Sum n_i)^2)/n
|
Completed in 304 milliseconds