| /kernel/linux/linux-5.10/net/netfilter/ipvs/ |
| H A D | ip_vs_wrr.c | 75 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_gcd_weight()
89 * Get the maximum weight of the service destinations.
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()
178 &svc->destinations, 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()
234 "all destinations are overloaded"); in ip_vs_wrr_schedule()
|
| H A D | ip_vs_rr.c | 28 svc->sched_data = &svc->destinations; in ip_vs_rr_init_svc()
68 &svc->destinations, in ip_vs_rr_schedule()
81 } while (pass < 2 && p != &svc->destinations); in ip_vs_rr_schedule()
|
| H A D | ip_vs_mh.c | 10 * the most-preferred position of destinations. Then it is to select
138 p = &svc->destinations; in ip_vs_mh_permutate()
140 while ((p = p->next) != &svc->destinations) { in ip_vs_mh_permutate()
182 p = &svc->destinations; in ip_vs_mh_populate()
186 if (p == &svc->destinations) in ip_vs_mh_populate()
190 while (p != &svc->destinations) { 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()
|
| H A D | ip_vs_sed.c | 78 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()
|
| H A D | ip_vs_wlc.c | 50 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()
|
| H A D | ip_vs_dh.c | 107 p = &svc->destinations; in ip_vs_dh_reassign()
116 if (p == &svc->destinations) in ip_vs_dh_reassign()
|
| H A D | ip_vs_lc.c | 41 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
|
| H A D | ip_vs_fo.c | 32 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_fo_schedule()
|
| H A D | ip_vs_ovf.c | 35 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_ovf_schedule()
|
| H A D | ip_vs_nq.c | 74 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
|
| H A D | ip_vs_lblc.c | 417 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
432 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
466 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
500 * sure that destinations, that are not in the trash, are not in ip_vs_lblc_schedule()
|
| H A D | ip_vs_sh.c | 29 * distribution of connections to the destinations in servernode. The
173 p = &svc->destinations; in ip_vs_sh_reassign()
183 if (p == &svc->destinations) in ip_vs_sh_reassign()
|
| /kernel/linux/linux-6.6/net/netfilter/ipvs/ |
| H A D | ip_vs_wrr.c | 75 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_gcd_weight()
89 * Get the maximum weight of the service destinations.
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()
178 &svc->destinations, 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()
234 "all destinations are overloaded"); in ip_vs_wrr_schedule()
|
| H A D | ip_vs_rr.c | 28 svc->sched_data = &svc->destinations; in ip_vs_rr_init_svc()
68 &svc->destinations, in ip_vs_rr_schedule()
81 } while (pass < 2 && p != &svc->destinations); in ip_vs_rr_schedule()
|
| H A D | ip_vs_mh.c | 10 * the most-preferred position of destinations. Then it is to select
138 p = &svc->destinations; in ip_vs_mh_permutate()
140 while ((p = p->next) != &svc->destinations) { in ip_vs_mh_permutate()
181 p = &svc->destinations; in ip_vs_mh_populate()
185 if (p == &svc->destinations) in ip_vs_mh_populate()
189 while (p != &svc->destinations) { 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()
|
| H A D | ip_vs_wlc.c | 50 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()
|
| H A D | ip_vs_sed.c | 78 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()
|
| H A D | ip_vs_twos.c | 19 * Randomly picks two destinations and picks the one with the least
55 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()
|
| H A D | ip_vs_dh.c | 107 p = &svc->destinations; in ip_vs_dh_reassign()
116 if (p == &svc->destinations) in ip_vs_dh_reassign()
|
| H A D | ip_vs_fo.c | 32 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_fo_schedule()
|
| H A D | ip_vs_lc.c | 41 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
|
| H A D | ip_vs_ovf.c | 35 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_ovf_schedule()
|
| H A D | ip_vs_nq.c | 74 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
|
| H A D | ip_vs_lblc.c | 417 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
432 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
466 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
500 * sure that destinations, that are not in the trash, are not in ip_vs_lblc_schedule()
|
| H A D | ip_vs_sh.c | 29 * distribution of connections to the destinations in servernode. The
173 p = &svc->destinations; in ip_vs_sh_reassign()
183 if (p == &svc->destinations) in ip_vs_sh_reassign()
|