Home
last modified time | relevance | path

Searched +full:least +full:- (Results 1 – 25 of 1170) sorted by relevance

12345678910>>...47

/kernel/linux/linux-6.6/net/netfilter/ipvs/
Dip_vs_wlc.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * IPVS: Weighted Least-Connection Scheduling module
12 * Wensong Zhang : changed for the d-linked destination list
26 * Weighted Least Connection scheduling
32 struct ip_vs_dest *dest, *least; in ip_vs_wlc_schedule() local
39 * (dest overhead) / dest->weight in ip_vs_wlc_schedule()
41 * Remember -- no floats in kernel mode!!! in ip_vs_wlc_schedule()
50 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
51 if (!(dest->flags & IP_VS_DEST_F_OVERLOAD) && in ip_vs_wlc_schedule()
52 atomic_read(&dest->weight) > 0) { in ip_vs_wlc_schedule()
[all …]
Dip_vs_lc.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * IPVS: Least-Connection Scheduling module
21 * Least Connection scheduling
27 struct ip_vs_dest *dest, *least = NULL; in ip_vs_lc_schedule() local
33 * Simply select the server with the least number of in ip_vs_lc_schedule()
41 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
42 if ((dest->flags & IP_VS_DEST_F_OVERLOAD) || in ip_vs_lc_schedule()
43 atomic_read(&dest->weight) == 0) in ip_vs_lc_schedule()
46 if (!least || doh < loh) { in ip_vs_lc_schedule()
47 least = dest; in ip_vs_lc_schedule()
[all …]
Dip_vs_nq.c1 // SPDX-License-Identifier: GPL-2.0-or-later
11 * The NQ algorithm adopts a two-speed model. When there is an idle server
20 * pages 986-994, 1988.
45 return atomic_read(&dest->activeconns) + 1; in ip_vs_nq_dest_overhead()
50 * Weighted Least Connection scheduling
56 struct ip_vs_dest *dest, *least = NULL; in ip_vs_nq_schedule() local
63 * (server expected overhead) / dest->weight in ip_vs_nq_schedule()
65 * Remember -- no floats in kernel mode!!! in ip_vs_nq_schedule()
74 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
76 if (dest->flags & IP_VS_DEST_F_OVERLOAD || in ip_vs_nq_schedule()
[all …]
Dip_vs_sed.c1 // SPDX-License-Identifier: GPL-2.0-or-later
22 * pages 986-994, 1988.
49 return atomic_read(&dest->activeconns) + 1; in ip_vs_sed_dest_overhead()
54 * Weighted Least Connection scheduling
60 struct ip_vs_dest *dest, *least; in ip_vs_sed_schedule() local
67 * (server expected overhead) / dest->weight in ip_vs_sed_schedule()
69 * Remember -- no floats in kernel mode!!! in ip_vs_sed_schedule()
78 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
79 if (!(dest->flags & IP_VS_DEST_F_OVERLOAD) && in ip_vs_sed_schedule()
80 atomic_read(&dest->weight) > 0) { in ip_vs_sed_schedule()
[all …]
Dip_vs_lblcr.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * IPVS: Locality-Based Least-Connection with Replication scheduler
8 * Julian Anastasov : Added the missing (dest->weight>0)
16 * n, serverSet[dest_ip] <- {weighted least-conn node};
18 * n <- {least-conn (alive) node in serverSet[dest_ip]};
22 * n <- {weighted least-conn node};
25 * now - serverSet[dest_ip].lastMod > T then
26 * m <- {most conn node in serverSet[dest_ip]};
29 * serverSet[dest_ip].lastMod <- now;
80 #define IP_VS_LBLCR_TAB_MASK (IP_VS_LBLCR_TAB_SIZE - 1)
[all …]
DKconfig1 # SPDX-License-Identifier: GPL-2.0-only
10 IP Virtual Server support will let you build a high-performance
12 option must be enabled for at least one of the clustered computers
75 IP VS was compiled built-in.
116 tristate "round-robin scheduling"
118 The robin-robin scheduling algorithm simply directs network
119 connections to different real servers in a round-robin manner.
125 tristate "weighted round-robin scheduling"
127 The weighted robin-robin scheduling algorithm directs network
129 in a round-robin manner. Servers with higher weights receive
[all …]
Dip_vs_lblc.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * IPVS: Locality-Based Least-Connection scheduling module
9 * *lock(tbl->lock) ==> *lock(&tbl->lock)
10 * Wensong Zhang : fixed the uninitialized tbl->lock bug
23 * n, cachenode[dest_ip] <- {weighted least-conn node};
25 * n <- cachenode[dest_ip];
29 * n, cachenode[dest_ip] <- {weighted least-conn node};
81 #define IP_VS_LBLC_TAB_MASK (IP_VS_LBLC_TAB_SIZE - 1)
136 ip_vs_dest_put_and_free(en->dest); in ip_vs_lblc_rcu_free()
142 hlist_del_rcu(&en->list); in ip_vs_lblc_del()
[all …]
/kernel/linux/linux-5.10/net/netfilter/ipvs/
Dip_vs_wlc.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * IPVS: Weighted Least-Connection Scheduling module
12 * Wensong Zhang : changed for the d-linked destination list
26 * Weighted Least Connection scheduling
32 struct ip_vs_dest *dest, *least; in ip_vs_wlc_schedule() local
39 * (dest overhead) / dest->weight in ip_vs_wlc_schedule()
41 * Remember -- no floats in kernel mode!!! in ip_vs_wlc_schedule()
50 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
51 if (!(dest->flags & IP_VS_DEST_F_OVERLOAD) && in ip_vs_wlc_schedule()
52 atomic_read(&dest->weight) > 0) { in ip_vs_wlc_schedule()
[all …]
Dip_vs_lc.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * IPVS: Least-Connection Scheduling module
21 * Least Connection scheduling
27 struct ip_vs_dest *dest, *least = NULL; in ip_vs_lc_schedule() local
33 * Simply select the server with the least number of in ip_vs_lc_schedule()
41 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
42 if ((dest->flags & IP_VS_DEST_F_OVERLOAD) || in ip_vs_lc_schedule()
43 atomic_read(&dest->weight) == 0) in ip_vs_lc_schedule()
46 if (!least || doh < loh) { in ip_vs_lc_schedule()
47 least = dest; in ip_vs_lc_schedule()
[all …]
Dip_vs_nq.c1 // SPDX-License-Identifier: GPL-2.0-or-later
11 * The NQ algorithm adopts a two-speed model. When there is an idle server
20 * pages 986-994, 1988.
45 return atomic_read(&dest->activeconns) + 1; in ip_vs_nq_dest_overhead()
50 * Weighted Least Connection scheduling
56 struct ip_vs_dest *dest, *least = NULL; in ip_vs_nq_schedule() local
63 * (server expected overhead) / dest->weight in ip_vs_nq_schedule()
65 * Remember -- no floats in kernel mode!!! in ip_vs_nq_schedule()
74 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
76 if (dest->flags & IP_VS_DEST_F_OVERLOAD || in ip_vs_nq_schedule()
[all …]
Dip_vs_sed.c1 // SPDX-License-Identifier: GPL-2.0-or-later
22 * pages 986-994, 1988.
49 return atomic_read(&dest->activeconns) + 1; in ip_vs_sed_dest_overhead()
54 * Weighted Least Connection scheduling
60 struct ip_vs_dest *dest, *least; in ip_vs_sed_schedule() local
67 * (server expected overhead) / dest->weight in ip_vs_sed_schedule()
69 * Remember -- no floats in kernel mode!!! in ip_vs_sed_schedule()
78 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
79 if (!(dest->flags & IP_VS_DEST_F_OVERLOAD) && in ip_vs_sed_schedule()
80 atomic_read(&dest->weight) > 0) { in ip_vs_sed_schedule()
[all …]
Dip_vs_lblcr.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * IPVS: Locality-Based Least-Connection with Replication scheduler
8 * Julian Anastasov : Added the missing (dest->weight>0)
16 * n, serverSet[dest_ip] <- {weighted least-conn node};
18 * n <- {least-conn (alive) node in serverSet[dest_ip]};
22 * n <- {weighted least-conn node};
25 * now - serverSet[dest_ip].lastMod > T then
26 * m <- {most conn node in serverSet[dest_ip]};
29 * serverSet[dest_ip].lastMod <- now;
80 #define IP_VS_LBLCR_TAB_MASK (IP_VS_LBLCR_TAB_SIZE - 1)
[all …]
DKconfig1 # SPDX-License-Identifier: GPL-2.0-only
10 IP Virtual Server support will let you build a high-performance
12 option must be enabled for at least one of the clustered computers
74 if IP VS was compiled built-in.
115 tristate "round-robin scheduling"
117 The robin-robin scheduling algorithm simply directs network
118 connections to different real servers in a round-robin manner.
124 tristate "weighted round-robin scheduling"
126 The weighted robin-robin scheduling algorithm directs network
128 in a round-robin manner. Servers with higher weights receive
[all …]
Dip_vs_lblc.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * IPVS: Locality-Based Least-Connection scheduling module
9 * *lock(tbl->lock) ==> *lock(&tbl->lock)
10 * Wensong Zhang : fixed the uninitialized tbl->lock bug
23 * n, cachenode[dest_ip] <- {weighted least-conn node};
25 * n <- cachenode[dest_ip];
29 * n, cachenode[dest_ip] <- {weighted least-conn node};
81 #define IP_VS_LBLC_TAB_MASK (IP_VS_LBLC_TAB_SIZE - 1)
136 ip_vs_dest_put_and_free(en->dest); in ip_vs_lblc_rcu_free()
142 hlist_del_rcu(&en->list); in ip_vs_lblc_del()
[all …]
/kernel/linux/linux-6.6/tools/testing/selftests/rcutorture/doc/
DTREE_RCU-kconfig.txt1 This document gives a brief rationale for the TREE_RCU-related test
7 CONFIG_DEBUG_LOCK_ALLOC -- Do three, covering CONFIG_PROVE_LOCKING & not.
8 CONFIG_DEBUG_OBJECTS_RCU_HEAD -- Do one.
9 CONFIG_HZ_PERIODIC -- Do one.
10 CONFIG_NO_HZ_IDLE -- Do those not otherwise specified. (Groups of two.)
11 CONFIG_NO_HZ_FULL -- Do two, one with partial CPU enablement.
12 CONFIG_PREEMPT -- Do half. (First three and #8.)
13 CONFIG_PROVE_LOCKING -- Do several, covering CONFIG_DEBUG_LOCK_ALLOC=y and not.
14 CONFIG_PROVE_RCU -- Hardwired to CONFIG_PROVE_LOCKING.
15 CONFIG_RCU_BOOST -- one of PREEMPT_RCU.
[all …]
/kernel/linux/linux-5.10/tools/testing/selftests/rcutorture/doc/
DTREE_RCU-kconfig.txt1 This document gives a brief rationale for the TREE_RCU-related test
7 CONFIG_DEBUG_LOCK_ALLOC -- Do three, covering CONFIG_PROVE_LOCKING & not.
8 CONFIG_DEBUG_OBJECTS_RCU_HEAD -- Do one.
9 CONFIG_HZ_PERIODIC -- Do one.
10 CONFIG_NO_HZ_IDLE -- Do those not otherwise specified. (Groups of two.)
11 CONFIG_NO_HZ_FULL -- Do two, one with partial CPU enablement.
12 CONFIG_PREEMPT -- Do half. (First three and #8.)
13 CONFIG_PROVE_LOCKING -- Do several, covering CONFIG_DEBUG_LOCK_ALLOC=y and not.
14 CONFIG_PROVE_RCU -- Hardwired to CONFIG_PROVE_LOCKING.
15 CONFIG_RCU_BOOST -- one of PREEMPT_RCU.
[all …]
/kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/skylakex/
Dpipeline.json3 …y executing divide or square root operations. Accounts for integer and floating-point operations.",
117 …"PublicDescription": "Counts speculatively miss-predicted indirect branches at execution time. Cou…
168 …"PublicDescription": "This is a non-precise version (that is, does not use PEBS) of the event that…
188 …"BriefDescription": "Core crystal clock cycles when at least one thread on the physical core is un…
217 …"BriefDescription": "Core crystal clock cycles when at least one thread on the physical core is un…
241 …"BriefDescription": "Core cycles when at least one thread on the physical core is not in halt stat…
255 …"BriefDescription": "Core cycles when at least one thread on the physical core is not in halt stat…
367 …e number of prefixes in a 16B-line. This may result in a three-cycle penalty for each LCP (Length …
382 …tion. For instructions that consist of multiple micro-ops, Counts the retirement of the last micro
387 "BriefDescription": "Number of instructions retired. General Counter - architectural event",
[all …]
/kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/cascadelakex/
Dpipeline.json3 …y executing divide or square root operations. Accounts for integer and floating-point operations.",
117 …"PublicDescription": "Counts speculatively miss-predicted indirect branches at execution time. Cou…
168 …"PublicDescription": "This is a non-precise version (that is, does not use PEBS) of the event that…
188 …"BriefDescription": "Core crystal clock cycles when at least one thread on the physical core is un…
217 …"BriefDescription": "Core crystal clock cycles when at least one thread on the physical core is un…
241 …"BriefDescription": "Core cycles when at least one thread on the physical core is not in halt stat…
255 …"BriefDescription": "Core cycles when at least one thread on the physical core is not in halt stat…
367 …e number of prefixes in a 16B-line. This may result in a three-cycle penalty for each LCP (Length …
382 …tion. For instructions that consist of multiple micro-ops, Counts the retirement of the last micro
387 "BriefDescription": "Number of instructions retired. General Counter - architectural event",
[all …]
/kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/skylake/
Dpipeline.json3 …y executing divide or square root operations. Accounts for integer and floating-point operations.",
117 …"PublicDescription": "Counts speculatively miss-predicted indirect branches at execution time. Cou…
179 …"BriefDescription": "Core crystal clock cycles when at least one thread on the physical core is un…
208 …"BriefDescription": "Core crystal clock cycles when at least one thread on the physical core is un…
232 …"BriefDescription": "Core cycles when at least one thread on the physical core is not in halt stat…
246 …"BriefDescription": "Core cycles when at least one thread on the physical core is not in halt stat…
358 …e number of prefixes in a 16B-line. This may result in a three-cycle penalty for each LCP (Length …
373 …tion. For instructions that consist of multiple micro-ops, Counts the retirement of the last micro
378 "BriefDescription": "Number of instructions retired. General Counter - architectural event",
382 …n": "Counts the number of instructions (EOMs) retired. Counting covers macro-fused instructions in…
[all …]
/kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/tigerlake/
Dpipeline.json7 …y executing divide or square root operations. Accounts for integer and floating-point operations.",
117 "BriefDescription": "Mispredicted non-taken conditional branch instructions retired.",
135 …"BriefDescription": "All miss-predicted indirect branch instructions retired (excluding RETs. TSX …
139 …"PublicDescription": "Counts all miss-predicted indirect branch instructions retired (excluding RE…
166 …"PublicDescription": "This is a non-precise version (that is, does not use PEBS) of the event that…
190 …stal clock cycle counts between active hyperthreads, i.e., those in C0 sleep-state. A hyperthread …
341 …e number of prefixes in a 16B-line. This may result in a three-cycle penalty for each LCP (Length …
354 "BriefDescription": "Number of instructions retired. Fixed Counter - architectural event",
357 …"PublicDescription": "Counts the number of X86 instructions retired - an Architectural PerfMon eve…
362 "BriefDescription": "Number of instructions retired. General Counter - architectural event",
[all …]
/kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/rocketlake/
Dpipeline.json7 …y executing divide or square root operations. Accounts for integer and floating-point operations.",
117 "BriefDescription": "Mispredicted non-taken conditional branch instructions retired.",
135 …"BriefDescription": "All miss-predicted indirect branch instructions retired (excluding RETs. TSX …
139 …"PublicDescription": "Counts all miss-predicted indirect branch instructions retired (excluding RE…
166 …"PublicDescription": "This is a non-precise version (that is, does not use PEBS) of the event that…
190 …stal clock cycle counts between active hyperthreads, i.e., those in C0 sleep-state. A hyperthread …
324 …e number of prefixes in a 16B-line. This may result in a three-cycle penalty for each LCP (Length …
337 "BriefDescription": "Number of instructions retired. Fixed Counter - architectural event",
340 …"PublicDescription": "Counts the number of instructions retired - an Architectural PerfMon event. …
345 "BriefDescription": "Number of instructions retired. General Counter - architectural event",
[all …]
/kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/icelake/
Dpipeline.json7 …y executing divide or square root operations. Accounts for integer and floating-point operations.",
117 "BriefDescription": "Mispredicted non-taken conditional branch instructions retired.",
135 …"BriefDescription": "All miss-predicted indirect branch instructions retired (excluding RETs. TSX …
139 …"PublicDescription": "Counts all miss-predicted indirect branch instructions retired (excluding RE…
166 …"PublicDescription": "This is a non-precise version (that is, does not use PEBS) of the event that…
190 …stal clock cycle counts between active hyperthreads, i.e., those in C0 sleep-state. A hyperthread …
324 …e number of prefixes in a 16B-line. This may result in a three-cycle penalty for each LCP (Length …
337 "BriefDescription": "Number of instructions retired. Fixed Counter - architectural event",
340 …"PublicDescription": "Counts the number of instructions retired - an Architectural PerfMon event. …
345 "BriefDescription": "Number of instructions retired. General Counter - architectural event",
[all …]
/kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/icelakex/
Dpipeline.json7 …y executing divide or square root operations. Accounts for integer and floating-point operations.",
117 "BriefDescription": "Mispredicted non-taken conditional branch instructions retired.",
135 …"BriefDescription": "All miss-predicted indirect branch instructions retired (excluding RETs. TSX …
139 …"PublicDescription": "Counts all miss-predicted indirect branch instructions retired (excluding RE…
166 …"PublicDescription": "This is a non-precise version (that is, does not use PEBS) of the event that…
190 …stal clock cycle counts between active hyperthreads, i.e., those in C0 sleep-state. A hyperthread …
324 …e number of prefixes in a 16B-line. This may result in a three-cycle penalty for each LCP (Length …
337 "BriefDescription": "Number of instructions retired. Fixed Counter - architectural event",
340 …"PublicDescription": "Counts the number of instructions retired - an Architectural PerfMon event. …
345 "BriefDescription": "Number of instructions retired. General Counter - architectural event",
[all …]
/kernel/linux/linux-6.6/Documentation/ABI/stable/
Dsysfs-bus-mhi6 using a BHI (Boot Host Interface) register read after at least
8 without having the device power on at least once, the file will
18 at least one attempt to power up the device has been done. If
19 read without having the device power on at least once, the file
28 a reset of last resort, and will require a complete re-init.
30 non-responsive, or as a means of loading new firmware as a
/kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/ivybridge/
Dpipeline.json29 "BriefDescription": "Speculative and retired macro-conditional branches",
32 "PublicDescription": "Speculative and retired macro-conditional branches.",
37 …"BriefDescription": "Speculative and retired macro-unconditional branches excluding calls and indi…
40 …"PublicDescription": "Speculative and retired macro-unconditional branches excluding calls and ind…
68 "BriefDescription": "Not taken macro-conditional branches",
71 "PublicDescription": "Not taken macro-conditional branches.",
76 "BriefDescription": "Taken speculative and retired macro-conditional branches",
79 "PublicDescription": "Taken speculative and retired macro-conditional branches.",
84 …"BriefDescription": "Taken speculative and retired macro-conditional branch instructions excluding…
87 …"PublicDescription": "Taken speculative and retired macro-conditional branch instructions excludin…
[all …]

12345678910>>...47