Home | History | Annotate | Download | only in dist

Lines Matching refs:aRoot

13590 SQLITE_PRIVATE char *sqlite3BtreeIntegrityCheck(Btree*, int *aRoot, int nRoot, int, int*);
69977 ** This routine does a complete check of the given BTree file. aRoot[] is
69979 ** a table. nRoot is the number of entries in aRoot.
69991 int *aRoot, /* An array of root pages numbers for individual trees */
69992 int nRoot, /* Number of entries in aRoot[] */
70051 if( aRoot[i]==0 ) continue;
70053 if( pBt->autoVacuum && aRoot[i]>1 ){
70054 checkPtrmap(&sCheck, aRoot[i], PTRMAP_ROOTPAGE, 0);
70057 checkTreePage(&sCheck, aRoot[i], &notUsed, LARGEST_INT64);
85686 int *aRoot; /* Array of rootpage numbers for tables to be checked */
85693 aRoot = pOp->p4.ai;
85695 assert( aRoot[0]==nRoot );
85703 z = sqlite3BtreeIntegrityCheck(db->aDb[pOp->p5].pBt, &aRoot[1], nRoot,
99029 int aRoot[ArraySize(aTable)];
99052 aRoot[i] = pParse->regRoot;
99059 aRoot[i] = pStat->tnum;
99061 sqlite3TableLock(pParse, iDb, aRoot[i], 1, zTab);
99073 sqlite3VdbeAddOp2(v, OP_Clear, aRoot[i], iDb);
99081 sqlite3VdbeAddOp4Int(v, OP_OpenWrite, iStatCur+i, aRoot[i], iDb, 3);
116783 int *aRoot; /* Array of root page numbers of all btrees */
116784 aRoot[] */
116807 aRoot = sqlite3DbMallocRawNN(db, sizeof(int)*(cnt+1));
116808 if( aRoot==0 ) break;
116812 if( HasRowid(pTab) ) aRoot[++cnt] = pTab->tnum;
116814 aRoot[++cnt] = pIdx->tnum;
116817 aRoot[0] = cnt;
116824 sqlite3VdbeAddOp4(v, OP_IntegrityCk, 2, cnt, 1, (char*)aRoot,P4_INTARRAY);
163087 const char *aRoot = 0; /* Pointer to %_segdir.root buffer */
163088 int nRoot = 0; /* Size of aRoot[] in bytes */
163104 aRoot = sqlite3_column_blob(pSelect, 4);
163138 int nHeight = (int)aRoot[0];
163155 memcpy(pNode->block.a, aRoot, nRoot);
163488 const char *aRoot = sqlite3_column_blob(pFetch, 4);
163491 rc = fts3TruncateNode(aRoot, nRoot, &root, zTerm, nTerm, &iBlock);