Searched refs:Head (Results 1 – 4 of 4) sorted by relevance
50 void SlAddNodeToTail(SlNode_t *Head, SlNode_t *Node) in SlAddNodeToTail() argument56 if (Head == NULL) in SlAddNodeToTail()62 Current = Head; in SlAddNodeToTail()90 void SlInsertNodeBefore(SlNode_t *Head, SlNode_t *Marker, SlNode_t *Node) in SlInsertNodeBefore() argument104 if (Head == NULL) in SlInsertNodeBefore()107 Current = Head->Next; in SlInsertNodeBefore()108 Prior = Head; in SlInsertNodeBefore()129 void SlRemoveNode(SlNode_t *Head, SlNode_t *Node) in SlRemoveNode() argument137 if (Head == NULL) in SlRemoveNode()143 Current = Head->Next; in SlRemoveNode()[all …]
53 SlInitHead(&Stack->Head); in InitStack()64 SlAddNodeToHead(&Stack->Head, Node); in PushOnStack()84 Node = SlRemoveNodeFromHead(&Stack->Head); in PopOffStack()
91 void SlAddNodeToTail(SlNode_t *Head, SlNode_t *Node);100 SlNode_t *SlRemoveNodeFromHead(SlNode_t *Head);109 SlNode_t *SlRemoveNodeFromTail(SlNode_t *Head);136 void SlInsertNodeBefore(SlNode_t *Head, SlNode_t *Marker, SlNode_t *Node);145 void SlRemoveNode(SlNode_t *Head, SlNode_t *Node);
65 SlNode_t Head; member