Home
last modified time | relevance | path

Searched refs:n_list (Results 1 - 25 of 47) sorted by relevance

12

/kernel/linux/linux-5.10/net/netfilter/ipvs/
H A Dip_vs_rr.c42 if (p == &dest->n_list) in ip_vs_rr_del_dest()
64 last = dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_rr_schedule()
69 n_list) { in ip_vs_rr_schedule()
89 svc->sched_data = &dest->n_list; in ip_vs_rr_schedule()
105 .n_list = LIST_HEAD_INIT(ip_vs_rr_scheduler.n_list),
H A Dip_vs_wrr.c75 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_gcd_weight()
96 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_max_weight()
117 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_init_svc()
144 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_dest_changed()
179 n_list) { in ip_vs_wrr_schedule()
196 &last->n_list == &svc->destinations) in ip_vs_wrr_schedule()
202 &last->n_list != &svc->destinations) { in ip_vs_wrr_schedule()
243 .n_list = LIST_HEAD_INIT(ip_vs_wrr_scheduler.n_list),
H A Dip_vs_sched.c87 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in ip_vs_sched_getbyname()
187 if (!list_empty(&scheduler->n_list)) { in register_ip_vs_scheduler()
199 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in register_ip_vs_scheduler()
211 list_add(&scheduler->n_list, &ip_vs_schedulers); in register_ip_vs_scheduler()
231 if (list_empty(&scheduler->n_list)) { in unregister_ip_vs_scheduler()
241 list_del(&scheduler->n_list); in unregister_ip_vs_scheduler()
H A Dip_vs_pe.c29 list_for_each_entry_rcu(pe, &ip_vs_pe, n_list) { in __ip_vs_pe_getbyname()
78 list_for_each_entry(tmp, &ip_vs_pe, n_list) { in register_ip_vs_pe()
88 list_add_rcu(&pe->n_list, &ip_vs_pe); in register_ip_vs_pe()
102 list_del_rcu(&pe->n_list); in unregister_ip_vs_pe()
H A Dip_vs_sed.c78 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
93 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
121 .n_list = LIST_HEAD_INIT(ip_vs_sed_scheduler.n_list),
H A Dip_vs_wlc.c50 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
65 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
93 .n_list = LIST_HEAD_INIT(ip_vs_wlc_scheduler.n_list),
H A Dip_vs_lc.c41 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
70 .n_list = LIST_HEAD_INIT(ip_vs_lc_scheduler.n_list),
H A Dip_vs_fo.c32 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_fo_schedule()
57 .n_list = LIST_HEAD_INIT(ip_vs_fo_scheduler.n_list),
H A Dip_vs_ovf.c35 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_ovf_schedule()
64 .n_list = LIST_HEAD_INIT(ip_vs_ovf_scheduler.n_list),
H A Dip_vs_nq.c74 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
120 .n_list = LIST_HEAD_INIT(ip_vs_nq_scheduler.n_list),
H A Dip_vs_dh.c119 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_dh_reassign()
248 .n_list = LIST_HEAD_INIT(ip_vs_dh_scheduler.n_list),
H A Dip_vs_mh.c141 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_mh_permutate()
210 new_dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_mh_populate()
329 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_mh_gcd_weight()
357 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_mh_shift_weight()
516 .n_list = LIST_HEAD_INIT(ip_vs_mh_scheduler.n_list),
/kernel/linux/linux-6.6/net/netfilter/ipvs/
H A Dip_vs_rr.c42 if (p == &dest->n_list) in ip_vs_rr_del_dest()
64 last = dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_rr_schedule()
69 n_list) { in ip_vs_rr_schedule()
89 svc->sched_data = &dest->n_list; in ip_vs_rr_schedule()
105 .n_list = LIST_HEAD_INIT(ip_vs_rr_scheduler.n_list),
H A Dip_vs_wrr.c75 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_gcd_weight()
96 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_max_weight()
117 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_init_svc()
144 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_dest_changed()
179 n_list) { in ip_vs_wrr_schedule()
196 &last->n_list == &svc->destinations) in ip_vs_wrr_schedule()
202 &last->n_list != &svc->destinations) { in ip_vs_wrr_schedule()
243 .n_list = LIST_HEAD_INIT(ip_vs_wrr_scheduler.n_list),
H A Dip_vs_sched.c87 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in ip_vs_sched_getbyname()
187 if (!list_empty(&scheduler->n_list)) { in register_ip_vs_scheduler()
199 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in register_ip_vs_scheduler()
211 list_add(&scheduler->n_list, &ip_vs_schedulers); in register_ip_vs_scheduler()
231 if (list_empty(&scheduler->n_list)) { in unregister_ip_vs_scheduler()
241 list_del(&scheduler->n_list); in unregister_ip_vs_scheduler()
H A Dip_vs_wlc.c50 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
65 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
93 .n_list = LIST_HEAD_INIT(ip_vs_wlc_scheduler.n_list),
H A Dip_vs_pe.c29 list_for_each_entry_rcu(pe, &ip_vs_pe, n_list) { in __ip_vs_pe_getbyname()
78 list_for_each_entry(tmp, &ip_vs_pe, n_list) { in register_ip_vs_pe()
88 list_add_rcu(&pe->n_list, &ip_vs_pe); in register_ip_vs_pe()
102 list_del_rcu(&pe->n_list); in unregister_ip_vs_pe()
H A Dip_vs_sed.c78 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
93 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
121 .n_list = LIST_HEAD_INIT(ip_vs_sed_scheduler.n_list),
H A Dip_vs_twos.c55 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_twos_schedule()
78 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_twos_schedule()
122 .n_list = LIST_HEAD_INIT(ip_vs_twos_scheduler.n_list),
H A Dip_vs_fo.c32 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_fo_schedule()
57 .n_list = LIST_HEAD_INIT(ip_vs_fo_scheduler.n_list),
H A Dip_vs_lc.c41 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
70 .n_list = LIST_HEAD_INIT(ip_vs_lc_scheduler.n_list),
H A Dip_vs_ovf.c35 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_ovf_schedule()
64 .n_list = LIST_HEAD_INIT(ip_vs_ovf_scheduler.n_list),
H A Dip_vs_nq.c74 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
120 .n_list = LIST_HEAD_INIT(ip_vs_nq_scheduler.n_list),
H A Dip_vs_dh.c119 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_dh_reassign()
248 .n_list = LIST_HEAD_INIT(ip_vs_dh_scheduler.n_list),
H A Dip_vs_mh.c141 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_mh_permutate()
209 new_dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_mh_populate()
328 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_mh_gcd_weight()
356 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_mh_shift_weight()
515 .n_list = LIST_HEAD_INIT(ip_vs_mh_scheduler.n_list),

Completed in 9 milliseconds

12