| /OK3568_Linux_fs/kernel/net/netfilter/ipvs/ |
| H A 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()
|
| H A 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()
|
| H A 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()
|
| H A 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()
|
| H A 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()
|
| H A D | Kconfig | 240 share of the lookup table to each of the destinations and provides
242 destinations changes, a connection will likely be sent to the same
281 The source hashing scheduler maps source IPs to destinations
284 allow destinations to receive more connections, the table is
286 needs to be large enough to effectively fit all the destinations
296 The maglev hashing scheduler maps source IPs to destinations
301 65521 or 131071. When using weights to allow destinations to
304 enough to effectively fit all the destinations multiplied by their
|
| H A D | ip_vs_dh.c | 107 p = &svc->destinations; in ip_vs_dh_reassign()
116 if (p == &svc->destinations) in ip_vs_dh_reassign()
|
| H A 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()
|
| H A D | ip_vs_sh.c | 173 p = &svc->destinations; in ip_vs_sh_reassign()
183 if (p == &svc->destinations) in ip_vs_sh_reassign()
|
| H A D | ip_vs_fo.c | 32 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_fo_schedule()
|
| H A D | ip_vs_ovf.c | 35 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_ovf_schedule()
|
| H A D | ip_vs_lc.c | 41 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
|
| H A D | ip_vs_nq.c | 74 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
|
| H A 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()
|
| /OK3568_Linux_fs/kernel/Documentation/admin-guide/device-mapper/ |
| H A 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
|
| /OK3568_Linux_fs/buildroot/package/liblog4c-localtime/ |
| H A D | Config.in | 6 and other destinations.
|
| /OK3568_Linux_fs/buildroot/package/log4cpp/ |
| H A D | Config.in | 7 files, syslog, IDSA and other destinations. It is modeled
|
| /OK3568_Linux_fs/yocto/meta-openembedded/meta-oe/recipes-support/log4cpp/ |
| H A D | log4cpp_1.1.3.bb | 1 …ON = "A library of C++ classes for flexible logging to files, syslog, IDSA and other destinations."
|
| /OK3568_Linux_fs/yocto/meta-openembedded/meta-oe/recipes-support/log4c/ |
| H A D | log4c_1.2.4.bb | 1 SUMMARY = "Log4c is a C library for flexible logging to files, syslog and other destinations"
|
| /OK3568_Linux_fs/yocto/meta-openembedded/meta-oe/recipes-extended/liblogging/ |
| H A D | liblogging_1.0.6.bb | 8 and flexibility for different log destinations (e.g. syslog and systemd \
|
| /OK3568_Linux_fs/kernel/Documentation/virt/kvm/ |
| H A D | hypercalls.rst | 153 128 destinations per hypercall in 64-bit mode and 64 vCPUs per
154 hypercall in 32-bit mode. The destinations are represented by a
|
| /OK3568_Linux_fs/yocto/meta-openembedded/meta-oe/recipes-extended/fluentbit/ |
| H A D | fluentbit_1.3.5.bb | 4 backends (destinations) for your data. \
|
| /OK3568_Linux_fs/kernel/drivers/infiniband/ulp/ipoib/ |
| H A D | Kconfig | 25 unless you limit mtu for these destinations to 2044.
|
| /OK3568_Linux_fs/u-boot/doc/ |
| H A D | README.log | 87 Logging destinations
163 More logging destinations:
|
| /OK3568_Linux_fs/kernel/Documentation/driver-api/usb/ |
| H A D | anchors.rst | 82 destinations in one anchor you have no guarantee the chronologically
|