2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2001 Momchil Velikov
|
|
|
|
* Portions Copyright (C) 2001 Christoph Hellwig
|
2006-12-06 21:33:44 -07:00
|
|
|
* Copyright (C) 2006 Nick Piggin
|
2012-03-28 15:42:53 -06:00
|
|
|
* Copyright (C) 2012 Konstantin Khlebnikov
|
2005-04-16 16:20:36 -06:00
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License as
|
|
|
|
* published by the Free Software Foundation; either version 2, or (at
|
|
|
|
* your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful, but
|
|
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
*/
|
|
|
|
#ifndef _LINUX_RADIX_TREE_H
|
|
|
|
#define _LINUX_RADIX_TREE_H
|
|
|
|
|
2016-03-17 15:21:42 -06:00
|
|
|
#include <linux/bitops.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
#include <linux/preempt.h>
|
|
|
|
#include <linux/types.h>
|
2011-11-23 18:12:59 -07:00
|
|
|
#include <linux/bug.h>
|
2006-12-06 21:33:44 -07:00
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/rcupdate.h>
|
|
|
|
|
|
|
|
/*
|
2016-05-20 18:03:22 -06:00
|
|
|
* Entries in the radix tree have the low bit set if they refer to a
|
|
|
|
* radix_tree_node. If the low bit is clear then the entry is user data.
|
2006-12-06 21:33:44 -07:00
|
|
|
*
|
2016-05-20 18:03:22 -06:00
|
|
|
* We also use the low bit to indicate that the slot will be freed in the
|
|
|
|
* next RCU idle period, and users need to re-walk the tree to find the
|
|
|
|
* new slot for the index that they were looking for. See the comment in
|
|
|
|
* radix_tree_shrink() for details.
|
2006-12-06 21:33:44 -07:00
|
|
|
*/
|
2016-05-20 18:03:22 -06:00
|
|
|
#define RADIX_TREE_INTERNAL_NODE 1
|
|
|
|
|
radix_tree: exceptional entries and indices
A patchset to extend tmpfs to MAX_LFS_FILESIZE by abandoning its
peculiar swap vector, instead keeping a file's swap entries in the same
radix tree as its struct page pointers: thus saving memory, and
simplifying its code and locking.
This patch:
The radix_tree is used by several subsystems for different purposes. A
major use is to store the struct page pointers of a file's pagecache for
memory management. But what if mm wanted to store something other than
page pointers there too?
The low bit of a radix_tree entry is already used to denote an indirect
pointer, for internal use, and the unlikely radix_tree_deref_retry()
case.
Define the next bit as denoting an exceptional entry, and supply inline
functions radix_tree_exception() to return non-0 in either unlikely
case, and radix_tree_exceptional_entry() to return non-0 in the second
case.
If a subsystem already uses radix_tree with that bit set, no problem: it
does not affect internal workings at all, but is defined for the
convenience of those storing well-aligned pointers in the radix_tree.
The radix_tree_gang_lookups have an implicit assumption that the caller
can deduce the offset of each entry returned e.g. by the page->index of
a struct page. But that may not be feasible for some kinds of item to
be stored there.
radix_tree_gang_lookup_slot() allow for an optional indices argument,
output array in which to return those offsets. The same could be added
to other radix_tree_gang_lookups, but for now keep it to the only one
for which we need it.
Signed-off-by: Hugh Dickins <hughd@google.com>
Acked-by: Rik van Riel <riel@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-08-03 17:21:18 -06:00
|
|
|
/*
|
|
|
|
* A common use of the radix tree is to store pointers to struct pages;
|
|
|
|
* but shmem/tmpfs needs also to store swap entries in the same tree:
|
|
|
|
* those are marked as exceptional entries to distinguish them.
|
|
|
|
* EXCEPTIONAL_ENTRY tests the bit, EXCEPTIONAL_SHIFT shifts content past it.
|
|
|
|
*/
|
|
|
|
#define RADIX_TREE_EXCEPTIONAL_ENTRY 2
|
|
|
|
#define RADIX_TREE_EXCEPTIONAL_SHIFT 2
|
2006-12-06 21:33:44 -07:00
|
|
|
|
2016-01-22 16:10:40 -07:00
|
|
|
#define RADIX_DAX_MASK 0xf
|
|
|
|
#define RADIX_DAX_SHIFT 4
|
|
|
|
#define RADIX_DAX_PTE (0x4 | RADIX_TREE_EXCEPTIONAL_ENTRY)
|
|
|
|
#define RADIX_DAX_PMD (0x8 | RADIX_TREE_EXCEPTIONAL_ENTRY)
|
|
|
|
#define RADIX_DAX_TYPE(entry) ((unsigned long)entry & RADIX_DAX_MASK)
|
|
|
|
#define RADIX_DAX_SECTOR(entry) (((unsigned long)entry >> RADIX_DAX_SHIFT))
|
|
|
|
#define RADIX_DAX_ENTRY(sector, pmd) ((void *)((unsigned long)sector << \
|
|
|
|
RADIX_DAX_SHIFT | (pmd ? RADIX_DAX_PMD : RADIX_DAX_PTE)))
|
|
|
|
|
2007-10-16 02:24:42 -06:00
|
|
|
static inline int radix_tree_is_indirect_ptr(void *ptr)
|
2006-12-06 21:33:44 -07:00
|
|
|
{
|
2016-05-20 18:03:22 -06:00
|
|
|
return (int)((unsigned long)ptr & RADIX_TREE_INTERNAL_NODE);
|
2006-12-06 21:33:44 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
/*** radix-tree API starts here ***/
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2010-08-09 18:19:12 -06:00
|
|
|
#define RADIX_TREE_MAX_TAGS 3
|
2006-06-23 03:03:22 -06:00
|
|
|
|
2016-05-20 18:01:42 -06:00
|
|
|
#ifndef RADIX_TREE_MAP_SHIFT
|
2014-04-03 15:47:54 -06:00
|
|
|
#define RADIX_TREE_MAP_SHIFT (CONFIG_BASE_SMALL ? 4 : 6)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#define RADIX_TREE_MAP_SIZE (1UL << RADIX_TREE_MAP_SHIFT)
|
|
|
|
#define RADIX_TREE_MAP_MASK (RADIX_TREE_MAP_SIZE-1)
|
|
|
|
|
|
|
|
#define RADIX_TREE_TAG_LONGS \
|
|
|
|
((RADIX_TREE_MAP_SIZE + BITS_PER_LONG - 1) / BITS_PER_LONG)
|
|
|
|
|
mm: keep page cache radix tree nodes in check
Previously, page cache radix tree nodes were freed after reclaim emptied
out their page pointers. But now reclaim stores shadow entries in their
place, which are only reclaimed when the inodes themselves are
reclaimed. This is problematic for bigger files that are still in use
after they have a significant amount of their cache reclaimed, without
any of those pages actually refaulting. The shadow entries will just
sit there and waste memory. In the worst case, the shadow entries will
accumulate until the machine runs out of memory.
To get this under control, the VM will track radix tree nodes
exclusively containing shadow entries on a per-NUMA node list. Per-NUMA
rather than global because we expect the radix tree nodes themselves to
be allocated node-locally and we want to reduce cross-node references of
otherwise independent cache workloads. A simple shrinker will then
reclaim these nodes on memory pressure.
A few things need to be stored in the radix tree node to implement the
shadow node LRU and allow tree deletions coming from the list:
1. There is no index available that would describe the reverse path
from the node up to the tree root, which is needed to perform a
deletion. To solve this, encode in each node its offset inside the
parent. This can be stored in the unused upper bits of the same
member that stores the node's height at no extra space cost.
2. The number of shadow entries needs to be counted in addition to the
regular entries, to quickly detect when the node is ready to go to
the shadow node LRU list. The current entry count is an unsigned
int but the maximum number of entries is 64, so a shadow counter
can easily be stored in the unused upper bits.
3. Tree modification needs tree lock and tree root, which are located
in the address space, so store an address_space backpointer in the
node. The parent pointer of the node is in a union with the 2-word
rcu_head, so the backpointer comes at no extra cost as well.
4. The node needs to be linked to an LRU list, which requires a list
head inside the node. This does increase the size of the node, but
it does not change the number of objects that fit into a slab page.
[akpm@linux-foundation.org: export the right function]
Signed-off-by: Johannes Weiner <hannes@cmpxchg.org>
Reviewed-by: Rik van Riel <riel@redhat.com>
Reviewed-by: Minchan Kim <minchan@kernel.org>
Cc: Andrea Arcangeli <aarcange@redhat.com>
Cc: Bob Liu <bob.liu@oracle.com>
Cc: Christoph Hellwig <hch@infradead.org>
Cc: Dave Chinner <david@fromorbit.com>
Cc: Greg Thelen <gthelen@google.com>
Cc: Hugh Dickins <hughd@google.com>
Cc: Jan Kara <jack@suse.cz>
Cc: KOSAKI Motohiro <kosaki.motohiro@jp.fujitsu.com>
Cc: Luigi Semenzato <semenzato@google.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Metin Doslu <metin@citusdata.com>
Cc: Michel Lespinasse <walken@google.com>
Cc: Ozgun Erdogan <ozgun@citusdata.com>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Roman Gushchin <klamm@yandex-team.ru>
Cc: Ryan Mallon <rmallon@gmail.com>
Cc: Tejun Heo <tj@kernel.org>
Cc: Vlastimil Babka <vbabka@suse.cz>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2014-04-03 15:47:56 -06:00
|
|
|
#define RADIX_TREE_INDEX_BITS (8 /* CHAR_BIT */ * sizeof(unsigned long))
|
|
|
|
#define RADIX_TREE_MAX_PATH (DIV_ROUND_UP(RADIX_TREE_INDEX_BITS, \
|
|
|
|
RADIX_TREE_MAP_SHIFT))
|
|
|
|
|
|
|
|
/* Internally used bits of node->count */
|
|
|
|
#define RADIX_TREE_COUNT_SHIFT (RADIX_TREE_MAP_SHIFT + 1)
|
|
|
|
#define RADIX_TREE_COUNT_MASK ((1UL << RADIX_TREE_COUNT_SHIFT) - 1)
|
|
|
|
|
2014-04-03 15:47:54 -06:00
|
|
|
struct radix_tree_node {
|
2016-05-20 18:03:10 -06:00
|
|
|
unsigned char shift; /* Bits remaining in each slot */
|
2016-05-20 18:03:07 -06:00
|
|
|
unsigned char offset; /* Slot offset in parent */
|
2014-04-03 15:47:54 -06:00
|
|
|
unsigned int count;
|
|
|
|
union {
|
mm: keep page cache radix tree nodes in check
Previously, page cache radix tree nodes were freed after reclaim emptied
out their page pointers. But now reclaim stores shadow entries in their
place, which are only reclaimed when the inodes themselves are
reclaimed. This is problematic for bigger files that are still in use
after they have a significant amount of their cache reclaimed, without
any of those pages actually refaulting. The shadow entries will just
sit there and waste memory. In the worst case, the shadow entries will
accumulate until the machine runs out of memory.
To get this under control, the VM will track radix tree nodes
exclusively containing shadow entries on a per-NUMA node list. Per-NUMA
rather than global because we expect the radix tree nodes themselves to
be allocated node-locally and we want to reduce cross-node references of
otherwise independent cache workloads. A simple shrinker will then
reclaim these nodes on memory pressure.
A few things need to be stored in the radix tree node to implement the
shadow node LRU and allow tree deletions coming from the list:
1. There is no index available that would describe the reverse path
from the node up to the tree root, which is needed to perform a
deletion. To solve this, encode in each node its offset inside the
parent. This can be stored in the unused upper bits of the same
member that stores the node's height at no extra space cost.
2. The number of shadow entries needs to be counted in addition to the
regular entries, to quickly detect when the node is ready to go to
the shadow node LRU list. The current entry count is an unsigned
int but the maximum number of entries is 64, so a shadow counter
can easily be stored in the unused upper bits.
3. Tree modification needs tree lock and tree root, which are located
in the address space, so store an address_space backpointer in the
node. The parent pointer of the node is in a union with the 2-word
rcu_head, so the backpointer comes at no extra cost as well.
4. The node needs to be linked to an LRU list, which requires a list
head inside the node. This does increase the size of the node, but
it does not change the number of objects that fit into a slab page.
[akpm@linux-foundation.org: export the right function]
Signed-off-by: Johannes Weiner <hannes@cmpxchg.org>
Reviewed-by: Rik van Riel <riel@redhat.com>
Reviewed-by: Minchan Kim <minchan@kernel.org>
Cc: Andrea Arcangeli <aarcange@redhat.com>
Cc: Bob Liu <bob.liu@oracle.com>
Cc: Christoph Hellwig <hch@infradead.org>
Cc: Dave Chinner <david@fromorbit.com>
Cc: Greg Thelen <gthelen@google.com>
Cc: Hugh Dickins <hughd@google.com>
Cc: Jan Kara <jack@suse.cz>
Cc: KOSAKI Motohiro <kosaki.motohiro@jp.fujitsu.com>
Cc: Luigi Semenzato <semenzato@google.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Metin Doslu <metin@citusdata.com>
Cc: Michel Lespinasse <walken@google.com>
Cc: Ozgun Erdogan <ozgun@citusdata.com>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Roman Gushchin <klamm@yandex-team.ru>
Cc: Ryan Mallon <rmallon@gmail.com>
Cc: Tejun Heo <tj@kernel.org>
Cc: Vlastimil Babka <vbabka@suse.cz>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2014-04-03 15:47:56 -06:00
|
|
|
struct {
|
|
|
|
/* Used when ascending tree */
|
|
|
|
struct radix_tree_node *parent;
|
|
|
|
/* For tree user */
|
|
|
|
void *private_data;
|
|
|
|
};
|
|
|
|
/* Used when freeing node */
|
|
|
|
struct rcu_head rcu_head;
|
2014-04-03 15:47:54 -06:00
|
|
|
};
|
mm: keep page cache radix tree nodes in check
Previously, page cache radix tree nodes were freed after reclaim emptied
out their page pointers. But now reclaim stores shadow entries in their
place, which are only reclaimed when the inodes themselves are
reclaimed. This is problematic for bigger files that are still in use
after they have a significant amount of their cache reclaimed, without
any of those pages actually refaulting. The shadow entries will just
sit there and waste memory. In the worst case, the shadow entries will
accumulate until the machine runs out of memory.
To get this under control, the VM will track radix tree nodes
exclusively containing shadow entries on a per-NUMA node list. Per-NUMA
rather than global because we expect the radix tree nodes themselves to
be allocated node-locally and we want to reduce cross-node references of
otherwise independent cache workloads. A simple shrinker will then
reclaim these nodes on memory pressure.
A few things need to be stored in the radix tree node to implement the
shadow node LRU and allow tree deletions coming from the list:
1. There is no index available that would describe the reverse path
from the node up to the tree root, which is needed to perform a
deletion. To solve this, encode in each node its offset inside the
parent. This can be stored in the unused upper bits of the same
member that stores the node's height at no extra space cost.
2. The number of shadow entries needs to be counted in addition to the
regular entries, to quickly detect when the node is ready to go to
the shadow node LRU list. The current entry count is an unsigned
int but the maximum number of entries is 64, so a shadow counter
can easily be stored in the unused upper bits.
3. Tree modification needs tree lock and tree root, which are located
in the address space, so store an address_space backpointer in the
node. The parent pointer of the node is in a union with the 2-word
rcu_head, so the backpointer comes at no extra cost as well.
4. The node needs to be linked to an LRU list, which requires a list
head inside the node. This does increase the size of the node, but
it does not change the number of objects that fit into a slab page.
[akpm@linux-foundation.org: export the right function]
Signed-off-by: Johannes Weiner <hannes@cmpxchg.org>
Reviewed-by: Rik van Riel <riel@redhat.com>
Reviewed-by: Minchan Kim <minchan@kernel.org>
Cc: Andrea Arcangeli <aarcange@redhat.com>
Cc: Bob Liu <bob.liu@oracle.com>
Cc: Christoph Hellwig <hch@infradead.org>
Cc: Dave Chinner <david@fromorbit.com>
Cc: Greg Thelen <gthelen@google.com>
Cc: Hugh Dickins <hughd@google.com>
Cc: Jan Kara <jack@suse.cz>
Cc: KOSAKI Motohiro <kosaki.motohiro@jp.fujitsu.com>
Cc: Luigi Semenzato <semenzato@google.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Metin Doslu <metin@citusdata.com>
Cc: Michel Lespinasse <walken@google.com>
Cc: Ozgun Erdogan <ozgun@citusdata.com>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Roman Gushchin <klamm@yandex-team.ru>
Cc: Ryan Mallon <rmallon@gmail.com>
Cc: Tejun Heo <tj@kernel.org>
Cc: Vlastimil Babka <vbabka@suse.cz>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2014-04-03 15:47:56 -06:00
|
|
|
/* For tree user */
|
|
|
|
struct list_head private_list;
|
2014-04-03 15:47:54 -06:00
|
|
|
void __rcu *slots[RADIX_TREE_MAP_SIZE];
|
|
|
|
unsigned long tags[RADIX_TREE_MAX_TAGS][RADIX_TREE_TAG_LONGS];
|
|
|
|
};
|
|
|
|
|
2006-06-23 03:03:22 -06:00
|
|
|
/* root tags are stored in gfp_mask, shifted by __GFP_BITS_SHIFT */
|
2005-04-16 16:20:36 -06:00
|
|
|
struct radix_tree_root {
|
2005-10-21 01:18:50 -06:00
|
|
|
gfp_t gfp_mask;
|
2010-02-25 15:43:52 -07:00
|
|
|
struct radix_tree_node __rcu *rnode;
|
2005-04-16 16:20:36 -06:00
|
|
|
};
|
|
|
|
|
|
|
|
#define RADIX_TREE_INIT(mask) { \
|
|
|
|
.gfp_mask = (mask), \
|
|
|
|
.rnode = NULL, \
|
|
|
|
}
|
|
|
|
|
|
|
|
#define RADIX_TREE(name, mask) \
|
|
|
|
struct radix_tree_root name = RADIX_TREE_INIT(mask)
|
|
|
|
|
|
|
|
#define INIT_RADIX_TREE(root, mask) \
|
|
|
|
do { \
|
|
|
|
(root)->gfp_mask = (mask); \
|
|
|
|
(root)->rnode = NULL; \
|
|
|
|
} while (0)
|
|
|
|
|
radix-tree: introduce radix_tree_empty
Commit e61452365372 ("radix_tree: add support for multi-order entries")
left the impression that the support for multiorder radix tree entries
was functional. As soon as Ross tried to use it, it became apparent
that my testing was completely inadequate, and it didn't even work a
little bit for orders that were not a multiple of shift.
This series of patches is the result of about 6 weeks of redesign,
reimplementation, testing, arguing and hair-pulling. The great news is
that the test-suite is now far better than it was. That's reflected in
the diffstat for the test-suite alone:
12 files changed, 436 insertions(+), 28 deletions(-)
The highlight for users of the tree is that the restriction on the order
of inserted entries being >= RADIX_TREE_MAP_SHIFT is now gone; the radix
tree now supports any order between 0 and 64.
For those who are interested in how the tree works, patch 9 is probably
the most interesting one as it introduces the new machinery for handling
sibling entries.
I've tried to be fair in attributing authorship to the person who
contributed the majority of the code in each patch; Ross has been an
invaluable partner in the development of this support and it's fair to
say that each of us has code in every commit.
I should also express my appreciation of the 0day testing. It prompted
me that I was bloating the tinyconfig in an unacceptable way, and it
bisected to a commit which contained a rather nasty memory-corruption
bug.
This patch (of 29):
The irqdomain code was checking for 0 or 1 entries, not 0 entries like
the comment said they were. Introduce a new helper that will actually
check for an empty tree.
Signed-off-by: Matthew Wilcox <willy@linux.intel.com>
Reviewed-by: Ross Zwisler <ross.zwisler@linux.intel.com>
Reviewed-by: Jan Kara <jack@suse.cz>
Cc: Konstantin Khlebnikov <koct9i@gmail.com>
Cc: Kirill Shutemov <kirill.shutemov@linux.intel.com>
Cc: Neil Brown <neilb@suse.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2016-05-20 18:01:33 -06:00
|
|
|
static inline bool radix_tree_empty(struct radix_tree_root *root)
|
|
|
|
{
|
|
|
|
return root->rnode == NULL;
|
|
|
|
}
|
|
|
|
|
2006-12-06 21:33:44 -07:00
|
|
|
/**
|
|
|
|
* Radix-tree synchronization
|
|
|
|
*
|
|
|
|
* The radix-tree API requires that users provide all synchronisation (with
|
|
|
|
* specific exceptions, noted below).
|
|
|
|
*
|
|
|
|
* Synchronization of access to the data items being stored in the tree, and
|
|
|
|
* management of their lifetimes must be completely managed by API users.
|
|
|
|
*
|
|
|
|
* For API usage, in general,
|
2007-05-09 00:57:56 -06:00
|
|
|
* - any function _modifying_ the tree or tags (inserting or deleting
|
2008-02-03 07:12:47 -07:00
|
|
|
* items, setting or clearing tags) must exclude other modifications, and
|
2006-12-06 21:33:44 -07:00
|
|
|
* exclude any functions reading the tree.
|
2007-05-09 00:57:56 -06:00
|
|
|
* - any function _reading_ the tree or tags (looking up items or tags,
|
2006-12-06 21:33:44 -07:00
|
|
|
* gang lookups) must exclude modifications to the tree, but may occur
|
|
|
|
* concurrently with other readers.
|
|
|
|
*
|
|
|
|
* The notable exceptions to this rule are the following functions:
|
2014-04-03 15:47:54 -06:00
|
|
|
* __radix_tree_lookup
|
2006-12-06 21:33:44 -07:00
|
|
|
* radix_tree_lookup
|
2008-07-25 20:45:29 -06:00
|
|
|
* radix_tree_lookup_slot
|
2006-12-06 21:33:44 -07:00
|
|
|
* radix_tree_tag_get
|
|
|
|
* radix_tree_gang_lookup
|
2008-07-25 20:45:29 -06:00
|
|
|
* radix_tree_gang_lookup_slot
|
2006-12-06 21:33:44 -07:00
|
|
|
* radix_tree_gang_lookup_tag
|
2008-07-25 20:45:29 -06:00
|
|
|
* radix_tree_gang_lookup_tag_slot
|
2006-12-06 21:33:44 -07:00
|
|
|
* radix_tree_tagged
|
|
|
|
*
|
2016-01-20 15:59:09 -07:00
|
|
|
* The first 8 functions are able to be called locklessly, using RCU. The
|
2006-12-06 21:33:44 -07:00
|
|
|
* caller must ensure calls to these functions are made within rcu_read_lock()
|
|
|
|
* regions. Other readers (lock-free or otherwise) and modifications may be
|
|
|
|
* running concurrently.
|
|
|
|
*
|
|
|
|
* It is still required that the caller manage the synchronization and lifetimes
|
|
|
|
* of the items. So if RCU lock-free lookups are used, typically this would mean
|
|
|
|
* that the items have their own locks, or are amenable to lock-free access; and
|
|
|
|
* that the items are freed by RCU (or only freed after having been deleted from
|
|
|
|
* the radix tree *and* a synchronize_rcu() grace period).
|
|
|
|
*
|
|
|
|
* (Note, rcu_assign_pointer and rcu_dereference are not needed to control
|
|
|
|
* access to data items when inserting into or looking up from the radix tree)
|
|
|
|
*
|
radix_tree_tag_get() is not as safe as the docs make out [ver #2]
radix_tree_tag_get() is not safe to use concurrently with radix_tree_tag_set()
or radix_tree_tag_clear(). The problem is that the double tag_get() in
radix_tree_tag_get():
if (!tag_get(node, tag, offset))
saw_unset_tag = 1;
if (height == 1) {
int ret = tag_get(node, tag, offset);
may see the value change due to the action of set/clear. RCU is no protection
against this as no pointers are being changed, no nodes are being replaced
according to a COW protocol - set/clear alter the node directly.
The documentation in linux/radix-tree.h, however, says that
radix_tree_tag_get() is an exception to the rule that "any function modifying
the tree or tags (...) must exclude other modifications, and exclude any
functions reading the tree".
The problem is that the next statement in radix_tree_tag_get() checks that the
tag doesn't vary over time:
BUG_ON(ret && saw_unset_tag);
This has been seen happening in FS-Cache:
https://www.redhat.com/archives/linux-cachefs/2010-April/msg00013.html
To this end, remove the BUG_ON() from radix_tree_tag_get() and note in various
comments that the value of the tag may change whilst the RCU read lock is held,
and thus that the return value of radix_tree_tag_get() may not be relied upon
unless radix_tree_tag_set/clear() and radix_tree_delete() are excluded from
running concurrently with it.
Reported-by: Romain DEGEZ <romain.degez@smartjog.com>
Signed-off-by: David Howells <dhowells@redhat.com>
Acked-by: Nick Piggin <npiggin@suse.de>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2010-04-06 15:36:20 -06:00
|
|
|
* Note that the value returned by radix_tree_tag_get() may not be relied upon
|
|
|
|
* if only the RCU read lock is held. Functions to set/clear tags and to
|
|
|
|
* delete nodes running concurrently with it may affect its result such that
|
|
|
|
* two consecutive reads in the same locked section may return different
|
|
|
|
* values. If reliability is required, modification functions must also be
|
|
|
|
* excluded from concurrency.
|
|
|
|
*
|
2006-12-06 21:33:44 -07:00
|
|
|
* radix_tree_tagged is able to be called without locking or RCU.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_deref_slot - dereference a slot
|
|
|
|
* @pslot: pointer to slot, returned by radix_tree_lookup_slot
|
|
|
|
* Returns: item that was stored in that slot with any direct pointer flag
|
|
|
|
* removed.
|
|
|
|
*
|
|
|
|
* For use with radix_tree_lookup_slot(). Caller must hold tree at least read
|
2010-11-11 15:05:19 -07:00
|
|
|
* locked across slot lookup and dereference. Not required if write lock is
|
|
|
|
* held (ie. items cannot be concurrently inserted).
|
|
|
|
*
|
|
|
|
* radix_tree_deref_retry must be used to confirm validity of the pointer if
|
|
|
|
* only the read lock is held.
|
2006-12-06 21:33:44 -07:00
|
|
|
*/
|
|
|
|
static inline void *radix_tree_deref_slot(void **pslot)
|
|
|
|
{
|
2010-11-11 15:05:19 -07:00
|
|
|
return rcu_dereference(*pslot);
|
2006-12-06 21:33:44 -07:00
|
|
|
}
|
2010-11-11 15:05:19 -07:00
|
|
|
|
2011-01-13 16:47:21 -07:00
|
|
|
/**
|
|
|
|
* radix_tree_deref_slot_protected - dereference a slot without RCU lock but with tree lock held
|
|
|
|
* @pslot: pointer to slot, returned by radix_tree_lookup_slot
|
|
|
|
* Returns: item that was stored in that slot with any direct pointer flag
|
|
|
|
* removed.
|
|
|
|
*
|
|
|
|
* Similar to radix_tree_deref_slot but only used during migration when a pages
|
|
|
|
* mapping is being moved. The caller does not hold the RCU read lock but it
|
|
|
|
* must hold the tree lock to prevent parallel updates.
|
|
|
|
*/
|
|
|
|
static inline void *radix_tree_deref_slot_protected(void **pslot,
|
|
|
|
spinlock_t *treelock)
|
|
|
|
{
|
|
|
|
return rcu_dereference_protected(*pslot, lockdep_is_held(treelock));
|
|
|
|
}
|
|
|
|
|
2010-11-11 15:05:19 -07:00
|
|
|
/**
|
|
|
|
* radix_tree_deref_retry - check radix_tree_deref_slot
|
|
|
|
* @arg: pointer returned by radix_tree_deref_slot
|
|
|
|
* Returns: 0 if retry is not required, otherwise retry is required
|
|
|
|
*
|
|
|
|
* radix_tree_deref_retry must be used with radix_tree_deref_slot.
|
|
|
|
*/
|
|
|
|
static inline int radix_tree_deref_retry(void *arg)
|
|
|
|
{
|
2016-05-20 18:03:22 -06:00
|
|
|
return unlikely(radix_tree_is_indirect_ptr(arg));
|
2010-11-11 15:05:19 -07:00
|
|
|
}
|
|
|
|
|
radix_tree: exceptional entries and indices
A patchset to extend tmpfs to MAX_LFS_FILESIZE by abandoning its
peculiar swap vector, instead keeping a file's swap entries in the same
radix tree as its struct page pointers: thus saving memory, and
simplifying its code and locking.
This patch:
The radix_tree is used by several subsystems for different purposes. A
major use is to store the struct page pointers of a file's pagecache for
memory management. But what if mm wanted to store something other than
page pointers there too?
The low bit of a radix_tree entry is already used to denote an indirect
pointer, for internal use, and the unlikely radix_tree_deref_retry()
case.
Define the next bit as denoting an exceptional entry, and supply inline
functions radix_tree_exception() to return non-0 in either unlikely
case, and radix_tree_exceptional_entry() to return non-0 in the second
case.
If a subsystem already uses radix_tree with that bit set, no problem: it
does not affect internal workings at all, but is defined for the
convenience of those storing well-aligned pointers in the radix_tree.
The radix_tree_gang_lookups have an implicit assumption that the caller
can deduce the offset of each entry returned e.g. by the page->index of
a struct page. But that may not be feasible for some kinds of item to
be stored there.
radix_tree_gang_lookup_slot() allow for an optional indices argument,
output array in which to return those offsets. The same could be added
to other radix_tree_gang_lookups, but for now keep it to the only one
for which we need it.
Signed-off-by: Hugh Dickins <hughd@google.com>
Acked-by: Rik van Riel <riel@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-08-03 17:21:18 -06:00
|
|
|
/**
|
|
|
|
* radix_tree_exceptional_entry - radix_tree_deref_slot gave exceptional entry?
|
|
|
|
* @arg: value returned by radix_tree_deref_slot
|
|
|
|
* Returns: 0 if well-aligned pointer, non-0 if exceptional entry.
|
|
|
|
*/
|
|
|
|
static inline int radix_tree_exceptional_entry(void *arg)
|
|
|
|
{
|
|
|
|
/* Not unlikely because radix_tree_exception often tested first */
|
|
|
|
return (unsigned long)arg & RADIX_TREE_EXCEPTIONAL_ENTRY;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_exception - radix_tree_deref_slot returned either exception?
|
|
|
|
* @arg: value returned by radix_tree_deref_slot
|
|
|
|
* Returns: 0 if well-aligned pointer, non-0 if either kind of exception.
|
|
|
|
*/
|
|
|
|
static inline int radix_tree_exception(void *arg)
|
|
|
|
{
|
|
|
|
return unlikely((unsigned long)arg &
|
2016-05-20 18:03:22 -06:00
|
|
|
(RADIX_TREE_INTERNAL_NODE | RADIX_TREE_EXCEPTIONAL_ENTRY));
|
radix_tree: exceptional entries and indices
A patchset to extend tmpfs to MAX_LFS_FILESIZE by abandoning its
peculiar swap vector, instead keeping a file's swap entries in the same
radix tree as its struct page pointers: thus saving memory, and
simplifying its code and locking.
This patch:
The radix_tree is used by several subsystems for different purposes. A
major use is to store the struct page pointers of a file's pagecache for
memory management. But what if mm wanted to store something other than
page pointers there too?
The low bit of a radix_tree entry is already used to denote an indirect
pointer, for internal use, and the unlikely radix_tree_deref_retry()
case.
Define the next bit as denoting an exceptional entry, and supply inline
functions radix_tree_exception() to return non-0 in either unlikely
case, and radix_tree_exceptional_entry() to return non-0 in the second
case.
If a subsystem already uses radix_tree with that bit set, no problem: it
does not affect internal workings at all, but is defined for the
convenience of those storing well-aligned pointers in the radix_tree.
The radix_tree_gang_lookups have an implicit assumption that the caller
can deduce the offset of each entry returned e.g. by the page->index of
a struct page. But that may not be feasible for some kinds of item to
be stored there.
radix_tree_gang_lookup_slot() allow for an optional indices argument,
output array in which to return those offsets. The same could be added
to other radix_tree_gang_lookups, but for now keep it to the only one
for which we need it.
Signed-off-by: Hugh Dickins <hughd@google.com>
Acked-by: Rik van Riel <riel@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-08-03 17:21:18 -06:00
|
|
|
}
|
|
|
|
|
2006-12-06 21:33:44 -07:00
|
|
|
/**
|
|
|
|
* radix_tree_replace_slot - replace item in a slot
|
|
|
|
* @pslot: pointer to slot, returned by radix_tree_lookup_slot
|
|
|
|
* @item: new item to store in the slot.
|
|
|
|
*
|
|
|
|
* For use with radix_tree_lookup_slot(). Caller must hold tree write locked
|
|
|
|
* across slot lookup and replacement.
|
|
|
|
*/
|
|
|
|
static inline void radix_tree_replace_slot(void **pslot, void *item)
|
|
|
|
{
|
2007-10-16 02:24:42 -06:00
|
|
|
BUG_ON(radix_tree_is_indirect_ptr(item));
|
|
|
|
rcu_assign_pointer(*pslot, item);
|
2006-12-06 21:33:44 -07:00
|
|
|
}
|
|
|
|
|
2014-04-03 15:47:54 -06:00
|
|
|
int __radix_tree_create(struct radix_tree_root *root, unsigned long index,
|
2016-03-17 15:21:54 -06:00
|
|
|
unsigned order, struct radix_tree_node **nodep,
|
|
|
|
void ***slotp);
|
|
|
|
int __radix_tree_insert(struct radix_tree_root *, unsigned long index,
|
|
|
|
unsigned order, void *);
|
|
|
|
static inline int radix_tree_insert(struct radix_tree_root *root,
|
|
|
|
unsigned long index, void *entry)
|
|
|
|
{
|
|
|
|
return __radix_tree_insert(root, index, 0, entry);
|
|
|
|
}
|
2014-04-03 15:47:54 -06:00
|
|
|
void *__radix_tree_lookup(struct radix_tree_root *root, unsigned long index,
|
|
|
|
struct radix_tree_node **nodep, void ***slotp);
|
2005-04-16 16:20:36 -06:00
|
|
|
void *radix_tree_lookup(struct radix_tree_root *, unsigned long);
|
2005-11-07 01:59:29 -07:00
|
|
|
void **radix_tree_lookup_slot(struct radix_tree_root *, unsigned long);
|
mm: keep page cache radix tree nodes in check
Previously, page cache radix tree nodes were freed after reclaim emptied
out their page pointers. But now reclaim stores shadow entries in their
place, which are only reclaimed when the inodes themselves are
reclaimed. This is problematic for bigger files that are still in use
after they have a significant amount of their cache reclaimed, without
any of those pages actually refaulting. The shadow entries will just
sit there and waste memory. In the worst case, the shadow entries will
accumulate until the machine runs out of memory.
To get this under control, the VM will track radix tree nodes
exclusively containing shadow entries on a per-NUMA node list. Per-NUMA
rather than global because we expect the radix tree nodes themselves to
be allocated node-locally and we want to reduce cross-node references of
otherwise independent cache workloads. A simple shrinker will then
reclaim these nodes on memory pressure.
A few things need to be stored in the radix tree node to implement the
shadow node LRU and allow tree deletions coming from the list:
1. There is no index available that would describe the reverse path
from the node up to the tree root, which is needed to perform a
deletion. To solve this, encode in each node its offset inside the
parent. This can be stored in the unused upper bits of the same
member that stores the node's height at no extra space cost.
2. The number of shadow entries needs to be counted in addition to the
regular entries, to quickly detect when the node is ready to go to
the shadow node LRU list. The current entry count is an unsigned
int but the maximum number of entries is 64, so a shadow counter
can easily be stored in the unused upper bits.
3. Tree modification needs tree lock and tree root, which are located
in the address space, so store an address_space backpointer in the
node. The parent pointer of the node is in a union with the 2-word
rcu_head, so the backpointer comes at no extra cost as well.
4. The node needs to be linked to an LRU list, which requires a list
head inside the node. This does increase the size of the node, but
it does not change the number of objects that fit into a slab page.
[akpm@linux-foundation.org: export the right function]
Signed-off-by: Johannes Weiner <hannes@cmpxchg.org>
Reviewed-by: Rik van Riel <riel@redhat.com>
Reviewed-by: Minchan Kim <minchan@kernel.org>
Cc: Andrea Arcangeli <aarcange@redhat.com>
Cc: Bob Liu <bob.liu@oracle.com>
Cc: Christoph Hellwig <hch@infradead.org>
Cc: Dave Chinner <david@fromorbit.com>
Cc: Greg Thelen <gthelen@google.com>
Cc: Hugh Dickins <hughd@google.com>
Cc: Jan Kara <jack@suse.cz>
Cc: KOSAKI Motohiro <kosaki.motohiro@jp.fujitsu.com>
Cc: Luigi Semenzato <semenzato@google.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Metin Doslu <metin@citusdata.com>
Cc: Michel Lespinasse <walken@google.com>
Cc: Ozgun Erdogan <ozgun@citusdata.com>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Roman Gushchin <klamm@yandex-team.ru>
Cc: Ryan Mallon <rmallon@gmail.com>
Cc: Tejun Heo <tj@kernel.org>
Cc: Vlastimil Babka <vbabka@suse.cz>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2014-04-03 15:47:56 -06:00
|
|
|
bool __radix_tree_delete_node(struct radix_tree_root *root,
|
2014-04-03 15:47:54 -06:00
|
|
|
struct radix_tree_node *node);
|
2014-04-03 15:47:39 -06:00
|
|
|
void *radix_tree_delete_item(struct radix_tree_root *, unsigned long, void *);
|
2005-04-16 16:20:36 -06:00
|
|
|
void *radix_tree_delete(struct radix_tree_root *, unsigned long);
|
|
|
|
unsigned int
|
|
|
|
radix_tree_gang_lookup(struct radix_tree_root *root, void **results,
|
|
|
|
unsigned long first_index, unsigned int max_items);
|
radix_tree: exceptional entries and indices
A patchset to extend tmpfs to MAX_LFS_FILESIZE by abandoning its
peculiar swap vector, instead keeping a file's swap entries in the same
radix tree as its struct page pointers: thus saving memory, and
simplifying its code and locking.
This patch:
The radix_tree is used by several subsystems for different purposes. A
major use is to store the struct page pointers of a file's pagecache for
memory management. But what if mm wanted to store something other than
page pointers there too?
The low bit of a radix_tree entry is already used to denote an indirect
pointer, for internal use, and the unlikely radix_tree_deref_retry()
case.
Define the next bit as denoting an exceptional entry, and supply inline
functions radix_tree_exception() to return non-0 in either unlikely
case, and radix_tree_exceptional_entry() to return non-0 in the second
case.
If a subsystem already uses radix_tree with that bit set, no problem: it
does not affect internal workings at all, but is defined for the
convenience of those storing well-aligned pointers in the radix_tree.
The radix_tree_gang_lookups have an implicit assumption that the caller
can deduce the offset of each entry returned e.g. by the page->index of
a struct page. But that may not be feasible for some kinds of item to
be stored there.
radix_tree_gang_lookup_slot() allow for an optional indices argument,
output array in which to return those offsets. The same could be added
to other radix_tree_gang_lookups, but for now keep it to the only one
for which we need it.
Signed-off-by: Hugh Dickins <hughd@google.com>
Acked-by: Rik van Riel <riel@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-08-03 17:21:18 -06:00
|
|
|
unsigned int radix_tree_gang_lookup_slot(struct radix_tree_root *root,
|
|
|
|
void ***results, unsigned long *indices,
|
2008-07-25 20:45:29 -06:00
|
|
|
unsigned long first_index, unsigned int max_items);
|
2005-10-07 00:46:04 -06:00
|
|
|
int radix_tree_preload(gfp_t gfp_mask);
|
2013-09-11 15:26:05 -06:00
|
|
|
int radix_tree_maybe_preload(gfp_t gfp_mask);
|
2005-04-16 16:20:36 -06:00
|
|
|
void radix_tree_init(void);
|
|
|
|
void *radix_tree_tag_set(struct radix_tree_root *root,
|
2006-03-25 04:08:05 -07:00
|
|
|
unsigned long index, unsigned int tag);
|
2005-04-16 16:20:36 -06:00
|
|
|
void *radix_tree_tag_clear(struct radix_tree_root *root,
|
2006-03-25 04:08:05 -07:00
|
|
|
unsigned long index, unsigned int tag);
|
2005-04-16 16:20:36 -06:00
|
|
|
int radix_tree_tag_get(struct radix_tree_root *root,
|
2006-03-25 04:08:05 -07:00
|
|
|
unsigned long index, unsigned int tag);
|
2005-04-16 16:20:36 -06:00
|
|
|
unsigned int
|
|
|
|
radix_tree_gang_lookup_tag(struct radix_tree_root *root, void **results,
|
2006-03-25 04:08:05 -07:00
|
|
|
unsigned long first_index, unsigned int max_items,
|
|
|
|
unsigned int tag);
|
2008-07-25 20:45:29 -06:00
|
|
|
unsigned int
|
|
|
|
radix_tree_gang_lookup_tag_slot(struct radix_tree_root *root, void ***results,
|
|
|
|
unsigned long first_index, unsigned int max_items,
|
|
|
|
unsigned int tag);
|
2010-08-09 18:19:11 -06:00
|
|
|
unsigned long radix_tree_range_tag_if_tagged(struct radix_tree_root *root,
|
|
|
|
unsigned long *first_indexp, unsigned long last_index,
|
|
|
|
unsigned long nr_to_tag,
|
|
|
|
unsigned int fromtag, unsigned int totag);
|
2006-03-25 04:08:05 -07:00
|
|
|
int radix_tree_tagged(struct radix_tree_root *root, unsigned int tag);
|
tmpfs radix_tree: locate_item to speed up swapoff
We have already acknowledged that swapoff of a tmpfs file is slower than
it was before conversion to the generic radix_tree: a little slower
there will be acceptable, if the hotter paths are faster.
But it was a shock to find swapoff of a 500MB file 20 times slower on my
laptop, taking 10 minutes; and at that rate it significantly slows down
my testing.
Now, most of that turned out to be overhead from PROVE_LOCKING and
PROVE_RCU: without those it was only 4 times slower than before; and
more realistic tests on other machines don't fare as badly.
I've tried a number of things to improve it, including tagging the swap
entries, then doing lookup by tag: I'd expected that to halve the time,
but in practice it's erratic, and often counter-productive.
The only change I've so far found to make a consistent improvement, is
to short-circuit the way we go back and forth, gang lookup packing
entries into the array supplied, then shmem scanning that array for the
target entry. Scanning in place doubles the speed, so it's now only
twice as slow as before (or three times slower when the PROVEs are on).
So, add radix_tree_locate_item() as an expedient, once-off,
single-caller hack to do the lookup directly in place. #ifdef it on
CONFIG_SHMEM and CONFIG_SWAP, as much to document its limited
applicability as save space in other configurations. And, sadly,
#include sched.h for cond_resched().
Signed-off-by: Hugh Dickins <hughd@google.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-08-03 17:21:27 -06:00
|
|
|
unsigned long radix_tree_locate_item(struct radix_tree_root *root, void *item);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
static inline void radix_tree_preload_end(void)
|
|
|
|
{
|
|
|
|
preempt_enable();
|
|
|
|
}
|
|
|
|
|
2012-03-28 15:42:53 -06:00
|
|
|
/**
|
|
|
|
* struct radix_tree_iter - radix tree iterator state
|
|
|
|
*
|
|
|
|
* @index: index of current slot
|
2016-05-20 18:02:26 -06:00
|
|
|
* @next_index: one beyond the last index for this chunk
|
2012-03-28 15:42:53 -06:00
|
|
|
* @tags: bit-mask for tag-iterating
|
2016-05-20 18:02:26 -06:00
|
|
|
* @shift: shift for the node that holds our slots
|
2012-03-28 15:42:53 -06:00
|
|
|
*
|
|
|
|
* This radix tree iterator works in terms of "chunks" of slots. A chunk is a
|
|
|
|
* subinterval of slots contained within one radix tree leaf node. It is
|
|
|
|
* described by a pointer to its first slot and a struct radix_tree_iter
|
|
|
|
* which holds the chunk's position in the tree and its size. For tagged
|
|
|
|
* iteration radix_tree_iter also holds the slots' bit-mask for one chosen
|
|
|
|
* radix tree tag.
|
|
|
|
*/
|
|
|
|
struct radix_tree_iter {
|
|
|
|
unsigned long index;
|
|
|
|
unsigned long next_index;
|
|
|
|
unsigned long tags;
|
2016-05-20 18:02:26 -06:00
|
|
|
#ifdef CONFIG_RADIX_TREE_MULTIORDER
|
|
|
|
unsigned int shift;
|
|
|
|
#endif
|
2012-03-28 15:42:53 -06:00
|
|
|
};
|
|
|
|
|
2016-05-20 18:02:26 -06:00
|
|
|
static inline unsigned int iter_shift(struct radix_tree_iter *iter)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_RADIX_TREE_MULTIORDER
|
|
|
|
return iter->shift;
|
|
|
|
#else
|
|
|
|
return 0;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2012-03-28 15:42:53 -06:00
|
|
|
#define RADIX_TREE_ITER_TAG_MASK 0x00FF /* tag index in lower byte */
|
|
|
|
#define RADIX_TREE_ITER_TAGGED 0x0100 /* lookup tagged slots */
|
|
|
|
#define RADIX_TREE_ITER_CONTIG 0x0200 /* stop at first hole */
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_iter_init - initialize radix tree iterator
|
|
|
|
*
|
|
|
|
* @iter: pointer to iterator state
|
|
|
|
* @start: iteration starting index
|
|
|
|
* Returns: NULL
|
|
|
|
*/
|
|
|
|
static __always_inline void **
|
|
|
|
radix_tree_iter_init(struct radix_tree_iter *iter, unsigned long start)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Leave iter->tags uninitialized. radix_tree_next_chunk() will fill it
|
|
|
|
* in the case of a successful tagged chunk lookup. If the lookup was
|
|
|
|
* unsuccessful or non-tagged then nobody cares about ->tags.
|
|
|
|
*
|
|
|
|
* Set index to zero to bypass next_index overflow protection.
|
|
|
|
* See the comment in radix_tree_next_chunk() for details.
|
|
|
|
*/
|
|
|
|
iter->index = 0;
|
|
|
|
iter->next_index = start;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_next_chunk - find next chunk of slots for iteration
|
|
|
|
*
|
|
|
|
* @root: radix tree root
|
|
|
|
* @iter: iterator state
|
|
|
|
* @flags: RADIX_TREE_ITER_* flags and tag index
|
|
|
|
* Returns: pointer to chunk first slot, or NULL if there no more left
|
|
|
|
*
|
|
|
|
* This function looks up the next chunk in the radix tree starting from
|
|
|
|
* @iter->next_index. It returns a pointer to the chunk's first slot.
|
|
|
|
* Also it fills @iter with data about chunk: position in the tree (index),
|
|
|
|
* its end (next_index), and constructs a bit mask for tagged iterating (tags).
|
|
|
|
*/
|
|
|
|
void **radix_tree_next_chunk(struct radix_tree_root *root,
|
|
|
|
struct radix_tree_iter *iter, unsigned flags);
|
|
|
|
|
2016-02-02 17:57:52 -07:00
|
|
|
/**
|
|
|
|
* radix_tree_iter_retry - retry this chunk of the iteration
|
|
|
|
* @iter: iterator state
|
|
|
|
*
|
|
|
|
* If we iterate over a tree protected only by the RCU lock, a race
|
|
|
|
* against deletion or creation may result in seeing a slot for which
|
|
|
|
* radix_tree_deref_retry() returns true. If so, call this function
|
|
|
|
* and continue the iteration.
|
|
|
|
*/
|
|
|
|
static inline __must_check
|
|
|
|
void **radix_tree_iter_retry(struct radix_tree_iter *iter)
|
|
|
|
{
|
|
|
|
iter->next_index = iter->index;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2016-05-20 18:02:26 -06:00
|
|
|
static inline unsigned long
|
|
|
|
__radix_tree_iter_add(struct radix_tree_iter *iter, unsigned long slots)
|
|
|
|
{
|
|
|
|
return iter->index + (slots << iter_shift(iter));
|
|
|
|
}
|
|
|
|
|
2016-03-17 15:22:06 -06:00
|
|
|
/**
|
|
|
|
* radix_tree_iter_next - resume iterating when the chunk may be invalid
|
|
|
|
* @iter: iterator state
|
|
|
|
*
|
|
|
|
* If the iterator needs to release then reacquire a lock, the chunk may
|
|
|
|
* have been invalidated by an insertion or deletion. Call this function
|
|
|
|
* to continue the iteration from the next index.
|
|
|
|
*/
|
|
|
|
static inline __must_check
|
|
|
|
void **radix_tree_iter_next(struct radix_tree_iter *iter)
|
|
|
|
{
|
2016-05-20 18:02:26 -06:00
|
|
|
iter->next_index = __radix_tree_iter_add(iter, 1);
|
2016-03-17 15:22:06 -06:00
|
|
|
iter->tags = 0;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2012-03-28 15:42:53 -06:00
|
|
|
/**
|
|
|
|
* radix_tree_chunk_size - get current chunk size
|
|
|
|
*
|
|
|
|
* @iter: pointer to radix tree iterator
|
|
|
|
* Returns: current chunk size
|
|
|
|
*/
|
2016-02-05 16:37:01 -07:00
|
|
|
static __always_inline long
|
2012-03-28 15:42:53 -06:00
|
|
|
radix_tree_chunk_size(struct radix_tree_iter *iter)
|
|
|
|
{
|
2016-05-20 18:02:26 -06:00
|
|
|
return (iter->next_index - iter->index) >> iter_shift(iter);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void *indirect_to_ptr(void *ptr)
|
|
|
|
{
|
2016-05-20 18:03:22 -06:00
|
|
|
return (void *)((unsigned long)ptr & ~RADIX_TREE_INTERNAL_NODE);
|
2012-03-28 15:42:53 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_next_slot - find next slot in chunk
|
|
|
|
*
|
|
|
|
* @slot: pointer to current slot
|
|
|
|
* @iter: pointer to interator state
|
|
|
|
* @flags: RADIX_TREE_ITER_*, should be constant
|
|
|
|
* Returns: pointer to next slot, or NULL if there no more left
|
|
|
|
*
|
|
|
|
* This function updates @iter->index in the case of a successful lookup.
|
|
|
|
* For tagged lookup it also eats @iter->tags.
|
|
|
|
*/
|
|
|
|
static __always_inline void **
|
|
|
|
radix_tree_next_slot(void **slot, struct radix_tree_iter *iter, unsigned flags)
|
|
|
|
{
|
|
|
|
if (flags & RADIX_TREE_ITER_TAGGED) {
|
2016-05-20 18:02:26 -06:00
|
|
|
void *canon = slot;
|
|
|
|
|
2012-03-28 15:42:53 -06:00
|
|
|
iter->tags >>= 1;
|
2016-05-20 18:02:26 -06:00
|
|
|
if (unlikely(!iter->tags))
|
|
|
|
return NULL;
|
|
|
|
while (IS_ENABLED(CONFIG_RADIX_TREE_MULTIORDER) &&
|
|
|
|
radix_tree_is_indirect_ptr(slot[1])) {
|
|
|
|
if (indirect_to_ptr(slot[1]) == canon) {
|
|
|
|
iter->tags >>= 1;
|
|
|
|
iter->index = __radix_tree_iter_add(iter, 1);
|
|
|
|
slot++;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
iter->next_index = __radix_tree_iter_add(iter, 1);
|
|
|
|
return NULL;
|
|
|
|
}
|
2012-03-28 15:42:53 -06:00
|
|
|
if (likely(iter->tags & 1ul)) {
|
2016-05-20 18:02:26 -06:00
|
|
|
iter->index = __radix_tree_iter_add(iter, 1);
|
2012-03-28 15:42:53 -06:00
|
|
|
return slot + 1;
|
|
|
|
}
|
2016-05-20 18:02:26 -06:00
|
|
|
if (!(flags & RADIX_TREE_ITER_CONTIG)) {
|
2012-03-28 15:42:53 -06:00
|
|
|
unsigned offset = __ffs(iter->tags);
|
|
|
|
|
|
|
|
iter->tags >>= offset;
|
2016-05-20 18:02:26 -06:00
|
|
|
iter->index = __radix_tree_iter_add(iter, offset + 1);
|
2012-03-28 15:42:53 -06:00
|
|
|
return slot + offset + 1;
|
|
|
|
}
|
|
|
|
} else {
|
2016-05-20 18:02:26 -06:00
|
|
|
long count = radix_tree_chunk_size(iter);
|
|
|
|
void *canon = slot;
|
2012-03-28 15:42:53 -06:00
|
|
|
|
2016-05-20 18:02:26 -06:00
|
|
|
while (--count > 0) {
|
2012-03-28 15:42:53 -06:00
|
|
|
slot++;
|
2016-05-20 18:02:26 -06:00
|
|
|
iter->index = __radix_tree_iter_add(iter, 1);
|
|
|
|
|
|
|
|
if (IS_ENABLED(CONFIG_RADIX_TREE_MULTIORDER) &&
|
|
|
|
radix_tree_is_indirect_ptr(*slot)) {
|
|
|
|
if (indirect_to_ptr(*slot) == canon)
|
|
|
|
continue;
|
|
|
|
else {
|
|
|
|
iter->next_index = iter->index;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-03-28 15:42:53 -06:00
|
|
|
if (likely(*slot))
|
|
|
|
return slot;
|
2012-06-05 11:36:33 -06:00
|
|
|
if (flags & RADIX_TREE_ITER_CONTIG) {
|
|
|
|
/* forbid switching to the next chunk */
|
|
|
|
iter->next_index = 0;
|
2012-03-28 15:42:53 -06:00
|
|
|
break;
|
2012-06-05 11:36:33 -06:00
|
|
|
}
|
2012-03-28 15:42:53 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_for_each_slot - iterate over non-empty slots
|
|
|
|
*
|
|
|
|
* @slot: the void** variable for pointer to slot
|
|
|
|
* @root: the struct radix_tree_root pointer
|
|
|
|
* @iter: the struct radix_tree_iter pointer
|
|
|
|
* @start: iteration starting index
|
|
|
|
*
|
|
|
|
* @slot points to radix tree slot, @iter->index contains its index.
|
|
|
|
*/
|
|
|
|
#define radix_tree_for_each_slot(slot, root, iter, start) \
|
|
|
|
for (slot = radix_tree_iter_init(iter, start) ; \
|
|
|
|
slot || (slot = radix_tree_next_chunk(root, iter, 0)) ; \
|
|
|
|
slot = radix_tree_next_slot(slot, iter, 0))
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_for_each_contig - iterate over contiguous slots
|
|
|
|
*
|
|
|
|
* @slot: the void** variable for pointer to slot
|
|
|
|
* @root: the struct radix_tree_root pointer
|
|
|
|
* @iter: the struct radix_tree_iter pointer
|
|
|
|
* @start: iteration starting index
|
|
|
|
*
|
|
|
|
* @slot points to radix tree slot, @iter->index contains its index.
|
|
|
|
*/
|
|
|
|
#define radix_tree_for_each_contig(slot, root, iter, start) \
|
|
|
|
for (slot = radix_tree_iter_init(iter, start) ; \
|
|
|
|
slot || (slot = radix_tree_next_chunk(root, iter, \
|
|
|
|
RADIX_TREE_ITER_CONTIG)) ; \
|
|
|
|
slot = radix_tree_next_slot(slot, iter, \
|
|
|
|
RADIX_TREE_ITER_CONTIG))
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_for_each_tagged - iterate over tagged slots
|
|
|
|
*
|
|
|
|
* @slot: the void** variable for pointer to slot
|
|
|
|
* @root: the struct radix_tree_root pointer
|
|
|
|
* @iter: the struct radix_tree_iter pointer
|
|
|
|
* @start: iteration starting index
|
|
|
|
* @tag: tag index
|
|
|
|
*
|
|
|
|
* @slot points to radix tree slot, @iter->index contains its index.
|
|
|
|
*/
|
|
|
|
#define radix_tree_for_each_tagged(slot, root, iter, start, tag) \
|
|
|
|
for (slot = radix_tree_iter_init(iter, start) ; \
|
|
|
|
slot || (slot = radix_tree_next_chunk(root, iter, \
|
|
|
|
RADIX_TREE_ITER_TAGGED | tag)) ; \
|
|
|
|
slot = radix_tree_next_slot(slot, iter, \
|
|
|
|
RADIX_TREE_ITER_TAGGED))
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
#endif /* _LINUX_RADIX_TREE_H */
|