Home
last modified time | relevance | path

Searched refs:pLevel (Results 1 – 8 of 8) sorted by relevance

/sqlite-3.40.0/src/
H A Dwherecode.c254 pLoop = pLevel->pWLoop; in sqlite3WhereExplainBloomFilter()
654 sizeof(pLevel->u.in.aInLoop[0])*pLevel->u.in.nIn); in codeEqualityTerm()
1375 addrBrk = pLevel->addrBrk = pLevel->addrNxt = sqlite3VdbeMakeLabel(pParse); in sqlite3WhereCodeOneLoopStart()
1458 pLevel->p1 = iCur; in sqlite3WhereCodeOneLoopStart()
1656 pLevel->p1 = iCur; in sqlite3WhereCodeOneLoopStart()
1657 pLevel->p2 = start; in sqlite3WhereCodeOneLoopStart()
1830 addrNxt = (regBignull ? pLevel->addrBignull : pLevel->addrNxt); in sqlite3WhereCodeOneLoopStart()
1988 if( pLevel->p2==0 ) pLevel->p2 = sqlite3VdbeCurrentAddr(v); in sqlite3WhereCodeOneLoopStart()
2582 if( pLevel->pRJ ){ in sqlite3WhereCodeOneLoopStart()
2632 if( pLevel->pRJ ){ in sqlite3WhereCodeOneLoopStart()
[all …]
H A Dwhere.c5096 pLevel->iTabCur = pWInfo->pTabList->a[pLevel->iFrom].iCursor; in wherePathSolver()
5989 for(ii=0, pLevel=pWInfo->a; ii<nTabList; ii++, pLevel++){ in sqlite3WhereBegin()
6179 &pTabList->a[pLevel->iFrom], notReady, pLevel); in sqlite3WhereBegin()
6259 WhereLevel *pLevel; in sqlite3WhereEnd() local
6272 if( pLevel->pRJ ){ in sqlite3WhereEnd()
6310 if( pLevel->addrCont ) sqlite3VdbeResolveLabel(v, pLevel->addrCont); in sqlite3WhereEnd()
6311 sqlite3VdbeAddOp3(v, pLevel->op, pLevel->p1, pLevel->p2, pLevel->p3); in sqlite3WhereEnd()
6397 assert( pLevel->iTabCur==pTabList->a[pLevel->iFrom].iCursor ); in sqlite3WhereEnd()
6412 sqlite3VdbeAddOp2(v, OP_Gosub, pLevel->p1, pLevel->addrFirst); in sqlite3WhereEnd()
6423 for(i=0, pLevel=pWInfo->a; i<pWInfo->nLevel; i++, pLevel++){ in sqlite3WhereEnd()
[all …]
H A DwhereInt.h523 WhereLevel *pLevel, /* Scan to write OP_Explain opcode for */
529 const WhereLevel *pLevel /* Bloom filter on this level */
550 WhereLevel *pLevel, /* The current level pointer */
556 WhereLevel *pLevel
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_ckpt.c328 pMerge = pLevel->pMerge; in ckptExportLevel()
329 ckptSetValue(p, iOut++, (u32)pLevel->iAge + (u32)(pLevel->flags<<16), pRc); in ckptExportLevel()
429 for(pLevel=lsmDbSnapshotLevel(pSnap); pLevel; pLevel=pLevel->pNext) nLevel++; in ckptExportSnapshot()
433 for(pLevel=lsmDbSnapshotLevel(pSnap); iLevel<nLevel; pLevel=pLevel->pNext){ in ckptExportSnapshot()
530 pLevel->pMerge = pMerge; in ckptSetupMerge()
567 Level *pLevel; in ckptLoadLevels() local
576 if( pLevel->nRight ){ in ckptLoadLevels()
581 *ppNext = pLevel; in ckptLoadLevels()
582 ppNext = &pLevel->pNext; in ckptLoadLevels()
593 if( pLevel->nRight>0 ){ in ckptLoadLevels()
[all …]
H A Dlsm_sorted.c1611 if( pPtr->pLevel->nRight==0 || pPtr->pSeg!=&pPtr->pLevel->lhs ){ in segmentPtrFwdPointer()
1616 ptr.pLevel = pPtr->pLevel; in segmentPtrFwdPointer()
1617 ptr.pSeg = &ptr.pLevel->aRhs[ptr.pLevel->nRight-1]; in segmentPtrFwdPointer()
4555 pMW->pLevel = pLevel; in mergeWorkerInit()
4693 for(pLevel=pTopLevel; pLevel; pLevel=pLevel->pNext){ in sortedSelectLevel()
4727 for(pLevel=pTopLevel; pLevel; pLevel=pLevel->pNext){ in sortedSelectLevel()
5078 if( pLevel->pMerge->nInput > pLevel->nRight ){ in sortedWork()
5404 for(pLevel=lsmDbSnapshotLevel(pDb->pClient); pLevel; pLevel=pLevel->pNext){ in lsmSortedAutoWork()
5886 for(pLevel=pTopLevel; pLevel; pLevel=pLevel->pNext){ in lsmSortedDumpStructure()
5927 iLevel, (int)pLevel->iAge, (int)pLevel->flags in lsmSortedDumpStructure()
[all …]
H A Dlsm_file.c1706 Level *pLevel, in fsLevelEndsBetween() argument
1713 if( fsRunEndsBetween(&pLevel->lhs, pIgnore, iFirst, iLast) ){ in fsLevelEndsBetween()
1716 for(i=0; i<pLevel->nRight; i++){ in fsLevelEndsBetween()
1717 if( fsRunEndsBetween(&pLevel->aRhs[i], pIgnore, iFirst, iLast) ){ in fsLevelEndsBetween()
1749 for(pLevel=lsmDbSnapshotLevel(pSnapshot); pLevel; pLevel=pLevel->pNext){ in fsFreeBlock()
1750 if( fsLevelEndsBetween(pLevel, pIgnore, iFirst, iLast) ){ in fsFreeBlock()
3256 Level *pLevel; in lsmFsIntegrityCheck() local
3275 for(pLevel=pWorker->pLevel; pLevel; pLevel=pLevel->pNext){ in lsmFsIntegrityCheck()
3277 checkBlocks(pFS, &pLevel->lhs, (pLevel->nRight!=0), nBlock, aUsed); in lsmFsIntegrityCheck()
3278 for(j=0; j<pLevel->nRight; j++){ in lsmFsIntegrityCheck()
[all …]
H A Dlsm_shared.c607 return pSnapshot->pLevel; in lsmDbSnapshotLevel()
610 void lsmDbSnapshotSetLevel(Snapshot *pSnap, Level *pLevel){ in lsmDbSnapshotSetLevel() argument
611 pSnap->pLevel = pLevel; in lsmDbSnapshotSetLevel()
992 lsmSortedFreeLevel(pEnv, p->pLevel); in lsmFreeSnapshot()
H A DlsmInt.h576 Level *pLevel; /* Pointer to level 0 of snapshot (or NULL) */ member
818 void *lsmSortedSplitKey(Level *pLevel, int *pnByte);