Home
last modified time | relevance | path

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

/illumos-gate/usr/src/lib/libsqlite/src/
H A Dbtree.h141 #define sqliteBtreeIntegrityCheck(pBt, aRoot, nRoot)\ argument
142 (btOps(pBt)->IntegrityCheck(pBt, aRoot, nRoot))
H A Dtest3.c482 int *aRoot; in btree_integrity_check() local
492 aRoot = malloc( sizeof(int)*(argc-2) ); in btree_integrity_check()
494 if( Tcl_GetInt(interp, argv[i+2], &aRoot[i]) ) return TCL_ERROR; in btree_integrity_check()
496 zResult = sqliteBtreeIntegrityCheck(pBt, aRoot, nRoot); in btree_integrity_check()
H A Dvdbe.c3728 int *aRoot; in sqliteVdbeExec() local
3739 aRoot = sqliteMallocRaw( sizeof(int)*(nRoot+1) ); in sqliteVdbeExec()
3740 if( aRoot==0 ) goto no_mem; in sqliteVdbeExec()
3742 toInt((char*)sqliteHashKey(i), &aRoot[j]); in sqliteVdbeExec()
3744 aRoot[j] = 0; in sqliteVdbeExec()
3747 z = sqliteBtreeIntegrityCheck(db->aDb[pOp->p2].pBt, aRoot, nRoot); in sqliteVdbeExec()
3758 sqliteFree(aRoot); in sqliteVdbeExec()
H A Dbtree.c3431 char *fileBtreeIntegrityCheck(Btree *pBt, int *aRoot, int nRoot){ in fileBtreeIntegrityCheck() argument
3460 if( aRoot[i]==0 ) continue; in fileBtreeIntegrityCheck()
3461 checkTreePage(&sCheck, aRoot[i], 0, "List of tree roots: ", 0,0,0,0); in fileBtreeIntegrityCheck()
H A Dbtree_rb.c1242 static char *memRbtreeIntegrityCheck(Rbtree* tree, int* aRoot, int nRoot) in memRbtreeIntegrityCheck() argument