/Linux-v5.4/net/netfilter/ipvs/ |
D | ip_vs_wrr.c | 75 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() 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()
|
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()
|
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_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()
|
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()
|
D | ip_vs_dh.c | 107 p = &svc->destinations; in ip_vs_dh_reassign() 116 if (p == &svc->destinations) in ip_vs_dh_reassign()
|
D | Kconfig | 241 share of the lookup table to each of the destinations and provides 243 destinations changes, a connection will likely be sent to the same 282 The source hashing scheduler maps source IPs to destinations 285 allow destinations to receive more connections, the table is 287 needs to be large enough to effectively fit all the destinations 297 The maglev hashing scheduler maps source IPs to destinations 302 65521 or 131071. When using weights to allow destinations to 305 enough to effectively fit all the destinations multiplied by their
|
D | ip_vs_fo.c | 32 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_fo_schedule()
|
D | ip_vs_lc.c | 41 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
|
D | ip_vs_ovf.c | 35 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_ovf_schedule()
|
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()
|
D | ip_vs_nq.c | 74 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
|
D | ip_vs_sh.c | 173 p = &svc->destinations; in ip_vs_sh_reassign() 183 if (p == &svc->destinations) in ip_vs_sh_reassign()
|
D | ip_vs_lblcr.c | 580 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule() 596 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule() 630 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
|
D | ip_vs_ctl.c | 656 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lookup_dest() 933 list_add_rcu(&dest->n_list, &svc->destinations); in __ip_vs_update_dest() 1348 INIT_LIST_HEAD(&svc->destinations); in ip_vs_add_service() 1523 list_for_each_entry_safe(dest, nxt, &svc->destinations, n_list) { in __ip_vs_del_service() 1662 list_for_each_entry(dest, &svc->destinations, in ip_vs_dst_event() 1671 list_for_each_entry(dest, &svc->destinations, in ip_vs_dst_event() 1697 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_zero_service() 2166 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_info_seq_show() 2651 list_for_each_entry(dest, &svc->destinations, n_list) { in __ip_vs_get_dest_entries() 3337 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_genl_dump_dests()
|
/Linux-v5.4/Documentation/admin-guide/device-mapper/ |
D | kcopyd.rst | 17 the source and destinations of the copy. Each io_region indicates a 19 of the copy is given as one io_region structure, and the destinations of the
|
/Linux-v5.4/Documentation/virt/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-v5.4/drivers/infiniband/ulp/ipoib/ |
D | Kconfig | 25 unless you limit mtu for these destinations to 2044.
|
/Linux-v5.4/Documentation/driver-api/usb/ |
D | anchors.rst | 82 destinations in one anchor you have no guarantee the chronologically
|
/Linux-v5.4/Documentation/trace/ |
D | intel_th.rst | 17 It consists of trace sources, trace destinations (outputs) and a
|
/Linux-v5.4/Documentation/process/ |
D | deprecated.rst | 101 still be used, but destinations should be marked with the `__nonstring
|
/Linux-v5.4/drivers/staging/comedi/drivers/ni_routing/ |
D | README | 177 Signal sources for most signals-destinations are given a specific naming
|
/Linux-v5.4/Documentation/networking/ |
D | ila.txt | 40 that contains mappings for all destinations in the domain.
|
/Linux-v5.4/Documentation/driver-api/ |
D | vme.rst | 191 and pattern sources and destinations (where appropriate):
|
/Linux-v5.4/include/net/ |
D | ip_vs.h | 629 struct list_head destinations; /* real server d-linked list */ member
|