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