blob: a360e46ee491a9f601c4198f15f48afc50def63f [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.
danielk1977fd9a0a42005-05-24 12:01:00 +000015*/
16
17#include "sqliteInt.h"
18
19/*
danielk19774dade032005-05-25 10:45:10 +000020** Invoke the 'collation needed' callback to request a collation sequence
drh9aeda792009-08-20 02:34:15 +000021** in the encoding enc of name zName, length nName.
danielk19774dade032005-05-25 10:45:10 +000022*/
drh9aeda792009-08-20 02:34:15 +000023static void callCollNeeded(sqlite3 *db, int enc, const char *zName){
danielk19774dade032005-05-25 10:45:10 +000024 assert( !db->xCollNeeded || !db->xCollNeeded16 );
danielk19774dade032005-05-25 10:45:10 +000025 if( db->xCollNeeded ){
drhc4a64fa2009-05-11 20:53:28 +000026 char *zExternal = sqlite3DbStrDup(db, zName);
danielk19774dade032005-05-25 10:45:10 +000027 if( !zExternal ) return;
drh9aeda792009-08-20 02:34:15 +000028 db->xCollNeeded(db->pCollNeededArg, db, enc, zExternal);
drh633e6d52008-07-28 19:34:53 +000029 sqlite3DbFree(db, zExternal);
danielk19774dade032005-05-25 10:45:10 +000030 }
31#ifndef SQLITE_OMIT_UTF16
32 if( db->xCollNeeded16 ){
33 char const *zExternal;
danielk19771e536952007-08-16 10:09:01 +000034 sqlite3_value *pTmp = sqlite3ValueNew(db);
drhc4a64fa2009-05-11 20:53:28 +000035 sqlite3ValueSetStr(pTmp, -1, zName, SQLITE_UTF8, SQLITE_STATIC);
drhb21c8cd2007-08-21 19:33:56 +000036 zExternal = sqlite3ValueText(pTmp, SQLITE_UTF16NATIVE);
drh26abcb12005-12-14 22:51:16 +000037 if( zExternal ){
danielk197714db2662006-01-09 16:12:04 +000038 db->xCollNeeded16(db->pCollNeededArg, db, (int)ENC(db), zExternal);
drh26abcb12005-12-14 22:51:16 +000039 }
40 sqlite3ValueFree(pTmp);
danielk19774dade032005-05-25 10:45:10 +000041 }
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*/
52static int synthCollSeq(sqlite3 *db, CollSeq *pColl){
53 CollSeq *pColl2;
54 char *z = pColl->zName;
danielk19774dade032005-05-25 10:45:10 +000055 int i;
56 static const u8 aEnc[] = { SQLITE_UTF16BE, SQLITE_UTF16LE, SQLITE_UTF8 };
57 for(i=0; i<3; i++){
drhc4a64fa2009-05-11 20:53:28 +000058 pColl2 = sqlite3FindCollSeq(db, aEnc[i], z, 0);
danielk19774dade032005-05-25 10:45:10 +000059 if( pColl2->xCmp!=0 ){
60 memcpy(pColl, pColl2, sizeof(CollSeq));
danielk1977a9808b32007-05-07 09:32:45 +000061 pColl->xDel = 0; /* Do not copy the destructor */
danielk19774dade032005-05-25 10:45:10 +000062 return SQLITE_OK;
63 }
64 }
65 return SQLITE_ERROR;
66}
67
68/*
danielk19774dade032005-05-25 10:45:10 +000069** 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*/
79int sqlite3CheckCollSeq(Parse *pParse, CollSeq *pColl){
drh666e8662017-07-06 02:49:26 +000080 if( pColl && pColl->xCmp==0 ){
danielk19774dade032005-05-25 10:45:10 +000081 const char *zName = pColl->zName;
drh9aeda792009-08-20 02:34:15 +000082 sqlite3 *db = pParse->db;
drh79e72a52012-10-05 14:43:40 +000083 CollSeq *p = sqlite3GetCollSeq(pParse, ENC(db), pColl, zName);
danielk19774dade032005-05-25 10:45:10 +000084 if( !p ){
danielk19774dade032005-05-25 10:45:10 +000085 return SQLITE_ERROR;
86 }
danielk1977b3bf5562006-01-10 17:58:23 +000087 assert( p==pColl );
danielk19774dade032005-05-25 10:45:10 +000088 }
89 return SQLITE_OK;
90}
91
92
93
94/*
danielk1977fd9a0a42005-05-24 12:01:00 +000095** 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
peter.d.reid60ec9142014-09-06 16:39:46 +0000101** preferred for UTF-8, the second UTF-16le, and the third UTF-16be.
danielk1977fd9a0a42005-05-24 12:01:00 +0000102**
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*/
drh55ef4d92005-08-14 01:20:37 +0000107static CollSeq *findCollSeqEntry(
drhc4a64fa2009-05-11 20:53:28 +0000108 sqlite3 *db, /* Database connection */
109 const char *zName, /* Name of the collating sequence */
110 int create /* Create a new entry if true */
danielk1977fd9a0a42005-05-24 12:01:00 +0000111){
112 CollSeq *pColl;
drhacbcb7e2014-08-21 20:26:37 +0000113 pColl = sqlite3HashFind(&db->aCollSeq, zName);
danielk1977fd9a0a42005-05-24 12:01:00 +0000114
115 if( 0==pColl && create ){
drh3b02e0f2017-07-06 03:06:20 +0000116 int nName = sqlite3Strlen30(zName) + 1;
117 pColl = sqlite3DbMallocZero(db, 3*sizeof(*pColl) + nName);
danielk1977fd9a0a42005-05-24 12:01:00 +0000118 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);
drhacbcb7e2014-08-21 20:26:37 +0000127 pDel = sqlite3HashInsert(&db->aCollSeq, pColl[0].zName, pColl);
danielk1977fd9a0a42005-05-24 12:01:00 +0000128
shanebe217792009-03-05 04:20:31 +0000129 /* If a malloc() failure occurred in sqlite3HashInsert(), it will
danielk1977fd9a0a42005-05-24 12:01:00 +0000130 ** return the pColl pointer to be deleted (because it wasn't added
131 ** to the hash table).
132 */
drhf3a65f72007-08-22 20:18:21 +0000133 assert( pDel==0 || pDel==pColl );
134 if( pDel!=0 ){
drh4a642b62016-02-05 01:55:27 +0000135 sqlite3OomFault(db);
drh633e6d52008-07-28 19:34:53 +0000136 sqlite3DbFree(db, pDel);
drh91171cd2006-03-14 11:08:27 +0000137 pColl = 0;
138 }
danielk1977fd9a0a42005-05-24 12:01:00 +0000139 }
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.
drha34001c2007-02-02 12:44:37 +0000151**
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.
drhc4a64fa2009-05-11 20:53:28 +0000156**
157** See also: sqlite3LocateCollSeq(), sqlite3GetCollSeq()
danielk1977fd9a0a42005-05-24 12:01:00 +0000158*/
159CollSeq *sqlite3FindCollSeq(
drha5d09112019-10-22 01:00:16 +0000160 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 */
danielk1977fd9a0a42005-05-24 12:01:00 +0000164){
danielk1977b3bf5562006-01-10 17:58:23 +0000165 CollSeq *pColl;
166 if( zName ){
drhc4a64fa2009-05-11 20:53:28 +0000167 pColl = findCollSeqEntry(db, zName, create);
danielk1977b3bf5562006-01-10 17:58:23 +0000168 }else{
169 pColl = db->pDfltColl;
170 }
danielk1977fd9a0a42005-05-24 12:01:00 +0000171 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
drha5d09112019-10-22 01:00:16 +0000177/*
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*/
191CollSeq *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*/
242CollSeq *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
danielk19778c0a7912008-08-20 14:49:23 +0000256/* 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**
drh89d5d6a2012-04-07 00:09:21 +0000262** 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**
drhdfbc3a82009-01-31 22:28:48 +0000270** The returned value is always between 0 and 6, as follows:
danielk19778c0a7912008-08-20 14:49:23 +0000271**
drh89d5d6a2012-04-07 00:09:21 +0000272** 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.
danielk19778c0a7912008-08-20 14:49:23 +0000279**
drh2d801512016-01-14 22:19:58 +0000280** If nArg==(-2) then any function with a non-null xSFunc is
281** a perfect match and any function with xSFunc NULL is
drh89d5d6a2012-04-07 00:09:21 +0000282** a non-match.
danielk19778c0a7912008-08-20 14:49:23 +0000283*/
drh89d5d6a2012-04-07 00:09:21 +0000284#define FUNC_PERFECT_MATCH 6 /* The score for a perfect match */
285static 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
292 /* nArg of -2 is a special case */
drh2d801512016-01-14 22:19:58 +0000293 if( nArg==(-2) ) return (p->xSFunc==0) ? 0 : FUNC_PERFECT_MATCH;
drh89d5d6a2012-04-07 00:09:21 +0000294
295 /* Wrong number of arguments means "no match" */
296 if( p->nArg!=nArg && p->nArg>=0 ) return 0;
297
298 /* Give a better score to a function with a specific number of arguments
299 ** than to function that accepts any number of arguments. */
300 if( p->nArg==nArg ){
301 match = 4;
302 }else{
danielk19778c0a7912008-08-20 14:49:23 +0000303 match = 1;
danielk19778c0a7912008-08-20 14:49:23 +0000304 }
drh89d5d6a2012-04-07 00:09:21 +0000305
306 /* Bonus points if the text encoding matches */
drhd36e1042013-09-06 13:10:12 +0000307 if( enc==(p->funcFlags & SQLITE_FUNC_ENCMASK) ){
drh89d5d6a2012-04-07 00:09:21 +0000308 match += 2; /* Exact encoding match */
drhd36e1042013-09-06 13:10:12 +0000309 }else if( (enc & p->funcFlags & 2)!=0 ){
drh89d5d6a2012-04-07 00:09:21 +0000310 match += 1; /* Both are UTF16, but with different byte orders */
311 }
312
danielk19778c0a7912008-08-20 14:49:23 +0000313 return match;
314}
315
danielk1977fd9a0a42005-05-24 12:01:00 +0000316/*
drh70a8ca32008-08-21 18:49:27 +0000317** Search a FuncDefHash for a function with the given name. Return
318** a pointer to the matching FuncDef if found, or 0 if there is no match.
319*/
drh19efd0d2018-12-05 17:48:57 +0000320FuncDef *sqlite3FunctionSearch(
drh70a8ca32008-08-21 18:49:27 +0000321 int h, /* Hash of the name */
drh80738d92016-02-15 00:34:16 +0000322 const char *zFunc /* Name of function */
drh70a8ca32008-08-21 18:49:27 +0000323){
324 FuncDef *p;
drh80738d92016-02-15 00:34:16 +0000325 for(p=sqlite3BuiltinFunctions.a[h]; p; p=p->u.pHash){
326 if( sqlite3StrICmp(p->zName, zFunc)==0 ){
drh70a8ca32008-08-21 18:49:27 +0000327 return p;
328 }
329 }
330 return 0;
331}
332
333/*
334** Insert a new FuncDef into a FuncDefHash hash table.
335*/
drh80738d92016-02-15 00:34:16 +0000336void sqlite3InsertBuiltinFuncs(
337 FuncDef *aDef, /* List of global functions to be inserted */
338 int nDef /* Length of the apDef[] list */
drh70a8ca32008-08-21 18:49:27 +0000339){
drh80738d92016-02-15 00:34:16 +0000340 int i;
341 for(i=0; i<nDef; i++){
342 FuncDef *pOther;
343 const char *zName = aDef[i].zName;
344 int nName = sqlite3Strlen30(zName);
mistachkin8bee11a2018-10-29 17:53:23 +0000345 int h = SQLITE_FUNC_HASH(zName[0], nName);
drhebaaa672017-07-06 13:23:26 +0000346 assert( zName[0]>='a' && zName[0]<='z' );
drh19efd0d2018-12-05 17:48:57 +0000347 pOther = sqlite3FunctionSearch(h, zName);
drh80738d92016-02-15 00:34:16 +0000348 if( pOther ){
349 assert( pOther!=&aDef[i] && pOther->pNext!=&aDef[i] );
350 aDef[i].pNext = pOther->pNext;
351 pOther->pNext = &aDef[i];
352 }else{
353 aDef[i].pNext = 0;
354 aDef[i].u.pHash = sqlite3BuiltinFunctions.a[h];
355 sqlite3BuiltinFunctions.a[h] = &aDef[i];
356 }
drh70a8ca32008-08-21 18:49:27 +0000357 }
358}
359
360
361
362/*
danielk1977fd9a0a42005-05-24 12:01:00 +0000363** Locate a user function given a name, a number of arguments and a flag
364** indicating whether the function prefers UTF-16 over UTF-8. Return a
365** pointer to the FuncDef structure that defines that function, or return
366** NULL if the function does not exist.
367**
368** If the createFlag argument is true, then a new (blank) FuncDef
369** structure is created and liked into the "db" structure if a
drh89d5d6a2012-04-07 00:09:21 +0000370** no matching function previously existed.
danielk1977fd9a0a42005-05-24 12:01:00 +0000371**
drh89d5d6a2012-04-07 00:09:21 +0000372** If nArg is -2, then the first valid function found is returned. A
drh2d801512016-01-14 22:19:58 +0000373** function is valid if xSFunc is non-zero. The nArg==(-2)
drh89d5d6a2012-04-07 00:09:21 +0000374** case is used to see if zName is a valid function name for some number
375** of arguments. If nArg is -2, then createFlag must be 0.
danielk1977fd9a0a42005-05-24 12:01:00 +0000376**
377** If createFlag is false, then a function with the required name and
378** number of arguments may be returned even if the eTextRep flag does not
379** match that requested.
380*/
381FuncDef *sqlite3FindFunction(
382 sqlite3 *db, /* An open database */
drh80738d92016-02-15 00:34:16 +0000383 const char *zName, /* Name of the function. zero-terminated */
danielk1977fd9a0a42005-05-24 12:01:00 +0000384 int nArg, /* Number of arguments. -1 means any number */
385 u8 enc, /* Preferred text encoding */
drh89d5d6a2012-04-07 00:09:21 +0000386 u8 createFlag /* Create new entry if true and does not otherwise exist */
danielk1977fd9a0a42005-05-24 12:01:00 +0000387){
388 FuncDef *p; /* Iterator variable */
danielk1977fd9a0a42005-05-24 12:01:00 +0000389 FuncDef *pBest = 0; /* Best match found so far */
drh70a8ca32008-08-21 18:49:27 +0000390 int bestScore = 0; /* Score of best match */
391 int h; /* Hash value */
drh80738d92016-02-15 00:34:16 +0000392 int nName; /* Length of the name */
danielk1977fd9a0a42005-05-24 12:01:00 +0000393
drh89d5d6a2012-04-07 00:09:21 +0000394 assert( nArg>=(-2) );
395 assert( nArg>=(-1) || createFlag==0 );
drh80738d92016-02-15 00:34:16 +0000396 nName = sqlite3Strlen30(zName);
danielk1977fd9a0a42005-05-24 12:01:00 +0000397
drhe3602be2008-09-09 12:31:33 +0000398 /* First search for a match amongst the application-defined functions.
399 */
drh80738d92016-02-15 00:34:16 +0000400 p = (FuncDef*)sqlite3HashFind(&db->aFunc, zName);
drh70a8ca32008-08-21 18:49:27 +0000401 while( p ){
402 int score = matchQuality(p, nArg, enc);
403 if( score>bestScore ){
danielk19778c0a7912008-08-20 14:49:23 +0000404 pBest = p;
drh70a8ca32008-08-21 18:49:27 +0000405 bestScore = score;
danielk19778c0a7912008-08-20 14:49:23 +0000406 }
drh70a8ca32008-08-21 18:49:27 +0000407 p = p->pNext;
danielk19778c0a7912008-08-20 14:49:23 +0000408 }
danielk1977fd9a0a42005-05-24 12:01:00 +0000409
drhe3602be2008-09-09 12:31:33 +0000410 /* If no match is found, search the built-in functions.
411 **
drh8257aa82017-07-26 19:59:13 +0000412 ** If the DBFLAG_PreferBuiltin flag is set, then search the built-in
drh545f5872010-04-24 14:02:59 +0000413 ** functions even if a prior app-defined function was found. And give
414 ** priority to built-in functions.
415 **
drhe3602be2008-09-09 12:31:33 +0000416 ** Except, if createFlag is true, that means that we are trying to
drh6c5cecb2010-09-16 19:49:22 +0000417 ** install a new function. Whatever FuncDef structure is returned it will
drhe3602be2008-09-09 12:31:33 +0000418 ** have fields overwritten with new information appropriate for the
419 ** new function. But the FuncDefs for built-in functions are read-only.
420 ** So we must not search for built-ins when creating a new function.
danielk19778c0a7912008-08-20 14:49:23 +0000421 */
drh8257aa82017-07-26 19:59:13 +0000422 if( !createFlag && (pBest==0 || (db->mDbFlags & DBFLAG_PreferBuiltin)!=0) ){
drh545f5872010-04-24 14:02:59 +0000423 bestScore = 0;
mistachkin8bee11a2018-10-29 17:53:23 +0000424 h = SQLITE_FUNC_HASH(sqlite3UpperToLower[(u8)zName[0]], nName);
drh19efd0d2018-12-05 17:48:57 +0000425 p = sqlite3FunctionSearch(h, zName);
drh70a8ca32008-08-21 18:49:27 +0000426 while( p ){
427 int score = matchQuality(p, nArg, enc);
428 if( score>bestScore ){
429 pBest = p;
430 bestScore = score;
danielk1977fd9a0a42005-05-24 12:01:00 +0000431 }
drh70a8ca32008-08-21 18:49:27 +0000432 p = p->pNext;
danielk1977fd9a0a42005-05-24 12:01:00 +0000433 }
434 }
435
drhe3602be2008-09-09 12:31:33 +0000436 /* If the createFlag parameter is true and the search did not reveal an
danielk1977fd9a0a42005-05-24 12:01:00 +0000437 ** exact match for the name, number of arguments and encoding, then add a
438 ** new entry to the hash table and return it.
439 */
drh89d5d6a2012-04-07 00:09:21 +0000440 if( createFlag && bestScore<FUNC_PERFECT_MATCH &&
danielk19778c0a7912008-08-20 14:49:23 +0000441 (pBest = sqlite3DbMallocZero(db, sizeof(*pBest)+nName+1))!=0 ){
drh80738d92016-02-15 00:34:16 +0000442 FuncDef *pOther;
drh92011842018-05-26 16:00:26 +0000443 u8 *z;
drh6ad224e2016-02-24 19:57:11 +0000444 pBest->zName = (const char*)&pBest[1];
drh1bd10f82008-12-10 21:19:56 +0000445 pBest->nArg = (u16)nArg;
drhd36e1042013-09-06 13:10:12 +0000446 pBest->funcFlags = enc;
drh6ad224e2016-02-24 19:57:11 +0000447 memcpy((char*)&pBest[1], zName, nName+1);
drh92011842018-05-26 16:00:26 +0000448 for(z=(u8*)pBest->zName; *z; z++) *z = sqlite3UpperToLower[*z];
drh80738d92016-02-15 00:34:16 +0000449 pOther = (FuncDef*)sqlite3HashInsert(&db->aFunc, pBest->zName, pBest);
450 if( pOther==pBest ){
451 sqlite3DbFree(db, pBest);
452 sqlite3OomFault(db);
453 return 0;
454 }else{
455 pBest->pNext = pOther;
456 }
danielk1977fd9a0a42005-05-24 12:01:00 +0000457 }
458
drh2d801512016-01-14 22:19:58 +0000459 if( pBest && (pBest->xSFunc || createFlag) ){
danielk1977fd9a0a42005-05-24 12:01:00 +0000460 return pBest;
461 }
462 return 0;
463}
drh03b808a2006-03-13 15:06:05 +0000464
465/*
466** Free all resources held by the schema structure. The void* argument points
drh633e6d52008-07-28 19:34:53 +0000467** at a Schema struct. This function does not call sqlite3DbFree(db, ) on the
drhb6ee6602011-04-04 13:40:53 +0000468** pointer itself, it just cleans up subsidiary resources (i.e. the contents
drh03b808a2006-03-13 15:06:05 +0000469** of the schema hash tables).
danielk19778cf6c552008-06-23 16:53:46 +0000470**
471** The Schema.cache_size variable is not cleared.
drh03b808a2006-03-13 15:06:05 +0000472*/
drhb6ee6602011-04-04 13:40:53 +0000473void sqlite3SchemaClear(void *p){
drh03b808a2006-03-13 15:06:05 +0000474 Hash temp1;
475 Hash temp2;
476 HashElem *pElem;
477 Schema *pSchema = (Schema *)p;
478
479 temp1 = pSchema->tblHash;
480 temp2 = pSchema->trigHash;
drhe61922a2009-05-02 13:29:37 +0000481 sqlite3HashInit(&pSchema->trigHash);
drh03b808a2006-03-13 15:06:05 +0000482 sqlite3HashClear(&pSchema->idxHash);
483 for(pElem=sqliteHashFirst(&temp2); pElem; pElem=sqliteHashNext(pElem)){
drh633e6d52008-07-28 19:34:53 +0000484 sqlite3DeleteTrigger(0, (Trigger*)sqliteHashData(pElem));
drh03b808a2006-03-13 15:06:05 +0000485 }
486 sqlite3HashClear(&temp2);
drhe61922a2009-05-02 13:29:37 +0000487 sqlite3HashInit(&pSchema->tblHash);
drh03b808a2006-03-13 15:06:05 +0000488 for(pElem=sqliteHashFirst(&temp1); pElem; pElem=sqliteHashNext(pElem)){
489 Table *pTab = sqliteHashData(pElem);
dan1feeaed2010-07-23 15:41:47 +0000490 sqlite3DeleteTable(0, pTab);
drh03b808a2006-03-13 15:06:05 +0000491 }
492 sqlite3HashClear(&temp1);
dan1da40a32009-09-19 17:00:31 +0000493 sqlite3HashClear(&pSchema->fkeyHash);
drh03b808a2006-03-13 15:06:05 +0000494 pSchema->pSeqTab = 0;
drh2c5e35f2014-08-05 11:04:21 +0000495 if( pSchema->schemaFlags & DB_SchemaLoaded ){
drhc2a75552011-03-18 21:55:46 +0000496 pSchema->iGeneration++;
drhc2a75552011-03-18 21:55:46 +0000497 }
drhdc6b41e2017-08-17 02:26:35 +0000498 pSchema->schemaFlags &= ~(DB_SchemaLoaded|DB_ResetWanted);
drh03b808a2006-03-13 15:06:05 +0000499}
500
501/*
502** Find and return the schema associated with a BTree. Create
503** a new one if necessary.
504*/
drh17435752007-08-16 04:30:38 +0000505Schema *sqlite3SchemaGet(sqlite3 *db, Btree *pBt){
drh03b808a2006-03-13 15:06:05 +0000506 Schema * p;
507 if( pBt ){
drhb6ee6602011-04-04 13:40:53 +0000508 p = (Schema *)sqlite3BtreeSchema(pBt, sizeof(Schema), sqlite3SchemaClear);
drh03b808a2006-03-13 15:06:05 +0000509 }else{
drhb9755982010-07-24 16:34:37 +0000510 p = (Schema *)sqlite3DbMallocZero(0, sizeof(Schema));
drh03b808a2006-03-13 15:06:05 +0000511 }
danielk1977a1644fd2007-08-29 12:31:25 +0000512 if( !p ){
drh4a642b62016-02-05 01:55:27 +0000513 sqlite3OomFault(db);
danielk1977a1644fd2007-08-29 12:31:25 +0000514 }else if ( 0==p->file_format ){
drhe61922a2009-05-02 13:29:37 +0000515 sqlite3HashInit(&p->tblHash);
516 sqlite3HashInit(&p->idxHash);
517 sqlite3HashInit(&p->trigHash);
dan1da40a32009-09-19 17:00:31 +0000518 sqlite3HashInit(&p->fkeyHash);
drhf012ea32006-05-24 12:43:26 +0000519 p->enc = SQLITE_UTF8;
drh03b808a2006-03-13 15:06:05 +0000520 }
521 return p;
522}