pt_descend(9)

📦 version 7.3.1, in nixpkgs unstable

💅 pt_descend(9) — the Kernel API Manual page you actually want to read

Okay so bestie, gather round, because today we're talking about pt_descend from the Kernel API Manual, and honestly? She's a tiny little function with main character energy. ✨

🌸 NAME 🌸

pt_descend — she recursively invokes the walker for the lower level. That's it, that's the whole vibe. Recursive queen. 👑

🎀 SYNOPSIS 🎀

int pt_descend (struct pt_state *pts , void *arg , pt_level_fn_t fn );

Like, look at her. Three little args, one int coming back at you. Iconic. 💖

🦋 ARGUMENTS 🦋

  • pts — the Iteration State. This is the state bestie, the moment, the whole situation. 🫶
  • arg — the value you're gonna pass to the function. Just hand it over, no cap. 🎁
  • fn — the walker function to call. She's the one doing the actual walking, we're just hyping her up. 🚶‍♀️✨

🔥 DESCRIPTION 🔥

Okay so here's the tea: pts must point to a table item. Not vibes, not a maybe, an actual table item. Then you invoke fn as a walker on the table that pts points to. That's literally the whole job and she does it flawlessly. 💅

Fr fr, pts has to point to a table item — that's the requirement, don't come at her with anything else. 😭

🌈 SEE ALSO 🌈

Kernel file ./drivers/iommu/generic_pt/pt_iter.h — plus the whole friend group, because nobody walks alone:

Squad goals honestly. 💜

Mwah, that's the page! 💋 This lil beauty lives in ./drivers/iommu/generic_pt and the version we're all reading dropped in October 2026, under the name pt_descend(9). Go forth and recurse responsibly bestie 🧚‍♀️💖

📦 where this page comes from