Home
last modified time | relevance | path

Searched refs:aRoot (Results 1 – 5 of 5) sorted by relevance

/titanic_50/usr/src/lib/libsqlite/src/
H A Dbtree.h144 #define sqliteBtreeIntegrityCheck(pBt, aRoot, nRoot)\ argument
145 (btOps(pBt)->IntegrityCheck(pBt, aRoot, nRoot))
H A Dtest3.c485 int *aRoot; in btree_integrity_check() local
495 aRoot = malloc( sizeof(int)*(argc-2) ); in btree_integrity_check()
497 if( Tcl_GetInt(interp, argv[i+2], &aRoot[i]) ) return TCL_ERROR; in btree_integrity_check()
499 zResult = sqliteBtreeIntegrityCheck(pBt, aRoot, nRoot); in btree_integrity_check()
H A Dvdbe.c3730 int *aRoot; in sqliteVdbeExec() local
3741 aRoot = sqliteMallocRaw( sizeof(int)*(nRoot+1) ); in sqliteVdbeExec()
3742 if( aRoot==0 ) goto no_mem; in sqliteVdbeExec()
3744 toInt((char*)sqliteHashKey(i), &aRoot[j]); in sqliteVdbeExec()
3746 aRoot[j] = 0; in sqliteVdbeExec()
3749 z = sqliteBtreeIntegrityCheck(db->aDb[pOp->p2].pBt, aRoot, nRoot); in sqliteVdbeExec()
3760 sqliteFree(aRoot); in sqliteVdbeExec()
H A Dbtree.c3433 char *fileBtreeIntegrityCheck(Btree *pBt, int *aRoot, int nRoot){ in fileBtreeIntegrityCheck() argument
3462 if( aRoot[i]==0 ) continue; in fileBtreeIntegrityCheck()
3463 checkTreePage(&sCheck, aRoot[i], 0, "List of tree roots: ", 0,0,0,0); in fileBtreeIntegrityCheck()
H A Dbtree_rb.c1245 static char *memRbtreeIntegrityCheck(Rbtree* tree, int* aRoot, int nRoot) in memRbtreeIntegrityCheck() argument