mas_prev_range(9)

✨ mas_prev_range(9) ✨

okay so this is mas_prev_range(9) from the Kernel API Manual, and bestie, it's literally the “go back one range” girlie. no cap. the name is giving exactly what it is:

💅 NAME 💅

mas_prev_range — advance to the previous range. that's the whole assignment, and she ate.

✨ SYNOPSIS ✨

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

🌸 ARGUMENTS 🌸

• mas — the maple state. that's the state object you're working with, bestie.
• min — the minimum value to check. yes queen, this is the cutoff.

🦋 DESCRIPTION 🦋

Sets mas->index and mas->last to the range.

You must be holding rcu_read_lock or the write lock — like, actually, no exceptions, periodt. 🔥

If the node is ma_none, it will reset mas to ma_start. and it will stop on not searchable nodes. that's the vibe check, and it means what it says.

🎀 RETURN 🎀

the previous value or NULL. that's it, that's the return. 💀

🔥 SEE ALSO 🔥

Kernel file ./lib/maple_tree.c — and the whole squad:

• 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)
• 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_find_range_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)

source/version: ./lib · date: October 2026 · page: mas_prev_range(9) — mwah, bye bestie! 💖✨