diff options
| author | Xiao Guangrong <xiaoguangrong@linux.vnet.ibm.com> | 2012-03-23 23:02:15 +0100 |
|---|---|---|
| committer | Linus Torvalds <torvalds@linux-foundation.org> | 2012-03-24 00:58:36 +0100 |
| commit | 742245d5c2ebd75c2a002f8fc2afbdc5c26edd8c (patch) | |
| tree | 1634d6ce2eaec1c05034735b6a82f05894cfea95 /lib/find_last_bit.c | |
| parent | prio_tree: cleanup prio_tree_left()/prio_tree_right() (diff) | |
| download | linux-742245d5c2ebd75c2a002f8fc2afbdc5c26edd8c.tar.xz linux-742245d5c2ebd75c2a002f8fc2afbdc5c26edd8c.zip | |
prio_tree: simplify prio_tree_expand()
In current code, the deleted-node is recorded from first to last,
actually, we can directly attach these node on 'node' we will insert as
the left child, it can let the code more readable.
Signed-off-by: Xiao Guangrong <xiaoguangrong@linux.vnet.ibm.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'lib/find_last_bit.c')
0 files changed, 0 insertions, 0 deletions