1. 05 4月, 2007 1 次提交
  2. 04 4月, 2007 1 次提交
    • E
      [PATCH] net: Ignore sysfs network device rename bugs. · 92749821
      Eric W. Biederman 提交于
      The generic networking code ensures that no two networking devices
      have the same name, so  there is no time except when sysfs has
      implementation bugs that device_rename when called from
      dev_change_name will fail.
      
      The current error handling for errors from device_rename in
      dev_change_name is wrong and results in an unusable and unrecoverable
      network device if device_rename is happens to return an error.
      
      This patch removes the buggy error handling.  Which confines the mess
      when device_rename hits a problem to sysfs, instead of propagating it
      the rest of the network stack.  Making linux a little more robust.
      
      Without this patch you can observe what happens when sysfs has a bug
      when CONFIG_SYSFS_DEPRECATED is not set and you attempt to rename
      a real network device to a name like (broken_parity_status, device,
      modalias, power, resource2, subsystem_vendor, class,  driver, irq,
      msi_bus, resource, subsystem, uevent, config, enable, local_cpus,
      numa_node, resource0, subsystem_device, vendor)
      
      Greg has a patch that fixes the sysfs bugs but he doesn't trust it
      for a 2.6.21 timeframe.  This patch which just ignores errors should
      be safe and it keeps the system from going completely wacky.
      Signed-off-by: NEric W. Biederman <ebiederm@xmission.com>
      Signed-off-by: NLinus Torvalds <torvalds@linux-foundation.org>
      92749821
  3. 03 4月, 2007 4 次提交
  4. 30 3月, 2007 1 次提交
  5. 29 3月, 2007 2 次提交
  6. 28 3月, 2007 3 次提交
  7. 27 3月, 2007 3 次提交
  8. 26 3月, 2007 9 次提交
    • P
      [NET_SCHED]: Fix ingress locking · 035832a2
      Patrick McHardy 提交于
      Ingress queueing uses a seperate lock for serializing enqueue operations,
      but fails to properly protect itself against concurrent changes to the
      qdisc tree. Use queue_lock for now since the real fix it quite intrusive.
      Signed-off-by: NPatrick McHardy <kaber@trash.net>
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      035832a2
    • P
      [NET_SCHED]: cls_basic: fix NULL pointer dereference · d3fa76ee
      Patrick McHardy 提交于
      cls_basic doesn't allocate tp->root before it is linked into the
      active classifier list, resulting in a NULL pointer dereference
      when packets hit the classifier before its ->change function is
      called.
      
      Reported by Chris Madden <chris@reflexsecurity.com>
      Signed-off-by: NPatrick McHardy <kaber@trash.net>
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      d3fa76ee
    • A
      [DCCP]: make dccp_write_xmit_timer() static again · c93a882e
      Adrian Bunk 提交于
      dccp_write_xmit_timer() needlessly became global.
      Signed-off-by: NAdrian Bunk <bunk@stusta.de>
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      c93a882e
    • D
      [IPV6]: Fix routing round-robin locking. · f11e6659
      David S. Miller 提交于
      As per RFC2461, section 6.3.6, item #2, when no routers on the
      matching list are known to be reachable or probably reachable we
      do round robin on those available routes so that we make sure
      to probe as many of them as possible to detect when one becomes
      reachable faster.
      
      Each routing table has a rwlock protecting the tree and the linked
      list of routes at each leaf.  The round robin code executes during
      lookup and thus with the rwlock taken as a reader.  A small local
      spinlock tries to provide protection but this does not work at all
      for two reasons:
      
      1) The round-robin list manipulation, as coded, goes like this (with
         read lock held):
      
      	walk routes finding head and tail
      
      	spin_lock();
      	rotate list using head and tail
      	spin_unlock();
      
         While one thread is rotating the list, another thread can
         end up with stale values of head and tail and then proceed
         to corrupt the list when it gets the lock.  This ends up causing
         the OOPS in fib6_add() later onthat many people have been hitting.
      
      2) All the other code paths that run with the rwlock held as
         a reader do not expect the list to change on them, they
         expect it to remain completely fixed while they hold the
         lock in that way.
      
      So, simply stated, it is impossible to implement this correctly using
      a manipulation of the list without violating the rwlock locking
      semantics.
      
      Reimplement using a per-fib6_node round-robin pointer.  This way we
      don't need to manipulate the list at all, and since the round-robin
      pointer can only ever point to real existing entries we don't need
      to perform any locking on the changing of the round-robin pointer
      itself.  We only need to reset the round-robin pointer to NULL when
      the entry it is pointing to is removed.
      
      The idea is from Thomas Graf and it is very similar to how this
      was implemented before the advanced router selection code when in.
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      f11e6659
    • T
      [DECNet] fib: Fix out of bound access of dn_fib_props[] · a9791011
      Thomas Graf 提交于
      Fixes a typo which caused fib_props[] to have the wrong size
      and makes sure the value used to index the array which is
      provided by userspace via netlink is checked to avoid out of
      bound access.
      Signed-off-by: NThomas Graf <tgraf@suug.ch>
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      a9791011
    • T
      [IPv4] fib: Fix out of bound access of fib_props[] · a0ee18b9
      Thomas Graf 提交于
      Fixes a typo which caused fib_props[] to have the wrong size
      and makes sure the value used to index the array which is
      provided by userspace via netlink is checked to avoid out of
      bound access.
      Signed-off-by: NThomas Graf <tgraf@suug.ch>
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      a0ee18b9
    • R
      [NET] AX.25 Kconfig and docs updates and fixes · 954b2e7f
      Ralf Baechle 提交于
       o The AX.25 Howto is unmaintained since several years.  I've replaced it
         with a wiki at http://www.linux-ax25.org which provides more uptodate
         information.
       o Change default for AX25_DAMA_SLAVE to Y.  AX25_DAMA_SLAVE only compiles
         in support for DAMA but doesn't activate it.  I hope this gets Linux
         distributions to ship their AX.25 kernels with AX25_DAMA_SLAVE enabled.
         The price for this would be very small.
       o Delete historic changelog from comments, that's what SCM systems are
         meant to do.
       o ---help--- in Kconfig looks so yellingly eye insulting.  Use just help.
       o Rewrite the commented out piece of old Linux 2.4 configuration language
         to Kconfig for consistency.
       o Fixup dependencies.
      Signed-off-by: NRalf Baechle <ralf@linux-mips.org>
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      954b2e7f
    • A
      [NET]: Fix neighbour destructor handling. · ecbb4169
      Alexey Kuznetsov 提交于
      ->neigh_destructor() is killed (not used), replaced with
      ->neigh_cleanup(), which is called when neighbor entry goes to dead
      state. At this point everything is still valid: neigh->dev,
      neigh->parms etc.
      
      The device should guarantee that dead neighbor entries (neigh->dead !=
      0) do not get private part initialized, otherwise nobody will cleanup
      it.
      
      I think this is enough for ipoib which is the only user of this thing.
      Initialization private part of neighbor entries happens in ipib
      start_xmit routine, which is not reached when device is down.  But it
      would be better to add explicit test for neigh->dead in any case.
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      ecbb4169
    • T
      [NET]: Fix fib_rules compatibility breakage · e1701c68
      Thomas Graf 提交于
      Based upon a patch from Patrick McHardy.
      
      The fib_rules netlink attribute policy introduced in 2.6.19 broke
      userspace compatibilty. When specifying a rule with "from all"
      or "to all", iproute adds a zero byte long netlink attribute,
      but the policy requires all addresses to have a size equal to
      sizeof(struct in_addr)/sizeof(struct in6_addr), resulting in a
      validation error.
      
      Check attribute length of FRA_SRC/FRA_DST in the generic framework
      by letting the family specific rules implementation provide the
      length of an address. Report an error if address length is non
      zero but no address attribute is provided. Fix actual bug by
      checking address length for non-zero instead of relying on
      availability of attribute.
      Signed-off-by: NThomas Graf <tgraf@suug.ch>
      Signed-off-by: NPatrick McHardy <kaber@trash.net>
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      e1701c68
  9. 25 3月, 2007 1 次提交
  10. 23 3月, 2007 6 次提交
  11. 20 3月, 2007 7 次提交
  12. 17 3月, 2007 2 次提交