HomeSort by: relevance | last modified time | path
    Searched refs:dm_tree_next_child (Results 1 - 5 of 5) sorted by relevancy

  /src/external/gpl2/lvm2/dist/libdm/
libdm-deptree.c 800 struct dm_tree_node *dm_tree_next_child(void **handle, function
1018 while ((child = dm_tree_next_child(&handle, dnode, 0))) {
1080 while ((child = dm_tree_next_child(&handle, dnode, 0))) {
1124 while ((child = dm_tree_next_child(&handle, dnode, 0))) {
1153 while ((child = dm_tree_next_child(&handle, dnode, 0))) {
1169 while ((child = dm_tree_next_child(&handle, dnode, 0))) {
1615 while ((child = dm_tree_next_child(&handle, dnode, 0))) {
1683 while ((child = dm_tree_next_child(&handle, dnode, 0))) {
libdevmapper.h 309 struct dm_tree_node *dm_tree_next_child(void **handle,
  /src/external/gpl2/lvm2/dist/lib/activate/
dev_manager.c 1099 while ((child = dm_tree_next_child(&handle, root, 0))) {
1141 while ((child = dm_tree_next_child(&handle, root, 0))) {
1168 while ((child = dm_tree_next_child(&handle, root, 0))) {
  /src/external/gpl2/lvm2/dist/include/
libdevmapper.h 309 struct dm_tree_node *dm_tree_next_child(void **handle,
  /src/external/gpl2/lvm2/dist/tools/
dmsetup.c 1885 next_child = dm_tree_next_child(&handle, node, inverted);
1888 next_child = dm_tree_next_child(&handle, node, inverted);
2125 while ((parent = dm_tree_next_child(&t, node, inverted))) {
2186 while ((parent = dm_tree_next_child(&t, node, 1))) {

Completed in 29 milliseconds