b9a0deb96b
redo: radix tree test suite: fix compilation
...
[ This resurrects commit 53855d10f42b41226b39d544abd5ffhttp://lkml.kernel.org/r/1480369871-5271-36-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-15 11:04:20 -08:00
e1e14ab841
radix tree test suite: delete unused rcupdate.c
...
This file was used to implement call_rcu() before liburcu implemented
that function. It hasn't even been compiled since before the test suite
was added to the kernel. Remove it to reduce confusion.
Link: http://lkml.kernel.org/r/1481667692-14500-5-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com >
Cc: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
092bc0b225
radix tree test suite: add new tag check
...
We have a check that setting a tag on a single entry at root succeeds,
but we were missing a check that clearing a tag on that same entry also
succeeds.
Link: http://lkml.kernel.org/r/1481667692-14500-4-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com >
Cc: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
e8de434076
radix-tree: ensure counts are initialised
...
radix_tree_join() was freeing nodes with a non-zero ->exceptional count,
and radix_tree_split() wasn't zeroing ->exceptional when it allocated
the new node. Fix this by making all callers of radix_tree_node_alloc()
pass in the new counts (and some other always-initialised fields), which
will prevent the problem recurring if in future we decide to do
something similar.
Link: http://lkml.kernel.org/r/1481667692-14500-3-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com >
Cc: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
bbe9d71f2c
radix tree test suite: cache recently freed objects
...
The kmem_cache_alloc implementation simply allocates new memory from
malloc() and calls the ctor, which zeroes out the entire object. This
means it cannot spot bugs where the object isn't properly reinitialised
before being freed.
Add a small (11 objects) cache before freeing objects back to malloc.
This is enough to let us write a test to catch it, although the memory
allocator is now aware of the structure of the radix tree node, since it
chains free objects through ->private_data (like the percpu cache does).
Link: http://lkml.kernel.org/r/1481667692-14500-2-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com >
Cc: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
de1af8f62a
radix tree test suite: add some more functionality
...
IDR needs more functionality from the kernel: kmalloc()/kfree(), and
xchg().
Link: http://lkml.kernel.org/r/1480369871-5271-67-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <willy@linux.intel.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
3e3cdc68be
radix tree test suite: check multiorder iteration
...
The random iteration test only inserts order-0 entries currently.
Update it to insert entries of order between 7 and 0. Also make the
maximum index configurable, make some variables static, make the test
duration variable, remove some useless spinning, and add a fifth thread
which calls tag_tagged_items().
Link: http://lkml.kernel.org/r/1480369871-5271-62-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
a90eb3a2a4
radix-tree: fix replacement for multiorder entries
...
When replacing an entry with NULL, we need to delete any sibling
entries. Also account deleting exceptional entries properly. Also fix
a bug with radix_tree_iter_replace() where we would fail to remove
entirely freed nodes. Also fix accounting bug when switching between
normal and exceptional entries with replace_slot. Also add testcases
for all these bugs.
Link: http://lkml.kernel.org/r/1480369871-5271-61-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
2791653a68
radix-tree: add radix_tree_split_preload()
...
Calculate how many nodes we need to allocate to split an old_order entry
into multiple entries, each of size new_order. The test suite checks
that we allocated exactly the right number of nodes; neither too many
(checked by rtp->nr == 0), nor too few (checked by comparing
nr_allocated before and after the call to radix_tree_split()).
Link: http://lkml.kernel.org/r/1480369871-5271-60-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <willy@linux.intel.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
e157b55594
radix-tree: add radix_tree_split
...
This new function splits a larger multiorder entry into smaller entries
(potentially multi-order entries). These entries are initialised to
RADIX_TREE_RETRY to ensure that RCU walkers who see this state aren't
confused. The caller should then call radix_tree_for_each_slot() and
radix_tree_replace_slot() in order to turn these retry entries into the
intended new entries. Tags are replicated from the original multiorder
entry into each new entry.
Link: http://lkml.kernel.org/r/1480369871-5271-59-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <willy@linux.intel.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
175542f575
radix-tree: add radix_tree_join
...
This new function allows for the replacement of many smaller entries in
the radix tree with one larger multiorder entry. From the point of view
of an RCU walker, they may see a mixture of the smaller entries and the
large entry during the same walk, but they will never see NULL for an
index which was populated before the join.
Link: http://lkml.kernel.org/r/1480369871-5271-58-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <willy@linux.intel.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
268f42de71
radix-tree: delete radix_tree_range_tag_if_tagged()
...
This is an exceptionally complicated function with just one caller
(tag_pages_for_writeback). We devote a large portion of the runtime of
the test suite to testing this one function which has one caller. By
introducing the new function radix_tree_iter_tag_set(), we can eliminate
all of the complexity while keeping the performance. The caller can now
use a fairly standard radix_tree_for_each() loop, and it doesn't need to
worry about tricksy things like 'start' wrapping.
The test suite continues to spend a large amount of time investigating
this function, but now it's testing the underlying primitives such as
radix_tree_iter_resume() and the radix_tree_for_each_tagged() iterator
which are also used by other parts of the kernel.
Link: http://lkml.kernel.org/r/1480369871-5271-57-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <willy@infradead.org >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
478922e2b0
radix-tree: delete radix_tree_locate_item()
...
This rather complicated function can be better implemented as an
iterator. It has only one caller, so move the functionality to the only
place that needs it. Update the test suite to follow the same pattern.
Link: http://lkml.kernel.org/r/1480369871-5271-56-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com >
Acked-by: Konstantin Khlebnikov <koct9i@gmail.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
148deab223
radix-tree: improve multiorder iterators
...
This fixes several interlinked problems with the iterators in the
presence of multiorder entries.
1. radix_tree_iter_next() would only advance by one slot, which would
result in the iterators returning the same entry more than once if
there were sibling entries.
2. radix_tree_next_slot() could return an internal pointer instead of
a user pointer if a tagged multiorder entry was immediately followed by
an entry of lower order.
3. radix_tree_next_slot() expanded to a lot more code than it used to
when multiorder support was compiled in. And I wasn't comfortable with
entry_to_node() being in a header file.
Fixing radix_tree_iter_next() for the presence of sibling entries
necessarily involves examining the contents of the radix tree, so we now
need to pass 'slot' to radix_tree_iter_next(), and we need to change the
calling convention so it is called *before* dropping the lock which
protects the tree. Also rename it to radix_tree_iter_resume(), as some
people thought it was necessary to call radix_tree_iter_next() each time
around the loop.
radix_tree_next_slot() becomes closer to how it looked before multiorder
support was introduced. It only checks to see if the next entry in the
chunk is a sibling entry or a pointer to a node; this should be rare
enough that handling this case out of line is not a performance impact
(and such impact is amortised by the fact that the entry we just
processed was a multiorder entry). Also, radix_tree_next_slot() used to
force a new chunk lookup for untagged entries, which is more expensive
than the out of line sibling entry skipping.
Link: http://lkml.kernel.org/r/1480369871-5271-55-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
0629573e6b
radix tree test suite: use common find-bit code
...
Remove the old find_next_bit code in favour of linking in the find_bit
code from tools/lib.
Link: http://lkml.kernel.org/r/1480369871-5271-48-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <willy@linux.intel.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
101d9607ff
radix tree test suite: record order in each item
...
This probably doubles the size of each item allocated by the test suite
but it lets us check a few more things, and may be needed for upcoming
API changes that require the caller pass in the order of the entry.
Link: http://lkml.kernel.org/r/1480369871-5271-46-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
3ad75f8a1d
radix tree test suite: handle exceptional entries
...
item_kill_tree() assumes that everything in the tree is a pointer to a
struct item, which is annoying when testing the behaviour of exceptional
entries. Fix it to delete exceptional entries on the assumption they
don't need to be freed.
Link: http://lkml.kernel.org/r/1480369871-5271-45-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:10 -08:00
af1c5cca90
radix tree test suite: use rcu_barrier
...
Calling rcu_barrier() allows all of the rcu-freed memory to be actually
returned to the pool, and allows nr_allocated to return to 0. As well
as allowing diffs between runs to be more useful, it also lets us
pinpoint leaks more effectively.
Link: http://lkml.kernel.org/r/1480369871-5271-44-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:09 -08:00
cfa40bcfd6
radix tree test suite: benchmark for iterator
...
This adds simple benchmark for iterator similar to one I've used for
commit 78c1d78488http://lkml.kernel.org/r/1480369871-5271-43-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Konstantin Khlebnikov <koct9i@gmail.com >
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:09 -08:00
ba20cd60c9
radix tree test suite: iteration test misuses RCU
...
Each thread needs to register itself with RCU, otherwise the reading
thread's read lock has no effect and the freeing thread will free the
memory in the tree without waiting for the read lock to be dropped.
Link: http://lkml.kernel.org/r/1480369871-5271-42-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:09 -08:00
061ef3936b
radix tree test suite: make runs more reproducible
...
Instead of reseeding the random number generator every time around the
loop in big_gang_check(), seed it at the beginning of execution. Use
rand_r() and an independent base seed for each thread in
iteration_test() so they don't stomp all over each others state. Since
this particular test depends on the kernel scheduler, the iteration test
can't be reproduced based purely on the random seed, but at least it
won't pollute the other tests.
Print the seed, and allow the seed to be specified so that a run which
hits a problem can be reproduced.
Link: http://lkml.kernel.org/r/1480369871-5271-41-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <willy@infradead.org >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:09 -08:00
6df5ee7867
radix tree test suite: free preallocated nodes
...
It can be a source of mild concern when the test suite shows that we're
leaking nodes. While poring over the source code looking for leaks can
lead to some fascinating bugs being discovered, sometimes the leak is
simply that these nodes were preallocated and are sitting on the per-CPU
list. Free them by calling the CPU dead callback.
Link: http://lkml.kernel.org/r/1480369871-5271-40-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <willy@infradead.org >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:09 -08:00
847d357635
radix tree test suite: track preempt_count
...
Rather than simply NOP out preempt_enable() and preempt_disable(), keep
track of preempt_count and display it regularly in case either the test
suite or the code under test is forgetting to balance the enables &
disables. Only found a test-case that was forgetting to re-enable
preemption, but it's a possibility worth checking.
Link: http://lkml.kernel.org/r/1480369871-5271-39-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <willy@infradead.org >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:09 -08:00
31023cd664
radix tree test suite: allow GFP_ATOMIC allocations to fail
...
In order to test the preload code, it is necessary to fail GFP_ATOMIC
allocations, which requires defining GFP_KERNEL and GFP_ATOMIC properly.
Remove the obsolete __GFP_WAIT and copy the definitions of the __GFP
flags which are used from the kernel include files. We also need the
real definition of gfpflags_allow_blocking() to persuade the radix tree
to actually use its preallocated nodes.
Link: http://lkml.kernel.org/r/1480369871-5271-38-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <willy@linux.intel.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:09 -08:00
ebb9a9aedb
tools: add WARN_ON_ONCE
...
Patch series "Radix tree patches for 4.10", v3.
Mostly these are improvements; the only bug fixes in here relate to
multiorder entries (which are unused in the 4.9 tree).
This patch (of 32):
The radix tree uses its own buggy WARN_ON_ONCE. Replace it with the
definition from asm-generic/bug.h
Link: http://lkml.kernel.org/r/1480369871-5271-37-git-send-email-mawilcox@linuxonhyperv.com
Signed-off-by: Matthew Wilcox <willy@linux.intel.com >
Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com >
Cc: Konstantin Khlebnikov <koct9i@gmail.com >
Cc: Ross Zwisler <ross.zwisler@linux.intel.com >
Cc: Matthew Wilcox <mawilcox@microsoft.com >
Signed-off-by: Andrew Morton <akpm@linux-foundation.org >
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org >
2016-12-14 16:04:09 -08:00
Matthew Wilcox
Matthew Wilcox
Konstantin Khlebnikov
Matthew Wilcox