Home
last modified time | relevance | path

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

12

/linux/net/netfilter/ipvs/
H A Dip_vs_wrr.c74 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_gcd_weight()
95 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_max_weight()
116 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_init_svc()
143 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_dest_changed()
177 &svc->destinations, in ip_vs_wrr_schedule()
195 &last->n_list == &svc->destinations) in ip_vs_wrr_schedule()
201 &last->n_list != &svc->destinations) { in ip_vs_wrr_schedule()
H A Dip_vs_rr.c27 svc->sched_data = &svc->destinations; in ip_vs_rr_init_svc()
67 &svc->destinations, in ip_vs_rr_schedule()
80 } while (pass < 2 && p != &svc->destinations); in ip_vs_rr_schedule()
H A Dip_vs_mh.c137 p = &svc->destinations; in ip_vs_mh_permutate()
139 while ((p = p->next) != &svc->destinations) { in ip_vs_mh_permutate()
180 p = &svc->destinations; in ip_vs_mh_populate()
184 if (p == &svc->destinations) in ip_vs_mh_populate()
188 while (p != &svc->destinations) { in ip_vs_mh_populate()
326 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_mh_gcd_weight()
354 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_mh_shift_weight()
H A Dip_vs_wlc.c49 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
64 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
H A Dip_vs_sed.c77 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
92 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
H A Dip_vs_twos.c18 * Randomly picks two destinations and picks the one with the least
54 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_twos_schedule()
77 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_twos_schedule()
H A Dip_vs_dh.c106 p = &svc->destinations; in ip_vs_dh_reassign()
115 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_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_fo.c31 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_fo_schedule()
H A Dip_vs_lc.c40 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
H A Dip_vs_ovf.c34 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_ovf_schedule()
H A Dip_vs_sh.c172 p = &svc->destinations; in ip_vs_sh_reassign()
182 if (p == &svc->destinations) in ip_vs_sh_reassign()
H A Dip_vs_nq.c73 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.c1007 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lookup_dest()
1355 list_add_rcu(&dest->n_list, &svc->destinations); in __ip_vs_update_dest()
1788 INIT_LIST_HEAD(&svc->destinations); in ip_vs_add_service()
2006 list_for_each_entry_safe(dest, nxt, &svc->destinations, n_list) { in __ip_vs_del_service()
2201 list_for_each_entry_rcu(dest, &svc->destinations, in ip_vs_dst_event()
2232 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_zero_service()
2922 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_info_seq_show()
3553 list_for_each_entry(dest, &svc->destinations, n_list) { in __ip_vs_get_dest_entries()
4246 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_genl_dump_dests()
/linux/drivers/comedi/kcomedilib/
H A Dkcomedilib_main.c39 DECLARE_BITMAP(destinations[2], COMEDI_NUM_BOARD_MINORS); in kcomedilib_set_link_from_to()
62 bitmap_zero(destinations[cur], COMEDI_NUM_BOARD_MINORS); in kcomedilib_set_link_from_to()
63 set_bit(from, destinations[cur]); in kcomedilib_set_link_from_to()
69 if (test_bit(to, destinations[cur])) { in kcomedilib_set_link_from_to()
75 bitmap_zero(destinations[next], COMEDI_NUM_BOARD_MINORS); in kcomedilib_set_link_from_to()
76 while ((t = find_next_bit(destinations[cur], in kcomedilib_set_link_from_to()
83 set_bit(f, destinations[next]); in kcomedilib_set_link_from_to()
88 } while (!bitmap_empty(destinations[cur], COMEDI_NUM_BOARD_MINORS)); in kcomedilib_set_link_from_to()
/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/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/driver-api/usb/
H A Danchors.rst71 destinations in one anchor you have no guarantee the chronologically
/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/trace/
H A Dintel_th.rst17 It consists of trace sources, trace destinations (outputs) and a
/linux/Documentation/process/debugging/
H A Ddriver_development_debugging_guide.rst25 These are derivatives of printf() with varying destinations and support for
/linux/drivers/comedi/drivers/ni_routing/
H A DREADME177 Signal sources for most signals-destinations are given a specific naming

12