Here are the results of a 40 byte udpping (http://gentwo.org/ll) run on
kernel from 2.6.22 to 2.6.30-rc3 on a Dell 1950 dual quad core 3.3Ghz.
One system fixed 2.6.22 kernel version on the other are varied.Nice graph at http://gentwo.org/results/udpping-results.pdf
Summary:
- Loss of ~1.5usec on fastest path (same cpu) since 2.6.22
- Different cpu same core looses 2-3 usecs vs. same cpu
- Different cpu different core looses ~ 8 usecs vs same cpu
- Maximum is usual if threads are on different sockets but sometimes
the same socket different core is worse (2.6.26/2.6.27).
- Up to 9 usecs variance in a basic network operation just because
of process placement.Same CPU
Kernel Test 1 Test 2 Test 3 Test 4 Average
2.6.22 83.03 82.9 82.89 82.92 82.94
2.6.23 83.35 82.81 82.83 82.86 82.96
2.6.24 82.66 82.56 82.64 82.73 82.65
2.6.25 84.28 84.29 84.37 84.3 84.31
2.6.26 84.72 84.38 84.41 84.68 84.55
2.6.27 84.56 84.44 84.41 84.58 84.5
2.6.28 84.7 84.43 84.47 84.48 84.52
2.6.29 84.91 84.67 84.69 84.75 84.76
2.6.30-rc2 84.94 84.72 84.69 84.93 84.82
2.6.30-rc3 84.88 84.7 84.73 84.89 84.8Same core, different processor (l2 is shared)
Kernel Test 1 Test 2 Test 3 Test 4 Average
2.6.22 84.6 84.71 84.52 84.53 84.59
2.6.23 84.59 84.5 84.33 84.34 84.44
2.6.24 84.28 84.3 84.38 84.28 84.31
2.6.25 86.12 85.8 86.2 86.04 86.04
2.6.26 86.61 86.46 86.49 86.7 86.57
2.6.27 87 87.01 87 86.95 86.99
2.6.28 86.53 86.44 86.26 86.24 86.37
2.6.29 85.88 85.94 86.1 85.69 85.9
2.6.30-rc2 86.03 85.93 85.99 86.06 86
2.6.30-rc3 85.73 85.88 85.67 85.94 85.81Same Socket, different core (l2 not shared)
Kernel Test 1 Test 2 Test 3 Test 4 Average
2.6.22 90.08 89.72 90 89.9 89.93
2.6.23 89.72 90.1 89.99 89.86 89.92
2.6.24 89.18 89.28 89.25 89.22 89.23
2.6.25 90.83 90.78 90.87 90.61 90.77
2.6.26 90.51 91.25 91.8 91.69 91.31
2.6.27 91.98 91.93 91.97 91.91 91.95
2.6.28 91.72 91.7 91.84 91.75 91.75
2.6.29 89.85 89.85 90.14 89.9 89.94
2.6.30-rc2 90.78 90.8 90.87 90.73 90.8
2.6.30...
In 2.6.25 we added UDP mem accounting.
This unfortunatly added a penalty when a frame is transmitted, since
we have at TX completion time to call sock_wfree() to perform necessary
memory accounting. This calls sock_def_write_space() and utimately
scheduler if any thread is waiting on the socket.
Thread(s) waiting for an incoming frame was scheduled, then had to sleep
again as event was meaningless.(All threads waiting on a socket are using same sk_sleep anchor)
This adds lot of extra wakeups and increases latencies, as noted
by Christoph Lameter, and slows down softirq handler.Reference : http://marc.info/?l=linux-netdev&m=124060437012283&w=2
Fortunatly, Davide Libenzi recently added concept of keyed wakeups
into kernel, and particularly for sockets (see commit
37e5540b3c9d838eb20f2ca8ea2eb8072271e403
epoll keyed wakeups: make sockets use keyed wakeups)Davide goal was to optimize epoll, but this new wakeup infrastructure
can help non epoll users as well, if they care to setup an appropriate
handler.This patch introduces new DEFINE_WAIT_FUNC() helper and uses it
in wait_for_packet(), so that only relevant event can wakeup a thread
blocked in this function.Trace of function calls from bnx2 TX completion bnx2_poll_work() is :
__kfree_skb()
skb_release_head_state()
sock_wfree()
sock_def_write_space()
__wake_up_sync_key()
__wake_up_common()
receiver_wake_function() : Stops here since thread is waiting for an INPUTReported-by: Christoph Lameter <cl@linux.com>
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
---
include/linux/wait.h | 6 ++++--
net/core/datagram.c | 14 +++++++++++++-
2 files changed, 17 insertions(+), 3 deletions(-)diff --git a/include/linux/wait.h b/include/linux/wait.h
index 5d631c1..bc02463 100644
--- a/include/linux/wait.h
+++ b/include/linux/wait.h
@@ -440,13 +440,15 @@ void abort_exclusive_wait(wait_queue_head_t *q, wait_queue_t *wait,
int autoremove_wake_function(wait_queue_...
From: Eric Dumazet <dada1@cosmosbay.com>
Ok, I was going to give some time towards considering the
alternative implementation of using 2 wait queues and what
it would look like.It didn't take long for me to figure out that this is so much
simpler that it's not even worth trying the dual wait queue
approach.So I've applied this to net-2.6, thanks!
Now, if we want to fix this up in -stable we'll need to scratch
our heads if we can't get the keyed wakeup patch in too. :-/--
From: Eric Dumazet <dada1@cosmosbay.com>
Great stuff Eric.
We've discussed splitting the wait queue up before, but shorter-term
your idea is pretty cool too :-)
--
Well, I only got this idea because Davide did its previous work, he is
the one who did the hard stuff :)About poll()/select() improvements, I believe following patch should
be fine too.Note some lines on this patch are longer than 80 columns, I am
aware of this but could not find an elegant/efficient way to
avoid this.Thank you
[PATCH] poll: Avoid extra wakeups in select/poll
After introduction of keyed wakeups Davide Libenzi did on epoll, we
are able to avoid spurious wakeups in poll()/select() code too.For example, typical use of poll()/select() is to wait for incoming
network frames on many sockets. But TX completion for UDP/TCP
frames call sock_wfree() which in turn schedules thread.When scheduled, thread does a full scan of all polled fds and
can sleep again, because nothing is really available. If number
of fds is large, this cause significant load.This patch makes select()/poll() aware of keyed wakeups and
useless wakeups are avoided. This reduces number of context
switches by about 50% on some setups, and work performed
by sofirq handlers.Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
---
fs/select.c | 28 +++++++++++++++++++++++++---
include/linux/poll.h | 3 +++
2 files changed, 28 insertions(+), 3 deletions(-)diff --git a/fs/select.c b/fs/select.c
index 0fe0e14..2708187 100644
--- a/fs/select.c
+++ b/fs/select.c
@@ -168,7 +168,7 @@ static struct poll_table_entry *poll_get_entry(struct poll_wqueues *p)
return table->entry++;
}-static int pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
+static int __pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
{
struct poll_wqueues *pwq = wait->private;
DECLARE_WAITQUEUE(dummy_wait, pwq->polling_task);
@@ -194,6 +194,16 @@ static int pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
return default_wake_function(&dummy_wait, mode, sync, key);
}+static int pollwake(wait_queue_t *wait, unsigned m...
I wonder if the key could be used for more state. For example if you
two processes are in recvmsg() on a socket and there's only a single
packet incoming we only need to wake up the first waiter. Could thatI'm late, but: very cool patch too.
Acked-by: Andi Kleen <ak@linux.intel.com>
-Andi
--
ak@linux.intel.com -- Speaking for myself only.
--
[PATCH] poll: Avoid extra wakeups in select/poll
After introduction of keyed wakeups Davide Libenzi did on epoll, we
are able to avoid spurious wakeups in poll()/select() code too.For example, typical use of poll()/select() is to wait for incoming
network frames on many sockets. But TX completion for UDP/TCP
frames call sock_wfree() which in turn schedules thread.When scheduled, thread does a full scan of all polled fds and
can sleep again, because nothing is really available. If number
of fds is large, this cause significant load.This patch makes select()/poll() aware of keyed wakeups and
useless wakeups are avoided. This reduces number of context
switches by about 50% on some setups, and work performed
by sofirq handlers.Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Acked-by: David S. Miller <davem@davemloft.net>
Acked-by: Andi Kleen <ak@linux.intel.com>
---
fs/select.c | 28 +++++++++++++++++++++++++---
include/linux/poll.h | 3 +++
2 files changed, 28 insertions(+), 3 deletions(-)diff --git a/fs/select.c b/fs/select.c
index 0fe0e14..2708187 100644
--- a/fs/select.c
+++ b/fs/select.c
@@ -168,7 +168,7 @@ static struct poll_table_entry *poll_get_entry(struct poll_wqueues *p)
return table->entry++;
}-static int pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
+static int __pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
{
struct poll_wqueues *pwq = wait->private;
DECLARE_WAITQUEUE(dummy_wait, pwq->polling_task);
@@ -194,6 +194,16 @@ static int pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
return default_wake_function(&dummy_wait, mode, sync, key);
}+static int pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
+{
+ struct poll_table_entry *entry;
+
+ entry = container_of(wait, struct poll_table_entry, wait);
+ if (key && !((unsigned long)key & entry->key))
+ return 0;
+ return __pollwake(wait, mode, sync, ...
Please factor this whole 'if (file)' branch out into a helper.
Typical indentation levels go from 1 to 3 tabs - 4 should be avoided
if possible and 5 is pretty excessive already. This goes to eight.Ingo
--
Thanks Ingo,
Here is v3 of patch, with your Acked-by included :)
This is IMHO clearer since helper immediatly follows POLLIN_SET / POLLOUT_SET /
POLLEX_SET defines.[PATCH] poll: Avoid extra wakeups in select/poll
After introduction of keyed wakeups Davide Libenzi did on epoll, we
are able to avoid spurious wakeups in poll()/select() code too.For example, typical use of poll()/select() is to wait for incoming
network frames on many sockets. But TX completion for UDP/TCP
frames call sock_wfree() which in turn schedules thread.When scheduled, thread does a full scan of all polled fds and
can sleep again, because nothing is really available. If number
of fds is large, this cause significant load.This patch makes select()/poll() aware of keyed wakeups and
useless wakeups are avoided. This reduces number of context
switches by about 50% on some setups, and work performed
by sofirq handlers.Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Acked-by: David S. Miller <davem@davemloft.net>
Acked-by: Andi Kleen <ak@linux.intel.com>
Acked-by: Ingo Molnar <mingo@elte.hu>
---
fs/select.c | 40 ++++++++++++++++++++++++++++++++++++----
include/linux/poll.h | 3 +++
2 files changed, 39 insertions(+), 4 deletions(-)diff --git a/fs/select.c b/fs/select.c
index 0fe0e14..ba068ad 100644
--- a/fs/select.c
+++ b/fs/select.c
@@ -168,7 +168,7 @@ static struct poll_table_entry *poll_get_entry(struct poll_wqueues *p)
return table->entry++;
}-static int pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
+static int __pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
{
struct poll_wqueues *pwq = wait->private;
DECLARE_WAITQUEUE(dummy_wait, pwq->polling_task);
@@ -194,6 +194,16 @@ static int pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
return default_wake_function(&dummy_wait, mode, sync, key);
}+static int pollwake(wait_queue_t *wait, unsigned mode, int sync,...
Looks much nicer now! [ I'd still suggest to factor out the guts of
do_select() as its nesting is excessive that hurts its reviewability
quite a bit - but now your patch does not make the situation any
worse. ]Even-More-Acked-by: Ingo Molnar <mingo@elte.hu>
Ingo
--
Well, I thought current practice was not using inline for such trivial functions,
as gcc already inlines them anyway.Quoting Documentation/CodingStyle :
Often people argue that adding inline to functions that are static and used
only once is always a win since there is no space tradeoff. While this is
technically correct, gcc is capable of inlining these automatically without
help, and the maintenance issue of removing the inline when a second user
appears outweighs the potential value of the hint that tells gcc to do
something it would have done anyway.Anyway :
[PATCH] poll: Avoid extra wakeups in select/poll
After introduction of keyed wakeups Davide Libenzi did on epoll, we
are able to avoid spurious wakeups in poll()/select() code too.For example, typical use of poll()/select() is to wait for incoming
network frames on many sockets. But TX completion for UDP/TCP
frames call sock_wfree() which in turn schedules thread.When scheduled, thread does a full scan of all polled fds and
can sleep again, because nothing is really available. If number
of fds is large, this cause significant load.This patch makes select()/poll() aware of keyed wakeups and
useless wakeups are avoided. This reduces number of context
switches by about 50% on some setups, and work performed
by sofirq handlers.Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Acked-by: David S. Miller <davem@davemloft.net>
Acked-by: Andi Kleen <ak@linux.intel.com>
Acked-by: Ingo Molnar <mingo@elte.hu>
---
fs/select.c | 40 ++++++++++++++++++++++++++++++++++++----
include/linux/poll.h | 3 +++
2 files changed, 39 insertions(+), 4 deletions(-)diff --git a/fs/select.c b/fs/select.c
index 0fe0e14..ba068ad 100644
--- a/fs/select.c
+++ b/fs/select.c
@@ -168,7 +168,7 @@ static struct poll_table_entry *poll_get_entry(struct poll_wqueues *p)
return table->entry++;
}-static int pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
+...
Looks fine to me Eric ...
Acked-by: Davide Libenzi <davidel@xmailserver.org>
- Davide
--
ok.
We tend to shop for drive-by cleanups in visibly ugly code whenever
someone wants to touch that code. Could go into a separate patch.Ingo
--
Seems that this is a virtuous patch even though Christoph is struggling
<resizes xterm rather a lot>
Can we (and should we) avoid all that manipulation of wait->key if
I kind of prefer to use plain old -1 for the all-ones pattern. Because
it always just works, and doesn't send the reviewer off to check if the
type was really u64 or something.--
yes, we could set wait to NULL as soon as retval is incremented.
and also do :--
[PATCH] poll: Avoid extra wakeups in select/poll
After introduction of keyed wakeups Davide Libenzi did on epoll, we
are able to avoid spurious wakeups in poll()/select() code too.For example, typical use of poll()/select() is to wait for incoming
network frames on many sockets. But TX completion for UDP/TCP
frames call sock_wfree() which in turn schedules thread.When scheduled, thread does a full scan of all polled fds and
can sleep again, because nothing is really available. If number
of fds is large, this cause significant load.This patch makes select()/poll() aware of keyed wakeups and
useless wakeups are avoided. This reduces number of context
switches by about 50% on some setups, and work performed
by sofirq handlers.Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Acked-by: David S. Miller <davem@davemloft.net>
Acked-by: Andi Kleen <ak@linux.intel.com>
---
fs/select.c | 33 +++++++++++++++++++++++++++++----
include/linux/poll.h | 3 +++
2 files changed, 32 insertions(+), 4 deletions(-)diff --git a/fs/select.c b/fs/select.c
index 0fe0e14..71377fd 100644
--- a/fs/select.c
+++ b/fs/select.c
@@ -168,7 +168,7 @@ static struct poll_table_entry *poll_get_entry(struct poll_wqueues *p)
return table->entry++;
}-static int pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
+static int __pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
{
struct poll_wqueues *pwq = wait->private;
DECLARE_WAITQUEUE(dummy_wait, pwq->polling_task);
@@ -194,6 +194,16 @@ static int pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
return default_wake_function(&dummy_wait, mode, sync, key);
}+static int pollwake(wait_queue_t *wait, unsigned mode, int sync, void *key)
+{
+ struct poll_table_entry *entry;
+
+ entry = container_of(wait, struct poll_table_entry, wait);
+ if (key && !((unsigned long)key & entry->key))
+ return 0;
+ return __pollwake(wait, mod...
The main drawback is that the select/poll data structures will get
larger. That could cause regression in theory. But I suspect
the win in some situations is still worth it. Of course
it would be nice if it handled more situations (like
multiple reader etc.)-Andi
--
Current size of struct poll_table_entry is 0x38 on 64-bit kernels.
Adding the key will make it 0x40 - which is not only a power of two
but also matches cache line size on most modern CPUs.So the size of this structure is ideal now and arithmetics on the
poll table have become simpler as well.So the patch has my ack:
Acked-by: Ingo Molnar <mingo@elte.hu>
Ingo
--
On poll()/select() interface, we must wakeup every pollers, because we dont know
if they really will consume the eventthread 1:
poll();
<insert an exit() or something bad here>
read();thread 2:
poll(); /* no return because event was 'granted' to thread 1 */
read();We could try to optimize read()/recvfrom() because we can know if event
is consumed, as its a whole syscall.--
For the udpping test load these patches have barely any effect:
git2p1 is the first version of the patch
git2p2 is the second version (this one)Same CPU
Kernel Test 1 Test 2 Test 3 Test 4 Average
2.6.22 83.03 82.9 82.89 82.92 82.935
2.6.23 83.35 82.81 82.83 82.86 82.9625
2.6.24 82.66 82.56 82.64 82.73 82.6475
2.6.25 84.28 84.29 84.37 84.3 84.31
2.6.26 84.72 84.38 84.41 84.68 84.5475
2.6.27 84.56 84.44 84.41 84.58 84.4975
2.6.28 84.7 84.43 84.47 84.48 84.52
2.6.29 84.91 84.67 84.69 84.75 84.755
2.6.30-rc2 84.94 84.72 84.69 84.93 84.82
2.6.30-rc3 84.88 84.7 84.73 84.89 84.8
2.6.30-rc3-git2p1 84.89 84.77 84.79 84.85 84.825
2.6.30-rc3-git2p2 84.91 84.79 84.78 84.8 84.82Same Core
Kernel Test 1 Test 2 Test 3 Test 4 Average
2.6.22 84.6 84.71 84.52 84.53 84.59
2.6.23 84.59 84.5 84.33 84.34 84.44
2.6.24 84.28 84.3 84.38 84.28 84.31
2.6.25 86.12 85.8 86.2 86.04 86.04
2.6.26 86.61 86.46 86.49 86.7 86.565
2.6.27 87 87.01 87 86.95 86.99
2.6.28 86.53 86.44 86.26 86.24 86.3675
2.6.29 85.88 85.94 86.1 85.69 85.9025
2.6.30-rc2 86.03 85.93 85.99 86.06 86.0025
2.6.30-rc3 85.73 85.88 85.67 85.94 85.805
2.6.30-rc3-git2p1 86.11 85.8 86.03 85.92 85.965
2.6.30-rc3-git2p2 86.04 85.96 85.89 86.04 85.9825Same Socket
Kernel Test 1 Test 2 Test 3 Test 4 Average
2.6.22 90.08 89.72 90 89.9 89.925
2.6.23 89.72 90.1 89.99 89.86 89.9175
2.6.24 89.18 89.28 89.25 89.22 89.2325
2.6.25 90.83 90.78 90.87 90.61 90.7725
2.6.26 90.51 91.25 91.8 91.69 91.3125
2.6.27 91.98 91.93 91.97 91.91 91.9475
2.6.28 91.72 91.7 91.84 91.75 91.7525
2.6.29 89.85 89.85 90.14 89.9 89.935
2.6.30-rc2 90.78 90.8 90.87 90.73 90.795
2.6.30-rc3 90.84 90.94 91.05 90.84 90.9175
2.6.30-rc3-git2p1 90.87 90.95 90.86 90.92 90.9
2.6.30-rc3-git2p2 91.09 91.01 90.97 91.06 91.0325Different Socket
Kernel Test 1 Test 2 Test 3 Test 4 Average
2.6.22 91.64 91.65 91.61 91.68 91.645
2.6.23 91.9 91.84 91.92 91.83 91.873
2.6.24 91.33 91.24 91.42 91.38 91.343
2.6.25 ...
But... udpping does *not* use poll() nor select(), unless I am mistaken ?
If you really want to test this patch with udpping, you might add a poll() call
before recvfrom() :while(1) {
+ struct pollfd pfd = { .fd = sock, .events = POLLIN};
+ poll(pfd, 1, -1);
nbytes = recvfrom(sock, msg, min(inblocksize, sizeof(msg)),
0, &inad, &inadlen);
if (nbytes < 0) {
perror("recvfrom");
break;
}
if (sendto(sock, msg, nbytes, 0, &inad, inadlen) < 0) {
perror("sendto");
break;
}
}Part about recvfrom() wakeup avoidance is in David net-2.6 tree, and saves 2 us on udpping here.
Is it what you call git2p1 ?
--
No that is just the prior version of the poll/select improvements.
Which patch are you referring to?
--
The one that did improved your udpping 'bench' :)
http://git2.kernel.org/?p=linux/kernel/git/davem/net-2.6.git;a=commitdif...
[PATCH] net: Avoid extra wakeups of threads blocked in wait_for_packet()
In 2.6.25 we added UDP mem accounting.
This unfortunatly added a penalty when a frame is transmitted, since
we have at TX completion time to call sock_wfree() to perform necessary
memory accounting. This calls sock_def_write_space() and utimately
scheduler if any thread is waiting on the socket.
Thread(s) waiting for an incoming frame was scheduled, then had to sleep
again as event was meaningless.(All threads waiting on a socket are using same sk_sleep anchor)
This adds lot of extra wakeups and increases latencies, as noted
by Christoph Lameter, and slows down softirq handler.Reference : http://marc.info/?l=linux-netdev&m=124060437012283&w=2
Fortunatly, Davide Libenzi recently added concept of keyed wakeups
into kernel, and particularly for sockets (see commit
37e5540b3c9d838eb20f2ca8ea2eb8072271e403
epoll keyed wakeups: make sockets use keyed wakeups)Davide goal was to optimize epoll, but this new wakeup infrastructure
can help non epoll users as well, if they care to setup an appropriate
handler.This patch introduces new DEFINE_WAIT_FUNC() helper and uses it
in wait_for_packet(), so that only relevant event can wakeup a thread
blocked in this function.Trace of function calls from bnx2 TX completion bnx2_poll_work() is :
__kfree_skb()
skb_release_head_state()
sock_wfree()
sock_def_write_space()
__wake_up_sync_key()
__wake_up_common()
receiver_wake_function() : Stops here since thread is waiting for an INPUTReported-by: Christoph Lameter <cl@linux.com>
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
---
include/linux/wait.h | 6 ++++--
net/core/datagram.c | 14 +++++++++++++-
2 files changed, 17 i...
Well yes that is git2p1. The measurements that we took showed not much of
an effect as you see.--
It depends of coalescing parameters of NIC.
BNX2 interrupts first handle TX completions, then RX events.
So If by the--
Sorry for the previous message...
If by the time interrupt comes to the host, TX was handled right before RX event,
the extra wakeup is not a problem, because incoming frame will be delivered into
socket queue right before awaken thread tries to pull it.On real workloads (many incoming/outgoing frames), then avoiding extra wakeups is
a win, regardless of coalescing parameters and cpu affinities...On uddpping, I had prior to the patch about 49000 wakeups per second,
and after patch about 26000 wakeups per second (matches number of incoming
udp messages per second)--
very nice. It might not show up as a real performance difference if
the CPUs are not fully saturated during the test - but it could show
up as a decrease in CPU utilization.Also, if you run the test via 'perf stat -a ./test.sh' you should
see a reduction in instructions executed:aldebaran:~/linux/linux> perf stat -a sleep 1
Performance counter stats for 'sleep':
16128.045994 task clock ticks (msecs)
12876 context switches (events)
219 CPU migrations (events)
186144 pagefaults (events)
20911802763 CPU cycles (events)
19309416815 instructions (events)
199608554 cache references (events)
19990754 cache misses (events)Wall-clock time elapsed: 1008.882282 msecs
With -a it's measured system-wide, from start of test to end of test
- the results will be a lot more stable (and relevant) statistically
than wall-clock time or CPU usage measurements. (both of which are
rather imprecise in general)Ingo
--
I tried this perf stuff and got strange results on a cpu burning bench,
saturating my 8 cpus with a "while (1) ;" loop# perf stat -a sleep 10
Performance counter stats for 'sleep':
80334.709038 task clock ticks (msecs)
80638 context switches (events)
4 CPU migrations (events)
468 pagefaults (events)
160694681969 CPU cycles (events)
160127154810 instructions (events)
686393 cache references (events)
230117 cache misses (events)Wall-clock time elapsed: 10041.531644 msecs
So its about 16069468196 cycles per second for 8 cpus
Divide by 8 to get 2008683524 cycles per second per cpu,
which is not 3000000000 (E5450 @ 3.00GHz)It seems strange a "jmp myself" uses one unhalted cycle per instruction
and 0.5 halted cycle ...Also, after using "perf stat", tbench results are 1778 MB/S
instead of 2610 MB/s. Even if no perf stat running.--
What does "perf stat -l -a sleep 10" show? I suspect your counters
are scaled by about 67%, due to counter over-commit. -l will show
the scaling factor (and will scale up the results).If so then i think this behavior is confusing, and i'll make -l
default-enabled. (in fact i just committed this change to latest
-tip and pushed it out)To get only instructions and cycles, do:
Hm, that would be a bug. Could you send the dmesg output of:
echo p > /proc/sysrq-trigger
echo p > /proc/sysrq-triggerwith counters running it will show something like:
[ 868.105712] SysRq : Show Regs
[ 868.106544]
[ 868.106544] CPU#1: ctrl: ffffffffffffffff
[ 868.106544] CPU#1: status: 0000000000000000
[ 868.106544] CPU#1: overflow: 0000000000000000
[ 868.106544] CPU#1: fixed: 0000000000000000
[ 868.106544] CPU#1: used: 0000000000000000
[ 868.106544] CPU#1: gen-PMC0 ctrl: 00000000001300c0
[ 868.106544] CPU#1: gen-PMC0 count: 000000ffee889194
[ 868.106544] CPU#1: gen-PMC0 left: 0000000011e1791a
[ 868.106544] CPU#1: gen-PMC1 ctrl: 000000000013003c
[ 868.106544] CPU#1: gen-PMC1 count: 000000ffd2542438
[ 868.106544] CPU#1: gen-PMC1 left: 000000002dd17a8ethe counts should stay put (i.e. all counters should be disabled).
If they move around - despite there being no 'perf stat -a' session
running, that would be a bug.Also, the overhead might be profile-able, via:
perf record -m 1024 sleep 10
(this records the profile into output.perf.)
followed by:
./perf-report | tail -20
to display a histogram, with kernel-space and user-space symbols
mixed into a single profile.(Pick up latest -tip to get perf-report built by default.)
Ingo
--
Only difference I see with '-l' is cache misses not counted.
(tbench 8 running, so not one instruction per cycle)
# perf stat -l -a sleep 10
Performance counter stats for 'sleep':
80007.128844 task clock ticks (msecs)
6754642 context switches (events)
2 CPU migrations (events)
474 pagefaults (events)
160925719143 CPU cycles (events)
108482003620 instructions (events)
7584035056 cache references (events)
<not counted> cache missesWall-clock time elapsed: 10000.595448 msecs
# perf stat -a sleep 10
Performance counter stats for 'sleep':
80702.908287 task clock ticks (msecs)
6792588 context switches (events)
24 CPU migrations (events)
4867 pagefaults (events)
161957342744 CPU cycles (events)
109147553984 instructions (events)
7633190481 cache references (events)
22996234 cache misses (events)# perf stat -e instructions -e cycles -a sleep 10
Performance counter stats for 'sleep':
109469842392 instructions (events)
162012922122 CPU cycles (events)Wall-clock time elapsed: 10124.943544 msecs
They stay fix (but only CPU#0 is displayed)
Is perf able to display per cpu counters, and not aggregated values ?
[ 7894.426787] CPU#0: ctrl: ffffffffffffffff
[ 7894.426788] CPU#0: status: 0000000000000000
[ 7894.426790] CPU#0: overflow: 0000000000000000
[ 7894.426792] CPU#0: fixed: 0000000000000000
[ 7894.426793] CPU#0: used: 0000000000000000
[ 7894.426796] CPU#0: gen-PMC0 ctrl: 0000000000134f2e
[ 7894.426798] CPU#0: gen-PMC0 count: 000000ffb91e31e1
[ 7894.426799] CPU#0: gen-PMC0 left: 000000007fffffff
[ 7894.426802] CPU#0: gen-PMC1 ctrl: 000000000013412e
[ 7894.426804] CPU#0: gen-PMC1 count: 000000ff80312b23
[ 7894.426805] CPU#0: gen-PMC1 left: 000000007fffffff
[ ...
I have to ask...
Is it possible that the machine runs at 3GHz initially, but slows down
to 2GHz for cooling reasons? One thing to try would be to run powertop,
which displays the frequencies. I get the following if mostly idle:PowerTOP version 1.8 (C) 2007 Intel Corporation
Cn Avg residency P-states (frequencies)
C0 (cpu running) (14.1%) 2.17 Ghz 4.3%
C1 0.0ms ( 0.0%) 1.67 Ghz 0.0%
C2 0.5ms (16.2%) 1333 Mhz 0.0%
C3 0.5ms (69.8%) 1000 Mhz 95.7%And the following with an infinite loop running:
PowerTOP version 1.8 (C) 2007 Intel Corporation
Cn Avg residency P-states (frequencies)
C0 (cpu running) (54.3%) 2.17 Ghz 100.0%
C1 0.0ms ( 0.0%) 1.67 Ghz 0.0%
C2 1.2ms ( 1.7%) 1333 Mhz 0.0%
C3 1.3ms (44.0%) 1000 Mhz 0.0%But I am probably missing the point here...
--
Well, I confirm all my cpus switched from 3GHz to 2GHz, after
"perf stat -a sleep 10"
(but "perf stat -e instructions -e cycles -a sleep 10" doesnt trigger this problem)
Nothing logged, and /proc/cpuinfo stills reports 3 GHz frequencies
# cat unit.c
main() {
int i;
for (i = 0 ; i < 10000000; i++)
getppid();
}
# time ./unitreal 0m0.818s
user 0m0.289s
sys 0m0.529s
# perf stat -a sleep 10 2>/dev/null
# time ./unitreal 0m1.122s
user 0m0.482s
sys 0m0.640s# tail -n 27 /proc/cpuinfo
processor : 7
vendor_id : GenuineIntel
cpu family : 6
model : 23
model name : Intel(R) Xeon(R) CPU E5450 @ 3.00GHz
stepping : 6
cpu MHz : 3000.102
cache size : 6144 KB
physical id : 1
siblings : 1
core id : 3
cpu cores : 4
apicid : 7
initial apicid : 7
fdiv_bug : no
hlt_bug : no
f00f_bug : no
coma_bug : no
fpu : yes
fpu_exception : yes
cpuid level : 10
wp : yes
flags : fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe lm constant_tsc arch_perfmon pebs bts pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 lahf_lm tpr_shadow vnmi flexpriority
bogomips : 6000.01
clflush size : 64
power management:# grep CPU_FREQ .config
# CONFIG_CPU_FREQ is not setperf_counter seems promising, but still... needs some bug hunting :)
Thank you
--
Update :
Mike Galbraith suggested me to try various things, and finally, I discovered
this frequency change was probably a BIOS problem on my HP BL460c G1System Options -> Power regulator for Proliant
[*] HP Dynamic Power Savings Mode
[ ] HP Static Low Power Mode
[ ] HP Static High Performance Mode
[ ] OS Control ModeI switched it to 'OS Control Mode'
Then acpi-cpufreq could load, and no more frequencies changes on a "perf -a sleep 10"
session, using or not cpufreq.
(Supported cpufreq speeds on these cpus : 1999 & 2999 MHz)So it was a BIOS issue
# perf stat -a sleep 10
Performance counter stats for 'sleep':
80005.418223 task clock ticks (msecs)
80266 context switches (events)
3 CPU migrations (events)
486 pagefaults (events)
240013851624 CPU cycles (events) << good >>
239076501419 instructions (events)
679464 cache references (events)
<not counted> cache missesWall-clock time elapsed: 10000.468808 msecs
Thank you
--
ah! That makes quite a bit of sense. The BIOS interfering with an OS
That looks perfect now.
It would also be really nice to have a sysrq-p dump of your PMU
state before you've done any profiling. Is there any trace of the
BIOS meddling with them, that we could detect (and warn about)
during bootup?Thanks,
Ingo
--
Difference is that on BIOS set to 'OS Control Mode' I see one more entry in ACPI list :
[ 0.000000] ACPI: SSDT cfe5b000 004C9 (v01 HP SSDTP 00000001 INTL 20030228)
...
And these 8 additional lines after (one per cpu)
[ 0.706697] ACPI: SSDT cfe5c000 002DA (v01 HP SSDT0 00000001 INTL 20030228)
[ 0.707250] ACPI: SSDT cfe5c300 002DA (v01 HP SSDT1 00000001 INTL 20030228)
[ 0.707768] ACPI: SSDT cfe5c600 002DA (v01 HP SSDT2 00000001 INTL 20030228)
[ 0.708376] ACPI: SSDT cfe5c900 002DF (v01 HP SSDT3 00000001 INTL 20030228)
[ 0.708964] ACPI: SSDT cfe5cc00 002DA (v01 HP SSDT4 00000001 INTL 20030228)
[ 0.709567] ACPI: SSDT cfe5cf00 002DA (v01 HP SSDT5 00000001 INTL 20030228)
[ 0.710122] ACPI: SSDT cfe5d200 002DA (v01 HP SSDT6 00000001 INTL 20030228)
[ 0.710713] ACPI: SSDT cfe5d500 002DA (v01 HP SSDT7 00000001 INTL 20030228)Also, if this option is set to default (HP Dynamic Power Savings Mode) I get :
# modprobe acpi-cpufreq
FATAL: Error inserting acpi_cpufreq (/lib/modules/2.6.30-rc4-tip-01560-gdd5fa92/kernel/arch/x86/kernel/cpu/cpufreq/acpi-cpufreq.ko): No such devicebut no kernel message logged.
Might be possible to add some kind of warning yes, I can test a patch if you want.
--
Guess there is more to come?
--
Sorry, hit wrong key.
So if by t
--
You lost 2 more characters..... Keyboard wonky?
--
Thanks, I am going to send it again on lkml this time :)
--
From: Eric Dumazet <dada1@cosmosbay.com>
Looks great to me:
Acked-by: David S. Miller <davem@davemloft.net>
But this has to go through something other than the
networking tree, of course :-)
--
Sure, I'll do that promptly :)
Thanks
--
Eric Dumazet wrote, On 04/26/2009 12:46 PM:
Eric, I wonder why you've forgotten about linux-kernel@ folks...
Jarek P.
--
Ah yes, I forgot, I only did a 'reply all' on David's mail.
I'll resubmit it anyway, since it was only a followup.--
Thanks Christoph for doing this
I believe we can restore pre 2.6.25 performance level with litle changes.
[Problem is that on 2.6.25, UDP mem accounting forced us to add a callback
to sock_def_write_space() at skb TX completion time. This function
then wake up all thread(s) blocked in revfrom() syscall. Once awaken,
thread(s) block again because no frame was received]Davide Libenzi added a 'key' opaque argument to wakeups so that eventpoll
can avoid unnecessary wakeups. This infrastructure could be used on other paths.
(Most important being this one : receivers, because writers are rarely blocked
because of sndbuffer filled)commit 37e5540b3c9d838eb20f2ca8ea2eb8072271e403
Author: Davide Libenzi <davidel@xmailserver.org>
Date: Tue Mar 31 15:24:21 2009 -0700epoll keyed wakeups: make sockets use keyed wakeups
Add support for event-aware wakeups to the sockets code. Events are
delivered to the wakeup target, so that epoll can avoid spurious wakeups
for non-interesting events.commit : 2dfa4eeab0fc7e8633974f2770945311b31eedf6
epoll keyed wakeups: teach epoll about hints coming with the wakeup key
Use the events hint now sent by some devices, to avoid unnecessary wakeups
for events that are of no interest for the caller. This code handles both
devices that are sending keyed events, and the ones that are not (and
event the ones that sometimes send events, and sometimes don't).We can add support for these key on regular socket code, so that a process
waiting on receive wont be scheduled because a TX completion occured.Standard way is using autoremove_wake_function() :
int autoremove_wake_function(wait_queue_t *wait, unsigned mode, int sync, void *key)
{
int ret = default_wake_function(wait, mode, sync, key);if (ret)
list_del_init(&wait->task_list);
return ret;
}/* this function ignores "key" argument */
int default_wake_function(wait_queue_t *curr, unsign...
| Greg KH | [GIT PATCH] driver core patches against 2.6.24 |
| Alan Cox | Re: Dual-Licensing Linux Kernel with GPL V2 and GPL V3 |
| Bart Van Assche | Integration of SCST in the mainstream Linux kernel |
| Jan Engelhardt | intel iommu (Re: -mm merge plans for 2.6.23) |
git: | |
| Gerrit Renker | [PATCH 27/37] dccp: Integration of dynamic feature activation - part 2 (server side) |
| David Miller | Re: [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
| David Miller | Re: [GIT]: Networking |
| Evgeniy Polyakov | Re: [BUG] New Kernel Bugs |
