xref: /sqlite-3.40.0/src/callback.c (revision d5578433)
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 function is responsible for invoking the collation factory callback
70 ** or substituting a collation sequence of a different encoding when the
71 ** requested collation sequence is not available in the desired encoding.
72 **
73 ** If it is not NULL, then pColl must point to the database native encoding
74 ** collation sequence with name zName, length nName.
75 **
76 ** The return value is either the collation sequence to be used in database
77 ** db for collation type name zName, length nName, or NULL, if no collation
78 ** sequence can be found.
79 **
80 ** See also: sqlite3LocateCollSeq(), sqlite3FindCollSeq()
81 */
82 CollSeq *sqlite3GetCollSeq(
83   sqlite3* db,          /* The database connection */
84   u8 enc,               /* The desired encoding for the collating sequence */
85   CollSeq *pColl,       /* Collating sequence with native encoding, or NULL */
86   const char *zName     /* Collating sequence name */
87 ){
88   CollSeq *p;
89 
90   p = pColl;
91   if( !p ){
92     p = sqlite3FindCollSeq(db, enc, zName, 0);
93   }
94   if( !p || !p->xCmp ){
95     /* No collation sequence of this type for this encoding is registered.
96     ** Call the collation factory to see if it can supply us with one.
97     */
98     callCollNeeded(db, enc, zName);
99     p = sqlite3FindCollSeq(db, enc, zName, 0);
100   }
101   if( p && !p->xCmp && synthCollSeq(db, p) ){
102     p = 0;
103   }
104   assert( !p || p->xCmp );
105   return p;
106 }
107 
108 /*
109 ** This routine is called on a collation sequence before it is used to
110 ** check that it is defined. An undefined collation sequence exists when
111 ** a database is loaded that contains references to collation sequences
112 ** that have not been defined by sqlite3_create_collation() etc.
113 **
114 ** If required, this routine calls the 'collation needed' callback to
115 ** request a definition of the collating sequence. If this doesn't work,
116 ** an equivalent collating sequence that uses a text encoding different
117 ** from the main database is substituted, if one is available.
118 */
119 int sqlite3CheckCollSeq(Parse *pParse, CollSeq *pColl){
120   if( pColl ){
121     const char *zName = pColl->zName;
122     sqlite3 *db = pParse->db;
123     CollSeq *p = sqlite3GetCollSeq(db, ENC(db), pColl, zName);
124     if( !p ){
125       sqlite3ErrorMsg(pParse, "no such collation sequence: %s", zName);
126       pParse->nErr++;
127       return SQLITE_ERROR;
128     }
129     assert( p==pColl );
130   }
131   return SQLITE_OK;
132 }
133 
134 
135 
136 /*
137 ** Locate and return an entry from the db.aCollSeq hash table. If the entry
138 ** specified by zName and nName is not found and parameter 'create' is
139 ** true, then create a new entry. Otherwise return NULL.
140 **
141 ** Each pointer stored in the sqlite3.aCollSeq hash table contains an
142 ** array of three CollSeq structures. The first is the collation sequence
143 ** prefferred for UTF-8, the second UTF-16le, and the third UTF-16be.
144 **
145 ** Stored immediately after the three collation sequences is a copy of
146 ** the collation sequence name. A pointer to this string is stored in
147 ** each collation sequence structure.
148 */
149 static CollSeq *findCollSeqEntry(
150   sqlite3 *db,          /* Database connection */
151   const char *zName,    /* Name of the collating sequence */
152   int create            /* Create a new entry if true */
153 ){
154   CollSeq *pColl;
155   int nName = sqlite3Strlen30(zName);
156   pColl = sqlite3HashFind(&db->aCollSeq, zName, nName);
157 
158   if( 0==pColl && create ){
159     pColl = sqlite3DbMallocZero(db, 3*sizeof(*pColl) + nName + 1 );
160     if( pColl ){
161       CollSeq *pDel = 0;
162       pColl[0].zName = (char*)&pColl[3];
163       pColl[0].enc = SQLITE_UTF8;
164       pColl[1].zName = (char*)&pColl[3];
165       pColl[1].enc = SQLITE_UTF16LE;
166       pColl[2].zName = (char*)&pColl[3];
167       pColl[2].enc = SQLITE_UTF16BE;
168       memcpy(pColl[0].zName, zName, nName);
169       pColl[0].zName[nName] = 0;
170       pDel = sqlite3HashInsert(&db->aCollSeq, pColl[0].zName, nName, pColl);
171 
172       /* If a malloc() failure occurred in sqlite3HashInsert(), it will
173       ** return the pColl pointer to be deleted (because it wasn't added
174       ** to the hash table).
175       */
176       assert( pDel==0 || pDel==pColl );
177       if( pDel!=0 ){
178         db->mallocFailed = 1;
179         sqlite3DbFree(db, pDel);
180         pColl = 0;
181       }
182     }
183   }
184   return pColl;
185 }
186 
187 /*
188 ** Parameter zName points to a UTF-8 encoded string nName bytes long.
189 ** Return the CollSeq* pointer for the collation sequence named zName
190 ** for the encoding 'enc' from the database 'db'.
191 **
192 ** If the entry specified is not found and 'create' is true, then create a
193 ** new entry.  Otherwise return NULL.
194 **
195 ** A separate function sqlite3LocateCollSeq() is a wrapper around
196 ** this routine.  sqlite3LocateCollSeq() invokes the collation factory
197 ** if necessary and generates an error message if the collating sequence
198 ** cannot be found.
199 **
200 ** See also: sqlite3LocateCollSeq(), sqlite3GetCollSeq()
201 */
202 CollSeq *sqlite3FindCollSeq(
203   sqlite3 *db,
204   u8 enc,
205   const char *zName,
206   int create
207 ){
208   CollSeq *pColl;
209   if( zName ){
210     pColl = findCollSeqEntry(db, zName, create);
211   }else{
212     pColl = db->pDfltColl;
213   }
214   assert( SQLITE_UTF8==1 && SQLITE_UTF16LE==2 && SQLITE_UTF16BE==3 );
215   assert( enc>=SQLITE_UTF8 && enc<=SQLITE_UTF16BE );
216   if( pColl ) pColl += enc-1;
217   return pColl;
218 }
219 
220 /* During the search for the best function definition, this procedure
221 ** is called to test how well the function passed as the first argument
222 ** matches the request for a function with nArg arguments in a system
223 ** that uses encoding enc. The value returned indicates how well the
224 ** request is matched. A higher value indicates a better match.
225 **
226 ** If nArg is -1 that means to only return a match (non-zero) if p->nArg
227 ** is also -1.  In other words, we are searching for a function that
228 ** takes a variable number of arguments.
229 **
230 ** If nArg is -2 that means that we are searching for any function
231 ** regardless of the number of arguments it uses, so return a positive
232 ** match score for any
233 **
234 ** The returned value is always between 0 and 6, as follows:
235 **
236 ** 0: Not a match.
237 ** 1: UTF8/16 conversion required and function takes any number of arguments.
238 ** 2: UTF16 byte order change required and function takes any number of args.
239 ** 3: encoding matches and function takes any number of arguments
240 ** 4: UTF8/16 conversion required - argument count matches exactly
241 ** 5: UTF16 byte order conversion required - argument count matches exactly
242 ** 6: Perfect match:  encoding and argument count match exactly.
243 **
244 ** If nArg==(-2) then any function with a non-null xStep or xFunc is
245 ** a perfect match and any function with both xStep and xFunc NULL is
246 ** a non-match.
247 */
248 #define FUNC_PERFECT_MATCH 6  /* The score for a perfect match */
249 static int matchQuality(
250   FuncDef *p,     /* The function we are evaluating for match quality */
251   int nArg,       /* Desired number of arguments.  (-1)==any */
252   u8 enc          /* Desired text encoding */
253 ){
254   int match;
255 
256   /* nArg of -2 is a special case */
257   if( nArg==(-2) ) return (p->xFunc==0 && p->xStep==0) ? 0 : FUNC_PERFECT_MATCH;
258 
259   /* Wrong number of arguments means "no match" */
260   if( p->nArg!=nArg && p->nArg>=0 ) return 0;
261 
262   /* Give a better score to a function with a specific number of arguments
263   ** than to function that accepts any number of arguments. */
264   if( p->nArg==nArg ){
265     match = 4;
266   }else{
267     match = 1;
268   }
269 
270   /* Bonus points if the text encoding matches */
271   if( enc==p->iPrefEnc ){
272     match += 2;  /* Exact encoding match */
273   }else if( (enc & p->iPrefEnc & 2)!=0 ){
274     match += 1;  /* Both are UTF16, but with different byte orders */
275   }
276 
277   return match;
278 }
279 
280 /*
281 ** Search a FuncDefHash for a function with the given name.  Return
282 ** a pointer to the matching FuncDef if found, or 0 if there is no match.
283 */
284 static FuncDef *functionSearch(
285   FuncDefHash *pHash,  /* Hash table to search */
286   int h,               /* Hash of the name */
287   const char *zFunc,   /* Name of function */
288   int nFunc            /* Number of bytes in zFunc */
289 ){
290   FuncDef *p;
291   for(p=pHash->a[h]; p; p=p->pHash){
292     if( sqlite3StrNICmp(p->zName, zFunc, nFunc)==0 && p->zName[nFunc]==0 ){
293       return p;
294     }
295   }
296   return 0;
297 }
298 
299 /*
300 ** Insert a new FuncDef into a FuncDefHash hash table.
301 */
302 void sqlite3FuncDefInsert(
303   FuncDefHash *pHash,  /* The hash table into which to insert */
304   FuncDef *pDef        /* The function definition to insert */
305 ){
306   FuncDef *pOther;
307   int nName = sqlite3Strlen30(pDef->zName);
308   u8 c1 = (u8)pDef->zName[0];
309   int h = (sqlite3UpperToLower[c1] + nName) % ArraySize(pHash->a);
310   pOther = functionSearch(pHash, h, pDef->zName, nName);
311   if( pOther ){
312     assert( pOther!=pDef && pOther->pNext!=pDef );
313     pDef->pNext = pOther->pNext;
314     pOther->pNext = pDef;
315   }else{
316     pDef->pNext = 0;
317     pDef->pHash = pHash->a[h];
318     pHash->a[h] = pDef;
319   }
320 }
321 
322 
323 
324 /*
325 ** Locate a user function given a name, a number of arguments and a flag
326 ** indicating whether the function prefers UTF-16 over UTF-8.  Return a
327 ** pointer to the FuncDef structure that defines that function, or return
328 ** NULL if the function does not exist.
329 **
330 ** If the createFlag argument is true, then a new (blank) FuncDef
331 ** structure is created and liked into the "db" structure if a
332 ** no matching function previously existed.
333 **
334 ** If nArg is -2, then the first valid function found is returned.  A
335 ** function is valid if either xFunc or xStep is non-zero.  The nArg==(-2)
336 ** case is used to see if zName is a valid function name for some number
337 ** of arguments.  If nArg is -2, then createFlag must be 0.
338 **
339 ** If createFlag is false, then a function with the required name and
340 ** number of arguments may be returned even if the eTextRep flag does not
341 ** match that requested.
342 */
343 FuncDef *sqlite3FindFunction(
344   sqlite3 *db,       /* An open database */
345   const char *zName, /* Name of the function.  Not null-terminated */
346   int nName,         /* Number of characters in the name */
347   int nArg,          /* Number of arguments.  -1 means any number */
348   u8 enc,            /* Preferred text encoding */
349   u8 createFlag      /* Create new entry if true and does not otherwise exist */
350 ){
351   FuncDef *p;         /* Iterator variable */
352   FuncDef *pBest = 0; /* Best match found so far */
353   int bestScore = 0;  /* Score of best match */
354   int h;              /* Hash value */
355 
356   assert( nArg>=(-2) );
357   assert( nArg>=(-1) || createFlag==0 );
358   assert( enc==SQLITE_UTF8 || enc==SQLITE_UTF16LE || enc==SQLITE_UTF16BE );
359   h = (sqlite3UpperToLower[(u8)zName[0]] + nName) % ArraySize(db->aFunc.a);
360 
361   /* First search for a match amongst the application-defined functions.
362   */
363   p = functionSearch(&db->aFunc, h, zName, nName);
364   while( p ){
365     int score = matchQuality(p, nArg, enc);
366     if( score>bestScore ){
367       pBest = p;
368       bestScore = score;
369     }
370     p = p->pNext;
371   }
372 
373   /* If no match is found, search the built-in functions.
374   **
375   ** If the SQLITE_PreferBuiltin flag is set, then search the built-in
376   ** functions even if a prior app-defined function was found.  And give
377   ** priority to built-in functions.
378   **
379   ** Except, if createFlag is true, that means that we are trying to
380   ** install a new function.  Whatever FuncDef structure is returned it will
381   ** have fields overwritten with new information appropriate for the
382   ** new function.  But the FuncDefs for built-in functions are read-only.
383   ** So we must not search for built-ins when creating a new function.
384   */
385   if( !createFlag && (pBest==0 || (db->flags & SQLITE_PreferBuiltin)!=0) ){
386     FuncDefHash *pHash = &GLOBAL(FuncDefHash, sqlite3GlobalFunctions);
387     bestScore = 0;
388     p = functionSearch(pHash, h, zName, nName);
389     while( p ){
390       int score = matchQuality(p, nArg, enc);
391       if( score>bestScore ){
392         pBest = p;
393         bestScore = score;
394       }
395       p = p->pNext;
396     }
397   }
398 
399   /* If the createFlag parameter is true and the search did not reveal an
400   ** exact match for the name, number of arguments and encoding, then add a
401   ** new entry to the hash table and return it.
402   */
403   if( createFlag && bestScore<FUNC_PERFECT_MATCH &&
404       (pBest = sqlite3DbMallocZero(db, sizeof(*pBest)+nName+1))!=0 ){
405     pBest->zName = (char *)&pBest[1];
406     pBest->nArg = (u16)nArg;
407     pBest->iPrefEnc = enc;
408     memcpy(pBest->zName, zName, nName);
409     pBest->zName[nName] = 0;
410     sqlite3FuncDefInsert(&db->aFunc, pBest);
411   }
412 
413   if( pBest && (pBest->xStep || pBest->xFunc || createFlag) ){
414     return pBest;
415   }
416   return 0;
417 }
418 
419 /*
420 ** Free all resources held by the schema structure. The void* argument points
421 ** at a Schema struct. This function does not call sqlite3DbFree(db, ) on the
422 ** pointer itself, it just cleans up subsidiary resources (i.e. the contents
423 ** of the schema hash tables).
424 **
425 ** The Schema.cache_size variable is not cleared.
426 */
427 void sqlite3SchemaClear(void *p){
428   Hash temp1;
429   Hash temp2;
430   HashElem *pElem;
431   Schema *pSchema = (Schema *)p;
432 
433   temp1 = pSchema->tblHash;
434   temp2 = pSchema->trigHash;
435   sqlite3HashInit(&pSchema->trigHash);
436   sqlite3HashClear(&pSchema->idxHash);
437   for(pElem=sqliteHashFirst(&temp2); pElem; pElem=sqliteHashNext(pElem)){
438     sqlite3DeleteTrigger(0, (Trigger*)sqliteHashData(pElem));
439   }
440   sqlite3HashClear(&temp2);
441   sqlite3HashInit(&pSchema->tblHash);
442   for(pElem=sqliteHashFirst(&temp1); pElem; pElem=sqliteHashNext(pElem)){
443     Table *pTab = sqliteHashData(pElem);
444     sqlite3DeleteTable(0, pTab);
445   }
446   sqlite3HashClear(&temp1);
447   sqlite3HashClear(&pSchema->fkeyHash);
448   pSchema->pSeqTab = 0;
449   if( pSchema->flags & DB_SchemaLoaded ){
450     pSchema->iGeneration++;
451     pSchema->flags &= ~DB_SchemaLoaded;
452   }
453 }
454 
455 /*
456 ** Find and return the schema associated with a BTree.  Create
457 ** a new one if necessary.
458 */
459 Schema *sqlite3SchemaGet(sqlite3 *db, Btree *pBt){
460   Schema * p;
461   if( pBt ){
462     p = (Schema *)sqlite3BtreeSchema(pBt, sizeof(Schema), sqlite3SchemaClear);
463   }else{
464     p = (Schema *)sqlite3DbMallocZero(0, sizeof(Schema));
465   }
466   if( !p ){
467     db->mallocFailed = 1;
468   }else if ( 0==p->file_format ){
469     sqlite3HashInit(&p->tblHash);
470     sqlite3HashInit(&p->idxHash);
471     sqlite3HashInit(&p->trigHash);
472     sqlite3HashInit(&p->fkeyHash);
473     p->enc = SQLITE_UTF8;
474   }
475   return p;
476 }
477