Lines Matching refs:pNext
1322 ** the pNext pointer. The [sqlite3_vfs_register()]
1326 ** implementation should use the pNext pointer.
1328 ** The pNext field is the only field in the sqlite3_vfs
1463 sqlite3_vfs *pNext; /* Next registered VFS */
7955 SubProgram *pNext; /* Next sub-program already visited */
9106 LookasideSlot *pNext; /* Next buffer in the list of free buffers */
9325 FuncDef *pNext; /* Next function with same name */
9411 Savepoint *pNext; /* Parent savepoint (if any) */
9580 VTable *pNext; /* Next in linked list (see above) */
9826 Index *pNext; /* The next index associated with the same table */
10336 ** Each subquery gets a new NameContext. The pNext field points to the
10352 NameContext *pNext; /* Next outer name context. NULL for outermost */
10386 Select *pNext; /* Next select to the left in a compound */
10449 AutoincInfo *pNext; /* Next info block in a list of them all */
10485 TriggerPrg *pNext; /* Next entry in Parse.pTriggerPrg list */
10637 * pNext member of struct Trigger. A pointer to the first element of the
10655 Trigger *pNext; /* Next trigger associated with the table */
10673 * using the "pNext" member) referenced by the "step_list" member of the
10715 TriggerStep *pNext; /* Next in the link-list */
12499 Vdbe *pPrev,*pNext; /* Linked list of VDBEs with the same Vdbe.db */
12832 for(pVdbe=db->pVdbe; pVdbe; pVdbe=pVdbe->pNext){
14210 for(pVfs = vfsList; pVfs; pVfs=pVfs->pNext){
14226 vfsList = pVfs->pNext;
14229 while( p->pNext && p->pNext!=pVfs ){
14230 p = p->pNext;
14232 if( p->pNext==pVfs ){
14233 p->pNext = pVfs->pNext;
14253 pVfs->pNext = vfsList;
14256 pVfs->pNext = vfsList->pNext;
14257 vfsList->pNext = pVfs;
14635 struct MemBlockHdr *pNext, *pPrev; /* Linked list of all unfreed memory */
14838 pHdr->pNext = 0;
14841 mem.pLast->pNext = pHdr;
14890 assert( pHdr->pPrev->pNext==pHdr );
14891 pHdr->pPrev->pNext = pHdr->pNext;
14894 mem.pFirst = pHdr->pNext;
14896 if( pHdr->pNext ){
14897 assert( pHdr->pNext->pPrev==pHdr );
14898 pHdr->pNext->pPrev = pHdr->pPrev;
15043 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){
15065 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){
17745 struct ScratchFreeslot *pNext; /* Next unused scratch buffer */
17880 pSlot->pNext = (ScratchFreeslot*)(sz+(char*)pSlot);
17881 pSlot = pSlot->pNext;
17883 pSlot->pNext = 0;
18061 mem0.pScratchFree = mem0.pScratchFree->pNext;
18109 pSlot->pNext = mem0.pScratchFree;
18198 pBuf->pNext = db->lookaside.pFree;
18330 db->lookaside.pFree = pBuf->pNext;
22763 ** pNext
22778 os2ShmNode *pNext; /* Next in list of all os2ShmNode objects */
22808 os2ShmLink *pNext; /* Next os2Shm with the same os2ShmNode */
22921 pNode = pNode->pNext ) ;
22956 pNode->pNext = os2ShmNodeList;
22972 pLink->pNext = pNode->pFirst;
23010 *ppNode = pNode->pNext;
23052 ppNode = &pNode->pNext;
23186 ppLink = &(*ppLink)->pNext ) ;
23191 *ppLink = pLink->pNext;
23249 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
23274 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
23299 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
23905 0, /* pNext */
24131 UnixUnusedFd *pNext; /* Next unused file descriptor on same file */
24843 struct vxworksFileId *pNext; /* Next in a list of them all */
24921 for(pCandidate=vxworksFileList; pCandidate; pCandidate=pCandidate->pNext){
24935 pNew->pNext = vxworksFileList;
24951 for(pp=&vxworksFileList; *pp && *pp!=pId; pp = &((*pp)->pNext)){}
24953 *pp = pId->pNext;
25084 unixInodeInfo *pNext; /* List of all unixInodeInfo objects */
25196 UnixUnusedFd *pNext;
25197 for(p=pInode->pUnused; p; p=pNext){
25198 pNext = p->pNext;
25220 assert( pInode->pPrev->pNext==pInode );
25221 pInode->pPrev->pNext = pInode->pNext;
25224 inodeList = pInode->pNext;
25226 if( pInode->pNext ){
25227 assert( pInode->pNext->pPrev==pInode );
25228 pInode->pNext->pPrev = pInode->pPrev;
25304 pInode = pInode->pNext;
25314 pInode->pNext = inodeList;
25671 p->pNext = pInode->pUnused;
27739 unixShm *pNext; /* Next unixShm with the same unixShmNode */
27996 p->pNext = pShmNode->pFirst;
28169 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
28194 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
28219 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
28284 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
28285 *pp = p->pNext;
28922 pInode = pInode->pNext;
28926 for(pp=&pInode->pUnused; *pp && (*pp)->flags!=flags; pp=&((*pp)->pNext));
28929 *pp = pUnused->pNext;
30837 0, /* pNext */ \
30861 ** Note that the sqlite3_vfs.pNext field of the VFS object is modified
32381 ** pNext
32408 winShmNode *pNext; /* Next in list of all winShmNode objects */
32436 winShm *pNext; /* Next winShm with the same winShmNode */
32540 *pp = p->pNext;
32544 pp = &p->pNext;
32585 for(pShmNode = winShmNodeList; pShmNode; pShmNode=pShmNode->pNext){
32597 pShmNode->pNext = winShmNodeList;
32649 p->pNext = pShmNode->pFirst;
32685 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
32686 *pp = p->pNext;
32737 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
32762 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
32787 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
33871 0, /* pNext */
34738 PgHdr *pNext;
34739 for(p=pCache->pDirty; p; p=pNext){
34740 pNext = p->pDirtyNext;
35012 PgHdr1 *pNext; /* Next in hash table chain */
35023 PgFreeslot *pNext; /* Next free slot */
35105 p->pNext = pcache1.pFree;
35130 pcache1.pFree = pcache1.pFree->pNext;
35164 pSlot->pNext = pcache1.pFree;
35306 PgHdr1 *pNext = p->apHash[i];
35307 while( (pPage = pNext)!=0 ){
35309 pNext = pPage->pNext;
35310 pPage->pNext = apNew[h];
35372 for(pp=&pCache->apHash[h]; (*pp)!=pPage; pp=&(*pp)->pNext);
35373 *pp = (*pp)->pNext;
35413 *pp = pPage->pNext;
35417 pp = &pPage->pNext;
35611 for(pPage=pCache->apHash[h]; pPage&&pPage->iKey!=iKey; pPage=pPage->pNext);
35683 pPage->pNext = pCache->apHash[h];
35759 pp = &(*pp)->pNext;
35761 *pp = pPage->pNext;
35765 pPage->pNext = pCache->apHash[h];
39368 PgHdr *pNext = pList->pDirty;
39370 pList = pNext;
46516 BtLock *pNext; /* Next in BtShared.pLock list */
46552 Btree *pNext; /* List of other sharable Btrees from the same db */
46581 ** mutex, except for nRef and pNext which are accessed under the
46635 BtShared *pNext; /* Next on a list of sharable BtShared structs */
46689 BtCursor *pNext, *pPrev; /* Forms a linked list of all cursors */
46891 ** by all database connections. The p->pNext is a list of other
46894 ** p, then first unlock all of the others on p->pNext, then wait
46902 ** connected by pNext and pPrev should be in sorted order by
46905 assert( p->pNext==0 || p->pNext->pBt>p->pBt );
46907 assert( p->pNext==0 || p->pNext->db==p->db );
46909 assert( p->sharable || (p->pNext==0 && p->pPrev==0) );
46941 for(pLater=p->pNext; pLater; pLater=pLater->pNext){
46943 assert( pLater->pNext==0 || pLater->pNext->pBt>pLater->pBt );
46950 for(pLater=p->pNext; pLater; pLater=pLater->pNext){
47288 for(pLock=pBtree->pBt->pLock; pLock; pLock=pLock->pNext){
47323 for(p=pBtree->pBt->pCursor; p; p=p->pNext){
47370 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
47434 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
47451 pLock->pNext = pBt->pLock;
47490 *ppIter = pLock->pNext;
47496 ppIter = &pLock->pNext;
47529 for(pLock=pBt->pLock; pLock; pLock=pLock->pNext){
47569 for(p=pBt->pCursor; p; p=p->pNext){
47595 for(p=pBt->pCursor; p; p=p->pNext){
47741 for(p=pBt->pCursor; p; p=p->pNext){
48888 for(pBt=GLOBAL(BtShared*,sqlite3SharedCacheList); pBt; pBt=pBt->pNext){
49005 pBt->pNext = GLOBAL(BtShared*,sqlite3SharedCacheList);
49024 p->pNext = pSib;
49028 while( pSib->pNext && pSib->pNext->pBt<p->pBt ){
49029 pSib = pSib->pNext;
49031 p->pNext = pSib->pNext;
49033 if( p->pNext ){
49034 p->pNext->pPrev = p;
49036 pSib->pNext = p;
49087 GLOBAL(BtShared*,sqlite3SharedCacheList) = pBt->pNext;
49090 while( ALWAYS(pList) && pList->pNext!=pBt ){
49091 pList=pList->pNext;
49094 pList->pNext = pBt->pNext;
49140 pCur = pCur->pNext;
49177 if( p->pPrev ) p->pPrev->pNext = p->pNext;
49178 if( p->pNext ) p->pNext->pPrev = p->pPrev;
49676 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){
49731 p->lock.pNext = pBt->pLock;
50351 for(pCur=pBt->pCursor; pCur; pCur=pCur->pNext){
50378 for(p=pBtree->pBt->pCursor; p; p=p->pNext){
50593 pCur->pNext = pBt->pCursor;
50594 if( pCur->pNext ){
50595 pCur->pNext->pPrev = pCur;
50654 for(p=pCur->pBt->pCursor; p; p=p->pNext){
50682 pCur->pPrev->pNext = pCur->pNext;
50684 pBt->pCursor = pCur->pNext;
50686 if( pCur->pNext ){
50687 pCur->pNext->pPrev = pCur->pPrev;
55309 sqlite3_backup *pNext; /* Next backup associated with source pager */
55581 p->pNext = *pp;
55824 pp = &(*pp)->pNext;
55826 *pp = p->pNext;
55881 for(p=pBackup; p; p=p->pNext){
55914 for(p=pBackup; p; p=p->pNext){
57168 p->pNext = db->pVdbe;
57206 pTmp = pA->pNext;
57207 pA->pNext = pB->pNext;
57208 pB->pNext = pTmp;
57783 p->pNext = pVdbe->pProgram;
59061 p = p->pNext;
59522 SubProgram *pSub, *pNext;
59526 for(pSub=p->pProgram; pSub; pSub=pNext){
59527 pNext = pSub->pNext;
59548 p->pPrev->pNext = p->pNext;
59551 db->pVdbe = p->pNext;
59553 if( p->pNext ){
59554 p->pNext->pPrev = p->pPrev;
60284 for(p = db->pVdbe; p; p=p->pNext){
61641 sqlite3_stmt *pNext;
61644 pNext = (sqlite3_stmt*)pDb->pVdbe;
61646 pNext = (sqlite3_stmt*)((Vdbe*)pStmt)->pNext;
61649 return pNext;
62400 for(p=db->pSavepoint; p; p=p->pNext) n++;
64945 u.aq.pNew->pNext = db->pSavepoint;
64958 u.aq.pSavepoint = u.aq.pSavepoint->pNext
64983 int isTransaction = u.aq.pSavepoint->pNext==0 && db->isTransactionSavepoint;
65016 db->pSavepoint = u.aq.pTmp->pNext;
65027 db->pSavepoint = u.aq.pSavepoint->pNext;
66913 for(u.br.pVdbe=db->pVdbe; u.br.pVdbe; u.br.pVdbe = u.br.pVdbe->pNext){
68664 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
69180 FileChunk *pNext; /* Next chunk in the journal */
69227 pChunk=pChunk->pNext
69243 } while( nRead>=0 && (pChunk=pChunk->pNext)!=0 && nRead>0 );
69280 pNew->pNext = 0;
69283 pChunk->pNext = pNew;
69311 pChunk = pChunk->pNext;
69857 pNC = pNC->pNext;
69928 pTopNC = pTopNC->pNext;
70288 pSelect->pNext = 0;
70290 pSelect->pPrior->pNext = pSelect;
70334 pSelect = pSelect->pNext;
70513 sNC.pNext = pOuterNC;
70574 sNC.pNext = 0;
72222 for(pIdx=pTab->pIndex; pIdx && eType==0 && affinity_ok; pIdx=pIdx->pNext){
74804 for(pTrig=sqlite3TriggerList(pParse, pTab); pTrig; pTrig=pTrig->pNext){
74842 for(pTrig=sqlite3TriggerList(pParse, pTab); pTrig; pTrig=pTrig->pNext){
75487 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
76411 0, /* pNext */
76433 0, /* pNext */
76582 pStep = pStep->pNext;
77221 pIndex->pTable->pIndex = pIndex->pNext;
77227 while( ALWAYS(p) && p->pNext!=pIndex ){ p = p->pNext; }
77228 if( ALWAYS(p && p->pNext==pIndex) ){
77229 p->pNext = pIndex->pNext;
77348 Index *pIndex, *pNext;
77357 for(pIndex = pTable->pIndex; pIndex; pIndex=pNext){
77358 pNext = pIndex->pNext;
78080 for(pIdx=p->pIndex; pIdx; pIdx=pIdx->pNext){
78776 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
78806 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
78936 pTrigger = pTrigger->pNext;
79373 for(pLoop=pTab->pIndex, n=1; pLoop; pLoop=pLoop->pNext, n++){}
79541 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
79677 pIndex->pNext = pTab->pIndex;
79681 while( pOther->pNext && pOther->pNext->onError!=OE_Replace ){
79682 pOther = pOther->pNext;
79684 pIndex->pNext = pOther->pNext;
79685 pOther->pNext = pIndex;
80459 for(pIndex=pTab->pIndex; pIndex; pIndex=pIndex->pNext){
80891 assert( pOther!=pDef && pOther->pNext!=pDef );
80892 pDef->pNext = pOther->pNext;
80893 pOther->pNext = pDef;
80895 pDef->pNext = 0;
80949 p = p->pNext;
80974 p = p->pNext;
81358 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
81414 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
81475 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
81651 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
83517 for(pIdx=pParent->pIndex; pIdx; pIdx=pIdx->pNext){
84447 FKey *pNext; /* Copy of pFKey->pNextFrom */
84450 for(pFKey=pTab->pFKey; pFKey; pFKey=pNext){
84477 pNext = pFKey->pNextFrom;
84636 for(pIndex=pTab->pIndex; pIndex; pIndex=pIndex->pNext){
84685 while( pInfo && pInfo->pTab!=pTab ){ pInfo = pInfo->pNext; }
84689 pInfo->pNext = pToplevel->pAinc;
84720 for(p = pParse->pAinc; p; p = p->pNext){
84767 for(p = pParse->pAinc; p; p = p->pNext){
85498 for(idx=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, idx++){
85796 for(iCur=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, iCur++){
85927 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){}
85982 for(i=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
86204 for(pDestIdx=pDest->pIndex; pDestIdx; pDestIdx=pDestIdx->pNext){
86208 for(pSrcIdx=pSrc->pIndex; pSrcIdx; pSrcIdx=pSrcIdx->pNext){
86278 for(pDestIdx=pDest->pIndex; pDestIdx; pDestIdx=pDestIdx->pNext){
86279 for(pSrcIdx=pSrc->pIndex; ALWAYS(pSrcIdx); pSrcIdx=pSrcIdx->pNext){
88482 pIdx = pIdx->pNext;
88658 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
88696 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
88723 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
89732 pParse->pTriggerPrg = pT->pNext;
90931 pNC = pNC->pNext;
90970 sNC.pNext = pNC;
91005 sNC.pNext = pNC;
93045 pIdx=pIdx->pNext
93757 pLoop->pNext = pRight;
94167 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
94608 pTriggerStep = pTriggerStep->pNext;
94621 ** the table. The list is connected by Trigger.pNext pointers.
94649 pTrig->pNext = (pList ? pList : pTab->pTrigger);
94863 pStepList = pStepList->pNext;
94907 pLink->pNext = pTab->pTrigger;
95185 for(pp=&pTab->pTrigger; *pp!=pTrigger; pp=&((*pp)->pNext));
95186 *pp = (*pp)->pNext;
95232 for(p=pList; p; p=p->pNext){
95290 for(pStep=pStepList; pStep; pStep=pStep->pNext){
95412 pPrg->pNext = pTop->pTriggerPrg;
95517 pPrg=pPrg->pNext
95623 for(p=pTrigger; p; p=p->pNext){
95682 for(p=pTrigger; p; p=p->pNext){
95877 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
95938 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){}
95943 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){
96047 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
96054 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
96227 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
96819 for(pVtab=pTab->pVTable; pVtab && pVtab->db!=db; pVtab=pVtab->pNext);
96866 VTable *pNext = pVTable->pNext;
96871 pRet->pNext = 0;
96873 pVTable->pNext = db2->pDisconnect;
96876 pVTable = pNext;
96914 VTable *pNext = p->pNext;
96916 p = pNext;
97201 pVTable->pNext = pTab->pVTable;
97426 assert( pTab->pVTable==p && p->pNext==0 );
100396 sPk.pNext = pFirst;
100408 for(; pProbe; pIdx=pProbe=pProbe->pNext){
105637 yymsp[-2].minor.yy203->pLast->pNext = yymsp[-1].minor.yy203;
106858 pParse->pAinc = p->pNext;
107732 p->pNext = db->lookaside.pFree;
107895 db->pSavepoint = pTmp->pNext;
107989 FuncDef *pNext, *pHash, *p;
107994 pNext = p->pNext;
107996 p = pNext;
119981 Fts3DeferredToken *pNext; /* Next in list of deferred tokens */
120830 char *pNext; /* Cursor variable */
120835 pNext = pReader->aNode;
120837 pNext = &pReader->aDoclist[pReader->nDoclist];
120840 if( !pNext || pNext>=&pReader->aNode[pReader->nNode] ){
120875 pNext = pReader->aNode;
120881 pNext += sqlite3Fts3GetVarint32(pNext, &nPrefix);
120882 pNext += sqlite3Fts3GetVarint32(pNext, &nSuffix);
120884 || &pNext[nSuffix]>&pReader->aNode[pReader->nNode]
120898 memcpy(&pReader->zTerm[nPrefix], pNext, nSuffix);
120900 pNext += nSuffix;
120901 pNext += sqlite3Fts3GetVarint32(pNext, &pReader->nDoclist);
120902 pReader->aDoclist = pNext;
122433 for(pDef=pCsr->pDeferred; pDef; pDef=pDef->pNext){
122448 Fts3DeferredToken *pNext;
122449 for(pDef=pCsr->pDeferred; pDef; pDef=pNext){
122450 pNext = pDef->pNext;
122492 for(pDef=pCsr->pDeferred; pDef && rc==SQLITE_OK; pDef=pDef->pNext){
122506 for(pDef=pCsr->pDeferred; pDef && rc==SQLITE_OK; pDef=pDef->pNext){
122531 pDeferred->pNext = pCsr->pDeferred;
124425 ** RtreeNode.pNext. RtreeNode.iNode stores the depth of the sub-tree
124531 RtreeNode *pNext; /* Next node in this hash chain */
124680 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
124689 assert( pNode->pNext==0 );
124691 pNode->pNext = pRtree->aHash[iHash];
124702 for( ; (*pp)!=pNode; pp = &(*pp)->pNext){ assert(*pp); }
124703 *pp = pNode->pNext;
124704 pNode->pNext = 0;
124770 pNode->pNext = 0;
126389 RtreeCell *pNext;
126390 pNext = PickNext(pRtree, aCell, nCell, pBboxLeft, pBboxRight, aiUsed);
126392 cellGrowth(pRtree, pBboxLeft, pNext) -
126393 cellGrowth(pRtree, pBboxRight, pNext)
126398 nodeInsertCell(pRtree, pRight, pNext);
126399 cellUnion(pRtree, pBboxRight, pNext);
126401 nodeInsertCell(pRtree, pLeft, pNext);
126402 cellUnion(pRtree, pBboxLeft, pNext);
126650 pNode->pNext = pRtree->pDeleted;
126983 pRtree->pDeleted = pLeaf->pNext;