ida_find_first_range(9)

💜 ida_find_first_range(9) 💜

ok so this is a page from the Kernel API Manual bestie, and it's all about ida_find_first_range — the little function that goes "hey, what's the lowest ID somebody's actually using in here?" 🎀

---

✨ NAME ✨

ida_find_first_range — get the lowest used ID. literally that's the whole job, and she does it slayfully 💅

---

✨ SYNOPSIS ✨

int ida_find_first_range (struct ida *ida , unsigned int min , unsigned
int max );

---

🦋 ARGUMENTS 🦋

• ida — your IDA handle 💖 this is the lil container we're snooping around in.
• min — the lowest ID you want to get. the floor of the search, basically.
• max — the highest ID you want to get. the ceiling. the vibes boundary. ⭐

---

🌸 DESCRIPTION 🌸

ok so real talk: this gets the lowest used ID between min and max, and yes bestie, that range is inclusive on both ends 💯

and here's the tea — the returned ID will not exceed INT_MAX, even if max is larger. like, max can be out here living its best enormous life and the return value is still gonna respect that INT_MAX ceiling. no cap. 👑

---

🌈 CONTEXT 🌈

any context. takes and releases the xa_lock. so she's polite about it — grabs the lock, does her thing, puts it right back 🫶

---

⭐ RETURN ⭐

the lowest used ID. and if there's no used ID to be found? you get an errno instead 😭 that's it, that's the deal.

---

💀 SEE ALSO 💀

kernel file ./lib/idr.c, plus the whole friend group:

• idr_alloc_u32(9)
• idr_alloc(9)
• idr_alloc_cyclic(9)
• idr_remove(9)
• idr_find(9)
• idr_for_each(9)
• idr_get_next_ul(9)
• idr_get_next(9)
• idr_replace(9)
• IDA description(9)
• ida_alloc_range(9)
• ida_free(9)
• ida_destroy(9)

---

and that's the whole page bestie!! 🧚 this icon lives in ./lib, it's dated October 2026, and it's literally called ida_find_first_range(9) — go find some ranges, you got this 💜💖✨