Home
last modified time | relevance | path

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

/linux-3.4.99/net/netfilter/ipvs/
Dip_vs_wrr.c49 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_gcd_weight()
70 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_max_weight()
91 mark->cl = &svc->destinations; in ip_vs_wrr_init_svc()
116 mark->cl = &svc->destinations; in ip_vs_wrr_update_svc()
144 if (mark->cl == &svc->destinations) { in ip_vs_wrr_schedule()
156 mark->cl = svc->destinations.next; in ip_vs_wrr_schedule()
164 mark->cl = &svc->destinations; in ip_vs_wrr_schedule()
174 if (mark->cl != &svc->destinations) { in ip_vs_wrr_schedule()
Dip_vs_rr.c33 svc->sched_data = &svc->destinations; in ip_vs_rr_init_svc()
40 svc->sched_data = &svc->destinations; in ip_vs_rr_update_svc()
62 if (q == &svc->destinations) { in ip_vs_rr_schedule()
Dip_vs_wlc.c54 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
69 list_for_each_entry_continue(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
Dip_vs_sed.c82 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
97 list_for_each_entry_continue(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
Dip_vs_dh.c107 p = &svc->destinations; in ip_vs_dh_assign()
112 if (p == &svc->destinations) in ip_vs_dh_assign()
Dip_vs_sh.c110 p = &svc->destinations; in ip_vs_sh_assign()
116 if (p == &svc->destinations) in ip_vs_sh_assign()
Dip_vs_lc.c45 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
Dip_vs_nq.c78 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
Dip_vs_lblc.c411 list_for_each_entry(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
426 list_for_each_entry_continue(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
460 list_for_each_entry(d, &svc->destinations, n_list) { in is_overloaded()
Dip_vs_lblcr.c580 list_for_each_entry(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
596 list_for_each_entry_continue(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
630 list_for_each_entry(d, &svc->destinations, n_list) { in is_overloaded()
Dip_vs_ctl.c596 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_lookup_dest()
825 list_add(&dest->n_list, &svc->destinations); in __ip_vs_update_dest()
1191 INIT_LIST_HEAD(&svc->destinations); in ip_vs_add_service()
1386 list_for_each_entry_safe(dest, nxt, &svc->destinations, n_list) { in __ip_vs_del_service()
1537 list_for_each_entry(dest, &svc->destinations, in ip_vs_dst_event()
1546 list_for_each_entry(dest, &svc->destinations, in ip_vs_dst_event()
1571 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_zero_service()
2024 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_info_seq_show()
2507 list_for_each_entry(dest, &svc->destinations, n_list) { in __ip_vs_get_dest_entries()
3114 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_genl_dump_dests()
DKconfig241 The source hashing scheduler maps source IPs to destinations
244 allow destinations to receive more connections, the table is
246 needs to be large enough to effectively fit all the destinations
/linux-3.4.99/Documentation/device-mapper/
Dkcopyd.txt16 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-3.4.99/drivers/infiniband/ulp/ipoib/
DKconfig24 unless you limit mtu for these destinations to 2044.
/linux-3.4.99/Documentation/usb/
Danchors.txt78 destinations in one anchor you have no guarantee the chronologically
/linux-3.4.99/drivers/staging/vme/
Dvme_api.txt272 and pattern sources and destinations (where appropriate):
/linux-3.4.99/include/net/
Dip_vs.h624 struct list_head destinations; /* real server d-linked list */ member
/linux-3.4.99/Documentation/networking/
Dbonding.txt769 required to reach most destinations.
2099 from the final destinations, thus, each destination (Host B, Host C)
2171 configuration (as described above), with destinations all on
2461 must be able to reach all destinations for traffic sent over the