Lines Matching refs:pNext
2384 sqlite3_vfs *pNext; /* Next registered VFS */ member
14766 SubProgram *pNext; /* Next sub-program already visited */ member
16223 LookasideSlot *pNext; /* Next buffer in the list of free buffers */ member
16556 FuncDef *pNext; /* Next function with same name */ member
16712 Savepoint *pNext; /* Parent savepoint (if any) */ member
16875 VTable *pNext; /* Next in linked list (see above) */ member
17160 Index *pNext; /* The next index associated with the same table */ member
17684 NameContext *pNext; /* Next outer name context. NULL for outermost */ member
17776 Select *pNext; /* Next select to the left in a compound */ member
17920 AutoincInfo *pNext; /* Next info block in a list of them all */ member
17946 TriggerPrg *pNext; /* Next entry in Parse.pTriggerPrg list */ member
18191 Trigger *pNext; /* Next trigger associated with the table */ member
18253 TriggerStep *pNext; /* Next in the link-list */ member
20314 Vdbe *pPrev,*pNext; /* Linked list of VDBEs with the same Vdbe.db */ member
20713 p = p->pNext; in countLookasideSlots()
20752 while( p->pNext ) p = p->pNext; in sqlite3_db_status()
20753 p->pNext = db->lookaside.pInit; in sqlite3_db_status()
20857 for(pVdbe=db->pVdbe; pVdbe; pVdbe=pVdbe->pNext){ in sqlite3_db_status()
22520 for(pVfs = vfsList; pVfs; pVfs=pVfs->pNext){ in sqlite3_vfs_find()
22536 vfsList = pVfs->pNext; in vfsUnlink()
22539 while( p->pNext && p->pNext!=pVfs ){ in vfsUnlink()
22540 p = p->pNext; in vfsUnlink()
22542 if( p->pNext==pVfs ){ in vfsUnlink()
22543 p->pNext = pVfs->pNext; in vfsUnlink()
22567 pVfs->pNext = vfsList; in sqlite3_vfs_register()
22570 pVfs->pNext = vfsList->pNext; in sqlite3_vfs_register()
22571 vfsList->pNext = pVfs; in sqlite3_vfs_register()
23098 struct MemBlockHdr *pNext, *pPrev; /* Linked list of all unfreed memory */ member
23301 pHdr->pNext = 0; in sqlite3MemMalloc()
23304 mem.pLast->pNext = pHdr; in sqlite3MemMalloc()
23353 assert( pHdr->pPrev->pNext==pHdr ); in sqlite3MemFree()
23354 pHdr->pPrev->pNext = pHdr->pNext; in sqlite3MemFree()
23357 mem.pFirst = pHdr->pNext; in sqlite3MemFree()
23359 if( pHdr->pNext ){ in sqlite3MemFree()
23360 assert( pHdr->pNext->pPrev==pHdr ); in sqlite3MemFree()
23361 pHdr->pNext->pPrev = pHdr->pPrev; in sqlite3MemFree()
23506 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){ in sqlite3MemdebugSync()
23528 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){ in sqlite3MemdebugDump()
26866 pBuf->pNext = db->lookaside.pFree;
27029 db->lookaside.pFree = pBuf->pNext;
27033 db->lookaside.pInit = pBuf->pNext;
32506 UnixUnusedFd *pNext; /* Next unused file descriptor on same file */
33398 struct vxworksFileId *pNext; /* Next in a list of them all */
33476 for(pCandidate=vxworksFileList; pCandidate; pCandidate=pCandidate->pNext){
33490 pNew->pNext = vxworksFileList;
33506 for(pp=&vxworksFileList; *pp && *pp!=pId; pp = &((*pp)->pNext)){}
33508 *pp = pId->pNext;
33663 unixInodeInfo *pNext; /* List of all unixInodeInfo objects */
33800 UnixUnusedFd *pNext;
33802 for(p=pInode->pUnused; p; p=pNext){
33803 pNext = p->pNext;
33828 assert( pInode->pPrev->pNext==pInode );
33829 pInode->pPrev->pNext = pInode->pNext;
33832 inodeList = pInode->pNext;
33834 if( pInode->pNext ){
33835 assert( pInode->pNext->pPrev==pInode );
33836 pInode->pNext->pPrev = pInode->pPrev;
33913 pInode = pInode->pNext;
33931 pInode->pNext = inodeList;
34377 p->pNext = pInode->pUnused;
36769 unixShm *pNext; /* Next unixShm with the same unixShmNode */
37111 p->pNext = pShmNode->pFirst;
37318 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
37343 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
37368 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
37437 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
37438 *pp = p->pNext;
38276 pInode = pInode->pNext;
38282 for(pp=&pInode->pUnused; *pp && (*pp)->flags!=flags; pp=&((*pp)->pNext));
38285 *pp = pUnused->pNext;
44319 winShmNode *pNext; /* Next in list of all winShmNode objects */
44347 winShm *pNext; /* Next winShm with the same winShmNode */
44449 *pp = p->pNext;
44453 pp = &p->pNext;
44524 for(pShmNode = winShmNodeList; pShmNode; pShmNode=pShmNode->pNext){
44539 pShmNode->pNext = winShmNodeList;
44586 p->pNext = pShmNode->pFirst;
44622 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
44623 *pp = p->pNext;
44674 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
44699 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
44724 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
48402 PgHdr *pNext;
48404 for(p=pCache->pDirty; p; p=pNext){
48405 pNext = p->pDirtyNext;
48753 PgHdr1 *pNext; /* Next in hash table chain */
48841 PgFreeslot *pNext; /* Next free slot */
48920 p->pNext = pcache1.pFree;
48957 pX->pNext = pCache->pFree;
48982 pcache1.pFree = pcache1.pFree->pNext;
49020 pSlot->pNext = pcache1.pFree;
49070 pCache->pFree = p->pNext;
49071 p->pNext = 0;
49117 p->pNext = pCache->pFree;
49199 PgHdr1 *pNext = p->apHash[i];
49200 while( (pPage = pNext)!=0 ){
49202 pNext = pPage->pNext;
49203 pPage->pNext = apNew[h];
49252 for(pp=&pCache->apHash[h]; (*pp)!=pPage; pp=&(*pp)->pNext);
49253 *pp = (*pp)->pNext;
49319 *pp = pPage->pNext;
49323 pp = &pPage->pNext;
49565 pPage->pNext = pCache->apHash[h];
49648 while( pPage && pPage->iKey!=iKey ){ pPage = pPage->pNext; }
49767 pp = &(*pp)->pNext;
49769 *pp = pPage->pNext;
49773 pPage->pNext = pCache->apHash[h];
50197 struct RowSetEntry *pNext, *aBucket[40];
50201 pNext = pIn->pRight;
50208 pIn = pNext;
53750 PgHdr *pNext = pList->pDirty;
53752 pList = pNext;
54699 PgHdr *pNext;
54700 for(p=pPager->pMmapFreelist; p; p=pNext){
54701 pNext = p->pDirty;
55271 PgHdr *pNext = pList->pDirty;
55275 pList = pNext;
62497 BtLock *pNext; /* Next in BtShared.pLock list */
62535 Btree *pNext; /* List of other sharable Btrees from the same db */
62619 BtShared *pNext; /* Next on a list of sharable BtShared structs */
62704 BtCursor *pNext; /* Forms a linked list of all cursors */
62953 assert( p->pNext==0 || p->pNext->pBt>p->pBt );
62955 assert( p->pNext==0 || p->pNext->db==p->db );
62957 assert( p->sharable || (p->pNext==0 && p->pPrev==0) );
63000 for(pLater=p->pNext; pLater; pLater=pLater->pNext){
63002 assert( pLater->pNext==0 || pLater->pNext->pBt>pLater->pBt );
63009 for(pLater=p->pNext; pLater; pLater=pLater->pNext){
63410 for(pLock=pBtree->pBt->pLock; pLock; pLock=pLock->pNext){
63445 for(p=pBtree->pBt->pCursor; p; p=p->pNext){
63492 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
63556 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
63573 pLock->pNext = pBt->pLock;
63612 *ppIter = pLock->pNext;
63618 ppIter = &pLock->pNext;
63649 for(pLock=pBt->pLock; pLock; pLock=pLock->pNext){
63699 for(p=pBt->pCursor; p; p=p->pNext){
63728 for(p=pBtree->pBt->pCursor; p; p=p->pNext){
63934 for(p=pBt->pCursor; p; p=p->pNext){
63964 p = p->pNext;
65602 for(pBt=GLOBAL(BtShared*,sqlite3SharedCacheList); pBt; pBt=pBt->pNext){
65727 pBt->pNext = GLOBAL(BtShared*,sqlite3SharedCacheList);
65746 p->pNext = pSib;
65750 while( pSib->pNext && (uptr)pSib->pNext->pBt<(uptr)p->pBt ){
65751 pSib = pSib->pNext;
65753 p->pNext = pSib->pNext;
65755 if( p->pNext ){
65756 p->pNext->pPrev = p;
65758 pSib->pNext = p;
65817 GLOBAL(BtShared*,sqlite3SharedCacheList) = pBt->pNext;
65820 while( ALWAYS(pList) && pList->pNext!=pBt ){
65821 pList=pList->pNext;
65824 pList->pNext = pBt->pNext;
65894 pCur = pCur->pNext;
65931 if( p->pPrev ) p->pPrev->pNext = p->pNext;
65932 if( p->pNext ) p->pNext->pPrev = p->pPrev;
66431 for(pCur=pBt->pCursor; pCur; pCur=pCur->pNext){
66593 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
66656 p->lock.pNext = pBt->pLock;
67323 for(p=pBtree->pBt->pCursor; p; p=p->pNext){
67576 for(pX=pBt->pCursor; pX; pX=pX->pNext){
67582 pCur->pNext = pBt->pCursor;
67640 pBt->pCursor = pCur->pNext;
67644 if( pPrev->pNext==pCur ){
67645 pPrev->pNext = pCur->pNext;
67648 pPrev = pPrev->pNext;
73658 sqlite3_backup *pNext; /* Next backup associated with source pager */
73958 p->pNext = *pp;
74241 pp = &(*pp)->pNext;
74243 *pp = p->pNext;
74331 }while( (p = p->pNext)!=0 );
74350 for(p=pBackup; p; p=p->pNext){
76346 p->pNext = db->pVdbe;
76431 pTmp = pA->pNext;
76432 pA->pNext = pB->pNext;
76433 pB->pNext = pTmp;
77402 p->pNext = pVdbe->pProgram;
79030 p = p->pNext;
79550 SubProgram *pSub, *pNext;
79553 for(pSub=p->pProgram; pSub; pSub=pNext){
79554 pNext = pSub->pNext;
79569 DblquoteStr *pThis, *pNext;
79570 for(pThis=p->pDblStr; pThis; pThis=pNext){
79571 pNext = pThis->pNextStr;
79598 p->pPrev->pNext = p->pNext;
79601 db->pVdbe = p->pNext;
79603 if( p->pNext ){
79604 p->pNext->pPrev = p->pPrev;
81107 for(p = db->pVdbe; p; p=p->pNext){
82934 sqlite3_stmt *pNext;
82943 pNext = (sqlite3_stmt*)pDb->pVdbe;
82945 pNext = (sqlite3_stmt*)((Vdbe*)pStmt)->pNext;
82948 return pNext;
84151 for(p=db->pSavepoint; p; p=p->pNext) n++;
86627 pNew->pNext = db->pSavepoint;
86641 pSavepoint = pSavepoint->pNext
86661 int isTransaction = pSavepoint->pNext==0 && db->isTransactionSavepoint;
86706 db->pSavepoint = pTmp->pNext;
86717 db->pSavepoint = pSavepoint->pNext;
91436 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
92166 SorterRecord *pNext; /* Pointer to next record in list */
92750 SorterRecord *pNext;
92751 for(p=pRecord; p; p=pNext){
92752 pNext = p->u.pNext;
93077 pp = &p1->u.pNext;
93078 p1 = p1->u.pNext;
93085 pp = &p2->u.pNext;
93086 p2 = p2->u.pNext;
93133 SorterRecord *pNext;
93136 pNext = 0;
93139 pNext = (SorterRecord*)&pList->aMemory[p->u.iNext];
93142 pNext = p->u.pNext;
93145 p->u.pNext = 0;
93151 p = pNext;
93301 SorterRecord *pNext = 0;
93307 for(p=pList->pList; p; p=pNext){
93308 pNext = p->u.pNext;
93579 pNew->u.pNext = pSorter->list.pList;
94374 pSorter->list.pList = pFree->u.pNext;
94375 pFree->u.pNext = 0;
94523 FileChunk *pNext; /* Next chunk in the journal */
94595 pChunk=pChunk->pNext
94612 } while( nRead>=0 && (pChunk=pChunk->pNext)!=0 && nRead>0 );
94624 FileChunk *pNext;
94625 for(pIter=p->pFirst; pIter; pIter=pNext){
94626 pNext = pIter->pNext;
94646 for(pIter=copy.pFirst; pIter; pIter=pIter->pNext){
94723 pNew->pNext = 0;
94726 pChunk->pNext = pNew;
95575 pNC = pNC->pNext;
95675 pTopNC = pTopNC->pNext;
96001 pNC2 = pNC2->pNext;
96239 pSelect->pNext = 0;
96241 pSelect->pPrior->pNext = pSelect;
96314 pSelect = pSelect->pNext;
96558 for(pNC=pOuterNC; pNC; pNC=pNC->pNext) nRef += pNC->nRef;
96565 for(pNC=pOuterNC; pNC; pNC=pNC->pNext) nRef -= pNC->nRef;
96576 sNC.pNext = pOuterNC;
96628 sNC.pNext = 0;
96695 if( p->pNext && p->pEList->nExpr!=p->pNext->pEList->nExpr ){
96696 sqlite3SelectWrongNumTermsError(pParse, p->pNext);
97058 Expr *pNext = p->pRight;
97068 pNext = p->x.pList->a[i].pExpr;
97073 p = pNext;
98401 Select *pNext = 0;
98416 pNew->pNext = pNext;
98434 pNext = pNew;
99349 for(pIdx=pTab->pIndex; pIdx && eType==0; pIdx=pIdx->pNext){
102967 RenameToken *pNext; /* Next is a list of all RenameToken objects */
103011 for(p=pParse->pRename; p; p=p->pNext){
103043 pNew->pNext = pParse->pRename;
103058 for(p=pParse->pRename; p; p=p->pNext){
103108 RenameToken *pNext;
103110 for(p=pToken; p; p=pNext){
103111 pNext = p->pNext;
103125 for(pp=&pParse->pRename; (*pp); pp=&(*pp)->pNext){
103128 *pp = pToken->pNext;
103129 pToken->pNext = pCtx->pList;
103204 for(pToken=pBest->pNext; pToken; pToken=pToken->pNext){
103207 for(pp=&pCtx->pList; *pp!=pBest; pp=&(*pp)->pNext);
103208 *pp = pBest->pNext;
103325 for(pToken=p->pRename; pToken; pToken=pToken->pNext){
103451 for(pStep=pNew->step_list; rc==SQLITE_OK && pStep; pStep=pStep->pNext){
103511 for(pStep=pTrigger->step_list; pStep; pStep=pStep->pNext){
103537 pParse->pNewIndex = pIdx->pNext;
103647 for(pIdx=sParse.pNewTable->pIndex; pIdx; pIdx=pIdx->pNext){
103650 for(pIdx=sParse.pNewIndex; pIdx; pIdx=pIdx->pNext){
103677 for(pStep=sParse.pNewTrigger->step_list; pStep; pStep=pStep->pNext){
103873 for(pStep=pTrigger->step_list; pStep; pStep=pStep->pNext){
105051 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
106558 pStep = pStep->pNext;
107321 pIndex->pTable->pIndex = pIndex->pNext;
107327 while( ALWAYS(p) && p->pNext!=pIndex ){ p = p->pNext; }
107328 if( ALWAYS(p && p->pNext==pIndex) ){
107329 p->pNext = pIndex->pNext;
107458 Index *pIndex, *pNext;
107471 for(pIndex = pTable->pIndex; pIndex; pIndex=pNext){
107472 pNext = pIndex->pNext;
107685 for(p=pTab->pIndex; p && !IsPrimaryKeyIndex(p); p=p->pNext){}
108013 for(pIdx=p->pIndex; pIdx; pIdx=pIdx->pNext){
108322 for(pIdx=p->pIndex; pIdx; pIdx=pIdx->pNext){
108707 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
108873 for(pIdx=p->pIndex; pIdx; pIdx=pIdx->pNext){
109388 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
109458 pTrigger = pTrigger->pNext;
110063 for(pLoop=pTab->pIndex, n=1; pLoop; pLoop=pLoop->pNext, n++){}
110291 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
110326 pIndex->pNext = pParse->pNewIndex;
110446 pIndex->pNext = pTab->pIndex;
110450 while( pOther->pNext && pOther->pNext->onError!=OE_Replace ){
110451 pOther = pOther->pNext;
110453 pIndex->pNext = pOther->pNext;
110454 pOther->pNext = pIndex;
111314 for(pIndex=pTab->pIndex; pIndex; pIndex=pIndex->pNext){
111847 assert( pOther!=&aDef[i] && pOther->pNext!=&aDef[i] );
111848 aDef[i].pNext = pOther->pNext;
111849 pOther->pNext = &aDef[i];
111851 aDef[i].pNext = 0;
111905 p = p->pNext;
111930 p = p->pNext;
111953 pBest->pNext = pOther;
112369 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){
112448 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
112875 for(i=0, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
115246 for(pIdx=pParent->pIndex; pIdx; pIdx=pIdx->pNext){
116415 FKey *pNext; /* Copy of pFKey->pNextFrom */
116419 for(pFKey=pTab->pFKey; pFKey; pFKey=pNext){
116446 pNext = pFKey->pNextFrom;
116636 for(pIndex=pTab->pIndex; pIndex; pIndex=pIndex->pNext){
116705 while( pInfo && pInfo->pTab!=pTab ){ pInfo = pInfo->pNext; }
116709 pInfo->pNext = pToplevel->pAinc;
116739 for(p = pParse->pAinc; p; p = p->pNext){
116806 for(p = pParse->pAinc; p; p = p->pNext){
117274 for(i=0, pIdx=pTab->pIndex; i<nIdx; pIdx=pIdx->pNext, i++){
118068 for(ix=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, ix++){
118171 if( (ix==0 && pIdx->pNext==0) /* Condition 3 */
118363 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
118476 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
118721 for(pDestIdx=pDest->pIndex; pDestIdx; pDestIdx=pDestIdx->pNext){
118725 for(pSrcIdx=pSrc->pIndex; pSrcIdx; pSrcIdx=pSrcIdx->pNext){
118839 for(pDestIdx=pDest->pIndex; pDestIdx; pDestIdx=pDestIdx->pNext){
118841 for(pSrcIdx=pSrc->pIndex; ALWAYS(pSrcIdx); pSrcIdx=pSrcIdx->pNext){
122329 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
122387 for(pIdx=pTab->pIndex, i=0; pIdx; pIdx=pIdx->pNext, i++){
122698 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){ cnt++; }
122707 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
122746 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
122799 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
122850 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
123193 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
123743 for(p=pIndex->pTable->pIndex; p; p=p->pNext){
124369 sParse.pTriggerPrg = pT->pNext;
124786 pNew->pNext = 0;
124815 while( p->pNext ) p = p->pNext;
126285 pNC = pNC->pNext;
126324 sNC.pNext = pNC;
126368 sNC.pNext = pNC;
126402 sNC.pNext = 0;
127010 pSetup->pNext = 0;
127013 pSetup->pNext = p;
127099 assert( p->pNext==0 || p->pEList->nExpr==p->pNext->pEList->nExpr );
127101 assert( p->pPrior->pNext==p );
127111 p = p->pNext;
127427 if( p->pNext==0 ){
127449 assert( p->pNext==0 );
127860 pPrior->pNext = 0;
128019 pPrior->pNext = p;
128515 if( pPrior ) pPrior->pNext = pNew;
128516 pNew->pNext = p;
129095 pIdx=pIdx->pNext
129165 p->pNext = 0;
129171 pNew->pPrior->pNext = pNew;
130170 pSub->pNext = 0;
130391 if( p->pNext==0 ) ExplainQueryPlanPop(pParse);
131120 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
131466 pTriggerStep = pTriggerStep->pNext;
131509 pTrig->pNext = (pList ? pList : pTab->pTrigger);
131742 pStepList = pStepList->pNext;
131794 pLink->pNext = pTab->pTrigger;
132102 for(pp=&pTab->pTrigger; *pp!=pTrigger; pp=&((*pp)->pNext));
132103 *pp = (*pp)->pNext;
132149 for(p=pList; p; p=p->pNext){
132209 for(pStep=pStepList; pStep; pStep=pStep->pNext){
132341 pPrg->pNext = pTop->pTriggerPrg;
132450 pPrg=pPrg->pNext
132556 for(p=pTrigger; p; p=p->pNext){
132615 for(p=pTrigger; p; p=p->pNext){
132892 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){
132991 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
133762 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
134444 for(pVtab=pTab->pVTable; pVtab && pVtab->db!=db; pVtab=pVtab->pNext);
134491 VTable *pNext = pVTable->pNext;
134496 pRet->pNext = 0;
134498 pVTable->pNext = db2->pDisconnect;
134501 pVTable = pNext;
134523 for(ppVTab=&p->pVTable; *ppVTab; ppVTab=&(*ppVTab)->pNext){
134526 *ppVTab = pVTab->pNext;
134564 VTable *pNext = p->pNext;
134566 p = pNext;
134880 pVTable->pNext = pTab->pVTable;
135091 assert( pIdx->pNext==0 );
135132 for(p=pTab->pVTable; p; p=p->pNext){
135144 assert( pTab->pVTable==p && p->pNext==0 );
139399 for(pIdx=pFrom->a[i].pTab->pIndex; pIdx; pIdx=pIdx->pNext){
140568 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
142936 sPk.pNext = pFirst;
142998 pProbe=(pSrc->pIBIndex ? 0 : pProbe->pNext), iSortIdx++
144451 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
145062 pJ = pJ->pNext;
146427 Window *pNext = p->pNextWin;
146429 p = pNext;
148216 Select *pNext = 0, *pLoop;
148218 for(pLoop=p; pLoop; pNext=pLoop, pLoop=pLoop->pPrior, cnt++){
148219 pLoop->pNext = pNext;
152382 yymsp[-2].minor.yy455->pLast->pNext = yymsp[-1].minor.yy455;
154077 pParse->pAinc = p->pNext;
155340 p->pNext = db->lookaside.pInit;
155632 db->pSavepoint = pTmp->pNext;
155833 FuncDef *pNext, *p;
155837 pNext = p->pNext;
155839 p = pNext;
164651 char *pNext = 0;
164660 pNext = pDocid;
164666 *pnList = (int)(pEnd - pNext);
164667 *ppIter = pNext;
170494 Fts3DeferredToken *pNext; /* Next in list of deferred tokens */
171692 char *pNext; /* Cursor variable */
171697 pNext = pReader->aNode;
171699 pNext = &pReader->aDoclist[pReader->nDoclist];
171702 if( !pNext || pNext>=&pReader->aNode[pReader->nNode] ){
171746 pNext = pReader->aNode;
171751 rc = fts3SegReaderRequire(pReader, pNext, FTS3_VARINT_MAX*2);
171756 pNext += fts3GetVarint32(pNext, &nPrefix);
171757 pNext += fts3GetVarint32(pNext, &nSuffix);
171759 || (&pReader->aNode[pReader->nNode] - pNext)<nSuffix
171778 rc = fts3SegReaderRequire(pReader, pNext, nSuffix+FTS3_VARINT_MAX);
171781 memcpy(&pReader->zTerm[nPrefix], pNext, nSuffix);
171783 pNext += nSuffix;
171784 pNext += fts3GetVarint32(pNext, &pReader->nDoclist);
171785 pReader->aDoclist = pNext;
175742 for(pDef=pCsr->pDeferred; pDef; pDef=pDef->pNext){
175754 Fts3DeferredToken *pNext;
175755 for(pDef=pCsr->pDeferred; pDef; pDef=pNext){
175756 pNext = pDef->pNext;
175798 for(pDef=pCsr->pDeferred; pDef && rc==SQLITE_OK; pDef=pDef->pNext){
175814 for(pDef=pCsr->pDeferred; pDef && rc==SQLITE_OK; pDef=pDef->pNext){
175866 pDeferred->pNext = pCsr->pDeferred;
181485 RtreeNode *pNext; /* Next node in this hash collision chain */
181731 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
181740 assert( pNode->pNext==0 );
181742 pNode->pNext = pRtree->aHash[iHash];
181753 for( ; (*pp)!=pNode; pp = &(*pp)->pNext){ assert(*pp); }
181754 *pp = pNode->pNext;
181755 pNode->pNext = 0;
181870 pNode->pNext = 0;
183856 pNode->pNext = pRtree->pDeleted;
184174 pRtree->pDeleted = pLeaf->pNext;
186315 GeoEvent *pNext; /* Next event in the sorted list */
186323 GeoSegment *pNext; /* Next segment in a list sorted by y */
186399 head.pNext = 0;
186403 pLast->pNext = pRight;
186405 pRight = pRight->pNext;
186407 pLast->pNext = pLeft;
186409 pLeft = pLeft->pNext;
186412 pLast->pNext = pRight ? pRight : pLeft;
186413 return head.pNext;
186426 p->pNext = 0;
186446 head.pNext = 0;
186452 pLast->pNext = pRight;
186454 pRight = pRight->pNext;
186456 pLast->pNext = pLeft;
186458 pLeft = pLeft->pNext;
186461 pLast->pNext = pRight ? pRight : pLeft;
186462 return head.pNext;
186476 pList = pList->pNext;
186477 p->pNext = 0;
186531 for(pSeg=pActive; pSeg; pSeg=pSeg->pNext){
186542 for(pSeg=pActive; pSeg; pSeg=pSeg->pNext){
186571 pSeg->pNext = pActive;
186577 pActive = pActive->pNext;
186579 for(pSeg=pActive; pSeg; pSeg=pSeg->pNext){
186580 if( pSeg->pNext==pThisEvent->pSeg ){
186581 pSeg->pNext = pSeg->pNext->pNext;
186587 pThisEvent = pThisEvent->pNext;
189088 RbuUpdateStmt *pNext;
189669 RbuUpdateStmt *pTmp = pUp->pNext;
191137 for(pp=&pIter->pRbuUpdate; *pp; pp=&((*pp)->pNext)){
191140 *pp = pUp->pNext;
191141 pUp->pNext = pIter->pRbuUpdate;
191148 assert( pUp==0 || pUp->pNext==0 );
191151 for(pp=&pIter->pRbuUpdate; *pp!=pUp; pp=&((*pp)->pNext));
191166 pUp->pNext = pIter->pRbuUpdate;
195084 sqlite3_session *pNext; /* Next session object on same db. */
195149 SessionTable *pNext;
195328 SessionChange *pNext; /* For hash-table collisions */
195950 SessionChange *pNext;
195951 for(p=pTab->apChange[i]; p; p=pNext){
195954 pNext = p->pNext;
195955 p->pNext = apNew[iHash];
196237 for(pC=pTab->apChange[iHash]; pC; pC=pC->pNext){
196301 pChange->pNext = pTab->apChange[iHash];
196335 for(pRet=pSession->pTable; pRet; pRet=pRet->pNext){
196347 for(pRet=pSession->pTable; pRet->pNext; pRet=pRet->pNext);
196375 for(pSession=(sqlite3_session *)pCtx; pSession; pSession=pSession->pNext){
196729 pNew->pNext = pOld;
196741 SessionTable *pNext;
196744 for(pTab=pList; pTab; pTab=pNext){
196746 pNext = pTab->pNext;
196751 pNextChange = p->pNext;
196773 for(pp=&pHead; ALWAYS((*pp)!=0); pp=&((*pp)->pNext)){
196775 *pp = (*pp)->pNext;
196828 for(pTab=pSession->pTable; pTab; pTab=pTab->pNext){
196847 for(ppTab=&pSession->pTable; *ppTab; ppTab=&(*ppTab)->pNext);
197419 for(pTab=pSession->pTable; rc==SQLITE_OK && pTab; pTab=pTab->pNext){
197449 for(p=pTab->apChange[i]; rc==SQLITE_OK && p; p=p->pNext){
197598 for(pTab=pSession->pTable; pTab && ret==0; pTab=pTab->pNext){
199857 for(pTab = pGrp->pList; pTab; pTab=pTab->pNext){
199879 for(ppTab=&pGrp->pList; *ppTab; ppTab=&(*ppTab)->pNext);
199898 for(pp=&pTab->apChange[iHash]; *pp; pp=&(*pp)->pNext){
199907 *pp = (*pp)->pNext;
199918 pChange->pNext = pTab->apChange[iHash];
199961 for(pTab=pGrp->pList; rc==SQLITE_OK && pTab; pTab=pTab->pNext){
199968 for(p=pTab->apChange[i]; p; p=p->pNext){
200287 for(pTab=p->grp.pList; pTab; pTab=pTab->pNext){
200307 for(pChange=pTab->apChange[iHash]; pChange; pChange=pChange->pNext){
204428 Fts5TermsetEntry *pNext;
204464 for(pEntry=p->apHash[hash]; pEntry; pEntry=pEntry->pNext){
204481 pEntry->pNext = p->apHash[hash];
204497 pEntry = pEntry->pNext;
206569 Fts5ExprNode *pNext = pNode->apChild[0];
206574 int cmp = fts5NodeCompare(pExpr, pNext, pChild);
206576 pNext = pChild;
206579 pNode->iRowid = pNext->iRowid;
206580 pNode->bEof = pNext->bEof;
206581 pNode->bNomatch = pNext->bNomatch;
206903 Fts5ExprTerm *pNext;
206907 for(pSyn=pTerm->pSynonym; pSyn; pSyn=pNext){
206908 pNext = pSyn->pSynonym;
208449 Fts5HashEntry *pNext;
208451 for(pSlot=pHash->aSlot[i]; pSlot; pSlot=pNext){
208452 pNext = pSlot->pHashNext;
215552 Fts5Auxiliary *pNext; /* Next registered auxiliary function */
215565 Fts5TokenizerModule *pNext; /* Next registered tokenizer module */
215622 Fts5Cursor *pNext; /* Next cursor in Fts5Cursor.pCsr list */
215696 Fts5Auxdata *pNext; /* Next object in linked list */
216069 for(pCsr=pTab->pGlobal->pCsr; pCsr; pCsr=pCsr->pNext){
216093 pCsr->pNext = pGlobal->pCsr;
216128 Fts5Auxdata *pNext;
216146 for(pData=pCsr->pAuxdata; pData; pData=pNext){
216147 pNext = pData->pNext;
216176 for(pp=&pTab->pGlobal->pCsr; (*pp)!=pCsr; pp=&(*pp)->pNext);
216177 *pp = pCsr->pNext;
216229 for(pCsr=pTab->pGlobal->pCsr; pCsr; pCsr=pCsr->pNext){
216462 for(pAux=pTab->pGlobal->pAux; pAux; pAux=pAux->pNext){
217428 for(pData=pCsr->pAuxdata; pData; pData=pData->pNext){
217444 pData->pNext = pCsr->pAuxdata;
217458 for(pData=pCsr->pAuxdata; pData; pData=pData->pNext){
217669 for(pCsr=pGlobal->pCsr; pCsr; pCsr=pCsr->pNext){
217940 pAux->pNext = pGlobal->pAux;
217977 pNew->pNext = pGlobal->pTok;
217979 if( pNew->pNext==0 ){
217998 for(pMod=pGlobal->pTok; pMod; pMod=pMod->pNext){
218069 pNextAux = pAux->pNext;
218075 pNextTok = pTok->pNext;
