sl@0: /***** This file contains automatically generated code ****** sl@0: ** sl@0: ** The code in this file has been automatically generated by sl@0: ** sl@0: ** $Header: /sqlite/sqlite/tool/mkkeywordhash.c,v 1.31 2007/07/30 18:26:20 rse Exp $ sl@0: ** sl@0: ** The code in this file implements a function that determines whether sl@0: ** or not a given identifier is really an SQL keyword. The same thing sl@0: ** might be implemented more directly using a hand-written hash table. sl@0: ** But by using this automatically generated code, the size of the code sl@0: ** is substantially reduced. This is important for embedded applications sl@0: ** on platforms with limited memory. sl@0: */ sl@0: /* Hash score: 157 */ sl@0: static int keywordCode(const char *z, int n){ sl@0: /* zText[] encodes 767 bytes of keywords in 519 bytes */ sl@0: static const char zText[519] = sl@0: "BEFOREIGNOREGEXPLAINSTEADDESCAPEACHECKEYCONSTRAINTERSECTABLEFT" sl@0: "HENDATABASELECTRANSACTIONATURALTERAISELSEXCEPTRIGGEREFERENCES" sl@0: "UNIQUERYATTACHAVINGROUPDATEMPORARYBEGINNEREINDEXCLUSIVEXISTSBETWEEN" sl@0: "OTNULLIKECASCADEFERRABLECASECOLLATECREATECURRENT_DATEDELETEDETACH" sl@0: "IMMEDIATEJOINSERTMATCHPLANALYZEPRAGMABORTVALUESWHENWHERENAMEAFTER" sl@0: "EPLACEANDEFAULTAUTOINCREMENTCASTCOLUMNCOMMITCONFLICTCROSSCURRENT_TIMESTAMP" sl@0: "RIMARYDEFERREDISTINCTDROPFAILIMITFROMFULLGLOBYIFINTOFFSETISNULL" sl@0: "ORDERESTRICTOUTERIGHTROLLBACKROWUNIONUSINGVACUUMVIEWINITIALLY" sl@0: ; sl@0: static const unsigned char aHash[127] = { sl@0: 63, 90, 108, 61, 0, 38, 0, 0, 69, 0, 64, 0, 0, sl@0: 101, 4, 65, 7, 0, 107, 70, 102, 98, 0, 22, 0, 0, sl@0: 112, 0, 110, 105, 0, 18, 78, 0, 1, 0, 0, 56, 57, sl@0: 0, 55, 11, 0, 33, 75, 87, 0, 109, 86, 0, 0, 45, sl@0: 0, 88, 54, 0, 20, 0, 113, 34, 19, 0, 10, 96, 28, sl@0: 81, 0, 0, 115, 91, 47, 114, 41, 12, 44, 0, 76, 0, sl@0: 85, 29, 0, 84, 0, 0, 0, 80, 77, 82, 73, 95, 6, sl@0: 14, 94, 0, 68, 0, 21, 74, 97, 27, 0, 111, 67, 103, sl@0: 49, 40, 93, 0, 0, 79, 99, 0, 106, 0, 15, 0, 0, sl@0: 24, 0, 71, 42, 50, 0, 16, 48, 0, 37, sl@0: }; sl@0: static const unsigned char aNext[115] = { sl@0: 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 0, 0, 0, sl@0: 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, sl@0: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 32, 0, 0, sl@0: 17, 0, 0, 0, 36, 39, 0, 0, 25, 0, 0, 31, 0, sl@0: 0, 0, 43, 52, 0, 0, 0, 53, 0, 0, 0, 0, 0, sl@0: 0, 0, 0, 0, 0, 0, 0, 26, 0, 8, 46, 3, 0, sl@0: 0, 0, 0, 0, 0, 0, 2, 58, 66, 0, 13, 0, 89, sl@0: 83, 0, 0, 92, 0, 72, 0, 0, 62, 0, 35, 100, 0, sl@0: 0, 104, 23, 30, 60, 51, 0, 0, 59, 0, 0, sl@0: }; sl@0: static const unsigned char aLen[115] = { sl@0: 6, 3, 7, 6, 6, 7, 7, 3, 4, 6, 4, 5, 3, sl@0: 10, 9, 5, 4, 4, 3, 8, 2, 6, 11, 2, 7, 5, sl@0: 5, 4, 6, 7, 10, 6, 5, 6, 6, 5, 6, 4, 9, sl@0: 2, 5, 5, 7, 5, 9, 6, 7, 7, 3, 4, 4, 7, sl@0: 3, 10, 4, 7, 6, 12, 6, 6, 9, 4, 6, 5, 4, sl@0: 7, 6, 5, 6, 4, 5, 6, 5, 7, 3, 7, 13, 2, sl@0: 2, 4, 6, 6, 8, 5, 17, 12, 7, 8, 8, 2, 4, sl@0: 4, 5, 4, 4, 4, 2, 2, 4, 6, 2, 3, 6, 5, sl@0: 8, 5, 5, 8, 3, 5, 5, 6, 4, 9, 3, sl@0: }; sl@0: static const unsigned short int aOffset[115] = { sl@0: 0, 2, 2, 6, 10, 13, 18, 23, 25, 26, 31, 33, 37, sl@0: 40, 47, 55, 58, 61, 63, 65, 70, 71, 76, 85, 86, 91, sl@0: 95, 99, 102, 107, 113, 123, 126, 131, 136, 141, 144, 148, 148, sl@0: 152, 157, 160, 164, 166, 169, 177, 183, 189, 189, 192, 195, 199, sl@0: 200, 204, 214, 218, 225, 231, 243, 249, 255, 264, 266, 272, 277, sl@0: 279, 286, 291, 296, 302, 306, 309, 315, 319, 326, 328, 335, 337, sl@0: 339, 348, 352, 358, 364, 372, 377, 377, 393, 400, 407, 408, 415, sl@0: 419, 422, 427, 431, 435, 438, 440, 442, 445, 445, 448, 451, 457, sl@0: 461, 469, 473, 478, 486, 489, 494, 499, 505, 509, 514, sl@0: }; sl@0: static const unsigned char aCode[115] = { sl@0: TK_BEFORE, TK_FOR, TK_FOREIGN, TK_IGNORE, TK_LIKE_KW, sl@0: TK_EXPLAIN, TK_INSTEAD, TK_ADD, TK_DESC, TK_ESCAPE, sl@0: TK_EACH, TK_CHECK, TK_KEY, TK_CONSTRAINT, TK_INTERSECT, sl@0: TK_TABLE, TK_JOIN_KW, TK_THEN, TK_END, TK_DATABASE, sl@0: TK_AS, TK_SELECT, TK_TRANSACTION,TK_ON, TK_JOIN_KW, sl@0: TK_ALTER, TK_RAISE, TK_ELSE, TK_EXCEPT, TK_TRIGGER, sl@0: TK_REFERENCES, TK_UNIQUE, TK_QUERY, TK_ATTACH, TK_HAVING, sl@0: TK_GROUP, TK_UPDATE, TK_TEMP, TK_TEMP, TK_OR, sl@0: TK_BEGIN, TK_JOIN_KW, TK_REINDEX, TK_INDEX, TK_EXCLUSIVE, sl@0: TK_EXISTS, TK_BETWEEN, TK_NOTNULL, TK_NOT, TK_NULL, sl@0: TK_LIKE_KW, TK_CASCADE, TK_ASC, TK_DEFERRABLE, TK_CASE, sl@0: TK_COLLATE, TK_CREATE, TK_CTIME_KW, TK_DELETE, TK_DETACH, sl@0: TK_IMMEDIATE, TK_JOIN, TK_INSERT, TK_MATCH, TK_PLAN, sl@0: TK_ANALYZE, TK_PRAGMA, TK_ABORT, TK_VALUES, TK_WHEN, sl@0: TK_WHERE, TK_RENAME, TK_AFTER, TK_REPLACE, TK_AND, sl@0: TK_DEFAULT, TK_AUTOINCR, TK_TO, TK_IN, TK_CAST, sl@0: TK_COLUMNKW, TK_COMMIT, TK_CONFLICT, TK_JOIN_KW, TK_CTIME_KW, sl@0: TK_CTIME_KW, TK_PRIMARY, TK_DEFERRED, TK_DISTINCT, TK_IS, sl@0: TK_DROP, TK_FAIL, TK_LIMIT, TK_FROM, TK_JOIN_KW, sl@0: TK_LIKE_KW, TK_BY, TK_IF, TK_INTO, TK_OFFSET, sl@0: TK_OF, TK_SET, TK_ISNULL, TK_ORDER, TK_RESTRICT, sl@0: TK_JOIN_KW, TK_JOIN_KW, TK_ROLLBACK, TK_ROW, TK_UNION, sl@0: TK_USING, TK_VACUUM, TK_VIEW, TK_INITIALLY, TK_ALL, sl@0: }; sl@0: int h, i; sl@0: if( n<2 ) return TK_ID; sl@0: h = ((charMap(z[0])*4) ^ sl@0: (charMap(z[n-1])*3) ^ sl@0: n) % 127; sl@0: for(i=((int)aHash[h])-1; i>=0; i=((int)aNext[i])-1){ sl@0: if( aLen[i]==n && sqlite3StrNICmp(&zText[aOffset[i]],z,n)==0 ){ sl@0: return aCode[i]; sl@0: } sl@0: } sl@0: return TK_ID; sl@0: } sl@0: int sqlite3KeywordCode(const unsigned char *z, int n){ sl@0: return keywordCode((char*)z, n); sl@0: }