Searched refs:ListNode (Results 1 – 20 of 20) sorted by relevance
22 typedef struct ListNode { struct23 struct ListNode *prevPtr; /* previous element in list */ argument24 struct ListNode *nextPtr; /* next in list */ argument30 } *ListNode; argument36 #define NilListNode ((ListNode)-1)43 ListNode firstPtr; /* first node in list */44 ListNode lastPtr; /* last node in list */52 ListNode curPtr; /* current node, if open. NilListNode if54 ListNode prevPtr; /* Previous node, if open. Used by
45 register ListNode lNode;46 register ListNode nLNode;58 lNode = (ListNode)ln;60 PAlloc (nLNode, ListNode);
43 register ListNode nLNode; /* new lnode for d */44 register ListNode lNode = (ListNode)ln;59 PAlloc (nLNode, ListNode);
44 register ListNode tln;51 tln = (ListNode)ln;60 } while (tln != (ListNode)ln && tln != NilListNode);
46 register ListNode tln = (ListNode)ln;48 register ListNode next;
46 register ListNode ln; /* original LstNode */47 register ListNode nln; /* new LstNode */48 register ListNode last; /* the last element in the list. Keeps112 PAlloc (nln, ListNode);
41 register ListNode tln;43 tln = (ListNode) Lst_First (l);
42 register ListNode ln;43 register ListNode tln = NilListNode;
43 register ListNode lNode = (ListNode) ln;
40 return (((ListNode)ln)->datum);
44 return ((LstNode) ((ListNode) ln)->nextPtr);
52 return ((LstNode)((ListNode) ln)->prevPtr);
43 ((ListNode) ln)->datum = d;
36 register ListNode node;
52 register ListNode lNode;
28 register ListNode lNode;
63 d = ((ListNode)lns)->datum;
43 register ListNode ln;
46 register ListNode tln;
56 register ListNode tln;