1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
|
//******************************************************************************
// Copyright 1996-2009,2021 by Thomas E. Dickey *
// All Rights Reserved. *
// *
// Permission to use, copy, modify, and distribute this software and its *
// documentation for any purpose and without fee is hereby granted, provided *
// that the above copyright notice appear in all copies and that both that *
// copyright notice and this permission notice appear in supporting *
// documentation, and that the name of the above listed copyright holder(s) *
// not be used in advertising or publicity pertaining to distribution of the *
// software without specific, written prior permission. THE ABOVE LISTED *
// COPYRIGHT HOLDER(S) DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, *
// INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO *
// EVENT SHALL THE ABOVE LISTED COPYRIGHT HOLDER(S) BE LIABLE FOR ANY SPECIAL, *
// INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM *
// LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE *
// OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR *
// PERFORMANCE OF THIS SOFTWARE. *
//******************************************************************************
// $Id: execsql.cpp,v 1.22 2021/01/08 23:31:41 tom Exp $
// EXEC SQL parsing & indention
#include <ctype.h>
#include <string.h>
#include "bcpp.h"
#include "cmdline.h" // StrUpr()
// skip to the beginning of the next word, inclusive of the starting position.
int
SqlStruct::NextWord(int start, OutputStruct *pOut)
{
int n = start;
bool reset = false;
TRACE(("esql next:%s\n", pOut -> pCode+start));
while (pOut -> pCode[n] != NULLC
&& (pOut -> pCFlag[n] != Normal || !isName(pOut -> pCode[n])))
{
if (pOut -> pCFlag[n] == Normal
&& pOut -> pCode[n] == '-'
&& pOut -> pCode[n + 1] == '-')
{
TRACE(("esql found comment:%s\n", pOut->pCode + n));
while (pOut -> pCode[n] != NULLC)
{
pOut -> pCFlag[n++] = Ignore;
}
break;
}
if ((pOut -> pCFlag[n] == Normal && !isName(pOut -> pCode[n]))
|| pOut -> pCFlag[n] == DQuoted
|| pOut -> pCFlag[n] == DQuoted)
reset = true;
n++;
}
// Maintain the level-counter as the maximum number of words we could
// have matched. Punctuation resets it, since the SQL-keywords don't
// bypass normal C/C++ syntax.
if (reset)
{
matched[level = 0] = NULLC;
if (state == MoreSQL
&& pOut -> pCFlag[n - 1] == Normal
&& pOut -> pCode[n - 1] == SEMICOLON)
{
TRACE(("esql NextWord reset:%.*s^%s\n",
n - 1, pOut->pCode,
pOut->pCode + n - 1));
state = NotSQL;
}
}
return n;
}
int
SqlStruct::SkipWord(int start, OutputStruct *pOut)
{
int n = start;
TRACE(("esql skip:%s\n", pOut -> pCode+start));
// skip the current word
while (pOut -> pCode[n] != NULLC
&& (ispunct(pOut -> pCFlag[n]) && isName(pOut -> pCode[n])))
n++;
return n;
}
// return true if we've found a keyword which shouldn't be indented
bool
SqlStruct::SqlVerb(const char *code)
{
if (!emptyString(code))
{
const char *table[] = {
"ADD",
"AND",
"APPEND",
"AS",
"BEGIN",
"BETWEEN",
"BODY",
"BY",
"CANCEL",
"CHANGE",
"CLOSE",
"COMMIT",
"CONNECT",
"CONTAIN",
"CONTAINS",
"COUNT",
"CREATE",
"CURRENT",
"CURRVAL",
"CURSOR",
"DECLARE",
"DELETE",
"DISABLE",
"DO",
"DROP",
"ELSE",
"ELSIF",
"ENABLE",
"END",
"ERASE",
"EXCEPTION",
"EXECUTE",
"EXISTS",
"FETCH",
"FOR",
"FROM",
"FUNCTION",
"GRANT",
"GROUP",
"HAVING",
"IF",
"IN",
"INCLUDING",
"INCREMENT",
"INDEX",
"INSERT",
"INTO",
"IS",
"LAST",
"LIKE",
"MAX",
"MIN",
"MOD",
"MODIFY",
"NEW",
"NEXT",
"NEXTVAL",
"NOT",
"NULL",
"NUMBER",
"OF",
"ON",
"ONLY",
"OPEN",
"OR",
"POSITION",
"RAISE",
"RANGE",
"RAW",
"READ",
"RECOVER",
"REM",
"RENAME",
"REPLACE",
"RESUME",
"RETURN",
"REVERSE",
"REVOKE",
"ROLLBACK",
"ROW",
"ROWID",
"SELECT",
"SEQUENCE",
"SET",
"SORT",
"SQL",
"START",
"STOP",
"TABLE",
"THEN",
"THIS",
"TO",
"TRIGGER",
"TRUE",
"UNDER",
"UNION",
"UNIQUE",
"UNTIL",
"UPDATE",
"USE",
"USING",
"VALIDATE",
"VALUES",
"VIEW",
"WHEN",
"WHENEVER",
"WHERE",
"WHILE",
"WITH",
};
for (size_t n = 0; n < TABLESIZE(table); n++)
{
if (CompareKeyword(code, table[n]))
{
return true;
}
}
}
return false;
}
void
SqlStruct::IndentSQL(OutputStruct *pOut)
{
// (Yes, lex/yacc would be more powerful ;-)
const struct {
const char *name;
int code;
} state_keys[] = {
{ "EXEC", '+' },
{ "SQL", 'S' },
{ "EXECUTE", 'x' },
{ "BEGIN", 'b' },
{ "END-EXEC", 'E' }, // match this before "END"
{ "END", 'e' },
{ "DECLARE", 'd' },
{ "SECTION", 's' },
};
const struct {
const char *text;
SqlState code;
} state_strings[] = {
{ "+Sbds", DeclSQL }, // begin declaration
{ "+Seds", NotSQL }, // end declaration
{ "+Sxb", BeginSQL }, // begin statement
{ "E", NotSQL }, // end statement
};
SqlState old_state = state;
char* pUprString = NULL;
// First, look for SQL keywords to see when we've entered a block or
// a statement. Ignore preprocessor-lines.
if (pOut -> pType == Code
&& pOut -> pCode != NULL
&& pOut -> pCFlag != NULL)
{
pUprString = new char[strlen (pOut -> pCode) + 1];
if (pUprString == NULL)
return;
StrUpr (strcpy(pUprString, pOut->pCode));
TRACE(("esql HERE:%s\n", pUprString));
TRACE(("esql FLAG:%s\n", pOut->pCFlag));
for (int n = NextWord(0, pOut);
pOut -> pCode[n] != NULLC;
n = NextWord(n, pOut))
{
bool found = false;
for (size_t m = 0; m < TABLESIZE(state_keys); m++)
{
if (CompareKeyword(pUprString+n, state_keys[m].name))
{
found = true;
matched[level++] = state_keys[m].code;
matched[level] = NULLC;
n += strlen(state_keys[m].name); // fix for END-EXEC
for (size_t j = 0; j < TABLESIZE(state_strings); j++)
{
if (!strcmp(state_strings[j].text, matched))
{
state = state_strings[j].code;
matched[level = 0] = NULLC;
break;
}
}
break;
}
}
if (!found)
{
if (state == NotSQL
&& level >= 2
&& !strncmp(matched, "+S", 2))
{
state = MoreSQL;
TRACE(("esql transition to MoreSQL:%s\n", pOut->pCode + n));
}
matched[level = 0] = NULLC;
}
TRACE(("esql TEST:%s\n", pUprString + n));
TRACE(("->state:%d, level %d, matched:%s\n", state, level, matched));
n = SkipWord(n, pOut);
if (pOut -> pCode[n] == NULLC)
{
break;
}
}
}
if (pOut -> pType != PreP)
{
if (state != NotSQL
&& old_state != 0)
{
pOut -> indentHangs = 1;
if ((state == BeginSQL || state == MoreSQL) && !SqlVerb(pUprString))
pOut -> indentHangs = 2;
TRACE(("esql FIXME-HANG:%d\n", pOut -> indentHangs));
}
else
if (state == NotSQL
&& old_state == MoreSQL)
{
pOut -> indentHangs = 1;
if (!SqlVerb(pUprString))
pOut -> indentHangs = 2;
TRACE(("esql FIXME-HANG2:%d\n", pOut -> indentHangs));
}
}
delete[] pUprString;
}
|
