| OLD | NEW |
|---|
| (Empty) | |
| 1 /* |
| 2 ** Compile and run this standalone program in order to generate code that |
| 3 ** implements a function that will translate alphabetic identifiers into |
| 4 ** parser token codes. |
| 5 */ |
| 6 #include <stdio.h> |
| 7 #include <string.h> |
| 8 #include <stdlib.h> |
| 9 #include <assert.h> |
| 10 |
| 11 /* |
| 12 ** A header comment placed at the beginning of generated code. |
| 13 */ |
| 14 static const char zHdr[] = |
| 15 "/***** This file contains automatically generated code ******\n" |
| 16 "**\n" |
| 17 "** The code in this file has been automatically generated by\n" |
| 18 "**\n" |
| 19 "** sqlite/tool/mkkeywordhash.c\n" |
| 20 "**\n" |
| 21 "** The code in this file implements a function that determines whether\n" |
| 22 "** or not a given identifier is really an SQL keyword. The same thing\n" |
| 23 "** might be implemented more directly using a hand-written hash table.\n" |
| 24 "** But by using this automatically generated code, the size of the code\n" |
| 25 "** is substantially reduced. This is important for embedded applications\n" |
| 26 "** on platforms with limited memory.\n" |
| 27 "*/\n" |
| 28 ; |
| 29 |
| 30 /* |
| 31 ** All the keywords of the SQL language are stored in a hash |
| 32 ** table composed of instances of the following structure. |
| 33 */ |
| 34 typedef struct Keyword Keyword; |
| 35 struct Keyword { |
| 36 char *zName; /* The keyword name */ |
| 37 char *zTokenType; /* Token value for this keyword */ |
| 38 int mask; /* Code this keyword if non-zero */ |
| 39 int id; /* Unique ID for this record */ |
| 40 int hash; /* Hash on the keyword */ |
| 41 int offset; /* Offset to start of name string */ |
| 42 int len; /* Length of this keyword, not counting final \000 */ |
| 43 int prefix; /* Number of characters in prefix */ |
| 44 int longestSuffix; /* Longest suffix that is a prefix on another word */ |
| 45 int iNext; /* Index in aKeywordTable[] of next with same hash */ |
| 46 int substrId; /* Id to another keyword this keyword is embedded in */ |
| 47 int substrOffset; /* Offset into substrId for start of this keyword */ |
| 48 char zOrigName[20]; /* Original keyword name before processing */ |
| 49 }; |
| 50 |
| 51 /* |
| 52 ** Define masks used to determine which keywords are allowed |
| 53 */ |
| 54 #ifdef SQLITE_OMIT_ALTERTABLE |
| 55 # define ALTER 0 |
| 56 #else |
| 57 # define ALTER 0x00000001 |
| 58 #endif |
| 59 #define ALWAYS 0x00000002 |
| 60 #ifdef SQLITE_OMIT_ANALYZE |
| 61 # define ANALYZE 0 |
| 62 #else |
| 63 # define ANALYZE 0x00000004 |
| 64 #endif |
| 65 #ifdef SQLITE_OMIT_ATTACH |
| 66 # define ATTACH 0 |
| 67 #else |
| 68 # define ATTACH 0x00000008 |
| 69 #endif |
| 70 #ifdef SQLITE_OMIT_AUTOINCREMENT |
| 71 # define AUTOINCR 0 |
| 72 #else |
| 73 # define AUTOINCR 0x00000010 |
| 74 #endif |
| 75 #ifdef SQLITE_OMIT_CAST |
| 76 # define CAST 0 |
| 77 #else |
| 78 # define CAST 0x00000020 |
| 79 #endif |
| 80 #ifdef SQLITE_OMIT_COMPOUND_SELECT |
| 81 # define COMPOUND 0 |
| 82 #else |
| 83 # define COMPOUND 0x00000040 |
| 84 #endif |
| 85 #ifdef SQLITE_OMIT_CONFLICT_CLAUSE |
| 86 # define CONFLICT 0 |
| 87 #else |
| 88 # define CONFLICT 0x00000080 |
| 89 #endif |
| 90 #ifdef SQLITE_OMIT_EXPLAIN |
| 91 # define EXPLAIN 0 |
| 92 #else |
| 93 # define EXPLAIN 0x00000100 |
| 94 #endif |
| 95 #ifdef SQLITE_OMIT_FOREIGN_KEY |
| 96 # define FKEY 0 |
| 97 #else |
| 98 # define FKEY 0x00000200 |
| 99 #endif |
| 100 #ifdef SQLITE_OMIT_PRAGMA |
| 101 # define PRAGMA 0 |
| 102 #else |
| 103 # define PRAGMA 0x00000400 |
| 104 #endif |
| 105 #ifdef SQLITE_OMIT_REINDEX |
| 106 # define REINDEX 0 |
| 107 #else |
| 108 # define REINDEX 0x00000800 |
| 109 #endif |
| 110 #ifdef SQLITE_OMIT_SUBQUERY |
| 111 # define SUBQUERY 0 |
| 112 #else |
| 113 # define SUBQUERY 0x00001000 |
| 114 #endif |
| 115 #ifdef SQLITE_OMIT_TRIGGER |
| 116 # define TRIGGER 0 |
| 117 #else |
| 118 # define TRIGGER 0x00002000 |
| 119 #endif |
| 120 #if defined(SQLITE_OMIT_AUTOVACUUM) && \ |
| 121 (defined(SQLITE_OMIT_VACUUM) || defined(SQLITE_OMIT_ATTACH)) |
| 122 # define VACUUM 0 |
| 123 #else |
| 124 # define VACUUM 0x00004000 |
| 125 #endif |
| 126 #ifdef SQLITE_OMIT_VIEW |
| 127 # define VIEW 0 |
| 128 #else |
| 129 # define VIEW 0x00008000 |
| 130 #endif |
| 131 #ifdef SQLITE_OMIT_VIRTUALTABLE |
| 132 # define VTAB 0 |
| 133 #else |
| 134 # define VTAB 0x00010000 |
| 135 #endif |
| 136 #ifdef SQLITE_OMIT_AUTOVACUUM |
| 137 # define AUTOVACUUM 0 |
| 138 #else |
| 139 # define AUTOVACUUM 0x00020000 |
| 140 #endif |
| 141 #ifdef SQLITE_OMIT_CTE |
| 142 # define CTE 0 |
| 143 #else |
| 144 # define CTE 0x00040000 |
| 145 #endif |
| 146 |
| 147 /* |
| 148 ** These are the keywords |
| 149 */ |
| 150 static Keyword aKeywordTable[] = { |
| 151 { "ABORT", "TK_ABORT", CONFLICT|TRIGGER }, |
| 152 { "ACTION", "TK_ACTION", FKEY }, |
| 153 { "ADD", "TK_ADD", ALTER }, |
| 154 { "AFTER", "TK_AFTER", TRIGGER }, |
| 155 { "ALL", "TK_ALL", ALWAYS }, |
| 156 { "ALTER", "TK_ALTER", ALTER }, |
| 157 { "ANALYZE", "TK_ANALYZE", ANALYZE }, |
| 158 { "AND", "TK_AND", ALWAYS }, |
| 159 { "AS", "TK_AS", ALWAYS }, |
| 160 { "ASC", "TK_ASC", ALWAYS }, |
| 161 { "ATTACH", "TK_ATTACH", ATTACH }, |
| 162 { "AUTOINCREMENT", "TK_AUTOINCR", AUTOINCR }, |
| 163 { "BEFORE", "TK_BEFORE", TRIGGER }, |
| 164 { "BEGIN", "TK_BEGIN", ALWAYS }, |
| 165 { "BETWEEN", "TK_BETWEEN", ALWAYS }, |
| 166 { "BY", "TK_BY", ALWAYS }, |
| 167 { "CASCADE", "TK_CASCADE", FKEY }, |
| 168 { "CASE", "TK_CASE", ALWAYS }, |
| 169 { "CAST", "TK_CAST", CAST }, |
| 170 { "CHECK", "TK_CHECK", ALWAYS }, |
| 171 { "COLLATE", "TK_COLLATE", ALWAYS }, |
| 172 { "COLUMN", "TK_COLUMNKW", ALTER }, |
| 173 { "COMMIT", "TK_COMMIT", ALWAYS }, |
| 174 { "CONFLICT", "TK_CONFLICT", CONFLICT }, |
| 175 { "CONSTRAINT", "TK_CONSTRAINT", ALWAYS }, |
| 176 { "CREATE", "TK_CREATE", ALWAYS }, |
| 177 { "CROSS", "TK_JOIN_KW", ALWAYS }, |
| 178 { "CURRENT_DATE", "TK_CTIME_KW", ALWAYS }, |
| 179 { "CURRENT_TIME", "TK_CTIME_KW", ALWAYS }, |
| 180 { "CURRENT_TIMESTAMP","TK_CTIME_KW", ALWAYS }, |
| 181 { "DATABASE", "TK_DATABASE", ATTACH }, |
| 182 { "DEFAULT", "TK_DEFAULT", ALWAYS }, |
| 183 { "DEFERRED", "TK_DEFERRED", ALWAYS }, |
| 184 { "DEFERRABLE", "TK_DEFERRABLE", FKEY }, |
| 185 { "DELETE", "TK_DELETE", ALWAYS }, |
| 186 { "DESC", "TK_DESC", ALWAYS }, |
| 187 { "DETACH", "TK_DETACH", ATTACH }, |
| 188 { "DISTINCT", "TK_DISTINCT", ALWAYS }, |
| 189 { "DROP", "TK_DROP", ALWAYS }, |
| 190 { "END", "TK_END", ALWAYS }, |
| 191 { "EACH", "TK_EACH", TRIGGER }, |
| 192 { "ELSE", "TK_ELSE", ALWAYS }, |
| 193 { "ESCAPE", "TK_ESCAPE", ALWAYS }, |
| 194 { "EXCEPT", "TK_EXCEPT", COMPOUND }, |
| 195 { "EXCLUSIVE", "TK_EXCLUSIVE", ALWAYS }, |
| 196 { "EXISTS", "TK_EXISTS", ALWAYS }, |
| 197 { "EXPLAIN", "TK_EXPLAIN", EXPLAIN }, |
| 198 { "FAIL", "TK_FAIL", CONFLICT|TRIGGER }, |
| 199 { "FOR", "TK_FOR", TRIGGER }, |
| 200 { "FOREIGN", "TK_FOREIGN", FKEY }, |
| 201 { "FROM", "TK_FROM", ALWAYS }, |
| 202 { "FULL", "TK_JOIN_KW", ALWAYS }, |
| 203 { "GLOB", "TK_LIKE_KW", ALWAYS }, |
| 204 { "GROUP", "TK_GROUP", ALWAYS }, |
| 205 { "HAVING", "TK_HAVING", ALWAYS }, |
| 206 { "IF", "TK_IF", ALWAYS }, |
| 207 { "IGNORE", "TK_IGNORE", CONFLICT|TRIGGER }, |
| 208 { "IMMEDIATE", "TK_IMMEDIATE", ALWAYS }, |
| 209 { "IN", "TK_IN", ALWAYS }, |
| 210 { "INDEX", "TK_INDEX", ALWAYS }, |
| 211 { "INDEXED", "TK_INDEXED", ALWAYS }, |
| 212 { "INITIALLY", "TK_INITIALLY", FKEY }, |
| 213 { "INNER", "TK_JOIN_KW", ALWAYS }, |
| 214 { "INSERT", "TK_INSERT", ALWAYS }, |
| 215 { "INSTEAD", "TK_INSTEAD", TRIGGER }, |
| 216 { "INTERSECT", "TK_INTERSECT", COMPOUND }, |
| 217 { "INTO", "TK_INTO", ALWAYS }, |
| 218 { "IS", "TK_IS", ALWAYS }, |
| 219 { "ISNULL", "TK_ISNULL", ALWAYS }, |
| 220 { "JOIN", "TK_JOIN", ALWAYS }, |
| 221 { "KEY", "TK_KEY", ALWAYS }, |
| 222 { "LEFT", "TK_JOIN_KW", ALWAYS }, |
| 223 { "LIKE", "TK_LIKE_KW", ALWAYS }, |
| 224 { "LIMIT", "TK_LIMIT", ALWAYS }, |
| 225 { "MATCH", "TK_MATCH", ALWAYS }, |
| 226 { "NATURAL", "TK_JOIN_KW", ALWAYS }, |
| 227 { "NO", "TK_NO", FKEY }, |
| 228 { "NOT", "TK_NOT", ALWAYS }, |
| 229 { "NOTNULL", "TK_NOTNULL", ALWAYS }, |
| 230 { "NULL", "TK_NULL", ALWAYS }, |
| 231 { "OF", "TK_OF", ALWAYS }, |
| 232 { "OFFSET", "TK_OFFSET", ALWAYS }, |
| 233 { "ON", "TK_ON", ALWAYS }, |
| 234 { "OR", "TK_OR", ALWAYS }, |
| 235 { "ORDER", "TK_ORDER", ALWAYS }, |
| 236 { "OUTER", "TK_JOIN_KW", ALWAYS }, |
| 237 { "PLAN", "TK_PLAN", EXPLAIN }, |
| 238 { "PRAGMA", "TK_PRAGMA", PRAGMA }, |
| 239 { "PRIMARY", "TK_PRIMARY", ALWAYS }, |
| 240 { "QUERY", "TK_QUERY", EXPLAIN }, |
| 241 { "RAISE", "TK_RAISE", TRIGGER }, |
| 242 { "RECURSIVE", "TK_RECURSIVE", CTE }, |
| 243 { "REFERENCES", "TK_REFERENCES", FKEY }, |
| 244 { "REGEXP", "TK_LIKE_KW", ALWAYS }, |
| 245 { "REINDEX", "TK_REINDEX", REINDEX }, |
| 246 { "RELEASE", "TK_RELEASE", ALWAYS }, |
| 247 { "RENAME", "TK_RENAME", ALTER }, |
| 248 { "REPLACE", "TK_REPLACE", CONFLICT }, |
| 249 { "RESTRICT", "TK_RESTRICT", FKEY }, |
| 250 { "RIGHT", "TK_JOIN_KW", ALWAYS }, |
| 251 { "ROLLBACK", "TK_ROLLBACK", ALWAYS }, |
| 252 { "ROW", "TK_ROW", TRIGGER }, |
| 253 { "SAVEPOINT", "TK_SAVEPOINT", ALWAYS }, |
| 254 { "SELECT", "TK_SELECT", ALWAYS }, |
| 255 { "SET", "TK_SET", ALWAYS }, |
| 256 { "TABLE", "TK_TABLE", ALWAYS }, |
| 257 { "TEMP", "TK_TEMP", ALWAYS }, |
| 258 { "TEMPORARY", "TK_TEMP", ALWAYS }, |
| 259 { "THEN", "TK_THEN", ALWAYS }, |
| 260 { "TO", "TK_TO", ALWAYS }, |
| 261 { "TRANSACTION", "TK_TRANSACTION", ALWAYS }, |
| 262 { "TRIGGER", "TK_TRIGGER", TRIGGER }, |
| 263 { "UNION", "TK_UNION", COMPOUND }, |
| 264 { "UNIQUE", "TK_UNIQUE", ALWAYS }, |
| 265 { "UPDATE", "TK_UPDATE", ALWAYS }, |
| 266 { "USING", "TK_USING", ALWAYS }, |
| 267 { "VACUUM", "TK_VACUUM", VACUUM }, |
| 268 { "VALUES", "TK_VALUES", ALWAYS }, |
| 269 { "VIEW", "TK_VIEW", VIEW }, |
| 270 { "VIRTUAL", "TK_VIRTUAL", VTAB }, |
| 271 { "WITH", "TK_WITH", CTE }, |
| 272 { "WITHOUT", "TK_WITHOUT", ALWAYS }, |
| 273 { "WHEN", "TK_WHEN", ALWAYS }, |
| 274 { "WHERE", "TK_WHERE", ALWAYS }, |
| 275 }; |
| 276 |
| 277 /* Number of keywords */ |
| 278 static int nKeyword = (sizeof(aKeywordTable)/sizeof(aKeywordTable[0])); |
| 279 |
| 280 /* Map all alphabetic characters into lower-case for hashing. This is |
| 281 ** only valid for alphabetics. In particular it does not work for '_' |
| 282 ** and so the hash cannot be on a keyword position that might be an '_'. |
| 283 */ |
| 284 #define charMap(X) (0x20|(X)) |
| 285 |
| 286 /* |
| 287 ** Comparision function for two Keyword records |
| 288 */ |
| 289 static int keywordCompare1(const void *a, const void *b){ |
| 290 const Keyword *pA = (Keyword*)a; |
| 291 const Keyword *pB = (Keyword*)b; |
| 292 int n = pA->len - pB->len; |
| 293 if( n==0 ){ |
| 294 n = strcmp(pA->zName, pB->zName); |
| 295 } |
| 296 assert( n!=0 ); |
| 297 return n; |
| 298 } |
| 299 static int keywordCompare2(const void *a, const void *b){ |
| 300 const Keyword *pA = (Keyword*)a; |
| 301 const Keyword *pB = (Keyword*)b; |
| 302 int n = pB->longestSuffix - pA->longestSuffix; |
| 303 if( n==0 ){ |
| 304 n = strcmp(pA->zName, pB->zName); |
| 305 } |
| 306 assert( n!=0 ); |
| 307 return n; |
| 308 } |
| 309 static int keywordCompare3(const void *a, const void *b){ |
| 310 const Keyword *pA = (Keyword*)a; |
| 311 const Keyword *pB = (Keyword*)b; |
| 312 int n = pA->offset - pB->offset; |
| 313 if( n==0 ) n = pB->id - pA->id; |
| 314 assert( n!=0 ); |
| 315 return n; |
| 316 } |
| 317 |
| 318 /* |
| 319 ** Return a KeywordTable entry with the given id |
| 320 */ |
| 321 static Keyword *findById(int id){ |
| 322 int i; |
| 323 for(i=0; i<nKeyword; i++){ |
| 324 if( aKeywordTable[i].id==id ) break; |
| 325 } |
| 326 return &aKeywordTable[i]; |
| 327 } |
| 328 |
| 329 /* |
| 330 ** This routine does the work. The generated code is printed on standard |
| 331 ** output. |
| 332 */ |
| 333 int main(int argc, char **argv){ |
| 334 int i, j, k, h; |
| 335 int bestSize, bestCount; |
| 336 int count; |
| 337 int nChar; |
| 338 int totalLen = 0; |
| 339 int aHash[1000]; /* 1000 is much bigger than nKeyword */ |
| 340 char zText[2000]; |
| 341 |
| 342 /* Remove entries from the list of keywords that have mask==0 */ |
| 343 for(i=j=0; i<nKeyword; i++){ |
| 344 if( aKeywordTable[i].mask==0 ) continue; |
| 345 if( j<i ){ |
| 346 aKeywordTable[j] = aKeywordTable[i]; |
| 347 } |
| 348 j++; |
| 349 } |
| 350 nKeyword = j; |
| 351 |
| 352 /* Fill in the lengths of strings and hashes for all entries. */ |
| 353 for(i=0; i<nKeyword; i++){ |
| 354 Keyword *p = &aKeywordTable[i]; |
| 355 p->len = (int)strlen(p->zName); |
| 356 assert( p->len<sizeof(p->zOrigName) ); |
| 357 memcpy(p->zOrigName, p->zName, p->len+1); |
| 358 totalLen += p->len; |
| 359 p->hash = (charMap(p->zName[0])*4) ^ |
| 360 (charMap(p->zName[p->len-1])*3) ^ (p->len*1); |
| 361 p->id = i+1; |
| 362 } |
| 363 |
| 364 /* Sort the table from shortest to longest keyword */ |
| 365 qsort(aKeywordTable, nKeyword, sizeof(aKeywordTable[0]), keywordCompare1); |
| 366 |
| 367 /* Look for short keywords embedded in longer keywords */ |
| 368 for(i=nKeyword-2; i>=0; i--){ |
| 369 Keyword *p = &aKeywordTable[i]; |
| 370 for(j=nKeyword-1; j>i && p->substrId==0; j--){ |
| 371 Keyword *pOther = &aKeywordTable[j]; |
| 372 if( pOther->substrId ) continue; |
| 373 if( pOther->len<=p->len ) continue; |
| 374 for(k=0; k<=pOther->len-p->len; k++){ |
| 375 if( memcmp(p->zName, &pOther->zName[k], p->len)==0 ){ |
| 376 p->substrId = pOther->id; |
| 377 p->substrOffset = k; |
| 378 break; |
| 379 } |
| 380 } |
| 381 } |
| 382 } |
| 383 |
| 384 /* Compute the longestSuffix value for every word */ |
| 385 for(i=0; i<nKeyword; i++){ |
| 386 Keyword *p = &aKeywordTable[i]; |
| 387 if( p->substrId ) continue; |
| 388 for(j=0; j<nKeyword; j++){ |
| 389 Keyword *pOther; |
| 390 if( j==i ) continue; |
| 391 pOther = &aKeywordTable[j]; |
| 392 if( pOther->substrId ) continue; |
| 393 for(k=p->longestSuffix+1; k<p->len && k<pOther->len; k++){ |
| 394 if( memcmp(&p->zName[p->len-k], pOther->zName, k)==0 ){ |
| 395 p->longestSuffix = k; |
| 396 } |
| 397 } |
| 398 } |
| 399 } |
| 400 |
| 401 /* Sort the table into reverse order by length */ |
| 402 qsort(aKeywordTable, nKeyword, sizeof(aKeywordTable[0]), keywordCompare2); |
| 403 |
| 404 /* Fill in the offset for all entries */ |
| 405 nChar = 0; |
| 406 for(i=0; i<nKeyword; i++){ |
| 407 Keyword *p = &aKeywordTable[i]; |
| 408 if( p->offset>0 || p->substrId ) continue; |
| 409 p->offset = nChar; |
| 410 nChar += p->len; |
| 411 for(k=p->len-1; k>=1; k--){ |
| 412 for(j=i+1; j<nKeyword; j++){ |
| 413 Keyword *pOther = &aKeywordTable[j]; |
| 414 if( pOther->offset>0 || pOther->substrId ) continue; |
| 415 if( pOther->len<=k ) continue; |
| 416 if( memcmp(&p->zName[p->len-k], pOther->zName, k)==0 ){ |
| 417 p = pOther; |
| 418 p->offset = nChar - k; |
| 419 nChar = p->offset + p->len; |
| 420 p->zName += k; |
| 421 p->len -= k; |
| 422 p->prefix = k; |
| 423 j = i; |
| 424 k = p->len; |
| 425 } |
| 426 } |
| 427 } |
| 428 } |
| 429 for(i=0; i<nKeyword; i++){ |
| 430 Keyword *p = &aKeywordTable[i]; |
| 431 if( p->substrId ){ |
| 432 p->offset = findById(p->substrId)->offset + p->substrOffset; |
| 433 } |
| 434 } |
| 435 |
| 436 /* Sort the table by offset */ |
| 437 qsort(aKeywordTable, nKeyword, sizeof(aKeywordTable[0]), keywordCompare3); |
| 438 |
| 439 /* Figure out how big to make the hash table in order to minimize the |
| 440 ** number of collisions */ |
| 441 bestSize = nKeyword; |
| 442 bestCount = nKeyword*nKeyword; |
| 443 for(i=nKeyword/2; i<=2*nKeyword; i++){ |
| 444 for(j=0; j<i; j++) aHash[j] = 0; |
| 445 for(j=0; j<nKeyword; j++){ |
| 446 h = aKeywordTable[j].hash % i; |
| 447 aHash[h] *= 2; |
| 448 aHash[h]++; |
| 449 } |
| 450 for(j=count=0; j<i; j++) count += aHash[j]; |
| 451 if( count<bestCount ){ |
| 452 bestCount = count; |
| 453 bestSize = i; |
| 454 } |
| 455 } |
| 456 |
| 457 /* Compute the hash */ |
| 458 for(i=0; i<bestSize; i++) aHash[i] = 0; |
| 459 for(i=0; i<nKeyword; i++){ |
| 460 h = aKeywordTable[i].hash % bestSize; |
| 461 aKeywordTable[i].iNext = aHash[h]; |
| 462 aHash[h] = i+1; |
| 463 } |
| 464 |
| 465 /* Begin generating code */ |
| 466 printf("%s", zHdr); |
| 467 printf("/* Hash score: %d */\n", bestCount); |
| 468 printf("static int keywordCode(const char *z, int n, int *pType){\n"); |
| 469 printf(" /* zText[] encodes %d bytes of keywords in %d bytes */\n", |
| 470 totalLen + nKeyword, nChar+1 ); |
| 471 for(i=j=k=0; i<nKeyword; i++){ |
| 472 Keyword *p = &aKeywordTable[i]; |
| 473 if( p->substrId ) continue; |
| 474 memcpy(&zText[k], p->zName, p->len); |
| 475 k += p->len; |
| 476 if( j+p->len>70 ){ |
| 477 printf("%*s */\n", 74-j, ""); |
| 478 j = 0; |
| 479 } |
| 480 if( j==0 ){ |
| 481 printf(" /* "); |
| 482 j = 8; |
| 483 } |
| 484 printf("%s", p->zName); |
| 485 j += p->len; |
| 486 } |
| 487 if( j>0 ){ |
| 488 printf("%*s */\n", 74-j, ""); |
| 489 } |
| 490 printf(" static const char zText[%d] = {\n", nChar); |
| 491 zText[nChar] = 0; |
| 492 for(i=j=0; i<k; i++){ |
| 493 if( j==0 ){ |
| 494 printf(" "); |
| 495 } |
| 496 if( zText[i]==0 ){ |
| 497 printf("0"); |
| 498 }else{ |
| 499 printf("'%c',", zText[i]); |
| 500 } |
| 501 j += 4; |
| 502 if( j>68 ){ |
| 503 printf("\n"); |
| 504 j = 0; |
| 505 } |
| 506 } |
| 507 if( j>0 ) printf("\n"); |
| 508 printf(" };\n"); |
| 509 |
| 510 printf(" static const unsigned char aHash[%d] = {\n", bestSize); |
| 511 for(i=j=0; i<bestSize; i++){ |
| 512 if( j==0 ) printf(" "); |
| 513 printf(" %3d,", aHash[i]); |
| 514 j++; |
| 515 if( j>12 ){ |
| 516 printf("\n"); |
| 517 j = 0; |
| 518 } |
| 519 } |
| 520 printf("%s };\n", j==0 ? "" : "\n"); |
| 521 |
| 522 printf(" static const unsigned char aNext[%d] = {\n", nKeyword); |
| 523 for(i=j=0; i<nKeyword; i++){ |
| 524 if( j==0 ) printf(" "); |
| 525 printf(" %3d,", aKeywordTable[i].iNext); |
| 526 j++; |
| 527 if( j>12 ){ |
| 528 printf("\n"); |
| 529 j = 0; |
| 530 } |
| 531 } |
| 532 printf("%s };\n", j==0 ? "" : "\n"); |
| 533 |
| 534 printf(" static const unsigned char aLen[%d] = {\n", nKeyword); |
| 535 for(i=j=0; i<nKeyword; i++){ |
| 536 if( j==0 ) printf(" "); |
| 537 printf(" %3d,", aKeywordTable[i].len+aKeywordTable[i].prefix); |
| 538 j++; |
| 539 if( j>12 ){ |
| 540 printf("\n"); |
| 541 j = 0; |
| 542 } |
| 543 } |
| 544 printf("%s };\n", j==0 ? "" : "\n"); |
| 545 |
| 546 printf(" static const unsigned short int aOffset[%d] = {\n", nKeyword); |
| 547 for(i=j=0; i<nKeyword; i++){ |
| 548 if( j==0 ) printf(" "); |
| 549 printf(" %3d,", aKeywordTable[i].offset); |
| 550 j++; |
| 551 if( j>12 ){ |
| 552 printf("\n"); |
| 553 j = 0; |
| 554 } |
| 555 } |
| 556 printf("%s };\n", j==0 ? "" : "\n"); |
| 557 |
| 558 printf(" static const unsigned char aCode[%d] = {\n", nKeyword); |
| 559 for(i=j=0; i<nKeyword; i++){ |
| 560 char *zToken = aKeywordTable[i].zTokenType; |
| 561 if( j==0 ) printf(" "); |
| 562 printf("%s,%*s", zToken, (int)(14-strlen(zToken)), ""); |
| 563 j++; |
| 564 if( j>=5 ){ |
| 565 printf("\n"); |
| 566 j = 0; |
| 567 } |
| 568 } |
| 569 printf("%s };\n", j==0 ? "" : "\n"); |
| 570 |
| 571 printf(" int i, j;\n"); |
| 572 printf(" const char *zKW;\n"); |
| 573 printf(" if( n>=2 ){\n"); |
| 574 printf(" i = ((charMap(z[0])*4) ^ (charMap(z[n-1])*3) ^ n) %% %d;\n", |
| 575 bestSize); |
| 576 printf(" for(i=((int)aHash[i])-1; i>=0; i=((int)aNext[i])-1){\n"); |
| 577 printf(" if( aLen[i]!=n ) continue;\n"); |
| 578 printf(" j = 0;\n"); |
| 579 printf(" zKW = &zText[aOffset[i]];\n"); |
| 580 printf("#ifdef SQLITE_ASCII\n"); |
| 581 printf(" while( j<n && (z[j]&~0x20)==zKW[j] ){ j++; }\n"); |
| 582 printf("#endif\n"); |
| 583 printf("#ifdef SQLITE_EBCDIC\n"); |
| 584 printf(" while( j<n && toupper(z[j])==zKW[j] ){ j++; }\n"); |
| 585 printf("#endif\n"); |
| 586 printf(" if( j<n ) continue;\n"); |
| 587 for(i=0; i<nKeyword; i++){ |
| 588 printf(" testcase( i==%d ); /* %s */\n", |
| 589 i, aKeywordTable[i].zOrigName); |
| 590 } |
| 591 printf(" *pType = aCode[i];\n"); |
| 592 printf(" break;\n"); |
| 593 printf(" }\n"); |
| 594 printf(" }\n"); |
| 595 printf(" return n;\n"); |
| 596 printf("}\n"); |
| 597 printf("int sqlite3KeywordCode(const unsigned char *z, int n){\n"); |
| 598 printf(" int id = TK_ID;\n"); |
| 599 printf(" keywordCode((char*)z, n, &id);\n"); |
| 600 printf(" return id;\n"); |
| 601 printf("}\n"); |
| 602 printf("#define SQLITE_N_KEYWORD %d\n", nKeyword); |
| 603 |
| 604 return 0; |
| 605 } |
| OLD | NEW |
|---|
Chromium Code Reviews
Issue 2747283002:
[sql] Import reference version of SQLite 3.17.. (Closed)
