201     pANTLR3_HASH_ENTRY	nextEntry;  in antlr3HashFree()  local
225 		    nextEntry	= entry->nextEntry;  in antlr3HashFree()
246 		    entry   = nextEntry;    /* Load next pointer to see if we shoud free it */  in antlr3HashFree()
308 	    (*nextPointer)		= entry->nextEntry;  in antlr3HashRemoveI()
319 … nextPointer	= & (entry->nextEntry);	    /* Address of the next pointer in the current entry	    */  in antlr3HashRemoveI()
320 	    entry	= entry->nextEntry;	    /* Address of the next element in the bucket (if any)   */  in antlr3HashRemoveI()
365 	    (*nextPointer)		= entry->nextEntry;  in antlr3HashRemove()
384 … nextPointer	= & (entry->nextEntry);	    /* Address of the next pointer in the current entry	    */  in antlr3HashRemove()
385 	    entry	= entry->nextEntry;	    /* Address of the next element in the bucket (if any)   */  in antlr3HashRemove()
471 	entry = entry->nextEntry;  in antlr3HashGetI()
511 	entry = entry->nextEntry;  in antlr3HashGet()
563 		newPointer = &((*newPointer)->nextEntry);  in antlr3HashPutI()
580 	entry->nextEntry		= NULL;			/* Ensure that the forward pointer ends the chain	*/  in antlr3HashPutI()
634 		newPointer = &((*newPointer)->nextEntry);  in antlr3HashPut()
658 	entry->nextEntry		= NULL;					/* Ensure that the forward pointer ends the chain   */  in antlr3HashPut()
776 	if  (en->entry->nextEntry != NULL)  in antlr3EnumNextEntry()
781 	    en->entry = en->entry->nextEntry;  in antlr3EnumNextEntry()
2233     pANTLR3_TRIE_ENTRY	nextEntry;  in freeIntNode()  local
2262 	nextEntry   = thisEntry->next;  in freeIntNode()
2274 	thisEntry = nextEntry;	    /* See if there are any more to free    */  in freeIntNode()