fdt_node_depth(9)

πŸ“¦ version 7.3.1, in nixpkgs unstable

πŸ’… fdt_node_depth(9) β€” find the depth of a given node πŸ’…

Okay bestie, welcome to the fdt_node_depth(9) page from the Kernel API Manual. It's giving β€œshort but spicy,” and we're gonna keep every single detail, fr fr. ✨


πŸŽ€ NAME πŸŽ€

fdt_node_depth β€” find the depth of a given node. Simple, iconic, to the point. πŸ’–


🌸 SYNOPSIS 🌸

int fdt_node_depth (const void *fdt , int nodeoffset );

πŸ¦‹ ARGUMENTS πŸ¦‹

  • fdt β€” pointer to the device tree blob. It's the tree, babe. 🌳
  • nodeoffset β€” offset of the node whose parent to find. Yes, that's exactly what the manual says, so we're keeping it exactly like that. πŸ’…

✨ DESCRIPTION ✨

fdt_node_depth finds the depth of a given node. The root node has depth 0, its immediate subnodes depth 1, and so forth. It's literally a ladder: root at the bottom of the number line, subnodes climbing up one by one. πŸͺœπŸ’–


πŸ”₯ NOTE πŸ”₯

🚨 This function is expensive, as it must scan the device tree structure from the start to nodeoffset. No cap, it's doing a whole walk, so don't spam it like it's free. 😭

πŸ‘‘ RETURN πŸ‘‘

  • depth of the node at nodeoffset (>=0) on success πŸŽ‰
  • -FDT_ERR_BADOFFSET β€” nodeoffset does not refer to a BEGIN_NODE tag
  • -FDT_ERR_BADMAGIC
  • -FDT_ERR_BADVERSION
  • -FDT_ERR_BADSTATE
  • -FDT_ERR_BADSTRUCTURE
  • standard meanings

🌈 SEE ALSO 🌈

Kernel file ./scripts/dtc/libfdt/libfdt.h. The full reference squad, no cuts, no skips, all here bestie:

fdt_offset_ptr(9), fdt_next_tag(9), fdt_first_subnode(9),
fdt_next_subnode(9), fdt_for_each_subnode(9), fdt_header_size(9),
fdt_header_size_(9), fdt_check_header(9), fdt_move(9), fdt_check_full(9),
fdt_get_string(9), fdt_string(9), fdt_find_max_phandle(9),
fdt_get_max_phandle(9), fdt_generate_phandle(9), fdt_num_mem_rsv(9),
fdt_get_mem_rsv(9), fdt_subnode_offset_namelen(9), fdt_subnode_offset(9),
fdt_path_offset_namelen(9), fdt_path_offset(9), fdt_get_name(9),
fdt_first_property_offset(9), fdt_next_property_offset(9),
fdt_for_each_property_offset(9), fdt_get_property_by_offset(9),
fdt_get_property_namelen(9), fdt_get_property(9), fdt_getprop_by_offset(9),
fdt_getprop_namelen(9), fdt_getprop(9), fdt_get_phandle(9),
fdt_get_alias_namelen(9), fdt_get_alias(9), fdt_get_symbol_namelen(9),
fdt_get_symbol(9), fdt_get_path(9), fdt_supernode_atdepth_offset(9),
fdt_parent_offset(9), fdt_node_offset_by_prop_value(9),
fdt_node_offset_by_phandle(9), fdt_node_check_compatible(9),
fdt_node_offset_by_compatible(9), fdt_stringlist_contains(9),
fdt_stringlist_count(9), fdt_stringlist_search(9), fdt_stringlist_get(9),
FDT_MAX_NCELLS(9), fdt_address_cells(9), fdt_size_cells(9),
fdt_setprop_inplace_namelen_partial(9), fdt_setprop_inplace(9),
fdt_setprop_inplace_u32(9), fdt_setprop_inplace_u64(9),
fdt_setprop_inplace_cell(9), fdt_nop_property(9), fdt_nop_node(9),
fdt_create_with_flags(9), fdt_create(9), fdt_resize(9),
fdt_add_reservemap_entry(9), fdt_finish_reservemap(9), fdt_begin_node(9),
fdt_property(9), fdt_property_placeholder(9), fdt_end_node(9), fdt_finish(9),
fdt_create_empty_tree(9), fdt_open_into(9), fdt_pack(9), fdt_add_mem_rsv(9),
fdt_del_mem_rsv(9), fdt_set_name(9), fdt_setprop_namelen(9), fdt_setprop(9),
fdt_setprop_placeholder_namelen(9), fdt_setprop_placeholder(9),
fdt_setprop_u32(9), fdt_setprop_u64(9), fdt_setprop_cell(9),
fdt_setprop_string(9), fdt_setprop_namelen_string(9), fdt_setprop_empty(9),
fdt_appendprop(9), fdt_appendprop_u32(9), fdt_appendprop_u64(9),
fdt_appendprop_cell(9), fdt_appendprop_string(9),
fdt_appendprop_addrrange(9), fdt_delprop(9), fdt_add_subnode_namelen(9),
fdt_add_subnode(9), fdt_del_node(9), fdt_overlay_apply(9),
fdt_overlay_target_offset(9), fdt_strerror(9)

And that's the whole page, bestie. Source/version: ./scripts/dtc/libfdt, date: October 2026, manual: fdt_node_depth(9). Mwah πŸ’‹πŸ«Ά

πŸ“¦ where this page comes from