135     pathHashEntry_t* hashEntry = hashTable->hashBins[i];  in writeHashTable()  local
137     while (hashEntry) {  in writeHashTable()
141       pte.pathNumber = hashEntry->pathNumber;  in writeHashTable()
142       pte.pathCounter = hashEntry->pathCount;  in writeHashTable()
149       temp = hashEntry;  in writeHashTable()
150       hashEntry = hashEntry->next;  in writeHashTable()
161   pathHashEntry_t* hashEntry;  in getPathCounter()  local
168   hashEntry = hashTable->hashBins[index];  in getPathCounter()
170   while (hashEntry) {  in getPathCounter()
171     if (hashEntry->pathNumber == pathNumber) {  in getPathCounter()
172       return &hashEntry->pathCount;  in getPathCounter()
175     hashEntry = hashEntry->next;  in getPathCounter()
178   hashEntry = malloc(sizeof(pathHashEntry_t));  in getPathCounter()
179   hashEntry->pathNumber = pathNumber;  in getPathCounter()
180   hashEntry->pathCount = 0;  in getPathCounter()
181   hashEntry->next = hashTable->hashBins[index];  in getPathCounter()
182   hashTable->hashBins[index] = hashEntry;  in getPathCounter()
184   return &hashEntry->pathCount;  in getPathCounter()