radix-tree: rename radix_tree_is_indirect_ptr()

[linux-block.git] / tools / testing / radix-tree / test.c

diff --git a/tools/testing/radix-tree/test.c b/tools/testing/radix-tree/test.c
index 2bebf34cdc27e1e68e2f0c88de77a7787d431286..a6e8099eaf4f27e6f58c67565fa2344578831043 100644 (file)
--- a/tools/testing/radix-tree/test.c
+++ b/tools/testing/radix-tree/test.c
@@ -24,14 +24,21 @@ int item_tag_get(struct radix_tree_root *root, unsigned long index, int tag)
        return radix_tree_tag_get(root, index, tag);
 }
 
-int __item_insert(struct radix_tree_root *root, struct item *item)
+int __item_insert(struct radix_tree_root *root, struct item *item,
+                       unsigned order)
 {
-       return radix_tree_insert(root, item->index, item);
+       return __radix_tree_insert(root, item->index, order, item);
 }
 
 int item_insert(struct radix_tree_root *root, unsigned long index)
 {
-       return __item_insert(root, item_create(index));
+       return __item_insert(root, item_create(index), 0);
+}
+
+int item_insert_order(struct radix_tree_root *root, unsigned long index,
+                       unsigned order)
+{
+       return __item_insert(root, item_create(index), order);
 }
 
 int item_delete(struct radix_tree_root *root, unsigned long index)
@@ -136,13 +143,13 @@ void item_full_scan(struct radix_tree_root *root, unsigned long start,
 }
 
 static int verify_node(struct radix_tree_node *slot, unsigned int tag,
-                       unsigned int height, int tagged)
+                       int tagged)
 {
        int anyset = 0;
        int i;
        int j;
 
-       slot = indirect_to_ptr(slot);
+       slot = entry_to_node(slot);
 
        /* Verify consistency at this level */
        for (i = 0; i < RADIX_TREE_TAG_LONGS; i++) {
@@ -152,7 +159,8 @@ static int verify_node(struct radix_tree_node *slot, unsigned int tag,
                }
        }
        if (tagged != anyset) {
-               printf("tag: %u, height %u, tagged: %d, anyset: %d\n", tag, height, tagged, anyset);
+               printf("tag: %u, shift %u, tagged: %d, anyset: %d\n",
+                       tag, slot->shift, tagged, anyset);
                for (j = 0; j < RADIX_TREE_MAX_TAGS; j++) {
                        printf("tag %d: ", j);
                        for (i = 0; i < RADIX_TREE_TAG_LONGS; i++)
@@ -164,10 +172,10 @@ static int verify_node(struct radix_tree_node *slot, unsigned int tag,
        assert(tagged == anyset);
 
        /* Go for next level */
-       if (height > 1) {
+       if (slot->shift > 0) {
                for (i = 0; i < RADIX_TREE_MAP_SIZE; i++)
                        if (slot->slots[i])
-                               if (verify_node(slot->slots[i], tag, height - 1,
+                               if (verify_node(slot->slots[i], tag,
                                            !!test_bit(i, slot->tags[tag]))) {
                                        printf("Failure at off %d\n", i);
                                        for (j = 0; j < RADIX_TREE_MAX_TAGS; j++) {
@@ -184,9 +192,10 @@ static int verify_node(struct radix_tree_node *slot, unsigned int tag,
 
 void verify_tag_consistency(struct radix_tree_root *root, unsigned int tag)
 {
-       if (!root->height)
+       struct radix_tree_node *node = root->rnode;
+       if (!radix_tree_is_internal_node(node))
                return;
-       verify_node(root->rnode, tag, root->height, !!root_tag_get(root, tag));
+       verify_node(node, tag, !!root_tag_get(root, tag));
 }
 
 void item_kill_tree(struct radix_tree_root *root)
@@ -211,9 +220,19 @@ void item_kill_tree(struct radix_tree_root *root)
 
 void tree_verify_min_height(struct radix_tree_root *root, int maxindex)
 {
-       assert(radix_tree_maxindex(root->height) >= maxindex);
-       if (root->height > 1)
-               assert(radix_tree_maxindex(root->height-1) < maxindex);
-       else if (root->height == 1)
-               assert(radix_tree_maxindex(root->height-1) <= maxindex);
+       unsigned shift;
+       struct radix_tree_node *node = root->rnode;
+       if (!radix_tree_is_internal_node(node)) {
+               assert(maxindex == 0);
+               return;
+       }
+
+       node = entry_to_node(node);
+       assert(maxindex <= node_maxindex(node));
+
+       shift = node->shift;
+       if (shift > 0)
+               assert(maxindex > shift_maxindex(shift - RADIX_TREE_MAP_SHIFT));
+       else
+               assert(maxindex > 0);
 }