Home
last modified time | relevance | path

Searched refs:next_node (Results 1 – 5 of 5) sorted by relevance

/packages/modules/Virtualization/libs/libfdt/src/
Dlib.rs298 fn next_node(&self, depth: usize) -> Result<Option<(Self, usize)>> { in next_node() method
299 if let Some((offset, depth)) = self.fdt.next_node(self.offset, depth)? { in next_node()
486 pub fn next_node(self, depth: usize) -> Result<Option<(Self, usize)>> { in next_node() method
487 let next = self.fdt.next_node(self.offset, depth)?; in next_node()
513 let next_node = self.fdt.next_node_skip_subnodes(self.offset, depth)?; in delete_and_next_node() localVariable
514 if let Some((offset, depth)) = next_node { in delete_and_next_node()
515 let next_node = self.delete_and_next(Some(offset))?.unwrap(); in delete_and_next_node() localVariable
516 Ok(Some((next_node, depth))) in delete_and_next_node()
780 let mut iter = self.next_node(node, depth)?; in next_node_skip_subnodes()
785 iter = self.next_node(offset, next_depth)?; in next_node_skip_subnodes()
Diterators.rs331 self.node = node.next_node(depth).ok().flatten().filter(|(_, depth)| *depth > 0); in next()
Dlibfdt.rs109 fn next_node(&self, node: NodeOffset, depth: usize) -> Result<Option<(NodeOffset, usize)>> { in next_node() method
/packages/modules/Virtualization/libs/libfdt/tests/
Dapi_test.rs408 let mut iter = fdt.root_mut().next_node(0).unwrap(); in node_mut_delete_and_next_node()
418 iter = node.next_node(depth).unwrap(); in node_mut_delete_and_next_node()
434 let mut iter = fdt.root_mut().next_node(0).unwrap(); in node_mut_delete_and_next_node_with_last_node()
/packages/modules/Virtualization/guest/pvmfw/src/
Ddevice_assignment.rs570 let mut iter = anchor.next_node(0)?; in filter_with_mask()
585 iter = node.next_node(depth)?; in filter_with_mask()