Lines Matching refs:pNext

1812   sqlite3_vfs *pNext;      /* Next registered VFS */  member
16969 SubProgram *pNext; /* Next sub-program already visited */ member
17980 LookasideSlot *pNext; /* Next buffer in the list of free buffers */ member
18342 FuncDef *pNext; /* Next function with same name */ member
18564 Savepoint *pNext; /* Parent savepoint (if any) */ member
18782 VTable *pNext; /* Next in linked list (see above) */ member
19151 Index *pNext; /* The next index associated with the same table */ member
19862 NameContext *pNext; /* Next outer name context. NULL for outermost */ member
19971 Select *pNext; /* Next select to the left in a compound */ member
20148 AutoincInfo *pNext; /* Next info block in a list of them all */ member
20174 TriggerPrg *pNext; /* Next entry in Parse.pTriggerPrg list */ member
20228 ParseCleanup *pNext; /* Next cleanup task */ member
20478 Trigger *pNext; /* Next trigger associated with the table */ member
20547 TriggerStep *pNext; /* Next in the link-list */ member
20881 DbClientData *pNext; /* Next in a linked list */ member
24492 p = p->pNext; in countLookasideSlots()
24536 while( p->pNext ) p = p->pNext; in sqlite3_db_status()
24537 p->pNext = db->lookaside.pInit; in sqlite3_db_status()
24544 while( p->pNext ) p = p->pNext; in sqlite3_db_status()
24545 p->pNext = db->lookaside.pSmallInit; in sqlite3_db_status()
26911 for(pVfs = vfsList; pVfs; pVfs=pVfs->pNext){ in sqlite3_vfs_find()
26927 vfsList = pVfs->pNext; in vfsUnlink()
26930 while( p->pNext && p->pNext!=pVfs ){ in vfsUnlink()
26931 p = p->pNext; in vfsUnlink()
26933 if( p->pNext==pVfs ){ in vfsUnlink()
26934 p->pNext = pVfs->pNext; in vfsUnlink()
26958 pVfs->pNext = vfsList; in sqlite3_vfs_register()
26961 pVfs->pNext = vfsList->pNext; in sqlite3_vfs_register()
26962 vfsList->pNext = pVfs; in sqlite3_vfs_register()
27489 struct MemBlockHdr *pNext, *pPrev; /* Linked list of all unfreed memory */ member
27692 pHdr->pNext = 0; in sqlite3MemMalloc()
27695 mem.pLast->pNext = pHdr; in sqlite3MemMalloc()
27744 assert( pHdr->pPrev->pNext==pHdr ); in sqlite3MemFree()
27745 pHdr->pPrev->pNext = pHdr->pNext; in sqlite3MemFree()
27748 mem.pFirst = pHdr->pNext; in sqlite3MemFree()
27750 if( pHdr->pNext ){ in sqlite3MemFree()
27751 assert( pHdr->pNext->pPrev==pHdr ); in sqlite3MemFree()
27752 pHdr->pNext->pPrev = pHdr->pPrev; in sqlite3MemFree()
27897 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){ in sqlite3MemdebugSync()
27919 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){ in sqlite3MemdebugDump()
31181 pBuf->pNext = db->lookaside.pSmallFree; in sqlite3DbFreeNN()
31192 pBuf->pNext = db->lookaside.pFree; in sqlite3DbFreeNN()
31220 pBuf->pNext = db->lookaside.pSmallFree; in sqlite3DbNNFreeNN()
31231 pBuf->pNext = db->lookaside.pFree; in sqlite3DbNNFreeNN()
31411 db->lookaside.pSmallFree = pBuf->pNext; in sqlite3DbMallocRawNN()
31415 db->lookaside.pSmallInit = pBuf->pNext; in sqlite3DbMallocRawNN()
31422 db->lookaside.pFree = pBuf->pNext; in sqlite3DbMallocRawNN()
31426 db->lookaside.pInit = pBuf->pNext; in sqlite3DbMallocRawNN()
34396 moreToFollow || (showFullList && pStep->pNext!=0)); in sqlite3TreeViewTriggerStep()
34398 if( cnt++ && pStep->pNext==0 ){ in sqlite3TreeViewTriggerStep()
34403 }while( showFullList && (pStep = pStep->pNext)!=0 ); in sqlite3TreeViewTriggerStep()
34419 moreToFollow || (showFullList && pTrigger->pNext!=0)); in sqlite3TreeViewTrigger()
34421 if( cnt++ && pTrigger->pNext==0 ){ in sqlite3TreeViewTrigger()
34429 }while( showFullList && (pTrigger = pTrigger->pNext)!=0 ); in sqlite3TreeViewTrigger()
39092 UnixUnusedFd *pNext; /* Next unused file descriptor on same file */ member
39797 struct vxworksFileId *pNext; /* Next in a list of them all */ member
39875 for(pCandidate=vxworksFileList; pCandidate; pCandidate=pCandidate->pNext){ in vxworksFindFileId()
39889 pNew->pNext = vxworksFileList; in vxworksFindFileId()
39905 for(pp=&vxworksFileList; *pp && *pp!=pId; pp = &((*pp)->pNext)){} in vxworksReleaseFileId()
39907 *pp = pId->pNext; in vxworksReleaseFileId()
40062 unixInodeInfo *pNext; /* List of all unixInodeInfo objects */ member
40203 UnixUnusedFd *pNext; in closePendingFds() local
40205 for(p=pInode->pUnused; p; p=pNext){ in closePendingFds()
40206 pNext = p->pNext; in closePendingFds()
40231 assert( pInode->pPrev->pNext==pInode ); in releaseInodeInfo()
40232 pInode->pPrev->pNext = pInode->pNext; in releaseInodeInfo()
40235 inodeList = pInode->pNext; in releaseInodeInfo()
40237 if( pInode->pNext ){ in releaseInodeInfo()
40238 assert( pInode->pNext->pPrev==pInode ); in releaseInodeInfo()
40239 pInode->pNext->pPrev = pInode->pPrev; in releaseInodeInfo()
40316 pInode = pInode->pNext; in findInodeInfo()
40334 pInode->pNext = inodeList; in findInodeInfo()
40791 p->pNext = pInode->pUnused; in setPendingFd()
43214 unixShm *pNext; /* Next unixShm with the same unixShmNode */ member
43637 p->pNext = pShmNode->pFirst; in unixOpenSharedMemory()
43820 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){ in assertLockingArrayOk()
44086 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){} in unixShmUnmap()
44087 *pp = p->pNext; in unixShmUnmap()
44949 pInode = pInode->pNext; in findReusableFd()
44956 for(pp=&pInode->pUnused; *pp && (*pp)->flags!=flags; pp=&((*pp)->pNext)); in findReusableFd()
44959 *pp = pUnused->pNext; in findReusableFd()
51195 winShmNode *pNext; /* Next in list of all winShmNode objects */ member
51269 *pp = p->pNext;
51273 pp = &p->pNext;
51547 for(pShmNode = winShmNodeList; pShmNode; pShmNode=pShmNode->pNext){
51572 pShmNode->pNext = winShmNodeList;
55868 PgHdr *pNext; local
55870 for(p=pCache->pDirty; p; p=pNext){
55871 pNext = p->pDirtyNext;
56230 PgHdr1 *pNext; /* Next in hash table chain */ member
56318 PgFreeslot *pNext; /* Next free slot */ member
56393 p->pNext = pcache1.pFree;
56431 pX->pNext = pCache->pFree;
56456 pcache1.pFree = pcache1.pFree->pNext;
56494 pSlot->pNext = pcache1.pFree;
56545 pCache->pFree = p->pNext;
56546 p->pNext = 0;
56584 p->pNext = pCache->pFree;
56663 PgHdr1 *pNext = p->apHash[i]; local
56664 while( (pPage = pNext)!=0 ){
56666 pNext = pPage->pNext;
56667 pPage->pNext = apNew[h];
56716 for(pp=&pCache->apHash[h]; (*pp)!=pPage; pp=&(*pp)->pNext);
56717 *pp = (*pp)->pNext;
56783 *pp = pPage->pNext;
56787 pp = &pPage->pNext;
57035 pPage->pNext = pCache->apHash[h];
57118 while( pPage && pPage->iKey!=iKey ){ pPage = pPage->pNext; }
57239 pp = &(*pp)->pNext;
57241 *pp = pPage->pNext;
57246 pPage->pNext = pCache->apHash[hNew];
57667 struct RowSetEntry *pNext, *aBucket[40]; local
57671 pNext = pIn->pRight;
57678 pIn = pNext;
61218 PgHdr *pNext = pList->pDirty; local
61220 pList = pNext;
62173 PgHdr *pNext; local
62174 for(p=pPager->pMmapFreelist; p; p=pNext){
62175 pNext = p->pDirty;
62733 PgHdr *pNext = pList->pDirty; local
62737 pList = pNext;
70833 BtLock *pNext; /* Next in BtShared.pLock list */ member
70871 Btree *pNext; /* List of other sharable Btrees from the same db */ member
70970 BtShared *pNext; /* Next on a list of sharable BtShared structs */ member
71062 BtCursor *pNext; /* Forms a linked list of all cursors */ member
71317 assert( p->pNext==0 || p->pNext->pBt>p->pBt );
71319 assert( p->pNext==0 || p->pNext->db==p->db );
71321 assert( p->sharable || (p->pNext==0 && p->pPrev==0) );
71364 for(pLater=p->pNext; pLater; pLater=pLater->pNext){
71366 assert( pLater->pNext==0 || pLater->pNext->pBt>pLater->pBt );
71373 for(pLater=p->pNext; pLater; pLater=pLater->pNext){
71733 for(pLock=pBt->pLock; pLock; pLock=pLock->pNext){
71736 while( pLock->pNext && pLock->pBtree==pLock->pNext->pBtree ){
71737 pLock = pLock->pNext;
71829 for(pLock=pBtree->pBt->pLock; pLock; pLock=pLock->pNext){
71864 for(p=pBtree->pBt->pCursor; p; p=p->pNext){
71911 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
71977 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
71994 pLock->pNext = pBt->pLock;
72035 *ppIter = pLock->pNext;
72041 ppIter = &pLock->pNext;
72075 for(pLock=pBt->pLock; pLock; pLock=pLock->pNext){
72125 for(p=pBt->pCursor; p; p=p->pNext){
72154 for(p=pBtree->pBt->pCursor; p; p=p->pNext){
72363 for(p=pBt->pCursor; p; p=p->pNext){
72393 p = p->pNext;
74176 for(pBt=GLOBAL(BtShared*,sqlite3SharedCacheList); pBt; pBt=pBt->pNext){
74304 pBt->pNext = GLOBAL(BtShared*,sqlite3SharedCacheList);
74323 p->pNext = pSib;
74327 while( pSib->pNext && (uptr)pSib->pNext->pBt<(uptr)p->pBt ){
74328 pSib = pSib->pNext;
74330 p->pNext = pSib->pNext;
74332 if( p->pNext ){
74333 p->pNext->pPrev = p;
74335 pSib->pNext = p;
74394 GLOBAL(BtShared*,sqlite3SharedCacheList) = pBt->pNext;
74397 while( ALWAYS(pList) && pList->pNext!=pBt ){
74398 pList=pList->pNext;
74401 pList->pNext = pBt->pNext;
74430 pBt->pCursor = pCur->pNext; /* Unlink the cursor */
74482 pCur = pCur->pNext;
74520 if( p->pPrev ) p->pPrev->pNext = p->pNext;
74521 if( p->pNext ) p->pNext->pPrev = p->pPrev;
75021 for(pCur=pBt->pCursor; pCur; pCur=pCur->pNext){
75188 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
75274 p->lock.pNext = pBt->pLock;
75998 for(p=pBtree->pBt->pCursor; p; p=p->pNext){
76258 for(pX=pBt->pCursor; pX; pX=pX->pNext){
76265 pCur->pNext = pBt->pCursor;
76328 if( pCur->pNext!=0 ) return 0;
76357 pBt->pCursor = pCur->pNext;
76361 if( pPrev->pNext==pCur ){
76362 pPrev->pNext = pCur->pNext;
76365 pPrev = pPrev->pNext;
80590 for(pOther=pCur->pBt->pCursor; pOther; pOther=pOther->pNext){
83106 sqlite3_backup *pNext; /* Next backup associated with source pager */ member
83372 p->pNext = *pp;
83659 pp = &(*pp)->pNext;
83662 *pp = p->pNext;
83750 }while( (p = p->pNext)!=0 );
83769 for(p=pBackup; p; p=p->pNext){
87353 p->pNext = pVdbe->pProgram;
89619 SubProgram *pSub, *pNext; local
89626 for(pSub=p->pProgram; pSub; pSub=pNext){
89627 pNext = pSub->pNext;
93512 sqlite3_stmt *pNext; local
93521 pNext = (sqlite3_stmt*)pDb->pVdbe;
93523 pNext = (sqlite3_stmt*)((Vdbe*)pStmt)->pVNext;
93526 return pNext;
94995 for(p=db->pSavepoint; p; p=p->pNext) n++;
98165 pNew->pNext = db->pSavepoint;
98180 pSavepoint = pSavepoint->pNext
98200 int isTransaction = pSavepoint->pNext==0 && db->isTransactionSavepoint;
98251 db->pSavepoint = pTmp->pNext;
98262 db->pSavepoint = pSavepoint->pNext;
103809 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
104547 SorterRecord *pNext; /* Pointer to next record in list */
105141 SorterRecord *pNext;
105142 for(p=pRecord; p; p=pNext){
105143 pNext = p->u.pNext;
105469 pp = &p1->u.pNext;
105470 p1 = p1->u.pNext;
105477 pp = &p2->u.pNext;
105478 p2 = p2->u.pNext;
105521 SorterRecord *pNext;
105524 pNext = 0;
105527 pNext = (SorterRecord*)&pList->aMemory[p->u.iNext];
105530 pNext = p->u.pNext;
105533 p->u.pNext = 0;
105543 p = pNext;
105692 SorterRecord *pNext = 0;
105698 for(p=pList->pList; p; p=pNext){
105699 pNext = p->u.pNext;
105973 pNew->u.pNext = pSorter->list.pList;
106769 pSorter->list.pList = pFree->u.pNext;
106770 pFree->u.pNext = 0;
107367 FileChunk *pNext; /* Next chunk in the journal */
107433 pChunk=pChunk->pNext
107450 } while( nRead>=0 && (pChunk=pChunk->pNext)!=0 && nRead>0 );
107462 FileChunk *pNext;
107463 for(pIter=pFirst; pIter; pIter=pNext){
107464 pNext = pIter->pNext;
107483 for(pIter=copy.pFirst; pIter; pIter=pIter->pNext){
107561 pNew->pNext = 0;
107564 pChunk->pNext = pNew;
107589 assert( p->endpoint.pChunk==0 || p->endpoint.pChunk->pNext==0 );
107597 for(pIter=p->pFirst; ALWAYS(pIter) && iOff<size; pIter=pIter->pNext){
107601 memjrnlFreeChunks(pIter->pNext);
107602 pIter->pNext = 0;
108735 pNC = pNC->pNext;
108882 pTopNC = pTopNC->pNext;
109058 for(i=0, p=pNC; p && i<ArraySize(anRef); p=p->pNext, i++){
109068 for(i=0, p=pNC; p; p=p->pNext, i++){
109087 for(i=0, p=pNC; p && i<ArraySize(anRef); p=p->pNext, i++){
109373 pNC2 = pNC2->pNext;
109637 pSelect->pNext = 0;
109639 pSelect->pPrior->pNext = pSelect;
109708 pSelect = pSelect->pNext;
109980 sNC.pNext = pOuterNC;
110047 sNC.pNext = 0;
110105 if( p->pNext && p->pEList->nExpr!=p->pNext->pEList->nExpr ){
110106 sqlite3SelectWrongNumTermsError(pParse, p->pNext);
110632 Expr *pNext = p->pRight;
110639 pNext = p->x.pList->a[i].pExpr;
110644 p = pNext;
112293 Select *pNext = 0;
112308 pNew->pNext = pNext;
112328 pNew->pNext = 0;
112334 pNext = pNew;
113584 for(pIdx=pTab->pIndex; pIdx && eType==0; pIdx=pIdx->pNext){
118470 RenameToken *pNext; /* Next is a list of all RenameToken objects */
118516 for(p=pParse->pRename; p; p=p->pNext){
118554 pNew->pNext = pParse->pRename;
118570 for(p=pParse->pRename; p; p=p->pNext){
118715 RenameToken *pNext;
118717 for(p=pToken; p; p=pNext){
118718 pNext = p->pNext;
118741 for(pp=&pParse->pRename; (*pp); pp=&(*pp)->pNext){
118745 *pp = pToken->pNext;
118746 pToken->pNext = pCtx->pList;
118811 for(pToken=pBest->pNext; pToken; pToken=pToken->pNext){
118814 for(pp=&pCtx->pList; *pp!=pBest; pp=&(*pp)->pNext);
118815 *pp = pBest->pNext;
118944 for(pToken=p->pRename; pToken; pToken=pToken->pNext){
119112 for(pStep=pNew->step_list; rc==SQLITE_OK && pStep; pStep=pStep->pNext){
119207 for(pStep=pTrigger->step_list; pStep; pStep=pStep->pNext){
119243 pParse->pNewIndex = pIdx->pNext;
119356 for(pIdx=sParse.pNewTable->pIndex; pIdx; pIdx=pIdx->pNext){
119359 for(pIdx=sParse.pNewIndex; pIdx; pIdx=pIdx->pNext){
119394 for(pStep=sParse.pNewTrigger->step_list; pStep; pStep=pStep->pNext){
119609 for(pStep=pTrigger->step_list; pStep; pStep=pStep->pNext){
121159 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
121408 for(pX=pTab->pIndex; pX; pX=pX->pNext){
122732 pStep = pStep->pNext;
123567 pIndex->pTable->pIndex = pIndex->pNext;
123573 while( ALWAYS(p) && p->pNext!=pIndex ){ p = p->pNext; }
123574 if( ALWAYS(p && p->pNext==pIndex) ){
123575 p->pNext = pIndex->pNext;
123792 Index *pIndex, *pNext;
123810 for(pIndex = pTable->pIndex; pIndex; pIndex=pNext){
123811 pNext = pIndex->pNext;
124063 for(p=pTab->pIndex; p && !IsPrimaryKeyIndex(p); p=p->pNext){}
124606 for(pIdx=p->pIndex; pIdx; pIdx=pIdx->pNext){
124947 for(pIdx=p->pIndex; pIdx; pIdx=pIdx->pNext){
125443 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
125772 for(pIdx=p->pIndex; pIdx; pIdx=pIdx->pNext){
126327 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
126397 pTrigger = pTrigger->pNext;
127085 for(pLoop=pTab->pIndex, n=1; pLoop; pLoop=pLoop->pNext, n++){}
127323 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
127358 pIndex->pNext = pParse->pNewIndex;
127470 pIndex->pNext = pTab->pIndex;
127490 for(ppFrom=&pTab->pIndex; (pThis = *ppFrom)!=0; ppFrom=&pThis->pNext){
127491 Index *pNext;
127493 while( (pNext = pThis->pNext)!=0 && pNext->onError!=OE_Replace ){
127494 *ppFrom = pNext;
127495 pThis->pNext = pNext->pNext;
127496 pNext->pNext = pThis;
127497 ppFrom = &pNext->pNext;
127505 for(pThis = pTab->pIndex; pThis; pThis=pThis->pNext){
127507 || pThis->pNext==0
127508 || pThis->pNext->onError==OE_Replace );
128531 for(pIndex=pTab->pIndex; pIndex; pIndex=pIndex->pNext){
129168 assert( pOther!=&aDef[i] && pOther->pNext!=&aDef[i] );
129169 aDef[i].pNext = pOther->pNext;
129170 pOther->pNext = &aDef[i];
129172 aDef[i].pNext = 0;
129226 p = p->pNext;
129251 p = p->pNext;
129274 pBest->pNext = pOther;
129472 && (pTrigger==0 || (pTrigger->bReturning && pTrigger->pNext==0))
129751 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){
129831 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
130263 for(i=0, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
133556 for(pIdx=pParent->pIndex; pIdx; pIdx=pIdx->pNext){
134776 FKey *pNext; /* Copy of pFKey->pNextFrom */
134780 for(pFKey=pTab->u.tab.pFKey; pFKey; pFKey=pNext){
134807 pNext = pFKey->pNextFrom;
135060 for(pIndex=pTab->pIndex; pIndex; pIndex=pIndex->pNext){
135248 while( pInfo && pInfo->pTab!=pTab ){ pInfo = pInfo->pNext; }
135254 pInfo->pNext = pToplevel->pAinc;
135284 for(p = pParse->pAinc; p; p = p->pNext){
135351 for(p = pParse->pAinc; p; p = p->pNext){
135541 assert( pLeft->pNext==0 );
135542 assert( pRet->pNext==0 );
136092 for(i=0, pIdx=pTab->pIndex; i<nIdx; pIdx=pIdx->pNext, i++){
136610 pIter->u.lx.pIdx = pIter->u.lx.pIdx->pNext;
136970 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){
136986 pIdx = pIdx->pNext;
136995 for(jj=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, jj++){
137309 if( (ix==0 && pIdx->pNext==0) /* Condition 3 */
137617 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
137620 || pIdx->pNext==0
137621 || pIdx->pNext->onError==OE_Replace );
137720 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
137998 for(pDestIdx=pDest->pIndex; pDestIdx; pDestIdx=pDestIdx->pNext){
138002 for(pSrcIdx=pSrc->pIndex; pSrcIdx; pSrcIdx=pSrcIdx->pNext){
138134 for(pDestIdx=pDest->pIndex; pDestIdx; pDestIdx=pDestIdx->pNext){
138136 for(pSrcIdx=pSrc->pIndex; ALWAYS(pSrcIdx); pSrcIdx=pSrcIdx->pNext){
141014 for(; p; p=p->pNext){
142008 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
142075 for(pIdx=pTab->pIndex, i=0; pIdx; pIdx=pIdx->pNext, i++){
142409 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){ cnt++; }
142422 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
142456 for(pIdx=pTab->pIndex; ALWAYS(pIdx); pIdx=pIdx->pNext){
142461 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
142503 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
142712 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
143204 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
143809 for(p=pIndex->pTable->pIndex; p; p=p->pNext){
144327 pParse->pCleanup = pCleanup->pNext;
144383 pCleanup->pNext = pParse->pCleanup;
144572 sParse.pTriggerPrg = pT->pNext;
145003 pNew->pNext = 0;
145034 while( p->pNext ) p = p->pNext;
146812 pNC = pNC->pNext;
146853 sNC.pNext = pNC;
146899 sNC.pNext = pNC;
146933 sNC.pNext = 0;
147226 while( pCol->affinity<=SQLITE_AFF_NONE && pS2->pNext!=0 ){
147228 pS2 = pS2->pNext;
147234 if( pCol->affinity>=SQLITE_AFF_TEXT && (pS2->pNext || pS2!=pSelect) ){
147235 for(pS2=pS2->pNext; pS2; pS2=pS2->pNext){
147608 pSetup->pNext = 0;
147611 pSetup->pNext = p;
147693 assert( p->pNext==0 || p->pEList->nExpr==p->pNext->pEList->nExpr );
147698 assert( p->pPrior->pNext==p );
147708 p = p->pNext;
148038 if( p->pNext==0 ){
148061 assert( p->pNext==0 );
148486 assert( pSplit->pPrior->pNext==pSplit );
148498 pPrior->pNext = 0;
148658 pPrior->pNext = pSplit;
149460 if( pPrior ) pPrior->pNext = pNew;
149461 pNew->pNext = p;
150411 pIdx=pIdx->pNext
150494 p->pNext = 0;
150503 pNew->pPrior->pNext = pNew;
150731 assert( pRecTerm->pNext!=0 );
150732 assert( (pRecTerm->pNext->selFlags & SF_Recursive)!=0 );
152108 pSub->pNext = 0;
152584 if( p->pNext==0 ) ExplainQueryPlanPop(pParse);
153490 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
153885 pTriggerStep = pTriggerStep->pNext;
153929 pTrig->pNext = pList;
153940 pTrig->pNext = pList;
153949 for(pX=pList; pX; pX=pX->pNext){
154200 pStepList = pStepList->pNext;
154230 for(pStep=pTrig->step_list; pStep; pStep=pStep->pNext){
154271 pLink->pNext = pTab->pTrigger;
154588 for(pp=&pTab->pTrigger; *pp; pp=&((*pp)->pNext)){
154590 *pp = (*pp)->pNext;
154647 || (pList->bReturning && pList->pNext==0) );
154660 while( ALWAYS(p->pNext) && p->pNext!=pTab->pTrigger ) p = p->pNext;
154661 p->pNext = 0;
154688 p = p->pNext;
154994 for(pStep=pStepList; pStep; pStep=pStep->pNext){
155126 pPrg->pNext = pTop->pTriggerPrg;
155235 pPrg=pPrg->pNext
155342 for(p=pTrigger; p; p=p->pNext){
155412 for(p=pTrigger; p; p=p->pNext){
155859 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){
156002 for(nAllIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nAllIdx++){
156823 Upsert *pNext = p->pNextUpsert;
156830 p = pNext;
156861 Upsert *pNext /* Next ON CONFLICT clause in the list */
156870 sqlite3UpsertDelete(db, pNext);
156878 pNew->pNextUpsert = pNext;
156952 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
157028 Upsert *pNext;
157030 pNext = pUpsert->pNextUpsert;
157032 if( pNext==0 ) return 1;
157033 if( pNext->pUpsertTarget==0 ) return 1;
157034 if( pNext->pUpsertIdx==0 ) return 1;
157035 if( !pNext->isDup ) return 0;
157036 pNext = pNext->pNextUpsert;
157694 HashElem *pThis, *pNext;
157698 for(pThis=sqliteHashFirst(&db->aModule); pThis; pThis=pNext){
157700 pNext = sqliteHashNext(pThis);
157748 for(pVtab=pTab->u.vtab.p; pVtab && pVtab->db!=db; pVtab=pVtab->pNext);
157800 VTable *pNext = pVTable->pNext;
157805 pRet->pNext = 0;
157807 pVTable->pNext = db2->pDisconnect;
157810 pVTable = pNext;
157832 for(ppVTab=&p->u.vtab.p; *ppVTab; ppVTab=&(*ppVTab)->pNext){
157835 *ppVTab = pVTab->pNext;
157872 VTable *pNext = p->pNext;
157874 p = pNext;
158203 pVTable->pNext = pTab->u.vtab.p;
158444 assert( pIdx->pNext==0 );
158490 for(p=pTab->u.vtab.p; p; p=p->pNext){
158504 assert( pTab->u.vtab.p==p && p->pNext==0 );
158998 WhereMemBlock *pNext; /* Next block in the chain */
163572 for(pIdx=pFrom->a[j].pSTab->pIndex; pIdx; pIdx=pIdx->pNext){
163616 for(pIdx=pFrom->a[i].pSTab->pIndex; pIdx; pIdx=pIdx->pNext){
164735 pBlock->pNext = pWInfo->pMemToFree;
165146 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
165347 for(pIdx = pTab->pIndex; pIdx!=0; pIdx=pIdx->pNext){
167079 WhereMemBlock *pNext = pWInfo->pMemToFree->pNext;
167081 pWInfo->pMemToFree = pNext;
168423 sPk.pNext = pFirst;
168487 pProbe=(pSrc->fg.isIndexedBy ? 0 : pProbe->pNext), iSortIdx++
170692 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
171626 pJ = pJ->pNext;
173306 Window *pNext = p->pNextWin;
173308 p = pNext;
175397 Select *pNext = 0, *pLoop = p;
175400 pLoop->pNext = pNext;
175402 pNext = pLoop;
175409 sqlite3SelectOpName(pNext->op));
180139 yymsp[-2].minor.yy319->pLast->pNext = yymsp[-1].minor.yy319;
183483 p->pNext = db->lookaside.pInit;
183492 p->pNext = db->lookaside.pSmallInit;
183811 db->pSavepoint = pTmp->pNext;
183932 db->pDbData = p->pNext;
184052 FuncDef *pNext, *p;
184056 pNext = p->pNext;
184058 p = pNext;
186448 for(p=db->pDbData; p; p=p->pNext){
186471 for(p=db->pDbData; p && strcmp(p->zName,zName); p=p->pNext){
186472 pp = &p->pNext;
186478 *pp = p->pNext;
186495 p->pNext = db->pDbData;
193634 char *pNext = 0;
193643 pNext = pDocid;
193649 *pnList = (int)(pEnd - pNext);
193650 *ppIter = pNext;
199554 Fts3DeferredToken *pNext; /* Next in list of deferred tokens */
200756 char *pNext; /* Cursor variable */
200761 pNext = pReader->aNode;
200763 pNext = &pReader->aDoclist[pReader->nDoclist];
200766 if( !pNext || pNext>=&pReader->aNode[pReader->nNode] ){
200820 pNext = pReader->aNode;
200825 rc = fts3SegReaderRequire(pReader, pNext, FTS3_VARINT_MAX*2);
200830 pNext += fts3GetVarint32(pNext, &nPrefix);
200831 pNext += fts3GetVarint32(pNext, &nSuffix);
200833 || (&pReader->aNode[pReader->nNode] - pNext)<nSuffix
200852 rc = fts3SegReaderRequire(pReader, pNext, nSuffix+FTS3_VARINT_MAX);
200855 memcpy(&pReader->zTerm[nPrefix], pNext, nSuffix);
200857 pNext += nSuffix;
200858 pNext += fts3GetVarint32(pNext, &pReader->nDoclist);
200859 pReader->aDoclist = pNext;
204922 for(pDef=pCsr->pDeferred; pDef; pDef=pDef->pNext){
204934 Fts3DeferredToken *pNext;
204935 for(pDef=pCsr->pDeferred; pDef; pDef=pNext){
204936 pNext = pDef->pNext;
204978 for(pDef=pCsr->pDeferred; pDef && rc==SQLITE_OK; pDef=pDef->pNext){
204994 for(pDef=pCsr->pDeferred; pDef && rc==SQLITE_OK; pDef=pDef->pNext){
205046 pDeferred->pNext = pCsr->pDeferred;
213835 RtreeNode *pNext; /* Next node in this hash collision chain */
214113 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
214122 assert( pNode->pNext==0 );
214124 pNode->pNext = pRtree->aHash[iHash];
214135 for( ; (*pp)!=pNode; pp = &(*pp)->pNext){ assert(*pp); }
214136 *pp = pNode->pNext;
214137 pNode->pNext = 0;
214230 pNode->pNext = 0;
216244 pNode->pNext = pRtree->pDeleted;
216456 pRtree->pDeleted = pLeaf->pNext;
218645 GeoEvent *pNext; /* Next event in the sorted list */
218653 GeoSegment *pNext; /* Next segment in a list sorted by y */
218729 head.pNext = 0;
218733 pLast->pNext = pRight;
218735 pRight = pRight->pNext;
218737 pLast->pNext = pLeft;
218739 pLeft = pLeft->pNext;
218742 pLast->pNext = pRight ? pRight : pLeft;
218743 return head.pNext;
218756 p->pNext = 0;
218776 head.pNext = 0;
218782 pLast->pNext = pRight;
218784 pRight = pRight->pNext;
218786 pLast->pNext = pLeft;
218788 pLeft = pLeft->pNext;
218791 pLast->pNext = pRight ? pRight : pLeft;
218792 return head.pNext;
218806 pList = pList->pNext;
218807 p->pNext = 0;
218861 for(pSeg=pActive; pSeg; pSeg=pSeg->pNext){
218872 for(pSeg=pActive; pSeg; pSeg=pSeg->pNext){
218901 pSeg->pNext = pActive;
218907 pActive = ALWAYS(pActive) ? pActive->pNext : 0;
218909 for(pSeg=pActive; pSeg; pSeg=pSeg->pNext){
218910 if( pSeg->pNext==pThisEvent->pSeg ){
218911 pSeg->pNext = ALWAYS(pSeg->pNext) ? pSeg->pNext->pNext : 0;
218917 pThisEvent = pThisEvent->pNext;
221508 RbuUpdateStmt *pNext;
222121 RbuUpdateStmt *pTmp = pUp->pNext;
223899 for(pp=&pIter->pRbuUpdate; *pp; pp=&((*pp)->pNext)){
223902 *pp = pUp->pNext;
223903 pUp->pNext = pIter->pRbuUpdate;
223910 assert( pUp==0 || pUp->pNext==0 );
223913 for(pp=&pIter->pRbuUpdate; *pp!=pUp; pp=&((*pp)->pNext));
223928 pUp->pNext = pIter->pRbuUpdate;
228193 sqlite3_session *pNext; /* Next session object on same db. */
228275 SessionTable *pNext;
228461 SessionChange *pNext; /* For hash-table collisions */
229125 SessionChange *pNext;
229126 for(p=pTab->apChange[i]; p; p=pNext){
229129 pNext = p->pNext;
229130 p->pNext = apNew[iHash];
229673 for(pp=&pTab->apChange[ii]; *pp; pp=&((*pp)->pNext)){
229904 for(pC=pTab->apChange[iHash]; pC; pC=pC->pNext){
229981 pC->pNext = pTab->apChange[iHash];
230021 for(pRet=pSession->pTable; pRet; pRet=pRet->pNext){
230034 while( ALWAYS(pRet) && pRet->pNext ){
230035 pRet = pRet->pNext;
230067 for(pSession=(sqlite3_session *)pCtx; pSession; pSession=pSession->pNext){
230489 pNew->pNext = pOld;
230501 SessionTable *pNext;
230504 for(pTab=pList; pTab; pTab=pNext){
230506 pNext = pTab->pNext;
230511 pNextChange = p->pNext;
230534 for(pp=&pHead; ALWAYS((*pp)!=0); pp=&((*pp)->pNext)){
230536 *pp = (*pp)->pNext;
230589 for(pTab=pSession->pTable; pTab; pTab=pTab->pNext){
230609 for(ppTab=&pSession->pTable; *ppTab; ppTab=&(*ppTab)->pNext);
231202 for(pTab=pSession->pTable; rc==SQLITE_OK && pTab; pTab=pTab->pNext){
231231 for(p=pTab->apChange[i]; rc==SQLITE_OK && p; p=p->pNext){
231390 for(pTab=pSession->pTable; pTab && ret==0; pTab=pTab->pNext){
232409 SessionUpdate *pNext;
232483 *pp = pUp->pNext;
232484 pUp->pNext = p->pUp;
232489 if( (*pp)->pNext ){
232490 pp = &(*pp)->pNext;
232562 pUp->pNext = p->pUp;
232584 SessionUpdate *pNext;
232585 for(pUp=p->pUp; pUp; pUp=pNext){
232586 pNext = pUp->pNext;
233970 for(pTab = pGrp->pList; pTab; pTab=pTab->pNext){
234003 for(ppNew=&pGrp->pList; *ppNew; ppNew=&(*ppNew)->pNext);
234072 for(pp=&pTab->apChange[iHash]; *pp; pp=&(*pp)->pNext){
234081 *pp = (*pp)->pNext;
234094 pChange->pNext = pTab->apChange[iHash];
234159 for(pTab=pGrp->pList; rc==SQLITE_OK && pTab; pTab=pTab->pNext){
234166 for(p=pTab->apChange[i]; p; p=p->pNext){
234534 for(pTab=p->grp.pList; pTab; pTab=pTab->pNext){
234554 for(pChange=pTab->apChange[iHash]; pChange; pChange=pChange->pNext){
239181 Fts5TermsetEntry *pNext;
239217 for(pEntry=p->apHash[hash]; pEntry; pEntry=pEntry->pNext){
239234 pEntry->pNext = p->apHash[hash];
239250 pEntry = pEntry->pNext;
241670 Fts5ExprNode *pNext = pNode->apChild[0];
241675 int cmp = fts5NodeCompare(pExpr, pNext, pChild);
241677 pNext = pChild;
241680 pNode->iRowid = pNext->iRowid;
241681 pNode->bEof = pNext->bEof;
241682 pNode->bNomatch = pNext->bNomatch;
242004 Fts5ExprTerm *pNext;
242008 for(pSyn=pTerm->pSynonym; pSyn; pSyn=pNext){
242009 pNext = pSyn->pSynonym;
243797 Fts5HashEntry *pNext;
243799 for(pSlot=pHash->aSlot[i]; pSlot; pSlot=pNext){
243800 pNext = pSlot->pHashNext;
250327 PrefixMerger *pNext; /* Next in docid/poslist order */
250337 pp = &(*pp)->pNext;
250339 p->pNext = *pp;
250351 pp = &(*pp)->pNext;
250353 p->pNext = *pp;
250412 if( pHead->pNext && iLastRowid==pHead->pNext->iter.iRowid ){
250423 PrefixMerger *pNext = pSave->pNext;
250431 pSave = pNext;
250434 if( pHead==0 || pHead->pNext==0 ){
250448 pHead = pThis->pNext;
250453 while( pHead->pNext ){
250459 pHead = pThis->pNext;
250496 pHead = pThis->pNext;
253838 Fts5Auxiliary *pNext; /* Next registered auxiliary function */
253868 Fts5TokenizerModule *pNext; /* Next registered tokenizer module */
253929 Fts5Cursor *pNext; /* Next cursor in Fts5Cursor.pCsr list */
254003 Fts5Auxdata *pNext; /* Next object in linked list */
254463 for(pCsr=pTab->pGlobal->pCsr; pCsr; pCsr=pCsr->pNext){
254487 pCsr->pNext = pGlobal->pCsr;
254522 Fts5Auxdata *pNext;
254540 for(pData=pCsr->pAuxdata; pData; pData=pNext){
254541 pNext = pData->pNext;
254571 for(pp=&pTab->pGlobal->pCsr; (*pp)!=pCsr; pp=&(*pp)->pNext);
254572 *pp = pCsr->pNext;
254624 for(pCsr=pTab->pGlobal->pCsr; pCsr; pCsr=pCsr->pNext){
254877 for(pAux=pTab->pGlobal->pAux; pAux; pAux=pAux->pNext){
256259 for(pData=pCsr->pAuxdata; pData; pData=pData->pNext){
256275 pData->pNext = pCsr->pAuxdata;
256289 for(pData=pCsr->pAuxdata; pData; pData=pData->pNext){
256594 for(pCsr=pGlobal->pCsr; pCsr; pCsr=pCsr->pNext){
256920 pAux->pNext = pGlobal->pAux;
256965 pNew->pNext = pGlobal->pTok;
256967 if( pNew->pNext==0 ){
257141 for(pMod=pGlobal->pTok; pMod; pMod=pMod->pNext){
257269 pNextAux = pAux->pNext;
257275 pNextTok = pTok->pNext;
262586 StmtRow *pNext; /* Next row to return */
262686 StmtRow *pNext = 0;
262687 for(pRow=pCur->pRow; pRow; pRow=pNext){
262688 pNext = pRow->pNext;
262709 StmtRow *pNext = pCur->pRow->pNext;
262711 pCur->pRow = pNext;
262812 ppRow = &pNew->pNext;