Lines Matching refs:pNext
1477 sqlite3_vfs *pNext; /* Next registered VFS */ member
8217 SubProgram *pNext; /* Next sub-program already visited */ member
9370 LookasideSlot *pNext; /* Next buffer in the list of free buffers */ member
9591 FuncDef *pNext; /* Next function with same name */ member
9677 Savepoint *pNext; /* Parent savepoint (if any) */ member
9848 VTable *pNext; /* Next in linked list (see above) */ member
10094 Index *pNext; /* The next index associated with the same table */ member
10620 NameContext *pNext; /* Next outer name context. NULL for outermost */ member
10654 Select *pNext; /* Next select to the left in a compound */ member
10717 AutoincInfo *pNext; /* Next info block in a list of them all */ member
10753 TriggerPrg *pNext; /* Next entry in Parse.pTriggerPrg list */ member
10922 Trigger *pNext; /* Next trigger associated with the table */ member
10982 TriggerStep *pNext; /* Next in the link-list */ member
12773 Vdbe *pPrev,*pNext; /* Linked list of VDBEs with the same Vdbe.db */ member
13106 for(pVdbe=db->pVdbe; pVdbe; pVdbe=pVdbe->pNext){ in sqlite3_db_status()
14514 for(pVfs = vfsList; pVfs; pVfs=pVfs->pNext){ in sqlite3_vfs_find()
14530 vfsList = pVfs->pNext; in vfsUnlink()
14533 while( p->pNext && p->pNext!=pVfs ){ in vfsUnlink()
14534 p = p->pNext; in vfsUnlink()
14536 if( p->pNext==pVfs ){ in vfsUnlink()
14537 p->pNext = pVfs->pNext; in vfsUnlink()
14557 pVfs->pNext = vfsList; in sqlite3_vfs_register()
14560 pVfs->pNext = vfsList->pNext; in sqlite3_vfs_register()
14561 vfsList->pNext = pVfs; in sqlite3_vfs_register()
14939 struct MemBlockHdr *pNext, *pPrev; /* Linked list of all unfreed memory */ member
15142 pHdr->pNext = 0; in sqlite3MemMalloc()
15145 mem.pLast->pNext = pHdr; in sqlite3MemMalloc()
15194 assert( pHdr->pPrev->pNext==pHdr ); in sqlite3MemFree()
15195 pHdr->pPrev->pNext = pHdr->pNext; in sqlite3MemFree()
15198 mem.pFirst = pHdr->pNext; in sqlite3MemFree()
15200 if( pHdr->pNext ){ in sqlite3MemFree()
15201 assert( pHdr->pNext->pPrev==pHdr ); in sqlite3MemFree()
15202 pHdr->pNext->pPrev = pHdr->pPrev; in sqlite3MemFree()
15347 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){ in sqlite3MemdebugSync()
15369 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){ in sqlite3MemdebugDump()
18049 struct ScratchFreeslot *pNext; /* Next unused scratch buffer */ member
18184 pSlot->pNext = (ScratchFreeslot*)(sz+(char*)pSlot); in sqlite3MallocInit()
18185 pSlot = pSlot->pNext; in sqlite3MallocInit()
18187 pSlot->pNext = 0; in sqlite3MallocInit()
18365 mem0.pScratchFree = mem0.pScratchFree->pNext; in sqlite3ScratchMalloc()
18413 pSlot->pNext = mem0.pScratchFree; in sqlite3ScratchFree()
18502 pBuf->pNext = db->lookaside.pFree; in sqlite3DbFree()
18635 db->lookaside.pFree = pBuf->pNext; in sqlite3DbMallocRaw()
23107 os2ShmNode *pNext; /* Next in list of all os2ShmNode objects */
23137 os2ShmLink *pNext; /* Next os2Shm with the same os2ShmNode */
23250 pNode = pNode->pNext ) ;
23285 pNode->pNext = os2ShmNodeList;
23301 pLink->pNext = pNode->pFirst;
23339 *ppNode = pNode->pNext;
23381 ppNode = &pNode->pNext;
23515 ppLink = &(*ppLink)->pNext ) ;
23520 *ppLink = pLink->pNext;
23578 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
23603 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
23628 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
24464 UnixUnusedFd *pNext; /* Next unused file descriptor on same file */
25179 struct vxworksFileId *pNext; /* Next in a list of them all */
25257 for(pCandidate=vxworksFileList; pCandidate; pCandidate=pCandidate->pNext){
25271 pNew->pNext = vxworksFileList;
25287 for(pp=&vxworksFileList; *pp && *pp!=pId; pp = &((*pp)->pNext)){}
25289 *pp = pId->pNext;
25420 unixInodeInfo *pNext; /* List of all unixInodeInfo objects */
25532 UnixUnusedFd *pNext;
25533 for(p=pInode->pUnused; p; p=pNext){
25534 pNext = p->pNext;
25556 assert( pInode->pPrev->pNext==pInode );
25557 pInode->pPrev->pNext = pInode->pNext;
25560 inodeList = pInode->pNext;
25562 if( pInode->pNext ){
25563 assert( pInode->pNext->pPrev==pInode );
25564 pInode->pNext->pPrev = pInode->pPrev;
25640 pInode = pInode->pNext;
25650 pInode->pNext = inodeList;
26007 p->pNext = pInode->pUnused;
28043 unixShm *pNext; /* Next unixShm with the same unixShmNode */
28310 p->pNext = pShmNode->pFirst;
28485 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
28510 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
28535 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
28600 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
28601 *pp = p->pNext;
29261 pInode = pInode->pNext;
29265 for(pp=&pInode->pUnused; *pp && (*pp)->flags!=flags; pp=&((*pp)->pNext));
29268 *pp = pUnused->pNext;
32824 winShmNode *pNext; /* Next in list of all winShmNode objects */
32852 winShm *pNext; /* Next winShm with the same winShmNode */
32956 *pp = p->pNext;
32960 pp = &p->pNext;
33002 for(pShmNode = winShmNodeList; pShmNode; pShmNode=pShmNode->pNext){
33014 pShmNode->pNext = winShmNodeList;
33066 p->pNext = pShmNode->pFirst;
33102 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
33103 *pp = p->pNext;
33154 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
33179 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
33204 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
35103 PgHdr *pNext;
35104 for(p=pCache->pDirty; p; p=pNext){
35105 pNext = p->pDirtyNext;
35377 PgHdr1 *pNext; /* Next in hash table chain */
35388 PgFreeslot *pNext; /* Next free slot */
35470 p->pNext = pcache1.pFree;
35495 pcache1.pFree = pcache1.pFree->pNext;
35529 pSlot->pNext = pcache1.pFree;
35671 PgHdr1 *pNext = p->apHash[i];
35672 while( (pPage = pNext)!=0 ){
35674 pNext = pPage->pNext;
35675 pPage->pNext = apNew[h];
35737 for(pp=&pCache->apHash[h]; (*pp)!=pPage; pp=&(*pp)->pNext);
35738 *pp = (*pp)->pNext;
35778 *pp = pPage->pNext;
35782 pp = &pPage->pNext;
35972 for(pPage=pCache->apHash[h]; pPage&&pPage->iKey!=iKey; pPage=pPage->pNext);
36044 pPage->pNext = pCache->apHash[h];
36120 pp = &(*pp)->pNext;
36122 *pp = pPage->pNext;
36126 pPage->pNext = pCache->apHash[h];
39733 PgHdr *pNext = pList->pDirty;
39735 pList = pNext;
46912 BtLock *pNext; /* Next in BtShared.pLock list */
46948 Btree *pNext; /* List of other sharable Btrees from the same db */
47031 BtShared *pNext; /* Next on a list of sharable BtShared structs */
47085 BtCursor *pNext, *pPrev; /* Forms a linked list of all cursors */
47301 assert( p->pNext==0 || p->pNext->pBt>p->pBt );
47303 assert( p->pNext==0 || p->pNext->db==p->db );
47305 assert( p->sharable || (p->pNext==0 && p->pPrev==0) );
47337 for(pLater=p->pNext; pLater; pLater=pLater->pNext){
47339 assert( pLater->pNext==0 || pLater->pNext->pBt>pLater->pBt );
47346 for(pLater=p->pNext; pLater; pLater=pLater->pNext){
47684 for(pLock=pBtree->pBt->pLock; pLock; pLock=pLock->pNext){
47719 for(p=pBtree->pBt->pCursor; p; p=p->pNext){
47766 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
47830 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
47847 pLock->pNext = pBt->pLock;
47886 *ppIter = pLock->pNext;
47892 ppIter = &pLock->pNext;
47925 for(pLock=pBt->pLock; pLock; pLock=pLock->pNext){
47965 for(p=pBt->pCursor; p; p=p->pNext){
47991 for(p=pBt->pCursor; p; p=p->pNext){
48137 for(p=pBt->pCursor; p; p=p->pNext){
49292 for(pBt=GLOBAL(BtShared*,sqlite3SharedCacheList); pBt; pBt=pBt->pNext){
49409 pBt->pNext = GLOBAL(BtShared*,sqlite3SharedCacheList);
49428 p->pNext = pSib;
49432 while( pSib->pNext && pSib->pNext->pBt<p->pBt ){
49433 pSib = pSib->pNext;
49435 p->pNext = pSib->pNext;
49437 if( p->pNext ){
49438 p->pNext->pPrev = p;
49440 pSib->pNext = p;
49491 GLOBAL(BtShared*,sqlite3SharedCacheList) = pBt->pNext;
49494 while( ALWAYS(pList) && pList->pNext!=pBt ){
49495 pList=pList->pNext;
49498 pList->pNext = pBt->pNext;
49544 pCur = pCur->pNext;
49581 if( p->pPrev ) p->pPrev->pNext = p->pNext;
49582 if( p->pNext ) p->pNext->pPrev = p->pPrev;
50080 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
50135 p->lock.pNext = pBt->pLock;
50755 for(pCur=pBt->pCursor; pCur; pCur=pCur->pNext){
50782 for(p=pBtree->pBt->pCursor; p; p=p->pNext){
50997 pCur->pNext = pBt->pCursor;
50998 if( pCur->pNext ){
50999 pCur->pNext->pPrev = pCur;
51058 for(p=pCur->pBt->pCursor; p; p=p->pNext){
51086 pCur->pPrev->pNext = pCur->pNext;
51088 pBt->pCursor = pCur->pNext;
51090 if( pCur->pNext ){
51091 pCur->pNext->pPrev = pCur->pPrev;
55732 sqlite3_backup *pNext; /* Next backup associated with source pager */
56004 p->pNext = *pp;
56247 pp = &(*pp)->pNext;
56249 *pp = p->pNext;
56304 for(p=pBackup; p; p=p->pNext){
56337 for(p=pBackup; p; p=p->pNext){
57591 p->pNext = db->pVdbe;
57629 pTmp = pA->pNext;
57630 pA->pNext = pB->pNext;
57631 pB->pNext = pTmp;
58213 p->pNext = pVdbe->pProgram;
59514 p = p->pNext;
59978 SubProgram *pSub, *pNext;
59983 for(pSub=p->pProgram; pSub; pSub=pNext){
59984 pNext = pSub->pNext;
60006 p->pPrev->pNext = p->pNext;
60009 db->pVdbe = p->pNext;
60011 if( p->pNext ){
60012 p->pNext->pPrev = p->pPrev;
60744 for(p = db->pVdbe; p; p=p->pNext){
62081 sqlite3_stmt *pNext;
62084 pNext = (sqlite3_stmt*)pDb->pVdbe;
62086 pNext = (sqlite3_stmt*)((Vdbe*)pStmt)->pNext;
62089 return pNext;
62840 for(p=db->pSavepoint; p; p=p->pNext) n++;
65403 u.aq.pNew->pNext = db->pSavepoint;
65416 u.aq.pSavepoint = u.aq.pSavepoint->pNext
65441 int isTransaction = u.aq.pSavepoint->pNext==0 && db->isTransactionSavepoint;
65474 db->pSavepoint = u.aq.pTmp->pNext;
65485 db->pSavepoint = u.aq.pSavepoint->pNext;
67380 for(u.br.pVdbe=db->pVdbe; u.br.pVdbe; u.br.pVdbe = u.br.pVdbe->pNext){
69146 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
69665 FileChunk *pNext; /* Next chunk in the journal */
69712 pChunk=pChunk->pNext
69728 } while( nRead>=0 && (pChunk=pChunk->pNext)!=0 && nRead>0 );
69765 pNew->pNext = 0;
69768 pChunk->pNext = pNew;
69796 pChunk = pChunk->pNext;
70342 pNC = pNC->pNext;
70413 pTopNC = pTopNC->pNext;
70773 pSelect->pNext = 0;
70775 pSelect->pPrior->pNext = pSelect;
70819 pSelect = pSelect->pNext;
70998 sNC.pNext = pOuterNC;
71059 sNC.pNext = 0;
72707 for(pIdx=pTab->pIndex; pIdx && eType==0 && affinity_ok; pIdx=pIdx->pNext){
75291 for(pTrig=sqlite3TriggerList(pParse, pTab); pTrig; pTrig=pTrig->pNext){
75329 for(pTrig=sqlite3TriggerList(pParse, pTab); pTrig; pTrig=pTrig->pNext){
75974 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
77083 pStep = pStep->pNext;
77720 pIndex->pTable->pIndex = pIndex->pNext;
77726 while( ALWAYS(p) && p->pNext!=pIndex ){ p = p->pNext; }
77727 if( ALWAYS(p && p->pNext==pIndex) ){
77728 p->pNext = pIndex->pNext;
77847 Index *pIndex, *pNext;
77856 for(pIndex = pTable->pIndex; pIndex; pIndex=pNext){
77857 pNext = pIndex->pNext;
78579 for(pIdx=p->pIndex; pIdx; pIdx=pIdx->pNext){
79275 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
79305 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
79435 pTrigger = pTrigger->pNext;
79872 for(pLoop=pTab->pIndex, n=1; pLoop; pLoop=pLoop->pNext, n++){}
80040 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
80175 pIndex->pNext = pTab->pIndex;
80179 while( pOther->pNext && pOther->pNext->onError!=OE_Replace ){
80180 pOther = pOther->pNext;
80182 pIndex->pNext = pOther->pNext;
80183 pOther->pNext = pIndex;
80957 for(pIndex=pTab->pIndex; pIndex; pIndex=pIndex->pNext){
81389 assert( pOther!=pDef && pOther->pNext!=pDef );
81390 pDef->pNext = pOther->pNext;
81391 pOther->pNext = pDef;
81393 pDef->pNext = 0;
81447 p = p->pNext;
81472 p = p->pNext;
81856 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
81912 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
81974 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
82150 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
84038 for(pIdx=pParent->pIndex; pIdx; pIdx=pIdx->pNext){
84980 FKey *pNext; /* Copy of pFKey->pNextFrom */
84983 for(pFKey=pTab->pFKey; pFKey; pFKey=pNext){
85010 pNext = pFKey->pNextFrom;
85169 for(pIndex=pTab->pIndex; pIndex; pIndex=pIndex->pNext){
85218 while( pInfo && pInfo->pTab!=pTab ){ pInfo = pInfo->pNext; }
85222 pInfo->pNext = pToplevel->pAinc;
85253 for(p = pParse->pAinc; p; p = p->pNext){
85300 for(p = pParse->pAinc; p; p = p->pNext){
86032 for(idx=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, idx++){
86330 for(iCur=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, iCur++){
86461 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){}
86516 for(i=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
86738 for(pDestIdx=pDest->pIndex; pDestIdx; pDestIdx=pDestIdx->pNext){
86742 for(pSrcIdx=pSrc->pIndex; pSrcIdx; pSrcIdx=pSrcIdx->pNext){
86824 for(pDestIdx=pDest->pIndex; pDestIdx; pDestIdx=pDestIdx->pNext){
86825 for(pSrcIdx=pSrc->pIndex; ALWAYS(pSrcIdx); pSrcIdx=pSrcIdx->pNext){
89030 pIdx = pIdx->pNext;
89206 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
89244 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
89271 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
90280 pParse->pTriggerPrg = pT->pNext;
91479 pNC = pNC->pNext;
91518 sNC.pNext = pNC;
91553 sNC.pNext = pNC;
93593 pIdx=pIdx->pNext
94305 pLoop->pNext = pRight;
94717 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
95158 pTriggerStep = pTriggerStep->pNext;
95199 pTrig->pNext = (pList ? pList : pTab->pTrigger);
95413 pStepList = pStepList->pNext;
95456 pLink->pNext = pTab->pTrigger;
95734 for(pp=&pTab->pTrigger; *pp!=pTrigger; pp=&((*pp)->pNext));
95735 *pp = (*pp)->pNext;
95781 for(p=pList; p; p=p->pNext){
95839 for(pStep=pStepList; pStep; pStep=pStep->pNext){
95961 pPrg->pNext = pTop->pTriggerPrg;
96066 pPrg=pPrg->pNext
96172 for(p=pTrigger; p; p=p->pNext){
96231 for(p=pTrigger; p; p=p->pNext){
96427 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
96488 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){}
96493 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
96597 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
96604 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
96777 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
97383 for(pVtab=pTab->pVTable; pVtab && pVtab->db!=db; pVtab=pVtab->pNext);
97430 VTable *pNext = pVTable->pNext;
97435 pRet->pNext = 0;
97437 pVTable->pNext = db2->pDisconnect;
97440 pVTable = pNext;
97478 VTable *pNext = p->pNext;
97480 p = pNext;
97768 pVTable->pNext = pTab->pVTable;
98001 assert( pTab->pVTable==p && p->pNext==0 );
101074 sPk.pNext = pFirst;
101086 for(; pProbe; pIdx=pProbe=pProbe->pNext){
106315 yymsp[-2].minor.yy203->pLast->pNext = yymsp[-1].minor.yy203;
107535 pParse->pAinc = p->pNext;
108414 p->pNext = db->lookaside.pFree;
108577 db->pSavepoint = pTmp->pNext;
108671 FuncDef *pNext, *pHash, *p;
108676 pNext = p->pNext;
108678 p = pNext;
115414 char *pNext = 0;
115423 pNext = pDocid;
115429 *pnList = pEnd - pNext;
115430 *ppIter = pNext;
119707 Fts3DeferredToken *pNext; /* Next in list of deferred tokens */
120698 char *pNext; /* Cursor variable */
120703 pNext = pReader->aNode;
120705 pNext = &pReader->aDoclist[pReader->nDoclist];
120708 if( !pNext || pNext>=&pReader->aNode[pReader->nNode] ){
120750 pNext = pReader->aNode;
120755 rc = fts3SegReaderRequire(pReader, pNext, FTS3_VARINT_MAX*2);
120760 pNext += sqlite3Fts3GetVarint32(pNext, &nPrefix);
120761 pNext += sqlite3Fts3GetVarint32(pNext, &nSuffix);
120763 || &pNext[nSuffix]>&pReader->aNode[pReader->nNode]
120778 rc = fts3SegReaderRequire(pReader, pNext, nSuffix+FTS3_VARINT_MAX);
120781 memcpy(&pReader->zTerm[nPrefix], pNext, nSuffix);
120783 pNext += nSuffix;
120784 pNext += sqlite3Fts3GetVarint32(pNext, &pReader->nDoclist);
120785 pReader->aDoclist = pNext;
122569 for(pDef=pCsr->pDeferred; pDef; pDef=pDef->pNext){
122581 Fts3DeferredToken *pNext;
122582 for(pDef=pCsr->pDeferred; pDef; pDef=pNext){
122583 pNext = pDef->pNext;
122625 for(pDef=pCsr->pDeferred; pDef && rc==SQLITE_OK; pDef=pDef->pNext){
122639 for(pDef=pCsr->pDeferred; pDef && rc==SQLITE_OK; pDef=pDef->pNext){
122691 pDeferred->pNext = pCsr->pDeferred;
124646 RtreeNode *pNext; /* Next node in this hash chain */
124795 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
124804 assert( pNode->pNext==0 );
124806 pNode->pNext = pRtree->aHash[iHash];
124817 for( ; (*pp)!=pNode; pp = &(*pp)->pNext){ assert(*pp); }
124818 *pp = pNode->pNext;
124819 pNode->pNext = 0;
124885 pNode->pNext = 0;
126504 RtreeCell *pNext;
126505 pNext = PickNext(pRtree, aCell, nCell, pBboxLeft, pBboxRight, aiUsed);
126507 cellGrowth(pRtree, pBboxLeft, pNext) -
126508 cellGrowth(pRtree, pBboxRight, pNext)
126513 nodeInsertCell(pRtree, pRight, pNext);
126514 cellUnion(pRtree, pBboxRight, pNext);
126516 nodeInsertCell(pRtree, pLeft, pNext);
126517 cellUnion(pRtree, pBboxLeft, pNext);
126765 pNode->pNext = pRtree->pDeleted;
127081 pRtree->pDeleted = pLeaf->pNext;
