| 116 | } |
| 117 | |
| 118 | hashNode_t * getHashNode() |
| 119 | { |
| 120 | if (hashNodeFreeList == NULL) makeMoreHashNodes(); |
| 121 | hashNode_t * node = hashNodeFreeList; |
| 122 | hashNodeFreeList = hashNodeFreeList->next; |
| 123 | node->next = NULL; |
| 124 | for (int i=0; i<HASHNODE_PAYLOAD_SIZE; i++) node->values[i] = 0; |
| 125 | return node; |
| 126 | } |
| 127 | |
| 128 | // I don't think this is currently being called, as we always put the entire string of nodes on the freelist. |
| 129 | void disposeHashNode(hashNode_t * node) |
no test coverage detected