1 /* 2 ** 2010 July 12 3 ** 4 ** The author disclaims copyright to this source code. In place of 5 ** a legal notice, here is a blessing: 6 ** 7 ** May you do good and not evil. 8 ** May you find forgiveness for yourself and forgive others. 9 ** May you share freely, never taking more than you give. 10 ** 11 ****************************************************************************** 12 ** 13 ** This file contains an implementation of the "dbstat" virtual table. 14 ** 15 ** The dbstat virtual table is used to extract low-level formatting 16 ** information from an SQLite database in order to implement the 17 ** "sqlite3_analyzer" utility. See the ../tool/spaceanal.tcl script 18 ** for an example implementation. 19 ** 20 ** Additional information is available on the "dbstat.html" page of the 21 ** official SQLite documentation. 22 */ 23 24 #include "sqliteInt.h" /* Requires access to internal data structures */ 25 #if (defined(SQLITE_ENABLE_DBSTAT_VTAB) || defined(SQLITE_TEST)) \ 26 && !defined(SQLITE_OMIT_VIRTUALTABLE) 27 28 /* 29 ** Page paths: 30 ** 31 ** The value of the 'path' column describes the path taken from the 32 ** root-node of the b-tree structure to each page. The value of the 33 ** root-node path is '/'. 34 ** 35 ** The value of the path for the left-most child page of the root of 36 ** a b-tree is '/000/'. (Btrees store content ordered from left to right 37 ** so the pages to the left have smaller keys than the pages to the right.) 38 ** The next to left-most child of the root page is 39 ** '/001', and so on, each sibling page identified by a 3-digit hex 40 ** value. The children of the 451st left-most sibling have paths such 41 ** as '/1c2/000/, '/1c2/001/' etc. 42 ** 43 ** Overflow pages are specified by appending a '+' character and a 44 ** six-digit hexadecimal value to the path to the cell they are linked 45 ** from. For example, the three overflow pages in a chain linked from 46 ** the left-most cell of the 450th child of the root page are identified 47 ** by the paths: 48 ** 49 ** '/1c2/000+000000' // First page in overflow chain 50 ** '/1c2/000+000001' // Second page in overflow chain 51 ** '/1c2/000+000002' // Third page in overflow chain 52 ** 53 ** If the paths are sorted using the BINARY collation sequence, then 54 ** the overflow pages associated with a cell will appear earlier in the 55 ** sort-order than its child page: 56 ** 57 ** '/1c2/000/' // Left-most child of 451st child of root 58 */ 59 #define VTAB_SCHEMA \ 60 "CREATE TABLE xx( " \ 61 " name TEXT, /* Name of table or index */" \ 62 " path TEXT, /* Path to page from root */" \ 63 " pageno INTEGER, /* Page number */" \ 64 " pagetype TEXT, /* 'internal', 'leaf' or 'overflow' */" \ 65 " ncell INTEGER, /* Cells on page (0 for overflow) */" \ 66 " payload INTEGER, /* Bytes of payload on this page */" \ 67 " unused INTEGER, /* Bytes of unused space on this page */" \ 68 " mx_payload INTEGER, /* Largest payload size of all cells */" \ 69 " pgoffset INTEGER, /* Offset of page in file */" \ 70 " pgsize INTEGER, /* Size of the page */" \ 71 " schema TEXT HIDDEN /* Database schema being analyzed */" \ 72 ");" 73 74 75 typedef struct StatTable StatTable; 76 typedef struct StatCursor StatCursor; 77 typedef struct StatPage StatPage; 78 typedef struct StatCell StatCell; 79 80 struct StatCell { 81 int nLocal; /* Bytes of local payload */ 82 u32 iChildPg; /* Child node (or 0 if this is a leaf) */ 83 int nOvfl; /* Entries in aOvfl[] */ 84 u32 *aOvfl; /* Array of overflow page numbers */ 85 int nLastOvfl; /* Bytes of payload on final overflow page */ 86 int iOvfl; /* Iterates through aOvfl[] */ 87 }; 88 89 struct StatPage { 90 u32 iPgno; 91 DbPage *pPg; 92 int iCell; 93 94 char *zPath; /* Path to this page */ 95 96 /* Variables populated by statDecodePage(): */ 97 u8 flags; /* Copy of flags byte */ 98 int nCell; /* Number of cells on page */ 99 int nUnused; /* Number of unused bytes on page */ 100 StatCell *aCell; /* Array of parsed cells */ 101 u32 iRightChildPg; /* Right-child page number (or 0) */ 102 int nMxPayload; /* Largest payload of any cell on this page */ 103 }; 104 105 struct StatCursor { 106 sqlite3_vtab_cursor base; 107 sqlite3_stmt *pStmt; /* Iterates through set of root pages */ 108 int isEof; /* After pStmt has returned SQLITE_DONE */ 109 int iDb; /* Schema used for this query */ 110 111 StatPage aPage[32]; 112 int iPage; /* Current entry in aPage[] */ 113 114 /* Values to return. */ 115 char *zName; /* Value of 'name' column */ 116 char *zPath; /* Value of 'path' column */ 117 u32 iPageno; /* Value of 'pageno' column */ 118 char *zPagetype; /* Value of 'pagetype' column */ 119 int nCell; /* Value of 'ncell' column */ 120 int nPayload; /* Value of 'payload' column */ 121 int nUnused; /* Value of 'unused' column */ 122 int nMxPayload; /* Value of 'mx_payload' column */ 123 i64 iOffset; /* Value of 'pgOffset' column */ 124 int szPage; /* Value of 'pgSize' column */ 125 }; 126 127 struct StatTable { 128 sqlite3_vtab base; 129 sqlite3 *db; 130 int iDb; /* Index of database to analyze */ 131 }; 132 133 #ifndef get2byte 134 # define get2byte(x) ((x)[0]<<8 | (x)[1]) 135 #endif 136 137 /* 138 ** Connect to or create a statvfs virtual table. 139 */ 140 static int statConnect( 141 sqlite3 *db, 142 void *pAux, 143 int argc, const char *const*argv, 144 sqlite3_vtab **ppVtab, 145 char **pzErr 146 ){ 147 StatTable *pTab = 0; 148 int rc = SQLITE_OK; 149 int iDb; 150 151 if( argc>=4 ){ 152 Token nm; 153 sqlite3TokenInit(&nm, (char*)argv[3]); 154 iDb = sqlite3FindDb(db, &nm); 155 if( iDb<0 ){ 156 *pzErr = sqlite3_mprintf("no such database: %s", argv[3]); 157 return SQLITE_ERROR; 158 } 159 }else{ 160 iDb = 0; 161 } 162 rc = sqlite3_declare_vtab(db, VTAB_SCHEMA); 163 if( rc==SQLITE_OK ){ 164 pTab = (StatTable *)sqlite3_malloc64(sizeof(StatTable)); 165 if( pTab==0 ) rc = SQLITE_NOMEM_BKPT; 166 } 167 168 assert( rc==SQLITE_OK || pTab==0 ); 169 if( rc==SQLITE_OK ){ 170 memset(pTab, 0, sizeof(StatTable)); 171 pTab->db = db; 172 pTab->iDb = iDb; 173 } 174 175 *ppVtab = (sqlite3_vtab*)pTab; 176 return rc; 177 } 178 179 /* 180 ** Disconnect from or destroy a statvfs virtual table. 181 */ 182 static int statDisconnect(sqlite3_vtab *pVtab){ 183 sqlite3_free(pVtab); 184 return SQLITE_OK; 185 } 186 187 /* 188 ** There is no "best-index". This virtual table always does a linear 189 ** scan. However, a schema=? constraint should cause this table to 190 ** operate on a different database schema, so check for it. 191 ** 192 ** idxNum is normally 0, but will be 1 if a schema=? constraint exists. 193 */ 194 static int statBestIndex(sqlite3_vtab *tab, sqlite3_index_info *pIdxInfo){ 195 int i; 196 197 /* Look for a valid schema=? constraint. If found, change the idxNum to 198 ** 1 and request the value of that constraint be sent to xFilter. And 199 ** lower the cost estimate to encourage the constrained version to be 200 ** used. 201 */ 202 for(i=0; i<pIdxInfo->nConstraint; i++){ 203 if( pIdxInfo->aConstraint[i].iColumn!=10 ) continue; 204 if( pIdxInfo->aConstraint[i].usable==0 ) return SQLITE_CONSTRAINT; 205 if( pIdxInfo->aConstraint[i].op!=SQLITE_INDEX_CONSTRAINT_EQ ) continue; 206 pIdxInfo->idxNum = 1; 207 pIdxInfo->estimatedCost = 1.0; 208 pIdxInfo->aConstraintUsage[i].argvIndex = 1; 209 pIdxInfo->aConstraintUsage[i].omit = 1; 210 break; 211 } 212 213 214 /* Records are always returned in ascending order of (name, path). 215 ** If this will satisfy the client, set the orderByConsumed flag so that 216 ** SQLite does not do an external sort. 217 */ 218 if( ( pIdxInfo->nOrderBy==1 219 && pIdxInfo->aOrderBy[0].iColumn==0 220 && pIdxInfo->aOrderBy[0].desc==0 221 ) || 222 ( pIdxInfo->nOrderBy==2 223 && pIdxInfo->aOrderBy[0].iColumn==0 224 && pIdxInfo->aOrderBy[0].desc==0 225 && pIdxInfo->aOrderBy[1].iColumn==1 226 && pIdxInfo->aOrderBy[1].desc==0 227 ) 228 ){ 229 pIdxInfo->orderByConsumed = 1; 230 } 231 232 return SQLITE_OK; 233 } 234 235 /* 236 ** Open a new statvfs cursor. 237 */ 238 static int statOpen(sqlite3_vtab *pVTab, sqlite3_vtab_cursor **ppCursor){ 239 StatTable *pTab = (StatTable *)pVTab; 240 StatCursor *pCsr; 241 242 pCsr = (StatCursor *)sqlite3_malloc64(sizeof(StatCursor)); 243 if( pCsr==0 ){ 244 return SQLITE_NOMEM_BKPT; 245 }else{ 246 memset(pCsr, 0, sizeof(StatCursor)); 247 pCsr->base.pVtab = pVTab; 248 pCsr->iDb = pTab->iDb; 249 } 250 251 *ppCursor = (sqlite3_vtab_cursor *)pCsr; 252 return SQLITE_OK; 253 } 254 255 static void statClearCells(StatPage *p){ 256 int i; 257 if( p->aCell ){ 258 for(i=0; i<p->nCell; i++){ 259 sqlite3_free(p->aCell[i].aOvfl); 260 } 261 sqlite3_free(p->aCell); 262 } 263 p->nCell = 0; 264 p->aCell = 0; 265 } 266 267 static void statClearPage(StatPage *p){ 268 statClearCells(p); 269 sqlite3PagerUnref(p->pPg); 270 sqlite3_free(p->zPath); 271 memset(p, 0, sizeof(StatPage)); 272 } 273 274 static void statResetCsr(StatCursor *pCsr){ 275 int i; 276 sqlite3_reset(pCsr->pStmt); 277 for(i=0; i<ArraySize(pCsr->aPage); i++){ 278 statClearPage(&pCsr->aPage[i]); 279 } 280 pCsr->iPage = 0; 281 sqlite3_free(pCsr->zPath); 282 pCsr->zPath = 0; 283 pCsr->isEof = 0; 284 } 285 286 /* 287 ** Close a statvfs cursor. 288 */ 289 static int statClose(sqlite3_vtab_cursor *pCursor){ 290 StatCursor *pCsr = (StatCursor *)pCursor; 291 statResetCsr(pCsr); 292 sqlite3_finalize(pCsr->pStmt); 293 sqlite3_free(pCsr); 294 return SQLITE_OK; 295 } 296 297 static void getLocalPayload( 298 int nUsable, /* Usable bytes per page */ 299 u8 flags, /* Page flags */ 300 int nTotal, /* Total record (payload) size */ 301 int *pnLocal /* OUT: Bytes stored locally */ 302 ){ 303 int nLocal; 304 int nMinLocal; 305 int nMaxLocal; 306 307 if( flags==0x0D ){ /* Table leaf node */ 308 nMinLocal = (nUsable - 12) * 32 / 255 - 23; 309 nMaxLocal = nUsable - 35; 310 }else{ /* Index interior and leaf nodes */ 311 nMinLocal = (nUsable - 12) * 32 / 255 - 23; 312 nMaxLocal = (nUsable - 12) * 64 / 255 - 23; 313 } 314 315 nLocal = nMinLocal + (nTotal - nMinLocal) % (nUsable - 4); 316 if( nLocal>nMaxLocal ) nLocal = nMinLocal; 317 *pnLocal = nLocal; 318 } 319 320 static int statDecodePage(Btree *pBt, StatPage *p){ 321 int nUnused; 322 int iOff; 323 int nHdr; 324 int isLeaf; 325 int szPage; 326 327 u8 *aData = sqlite3PagerGetData(p->pPg); 328 u8 *aHdr = &aData[p->iPgno==1 ? 100 : 0]; 329 330 p->flags = aHdr[0]; 331 if( p->flags==0x0A || p->flags==0x0D ){ 332 isLeaf = 1; 333 nHdr = 8; 334 }else if( p->flags==0x05 || p->flags==0x02 ){ 335 isLeaf = 0; 336 nHdr = 12; 337 }else{ 338 goto statPageIsCorrupt; 339 } 340 if( p->iPgno==1 ) nHdr += 100; 341 p->nCell = get2byte(&aHdr[3]); 342 p->nMxPayload = 0; 343 szPage = sqlite3BtreeGetPageSize(pBt); 344 345 nUnused = get2byte(&aHdr[5]) - nHdr - 2*p->nCell; 346 nUnused += (int)aHdr[7]; 347 iOff = get2byte(&aHdr[1]); 348 while( iOff ){ 349 int iNext; 350 if( iOff>=szPage ) goto statPageIsCorrupt; 351 nUnused += get2byte(&aData[iOff+2]); 352 iNext = get2byte(&aData[iOff]); 353 if( iNext<iOff+4 && iNext>0 ) goto statPageIsCorrupt; 354 iOff = iNext; 355 } 356 p->nUnused = nUnused; 357 p->iRightChildPg = isLeaf ? 0 : sqlite3Get4byte(&aHdr[8]); 358 359 if( p->nCell ){ 360 int i; /* Used to iterate through cells */ 361 int nUsable; /* Usable bytes per page */ 362 363 sqlite3BtreeEnter(pBt); 364 nUsable = szPage - sqlite3BtreeGetReserveNoMutex(pBt); 365 sqlite3BtreeLeave(pBt); 366 p->aCell = sqlite3_malloc64((p->nCell+1) * sizeof(StatCell)); 367 if( p->aCell==0 ) return SQLITE_NOMEM_BKPT; 368 memset(p->aCell, 0, (p->nCell+1) * sizeof(StatCell)); 369 370 for(i=0; i<p->nCell; i++){ 371 StatCell *pCell = &p->aCell[i]; 372 373 iOff = get2byte(&aData[nHdr+i*2]); 374 if( iOff<nHdr || iOff>=szPage ) goto statPageIsCorrupt; 375 if( !isLeaf ){ 376 pCell->iChildPg = sqlite3Get4byte(&aData[iOff]); 377 iOff += 4; 378 } 379 if( p->flags==0x05 ){ 380 /* A table interior node. nPayload==0. */ 381 }else{ 382 u32 nPayload; /* Bytes of payload total (local+overflow) */ 383 int nLocal; /* Bytes of payload stored locally */ 384 iOff += getVarint32(&aData[iOff], nPayload); 385 if( p->flags==0x0D ){ 386 u64 dummy; 387 iOff += sqlite3GetVarint(&aData[iOff], &dummy); 388 } 389 if( nPayload>(u32)p->nMxPayload ) p->nMxPayload = nPayload; 390 getLocalPayload(nUsable, p->flags, nPayload, &nLocal); 391 if( nLocal<0 ) goto statPageIsCorrupt; 392 pCell->nLocal = nLocal; 393 assert( nPayload>=(u32)nLocal ); 394 assert( nLocal<=(nUsable-35) ); 395 if( nPayload>(u32)nLocal ){ 396 int j; 397 int nOvfl = ((nPayload - nLocal) + nUsable-4 - 1) / (nUsable - 4); 398 if( iOff+nLocal>nUsable ) goto statPageIsCorrupt; 399 pCell->nLastOvfl = (nPayload-nLocal) - (nOvfl-1) * (nUsable-4); 400 pCell->nOvfl = nOvfl; 401 pCell->aOvfl = sqlite3_malloc64(sizeof(u32)*nOvfl); 402 if( pCell->aOvfl==0 ) return SQLITE_NOMEM_BKPT; 403 pCell->aOvfl[0] = sqlite3Get4byte(&aData[iOff+nLocal]); 404 for(j=1; j<nOvfl; j++){ 405 int rc; 406 u32 iPrev = pCell->aOvfl[j-1]; 407 DbPage *pPg = 0; 408 rc = sqlite3PagerGet(sqlite3BtreePager(pBt), iPrev, &pPg, 0); 409 if( rc!=SQLITE_OK ){ 410 assert( pPg==0 ); 411 return rc; 412 } 413 pCell->aOvfl[j] = sqlite3Get4byte(sqlite3PagerGetData(pPg)); 414 sqlite3PagerUnref(pPg); 415 } 416 } 417 } 418 } 419 } 420 421 return SQLITE_OK; 422 423 statPageIsCorrupt: 424 p->flags = 0; 425 statClearCells(p); 426 return SQLITE_OK; 427 } 428 429 /* 430 ** Populate the pCsr->iOffset and pCsr->szPage member variables. Based on 431 ** the current value of pCsr->iPageno. 432 */ 433 static void statSizeAndOffset(StatCursor *pCsr){ 434 StatTable *pTab = (StatTable *)((sqlite3_vtab_cursor *)pCsr)->pVtab; 435 Btree *pBt = pTab->db->aDb[pTab->iDb].pBt; 436 Pager *pPager = sqlite3BtreePager(pBt); 437 sqlite3_file *fd; 438 sqlite3_int64 x[2]; 439 440 /* The default page size and offset */ 441 pCsr->szPage = sqlite3BtreeGetPageSize(pBt); 442 pCsr->iOffset = (i64)pCsr->szPage * (pCsr->iPageno - 1); 443 444 /* If connected to a ZIPVFS backend, override the page size and 445 ** offset with actual values obtained from ZIPVFS. 446 */ 447 fd = sqlite3PagerFile(pPager); 448 x[0] = pCsr->iPageno; 449 if( sqlite3OsFileControl(fd, 230440, &x)==SQLITE_OK ){ 450 pCsr->iOffset = x[0]; 451 pCsr->szPage = (int)x[1]; 452 } 453 } 454 455 /* 456 ** Move a statvfs cursor to the next entry in the file. 457 */ 458 static int statNext(sqlite3_vtab_cursor *pCursor){ 459 int rc; 460 int nPayload; 461 char *z; 462 StatCursor *pCsr = (StatCursor *)pCursor; 463 StatTable *pTab = (StatTable *)pCursor->pVtab; 464 Btree *pBt = pTab->db->aDb[pCsr->iDb].pBt; 465 Pager *pPager = sqlite3BtreePager(pBt); 466 467 sqlite3_free(pCsr->zPath); 468 pCsr->zPath = 0; 469 470 statNextRestart: 471 if( pCsr->aPage[0].pPg==0 ){ 472 rc = sqlite3_step(pCsr->pStmt); 473 if( rc==SQLITE_ROW ){ 474 int nPage; 475 u32 iRoot = (u32)sqlite3_column_int64(pCsr->pStmt, 1); 476 sqlite3PagerPagecount(pPager, &nPage); 477 if( nPage==0 ){ 478 pCsr->isEof = 1; 479 return sqlite3_reset(pCsr->pStmt); 480 } 481 rc = sqlite3PagerGet(pPager, iRoot, &pCsr->aPage[0].pPg, 0); 482 pCsr->aPage[0].iPgno = iRoot; 483 pCsr->aPage[0].iCell = 0; 484 pCsr->aPage[0].zPath = z = sqlite3_mprintf("/"); 485 pCsr->iPage = 0; 486 if( z==0 ) rc = SQLITE_NOMEM_BKPT; 487 }else{ 488 pCsr->isEof = 1; 489 return sqlite3_reset(pCsr->pStmt); 490 } 491 }else{ 492 493 /* Page p itself has already been visited. */ 494 StatPage *p = &pCsr->aPage[pCsr->iPage]; 495 496 while( p->iCell<p->nCell ){ 497 StatCell *pCell = &p->aCell[p->iCell]; 498 if( pCell->iOvfl<pCell->nOvfl ){ 499 int nUsable; 500 sqlite3BtreeEnter(pBt); 501 nUsable = sqlite3BtreeGetPageSize(pBt) - 502 sqlite3BtreeGetReserveNoMutex(pBt); 503 sqlite3BtreeLeave(pBt); 504 pCsr->zName = (char *)sqlite3_column_text(pCsr->pStmt, 0); 505 pCsr->iPageno = pCell->aOvfl[pCell->iOvfl]; 506 pCsr->zPagetype = "overflow"; 507 pCsr->nCell = 0; 508 pCsr->nMxPayload = 0; 509 pCsr->zPath = z = sqlite3_mprintf( 510 "%s%.3x+%.6x", p->zPath, p->iCell, pCell->iOvfl 511 ); 512 if( pCell->iOvfl<pCell->nOvfl-1 ){ 513 pCsr->nUnused = 0; 514 pCsr->nPayload = nUsable - 4; 515 }else{ 516 pCsr->nPayload = pCell->nLastOvfl; 517 pCsr->nUnused = nUsable - 4 - pCsr->nPayload; 518 } 519 pCell->iOvfl++; 520 statSizeAndOffset(pCsr); 521 return z==0 ? SQLITE_NOMEM_BKPT : SQLITE_OK; 522 } 523 if( p->iRightChildPg ) break; 524 p->iCell++; 525 } 526 527 if( !p->iRightChildPg || p->iCell>p->nCell ){ 528 statClearPage(p); 529 if( pCsr->iPage==0 ) return statNext(pCursor); 530 pCsr->iPage--; 531 goto statNextRestart; /* Tail recursion */ 532 } 533 pCsr->iPage++; 534 assert( p==&pCsr->aPage[pCsr->iPage-1] ); 535 536 if( p->iCell==p->nCell ){ 537 p[1].iPgno = p->iRightChildPg; 538 }else{ 539 p[1].iPgno = p->aCell[p->iCell].iChildPg; 540 } 541 rc = sqlite3PagerGet(pPager, p[1].iPgno, &p[1].pPg, 0); 542 p[1].iCell = 0; 543 p[1].zPath = z = sqlite3_mprintf("%s%.3x/", p->zPath, p->iCell); 544 p->iCell++; 545 if( z==0 ) rc = SQLITE_NOMEM_BKPT; 546 } 547 548 549 /* Populate the StatCursor fields with the values to be returned 550 ** by the xColumn() and xRowid() methods. 551 */ 552 if( rc==SQLITE_OK ){ 553 int i; 554 StatPage *p = &pCsr->aPage[pCsr->iPage]; 555 pCsr->zName = (char *)sqlite3_column_text(pCsr->pStmt, 0); 556 pCsr->iPageno = p->iPgno; 557 558 rc = statDecodePage(pBt, p); 559 if( rc==SQLITE_OK ){ 560 statSizeAndOffset(pCsr); 561 562 switch( p->flags ){ 563 case 0x05: /* table internal */ 564 case 0x02: /* index internal */ 565 pCsr->zPagetype = "internal"; 566 break; 567 case 0x0D: /* table leaf */ 568 case 0x0A: /* index leaf */ 569 pCsr->zPagetype = "leaf"; 570 break; 571 default: 572 pCsr->zPagetype = "corrupted"; 573 break; 574 } 575 pCsr->nCell = p->nCell; 576 pCsr->nUnused = p->nUnused; 577 pCsr->nMxPayload = p->nMxPayload; 578 pCsr->zPath = z = sqlite3_mprintf("%s", p->zPath); 579 if( z==0 ) rc = SQLITE_NOMEM_BKPT; 580 nPayload = 0; 581 for(i=0; i<p->nCell; i++){ 582 nPayload += p->aCell[i].nLocal; 583 } 584 pCsr->nPayload = nPayload; 585 } 586 } 587 588 return rc; 589 } 590 591 static int statEof(sqlite3_vtab_cursor *pCursor){ 592 StatCursor *pCsr = (StatCursor *)pCursor; 593 return pCsr->isEof; 594 } 595 596 static int statFilter( 597 sqlite3_vtab_cursor *pCursor, 598 int idxNum, const char *idxStr, 599 int argc, sqlite3_value **argv 600 ){ 601 StatCursor *pCsr = (StatCursor *)pCursor; 602 StatTable *pTab = (StatTable*)(pCursor->pVtab); 603 char *zSql; 604 int rc = SQLITE_OK; 605 char *zMaster; 606 607 if( idxNum==1 ){ 608 const char *zDbase = (const char*)sqlite3_value_text(argv[0]); 609 pCsr->iDb = sqlite3FindDbName(pTab->db, zDbase); 610 if( pCsr->iDb<0 ){ 611 sqlite3_free(pCursor->pVtab->zErrMsg); 612 pCursor->pVtab->zErrMsg = sqlite3_mprintf("no such schema: %s", zDbase); 613 return pCursor->pVtab->zErrMsg ? SQLITE_ERROR : SQLITE_NOMEM_BKPT; 614 } 615 }else{ 616 pCsr->iDb = pTab->iDb; 617 } 618 statResetCsr(pCsr); 619 sqlite3_finalize(pCsr->pStmt); 620 pCsr->pStmt = 0; 621 zMaster = pCsr->iDb==1 ? "sqlite_temp_master" : "sqlite_master"; 622 zSql = sqlite3_mprintf( 623 "SELECT 'sqlite_master' AS name, 1 AS rootpage, 'table' AS type" 624 " UNION ALL " 625 "SELECT name, rootpage, type" 626 " FROM \"%w\".%s WHERE rootpage!=0" 627 " ORDER BY name", pTab->db->aDb[pCsr->iDb].zDbSName, zMaster); 628 if( zSql==0 ){ 629 return SQLITE_NOMEM_BKPT; 630 }else{ 631 rc = sqlite3_prepare_v2(pTab->db, zSql, -1, &pCsr->pStmt, 0); 632 sqlite3_free(zSql); 633 } 634 635 if( rc==SQLITE_OK ){ 636 rc = statNext(pCursor); 637 } 638 return rc; 639 } 640 641 static int statColumn( 642 sqlite3_vtab_cursor *pCursor, 643 sqlite3_context *ctx, 644 int i 645 ){ 646 StatCursor *pCsr = (StatCursor *)pCursor; 647 switch( i ){ 648 case 0: /* name */ 649 sqlite3_result_text(ctx, pCsr->zName, -1, SQLITE_TRANSIENT); 650 break; 651 case 1: /* path */ 652 sqlite3_result_text(ctx, pCsr->zPath, -1, SQLITE_TRANSIENT); 653 break; 654 case 2: /* pageno */ 655 sqlite3_result_int64(ctx, pCsr->iPageno); 656 break; 657 case 3: /* pagetype */ 658 sqlite3_result_text(ctx, pCsr->zPagetype, -1, SQLITE_STATIC); 659 break; 660 case 4: /* ncell */ 661 sqlite3_result_int(ctx, pCsr->nCell); 662 break; 663 case 5: /* payload */ 664 sqlite3_result_int(ctx, pCsr->nPayload); 665 break; 666 case 6: /* unused */ 667 sqlite3_result_int(ctx, pCsr->nUnused); 668 break; 669 case 7: /* mx_payload */ 670 sqlite3_result_int(ctx, pCsr->nMxPayload); 671 break; 672 case 8: /* pgoffset */ 673 sqlite3_result_int64(ctx, pCsr->iOffset); 674 break; 675 case 9: /* pgsize */ 676 sqlite3_result_int(ctx, pCsr->szPage); 677 break; 678 default: { /* schema */ 679 sqlite3 *db = sqlite3_context_db_handle(ctx); 680 int iDb = pCsr->iDb; 681 sqlite3_result_text(ctx, db->aDb[iDb].zDbSName, -1, SQLITE_STATIC); 682 break; 683 } 684 } 685 return SQLITE_OK; 686 } 687 688 static int statRowid(sqlite3_vtab_cursor *pCursor, sqlite_int64 *pRowid){ 689 StatCursor *pCsr = (StatCursor *)pCursor; 690 *pRowid = pCsr->iPageno; 691 return SQLITE_OK; 692 } 693 694 /* 695 ** Invoke this routine to register the "dbstat" virtual table module 696 */ 697 int sqlite3DbstatRegister(sqlite3 *db){ 698 static sqlite3_module dbstat_module = { 699 0, /* iVersion */ 700 statConnect, /* xCreate */ 701 statConnect, /* xConnect */ 702 statBestIndex, /* xBestIndex */ 703 statDisconnect, /* xDisconnect */ 704 statDisconnect, /* xDestroy */ 705 statOpen, /* xOpen - open a cursor */ 706 statClose, /* xClose - close a cursor */ 707 statFilter, /* xFilter - configure scan constraints */ 708 statNext, /* xNext - advance a cursor */ 709 statEof, /* xEof - check for end of scan */ 710 statColumn, /* xColumn - read data */ 711 statRowid, /* xRowid - read data */ 712 0, /* xUpdate */ 713 0, /* xBegin */ 714 0, /* xSync */ 715 0, /* xCommit */ 716 0, /* xRollback */ 717 0, /* xFindMethod */ 718 0, /* xRename */ 719 0, /* xSavepoint */ 720 0, /* xRelease */ 721 0, /* xRollbackTo */ 722 0 /* xShadowName */ 723 }; 724 return sqlite3_create_module(db, "dbstat", &dbstat_module, 0); 725 } 726 #elif defined(SQLITE_ENABLE_DBSTAT_VTAB) 727 int sqlite3DbstatRegister(sqlite3 *db){ return SQLITE_OK; } 728 #endif /* SQLITE_ENABLE_DBSTAT_VTAB */ 729