Home
last modified time | relevance | path

Searched refs:pLeaf (Results 1 – 7 of 7) sorted by relevance

/sqlite-3.40.0/ext/fts5/
H A Dfts5_index.c1600 pLeaf = pIter->pLeaf; in fts5SegIterNextPage()
2033 Fts5Data *pLeaf = pIter->pLeaf; in fts5SegIterNext() local
2093 pLeaf = pIter->pLeaf; in fts5SegIterNext()
2100 if( pLeaf->nn>pLeaf->szLeaf ){ in fts5SegIterNext()
2106 else if( pLeaf->nn>pLeaf->szLeaf ){ in fts5SegIterNext()
2108 &pLeaf->p[pLeaf->szLeaf], iOff in fts5SegIterNext()
2541 pLeaf->p = (u8*)&pLeaf[1]; in fts5SegIterHashInit()
2550 pLeaf->nn = pLeaf->szLeaf = nList; in fts5SegIterHashInit()
2551 pIter->pLeaf = pLeaf; in fts5SegIterHashInit()
2595 if( p1->pLeaf || p2->pLeaf ){ in fts5AssertComparisonResult()
[all …]
/sqlite-3.40.0/ext/rtree/
H A Drtree.c1863 pLeaf = 0; in rtreeFilter()
1865 if( rc==SQLITE_OK && pLeaf!=0 ){ in rtreeFilter()
1868 pCsr->aNode[0] = pLeaf; in rtreeFilter()
2729 RtreeNode *pChild = pLeaf; in fixLeafParent()
3074 if( rc==SQLITE_OK && pLeaf ){ in rtreeDeleteRowid()
3080 rc2 = nodeRelease(pRtree, pLeaf); in rtreeDeleteRowid()
3119 for(pLeaf=pRtree->pDeleted; pLeaf; pLeaf=pRtree->pDeleted){ in rtreeDeleteRowid()
3123 pRtree->pDeleted = pLeaf->pNext; in rtreeDeleteRowid()
3125 sqlite3_free(pLeaf); in rtreeDeleteRowid()
3326 RtreeNode *pLeaf = 0; in rtreeUpdate() local
[all …]
H A Dgeopoly.c1361 RtreeNode *pLeaf; /* Leaf on which the required cell resides */ in geopolyFilter() local
1365 rc = findLeafNode(pRtree, iRowid, &pLeaf, &iNode); in geopolyFilter()
1366 if( rc==SQLITE_OK && pLeaf!=0 ){ in geopolyFilter()
1369 pCsr->aNode[0] = pLeaf; in geopolyFilter()
1372 rc = nodeRowidIndex(pRtree, pLeaf, iRowid, &iCell); in geopolyFilter()
1657 RtreeNode *pLeaf = 0; in geopolyUpdate() local
1663 rc = ChooseLeaf(pRtree, &cell, 0, &pLeaf); in geopolyUpdate()
1668 rc = rtreeInsertCell(pRtree, pLeaf, &cell, 0); in geopolyUpdate()
1669 rc2 = nodeRelease(pRtree, pLeaf); in geopolyUpdate()
/sqlite-3.40.0/ext/fts3/
H A Dfts3_write.c4026 nPrefix = fts3PrefixCompress(pLeaf->key.a, pLeaf->key.n, zTerm, nTerm); in fts3IncrmergeAppend()
4037 if( pLeaf->block.n>0 && (pLeaf->block.n + nSpace)>p->nNodeSize ){ in fts3IncrmergeAppend()
4038 rc = fts3WriteSegment(p, pLeaf->iBlock, pLeaf->block.a, pLeaf->block.n); in fts3IncrmergeAppend()
4058 pLeaf->iBlock++; in fts3IncrmergeAppend()
4059 pLeaf->key.n = 0; in fts3IncrmergeAppend()
4060 pLeaf->block.n = 0; in fts3IncrmergeAppend()
4069 blobGrowBuffer(&pLeaf->block, pLeaf->block.n + nSpace, &rc); in fts3IncrmergeAppend()
4071 if( pLeaf->block.n==0 ){ in fts3IncrmergeAppend()
4072 pLeaf->block.n = 1; in fts3IncrmergeAppend()
4073 pLeaf->block.a[0] = '\0'; in fts3IncrmergeAppend()
[all …]
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_tree.c1023 TreeNode *pLeaf = pCsr->apTreeNode[pCsr->iNode]; in treeInsertLeaf() local
1029 assert( pLeaf->aiKeyPtr[1] ); in treeInsertLeaf()
1035 if( pLeaf->aiKeyPtr[0] && pLeaf->aiKeyPtr[2] ){ in treeInsertLeaf()
1042 pNew->aiKeyPtr[1] = pLeaf->aiKeyPtr[0]; in treeInsertLeaf()
1043 pRight->aiKeyPtr[1] = pLeaf->aiKeyPtr[2]; in treeInsertLeaf()
1051 rc = treeInsert(pDb, pCsr, iNew, pLeaf->aiKeyPtr[1], iRight, in treeInsertLeaf()
1060 if( i<3 && pLeaf->aiKeyPtr[i] ){ in treeInsertLeaf()
1061 pNew->aiKeyPtr[iOut++] = pLeaf->aiKeyPtr[i]; in treeInsertLeaf()
/sqlite-3.40.0/src/
H A Dbtree.c5302 MemPage *pLeaf; in moveToParent() local
5316 pLeaf = pCur->pPage; in moveToParent()
5318 releasePageNotNull(pLeaf); in moveToParent()
9529 MemPage *pLeaf = pCur->pPage; in sqlite3BtreeDelete() local
9534 if( pLeaf->nFree<0 ){ in sqlite3BtreeDelete()
9535 rc = btreeComputeFreeSpace(pLeaf); in sqlite3BtreeDelete()
9543 pCell = findCell(pLeaf, pLeaf->nCell-1); in sqlite3BtreeDelete()
9544 if( pCell<&pLeaf->aData[4] ) return SQLITE_CORRUPT_BKPT; in sqlite3BtreeDelete()
9545 nCell = pLeaf->xCellSize(pLeaf, pCell); in sqlite3BtreeDelete()
9549 rc = sqlite3PagerWrite(pLeaf->pDbPage); in sqlite3BtreeDelete()
[all …]
H A Dvdbesort.c2370 MergeEngine *pLeaf /* Leaf to add to tree */ in vdbeSorterAddToTree() argument
2378 rc = vdbeIncrMergerNew(pTask, pLeaf, &pIncr); in vdbeSorterAddToTree()