mas_find_range_rev(9)

💅 mas_find_range_rev(9) 💅

okay so bestie, this is the Kernel API Manual page for mas_find_range_rev, and it’s giving tiny-but-mighty kernel energy. we’re keeping every single detail, so grab your iced coffee and let’s go. 🫶✨

---

🎀 NAME 🎀

mas_find_range_rev — on the first call, find the first non-null entry at or below mas->index down to %min. Otherwise, advance to the previous slot after mas->index down to %min.

✨ SYNOPSIS ✨

void * mas_find_range_rev (struct ma_state *mas , unsigned long min );

🦋 ARGUMENTS 🦋

• mas — the maple state. that’s the whole description, bestie. 💅
• min — the minimum value to check.

🌸 DESCRIPTION 🌸

okay so lock check first, because this is not a drill: you must hold rcu_read_lock or the write lock. like, actually must. periodt. 🔥

if an entry exists, last and index are updated accordingly. also, it may set mas->status to ma_underflow. that’s the whole note. no extra lore, no cap. 🍓

🔥 RETURN 🔥

the entry, or NULL. that’s it. that’s the return. ✨

🌈 SEE ALSO 🌈

Kernel file ./lib/maple_tree.c — and the whole friend group is here:

• mas_prealloc_calc(9)
• mas_wr_preallocate(9)
• mas_insert(9)
• mas_alloc_cyclic(9)
• mas_walk(9)
• mte_dead_walk(9)
• mt_free_walk(9)
• mas_store(9)
• mas_store_gfp(9)
• mas_store_prealloc(9)
• mas_preallocate(9)
• mas_next(9)
• mas_next_range(9)
• mt_next(9)
• mas_prev(9)
• mas_prev_range(9)
• mt_prev(9)
• mas_pause(9)
• mas_find_setup(9)
• mas_find(9)
• mas_find_range(9)
• mas_find_rev_setup(9)
• mas_find_rev(9)
• mas_erase(9)
• mas_nomem(9)
• mas_nomem_nofail(9)
• mtree_load(9)
• mtree_store_range(9)
• mtree_store(9)
• mtree_insert_range(9)
• mtree_insert(9)
• mtree_alloc_cyclic(9)
• mtree_erase(9)
• __mt_dup(9)
• mtree_dup(9)
• __mt_destroy(9)
• mtree_destroy(9)
• mt_find(9)
• mt_find_after(9)

---

signed off from the source/version ./lib, dated October 2026 ✨ xoxo, your kernel bestie 💖