1. 28 2月, 2013 1 次提交
  2. 12 4月, 2012 1 次提交
  3. 31 10月, 2011 1 次提交
  4. 02 10月, 2010 1 次提交
    • I
      kfifo: fix scatterlist usage · 399f1e30
      Ira W. Snyder 提交于
      The kfifo_dma family of functions use sg_mark_end() on the last element in
      their scatterlist.  This forces use of a fresh scatterlist for each DMA
      operation, which makes recycling a single scatterlist impossible.
      
      Change the behavior of the kfifo_dma functions to match the usage of the
      dma_map_sg function.  This means that users must respect the returned
      nents value.  The sample code is updated to reflect the change.
      
      This bug is trivial to cause: call kfifo_dma_in_prepare() such that it
      prepares a scatterlist with a single entry comprising the whole fifo.
      This is the case when you map the entirety of a newly created empty fifo.
      This causes the setup_sgl() function to mark the first scatterlist entry
      as the end of the chain, no matter what comes after it.
      
      Afterwards, add and remove some data from the fifo such that another call
      to kfifo_dma_in_prepare() will create two scatterlist entries.  It returns
      nents=2.  However, due to the previous sg_mark_end() call, sg_is_last()
      will now return true for the first scatterlist element.  This causes the
      sample code to print a single scatterlist element when it should print
      two.
      
      By removing the call to sg_mark_end(), we make the API as similar as
      possible to the DMA mapping API.  All users are required to respect the
      returned nents.
      Signed-off-by: NIra W. Snyder <iws@ovro.caltech.edu>
      Cc: Stefani Seibold <stefani@seibold.net>
      Signed-off-by: NAndrew Morton <akpm@linux-foundation.org>
      Signed-off-by: NLinus Torvalds <torvalds@linux-foundation.org>
      399f1e30
  5. 21 8月, 2010 1 次提交
  6. 12 8月, 2010 1 次提交
  7. 11 8月, 2010 1 次提交
  8. 17 2月, 2010 2 次提交
  9. 03 2月, 2010 1 次提交
  10. 17 1月, 2010 4 次提交
  11. 23 12月, 2009 6 次提交
  12. 20 9月, 2009 1 次提交
  13. 17 6月, 2009 1 次提交
  14. 17 7月, 2007 1 次提交
  15. 12 2月, 2007 1 次提交
  16. 30 9月, 2006 1 次提交
    • P
      [PATCH] memory ordering in __kfifo primitives · a45bce49
      Paul E. McKenney 提交于
      Both __kfifo_put() and __kfifo_get() have header comments stating that if
      there is but one concurrent reader and one concurrent writer, locking is not
      necessary.  This is almost the case, but a couple of memory barriers are
      needed.  Another option would be to change the header comments to remove the
      bit about locking not being needed, and to change the those callers who
      currently don't use locking to add the required locking.  The attachment
      analyzes this approach, but the patch below seems simpler.
      Signed-off-by: NPaul E. McKenney <paulmck@us.ibm.com>
      Cc: Stelian Pop <stelian@popies.net>
      Signed-off-by: NAndrew Morton <akpm@osdl.org>
      Signed-off-by: NLinus Torvalds <torvalds@osdl.org>
      a45bce49
  17. 09 10月, 2005 1 次提交
  18. 17 4月, 2005 1 次提交
    • L
      Linux-2.6.12-rc2 · 1da177e4
      Linus Torvalds 提交于
      Initial git repository build. I'm not bothering with the full history,
      even though we have it. We can create a separate "historical" git
      archive of that later if we want to, and in the meantime it's about
      3.2GB when imported into git - space that would just make the early
      git days unnecessarily complicated, when we don't have a lot of good
      infrastructure for it.
      
      Let it rip!
      1da177e4