Lines Matching refs:sub_tail
475 cur_node = new_ctl->any.tab_parent.link->sub_tail; in TraverseControl()
702 } while ((node != graph->sub_tail) && (node = node->any.next)); in GetNextNearestNode()
974 (new_tab->graph.sub_tail)) in TraverseTab()
976 new_tab = new_tab->graph.sub_tail; in TraverseTab()
1290 list_entry->graph.sub_tail = NULL; in GetNodeList()
1327 } while ((node != graph->sub_tail) && (node = node->any.next)); in GetNodeFromGraph()
1390 if (!parent->sub_tail) in LinkNodeList()
1393 parent->sub_tail->any.next = entry; in LinkNodeList()
1395 entry->any.prev = parent->sub_tail; in LinkNodeList()
1397 parent->sub_tail = entry; in LinkNodeList()
2098 graph->sub_tail = *list_ptr; in SortTabGraph()
2152 graph->sub_tail = *list_ptr; in SortControlGraph()
2155 graph->sub_head->any.prev = graph->sub_tail; in SortControlGraph()
2156 graph->sub_tail->any.next = graph->sub_head; in SortControlGraph()
2181 graph->sub_tail = *list_ptr; in SortControlGraph()
2258 graph->sub_tail->any.next = graph->sub_head; in SetInitialNode()
2259 graph->sub_head->any.prev = graph->sub_tail; in SetInitialNode()
2261 graph->sub_tail = init_node->any.prev; in SetInitialNode()
2262 graph->sub_tail->any.next = NULL; in SetInitialNode()
2268 graph->sub_tail = init_node->any.prev; in SetInitialNode()
2564 node->any.tab_parent.link, node->graph.sub_head, node->graph.sub_tail, in PrintGraph()