Home
last modified time | relevance | path

Searched refs:destinations (Results 1 – 25 of 34) sorted by relevance

12

/linux/net/netfilter/ipvs/
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()
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()
H A Dip_vs_rr.c28 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 Dip_vs_mh.c138 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 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()
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()
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()
H A Dip_vs_dh.c107 p = &svc->destinations; in ip_vs_dh_reassign()
116 if (p == &svc->destinations) in ip_vs_dh_reassign()
H A DKconfig241 share of the lookup table to each of the destinations and provides
243 destinations changes, a connection will likely be sent to the same
293 The source hashing scheduler maps source IPs to destinations
296 allow destinations to receive more connections, the table is
298 needs to be large enough to effectively fit all the destinations
308 The maglev hashing scheduler maps source IPs to destinations
313 65521 or 131071. When using weights to allow destinations to
316 enough to effectively fit all the destinations multiplied by their
H A Dip_vs_fo.c32 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_fo_schedule()
H A Dip_vs_lblc.c416 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
431 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
465 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
H A Dip_vs_lc.c41 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
H A Dip_vs_ovf.c35 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_ovf_schedule()
H A Dip_vs_sh.c173 p = &svc->destinations; in ip_vs_sh_reassign()
183 if (p == &svc->destinations) in ip_vs_sh_reassign()
H A Dip_vs_nq.c74 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
H A Dip_vs_lblcr.c579 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
595 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
629 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
H A Dip_vs_ctl.c706 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lookup_dest()
1041 list_add_rcu(&dest->n_list, &svc->destinations); in __ip_vs_update_dest()
1447 INIT_LIST_HEAD(&svc->destinations); in ip_vs_add_service()
1640 list_for_each_entry_safe(dest, nxt, &svc->destinations, n_list) { in __ip_vs_del_service()
1782 list_for_each_entry(dest, &svc->destinations, in ip_vs_dst_event()
1791 list_for_each_entry(dest, &svc->destinations, in ip_vs_dst_event()
1816 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_zero_service()
2446 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_info_seq_show()
2937 list_for_each_entry(dest, &svc->destinations, n_list) { in __ip_vs_get_dest_entries()
3623 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_genl_dump_dests()
/linux/Documentation/admin-guide/device-mapper/
H A Dkcopyd.rst17 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/Documentation/virt/kvm/loongarch/
H A Dhypercalls.rst82 at most 128 destinations per hypercall. The destinations are represented in a
/linux/drivers/infiniband/ulp/ipoib/
H A DKconfig25 unless you limit mtu for these destinations to 2044.
/linux/Documentation/virt/kvm/x86/
H A Dhypercalls.rst153 128 destinations per hypercall in 64-bit mode and 64 vCPUs per
154 hypercall in 32-bit mode. The destinations are represented by a
/linux/Documentation/ABI/testing/
H A Dsysfs-timecard31 Description: (RO) Set of available destinations (sinks) for a SMA
222 The input destinations may be changed by writing multiple
225 destinations between connectors, the lowest numbered SMA
/linux/Documentation/driver-api/usb/
H A Danchors.rst82 destinations in one anchor you have no guarantee the chronologically
/linux/Documentation/trace/
H A Dintel_th.rst17 It consists of trace sources, trace destinations (outputs) and a
/linux/drivers/comedi/drivers/ni_routing/
H A DREADME177 Signal sources for most signals-destinations are given a specific naming
/linux/Documentation/networking/
H A Dila.rst46 that contains mappings for all destinations in the domain.

12