diff options
| author | Matthew Wilcox <willy@linux.intel.com> | 2016-03-17 21:21:51 (GMT) |
|---|---|---|
| committer | Linus Torvalds <torvalds@linux-foundation.org> | 2016-03-17 22:09:34 (GMT) |
| commit | 0070e28d97e72aeac2a85f538d8a452400dfe1c7 (patch) | |
| tree | c81f00809c6423ba14e4de56b1497015a19b2a4a /lib/sort.c | |
| parent | 339e6353046dd4f675304d696a88aefdd727298e (diff) | |
| download | linux-0070e28d97e72aeac2a85f538d8a452400dfe1c7.tar.xz | |
radix_tree: loop based on shift count, not height
When we introduce entries that can cover multiple indices, we will need
to stop in __radix_tree_create based on the shift, not the height.
Split out for ease of bisect.
Signed-off-by: Matthew Wilcox <willy@linux.intel.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Matthew Wilcox <willy@linux.intel.com>
Cc: "Kirill A. Shutemov" <kirill.shutemov@linux.intel.com>
Cc: Ross Zwisler <ross.zwisler@linux.intel.com>
Cc: Hugh Dickins <hughd@google.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'lib/sort.c')
0 files changed, 0 insertions, 0 deletions