Skip to content

P
Postgres FD Implementation
Commit d077c614 authored by Marc G. Fournier's avatar Marc G. Fournier
Browse files
Options 

From: Michael Meskes <Michael_Meskes@topmail.de>

+
+ Tue Feb 23 17:32:25 CET 1999
+
+       - Other than a struct a union itself cannot be specified as variable.
+
+ Fri Feb 26 07:18:25 CET 1999
+
+       - Synced preproc.y with gram.y.
+
+ Sat Feb 27 20:30:03 CET 1999
+
+       - Added automatic allocating for NULL pointers.
parent 51f0f6dd
Hide whitespace changes
Inline Side-by-side
Showing with 19942 additions and 244 deletions
src/interfaces/ecpg/ChangeLog
View file @ d077c614
......@@ -475,5 +475,17 @@ Mon Feb 22 19:47:45 CET 1999
requires me to increase the major version number.
- Synced pgc.l with scan.l.
- Added support for unions.
Tue Feb 23 17:32:25 CET 1999
- Other than a struct a union itself cannot be specified as variable.
Fri Feb 26 07:18:25 CET 1999
- Synced preproc.y with gram.y.
Sat Feb 27 20:30:03 CET 1999
- Added automatic allocating for NULL pointers.
- Set library version to 3.0.0
- Set ecpg version to 3.0.0
src/interfaces/ecpg/TODO
View file @ d077c614
......@@ -11,9 +11,11 @@ DESCRIPTOR statement will be ignored.
it would be nice to be able to use :var[:index] as cvariable
support for dynamic SQL with unknown number of variables with SQLDA structure
it would also be nice to be able to work with varchar * (inculding automatic
allocating)
allocate memory for pointers as C input variables
support for dynamic SQL with unknown number of variables with SQLDA structure
or something similar
Missing statements:
- exec sql allocate
......
src/interfaces/ecpg/include/ecpgtype.h
View file @ d077c614
......@@ -43,6 +43,7 @@ extern "C"
ECPGt_varchar, ECPGt_varchar2,
ECPGt_array,
ECPGt_struct,
ECPGt_union,
ECPGt_char_variable,
ECPGt_EOIT, /* End of insert types. */
ECPGt_EORT, /* End of result types. */
......
src/interfaces/ecpg/lib/ecpglib.c
View file @ d077c614
......@@ -64,6 +64,7 @@ struct variable
{
enum ECPGttype type;
void *value;
void *pointer;
long varcharsize;
long arrsize;
long offset;
......@@ -91,6 +92,12 @@ struct prepared_statement
struct prepared_statement *next;
} *prep_stmts = NULL;
struct auto_mem
{
void *pointer;
struct auto_mem *next;
} *auto_allocs = NULL;
static int simple_debug = 0;
static FILE *debugstream = NULL;
......@@ -98,12 +105,25 @@ static void
register_error(long code, char *fmt,...)
{
va_list args;
struct auto_mem *am;
sqlca.sqlcode = code;
va_start(args, fmt);
vsprintf(sqlca.sqlerrm.sqlerrmc, fmt, args);
va_end(args);
sqlca.sqlerrm.sqlerrml = strlen(sqlca.sqlerrm.sqlerrmc);
/* free all memory we allocate for the user */
for (am = auto_allocs; am;)
{
struct auto_mem *act = am;
am = am->next;
free(act->pointer);
free(act);
}
auto_allocs = NULL;
}
static struct connection *
......@@ -166,7 +186,7 @@ ecpg_alloc(long size, int lineno)
register_error(ECPG_OUT_OF_MEMORY, "out of memory in line %d", lineno);
return NULL;
}
memset(new, '\0', size);
return (new);
}
......@@ -186,6 +206,15 @@ ecpg_strdup(const char *string, int lineno)
return (new);
}
static void
add_mem(void *ptr, int lineno)
{
struct auto_mem *am = (struct auto_mem *) ecpg_alloc(sizeof(struct auto_mem), lineno);
am->next = auto_allocs;
auto_allocs = am;
}
/* This function returns a newly malloced string that has the ' and \
in the argument quoted with \.
*/
......@@ -301,10 +330,26 @@ create_statement(int lineno, struct connection *connection, struct statement **
return false;
var->type = type;
var->value = va_arg(ap, void *);
var->pointer = va_arg(ap, void *);
/* if variable is NULL, the statement hasn't been prepared */
if (var->pointer == NULL)
{
ECPGlog("create_statement: invalid statement name\n");
register_error(ECPG_INVALID_STMT, "Invalid statement name in line %d", lineno);
free(var);
return false;
}
var->varcharsize = va_arg(ap, long);
var->arrsize = va_arg(ap, long);
var->offset = va_arg(ap, long);
if (var->arrsize == 0 || var->varcharsize == 0)
var->value = *((void **)(var->pointer));
else
var->value = var->pointer;
var->ind_type = va_arg(ap, enum ECPGttype);
var->ind_value = va_arg(ap, void *);
var->ind_varcharsize = va_arg(ap, long);
......@@ -312,15 +357,6 @@ create_statement(int lineno, struct connection *connection, struct statement **
var->ind_offset = va_arg(ap, long);
var->next = NULL;
/* if variable is NULL, the statement hasn't been prepared */
if (var->value == NULL)
{
ECPGlog("create_statement: invalid statement name\n");
register_error(ECPG_INVALID_STMT, "Invalid statement name in line %d", lineno);
free(var);
return false;
}
for (ptr = *list; ptr && ptr->next; ptr = ptr->next);
if (ptr == NULL)
......@@ -478,8 +514,7 @@ ECPGexecute(struct statement * stmt)
break;
case ECPGt_char_variable:
{
/* set slen to string length if type is char * */
int slen = (var->varcharsize == 0) ? strlen((char *) var->value) : var->varcharsize;
int slen = strlen((char *) var->value);
char *tmp;
if (!(newcopy = ecpg_alloc(slen + 1, stmt->lineno)))
......@@ -632,13 +667,6 @@ ECPGexecute(struct statement * stmt)
act_field;
case PGRES_TUPLES_OK:
/*
* XXX Cheap Hack. For now, we see only the last group of
* tuples. This is clearly not the right way to do things
* !!
*/
nfields = PQnfields(results);
sqlca.sqlerrd[2] = ntuples = PQntuples(results);
status = true;
......@@ -676,18 +704,67 @@ ECPGexecute(struct statement * stmt)
status = false;
break;
}
for (act_tuple = 0; act_tuple < ntuples; act_tuple++)
/*
* allocate memory for NULL pointers
*/
if (var->arrsize == 0 || var->varcharsize == 0)
{
switch(var->type)
{
case ECPGt_char:
case ECPGt_unsigned_char:
if (var->value == NULL)
{
var->varcharsize = 0;
/* check strlen for each tuple */
for (act_tuple = 0; act_tuple < ntuples; act_tuple++)
{
int len = strlen(PQgetvalue(results, act_tuple, act_field));
if (len > var->varcharsize)
var->varcharsize = len;
}
var->offset *= var->varcharsize;
add_mem((void *)(var->value) = *((void **)(var->pointer)) = (void *) ecpg_alloc(var->offset * ntuples, stmt->lineno), stmt->lineno);
}
break;
#if 0
case ECPGt_varchar:
if (((struct ECPGgeneric_varchar *)var->value)->arr == NULL)
{
var->varcharsize = 0;
/* check strlen for each tuple */
for (act_tuple = 0; act_tuple < ntuples; act_tuple++)
{
int len = strlen(PQgetvalue(results, act_tuple, act_field));
if (len > var->varcharsize)
var->varcharsize = len;
((struct ECPGgeneric_varchar *) ((long) var->value + var->offset * act_tuple))->arr = (char *) ecpg_alloc(len, stmt->lineno);
}
}
break;
#endif
default:
if (var->value == NULL)
add_mem((void *)(var->value) = *((void **)(var->pointer)) = (void *) ecpg_alloc(var->offset * ntuples, stmt->lineno), stmt->lineno);
break;
}
}
for (act_tuple = 0; act_tuple < ntuples && status; act_tuple++)
{
pval = PQgetvalue(results, act_tuple, act_field);
ECPGlog("ECPGexecute line %d: RESULT: %s\n", stmt->lineno, pval ? pval : "");
/* Now the pval is a pointer to the var->value. */
/* We will have to decode the var->value */
/* Now the pval is a pointer to the value. */
/* We will have to decode the value */
/*
* check for null var->value and set indicator
* check for null value and set indicator
* accordingly
*/
switch (var->ind_type)
......@@ -840,37 +917,28 @@ ECPGexecute(struct statement * stmt)
case ECPGt_char:
case ECPGt_unsigned_char:
{
if (var->varcharsize == 0)
strncpy((char *) ((long) var->value + var->offset * act_tuple), pval, var->varcharsize);
if (var->varcharsize && var->varcharsize < strlen(pval))
{
/* char* */
strncpy(((char **) var->value)[act_tuple], pval, strlen(pval));
(((char **) var->value)[act_tuple])[strlen(pval)] = '\0';
}
else
{
strncpy((char *) ((long) var->value + var->offset * act_tuple), pval, var->varcharsize);
if (var->varcharsize < strlen(pval))
/* truncation */
switch (var->ind_type)
{
/* truncation */
switch (var->ind_type)
{
case ECPGt_short:
case ECPGt_unsigned_short:
((short *) var->ind_value)[act_tuple] = var->varcharsize;
break;
case ECPGt_int:
case ECPGt_unsigned_int:
((int *) var->ind_value)[act_tuple] = var->varcharsize;
break;
case ECPGt_long:
case ECPGt_unsigned_long:
((long *) var->ind_value)[act_tuple] = var->varcharsize;
break;
default:
break;
}
sqlca.sqlwarn[0] = sqlca.sqlwarn[1] = 'W';
case ECPGt_short:
case ECPGt_unsigned_short:
((short *) var->ind_value)[act_tuple] = var->varcharsize;
break;
case ECPGt_int:
case ECPGt_unsigned_int:
((int *) var->ind_value)[act_tuple] = var->varcharsize;
break;
case ECPGt_long:
case ECPGt_unsigned_long:
((long *) var->ind_value)[act_tuple] = var->varcharsize;
break;
default:
break;
}
sqlca.sqlwarn[0] = sqlca.sqlwarn[1] = 'W';
}
}
break;
......@@ -914,8 +982,7 @@ ECPGexecute(struct statement * stmt)
break;
default:
register_error(ECPG_UNSUPPORTED, "Unsupported type %s on line %d.",
ECPGtype_name(var->type), stmt->lineno);
register_error(ECPG_UNSUPPORTED, "Unsupported type %s on line %d.", ECPGtype_name(var->type), stmt->lineno);
status = false;
break;
}
......
src/interfaces/ecpg/preproc/Makefile
View file @ d077c614
......@@ -20,7 +20,7 @@ preproc.c preproc.h: preproc.y
mv y.tab.h preproc.h
clean:
rm -f *.o core a.out ecpg$(X) *~
rm -f *.o core a.out ecpg$(X) *~ *.output *.tab.?
install: all
$(INSTALL) $(INSTL_EXE_OPTS) ecpg$(X) $(DESTDIR)$(BINDIR)
......
src/interfaces/ecpg/preproc/pgc.c 0 → 100644
View file @ d077c614
/* A lexical scanner generated by flex */
/* Scanner skeleton version:
* $Header: /cvsroot/pgsql/src/interfaces/ecpg/preproc/Attic/pgc.c,v 1.1 1999/02/28 07:25:29 scrappy Exp $
*/
#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 5
#include <stdio.h>
/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */
#ifdef c_plusplus
#ifndef __cplusplus
#define __cplusplus
#endif
#endif
#ifdef __cplusplus
#include <stdlib.h>
#include <unistd.h>
/* Use prototypes in function declarations. */
#define YY_USE_PROTOS
/* The "const" storage-class-modifier is valid. */
#define YY_USE_CONST
#else /* ! __cplusplus */
#if __STDC__
#define YY_USE_PROTOS
#define YY_USE_CONST
#endif /* __STDC__ */
#endif /* ! __cplusplus */
#ifdef __TURBOC__
#pragma warn -rch
#pragma warn -use
#include <io.h>
#include <stdlib.h>
#define YY_USE_CONST
#define YY_USE_PROTOS
#endif
#ifdef YY_USE_CONST
#define yyconst const
#else
#define yyconst
#endif
#ifdef YY_USE_PROTOS
#define YY_PROTO(proto) proto
#else
#define YY_PROTO(proto) ()
#endif
/* Returned upon end-of-file. */
#define YY_NULL 0
/* Promotes a possibly negative, possibly signed char to an unsigned
* integer for use as an array index. If the signed char is negative,
* we want to instead treat it as an 8-bit unsigned char, hence the
* double cast.
*/
#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
/* Enter a start condition. This macro really ought to take a parameter,
* but we do it the disgusting crufty way forced on us by the ()-less
* definition of BEGIN.
*/
#define BEGIN yy_start = 1 + 2 *
/* Translate the current start state into a value that can be later handed
* to BEGIN to return to the state. The YYSTATE alias is for lex
* compatibility.
*/
#define YY_START ((yy_start - 1) / 2)
#define YYSTATE YY_START
/* Action number for EOF rule of a given start state. */
#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
/* Special action meaning "start processing a new file". */
#define YY_NEW_FILE yyrestart( yyin )
#define YY_END_OF_BUFFER_CHAR 0
/* Size of default input buffer. */
#define YY_BUF_SIZE 16384
typedef struct yy_buffer_state *YY_BUFFER_STATE;
extern int yyleng;
extern FILE *yyin, *yyout;
#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2
/* The funky do-while in the following #define is used to turn the definition
* int a single C statement (which needs a semi-colon terminator). This
* avoids problems with code like:
*
* if ( condition_holds )
* yyless( 5 );
* else
* do_something_else();
*
* Prior to using the do-while the compiler would get upset at the
* "else" because it interpreted the "if" statement as being all
* done when it reached the ';' after the yyless() call.
*/
/* Return all but the first 'n' matched characters back to the input stream. */
#define yyless(n) \
do \
{ \
/* Undo effects of setting up yytext. */ \
*yy_cp = yy_hold_char; \
YY_RESTORE_YY_MORE_OFFSET \
yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \
YY_DO_BEFORE_ACTION; /* set up yytext again */ \
} \
while ( 0 )
#define unput(c) yyunput( c, yytext_ptr )
/* The following is because we cannot portably get our hands on size_t
* (without autoconf's help, which isn't available because we want
* flex-generated scanners to compile on their own).
*/
typedef unsigned int yy_size_t;
struct yy_buffer_state
{
FILE *yy_input_file;
char *yy_ch_buf; /* input buffer */
char *yy_buf_pos; /* current position in input buffer */
/* Size of input buffer in bytes, not including room for EOB
* characters.
*/
yy_size_t yy_buf_size;
/* Number of characters read into yy_ch_buf, not including EOB
* characters.
*/
int yy_n_chars;
/* Whether we "own" the buffer - i.e., we know we created it,
* and can realloc() it to grow it, and should free() it to
* delete it.
*/
int yy_is_our_buffer;
/* Whether this is an "interactive" input source; if so, and
* if we're using stdio for input, then we want to use getc()
* instead of fread(), to make sure we stop fetching input after
* each newline.
*/
int yy_is_interactive;
/* Whether we're considered to be at the beginning of a line.
* If so, '^' rules will be active on the next match, otherwise
* not.
*/
int yy_at_bol;
/* Whether to try to fill the input buffer when we reach the
* end of it.
*/
int yy_fill_buffer;
int yy_buffer_status;
#define YY_BUFFER_NEW 0
#define YY_BUFFER_NORMAL 1
/* When an EOF's been seen but there's still some text to process
* then we mark the buffer as YY_EOF_PENDING, to indicate that we
* shouldn't try reading from the input source any more. We might
* still have a bunch of tokens to match, though, because of
* possible backing-up.
*
* When we actually see the EOF, we change the status to "new"
* (via yyrestart()), so that the user can continue scanning by
* just pointing yyin at a new input file.
*/
#define YY_BUFFER_EOF_PENDING 2
};
static YY_BUFFER_STATE yy_current_buffer = 0;
/* We provide macros for accessing buffer states in case in the
* future we want to put the buffer states in a more general
* "scanner state".
*/
#define YY_CURRENT_BUFFER yy_current_buffer
/* yy_hold_char holds the character lost when yytext is formed. */
static char yy_hold_char;
static int yy_n_chars; /* number of characters read into yy_ch_buf */
int yyleng;
/* Points to current character in buffer. */
static char *yy_c_buf_p = (char *) 0;
static int yy_init = 1; /* whether we need to initialize */
static int yy_start = 0; /* start state number */
/* Flag which is used to allow yywrap()'s to do buffer switches
* instead of setting up a fresh yyin. A bit of a hack ...
*/
static int yy_did_buffer_switch_on_eof;
void yyrestart YY_PROTO(( FILE *input_file ));
void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer ));
void yy_load_buffer_state YY_PROTO(( void ));
YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size ));
void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b ));
void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file ));
void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b ));
#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer )
YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size ));
YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str ));
YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len ));
static void *yy_flex_alloc YY_PROTO(( yy_size_t ));
static void *yy_flex_realloc YY_PROTO(( void *, yy_size_t ));
static void yy_flex_free YY_PROTO(( void * ));
#define yy_new_buffer yy_create_buffer
#define yy_set_interactive(is_interactive) \
{ \
if ( ! yy_current_buffer ) \
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
yy_current_buffer->yy_is_interactive = is_interactive; \
}
#define yy_set_bol(at_bol) \
{ \
if ( ! yy_current_buffer ) \
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
yy_current_buffer->yy_at_bol = at_bol; \
}
#define YY_AT_BOL() (yy_current_buffer->yy_at_bol)
#define YY_USES_REJECT
typedef unsigned char YY_CHAR;
FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
typedef int yy_state_type;
extern int yylineno;
int yylineno = 1;
extern char *yytext;
#define yytext_ptr yytext
static yy_state_type yy_get_previous_state YY_PROTO(( void ));
static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state ));
static int yy_get_next_buffer YY_PROTO(( void ));
static void yy_fatal_error YY_PROTO(( yyconst char msg[] ));
/* Done after the current pattern has been matched and before the
* corresponding action - sets up yytext.
*/
#define YY_DO_BEFORE_ACTION \
yytext_ptr = yy_bp; \
yyleng = (int) (yy_cp - yy_bp); \
yy_hold_char = *yy_cp; \
*yy_cp = '\0'; \
yy_c_buf_p = yy_cp;
#define YY_NUM_RULES 71
#define YY_END_OF_BUFFER 72
static yyconst short int yy_acclist[312] =
{ 0,
10, 10, 6, 6, 23, 23, 26, 26, 9, 9,
27, 27, 18, 18, 72, 71, 24, 71, 71, 60,
71, 54, 60, 71, 54, 71, 24, 60, 71, 49,
60, 71, 53, 60, 71, 52, 60, 71, 60, 71,
60, 71, 41, 60, 71,16424, 51, 60, 71, 59,
60, 71, 50, 60, 71, 50, 60, 71, 57, 60,
71, 58, 60, 71, 55, 60, 71, 56, 60, 71,
46, 71, 44, 46, 71, 44, 71, 33, 46, 71,
21, 24, 46, 71, 31, 33, 46, 71, 15, 46,
71, 31, 46, 71, 31, 33, 46, 71, 31, 33,
46, 71, 31, 46, 71, 31, 33, 46, 71, 38,
46, 71,16420, 31, 33, 46, 71, 45, 46, 71,
43, 46, 71,16419, 43, 46, 71,16419, 43, 46,
71,16419, 69, 71, 68, 71, 68, 69, 71, 24,
69, 71, 69, 71, 69, 70, 71, 66, 71, 64,
66, 71, 66, 71, 65, 71, 62, 71, 63, 71,
10, 71, 8, 71, 3, 6, 71, 3, 6, 71,
3, 71, 6, 71, 23, 71, 22, 71, 26, 71,
25, 71, 9, 71, 14, 71, 27, 71, 28, 71,
18, 71, 16, 71, 71, 4, 49, 49, 49, 49,
41,16424, 50, 50, 33, 33, 33, 34, 33, 33,
38,16420, 39,16421, 4, 33, 33, 39,16421, 29,
33, 42, 43,16419, 7, 13, 69, 4, 69, 63,
10, 6, 6, 5, 23, 26, 9, 27, 18, 17,
19, 4, 4, 49, 49, 48, 8232, 50, 32, 30,
32, 30, 32, 34, 30, 1, 33, 33, 30, 32,
4, 33, 4, 33, 4, 33, 8228, 39,16421, 39,
16421, 42, 8227, 69, 4, 69, 4, 69, 12, 5,
11, 20, 2, 4, 50, 32, 8229, 39,16421, 2,
4, 33, 32, 42, 69, 2, 4, 69, 2, 2,
2, 49, 42, 2, 69, 2, 69, 2, 47, 61,
67
} ;
static yyconst short int yy_accept[241] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 2, 3, 4, 5, 6, 7, 8,
9, 10, 11, 12, 13, 14, 15, 16, 17, 19,
20, 22, 25, 27, 30, 33, 36, 39, 41, 43,
47, 50, 53, 56, 59, 62, 65, 68, 71, 73,
76, 78, 81, 85, 89, 92, 95, 99, 103, 106,
110, 114, 118, 121, 125, 129, 133, 135, 137, 140,
143, 145, 148, 150, 153, 155, 157, 159, 161, 163,
165, 168, 171, 173, 175, 177, 179, 181, 183, 185,
187, 189, 191, 193, 195, 196, 197, 197, 198, 199,
200, 201, 203, 203, 203, 203, 204, 205, 206, 207,
207, 208, 209, 209, 210, 211, 211, 213, 215, 217,
218, 218, 218, 220, 220, 222, 223, 223, 223, 225,
226, 227, 228, 230, 231, 232, 232, 232, 233, 234,
234, 234, 235, 236, 237, 238, 238, 238, 239, 240,
240, 240, 241, 242, 242, 243, 244, 245, 246, 246,
247, 248, 249, 250, 252, 255, 256, 256, 257, 258,
259, 261, 261, 261, 261, 263, 265, 267, 268, 270,
270, 272, 272, 272, 273, 274, 275, 277, 279, 279,
279, 280, 281, 281, 281, 282, 282, 282, 283, 283,
285, 285, 285, 286, 287, 288, 288, 290, 293, 294,
295, 296, 299, 300, 301, 302, 303, 303, 304, 306,
308, 309, 309, 309, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 311, 311, 312, 312
} ;
static yyconst int yy_ec[256] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
1, 4, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 2, 5, 6, 7, 8, 5, 5, 9, 10,
10, 11, 12, 13, 14, 15, 16, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 18, 19, 20,
21, 22, 5, 5, 23, 24, 25, 26, 27, 28,
23, 23, 29, 23, 23, 30, 23, 31, 23, 23,
32, 23, 33, 23, 34, 23, 23, 35, 23, 23,
36, 37, 38, 5, 23, 5, 23, 24, 25, 26,
27, 28, 23, 23, 29, 23, 23, 30, 23, 31,
23, 23, 32, 23, 33, 23, 34, 23, 23, 35,
23, 23, 39, 20, 40, 5, 1, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23
} ;
static yyconst int yy_meta[41] =
{ 0,
1, 2, 3, 4, 5, 6, 5, 5, 7, 1,
8, 5, 1, 9, 10, 5, 11, 5, 1, 5,
5, 5, 12, 12, 12, 12, 12, 12, 12, 12,
12, 12, 12, 12, 12, 1, 13, 1, 1, 1
} ;
static yyconst short int yy_base[270] =
{ 0,
0, 1, 17, 0, 57, 0, 96, 101, 107, 125,
143, 0, 475, 473, 174, 192, 474, 471, 461, 460,
448, 445, 0, 134, 97, 105, 446, 1006, 1006, 433,
1006, 6, 148, 1006, 98, 1006, 1006, 425, 105, 213,
1006, 1006, 0, 405, 1006, 1006, 1006, 1006, 1006, 1006,
1006, 423, 1006, 217, 1006, 221, 105, 139, 234, 146,
250, 276, 1006, 241, 254, 417, 0, 1006, 0, 0,
413, 0, 1006, 1006, 409, 1006, 1006, 0, 0, 237,
0, 307, 114, 0, 0, 1006, 0, 1006, 0, 257,
267, 1006, 0, 328, 0, 333, 332, 121, 161, 413,
354, 272, 410, 357, 350, 0, 375, 381, 232, 366,
172, 373, 176, 190, 389, 362, 0, 371, 407, 427,
379, 372, 361, 419, 362, 118, 448, 441, 363, 1006,
1006, 0, 467, 0, 0, 457, 461, 0, 0, 217,
355, 488, 0, 0, 0, 491, 494, 498, 0, 502,
505, 1006, 1006, 352, 510, 336, 508, 531, 347, 1006,
1006, 323, 1006, 1006, 329, 1006, 340, 1006, 0, 194,
339, 534, 527, 459, 0, 317, 276, 1006, 309, 307,
547, 298, 0, 125, 1006, 271, 567, 300, 553, 556,
1006, 588, 591, 594, 1006, 602, 605, 1006, 306, 613,
616, 619, 622, 310, 1006, 278, 625, 628, 274, 169,
406, 631, 634, 644, 647, 650, 239, 187, 654, 657,
660, 234, 232, 667, 200, 223, 211, 204, 197, 189,
150, 134, 127, 116, 92, 1006, 81, 1006, 1006, 687,
700, 713, 726, 739, 752, 765, 778, 791, 804, 807,
815, 823, 835, 838, 850, 863, 872, 881, 894, 907,
920, 932, 945, 958, 971, 976, 988, 0, 993
} ;
static yyconst short int yy_def[270] =
{ 0,
240, 240, 239, 3, 239, 5, 241, 241, 242, 242,
240, 11, 243, 243, 244, 244, 245, 245, 246, 246,
247, 247, 240, 240, 248, 248, 239, 239, 239, 239,
239, 239, 239, 239, 249, 239, 239, 239, 239, 239,
239, 239, 250, 250, 239, 239, 239, 239, 239, 239,
239, 251, 239, 251, 239, 239, 54, 54, 239, 54,
239, 239, 239, 252, 252, 65, 253, 239, 253, 253,
253, 253, 239, 239, 239, 239, 239, 254, 255, 239,
256, 256, 257, 82, 258, 239, 259, 239, 260, 239,
239, 239, 261, 239, 262, 263, 239, 249, 249, 239,
249, 239, 264, 239, 239, 250, 250, 251, 251, 239,
109, 239, 239, 109, 265, 239, 61, 239, 263, 265,
239, 239, 118, 239, 251, 266, 239, 239, 65, 239,
239, 253, 267, 254, 255, 239, 239, 256, 82, 257,
257, 257, 258, 259, 260, 239, 239, 239, 261, 239,
239, 239, 239, 263, 263, 155, 249, 239, 264, 239,
239, 250, 239, 239, 239, 239, 265, 239, 120, 120,
265, 239, 239, 239, 119, 119, 119, 239, 118, 239,
239, 239, 268, 266, 239, 267, 267, 187, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 263, 155,
239, 239, 250, 265, 239, 239, 239, 119, 263, 269,
267, 187, 263, 263, 239, 239, 239, 269, 267, 267,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 0, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239
} ;
static yyconst short int yy_nxt[1047] =
{ 0,
239, 91, 91, 91, 239, 29, 29, 97, 97, 97,
239, 210, 98, 92, 239, 30, 30, 31, 32, 33,
32, 31, 34, 35, 31, 31, 31, 36, 31, 37,
38, 31, 39, 40, 31, 41, 31, 42, 31, 43,
43, 43, 43, 44, 43, 43, 43, 43, 43, 43,
43, 43, 45, 31, 46, 47, 48, 49, 50, 51,
50, 52, 53, 52, 54, 55, 56, 57, 57, 56,
58, 59, 60, 61, 62, 63, 57, 57, 57, 64,
65, 64, 64, 64, 64, 64, 64, 64, 64, 64,
64, 66, 56, 49, 56, 49, 49, 68, 68, 69,
100, 70, 68, 68, 69, 94, 70, 238, 74, 74,
74, 71, 29, 94, 72, 96, 71, 237, 114, 72,
103, 239, 75, 100, 140, 76, 74, 74, 74, 142,
29, 182, 183, 95, 101, 91, 91, 91, 182, 183,
75, 95, 236, 76, 77, 77, 77, 92, 29, 97,
97, 97, 115, 116, 98, 117, 119, 101, 30, 114,
235, 120, 239, 100, 234, 78, 78, 78, 78, 78,
78, 78, 78, 78, 78, 78, 78, 78, 82, 233,
82, 82, 182, 183, 83, 82, 164, 82, 165, 84,
166, 82, 166, 82, 82, 82, 82, 101, 82, 82,
182, 183, 83, 82, 164, 82, 164, 84, 204, 82,
204, 82, 82, 82, 104, 104, 104, 232, 110, 110,
110, 231, 110, 110, 110, 226, 105, 140, 227, 102,
111, 230, 142, 112, 113, 110, 110, 110, 136, 137,
136, 229, 127, 127, 127, 109, 163, 113, 163, 228,
118, 121, 121, 121, 128, 127, 127, 127, 146, 147,
146, 224, 130, 122, 123, 223, 117, 128, 148, 148,
148, 222, 154, 104, 104, 104, 124, 110, 110, 110,
108, 211, 108, 108, 199, 105, 108, 108, 102, 114,
209, 108, 209, 125, 207, 108, 108, 108, 126, 126,
126, 126, 126, 126, 126, 126, 126, 126, 126, 126,
126, 139, 168, 139, 139, 212, 199, 140, 139, 183,
139, 213, 139, 181, 139, 179, 139, 139, 139, 150,
151, 150, 208, 97, 97, 97, 152, 155, 98, 155,
155, 168, 168, 156, 155, 112, 155, 203, 155, 160,
155, 200, 155, 155, 155, 157, 158, 157, 104, 104,
104, 161, 199, 161, 161, 140, 161, 110, 110, 110,
105, 239, 172, 172, 172, 109, 161, 179, 118, 113,
121, 121, 121, 178, 173, 178, 178, 118, 178, 112,
101, 168, 122, 169, 109, 169, 169, 174, 178, 169,
169, 162, 170, 171, 169, 171, 169, 154, 169, 169,
169, 175, 160, 175, 175, 100, 211, 176, 175, 96,
177, 219, 175, 133, 175, 131, 175, 175, 175, 168,
180, 169, 180, 169, 169, 181, 109, 169, 169, 107,
170, 102, 169, 96, 169, 239, 169, 169, 169, 127,
127, 127, 185, 90, 185, 185, 90, 185, 136, 137,
136, 128, 189, 190, 189, 88, 88, 185, 154, 191,
206, 187, 206, 187, 187, 207, 86, 188, 187, 86,
187, 80, 187, 80, 187, 239, 187, 187, 187, 192,
192, 192, 146, 147, 146, 193, 194, 193, 140, 148,
148, 148, 195, 150, 151, 150, 196, 197, 196, 157,
158, 157, 239, 198, 155, 239, 155, 155, 239, 239,
156, 155, 239, 155, 239, 155, 239, 155, 239, 155,
155, 155, 201, 158, 201, 172, 172, 172, 205, 239,
205, 205, 239, 205, 101, 239, 239, 173, 172, 172,
172, 239, 239, 205, 189, 190, 189, 189, 190, 189,
173, 191, 239, 181, 191, 239, 239, 202, 154, 239,
239, 187, 239, 187, 187, 239, 239, 188, 187, 239,
187, 239, 187, 239, 187, 239, 187, 187, 187, 192,
192, 192, 193, 194, 193, 193, 194, 193, 239, 195,
239, 239, 195, 196, 197, 196, 196, 197, 196, 239,
198, 239, 239, 198, 214, 215, 214, 201, 216, 201,
201, 216, 201, 217, 217, 217, 172, 172, 172, 214,
215, 214, 214, 215, 220, 214, 215, 214, 173, 239,
239, 207, 239, 239, 199, 214, 215, 214, 221, 215,
221, 201, 158, 201, 199, 214, 215, 220, 214, 215,
220, 221, 215, 221, 211, 239, 239, 211, 225, 225,
225, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 202, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
67, 67, 67, 67, 67, 67, 67, 67, 67, 67,
67, 67, 67, 73, 73, 73, 73, 73, 73, 73,
73, 73, 73, 73, 73, 73, 79, 79, 79, 79,
79, 79, 79, 79, 79, 79, 79, 79, 79, 81,
81, 81, 81, 81, 81, 81, 81, 81, 81, 81,
81, 81, 85, 85, 85, 85, 85, 85, 85, 85,
85, 85, 85, 85, 85, 87, 87, 87, 87, 87,
87, 87, 87, 87, 87, 87, 87, 87, 89, 89,
89, 89, 89, 89, 89, 89, 89, 89, 89, 89,
89, 93, 93, 93, 93, 93, 93, 93, 93, 93,
93, 93, 93, 93, 99, 99, 99, 99, 99, 99,
99, 99, 99, 99, 99, 99, 99, 106, 106, 108,
239, 239, 108, 108, 129, 129, 129, 239, 239, 239,
239, 129, 239, 129, 129, 132, 239, 239, 132, 132,
132, 132, 132, 132, 132, 132, 132, 132, 134, 134,
135, 135, 135, 135, 135, 135, 239, 135, 135, 135,
135, 135, 135, 138, 138, 138, 138, 138, 138, 138,
239, 138, 138, 138, 138, 138, 141, 239, 239, 141,
141, 143, 143, 143, 143, 143, 239, 143, 143, 143,
143, 143, 143, 143, 144, 144, 144, 144, 144, 239,
144, 144, 144, 144, 144, 144, 144, 145, 145, 145,
145, 145, 145, 239, 145, 145, 145, 145, 145, 145,
149, 149, 149, 149, 149, 149, 239, 149, 149, 149,
149, 149, 153, 153, 153, 153, 153, 153, 153, 153,
153, 153, 153, 153, 153, 154, 154, 239, 154, 154,
154, 154, 154, 154, 154, 154, 154, 154, 159, 159,
159, 159, 159, 159, 159, 159, 159, 159, 159, 159,
159, 167, 167, 167, 167, 167, 167, 167, 167, 167,
167, 167, 167, 167, 184, 184, 184, 184, 186, 186,
239, 186, 186, 186, 186, 186, 186, 186, 186, 186,
186, 218, 218, 218, 218, 27, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239
} ;
static yyconst short int yy_chk[1047] =
{ 0,
0, 23, 23, 23, 0, 1, 2, 32, 32, 32,
0, 268, 32, 23, 0, 1, 2, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 7, 7, 7,
35, 7, 8, 8, 8, 25, 8, 237, 9, 9,
9, 7, 9, 26, 7, 39, 8, 235, 57, 8,
39, 57, 9, 98, 83, 9, 10, 10, 10, 83,
10, 126, 126, 25, 35, 24, 24, 24, 184, 184,
10, 26, 234, 10, 11, 11, 11, 24, 11, 33,
33, 33, 58, 58, 33, 58, 60, 98, 11, 60,
233, 60, 60, 99, 232, 11, 11, 11, 11, 11,
11, 11, 11, 11, 11, 11, 11, 11, 15, 231,
15, 15, 210, 210, 15, 15, 111, 15, 111, 15,
113, 15, 113, 15, 15, 15, 16, 99, 16, 16,
218, 218, 16, 16, 114, 16, 114, 16, 170, 16,
170, 16, 16, 16, 40, 40, 40, 230, 54, 54,
54, 229, 56, 56, 56, 225, 40, 140, 225, 40,
54, 228, 140, 54, 56, 59, 59, 59, 80, 80,
80, 227, 64, 64, 64, 109, 109, 59, 109, 226,
59, 61, 61, 61, 64, 65, 65, 65, 90, 90,
90, 223, 65, 61, 61, 222, 61, 65, 91, 91,
91, 217, 186, 102, 102, 102, 61, 62, 62, 62,
62, 186, 62, 62, 209, 102, 62, 62, 102, 62,
177, 62, 177, 62, 206, 62, 62, 62, 62, 62,
62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
62, 82, 204, 82, 82, 188, 199, 82, 82, 182,
82, 199, 82, 180, 82, 179, 82, 82, 82, 94,
94, 94, 176, 97, 97, 97, 94, 96, 97, 96,
96, 171, 167, 96, 96, 165, 96, 162, 96, 159,
96, 156, 96, 96, 96, 101, 101, 101, 104, 104,
104, 105, 154, 105, 105, 141, 105, 110, 110, 110,
104, 129, 118, 118, 118, 125, 105, 123, 116, 110,
121, 121, 121, 122, 118, 122, 122, 118, 122, 112,
101, 115, 121, 115, 108, 115, 115, 118, 122, 115,
115, 107, 115, 115, 115, 115, 115, 211, 115, 115,
115, 119, 103, 119, 119, 100, 211, 119, 119, 75,
119, 211, 119, 71, 119, 66, 119, 119, 119, 120,
124, 120, 124, 120, 120, 124, 52, 120, 120, 44,
120, 38, 120, 30, 120, 27, 120, 120, 120, 127,
127, 127, 128, 22, 128, 128, 21, 128, 136, 136,
136, 127, 137, 137, 137, 20, 19, 128, 133, 137,
174, 133, 174, 133, 133, 174, 18, 133, 133, 17,
133, 14, 133, 13, 133, 0, 133, 133, 133, 142,
142, 142, 146, 146, 146, 147, 147, 147, 142, 148,
148, 148, 147, 150, 150, 150, 151, 151, 151, 157,
157, 157, 0, 151, 155, 0, 155, 155, 0, 0,
155, 155, 0, 155, 0, 155, 0, 155, 0, 155,
155, 155, 158, 158, 158, 172, 172, 172, 173, 0,
173, 173, 0, 173, 157, 0, 0, 172, 181, 181,
181, 0, 0, 173, 189, 189, 189, 190, 190, 190,
181, 189, 0, 181, 190, 0, 0, 158, 187, 0,
0, 187, 0, 187, 187, 0, 0, 187, 187, 0,
187, 0, 187, 0, 187, 0, 187, 187, 187, 192,
192, 192, 193, 193, 193, 194, 194, 194, 0, 193,
0, 0, 194, 196, 196, 196, 197, 197, 197, 0,
196, 0, 0, 197, 200, 200, 200, 201, 201, 201,
202, 202, 202, 203, 203, 203, 207, 207, 207, 208,
208, 208, 212, 212, 212, 213, 213, 213, 207, 0,
0, 207, 0, 0, 213, 214, 214, 214, 215, 215,
215, 216, 216, 216, 214, 219, 219, 219, 220, 220,
220, 221, 221, 221, 219, 0, 0, 220, 224, 224,
224, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 216, 240, 240, 240,
240, 240, 240, 240, 240, 240, 240, 240, 240, 240,
241, 241, 241, 241, 241, 241, 241, 241, 241, 241,
241, 241, 241, 242, 242, 242, 242, 242, 242, 242,
242, 242, 242, 242, 242, 242, 243, 243, 243, 243,
243, 243, 243, 243, 243, 243, 243, 243, 243, 244,
244, 244, 244, 244, 244, 244, 244, 244, 244, 244,
244, 244, 245, 245, 245, 245, 245, 245, 245, 245,
245, 245, 245, 245, 245, 246, 246, 246, 246, 246,
246, 246, 246, 246, 246, 246, 246, 246, 247, 247,
247, 247, 247, 247, 247, 247, 247, 247, 247, 247,
247, 248, 248, 248, 248, 248, 248, 248, 248, 248,
248, 248, 248, 248, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249, 249, 250, 250, 251,
0, 0, 251, 251, 252, 252, 252, 0, 0, 0,
0, 252, 0, 252, 252, 253, 0, 0, 253, 253,
253, 253, 253, 253, 253, 253, 253, 253, 254, 254,
255, 255, 255, 255, 255, 255, 0, 255, 255, 255,
255, 255, 255, 256, 256, 256, 256, 256, 256, 256,
0, 256, 256, 256, 256, 256, 257, 0, 0, 257,
257, 258, 258, 258, 258, 258, 0, 258, 258, 258,
258, 258, 258, 258, 259, 259, 259, 259, 259, 0,
259, 259, 259, 259, 259, 259, 259, 260, 260, 260,
260, 260, 260, 0, 260, 260, 260, 260, 260, 260,
261, 261, 261, 261, 261, 261, 0, 261, 261, 261,
261, 261, 262, 262, 262, 262, 262, 262, 262, 262,
262, 262, 262, 262, 262, 263, 263, 0, 263, 263,
263, 263, 263, 263, 263, 263, 263, 263, 264, 264,
264, 264, 264, 264, 264, 264, 264, 264, 264, 264,
264, 265, 265, 265, 265, 265, 265, 265, 265, 265,
265, 265, 265, 265, 266, 266, 266, 266, 267, 267,
0, 267, 267, 267, 267, 267, 267, 267, 267, 267,
267, 269, 269, 269, 269, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
239, 239, 239, 239, 239, 239
} ;
static yy_state_type yy_state_buf[YY_BUF_SIZE + 2], *yy_state_ptr;
static char *yy_full_match;
static int yy_lp;
static int yy_looking_for_trail_begin = 0;
static int yy_full_lp;
static int *yy_full_state;
#define YY_TRAILING_MASK 0x2000
#define YY_TRAILING_HEAD_MASK 0x4000
#define REJECT \
{ \
*yy_cp = yy_hold_char; /* undo effects of setting up yytext */ \
yy_cp = yy_full_match; /* restore poss. backed-over text */ \
yy_lp = yy_full_lp; /* restore orig. accepting pos. */ \
yy_state_ptr = yy_full_state; /* restore orig. state */ \
yy_current_state = *yy_state_ptr; /* restore curr. state */ \
++yy_lp; \
goto find_rule; \
}
#define yymore() yymore_used_but_not_detected
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET
char *yytext;
#line 1 "pgc.l"
#define INITIAL 0
/* This is a modified version of src/backend/parser/scan.l */
#line 3 "pgc.l"
#include "config.h"
#include <ctype.h>
#include <sys/types.h>
#include <limits.h>
#ifndef PATH_MAX
#include <sys/param.h>
#define PATH_MAX MAXPATHLEN
#endif
#if defined(HAVE_STRING_H)
#include <string.h>
#else
#include <strings.h>
#endif
#include <errno.h>
#include "postgres.h"
#include "miscadmin.h"
#include "nodes/pg_list.h"
#include "nodes/parsenodes.h"
#include "parser/gramparse.h"
#include "parser/scansup.h"
#include "extern.h"
#include "preproc.h"
#include "utils/builtins.h"
/* some versions of lex define this as a macro */
#if defined(yywrap)
#undef yywrap
#endif /* yywrap */
extern YYSTYPE yylval;
int llen;
char literal[MAX_PARSE_BUFFER];
int before_comment;
struct _yy_buffer { YY_BUFFER_STATE buffer;
long lineno;
char * filename;
struct _yy_buffer * next;
} *yy_buffer = NULL;
struct _defines *defines = NULL;
static char *old;
#define C 1
#define SQL 2
#define incl 3
#define def 4
#define def_ident 5
/* OK, here is a short description of lex/flex rules behavior.
* The longest pattern which matches an input string is always chosen.
* For equal-length patterns, the first occurring in the rules list is chosen.
* INITIAL is the starting condition, to which all non-conditional rules apply.
* When in an exclusive condition, only those rules defined for that condition apply.
*
* Exclusive states change parsing rules while the state is active.
* There are exclusive states for quoted strings, extended comments,
* and to eliminate parsing troubles for numeric strings.
* Exclusive states:
* <xb> binary numeric string - thomas 1997-11-16
* <xc> extended C-style comments - tgl 1997-07-12
* <xd> delimited identifiers (double-quoted identifiers) - tgl 1997-10-27
* <xh> hexadecimal numeric string - thomas 1997-11-16
* <xm> numeric strings with embedded minus sign - tgl 1997-09-05
* <xq> quoted strings - tgl 1997-07-30
*
* The "extended comment" syntax closely resembles allowable operator syntax.
* So, when in condition <xc>, only strings which would terminate the
* "extended comment" trigger any action other than "ignore".
* Be sure to match _any_ candidate comment, including those with appended
* operator-like symbols. - thomas 1997-07-14
*/
#define xb 6
#define xc 7
#define xd 8
#define xdc 9
#define xh 10
#define xm 11
#define xq 12
/* Binary number
*/
/* Hexadecimal number
*/
/* Extended quote
* xqdouble implements SQL92 embedded quote
* xqcat allows strings to cross input lines
*/
/* Delimited quote
* Allows embedded spaces and other special characters into identifiers.
*/
/* Comments
* Ignored by the scanner and parser.
*/
/*
real [\-]?{digit}+\.{digit}+([Ee][-+]?{digit}+)?
*/
/* some stuff needed for ecpg */
/* DO NOT PUT ANY COMMENTS IN THE FOLLOWING SECTION.
* AT&T lex does not properly handle C-style comments in this second lex block.
* So, put comments here. tgl - 1997-09-08
*
* Quoted strings must allow some special characters such as single-quote
* and newline.
* Embedded single-quotes are implemented both in the SQL/92-standard
* style of two adjacent single quotes "''" and in the Postgres/Java style
* of escaped-quote "\'".
* Other embedded escaped characters are matched explicitly and the leading
* backslash is dropped from the string. - thomas 1997-09-24
*/
#line 851 "lex.yy.c"
/* Macros after this point can all be overridden by user definitions in
* section 1.
*/
#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int yywrap YY_PROTO(( void ));
#else
extern int yywrap YY_PROTO(( void ));
#endif
#endif
#ifndef YY_NO_UNPUT
static void yyunput YY_PROTO(( int c, char *buf_ptr ));
#endif
#ifndef yytext_ptr
static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int ));
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen YY_PROTO(( yyconst char * ));
#endif
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput YY_PROTO(( void ));
#else
static int input YY_PROTO(( void ));
#endif
#endif
#if YY_STACK_USED
static int yy_start_stack_ptr = 0;
static int yy_start_stack_depth = 0;
static int *yy_start_stack = 0;
#ifndef YY_NO_PUSH_STATE
static void yy_push_state YY_PROTO(( int new_state ));
#endif
#ifndef YY_NO_POP_STATE
static void yy_pop_state YY_PROTO(( void ));
#endif
#ifndef YY_NO_TOP_STATE
static int yy_top_state YY_PROTO(( void ));
#endif
#else
#define YY_NO_PUSH_STATE 1
#define YY_NO_POP_STATE 1
#define YY_NO_TOP_STATE 1
#endif
#ifdef YY_MALLOC_DECL
YY_MALLOC_DECL
#else
#if __STDC__
#ifndef __cplusplus
#include <stdlib.h>
#endif
#else
/* Just try to get by without declaring the routines. This will fail
* miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
* or sizeof(void*) != sizeof(int).
*/
#endif
#endif
/* Amount of stuff to slurp up with each read. */
#ifndef YY_READ_BUF_SIZE
#define YY_READ_BUF_SIZE 8192
#endif
/* Copy whatever the last rule matched to the standard output. */
#ifndef ECHO
/* This used to be an fputs(), but since the string might contain NUL's,
* we now use fwrite().
*/
#define ECHO (void) fwrite( yytext, yyleng, 1, yyout )
#endif
/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
* is returned in "result".
*/
#ifndef YY_INPUT
#define YY_INPUT(buf,result,max_size) \
if ( yy_current_buffer->yy_is_interactive ) \
{ \
int c = '*', n; \
for ( n = 0; n < max_size && \
(c = getc( yyin )) != EOF && c != '\n'; ++n ) \
buf[n] = (char) c; \
if ( c == '\n' ) \
buf[n++] = (char) c; \
if ( c == EOF && ferror( yyin ) ) \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
result = n; \
} \
else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \
&& ferror( yyin ) ) \
YY_FATAL_ERROR( "input in flex scanner failed" );
#endif
/* No semi-colon after return; correct usage is to write "yyterminate();" -
* we don't want an extra ';' after the "return" because that will cause
* some compilers to complain about unreachable statements.
*/
#ifndef yyterminate
#define yyterminate() return YY_NULL
#endif
/* Number of entries by which start-condition stack grows. */
#ifndef YY_START_STACK_INCR
#define YY_START_STACK_INCR 25
#endif
/* Report a fatal error. */
#ifndef YY_FATAL_ERROR
#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
#endif
/* Default declaration of generated scanner - a define so the user can
* easily add parameters.
*/
#ifndef YY_DECL
#define YY_DECL int yylex YY_PROTO(( void ))
#endif
/* Code executed at the beginning of each rule, after yytext and yyleng
* have been set up.
*/
#ifndef YY_USER_ACTION
#define YY_USER_ACTION
#endif
/* Code executed at the end of each rule. */
#ifndef YY_BREAK
#define YY_BREAK break;
#endif
#define YY_RULE_SETUP \
YY_USER_ACTION
YY_DECL
{
register yy_state_type yy_current_state;
register char *yy_cp, *yy_bp;
register int yy_act;
#line 178 "pgc.l"
#line 1004 "lex.yy.c"
if ( yy_init )
{
yy_init = 0;
#ifdef YY_USER_INIT
YY_USER_INIT;
#endif
if ( ! yy_start )
yy_start = 1; /* first start state */
if ( ! yyin )
yyin = stdin;
if ( ! yyout )
yyout = stdout;
if ( ! yy_current_buffer )
yy_current_buffer =
yy_create_buffer( yyin, YY_BUF_SIZE );
yy_load_buffer_state();
}
while ( 1 ) /* loops until end-of-file is reached */
{
yy_cp = yy_c_buf_p;
/* Support of yytext. */
*yy_cp = yy_hold_char;
/* yy_bp points to the position in yy_ch_buf of the start of
* the current run.
*/
yy_bp = yy_cp;
yy_current_state = yy_start;
yy_state_ptr = yy_state_buf;
*yy_state_ptr++ = yy_current_state;
yy_match:
do
{
register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 240 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
*yy_state_ptr++ = yy_current_state;
++yy_cp;
}
while ( yy_base[yy_current_state] != 1006 );
yy_find_action:
yy_current_state = *--yy_state_ptr;
yy_lp = yy_accept[yy_current_state];
find_rule: /* we branch to this label when backing up */
for ( ; ; ) /* until we find what rule we matched */
{
if ( yy_lp && yy_lp < yy_accept[yy_current_state + 1] )
{
yy_act = yy_acclist[yy_lp];
if ( yy_act & YY_TRAILING_HEAD_MASK ||
yy_looking_for_trail_begin )
{
if ( yy_act == yy_looking_for_trail_begin )
{
yy_looking_for_trail_begin = 0;
yy_act &= ~YY_TRAILING_HEAD_MASK;
break;
}
}
else if ( yy_act & YY_TRAILING_MASK )
{
yy_looking_for_trail_begin = yy_act & ~YY_TRAILING_MASK;
yy_looking_for_trail_begin |= YY_TRAILING_HEAD_MASK;
yy_full_match = yy_cp;
yy_full_state = yy_state_ptr;
yy_full_lp = yy_lp;
}
else
{
yy_full_match = yy_cp;
yy_full_state = yy_state_ptr;
yy_full_lp = yy_lp;
break;
}
++yy_lp;
goto find_rule;
}
--yy_cp;
yy_current_state = *--yy_state_ptr;
yy_lp = yy_accept[yy_current_state];
}
YY_DO_BEFORE_ACTION;
if ( yy_act != YY_END_OF_BUFFER )
{
int yyl;
for ( yyl = 0; yyl < yyleng; ++yyl )
if ( yytext[yyl] == '\n' )
++yylineno;
}
do_action: /* This label is used only to access EOF actions. */
switch ( yy_act )
{ /* beginning of action switch */
case 1:
YY_RULE_SETUP
#line 179 "pgc.l"
{ /* ignore */ }
YY_BREAK
case 2:
YY_RULE_SETUP
#line 181 "pgc.l"
{ /* ignore */ }
YY_BREAK
case 3:
YY_RULE_SETUP
#line 183 "pgc.l"
{ /* ignore */ }
YY_BREAK
case 4:
YY_RULE_SETUP
#line 184 "pgc.l"
{
before_comment = YYSTATE;
BEGIN(xc);
}
YY_BREAK
case 5:
YY_RULE_SETUP
#line 189 "pgc.l"
{ BEGIN(before_comment); }
YY_BREAK
case 6:
YY_RULE_SETUP
#line 191 "pgc.l"
{ /* ignore */ }
YY_BREAK
case 7:
YY_RULE_SETUP
#line 193 "pgc.l"
{
BEGIN(xb);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 8:
YY_RULE_SETUP
#line 198 "pgc.l"
{
char* endptr;
BEGIN(SQL);
errno = 0;
yylval.ival = strtol((char *)literal,&endptr,2);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad binary integer input!");
return ICONST;
}
YY_BREAK
case 9:
#line 209 "pgc.l"
case 10:
YY_RULE_SETUP
#line 209 "pgc.l"
{
if ((llen+yyleng) > (MAX_PARSE_BUFFER - 1))
yyerror("ERROR: quoted string parse buffer exceeded");
memcpy(literal+llen, yytext, yyleng+1);
llen += yyleng;
}
YY_BREAK
case 11:
#line 216 "pgc.l"
case 12:
YY_RULE_SETUP
#line 216 "pgc.l"
{
}
YY_BREAK
case 13:
YY_RULE_SETUP
#line 219 "pgc.l"
{
BEGIN(xh);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 14:
YY_RULE_SETUP
#line 224 "pgc.l"
{
char* endptr;
BEGIN(SQL);
errno = 0;
yylval.ival = strtol((char *)literal,&endptr,16);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad hexadecimal integer input");
return ICONST;
}
YY_BREAK
case 15:
YY_RULE_SETUP
#line 235 "pgc.l"
{
BEGIN(xq);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 16:
YY_RULE_SETUP
#line 240 "pgc.l"
{
BEGIN(SQL);
yylval.str = mm_strdup(scanstr(literal));
return SCONST;
}
YY_BREAK
case 17:
#line 246 "pgc.l"
case 18:
#line 247 "pgc.l"
case 19:
YY_RULE_SETUP
#line 247 "pgc.l"
{
if ((llen+yyleng) > (MAX_PARSE_BUFFER - 1))
yyerror("ERROR: quoted string parse buffer exceeded");
memcpy(literal+llen, yytext, yyleng+1);
llen += yyleng;
}
YY_BREAK
case 20:
YY_RULE_SETUP
#line 253 "pgc.l"
{
}
YY_BREAK
case 21:
YY_RULE_SETUP
#line 257 "pgc.l"
{
BEGIN(xd);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 22:
YY_RULE_SETUP
#line 262 "pgc.l"
{
BEGIN(SQL);
yylval.str = mm_strdup(literal);
return CSTRING;
}
YY_BREAK
case 23:
YY_RULE_SETUP
#line 267 "pgc.l"
{
if ((llen+yyleng) > (MAX_PARSE_BUFFER - 1))
yyerror("ERROR: quoted string parse buffer exceeded");
memcpy(literal+llen, yytext, yyleng+1);
llen += yyleng;
}
YY_BREAK
case 24:
YY_RULE_SETUP
#line 273 "pgc.l"
{
BEGIN(xdc);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 25:
YY_RULE_SETUP
#line 278 "pgc.l"
{
BEGIN(C);
yylval.str = mm_strdup(literal);
return CSTRING;
}
YY_BREAK
case 26:
YY_RULE_SETUP
#line 283 "pgc.l"
{
if ((llen+yyleng) > (MAX_PARSE_BUFFER - 1))
yyerror("ERROR: quoted string parse buffer exceeded");
memcpy(literal+llen, yytext, yyleng+1);
llen += yyleng;
}
YY_BREAK
case 27:
YY_RULE_SETUP
#line 290 "pgc.l"
{ /* ignore */ }
YY_BREAK
case 28:
YY_RULE_SETUP
#line 291 "pgc.l"
{
BEGIN(SQL);
return yytext[0];
}
YY_BREAK
case 29:
YY_RULE_SETUP
#line 297 "pgc.l"
{ return TYPECAST; }
YY_BREAK
case 30:
*yy_cp = yy_hold_char; /* undo effects of setting up yytext */
yy_c_buf_p = yy_cp = yy_bp + 1;
YY_DO_BEFORE_ACTION; /* set up yytext again */
YY_RULE_SETUP
#line 298 "pgc.l"
{
BEGIN(xm);
return yytext[0];
}
YY_BREAK
case 31:
YY_RULE_SETUP
#line 302 "pgc.l"
{ return yytext[0]; }
YY_BREAK
case 32:
*yy_cp = yy_hold_char; /* undo effects of setting up yytext */
yy_c_buf_p = yy_cp -= 2;
YY_DO_BEFORE_ACTION; /* set up yytext again */
YY_RULE_SETUP
#line 303 "pgc.l"
{
yylval.str = mm_strdup((char*)yytext);
return Op;
}
YY_BREAK
case 33:
YY_RULE_SETUP
#line 307 "pgc.l"
{
if (strcmp((char*)yytext,"!=") == 0)
yylval.str = mm_strdup("<>"); /* compatability */
else
yylval.str = mm_strdup((char*)yytext);
return Op;
}
YY_BREAK
case 34:
YY_RULE_SETUP
#line 314 "pgc.l"
{
yylval.ival = atoi((char*)&yytext[1]);
return PARAM;
}
YY_BREAK
case 35:
YY_RULE_SETUP
#line 318 "pgc.l"
{
int i;
ScanKeyword *keyword;
char lower_text[NAMEDATALEN];
BEGIN(xm);
/* this should leave the last byte set to '\0' */
strncpy(lower_text, yytext, NAMEDATALEN-1);
for(i = 0; lower_text[i]; i++)
if (isascii((unsigned char)lower_text[i]) && isupper(lower_text[i]))
lower_text[i] = tolower(lower_text[i]);
keyword = ScanKeywordLookup((char*)lower_text);
if (keyword != NULL) {
return keyword->value;
}
else
{
keyword = ScanECPGKeywordLookup((char*)lower_text);
if (keyword != NULL) {
return keyword->value;
}
else
{
struct _defines *ptr;
for (ptr = defines; ptr; ptr = ptr->next)
{
if (strcmp(yytext, ptr->old) == 0)
{
struct _yy_buffer *yb;
yb = mm_alloc(sizeof(struct _yy_buffer));
yb->buffer = YY_CURRENT_BUFFER;
yb->lineno = yylineno;
yb->filename = mm_strdup(input_filename);
yb->next = yy_buffer;
yy_buffer = yb;
yy_scan_string(ptr->new);
break;
}
}
if (ptr == NULL)
{
yylval.str = mm_strdup((char*)yytext);
return IDENT;
}
}
}
}
YY_BREAK
case 36:
YY_RULE_SETUP
#line 371 "pgc.l"
{
char* endptr;
BEGIN(xm);
errno = 0;
yylval.ival = strtol((char *)yytext,&endptr,10);
if (*endptr != '\0' || errno == ERANGE)
{
errno = 0;
yylval.dval = strtod(((char *)yytext),&endptr);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad integer input");
yyerror("WARNING: Integer input is out of range; promoted to float");
return FCONST;
}
return ICONST;
}
YY_BREAK
case 37:
YY_RULE_SETUP
#line 388 "pgc.l"
{
char* endptr;
BEGIN(xm);
errno = 0;
yylval.dval = strtod(((char *)yytext),&endptr);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad float8 input");
return FCONST;
}
YY_BREAK
case 38:
YY_RULE_SETUP
#line 398 "pgc.l"
{
char* endptr;
errno = 0;
yylval.ival = strtol((char *)yytext,&endptr,10);
if (*endptr != '\0' || errno == ERANGE)
{
errno = 0;
yylval.dval = strtod(((char *)yytext),&endptr);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad integer input");
yyerror("WARNING: Integer input is out of range; promoted to float");
return FCONST;
}
return ICONST;
}
YY_BREAK
case 39:
YY_RULE_SETUP
#line 414 "pgc.l"
{
char* endptr;
errno = 0;
yylval.dval = strtod((char *)yytext,&endptr);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad float input");
return FCONST;
}
YY_BREAK
case 40:
YY_RULE_SETUP
#line 423 "pgc.l"
{
char* endptr;
BEGIN(xm);
errno = 0;
yylval.ival = strtol((char *)yytext,&endptr,10);
if (*endptr != '\0' || errno == ERANGE)
{
errno = 0;
yylval.dval = strtod(((char *)yytext),&endptr);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad integer input");
yyerror("WARNING: Integer input is out of range; promoted to float");
return FCONST;
}
return ICONST;
}
YY_BREAK
case 41:
YY_RULE_SETUP
#line 440 "pgc.l"
{
char* endptr;
errno = 0;
yylval.ival = strtol((char *)yytext,&endptr,10);
if (*endptr != '\0' || errno == ERANGE)
{
errno = 0;
yylval.dval = strtod(((char *)yytext),&endptr);
if (*endptr != '\0' || errno == ERANGE)
yyerror("ERROR: Bad integer input");
yyerror("WARNING: Integer input is out of range; promoted to float");
return FCONST;
}
return ICONST;
}
YY_BREAK
case 42:
YY_RULE_SETUP
#line 456 "pgc.l"
{
yylval.str = mm_strdup((char*)yytext+1);
return(CVARIABLE);
}
YY_BREAK
case 43:
YY_RULE_SETUP
#line 460 "pgc.l"
{
int i;
ScanKeyword *keyword;
char lower_text[NAMEDATALEN];
/* this should leave the last byte set to '\0' */
strncpy(lower_text, yytext, NAMEDATALEN-1);
for(i = 0; lower_text[i]; i++)
if (isascii((unsigned char)lower_text[i]) && isupper(lower_text[i]))
lower_text[i] = tolower(lower_text[i]);
keyword = ScanKeywordLookup((char*)lower_text);
if (keyword != NULL) {
return keyword->value;
}
else
{
keyword = ScanECPGKeywordLookup((char*)lower_text);
if (keyword != NULL) {
return keyword->value;
}
else
{
struct _defines *ptr;
for (ptr = defines; ptr; ptr = ptr->next)
{
if (strcmp(yytext, ptr->old) == 0)
{
struct _yy_buffer *yb;
yb = mm_alloc(sizeof(struct _yy_buffer));
yb->buffer = YY_CURRENT_BUFFER;
yb->lineno = yylineno;
yb->filename = mm_strdup(input_filename);
yb->next = yy_buffer;
yy_buffer = yb;
yy_scan_string(ptr->new);
break;
}
}
if (ptr == NULL)
{
yylval.str = mm_strdup((char*)yytext);
return IDENT;
}
}
}
}
YY_BREAK
case 44:
YY_RULE_SETUP
#line 512 "pgc.l"
{ /* ignore */ }
YY_BREAK
case 45:
YY_RULE_SETUP
#line 513 "pgc.l"
{ /*
* We may find a ';' inside a structure
* definition in a TYPE or VAR statement.
* This is not a EOL marker.
*/
if (struct_level == 0)
BEGIN C;
return SQL_SEMI; }
YY_BREAK
case 46:
YY_RULE_SETUP
#line 521 "pgc.l"
{ return yytext[0]; }
YY_BREAK
case 47:
YY_RULE_SETUP
#line 522 "pgc.l"
{ BEGIN SQL; return SQL_START; }
YY_BREAK
case 48:
YY_RULE_SETUP
#line 523 "pgc.l"
{ /* ignore */ }
YY_BREAK
case 49:
YY_RULE_SETUP
#line 524 "pgc.l"
{
yylval.str = mm_strdup((char*)yytext);
return(CPP_LINE);
}
YY_BREAK
case 50:
YY_RULE_SETUP
#line 528 "pgc.l"
{
ScanKeyword *keyword;
keyword = ScanCKeywordLookup((char*)yytext);
if (keyword != NULL) {
return keyword->value;
}
else
{
struct _defines *ptr;
for (ptr = defines; ptr; ptr = ptr->next)
{
if (strcmp(yytext, ptr->old) == 0)
{
struct _yy_buffer *yb;
yb = mm_alloc(sizeof(struct _yy_buffer));
yb->buffer = YY_CURRENT_BUFFER;
yb->lineno = yylineno;
yb->filename = mm_strdup(input_filename);
yb->next = yy_buffer;
yy_buffer = yb;
yy_scan_string(ptr->new);
break;
}
}
if (ptr == NULL)
{
yylval.str = mm_strdup((char*)yytext);
return IDENT;
}
}
}
YY_BREAK
case 51:
YY_RULE_SETUP
#line 565 "pgc.l"
{ return(';'); }
YY_BREAK
case 52:
YY_RULE_SETUP
#line 566 "pgc.l"
{ return(','); }
YY_BREAK
case 53:
YY_RULE_SETUP
#line 567 "pgc.l"
{ return('*'); }
YY_BREAK
case 54:
YY_RULE_SETUP
#line 568 "pgc.l"
{ ECHO; }
YY_BREAK
case 55:
YY_RULE_SETUP
#line 569 "pgc.l"
{ return('{'); }
YY_BREAK
case 56:
YY_RULE_SETUP
#line 570 "pgc.l"
{ return('}'); }
YY_BREAK
case 57:
YY_RULE_SETUP
#line 571 "pgc.l"
{ return('['); }
YY_BREAK
case 58:
YY_RULE_SETUP
#line 572 "pgc.l"
{ return(']'); }
YY_BREAK
case 59:
YY_RULE_SETUP
#line 573 "pgc.l"
{ return('='); }
YY_BREAK
case 60:
YY_RULE_SETUP
#line 574 "pgc.l"
{ return S_ANYTHING; }
YY_BREAK
case 61:
YY_RULE_SETUP
#line 575 "pgc.l"
{BEGIN(def_ident);}
YY_BREAK
case 62:
YY_RULE_SETUP
#line 576 "pgc.l"
{}
YY_BREAK
case 63:
YY_RULE_SETUP
#line 577 "pgc.l"
{
old = mm_strdup(yytext);
BEGIN(def);
llen = 0;
*literal = '\0';
}
YY_BREAK
case 64:
YY_RULE_SETUP
#line 583 "pgc.l"
/* eat the whitespace */
YY_BREAK
case 65:
YY_RULE_SETUP
#line 584 "pgc.l"
{
struct _defines *ptr, *this;
for (ptr = defines; ptr != NULL; ptr = ptr->next)
{
if (strcmp(old, ptr->old) == 0)
{
free(ptr->new);
ptr->new = mm_strdup(scanstr(literal));
}
}
if (ptr == NULL)
{
this = (struct _defines *) mm_alloc(sizeof(struct _defines));
/* initial definition */
this->old = old;
this->new = mm_strdup(scanstr(literal));
this->next = defines;
defines = this;
}
BEGIN(C);
}
YY_BREAK
case 66:
YY_RULE_SETUP
#line 608 "pgc.l"
{
if ((llen+yyleng) > (MAX_PARSE_BUFFER - 1))
yyerror("ERROR: define statement parse buffer exceeded");
memcpy(literal+llen, yytext, yyleng+1);
llen += yyleng;
}
YY_BREAK
case 67:
YY_RULE_SETUP
#line 614 "pgc.l"
{ BEGIN(incl); }
YY_BREAK
case 68:
YY_RULE_SETUP
#line 615 "pgc.l"
/* eat the whitespace */
YY_BREAK
case 69:
YY_RULE_SETUP
#line 616 "pgc.l"
{ /* got the include file name */
struct _yy_buffer *yb;
struct _include_path *ip;
char inc_file[PATH_MAX];
yb = mm_alloc(sizeof(struct _yy_buffer));
yb->buffer = YY_CURRENT_BUFFER;
yb->lineno = yylineno;
yb->filename = input_filename;
yb->next = yy_buffer;
yy_buffer = yb;
if (yytext[strlen(yytext) - 1] == ';')
yytext[strlen(yytext) - 1] = '\0';
yyin = NULL;
for (ip = include_paths; yyin == NULL && ip != NULL; ip = ip->next)
{
if (strlen(ip->path) + strlen(yytext) + 3 > PATH_MAX)
{
fprintf(stderr, "Error: Path %s/%s is too long in line %d, skipping.\n", ip->path, yytext, yylineno);
continue;
}
sprintf (inc_file, "%s/%s", ip->path, yytext);
yyin = fopen( inc_file, "r" );
if (!yyin)
{
if (strcmp(inc_file + strlen(inc_file) - 2, ".h"))
{
strcat(inc_file, ".h");
yyin = fopen( inc_file, "r" );
}
}
}
if (!yyin)
{
fprintf(stderr, "Error: Cannot open include file %s in line %d\n", yytext, yylineno);
exit(NO_INCLUDE_FILE);
}
input_filename = mm_strdup(inc_file);
yy_switch_to_buffer(yy_create_buffer(yyin,YY_BUF_SIZE ));
yylineno = 0;
BEGIN C;
}
YY_BREAK
case 70:
YY_RULE_SETUP
#line 665 "pgc.l"
{ BEGIN C; }
YY_BREAK
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(C):
case YY_STATE_EOF(SQL):
case YY_STATE_EOF(incl):
case YY_STATE_EOF(def):
case YY_STATE_EOF(def_ident):
case YY_STATE_EOF(xb):
case YY_STATE_EOF(xc):
case YY_STATE_EOF(xd):
case YY_STATE_EOF(xdc):
case YY_STATE_EOF(xh):
case YY_STATE_EOF(xm):
case YY_STATE_EOF(xq):
#line 666 "pgc.l"
{ if (yy_buffer == NULL)
yyterminate();
else
{
struct _yy_buffer *yb = yy_buffer;
if (yyin != NULL)
fclose(yyin);
yy_delete_buffer( YY_CURRENT_BUFFER );
yy_switch_to_buffer(yy_buffer->buffer);
yylineno = yy_buffer->lineno;
free(input_filename);
input_filename = yy_buffer->filename;
yy_buffer = yy_buffer->next;
free(yb);
}
}
YY_BREAK
case 71:
YY_RULE_SETUP
#line 688 "pgc.l"
ECHO;
YY_BREAK
#line 1908 "lex.yy.c"
case YY_END_OF_BUFFER:
{
/* Amount of text matched not including the EOB char. */
int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1;
/* Undo the effects of YY_DO_BEFORE_ACTION. */
*yy_cp = yy_hold_char;
YY_RESTORE_YY_MORE_OFFSET
if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW )
{
/* We're scanning a new file or input source. It's
* possible that this happened because the user
* just pointed yyin at a new source and called
* yylex(). If so, then we have to assure
* consistency between yy_current_buffer and our
* globals. Here is the right place to do so, because
* this is the first action (other than possibly a
* back-up) that will match for the new input source.
*/
yy_n_chars = yy_current_buffer->yy_n_chars;
yy_current_buffer->yy_input_file = yyin;
yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL;
}
/* Note that here we test for yy_c_buf_p "<=" to the position
* of the first EOB in the buffer, since yy_c_buf_p will
* already have been incremented past the NUL character
* (since all states make transitions on EOB to the
* end-of-buffer state). Contrast this with the test
* in input().
*/
if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] )
{ /* This was really a NUL. */
yy_state_type yy_next_state;
yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state();
/* Okay, we're now positioned to make the NUL
* transition. We couldn't have
* yy_get_previous_state() go ahead and do it
* for us because it doesn't know how to deal
* with the possibility of jamming (and we don't
* want to build jamming into it because then it
* will run more slowly).
*/
yy_next_state = yy_try_NUL_trans( yy_current_state );
yy_bp = yytext_ptr + YY_MORE_ADJ;
if ( yy_next_state )
{
/* Consume the NUL. */
yy_cp = ++yy_c_buf_p;
yy_current_state = yy_next_state;
goto yy_match;
}
else
{
yy_cp = yy_c_buf_p;
goto yy_find_action;
}
}
else switch ( yy_get_next_buffer() )
{
case EOB_ACT_END_OF_FILE:
{
yy_did_buffer_switch_on_eof = 0;
if ( yywrap() )
{
/* Note: because we've taken care in
* yy_get_next_buffer() to have set up
* yytext, we can now set up
* yy_c_buf_p so that if some total
* hoser (like flex itself) wants to
* call the scanner after we return the
* YY_NULL, it'll still work - another
* YY_NULL will get returned.
*/
yy_c_buf_p = yytext_ptr + YY_MORE_ADJ;
yy_act = YY_STATE_EOF(YY_START);
goto do_action;
}
else
{
if ( ! yy_did_buffer_switch_on_eof )
YY_NEW_FILE;
}
break;
}
case EOB_ACT_CONTINUE_SCAN:
yy_c_buf_p =
yytext_ptr + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state();
yy_cp = yy_c_buf_p;
yy_bp = yytext_ptr + YY_MORE_ADJ;
goto yy_match;
case EOB_ACT_LAST_MATCH:
yy_c_buf_p =
&yy_current_buffer->yy_ch_buf[yy_n_chars];
yy_current_state = yy_get_previous_state();
yy_cp = yy_c_buf_p;
yy_bp = yytext_ptr + YY_MORE_ADJ;
goto yy_find_action;
}
break;
}
default:
YY_FATAL_ERROR(
"fatal flex scanner internal error--no action found" );
} /* end of action switch */
} /* end of scanning one token */
} /* end of yylex */
/* yy_get_next_buffer - try to read in a new buffer
*
* Returns a code representing an action:
* EOB_ACT_LAST_MATCH -
* EOB_ACT_CONTINUE_SCAN - continue scanning from current position
* EOB_ACT_END_OF_FILE - end of file
*/
static int yy_get_next_buffer()
{
register char *dest = yy_current_buffer->yy_ch_buf;
register char *source = yytext_ptr;
register int number_to_move, i;
int ret_val;
if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] )
YY_FATAL_ERROR(
"fatal flex scanner internal error--end of buffer missed" );
if ( yy_current_buffer->yy_fill_buffer == 0 )
{ /* Don't try to fill the buffer, so this is an EOF. */
if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 )
{
/* We matched a single character, the EOB, so
* treat this as a final EOF.
*/
return EOB_ACT_END_OF_FILE;
}
else
{
/* We matched some text prior to the EOB, first
* process it.
*/
return EOB_ACT_LAST_MATCH;
}
}
/* Try to read more data. */
/* First move last chars to start of buffer. */
number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1;
for ( i = 0; i < number_to_move; ++i )
*(dest++) = *(source++);
if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING )
/* don't do the read, it's not guaranteed to return an EOF,
* just force an EOF
*/
yy_current_buffer->yy_n_chars = yy_n_chars = 0;
else
{
int num_to_read =
yy_current_buffer->yy_buf_size - number_to_move - 1;
while ( num_to_read <= 0 )
{ /* Not enough room in the buffer - grow it. */
#ifdef YY_USES_REJECT
YY_FATAL_ERROR(
"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
#else
/* just a shorter name for the current buffer */
YY_BUFFER_STATE b = yy_current_buffer;
int yy_c_buf_p_offset =
(int) (yy_c_buf_p - b->yy_ch_buf);
if ( b->yy_is_our_buffer )
{
int new_size = b->yy_buf_size * 2;
if ( new_size <= 0 )
b->yy_buf_size += b->yy_buf_size / 8;
else
b->yy_buf_size *= 2;
b->yy_ch_buf = (char *)
/* Include room in for 2 EOB chars. */
yy_flex_realloc( (void *) b->yy_ch_buf,
b->yy_buf_size + 2 );
}
else
/* Can't grow it, we don't own it. */
b->yy_ch_buf = 0;
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR(
"fatal error - scanner input buffer overflow" );
yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
num_to_read = yy_current_buffer->yy_buf_size -
number_to_move - 1;
#endif
}
if ( num_to_read > YY_READ_BUF_SIZE )
num_to_read = YY_READ_BUF_SIZE;
/* Read in more data. */
YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]),
yy_n_chars, num_to_read );
yy_current_buffer->yy_n_chars = yy_n_chars;
}
if ( yy_n_chars == 0 )
{
if ( number_to_move == YY_MORE_ADJ )
{
ret_val = EOB_ACT_END_OF_FILE;
yyrestart( yyin );
}
else
{
ret_val = EOB_ACT_LAST_MATCH;
yy_current_buffer->yy_buffer_status =
YY_BUFFER_EOF_PENDING;
}
}
else
ret_val = EOB_ACT_CONTINUE_SCAN;
yy_n_chars += number_to_move;
yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR;
yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
yytext_ptr = &yy_current_buffer->yy_ch_buf[0];
return ret_val;
}
/* yy_get_previous_state - get the state just before the EOB char was reached */
static yy_state_type yy_get_previous_state()
{
register yy_state_type yy_current_state;
register char *yy_cp;
yy_current_state = yy_start;
yy_state_ptr = yy_state_buf;
*yy_state_ptr++ = yy_current_state;
for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp )
{
register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 240 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
*yy_state_ptr++ = yy_current_state;
}
return yy_current_state;
}
/* yy_try_NUL_trans - try to make a transition on the NUL character
*
* synopsis
* next_state = yy_try_NUL_trans( current_state );
*/
#ifdef YY_USE_PROTOS
static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state )
#else
static yy_state_type yy_try_NUL_trans( yy_current_state )
yy_state_type yy_current_state;
#endif
{
register int yy_is_jam;
register YY_CHAR yy_c = 1;
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 240 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
yy_is_jam = (yy_current_state == 239);
if ( ! yy_is_jam )
*yy_state_ptr++ = yy_current_state;
return yy_is_jam ? 0 : yy_current_state;
}
#ifndef YY_NO_UNPUT
#ifdef YY_USE_PROTOS
static void yyunput( int c, register char *yy_bp )
#else
static void yyunput( c, yy_bp )
int c;
register char *yy_bp;
#endif
{
register char *yy_cp = yy_c_buf_p;
/* undo effects of setting up yytext */
*yy_cp = yy_hold_char;
if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
{ /* need to shift things up to make room */
/* +2 for EOB chars. */
register int number_to_move = yy_n_chars + 2;
register char *dest = &yy_current_buffer->yy_ch_buf[
yy_current_buffer->yy_buf_size + 2];
register char *source =
&yy_current_buffer->yy_ch_buf[number_to_move];
while ( source > yy_current_buffer->yy_ch_buf )
*--dest = *--source;
yy_cp += (int) (dest - source);
yy_bp += (int) (dest - source);
yy_current_buffer->yy_n_chars =
yy_n_chars = yy_current_buffer->yy_buf_size;
if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
YY_FATAL_ERROR( "flex scanner push-back overflow" );
}
*--yy_cp = (char) c;
if ( c == '\n' )
--yylineno;
yytext_ptr = yy_bp;
yy_hold_char = *yy_cp;
yy_c_buf_p = yy_cp;
}
#endif /* ifndef YY_NO_UNPUT */
#ifdef __cplusplus
static int yyinput()
#else
static int input()
#endif
{
int c;
*yy_c_buf_p = yy_hold_char;
if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
{
/* yy_c_buf_p now points to the character we want to return.
* If this occurs *before* the EOB characters, then it's a
* valid NUL; if not, then we've hit the end of the buffer.
*/
if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] )
/* This was really a NUL. */
*yy_c_buf_p = '\0';
else
{ /* need more input */
int offset = yy_c_buf_p - yytext_ptr;
++yy_c_buf_p;
switch ( yy_get_next_buffer() )
{
case EOB_ACT_LAST_MATCH:
/* This happens because yy_g_n_b()
* sees that we've accumulated a
* token and flags that we need to
* try matching the token before
* proceeding. But for input(),
* there's no matching to consider.
* So convert the EOB_ACT_LAST_MATCH
* to EOB_ACT_END_OF_FILE.
*/
/* Reset buffer status. */
yyrestart( yyin );
/* fall through */
case EOB_ACT_END_OF_FILE:
{
if ( yywrap() )
return EOF;
if ( ! yy_did_buffer_switch_on_eof )
YY_NEW_FILE;
#ifdef __cplusplus
return yyinput();
#else
return input();
#endif
}
case EOB_ACT_CONTINUE_SCAN:
yy_c_buf_p = yytext_ptr + offset;
break;
}
}
}
c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */
*yy_c_buf_p = '\0'; /* preserve yytext */
yy_hold_char = *++yy_c_buf_p;
if ( c == '\n' )
++yylineno;
return c;
}
#ifdef YY_USE_PROTOS
void yyrestart( FILE *input_file )
#else
void yyrestart( input_file )
FILE *input_file;
#endif
{
if ( ! yy_current_buffer )
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE );
yy_init_buffer( yy_current_buffer, input_file );
yy_load_buffer_state();
}
#ifdef YY_USE_PROTOS
void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
#else
void yy_switch_to_buffer( new_buffer )
YY_BUFFER_STATE new_buffer;
#endif
{
if ( yy_current_buffer == new_buffer )
return;
if ( yy_current_buffer )
{
/* Flush out information for old buffer. */
*yy_c_buf_p = yy_hold_char;
yy_current_buffer->yy_buf_pos = yy_c_buf_p;
yy_current_buffer->yy_n_chars = yy_n_chars;
}
yy_current_buffer = new_buffer;
yy_load_buffer_state();
/* We don't actually know whether we did this switch during
* EOF (yywrap()) processing, but the only time this flag
* is looked at is after yywrap() is called, so it's safe
* to go ahead and always set it.
*/
yy_did_buffer_switch_on_eof = 1;
}
#ifdef YY_USE_PROTOS
void yy_load_buffer_state( void )
#else
void yy_load_buffer_state()
#endif
{
yy_n_chars = yy_current_buffer->yy_n_chars;
yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos;
yyin = yy_current_buffer->yy_input_file;
yy_hold_char = *yy_c_buf_p;
}
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
#else
YY_BUFFER_STATE yy_create_buffer( file, size )
FILE *file;
int size;
#endif
{
YY_BUFFER_STATE b;
b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
b->yy_buf_size = size;
/* yy_ch_buf has to be 2 characters longer than the size given because
* we need to put in 2 end-of-buffer characters.
*/
b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 );
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
b->yy_is_our_buffer = 1;
yy_init_buffer( b, file );
return b;
}
#ifdef YY_USE_PROTOS
void yy_delete_buffer( YY_BUFFER_STATE b )
#else
void yy_delete_buffer( b )
YY_BUFFER_STATE b;
#endif
{
if ( ! b )
return;
if ( b == yy_current_buffer )
yy_current_buffer = (YY_BUFFER_STATE) 0;
if ( b->yy_is_our_buffer )
yy_flex_free( (void *) b->yy_ch_buf );
yy_flex_free( (void *) b );
}
#ifndef YY_ALWAYS_INTERACTIVE
#ifndef YY_NEVER_INTERACTIVE
extern int isatty YY_PROTO(( int ));
#endif
#endif
#ifdef YY_USE_PROTOS
void yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
#else
void yy_init_buffer( b, file )
YY_BUFFER_STATE b;
FILE *file;
#endif
{
yy_flush_buffer( b );
b->yy_input_file = file;
b->yy_fill_buffer = 1;
#if YY_ALWAYS_INTERACTIVE
b->yy_is_interactive = 1;
#else
#if YY_NEVER_INTERACTIVE
b->yy_is_interactive = 0;
#else
b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
#endif
#endif
}
#ifdef YY_USE_PROTOS
void yy_flush_buffer( YY_BUFFER_STATE b )
#else
void yy_flush_buffer( b )
YY_BUFFER_STATE b;
#endif
{
if ( ! b )
return;
b->yy_n_chars = 0;
/* We always need two end-of-buffer characters. The first causes
* a transition to the end-of-buffer state. The second causes
* a jam in that state.
*/
b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
b->yy_buf_pos = &b->yy_ch_buf[0];
b->yy_at_bol = 1;
b->yy_buffer_status = YY_BUFFER_NEW;
if ( b == yy_current_buffer )
yy_load_buffer_state();
}
#ifndef YY_NO_SCAN_BUFFER
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size )
#else
YY_BUFFER_STATE yy_scan_buffer( base, size )
char *base;
yy_size_t size;
#endif
{
YY_BUFFER_STATE b;
if ( size < 2 ||
base[size-2] != YY_END_OF_BUFFER_CHAR ||
base[size-1] != YY_END_OF_BUFFER_CHAR )
/* They forgot to leave room for the EOB's. */
return 0;
b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
b->yy_buf_pos = b->yy_ch_buf = base;
b->yy_is_our_buffer = 0;
b->yy_input_file = 0;
b->yy_n_chars = b->yy_buf_size;
b->yy_is_interactive = 0;
b->yy_at_bol = 1;
b->yy_fill_buffer = 0;
b->yy_buffer_status = YY_BUFFER_NEW;
yy_switch_to_buffer( b );
return b;
}
#endif
#ifndef YY_NO_SCAN_STRING
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str )
#else
YY_BUFFER_STATE yy_scan_string( yy_str )
yyconst char *yy_str;
#endif
{
int len;
for ( len = 0; yy_str[len]; ++len )
;
return yy_scan_bytes( yy_str, len );
}
#endif
#ifndef YY_NO_SCAN_BYTES
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len )
#else
YY_BUFFER_STATE yy_scan_bytes( bytes, len )
yyconst char *bytes;
int len;
#endif
{
YY_BUFFER_STATE b;
char *buf;
yy_size_t n;
int i;
/* Get memory for full buffer, including space for trailing EOB's. */
n = len + 2;
buf = (char *) yy_flex_alloc( n );
if ( ! buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
for ( i = 0; i < len; ++i )
buf[i] = bytes[i];
buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR;
b = yy_scan_buffer( buf, n );
if ( ! b )
YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
/* It's okay to grow etc. this buffer, and we should throw it
* away when we're done.
*/
b->yy_is_our_buffer = 1;
return b;
}
#endif
#ifndef YY_NO_PUSH_STATE
#ifdef YY_USE_PROTOS
static void yy_push_state( int new_state )
#else
static void yy_push_state( new_state )
int new_state;
#endif
{
if ( yy_start_stack_ptr >= yy_start_stack_depth )
{
yy_size_t new_size;
yy_start_stack_depth += YY_START_STACK_INCR;
new_size = yy_start_stack_depth * sizeof( int );
if ( ! yy_start_stack )
yy_start_stack = (int *) yy_flex_alloc( new_size );
else
yy_start_stack = (int *) yy_flex_realloc(
(void *) yy_start_stack, new_size );
if ( ! yy_start_stack )
YY_FATAL_ERROR(
"out of memory expanding start-condition stack" );
}
yy_start_stack[yy_start_stack_ptr++] = YY_START;
BEGIN(new_state);
}
#endif
#ifndef YY_NO_POP_STATE
static void yy_pop_state()
{
if ( --yy_start_stack_ptr < 0 )
YY_FATAL_ERROR( "start-condition stack underflow" );
BEGIN(yy_start_stack[yy_start_stack_ptr]);
}
#endif
#ifndef YY_NO_TOP_STATE
static int yy_top_state()
{
return yy_start_stack[yy_start_stack_ptr - 1];
}
#endif
#ifndef YY_EXIT_FAILURE
#define YY_EXIT_FAILURE 2
#endif
#ifdef YY_USE_PROTOS
static void yy_fatal_error( yyconst char msg[] )
#else
static void yy_fatal_error( msg )
char msg[];
#endif
{
(void) fprintf( stderr, "%s\n", msg );
exit( YY_EXIT_FAILURE );
}
/* Redefine yyless() so it works in section 3 code. */
#undef yyless
#define yyless(n) \
do \
{ \
/* Undo effects of setting up yytext. */ \
yytext[yyleng] = yy_hold_char; \
yy_c_buf_p = yytext + n; \
yy_hold_char = *yy_c_buf_p; \
*yy_c_buf_p = '\0'; \
yyleng = n; \
} \
while ( 0 )
/* Internal utility routines. */
#ifndef yytext_ptr
#ifdef YY_USE_PROTOS
static void yy_flex_strncpy( char *s1, yyconst char *s2, int n )
#else
static void yy_flex_strncpy( s1, s2, n )
char *s1;
yyconst char *s2;
int n;
#endif
{
register int i;
for ( i = 0; i < n; ++i )
s1[i] = s2[i];
}
#endif
#ifdef YY_NEED_STRLEN
#ifdef YY_USE_PROTOS
static int yy_flex_strlen( yyconst char *s )
#else
static int yy_flex_strlen( s )
yyconst char *s;
#endif
{
register int n;
for ( n = 0; s[n]; ++n )
;
return n;
}
#endif
#ifdef YY_USE_PROTOS
static void *yy_flex_alloc( yy_size_t size )
#else
static void *yy_flex_alloc( size )
yy_size_t size;
#endif
{
return (void *) malloc( size );
}
#ifdef YY_USE_PROTOS
static void *yy_flex_realloc( void *ptr, yy_size_t size )
#else
static void *yy_flex_realloc( ptr, size )
void *ptr;
yy_size_t size;
#endif
{
/* The cast to (char *) in the following accommodates both
* implementations that use char* generic pointers, and those
* that use void* generic pointers. It works with the latter
* because both ANSI C and C++ allow castless assignment from
* any pointer type to void*, and deal with argument conversions
* as though doing an assignment.
*/
return (void *) realloc( (char *) ptr, size );
}
#ifdef YY_USE_PROTOS
static void yy_flex_free( void *ptr )
#else
static void yy_flex_free( ptr )
void *ptr;
#endif
{
free( ptr );
}
#if YY_MAIN
int main()
{
yylex();
return 0;
}
#endif
#line 688 "pgc.l"
void
lex_init(void)
{
braces_open = 0;
BEGIN C;
}
int yywrap(void)
{
return 1;
}
src/interfaces/ecpg/preproc/preproc.c 0 → 100644
View file @ d077c614
This source diff could not be displayed because it is too large. You can view the blob instead.
src/interfaces/ecpg/preproc/preproc.h 0 → 100644
View file @ d077c614
typedef union {
double dval;
int ival;
char * str;
struct when action;
struct index index;
int tagname;
struct this_type type;
enum ECPGttype type_enum;
} YYSTYPE;
#define SQL_AT 257
#define SQL_BOOL 258
#define SQL_BREAK 259
#define SQL_CALL 260
#define SQL_CONNECT 261
#define SQL_CONNECTION 262
#define SQL_CONTINUE 263
#define SQL_DEALLOCATE 264
#define SQL_DISCONNECT 265
#define SQL_ENUM 266
#define SQL_FOUND 267
#define SQL_FREE 268
#define SQL_GO 269
#define SQL_GOTO 270
#define SQL_IDENTIFIED 271
#define SQL_IMMEDIATE 272
#define SQL_INDICATOR 273
#define SQL_INT 274
#define SQL_LONG 275
#define SQL_OPEN 276
#define SQL_PREPARE 277
#define SQL_RELEASE 278
#define SQL_REFERENCE 279
#define SQL_SECTION 280
#define SQL_SEMI 281
#define SQL_SHORT 282
#define SQL_SIGNED 283
#define SQL_SQLERROR 284
#define SQL_SQLPRINT 285
#define SQL_SQLWARNING 286
#define SQL_START 287
#define SQL_STOP 288
#define SQL_STRUCT 289
#define SQL_UNSIGNED 290
#define SQL_VAR 291
#define SQL_WHENEVER 292
#define S_ANYTHING 293
#define S_AUTO 294
#define S_BOOL 295
#define S_CHAR 296
#define S_CONST 297
#define S_DOUBLE 298
#define S_ENUM 299
#define S_EXTERN 300
#define S_FLOAT 301
#define S_INT 302
#define S 303
#define S_LONG 304
#define S_REGISTER 305
#define S_SHORT 306
#define S_SIGNED 307
#define S_STATIC 308
#define S_STRUCT 309
#define S_UNION 310
#define S_UNSIGNED 311
#define S_VARCHAR 312
#define TYPECAST 313
#define ABSOLUTE 314
#define ACTION 315
#define ADD 316
#define ALL 317
#define ALTER 318
#define AND 319
#define ANY 320
#define AS 321
#define ASC 322
#define BEGIN_TRANS 323
#define BETWEEN 324
#define BOTH 325
#define BY 326
#define CASCADE 327
#define CASE 328
#define CAST 329
#define CHAR 330
#define CHARACTER 331
#define CHECK 332
#define CLOSE 333
#define COALESCE 334
#define COLLATE 335
#define COLUMN 336
#define COMMIT 337
#define CONSTRAINT 338
#define CREATE 339
#define CROSS 340
#define CURRENT 341
#define CURRENT_DATE 342
#define CURRENT_TIME 343
#define CURRENT_TIMESTAMP 344
#define CURRENT_USER 345
#define CURSOR 346
#define DAY_P 347
#define DECIMAL 348
#define DECLARE 349
#define DEFAULT 350
#define DELETE 351
#define DESC 352
#define DISTINCT 353
#define DOUBLE 354
#define DROP 355
#define ELSE 356
#define END_TRANS 357
#define EXCEPT 358
#define EXECUTE 359
#define EXISTS 360
#define EXTRACT 361
#define FALSE_P 362
#define FETCH 363
#define FLOAT 364
#define FOR 365
#define FOREIGN 366
#define FROM 367
#define FULL 368
#define GRANT 369
#define GROUP 370
#define HAVING 371
#define HOUR_P 372
#define IN 373
#define INNER_P 374
#define INSENSITIVE 375
#define INSERT 376
#define INTERSECT 377
#define INTERVAL 378
#define INTO 379
#define IS 380
#define ISOLATION 381
#define JOIN 382
#define KEY 383
#define LANGUAGE 384
#define LEADING 385
#define LEFT 386
#define LEVEL 387
#define LIKE 388
#define LOCAL 389
#define MATCH 390
#define MINUTE_P 391
#define MONTH_P 392
#define NAMES 393
#define NATIONAL 394
#define NATURAL 395
#define NCHAR 396
#define NEXT 397
#define NO 398
#define NOT 399
#define NULLIF 400
#define NULL_P 401
#define NUMERIC 402
#define OF 403
#define ON 404
#define ONLY 405
#define OPTION 406
#define OR 407
#define ORDER 408
#define OUTER_P 409
#define PARTIAL 410
#define POSITION 411
#define PRECISION 412
#define PRIMARY 413
#define PRIOR 414
#define PRIVILEGES 415
#define PROCEDURE 416
#define PUBLIC 417
#define READ 418
#define REFERENCES 419
#define RELATIVE 420
#define REVOKE 421
#define RIGHT 422
#define ROLLBACK 423
#define SCROLL 424
#define SECOND_P 425
#define SELECT 426
#define SET 427
#define SUBSTRING 428
#define TABLE 429
#define TEMP 430
#define THEN 431
#define TIME 432
#define TIMESTAMP 433
#define TIMEZONE_HOUR 434
#define TIMEZONE_MINUTE 435
#define TO 436
#define TRAILING 437
#define TRANSACTION 438
#define TRIM 439
#define TRUE_P 440
#define UNION 441
#define UNIQUE 442
#define UPDATE 443
#define USER 444
#define USING 445
#define VALUES 446
#define VARCHAR 447
#define VARYING 448
#define VIEW 449
#define WHEN 450
#define WHERE 451
#define WITH 452
#define WORK 453
#define YEAR_P 454
#define ZONE 455
#define TRIGGER 456
#define TYPE_P 457
#define ABORT_TRANS 458
#define AFTER 459
#define AGGREGATE 460
#define ANALYZE 461
#define BACKWARD 462
#define BEFORE 463
#define BINARY 464
#define CACHE 465
#define CLUSTER 466
#define COPY 467
#define CREATEDB 468
#define CREATEUSER 469
#define CYCLE 470
#define DATABASE 471
#define DELIMITERS 472
#define DO 473
#define EACH 474
#define ENCODING 475
#define EXPLAIN 476
#define EXTEND 477
#define FORWARD 478
#define FUNCTION 479
#define HANDLER 480
#define INCREMENT 481
#define INDEX 482
#define INHERITS 483
#define INSTEAD 484
#define ISNULL 485
#define LANCOMPILER 486
#define LIMIT 487
#define LISTEN 488
#define UNLISTEN 489
#define LOAD 490
#define LOCATION 491
#define LOCK_P 492
#define MAXVALUE 493
#define MINVALUE 494
#define MOVE 495
#define NEW 496
#define NOCREATEDB 497
#define NOCREATEUSER 498
#define NONE 499
#define NOTHING 500
#define NOTIFY 501
#define NOTNULL 502
#define OFFSET 503
#define OIDS 504
#define OPERATOR 505
#define PASSWORD 506
#define PROCEDURAL 507
#define RECIPE 508
#define RENAME 509
#define RESET 510
#define RETURNS 511
#define ROW 512
#define RULE 513
#define SERIAL 514
#define SEQUENCE 515
#define SETOF 516
#define SHOW 517
#define START 518
#define STATEMENT 519
#define STDIN 520
#define STDOUT 521
#define TRUSTED 522
#define UNTIL 523
#define VACUUM 524
#define VALID 525
#define VERBOSE 526
#define VERSION 527
#define IDENT 528
#define SCONST 529
#define Op 530
#define CSTRING 531
#define CVARIABLE 532
#define CPP_LINE 533
#define ICONST 534
#define PARAM 535
#define FCONST 536
#define OP 537
#define UMINUS 538
extern YYSTYPE yylval;
src/interfaces/ecpg/preproc/preproc.y
View file @ d077c614
......@@ -144,7 +144,8 @@ find_struct_member(char *name, char *str, struct ECPGstruct_member *members)
case ECPGt_array:
return(new_variable(name, ECPGmake_array_type(members->typ->u.element, members->typ->size)));
case ECPGt_struct:
return(new_variable(name, ECPGmake_struct_type(members->typ->u.members)));
case ECPGt_union:
return(new_variable(name, ECPGmake_struct_type(members->typ->u.members, members->typ->typ)));
default:
return(new_variable(name, ECPGmake_simple_type(members->typ->typ, members->typ->size)));
}
......@@ -175,14 +176,39 @@ find_struct(char * name, char *next)
*next = '\0';
p = find_variable(name);
/* restore the name, we will need it later on */
*next = c;
if (c == '-')
{
if (p->type->typ != ECPGt_struct && p->type->typ != ECPGt_union)
{
sprintf(errortext, "variable %s is not a pointer", name);
yyerror (errortext);
}
if (p->type->u.element->typ != ECPGt_struct && p->type->u.element->typ != ECPGt_union)
{
sprintf(errortext, "variable %s is not a pointer to a structure or a union", name);
yyerror (errortext);
}
/* restore the name, we will need it later on */
*next = c;
next++;
return find_struct_member(name, next, p->type->u.element->u.members);
}
else return find_struct_member(name, next, p->type->u.members);
else
{
if (p->type->typ != ECPGt_struct && p->type->typ != ECPGt_union)
{
sprintf(errortext, "variable %s is neither a structure nor a union", name);
yyerror (errortext);
}
/* restore the name, we will need it later on */
*next = c;
return find_struct_member(name, next, p->type->u.members);
}
}
static struct variable *
......@@ -323,6 +349,7 @@ check_indicator(struct ECPGtype *var)
break;
case ECPGt_struct:
case ECPGt_union:
for (p = var->u.members; p; p = p->next)
check_indicator(p->typ);
break;
......@@ -549,6 +576,7 @@ adjust_array(enum ECPGttype type_enum, int *dimension, int *length, int type_dim
switch (type_enum)
{
case ECPGt_struct:
case ECPGt_union:
/* pointer has to get dimension 0 */
if (pointer)
{
......@@ -740,8 +768,7 @@ adjust_array(enum ECPGttype type_enum, int *dimension, int *length, int type_dim
%type <str> opt_table opt_union opt_unique sort_clause sortby_list
%type <str> sortby OptUseOp opt_inh_star relation_name_list name_list
%type <str> group_clause having_clause from_clause c_list
%type <str> from_list from_val join_expr join_outer join_spec join_list
%type <str> join_using where_clause relation_expr row_op sub_type
%type <str> table_list join_outer where_clause relation_expr row_op sub_type
%type <str> opt_column_list insert_rest InsertStmt OptimizableStmt
%type <str> columnList DeleteStmt LockStmt UpdateStmt CursorStmt
%type <str> NotifyStmt columnElem copy_dirn c_expr UnlistenStmt
......@@ -754,7 +781,7 @@ adjust_array(enum ECPGttype type_enum, int *dimension, int *length, int type_dim
%type <str> func_args_list func_args opt_with ProcedureStmt def_arg
%type <str> def_elem def_list definition def_name def_type DefineStmt
%type <str> opt_instead event event_object RuleActionList,
%type <str> RuleActionBlock RuleActionMulti
%type <str> RuleActionBlock RuleActionMulti join_list
%type <str> RuleStmt opt_column opt_name oper_argtypes
%type <str> MathOp RemoveFuncStmt aggr_argtype for_update_clause
%type <str> RemoveAggrStmt remove_type RemoveStmt ExtendStmt RecipeStmt
......@@ -773,8 +800,10 @@ adjust_array(enum ECPGttype type_enum, int *dimension, int *length, int type_dim
%type <str> GrantStmt privileges operation_commalist operation
%type <str> cursor_clause opt_cursor opt_readonly opt_of opt_lmode
%type <str> case_expr when_clause_list case_default case_arg when_clause
%type <str> select_w_o_sort opt_select_limit select_limit_value,
%type <str> select_offset_value
%type <str> select_clause opt_select_limit select_limit_value,
%type <str> select_offset_value table_list using_expr join_expr
%type <str> using_list from_expr table_expr join_clause join_type
%type <str> join_qual update_list join_clause join_clause_with_union
%type <str> ECPGWhenever ECPGConnect connection_target ECPGOpen opt_using
%type <str> indicator ECPGExecute ecpg_expr dotext ECPGPrepare
......@@ -790,7 +819,7 @@ adjust_array(enum ECPGttype type_enum, int *dimension, int *length, int type_dim
%type <str> ECPGFree ECPGDeclare ECPGVar sql_variable_declarations
%type <str> sql_declaration sql_variable_list sql_variable opt_at
%type <str> struct_type s_struct declaration variable_declarations
%type <str> s_struct_or_union sql_struct_or_union
%type <str> s_struct s_union union_type
%type <type_enum> simple_type varchar_type
......@@ -1320,20 +1349,15 @@ ColConstraint:
{ $$ = $1; }
;
/* The column constraint WITH NULL gives a shift/reduce error
* because it requires yacc to look more than one token ahead to
* resolve WITH TIME ZONE and WITH NULL.
* So, leave it out of the syntax for now.
| WITH NULL_P
{
$$ = NULL;
}
* - thomas 1998-09-12
*
* DEFAULT NULL is already the default for Postgres.
/* DEFAULT NULL is already the default for Postgres.
* Bue define it here and carry it forward into the system
* to make it explicit.
* - thomas 1998-09-13
* WITH NULL and NULL are not SQL92-standard syntax elements,
* so leave them out. Use DEFAULT NULL to explicitly indicate
* that a column may have that value. WITH NULL leads to
* shift/reduce conflicts with WITH TIME ZONE anyway.
* - thomas 1999-01-08
*/
ColConstraintElem: CHECK '(' constraint_expr ')'
{
......@@ -2801,8 +2825,11 @@ opt_of: OF columnList { $$ = make2_str(make1_str("of"), $2); }
/***S*I***/
/* The new 'SelectStmt' rule adapted for the optional use of INTERSECT EXCEPT a nd UNION
* accepts the use of '(' and ')' to select an order of set operations.
* The rule returns a SelectStmt Node having the set operations attached to
* unionClause and intersectClause (NIL if no set operations were present)
*/
SelectStmt: select_w_o_sort sort_clause for_update_clause opt_select_limit
SelectStmt: select_clause sort_clause for_update_clause opt_select_limit
{
if (strlen($3) > 0 && ForUpdateNotAllowed != 0)
yyerror("SELECT FOR UPDATE is not allowed in this context");
......@@ -2819,7 +2846,7 @@ SelectStmt: select_w_o_sort sort_clause for_update_clause opt_select_limit
*
* The sort_clause is not handled here!
*/
select_w_o_sort: '(' select_w_o_sort ')'
select_clause: '(' select_clause ')'
{
$$ = make3_str(make1_str("("), $2, make1_str(")"));
}
......@@ -2827,17 +2854,17 @@ select_w_o_sort: '(' select_w_o_sort ')'
{
$$ = $1;
}
| select_w_o_sort EXCEPT select_w_o_sort
| select_clause EXCEPT select_clause
{
$$ = cat3_str($1, make1_str("except"), $3);
ForUpdateNotAllowed = 1;
}
| select_w_o_sort UNION opt_union select_w_o_sort
| select_clause UNION opt_union select_clause
{
$$ = cat3_str($1, make1_str("union"), $3);
ForUpdateNotAllowed = 1;
}
| select_w_o_sort INTERSECT opt_union select_w_o_sort
| select_clause INTERSECT opt_union select_clause
{
$$ = cat3_str($1, make1_str("intersect"), $3);
ForUpdateNotAllowed = 1;
......@@ -2949,20 +2976,24 @@ having_clause: HAVING a_expr
| /*EMPTY*/ { $$ = make1_str(""); }
;
for_update_clause:
FOR UPDATE
{
$$ = make1_str("for update");
}
| FOR UPDATE OF va_list
{
$$ = cat2_str(make1_str("for update of"), $4);
}
| /* EMPTY */
{
$$ = make1_str("");
}
for_update_clause: FOR UPDATE update_list
{
$$ = make1_str("for update");
}
| /* EMPTY */
{
$$ = make1_str("");
}
;
update_list: OF va_list
{
$$ = cat2_str(make1_str("of"), $2);
}
| /* EMPTY */
{
$$ = make1_str("");
}
;
/*****************************************************************************
*
......@@ -2972,78 +3003,144 @@ for_update_clause:
*
*****************************************************************************/
from_clause: FROM '(' relation_expr join_expr JOIN relation_expr join_spec ')'
{
yyerror("JOIN not yet implemented");
}
| FROM from_list { $$ = cat2_str(make1_str("from"), $2); }
| /*EMPTY*/ { $$ = make1_str(""); }
;
from_clause: FROM from_expr
{
$$ = cat2_str(make1_str("from"), $2);
}
| /* EMPTY */
{
$$ = make1_str("");
}
from_list: from_list ',' from_val
{ $$ = cat3_str($1, make1_str(","), $3); }
| from_val CROSS JOIN from_val
{ yyerror("CROSS JOIN not yet implemented"); }
| from_val
{ $$ = $1; }
;
from_val: relation_expr AS ColLabel
{
$$ = cat3_str($1, make1_str("as"), $3);
}
| relation_expr ColId
{
from_expr: '(' join_clause_with_union ')'
{ $$ = make3_str(make1_str("("), $2, make1_str(")")); }
| join_clause
{ $$ = $1; }
| table_list
{ $$ = $1; }
;
table_list: table_list ',' table_expr
{ $$ = make3_str($1, make1_str(","), $3); }
| table_expr
{ $$ = $1; }
;
table_expr: relation_expr AS ColLabel
{
$$ = cat3_str($1, make1_str("as"), $3);
}
| relation_expr ColId
{
$$ = cat2_str($1, $2);
}
| relation_expr
{
$$ = $1;
}
;
/* A UNION JOIN is the same as a FULL OUTER JOIN which *omits*
* all result rows which would have matched on an INNER JOIN.
* Let's reject this for now. - thomas 1999-01-08
*/
join_clause_with_union: join_clause
{ $$ = $1; }
| table_expr UNION JOIN table_expr
{ yyerror("UNION JOIN not yet implemented"); }
;
join_clause: table_expr join_list
{
$$ = cat2_str($1, $2);
}
;
join_list: join_list join_expr
{
$$ = cat2_str($1, $2);
}
| join_expr
{
$$ = $1;
}
;
/* This is everything but the left side of a join.
* Note that a CROSS JOIN is the same as an unqualified
* inner join, so just pass back the right-side table.
* A NATURAL JOIN implicitly matches column names between
* tables, so we'll collect those during the later transformation.
*/
join_expr: join_type JOIN table_expr join_qual
{
$$ = cat4_str($1, make1_str("join"), $3, $4);
}
| NATURAL join_type JOIN table_expr
{
$$ = cat4_str(make1_str("natural"), $2, make1_str("join"), $4);
}
| CROSS JOIN table_expr
{ $$ = cat2_str(make1_str("cross join"), $3); }
;
/* OUTER is just noise... */
join_type: FULL join_outer
{
$$ = cat2_str(make1_str("full"), $2);
fprintf(stderr,"FULL OUTER JOIN not yet implemented\n");
}
| LEFT join_outer
{
$$ = cat2_str(make1_str("left"), $2);
fprintf(stderr,"LEFT OUTER JOIN not yet implemented\n");
}
| RIGHT join_outer
{
$$ = cat2_str(make1_str("right"), $2);
fprintf(stderr,"RIGHT OUTER JOIN not yet implemented\n");
}
| OUTER_P
{
$$ = make1_str("outer");
fprintf(stderr,"OUTER JOIN not yet implemented\n");
}
| INNER_P
{
$$ = make1_str("inner");
}
| relation_expr
{
$$ = $1;
| /* EMPTY */
{
$$ = make1_str("");
}
;
join_expr: NATURAL join_expr { $$ = cat2_str(make1_str("natural"), $2); }
| FULL join_outer
{ yyerror("FULL OUTER JOIN not yet implemented"); }
| LEFT join_outer
{ yyerror("LEFT OUTER JOIN not yet implemented"); }
| RIGHT join_outer
{ yyerror("RIGHT OUTER JOIN not yet implemented"); }
| OUTER_P
{ yyerror("OUTER JOIN not yet implemented"); }
| INNER_P
{ yyerror("INNER JOIN not yet implemented"); }
| UNION
{ yyerror("UNION JOIN not yet implemented"); }
| /*EMPTY*/
{ yyerror("INNER JOIN not yet implemented"); }
;
join_outer: OUTER_P { $$ = make1_str("outer"); }
| /*EMPTY*/ { $$ = make1_str(""); /* no qualifiers */ }
;
join_spec: ON '(' a_expr ')' { $$ = make3_str(make1_str("on ("), $3, make1_str(")")); }
| USING '(' join_list ')' { $$ = make3_str(make1_str("using ("), $3, make1_str(")")); }
| /*EMPTY*/ { $$ = make1_str(""); /* no qualifiers */ }
;
/* JOIN qualification clauses
* Possibilities are:
* USING ( column list ) allows only unqualified column names,
* which must match between tables.
* ON expr allows more general qualifications.
* - thomas 1999-01-07
*/
join_list: join_using { $$ = $1; }
| join_list ',' join_using { $$ = cat3_str($1, make1_str(","), $3); }
;
join_qual: USING '(' using_list ')' { $$ = make3_str(make1_str("using ("), $3, make1_str(")")); }
| ON a_expr { $$ = cat2_str(make1_str("on"), $2); }
;
using_list: using_list ',' using_expr { $$ = make3_str($1, make1_str(","), $3); }
| using_expr { $$ = $1; }
;
join_using: ColId
using_expr: ColId
{
$$ = $1;
}
| ColId '.' ColId
{
$$ = make3_str($1, make1_str("."), $3);
}
| Iconst
{
$$ = $1;;
}
;
where_clause: WHERE a_expr { $$ = cat2_str(make1_str("where"), $2); }
......@@ -4053,8 +4150,6 @@ case_expr: CASE case_arg when_clause_list case_default END_TRANS
| COALESCE '(' expr_list ')'
{
$$ = cat3_str(make1_str("coalesce("), $3, make1_str(")"));
fprintf(stderr, "COALESCE() not yet fully implemented");
}
;
......@@ -4390,7 +4485,6 @@ ColLabel: ColId { $$ = $1; }
| COALESCE { $$ = make1_str("coalesce"); }
| CONSTRAINT { $$ = make1_str("constraint"); }
| COPY { $$ = make1_str("copy"); }
| CROSS { $$ = make1_str("cross"); }
| CURRENT { $$ = make1_str("current"); }
| DO { $$ = make1_str("do"); }
| ELSE { $$ = make1_str("else"); }
......@@ -4733,6 +4827,13 @@ type: simple_type
$$.type_dimension = -1;
$$.type_index = -1;
}
| union_type
{
$$.type_enum = ECPGt_union;
$$.type_str = $1;
$$.type_dimension = -1;
$$.type_index = -1;
}
| enum_type
{
$$.type_str = $1;
......@@ -4766,16 +4867,28 @@ struct_type: s_struct '{' variable_declarations '}'
$$ = cat4_str($1, make1_str("{"), $3, make1_str("}"));
}
s_struct : s_struct_or_union opt_symbol
union_type: s_union '{' variable_declarations '}'
{
ECPGfree_struct_member(struct_member_list[struct_level]);
free(actual_storage[struct_level--]);
$$ = cat4_str($1, make1_str("{"), $3, make1_str("}"));
}
s_struct : S_STRUCT opt_symbol
{
struct_member_list[struct_level++] = NULL;
if (struct_level >= STRUCT_DEPTH)
yyerror("Too many levels in nested structure definition");
$$ = cat2_str($1, $2);
$$ = cat2_str(make1_str("struct"), $2);
}
s_struct_or_union: S_STRUCT { $$ = make1_str("struct"); }
| S_UNION { $$ = make1_str("union"); }
s_union : S_UNION opt_symbol
{
struct_member_list[struct_level++] = NULL;
if (struct_level >= STRUCT_DEPTH)
yyerror("Too many levels in nested structure definition");
$$ = cat2_str(make1_str("union"), $2);
}
opt_symbol: /* empty */ { $$ = make1_str(""); }
| symbol { $$ = $1; }
......@@ -4815,10 +4928,11 @@ variable: opt_pointer symbol opt_array_bounds opt_initializer
switch (actual_type[struct_level].type_enum)
{
case ECPGt_struct:
case ECPGt_union:
if (dimension < 0)
type = ECPGmake_struct_type(struct_member_list[struct_level]);
type = ECPGmake_struct_type(struct_member_list[struct_level], actual_type[struct_level].type_enum);
else
type = ECPGmake_array_type(ECPGmake_struct_type(struct_member_list[struct_level]), dimension);
type = ECPGmake_array_type(ECPGmake_struct_type(struct_member_list[struct_level], actual_type[struct_level].type_enum), dimension);
$$ = make4_str($1, mm_strdup($2), $3.str, $4);
break;
......@@ -4846,7 +4960,8 @@ variable: opt_pointer symbol opt_array_bounds opt_initializer
if (length > 0)
$$ = make4_str(make5_str(mm_strdup(actual_storage[struct_level]), make1_str(" struct varchar_"), mm_strdup($2), make1_str(" { int len; char arr["), mm_strdup(ascii_len)), make1_str("]; } "), mm_strdup($2), mm_strdup(dim));
else
$$ = make4_str(make3_str(mm_strdup(actual_storage[struct_level]), make1_str(" struct varchar_"), mm_strdup($2)), make1_str(" { int len; char *arr; } "), mm_strdup($2), mm_strdup(dim));
yyerror ("pointer to varchar are not implemented yet");
/* $$ = make4_str(make3_str(mm_strdup(actual_storage[struct_level]), make1_str(" struct varchar_"), mm_strdup($2)), make1_str(" { int len; char *arr; }"), mm_strdup($2), mm_strdup(dim));*/
break;
case ECPGt_char:
case ECPGt_unsigned_char:
......@@ -5189,7 +5304,7 @@ ctype: CHAR
$$.type_index = -1;
$$.type_dimension = -1;
}
| sql_struct_or_union
| SQL_STRUCT
{
struct_member_list[struct_level++] = NULL;
if (struct_level >= STRUCT_DEPTH)
......@@ -5197,11 +5312,24 @@ ctype: CHAR
} '{' sql_variable_declarations '}'
{
ECPGfree_struct_member(struct_member_list[struct_level--]);
$$.type_str = cat4_str($1, make1_str("{"), $4, make1_str("}"));
$$.type_str = cat3_str(make1_str("struct {"), $4, make1_str("}"));
$$.type_enum = ECPGt_struct;
$$.type_index = -1;
$$.type_dimension = -1;
}
| UNION
{
struct_member_list[struct_level++] = NULL;
if (struct_level >= STRUCT_DEPTH)
yyerror("Too many levels in nested structure definition");
} '{' sql_variable_declarations '}'
{
ECPGfree_struct_member(struct_member_list[struct_level--]);
$$.type_str = cat3_str(make1_str("union {"), $4, make1_str("}"));
$$.type_enum = ECPGt_union;
$$.type_index = -1;
$$.type_dimension = -1;
}
| symbol
{
struct typedefs *this = get_typedef($1);
......@@ -5213,9 +5341,6 @@ ctype: CHAR
struct_member_list[struct_level] = this->struct_member_list;
}
sql_struct_or_union: SQL_STRUCT { $$ = make1_str("struct"); }
| UNION { $$ = make1_str("union"); }
opt_signed: SQL_SIGNED | /* empty */
sql_variable_declarations: /* empty */
......@@ -5260,10 +5385,11 @@ sql_variable: opt_pointer symbol opt_array_bounds
switch (actual_type[struct_level].type_enum)
{
case ECPGt_struct:
case ECPGt_union:
if (dimension < 0)
type = ECPGmake_struct_type(struct_member_list[struct_level]);
type = ECPGmake_struct_type(struct_member_list[struct_level], actual_type[struct_level].type_enum);
else
type = ECPGmake_array_type(ECPGmake_struct_type(struct_member_list[struct_level]), dimension);
type = ECPGmake_array_type(ECPGmake_struct_type(struct_member_list[struct_level], actual_type[struct_level].type_enum), dimension);
break;
case ECPGt_varchar:
......@@ -5330,10 +5456,11 @@ ECPGVar: SQL_VAR symbol IS ctype opt_type_array_bounds opt_reference
switch ($4.type_enum)
{
case ECPGt_struct:
case ECPGt_union:
if (dimension < 0)
type = ECPGmake_struct_type(struct_member_list[struct_level]);
type = ECPGmake_struct_type(struct_member_list[struct_level], $4.type_enum);
else
type = ECPGmake_array_type(ECPGmake_struct_type(struct_member_list[struct_level]), dimension);
type = ECPGmake_array_type(ECPGmake_struct_type(struct_member_list[struct_level], $4.type_enum), dimension);
break;
case ECPGt_varchar:
if (dimension == -1)
......
src/interfaces/ecpg/preproc/type.c
View file @ d077c614
......@@ -47,7 +47,8 @@ ECPGstruct_member_dup(struct ECPGstruct_member * rm)
switch (rm->typ->typ)
{
case ECPGt_struct:
type = ECPGmake_struct_type(rm->typ->u.members);
case ECPGt_union:
type = ECPGmake_struct_type(rm->typ->u.members, rm->typ->typ);
break;
case ECPGt_array:
type = ECPGmake_array_type(ECPGmake_simple_type(rm->typ->u.element->typ, rm->typ->u.element->size), rm->typ->size);
......@@ -108,9 +109,9 @@ ECPGmake_array_type(struct ECPGtype * typ, long siz)
}
struct ECPGtype *
ECPGmake_struct_type(struct ECPGstruct_member * rm)
ECPGmake_struct_type(struct ECPGstruct_member * rm, enum ECPGttype type)
{
struct ECPGtype *ne = ECPGmake_simple_type(ECPGt_struct, 1);
struct ECPGtype *ne = ECPGmake_simple_type(type, 1);
ne->u.members = ECPGstruct_member_dup(rm);
......@@ -122,7 +123,7 @@ get_type(enum ECPGttype typ)
{
switch (typ)
{
case ECPGt_char:
case ECPGt_char:
return ("ECPGt_char");
break;
case ECPGt_unsigned_char:
......@@ -167,6 +168,8 @@ get_type(enum ECPGttype typ)
sprintf(errortext, "illegal variable type %d\n", typ);
yyerror(errortext);
}
return NULL;
}
/* Dump a type.
......@@ -202,38 +205,45 @@ ECPGdump_a_type(FILE *o, const char *name, struct ECPGtype * typ, const char *in
switch (typ->typ)
{
case ECPGt_array:
if (IS_SIMPLE_TYPE(typ->u.element->typ))
switch (typ->u.element->typ)
{
ECPGdump_a_simple(o, name, typ->u.element->typ,
case ECPGt_array:
yyerror("No nested arrays allowed (except strings)"); /* array of array */
break;
case ECPGt_struct:
case ECPGt_union:
ECPGdump_a_struct(o, name, ind_name, typ->size, typ->u.element, ind_typ->u.element, NULL, prefix, ind_prefix);
break;
default:
if (!IS_SIMPLE_TYPE(typ->u.element->typ))
yyerror("Internal error: unknown datatype, please inform pgsql-bugs@postgresql.org");
ECPGdump_a_simple(o, name, typ->u.element->typ,
typ->u.element->size, typ->size, NULL, prefix);
if (ind_typ->typ == ECPGt_NO_INDICATOR)
ECPGdump_a_simple(o, ind_name, ind_typ->typ, ind_typ->size, -1, NULL, ind_prefix);
else
{
if (ind_typ->typ != ECPGt_array)
if (ind_typ->typ == ECPGt_NO_INDICATOR)
ECPGdump_a_simple(o, ind_name, ind_typ->typ, ind_typ->size, -1, NULL, ind_prefix);
else
{
fprintf(stderr, "Indicator for an array has to be array too.\n");
exit(INDICATOR_NOT_ARRAY);
}
ECPGdump_a_simple(o, ind_name, ind_typ->u.element->typ,
if (ind_typ->typ != ECPGt_array)
{
fprintf(stderr, "Indicator for an array has to be array too.\n");
exit(INDICATOR_NOT_ARRAY);
}
ECPGdump_a_simple(o, ind_name, ind_typ->u.element->typ,
ind_typ->u.element->size, ind_typ->size, NULL, prefix);
}
}
else if (typ->u.element->typ == ECPGt_array)
{
yyerror("No nested arrays allowed (except strings)"); /* array of array */
}
else if (typ->u.element->typ == ECPGt_struct)
{
/* Array of structs */
ECPGdump_a_struct(o, name, ind_name, typ->size, typ->u.element, ind_typ->u.element, NULL, prefix, ind_prefix);
}
}
else
yyerror("Internal error: unknown datatype, please inform pgsql-bugs@postgresql.org");
break;
case ECPGt_struct:
ECPGdump_a_struct(o, name, ind_name, 1, typ, ind_typ, NULL, prefix, ind_prefix);
break;
case ECPGt_union: /* cannot dump a complete union */
yyerror("Type of union has to be specified");
break;
case ECPGt_char_variable:
ECPGdump_a_simple(o, name, typ->typ, 1, 1, NULL, prefix);
ECPGdump_a_simple(o, ind_name, ind_typ->typ, ind_typ->size, -1, NULL, ind_prefix);
break;
default:
ECPGdump_a_simple(o, name, typ->typ, typ->size, -1, NULL, prefix);
ECPGdump_a_simple(o, ind_name, ind_typ->typ, ind_typ->size, -1, NULL, ind_prefix);
......@@ -259,7 +269,9 @@ ECPGdump_a_simple(FILE *o, const char *name, enum ECPGttype typ,
char *variable = (char *) mm_alloc(strlen(name) + ((prefix == NULL) ? 0 : strlen(prefix)) + 4);
char *offset = (char *) mm_alloc(strlen(name) + strlen("sizeof(struct varchar_)") + 1);
if (varcharsize == 0 || arrsize >= 0)
/* if (varcharsize == 0 || arrsize >= 0)*/
/* we have to use the pointer except for arrays with given bounds */
if (arrsize > 0)
sprintf(variable, "(%s%s)", prefix ? prefix : "", name);
else
sprintf(variable, "&(%s%s)", prefix ? prefix : "", name);
......@@ -272,7 +284,7 @@ ECPGdump_a_simple(FILE *o, const char *name, enum ECPGttype typ,
case ECPGt_char:
case ECPGt_unsigned_char:
case ECPGt_char_variable:
sprintf(offset, "%ld*sizeof(char)", varcharsize);
sprintf(offset, "%ld*sizeof(char)", varcharsize == 0 ? 1 : varcharsize);
break;
default:
sprintf(offset, "sizeof(%s)", ECPGtype_name(typ));
......@@ -353,34 +365,36 @@ ECPGfree_type(struct ECPGtype * typ)
{
if (!IS_SIMPLE_TYPE(typ->typ))
{
if (typ->typ == ECPGt_array)
switch(typ->typ)
{
if (IS_SIMPLE_TYPE(typ->u.element->typ))
free(typ->u.element);
else if (typ->u.element->typ == ECPGt_array)
/* Array of array, */
yyerror("internal error, found multi-dimensional array\n");
else if (typ->u.element->typ == ECPGt_struct)
{
/* Array of structs. */
ECPGfree_struct_member(typ->u.element->u.members);
case ECPGt_array:
switch (typ->u.element->typ)
{
case ECPGt_array:
yyerror("internal error, found multi-dimensional array\n");
break;
case ECPGt_struct:
case ECPGt_union:
/* Array of structs. */
ECPGfree_struct_member(typ->u.element->u.members);
free(typ->u.members);
break;
default:
if (!IS_SIMPLE_TYPE(typ->u.element->typ))
yyerror("Internal error: unknown datatype, please inform pgsql-bugs@postgresql.org");
free(typ->u.element);
}
break;
case ECPGt_struct:
case ECPGt_union:
ECPGfree_struct_member(typ->u.members);
free(typ->u.members);
}
else
{
sprintf(errortext, "illegal variable type %d\n", typ);
break;
default:
sprintf(errortext, "illegal variable type %d\n", typ->typ);
yyerror(errortext);
}
}
else if (typ->typ == ECPGt_struct)
{
ECPGfree_struct_member(typ->u.members);
free(typ->u.members);
}
else
{
sprintf(errortext, "illegal variable type %d\n", typ);
yyerror(errortext);
break;
}
}
free(typ);
......
src/interfaces/ecpg/preproc/type.h
View file @ d077c614
......@@ -29,7 +29,7 @@ void ECPGmake_struct_member(char *, struct ECPGtype *, struct ECPGstruct_member
struct ECPGtype *ECPGmake_simple_type(enum ECPGttype, long);
struct ECPGtype *ECPGmake_varchar_type(enum ECPGttype, long);
struct ECPGtype *ECPGmake_array_type(struct ECPGtype *, long);
struct ECPGtype *ECPGmake_struct_type(struct ECPGstruct_member *);
struct ECPGtype *ECPGmake_struct_type(struct ECPGstruct_member *, enum ECPGttype type);
struct ECPGstruct_member * ECPGstruct_member_dup(struct ECPGstruct_member *);
/* Frees a type. */
......
src/interfaces/ecpg/test/test2.pgc
View file @ d077c614
......@@ -5,8 +5,8 @@ exec sql include header_test;
exec sql type c is char reference;
typedef char* c;
exec sql type ind is union { int integer; short smallinteger; };
typedef union { int integer; short smallinteger; } ind;
exec sql type ind is union { int integer; short smallint; };
typedef union { int integer; short smallint; } ind;
int
main ()
......@@ -23,7 +23,7 @@ exec sql begin declare section;
int ind_married;
ind children;
ind ind_children;
char married[9];
char *married = NULL;
c testname="Petra";
char *query="select name, born, age, married, children from meskes where name = :var1";
exec sql end declare section;
......@@ -43,7 +43,7 @@ exec sql end declare section;
exec sql connect to unix:postgresql://localhost:5432/mm;
strcpy(msg, "create");
exec sql create table meskes(name char(8), born integer, age smallint, married char(8), children integer);
exec sql create table meskes(name char(8), born integer, age smallint, married date, children integer);
strcpy(msg, "insert");
exec sql insert into meskes(name, married, children) values ('Petra', '19900404', 3);
......@@ -62,17 +62,20 @@ exec sql end declare section;
while (1) {
strcpy(msg, "fetch");
exec sql fetch in cur into :personal:ind_personal, :married:ind_married, :children.integer:ind_children.smallinteger;
exec sql fetch in cur into :personal:ind_personal, :married:ind_married, :children.integer:ind_children.smallint;
printf("%8.8s", personal.name.arr);
if (!ind_personal.ind_birth.born)
if (ind_personal.ind_birth.born >= 0)
printf(", born %d", personal.birth.born);
if (!ind_personal.ind_birth.age)
if (ind_personal.ind_birth.age >= 0)
printf(", age = %d", personal.birth.age);
if (!ind_married)
printf(", married %s", married);
if (!ind_children.smallinteger)
if (ind_married >= 0)
printf(", married %10.10s", married);
if (ind_children.smallint >= 0)
printf(", children = %d", children.integer);
putchar('\n');
free(married);
married = NULL;
}
strcpy(msg, "close");
......@@ -89,19 +92,21 @@ exec sql end declare section;
while (1) {
strcpy(msg, "fetch");
exec sql fetch in prep into :personal:ind_personal, :married:ind_married, :children.integer:ind_children.smallinteger;
exec sql fetch in prep into :personal:ind_personal, :married:ind_married, :children.integer:ind_children.smallint;
printf("%8.8s", personal.name.arr);
if (!ind_personal.ind_birth.born)
if (ind_personal.ind_birth.born >= 0)
printf(", born %d", personal.birth.born);
if (!ind_personal.ind_birth.age)
if (ind_personal.ind_birth.age >= 0)
printf(", age = %d", personal.birth.age);
if (!ind_married)
printf(", married %s", married);
if (!ind_children.smallinteger)
if (ind_married >= 0)
printf(", married %10.10s", married);
if (ind_children.smallint >= 0)
printf(", children = %d", children.integer);
putchar('\n');
}
free(married);
strcpy(msg, "close");
exec sql close prep;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment