1. 26 11月, 2008 1 次提交
  2. 13 11月, 2008 1 次提交
  3. 04 11月, 2008 1 次提交
  4. 31 10月, 2008 3 次提交
  5. 30 10月, 2008 1 次提交
  6. 29 10月, 2008 1 次提交
  7. 06 10月, 2008 1 次提交
  8. 01 10月, 2008 1 次提交
    • H
      ipsec: Put dumpers on the dump list · 12a169e7
      Herbert Xu 提交于
      Herbert Xu came up with the idea and the original patch to make
      xfrm_state dump list contain also dumpers:
      
      As it is we go to extraordinary lengths to ensure that states
      don't go away while dumpers go to sleep.  It's much easier if
      we just put the dumpers themselves on the list since they can't
      go away while they're going.
      
      I've also changed the order of addition on new states to prevent
      a never-ending dump.
      
      Timo Teräs improved the patch to apply cleanly to latest tree,
      modified iteration code to be more readable by using a common
      struct for entries in the list, implemented the same idea for
      xfrm_policy dumping and moved the af_key specific "last" entry
      caching to af_key.
      Signed-off-by: NHerbert Xu <herbert@gondor.apana.org.au>
      Signed-off-by: NTimo Teras <timo.teras@iki.fi>
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      12a169e7
  9. 10 9月, 2008 1 次提交
  10. 09 9月, 2008 1 次提交
  11. 03 9月, 2008 1 次提交
  12. 20 7月, 2008 1 次提交
  13. 28 4月, 2008 1 次提交
  14. 22 4月, 2008 1 次提交
    • H
      [IPSEC]: Fix catch-22 with algorithm IDs above 31 · c5d18e98
      Herbert Xu 提交于
      As it stands it's impossible to use any authentication algorithms
      with an ID above 31 portably.  It just happens to work on x86 but
      fails miserably on ppc64.
      
      The reason is that we're using a bit mask to check the algorithm
      ID but the mask is only 32 bits wide.
      
      After looking at how this is used in the field, I have concluded
      that in the long term we should phase out state matching by IDs
      because this is made superfluous by the reqid feature.  For current
      applications, the best solution IMHO is to allow all algorithms when
      the bit masks are all ~0.
      
      The following patch does exactly that.
      
      This bug was identified by IBM when testing on the ppc64 platform
      using the NULL authentication algorithm which has an ID of 251.
      Signed-off-by: NHerbert Xu <herbert@gondor.apana.org.au>
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      c5d18e98
  15. 13 4月, 2008 1 次提交
  16. 26 3月, 2008 1 次提交
  17. 25 3月, 2008 1 次提交
    • Y
      [XFRM] MIP6: Fix address keys for routing search. · 9bb182a7
      YOSHIFUJI Hideaki 提交于
      Each MIPv6 XFRM state (DSTOPT/RH2) holds either destination or source
      address to be mangled in the IPv6 header (that is "CoA").
      On Inter-MN communication after both nodes binds each other,
      they use route optimized traffic two MIPv6 states applied, and
      both source and destination address in the IPv6 header
      are replaced by the states respectively.
      The packet format is correct, however, next-hop routing search
      are not.
      This patch fixes it by remembering address pairs for later states.
      
      Based on patch from Masahide NAKAMURA <nakam@linux-ipv6.org>.
      Signed-off-by: NMasahide NAKAMURA <nakam@linux-ipv6.org>
      Signed-off-by: NYOSHIFUJI Hideaki <yoshfuji@linux-ipv6.org>
      9bb182a7
  18. 29 2月, 2008 1 次提交
    • T
      [XFRM]: Speed up xfrm_policy and xfrm_state walking · 4c563f76
      Timo Teras 提交于
      Change xfrm_policy and xfrm_state walking algorithm from O(n^2) to O(n).
      This is achieved adding the entries to one more list which is used
      solely for walking the entries.
      
      This also fixes some races where the dump can have duplicate or missing
      entries when the SPD/SADB is modified during an ongoing dump.
      
      Dumping SADB with 20000 entries using "time ip xfrm state" the sys
      time dropped from 1.012s to 0.080s.
      Signed-off-by: NTimo Teras <timo.teras@iki.fi>
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      4c563f76
  19. 18 2月, 2008 1 次提交
  20. 29 1月, 2008 17 次提交
  21. 20 12月, 2007 1 次提交
  22. 11 12月, 2007 1 次提交