Searched refs:parent_node (Results 1 – 5 of 5) sorted by relevance
65 void ControlEquivalence::VisitPost(Node* node, Node* parent_node, in VisitPost() argument74 if (parent_node != nullptr) { in VisitPost()75 BracketList& parent_blist = GetBracketList(parent_node); in VisitPost()112 if (input != entry.parent_node) { in RunUndirectedDFS()142 if (use != entry.parent_node) { in RunUndirectedDFS()165 VisitPost(node, entry.parent_node, entry.direction); in RunUndirectedDFS()
76 Node* parent_node; // Parent node of entry during DFS walk. in NON_EXPORTED_BASE() member102 void VisitPost(Node* node, Node* parent_node, DFSDirection direction); in NON_EXPORTED_BASE()
33 struct graph_node *parent_node; member192 while (node && node->parent_node) { in graph_indent()193 node->parent_node->right_node = node; in graph_indent()194 node = node->parent_node; in graph_indent()244 child->parent_node = cls; in graph_cls_show()
1449 struct cil_tree_node *parent_node; in test_cil_copy_node_helper_perm() local1450 cil_tree_node_init(&parent_node); in test_cil_copy_node_helper_perm()1451 parent_node->flavor = CIL_CLASS; in test_cil_copy_node_helper_perm()1452 parent_node->data = test_class; in test_cil_copy_node_helper_perm()1456 parent_node->parent = root; in test_cil_copy_node_helper_perm()1458 struct cil_args_copy *extra_args = gen_copy_args(parent_node, test_db2); in test_cil_copy_node_helper_perm()2184 struct cil_tree_node *parent_node; in test_cil_copy_node_helper_senscat() local2185 cil_tree_node_init(&parent_node); in test_cil_copy_node_helper_senscat()2186 parent_node->flavor = CIL_SENSCAT; in test_cil_copy_node_helper_senscat()2187 parent_node->data = test_senscat; in test_cil_copy_node_helper_senscat()[all …]
243 yield( parent_node = cursor.parent )244 cursor = parent_node271 yield( parent_node = cursor.parent )272 cursor = parent_node