Lines Matching defs:pNext
1372 ** the pNext pointer. The [sqlite3_vfs_register()]
1376 ** implementation should use the pNext pointer.
1378 ** The pNext field is the only field in the sqlite3_vfs
1515 sqlite3_vfs *pNext; /* Next registered VFS */
8251 SubProgram *pNext; /* Next sub-program already visited */
9408 LookasideSlot *pNext; /* Next buffer in the list of free buffers */
9630 FuncDef *pNext; /* Next function with same name */
9716 Savepoint *pNext; /* Parent savepoint (if any) */
9887 VTable *pNext; /* Next in linked list (see above) */
10133 Index *pNext; /* The next index associated with the same table */
10650 ** Each subquery gets a new NameContext. The pNext field points to the
10666 NameContext *pNext; /* Next outer name context. NULL for outermost */
10700 Select *pNext; /* Next select to the left in a compound */
10764 AutoincInfo *pNext; /* Next info block in a list of them all */
10800 TriggerPrg *pNext; /* Next entry in Parse.pTriggerPrg list */
10951 * pNext member of struct Trigger. A pointer to the first element of the
10969 Trigger *pNext; /* Next trigger associated with the table */
10987 * using the "pNext" member) referenced by the "step_list" member of the
11029 TriggerStep *pNext; /* Next in the link-list */
12834 Vdbe *pPrev,*pNext; /* Linked list of VDBEs with the same Vdbe.db */
13188 for(pVdbe=db->pVdbe; pVdbe; pVdbe=pVdbe->pNext){
14600 for(pVfs = vfsList; pVfs; pVfs=pVfs->pNext){
14616 vfsList = pVfs->pNext;
14619 while( p->pNext && p->pNext!=pVfs ){
14620 p = p->pNext;
14622 if( p->pNext==pVfs ){
14623 p->pNext = pVfs->pNext;
14643 pVfs->pNext = vfsList;
14646 pVfs->pNext = vfsList->pNext;
14647 vfsList->pNext = pVfs;
15026 struct MemBlockHdr *pNext, *pPrev; /* Linked list of all unfreed memory */
15229 pHdr->pNext = 0;
15232 mem.pLast->pNext = pHdr;
15281 assert( pHdr->pPrev->pNext==pHdr );
15282 pHdr->pPrev->pNext = pHdr->pNext;
15285 mem.pFirst = pHdr->pNext;
15287 if( pHdr->pNext ){
15288 assert( pHdr->pNext->pPrev==pHdr );
15289 pHdr->pNext->pPrev = pHdr->pPrev;
15434 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){
15456 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){
18137 struct ScratchFreeslot *pNext; /* Next unused scratch buffer */
18272 pSlot->pNext = (ScratchFreeslot*)(sz+(char*)pSlot);
18273 pSlot = pSlot->pNext;
18275 pSlot->pNext = 0;
18453 mem0.pScratchFree = mem0.pScratchFree->pNext;
18501 pSlot->pNext = mem0.pScratchFree;
18590 pBuf->pNext = db->lookaside.pFree;
18723 db->lookaside.pFree = pBuf->pNext;
23197 ** pNext
23212 os2ShmNode *pNext; /* Next in list of all os2ShmNode objects */
23242 os2ShmLink *pNext; /* Next os2Shm with the same os2ShmNode */
23355 pNode = pNode->pNext ) ;
23390 pNode->pNext = os2ShmNodeList;
23406 pLink->pNext = pNode->pFirst;
23444 *ppNode = pNode->pNext;
23486 ppNode = &pNode->pNext;
23620 ppLink = &(*ppLink)->pNext ) ;
23625 *ppLink = pLink->pNext;
23683 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
23708 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
23733 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
24339 0, /* pNext */
24571 UnixUnusedFd *pNext; /* Next unused file descriptor on same file */
25305 struct vxworksFileId *pNext; /* Next in a list of them all */
25383 for(pCandidate=vxworksFileList; pCandidate; pCandidate=pCandidate->pNext){
25397 pNew->pNext = vxworksFileList;
25413 for(pp=&vxworksFileList; *pp && *pp!=pId; pp = &((*pp)->pNext)){}
25415 *pp = pId->pNext;
25546 unixInodeInfo *pNext; /* List of all unixInodeInfo objects */
25658 UnixUnusedFd *pNext;
25659 for(p=pInode->pUnused; p; p=pNext){
25660 pNext = p->pNext;
25682 assert( pInode->pPrev->pNext==pInode );
25683 pInode->pPrev->pNext = pInode->pNext;
25686 inodeList = pInode->pNext;
25688 if( pInode->pNext ){
25689 assert( pInode->pNext->pPrev==pInode );
25690 pInode->pNext->pPrev = pInode->pPrev;
25766 pInode = pInode->pNext;
25776 pInode->pNext = inodeList;
26133 p->pNext = pInode->pUnused;
28221 unixShm *pNext; /* Next unixShm with the same unixShmNode */
28486 p->pNext = pShmNode->pFirst;
28661 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
28686 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
28711 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
28776 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
28777 *pp = p->pNext;
29407 pInode = pInode->pNext;
29411 for(pp=&pInode->pUnused; *pp && (*pp)->flags!=flags; pp=&((*pp)->pNext));
29414 *pp = pUnused->pNext;
31274 0, /* pNext */ \
31298 ** Note that the sqlite3_vfs.pNext field of the VFS object is modified
33290 ** pNext
33317 winShmNode *pNext; /* Next in list of all winShmNode objects */
33345 winShm *pNext; /* Next winShm with the same winShmNode */
33449 *pp = p->pNext;
33453 pp = &p->pNext;
33495 for(pShmNode = winShmNodeList; pShmNode; pShmNode=pShmNode->pNext){
33507 pShmNode->pNext = winShmNodeList;
33559 p->pNext = pShmNode->pFirst;
33595 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
33596 *pp = p->pNext;
33647 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
33672 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
33697 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34728 0, /* pNext */
35595 PgHdr *pNext;
35596 for(p=pCache->pDirty; p; p=pNext){
35597 pNext = p->pDirtyNext;
35875 PGroupBlockList *pNext; /* Next block-list attached to group */
35882 PGroupBlock *pNext; /* Next PGroupBlock in list */
35930 PgHdr1 *pNext; /* Next in hash table chain */
35941 PgFreeslot *pNext; /* Next free slot */
36034 p->pNext = pcache1.pFree;
36059 pcache1.pFree = pcache1.pFree->pNext;
36093 pSlot->pNext = pcache1.pFree;
36136 pBlock->pNext = pList->pFirst;
36138 if( pBlock->pNext ){
36139 pBlock->pNext->pPrev = pBlock;
36154 for(pp=&pGroup->pBlockList; *pp!=pList; pp=&(*pp)->pNext);
36155 *pp = (*pp)->pNext;
36178 for(pList=pGroup->pBlockList; pList; pList=pList->pNext){
36193 for(pList=pGroup->pBlockList; pList; pList=pList->pNext){
36198 pNew->pNext = pGroup->pBlockList;
36249 assert( pList->pLast->pNext==0 );
36250 pList->pFirst = pBlock->pNext;
36253 pBlock->pNext = 0;
36254 pList->pLast->pNext = pBlock;
36306 pList->pFirst = pBlock->pNext;
36309 pBlock->pPrev->pNext = pBlock->pNext;
36313 if( pList->pLast ) pList->pLast->pNext = 0;
36315 pBlock->pNext->pPrev = pBlock->pPrev;
36411 PgHdr1 *pNext = p->apHash[i];
36412 while( (pPage = pNext)!=0 ){
36414 pNext = pPage->pNext;
36415 pPage->pNext = apNew[h];
36477 for(pp=&pCache->apHash[h]; (*pp)!=pPage; pp=&(*pp)->pNext);
36478 *pp = (*pp)->pNext;
36518 *pp = pPage->pNext;
36522 pp = &pPage->pNext;
36712 for(pPage=pCache->apHash[h]; pPage&&pPage->iKey!=iKey; pPage=pPage->pNext);
36782 pPage->pNext = pCache->apHash[h];
36858 pp = &(*pp)->pNext;
36860 *pp = pPage->pNext;
36864 pPage->pNext = pCache->apHash[h];
40474 PgHdr *pNext = pList->pDirty;
40476 pList = pNext;
47656 BtLock *pNext; /* Next in BtShared.pLock list */
47692 Btree *pNext; /* List of other sharable Btrees from the same db */
47721 ** mutex, except for nRef and pNext which are accessed under the
47775 BtShared *pNext; /* Next on a list of sharable BtShared structs */
47829 BtCursor *pNext, *pPrev; /* Forms a linked list of all cursors */
48031 ** by all database connections. The p->pNext is a list of other
48034 ** p, then first unlock all of the others on p->pNext, then wait
48042 ** connected by pNext and pPrev should be in sorted order by
48045 assert( p->pNext==0 || p->pNext->pBt>p->pBt );
48047 assert( p->pNext==0 || p->pNext->db==p->db );
48049 assert( p->sharable || (p->pNext==0 && p->pPrev==0) );
48081 for(pLater=p->pNext; pLater; pLater=pLater->pNext){
48083 assert( pLater->pNext==0 || pLater->pNext->pBt>pLater->pBt );
48090 for(pLater=p->pNext; pLater; pLater=pLater->pNext){
48428 for(pLock=pBtree->pBt->pLock; pLock; pLock=pLock->pNext){
48463 for(p=pBtree->pBt->pCursor; p; p=p->pNext){
48510 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
48574 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
48591 pLock->pNext = pBt->pLock;
48630 *ppIter = pLock->pNext;
48636 ppIter = &pLock->pNext;
48669 for(pLock=pBt->pLock; pLock; pLock=pLock->pNext){
48709 for(p=pBt->pCursor; p; p=p->pNext){
48735 for(p=pBt->pCursor; p; p=p->pNext){
48881 for(p=pBt->pCursor; p; p=p->pNext){
50039 for(pBt=GLOBAL(BtShared*,sqlite3SharedCacheList); pBt; pBt=pBt->pNext){
50156 pBt->pNext = GLOBAL(BtShared*,sqlite3SharedCacheList);
50175 p->pNext = pSib;
50179 while( pSib->pNext && pSib->pNext->pBt<p->pBt ){
50180 pSib = pSib->pNext;
50182 p->pNext = pSib->pNext;
50184 if( p->pNext ){
50185 p->pNext->pPrev = p;
50187 pSib->pNext = p;
50238 GLOBAL(BtShared*,sqlite3SharedCacheList) = pBt->pNext;
50241 while( ALWAYS(pList) && pList->pNext!=pBt ){
50242 pList=pList->pNext;
50245 pList->pNext = pBt->pNext;
50291 pCur = pCur->pNext;
50328 if( p->pPrev ) p->pPrev->pNext = p->pNext;
50329 if( p->pNext ) p->pNext->pPrev = p->pPrev;
50827 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
50882 p->lock.pNext = pBt->pLock;
51503 for(pCur=pBt->pCursor; pCur; pCur=pCur->pNext){
51530 for(p=pBtree->pBt->pCursor; p; p=p->pNext){
51746 pCur->pNext = pBt->pCursor;
51747 if( pCur->pNext ){
51748 pCur->pNext->pPrev = pCur;
51807 for(p=pCur->pBt->pCursor; p; p=p->pNext){
51835 pCur->pPrev->pNext = pCur->pNext;
51837 pBt->pCursor = pCur->pNext;
51839 if( pCur->pNext ){
51840 pCur->pNext->pPrev = pCur->pPrev;
56491 sqlite3_backup *pNext; /* Next backup associated with source pager */
56763 p->pNext = *pp;
57010 pp = &(*pp)->pNext;
57012 *pp = p->pNext;
57067 for(p=pBackup; p; p=p->pNext){
57100 for(p=pBackup; p; p=p->pNext){
58348 p->pNext = db->pVdbe;
58386 pTmp = pA->pNext;
58387 pA->pNext = pB->pNext;
58388 pB->pNext = pTmp;
58973 p->pNext = pVdbe->pProgram;
60276 p = p->pNext;
60740 SubProgram *pSub, *pNext;
60745 for(pSub=p->pProgram; pSub; pSub=pNext){
60746 pNext = pSub->pNext;
60768 p->pPrev->pNext = p->pNext;
60771 db->pVdbe = p->pNext;
60773 if( p->pNext ){
60774 p->pNext->pPrev = p->pPrev;
61494 for(p = db->pVdbe; p; p=p->pNext){
62831 sqlite3_stmt *pNext;
62834 pNext = (sqlite3_stmt*)pDb->pVdbe;
62836 pNext = (sqlite3_stmt*)((Vdbe*)pStmt)->pNext;
62839 return pNext;
63597 for(p=db->pSavepoint; p; p=p->pNext) n++;
66200 u.aq.pNew->pNext = db->pSavepoint;
66213 u.aq.pSavepoint = u.aq.pSavepoint->pNext
66238 int isTransaction = u.aq.pSavepoint->pNext==0 && db->isTransactionSavepoint;
66271 db->pSavepoint = u.aq.pTmp->pNext;
66282 db->pSavepoint = u.aq.pSavepoint->pNext;
68277 for(u.bu.pVdbe=db->pVdbe; u.bu.pVdbe; u.bu.pVdbe = u.bu.pVdbe->pNext){
70043 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
70404 ** SorterRecord.pNext pointer.
70409 SorterRecord *pNext;
70695 SorterRecord *pNext;
70696 for(p=pRecord; p; p=pNext){
70697 pNext = p->pNext;
70758 pp = &p1->pNext;
70759 p1 = p1->pNext;
70763 pp = &p2->pNext;
70764 p2 = p2->pNext;
70791 SorterRecord *pNext = p->pNext;
70792 p->pNext = 0;
70798 p = pNext;
70847 SorterRecord *pNext = 0;
70852 for(p=pSorter->pRecord; rc==SQLITE_OK && p; p=pNext){
70853 pNext = p->pNext;
70905 pNew->pNext = pSorter->pRecord;
71088 pSorter->pRecord = pFree->pNext;
71089 pFree->pNext = 0;
71445 FileChunk *pNext; /* Next chunk in the journal */
71492 pChunk=pChunk->pNext
71508 } while( nRead>=0 && (pChunk=pChunk->pNext)!=0 && nRead>0 );
71545 pNew->pNext = 0;
71548 pChunk->pNext = pNew;
71576 pChunk = pChunk->pNext;
72126 pNC = pNC->pNext;
72197 pTopNC = pTopNC->pNext;
72557 pSelect->pNext = 0;
72559 pSelect->pPrior->pNext = pSelect;
72603 pSelect = pSelect->pNext;
72782 sNC.pNext = pOuterNC;
72808 for(pNC=pOuterNC; pNC; pNC=pNC->pNext) nRef += pNC->nRef;
72815 for(pNC=pOuterNC; pNC; pNC=pNC->pNext) nRef -= pNC->nRef;
72857 sNC.pNext = 0;
74506 for(pIdx=pTab->pIndex; pIdx && eType==0 && affinity_ok; pIdx=pIdx->pNext){
77087 for(pTrig=sqlite3TriggerList(pParse, pTab); pTrig; pTrig=pTrig->pNext){
77125 for(pTrig=sqlite3TriggerList(pParse, pTab); pTrig; pTrig=pTrig->pNext){
77770 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
78708 0, /* pNext */
78730 0, /* pNext */
78879 pStep = pStep->pNext;
79516 pIndex->pTable->pIndex = pIndex->pNext;
79522 while( ALWAYS(p) && p->pNext!=pIndex ){ p = p->pNext; }
79523 if( ALWAYS(p && p->pNext==pIndex) ){
79524 p->pNext = pIndex->pNext;
79643 Index *pIndex, *pNext;
79652 for(pIndex = pTable->pIndex; pIndex; pIndex=pNext){
79653 pNext = pIndex->pNext;
80375 for(pIdx=p->pIndex; pIdx; pIdx=pIdx->pNext){
81071 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
81101 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
81254 pTrigger = pTrigger->pNext;
81720 for(pLoop=pTab->pIndex, n=1; pLoop; pLoop=pLoop->pNext, n++){}
81888 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
82023 pIndex->pNext = pTab->pIndex;
82027 while( pOther->pNext && pOther->pNext->onError!=OE_Replace ){
82028 pOther = pOther->pNext;
82030 pIndex->pNext = pOther->pNext;
82031 pOther->pNext = pIndex;
82800 for(pIndex=pTab->pIndex; pIndex; pIndex=pIndex->pNext){
83232 assert( pOther!=pDef && pOther->pNext!=pDef );
83233 pDef->pNext = pOther->pNext;
83234 pOther->pNext = pDef;
83236 pDef->pNext = 0;
83290 p = p->pNext;
83315 p = p->pNext;
83699 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
83755 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
83819 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
83995 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
85885 for(pIdx=pParent->pIndex; pIdx; pIdx=pIdx->pNext){
86844 FKey *pNext; /* Copy of pFKey->pNextFrom */
86847 for(pFKey=pTab->pFKey; pFKey; pFKey=pNext){
86874 pNext = pFKey->pNextFrom;
87033 for(pIndex=pTab->pIndex; pIndex; pIndex=pIndex->pNext){
87082 while( pInfo && pInfo->pTab!=pTab ){ pInfo = pInfo->pNext; }
87086 pInfo->pNext = pToplevel->pAinc;
87117 for(p = pParse->pAinc; p; p = p->pNext){
87164 for(p = pParse->pAinc; p; p = p->pNext){
87896 for(idx=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, idx++){
88194 for(iCur=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, iCur++){
88325 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){}
88380 for(i=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
88602 for(pDestIdx=pDest->pIndex; pDestIdx; pDestIdx=pDestIdx->pNext){
88606 for(pSrcIdx=pSrc->pIndex; pSrcIdx; pSrcIdx=pSrcIdx->pNext){
88688 for(pDestIdx=pDest->pIndex; pDestIdx; pDestIdx=pDestIdx->pNext){
88689 for(pSrcIdx=pSrc->pIndex; ALWAYS(pSrcIdx); pSrcIdx=pSrcIdx->pNext){
90907 pIdx = pIdx->pNext;
91083 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
91121 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
91148 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
92157 pParse->pTriggerPrg = pT->pNext;
93379 pNC = pNC->pNext;
93418 sNC.pNext = pNC;
93453 sNC.pNext = pNC;
95493 pIdx=pIdx->pNext
96233 pLoop->pNext = pRight;
96713 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
97156 pTriggerStep = pTriggerStep->pNext;
97169 ** the table. The list is connected by Trigger.pNext pointers.
97197 pTrig->pNext = (pList ? pList : pTab->pTrigger);
97424 pStepList = pStepList->pNext;
97467 pLink->pNext = pTab->pTrigger;
97745 for(pp=&pTab->pTrigger; *pp!=pTrigger; pp=&((*pp)->pNext));
97746 *pp = (*pp)->pNext;
97792 for(p=pList; p; p=p->pNext){
97850 for(pStep=pStepList; pStep; pStep=pStep->pNext){
97972 pPrg->pNext = pTop->pTriggerPrg;
98077 pPrg=pPrg->pNext
98183 for(p=pTrigger; p; p=p->pNext){
98242 for(p=pTrigger; p; p=p->pNext){
98438 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
98499 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){}
98504 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
98610 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
98617 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
98790 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
99396 for(pVtab=pTab->pVTable; pVtab && pVtab->db!=db; pVtab=pVtab->pNext);
99443 VTable *pNext = pVTable->pNext;
99448 pRet->pNext = 0;
99450 pVTable->pNext = db2->pDisconnect;
99453 pVTable = pNext;
99491 VTable *pNext = p->pNext;
99493 p = pNext;
99781 pVTable->pNext = pTab->pVTable;
100014 assert( pTab->pVTable==p && p->pNext==0 );
101892 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
103265 sPk.pNext = pFirst;
103277 for(; pProbe; pIdx=pProbe=pProbe->pNext){
108536 yymsp[-2].minor.yy203->pLast->pNext = yymsp[-1].minor.yy203;
109757 pParse->pAinc = p->pNext;
110646 p->pNext = db->lookaside.pFree;
110809 db->pSavepoint = pTmp->pNext;
110903 FuncDef *pNext, *pHash, *p;
110908 pNext = p->pNext;
110910 p = pNext;
117821 char *pNext = 0;
117830 pNext = pDocid;
117836 *pnList = pEnd - pNext;
117837 *ppIter = pNext;
122349 Fts3DeferredToken *pNext; /* Next in list of deferred tokens */
123340 char *pNext; /* Cursor variable */
123345 pNext = pReader->aNode;
123347 pNext = &pReader->aDoclist[pReader->nDoclist];
123350 if( !pNext || pNext>=&pReader->aNode[pReader->nNode] ){
123392 pNext = pReader->aNode;
123397 rc = fts3SegReaderRequire(pReader, pNext, FTS3_VARINT_MAX*2);
123402 pNext += sqlite3Fts3GetVarint32(pNext, &nPrefix);
123403 pNext += sqlite3Fts3GetVarint32(pNext, &nSuffix);
123405 || &pNext[nSuffix]>&pReader->aNode[pReader->nNode]
123420 rc = fts3SegReaderRequire(pReader, pNext, nSuffix+FTS3_VARINT_MAX);
123423 memcpy(&pReader->zTerm[nPrefix], pNext, nSuffix);
123425 pNext += nSuffix;
123426 pNext += sqlite3Fts3GetVarint32(pNext, &pReader->nDoclist);
123427 pReader->aDoclist = pNext;
125211 for(pDef=pCsr->pDeferred; pDef; pDef=pDef->pNext){
125223 Fts3DeferredToken *pNext;
125224 for(pDef=pCsr->pDeferred; pDef; pDef=pNext){
125225 pNext = pDef->pNext;
125267 for(pDef=pCsr->pDeferred; pDef && rc==SQLITE_OK; pDef=pDef->pNext){
125281 for(pDef=pCsr->pDeferred; pDef && rc==SQLITE_OK; pDef=pDef->pNext){
125333 pDeferred->pNext = pCsr->pDeferred;
127186 ** RtreeNode.pNext. RtreeNode.iNode stores the depth of the sub-tree
127292 RtreeNode *pNext; /* Next node in this hash chain */
127441 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
127450 assert( pNode->pNext==0 );
127452 pNode->pNext = pRtree->aHash[iHash];
127463 for( ; (*pp)!=pNode; pp = &(*pp)->pNext){ assert(*pp); }
127464 *pp = pNode->pNext;
127465 pNode->pNext = 0;
127531 pNode->pNext = 0;
129150 RtreeCell *pNext;
129151 pNext = PickNext(pRtree, aCell, nCell, pBboxLeft, pBboxRight, aiUsed);
129153 cellGrowth(pRtree, pBboxLeft, pNext) -
129154 cellGrowth(pRtree, pBboxRight, pNext)
129159 nodeInsertCell(pRtree, pRight, pNext);
129160 cellUnion(pRtree, pBboxRight, pNext);
129162 nodeInsertCell(pRtree, pLeft, pNext);
129163 cellUnion(pRtree, pBboxLeft, pNext);
129411 pNode->pNext = pRtree->pDeleted;
129727 pRtree->pDeleted = pLeaf->pNext;