2 files changed, 7 insertions, 1 deletions

diff --git a/include/linux/radix-tree.h b/include/linux/radix-tree.h
index 0d04cd69ab9b..ffc444c38b0a 100644
--- a/include/linux/radix-tree.h
+++ b/include/linux/radix-tree.h
@@ -368,8 +368,11 @@ radix_tree_next_slot(void **slot, struct radix_tree_iter *iter, unsigned flags)
                         iter->index++;
                         if (likely(*slot))
                                 return slot;
-                        if (flags & RADIX_TREE_ITER_CONTIG)
+                        if (flags & RADIX_TREE_ITER_CONTIG) {
+                                /* forbid switching to the next chunk */
+                                iter->next_index = 0;
                                 break;
+                        }
                 }
         }
         return NULL;
diff --git a/lib/radix-tree.c b/lib/radix-tree.c
index d7c878cc006c..e7964296fd50 100644
--- a/lib/radix-tree.c
+++ b/lib/radix-tree.c
@@ -686,6 +686,9 @@ void **radix_tree_next_chunk(struct radix_tree_root *root,
          * during iterating; it can be zero only at the beginning.
          * And we cannot overflow iter->next_index in a single step,
          * because RADIX_TREE_MAP_SHIFT < BITS_PER_LONG.
+         *
+         * This condition also used by radix_tree_next_slot() to stop
+         * contiguous iterating, and forbid swithing to the next chunk.
          */
         index = iter->next_index;
         if (!index && iter->index)