Lines Matching refs:tree
140 static int memRbtreeClearTable(Rbtree* tree, int n);
328 static void check_redblack_tree(BtRbTree * tree, char ** msg) in check_redblack_tree() argument
337 pNode = tree->pHead; in check_redblack_tree()
364 *msg = append_node(*msg, tree->pHead, 0); in check_redblack_tree()
384 *msg = append_node(*msg, tree->pHead, 0); in check_redblack_tree()
644 static int memRbtreeCreateTable(Rbtree* tree, int* n) in memRbtreeCreateTable() argument
646 assert( tree->eTransState != TRANS_NONE ); in memRbtreeCreateTable()
648 *n = tree->next_idx++; in memRbtreeCreateTable()
649 btreeCreateTable(tree, *n); in memRbtreeCreateTable()
654 if( tree->eTransState != TRANS_ROLLBACK ){ in memRbtreeCreateTable()
659 btreeLogRollbackOp(tree, pRollbackOp); in memRbtreeCreateTable()
668 static int memRbtreeDropTable(Rbtree* tree, int n) in memRbtreeDropTable() argument
671 assert( tree->eTransState != TRANS_NONE ); in memRbtreeDropTable()
673 memRbtreeClearTable(tree, n); in memRbtreeDropTable()
674 pTree = sqliteHashInsert(&tree->tblHash, 0, n, 0); in memRbtreeDropTable()
679 if( tree->eTransState != TRANS_ROLLBACK ){ in memRbtreeDropTable()
684 btreeLogRollbackOp(tree, pRollbackOp); in memRbtreeDropTable()
715 Rbtree* tree, in memRbtreeCursor() argument
721 assert(tree); in memRbtreeCursor()
724 pCur->pTree = sqliteHashFind(&tree->tblHash, 0, iTable); in memRbtreeCursor()
726 pCur->pRbtree = tree; in memRbtreeCursor()
1026 static int memRbtreeClearTable(Rbtree* tree, int n) in memRbtreeClearTable() argument
1031 pTree = sqliteHashFind(&tree->tblHash, 0, n); in memRbtreeClearTable()
1044 if( tree->eTransState == TRANS_ROLLBACK ){ in memRbtreeClearTable()
1056 btreeLogRollbackOp(tree, pRollbackOp); in memRbtreeClearTable()
1225 static int memRbtreeGetMeta(Rbtree* tree, int* aMeta) in memRbtreeGetMeta() argument
1227 memcpy( aMeta, tree->aMetaData, sizeof(int) * SQLITE_N_BTREE_META ); in memRbtreeGetMeta()
1231 static int memRbtreeUpdateMeta(Rbtree* tree, int* aMeta) in memRbtreeUpdateMeta() argument
1233 memcpy( tree->aMetaData, aMeta, sizeof(int) * SQLITE_N_BTREE_META ); in memRbtreeUpdateMeta()
1242 static char *memRbtreeIntegrityCheck(Rbtree* tree, int* aRoot, int nRoot) in memRbtreeIntegrityCheck() argument
1247 for(p=sqliteHashFirst(&tree->tblHash); p; p=sqliteHashNext(p)){ in memRbtreeIntegrityCheck()
1255 static int memRbtreeSetCacheSize(Rbtree* tree, int sz) in memRbtreeSetCacheSize() argument
1264 static int memRbtreeBeginTrans(Rbtree* tree) in memRbtreeBeginTrans() argument
1266 if( tree->eTransState != TRANS_NONE ) in memRbtreeBeginTrans()
1269 assert( tree->pTransRollback == 0 ); in memRbtreeBeginTrans()
1270 tree->eTransState = TRANS_INTRANSACTION; in memRbtreeBeginTrans()
1287 static int memRbtreeCommit(Rbtree* tree){ in memRbtreeCommit() argument
1289 deleteRollbackList(tree->pCheckRollback); in memRbtreeCommit()
1290 deleteRollbackList(tree->pTransRollback); in memRbtreeCommit()
1291 tree->pTransRollback = 0; in memRbtreeCommit()
1292 tree->pCheckRollback = 0; in memRbtreeCommit()
1293 tree->pCheckRollbackTail = 0; in memRbtreeCommit()
1294 tree->eTransState = TRANS_NONE; in memRbtreeCommit()
1301 static int memRbtreeClose(Rbtree* tree) in memRbtreeClose() argument
1304 memRbtreeCommit(tree); in memRbtreeClose()
1305 while( (p=sqliteHashFirst(&tree->tblHash))!=0 ){ in memRbtreeClose()
1306 tree->eTransState = TRANS_ROLLBACK; in memRbtreeClose()
1307 memRbtreeDropTable(tree, sqliteHashKeysize(p)); in memRbtreeClose()
1309 sqliteHashClear(&tree->tblHash); in memRbtreeClose()
1310 sqliteFree(tree); in memRbtreeClose()
1361 static int memRbtreeRollback(Rbtree* tree) in memRbtreeRollback() argument
1363 tree->eTransState = TRANS_ROLLBACK; in memRbtreeRollback()
1364 execute_rollback_list(tree, tree->pCheckRollback); in memRbtreeRollback()
1365 execute_rollback_list(tree, tree->pTransRollback); in memRbtreeRollback()
1366 tree->pTransRollback = 0; in memRbtreeRollback()
1367 tree->pCheckRollback = 0; in memRbtreeRollback()
1368 tree->pCheckRollbackTail = 0; in memRbtreeRollback()
1369 tree->eTransState = TRANS_NONE; in memRbtreeRollback()
1373 static int memRbtreeBeginCkpt(Rbtree* tree) in memRbtreeBeginCkpt() argument
1375 if( tree->eTransState != TRANS_INTRANSACTION ) in memRbtreeBeginCkpt()
1378 assert( tree->pCheckRollback == 0 ); in memRbtreeBeginCkpt()
1379 assert( tree->pCheckRollbackTail == 0 ); in memRbtreeBeginCkpt()
1380 tree->eTransState = TRANS_INCHECKPOINT; in memRbtreeBeginCkpt()
1384 static int memRbtreeCommitCkpt(Rbtree* tree) in memRbtreeCommitCkpt() argument
1386 if( tree->eTransState == TRANS_INCHECKPOINT ){ in memRbtreeCommitCkpt()
1387 if( tree->pCheckRollback ){ in memRbtreeCommitCkpt()
1388 tree->pCheckRollbackTail->pNext = tree->pTransRollback; in memRbtreeCommitCkpt()
1389 tree->pTransRollback = tree->pCheckRollback; in memRbtreeCommitCkpt()
1390 tree->pCheckRollback = 0; in memRbtreeCommitCkpt()
1391 tree->pCheckRollbackTail = 0; in memRbtreeCommitCkpt()
1393 tree->eTransState = TRANS_INTRANSACTION; in memRbtreeCommitCkpt()
1398 static int memRbtreeRollbackCkpt(Rbtree* tree) in memRbtreeRollbackCkpt() argument
1400 if( tree->eTransState != TRANS_INCHECKPOINT ) return SQLITE_OK; in memRbtreeRollbackCkpt()
1401 tree->eTransState = TRANS_ROLLBACK; in memRbtreeRollbackCkpt()
1402 execute_rollback_list(tree, tree->pCheckRollback); in memRbtreeRollbackCkpt()
1403 tree->pCheckRollback = 0; in memRbtreeRollbackCkpt()
1404 tree->pCheckRollbackTail = 0; in memRbtreeRollbackCkpt()
1405 tree->eTransState = TRANS_INTRANSACTION; in memRbtreeRollbackCkpt()
1410 static int memRbtreePageDump(Rbtree* tree, int pgno, int rec) in memRbtreePageDump() argument
1423 static struct Pager *memRbtreePager(Rbtree* tree) in memRbtreePager() argument
