342   amatch_avl *p, *pNext;
343   for(p=amatchAvlFirst(pHead); p; p=pNext){
344     pNext = amatchAvlNext(p);
345     if( pNext==0 ) break;
346     assert( strcmp(p->zKey, pNext->zKey)<0 );
467   amatch_word *pNext;   /* Next on a list of all amatch_words */  member
482   amatch_rule *pNext;      /* Next rule in order of increasing rCost */  member
541       pTail->pNext = pA;  in amatchMergeRules()
543       pA = pA->pNext;  in amatchMergeRules()
545       pTail->pNext = pB;  in amatchMergeRules()
547       pB = pB->pNext;  in amatchMergeRules()
551     pTail->pNext = pB;  in amatchMergeRules()
553     pTail->pNext = pA;  in amatchMergeRules()
555   return head.pNext;  in amatchMergeRules()
647     p->pRule = pRule->pNext;  in amatchFreeRules()
684           pRule->pNext = pHead;  in amatchLoadRules()
704       pHead = pX->pNext;  in amatchLoadRules()
705       pX->pNext = 0;  in amatchLoadRules()
947     pNextWord = pWord->pNext;  in amatchClearCursor()
1080   pWord->pNext = pCur->pAllWords;  in amatchAddWord()
1233     for(pRule=p->pRule; pRule; pRule=pRule->pNext){  in amatchNext()