1. 20 5月, 2006 3 次提交
    • V
      [SCTP]: Validate the parameter length in HB-ACK chunk. · a601266e
      Vladislav Yasevich 提交于
      If SCTP receives a badly formatted HB-ACK chunk, it is possible
      that we may access invalid memory and potentially have a buffer
      overflow.  We should really make sure that the chunk format is
      what we expect, before attempting to touch the data.
      Signed-off-by: NVlad Yasevich <vladislav.yasevich@hp.com>
      Signed-off-by: NSridhar Samudrala <sri@us.ibm.com>
      a601266e
    • V
      [SCTP]: A better solution to fix the race between sctp_peeloff() and · 61c9fed4
      Vladislav Yasevich 提交于
      sctp_rcv().
      
      The goal is to hold the ref on the association/endpoint throughout the
      state-machine process.  We accomplish like this:
      
        /* ref on the assoc/ep is taken during lookup */
      
        if owned_by_user(sk)
       	sctp_add_backlog(skb, sk);
        else
       	inqueue_push(skb, sk);
      
        /* drop the ref on the assoc/ep */
      
      However, in sctp_add_backlog() we take the ref on assoc/ep and hold it
      while the skb is on the backlog queue.  This allows us to get rid of the
      sock_hold/sock_put in the lookup routines.
      
      Now sctp_backlog_rcv() needs to account for potential association move.
      In the unlikely event that association moved, we need to retest if the
      new socket is locked by user.  If we don't this, we may have two packets
      racing up the stack toward the same socket and we can't deal with it.
      If the new socket is still locked, we'll just add the skb to its backlog
      continuing to hold the ref on the association.  This get's rid of the
      need to move packets from one backlog to another and it also safe in
      case new packets arrive on the same backlog queue.
      
      The last step, is to lock the new socket when we are moving the
      association to it.  This is needed in case any new packets arrive on
      the association when it moved.  We want these to go to the backlog since
      we would like to avoid the race between this new packet and a packet
      that may be sitting on the backlog queue of the old socket toward the
      same association.
      Signed-off-by: NVladislav Yasevich <vladislav.yasevich@hp.com>
      Signed-off-by: NSridhar Samudrala <sri@us.ibm.com>
      61c9fed4
    • S
      [SCTP]: Set sk_err so that poll wakes up after a non-blocking connect failure. · 8de8c873
      Sridhar Samudrala 提交于
      Also fix some other cases where sk_err is not set for 1-1 style sockets.
      Signed-off-by: NSridhar Samudrala <sri@us.ibm.com>
      8de8c873
  2. 19 5月, 2006 5 次提交
  3. 17 5月, 2006 6 次提交
  4. 13 5月, 2006 1 次提交
    • S
      [NEIGH]: Fix IP-over-ATM and ARP interaction. · bd89efc5
      Simon Kelley 提交于
      The classical IP over ATM code maintains its own IPv4 <-> <ATM stuff>
      ARP table, using the standard neighbour-table code. The
      neigh_table_init function adds this neighbour table to a linked list
      of all neighbor tables which is used by the functions neigh_delete()
      neigh_add() and neightbl_set(), all called by the netlink code.
      
      Once the ATM neighbour table is added to the list, there are two
      tables with family == AF_INET there, and ARP entries sent via netlink
      go into the first table with matching family. This is indeterminate
      and often wrong.
      
      To see the bug, on a kernel with CLIP enabled, create a standard IPv4
      ARP entry by pinging an unused address on a local subnet. Then attempt
      to complete that entry by doing
      
      ip neigh replace <ip address> lladdr <some mac address> nud reachable
      
      Looking at the ARP tables by using 
      
      ip neigh show
      
      will reveal two ARP entries for the same address. One of these can be
      found in /proc/net/arp, and the other in /proc/net/atm/arp.
      
      This patch adds a new function, neigh_table_init_no_netlink() which
      does everything the neigh_table_init() does, except add the table to
      the netlink all-arp-tables chain. In addition neigh_table_init() has a
      check that all tables on the chain have a distinct address family.
      The init call in clip.c is changed to call
      neigh_table_init_no_netlink().
      
      Since ATM ARP tables are rather more complicated than can currently be
      handled by the available rtattrs in the netlink protocol, no
      functionality is lost by this patch, and non-ATM ARP manipulation via
      netlink is rescued. A more complete solution would involve a rtattr
      for ATM ARP entries and some way for the netlink code to give
      neigh_add and friends more information than just address family with
      which to find the correct ARP table.
      
      [ I've changed the assertion checking in neigh_table_init() to not
        use BUG_ON() while holding neigh_tbl_lock.  Instead we remember that
        we found an existing tbl with the same family, and after dropping
        the lock we'll give a diagnostic kernel log message and a stack dump.
        -DaveM ]
      Signed-off-by: NSimon Kelley <simon@thekelleys.org.uk>
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      bd89efc5
  5. 12 5月, 2006 1 次提交
  6. 11 5月, 2006 3 次提交
  7. 10 5月, 2006 4 次提交
  8. 07 5月, 2006 2 次提交
  9. 06 5月, 2006 10 次提交
  10. 04 5月, 2006 5 次提交