Home
last modified time | relevance | path

Searched refs:pFirst (Results 1 – 17 of 17) sorted by relevance

/sqlite-3.40.0/src/
H A Dmemjournal.c104 for(pChunk=p->pFirst; in memjrnlRead()
133 static void memjrnlFreeChunks(FileChunk *pFirst){ in memjrnlFreeChunks() argument
136 for(pIter=pFirst; pIter; pIter=pNext){ in memjrnlFreeChunks()
166 memjrnlFreeChunks(copy.pFirst); in memjrnlCreateFile()
218 if( iOfst==0 && p->pFirst ){ in memjrnlWrite()
236 assert( p->pFirst ); in memjrnlWrite()
239 assert( !p->pFirst ); in memjrnlWrite()
240 p->pFirst = pNew; in memjrnlWrite()
266 memjrnlFreeChunks(p->pFirst); in memjrnlTruncate()
267 p->pFirst = 0; in memjrnlTruncate()
[all …]
H A Dmem2.c92 struct MemBlockHdr *pFirst; member
265 mem.pFirst = pHdr; in sqlite3MemMalloc()
315 assert( mem.pFirst==pHdr ); in sqlite3MemFree()
316 mem.pFirst = pHdr->pNext; in sqlite3MemFree()
465 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){ in sqlite3MemdebugSync()
487 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){ in sqlite3MemdebugDump()
H A Dos_win.c3743 winShm *pFirst; /* All winShm objects pointing to this */ member
4011 p->pNext = pShmNode->pFirst;
4012 pShmNode->pFirst = p;
4047 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
4103 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
4128 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
4153 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
H A Dos_unix.c4290 unixShm *pFirst; /* All unixShm objects pointing to this */ member
4699 p->pNext = pShmNode->pFirst; in unixOpenSharedMemory()
4700 pShmNode->pFirst = p; in unixOpenSharedMemory()
4880 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){ in assertLockingArrayOk()
5083 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){} in unixShmUnmap()
H A Dexpr.c1900 Expr *pFirst = pList->a[iFirst].pExpr; in sqlite3ExprListAppendVector() local
1901 assert( pFirst!=0 ); in sqlite3ExprListAppendVector()
1902 assert( pFirst->op==TK_SELECT_COLUMN ); in sqlite3ExprListAppendVector()
1906 pFirst->pRight = pExpr; in sqlite3ExprListAppendVector()
1911 pFirst->iTable = pColumns->nId; in sqlite3ExprListAppendVector()
H A Dvdbeaux.c1068 VdbeOp *pOut, *pFirst; in sqlite3VdbeAddOpList() local
1074 pFirst = pOut = &p->aOp[p->nOp]; in sqlite3VdbeAddOpList()
1102 return pFirst; in sqlite3VdbeAddOpList()
H A Dwhere.c3412 Index *pFirst; /* First of real indices on the table */ in whereLoopAddBtree() local
3424 pFirst = pSrc->pTab->pIndex; in whereLoopAddBtree()
3428 sPk.pNext = pFirst; in whereLoopAddBtree()
/sqlite-3.40.0/ext/lsm1/lsm-test/
H A Dlsmtest_mem.c32 TmBlockHdr *pFirst; member
132 pNew->pNext = pTm->pFirst; in tmMalloc()
134 if( pTm->pFirst ){ in tmMalloc()
135 pTm->pFirst->pPrev = pNew; in tmMalloc()
137 pTm->pFirst = pNew; in tmMalloc()
194 assert( pHdr==pTm->pFirst ); in tmFree()
195 pTm->pFirst = pHdr->pNext; in tmFree()
263 for(pHdr=pTm->pFirst; pHdr; pHdr=pHdr->pNext){ in tmMallocCheck()
H A Dlsmtest_tdb.c275 void *pFirst, int nFirst, in kc_scan() argument
280 pTestDb, pCtx, bReverse, pFirst, nFirst, pLast, nLast, xCallback in kc_scan()
353 void *pFirst, int nFirst, in mdb_scan() argument
358 pTestDb, pCtx, bReverse, pFirst, nFirst, pLast, nLast, xCallback in mdb_scan()
519 void *pFirst, int nFirst, in sql_scan() argument
527 pScan = pDb->apScan[(pFirst==0) + (pLast==0)*2 + bReverse*4]; in sql_scan()
529 if( pFirst ) sqlite3_bind_blob(pScan, 1, pFirst, nFirst, SQLITE_STATIC); in sql_scan()
H A Dlsmtest_tdb3.c655 void *pFirst, int nFirst, in test_lsm_scan() argument
676 if( pLast && pFirst ){ in test_lsm_scan()
678 rc = lsm_csr_seek(csr, pFirst, nFirst, LSM_SEEK_LE); in test_lsm_scan()
691 if( pFirst ){ in test_lsm_scan()
692 rc = lsm_csr_seek(csr, pFirst, nFirst, LSM_SEEK_GE); in test_lsm_scan()
706 if( bReverse && pFirst ){ in test_lsm_scan()
707 cmp = memcmp(pFirst, pKey, MIN(nKey, nFirst)); in test_lsm_scan()
H A Dlsmtest_tdb4.c486 void *pFirst, int nFirst, in bt_scan() argument
509 rc = sqlite4BtCsrSeek(pCsr, pFirst, nFirst, BT_SEEK_GE); in bt_scan()
524 if( pFirst ){ in bt_scan()
527 res = memcmp(pFirst, pK, nCmp); in bt_scan()
/sqlite-3.40.0/ext/misc/
H A Dclosure.c382 closure_avl *pFirst; /* Oldest node on the queue */ member
394 pQueue->pFirst = pNode; in queuePush()
403 closure_avl *p = pQueue->pFirst; in queuePull()
405 pQueue->pFirst = p->pList; in queuePull()
406 if( pQueue->pFirst==0 ) pQueue->pLast = 0; in queuePull()
/sqlite-3.40.0/ext/expert/
H A Dsqlite3expert.c147 IdxHashEntry *pFirst; member
257 pEntry->pNext = pHash->pFirst; in idxHashAdd()
258 pHash->pFirst = pEntry; in idxHashAdd()
1244 for(pEntry=hIdx.pFirst; pEntry; pEntry=pEntry->pNext){ in idxFindIndexes()
1380 IdxWrite *pFirst = p->pWrite; in idxProcessTriggers() local
1382 while( rc==SQLITE_OK && pFirst!=pEnd ){ in idxProcessTriggers()
1384 for(pIter=pFirst; rc==SQLITE_OK && pIter!=pEnd; pIter=pIter->pNext){ in idxProcessTriggers()
1387 pEnd = pFirst; in idxProcessTriggers()
1388 pFirst = p->pWrite; in idxProcessTriggers()
1976 for(pEntry=p->hIdx.pFirst; pEntry; pEntry=pEntry->pNext){ in sqlite3_expert_analyze()
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_tree.c651 ShmChunk *pFirst; /* Header of chunk treehdr.iFirst */ in treeShmalloc() local
656 pFirst = treeShmChunk(pDb, pDb->treehdr.iFirst); in treeShmalloc()
658 assert( shm_sequence_ge(pDb->treehdr.iUsedShmid, pFirst->iShmid) ); in treeShmalloc()
659 assert( (pDb->treehdr.iNextShmid+1-pDb->treehdr.nChunk)==pFirst->iShmid ); in treeShmalloc()
664 if( pDb->treehdr.iUsedShmid!=pFirst->iShmid ){ in treeShmalloc()
666 rc = lsmTreeInUse(pDb, pFirst->iShmid, &bInUse); in treeShmalloc()
673 pDb->treehdr.iFirst = pFirst->iNext; in treeShmalloc()
/sqlite-3.40.0/ext/rtree/
H A Drtree.c1498 RtreeSearchPoint *pNew, *pFirst; in rtreeSearchPointNew() local
1499 pFirst = rtreeSearchPointFirst(pCur); in rtreeSearchPointNew()
1501 if( pFirst==0 in rtreeSearchPointNew()
1502 || pFirst->rScore>rScore in rtreeSearchPointNew()
1503 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel) in rtreeSearchPointNew()
/sqlite-3.40.0/ext/fts5/
H A Dfts5_index.c2630 Fts5SegIter *pFirst = &pIter->aSeg[ pIter->aFirst[1].iFirst ]; in fts5AssertMultiIterSetup() local
2633 assert( (pFirst->pLeaf==0)==pIter->base.bEof ); in fts5AssertMultiIterSetup()
2638 assert( p1==pFirst in fts5AssertMultiIterSetup()
2640 || fts5BufferCompare(&pFirst->term, &p1->term) in fts5AssertMultiIterSetup()
/sqlite-3.40.0/tool/
H A Dlemon.c1567 struct rule *pFirst = 0; in Rule_merge() local
1568 struct rule **ppPrev = &pFirst; in Rule_merge()
1585 return pFirst; in Rule_merge()