Skip to content

K
Kernel

openeuler / Kernel
1 年多 前同步成功

通知 8
Star 0
Fork 0
K
Kernel
切换分支/标签
  1. 17 9月, 2013 4 次提交
  3. 21 11月, 2012 1 次提交
  5. 13 12月, 2011 1 次提交
  7. 10 11月, 2011 1 次提交
  9. 01 11月, 2011 1 次提交
  11. 31 8月, 2011 1 次提交
  13. 15 8月, 2011 2 次提交
  15. 14 6月, 2011 2 次提交
  17. 13 6月, 2011 1 次提交
  19. 08 6月, 2011 1 次提交
  21. 07 6月, 2011 1 次提交
  23. 27 5月, 2011 3 次提交
  25. 24 5月, 2011 1 次提交
  27. 20 5月, 2011 2 次提交
    • D
      ASoC: soc-cache: Cache a pointer to the last accessed rbnode · 7e146b55
      由 Dimitris Papastamos 提交于 
      Whenever we are doing a read or a write through the rbtree code, we'll
cache a pointer to the rbnode.  To avoid looking up the register
everytime we do a read or a write, we first check if it can be found in
the cached register block, otherwise we traverse the rbtree and finally
cache the rbnode for future use.
Signed-off-by: NDimitris Papastamos <dp@opensource.wolfsonmicro.com>
Acked-by: NLiam Girdwood <lrg@ti.com>
Signed-off-by: NMark Brown <broonie@opensource.wolfsonmicro.com>
      7e146b55
    • D
      ASoC: soc-cache: Block based rbtree compression · 0944cc39
      由 Dimitris Papastamos 提交于 
      This patch prepares the ground for the actual rbtree optimization patch
which will save a pointer to the last accessed rbnode that was used
in either the read() or write() functions.

Each rbnode manages a variable length block of registers.  There can be no
two nodes with overlapping blocks.  Each block has a base register and a
currently top register, all the other registers, if any, lie in between these
two and in ascending order.

The reasoning behind the construction of this rbtree is simple.  In the
snd_soc_rbtree_cache_init() function, we iterate over the register defaults
provided by the driver.  For each register value that is non-zero we
insert it in the rbtree.  In order to determine in which rbnode we need
to add the register, we first look if there is another register already
added that is adjacent to the one we are about to add.  If that is the case
we append it in that rbnode block, otherwise we create a new rbnode
with a single register in its block and add it to the tree.

In the next patch, where a cached rbnode is used by both the write() and the
read() functions, we also check if the register we are about to add is in the
cached rbnode (the least recently accessed one) and if so we append it in that
rbnode block.
Signed-off-by: NDimitris Papastamos <dp@opensource.wolfsonmicro.com>
Acked-by: NLiam Girdwood <lrg@ti.com>
Signed-off-by: NMark Brown <broonie@opensource.wolfsonmicro.com>
      0944cc39
  29. 15 5月, 2011 1 次提交
  31. 11 5月, 2011 3 次提交
  33. 08 5月, 2011 1 次提交
  35. 20 4月, 2011 1 次提交
  37. 05 4月, 2011 3 次提交
  39. 31 3月, 2011 2 次提交
  41. 27 3月, 2011 7 次提交