Searched refs:ListNode (Results 1 – 13 of 13) sorted by relevance
47 typedef struct ListNode { struct48 struct ListNode *prevPtr; /* previous element in list */ argument49 struct ListNode *nextPtr; /* next in list */ argument55 } *ListNode; argument66 ListNode firstPtr; /* first node in list */67 ListNode lastPtr; /* last node in list */75 ListNode curPtr; /* current node, if open. NULL if77 ListNode prevPtr; /* Previous node, if open. Used by
81 ListNode ln; /* original LstNode */ in Lst_Concat()82 ListNode nln; /* new LstNode */ in Lst_Concat()83 ListNode last; /* the last element in the list. Keeps in Lst_Concat()147 PAlloc (nln, ListNode); in Lst_Concat()
80 ListNode lNode; in Lst_InsertAfter()81 ListNode nLNode; in Lst_InsertAfter()95 PAlloc (nLNode, ListNode); in Lst_InsertAfter()
78 ListNode nLNode; /* new lnode for d */ in Lst_InsertBefore()79 ListNode lNode = ln; in Lst_InsertBefore()94 PAlloc (nLNode, ListNode); in Lst_InsertBefore()
73 ListNode ln; in Lst_Destroy()74 ListNode tln = NULL; in Lst_Destroy()
76 ListNode tln = ln; in Lst_ForEachFrom()78 ListNode next; in Lst_ForEachFrom()
73 ListNode tln; in Lst_DeQueue()
59 ListNode lNode; in Lst_Member()
74 ListNode tln; in Lst_FindFrom()
77 ListNode ln; in Lst_Duplicate()
78 ListNode tln; in Lst_Next()
74 ListNode lNode = ln; in Lst_Remove()
93 typedef struct ListNode *LstNode;