Searched refs:HeadNode (Results 1 – 3 of 3) sorted by relevance
185 Head HeadNode; in dodelete() local196 L_Init(&HeadNode); in dodelete()206 L_Insert(datalist, &HeadNode); in dodelete()209 if ( ((Head *)&HeadNode)->count > 1 ) { in dodelete()212 …the entire branch rooted at %s? [no]\n"), (char *)((Element *)(((Head *)&HeadNode)->first))->data); in dodelete()224 for ( datalist = ((Head *)&HeadNode)->last; datalist; datalist = datalist->left ) { in dodelete()229 L_Remove(datalist, (Head *)&HeadNode); in dodelete()
2502 void L_Insert(Element *Node, Head *HeadNode) argument2504 if (!Node || !HeadNode)2509 if (HeadNode->first == NULL)2512 HeadNode->last = HeadNode->first = Node;2516 Node->left = HeadNode->last;2517 HeadNode->last = Node->left->right = Node;2519 HeadNode->count++;2522 void L_Remove(Element *Node, Head *HeadNode) argument2527 if(!Node || !HeadNode)2530 for(traverse = HeadNode->first; traverse; traverse = traverse->right)[all …]
220 void L_Insert(Element *Node, Head *HeadNode);221 void L_Remove(Element *Node, Head *HeadNode);