1. 27 Nov, 2018 1 commit
  2. 28 Apr, 2017 1 commit
  3. 24 Apr, 2016 1 commit
  4. 30 Jan, 2016 1 commit
  5. 07 Nov, 2014 1 commit
  6. 26 Oct, 2014 1 commit
  7. 22 Aug, 2014 1 commit
  8. 31 Aug, 2013 1 commit
  9. 30 Aug, 2013 1 commit
  10. 27 Jul, 2013 1 commit
  11. 26 Mar, 2013 1 commit
    • Marwan Tanager's avatar
      Replace the periodic page reclaiming code with a LRU caching algorithm. · cb18fe86
      Marwan Tanager authored
      This patch implements a page cache that is invalidated in a LRU fashion.
      
      Pages are added to the cache as soon as they become visible. When the cache is
      full and a new page that isn't in the cache becomes visible, the least recently
      viewed page in the cache is evicted from memory and the new one takes it's
      place.
      
      The cache size is configurable using the page-cache-size configuration
      variable, with a default value of 15 pages. Very large values for the cache
      size are not recommended, though, as it will stress the system memory out.
      
      The old periodic page reclaiming code is no longer necessary with this patch,
      so I removed it.
      
      Special thanks to Ignas Anikevičius, and Sebastian Ramacher for the
      inspirations.
      Signed-off-by: Sebastian Ramacher's avatarSebastian Ramacher <sebastian+dev@ramacher.at>
      cb18fe86
  12. 22 Jul, 2012 1 commit
  13. 03 Apr, 2012 1 commit
  14. 24 Mar, 2012 1 commit
  15. 16 Mar, 2012 1 commit
  16. 07 Feb, 2012 1 commit