blob: c4a5280d271af08c3b158c7cad6ef410ec81f10d [file] [log] [blame]
danielk1977fd9a0a42005-05-24 12:01:00 +00001/*
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**
drhd9da78a2009-03-24 15:08:09 +000016** $Id: callback.c,v 1.37 2009/03/24 15:08:10 drh Exp $
danielk1977fd9a0a42005-05-24 12:01:00 +000017*/
18
19#include "sqliteInt.h"
20
21/*
danielk19774dade032005-05-25 10:45:10 +000022** Invoke the 'collation needed' callback to request a collation sequence
23** in the database text encoding of name zName, length nName.
24** If the collation sequence
25*/
26static void callCollNeeded(sqlite3 *db, const char *zName, int nName){
27 assert( !db->xCollNeeded || !db->xCollNeeded16 );
drh0a687d12008-07-08 14:52:07 +000028 if( nName<0 ) nName = sqlite3Strlen(db, zName);
danielk19774dade032005-05-25 10:45:10 +000029 if( db->xCollNeeded ){
drh17435752007-08-16 04:30:38 +000030 char *zExternal = sqlite3DbStrNDup(db, zName, nName);
danielk19774dade032005-05-25 10:45:10 +000031 if( !zExternal ) return;
danielk197714db2662006-01-09 16:12:04 +000032 db->xCollNeeded(db->pCollNeededArg, db, (int)ENC(db), zExternal);
drh633e6d52008-07-28 19:34:53 +000033 sqlite3DbFree(db, zExternal);
danielk19774dade032005-05-25 10:45:10 +000034 }
35#ifndef SQLITE_OMIT_UTF16
36 if( db->xCollNeeded16 ){
37 char const *zExternal;
danielk19771e536952007-08-16 10:09:01 +000038 sqlite3_value *pTmp = sqlite3ValueNew(db);
drhb21c8cd2007-08-21 19:33:56 +000039 sqlite3ValueSetStr(pTmp, nName, zName, SQLITE_UTF8, SQLITE_STATIC);
40 zExternal = sqlite3ValueText(pTmp, SQLITE_UTF16NATIVE);
drh26abcb12005-12-14 22:51:16 +000041 if( zExternal ){
danielk197714db2662006-01-09 16:12:04 +000042 db->xCollNeeded16(db->pCollNeededArg, db, (int)ENC(db), zExternal);
drh26abcb12005-12-14 22:51:16 +000043 }
44 sqlite3ValueFree(pTmp);
danielk19774dade032005-05-25 10:45:10 +000045 }
46#endif
47}
48
49/*
50** This routine is called if the collation factory fails to deliver a
51** collation function in the best encoding but there may be other versions
52** of this collation function (for other text encodings) available. Use one
53** of these instead if they exist. Avoid a UTF-8 <-> UTF-16 conversion if
54** possible.
55*/
56static int synthCollSeq(sqlite3 *db, CollSeq *pColl){
57 CollSeq *pColl2;
58 char *z = pColl->zName;
drhea678832008-12-10 19:26:22 +000059 int n = sqlite3Strlen30(z);
danielk19774dade032005-05-25 10:45:10 +000060 int i;
61 static const u8 aEnc[] = { SQLITE_UTF16BE, SQLITE_UTF16LE, SQLITE_UTF8 };
62 for(i=0; i<3; i++){
63 pColl2 = sqlite3FindCollSeq(db, aEnc[i], z, n, 0);
64 if( pColl2->xCmp!=0 ){
65 memcpy(pColl, pColl2, sizeof(CollSeq));
danielk1977a9808b32007-05-07 09:32:45 +000066 pColl->xDel = 0; /* Do not copy the destructor */
danielk19774dade032005-05-25 10:45:10 +000067 return SQLITE_OK;
68 }
69 }
70 return SQLITE_ERROR;
71}
72
73/*
74** This function is responsible for invoking the collation factory callback
75** or substituting a collation sequence of a different encoding when the
76** requested collation sequence is not available in the database native
77** encoding.
78**
79** If it is not NULL, then pColl must point to the database native encoding
80** collation sequence with name zName, length nName.
81**
82** The return value is either the collation sequence to be used in database
83** db for collation type name zName, length nName, or NULL, if no collation
84** sequence can be found.
85*/
86CollSeq *sqlite3GetCollSeq(
87 sqlite3* db,
88 CollSeq *pColl,
89 const char *zName,
90 int nName
91){
92 CollSeq *p;
93
94 p = pColl;
95 if( !p ){
danielk197714db2662006-01-09 16:12:04 +000096 p = sqlite3FindCollSeq(db, ENC(db), zName, nName, 0);
danielk19774dade032005-05-25 10:45:10 +000097 }
98 if( !p || !p->xCmp ){
99 /* No collation sequence of this type for this encoding is registered.
100 ** Call the collation factory to see if it can supply us with one.
101 */
102 callCollNeeded(db, zName, nName);
danielk197714db2662006-01-09 16:12:04 +0000103 p = sqlite3FindCollSeq(db, ENC(db), zName, nName, 0);
danielk19774dade032005-05-25 10:45:10 +0000104 }
105 if( p && !p->xCmp && synthCollSeq(db, p) ){
106 p = 0;
107 }
108 assert( !p || p->xCmp );
109 return p;
110}
111
112/*
113** This routine is called on a collation sequence before it is used to
114** check that it is defined. An undefined collation sequence exists when
115** a database is loaded that contains references to collation sequences
116** that have not been defined by sqlite3_create_collation() etc.
117**
118** If required, this routine calls the 'collation needed' callback to
119** request a definition of the collating sequence. If this doesn't work,
120** an equivalent collating sequence that uses a text encoding different
121** from the main database is substituted, if one is available.
122*/
123int sqlite3CheckCollSeq(Parse *pParse, CollSeq *pColl){
124 if( pColl ){
125 const char *zName = pColl->zName;
126 CollSeq *p = sqlite3GetCollSeq(pParse->db, pColl, zName, -1);
127 if( !p ){
128 if( pParse->nErr==0 ){
129 sqlite3ErrorMsg(pParse, "no such collation sequence: %s", zName);
130 }
131 pParse->nErr++;
132 return SQLITE_ERROR;
133 }
danielk1977b3bf5562006-01-10 17:58:23 +0000134 assert( p==pColl );
danielk19774dade032005-05-25 10:45:10 +0000135 }
136 return SQLITE_OK;
137}
138
139
140
141/*
danielk1977fd9a0a42005-05-24 12:01:00 +0000142** Locate and return an entry from the db.aCollSeq hash table. If the entry
143** specified by zName and nName is not found and parameter 'create' is
144** true, then create a new entry. Otherwise return NULL.
145**
146** Each pointer stored in the sqlite3.aCollSeq hash table contains an
147** array of three CollSeq structures. The first is the collation sequence
148** prefferred for UTF-8, the second UTF-16le, and the third UTF-16be.
149**
150** Stored immediately after the three collation sequences is a copy of
151** the collation sequence name. A pointer to this string is stored in
152** each collation sequence structure.
153*/
drh55ef4d92005-08-14 01:20:37 +0000154static CollSeq *findCollSeqEntry(
danielk1977fd9a0a42005-05-24 12:01:00 +0000155 sqlite3 *db,
156 const char *zName,
157 int nName,
158 int create
159){
160 CollSeq *pColl;
drh0a687d12008-07-08 14:52:07 +0000161 if( nName<0 ) nName = sqlite3Strlen(db, zName);
danielk1977fd9a0a42005-05-24 12:01:00 +0000162 pColl = sqlite3HashFind(&db->aCollSeq, zName, nName);
163
164 if( 0==pColl && create ){
drh17435752007-08-16 04:30:38 +0000165 pColl = sqlite3DbMallocZero(db, 3*sizeof(*pColl) + nName + 1 );
danielk1977fd9a0a42005-05-24 12:01:00 +0000166 if( pColl ){
167 CollSeq *pDel = 0;
168 pColl[0].zName = (char*)&pColl[3];
169 pColl[0].enc = SQLITE_UTF8;
170 pColl[1].zName = (char*)&pColl[3];
171 pColl[1].enc = SQLITE_UTF16LE;
172 pColl[2].zName = (char*)&pColl[3];
173 pColl[2].enc = SQLITE_UTF16BE;
174 memcpy(pColl[0].zName, zName, nName);
175 pColl[0].zName[nName] = 0;
176 pDel = sqlite3HashInsert(&db->aCollSeq, pColl[0].zName, nName, pColl);
177
shanebe217792009-03-05 04:20:31 +0000178 /* If a malloc() failure occurred in sqlite3HashInsert(), it will
danielk1977fd9a0a42005-05-24 12:01:00 +0000179 ** return the pColl pointer to be deleted (because it wasn't added
180 ** to the hash table).
181 */
drhf3a65f72007-08-22 20:18:21 +0000182 assert( pDel==0 || pDel==pColl );
183 if( pDel!=0 ){
184 db->mallocFailed = 1;
drh633e6d52008-07-28 19:34:53 +0000185 sqlite3DbFree(db, pDel);
drh91171cd2006-03-14 11:08:27 +0000186 pColl = 0;
187 }
danielk1977fd9a0a42005-05-24 12:01:00 +0000188 }
189 }
190 return pColl;
191}
192
193/*
194** Parameter zName points to a UTF-8 encoded string nName bytes long.
195** Return the CollSeq* pointer for the collation sequence named zName
196** for the encoding 'enc' from the database 'db'.
197**
198** If the entry specified is not found and 'create' is true, then create a
199** new entry. Otherwise return NULL.
drha34001c2007-02-02 12:44:37 +0000200**
201** A separate function sqlite3LocateCollSeq() is a wrapper around
202** this routine. sqlite3LocateCollSeq() invokes the collation factory
203** if necessary and generates an error message if the collating sequence
204** cannot be found.
danielk1977fd9a0a42005-05-24 12:01:00 +0000205*/
206CollSeq *sqlite3FindCollSeq(
207 sqlite3 *db,
208 u8 enc,
209 const char *zName,
210 int nName,
211 int create
212){
danielk1977b3bf5562006-01-10 17:58:23 +0000213 CollSeq *pColl;
214 if( zName ){
215 pColl = findCollSeqEntry(db, zName, nName, create);
216 }else{
217 pColl = db->pDfltColl;
218 }
danielk1977fd9a0a42005-05-24 12:01:00 +0000219 assert( SQLITE_UTF8==1 && SQLITE_UTF16LE==2 && SQLITE_UTF16BE==3 );
220 assert( enc>=SQLITE_UTF8 && enc<=SQLITE_UTF16BE );
221 if( pColl ) pColl += enc-1;
222 return pColl;
223}
224
danielk19778c0a7912008-08-20 14:49:23 +0000225/* During the search for the best function definition, this procedure
226** is called to test how well the function passed as the first argument
227** matches the request for a function with nArg arguments in a system
228** that uses encoding enc. The value returned indicates how well the
229** request is matched. A higher value indicates a better match.
230**
drhdfbc3a82009-01-31 22:28:48 +0000231** The returned value is always between 0 and 6, as follows:
danielk19778c0a7912008-08-20 14:49:23 +0000232**
drhdfbc3a82009-01-31 22:28:48 +0000233** 0: Not a match, or if nArg<0 and the function is has no implementation.
danielk19778c0a7912008-08-20 14:49:23 +0000234** 1: A variable arguments function that prefers UTF-8 when a UTF-16
235** encoding is requested, or vice versa.
236** 2: A variable arguments function that uses UTF-16BE when UTF-16LE is
237** requested, or vice versa.
238** 3: A variable arguments function using the same text encoding.
239** 4: A function with the exact number of arguments requested that
240** prefers UTF-8 when a UTF-16 encoding is requested, or vice versa.
241** 5: A function with the exact number of arguments requested that
242** prefers UTF-16LE when UTF-16BE is requested, or vice versa.
243** 6: An exact match.
244**
245*/
246static int matchQuality(FuncDef *p, int nArg, u8 enc){
247 int match = 0;
drhdfbc3a82009-01-31 22:28:48 +0000248 if( p->nArg==-1 || p->nArg==nArg
249 || (nArg==-1 && (p->xFunc!=0 || p->xStep!=0))
250 ){
danielk19778c0a7912008-08-20 14:49:23 +0000251 match = 1;
252 if( p->nArg==nArg || nArg==-1 ){
253 match = 4;
254 }
255 if( enc==p->iPrefEnc ){
256 match += 2;
257 }
258 else if( (enc==SQLITE_UTF16LE && p->iPrefEnc==SQLITE_UTF16BE) ||
259 (enc==SQLITE_UTF16BE && p->iPrefEnc==SQLITE_UTF16LE) ){
260 match += 1;
261 }
262 }
263 return match;
264}
265
danielk1977fd9a0a42005-05-24 12:01:00 +0000266/*
drh70a8ca32008-08-21 18:49:27 +0000267** Search a FuncDefHash for a function with the given name. Return
268** a pointer to the matching FuncDef if found, or 0 if there is no match.
269*/
270static FuncDef *functionSearch(
271 FuncDefHash *pHash, /* Hash table to search */
272 int h, /* Hash of the name */
273 const char *zFunc, /* Name of function */
274 int nFunc /* Number of bytes in zFunc */
275){
276 FuncDef *p;
277 for(p=pHash->a[h]; p; p=p->pHash){
278 if( sqlite3StrNICmp(p->zName, zFunc, nFunc)==0 && p->zName[nFunc]==0 ){
279 return p;
280 }
281 }
282 return 0;
283}
284
285/*
286** Insert a new FuncDef into a FuncDefHash hash table.
287*/
288void sqlite3FuncDefInsert(
289 FuncDefHash *pHash, /* The hash table into which to insert */
290 FuncDef *pDef /* The function definition to insert */
291){
292 FuncDef *pOther;
drhea678832008-12-10 19:26:22 +0000293 int nName = sqlite3Strlen30(pDef->zName);
drh70a8ca32008-08-21 18:49:27 +0000294 u8 c1 = (u8)pDef->zName[0];
295 int h = (sqlite3UpperToLower[c1] + nName) % ArraySize(pHash->a);
296 pOther = functionSearch(pHash, h, pDef->zName, nName);
297 if( pOther ){
298 pDef->pNext = pOther->pNext;
299 pOther->pNext = pDef;
300 }else{
301 pDef->pNext = 0;
302 pDef->pHash = pHash->a[h];
303 pHash->a[h] = pDef;
304 }
305}
306
307
308
309/*
danielk1977fd9a0a42005-05-24 12:01:00 +0000310** Locate a user function given a name, a number of arguments and a flag
311** indicating whether the function prefers UTF-16 over UTF-8. Return a
312** pointer to the FuncDef structure that defines that function, or return
313** NULL if the function does not exist.
314**
315** If the createFlag argument is true, then a new (blank) FuncDef
316** structure is created and liked into the "db" structure if a
317** no matching function previously existed. When createFlag is true
318** and the nArg parameter is -1, then only a function that accepts
319** any number of arguments will be returned.
320**
321** If createFlag is false and nArg is -1, then the first valid
322** function found is returned. A function is valid if either xFunc
323** or xStep is non-zero.
324**
325** If createFlag is false, then a function with the required name and
326** number of arguments may be returned even if the eTextRep flag does not
327** match that requested.
328*/
329FuncDef *sqlite3FindFunction(
330 sqlite3 *db, /* An open database */
331 const char *zName, /* Name of the function. Not null-terminated */
332 int nName, /* Number of characters in the name */
333 int nArg, /* Number of arguments. -1 means any number */
334 u8 enc, /* Preferred text encoding */
335 int createFlag /* Create new entry if true and does not otherwise exist */
336){
337 FuncDef *p; /* Iterator variable */
danielk1977fd9a0a42005-05-24 12:01:00 +0000338 FuncDef *pBest = 0; /* Best match found so far */
drh70a8ca32008-08-21 18:49:27 +0000339 int bestScore = 0; /* Score of best match */
340 int h; /* Hash value */
danielk1977fd9a0a42005-05-24 12:01:00 +0000341
342
343 assert( enc==SQLITE_UTF8 || enc==SQLITE_UTF16LE || enc==SQLITE_UTF16BE );
344 if( nArg<-1 ) nArg = -1;
drh70a8ca32008-08-21 18:49:27 +0000345 h = (sqlite3UpperToLower[(u8)zName[0]] + nName) % ArraySize(db->aFunc.a);
danielk1977fd9a0a42005-05-24 12:01:00 +0000346
drhe3602be2008-09-09 12:31:33 +0000347 /* First search for a match amongst the application-defined functions.
348 */
drh70a8ca32008-08-21 18:49:27 +0000349 p = functionSearch(&db->aFunc, h, zName, nName);
350 while( p ){
351 int score = matchQuality(p, nArg, enc);
352 if( score>bestScore ){
danielk19778c0a7912008-08-20 14:49:23 +0000353 pBest = p;
drh70a8ca32008-08-21 18:49:27 +0000354 bestScore = score;
danielk19778c0a7912008-08-20 14:49:23 +0000355 }
drh70a8ca32008-08-21 18:49:27 +0000356 p = p->pNext;
danielk19778c0a7912008-08-20 14:49:23 +0000357 }
danielk1977fd9a0a42005-05-24 12:01:00 +0000358
drhe3602be2008-09-09 12:31:33 +0000359 /* If no match is found, search the built-in functions.
360 **
361 ** Except, if createFlag is true, that means that we are trying to
362 ** install a new function. Whatever FuncDef structure is returned will
363 ** have fields overwritten with new information appropriate for the
364 ** new function. But the FuncDefs for built-in functions are read-only.
365 ** So we must not search for built-ins when creating a new function.
danielk19778c0a7912008-08-20 14:49:23 +0000366 */
367 if( !createFlag && !pBest ){
danielk1977075c23a2008-09-01 18:34:20 +0000368 FuncDefHash *pHash = &GLOBAL(FuncDefHash, sqlite3GlobalFunctions);
369 p = functionSearch(pHash, h, zName, nName);
drh70a8ca32008-08-21 18:49:27 +0000370 while( p ){
371 int score = matchQuality(p, nArg, enc);
372 if( score>bestScore ){
373 pBest = p;
374 bestScore = score;
danielk1977fd9a0a42005-05-24 12:01:00 +0000375 }
drh70a8ca32008-08-21 18:49:27 +0000376 p = p->pNext;
danielk1977fd9a0a42005-05-24 12:01:00 +0000377 }
378 }
379
drhe3602be2008-09-09 12:31:33 +0000380 /* If the createFlag parameter is true and the search did not reveal an
danielk1977fd9a0a42005-05-24 12:01:00 +0000381 ** exact match for the name, number of arguments and encoding, then add a
382 ** new entry to the hash table and return it.
383 */
drhe3602be2008-09-09 12:31:33 +0000384 if( createFlag && (bestScore<6 || pBest->nArg!=nArg) &&
danielk19778c0a7912008-08-20 14:49:23 +0000385 (pBest = sqlite3DbMallocZero(db, sizeof(*pBest)+nName+1))!=0 ){
386 pBest->zName = (char *)&pBest[1];
drh1bd10f82008-12-10 21:19:56 +0000387 pBest->nArg = (u16)nArg;
danielk1977fd9a0a42005-05-24 12:01:00 +0000388 pBest->iPrefEnc = enc;
389 memcpy(pBest->zName, zName, nName);
390 pBest->zName[nName] = 0;
drh70a8ca32008-08-21 18:49:27 +0000391 sqlite3FuncDefInsert(&db->aFunc, pBest);
danielk1977fd9a0a42005-05-24 12:01:00 +0000392 }
393
394 if( pBest && (pBest->xStep || pBest->xFunc || createFlag) ){
395 return pBest;
396 }
397 return 0;
398}
drh03b808a2006-03-13 15:06:05 +0000399
400/*
401** Free all resources held by the schema structure. The void* argument points
drh633e6d52008-07-28 19:34:53 +0000402** at a Schema struct. This function does not call sqlite3DbFree(db, ) on the
drh03b808a2006-03-13 15:06:05 +0000403** pointer itself, it just cleans up subsiduary resources (i.e. the contents
404** of the schema hash tables).
danielk19778cf6c552008-06-23 16:53:46 +0000405**
406** The Schema.cache_size variable is not cleared.
drh03b808a2006-03-13 15:06:05 +0000407*/
408void sqlite3SchemaFree(void *p){
409 Hash temp1;
410 Hash temp2;
411 HashElem *pElem;
412 Schema *pSchema = (Schema *)p;
413
414 temp1 = pSchema->tblHash;
415 temp2 = pSchema->trigHash;
drh1b67f3c2008-10-10 17:41:28 +0000416 sqlite3HashInit(&pSchema->trigHash, 0);
drh03b808a2006-03-13 15:06:05 +0000417 sqlite3HashClear(&pSchema->aFKey);
418 sqlite3HashClear(&pSchema->idxHash);
419 for(pElem=sqliteHashFirst(&temp2); pElem; pElem=sqliteHashNext(pElem)){
drh633e6d52008-07-28 19:34:53 +0000420 sqlite3DeleteTrigger(0, (Trigger*)sqliteHashData(pElem));
drh03b808a2006-03-13 15:06:05 +0000421 }
422 sqlite3HashClear(&temp2);
drh1b67f3c2008-10-10 17:41:28 +0000423 sqlite3HashInit(&pSchema->tblHash, 0);
drh03b808a2006-03-13 15:06:05 +0000424 for(pElem=sqliteHashFirst(&temp1); pElem; pElem=sqliteHashNext(pElem)){
425 Table *pTab = sqliteHashData(pElem);
drhd9da78a2009-03-24 15:08:09 +0000426 assert( pTab->dbMem==0 );
danielk1977a04a34f2007-04-16 15:06:25 +0000427 sqlite3DeleteTable(pTab);
drh03b808a2006-03-13 15:06:05 +0000428 }
429 sqlite3HashClear(&temp1);
430 pSchema->pSeqTab = 0;
431 pSchema->flags &= ~DB_SchemaLoaded;
432}
433
434/*
435** Find and return the schema associated with a BTree. Create
436** a new one if necessary.
437*/
drh17435752007-08-16 04:30:38 +0000438Schema *sqlite3SchemaGet(sqlite3 *db, Btree *pBt){
drh03b808a2006-03-13 15:06:05 +0000439 Schema * p;
440 if( pBt ){
danielk1977a1644fd2007-08-29 12:31:25 +0000441 p = (Schema *)sqlite3BtreeSchema(pBt, sizeof(Schema), sqlite3SchemaFree);
drh03b808a2006-03-13 15:06:05 +0000442 }else{
danielk1977a1644fd2007-08-29 12:31:25 +0000443 p = (Schema *)sqlite3MallocZero(sizeof(Schema));
drh03b808a2006-03-13 15:06:05 +0000444 }
danielk1977a1644fd2007-08-29 12:31:25 +0000445 if( !p ){
446 db->mallocFailed = 1;
447 }else if ( 0==p->file_format ){
drh1b67f3c2008-10-10 17:41:28 +0000448 sqlite3HashInit(&p->tblHash, 0);
449 sqlite3HashInit(&p->idxHash, 0);
450 sqlite3HashInit(&p->trigHash, 0);
451 sqlite3HashInit(&p->aFKey, 1);
drhf012ea32006-05-24 12:43:26 +0000452 p->enc = SQLITE_UTF8;
drh03b808a2006-03-13 15:06:05 +0000453 }
454 return p;
455}