mt_find_after(9)

💖 NAME 💖

Okay bestie, this is mt_find_after(9) from the Kernel API Manual, and the vibe is literally: search from the start up until an entry is found. ✨

🌸 SYNOPSIS 🌸

void * mt_find_after (struct maple_tree *mt , unsigned long *index ,
       unsigned long max );

🎀 ARGUMENTS 🎀

• mt — the maple tree, aka the thing you’re searching through.
• index — a pointer that contains the start location of the search.
• max — the maximum value to check.

💅 DESCRIPTION 💅

It’s the same as mt_find, except that it checks index for 0 before searching. If index == 0, the search is aborted. This covers a wrap around of index to 0 in an iterator loop. periodt 💅

🔥 RETURN 🔥

The entry at or after the index, or NULL. That’s the whole tea. 🫶

🦋 SEE ALSO 🦋

Kernel file ./lib/maple_tree.c, plus these absolute icons: 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_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).

Source/version: ./lib · Date: October 2026 — byeee bestie, go find that entry 💖✨