4 ** The author disclaims copyright to this source code. In place of
5 ** a legal notice, here is a blessing:
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.
11 *************************************************************************
12 ** An tokenizer for SQL
14 ** This file contains C code that splits an SQL input string up into
15 ** individual tokens and sends those tokens one-by-one over to the
16 ** parser for analysis.
25 #include "wine/unicode.h"
30 ** All the keywords of the SQL language are stored as in a hash
31 ** table composed of instances of the following structure.
33 typedef struct Keyword Keyword;
35 const WCHAR *zName; /* The keyword name */
36 int tokenType; /* The token value for this keyword */
39 #define MAX_TOKEN_LEN 11
41 static const WCHAR ALTER_W[] = { 'A','L','T','E','R',0 };
42 static const WCHAR AND_W[] = { 'A','N','D',0 };
43 static const WCHAR BY_W[] = { 'B','Y',0 };
44 static const WCHAR CHAR_W[] = { 'C','H','A','R',0 };
45 static const WCHAR CHARACTER_W[] = { 'C','H','A','R','A','C','T','E','R',0 };
46 static const WCHAR CREATE_W[] = { 'C','R','E','A','T','E',0 };
47 static const WCHAR DELETE_W[] = { 'D','E','L','E','T','E',0 };
48 static const WCHAR DISTINCT_W[] = { 'D','I','S','T','I','N','C','T',0 };
49 static const WCHAR FREE_W[] = { 'F','R','E','E',0 };
50 static const WCHAR FROM_W[] = { 'F','R','O','M',0 };
51 static const WCHAR HOLD_W[] = { 'H','O','L','D',0 };
52 static const WCHAR INSERT_W[] = { 'I','N','S','E','R','T',0 };
53 static const WCHAR INT_W[] = { 'I','N','T',0 };
54 static const WCHAR INTEGER_W[] = { 'I','N','T','E','G','E','R',0 };
55 static const WCHAR INTO_W[] = { 'I','N','T','O',0 };
56 static const WCHAR IS_W[] = { 'I','S',0 };
57 static const WCHAR KEY_W[] = { 'K','E','Y',0 };
58 static const WCHAR LIKE_W[] = { 'L','I','K','E',0 };
59 static const WCHAR LOCALIZABLE_W[] = { 'L','O','C','A','L','I','Z','A','B','L','E',0 };
60 static const WCHAR LONG_W[] = { 'L','O','N','G',0 };
61 static const WCHAR LONGCHAR_W[] = { 'L','O','N','G','C','H','A','R',0 };
62 static const WCHAR NOT_W[] = { 'N','O','T',0 };
63 static const WCHAR NULL_W[] = { 'N','U','L','L',0 };
64 static const WCHAR OBJECT_W[] = { 'O','B','J','E','C','T',0 };
65 static const WCHAR OR_W[] = { 'O','R',0 };
66 static const WCHAR ORDER_W[] = { 'O','R','D','E','R',0 };
67 static const WCHAR PRIMARY_W[] = { 'P','R','I','M','A','R','Y',0 };
68 static const WCHAR SELECT_W[] = { 'S','E','L','E','C','T',0 };
69 static const WCHAR SET_W[] = { 'S','E','T',0 };
70 static const WCHAR SHORT_W[] = { 'S','H','O','R','T',0 };
71 static const WCHAR TABLE_W[] = { 'T','A','B','L','E',0 };
72 static const WCHAR TEMPORARY_W[] = { 'T','E','M','P','O','R','A','R','Y',0 };
73 static const WCHAR UPDATE_W[] = { 'U','P','D','A','T','E',0 };
74 static const WCHAR VALUES_W[] = { 'V','A','L','U','E','S',0 };
75 static const WCHAR WHERE_W[] = { 'W','H','E','R','E',0 };
78 ** These are the keywords
80 static const Keyword aKeywordTable[] = {
81 { ALTER_W, TK_ALTER },
85 { CHARACTER_W, TK_CHAR },
86 { CREATE_W, TK_CREATE },
87 { DELETE_W, TK_DELETE },
88 { DISTINCT_W, TK_DISTINCT },
92 { INSERT_W, TK_INSERT },
94 { INTEGER_W, TK_INT },
99 { LOCALIZABLE_W, TK_LOCALIZABLE },
101 { LONGCHAR_W, TK_LONGCHAR },
104 { OBJECT_W, TK_OBJECT },
106 { ORDER_W, TK_ORDER },
107 { PRIMARY_W, TK_PRIMARY },
108 { SELECT_W, TK_SELECT },
110 { SHORT_W, TK_SHORT },
111 { TABLE_W, TK_TABLE },
112 { TEMPORARY_W, TK_TEMPORARY },
113 { UPDATE_W, TK_UPDATE },
114 { VALUES_W, TK_VALUES },
115 { WHERE_W, TK_WHERE },
118 #define KEYWORD_COUNT ( sizeof aKeywordTable/sizeof (Keyword) )
121 ** Comparison function for binary search.
123 static int compKeyword(const void *m1, const void *m2){
124 const Keyword *k1 = m1, *k2 = m2;
126 return strcmpiW( k1->zName, k2->zName );
130 ** This function looks up an identifier to determine if it is a
131 ** keyword. If it is a keyword, the token code of that keyword is
132 ** returned. If the input is not a keyword, TK_ID is returned.
134 static int sqliteKeywordCode(const WCHAR *z, int n){
135 WCHAR str[MAX_TOKEN_LEN+1];
138 if( n>MAX_TOKEN_LEN )
141 memcpy( str, z, n*sizeof (WCHAR) );
145 r = bsearch( &key, aKeywordTable, KEYWORD_COUNT, sizeof (Keyword), compKeyword );
153 ** If X is a character that can be used in an identifier then
154 ** isIdChar[X] will be 1. Otherwise isIdChar[X] will be 0.
156 ** In this implementation, an identifier can be a string of
157 ** alphabetic characters, digits, and "_" plus any character
158 ** with the high-order bit set. The latter rule means that
159 ** any sequence of UTF-8 characters or characters taken from
160 ** an extended ISO8859 character set can form an identifier.
162 static const char isIdChar[] = {
163 /* x0 x1 x2 x3 x4 x5 x6 x7 x8 x9 xA xB xC xD xE xF */
164 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x */
165 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 1x */
166 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 2x */
167 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, /* 3x */
168 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 4x */
169 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, /* 5x */
170 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 6x */
171 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, /* 7x */
172 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 8x */
173 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 9x */
174 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* Ax */
175 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* Bx */
176 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* Cx */
177 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* Dx */
178 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* Ex */
179 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* Fx */
184 ** Return the length of the token that begins at z[0]. Return
185 ** -1 if the token is (or might be) incomplete. Store the token
186 ** type in *tokenType before returning.
188 int sqliteGetToken(const WCHAR *z, int *tokenType){
191 case ' ': case '\t': case '\n': case '\f': case '\r': {
192 for(i=1; isspace(z[i]); i++){}
193 *tokenType = TK_SPACE;
197 if( z[1]==0 ) return -1;
198 *tokenType = TK_MINUS;
208 *tokenType = TK_STAR;
217 }else if( z[1]=='>' ){
236 *tokenType = TK_ILLEGAL;
244 *tokenType = TK_WILDCARD;
247 *tokenType = TK_COMMA;
249 case '`': case '\'': {
264 *tokenType = TK_STRING;
268 if( !isdigit(z[1]) ){
272 /* Fall thru into the next case */
274 case '0': case '1': case '2': case '3': case '4':
275 case '5': case '6': case '7': case '8': case '9': {
276 *tokenType = TK_INTEGER;
277 for(i=1; isdigit(z[i]); i++){}
281 for(i=1; z[i] && z[i-1]!=']'; i++){}
289 for(i=1; isIdChar[z[i]]; i++){}
290 *tokenType = sqliteKeywordCode(z, i);
294 *tokenType = TK_ILLEGAL;