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 0, /* xShadowName */ 648 }; 649 650 return sqlite3_create_module(p->dbv, "expert", &expertModule, (void*)p); 651 } 652 /* 653 ** End of virtual table implementation. 654 *************************************************************************/ 655 /* 656 ** Finalize SQL statement pStmt. If (*pRc) is SQLITE_OK when this function 657 ** is called, set it to the return value of sqlite3_finalize() before 658 ** returning. Otherwise, discard the sqlite3_finalize() return value. 659 */ 660 static void idxFinalize(int *pRc, sqlite3_stmt *pStmt){ 661 int rc = sqlite3_finalize(pStmt); 662 if( *pRc==SQLITE_OK ) *pRc = rc; 663 } 664 665 /* 666 ** Attempt to allocate an IdxTable structure corresponding to table zTab 667 ** in the main database of connection db. If successful, set (*ppOut) to 668 ** point to the new object and return SQLITE_OK. Otherwise, return an 669 ** SQLite error code and set (*ppOut) to NULL. In this case *pzErrmsg may be 670 ** set to point to an error string. 671 ** 672 ** It is the responsibility of the caller to eventually free either the 673 ** IdxTable object or error message using sqlite3_free(). 674 */ 675 static int idxGetTableInfo( 676 sqlite3 *db, /* Database connection to read details from */ 677 const char *zTab, /* Table name */ 678 IdxTable **ppOut, /* OUT: New object (if successful) */ 679 char **pzErrmsg /* OUT: Error message (if not) */ 680 ){ 681 sqlite3_stmt *p1 = 0; 682 int nCol = 0; 683 int nTab = STRLEN(zTab); 684 int nByte = sizeof(IdxTable) + nTab + 1; 685 IdxTable *pNew = 0; 686 int rc, rc2; 687 char *pCsr = 0; 688 689 rc = idxPrintfPrepareStmt(db, &p1, pzErrmsg, "PRAGMA table_info=%Q", zTab); 690 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(p1) ){ 691 const char *zCol = (const char*)sqlite3_column_text(p1, 1); 692 nByte += 1 + STRLEN(zCol); 693 rc = sqlite3_table_column_metadata( 694 db, "main", zTab, zCol, 0, &zCol, 0, 0, 0 695 ); 696 nByte += 1 + STRLEN(zCol); 697 nCol++; 698 } 699 rc2 = sqlite3_reset(p1); 700 if( rc==SQLITE_OK ) rc = rc2; 701 702 nByte += sizeof(IdxColumn) * nCol; 703 if( rc==SQLITE_OK ){ 704 pNew = idxMalloc(&rc, nByte); 705 } 706 if( rc==SQLITE_OK ){ 707 pNew->aCol = (IdxColumn*)&pNew[1]; 708 pNew->nCol = nCol; 709 pCsr = (char*)&pNew->aCol[nCol]; 710 } 711 712 nCol = 0; 713 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(p1) ){ 714 const char *zCol = (const char*)sqlite3_column_text(p1, 1); 715 int nCopy = STRLEN(zCol) + 1; 716 pNew->aCol[nCol].zName = pCsr; 717 pNew->aCol[nCol].iPk = sqlite3_column_int(p1, 5); 718 memcpy(pCsr, zCol, nCopy); 719 pCsr += nCopy; 720 721 rc = sqlite3_table_column_metadata( 722 db, "main", zTab, zCol, 0, &zCol, 0, 0, 0 723 ); 724 if( rc==SQLITE_OK ){ 725 nCopy = STRLEN(zCol) + 1; 726 pNew->aCol[nCol].zColl = pCsr; 727 memcpy(pCsr, zCol, nCopy); 728 pCsr += nCopy; 729 } 730 731 nCol++; 732 } 733 idxFinalize(&rc, p1); 734 735 if( rc!=SQLITE_OK ){ 736 sqlite3_free(pNew); 737 pNew = 0; 738 }else{ 739 pNew->zName = pCsr; 740 memcpy(pNew->zName, zTab, nTab+1); 741 } 742 743 *ppOut = pNew; 744 return rc; 745 } 746 747 /* 748 ** This function is a no-op if *pRc is set to anything other than 749 ** SQLITE_OK when it is called. 750 ** 751 ** If *pRc is initially set to SQLITE_OK, then the text specified by 752 ** the printf() style arguments is appended to zIn and the result returned 753 ** in a buffer allocated by sqlite3_malloc(). sqlite3_free() is called on 754 ** zIn before returning. 755 */ 756 static char *idxAppendText(int *pRc, char *zIn, const char *zFmt, ...){ 757 va_list ap; 758 char *zAppend = 0; 759 char *zRet = 0; 760 int nIn = zIn ? STRLEN(zIn) : 0; 761 int nAppend = 0; 762 va_start(ap, zFmt); 763 if( *pRc==SQLITE_OK ){ 764 zAppend = sqlite3_vmprintf(zFmt, ap); 765 if( zAppend ){ 766 nAppend = STRLEN(zAppend); 767 zRet = (char*)sqlite3_malloc(nIn + nAppend + 1); 768 } 769 if( zAppend && zRet ){ 770 if( nIn ) memcpy(zRet, zIn, nIn); 771 memcpy(&zRet[nIn], zAppend, nAppend+1); 772 }else{ 773 sqlite3_free(zRet); 774 zRet = 0; 775 *pRc = SQLITE_NOMEM; 776 } 777 sqlite3_free(zAppend); 778 sqlite3_free(zIn); 779 } 780 va_end(ap); 781 return zRet; 782 } 783 784 /* 785 ** Return true if zId must be quoted in order to use it as an SQL 786 ** identifier, or false otherwise. 787 */ 788 static int idxIdentifierRequiresQuotes(const char *zId){ 789 int i; 790 for(i=0; zId[i]; i++){ 791 if( !(zId[i]=='_') 792 && !(zId[i]>='0' && zId[i]<='9') 793 && !(zId[i]>='a' && zId[i]<='z') 794 && !(zId[i]>='A' && zId[i]<='Z') 795 ){ 796 return 1; 797 } 798 } 799 return 0; 800 } 801 802 /* 803 ** This function appends an index column definition suitable for constraint 804 ** pCons to the string passed as zIn and returns the result. 805 */ 806 static char *idxAppendColDefn( 807 int *pRc, /* IN/OUT: Error code */ 808 char *zIn, /* Column defn accumulated so far */ 809 IdxTable *pTab, /* Table index will be created on */ 810 IdxConstraint *pCons 811 ){ 812 char *zRet = zIn; 813 IdxColumn *p = &pTab->aCol[pCons->iCol]; 814 if( zRet ) zRet = idxAppendText(pRc, zRet, ", "); 815 816 if( idxIdentifierRequiresQuotes(p->zName) ){ 817 zRet = idxAppendText(pRc, zRet, "%Q", p->zName); 818 }else{ 819 zRet = idxAppendText(pRc, zRet, "%s", p->zName); 820 } 821 822 if( sqlite3_stricmp(p->zColl, pCons->zColl) ){ 823 if( idxIdentifierRequiresQuotes(pCons->zColl) ){ 824 zRet = idxAppendText(pRc, zRet, " COLLATE %Q", pCons->zColl); 825 }else{ 826 zRet = idxAppendText(pRc, zRet, " COLLATE %s", pCons->zColl); 827 } 828 } 829 830 if( pCons->bDesc ){ 831 zRet = idxAppendText(pRc, zRet, " DESC"); 832 } 833 return zRet; 834 } 835 836 /* 837 ** Search database dbm for an index compatible with the one idxCreateFromCons() 838 ** would create from arguments pScan, pEq and pTail. If no error occurs and 839 ** such an index is found, return non-zero. Or, if no such index is found, 840 ** return zero. 841 ** 842 ** If an error occurs, set *pRc to an SQLite error code and return zero. 843 */ 844 static int idxFindCompatible( 845 int *pRc, /* OUT: Error code */ 846 sqlite3* dbm, /* Database to search */ 847 IdxScan *pScan, /* Scan for table to search for index on */ 848 IdxConstraint *pEq, /* List of == constraints */ 849 IdxConstraint *pTail /* List of range constraints */ 850 ){ 851 const char *zTbl = pScan->pTab->zName; 852 sqlite3_stmt *pIdxList = 0; 853 IdxConstraint *pIter; 854 int nEq = 0; /* Number of elements in pEq */ 855 int rc; 856 857 /* Count the elements in list pEq */ 858 for(pIter=pEq; pIter; pIter=pIter->pLink) nEq++; 859 860 rc = idxPrintfPrepareStmt(dbm, &pIdxList, 0, "PRAGMA index_list=%Q", zTbl); 861 while( rc==SQLITE_OK && sqlite3_step(pIdxList)==SQLITE_ROW ){ 862 int bMatch = 1; 863 IdxConstraint *pT = pTail; 864 sqlite3_stmt *pInfo = 0; 865 const char *zIdx = (const char*)sqlite3_column_text(pIdxList, 1); 866 867 /* Zero the IdxConstraint.bFlag values in the pEq list */ 868 for(pIter=pEq; pIter; pIter=pIter->pLink) pIter->bFlag = 0; 869 870 rc = idxPrintfPrepareStmt(dbm, &pInfo, 0, "PRAGMA index_xInfo=%Q", zIdx); 871 while( rc==SQLITE_OK && sqlite3_step(pInfo)==SQLITE_ROW ){ 872 int iIdx = sqlite3_column_int(pInfo, 0); 873 int iCol = sqlite3_column_int(pInfo, 1); 874 const char *zColl = (const char*)sqlite3_column_text(pInfo, 4); 875 876 if( iIdx<nEq ){ 877 for(pIter=pEq; pIter; pIter=pIter->pLink){ 878 if( pIter->bFlag ) continue; 879 if( pIter->iCol!=iCol ) continue; 880 if( sqlite3_stricmp(pIter->zColl, zColl) ) continue; 881 pIter->bFlag = 1; 882 break; 883 } 884 if( pIter==0 ){ 885 bMatch = 0; 886 break; 887 } 888 }else{ 889 if( pT ){ 890 if( pT->iCol!=iCol || sqlite3_stricmp(pT->zColl, zColl) ){ 891 bMatch = 0; 892 break; 893 } 894 pT = pT->pLink; 895 } 896 } 897 } 898 idxFinalize(&rc, pInfo); 899 900 if( rc==SQLITE_OK && bMatch ){ 901 sqlite3_finalize(pIdxList); 902 return 1; 903 } 904 } 905 idxFinalize(&rc, pIdxList); 906 907 *pRc = rc; 908 return 0; 909 } 910 911 static int idxCreateFromCons( 912 sqlite3expert *p, 913 IdxScan *pScan, 914 IdxConstraint *pEq, 915 IdxConstraint *pTail 916 ){ 917 sqlite3 *dbm = p->dbm; 918 int rc = SQLITE_OK; 919 if( (pEq || pTail) && 0==idxFindCompatible(&rc, dbm, pScan, pEq, pTail) ){ 920 IdxTable *pTab = pScan->pTab; 921 char *zCols = 0; 922 char *zIdx = 0; 923 IdxConstraint *pCons; 924 unsigned int h = 0; 925 const char *zFmt; 926 927 for(pCons=pEq; pCons; pCons=pCons->pLink){ 928 zCols = idxAppendColDefn(&rc, zCols, pTab, pCons); 929 } 930 for(pCons=pTail; pCons; pCons=pCons->pLink){ 931 zCols = idxAppendColDefn(&rc, zCols, pTab, pCons); 932 } 933 934 if( rc==SQLITE_OK ){ 935 /* Hash the list of columns to come up with a name for the index */ 936 const char *zTable = pScan->pTab->zName; 937 char *zName; /* Index name */ 938 int i; 939 for(i=0; zCols[i]; i++){ 940 h += ((h<<3) + zCols[i]); 941 } 942 zName = sqlite3_mprintf("%s_idx_%08x", zTable, h); 943 if( zName==0 ){ 944 rc = SQLITE_NOMEM; 945 }else{ 946 if( idxIdentifierRequiresQuotes(zTable) ){ 947 zFmt = "CREATE INDEX '%q' ON %Q(%s)"; 948 }else{ 949 zFmt = "CREATE INDEX %s ON %s(%s)"; 950 } 951 zIdx = sqlite3_mprintf(zFmt, zName, zTable, zCols); 952 if( !zIdx ){ 953 rc = SQLITE_NOMEM; 954 }else{ 955 rc = sqlite3_exec(dbm, zIdx, 0, 0, p->pzErrmsg); 956 idxHashAdd(&rc, &p->hIdx, zName, zIdx); 957 } 958 sqlite3_free(zName); 959 sqlite3_free(zIdx); 960 } 961 } 962 963 sqlite3_free(zCols); 964 } 965 return rc; 966 } 967 968 /* 969 ** Return true if list pList (linked by IdxConstraint.pLink) contains 970 ** a constraint compatible with *p. Otherwise return false. 971 */ 972 static int idxFindConstraint(IdxConstraint *pList, IdxConstraint *p){ 973 IdxConstraint *pCmp; 974 for(pCmp=pList; pCmp; pCmp=pCmp->pLink){ 975 if( p->iCol==pCmp->iCol ) return 1; 976 } 977 return 0; 978 } 979 980 static int idxCreateFromWhere( 981 sqlite3expert *p, 982 IdxScan *pScan, /* Create indexes for this scan */ 983 IdxConstraint *pTail /* range/ORDER BY constraints for inclusion */ 984 ){ 985 IdxConstraint *p1 = 0; 986 IdxConstraint *pCon; 987 int rc; 988 989 /* Gather up all the == constraints. */ 990 for(pCon=pScan->pEq; pCon; pCon=pCon->pNext){ 991 if( !idxFindConstraint(p1, pCon) && !idxFindConstraint(pTail, pCon) ){ 992 pCon->pLink = p1; 993 p1 = pCon; 994 } 995 } 996 997 /* Create an index using the == constraints collected above. And the 998 ** range constraint/ORDER BY terms passed in by the caller, if any. */ 999 rc = idxCreateFromCons(p, pScan, p1, pTail); 1000 1001 /* If no range/ORDER BY passed by the caller, create a version of the 1002 ** index for each range constraint. */ 1003 if( pTail==0 ){ 1004 for(pCon=pScan->pRange; rc==SQLITE_OK && pCon; pCon=pCon->pNext){ 1005 assert( pCon->pLink==0 ); 1006 if( !idxFindConstraint(p1, pCon) && !idxFindConstraint(pTail, pCon) ){ 1007 rc = idxCreateFromCons(p, pScan, p1, pCon); 1008 } 1009 } 1010 } 1011 1012 return rc; 1013 } 1014 1015 /* 1016 ** Create candidate indexes in database [dbm] based on the data in 1017 ** linked-list pScan. 1018 */ 1019 static int idxCreateCandidates(sqlite3expert *p){ 1020 int rc = SQLITE_OK; 1021 IdxScan *pIter; 1022 1023 for(pIter=p->pScan; pIter && rc==SQLITE_OK; pIter=pIter->pNextScan){ 1024 rc = idxCreateFromWhere(p, pIter, 0); 1025 if( rc==SQLITE_OK && pIter->pOrder ){ 1026 rc = idxCreateFromWhere(p, pIter, pIter->pOrder); 1027 } 1028 } 1029 1030 return rc; 1031 } 1032 1033 /* 1034 ** Free all elements of the linked list starting at pConstraint. 1035 */ 1036 static void idxConstraintFree(IdxConstraint *pConstraint){ 1037 IdxConstraint *pNext; 1038 IdxConstraint *p; 1039 1040 for(p=pConstraint; p; p=pNext){ 1041 pNext = p->pNext; 1042 sqlite3_free(p); 1043 } 1044 } 1045 1046 /* 1047 ** Free all elements of the linked list starting from pScan up until pLast 1048 ** (pLast is not freed). 1049 */ 1050 static void idxScanFree(IdxScan *pScan, IdxScan *pLast){ 1051 IdxScan *p; 1052 IdxScan *pNext; 1053 for(p=pScan; p!=pLast; p=pNext){ 1054 pNext = p->pNextScan; 1055 idxConstraintFree(p->pOrder); 1056 idxConstraintFree(p->pEq); 1057 idxConstraintFree(p->pRange); 1058 sqlite3_free(p); 1059 } 1060 } 1061 1062 /* 1063 ** Free all elements of the linked list starting from pStatement up 1064 ** until pLast (pLast is not freed). 1065 */ 1066 static void idxStatementFree(IdxStatement *pStatement, IdxStatement *pLast){ 1067 IdxStatement *p; 1068 IdxStatement *pNext; 1069 for(p=pStatement; p!=pLast; p=pNext){ 1070 pNext = p->pNext; 1071 sqlite3_free(p->zEQP); 1072 sqlite3_free(p->zIdx); 1073 sqlite3_free(p); 1074 } 1075 } 1076 1077 /* 1078 ** Free the linked list of IdxTable objects starting at pTab. 1079 */ 1080 static void idxTableFree(IdxTable *pTab){ 1081 IdxTable *pIter; 1082 IdxTable *pNext; 1083 for(pIter=pTab; pIter; pIter=pNext){ 1084 pNext = pIter->pNext; 1085 sqlite3_free(pIter); 1086 } 1087 } 1088 1089 /* 1090 ** Free the linked list of IdxWrite objects starting at pTab. 1091 */ 1092 static void idxWriteFree(IdxWrite *pTab){ 1093 IdxWrite *pIter; 1094 IdxWrite *pNext; 1095 for(pIter=pTab; pIter; pIter=pNext){ 1096 pNext = pIter->pNext; 1097 sqlite3_free(pIter); 1098 } 1099 } 1100 1101 1102 1103 /* 1104 ** This function is called after candidate indexes have been created. It 1105 ** runs all the queries to see which indexes they prefer, and populates 1106 ** IdxStatement.zIdx and IdxStatement.zEQP with the results. 1107 */ 1108 int idxFindIndexes( 1109 sqlite3expert *p, 1110 char **pzErr /* OUT: Error message (sqlite3_malloc) */ 1111 ){ 1112 IdxStatement *pStmt; 1113 sqlite3 *dbm = p->dbm; 1114 int rc = SQLITE_OK; 1115 1116 IdxHash hIdx; 1117 idxHashInit(&hIdx); 1118 1119 for(pStmt=p->pStatement; rc==SQLITE_OK && pStmt; pStmt=pStmt->pNext){ 1120 IdxHashEntry *pEntry; 1121 sqlite3_stmt *pExplain = 0; 1122 idxHashClear(&hIdx); 1123 rc = idxPrintfPrepareStmt(dbm, &pExplain, pzErr, 1124 "EXPLAIN QUERY PLAN %s", pStmt->zSql 1125 ); 1126 while( rc==SQLITE_OK && sqlite3_step(pExplain)==SQLITE_ROW ){ 1127 /* int iId = sqlite3_column_int(pExplain, 0); */ 1128 /* int iParent = sqlite3_column_int(pExplain, 1); */ 1129 /* int iNotUsed = sqlite3_column_int(pExplain, 2); */ 1130 const char *zDetail = (const char*)sqlite3_column_text(pExplain, 3); 1131 int nDetail; 1132 int i; 1133 1134 if( !zDetail ) continue; 1135 nDetail = STRLEN(zDetail); 1136 1137 for(i=0; i<nDetail; i++){ 1138 const char *zIdx = 0; 1139 if( i+13<nDetail && memcmp(&zDetail[i], " USING INDEX ", 13)==0 ){ 1140 zIdx = &zDetail[i+13]; 1141 }else if( i+22<nDetail 1142 && memcmp(&zDetail[i], " USING COVERING INDEX ", 22)==0 1143 ){ 1144 zIdx = &zDetail[i+22]; 1145 } 1146 if( zIdx ){ 1147 const char *zSql; 1148 int nIdx = 0; 1149 while( zIdx[nIdx]!='\0' && (zIdx[nIdx]!=' ' || zIdx[nIdx+1]!='(') ){ 1150 nIdx++; 1151 } 1152 zSql = idxHashSearch(&p->hIdx, zIdx, nIdx); 1153 if( zSql ){ 1154 idxHashAdd(&rc, &hIdx, zSql, 0); 1155 if( rc ) goto find_indexes_out; 1156 } 1157 break; 1158 } 1159 } 1160 1161 if( zDetail[0]!='-' ){ 1162 pStmt->zEQP = idxAppendText(&rc, pStmt->zEQP, "%s\n", zDetail); 1163 } 1164 } 1165 1166 for(pEntry=hIdx.pFirst; pEntry; pEntry=pEntry->pNext){ 1167 pStmt->zIdx = idxAppendText(&rc, pStmt->zIdx, "%s;\n", pEntry->zKey); 1168 } 1169 1170 idxFinalize(&rc, pExplain); 1171 } 1172 1173 find_indexes_out: 1174 idxHashClear(&hIdx); 1175 return rc; 1176 } 1177 1178 static int idxAuthCallback( 1179 void *pCtx, 1180 int eOp, 1181 const char *z3, 1182 const char *z4, 1183 const char *zDb, 1184 const char *zTrigger 1185 ){ 1186 int rc = SQLITE_OK; 1187 (void)z4; 1188 (void)zTrigger; 1189 if( eOp==SQLITE_INSERT || eOp==SQLITE_UPDATE || eOp==SQLITE_DELETE ){ 1190 if( sqlite3_stricmp(zDb, "main")==0 ){ 1191 sqlite3expert *p = (sqlite3expert*)pCtx; 1192 IdxTable *pTab; 1193 for(pTab=p->pTable; pTab; pTab=pTab->pNext){ 1194 if( 0==sqlite3_stricmp(z3, pTab->zName) ) break; 1195 } 1196 if( pTab ){ 1197 IdxWrite *pWrite; 1198 for(pWrite=p->pWrite; pWrite; pWrite=pWrite->pNext){ 1199 if( pWrite->pTab==pTab && pWrite->eOp==eOp ) break; 1200 } 1201 if( pWrite==0 ){ 1202 pWrite = idxMalloc(&rc, sizeof(IdxWrite)); 1203 if( rc==SQLITE_OK ){ 1204 pWrite->pTab = pTab; 1205 pWrite->eOp = eOp; 1206 pWrite->pNext = p->pWrite; 1207 p->pWrite = pWrite; 1208 } 1209 } 1210 } 1211 } 1212 } 1213 return rc; 1214 } 1215 1216 static int idxProcessOneTrigger( 1217 sqlite3expert *p, 1218 IdxWrite *pWrite, 1219 char **pzErr 1220 ){ 1221 static const char *zInt = UNIQUE_TABLE_NAME; 1222 static const char *zDrop = "DROP TABLE " UNIQUE_TABLE_NAME; 1223 IdxTable *pTab = pWrite->pTab; 1224 const char *zTab = pTab->zName; 1225 const char *zSql = 1226 "SELECT 'CREATE TEMP' || substr(sql, 7) FROM sqlite_master " 1227 "WHERE tbl_name = %Q AND type IN ('table', 'trigger') " 1228 "ORDER BY type;"; 1229 sqlite3_stmt *pSelect = 0; 1230 int rc = SQLITE_OK; 1231 char *zWrite = 0; 1232 1233 /* Create the table and its triggers in the temp schema */ 1234 rc = idxPrintfPrepareStmt(p->db, &pSelect, pzErr, zSql, zTab, zTab); 1235 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pSelect) ){ 1236 const char *zCreate = (const char*)sqlite3_column_text(pSelect, 0); 1237 rc = sqlite3_exec(p->dbv, zCreate, 0, 0, pzErr); 1238 } 1239 idxFinalize(&rc, pSelect); 1240 1241 /* Rename the table in the temp schema to zInt */ 1242 if( rc==SQLITE_OK ){ 1243 char *z = sqlite3_mprintf("ALTER TABLE temp.%Q RENAME TO %Q", zTab, zInt); 1244 if( z==0 ){ 1245 rc = SQLITE_NOMEM; 1246 }else{ 1247 rc = sqlite3_exec(p->dbv, z, 0, 0, pzErr); 1248 sqlite3_free(z); 1249 } 1250 } 1251 1252 switch( pWrite->eOp ){ 1253 case SQLITE_INSERT: { 1254 int i; 1255 zWrite = idxAppendText(&rc, zWrite, "INSERT INTO %Q VALUES(", zInt); 1256 for(i=0; i<pTab->nCol; i++){ 1257 zWrite = idxAppendText(&rc, zWrite, "%s?", i==0 ? "" : ", "); 1258 } 1259 zWrite = idxAppendText(&rc, zWrite, ")"); 1260 break; 1261 } 1262 case SQLITE_UPDATE: { 1263 int i; 1264 zWrite = idxAppendText(&rc, zWrite, "UPDATE %Q SET ", zInt); 1265 for(i=0; i<pTab->nCol; i++){ 1266 zWrite = idxAppendText(&rc, zWrite, "%s%Q=?", i==0 ? "" : ", ", 1267 pTab->aCol[i].zName 1268 ); 1269 } 1270 break; 1271 } 1272 default: { 1273 assert( pWrite->eOp==SQLITE_DELETE ); 1274 if( rc==SQLITE_OK ){ 1275 zWrite = sqlite3_mprintf("DELETE FROM %Q", zInt); 1276 if( zWrite==0 ) rc = SQLITE_NOMEM; 1277 } 1278 } 1279 } 1280 1281 if( rc==SQLITE_OK ){ 1282 sqlite3_stmt *pX = 0; 1283 rc = sqlite3_prepare_v2(p->dbv, zWrite, -1, &pX, 0); 1284 idxFinalize(&rc, pX); 1285 if( rc!=SQLITE_OK ){ 1286 idxDatabaseError(p->dbv, pzErr); 1287 } 1288 } 1289 sqlite3_free(zWrite); 1290 1291 if( rc==SQLITE_OK ){ 1292 rc = sqlite3_exec(p->dbv, zDrop, 0, 0, pzErr); 1293 } 1294 1295 return rc; 1296 } 1297 1298 static int idxProcessTriggers(sqlite3expert *p, char **pzErr){ 1299 int rc = SQLITE_OK; 1300 IdxWrite *pEnd = 0; 1301 IdxWrite *pFirst = p->pWrite; 1302 1303 while( rc==SQLITE_OK && pFirst!=pEnd ){ 1304 IdxWrite *pIter; 1305 for(pIter=pFirst; rc==SQLITE_OK && pIter!=pEnd; pIter=pIter->pNext){ 1306 rc = idxProcessOneTrigger(p, pIter, pzErr); 1307 } 1308 pEnd = pFirst; 1309 pFirst = p->pWrite; 1310 } 1311 1312 return rc; 1313 } 1314 1315 1316 static int idxCreateVtabSchema(sqlite3expert *p, char **pzErrmsg){ 1317 int rc = idxRegisterVtab(p); 1318 sqlite3_stmt *pSchema = 0; 1319 1320 /* For each table in the main db schema: 1321 ** 1322 ** 1) Add an entry to the p->pTable list, and 1323 ** 2) Create the equivalent virtual table in dbv. 1324 */ 1325 rc = idxPrepareStmt(p->db, &pSchema, pzErrmsg, 1326 "SELECT type, name, sql, 1 FROM sqlite_master " 1327 "WHERE type IN ('table','view') AND name NOT LIKE 'sqlite_%%' " 1328 " UNION ALL " 1329 "SELECT type, name, sql, 2 FROM sqlite_master " 1330 "WHERE type = 'trigger'" 1331 " AND tbl_name IN(SELECT name FROM sqlite_master WHERE type = 'view') " 1332 "ORDER BY 4, 1" 1333 ); 1334 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pSchema) ){ 1335 const char *zType = (const char*)sqlite3_column_text(pSchema, 0); 1336 const char *zName = (const char*)sqlite3_column_text(pSchema, 1); 1337 const char *zSql = (const char*)sqlite3_column_text(pSchema, 2); 1338 1339 if( zType[0]=='v' || zType[1]=='r' ){ 1340 rc = sqlite3_exec(p->dbv, zSql, 0, 0, pzErrmsg); 1341 }else{ 1342 IdxTable *pTab; 1343 rc = idxGetTableInfo(p->db, zName, &pTab, pzErrmsg); 1344 if( rc==SQLITE_OK ){ 1345 int i; 1346 char *zInner = 0; 1347 char *zOuter = 0; 1348 pTab->pNext = p->pTable; 1349 p->pTable = pTab; 1350 1351 /* The statement the vtab will pass to sqlite3_declare_vtab() */ 1352 zInner = idxAppendText(&rc, 0, "CREATE TABLE x("); 1353 for(i=0; i<pTab->nCol; i++){ 1354 zInner = idxAppendText(&rc, zInner, "%s%Q COLLATE %s", 1355 (i==0 ? "" : ", "), pTab->aCol[i].zName, pTab->aCol[i].zColl 1356 ); 1357 } 1358 zInner = idxAppendText(&rc, zInner, ")"); 1359 1360 /* The CVT statement to create the vtab */ 1361 zOuter = idxAppendText(&rc, 0, 1362 "CREATE VIRTUAL TABLE %Q USING expert(%Q)", zName, zInner 1363 ); 1364 if( rc==SQLITE_OK ){ 1365 rc = sqlite3_exec(p->dbv, zOuter, 0, 0, pzErrmsg); 1366 } 1367 sqlite3_free(zInner); 1368 sqlite3_free(zOuter); 1369 } 1370 } 1371 } 1372 idxFinalize(&rc, pSchema); 1373 return rc; 1374 } 1375 1376 struct IdxSampleCtx { 1377 int iTarget; 1378 double target; /* Target nRet/nRow value */ 1379 double nRow; /* Number of rows seen */ 1380 double nRet; /* Number of rows returned */ 1381 }; 1382 1383 static void idxSampleFunc( 1384 sqlite3_context *pCtx, 1385 int argc, 1386 sqlite3_value **argv 1387 ){ 1388 struct IdxSampleCtx *p = (struct IdxSampleCtx*)sqlite3_user_data(pCtx); 1389 int bRet; 1390 1391 (void)argv; 1392 assert( argc==0 ); 1393 if( p->nRow==0.0 ){ 1394 bRet = 1; 1395 }else{ 1396 bRet = (p->nRet / p->nRow) <= p->target; 1397 if( bRet==0 ){ 1398 unsigned short rnd; 1399 sqlite3_randomness(2, (void*)&rnd); 1400 bRet = ((int)rnd % 100) <= p->iTarget; 1401 } 1402 } 1403 1404 sqlite3_result_int(pCtx, bRet); 1405 p->nRow += 1.0; 1406 p->nRet += (double)bRet; 1407 } 1408 1409 struct IdxRemCtx { 1410 int nSlot; 1411 struct IdxRemSlot { 1412 int eType; /* SQLITE_NULL, INTEGER, REAL, TEXT, BLOB */ 1413 i64 iVal; /* SQLITE_INTEGER value */ 1414 double rVal; /* SQLITE_FLOAT value */ 1415 int nByte; /* Bytes of space allocated at z */ 1416 int n; /* Size of buffer z */ 1417 char *z; /* SQLITE_TEXT/BLOB value */ 1418 } aSlot[1]; 1419 }; 1420 1421 /* 1422 ** Implementation of scalar function rem(). 1423 */ 1424 static void idxRemFunc( 1425 sqlite3_context *pCtx, 1426 int argc, 1427 sqlite3_value **argv 1428 ){ 1429 struct IdxRemCtx *p = (struct IdxRemCtx*)sqlite3_user_data(pCtx); 1430 struct IdxRemSlot *pSlot; 1431 int iSlot; 1432 assert( argc==2 ); 1433 1434 iSlot = sqlite3_value_int(argv[0]); 1435 assert( iSlot<=p->nSlot ); 1436 pSlot = &p->aSlot[iSlot]; 1437 1438 switch( pSlot->eType ){ 1439 case SQLITE_NULL: 1440 /* no-op */ 1441 break; 1442 1443 case SQLITE_INTEGER: 1444 sqlite3_result_int64(pCtx, pSlot->iVal); 1445 break; 1446 1447 case SQLITE_FLOAT: 1448 sqlite3_result_double(pCtx, pSlot->rVal); 1449 break; 1450 1451 case SQLITE_BLOB: 1452 sqlite3_result_blob(pCtx, pSlot->z, pSlot->n, SQLITE_TRANSIENT); 1453 break; 1454 1455 case SQLITE_TEXT: 1456 sqlite3_result_text(pCtx, pSlot->z, pSlot->n, SQLITE_TRANSIENT); 1457 break; 1458 } 1459 1460 pSlot->eType = sqlite3_value_type(argv[1]); 1461 switch( pSlot->eType ){ 1462 case SQLITE_NULL: 1463 /* no-op */ 1464 break; 1465 1466 case SQLITE_INTEGER: 1467 pSlot->iVal = sqlite3_value_int64(argv[1]); 1468 break; 1469 1470 case SQLITE_FLOAT: 1471 pSlot->rVal = sqlite3_value_double(argv[1]); 1472 break; 1473 1474 case SQLITE_BLOB: 1475 case SQLITE_TEXT: { 1476 int nByte = sqlite3_value_bytes(argv[1]); 1477 if( nByte>pSlot->nByte ){ 1478 char *zNew = (char*)sqlite3_realloc(pSlot->z, nByte*2); 1479 if( zNew==0 ){ 1480 sqlite3_result_error_nomem(pCtx); 1481 return; 1482 } 1483 pSlot->nByte = nByte*2; 1484 pSlot->z = zNew; 1485 } 1486 pSlot->n = nByte; 1487 if( pSlot->eType==SQLITE_BLOB ){ 1488 memcpy(pSlot->z, sqlite3_value_blob(argv[1]), nByte); 1489 }else{ 1490 memcpy(pSlot->z, sqlite3_value_text(argv[1]), nByte); 1491 } 1492 break; 1493 } 1494 } 1495 } 1496 1497 static int idxLargestIndex(sqlite3 *db, int *pnMax, char **pzErr){ 1498 int rc = SQLITE_OK; 1499 const char *zMax = 1500 "SELECT max(i.seqno) FROM " 1501 " sqlite_master AS s, " 1502 " pragma_index_list(s.name) AS l, " 1503 " pragma_index_info(l.name) AS i " 1504 "WHERE s.type = 'table'"; 1505 sqlite3_stmt *pMax = 0; 1506 1507 *pnMax = 0; 1508 rc = idxPrepareStmt(db, &pMax, pzErr, zMax); 1509 if( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pMax) ){ 1510 *pnMax = sqlite3_column_int(pMax, 0) + 1; 1511 } 1512 idxFinalize(&rc, pMax); 1513 1514 return rc; 1515 } 1516 1517 static int idxPopulateOneStat1( 1518 sqlite3expert *p, 1519 sqlite3_stmt *pIndexXInfo, 1520 sqlite3_stmt *pWriteStat, 1521 const char *zTab, 1522 const char *zIdx, 1523 char **pzErr 1524 ){ 1525 char *zCols = 0; 1526 char *zOrder = 0; 1527 char *zQuery = 0; 1528 int nCol = 0; 1529 int i; 1530 sqlite3_stmt *pQuery = 0; 1531 int *aStat = 0; 1532 int rc = SQLITE_OK; 1533 1534 assert( p->iSample>0 ); 1535 1536 /* Formulate the query text */ 1537 sqlite3_bind_text(pIndexXInfo, 1, zIdx, -1, SQLITE_STATIC); 1538 while( SQLITE_OK==rc && SQLITE_ROW==sqlite3_step(pIndexXInfo) ){ 1539 const char *zComma = zCols==0 ? "" : ", "; 1540 const char *zName = (const char*)sqlite3_column_text(pIndexXInfo, 0); 1541 const char *zColl = (const char*)sqlite3_column_text(pIndexXInfo, 1); 1542 zCols = idxAppendText(&rc, zCols, 1543 "%sx.%Q IS rem(%d, x.%Q) COLLATE %s", zComma, zName, nCol, zName, zColl 1544 ); 1545 zOrder = idxAppendText(&rc, zOrder, "%s%d", zComma, ++nCol); 1546 } 1547 sqlite3_reset(pIndexXInfo); 1548 if( rc==SQLITE_OK ){ 1549 if( p->iSample==100 ){ 1550 zQuery = sqlite3_mprintf( 1551 "SELECT %s FROM %Q x ORDER BY %s", zCols, zTab, zOrder 1552 ); 1553 }else{ 1554 zQuery = sqlite3_mprintf( 1555 "SELECT %s FROM temp."UNIQUE_TABLE_NAME" x ORDER BY %s", zCols, zOrder 1556 ); 1557 } 1558 } 1559 sqlite3_free(zCols); 1560 sqlite3_free(zOrder); 1561 1562 /* Formulate the query text */ 1563 if( rc==SQLITE_OK ){ 1564 sqlite3 *dbrem = (p->iSample==100 ? p->db : p->dbv); 1565 rc = idxPrepareStmt(dbrem, &pQuery, pzErr, zQuery); 1566 } 1567 sqlite3_free(zQuery); 1568 1569 if( rc==SQLITE_OK ){ 1570 aStat = (int*)idxMalloc(&rc, sizeof(int)*(nCol+1)); 1571 } 1572 if( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pQuery) ){ 1573 IdxHashEntry *pEntry; 1574 char *zStat = 0; 1575 for(i=0; i<=nCol; i++) aStat[i] = 1; 1576 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pQuery) ){ 1577 aStat[0]++; 1578 for(i=0; i<nCol; i++){ 1579 if( sqlite3_column_int(pQuery, i)==0 ) break; 1580 } 1581 for(/*no-op*/; i<nCol; i++){ 1582 aStat[i+1]++; 1583 } 1584 } 1585 1586 if( rc==SQLITE_OK ){ 1587 int s0 = aStat[0]; 1588 zStat = sqlite3_mprintf("%d", s0); 1589 if( zStat==0 ) rc = SQLITE_NOMEM; 1590 for(i=1; rc==SQLITE_OK && i<=nCol; i++){ 1591 zStat = idxAppendText(&rc, zStat, " %d", (s0+aStat[i]/2) / aStat[i]); 1592 } 1593 } 1594 1595 if( rc==SQLITE_OK ){ 1596 sqlite3_bind_text(pWriteStat, 1, zTab, -1, SQLITE_STATIC); 1597 sqlite3_bind_text(pWriteStat, 2, zIdx, -1, SQLITE_STATIC); 1598 sqlite3_bind_text(pWriteStat, 3, zStat, -1, SQLITE_STATIC); 1599 sqlite3_step(pWriteStat); 1600 rc = sqlite3_reset(pWriteStat); 1601 } 1602 1603 pEntry = idxHashFind(&p->hIdx, zIdx, STRLEN(zIdx)); 1604 if( pEntry ){ 1605 assert( pEntry->zVal2==0 ); 1606 pEntry->zVal2 = zStat; 1607 }else{ 1608 sqlite3_free(zStat); 1609 } 1610 } 1611 sqlite3_free(aStat); 1612 idxFinalize(&rc, pQuery); 1613 1614 return rc; 1615 } 1616 1617 static int idxBuildSampleTable(sqlite3expert *p, const char *zTab){ 1618 int rc; 1619 char *zSql; 1620 1621 rc = sqlite3_exec(p->dbv,"DROP TABLE IF EXISTS temp."UNIQUE_TABLE_NAME,0,0,0); 1622 if( rc!=SQLITE_OK ) return rc; 1623 1624 zSql = sqlite3_mprintf( 1625 "CREATE TABLE temp." UNIQUE_TABLE_NAME " AS SELECT * FROM %Q", zTab 1626 ); 1627 if( zSql==0 ) return SQLITE_NOMEM; 1628 rc = sqlite3_exec(p->dbv, zSql, 0, 0, 0); 1629 sqlite3_free(zSql); 1630 1631 return rc; 1632 } 1633 1634 /* 1635 ** This function is called as part of sqlite3_expert_analyze(). Candidate 1636 ** indexes have already been created in database sqlite3expert.dbm, this 1637 ** function populates sqlite_stat1 table in the same database. 1638 ** 1639 ** The stat1 data is generated by querying the 1640 */ 1641 static int idxPopulateStat1(sqlite3expert *p, char **pzErr){ 1642 int rc = SQLITE_OK; 1643 int nMax =0; 1644 struct IdxRemCtx *pCtx = 0; 1645 struct IdxSampleCtx samplectx; 1646 int i; 1647 i64 iPrev = -100000; 1648 sqlite3_stmt *pAllIndex = 0; 1649 sqlite3_stmt *pIndexXInfo = 0; 1650 sqlite3_stmt *pWrite = 0; 1651 1652 const char *zAllIndex = 1653 "SELECT s.rowid, s.name, l.name FROM " 1654 " sqlite_master AS s, " 1655 " pragma_index_list(s.name) AS l " 1656 "WHERE s.type = 'table'"; 1657 const char *zIndexXInfo = 1658 "SELECT name, coll FROM pragma_index_xinfo(?) WHERE key"; 1659 const char *zWrite = "INSERT INTO sqlite_stat1 VALUES(?, ?, ?)"; 1660 1661 /* If iSample==0, no sqlite_stat1 data is required. */ 1662 if( p->iSample==0 ) return SQLITE_OK; 1663 1664 rc = idxLargestIndex(p->dbm, &nMax, pzErr); 1665 if( nMax<=0 || rc!=SQLITE_OK ) return rc; 1666 1667 rc = sqlite3_exec(p->dbm, "ANALYZE; PRAGMA writable_schema=1", 0, 0, 0); 1668 1669 if( rc==SQLITE_OK ){ 1670 int nByte = sizeof(struct IdxRemCtx) + (sizeof(struct IdxRemSlot) * nMax); 1671 pCtx = (struct IdxRemCtx*)idxMalloc(&rc, nByte); 1672 } 1673 1674 if( rc==SQLITE_OK ){ 1675 sqlite3 *dbrem = (p->iSample==100 ? p->db : p->dbv); 1676 rc = sqlite3_create_function( 1677 dbrem, "rem", 2, SQLITE_UTF8, (void*)pCtx, idxRemFunc, 0, 0 1678 ); 1679 } 1680 if( rc==SQLITE_OK ){ 1681 rc = sqlite3_create_function( 1682 p->db, "sample", 0, SQLITE_UTF8, (void*)&samplectx, idxSampleFunc, 0, 0 1683 ); 1684 } 1685 1686 if( rc==SQLITE_OK ){ 1687 pCtx->nSlot = nMax+1; 1688 rc = idxPrepareStmt(p->dbm, &pAllIndex, pzErr, zAllIndex); 1689 } 1690 if( rc==SQLITE_OK ){ 1691 rc = idxPrepareStmt(p->dbm, &pIndexXInfo, pzErr, zIndexXInfo); 1692 } 1693 if( rc==SQLITE_OK ){ 1694 rc = idxPrepareStmt(p->dbm, &pWrite, pzErr, zWrite); 1695 } 1696 1697 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pAllIndex) ){ 1698 i64 iRowid = sqlite3_column_int64(pAllIndex, 0); 1699 const char *zTab = (const char*)sqlite3_column_text(pAllIndex, 1); 1700 const char *zIdx = (const char*)sqlite3_column_text(pAllIndex, 2); 1701 if( p->iSample<100 && iPrev!=iRowid ){ 1702 samplectx.target = (double)p->iSample / 100.0; 1703 samplectx.iTarget = p->iSample; 1704 samplectx.nRow = 0.0; 1705 samplectx.nRet = 0.0; 1706 rc = idxBuildSampleTable(p, zTab); 1707 if( rc!=SQLITE_OK ) break; 1708 } 1709 rc = idxPopulateOneStat1(p, pIndexXInfo, pWrite, zTab, zIdx, pzErr); 1710 iPrev = iRowid; 1711 } 1712 if( rc==SQLITE_OK && p->iSample<100 ){ 1713 rc = sqlite3_exec(p->dbv, 1714 "DROP TABLE IF EXISTS temp." UNIQUE_TABLE_NAME, 0,0,0 1715 ); 1716 } 1717 1718 idxFinalize(&rc, pAllIndex); 1719 idxFinalize(&rc, pIndexXInfo); 1720 idxFinalize(&rc, pWrite); 1721 1722 for(i=0; i<pCtx->nSlot; i++){ 1723 sqlite3_free(pCtx->aSlot[i].z); 1724 } 1725 sqlite3_free(pCtx); 1726 1727 if( rc==SQLITE_OK ){ 1728 rc = sqlite3_exec(p->dbm, "ANALYZE sqlite_master", 0, 0, 0); 1729 } 1730 1731 sqlite3_exec(p->db, "DROP TABLE IF EXISTS temp."UNIQUE_TABLE_NAME,0,0,0); 1732 return rc; 1733 } 1734 1735 /* 1736 ** Allocate a new sqlite3expert object. 1737 */ 1738 sqlite3expert *sqlite3_expert_new(sqlite3 *db, char **pzErrmsg){ 1739 int rc = SQLITE_OK; 1740 sqlite3expert *pNew; 1741 1742 pNew = (sqlite3expert*)idxMalloc(&rc, sizeof(sqlite3expert)); 1743 1744 /* Open two in-memory databases to work with. The "vtab database" (dbv) 1745 ** will contain a virtual table corresponding to each real table in 1746 ** the user database schema, and a copy of each view. It is used to 1747 ** collect information regarding the WHERE, ORDER BY and other clauses 1748 ** of the user's query. 1749 */ 1750 if( rc==SQLITE_OK ){ 1751 pNew->db = db; 1752 pNew->iSample = 100; 1753 rc = sqlite3_open(":memory:", &pNew->dbv); 1754 } 1755 if( rc==SQLITE_OK ){ 1756 rc = sqlite3_open(":memory:", &pNew->dbm); 1757 if( rc==SQLITE_OK ){ 1758 sqlite3_db_config(pNew->dbm, SQLITE_DBCONFIG_TRIGGER_EQP, 1, (int*)0); 1759 } 1760 } 1761 1762 1763 /* Copy the entire schema of database [db] into [dbm]. */ 1764 if( rc==SQLITE_OK ){ 1765 sqlite3_stmt *pSql; 1766 rc = idxPrintfPrepareStmt(pNew->db, &pSql, pzErrmsg, 1767 "SELECT sql FROM sqlite_master WHERE name NOT LIKE 'sqlite_%%'" 1768 " AND sql NOT LIKE 'CREATE VIRTUAL %%'" 1769 ); 1770 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pSql) ){ 1771 const char *zSql = (const char*)sqlite3_column_text(pSql, 0); 1772 rc = sqlite3_exec(pNew->dbm, zSql, 0, 0, pzErrmsg); 1773 } 1774 idxFinalize(&rc, pSql); 1775 } 1776 1777 /* Create the vtab schema */ 1778 if( rc==SQLITE_OK ){ 1779 rc = idxCreateVtabSchema(pNew, pzErrmsg); 1780 } 1781 1782 /* Register the auth callback with dbv */ 1783 if( rc==SQLITE_OK ){ 1784 sqlite3_set_authorizer(pNew->dbv, idxAuthCallback, (void*)pNew); 1785 } 1786 1787 /* If an error has occurred, free the new object and reutrn NULL. Otherwise, 1788 ** return the new sqlite3expert handle. */ 1789 if( rc!=SQLITE_OK ){ 1790 sqlite3_expert_destroy(pNew); 1791 pNew = 0; 1792 } 1793 return pNew; 1794 } 1795 1796 /* 1797 ** Configure an sqlite3expert object. 1798 */ 1799 int sqlite3_expert_config(sqlite3expert *p, int op, ...){ 1800 int rc = SQLITE_OK; 1801 va_list ap; 1802 va_start(ap, op); 1803 switch( op ){ 1804 case EXPERT_CONFIG_SAMPLE: { 1805 int iVal = va_arg(ap, int); 1806 if( iVal<0 ) iVal = 0; 1807 if( iVal>100 ) iVal = 100; 1808 p->iSample = iVal; 1809 break; 1810 } 1811 default: 1812 rc = SQLITE_NOTFOUND; 1813 break; 1814 } 1815 1816 va_end(ap); 1817 return rc; 1818 } 1819 1820 /* 1821 ** Add an SQL statement to the analysis. 1822 */ 1823 int sqlite3_expert_sql( 1824 sqlite3expert *p, /* From sqlite3_expert_new() */ 1825 const char *zSql, /* SQL statement to add */ 1826 char **pzErr /* OUT: Error message (if any) */ 1827 ){ 1828 IdxScan *pScanOrig = p->pScan; 1829 IdxStatement *pStmtOrig = p->pStatement; 1830 int rc = SQLITE_OK; 1831 const char *zStmt = zSql; 1832 1833 if( p->bRun ) return SQLITE_MISUSE; 1834 1835 while( rc==SQLITE_OK && zStmt && zStmt[0] ){ 1836 sqlite3_stmt *pStmt = 0; 1837 rc = sqlite3_prepare_v2(p->dbv, zStmt, -1, &pStmt, &zStmt); 1838 if( rc==SQLITE_OK ){ 1839 if( pStmt ){ 1840 IdxStatement *pNew; 1841 const char *z = sqlite3_sql(pStmt); 1842 int n = STRLEN(z); 1843 pNew = (IdxStatement*)idxMalloc(&rc, sizeof(IdxStatement) + n+1); 1844 if( rc==SQLITE_OK ){ 1845 pNew->zSql = (char*)&pNew[1]; 1846 memcpy(pNew->zSql, z, n+1); 1847 pNew->pNext = p->pStatement; 1848 if( p->pStatement ) pNew->iId = p->pStatement->iId+1; 1849 p->pStatement = pNew; 1850 } 1851 sqlite3_finalize(pStmt); 1852 } 1853 }else{ 1854 idxDatabaseError(p->dbv, pzErr); 1855 } 1856 } 1857 1858 if( rc!=SQLITE_OK ){ 1859 idxScanFree(p->pScan, pScanOrig); 1860 idxStatementFree(p->pStatement, pStmtOrig); 1861 p->pScan = pScanOrig; 1862 p->pStatement = pStmtOrig; 1863 } 1864 1865 return rc; 1866 } 1867 1868 int sqlite3_expert_analyze(sqlite3expert *p, char **pzErr){ 1869 int rc; 1870 IdxHashEntry *pEntry; 1871 1872 /* Do trigger processing to collect any extra IdxScan structures */ 1873 rc = idxProcessTriggers(p, pzErr); 1874 1875 /* Create candidate indexes within the in-memory database file */ 1876 if( rc==SQLITE_OK ){ 1877 rc = idxCreateCandidates(p); 1878 } 1879 1880 /* Generate the stat1 data */ 1881 if( rc==SQLITE_OK ){ 1882 rc = idxPopulateStat1(p, pzErr); 1883 } 1884 1885 /* Formulate the EXPERT_REPORT_CANDIDATES text */ 1886 for(pEntry=p->hIdx.pFirst; pEntry; pEntry=pEntry->pNext){ 1887 p->zCandidates = idxAppendText(&rc, p->zCandidates, 1888 "%s;%s%s\n", pEntry->zVal, 1889 pEntry->zVal2 ? " -- stat1: " : "", pEntry->zVal2 1890 ); 1891 } 1892 1893 /* Figure out which of the candidate indexes are preferred by the query 1894 ** planner and report the results to the user. */ 1895 if( rc==SQLITE_OK ){ 1896 rc = idxFindIndexes(p, pzErr); 1897 } 1898 1899 if( rc==SQLITE_OK ){ 1900 p->bRun = 1; 1901 } 1902 return rc; 1903 } 1904 1905 /* 1906 ** Return the total number of statements that have been added to this 1907 ** sqlite3expert using sqlite3_expert_sql(). 1908 */ 1909 int sqlite3_expert_count(sqlite3expert *p){ 1910 int nRet = 0; 1911 if( p->pStatement ) nRet = p->pStatement->iId+1; 1912 return nRet; 1913 } 1914 1915 /* 1916 ** Return a component of the report. 1917 */ 1918 const char *sqlite3_expert_report(sqlite3expert *p, int iStmt, int eReport){ 1919 const char *zRet = 0; 1920 IdxStatement *pStmt; 1921 1922 if( p->bRun==0 ) return 0; 1923 for(pStmt=p->pStatement; pStmt && pStmt->iId!=iStmt; pStmt=pStmt->pNext); 1924 switch( eReport ){ 1925 case EXPERT_REPORT_SQL: 1926 if( pStmt ) zRet = pStmt->zSql; 1927 break; 1928 case EXPERT_REPORT_INDEXES: 1929 if( pStmt ) zRet = pStmt->zIdx; 1930 break; 1931 case EXPERT_REPORT_PLAN: 1932 if( pStmt ) zRet = pStmt->zEQP; 1933 break; 1934 case EXPERT_REPORT_CANDIDATES: 1935 zRet = p->zCandidates; 1936 break; 1937 } 1938 return zRet; 1939 } 1940 1941 /* 1942 ** Free an sqlite3expert object. 1943 */ 1944 void sqlite3_expert_destroy(sqlite3expert *p){ 1945 if( p ){ 1946 sqlite3_close(p->dbm); 1947 sqlite3_close(p->dbv); 1948 idxScanFree(p->pScan, 0); 1949 idxStatementFree(p->pStatement, 0); 1950 idxTableFree(p->pTable); 1951 idxWriteFree(p->pWrite); 1952 idxHashClear(&p->hIdx); 1953 sqlite3_free(p->zCandidates); 1954 sqlite3_free(p); 1955 } 1956 } 1957 1958 #endif /* ifndef SQLITE_OMIT_VIRTUALTABLE */ 1959