Lines Matching defs:HeadNode
2501 void L_Insert(Element *Node, Head *HeadNode)
2503 if (!Node || !HeadNode)
2508 if (HeadNode->first == NULL)
2511 HeadNode->last = HeadNode->first = Node;
2515 Node->left = HeadNode->last;
2516 HeadNode->last = Node->left->right = Node;
2518 HeadNode->count++;
2521 void L_Remove(Element *Node, Head *HeadNode)
2526 if(!Node || !HeadNode)
2529 for(traverse = HeadNode->first; traverse; traverse = traverse->right)
2533 if(HeadNode->first == traverse)
2535 HeadNode->first = traverse->right;
2537 if(HeadNode->last == traverse)
2539 HeadNode->last = prevnode;
2550 HeadNode->count--;