Home
last modified time | relevance | path

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

/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_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_dh.c106 p = &svc->destinations; in ip_vs_dh_reassign()
115 if (p == &svc->destinations) in ip_vs_dh_reassign()
H A Dip_vs_lblc.c420 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
435 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
469 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
503 * sure that destinations, that are not in the trash, are not in ip_vs_lblc_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_sh.c172 p = &svc->destinations; in ip_vs_sh_reassign()
182 if (p == &svc->destinations) in ip_vs_sh_reassign()
H A Dip_vs_lblcr.c582 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
598 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
632 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
H A Dip_vs_ctl.c1033 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lookup_dest()
1424 list_add_rcu(&dest->n_list, &svc->destinations); in __ip_vs_update_dest()
1873 INIT_LIST_HEAD(&svc->destinations); in ip_vs_add_service()
2094 list_for_each_entry_safe(dest, nxt, &svc->destinations, n_list) { in __ip_vs_del_service()
2301 list_for_each_entry_rcu(dest, &svc->destinations, in ip_vs_dst_event()
2332 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_zero_service()
3072 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_info_seq_show()
3705 list_for_each_entry(dest, &svc->destinations, n_list) { in __ip_vs_get_dest_entries()
4401 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
/linux/Documentation/networking/
H A Dila.rst46 that contains mappings for all destinations in the domain.
H A Dswitchdev.rst484 * If forwarding destinations can be managed per VLAN, the hardware could be
H A Dip-sysctl.rst2958 When enabled, the candidate source addresses for destinations
/linux/Documentation/admin-guide/hw-vuln/
H A Dprocessor_mmio_stale_data.rst39 destinations, the uncore logic returns 64 bytes of data to the core, including
/linux/include/net/
H A Dip_vs.h948 struct list_head destinations; /* real server d-linked list */ member