325 	register Hash_Search *searchPtr)/* Area in which to keep state  in Hash_EnumFirst()  argument
328 	searchPtr->tablePtr = t;  in Hash_EnumFirst()
329 	searchPtr->nextIndex = 0;  in Hash_EnumFirst()
330 	searchPtr->hashEntryPtr = NULL;  in Hash_EnumFirst()
331 	return Hash_EnumNext(searchPtr);  in Hash_EnumFirst()
354 	register Hash_Search *searchPtr) /* Area used to keep state about  in Hash_EnumNext()  argument
358 	Hash_Table *t = searchPtr->tablePtr;  in Hash_EnumNext()
365 	e = searchPtr->hashEntryPtr;  in Hash_EnumNext()
373 		if (searchPtr->nextIndex >= t->size)  in Hash_EnumNext()
375 		e = t->bucketPtr[searchPtr->nextIndex++];  in Hash_EnumNext()
377 	searchPtr->hashEntryPtr = e;  in Hash_EnumNext()