1. 01 5月, 2007 2 次提交
  2. 30 4月, 2007 1 次提交
    • E
      [PATCH] INET : IPV4 UDP lookups converted to a 2 pass algo · 6aaf47fa
      Eric Dumazet 提交于
      Some people want to have many UDP sockets, binded to a single port but
      many different addresses. We currently hash all those sockets into a
      single chain.  Processing of incoming packets is very expensive,
      because the whole chain must be examined to find the best match.
      
      I chose in this patch to hash UDP sockets with a hash function that
      take into account both their port number and address : This has a
      drawback because we need two lookups : one with a given address, one
      with a wildcard (null) address.
      Signed-off-by: NEric Dumazet <dada1@cosmosbay.com>
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      6aaf47fa
  3. 26 4月, 2007 11 次提交
  4. 08 3月, 2007 1 次提交
  5. 11 2月, 2007 2 次提交
  6. 09 2月, 2007 1 次提交
  7. 23 12月, 2006 1 次提交
    • D
      [UDP]: Fix reversed logic in udp_get_port(). · 5c668704
      David S. Miller 提交于
      When this code was converted to use sk_for_each() the
      logic for the "best hash chain length" code was reversed,
      breaking everything.
      
      The original code was of the form:
      
      			size = 0;
      			do {
      				if (++size >= best_size_so_far)
      					goto next;
      			} while ((sk = sk->next) != NULL);
      			best_size_so_far = size;
      			best = result;
      		next:;
      
      and this got converted into:
      
      			sk_for_each(sk2, node, head)
      				if (++size < best_size_so_far) {
      					best_size_so_far = size;
      					best = result;
      				}
      
      Which does something very very different from the original.
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      5c668704
  8. 03 12月, 2006 7 次提交
  9. 26 11月, 2006 1 次提交
  10. 04 10月, 2006 1 次提交
  11. 29 9月, 2006 2 次提交
  12. 23 9月, 2006 6 次提交
  13. 22 7月, 2006 1 次提交
  14. 01 7月, 2006 1 次提交
  15. 21 3月, 2006 2 次提交