6f0cef9353
The code associated with EXEC SQL DEFINE was unreadable and full of bugs, notably: * It'd attempt to free a non-malloced string if the ecpg program tries to redefine a macro that was defined on the command line. * Possible memory stomp if user writes "-D=foo". * Undef'ing or redefining a macro defined on the command line would change the state visible to the next file, when multiple files are specified on the command line. (While possibly that could have been an intentional choice, the code clearly intends to revert to the original macro state; it's just failing to consider this interaction.) * Missing "break" in defining a new macro meant that redefinition of an existing name would cause an extra entry to be added to the definition list. While not immediately harmful, a subsequent undef would result in the prior entry becoming visible again. * The interactions with input buffering are subtle and were entirely undocumented. It's not that surprising that we hadn't noticed these bugs, because there was no test coverage at all of either the -D command line switch or multiple input files. This patch adds such coverage (in a rather hacky way I guess). In addition to the code bugs, the user documentation was confused about whether the -D switch defines a C macro or an ecpg one, and it failed to mention that you can write "-Dsymbol=value". These problems are old, so back-patch to all supported branches. Discussion: https://postgr.es/m/998011.1713217712@sss.pgh.pa.us |
||
---|---|---|
.. | ||
po | ||
.gitignore | ||
Makefile | ||
README.parser | ||
c_keywords.c | ||
c_kwlist.h | ||
check_rules.pl | ||
descriptor.c | ||
ecpg.addons | ||
ecpg.c | ||
ecpg.header | ||
ecpg.tokens | ||
ecpg.trailer | ||
ecpg.type | ||
ecpg_keywords.c | ||
ecpg_kwlist.h | ||
keywords.c | ||
meson.build | ||
nls.mk | ||
output.c | ||
parse.pl | ||
parser.c | ||
pgc.l | ||
preproc_extern.h | ||
type.c | ||
type.h | ||
variable.c |
README.parser
ECPG modifies and extends the core grammar in a way that 1) every token in ECPG is <str> type. New tokens are defined in ecpg.tokens, types are defined in ecpg.type 2) most tokens from the core grammar are simply converted to literals concatenated together to form the SQL string passed to the server, this is done by parse.pl. 3) some rules need side-effects, actions are either added or completely overridden (compared to the basic token concatenation) for them, these are defined in ecpg.addons, the rules for ecpg.addons are explained below. 4) new grammar rules are needed for ECPG metacommands. These are in ecpg.trailer. 5) ecpg.header contains common functions, etc. used by actions for grammar rules. In "ecpg.addons", every modified rule follows this pattern: ECPG: dumpedtokens postfix where "dumpedtokens" is simply tokens from core gram.y's rules concatenated together. e.g. if gram.y has this: ruleA: tokenA tokenB tokenC {...} then "dumpedtokens" is "ruleAtokenAtokenBtokenC". "postfix" above can be: a) "block" - the automatic rule created by parse.pl is completely overridden, the code block has to be written completely as it were in a plain bison grammar b) "rule" - the automatic rule is extended on, so new syntaxes are accepted for "ruleA". E.g.: ECPG: ruleAtokenAtokenBtokenC rule | tokenD tokenE { action_code; } ... It will be substituted with: ruleA: <original syntax forms and actions up to and including "tokenA tokenB tokenC"> | tokenD tokenE { action_code; } ... c) "addon" - the automatic action for the rule (SQL syntax constructed from the tokens concatenated together) is prepended with a new action code part. This code part is written as is's already inside the { ... } Multiple "addon" or "block" lines may appear together with the new code block if the code block is common for those rules.