From: Matthew Wilcox <wi...@linux.intel.com>
all_tag_set() sets every tag on a node. This is useful for the IDR code
when we're creating new nodes which contain only free slots.
Signed-off-by: Matthew Wilcox <wi...@linux.intel.com>
---
lib/radix-tree.c | 8 +++++++-
1 file changed, 7 insertions(+), 1 deletion(-)
diff --git a/lib/radix-tree.c b/lib/radix-tree.c
index c8ef657..e063ca2 100644
--- a/lib/radix-tree.c
+++ b/lib/radix-tree.c
@@ -22,6 +22,8 @@
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
+#include <linux/bitmap.h>
+#include <linux/bitops.h>
#include <linux/errno.h>
#include <linux/init.h>
#include <linux/kernel.h>
@@ -33,7 +35,6 @@
#include <linux/notifier.h>
#include <linux/cpu.h>
#include <linux/string.h>
-#include <linux/bitops.h>
#include <linux/rcupdate.h>
#include <linux/preempt.h> /* in_interrupt() */
@@ -184,6 +185,11 @@ static inline int any_tag_set(struct radix_tree_node
*node, unsigned int tag)
return 0;
}
+static inline void all_tag_set(struct radix_tree_node *node, unsigned int tag)
+{
+ bitmap_fill(node->tags[tag], RADIX_TREE_MAP_SIZE);
+}
+
/**
* radix_tree_find_next_bit - find the next set bit in a memory region
*
--
2.10.2
