xref: /sqlite-3.40.0/src/callback.c (revision b0c4ef71)
1 /*
2 ** 2005 May 23
3 **
4 ** The author disclaims copyright to this source code.  In place of
5 ** a legal notice, here is a blessing:
6 **
7 **    May you do good and not evil.
8 **    May you find forgiveness for yourself and forgive others.
9 **    May you share freely, never taking more than you give.
10 **
11 *************************************************************************
12 **
13 ** This file contains functions used to access the internal hash tables
14 ** of user defined functions and collation sequences.
15 */
16 
17 #include "sqliteInt.h"
18 
19 /*
20 ** Invoke the 'collation needed' callback to request a collation sequence
21 ** in the encoding enc of name zName, length nName.
22 */
23 static void callCollNeeded(sqlite3 *db, int enc, const char *zName){
24   assert( !db->xCollNeeded || !db->xCollNeeded16 );
25   if( db->xCollNeeded ){
26     char *zExternal = sqlite3DbStrDup(db, zName);
27     if( !zExternal ) return;
28     db->xCollNeeded(db->pCollNeededArg, db, enc, zExternal);
29     sqlite3DbFree(db, zExternal);
30   }
31 #ifndef SQLITE_OMIT_UTF16
32   if( db->xCollNeeded16 ){
33     char const *zExternal;
34     sqlite3_value *pTmp = sqlite3ValueNew(db);
35     sqlite3ValueSetStr(pTmp, -1, zName, SQLITE_UTF8, SQLITE_STATIC);
36     zExternal = sqlite3ValueText(pTmp, SQLITE_UTF16NATIVE);
37     if( zExternal ){
38       db->xCollNeeded16(db->pCollNeededArg, db, (int)ENC(db), zExternal);
39     }
40     sqlite3ValueFree(pTmp);
41   }
42 #endif
43 }
44 
45 /*
46 ** This routine is called if the collation factory fails to deliver a
47 ** collation function in the best encoding but there may be other versions
48 ** of this collation function (for other text encodings) available. Use one
49 ** of these instead if they exist. Avoid a UTF-8 <-> UTF-16 conversion if
50 ** possible.
51 */
52 static int synthCollSeq(sqlite3 *db, CollSeq *pColl){
53   CollSeq *pColl2;
54   char *z = pColl->zName;
55   int i;
56   static const u8 aEnc[] = { SQLITE_UTF16BE, SQLITE_UTF16LE, SQLITE_UTF8 };
57   for(i=0; i<3; i++){
58     pColl2 = sqlite3FindCollSeq(db, aEnc[i], z, 0);
59     if( pColl2->xCmp!=0 ){
60       memcpy(pColl, pColl2, sizeof(CollSeq));
61       pColl->xDel = 0;         /* Do not copy the destructor */
62       return SQLITE_OK;
63     }
64   }
65   return SQLITE_ERROR;
66 }
67 
68 /*
69 ** This routine is called on a collation sequence before it is used to
70 ** check that it is defined. An undefined collation sequence exists when
71 ** a database is loaded that contains references to collation sequences
72 ** that have not been defined by sqlite3_create_collation() etc.
73 **
74 ** If required, this routine calls the 'collation needed' callback to
75 ** request a definition of the collating sequence. If this doesn't work,
76 ** an equivalent collating sequence that uses a text encoding different
77 ** from the main database is substituted, if one is available.
78 */
79 int sqlite3CheckCollSeq(Parse *pParse, CollSeq *pColl){
80   if( pColl && pColl->xCmp==0 ){
81     const char *zName = pColl->zName;
82     sqlite3 *db = pParse->db;
83     CollSeq *p = sqlite3GetCollSeq(pParse, ENC(db), pColl, zName);
84     if( !p ){
85       return SQLITE_ERROR;
86     }
87     assert( p==pColl );
88   }
89   return SQLITE_OK;
90 }
91 
92 
93 
94 /*
95 ** Locate and return an entry from the db.aCollSeq hash table. If the entry
96 ** specified by zName and nName is not found and parameter 'create' is
97 ** true, then create a new entry. Otherwise return NULL.
98 **
99 ** Each pointer stored in the sqlite3.aCollSeq hash table contains an
100 ** array of three CollSeq structures. The first is the collation sequence
101 ** preferred for UTF-8, the second UTF-16le, and the third UTF-16be.
102 **
103 ** Stored immediately after the three collation sequences is a copy of
104 ** the collation sequence name. A pointer to this string is stored in
105 ** each collation sequence structure.
106 */
107 static CollSeq *findCollSeqEntry(
108   sqlite3 *db,          /* Database connection */
109   const char *zName,    /* Name of the collating sequence */
110   int create            /* Create a new entry if true */
111 ){
112   CollSeq *pColl;
113   pColl = sqlite3HashFind(&db->aCollSeq, zName);
114 
115   if( 0==pColl && create ){
116     int nName = sqlite3Strlen30(zName) + 1;
117     pColl = sqlite3DbMallocZero(db, 3*sizeof(*pColl) + nName);
118     if( pColl ){
119       CollSeq *pDel = 0;
120       pColl[0].zName = (char*)&pColl[3];
121       pColl[0].enc = SQLITE_UTF8;
122       pColl[1].zName = (char*)&pColl[3];
123       pColl[1].enc = SQLITE_UTF16LE;
124       pColl[2].zName = (char*)&pColl[3];
125       pColl[2].enc = SQLITE_UTF16BE;
126       memcpy(pColl[0].zName, zName, nName);
127       pDel = sqlite3HashInsert(&db->aCollSeq, pColl[0].zName, pColl);
128 
129       /* If a malloc() failure occurred in sqlite3HashInsert(), it will
130       ** return the pColl pointer to be deleted (because it wasn't added
131       ** to the hash table).
132       */
133       assert( pDel==0 || pDel==pColl );
134       if( pDel!=0 ){
135         sqlite3OomFault(db);
136         sqlite3DbFree(db, pDel);
137         pColl = 0;
138       }
139     }
140   }
141   return pColl;
142 }
143 
144 /*
145 ** Parameter zName points to a UTF-8 encoded string nName bytes long.
146 ** Return the CollSeq* pointer for the collation sequence named zName
147 ** for the encoding 'enc' from the database 'db'.
148 **
149 ** If the entry specified is not found and 'create' is true, then create a
150 ** new entry.  Otherwise return NULL.
151 **
152 ** A separate function sqlite3LocateCollSeq() is a wrapper around
153 ** this routine.  sqlite3LocateCollSeq() invokes the collation factory
154 ** if necessary and generates an error message if the collating sequence
155 ** cannot be found.
156 **
157 ** See also: sqlite3LocateCollSeq(), sqlite3GetCollSeq()
158 */
159 CollSeq *sqlite3FindCollSeq(
160   sqlite3 *db,          /* Database connection to search */
161   u8 enc,               /* Desired text encoding */
162   const char *zName,    /* Name of the collating sequence.  Might be NULL */
163   int create            /* True to create CollSeq if doesn't already exist */
164 ){
165   CollSeq *pColl;
166   if( zName ){
167     pColl = findCollSeqEntry(db, zName, create);
168   }else{
169     pColl = db->pDfltColl;
170   }
171   assert( SQLITE_UTF8==1 && SQLITE_UTF16LE==2 && SQLITE_UTF16BE==3 );
172   assert( enc>=SQLITE_UTF8 && enc<=SQLITE_UTF16BE );
173   if( pColl ) pColl += enc-1;
174   return pColl;
175 }
176 
177 /*
178 ** This function is responsible for invoking the collation factory callback
179 ** or substituting a collation sequence of a different encoding when the
180 ** requested collation sequence is not available in the desired encoding.
181 **
182 ** If it is not NULL, then pColl must point to the database native encoding
183 ** collation sequence with name zName, length nName.
184 **
185 ** The return value is either the collation sequence to be used in database
186 ** db for collation type name zName, length nName, or NULL, if no collation
187 ** sequence can be found.  If no collation is found, leave an error message.
188 **
189 ** See also: sqlite3LocateCollSeq(), sqlite3FindCollSeq()
190 */
191 CollSeq *sqlite3GetCollSeq(
192   Parse *pParse,        /* Parsing context */
193   u8 enc,               /* The desired encoding for the collating sequence */
194   CollSeq *pColl,       /* Collating sequence with native encoding, or NULL */
195   const char *zName     /* Collating sequence name */
196 ){
197   CollSeq *p;
198   sqlite3 *db = pParse->db;
199 
200   p = pColl;
201   if( !p ){
202     p = sqlite3FindCollSeq(db, enc, zName, 0);
203   }
204   if( !p || !p->xCmp ){
205     /* No collation sequence of this type for this encoding is registered.
206     ** Call the collation factory to see if it can supply us with one.
207     */
208     callCollNeeded(db, enc, zName);
209     p = sqlite3FindCollSeq(db, enc, zName, 0);
210   }
211   if( p && !p->xCmp && synthCollSeq(db, p) ){
212     p = 0;
213   }
214   assert( !p || p->xCmp );
215   if( p==0 ){
216     sqlite3ErrorMsg(pParse, "no such collation sequence: %s", zName);
217     pParse->rc = SQLITE_ERROR_MISSING_COLLSEQ;
218   }
219   return p;
220 }
221 
222 /*
223 ** This function returns the collation sequence for database native text
224 ** encoding identified by the string zName.
225 **
226 ** If the requested collation sequence is not available, or not available
227 ** in the database native encoding, the collation factory is invoked to
228 ** request it. If the collation factory does not supply such a sequence,
229 ** and the sequence is available in another text encoding, then that is
230 ** returned instead.
231 **
232 ** If no versions of the requested collations sequence are available, or
233 ** another error occurs, NULL is returned and an error message written into
234 ** pParse.
235 **
236 ** This routine is a wrapper around sqlite3FindCollSeq().  This routine
237 ** invokes the collation factory if the named collation cannot be found
238 ** and generates an error message.
239 **
240 ** See also: sqlite3FindCollSeq(), sqlite3GetCollSeq()
241 */
242 CollSeq *sqlite3LocateCollSeq(Parse *pParse, const char *zName){
243   sqlite3 *db = pParse->db;
244   u8 enc = ENC(db);
245   u8 initbusy = db->init.busy;
246   CollSeq *pColl;
247 
248   pColl = sqlite3FindCollSeq(db, enc, zName, initbusy);
249   if( !initbusy && (!pColl || !pColl->xCmp) ){
250     pColl = sqlite3GetCollSeq(pParse, enc, pColl, zName);
251   }
252 
253   return pColl;
254 }
255 
256 /* During the search for the best function definition, this procedure
257 ** is called to test how well the function passed as the first argument
258 ** matches the request for a function with nArg arguments in a system
259 ** that uses encoding enc. The value returned indicates how well the
260 ** request is matched. A higher value indicates a better match.
261 **
262 ** If nArg is -1 that means to only return a match (non-zero) if p->nArg
263 ** is also -1.  In other words, we are searching for a function that
264 ** takes a variable number of arguments.
265 **
266 ** If nArg is -2 that means that we are searching for any function
267 ** regardless of the number of arguments it uses, so return a positive
268 ** match score for any
269 **
270 ** The returned value is always between 0 and 6, as follows:
271 **
272 ** 0: Not a match.
273 ** 1: UTF8/16 conversion required and function takes any number of arguments.
274 ** 2: UTF16 byte order change required and function takes any number of args.
275 ** 3: encoding matches and function takes any number of arguments
276 ** 4: UTF8/16 conversion required - argument count matches exactly
277 ** 5: UTF16 byte order conversion required - argument count matches exactly
278 ** 6: Perfect match:  encoding and argument count match exactly.
279 **
280 ** If nArg==(-2) then any function with a non-null xSFunc is
281 ** a perfect match and any function with xSFunc NULL is
282 ** a non-match.
283 */
284 #define FUNC_PERFECT_MATCH 6  /* The score for a perfect match */
285 static int matchQuality(
286   FuncDef *p,     /* The function we are evaluating for match quality */
287   int nArg,       /* Desired number of arguments.  (-1)==any */
288   u8 enc          /* Desired text encoding */
289 ){
290   int match;
291   assert( p->nArg>=-1 );
292 
293   /* Wrong number of arguments means "no match" */
294   if( p->nArg!=nArg ){
295     if( nArg==(-2) ) return (p->xSFunc==0) ? 0 : FUNC_PERFECT_MATCH;
296     if( p->nArg>=0 ) return 0;
297   }
298 
299   /* Give a better score to a function with a specific number of arguments
300   ** than to function that accepts any number of arguments. */
301   if( p->nArg==nArg ){
302     match = 4;
303   }else{
304     match = 1;
305   }
306 
307   /* Bonus points if the text encoding matches */
308   if( enc==(p->funcFlags & SQLITE_FUNC_ENCMASK) ){
309     match += 2;  /* Exact encoding match */
310   }else if( (enc & p->funcFlags & 2)!=0 ){
311     match += 1;  /* Both are UTF16, but with different byte orders */
312   }
313 
314   return match;
315 }
316 
317 /*
318 ** Search a FuncDefHash for a function with the given name.  Return
319 ** a pointer to the matching FuncDef if found, or 0 if there is no match.
320 */
321 FuncDef *sqlite3FunctionSearch(
322   int h,               /* Hash of the name */
323   const char *zFunc    /* Name of function */
324 ){
325   FuncDef *p;
326   for(p=sqlite3BuiltinFunctions.a[h]; p; p=p->u.pHash){
327     if( sqlite3StrICmp(p->zName, zFunc)==0 ){
328       return p;
329     }
330   }
331   return 0;
332 }
333 
334 /*
335 ** Insert a new FuncDef into a FuncDefHash hash table.
336 */
337 void sqlite3InsertBuiltinFuncs(
338   FuncDef *aDef,      /* List of global functions to be inserted */
339   int nDef            /* Length of the apDef[] list */
340 ){
341   int i;
342   for(i=0; i<nDef; i++){
343     FuncDef *pOther;
344     const char *zName = aDef[i].zName;
345     int nName = sqlite3Strlen30(zName);
346     int h = SQLITE_FUNC_HASH(zName[0], nName);
347     assert( zName[0]>='a' && zName[0]<='z' );
348     pOther = sqlite3FunctionSearch(h, zName);
349     if( pOther ){
350       assert( pOther!=&aDef[i] && pOther->pNext!=&aDef[i] );
351       aDef[i].pNext = pOther->pNext;
352       pOther->pNext = &aDef[i];
353     }else{
354       aDef[i].pNext = 0;
355       aDef[i].u.pHash = sqlite3BuiltinFunctions.a[h];
356       sqlite3BuiltinFunctions.a[h] = &aDef[i];
357     }
358   }
359 }
360 
361 
362 
363 /*
364 ** Locate a user function given a name, a number of arguments and a flag
365 ** indicating whether the function prefers UTF-16 over UTF-8.  Return a
366 ** pointer to the FuncDef structure that defines that function, or return
367 ** NULL if the function does not exist.
368 **
369 ** If the createFlag argument is true, then a new (blank) FuncDef
370 ** structure is created and liked into the "db" structure if a
371 ** no matching function previously existed.
372 **
373 ** If nArg is -2, then the first valid function found is returned.  A
374 ** function is valid if xSFunc is non-zero.  The nArg==(-2)
375 ** case is used to see if zName is a valid function name for some number
376 ** of arguments.  If nArg is -2, then createFlag must be 0.
377 **
378 ** If createFlag is false, then a function with the required name and
379 ** number of arguments may be returned even if the eTextRep flag does not
380 ** match that requested.
381 */
382 FuncDef *sqlite3FindFunction(
383   sqlite3 *db,       /* An open database */
384   const char *zName, /* Name of the function.  zero-terminated */
385   int nArg,          /* Number of arguments.  -1 means any number */
386   u8 enc,            /* Preferred text encoding */
387   u8 createFlag      /* Create new entry if true and does not otherwise exist */
388 ){
389   FuncDef *p;         /* Iterator variable */
390   FuncDef *pBest = 0; /* Best match found so far */
391   int bestScore = 0;  /* Score of best match */
392   int h;              /* Hash value */
393   int nName;          /* Length of the name */
394 
395   assert( nArg>=(-2) );
396   assert( nArg>=(-1) || createFlag==0 );
397   nName = sqlite3Strlen30(zName);
398 
399   /* First search for a match amongst the application-defined functions.
400   */
401   p = (FuncDef*)sqlite3HashFind(&db->aFunc, zName);
402   while( p ){
403     int score = matchQuality(p, nArg, enc);
404     if( score>bestScore ){
405       pBest = p;
406       bestScore = score;
407     }
408     p = p->pNext;
409   }
410 
411   /* If no match is found, search the built-in functions.
412   **
413   ** If the DBFLAG_PreferBuiltin flag is set, then search the built-in
414   ** functions even if a prior app-defined function was found.  And give
415   ** priority to built-in functions.
416   **
417   ** Except, if createFlag is true, that means that we are trying to
418   ** install a new function.  Whatever FuncDef structure is returned it will
419   ** have fields overwritten with new information appropriate for the
420   ** new function.  But the FuncDefs for built-in functions are read-only.
421   ** So we must not search for built-ins when creating a new function.
422   */
423   if( !createFlag && (pBest==0 || (db->mDbFlags & DBFLAG_PreferBuiltin)!=0) ){
424     bestScore = 0;
425     h = SQLITE_FUNC_HASH(sqlite3UpperToLower[(u8)zName[0]], nName);
426     p = sqlite3FunctionSearch(h, zName);
427     while( p ){
428       int score = matchQuality(p, nArg, enc);
429       if( score>bestScore ){
430         pBest = p;
431         bestScore = score;
432       }
433       p = p->pNext;
434     }
435   }
436 
437   /* If the createFlag parameter is true and the search did not reveal an
438   ** exact match for the name, number of arguments and encoding, then add a
439   ** new entry to the hash table and return it.
440   */
441   if( createFlag && bestScore<FUNC_PERFECT_MATCH &&
442       (pBest = sqlite3DbMallocZero(db, sizeof(*pBest)+nName+1))!=0 ){
443     FuncDef *pOther;
444     u8 *z;
445     pBest->zName = (const char*)&pBest[1];
446     pBest->nArg = (u16)nArg;
447     pBest->funcFlags = enc;
448     memcpy((char*)&pBest[1], zName, nName+1);
449     for(z=(u8*)pBest->zName; *z; z++) *z = sqlite3UpperToLower[*z];
450     pOther = (FuncDef*)sqlite3HashInsert(&db->aFunc, pBest->zName, pBest);
451     if( pOther==pBest ){
452       sqlite3DbFree(db, pBest);
453       sqlite3OomFault(db);
454       return 0;
455     }else{
456       pBest->pNext = pOther;
457     }
458   }
459 
460   if( pBest && (pBest->xSFunc || createFlag) ){
461     return pBest;
462   }
463   return 0;
464 }
465 
466 /*
467 ** Free all resources held by the schema structure. The void* argument points
468 ** at a Schema struct. This function does not call sqlite3DbFree(db, ) on the
469 ** pointer itself, it just cleans up subsidiary resources (i.e. the contents
470 ** of the schema hash tables).
471 **
472 ** The Schema.cache_size variable is not cleared.
473 */
474 void sqlite3SchemaClear(void *p){
475   Hash temp1;
476   Hash temp2;
477   HashElem *pElem;
478   Schema *pSchema = (Schema *)p;
479 
480   temp1 = pSchema->tblHash;
481   temp2 = pSchema->trigHash;
482   sqlite3HashInit(&pSchema->trigHash);
483   sqlite3HashClear(&pSchema->idxHash);
484   for(pElem=sqliteHashFirst(&temp2); pElem; pElem=sqliteHashNext(pElem)){
485     sqlite3DeleteTrigger(0, (Trigger*)sqliteHashData(pElem));
486   }
487   sqlite3HashClear(&temp2);
488   sqlite3HashInit(&pSchema->tblHash);
489   for(pElem=sqliteHashFirst(&temp1); pElem; pElem=sqliteHashNext(pElem)){
490     Table *pTab = sqliteHashData(pElem);
491     sqlite3DeleteTable(0, pTab);
492   }
493   sqlite3HashClear(&temp1);
494   sqlite3HashClear(&pSchema->fkeyHash);
495   pSchema->pSeqTab = 0;
496   if( pSchema->schemaFlags & DB_SchemaLoaded ){
497     pSchema->iGeneration++;
498   }
499   pSchema->schemaFlags &= ~(DB_SchemaLoaded|DB_ResetWanted);
500 }
501 
502 /*
503 ** Find and return the schema associated with a BTree.  Create
504 ** a new one if necessary.
505 */
506 Schema *sqlite3SchemaGet(sqlite3 *db, Btree *pBt){
507   Schema * p;
508   if( pBt ){
509     p = (Schema *)sqlite3BtreeSchema(pBt, sizeof(Schema), sqlite3SchemaClear);
510   }else{
511     p = (Schema *)sqlite3DbMallocZero(0, sizeof(Schema));
512   }
513   if( !p ){
514     sqlite3OomFault(db);
515   }else if ( 0==p->file_format ){
516     sqlite3HashInit(&p->tblHash);
517     sqlite3HashInit(&p->idxHash);
518     sqlite3HashInit(&p->trigHash);
519     sqlite3HashInit(&p->fkeyHash);
520     p->enc = SQLITE_UTF8;
521   }
522   return p;
523 }
524