Home
last modified time | relevance | path

Searched refs:pLast (Results 1 – 19 of 19) sorted by relevance

/sqlite-3.40.0/src/
H A Drowset.c112 struct RowSetEntry *pLast; /* Last entry on the pEntry list */ member
137 p->pLast = 0; in sqlite3RowSetInit()
162 p->pLast = 0; in sqlite3RowSetClear()
212 struct RowSetEntry *pLast; /* The last prior entry */ in sqlite3RowSetInsert() local
221 pLast = p->pLast; in sqlite3RowSetInsert()
222 if( pLast ){ in sqlite3RowSetInsert()
223 if( rowid<=pLast->v ){ /*OPTIMIZATION-IF-FALSE*/ in sqlite3RowSetInsert()
228 pLast->pRight = pEntry; in sqlite3RowSetInsert()
232 p->pLast = pEntry; in sqlite3RowSetInsert()
480 pRowSet->pLast = 0; in sqlite3RowSetTest()
H A Dmem2.c93 struct MemBlockHdr *pLast; member
261 pHdr->pPrev = mem.pLast; in sqlite3MemMalloc()
262 if( mem.pLast ){ in sqlite3MemMalloc()
263 mem.pLast->pNext = pHdr; in sqlite3MemMalloc()
267 mem.pLast = pHdr; in sqlite3MemMalloc()
322 assert( mem.pLast==pHdr ); in sqlite3MemFree()
323 mem.pLast = pHdr->pPrev; in sqlite3MemFree()
H A Dwal.c3615 PgHdr *pLast = 0; /* Last frame in list */ in sqlite3WalFrames() local
3734 pLast = p; in sqlite3WalFrames()
3767 rc = walWriteOneFrame(&w, pLast, nTruncate, iOffset); in sqlite3WalFrames()
3771 assert( pLast!=0 ); in sqlite3WalFrames()
3804 assert( pLast!=0 || nExtra==0 ); in sqlite3WalFrames()
3808 rc = walIndexAppend(pWal, iFrame, pLast->pgno); in sqlite3WalFrames()
H A Dvdbesort.c2520 SortSubtask *pLast = &pSorter->aTask[pSorter->nTask-1]; in vdbeSorterSetupMerge() local
2521 rc = vdbeSortAllocUnpacked(pLast); in vdbeSorterSetupMerge()
2528 rc = vdbeIncrMergerNew(pLast, pMain, &pReadr->pIncr); in vdbeSorterSetupMerge()
2535 assert( pIncr->pTask!=pLast ); in vdbeSorterSetupMerge()
H A Dvdbe.c3266 Mem *pLast; /* Last field of the record */ in sqlite3VdbeExec() local
3296 pLast = &pData0[nField-1]; in sqlite3VdbeExec()
3305 assert( pData0<=pLast ); in sqlite3VdbeExec()
3317 assert( zAffinity[0]==0 || pRec<=pLast ); in sqlite3VdbeExec()
3328 while( (pLast->flags & MEM_Null)!=0 && nField>pOp->p5 ){ in sqlite3VdbeExec()
3329 pLast--; in sqlite3VdbeExec()
3361 pRec = pLast; in sqlite3VdbeExec()
3508 assert( pData0<=pLast ); in sqlite3VdbeExec()
3554 if( pRec==pLast ) break; in sqlite3VdbeExec()
H A Dtclsqlite.c1527 SqlPreparedStmt *pLast = pDb->stmtLast; in dbReleaseStmt() local
1528 pDb->stmtLast = pLast->pPrev; in dbReleaseStmt()
1531 dbFreeStmt(pLast); in dbReleaseStmt()
H A Dparse.y1553 A->pLast->pNext = X;
1554 A->pLast = X;
1558 A->pLast = A;
H A Dwhere.c4360 WhereLoop *pLast, /* Add this WhereLoop to the end of pPath->aLoop[] */ in wherePathSatisfiesOrderBy() argument
4430 pLoop = pLast; in wherePathSatisfiesOrderBy()
4711 static const char *wherePathName(WherePath *pPath, int nLoop, WhereLoop *pLast){ in wherePathName() argument
4715 if( pLast ) zName[i++] = pLast->cId; in wherePathName()
H A DsqliteInt.h3913 TriggerStep *pLast; /* Last element in link-list. Valid for 1st elem only */ member
H A Dshell.c.in1106 EQPGraphRow *pLast; /* Last element of the pRow list */ member
2027 if( p->sGraph.pLast ){
2028 p->sGraph.pLast->pNext = pNew;
2032 p->sGraph.pLast = pNew;
/sqlite-3.40.0/ext/lsm1/lsm-test/
H A Dlsmtest_tdb.c276 void *pLast, int nLast, in kc_scan() argument
280 pTestDb, pCtx, bReverse, pFirst, nFirst, pLast, nLast, xCallback in kc_scan()
354 void *pLast, int nLast, in mdb_scan() argument
358 pTestDb, pCtx, bReverse, pFirst, nFirst, pLast, nLast, xCallback in mdb_scan()
520 void *pLast, int nLast, in sql_scan() argument
527 pScan = pDb->apScan[(pFirst==0) + (pLast==0)*2 + bReverse*4]; in sql_scan()
530 if( pLast ) sqlite3_bind_blob(pScan, 2, pLast, nLast, SQLITE_STATIC); in sql_scan()
H A Dlsmtest_tdb3.c656 void *pLast, int nLast, in test_lsm_scan() argument
676 if( pLast && pFirst ){ in test_lsm_scan()
680 rc = lsm_csr_seek(csr, pLast, nLast, LSM_SEEK_GE); in test_lsm_scan()
685 if( pLast ){ in test_lsm_scan()
686 rc = lsm_csr_seek(csr, pLast, nLast, LSM_SEEK_LE); in test_lsm_scan()
709 }else if( bReverse==0 && pLast ){ in test_lsm_scan()
710 cmp = memcmp(pLast, pKey, MIN(nKey, nLast)); in test_lsm_scan()
H A Dlsmtest_tdb4.c487 void *pLast, int nLast, in bt_scan() argument
503 if( pLast ){ in bt_scan()
504 rc = sqlite4BtCsrSeek(pCsr, pLast, nLast, BT_SEEK_LE); in bt_scan()
531 if( pLast ){ in bt_scan()
534 res = memcmp(pLast, pK, nCmp); in bt_scan()
/sqlite-3.40.0/ext/rtree/
H A Dgeopoly.c960 GeoEvent head, *pLast; in geopolyEventMerge() local
962 pLast = &head; in geopolyEventMerge()
965 pLast->pNext = pRight; in geopolyEventMerge()
966 pLast = pRight; in geopolyEventMerge()
969 pLast->pNext = pLeft; in geopolyEventMerge()
970 pLast = pLeft; in geopolyEventMerge()
1007 GeoSegment head, *pLast; in geopolySegmentMerge() local
1009 pLast = &head; in geopolySegmentMerge()
1015 pLast = pRight; in geopolySegmentMerge()
1018 pLast->pNext = pLeft; in geopolySegmentMerge()
[all …]
/sqlite-3.40.0/ext/misc/
H A Dclosure.c383 closure_avl *pLast; /* Youngest node on the queue */ member
391 if( pQueue->pLast ){ in queuePush()
392 pQueue->pLast->pList = pNode; in queuePush()
396 pQueue->pLast = pNode; in queuePush()
406 if( pQueue->pFirst==0 ) pQueue->pLast = 0; in queuePull()
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_file.c1255 Page *pLast; in fsBlockNext() local
1256 rc = fsPageGet(pFS, 0, iRead*nPagePerBlock, 0, &pLast, 0); in fsBlockNext()
1258 *piNext = lsmGetU32(&pLast->aData[pFS->nPagesize-4]); in fsBlockNext()
1259 lsmFsPageRelease(pLast); in fsBlockNext()
2211 Page *pLast; in lsmFsSortedFinish() local
2212 rc = fsPageGet(pFS, 0, p->iLastPg, 0, &pLast, 0); in lsmFsSortedFinish()
2214 int iBlk = (int)lsmGetU32(&pLast->aData[pFS->nPagesize-4]); in lsmFsSortedFinish()
2216 lsmFsPageRelease(pLast); in lsmFsSortedFinish()
/sqlite-3.40.0/ext/expert/
H A Dsqlite3expert.c1128 static void idxScanFree(IdxScan *pScan, IdxScan *pLast){ in idxScanFree() argument
1131 for(p=pScan; p!=pLast; p=pNext){ in idxScanFree()
1144 static void idxStatementFree(IdxStatement *pStatement, IdxStatement *pLast){ in idxStatementFree() argument
1147 for(p=pStatement; p!=pLast; p=pNext){ in idxStatementFree()
/sqlite-3.40.0/ext/fts5/
H A Dfts5_expr.c1629 Fts5ExprPhrase *pLast = pRet->apPhrase[pRet->nPhrase-1]; in sqlite3Fts5ParseNearset() local
1633 assert( pLast==pParse->apPhrase[pParse->nPhrase-2] ); in sqlite3Fts5ParseNearset()
1638 pPhrase = pLast; in sqlite3Fts5ParseNearset()
1639 }else if( pLast->nTerm==0 ){ in sqlite3Fts5ParseNearset()
1640 fts5ExprPhraseFree(pLast); in sqlite3Fts5ParseNearset()
H A Dfts5_index.c2161 Fts5Data *pLast = 0; in fts5SegIterReverse() local
2167 pLast = fts5LeafRead(p, FTS5_SEGMENT_ROWID(iSegid, pgnoLast)); in fts5SegIterReverse()
2200 SWAPVAL(Fts5Data*, pNew, pLast); in fts5SegIterReverse()
2219 if( pLast ){ in fts5SegIterReverse()
2222 pIter->pLeaf = pLast; in fts5SegIterReverse()
2224 iOff = fts5LeafFirstRowidOff(pLast); in fts5SegIterReverse()
2225 if( iOff>pLast->szLeaf ){ in fts5SegIterReverse()
2229 iOff += fts5GetVarint(&pLast->p[iOff], (u64*)&pIter->iRowid); in fts5SegIterReverse()
2232 if( fts5LeafIsTermless(pLast) ){ in fts5SegIterReverse()
2233 pIter->iEndofDoclist = pLast->nn+1; in fts5SegIterReverse()
[all …]