Searched defs:aRoot (Results 1 - 4 of 4) sorted by relevance
| /illumos-gate/usr/src/lib/libsqlite/src/ |
| H A D | test3.c | 485 int *aRoot; local
495 aRoot = malloc( sizeof(int)*(argc-2) );
497 if( Tcl_GetInt(interp, argv[i+2], &aRoot[i]) ) return TCL_ERROR;
499 zResult = sqliteBtreeIntegrityCheck(pBt, aRoot, nRoot);
|
| H A D | btree_rb.c | 1243 * memory obtained from sqliteMalloc(). Parameters aRoot and nRoot are ignored.
1245 static char *memRbtreeIntegrityCheck(Rbtree* tree, int* aRoot, int nRoot) argument
|
| H A D | vdbe.c | 3730 int *aRoot; local
3741 aRoot = sqliteMallocRaw( sizeof(int)*(nRoot+1) );
3742 if( aRoot==0 ) goto no_mem;
3744 toInt((char*)sqliteHashKey(i), &aRoot[j]);
3746 aRoot[j] = 0;
3749 z = sqliteBtreeIntegrityCheck(db->aDb[pOp->p2].pBt, aRoot, nRoot);
3760 sqliteFree(aRoot);
|
| H A D | btree.c | 3424 ** This routine does a complete check of the given BTree file. aRoot[] is
3426 ** a table. nRoot is the number of entries in aRoot.
3433 char *fileBtreeIntegrityCheck(Btree *pBt, int *aRoot, int nRoot){ argument
3462 if( aRoot[i]==0 ) continue;
3463 checkTreePage(&sCheck, aRoot[i], 0, "List of tree roots: ", 0,0,0,0);
|
Completed in 65 milliseconds