blob: a515e05e2a051abae9b190e8f799fdd14231bcb9 [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/*
69** This function is responsible for invoking the collation factory callback
70** or substituting a collation sequence of a different encoding when the
drh9aeda792009-08-20 02:34:15 +000071** requested collation sequence is not available in the desired encoding.
danielk19774dade032005-05-25 10:45:10 +000072**
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.
drhc4a64fa2009-05-11 20:53:28 +000079**
80** See also: sqlite3LocateCollSeq(), sqlite3FindCollSeq()
danielk19774dade032005-05-25 10:45:10 +000081*/
82CollSeq *sqlite3GetCollSeq(
drhc4a64fa2009-05-11 20:53:28 +000083 sqlite3* db, /* The database connection */
shanecea72b22009-09-07 04:38:36 +000084 u8 enc, /* The desired encoding for the collating sequence */
drhc4a64fa2009-05-11 20:53:28 +000085 CollSeq *pColl, /* Collating sequence with native encoding, or NULL */
86 const char *zName /* Collating sequence name */
danielk19774dade032005-05-25 10:45:10 +000087){
88 CollSeq *p;
89
90 p = pColl;
91 if( !p ){
drh9aeda792009-08-20 02:34:15 +000092 p = sqlite3FindCollSeq(db, enc, zName, 0);
danielk19774dade032005-05-25 10:45:10 +000093 }
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 */
drh9aeda792009-08-20 02:34:15 +000098 callCollNeeded(db, enc, zName);
99 p = sqlite3FindCollSeq(db, enc, zName, 0);
danielk19774dade032005-05-25 10:45:10 +0000100 }
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*/
119int sqlite3CheckCollSeq(Parse *pParse, CollSeq *pColl){
120 if( pColl ){
121 const char *zName = pColl->zName;
drh9aeda792009-08-20 02:34:15 +0000122 sqlite3 *db = pParse->db;
123 CollSeq *p = sqlite3GetCollSeq(db, ENC(db), pColl, zName);
danielk19774dade032005-05-25 10:45:10 +0000124 if( !p ){
drh58fbb312009-06-17 00:35:30 +0000125 sqlite3ErrorMsg(pParse, "no such collation sequence: %s", zName);
danielk19774dade032005-05-25 10:45:10 +0000126 pParse->nErr++;
127 return SQLITE_ERROR;
128 }
danielk1977b3bf5562006-01-10 17:58:23 +0000129 assert( p==pColl );
danielk19774dade032005-05-25 10:45:10 +0000130 }
131 return SQLITE_OK;
132}
133
134
135
136/*
danielk1977fd9a0a42005-05-24 12:01:00 +0000137** 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*/
drh55ef4d92005-08-14 01:20:37 +0000149static CollSeq *findCollSeqEntry(
drhc4a64fa2009-05-11 20:53:28 +0000150 sqlite3 *db, /* Database connection */
151 const char *zName, /* Name of the collating sequence */
152 int create /* Create a new entry if true */
danielk1977fd9a0a42005-05-24 12:01:00 +0000153){
154 CollSeq *pColl;
drhc4a64fa2009-05-11 20:53:28 +0000155 int nName = sqlite3Strlen30(zName);
danielk1977fd9a0a42005-05-24 12:01:00 +0000156 pColl = sqlite3HashFind(&db->aCollSeq, zName, nName);
157
158 if( 0==pColl && create ){
drh17435752007-08-16 04:30:38 +0000159 pColl = sqlite3DbMallocZero(db, 3*sizeof(*pColl) + nName + 1 );
danielk1977fd9a0a42005-05-24 12:01:00 +0000160 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
shanebe217792009-03-05 04:20:31 +0000172 /* If a malloc() failure occurred in sqlite3HashInsert(), it will
danielk1977fd9a0a42005-05-24 12:01:00 +0000173 ** return the pColl pointer to be deleted (because it wasn't added
174 ** to the hash table).
175 */
drhf3a65f72007-08-22 20:18:21 +0000176 assert( pDel==0 || pDel==pColl );
177 if( pDel!=0 ){
178 db->mallocFailed = 1;
drh633e6d52008-07-28 19:34:53 +0000179 sqlite3DbFree(db, pDel);
drh91171cd2006-03-14 11:08:27 +0000180 pColl = 0;
181 }
danielk1977fd9a0a42005-05-24 12:01:00 +0000182 }
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.
drha34001c2007-02-02 12:44:37 +0000194**
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.
drhc4a64fa2009-05-11 20:53:28 +0000199**
200** See also: sqlite3LocateCollSeq(), sqlite3GetCollSeq()
danielk1977fd9a0a42005-05-24 12:01:00 +0000201*/
202CollSeq *sqlite3FindCollSeq(
203 sqlite3 *db,
204 u8 enc,
205 const char *zName,
danielk1977fd9a0a42005-05-24 12:01:00 +0000206 int create
207){
danielk1977b3bf5562006-01-10 17:58:23 +0000208 CollSeq *pColl;
209 if( zName ){
drhc4a64fa2009-05-11 20:53:28 +0000210 pColl = findCollSeqEntry(db, zName, create);
danielk1977b3bf5562006-01-10 17:58:23 +0000211 }else{
212 pColl = db->pDfltColl;
213 }
danielk1977fd9a0a42005-05-24 12:01:00 +0000214 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
danielk19778c0a7912008-08-20 14:49:23 +0000220/* 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**
drh89d5d6a2012-04-07 00:09:21 +0000226** 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**
drhdfbc3a82009-01-31 22:28:48 +0000234** The returned value is always between 0 and 6, as follows:
danielk19778c0a7912008-08-20 14:49:23 +0000235**
drh89d5d6a2012-04-07 00:09:21 +0000236** 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.
danielk19778c0a7912008-08-20 14:49:23 +0000243**
drh89d5d6a2012-04-07 00:09:21 +0000244** 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.
danielk19778c0a7912008-08-20 14:49:23 +0000247*/
drh89d5d6a2012-04-07 00:09:21 +0000248#define FUNC_PERFECT_MATCH 6 /* The score for a perfect match */
249static 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{
danielk19778c0a7912008-08-20 14:49:23 +0000267 match = 1;
danielk19778c0a7912008-08-20 14:49:23 +0000268 }
drh89d5d6a2012-04-07 00:09:21 +0000269
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
danielk19778c0a7912008-08-20 14:49:23 +0000277 return match;
278}
279
danielk1977fd9a0a42005-05-24 12:01:00 +0000280/*
drh70a8ca32008-08-21 18:49:27 +0000281** 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*/
284static 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*/
302void sqlite3FuncDefInsert(
303 FuncDefHash *pHash, /* The hash table into which to insert */
304 FuncDef *pDef /* The function definition to insert */
305){
306 FuncDef *pOther;
drhea678832008-12-10 19:26:22 +0000307 int nName = sqlite3Strlen30(pDef->zName);
drh70a8ca32008-08-21 18:49:27 +0000308 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 ){
drh7aaa8782009-05-20 02:40:45 +0000312 assert( pOther!=pDef && pOther->pNext!=pDef );
drh70a8ca32008-08-21 18:49:27 +0000313 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/*
danielk1977fd9a0a42005-05-24 12:01:00 +0000325** 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
drh89d5d6a2012-04-07 00:09:21 +0000332** no matching function previously existed.
danielk1977fd9a0a42005-05-24 12:01:00 +0000333**
drh89d5d6a2012-04-07 00:09:21 +0000334** 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.
danielk1977fd9a0a42005-05-24 12:01:00 +0000338**
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*/
343FuncDef *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 */
drh89d5d6a2012-04-07 00:09:21 +0000349 u8 createFlag /* Create new entry if true and does not otherwise exist */
danielk1977fd9a0a42005-05-24 12:01:00 +0000350){
351 FuncDef *p; /* Iterator variable */
danielk1977fd9a0a42005-05-24 12:01:00 +0000352 FuncDef *pBest = 0; /* Best match found so far */
drh70a8ca32008-08-21 18:49:27 +0000353 int bestScore = 0; /* Score of best match */
354 int h; /* Hash value */
danielk1977fd9a0a42005-05-24 12:01:00 +0000355
drh89d5d6a2012-04-07 00:09:21 +0000356 assert( nArg>=(-2) );
357 assert( nArg>=(-1) || createFlag==0 );
danielk1977fd9a0a42005-05-24 12:01:00 +0000358 assert( enc==SQLITE_UTF8 || enc==SQLITE_UTF16LE || enc==SQLITE_UTF16BE );
drh70a8ca32008-08-21 18:49:27 +0000359 h = (sqlite3UpperToLower[(u8)zName[0]] + nName) % ArraySize(db->aFunc.a);
danielk1977fd9a0a42005-05-24 12:01:00 +0000360
drhe3602be2008-09-09 12:31:33 +0000361 /* First search for a match amongst the application-defined functions.
362 */
drh70a8ca32008-08-21 18:49:27 +0000363 p = functionSearch(&db->aFunc, h, zName, nName);
364 while( p ){
365 int score = matchQuality(p, nArg, enc);
366 if( score>bestScore ){
danielk19778c0a7912008-08-20 14:49:23 +0000367 pBest = p;
drh70a8ca32008-08-21 18:49:27 +0000368 bestScore = score;
danielk19778c0a7912008-08-20 14:49:23 +0000369 }
drh70a8ca32008-08-21 18:49:27 +0000370 p = p->pNext;
danielk19778c0a7912008-08-20 14:49:23 +0000371 }
danielk1977fd9a0a42005-05-24 12:01:00 +0000372
drhe3602be2008-09-09 12:31:33 +0000373 /* If no match is found, search the built-in functions.
374 **
drh545f5872010-04-24 14:02:59 +0000375 ** 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 **
drhe3602be2008-09-09 12:31:33 +0000379 ** Except, if createFlag is true, that means that we are trying to
drh6c5cecb2010-09-16 19:49:22 +0000380 ** install a new function. Whatever FuncDef structure is returned it will
drhe3602be2008-09-09 12:31:33 +0000381 ** 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.
danielk19778c0a7912008-08-20 14:49:23 +0000384 */
drh545f5872010-04-24 14:02:59 +0000385 if( !createFlag && (pBest==0 || (db->flags & SQLITE_PreferBuiltin)!=0) ){
danielk1977075c23a2008-09-01 18:34:20 +0000386 FuncDefHash *pHash = &GLOBAL(FuncDefHash, sqlite3GlobalFunctions);
drh545f5872010-04-24 14:02:59 +0000387 bestScore = 0;
danielk1977075c23a2008-09-01 18:34:20 +0000388 p = functionSearch(pHash, h, zName, nName);
drh70a8ca32008-08-21 18:49:27 +0000389 while( p ){
390 int score = matchQuality(p, nArg, enc);
391 if( score>bestScore ){
392 pBest = p;
393 bestScore = score;
danielk1977fd9a0a42005-05-24 12:01:00 +0000394 }
drh70a8ca32008-08-21 18:49:27 +0000395 p = p->pNext;
danielk1977fd9a0a42005-05-24 12:01:00 +0000396 }
397 }
398
drhe3602be2008-09-09 12:31:33 +0000399 /* If the createFlag parameter is true and the search did not reveal an
danielk1977fd9a0a42005-05-24 12:01:00 +0000400 ** exact match for the name, number of arguments and encoding, then add a
401 ** new entry to the hash table and return it.
402 */
drh89d5d6a2012-04-07 00:09:21 +0000403 if( createFlag && bestScore<FUNC_PERFECT_MATCH &&
danielk19778c0a7912008-08-20 14:49:23 +0000404 (pBest = sqlite3DbMallocZero(db, sizeof(*pBest)+nName+1))!=0 ){
405 pBest->zName = (char *)&pBest[1];
drh1bd10f82008-12-10 21:19:56 +0000406 pBest->nArg = (u16)nArg;
danielk1977fd9a0a42005-05-24 12:01:00 +0000407 pBest->iPrefEnc = enc;
408 memcpy(pBest->zName, zName, nName);
409 pBest->zName[nName] = 0;
drh70a8ca32008-08-21 18:49:27 +0000410 sqlite3FuncDefInsert(&db->aFunc, pBest);
danielk1977fd9a0a42005-05-24 12:01:00 +0000411 }
412
413 if( pBest && (pBest->xStep || pBest->xFunc || createFlag) ){
414 return pBest;
415 }
416 return 0;
417}
drh03b808a2006-03-13 15:06:05 +0000418
419/*
420** Free all resources held by the schema structure. The void* argument points
drh633e6d52008-07-28 19:34:53 +0000421** at a Schema struct. This function does not call sqlite3DbFree(db, ) on the
drhb6ee6602011-04-04 13:40:53 +0000422** pointer itself, it just cleans up subsidiary resources (i.e. the contents
drh03b808a2006-03-13 15:06:05 +0000423** of the schema hash tables).
danielk19778cf6c552008-06-23 16:53:46 +0000424**
425** The Schema.cache_size variable is not cleared.
drh03b808a2006-03-13 15:06:05 +0000426*/
drhb6ee6602011-04-04 13:40:53 +0000427void sqlite3SchemaClear(void *p){
drh03b808a2006-03-13 15:06:05 +0000428 Hash temp1;
429 Hash temp2;
430 HashElem *pElem;
431 Schema *pSchema = (Schema *)p;
432
433 temp1 = pSchema->tblHash;
434 temp2 = pSchema->trigHash;
drhe61922a2009-05-02 13:29:37 +0000435 sqlite3HashInit(&pSchema->trigHash);
drh03b808a2006-03-13 15:06:05 +0000436 sqlite3HashClear(&pSchema->idxHash);
437 for(pElem=sqliteHashFirst(&temp2); pElem; pElem=sqliteHashNext(pElem)){
drh633e6d52008-07-28 19:34:53 +0000438 sqlite3DeleteTrigger(0, (Trigger*)sqliteHashData(pElem));
drh03b808a2006-03-13 15:06:05 +0000439 }
440 sqlite3HashClear(&temp2);
drhe61922a2009-05-02 13:29:37 +0000441 sqlite3HashInit(&pSchema->tblHash);
drh03b808a2006-03-13 15:06:05 +0000442 for(pElem=sqliteHashFirst(&temp1); pElem; pElem=sqliteHashNext(pElem)){
443 Table *pTab = sqliteHashData(pElem);
dan1feeaed2010-07-23 15:41:47 +0000444 sqlite3DeleteTable(0, pTab);
drh03b808a2006-03-13 15:06:05 +0000445 }
446 sqlite3HashClear(&temp1);
dan1da40a32009-09-19 17:00:31 +0000447 sqlite3HashClear(&pSchema->fkeyHash);
drh03b808a2006-03-13 15:06:05 +0000448 pSchema->pSeqTab = 0;
drhc2a75552011-03-18 21:55:46 +0000449 if( pSchema->flags & DB_SchemaLoaded ){
450 pSchema->iGeneration++;
451 pSchema->flags &= ~DB_SchemaLoaded;
452 }
drh03b808a2006-03-13 15:06:05 +0000453}
454
455/*
456** Find and return the schema associated with a BTree. Create
457** a new one if necessary.
458*/
drh17435752007-08-16 04:30:38 +0000459Schema *sqlite3SchemaGet(sqlite3 *db, Btree *pBt){
drh03b808a2006-03-13 15:06:05 +0000460 Schema * p;
461 if( pBt ){
drhb6ee6602011-04-04 13:40:53 +0000462 p = (Schema *)sqlite3BtreeSchema(pBt, sizeof(Schema), sqlite3SchemaClear);
drh03b808a2006-03-13 15:06:05 +0000463 }else{
drhb9755982010-07-24 16:34:37 +0000464 p = (Schema *)sqlite3DbMallocZero(0, sizeof(Schema));
drh03b808a2006-03-13 15:06:05 +0000465 }
danielk1977a1644fd2007-08-29 12:31:25 +0000466 if( !p ){
467 db->mallocFailed = 1;
468 }else if ( 0==p->file_format ){
drhe61922a2009-05-02 13:29:37 +0000469 sqlite3HashInit(&p->tblHash);
470 sqlite3HashInit(&p->idxHash);
471 sqlite3HashInit(&p->trigHash);
dan1da40a32009-09-19 17:00:31 +0000472 sqlite3HashInit(&p->fkeyHash);
drhf012ea32006-05-24 12:43:26 +0000473 p->enc = SQLITE_UTF8;
drh03b808a2006-03-13 15:06:05 +0000474 }
475 return p;
476}