Home
last modified time | relevance | path

Searched refs:pTree (Results 1 – 3 of 3) sorted by relevance

/sqlite-3.40.0/src/
H A Drowset.c443 struct RowSetEntry *p, *pTree; in sqlite3RowSetTest() local
459 for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){ in sqlite3RowSetTest()
460 ppPrevTree = &pTree->pRight; in sqlite3RowSetTest()
461 if( pTree->pLeft==0 ){ in sqlite3RowSetTest()
467 pTree->pLeft = 0; in sqlite3RowSetTest()
471 if( pTree==0 ){ in sqlite3RowSetTest()
473 if( pTree ){ in sqlite3RowSetTest()
474 pTree->v = 0; in sqlite3RowSetTest()
475 pTree->pRight = 0; in sqlite3RowSetTest()
489 for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){ in sqlite3RowSetTest()
[all …]
/sqlite-3.40.0/ext/fts3/
H A Dfts3_write.c2037 if( pTree ){ in fts3NodeAddTerm()
2043 nPrefix = fts3PrefixCompress(pTree->zTerm, pTree->nTerm, zTerm, nTerm); in fts3NodeAddTerm()
2062 assert( pTree->aData==(char *)&pTree[1] ); in fts3NodeAddTerm()
2077 pTree->nEntry++; in fts3NodeAddTerm()
2088 pTree->zTerm = pTree->zMalloc; in fts3NodeAddTerm()
2115 if( pTree ){ in fts3NodeAddTerm()
2126 pTree->zMalloc = 0; in fts3NodeAddTerm()
2140 SegmentNode *pTree, in fts3TreeFinishNode() argument
2177 if( !pTree->pParent ){ in fts3NodeWrite()
2210 if( pTree ){ in fts3NodeFree()
[all …]
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_tree.c415 void assert_tree_looks_ok(int rc, Tree *pTree){ in assert_tree_looks_ok() argument
1457 assert_tree_looks_ok(LSM_OK, pTree); in treeInsertEntry()
1563 assert_tree_looks_ok(rc, pTree); in treeInsertEntry()