1 /* 2 ** 2017 April 09 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 #include "sqlite3expert.h" 14 #include <assert.h> 15 #include <string.h> 16 #include <stdio.h> 17 18 #ifndef SQLITE_OMIT_VIRTUALTABLE 19 20 typedef sqlite3_int64 i64; 21 typedef sqlite3_uint64 u64; 22 23 typedef struct IdxColumn IdxColumn; 24 typedef struct IdxConstraint IdxConstraint; 25 typedef struct IdxScan IdxScan; 26 typedef struct IdxStatement IdxStatement; 27 typedef struct IdxTable IdxTable; 28 typedef struct IdxWrite IdxWrite; 29 30 #define STRLEN (int)strlen 31 32 /* 33 ** A temp table name that we assume no user database will actually use. 34 ** If this assumption proves incorrect triggers on the table with the 35 ** conflicting name will be ignored. 36 */ 37 #define UNIQUE_TABLE_NAME "t592690916721053953805701627921227776" 38 39 /* 40 ** A single constraint. Equivalent to either "col = ?" or "col < ?" (or 41 ** any other type of single-ended range constraint on a column). 42 ** 43 ** pLink: 44 ** Used to temporarily link IdxConstraint objects into lists while 45 ** creating candidate indexes. 46 */ 47 struct IdxConstraint { 48 char *zColl; /* Collation sequence */ 49 int bRange; /* True for range, false for eq */ 50 int iCol; /* Constrained table column */ 51 int bFlag; /* Used by idxFindCompatible() */ 52 int bDesc; /* True if ORDER BY <expr> DESC */ 53 IdxConstraint *pNext; /* Next constraint in pEq or pRange list */ 54 IdxConstraint *pLink; /* See above */ 55 }; 56 57 /* 58 ** A single scan of a single table. 59 */ 60 struct IdxScan { 61 IdxTable *pTab; /* Associated table object */ 62 int iDb; /* Database containing table zTable */ 63 i64 covering; /* Mask of columns required for cov. index */ 64 IdxConstraint *pOrder; /* ORDER BY columns */ 65 IdxConstraint *pEq; /* List of == constraints */ 66 IdxConstraint *pRange; /* List of < constraints */ 67 IdxScan *pNextScan; /* Next IdxScan object for same analysis */ 68 }; 69 70 /* 71 ** Information regarding a single database table. Extracted from 72 ** "PRAGMA table_info" by function idxGetTableInfo(). 73 */ 74 struct IdxColumn { 75 char *zName; 76 char *zColl; 77 int iPk; 78 }; 79 struct IdxTable { 80 int nCol; 81 char *zName; /* Table name */ 82 IdxColumn *aCol; 83 IdxTable *pNext; /* Next table in linked list of all tables */ 84 }; 85 86 /* 87 ** An object of the following type is created for each unique table/write-op 88 ** seen. The objects are stored in a singly-linked list beginning at 89 ** sqlite3expert.pWrite. 90 */ 91 struct IdxWrite { 92 IdxTable *pTab; 93 int eOp; /* SQLITE_UPDATE, DELETE or INSERT */ 94 IdxWrite *pNext; 95 }; 96 97 /* 98 ** Each statement being analyzed is represented by an instance of this 99 ** structure. 100 */ 101 struct IdxStatement { 102 int iId; /* Statement number */ 103 char *zSql; /* SQL statement */ 104 char *zIdx; /* Indexes */ 105 char *zEQP; /* Plan */ 106 IdxStatement *pNext; 107 }; 108 109 110 /* 111 ** A hash table for storing strings. With space for a payload string 112 ** with each entry. Methods are: 113 ** 114 ** idxHashInit() 115 ** idxHashClear() 116 ** idxHashAdd() 117 ** idxHashSearch() 118 */ 119 #define IDX_HASH_SIZE 1023 120 typedef struct IdxHashEntry IdxHashEntry; 121 typedef struct IdxHash IdxHash; 122 struct IdxHashEntry { 123 char *zKey; /* nul-terminated key */ 124 char *zVal; /* nul-terminated value string */ 125 char *zVal2; /* nul-terminated value string 2 */ 126 IdxHashEntry *pHashNext; /* Next entry in same hash bucket */ 127 IdxHashEntry *pNext; /* Next entry in hash */ 128 }; 129 struct IdxHash { 130 IdxHashEntry *pFirst; 131 IdxHashEntry *aHash[IDX_HASH_SIZE]; 132 }; 133 134 /* 135 ** sqlite3expert object. 136 */ 137 struct sqlite3expert { 138 int iSample; /* Percentage of tables to sample for stat1 */ 139 sqlite3 *db; /* User database */ 140 sqlite3 *dbm; /* In-memory db for this analysis */ 141 sqlite3 *dbv; /* Vtab schema for this analysis */ 142 IdxTable *pTable; /* List of all IdxTable objects */ 143 IdxScan *pScan; /* List of scan objects */ 144 IdxWrite *pWrite; /* List of write objects */ 145 IdxStatement *pStatement; /* List of IdxStatement objects */ 146 int bRun; /* True once analysis has run */ 147 char **pzErrmsg; 148 int rc; /* Error code from whereinfo hook */ 149 IdxHash hIdx; /* Hash containing all candidate indexes */ 150 char *zCandidates; /* For EXPERT_REPORT_CANDIDATES */ 151 }; 152 153 154 /* 155 ** Allocate and return nByte bytes of zeroed memory using sqlite3_malloc(). 156 ** If the allocation fails, set *pRc to SQLITE_NOMEM and return NULL. 157 */ 158 static void *idxMalloc(int *pRc, int nByte){ 159 void *pRet; 160 assert( *pRc==SQLITE_OK ); 161 assert( nByte>0 ); 162 pRet = sqlite3_malloc(nByte); 163 if( pRet ){ 164 memset(pRet, 0, nByte); 165 }else{ 166 *pRc = SQLITE_NOMEM; 167 } 168 return pRet; 169 } 170 171 /* 172 ** Initialize an IdxHash hash table. 173 */ 174 static void idxHashInit(IdxHash *pHash){ 175 memset(pHash, 0, sizeof(IdxHash)); 176 } 177 178 /* 179 ** Reset an IdxHash hash table. 180 */ 181 static void idxHashClear(IdxHash *pHash){ 182 int i; 183 for(i=0; i<IDX_HASH_SIZE; i++){ 184 IdxHashEntry *pEntry; 185 IdxHashEntry *pNext; 186 for(pEntry=pHash->aHash[i]; pEntry; pEntry=pNext){ 187 pNext = pEntry->pHashNext; 188 sqlite3_free(pEntry->zVal2); 189 sqlite3_free(pEntry); 190 } 191 } 192 memset(pHash, 0, sizeof(IdxHash)); 193 } 194 195 /* 196 ** Return the index of the hash bucket that the string specified by the 197 ** arguments to this function belongs. 198 */ 199 static int idxHashString(const char *z, int n){ 200 unsigned int ret = 0; 201 int i; 202 for(i=0; i<n; i++){ 203 ret += (ret<<3) + (unsigned char)(z[i]); 204 } 205 return (int)(ret % IDX_HASH_SIZE); 206 } 207 208 /* 209 ** If zKey is already present in the hash table, return non-zero and do 210 ** nothing. Otherwise, add an entry with key zKey and payload string zVal to 211 ** the hash table passed as the second argument. 212 */ 213 static int idxHashAdd( 214 int *pRc, 215 IdxHash *pHash, 216 const char *zKey, 217 const char *zVal 218 ){ 219 int nKey = STRLEN(zKey); 220 int iHash = idxHashString(zKey, nKey); 221 int nVal = (zVal ? STRLEN(zVal) : 0); 222 IdxHashEntry *pEntry; 223 assert( iHash>=0 ); 224 for(pEntry=pHash->aHash[iHash]; pEntry; pEntry=pEntry->pHashNext){ 225 if( STRLEN(pEntry->zKey)==nKey && 0==memcmp(pEntry->zKey, zKey, nKey) ){ 226 return 1; 227 } 228 } 229 pEntry = idxMalloc(pRc, sizeof(IdxHashEntry) + nKey+1 + nVal+1); 230 if( pEntry ){ 231 pEntry->zKey = (char*)&pEntry[1]; 232 memcpy(pEntry->zKey, zKey, nKey); 233 if( zVal ){ 234 pEntry->zVal = &pEntry->zKey[nKey+1]; 235 memcpy(pEntry->zVal, zVal, nVal); 236 } 237 pEntry->pHashNext = pHash->aHash[iHash]; 238 pHash->aHash[iHash] = pEntry; 239 240 pEntry->pNext = pHash->pFirst; 241 pHash->pFirst = pEntry; 242 } 243 return 0; 244 } 245 246 /* 247 ** If zKey/nKey is present in the hash table, return a pointer to the 248 ** hash-entry object. 249 */ 250 static IdxHashEntry *idxHashFind(IdxHash *pHash, const char *zKey, int nKey){ 251 int iHash; 252 IdxHashEntry *pEntry; 253 if( nKey<0 ) nKey = STRLEN(zKey); 254 iHash = idxHashString(zKey, nKey); 255 assert( iHash>=0 ); 256 for(pEntry=pHash->aHash[iHash]; pEntry; pEntry=pEntry->pHashNext){ 257 if( STRLEN(pEntry->zKey)==nKey && 0==memcmp(pEntry->zKey, zKey, nKey) ){ 258 return pEntry; 259 } 260 } 261 return 0; 262 } 263 264 /* 265 ** If the hash table contains an entry with a key equal to the string 266 ** passed as the final two arguments to this function, return a pointer 267 ** to the payload string. Otherwise, if zKey/nKey is not present in the 268 ** hash table, return NULL. 269 */ 270 static const char *idxHashSearch(IdxHash *pHash, const char *zKey, int nKey){ 271 IdxHashEntry *pEntry = idxHashFind(pHash, zKey, nKey); 272 if( pEntry ) return pEntry->zVal; 273 return 0; 274 } 275 276 /* 277 ** Allocate and return a new IdxConstraint object. Set the IdxConstraint.zColl 278 ** variable to point to a copy of nul-terminated string zColl. 279 */ 280 static IdxConstraint *idxNewConstraint(int *pRc, const char *zColl){ 281 IdxConstraint *pNew; 282 int nColl = STRLEN(zColl); 283 284 assert( *pRc==SQLITE_OK ); 285 pNew = (IdxConstraint*)idxMalloc(pRc, sizeof(IdxConstraint) * nColl + 1); 286 if( pNew ){ 287 pNew->zColl = (char*)&pNew[1]; 288 memcpy(pNew->zColl, zColl, nColl+1); 289 } 290 return pNew; 291 } 292 293 /* 294 ** An error associated with database handle db has just occurred. Pass 295 ** the error message to callback function xOut. 296 */ 297 static void idxDatabaseError( 298 sqlite3 *db, /* Database handle */ 299 char **pzErrmsg /* Write error here */ 300 ){ 301 *pzErrmsg = sqlite3_mprintf("%s", sqlite3_errmsg(db)); 302 } 303 304 /* 305 ** Prepare an SQL statement. 306 */ 307 static int idxPrepareStmt( 308 sqlite3 *db, /* Database handle to compile against */ 309 sqlite3_stmt **ppStmt, /* OUT: Compiled SQL statement */ 310 char **pzErrmsg, /* OUT: sqlite3_malloc()ed error message */ 311 const char *zSql /* SQL statement to compile */ 312 ){ 313 int rc = sqlite3_prepare_v2(db, zSql, -1, ppStmt, 0); 314 if( rc!=SQLITE_OK ){ 315 *ppStmt = 0; 316 idxDatabaseError(db, pzErrmsg); 317 } 318 return rc; 319 } 320 321 /* 322 ** Prepare an SQL statement using the results of a printf() formatting. 323 */ 324 static int idxPrintfPrepareStmt( 325 sqlite3 *db, /* Database handle to compile against */ 326 sqlite3_stmt **ppStmt, /* OUT: Compiled SQL statement */ 327 char **pzErrmsg, /* OUT: sqlite3_malloc()ed error message */ 328 const char *zFmt, /* printf() format of SQL statement */ 329 ... /* Trailing printf() arguments */ 330 ){ 331 va_list ap; 332 int rc; 333 char *zSql; 334 va_start(ap, zFmt); 335 zSql = sqlite3_vmprintf(zFmt, ap); 336 if( zSql==0 ){ 337 rc = SQLITE_NOMEM; 338 }else{ 339 rc = idxPrepareStmt(db, ppStmt, pzErrmsg, zSql); 340 sqlite3_free(zSql); 341 } 342 va_end(ap); 343 return rc; 344 } 345 346 347 /************************************************************************* 348 ** Beginning of virtual table implementation. 349 */ 350 typedef struct ExpertVtab ExpertVtab; 351 struct ExpertVtab { 352 sqlite3_vtab base; 353 IdxTable *pTab; 354 sqlite3expert *pExpert; 355 }; 356 357 typedef struct ExpertCsr ExpertCsr; 358 struct ExpertCsr { 359 sqlite3_vtab_cursor base; 360 sqlite3_stmt *pData; 361 }; 362 363 static char *expertDequote(const char *zIn){ 364 int n = STRLEN(zIn); 365 char *zRet = sqlite3_malloc(n); 366 367 assert( zIn[0]=='\'' ); 368 assert( zIn[n-1]=='\'' ); 369 370 if( zRet ){ 371 int iOut = 0; 372 int iIn = 0; 373 for(iIn=1; iIn<(n-1); iIn++){ 374 if( zIn[iIn]=='\'' ){ 375 assert( zIn[iIn+1]=='\'' ); 376 iIn++; 377 } 378 zRet[iOut++] = zIn[iIn]; 379 } 380 zRet[iOut] = '\0'; 381 } 382 383 return zRet; 384 } 385 386 /* 387 ** This function is the implementation of both the xConnect and xCreate 388 ** methods of the r-tree virtual table. 389 ** 390 ** argv[0] -> module name 391 ** argv[1] -> database name 392 ** argv[2] -> table name 393 ** argv[...] -> column names... 394 */ 395 static int expertConnect( 396 sqlite3 *db, 397 void *pAux, 398 int argc, const char *const*argv, 399 sqlite3_vtab **ppVtab, 400 char **pzErr 401 ){ 402 sqlite3expert *pExpert = (sqlite3expert*)pAux; 403 ExpertVtab *p = 0; 404 int rc; 405 406 if( argc!=4 ){ 407 *pzErr = sqlite3_mprintf("internal error!"); 408 rc = SQLITE_ERROR; 409 }else{ 410 char *zCreateTable = expertDequote(argv[3]); 411 if( zCreateTable ){ 412 rc = sqlite3_declare_vtab(db, zCreateTable); 413 if( rc==SQLITE_OK ){ 414 p = idxMalloc(&rc, sizeof(ExpertVtab)); 415 } 416 if( rc==SQLITE_OK ){ 417 p->pExpert = pExpert; 418 p->pTab = pExpert->pTable; 419 assert( sqlite3_stricmp(p->pTab->zName, argv[2])==0 ); 420 } 421 sqlite3_free(zCreateTable); 422 }else{ 423 rc = SQLITE_NOMEM; 424 } 425 } 426 427 *ppVtab = (sqlite3_vtab*)p; 428 return rc; 429 } 430 431 static int expertDisconnect(sqlite3_vtab *pVtab){ 432 ExpertVtab *p = (ExpertVtab*)pVtab; 433 sqlite3_free(p); 434 return SQLITE_OK; 435 } 436 437 static int expertBestIndex(sqlite3_vtab *pVtab, sqlite3_index_info *pIdxInfo){ 438 ExpertVtab *p = (ExpertVtab*)pVtab; 439 int rc = SQLITE_OK; 440 int n = 0; 441 IdxScan *pScan; 442 const int opmask = 443 SQLITE_INDEX_CONSTRAINT_EQ | SQLITE_INDEX_CONSTRAINT_GT | 444 SQLITE_INDEX_CONSTRAINT_LT | SQLITE_INDEX_CONSTRAINT_GE | 445 SQLITE_INDEX_CONSTRAINT_LE; 446 447 pScan = idxMalloc(&rc, sizeof(IdxScan)); 448 if( pScan ){ 449 int i; 450 451 /* Link the new scan object into the list */ 452 pScan->pTab = p->pTab; 453 pScan->pNextScan = p->pExpert->pScan; 454 p->pExpert->pScan = pScan; 455 456 /* Add the constraints to the IdxScan object */ 457 for(i=0; i<pIdxInfo->nConstraint; i++){ 458 struct sqlite3_index_constraint *pCons = &pIdxInfo->aConstraint[i]; 459 if( pCons->usable 460 && pCons->iColumn>=0 461 && p->pTab->aCol[pCons->iColumn].iPk==0 462 && (pCons->op & opmask) 463 ){ 464 IdxConstraint *pNew; 465 const char *zColl = sqlite3_vtab_collation(pIdxInfo, i); 466 pNew = idxNewConstraint(&rc, zColl); 467 if( pNew ){ 468 pNew->iCol = pCons->iColumn; 469 if( pCons->op==SQLITE_INDEX_CONSTRAINT_EQ ){ 470 pNew->pNext = pScan->pEq; 471 pScan->pEq = pNew; 472 }else{ 473 pNew->bRange = 1; 474 pNew->pNext = pScan->pRange; 475 pScan->pRange = pNew; 476 } 477 } 478 n++; 479 pIdxInfo->aConstraintUsage[i].argvIndex = n; 480 } 481 } 482 483 /* Add the ORDER BY to the IdxScan object */ 484 for(i=pIdxInfo->nOrderBy-1; i>=0; i--){ 485 int iCol = pIdxInfo->aOrderBy[i].iColumn; 486 if( iCol>=0 ){ 487 IdxConstraint *pNew = idxNewConstraint(&rc, p->pTab->aCol[iCol].zColl); 488 if( pNew ){ 489 pNew->iCol = iCol; 490 pNew->bDesc = pIdxInfo->aOrderBy[i].desc; 491 pNew->pNext = pScan->pOrder; 492 pNew->pLink = pScan->pOrder; 493 pScan->pOrder = pNew; 494 n++; 495 } 496 } 497 } 498 } 499 500 pIdxInfo->estimatedCost = 1000000.0 / (n+1); 501 return rc; 502 } 503 504 static int expertUpdate( 505 sqlite3_vtab *pVtab, 506 int nData, 507 sqlite3_value **azData, 508 sqlite_int64 *pRowid 509 ){ 510 (void)pVtab; 511 (void)nData; 512 (void)azData; 513 (void)pRowid; 514 return SQLITE_OK; 515 } 516 517 /* 518 ** Virtual table module xOpen method. 519 */ 520 static int expertOpen(sqlite3_vtab *pVTab, sqlite3_vtab_cursor **ppCursor){ 521 int rc = SQLITE_OK; 522 ExpertCsr *pCsr; 523 (void)pVTab; 524 pCsr = idxMalloc(&rc, sizeof(ExpertCsr)); 525 *ppCursor = (sqlite3_vtab_cursor*)pCsr; 526 return rc; 527 } 528 529 /* 530 ** Virtual table module xClose method. 531 */ 532 static int expertClose(sqlite3_vtab_cursor *cur){ 533 ExpertCsr *pCsr = (ExpertCsr*)cur; 534 sqlite3_finalize(pCsr->pData); 535 sqlite3_free(pCsr); 536 return SQLITE_OK; 537 } 538 539 /* 540 ** Virtual table module xEof method. 541 ** 542 ** Return non-zero if the cursor does not currently point to a valid 543 ** record (i.e if the scan has finished), or zero otherwise. 544 */ 545 static int expertEof(sqlite3_vtab_cursor *cur){ 546 ExpertCsr *pCsr = (ExpertCsr*)cur; 547 return pCsr->pData==0; 548 } 549 550 /* 551 ** Virtual table module xNext method. 552 */ 553 static int expertNext(sqlite3_vtab_cursor *cur){ 554 ExpertCsr *pCsr = (ExpertCsr*)cur; 555 int rc = SQLITE_OK; 556 557 assert( pCsr->pData ); 558 rc = sqlite3_step(pCsr->pData); 559 if( rc!=SQLITE_ROW ){ 560 rc = sqlite3_finalize(pCsr->pData); 561 pCsr->pData = 0; 562 }else{ 563 rc = SQLITE_OK; 564 } 565 566 return rc; 567 } 568 569 /* 570 ** Virtual table module xRowid method. 571 */ 572 static int expertRowid(sqlite3_vtab_cursor *cur, sqlite_int64 *pRowid){ 573 (void)cur; 574 *pRowid = 0; 575 return SQLITE_OK; 576 } 577 578 /* 579 ** Virtual table module xColumn method. 580 */ 581 static int expertColumn(sqlite3_vtab_cursor *cur, sqlite3_context *ctx, int i){ 582 ExpertCsr *pCsr = (ExpertCsr*)cur; 583 sqlite3_value *pVal; 584 pVal = sqlite3_column_value(pCsr->pData, i); 585 if( pVal ){ 586 sqlite3_result_value(ctx, pVal); 587 } 588 return SQLITE_OK; 589 } 590 591 /* 592 ** Virtual table module xFilter method. 593 */ 594 static int expertFilter( 595 sqlite3_vtab_cursor *cur, 596 int idxNum, const char *idxStr, 597 int argc, sqlite3_value **argv 598 ){ 599 ExpertCsr *pCsr = (ExpertCsr*)cur; 600 ExpertVtab *pVtab = (ExpertVtab*)(cur->pVtab); 601 sqlite3expert *pExpert = pVtab->pExpert; 602 int rc; 603 604 (void)idxNum; 605 (void)idxStr; 606 (void)argc; 607 (void)argv; 608 rc = sqlite3_finalize(pCsr->pData); 609 pCsr->pData = 0; 610 if( rc==SQLITE_OK ){ 611 rc = idxPrintfPrepareStmt(pExpert->db, &pCsr->pData, &pVtab->base.zErrMsg, 612 "SELECT * FROM main.%Q WHERE sample()", pVtab->pTab->zName 613 ); 614 } 615 616 if( rc==SQLITE_OK ){ 617 rc = expertNext(cur); 618 } 619 return rc; 620 } 621 622 static int idxRegisterVtab(sqlite3expert *p){ 623 static sqlite3_module expertModule = { 624 2, /* iVersion */ 625 expertConnect, /* xCreate - create a table */ 626 expertConnect, /* xConnect - connect to an existing table */ 627 expertBestIndex, /* xBestIndex - Determine search strategy */ 628 expertDisconnect, /* xDisconnect - Disconnect from a table */ 629 expertDisconnect, /* xDestroy - Drop a table */ 630 expertOpen, /* xOpen - open a cursor */ 631 expertClose, /* xClose - close a cursor */ 632 expertFilter, /* xFilter - configure scan constraints */ 633 expertNext, /* xNext - advance a cursor */ 634 expertEof, /* xEof */ 635 expertColumn, /* xColumn - read data */ 636 expertRowid, /* xRowid - read data */ 637 expertUpdate, /* xUpdate - write data */ 638 0, /* xBegin - begin transaction */ 639 0, /* xSync - sync transaction */ 640 0, /* xCommit - commit transaction */ 641 0, /* xRollback - rollback transaction */ 642 0, /* xFindFunction - function overloading */ 643 0, /* xRename - rename the table */ 644 0, /* xSavepoint */ 645 0, /* xRelease */ 646 0, /* xRollbackTo */ 647 }; 648 649 return sqlite3_create_module(p->dbv, "expert", &expertModule, (void*)p); 650 } 651 /* 652 ** End of virtual table implementation. 653 *************************************************************************/ 654 /* 655 ** Finalize SQL statement pStmt. If (*pRc) is SQLITE_OK when this function 656 ** is called, set it to the return value of sqlite3_finalize() before 657 ** returning. Otherwise, discard the sqlite3_finalize() return value. 658 */ 659 static void idxFinalize(int *pRc, sqlite3_stmt *pStmt){ 660 int rc = sqlite3_finalize(pStmt); 661 if( *pRc==SQLITE_OK ) *pRc = rc; 662 } 663 664 /* 665 ** Attempt to allocate an IdxTable structure corresponding to table zTab 666 ** in the main database of connection db. If successful, set (*ppOut) to 667 ** point to the new object and return SQLITE_OK. Otherwise, return an 668 ** SQLite error code and set (*ppOut) to NULL. In this case *pzErrmsg may be 669 ** set to point to an error string. 670 ** 671 ** It is the responsibility of the caller to eventually free either the 672 ** IdxTable object or error message using sqlite3_free(). 673 */ 674 static int idxGetTableInfo( 675 sqlite3 *db, /* Database connection to read details from */ 676 const char *zTab, /* Table name */ 677 IdxTable **ppOut, /* OUT: New object (if successful) */ 678 char **pzErrmsg /* OUT: Error message (if not) */ 679 ){ 680 sqlite3_stmt *p1 = 0; 681 int nCol = 0; 682 int nTab = STRLEN(zTab); 683 int nByte = sizeof(IdxTable) + nTab + 1; 684 IdxTable *pNew = 0; 685 int rc, rc2; 686 char *pCsr = 0; 687 688 rc = idxPrintfPrepareStmt(db, &p1, pzErrmsg, "PRAGMA table_info=%Q", zTab); 689 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(p1) ){ 690 const char *zCol = (const char*)sqlite3_column_text(p1, 1); 691 nByte += 1 + STRLEN(zCol); 692 rc = sqlite3_table_column_metadata( 693 db, "main", zTab, zCol, 0, &zCol, 0, 0, 0 694 ); 695 nByte += 1 + STRLEN(zCol); 696 nCol++; 697 } 698 rc2 = sqlite3_reset(p1); 699 if( rc==SQLITE_OK ) rc = rc2; 700 701 nByte += sizeof(IdxColumn) * nCol; 702 if( rc==SQLITE_OK ){ 703 pNew = idxMalloc(&rc, nByte); 704 } 705 if( rc==SQLITE_OK ){ 706 pNew->aCol = (IdxColumn*)&pNew[1]; 707 pNew->nCol = nCol; 708 pCsr = (char*)&pNew->aCol[nCol]; 709 } 710 711 nCol = 0; 712 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(p1) ){ 713 const char *zCol = (const char*)sqlite3_column_text(p1, 1); 714 int nCopy = STRLEN(zCol) + 1; 715 pNew->aCol[nCol].zName = pCsr; 716 pNew->aCol[nCol].iPk = sqlite3_column_int(p1, 5); 717 memcpy(pCsr, zCol, nCopy); 718 pCsr += nCopy; 719 720 rc = sqlite3_table_column_metadata( 721 db, "main", zTab, zCol, 0, &zCol, 0, 0, 0 722 ); 723 if( rc==SQLITE_OK ){ 724 nCopy = STRLEN(zCol) + 1; 725 pNew->aCol[nCol].zColl = pCsr; 726 memcpy(pCsr, zCol, nCopy); 727 pCsr += nCopy; 728 } 729 730 nCol++; 731 } 732 idxFinalize(&rc, p1); 733 734 if( rc!=SQLITE_OK ){ 735 sqlite3_free(pNew); 736 pNew = 0; 737 }else{ 738 pNew->zName = pCsr; 739 memcpy(pNew->zName, zTab, nTab+1); 740 } 741 742 *ppOut = pNew; 743 return rc; 744 } 745 746 /* 747 ** This function is a no-op if *pRc is set to anything other than 748 ** SQLITE_OK when it is called. 749 ** 750 ** If *pRc is initially set to SQLITE_OK, then the text specified by 751 ** the printf() style arguments is appended to zIn and the result returned 752 ** in a buffer allocated by sqlite3_malloc(). sqlite3_free() is called on 753 ** zIn before returning. 754 */ 755 static char *idxAppendText(int *pRc, char *zIn, const char *zFmt, ...){ 756 va_list ap; 757 char *zAppend = 0; 758 char *zRet = 0; 759 int nIn = zIn ? STRLEN(zIn) : 0; 760 int nAppend = 0; 761 va_start(ap, zFmt); 762 if( *pRc==SQLITE_OK ){ 763 zAppend = sqlite3_vmprintf(zFmt, ap); 764 if( zAppend ){ 765 nAppend = STRLEN(zAppend); 766 zRet = (char*)sqlite3_malloc(nIn + nAppend + 1); 767 } 768 if( zAppend && zRet ){ 769 if( nIn ) memcpy(zRet, zIn, nIn); 770 memcpy(&zRet[nIn], zAppend, nAppend+1); 771 }else{ 772 sqlite3_free(zRet); 773 zRet = 0; 774 *pRc = SQLITE_NOMEM; 775 } 776 sqlite3_free(zAppend); 777 sqlite3_free(zIn); 778 } 779 va_end(ap); 780 return zRet; 781 } 782 783 /* 784 ** Return true if zId must be quoted in order to use it as an SQL 785 ** identifier, or false otherwise. 786 */ 787 static int idxIdentifierRequiresQuotes(const char *zId){ 788 int i; 789 for(i=0; zId[i]; i++){ 790 if( !(zId[i]=='_') 791 && !(zId[i]>='0' && zId[i]<='9') 792 && !(zId[i]>='a' && zId[i]<='z') 793 && !(zId[i]>='A' && zId[i]<='Z') 794 ){ 795 return 1; 796 } 797 } 798 return 0; 799 } 800 801 /* 802 ** This function appends an index column definition suitable for constraint 803 ** pCons to the string passed as zIn and returns the result. 804 */ 805 static char *idxAppendColDefn( 806 int *pRc, /* IN/OUT: Error code */ 807 char *zIn, /* Column defn accumulated so far */ 808 IdxTable *pTab, /* Table index will be created on */ 809 IdxConstraint *pCons 810 ){ 811 char *zRet = zIn; 812 IdxColumn *p = &pTab->aCol[pCons->iCol]; 813 if( zRet ) zRet = idxAppendText(pRc, zRet, ", "); 814 815 if( idxIdentifierRequiresQuotes(p->zName) ){ 816 zRet = idxAppendText(pRc, zRet, "%Q", p->zName); 817 }else{ 818 zRet = idxAppendText(pRc, zRet, "%s", p->zName); 819 } 820 821 if( sqlite3_stricmp(p->zColl, pCons->zColl) ){ 822 if( idxIdentifierRequiresQuotes(pCons->zColl) ){ 823 zRet = idxAppendText(pRc, zRet, " COLLATE %Q", pCons->zColl); 824 }else{ 825 zRet = idxAppendText(pRc, zRet, " COLLATE %s", pCons->zColl); 826 } 827 } 828 829 if( pCons->bDesc ){ 830 zRet = idxAppendText(pRc, zRet, " DESC"); 831 } 832 return zRet; 833 } 834 835 /* 836 ** Search database dbm for an index compatible with the one idxCreateFromCons() 837 ** would create from arguments pScan, pEq and pTail. If no error occurs and 838 ** such an index is found, return non-zero. Or, if no such index is found, 839 ** return zero. 840 ** 841 ** If an error occurs, set *pRc to an SQLite error code and return zero. 842 */ 843 static int idxFindCompatible( 844 int *pRc, /* OUT: Error code */ 845 sqlite3* dbm, /* Database to search */ 846 IdxScan *pScan, /* Scan for table to search for index on */ 847 IdxConstraint *pEq, /* List of == constraints */ 848 IdxConstraint *pTail /* List of range constraints */ 849 ){ 850 const char *zTbl = pScan->pTab->zName; 851 sqlite3_stmt *pIdxList = 0; 852 IdxConstraint *pIter; 853 int nEq = 0; /* Number of elements in pEq */ 854 int rc; 855 856 /* Count the elements in list pEq */ 857 for(pIter=pEq; pIter; pIter=pIter->pLink) nEq++; 858 859 rc = idxPrintfPrepareStmt(dbm, &pIdxList, 0, "PRAGMA index_list=%Q", zTbl); 860 while( rc==SQLITE_OK && sqlite3_step(pIdxList)==SQLITE_ROW ){ 861 int bMatch = 1; 862 IdxConstraint *pT = pTail; 863 sqlite3_stmt *pInfo = 0; 864 const char *zIdx = (const char*)sqlite3_column_text(pIdxList, 1); 865 866 /* Zero the IdxConstraint.bFlag values in the pEq list */ 867 for(pIter=pEq; pIter; pIter=pIter->pLink) pIter->bFlag = 0; 868 869 rc = idxPrintfPrepareStmt(dbm, &pInfo, 0, "PRAGMA index_xInfo=%Q", zIdx); 870 while( rc==SQLITE_OK && sqlite3_step(pInfo)==SQLITE_ROW ){ 871 int iIdx = sqlite3_column_int(pInfo, 0); 872 int iCol = sqlite3_column_int(pInfo, 1); 873 const char *zColl = (const char*)sqlite3_column_text(pInfo, 4); 874 875 if( iIdx<nEq ){ 876 for(pIter=pEq; pIter; pIter=pIter->pLink){ 877 if( pIter->bFlag ) continue; 878 if( pIter->iCol!=iCol ) continue; 879 if( sqlite3_stricmp(pIter->zColl, zColl) ) continue; 880 pIter->bFlag = 1; 881 break; 882 } 883 if( pIter==0 ){ 884 bMatch = 0; 885 break; 886 } 887 }else{ 888 if( pT ){ 889 if( pT->iCol!=iCol || sqlite3_stricmp(pT->zColl, zColl) ){ 890 bMatch = 0; 891 break; 892 } 893 pT = pT->pLink; 894 } 895 } 896 } 897 idxFinalize(&rc, pInfo); 898 899 if( rc==SQLITE_OK && bMatch ){ 900 sqlite3_finalize(pIdxList); 901 return 1; 902 } 903 } 904 idxFinalize(&rc, pIdxList); 905 906 *pRc = rc; 907 return 0; 908 } 909 910 static int idxCreateFromCons( 911 sqlite3expert *p, 912 IdxScan *pScan, 913 IdxConstraint *pEq, 914 IdxConstraint *pTail 915 ){ 916 sqlite3 *dbm = p->dbm; 917 int rc = SQLITE_OK; 918 if( (pEq || pTail) && 0==idxFindCompatible(&rc, dbm, pScan, pEq, pTail) ){ 919 IdxTable *pTab = pScan->pTab; 920 char *zCols = 0; 921 char *zIdx = 0; 922 IdxConstraint *pCons; 923 unsigned int h = 0; 924 const char *zFmt; 925 926 for(pCons=pEq; pCons; pCons=pCons->pLink){ 927 zCols = idxAppendColDefn(&rc, zCols, pTab, pCons); 928 } 929 for(pCons=pTail; pCons; pCons=pCons->pLink){ 930 zCols = idxAppendColDefn(&rc, zCols, pTab, pCons); 931 } 932 933 if( rc==SQLITE_OK ){ 934 /* Hash the list of columns to come up with a name for the index */ 935 const char *zTable = pScan->pTab->zName; 936 char *zName; /* Index name */ 937 int i; 938 for(i=0; zCols[i]; i++){ 939 h += ((h<<3) + zCols[i]); 940 } 941 zName = sqlite3_mprintf("%s_idx_%08x", zTable, h); 942 if( zName==0 ){ 943 rc = SQLITE_NOMEM; 944 }else{ 945 if( idxIdentifierRequiresQuotes(zTable) ){ 946 zFmt = "CREATE INDEX '%q' ON %Q(%s)"; 947 }else{ 948 zFmt = "CREATE INDEX %s ON %s(%s)"; 949 } 950 zIdx = sqlite3_mprintf(zFmt, zName, zTable, zCols); 951 if( !zIdx ){ 952 rc = SQLITE_NOMEM; 953 }else{ 954 rc = sqlite3_exec(dbm, zIdx, 0, 0, p->pzErrmsg); 955 idxHashAdd(&rc, &p->hIdx, zName, zIdx); 956 } 957 sqlite3_free(zName); 958 sqlite3_free(zIdx); 959 } 960 } 961 962 sqlite3_free(zCols); 963 } 964 return rc; 965 } 966 967 /* 968 ** Return true if list pList (linked by IdxConstraint.pLink) contains 969 ** a constraint compatible with *p. Otherwise return false. 970 */ 971 static int idxFindConstraint(IdxConstraint *pList, IdxConstraint *p){ 972 IdxConstraint *pCmp; 973 for(pCmp=pList; pCmp; pCmp=pCmp->pLink){ 974 if( p->iCol==pCmp->iCol ) return 1; 975 } 976 return 0; 977 } 978 979 static int idxCreateFromWhere( 980 sqlite3expert *p, 981 IdxScan *pScan, /* Create indexes for this scan */ 982 IdxConstraint *pTail /* range/ORDER BY constraints for inclusion */ 983 ){ 984 IdxConstraint *p1 = 0; 985 IdxConstraint *pCon; 986 int rc; 987 988 /* Gather up all the == constraints. */ 989 for(pCon=pScan->pEq; pCon; pCon=pCon->pNext){ 990 if( !idxFindConstraint(p1, pCon) && !idxFindConstraint(pTail, pCon) ){ 991 pCon->pLink = p1; 992 p1 = pCon; 993 } 994 } 995 996 /* Create an index using the == constraints collected above. And the 997 ** range constraint/ORDER BY terms passed in by the caller, if any. */ 998 rc = idxCreateFromCons(p, pScan, p1, pTail); 999 1000 /* If no range/ORDER BY passed by the caller, create a version of the 1001 ** index for each range constraint. */ 1002 if( pTail==0 ){ 1003 for(pCon=pScan->pRange; rc==SQLITE_OK && pCon; pCon=pCon->pNext){ 1004 assert( pCon->pLink==0 ); 1005 if( !idxFindConstraint(p1, pCon) && !idxFindConstraint(pTail, pCon) ){ 1006 rc = idxCreateFromCons(p, pScan, p1, pCon); 1007 } 1008 } 1009 } 1010 1011 return rc; 1012 } 1013 1014 /* 1015 ** Create candidate indexes in database [dbm] based on the data in 1016 ** linked-list pScan. 1017 */ 1018 static int idxCreateCandidates(sqlite3expert *p){ 1019 int rc = SQLITE_OK; 1020 IdxScan *pIter; 1021 1022 for(pIter=p->pScan; pIter && rc==SQLITE_OK; pIter=pIter->pNextScan){ 1023 rc = idxCreateFromWhere(p, pIter, 0); 1024 if( rc==SQLITE_OK && pIter->pOrder ){ 1025 rc = idxCreateFromWhere(p, pIter, pIter->pOrder); 1026 } 1027 } 1028 1029 return rc; 1030 } 1031 1032 /* 1033 ** Free all elements of the linked list starting at pConstraint. 1034 */ 1035 static void idxConstraintFree(IdxConstraint *pConstraint){ 1036 IdxConstraint *pNext; 1037 IdxConstraint *p; 1038 1039 for(p=pConstraint; p; p=pNext){ 1040 pNext = p->pNext; 1041 sqlite3_free(p); 1042 } 1043 } 1044 1045 /* 1046 ** Free all elements of the linked list starting from pScan up until pLast 1047 ** (pLast is not freed). 1048 */ 1049 static void idxScanFree(IdxScan *pScan, IdxScan *pLast){ 1050 IdxScan *p; 1051 IdxScan *pNext; 1052 for(p=pScan; p!=pLast; p=pNext){ 1053 pNext = p->pNextScan; 1054 idxConstraintFree(p->pOrder); 1055 idxConstraintFree(p->pEq); 1056 idxConstraintFree(p->pRange); 1057 sqlite3_free(p); 1058 } 1059 } 1060 1061 /* 1062 ** Free all elements of the linked list starting from pStatement up 1063 ** until pLast (pLast is not freed). 1064 */ 1065 static void idxStatementFree(IdxStatement *pStatement, IdxStatement *pLast){ 1066 IdxStatement *p; 1067 IdxStatement *pNext; 1068 for(p=pStatement; p!=pLast; p=pNext){ 1069 pNext = p->pNext; 1070 sqlite3_free(p->zEQP); 1071 sqlite3_free(p->zIdx); 1072 sqlite3_free(p); 1073 } 1074 } 1075 1076 /* 1077 ** Free the linked list of IdxTable objects starting at pTab. 1078 */ 1079 static void idxTableFree(IdxTable *pTab){ 1080 IdxTable *pIter; 1081 IdxTable *pNext; 1082 for(pIter=pTab; pIter; pIter=pNext){ 1083 pNext = pIter->pNext; 1084 sqlite3_free(pIter); 1085 } 1086 } 1087 1088 /* 1089 ** Free the linked list of IdxWrite objects starting at pTab. 1090 */ 1091 static void idxWriteFree(IdxWrite *pTab){ 1092 IdxWrite *pIter; 1093 IdxWrite *pNext; 1094 for(pIter=pTab; pIter; pIter=pNext){ 1095 pNext = pIter->pNext; 1096 sqlite3_free(pIter); 1097 } 1098 } 1099 1100 1101 1102 /* 1103 ** This function is called after candidate indexes have been created. It 1104 ** runs all the queries to see which indexes they prefer, and populates 1105 ** IdxStatement.zIdx and IdxStatement.zEQP with the results. 1106 */ 1107 int idxFindIndexes( 1108 sqlite3expert *p, 1109 char **pzErr /* OUT: Error message (sqlite3_malloc) */ 1110 ){ 1111 IdxStatement *pStmt; 1112 sqlite3 *dbm = p->dbm; 1113 int rc = SQLITE_OK; 1114 1115 IdxHash hIdx; 1116 idxHashInit(&hIdx); 1117 1118 for(pStmt=p->pStatement; rc==SQLITE_OK && pStmt; pStmt=pStmt->pNext){ 1119 IdxHashEntry *pEntry; 1120 sqlite3_stmt *pExplain = 0; 1121 idxHashClear(&hIdx); 1122 rc = idxPrintfPrepareStmt(dbm, &pExplain, pzErr, 1123 "EXPLAIN QUERY PLAN %s", pStmt->zSql 1124 ); 1125 while( rc==SQLITE_OK && sqlite3_step(pExplain)==SQLITE_ROW ){ 1126 int iSelectid = sqlite3_column_int(pExplain, 0); 1127 int iOrder = sqlite3_column_int(pExplain, 1); 1128 int iFrom = sqlite3_column_int(pExplain, 2); 1129 const char *zDetail = (const char*)sqlite3_column_text(pExplain, 3); 1130 int nDetail = STRLEN(zDetail); 1131 int i; 1132 1133 for(i=0; i<nDetail; i++){ 1134 const char *zIdx = 0; 1135 if( memcmp(&zDetail[i], " USING INDEX ", 13)==0 ){ 1136 zIdx = &zDetail[i+13]; 1137 }else if( memcmp(&zDetail[i], " USING COVERING INDEX ", 22)==0 ){ 1138 zIdx = &zDetail[i+22]; 1139 } 1140 if( zIdx ){ 1141 const char *zSql; 1142 int nIdx = 0; 1143 while( zIdx[nIdx]!='\0' && (zIdx[nIdx]!=' ' || zIdx[nIdx+1]!='(') ){ 1144 nIdx++; 1145 } 1146 zSql = idxHashSearch(&p->hIdx, zIdx, nIdx); 1147 if( zSql ){ 1148 idxHashAdd(&rc, &hIdx, zSql, 0); 1149 if( rc ) goto find_indexes_out; 1150 } 1151 break; 1152 } 1153 } 1154 1155 pStmt->zEQP = idxAppendText(&rc, pStmt->zEQP, "%d|%d|%d|%s\n", 1156 iSelectid, iOrder, iFrom, zDetail 1157 ); 1158 } 1159 1160 for(pEntry=hIdx.pFirst; pEntry; pEntry=pEntry->pNext){ 1161 pStmt->zIdx = idxAppendText(&rc, pStmt->zIdx, "%s;\n", pEntry->zKey); 1162 } 1163 1164 idxFinalize(&rc, pExplain); 1165 } 1166 1167 find_indexes_out: 1168 idxHashClear(&hIdx); 1169 return rc; 1170 } 1171 1172 static int idxAuthCallback( 1173 void *pCtx, 1174 int eOp, 1175 const char *z3, 1176 const char *z4, 1177 const char *zDb, 1178 const char *zTrigger 1179 ){ 1180 int rc = SQLITE_OK; 1181 (void)z4; 1182 (void)zTrigger; 1183 if( eOp==SQLITE_INSERT || eOp==SQLITE_UPDATE || eOp==SQLITE_DELETE ){ 1184 if( sqlite3_stricmp(zDb, "main")==0 ){ 1185 sqlite3expert *p = (sqlite3expert*)pCtx; 1186 IdxTable *pTab; 1187 for(pTab=p->pTable; pTab; pTab=pTab->pNext){ 1188 if( 0==sqlite3_stricmp(z3, pTab->zName) ) break; 1189 } 1190 if( pTab ){ 1191 IdxWrite *pWrite; 1192 for(pWrite=p->pWrite; pWrite; pWrite=pWrite->pNext){ 1193 if( pWrite->pTab==pTab && pWrite->eOp==eOp ) break; 1194 } 1195 if( pWrite==0 ){ 1196 pWrite = idxMalloc(&rc, sizeof(IdxWrite)); 1197 if( rc==SQLITE_OK ){ 1198 pWrite->pTab = pTab; 1199 pWrite->eOp = eOp; 1200 pWrite->pNext = p->pWrite; 1201 p->pWrite = pWrite; 1202 } 1203 } 1204 } 1205 } 1206 } 1207 return rc; 1208 } 1209 1210 static int idxProcessOneTrigger( 1211 sqlite3expert *p, 1212 IdxWrite *pWrite, 1213 char **pzErr 1214 ){ 1215 static const char *zInt = UNIQUE_TABLE_NAME; 1216 static const char *zDrop = "DROP TABLE " UNIQUE_TABLE_NAME; 1217 IdxTable *pTab = pWrite->pTab; 1218 const char *zTab = pTab->zName; 1219 const char *zSql = 1220 "SELECT 'CREATE TEMP' || substr(sql, 7) FROM sqlite_master " 1221 "WHERE tbl_name = %Q AND type IN ('table', 'trigger') " 1222 "ORDER BY type;"; 1223 sqlite3_stmt *pSelect = 0; 1224 int rc = SQLITE_OK; 1225 char *zWrite = 0; 1226 1227 /* Create the table and its triggers in the temp schema */ 1228 rc = idxPrintfPrepareStmt(p->db, &pSelect, pzErr, zSql, zTab, zTab); 1229 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pSelect) ){ 1230 const char *zCreate = (const char*)sqlite3_column_text(pSelect, 0); 1231 rc = sqlite3_exec(p->dbv, zCreate, 0, 0, pzErr); 1232 } 1233 idxFinalize(&rc, pSelect); 1234 1235 /* Rename the table in the temp schema to zInt */ 1236 if( rc==SQLITE_OK ){ 1237 char *z = sqlite3_mprintf("ALTER TABLE temp.%Q RENAME TO %Q", zTab, zInt); 1238 if( z==0 ){ 1239 rc = SQLITE_NOMEM; 1240 }else{ 1241 rc = sqlite3_exec(p->dbv, z, 0, 0, pzErr); 1242 sqlite3_free(z); 1243 } 1244 } 1245 1246 switch( pWrite->eOp ){ 1247 case SQLITE_INSERT: { 1248 int i; 1249 zWrite = idxAppendText(&rc, zWrite, "INSERT INTO %Q VALUES(", zInt); 1250 for(i=0; i<pTab->nCol; i++){ 1251 zWrite = idxAppendText(&rc, zWrite, "%s?", i==0 ? "" : ", "); 1252 } 1253 zWrite = idxAppendText(&rc, zWrite, ")"); 1254 break; 1255 } 1256 case SQLITE_UPDATE: { 1257 int i; 1258 zWrite = idxAppendText(&rc, zWrite, "UPDATE %Q SET ", zInt); 1259 for(i=0; i<pTab->nCol; i++){ 1260 zWrite = idxAppendText(&rc, zWrite, "%s%Q=?", i==0 ? "" : ", ", 1261 pTab->aCol[i].zName 1262 ); 1263 } 1264 break; 1265 } 1266 default: { 1267 assert( pWrite->eOp==SQLITE_DELETE ); 1268 if( rc==SQLITE_OK ){ 1269 zWrite = sqlite3_mprintf("DELETE FROM %Q", zInt); 1270 if( zWrite==0 ) rc = SQLITE_NOMEM; 1271 } 1272 } 1273 } 1274 1275 if( rc==SQLITE_OK ){ 1276 sqlite3_stmt *pX = 0; 1277 rc = sqlite3_prepare_v2(p->dbv, zWrite, -1, &pX, 0); 1278 idxFinalize(&rc, pX); 1279 if( rc!=SQLITE_OK ){ 1280 idxDatabaseError(p->dbv, pzErr); 1281 } 1282 } 1283 sqlite3_free(zWrite); 1284 1285 if( rc==SQLITE_OK ){ 1286 rc = sqlite3_exec(p->dbv, zDrop, 0, 0, pzErr); 1287 } 1288 1289 return rc; 1290 } 1291 1292 static int idxProcessTriggers(sqlite3expert *p, char **pzErr){ 1293 int rc = SQLITE_OK; 1294 IdxWrite *pEnd = 0; 1295 IdxWrite *pFirst = p->pWrite; 1296 1297 while( rc==SQLITE_OK && pFirst!=pEnd ){ 1298 IdxWrite *pIter; 1299 for(pIter=pFirst; rc==SQLITE_OK && pIter!=pEnd; pIter=pIter->pNext){ 1300 rc = idxProcessOneTrigger(p, pIter, pzErr); 1301 } 1302 pEnd = pFirst; 1303 pFirst = p->pWrite; 1304 } 1305 1306 return rc; 1307 } 1308 1309 1310 static int idxCreateVtabSchema(sqlite3expert *p, char **pzErrmsg){ 1311 int rc = idxRegisterVtab(p); 1312 sqlite3_stmt *pSchema = 0; 1313 1314 /* For each table in the main db schema: 1315 ** 1316 ** 1) Add an entry to the p->pTable list, and 1317 ** 2) Create the equivalent virtual table in dbv. 1318 */ 1319 rc = idxPrepareStmt(p->db, &pSchema, pzErrmsg, 1320 "SELECT type, name, sql, 1 FROM sqlite_master " 1321 "WHERE type IN ('table','view') AND name NOT LIKE 'sqlite_%%' " 1322 " UNION ALL " 1323 "SELECT type, name, sql, 2 FROM sqlite_master " 1324 "WHERE type = 'trigger'" 1325 " AND tbl_name IN(SELECT name FROM sqlite_master WHERE type = 'view') " 1326 "ORDER BY 4, 1" 1327 ); 1328 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pSchema) ){ 1329 const char *zType = (const char*)sqlite3_column_text(pSchema, 0); 1330 const char *zName = (const char*)sqlite3_column_text(pSchema, 1); 1331 const char *zSql = (const char*)sqlite3_column_text(pSchema, 2); 1332 1333 if( zType[0]=='v' || zType[1]=='r' ){ 1334 rc = sqlite3_exec(p->dbv, zSql, 0, 0, pzErrmsg); 1335 }else{ 1336 IdxTable *pTab; 1337 rc = idxGetTableInfo(p->db, zName, &pTab, pzErrmsg); 1338 if( rc==SQLITE_OK ){ 1339 int i; 1340 char *zInner = 0; 1341 char *zOuter = 0; 1342 pTab->pNext = p->pTable; 1343 p->pTable = pTab; 1344 1345 /* The statement the vtab will pass to sqlite3_declare_vtab() */ 1346 zInner = idxAppendText(&rc, 0, "CREATE TABLE x("); 1347 for(i=0; i<pTab->nCol; i++){ 1348 zInner = idxAppendText(&rc, zInner, "%s%Q COLLATE %s", 1349 (i==0 ? "" : ", "), pTab->aCol[i].zName, pTab->aCol[i].zColl 1350 ); 1351 } 1352 zInner = idxAppendText(&rc, zInner, ")"); 1353 1354 /* The CVT statement to create the vtab */ 1355 zOuter = idxAppendText(&rc, 0, 1356 "CREATE VIRTUAL TABLE %Q USING expert(%Q)", zName, zInner 1357 ); 1358 if( rc==SQLITE_OK ){ 1359 rc = sqlite3_exec(p->dbv, zOuter, 0, 0, pzErrmsg); 1360 } 1361 sqlite3_free(zInner); 1362 sqlite3_free(zOuter); 1363 } 1364 } 1365 } 1366 idxFinalize(&rc, pSchema); 1367 return rc; 1368 } 1369 1370 struct IdxSampleCtx { 1371 int iTarget; 1372 double target; /* Target nRet/nRow value */ 1373 double nRow; /* Number of rows seen */ 1374 double nRet; /* Number of rows returned */ 1375 }; 1376 1377 static void idxSampleFunc( 1378 sqlite3_context *pCtx, 1379 int argc, 1380 sqlite3_value **argv 1381 ){ 1382 struct IdxSampleCtx *p = (struct IdxSampleCtx*)sqlite3_user_data(pCtx); 1383 int bRet; 1384 1385 (void)argv; 1386 assert( argc==0 ); 1387 if( p->nRow==0.0 ){ 1388 bRet = 1; 1389 }else{ 1390 bRet = (p->nRet / p->nRow) <= p->target; 1391 if( bRet==0 ){ 1392 unsigned short rnd; 1393 sqlite3_randomness(2, (void*)&rnd); 1394 bRet = ((int)rnd % 100) <= p->iTarget; 1395 } 1396 } 1397 1398 sqlite3_result_int(pCtx, bRet); 1399 p->nRow += 1.0; 1400 p->nRet += (double)bRet; 1401 } 1402 1403 struct IdxRemCtx { 1404 int nSlot; 1405 struct IdxRemSlot { 1406 int eType; /* SQLITE_NULL, INTEGER, REAL, TEXT, BLOB */ 1407 i64 iVal; /* SQLITE_INTEGER value */ 1408 double rVal; /* SQLITE_FLOAT value */ 1409 int nByte; /* Bytes of space allocated at z */ 1410 int n; /* Size of buffer z */ 1411 char *z; /* SQLITE_TEXT/BLOB value */ 1412 } aSlot[1]; 1413 }; 1414 1415 /* 1416 ** Implementation of scalar function rem(). 1417 */ 1418 static void idxRemFunc( 1419 sqlite3_context *pCtx, 1420 int argc, 1421 sqlite3_value **argv 1422 ){ 1423 struct IdxRemCtx *p = (struct IdxRemCtx*)sqlite3_user_data(pCtx); 1424 struct IdxRemSlot *pSlot; 1425 int iSlot; 1426 assert( argc==2 ); 1427 1428 iSlot = sqlite3_value_int(argv[0]); 1429 assert( iSlot<=p->nSlot ); 1430 pSlot = &p->aSlot[iSlot]; 1431 1432 switch( pSlot->eType ){ 1433 case SQLITE_NULL: 1434 /* no-op */ 1435 break; 1436 1437 case SQLITE_INTEGER: 1438 sqlite3_result_int64(pCtx, pSlot->iVal); 1439 break; 1440 1441 case SQLITE_FLOAT: 1442 sqlite3_result_double(pCtx, pSlot->rVal); 1443 break; 1444 1445 case SQLITE_BLOB: 1446 sqlite3_result_blob(pCtx, pSlot->z, pSlot->n, SQLITE_TRANSIENT); 1447 break; 1448 1449 case SQLITE_TEXT: 1450 sqlite3_result_text(pCtx, pSlot->z, pSlot->n, SQLITE_TRANSIENT); 1451 break; 1452 } 1453 1454 pSlot->eType = sqlite3_value_type(argv[1]); 1455 switch( pSlot->eType ){ 1456 case SQLITE_NULL: 1457 /* no-op */ 1458 break; 1459 1460 case SQLITE_INTEGER: 1461 pSlot->iVal = sqlite3_value_int64(argv[1]); 1462 break; 1463 1464 case SQLITE_FLOAT: 1465 pSlot->rVal = sqlite3_value_double(argv[1]); 1466 break; 1467 1468 case SQLITE_BLOB: 1469 case SQLITE_TEXT: { 1470 int nByte = sqlite3_value_bytes(argv[1]); 1471 if( nByte>pSlot->nByte ){ 1472 char *zNew = (char*)sqlite3_realloc(pSlot->z, nByte*2); 1473 if( zNew==0 ){ 1474 sqlite3_result_error_nomem(pCtx); 1475 return; 1476 } 1477 pSlot->nByte = nByte*2; 1478 pSlot->z = zNew; 1479 } 1480 pSlot->n = nByte; 1481 if( pSlot->eType==SQLITE_BLOB ){ 1482 memcpy(pSlot->z, sqlite3_value_blob(argv[1]), nByte); 1483 }else{ 1484 memcpy(pSlot->z, sqlite3_value_text(argv[1]), nByte); 1485 } 1486 break; 1487 } 1488 } 1489 } 1490 1491 static int idxLargestIndex(sqlite3 *db, int *pnMax, char **pzErr){ 1492 int rc = SQLITE_OK; 1493 const char *zMax = 1494 "SELECT max(i.seqno) FROM " 1495 " sqlite_master AS s, " 1496 " pragma_index_list(s.name) AS l, " 1497 " pragma_index_info(l.name) AS i " 1498 "WHERE s.type = 'table'"; 1499 sqlite3_stmt *pMax = 0; 1500 1501 *pnMax = 0; 1502 rc = idxPrepareStmt(db, &pMax, pzErr, zMax); 1503 if( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pMax) ){ 1504 *pnMax = sqlite3_column_int(pMax, 0) + 1; 1505 } 1506 idxFinalize(&rc, pMax); 1507 1508 return rc; 1509 } 1510 1511 static int idxPopulateOneStat1( 1512 sqlite3expert *p, 1513 sqlite3_stmt *pIndexXInfo, 1514 sqlite3_stmt *pWriteStat, 1515 const char *zTab, 1516 const char *zIdx, 1517 char **pzErr 1518 ){ 1519 char *zCols = 0; 1520 char *zOrder = 0; 1521 char *zQuery = 0; 1522 int nCol = 0; 1523 int i; 1524 sqlite3_stmt *pQuery = 0; 1525 int *aStat = 0; 1526 int rc = SQLITE_OK; 1527 1528 assert( p->iSample>0 ); 1529 1530 /* Formulate the query text */ 1531 sqlite3_bind_text(pIndexXInfo, 1, zIdx, -1, SQLITE_STATIC); 1532 while( SQLITE_OK==rc && SQLITE_ROW==sqlite3_step(pIndexXInfo) ){ 1533 const char *zComma = zCols==0 ? "" : ", "; 1534 const char *zName = (const char*)sqlite3_column_text(pIndexXInfo, 0); 1535 const char *zColl = (const char*)sqlite3_column_text(pIndexXInfo, 1); 1536 zCols = idxAppendText(&rc, zCols, 1537 "%sx.%Q IS rem(%d, x.%Q) COLLATE %s", zComma, zName, nCol, zName, zColl 1538 ); 1539 zOrder = idxAppendText(&rc, zOrder, "%s%d", zComma, ++nCol); 1540 } 1541 sqlite3_reset(pIndexXInfo); 1542 if( rc==SQLITE_OK ){ 1543 if( p->iSample==100 ){ 1544 zQuery = sqlite3_mprintf( 1545 "SELECT %s FROM %Q x ORDER BY %s", zCols, zTab, zOrder 1546 ); 1547 }else{ 1548 zQuery = sqlite3_mprintf( 1549 "SELECT %s FROM temp."UNIQUE_TABLE_NAME" x ORDER BY %s", zCols, zOrder 1550 ); 1551 } 1552 } 1553 sqlite3_free(zCols); 1554 sqlite3_free(zOrder); 1555 1556 /* Formulate the query text */ 1557 if( rc==SQLITE_OK ){ 1558 sqlite3 *dbrem = (p->iSample==100 ? p->db : p->dbv); 1559 rc = idxPrepareStmt(dbrem, &pQuery, pzErr, zQuery); 1560 } 1561 sqlite3_free(zQuery); 1562 1563 if( rc==SQLITE_OK ){ 1564 aStat = (int*)idxMalloc(&rc, sizeof(int)*(nCol+1)); 1565 } 1566 if( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pQuery) ){ 1567 IdxHashEntry *pEntry; 1568 char *zStat = 0; 1569 for(i=0; i<=nCol; i++) aStat[i] = 1; 1570 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pQuery) ){ 1571 aStat[0]++; 1572 for(i=0; i<nCol; i++){ 1573 if( sqlite3_column_int(pQuery, i)==0 ) break; 1574 } 1575 for(/*no-op*/; i<nCol; i++){ 1576 aStat[i+1]++; 1577 } 1578 } 1579 1580 if( rc==SQLITE_OK ){ 1581 int s0 = aStat[0]; 1582 zStat = sqlite3_mprintf("%d", s0); 1583 if( zStat==0 ) rc = SQLITE_NOMEM; 1584 for(i=1; rc==SQLITE_OK && i<=nCol; i++){ 1585 zStat = idxAppendText(&rc, zStat, " %d", (s0+aStat[i]/2) / aStat[i]); 1586 } 1587 } 1588 1589 if( rc==SQLITE_OK ){ 1590 sqlite3_bind_text(pWriteStat, 1, zTab, -1, SQLITE_STATIC); 1591 sqlite3_bind_text(pWriteStat, 2, zIdx, -1, SQLITE_STATIC); 1592 sqlite3_bind_text(pWriteStat, 3, zStat, -1, SQLITE_STATIC); 1593 sqlite3_step(pWriteStat); 1594 rc = sqlite3_reset(pWriteStat); 1595 } 1596 1597 pEntry = idxHashFind(&p->hIdx, zIdx, STRLEN(zIdx)); 1598 if( pEntry ){ 1599 assert( pEntry->zVal2==0 ); 1600 pEntry->zVal2 = zStat; 1601 }else{ 1602 sqlite3_free(zStat); 1603 } 1604 } 1605 sqlite3_free(aStat); 1606 idxFinalize(&rc, pQuery); 1607 1608 return rc; 1609 } 1610 1611 static int idxBuildSampleTable(sqlite3expert *p, const char *zTab){ 1612 int rc; 1613 char *zSql; 1614 1615 rc = sqlite3_exec(p->dbv,"DROP TABLE IF EXISTS temp."UNIQUE_TABLE_NAME,0,0,0); 1616 if( rc!=SQLITE_OK ) return rc; 1617 1618 zSql = sqlite3_mprintf( 1619 "CREATE TABLE temp." UNIQUE_TABLE_NAME " AS SELECT * FROM %Q", zTab 1620 ); 1621 if( zSql==0 ) return SQLITE_NOMEM; 1622 rc = sqlite3_exec(p->dbv, zSql, 0, 0, 0); 1623 sqlite3_free(zSql); 1624 1625 return rc; 1626 } 1627 1628 /* 1629 ** This function is called as part of sqlite3_expert_analyze(). Candidate 1630 ** indexes have already been created in database sqlite3expert.dbm, this 1631 ** function populates sqlite_stat1 table in the same database. 1632 ** 1633 ** The stat1 data is generated by querying the 1634 */ 1635 static int idxPopulateStat1(sqlite3expert *p, char **pzErr){ 1636 int rc = SQLITE_OK; 1637 int nMax =0; 1638 struct IdxRemCtx *pCtx = 0; 1639 struct IdxSampleCtx samplectx; 1640 int i; 1641 i64 iPrev = -100000; 1642 sqlite3_stmt *pAllIndex = 0; 1643 sqlite3_stmt *pIndexXInfo = 0; 1644 sqlite3_stmt *pWrite = 0; 1645 1646 const char *zAllIndex = 1647 "SELECT s.rowid, s.name, l.name FROM " 1648 " sqlite_master AS s, " 1649 " pragma_index_list(s.name) AS l " 1650 "WHERE s.type = 'table'"; 1651 const char *zIndexXInfo = 1652 "SELECT name, coll FROM pragma_index_xinfo(?) WHERE key"; 1653 const char *zWrite = "INSERT INTO sqlite_stat1 VALUES(?, ?, ?)"; 1654 1655 /* If iSample==0, no sqlite_stat1 data is required. */ 1656 if( p->iSample==0 ) return SQLITE_OK; 1657 1658 rc = idxLargestIndex(p->dbm, &nMax, pzErr); 1659 if( nMax<=0 || rc!=SQLITE_OK ) return rc; 1660 1661 rc = sqlite3_exec(p->dbm, "ANALYZE; PRAGMA writable_schema=1", 0, 0, 0); 1662 1663 if( rc==SQLITE_OK ){ 1664 int nByte = sizeof(struct IdxRemCtx) + (sizeof(struct IdxRemSlot) * nMax); 1665 pCtx = (struct IdxRemCtx*)idxMalloc(&rc, nByte); 1666 } 1667 1668 if( rc==SQLITE_OK ){ 1669 sqlite3 *dbrem = (p->iSample==100 ? p->db : p->dbv); 1670 rc = sqlite3_create_function( 1671 dbrem, "rem", 2, SQLITE_UTF8, (void*)pCtx, idxRemFunc, 0, 0 1672 ); 1673 } 1674 if( rc==SQLITE_OK ){ 1675 rc = sqlite3_create_function( 1676 p->db, "sample", 0, SQLITE_UTF8, (void*)&samplectx, idxSampleFunc, 0, 0 1677 ); 1678 } 1679 1680 if( rc==SQLITE_OK ){ 1681 pCtx->nSlot = nMax+1; 1682 rc = idxPrepareStmt(p->dbm, &pAllIndex, pzErr, zAllIndex); 1683 } 1684 if( rc==SQLITE_OK ){ 1685 rc = idxPrepareStmt(p->dbm, &pIndexXInfo, pzErr, zIndexXInfo); 1686 } 1687 if( rc==SQLITE_OK ){ 1688 rc = idxPrepareStmt(p->dbm, &pWrite, pzErr, zWrite); 1689 } 1690 1691 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pAllIndex) ){ 1692 i64 iRowid = sqlite3_column_int64(pAllIndex, 0); 1693 const char *zTab = (const char*)sqlite3_column_text(pAllIndex, 1); 1694 const char *zIdx = (const char*)sqlite3_column_text(pAllIndex, 2); 1695 if( p->iSample<100 && iPrev!=iRowid ){ 1696 samplectx.target = (double)p->iSample / 100.0; 1697 samplectx.iTarget = p->iSample; 1698 samplectx.nRow = 0.0; 1699 samplectx.nRet = 0.0; 1700 rc = idxBuildSampleTable(p, zTab); 1701 if( rc!=SQLITE_OK ) break; 1702 } 1703 rc = idxPopulateOneStat1(p, pIndexXInfo, pWrite, zTab, zIdx, pzErr); 1704 iPrev = iRowid; 1705 } 1706 if( rc==SQLITE_OK && p->iSample<100 ){ 1707 rc = sqlite3_exec(p->dbv, 1708 "DROP TABLE IF EXISTS temp." UNIQUE_TABLE_NAME, 0,0,0 1709 ); 1710 } 1711 1712 idxFinalize(&rc, pAllIndex); 1713 idxFinalize(&rc, pIndexXInfo); 1714 idxFinalize(&rc, pWrite); 1715 1716 for(i=0; i<pCtx->nSlot; i++){ 1717 sqlite3_free(pCtx->aSlot[i].z); 1718 } 1719 sqlite3_free(pCtx); 1720 1721 if( rc==SQLITE_OK ){ 1722 rc = sqlite3_exec(p->dbm, "ANALYZE sqlite_master", 0, 0, 0); 1723 } 1724 1725 sqlite3_exec(p->db, "DROP TABLE IF EXISTS temp."UNIQUE_TABLE_NAME,0,0,0); 1726 return rc; 1727 } 1728 1729 /* 1730 ** Allocate a new sqlite3expert object. 1731 */ 1732 sqlite3expert *sqlite3_expert_new(sqlite3 *db, char **pzErrmsg){ 1733 int rc = SQLITE_OK; 1734 sqlite3expert *pNew; 1735 1736 pNew = (sqlite3expert*)idxMalloc(&rc, sizeof(sqlite3expert)); 1737 1738 /* Open two in-memory databases to work with. The "vtab database" (dbv) 1739 ** will contain a virtual table corresponding to each real table in 1740 ** the user database schema, and a copy of each view. It is used to 1741 ** collect information regarding the WHERE, ORDER BY and other clauses 1742 ** of the user's query. 1743 */ 1744 if( rc==SQLITE_OK ){ 1745 pNew->db = db; 1746 pNew->iSample = 100; 1747 rc = sqlite3_open(":memory:", &pNew->dbv); 1748 } 1749 if( rc==SQLITE_OK ){ 1750 rc = sqlite3_open(":memory:", &pNew->dbm); 1751 if( rc==SQLITE_OK ){ 1752 sqlite3_db_config(pNew->dbm, SQLITE_DBCONFIG_TRIGGER_EQP, 1, (int*)0); 1753 } 1754 } 1755 1756 1757 /* Copy the entire schema of database [db] into [dbm]. */ 1758 if( rc==SQLITE_OK ){ 1759 sqlite3_stmt *pSql; 1760 rc = idxPrintfPrepareStmt(pNew->db, &pSql, pzErrmsg, 1761 "SELECT sql FROM sqlite_master WHERE name NOT LIKE 'sqlite_%%'" 1762 " AND sql NOT LIKE 'CREATE VIRTUAL %%'" 1763 ); 1764 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pSql) ){ 1765 const char *zSql = (const char*)sqlite3_column_text(pSql, 0); 1766 rc = sqlite3_exec(pNew->dbm, zSql, 0, 0, pzErrmsg); 1767 } 1768 idxFinalize(&rc, pSql); 1769 } 1770 1771 /* Create the vtab schema */ 1772 if( rc==SQLITE_OK ){ 1773 rc = idxCreateVtabSchema(pNew, pzErrmsg); 1774 } 1775 1776 /* Register the auth callback with dbv */ 1777 if( rc==SQLITE_OK ){ 1778 sqlite3_set_authorizer(pNew->dbv, idxAuthCallback, (void*)pNew); 1779 } 1780 1781 /* If an error has occurred, free the new object and reutrn NULL. Otherwise, 1782 ** return the new sqlite3expert handle. */ 1783 if( rc!=SQLITE_OK ){ 1784 sqlite3_expert_destroy(pNew); 1785 pNew = 0; 1786 } 1787 return pNew; 1788 } 1789 1790 /* 1791 ** Configure an sqlite3expert object. 1792 */ 1793 int sqlite3_expert_config(sqlite3expert *p, int op, ...){ 1794 int rc = SQLITE_OK; 1795 va_list ap; 1796 va_start(ap, op); 1797 switch( op ){ 1798 case EXPERT_CONFIG_SAMPLE: { 1799 int iVal = va_arg(ap, int); 1800 if( iVal<0 ) iVal = 0; 1801 if( iVal>100 ) iVal = 100; 1802 p->iSample = iVal; 1803 break; 1804 } 1805 default: 1806 rc = SQLITE_NOTFOUND; 1807 break; 1808 } 1809 1810 va_end(ap); 1811 return rc; 1812 } 1813 1814 /* 1815 ** Add an SQL statement to the analysis. 1816 */ 1817 int sqlite3_expert_sql( 1818 sqlite3expert *p, /* From sqlite3_expert_new() */ 1819 const char *zSql, /* SQL statement to add */ 1820 char **pzErr /* OUT: Error message (if any) */ 1821 ){ 1822 IdxScan *pScanOrig = p->pScan; 1823 IdxStatement *pStmtOrig = p->pStatement; 1824 int rc = SQLITE_OK; 1825 const char *zStmt = zSql; 1826 1827 if( p->bRun ) return SQLITE_MISUSE; 1828 1829 while( rc==SQLITE_OK && zStmt && zStmt[0] ){ 1830 sqlite3_stmt *pStmt = 0; 1831 rc = sqlite3_prepare_v2(p->dbv, zStmt, -1, &pStmt, &zStmt); 1832 if( rc==SQLITE_OK ){ 1833 if( pStmt ){ 1834 IdxStatement *pNew; 1835 const char *z = sqlite3_sql(pStmt); 1836 int n = STRLEN(z); 1837 pNew = (IdxStatement*)idxMalloc(&rc, sizeof(IdxStatement) + n+1); 1838 if( rc==SQLITE_OK ){ 1839 pNew->zSql = (char*)&pNew[1]; 1840 memcpy(pNew->zSql, z, n+1); 1841 pNew->pNext = p->pStatement; 1842 if( p->pStatement ) pNew->iId = p->pStatement->iId+1; 1843 p->pStatement = pNew; 1844 } 1845 sqlite3_finalize(pStmt); 1846 } 1847 }else{ 1848 idxDatabaseError(p->dbv, pzErr); 1849 } 1850 } 1851 1852 if( rc!=SQLITE_OK ){ 1853 idxScanFree(p->pScan, pScanOrig); 1854 idxStatementFree(p->pStatement, pStmtOrig); 1855 p->pScan = pScanOrig; 1856 p->pStatement = pStmtOrig; 1857 } 1858 1859 return rc; 1860 } 1861 1862 int sqlite3_expert_analyze(sqlite3expert *p, char **pzErr){ 1863 int rc; 1864 IdxHashEntry *pEntry; 1865 1866 /* Do trigger processing to collect any extra IdxScan structures */ 1867 rc = idxProcessTriggers(p, pzErr); 1868 1869 /* Create candidate indexes within the in-memory database file */ 1870 if( rc==SQLITE_OK ){ 1871 rc = idxCreateCandidates(p); 1872 } 1873 1874 /* Generate the stat1 data */ 1875 if( rc==SQLITE_OK ){ 1876 rc = idxPopulateStat1(p, pzErr); 1877 } 1878 1879 /* Formulate the EXPERT_REPORT_CANDIDATES text */ 1880 for(pEntry=p->hIdx.pFirst; pEntry; pEntry=pEntry->pNext){ 1881 p->zCandidates = idxAppendText(&rc, p->zCandidates, 1882 "%s;%s%s\n", pEntry->zVal, 1883 pEntry->zVal2 ? " -- stat1: " : "", pEntry->zVal2 1884 ); 1885 } 1886 1887 /* Figure out which of the candidate indexes are preferred by the query 1888 ** planner and report the results to the user. */ 1889 if( rc==SQLITE_OK ){ 1890 rc = idxFindIndexes(p, pzErr); 1891 } 1892 1893 if( rc==SQLITE_OK ){ 1894 p->bRun = 1; 1895 } 1896 return rc; 1897 } 1898 1899 /* 1900 ** Return the total number of statements that have been added to this 1901 ** sqlite3expert using sqlite3_expert_sql(). 1902 */ 1903 int sqlite3_expert_count(sqlite3expert *p){ 1904 int nRet = 0; 1905 if( p->pStatement ) nRet = p->pStatement->iId+1; 1906 return nRet; 1907 } 1908 1909 /* 1910 ** Return a component of the report. 1911 */ 1912 const char *sqlite3_expert_report(sqlite3expert *p, int iStmt, int eReport){ 1913 const char *zRet = 0; 1914 IdxStatement *pStmt; 1915 1916 if( p->bRun==0 ) return 0; 1917 for(pStmt=p->pStatement; pStmt && pStmt->iId!=iStmt; pStmt=pStmt->pNext); 1918 switch( eReport ){ 1919 case EXPERT_REPORT_SQL: 1920 if( pStmt ) zRet = pStmt->zSql; 1921 break; 1922 case EXPERT_REPORT_INDEXES: 1923 if( pStmt ) zRet = pStmt->zIdx; 1924 break; 1925 case EXPERT_REPORT_PLAN: 1926 if( pStmt ) zRet = pStmt->zEQP; 1927 break; 1928 case EXPERT_REPORT_CANDIDATES: 1929 zRet = p->zCandidates; 1930 break; 1931 } 1932 return zRet; 1933 } 1934 1935 /* 1936 ** Free an sqlite3expert object. 1937 */ 1938 void sqlite3_expert_destroy(sqlite3expert *p){ 1939 if( p ){ 1940 sqlite3_close(p->dbm); 1941 sqlite3_close(p->dbv); 1942 idxScanFree(p->pScan, 0); 1943 idxStatementFree(p->pStatement, 0); 1944 idxTableFree(p->pTable); 1945 idxWriteFree(p->pWrite); 1946 idxHashClear(&p->hIdx); 1947 sqlite3_free(p->zCandidates); 1948 sqlite3_free(p); 1949 } 1950 } 1951 1952 #endif /* ifndef SQLITE_OMIT_VIRTUAL_TABLE */ 1953