Lines Matching refs:pNext
1437 sqlite3_vfs *pNext; /* Next registered VFS */ member
7757 SubProgram *pNext; /* Next sub-program already visited */ member
8892 LookasideSlot *pNext; /* Next buffer in the list of free buffers */ member
9109 FuncDef *pNext; /* Next function with same name */ member
9195 Savepoint *pNext; /* Parent savepoint (if any) */ member
9364 VTable *pNext; /* Next in linked list (see above) */ member
9609 Index *pNext; /* The next index associated with the same table */ member
10135 NameContext *pNext; /* Next outer name context. NULL for outermost */ member
10169 Select *pNext; /* Next select to the left in a compound */ member
10232 AutoincInfo *pNext; /* Next info block in a list of them all */ member
10268 TriggerPrg *pNext; /* Next entry in Parse.pTriggerPrg list */ member
10429 Trigger *pNext; /* Next trigger associated with the table */ member
10489 TriggerStep *pNext; /* Next in the link-list */ member
12266 Vdbe *pPrev,*pNext; /* Linked list of VDBEs with the same Vdbe.db */ member
12592 for(pVdbe=db->pVdbe; pVdbe; pVdbe=pVdbe->pNext){ in sqlite3_db_status()
13970 for(pVfs = vfsList; pVfs; pVfs=pVfs->pNext){ in sqlite3_vfs_find()
13986 vfsList = pVfs->pNext; in vfsUnlink()
13989 while( p->pNext && p->pNext!=pVfs ){ in vfsUnlink()
13990 p = p->pNext; in vfsUnlink()
13992 if( p->pNext==pVfs ){ in vfsUnlink()
13993 p->pNext = pVfs->pNext; in vfsUnlink()
14013 pVfs->pNext = vfsList; in sqlite3_vfs_register()
14016 pVfs->pNext = vfsList->pNext; in sqlite3_vfs_register()
14017 vfsList->pNext = pVfs; in sqlite3_vfs_register()
14395 struct MemBlockHdr *pNext, *pPrev; /* Linked list of all unfreed memory */ member
14598 pHdr->pNext = 0; in sqlite3MemMalloc()
14601 mem.pLast->pNext = pHdr; in sqlite3MemMalloc()
14650 assert( pHdr->pPrev->pNext==pHdr ); in sqlite3MemFree()
14651 pHdr->pPrev->pNext = pHdr->pNext; in sqlite3MemFree()
14654 mem.pFirst = pHdr->pNext; in sqlite3MemFree()
14656 if( pHdr->pNext ){ in sqlite3MemFree()
14657 assert( pHdr->pNext->pPrev==pHdr ); in sqlite3MemFree()
14658 pHdr->pNext->pPrev = pHdr->pPrev; in sqlite3MemFree()
14803 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){ in sqlite3MemdebugSync()
14825 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){ in sqlite3MemdebugDump()
17501 struct ScratchFreeslot *pNext; /* Next unused scratch buffer */ member
17636 pSlot->pNext = (ScratchFreeslot*)(sz+(char*)pSlot); in sqlite3MallocInit()
17637 pSlot = pSlot->pNext; in sqlite3MallocInit()
17639 pSlot->pNext = 0; in sqlite3MallocInit()
17817 mem0.pScratchFree = mem0.pScratchFree->pNext; in sqlite3ScratchMalloc()
17865 pSlot->pNext = mem0.pScratchFree; in sqlite3ScratchFree()
17954 pBuf->pNext = db->lookaside.pFree; in sqlite3DbFree()
18082 db->lookaside.pFree = pBuf->pNext; in sqlite3DbMallocRaw()
22985 UnixUnusedFd *pNext; /* Next unused file descriptor on same file */
23493 struct vxworksFileId *pNext; /* Next in a list of them all */
23571 for(pCandidate=vxworksFileList; pCandidate; pCandidate=pCandidate->pNext){
23585 pNew->pNext = vxworksFileList;
23601 for(pp=&vxworksFileList; *pp && *pp!=pId; pp = &((*pp)->pNext)){}
23603 *pp = pId->pNext;
23733 unixInodeInfo *pNext; /* List of all unixInodeInfo objects */
23832 UnixUnusedFd *pNext;
23833 for(p=pInode->pUnused; p; p=pNext){
23834 pNext = p->pNext;
23838 p->pNext = pError;
23863 assert( pInode->pPrev->pNext==pInode );
23864 pInode->pPrev->pNext = pInode->pNext;
23867 inodeList = pInode->pNext;
23869 if( pInode->pNext ){
23870 assert( pInode->pNext->pPrev==pInode );
23871 pInode->pNext->pPrev = pInode->pPrev;
23947 pInode = pInode->pNext;
23957 pInode->pNext = inodeList;
24274 p->pNext = pInode->pUnused;
26322 unixShm *pNext; /* Next unixShm with the same unixShmNode */
26561 p->pNext = pShmNode->pFirst;
26716 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
26741 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
26766 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
26831 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
26832 *pp = p->pNext;
27484 pInode = pInode->pNext;
27488 for(pp=&pInode->pUnused; *pp && (*pp)->flags!=flags; pp=&((*pp)->pNext));
27491 *pp = pUnused->pNext;
30922 winShmNode *pNext; /* Next in list of all winShmNode objects */
30950 winShm *pNext; /* Next winShm with the same winShmNode */
31054 *pp = p->pNext;
31058 pp = &p->pNext;
31099 for(pShmNode = winShmNodeList; pShmNode; pShmNode=pShmNode->pNext){
31111 pShmNode->pNext = winShmNodeList;
31163 p->pNext = pShmNode->pFirst;
31199 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
31200 *pp = p->pNext;
31251 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
31276 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
31301 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
33242 PgHdr *pNext;
33243 for(p=pCache->pDirty; p; p=pNext){
33244 pNext = p->pDirtyNext;
33483 PgHdr1 *pNext; /* Next in hash table chain */
33494 PgFreeslot *pNext; /* Next free slot */
33566 p->pNext = pcache1.pFree;
33587 pcache1.pFree = pcache1.pFree->pNext;
33621 pSlot->pNext = pcache1.pFree;
33766 PgHdr1 *pNext = p->apHash[i];
33767 while( (pPage = pNext)!=0 ){
33769 pNext = pPage->pNext;
33770 pPage->pNext = apNew[h];
33823 for(pp=&pCache->apHash[h]; (*pp)!=pPage; pp=&(*pp)->pNext);
33824 *pp = (*pp)->pNext;
33863 *pp = pPage->pNext;
33867 pp = &pPage->pNext;
34019 for(pPage=pCache->apHash[h]; pPage&&pPage->iKey!=iKey; pPage=pPage->pNext);
34069 pPage->pNext = pCache->apHash[h];
34149 pp = &(*pp)->pNext;
34151 *pp = pPage->pNext;
34155 pPage->pNext = pCache->apHash[h];
37721 PgHdr *pNext = pList->pDirty;
37723 pList = pNext;
44690 BtLock *pNext; /* Next in BtShared.pLock list */
44726 Btree *pNext; /* List of other sharable Btrees from the same db */
44809 BtShared *pNext; /* Next on a list of sharable BtShared structs */
44863 BtCursor *pNext, *pPrev; /* Forms a linked list of all cursors */
45078 assert( p->pNext==0 || p->pNext->pBt>p->pBt );
45080 assert( p->pNext==0 || p->pNext->db==p->db );
45082 assert( p->sharable || (p->pNext==0 && p->pPrev==0) );
45114 for(pLater=p->pNext; pLater; pLater=pLater->pNext){
45116 assert( pLater->pNext==0 || pLater->pNext->pBt>pLater->pBt );
45123 for(pLater=p->pNext; pLater; pLater=pLater->pNext){
45204 while( p->locked && ALWAYS(p->pNext) ) p = p->pNext;
45205 for(pLater = p->pNext; pLater; pLater=pLater->pNext){
45212 p = p->pNext;
45533 for(pLock=pBtree->pBt->pLock; pLock; pLock=pLock->pNext){
45568 for(p=pBtree->pBt->pCursor; p; p=p->pNext){
45615 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
45679 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
45696 pLock->pNext = pBt->pLock;
45735 *ppIter = pLock->pNext;
45741 ppIter = &pLock->pNext;
45774 for(pLock=pBt->pLock; pLock; pLock=pLock->pNext){
45814 for(p=pBt->pCursor; p; p=p->pNext){
45840 for(p=pBt->pCursor; p; p=p->pNext){
45986 for(p=pBt->pCursor; p; p=p->pNext){
47138 for(pBt=GLOBAL(BtShared*,sqlite3SharedCacheList); pBt; pBt=pBt->pNext){
47255 pBt->pNext = GLOBAL(BtShared*,sqlite3SharedCacheList);
47274 p->pNext = pSib;
47278 while( pSib->pNext && pSib->pNext->pBt<p->pBt ){
47279 pSib = pSib->pNext;
47281 p->pNext = pSib->pNext;
47283 if( p->pNext ){
47284 p->pNext->pPrev = p;
47286 pSib->pNext = p;
47337 GLOBAL(BtShared*,sqlite3SharedCacheList) = pBt->pNext;
47340 while( ALWAYS(pList) && pList->pNext!=pBt ){
47341 pList=pList->pNext;
47344 pList->pNext = pBt->pNext;
47390 pCur = pCur->pNext;
47427 if( p->pPrev ) p->pPrev->pNext = p->pNext;
47428 if( p->pNext ) p->pNext->pPrev = p->pPrev;
47926 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
47981 p->lock.pNext = pBt->pLock;
48590 for(pCur=pBt->pCursor; pCur; pCur=pCur->pNext){
48617 for(p=pBtree->pBt->pCursor; p; p=p->pNext){
48832 pCur->pNext = pBt->pCursor;
48833 if( pCur->pNext ){
48834 pCur->pNext->pPrev = pCur;
48893 for(p=pCur->pBt->pCursor; p; p=p->pNext){
48921 pCur->pPrev->pNext = pCur->pNext;
48923 pBt->pCursor = pCur->pNext;
48925 if( pCur->pNext ){
48926 pCur->pNext->pPrev = pCur->pPrev;
53551 sqlite3_backup *pNext; /* Next backup associated with source pager */
53797 p->pNext = *pp;
54026 pp = &(*pp)->pNext;
54028 *pp = p->pNext;
54083 for(p=pBackup; p; p=p->pNext){
54112 for(p=pBackup; p; p=p->pNext){
55358 p->pNext = db->pVdbe;
55396 pTmp = pA->pNext;
55397 pA->pNext = pB->pNext;
55398 pB->pNext = pTmp;
55966 p->pNext = pVdbe->pProgram;
57186 p = p->pNext;
57669 SubProgram *pSub, *pNext;
57673 for(pSub=p->pProgram; pSub; pSub=pNext){
57674 pNext = pSub->pNext;
57695 p->pPrev->pNext = p->pNext;
57698 db->pVdbe = p->pNext;
57700 if( p->pNext ){
57701 p->pNext->pPrev = p->pPrev;
58425 for(p = db->pVdbe; p; p=p->pNext){
59759 sqlite3_stmt *pNext;
59762 pNext = (sqlite3_stmt*)pDb->pVdbe;
59764 pNext = (sqlite3_stmt*)((Vdbe*)pStmt)->pNext;
59767 return pNext;
60506 for(p=db->pSavepoint; p; p=p->pNext) n++;
63017 u.aq.pNew->pNext = db->pSavepoint;
63030 u.aq.pSavepoint = u.aq.pSavepoint->pNext
63055 int isTransaction = u.aq.pSavepoint->pNext==0 && db->isTransactionSavepoint;
63088 db->pSavepoint = u.aq.pTmp->pNext;
63099 db->pSavepoint = u.aq.pSavepoint->pNext;
64978 for(u.br.pVdbe=db->pVdbe; u.br.pVdbe; u.br.pVdbe = u.br.pVdbe->pNext){
66735 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
67250 FileChunk *pNext; /* Next chunk in the journal */
67297 pChunk=pChunk->pNext
67313 } while( nRead>=0 && (pChunk=pChunk->pNext)!=0 && nRead>0 );
67350 pNew->pNext = 0;
67353 pChunk->pNext = pNew;
67381 pChunk = pChunk->pNext;
67927 pNC = pNC->pNext;
67998 pTopNC = pTopNC->pNext;
68358 pSelect->pNext = 0;
68360 pSelect->pPrior->pNext = pSelect;
68404 pSelect = pSelect->pNext;
68583 sNC.pNext = pOuterNC;
68644 sNC.pNext = 0;
70295 for(pIdx=pTab->pIndex; pIdx && eType==0 && affinity_ok; pIdx=pIdx->pNext){
72872 for(pTrig=sqlite3TriggerList(pParse, pTab); pTrig; pTrig=pTrig->pNext){
72910 for(pTrig=sqlite3TriggerList(pParse, pTab); pTrig; pTrig=pTrig->pNext){
73536 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
74600 pStep = pStep->pNext;
75228 pIndex->pTable->pIndex = pIndex->pNext;
75234 while( ALWAYS(p) && p->pNext!=pIndex ){ p = p->pNext; }
75235 if( ALWAYS(p && p->pNext==pIndex) ){
75236 p->pNext = pIndex->pNext;
75339 Index *pIndex, *pNext;
75348 for(pIndex = pTable->pIndex; pIndex; pIndex=pNext){
75349 pNext = pIndex->pNext;
76065 for(pIdx=p->pIndex; pIdx; pIdx=pIdx->pNext){
76753 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
76783 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
76912 pTrigger = pTrigger->pNext;
77345 for(pLoop=pTab->pIndex, n=1; pLoop; pLoop=pLoop->pNext, n++){}
77512 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
77647 pIndex->pNext = pTab->pIndex;
77651 while( pOther->pNext && pOther->pNext->onError!=OE_Replace ){
77652 pOther = pOther->pNext;
77654 pIndex->pNext = pOther->pNext;
77655 pOther->pNext = pIndex;
78411 for(pIndex=pTab->pIndex; pIndex; pIndex=pIndex->pNext){
78842 assert( pOther!=pDef && pOther->pNext!=pDef );
78843 pDef->pNext = pOther->pNext;
78844 pOther->pNext = pDef;
78846 pDef->pNext = 0;
78900 p = p->pNext;
78925 p = p->pNext;
79297 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
79353 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
79414 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
79590 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
81461 for(pIdx=pParent->pIndex; pIdx; pIdx=pIdx->pNext){
82393 FKey *pNext; /* Copy of pFKey->pNextFrom */
82395 for(pFKey=pTab->pFKey; pFKey; pFKey=pNext){
82422 pNext = pFKey->pNextFrom;
82581 for(pIndex=pTab->pIndex; pIndex; pIndex=pIndex->pNext){
82630 while( pInfo && pInfo->pTab!=pTab ){ pInfo = pInfo->pNext; }
82634 pInfo->pNext = pToplevel->pAinc;
82665 for(p = pParse->pAinc; p; p = p->pNext){
82711 for(p = pParse->pAinc; p; p = p->pNext){
83443 for(idx=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, idx++){
83741 for(iCur=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, iCur++){
83872 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){}
83927 for(i=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
84149 for(pDestIdx=pDest->pIndex; pDestIdx; pDestIdx=pDestIdx->pNext){
84153 for(pSrcIdx=pSrc->pIndex; pSrcIdx; pSrcIdx=pSrcIdx->pNext){
84223 for(pDestIdx=pDest->pIndex; pDestIdx; pDestIdx=pDestIdx->pNext){
84224 for(pSrcIdx=pSrc->pIndex; ALWAYS(pSrcIdx); pSrcIdx=pSrcIdx->pNext){
86422 pIdx = pIdx->pNext;
86597 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
86635 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
86662 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
87657 pParse->pTriggerPrg = pT->pNext;
88852 pNC = pNC->pNext;
88891 sNC.pNext = pNC;
88926 sNC.pNext = pNC;
90960 pIdx=pIdx->pNext
91646 pLoop->pNext = pRight;
92056 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
92496 pTriggerStep = pTriggerStep->pNext;
92536 pTrig->pNext = (pList ? pList : pTab->pTrigger);
92747 pStepList = pStepList->pNext;
92790 pLink->pNext = pTab->pTrigger;
93061 for(pp=&pTab->pTrigger; *pp!=pTrigger; pp=&((*pp)->pNext));
93062 *pp = (*pp)->pNext;
93104 for(p=pList; p; p=p->pNext){
93162 for(pStep=pStepList; pStep; pStep=pStep->pNext){
93284 pPrg->pNext = pTop->pTriggerPrg;
93389 pPrg=pPrg->pNext
93495 for(p=pTrigger; p; p=p->pNext){
93554 for(p=pTrigger; p; p=p->pNext){
93750 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
93811 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){}
93816 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
93921 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
93928 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
94101 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
94690 for(pVtab=pTab->pVTable; pVtab && pVtab->db!=db; pVtab=pVtab->pNext);
94738 VTable *pNext = pVTable->pNext;
94743 pRet->pNext = 0;
94745 pVTable->pNext = db2->pDisconnect;
94748 pVTable = pNext;
94786 VTable *pNext = p->pNext;
94788 p = pNext;
95072 pVTable->pNext = pTab->pVTable;
95297 assert( pTab->pVTable==p && p->pNext==0 );
98051 sPk.pNext = pFirst;
98063 for(; pProbe; pIdx=pProbe=pProbe->pNext){
103206 yymsp[-2].minor.yy203->pLast->pNext = yymsp[-1].minor.yy203;
104427 pParse->pAinc = p->pNext;
105294 p->pNext = db->lookaside.pFree;
105429 db->pSavepoint = pTmp->pNext;
105528 FuncDef *pNext, *pHash, *p;
105533 pNext = p->pNext;
105535 p = pNext;
114650 Fts3DeferredToken *pNext; /* Next in list of deferred tokens */
115501 char *pNext; /* Cursor variable */
115506 pNext = pReader->aNode;
115508 pNext = &pReader->aDoclist[pReader->nDoclist];
115511 if( !pNext || pNext>=&pReader->aNode[pReader->nNode] ){
115546 pNext = pReader->aNode;
115552 pNext += sqlite3Fts3GetVarint32(pNext, &nPrefix);
115553 pNext += sqlite3Fts3GetVarint32(pNext, &nSuffix);
115555 || &pNext[nSuffix]>&pReader->aNode[pReader->nNode]
115569 memcpy(&pReader->zTerm[nPrefix], pNext, nSuffix);
115571 pNext += nSuffix;
115572 pNext += sqlite3Fts3GetVarint32(pNext, &pReader->nDoclist);
115573 pReader->aDoclist = pNext;
117266 for(pDef=pCsr->pDeferred; pDef; pDef=pDef->pNext){
117281 Fts3DeferredToken *pNext;
117282 for(pDef=pCsr->pDeferred; pDef; pDef=pNext){
117283 pNext = pDef->pNext;
117325 for(pDef=pCsr->pDeferred; pDef && rc==SQLITE_OK; pDef=pDef->pNext){
117339 for(pDef=pCsr->pDeferred; pDef && rc==SQLITE_OK; pDef=pDef->pNext){
117364 pDeferred->pNext = pCsr->pDeferred;
119379 RtreeNode *pNext; /* Next node in this hash chain */
119528 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
119537 assert( pNode->pNext==0 );
119539 pNode->pNext = pRtree->aHash[iHash];
119550 for( ; (*pp)!=pNode; pp = &(*pp)->pNext){ assert(*pp); }
119551 *pp = pNode->pNext;
119552 pNode->pNext = 0;
119618 pNode->pNext = 0;
121266 RtreeCell *pNext;
121267 pNext = PickNext(pRtree, aCell, nCell, pBboxLeft, pBboxRight, aiUsed);
121269 cellGrowth(pRtree, pBboxLeft, pNext) -
121270 cellGrowth(pRtree, pBboxRight, pNext)
121275 nodeInsertCell(pRtree, pRight, pNext);
121276 cellUnion(pRtree, pBboxRight, pNext);
121278 nodeInsertCell(pRtree, pLeft, pNext);
121279 cellUnion(pRtree, pBboxLeft, pNext);
121527 pNode->pNext = pRtree->pDeleted;
121860 pRtree->pDeleted = pLeaf->pNext;