| /Linux-v4.19/net/netfilter/ipvs/ |
| D | ip_vs_wrr.c | 80 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_gcd_weight()
101 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_max_weight()
122 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_init_svc()
149 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_dest_changed()
183 &svc->destinations, in ip_vs_wrr_schedule()
201 &last->n_list == &svc->destinations) in ip_vs_wrr_schedule()
207 &last->n_list != &svc->destinations) { in ip_vs_wrr_schedule()
|
| D | ip_vs_rr.c | 33 svc->sched_data = &svc->destinations; in ip_vs_rr_init_svc()
73 &svc->destinations, in ip_vs_rr_schedule()
86 } while (pass < 2 && p != &svc->destinations); in ip_vs_rr_schedule()
|
| D | ip_vs_mh.c | 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()
|
| D | ip_vs_wlc.c | 55 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
70 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
|
| D | ip_vs_sed.c | 83 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
98 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
|
| D | ip_vs_dh.c | 112 p = &svc->destinations; in ip_vs_dh_reassign()
121 if (p == &svc->destinations) in ip_vs_dh_reassign()
|
| D | Kconfig | 239 share of the lookup table to each of the destinations and provides
241 destinations changes, a connection will likely be sent to the same
280 The source hashing scheduler maps source IPs to destinations
283 allow destinations to receive more connections, the table is
285 needs to be large enough to effectively fit all the destinations
295 The maglev hashing scheduler maps source IPs to destinations
300 65521 or 131071. When using weights to allow destinations to
303 enough to effectively fit all the destinations multiplied by their
|
| D | ip_vs_fo.c | 37 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_fo_schedule()
|
| D | ip_vs_ovf.c | 40 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_ovf_schedule()
|
| D | ip_vs_lc.c | 46 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
|
| D | ip_vs_lblc.c | 422 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
437 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
471 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
|
| D | ip_vs_nq.c | 79 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
|
| D | ip_vs_sh.c | 178 p = &svc->destinations; in ip_vs_sh_reassign()
188 if (p == &svc->destinations) in ip_vs_sh_reassign()
|
| D | ip_vs_lblcr.c | 585 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
601 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
635 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
|
| D | ip_vs_ctl.c | 608 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lookup_dest()
876 list_add_rcu(&dest->n_list, &svc->destinations); in __ip_vs_update_dest()
1266 INIT_LIST_HEAD(&svc->destinations); in ip_vs_add_service()
1441 list_for_each_entry_safe(dest, nxt, &svc->destinations, n_list) { in __ip_vs_del_service()
1580 list_for_each_entry(dest, &svc->destinations, in ip_vs_dst_event()
1589 list_for_each_entry(dest, &svc->destinations, in ip_vs_dst_event()
1615 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_zero_service()
2084 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_info_seq_show()
2565 list_for_each_entry(dest, &svc->destinations, n_list) { in __ip_vs_get_dest_entries()
3246 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_genl_dump_dests()
|
| /Linux-v4.19/Documentation/device-mapper/ |
| D | kcopyd.txt | 16 the source and destinations of the copy. Each io_region indicates a
18 of the copy is given as one io_region structure, and the destinations of the
|
| /Linux-v4.19/Documentation/virtual/kvm/ |
| D | hypercalls.txt | 137 128 destinations per hypercall in 64-bit mode and 64 vCPUs per
138 hypercall in 32-bit mode. The destinations are represented by a
|
| /Linux-v4.19/drivers/infiniband/ulp/ipoib/ |
| D | Kconfig | 24 unless you limit mtu for these destinations to 2044.
|
| /Linux-v4.19/Documentation/driver-api/usb/ |
| D | anchors.rst | 82 destinations in one anchor you have no guarantee the chronologically
|
| /Linux-v4.19/Documentation/trace/ |
| D | intel_th.rst | 15 It consists of trace sources, trace destinations (outputs) and a
|
| /Linux-v4.19/Documentation/networking/ |
| D | ila.txt | 40 that contains mappings for all destinations in the domain.
|
| D | bonding.txt | 877 required to reach most destinations.
2289 from the final destinations, thus, each destination (Host B, Host C)
2358 configuration (as described above), with destinations all on
2648 must be able to reach all destinations for traffic sent over the
|
| D | ip-sysctl.txt | 1681 When enabled, the candidate source addresses for destinations
|
| /Linux-v4.19/Documentation/driver-api/ |
| D | vme.rst | 191 and pattern sources and destinations (where appropriate):
|
| /Linux-v4.19/include/net/ |
| D | ip_vs.h | 628 struct list_head destinations; /* real server d-linked list */ member
|
