Lines Matching refs:pNext
195 fuzzer_rule *pNext; /* Next rule in order of increasing rCost */ member
217 fuzzer_stem *pNext; /* Next stem in rCost order */ member
268 pTail->pNext = pA; in fuzzerMergeRules()
270 pA = pA->pNext; in fuzzerMergeRules()
272 pTail->pNext = pB; in fuzzerMergeRules()
274 pB = pB->pNext; in fuzzerMergeRules()
278 pTail->pNext = pB; in fuzzerMergeRules()
280 pTail->pNext = pA; in fuzzerMergeRules()
282 return head.pNext; in fuzzerMergeRules()
393 pRule->pNext = pHead; in fuzzerLoadRules()
413 pHead = pX->pNext; in fuzzerLoadRules()
414 pX->pNext = 0; in fuzzerLoadRules()
483 p->pRule = pRule->pNext; in fuzzerDisconnect()
573 fuzzer_stem *pNext = pStem->pNext; in fuzzerClearStemList() local
575 pStem = pNext; in fuzzerClearStemList()
753 pRule = pRule->pNext; in fuzzerAdvance()
773 pTail->pNext = pA; in fuzzerMergeStems()
775 pA = pA->pNext; in fuzzerMergeStems()
777 pTail->pNext = pB; in fuzzerMergeStems()
779 pB = pB->pNext; in fuzzerMergeStems()
783 pTail->pNext = pB; in fuzzerMergeStems()
785 pTail->pNext = pA; in fuzzerMergeStems()
787 return head.pNext; in fuzzerMergeStems()
811 pCur->aQueue[iBest] = pBest->pNext; in fuzzerLowestCostStem()
812 pBest->pNext = 0; in fuzzerLowestCostStem()
833 pNew->pNext = 0; in fuzzerInsert()
839 pNew->pNext = 0; in fuzzerInsert()
885 pRule = pRule->pNext; in fuzzerNewStem()
918 pNew->pNext = pCur->pDone; in fuzzerNext()
947 pStem->pNext = pCur->pDone; in fuzzerNext()
994 pCur->nullRule.pNext = pCur->pVtab->pRule; in fuzzerFilter()