2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2005-05-05 16:16:16 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
2008-10-13 19:01:08 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-02-09 23:24:47 +09:00
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-02-09 23:24:47 +09:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-06-27 15:37:46 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-02-09 23:24:47 +09:00
|
|
|
|
2012-03-12 07:03:32 +00:00
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
2007-12-31 00:29:24 -08:00
|
|
|
|
2008-10-29 02:32:32 -07:00
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2005-12-27 02:43:12 -02:00
|
|
|
|
2015-06-03 16:27:38 -05:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 17:04:11 +09:00
|
|
|
|
2005-08-09 20:08:28 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-09-12 12:01:34 +02:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-06-17 11:58:39 +00:00
|
|
|
|
2012-04-11 23:05:28 +00:00
|
|
|
|
2012-06-27 00:23:44 +00:00
|
|
|
|
2013-07-10 17:13:17 +03:00
|
|
|
|
2006-11-27 11:10:57 -08:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2010-11-09 23:24:26 +00:00
|
|
|
|
2007-12-31 00:29:24 -08:00
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
|
|
|
|
|
2007-12-31 00:29:24 -08:00
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
|
|
|
|
|
2007-12-31 00:29:24 -08:00
|
|
|
|
|
|
|
|
|
2010-11-09 23:24:26 +00:00
|
|
|
|
2007-12-31 00:29:24 -08:00
|
|
|
|
|
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
|
|
|
|
|
2009-01-26 21:35:35 -08:00
|
|
|
|
2008-10-09 14:51:27 -07:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2009-01-26 21:35:35 -08:00
|
|
|
|
2008-10-09 14:51:27 -07:00
|
|
|
|
|
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
|
|
|
|
|
2006-08-26 20:06:05 -07:00
|
|
|
|
2008-10-09 14:51:27 -07:00
|
|
|
|
2008-11-16 19:39:21 -08:00
|
|
|
|
2013-01-22 09:50:32 +00:00
|
|
|
|
2006-08-26 20:06:05 -07:00
|
|
|
|
2014-11-11 21:59:20 -08:00
|
|
|
|
2009-11-23 10:41:23 -08:00
|
|
|
|
|
|
|
|
|
2009-11-08 10:17:30 +00:00
|
|
|
|
2009-11-23 10:41:23 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-01-22 09:50:32 +00:00
|
|
|
|
2014-11-11 21:59:20 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-01-26 21:35:35 -08:00
|
|
|
|
2014-11-11 21:59:20 -08:00
|
|
|
|
2009-01-26 21:35:35 -08:00
|
|
|
|
2014-11-11 21:59:20 -08:00
|
|
|
|
2006-08-26 20:06:05 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-11-09 05:26:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-11 21:59:20 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-11-09 05:26:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-01-22 09:50:32 +00:00
|
|
|
|
2009-11-09 05:26:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-11 21:59:20 -08:00
|
|
|
|
2009-11-23 10:41:23 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-01-22 09:50:32 +00:00
|
|
|
|
2014-11-11 21:59:20 -08:00
|
|
|
|
|
|
|
|
|
2009-11-09 05:26:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-11 21:59:20 -08:00
|
|
|
|
2009-11-09 05:26:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2006-08-26 20:06:05 -07:00
|
|
|
|
2008-03-22 16:51:21 -07:00
|
|
|
|
2006-08-26 20:06:05 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-06-05 15:18:43 -07:00
|
|
|
|
2011-03-30 22:57:33 -03:00
|
|
|
|
2009-11-09 05:26:33 +00:00
|
|
|
|
2006-08-26 20:06:05 -07:00
|
|
|
|
2008-03-22 16:51:21 -07:00
|
|
|
|
2014-11-11 21:59:20 -08:00
|
|
|
|
|
|
|
|
|
2009-11-09 05:26:33 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2009-11-08 10:17:58 +00:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2006-08-26 20:06:05 -07:00
|
|
|
|
2008-03-26 02:26:21 +09:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2007-08-24 23:09:41 -07:00
|
|
|
|
2008-10-08 11:44:17 -07:00
|
|
|
|
2012-04-15 05:58:06 +00:00
|
|
|
|
2009-01-26 21:35:35 -08:00
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2013-09-28 14:10:59 -07:00
|
|
|
|
2007-10-18 22:00:17 -07:00
|
|
|
|
2007-10-10 17:30:46 -07:00
|
|
|
|
2014-01-11 07:15:59 -05:00
|
|
|
|
2014-08-23 20:58:54 +02:00
|
|
|
|
2009-01-26 21:35:35 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
2009-12-13 19:32:39 -08:00
|
|
|
|
|
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
2009-01-26 21:35:35 -08:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2009-01-26 21:35:35 -08:00
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
2009-01-26 21:35:35 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-08 11:44:17 -07:00
|
|
|
|
2009-01-26 21:35:35 -08:00
|
|
|
|
2010-05-05 00:27:06 +00:00
|
|
|
|
2014-05-12 16:04:53 -07:00
|
|
|
|
2009-01-26 21:35:35 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-12-13 19:32:39 -08:00
|
|
|
|
2009-01-26 21:35:35 -08:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2009-11-09 05:26:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
|
|
|
|
|
2009-01-26 21:35:35 -08:00
|
|
|
|
2009-10-15 06:30:45 +00:00
|
|
|
|
2009-11-08 10:17:30 +00:00
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2008-11-16 19:39:21 -08:00
|
|
|
|
2009-11-08 10:17:05 +00:00
|
|
|
|
2008-03-31 19:41:46 -07:00
|
|
|
|
2009-11-08 10:17:58 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2006-08-26 20:06:05 -07:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2006-08-26 20:06:05 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2009-04-09 17:37:33 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2009-10-15 06:30:45 +00:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2015-03-18 14:05:33 -07:00
|
|
|
|
|
|
|
|
|
2009-11-08 10:17:30 +00:00
|
|
|
|
2010-04-20 19:06:52 -07:00
|
|
|
|
2009-11-08 10:17:30 +00:00
|
|
|
|
|
|
|
|
|
2008-03-22 16:51:21 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2009-11-09 05:26:33 +00:00
|
|
|
|
2010-04-20 19:06:52 -07:00
|
|
|
|
2009-11-09 05:26:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-11-08 10:17:30 +00:00
|
|
|
|
2009-11-09 05:26:33 +00:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2014-12-01 20:29:06 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2014-12-01 20:29:06 -08:00
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2014-12-01 20:29:06 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2014-12-01 20:29:06 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2014-12-01 20:29:06 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-10-08 19:33:21 -07:00
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-12-01 20:29:06 -08:00
|
|
|
|
|
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
2014-12-01 20:29:06 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
2014-12-01 20:29:06 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
2014-12-01 20:29:06 -08:00
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
2014-12-01 20:29:06 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-10-08 19:33:21 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-03-18 14:05:33 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-10-19 21:48:51 +02:00
|
|
|
|
2013-10-19 21:48:57 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-10-19 21:48:51 +02:00
|
|
|
|
2013-10-19 21:48:57 +02:00
|
|
|
|
2013-10-19 21:48:51 +02:00
|
|
|
|
|
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-01-22 09:50:32 +00:00
|
|
|
|
|
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-01-22 09:50:32 +00:00
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-01-22 09:50:32 +00:00
|
|
|
|
|
|
|
|
|
2013-10-19 21:48:51 +02:00
|
|
|
|
|
|
|
|
|
2013-01-22 09:50:32 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-08-23 20:58:54 +02:00
|
|
|
|
2013-01-22 09:50:32 +00:00
|
|
|
|
|
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-11-15 19:58:26 +00:00
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-12-09 06:23:34 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 02:11:14 -07:00
|
|
|
|
2008-11-16 19:39:21 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
|
|
|
|
|
2013-01-22 09:50:32 +00:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 02:11:14 -07:00
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-04-20 19:06:52 -07:00
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-04-08 04:56:48 +00:00
|
|
|
|
2010-04-20 19:06:52 -07:00
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 02:11:14 -07:00
|
|
|
|
|
|
|
|
|
2013-01-22 09:50:32 +00:00
|
|
|
|
2008-11-16 19:39:21 -08:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-01-22 09:50:32 +00:00
|
|
|
|
|
|
|
|
|
2013-10-19 21:48:51 +02:00
|
|
|
|
|
|
|
|
|
2013-01-22 09:50:32 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-08-23 20:58:54 +02:00
|
|
|
|
2013-01-22 09:50:32 +00:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2008-11-16 19:39:21 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ipv4: udp: optimize unicast RX path
We first locate the (local port) hash chain head
If few sockets are in this chain, we proceed with previous lookup algo.
If too many sockets are listed, we take a look at the secondary
(port, address) hash chain we added in previous patch.
We choose the shortest chain and proceed with a RCU lookup on the elected chain.
But, if we chose (port, address) chain, and fail to find a socket on given address,
we must try another lookup on (port, INADDR_ANY) chain to find socket not bound
to a particular IP.
-> No extra cost for typical setups, where the first lookup will probabbly
be performed.
RCU lookups everywhere, we dont acquire spinlock.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-11-08 10:18:11 +00:00
|
|
|
|
2008-11-16 19:39:21 -08:00
|
|
|
|
|
|
|
|
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 02:11:14 -07:00
|
|
|
|
2010-11-15 19:58:26 +00:00
|
|
|
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 02:11:14 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2011-12-09 06:23:34 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2008-10-07 12:38:32 -07:00
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2008-10-07 12:38:32 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-12-10 18:07:23 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-07 12:38:32 -07:00
|
|
|
|
|
|
|
|
|
2008-10-01 07:48:10 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2008-10-01 07:48:10 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2011-04-22 04:53:02 +00:00
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-07-14 23:01:40 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2008-07-14 23:01:40 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2015-04-03 09:17:26 +01:00
|
|
|
|
2008-07-14 23:03:00 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-06-14 22:21:46 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-07-11 21:27:49 -07:00
|
|
|
|
|
|
|
|
|
2013-09-20 18:20:28 +08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-05-31 23:44:05 -07:00
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2010-05-31 23:44:05 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-06-04 15:49:07 +04:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-06-04 15:49:07 +04:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2013-07-25 18:12:18 +02:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2014-06-02 16:12:02 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2014-06-02 16:12:02 -07:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-06-02 16:12:02 -07:00
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
|
|
|
|
|
2014-06-02 16:12:02 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-07-25 18:12:18 +02:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2014-06-04 17:19:48 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-05-09 13:31:04 -07:00
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-05-09 13:31:04 -07:00
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-05-23 08:47:19 -07:00
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-05-09 13:31:04 -07:00
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-05-09 13:31:04 -07:00
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-08-10 02:22:47 +00:00
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-07-01 20:21:30 +02:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-03-12 02:09:18 -05:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-05-08 17:12:19 -07:00
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2011-05-09 13:31:04 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-07-01 20:21:30 +02:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2015-03-02 15:37:48 +08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-05-08 16:38:45 -07:00
|
|
|
|
2011-03-12 02:09:18 -05:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
2011-04-21 09:45:37 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-08-17 08:59:14 +00:00
|
|
|
|
2013-09-24 15:43:09 +02:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
|
|
|
|
|
2011-05-08 17:24:10 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-01-17 22:53:15 +01:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-10-15 06:30:45 +00:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-10-15 06:30:45 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2013-04-14 08:08:13 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2014-02-18 21:38:08 +01:00
|
|
|
|
|
|
|
|
|
2016-02-04 06:23:28 -08:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2016-02-04 06:23:28 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-04-21 09:45:37 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-04-21 09:45:37 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2011-04-21 09:45:37 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2013-09-24 15:43:09 +02:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2011-04-21 09:45:37 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-02-08 09:11:07 +00:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2015-04-03 09:17:26 +01:00
|
|
|
|
2008-07-16 20:19:08 -07:00
|
|
|
|
2015-08-13 14:59:03 -06:00
|
|
|
|
2008-07-16 20:19:08 -07:00
|
|
|
|
2011-05-08 16:38:45 -07:00
|
|
|
|
2015-08-13 14:59:03 -06:00
|
|
|
|
2011-05-08 16:38:45 -07:00
|
|
|
|
2011-03-31 04:54:27 -07:00
|
|
|
|
2015-08-13 14:59:03 -06:00
|
|
|
|
2011-03-31 04:54:27 -07:00
|
|
|
|
|
|
|
|
|
2016-01-04 09:09:27 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-10-05 08:51:26 -07:00
|
|
|
|
2011-05-08 16:38:45 -07:00
|
|
|
|
|
|
|
|
|
2011-03-02 14:31:35 -08:00
|
|
|
|
|
|
|
|
|
2011-03-03 10:38:01 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2013-11-28 09:51:22 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-06-10 23:31:35 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-05-08 16:38:45 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2011-05-08 16:38:45 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
|
|
|
|
|
2014-11-24 13:23:40 -05:00
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-01-22 06:32:49 +00:00
|
|
|
|
2011-05-09 13:31:04 -07:00
|
|
|
|
2011-03-01 02:36:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-11 10:59:17 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-03-12 02:09:18 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-03-12 03:00:33 -05:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-24 13:23:40 -05:00
|
|
|
|
2011-05-08 17:24:10 -07:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-07-05 21:18:07 -07:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-06-10 23:31:35 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-05-08 17:24:10 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-11-24 22:36:28 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-03-02 15:37:48 +08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-11 10:59:17 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-05-08 17:24:10 -07:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-10-09 04:43:40 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-04-29 08:39:56 +00:00
|
|
|
|
|
|
|
|
|
2009-10-09 04:43:40 +00:00
|
|
|
|
|
|
|
|
|
2009-10-15 00:12:40 +00:00
|
|
|
|
2009-10-09 04:43:40 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-05-26 19:20:18 +00:00
|
|
|
|
|
|
|
|
|
2009-10-09 04:43:40 +00:00
|
|
|
|
|
|
|
|
|
2010-05-26 19:20:18 +00:00
|
|
|
|
2009-10-09 04:43:40 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-02-09 23:24:47 +09:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
2007-03-08 20:41:55 -08:00
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2009-06-17 19:05:41 -07:00
|
|
|
|
|
|
|
|
|
2007-03-08 20:41:55 -08:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2007-03-08 20:41:55 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-10-09 04:43:40 +00:00
|
|
|
|
2007-03-08 20:41:55 -08:00
|
|
|
|
2009-10-09 04:43:40 +00:00
|
|
|
|
2007-03-08 20:41:55 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-10-09 04:43:40 +00:00
|
|
|
|
|
|
|
|
|
2007-03-08 20:41:55 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-03-02 15:37:48 +08:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2014-01-17 22:53:15 +01:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2011-12-01 14:12:55 -05:00
|
|
|
|
2012-02-21 07:30:58 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2010-05-26 19:20:18 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2013-11-23 00:46:12 +01:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-02-21 07:30:58 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-12-01 14:12:55 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-12-01 14:12:55 -05:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-05 16:46:40 -05:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2014-04-06 18:47:38 -04:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-06-27 00:23:44 +00:00
|
|
|
|
|
|
|
|
|
2012-09-05 23:34:44 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2012-06-27 00:23:44 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2008-07-05 21:18:07 -07:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
net: Generalize socket rx gap / receive queue overflow cmsg
Create a new socket level option to report number of queue overflows
Recently I augmented the AF_PACKET protocol to report the number of frames lost
on the socket receive queue between any two enqueued frames. This value was
exported via a SOL_PACKET level cmsg. AFter I completed that work it was
requested that this feature be generalized so that any datagram oriented socket
could make use of this option. As such I've created this patch, It creates a
new SOL_SOCKET level option called SO_RXQ_OVFL, which when enabled exports a
SOL_SOCKET level cmsg that reports the nubmer of times the sk_receive_queue
overflowed between any two given frames. It also augments the AF_PACKET
protocol to take advantage of this new feature (as it previously did not touch
sk->sk_drops, which this patch uses to record the overflow count). Tested
successfully by me.
Notes:
1) Unlike my previous patch, this patch simply records the sk_drops value, which
is not a number of drops between packets, but rather a total number of drops.
Deltas must be computed in user space.
2) While this patch currently works with datagram oriented protocols, it will
also be accepted by non-datagram oriented protocols. I'm not sure if thats
agreeable to everyone, but my argument in favor of doing so is that, for those
protocols which aren't applicable to this option, sk_drops will always be zero,
and reporting no drops on a receive queue that isn't used for those
non-participating protocols seems reasonable to me. This also saves us having
to code in a per-protocol opt in mechanism.
3) This applies cleanly to net-next assuming that commit
977750076d98c7ff6cbda51858bb5a5894a9d9ab (my af packet cmsg patch) is reverted
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-10-12 13:26:31 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-11-18 04:20:45 +01:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2015-01-05 13:56:17 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2011-12-01 14:12:55 -05:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-10-30 05:03:53 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-05-26 19:20:18 +00:00
|
|
|
|
2013-04-29 08:39:56 +00:00
|
|
|
|
|
|
|
|
|
2008-07-05 21:18:07 -07:00
|
|
|
|
2013-04-29 08:39:56 +00:00
|
|
|
|
2010-05-26 19:20:18 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2015-05-30 09:16:53 -07:00
|
|
|
|
|
|
|
|
|
2011-06-21 10:43:40 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-02-09 23:24:47 +09:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2009-10-15 06:30:45 +00:00
|
|
|
|
|
|
|
|
|
2011-08-14 19:45:55 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-10-15 06:30:45 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
|
|
|
|
|
2008-11-25 13:55:15 -08:00
|
|
|
|
|
|
|
|
|
2009-11-08 10:17:58 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2008-11-25 13:55:15 -08:00
|
|
|
|
|
|
|
|
|
2009-11-08 10:17:05 +00:00
|
|
|
|
2009-10-15 06:30:45 +00:00
|
|
|
|
2008-11-25 13:55:15 -08:00
|
|
|
|
2009-11-08 10:17:58 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-11-25 13:55:15 -08:00
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
udp: add rehash on connect()
commit 30fff923 introduced in linux-2.6.33 (udp: bind() optimisation)
added a secondary hash on UDP, hashed on (local addr, local port).
Problem is that following sequence :
fd = socket(...)
connect(fd, &remote, ...)
not only selects remote end point (address and port), but also sets
local address, while UDP stack stored in secondary hash table the socket
while its local address was INADDR_ANY (or ipv6 equivalent)
Sequence is :
- autobind() : choose a random local port, insert socket in hash tables
[while local address is INADDR_ANY]
- connect() : set remote address and port, change local address to IP
given by a route lookup.
When an incoming UDP frame comes, if more than 10 sockets are found in
primary hash table, we switch to secondary table, and fail to find
socket because its local address changed.
One solution to this problem is to rehash datagram socket if needed.
We add a new rehash(struct socket *) method in "struct proto", and
implement this method for UDP v4 & v6, using a common helper.
This rehashing only takes care of secondary hash table, since primary
hash (based on local port only) is not changed.
Reported-by: Krzysztof Piotr Oledzki <ole@ans.pl>
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Tested-by: Krzysztof Piotr Oledzki <ole@ans.pl>
Signed-off-by: David S. Miller <davem@davemloft.net>
2010-09-08 05:08:44 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-09-15 11:48:46 -07:00
|
|
|
|
|
|
|
|
|
rfs: Receive Flow Steering
This patch implements receive flow steering (RFS). RFS steers
received packets for layer 3 and 4 processing to the CPU where
the application for the corresponding flow is running. RFS is an
extension of Receive Packet Steering (RPS).
The basic idea of RFS is that when an application calls recvmsg
(or sendmsg) the application's running CPU is stored in a hash
table that is indexed by the connection's rxhash which is stored in
the socket structure. The rxhash is passed in skb's received on
the connection from netif_receive_skb. For each received packet,
the associated rxhash is used to look up the CPU in the hash table,
if a valid CPU is set then the packet is steered to that CPU using
the RPS mechanisms.
The convolution of the simple approach is that it would potentially
allow OOO packets. If threads are thrashing around CPUs or multiple
threads are trying to read from the same sockets, a quickly changing
CPU value in the hash table could cause rampant OOO packets--
we consider this a non-starter.
To avoid OOO packets, this solution implements two types of hash
tables: rps_sock_flow_table and rps_dev_flow_table.
rps_sock_table is a global hash table. Each entry is just a CPU
number and it is populated in recvmsg and sendmsg as described above.
This table contains the "desired" CPUs for flows.
rps_dev_flow_table is specific to each device queue. Each entry
contains a CPU and a tail queue counter. The CPU is the "current"
CPU for a matching flow. The tail queue counter holds the value
of a tail queue counter for the associated CPU's backlog queue at
the time of last enqueue for a flow matching the entry.
Each backlog queue has a queue head counter which is incremented
on dequeue, and so a queue tail counter is computed as queue head
count + queue length. When a packet is enqueued on a backlog queue,
the current value of the queue tail counter is saved in the hash
entry of the rps_dev_flow_table.
And now the trick: when selecting the CPU for RPS (get_rps_cpu)
the rps_sock_flow table and the rps_dev_flow table for the RX queue
are consulted. When the desired CPU for the flow (found in the
rps_sock_flow table) does not match the current CPU (found in the
rps_dev_flow table), the current CPU is changed to the desired CPU
if one of the following is true:
- The current CPU is unset (equal to RPS_NO_CPU)
- Current CPU is offline
- The current CPU's queue head counter >= queue tail counter in the
rps_dev_flow table. This checks if the queue tail has advanced
beyond the last packet that was enqueued using this table entry.
This guarantees that all packets queued using this entry have been
dequeued, thus preserving in order delivery.
Making each queue have its own rps_dev_flow table has two advantages:
1) the tail queue counters will be written on each receive, so
keeping the table local to interrupting CPU s good for locality. 2)
this allows lockless access to the table-- the CPU number and queue
tail counter need to be accessed together under mutual exclusion
from netif_receive_skb, we assume that this is only called from
device napi_poll which is non-reentrant.
This patch implements RFS for TCP and connected UDP sockets.
It should be usable for other flow oriented protocols.
There are two configuration parameters for RFS. The
"rps_flow_entries" kernel init parameter sets the number of
entries in the rps_sock_flow_table, the per rxqueue sysfs entry
"rps_flow_cnt" contains the number of entries in the rps_dev_flow
table for the rxqueue. Both are rounded to power of two.
The obvious benefit of RFS (over just RPS) is that it achieves
CPU locality between the receive processing for a flow and the
applications processing; this can result in increased performance
(higher pps, lower latency).
The benefits of RFS are dependent on cache hierarchy, application
load, and other factors. On simple benchmarks, we don't necessarily
see improvement and sometimes see degradation. However, for more
complex benchmarks and for applications where cache pressure is
much higher this technique seems to perform very well.
Below are some benchmark results which show the potential benfit of
this patch. The netperf test has 500 instances of netperf TCP_RR
test with 1 byte req. and resp. The RPC test is an request/response
test similar in structure to netperf RR test ith 100 threads on
each host, but does more work in userspace that netperf.
e1000e on 8 core Intel
No RFS or RPS 104K tps at 30% CPU
No RFS (best RPS config): 290K tps at 63% CPU
RFS 303K tps at 61% CPU
RPC test tps CPU% 50/90/99% usec latency Latency StdDev
No RFS/RPS 103K 48% 757/900/3185 4472.35
RPS only: 174K 73% 415/993/2468 491.66
RFS 223K 73% 379/651/1382 315.61
Signed-off-by: Tom Herbert <therbert@google.com>
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2010-04-16 16:01:27 -07:00
|
|
|
|
2009-10-14 20:40:11 -07:00
|
|
|
|
2013-10-07 11:01:38 -05:00
|
|
|
|
2011-08-14 19:45:55 +00:00
|
|
|
|
2013-10-07 11:01:38 -05:00
|
|
|
|
net: introduce SO_INCOMING_CPU
Alternative to RPS/RFS is to use hardware support for multiple
queues.
Then split a set of million of sockets into worker threads, each
one using epoll() to manage events on its own socket pool.
Ideally, we want one thread per RX/TX queue/cpu, but we have no way to
know after accept() or connect() on which queue/cpu a socket is managed.
We normally use one cpu per RX queue (IRQ smp_affinity being properly
set), so remembering on socket structure which cpu delivered last packet
is enough to solve the problem.
After accept(), connect(), or even file descriptor passing around
processes, applications can use :
int cpu;
socklen_t len = sizeof(cpu);
getsockopt(fd, SOL_SOCKET, SO_INCOMING_CPU, &cpu, &len);
And use this information to put the socket into the right silo
for optimal performance, as all networking stack should run
on the appropriate cpu, without need to send IPI (RPS/RFS).
Signed-off-by: Eric Dumazet <edumazet@google.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2014-11-11 05:54:28 -08:00
|
|
|
|
2013-10-07 11:01:38 -05:00
|
|
|
|
rfs: Receive Flow Steering
This patch implements receive flow steering (RFS). RFS steers
received packets for layer 3 and 4 processing to the CPU where
the application for the corresponding flow is running. RFS is an
extension of Receive Packet Steering (RPS).
The basic idea of RFS is that when an application calls recvmsg
(or sendmsg) the application's running CPU is stored in a hash
table that is indexed by the connection's rxhash which is stored in
the socket structure. The rxhash is passed in skb's received on
the connection from netif_receive_skb. For each received packet,
the associated rxhash is used to look up the CPU in the hash table,
if a valid CPU is set then the packet is steered to that CPU using
the RPS mechanisms.
The convolution of the simple approach is that it would potentially
allow OOO packets. If threads are thrashing around CPUs or multiple
threads are trying to read from the same sockets, a quickly changing
CPU value in the hash table could cause rampant OOO packets--
we consider this a non-starter.
To avoid OOO packets, this solution implements two types of hash
tables: rps_sock_flow_table and rps_dev_flow_table.
rps_sock_table is a global hash table. Each entry is just a CPU
number and it is populated in recvmsg and sendmsg as described above.
This table contains the "desired" CPUs for flows.
rps_dev_flow_table is specific to each device queue. Each entry
contains a CPU and a tail queue counter. The CPU is the "current"
CPU for a matching flow. The tail queue counter holds the value
of a tail queue counter for the associated CPU's backlog queue at
the time of last enqueue for a flow matching the entry.
Each backlog queue has a queue head counter which is incremented
on dequeue, and so a queue tail counter is computed as queue head
count + queue length. When a packet is enqueued on a backlog queue,
the current value of the queue tail counter is saved in the hash
entry of the rps_dev_flow_table.
And now the trick: when selecting the CPU for RPS (get_rps_cpu)
the rps_sock_flow table and the rps_dev_flow table for the RX queue
are consulted. When the desired CPU for the flow (found in the
rps_sock_flow table) does not match the current CPU (found in the
rps_dev_flow table), the current CPU is changed to the desired CPU
if one of the following is true:
- The current CPU is unset (equal to RPS_NO_CPU)
- Current CPU is offline
- The current CPU's queue head counter >= queue tail counter in the
rps_dev_flow table. This checks if the queue tail has advanced
beyond the last packet that was enqueued using this table entry.
This guarantees that all packets queued using this entry have been
dequeued, thus preserving in order delivery.
Making each queue have its own rps_dev_flow table has two advantages:
1) the tail queue counters will be written on each receive, so
keeping the table local to interrupting CPU s good for locality. 2)
this allows lockless access to the table-- the CPU number and queue
tail counter need to be accessed together under mutual exclusion
from netif_receive_skb, we assume that this is only called from
device napi_poll which is non-reentrant.
This patch implements RFS for TCP and connected UDP sockets.
It should be usable for other flow oriented protocols.
There are two configuration parameters for RFS. The
"rps_flow_entries" kernel init parameter sets the number of
entries in the rps_sock_flow_table, the per rxqueue sysfs entry
"rps_flow_cnt" contains the number of entries in the rps_dev_flow
table for the rxqueue. Both are rounded to power of two.
The obvious benefit of RFS (over just RPS) is that it achieves
CPU locality between the receive processing for a flow and the
applications processing; this can result in increased performance
(higher pps, lower latency).
The benefits of RFS are dependent on cache hierarchy, application
load, and other factors. On simple benchmarks, we don't necessarily
see improvement and sometimes see degradation. However, for more
complex benchmarks and for applications where cache pressure is
much higher this technique seems to perform very well.
Below are some benchmark results which show the potential benfit of
this patch. The netperf test has 500 instances of netperf TCP_RR
test with 1 byte req. and resp. The RPC test is an request/response
test similar in structure to netperf RR test ith 100 threads on
each host, but does more work in userspace that netperf.
e1000e on 8 core Intel
No RFS or RPS 104K tps at 30% CPU
No RFS (best RPS config): 290K tps at 63% CPU
RFS 303K tps at 61% CPU
RPC test tps CPU% 50/90/99% usec latency Latency StdDev
No RFS/RPS 103K 48% 757/900/3185 4472.35
RPS only: 174K 73% 415/993/2468 491.66
RFS 223K 73% 379/651/1382 315.61
Signed-off-by: Tom Herbert <therbert@google.com>
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2010-04-16 16:01:27 -07:00
|
|
|
|
ipv4: PKTINFO doesnt need dst reference
Le lundi 07 novembre 2011 à 15:33 +0100, Eric Dumazet a écrit :
> At least, in recent kernels we dont change dst->refcnt in forwarding
> patch (usinf NOREF skb->dst)
>
> One particular point is the atomic_inc(dst->refcnt) we have to perform
> when queuing an UDP packet if socket asked PKTINFO stuff (for example a
> typical DNS server has to setup this option)
>
> I have one patch somewhere that stores the information in skb->cb[] and
> avoid the atomic_{inc|dec}(dst->refcnt).
>
OK I found it, I did some extra tests and believe its ready.
[PATCH net-next] ipv4: IP_PKTINFO doesnt need dst reference
When a socket uses IP_PKTINFO notifications, we currently force a dst
reference for each received skb. Reader has to access dst to get needed
information (rt_iif & rt_spec_dst) and must release dst reference.
We also forced a dst reference if skb was put in socket backlog, even
without IP_PKTINFO handling. This happens under stress/load.
We can instead store the needed information in skb->cb[], so that only
softirq handler really access dst, improving cache hit ratios.
This removes two atomic operations per packet, and false sharing as
well.
On a benchmark using a mono threaded receiver (doing only recvmsg()
calls), I can reach 720.000 pps instead of 570.000 pps.
IP_PKTINFO is typically used by DNS servers, and any multihomed aware
UDP application.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-11-09 07:24:35 +00:00
|
|
|
|
2009-10-14 20:40:11 -07:00
|
|
|
|
|
|
|
|
|
2008-09-15 11:48:46 -07:00
|
|
|
|
|
|
|
|
|
2009-10-14 20:40:11 -07:00
|
|
|
|
2008-09-15 11:48:46 -07:00
|
|
|
|
|
|
|
|
|
2009-10-14 20:40:11 -07:00
|
|
|
|
|
|
|
|
|
2011-06-17 11:58:39 +00:00
|
|
|
|
2009-10-14 20:40:11 -07:00
|
|
|
|
2008-09-15 11:48:46 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-04-11 23:05:28 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-04-11 23:05:28 +00:00
|
|
|
|
2011-11-01 12:56:59 +00:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-11-01 12:56:59 +00:00
|
|
|
|
2015-04-03 09:17:27 +01:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2014-05-07 16:52:39 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-11-01 12:56:59 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2008-07-05 21:18:48 -07:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-11 10:59:17 -08:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-11 10:59:17 -08:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-08-11 19:30:52 +00:00
|
|
|
|
|
|
|
|
|
2013-04-29 08:39:56 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2014-07-22 21:16:51 +03:00
|
|
|
|
2014-06-25 17:38:13 -04:00
|
|
|
|
|
|
|
|
|
2010-04-27 15:13:20 -07:00
|
|
|
|
2014-06-25 17:38:13 -04:00
|
|
|
|
2010-04-27 15:13:20 -07:00
|
|
|
|
2008-09-15 11:48:46 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2013-10-07 11:01:40 -05:00
|
|
|
|
2008-09-15 11:48:46 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-04-22 23:34:26 +00:00
|
|
|
|
2010-03-04 18:01:42 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-09-15 11:48:46 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2013-04-29 08:39:56 +00:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2008-07-05 21:18:48 -07:00
|
|
|
|
2009-10-15 00:12:40 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-11-08 10:18:44 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-11-08 10:20:19 +00:00
|
|
|
|
2009-11-08 10:18:44 +00:00
|
|
|
|
|
|
|
|
|
2009-11-08 10:20:19 +00:00
|
|
|
|
2015-04-03 09:17:26 +01:00
|
|
|
|
2009-11-08 10:18:44 +00:00
|
|
|
|
|
|
|
|
|
2009-11-08 10:20:19 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-11-08 10:18:44 +00:00
|
|
|
|
2014-07-15 23:28:32 -04:00
|
|
|
|
|
|
|
|
|
2009-11-08 10:18:44 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-12-11 14:46:51 -08:00
|
|
|
|
2013-12-15 10:53:46 -08:00
|
|
|
|
2013-12-11 14:46:51 -08:00
|
|
|
|
|
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
2013-12-11 14:46:51 -08:00
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
2013-12-15 10:53:46 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-11-08 10:18:44 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2008-06-16 17:12:11 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2014-11-06 10:37:54 -08:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2009-11-08 10:18:44 +00:00
|
|
|
|
2014-07-15 23:28:31 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-07-15 23:28:32 -04:00
|
|
|
|
|
|
|
|
|
2014-11-06 10:37:54 -08:00
|
|
|
|
2014-07-15 23:28:32 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2014-07-15 23:28:32 -04:00
|
|
|
|
2014-07-15 23:28:31 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-06 10:37:54 -08:00
|
|
|
|
2014-07-15 23:28:31 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-07-15 23:28:32 -04:00
|
|
|
|
2009-11-08 10:18:44 +00:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2009-11-08 10:18:44 +00:00
|
|
|
|
2014-07-15 23:28:32 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-11-08 10:18:44 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-06 10:37:54 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-11-08 10:18:44 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-05-02 16:29:38 -07:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-02-05 15:05:45 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2009-06-02 05:19:30 +00:00
|
|
|
|
2009-02-06 01:59:12 -08:00
|
|
|
|
2008-07-05 21:18:48 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-02-05 15:05:45 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2010-05-06 03:44:34 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-12-10 18:07:23 -08:00
|
|
|
|
|
|
|
|
|
2013-12-11 14:46:51 -08:00
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2013-12-11 14:46:51 -08:00
|
|
|
|
|
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
2013-12-10 18:07:23 -08:00
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2014-11-04 20:48:41 +01:00
|
|
|
|
|
|
|
|
|
2014-11-06 10:37:54 -08:00
|
|
|
|
2014-11-04 20:48:41 +01:00
|
|
|
|
|
|
|
|
|
2015-04-03 09:17:27 +01:00
|
|
|
|
2013-06-10 11:40:00 +03:00
|
|
|
|
|
|
|
|
|
2015-01-05 13:56:14 -08:00
|
|
|
|
2014-08-31 15:12:43 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-06-10 11:40:00 +03:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-07-05 21:18:48 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-11 10:59:17 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-11 10:59:17 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-04-29 08:39:56 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2008-07-05 21:18:48 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-06-12 16:13:06 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-10-08 21:47:29 -07:00
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-05-13 20:30:07 -07:00
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-12-11 08:10:05 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-06-03 16:27:38 -05:00
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-12-11 08:10:05 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
2015-06-03 16:27:38 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-03-22 09:19:38 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
2015-06-03 16:27:38 -05:00
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
2015-06-03 16:27:38 -05:00
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
2015-06-03 16:27:38 -05:00
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-09-04 13:32:11 -04:00
|
|
|
|
2015-08-01 12:14:33 +02:00
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-08-01 12:14:33 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-10-07 11:01:39 -05:00
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2008-06-14 17:04:49 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2013-03-19 06:11:12 +00:00
|
|
|
|
2010-05-26 19:20:18 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2010-05-26 19:20:18 +00:00
|
|
|
|
2013-03-19 06:11:12 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2006-11-27 09:29:59 -08:00
|
|
|
|
2009-09-30 16:12:20 -07:00
|
|
|
|
2006-11-27 09:29:59 -08:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
2014-05-23 08:47:32 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2007-12-03 22:34:16 +11:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-05-23 08:47:32 -07:00
|
|
|
|
|
|
|
|
|
2007-03-08 20:41:55 -08:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-11-11 21:59:20 -08:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-02-09 23:24:47 +09:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-07-05 17:08:05 -07:00
|
|
|
|
|
|
|
|
|
2007-06-27 15:37:46 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2012-04-11 23:05:28 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-05-23 08:47:32 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2006-11-27 11:10:57 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-12-03 22:34:16 +11:00
|
|
|
|
2006-11-27 11:10:57 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-05-24 14:33:03 -07:00
|
|
|
|
|
|
|
|
|
2006-11-27 11:10:57 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-02-09 23:24:47 +09:00
|
|
|
|
|
|
|
|
|
2006-11-27 11:10:57 -08:00
|
|
|
|
|
|
|
|
|
2007-12-03 22:34:16 +11:00
|
|
|
|
2006-11-27 11:10:57 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-05-24 14:33:03 -07:00
|
|
|
|
|
|
|
|
|
2006-11-27 11:10:57 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-03-08 20:41:55 -08:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2009-09-30 16:12:20 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-09-30 16:12:20 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2006-11-27 09:29:59 -08:00
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-02-09 23:24:47 +09:00
|
|
|
|
2007-03-08 20:41:55 -08:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
2007-03-08 20:41:55 -08:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-05-23 08:47:32 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2006-11-27 11:10:57 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
2007-03-08 20:41:55 -08:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2007-03-08 20:41:55 -08:00
|
|
|
|
2007-02-09 23:24:47 +09:00
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2007-02-09 23:24:47 +09:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-02-09 23:24:47 +09:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2006-11-27 11:10:57 -08:00
|
|
|
|
2013-05-31 13:15:38 +00:00
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2009-10-09 04:43:40 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
2007-02-09 23:24:47 +09:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-09-15 11:48:46 -07:00
|
|
|
|
2013-01-21 02:00:03 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
udp: add rehash on connect()
commit 30fff923 introduced in linux-2.6.33 (udp: bind() optimisation)
added a secondary hash on UDP, hashed on (local addr, local port).
Problem is that following sequence :
fd = socket(...)
connect(fd, &remote, ...)
not only selects remote end point (address and port), but also sets
local address, while UDP stack stored in secondary hash table the socket
while its local address was INADDR_ANY (or ipv6 equivalent)
Sequence is :
- autobind() : choose a random local port, insert socket in hash tables
[while local address is INADDR_ANY]
- connect() : set remote address and port, change local address to IP
given by a route lookup.
When an incoming UDP frame comes, if more than 10 sockets are found in
primary hash table, we switch to secondary table, and fail to find
socket because its local address changed.
One solution to this problem is to rehash datagram socket if needed.
We add a new rehash(struct socket *) method in "struct proto", and
implement this method for UDP v4 & v6, using a common helper.
This rehashing only takes care of secondary hash table, since primary
hash (based on local port only) is not changed.
Reported-by: Krzysztof Piotr Oledzki <ole@ans.pl>
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Tested-by: Krzysztof Piotr Oledzki <ole@ans.pl>
Signed-off-by: David S. Miller <davem@davemloft.net>
2010-09-08 05:08:44 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 02:11:14 -07:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-12-16 14:26:56 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-28 18:23:33 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
|
|
|
|
|
2008-11-16 19:39:21 -08:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2008-11-16 19:39:21 -08:00
|
|
|
|
2008-03-26 03:57:35 +09:00
|
|
|
|
2008-03-21 04:11:58 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-28 18:23:33 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
2008-11-16 19:39:21 -08:00
|
|
|
|
2008-03-26 03:57:35 +09:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
2009-03-23 15:22:33 -07:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
2007-03-08 20:41:55 -08:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-03-23 15:22:33 -07:00
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
2009-03-23 15:22:33 -07:00
|
|
|
|
2008-03-31 19:38:15 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-31 19:38:15 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
|
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
2011-10-30 06:46:30 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2013-03-31 18:16:14 -04:00
|
|
|
|
2008-03-28 18:25:06 -07:00
|
|
|
|
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2008-03-28 18:25:06 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-21 04:11:58 -07:00
|
|
|
|
2008-03-28 18:25:06 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2008-03-28 18:25:06 -07:00
|
|
|
|
2008-03-21 04:11:58 -07:00
|
|
|
|
2011-10-30 06:46:30 +00:00
|
|
|
|
2008-03-21 04:11:58 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2008-03-21 04:14:17 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-28 18:24:26 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-05-02 04:10:08 -07:00
|
|
|
|
2011-10-30 06:46:30 +00:00
|
|
|
|
2008-05-02 04:10:08 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2008-03-21 04:14:17 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2013-02-18 01:34:56 +00:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2009-07-17 00:26:32 +00:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2008-04-24 01:02:16 -07:00
|
|
|
|
2013-11-14 14:31:57 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2009-10-15 06:30:45 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
2013-11-14 14:31:57 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2009-06-17 19:05:41 -07:00
|
|
|
|
|
|
|
|
|
2012-05-24 01:10:10 -06:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-06-17 21:04:56 -07:00
|
|
|
|
2013-11-14 14:31:57 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-11-14 14:31:57 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2013-11-14 14:31:57 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2008-06-17 21:04:56 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-11-14 14:31:57 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2013-11-14 14:31:57 -08:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-10-30 06:46:30 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2011-10-30 06:46:30 +00:00
|
|
|
|
2008-03-28 18:24:26 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2010-01-17 03:35:32 +00:00
|
|
|
|
2008-03-24 14:53:49 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-01-17 03:35:32 +00:00
|
|
|
|
2008-03-24 14:53:49 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
2008-03-24 14:53:49 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-03-24 14:53:49 -07:00
|
|
|
|
2008-03-06 16:22:02 -08:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2012-05-19 14:13:18 +00:00
|
|
|
|
|
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
|
|
|
|
|
2012-05-19 14:13:18 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-05-23 13:33:35 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-11-08 10:17:58 +00:00
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
2008-11-16 19:39:21 -08:00
|
|
|
|
2009-11-08 10:17:05 +00:00
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
|
|
|
|
|
2009-11-08 10:17:58 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-10-29 01:41:45 -07:00
|
|
|
|
|
|
|
|
|
2015-02-24 09:17:31 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-12-31 00:29:24 -08:00
|
|
|
|
|
|
|
|
|
2011-07-07 00:27:05 -07:00
|
|
|
|
2007-12-31 00:29:24 -08:00
|
|
|
|
2009-10-07 00:37:59 +00:00
|
|
|
|
2011-07-07 00:27:05 -07:00
|
|
|
|
2007-12-31 00:29:24 -08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|