| 79 | } |
| 80 | |
| 81 | void PushNode(C Entry) |
| 82 | { |
| 83 | if (!pNodeList) |
| 84 | { |
| 85 | pNodeList = new node_s; |
| 86 | pNodeList->Entry = Entry; |
| 87 | pNodeList->next = NULL; |
| 88 | pNodeList->prev = NULL; |
| 89 | pLastNode = pNodeList; |
| 90 | iNodeCount = 1; |
| 91 | } |
| 92 | else |
| 93 | { |
| 94 | node_s *pNew = new node_s; |
| 95 | pNew->Entry = Entry; |
| 96 | pNew->prev = NULL; |
| 97 | pNew->next = pNodeList; |
| 98 | pNodeList->prev = pNew; |
| 99 | pNodeList = pNew; |
| 100 | iNodeCount++; |
| 101 | } |
| 102 | } |
| 103 | |
| 104 | void DeleteEntry(C Entry) |
| 105 | { |
no outgoing calls
no test coverage detected