Searched refs:nRoot (Results 1 - 5 of 5) sorted by relevance
| /illumos-gate/usr/src/lib/libsqlite/src/ |
| H A D | btree.h | 144 #define sqliteBtreeIntegrityCheck(pBt, aRoot, nRoot)\
145 (btOps(pBt)->IntegrityCheck(pBt, aRoot, nRoot))
|
| H A D | test3.c | 484 int nRoot; local
494 nRoot = argc-2;
499 zResult = sqliteBtreeIntegrityCheck(pBt, aRoot, nRoot);
|
| H A D | vdbe.c | 3729 int nRoot; local
3740 nRoot = sqliteHashCount(&pSet->hash);
3741 aRoot = sqliteMallocRaw( sizeof(int)*(nRoot+1) );
3749 z = sqliteBtreeIntegrityCheck(db->aDb[pOp->p2].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 | btree.c | 3426 ** a table. nRoot is the number of entries in aRoot.
3433 char *fileBtreeIntegrityCheck(Btree *pBt, int *aRoot, int nRoot){ argument
3461 for(i=0; i<nRoot; i++){
|
Completed in 81 milliseconds