luisgulo/gambas-source-code
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
gambas-source-code/main/gbc/gbc_trans.c
Benoît Minisini c61aa8d978 [DEVELOPMENT ENVIRONMENT] 
* NEW: Support for enumerations.
* BUG: Clearing project history works again.

[COMPILER]
* NEW: Support for enumerations.


git-svn-id: svn://localhost/gambas/trunk@2935 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2010-05-05 20:58:55 +00:00

749 lines
13 KiB
C
Raw Blame History

/***************************************************************************
gbc_trans.c
(c) 2000-2009 Benoît Minisini <gambas@users.sourceforge.net>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
***************************************************************************/
#define __GBC_TRANS_C
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <errno.h>
#include <math.h>
#include <float.h>
#include "gb_common.h"
#include "gb_error.h"
#include "gbc_compile.h"
#include "gbc_read.h"
#include "gbc_trans.h"
#include "gb_reserved.h"
#include "gb_code.h"
#define IS_PURE_INTEGER(_int64_val) ((_int64_val) == ((int)(_int64_val)))
int TRANS_in_affectation = 0;
//int TRANS_in_expression = 0;
void TRANS_reset(void)
{
JOB->line = 1;
JOB->current = JOB->pattern;
JOB->end = &(JOB->pattern[JOB->pattern_count]);
}
bool TRANS_newline(void)
{
if (PATTERN_is_newline(*JOB->current))
{
JOB->line = PATTERN_index(*JOB->current) + 1;
JOB->current++;
return TRUE;
}
return FALSE;
}
static bool read_integer(char *number, int base, int64_t *result)
{
uint64_t nbr2, nbr;
int d, n, nmax;
unsigned char c;
n = 0;
nbr = 0;
switch (base)
{
case 2: nmax = 64; break;
case 10: nmax = 19; break;
case 16: nmax = 16; break;
}
c = *number++;
for(;;)
{
if (c >= '0' && c <= '9')
d = c - '0';
else if (c >= 'A' && c <='Z')
d = c - 'A' + 10;
else if (c >= 'a' && c <='z')
d = c - 'a' + 10;
else
break;
if (d >= base)
break;
n++;
nbr2 = nbr * base;
if (((int64_t)nbr2 / base) != (int64_t)nbr)
return TRUE;
nbr = nbr2 + d;
c = *number++;
if (!c)
break;
}
if (base != 10)
{
if ((c == '&' || c == 'u' || c == 'U') && base != 10)
c = *number++;
else
{
if ((base == 16 && n == 4) || (base == 2 && n == 16))
{
if (nbr >= 0x8000L && nbr <= 0xFFFFL)
nbr |= INT64_C(0xFFFFFFFFFFFF0000);
}
else if ((base == 16 && n == 8) || (base == 2 && n == 32))
{
if (nbr >= 0x80000000L && nbr <= 0xFFFFFFFFL)
nbr |= INT64_C(0xFFFFFFFF00000000);
}
}
}
if (c)
return TRUE;
if (n == 0)
return TRUE;
*((int64_t *)result) = nbr;
return FALSE;
}
static bool read_float(char *number, double *result)
{
unsigned char c;
double nint;
double nfrac, n;
int nexp;
bool nexp_minus;
nint = 0.0;
nfrac = 0.0;
nexp = 0;
nexp_minus = FALSE;
c = *number++;
/* Integer part */
for(;;)
{
if (c == '.')
{
c = *number++;
break;
}
if (!c || !isdigit(c))
return TRUE;
nint = nint * 10 + (c - '0');
c = *number++;
if (c == 'e' || c == 'E')
break;
if (!c || isspace(c))
goto __END;
}
/* Decimal part */
n = 0.1;
for(;;)
{
if (!c || !isdigit(c))
break;
nfrac += n * (c - '0');
n /= 10;
c = *number++;
}
/* Exponent */
if (c == 'e' || c == 'E')
{
c = *number++;
if (c == '+' || c == '-')
{
if (c == '-')
nexp_minus = TRUE;
c = *number++;
}
if (!c || !isdigit(c))
return TRUE;
for(;;)
{
nexp = nexp * 10 + (c - '0');
if (nexp > DBL_MAX_10_EXP)
return TRUE;
c = *number++;
if (!c || !isdigit(c))
break;
}
}
if (c)
return TRUE;
__END:
*result = (nint + nfrac) * pow(10, nexp_minus ? (-nexp) : nexp);
return FALSE;
}
bool TRANS_get_number(int index, TRANS_NUMBER *result)
{
char *number = (char *)TABLE_get_symbol_name(JOB->class->table, index);
unsigned char c;
int64_t val = 0;
double dval = 0.0;
int type;
int base = 10;
bool minus = FALSE;
c = *number++;
if (c == '+' || c == '-')
{
minus = (c == '-');
c = *number++;
}
if (c == '&')
{
c = *number++;
if (c == 'H' || c == 'h')
{
base = 16;
c = *number++;
}
else if (c == 'X' || c == 'x')
{
base = 2;
c = *number++;
}
else
base = 16;
}
else if (c == '%')
{
base = 2;
c = *number++;
}
if (!c)
return TRUE;
if (c == '-' || c == '+')
return TRUE;
errno = 0;
number--;
if (!read_integer(number, base, &val))
{
if (IS_PURE_INTEGER(val))
{
type = T_INTEGER;
goto __END;
}
else
{
type = T_LONG;
goto __END;
}
}
if (base == 10)
{
if (!read_float(number, &dval))
{
type = T_FLOAT;
goto __END;
}
}
return TRUE;
__END:
result->type = type;
if (type == T_INTEGER)
result->lval = result->ival = minus ? (-val) : val;
else if (type == T_LONG)
result->lval = minus ? (-val) : val;
else
result->dval = minus ? (-dval) : dval;
return FALSE;
}
static PATTERN *trans_square(PATTERN *look, int mode, TRANS_DECL *result)
{
TRANS_NUMBER tnum;
int i;
if (!(mode & TT_CAN_SQUARE))
{
if (PATTERN_is(*look, RS_LSQR))
THROW("Arrays are forbidden here");
return look;
}
if (!PATTERN_is(*look, RS_LSQR))
return look;
/*
if (result->is_array)
THROW("Syntax error. Duplicated array declaration");
*/
look++;
/*
if (PATTERN_is(*look, RS_RSQR))
{
look++;
return look;
}
*/
if (mode && TT_CAN_ARRAY)
{
for (i = 0;; i++)
{
if (i >= MAX_ARRAY_DIM)
THROW("Too many dimensions");
if (TRANS_get_number(PATTERN_index(*look), &tnum))
THROW(E_SYNTAX);
if (tnum.type != T_INTEGER)
THROW(E_SYNTAX);
if (tnum.ival < 1 || tnum.ival > (2 << 22)) /* 4 Mo, ca devrait suffire... ;-) */
THROW("Bad subscript range");
result->array.dim[i] = tnum.ival;
result->array.ndim++;
look++;
if (PATTERN_is(*look, RS_RSQR))
break;
if (!PATTERN_is(*look, RS_COMMA))
THROW(E_MISSING, "','");
look++;
}
}
if (!PATTERN_is(*look, RS_RSQR))
THROW(E_MISSING, "']'");
look++;
return look;
}
int TRANS_get_class(PATTERN pattern)
{
int index = PATTERN_index(pattern);
int index_array;
if (!CLASS_exist_class(JOB->class, index))
{
// Maybe a compound class?
CLASS_SYMBOL *sym = CLASS_get_symbol(JOB->class, index);
int i;
char c;
//fprintf(stderr, "TRANS_get_class: %.*s\n", sym->symbol.len, sym->symbol.name);
for (i = sym->symbol.len - 1; i >= 0; i--)
{
c = sym->symbol.name[i];
if (c == '[')
{
//fprintf(stderr, "TRANS_get_class: find %.*s\n", i, sym->symbol.name);
if (TABLE_find_symbol(JOB->class->table, sym->symbol.name, i, NULL, &index_array))
{
index_array = TRANS_get_class(PATTERN_make(RT_CLASS, index_array));
if (JOB->class->class[index_array].exported)
return CLASS_add_class_exported(JOB->class, index);
else
return CLASS_add_class(JOB->class, index);
}
}
}
THROW("Unknown identifier: &1", TABLE_get_symbol_name(JOB->class->table, index));
}
return CLASS_add_class(JOB->class, index);
}
bool TRANS_type(int mode, TRANS_DECL *result)
{
PATTERN *look = JOB->current;
short id;
int value;
int flag = 0;
/* Do not fill the structure with zeros */
TYPE_clear(&result->type);
result->is_new = FALSE;
result->init = NULL;
result->array.ndim = 0;
look = trans_square(look, mode, result);
if (!PATTERN_is(*look, RS_AS))
{
if (mode & TT_DO_NOT_CHECK_AS)
return FALSE;
else
THROW(E_MISSING, "AS");
}
look++;
if (mode & TT_CAN_NEW)
{
if (PATTERN_is(*look, RS_NEW))
{
if (TYPE_get_id(result->type) == T_ARRAY)
THROW("Cannot mix NEW and array declaration");
result->is_new = TRUE;
look++;
result->init = look;
}
}
if (!PATTERN_is_type(*look) && !PATTERN_is_class(*look))
THROW_UNEXPECTED(look);
if (PATTERN_is_type(*look))
{
id = RES_get_type(PATTERN_index(*look));
value = -1;
}
else
{
id = T_OBJECT;
value = TRANS_get_class(*look);
}
if (PATTERN_is(look[1], RS_LSQR))
{
value = CLASS_get_array_class(JOB->class, id, value);
id = T_OBJECT;
if (!PATTERN_is(look[2], RS_RSQR))
{
if (mode & TT_CAN_NEW)
{
if (TYPE_get_id(result->type) == T_ARRAY)
THROW("Cannot mix NEW and array declaration");
result->is_new = TRUE;
result->init = look;
}
else
THROW("Syntax error");
}
while (!PATTERN_is_newline(*look))
look++;
}
else
{
//if (id == T_OBJECT)
// value = (-1);
look++;
}
if (id == T_VOID)
return FALSE;
/*
if (result->is_array && result->array.ndim == 0)
result->is_array = FALSE;
*/
if (result->array.ndim > 0)
{
result->array.type = TYPE_make(id, value, flag);
result->type = TYPE_make(T_ARRAY, CLASS_add_array(JOB->class, &result->array), 0);
}
else
{
result->type = TYPE_make(id, value, flag);
if ((mode & TT_CAN_NEW) && !result->is_new && PATTERN_is(*look, RS_EQUAL))
{
look++;
result->init = look;
while (!PATTERN_is_newline(*look))
look++;
}
}
JOB->current = look;
return TRUE;
}
bool TRANS_check_declaration(void)
{
PATTERN *look = JOB->current;
if (!PATTERN_is_identifier(*look))
return FALSE;
look++;
if (PATTERN_is(*look, RS_LSQR))
{
for(;;)
{
look++;
if (PATTERN_is(*look, RS_RSQR))
break;
if (PATTERN_is_newline(*look))
return FALSE;
}
look++;
}
if (!PATTERN_is(*look, RS_AS))
return FALSE;
return TRUE;
}
PATTERN *TRANS_get_constant_value(TRANS_DECL *decl, PATTERN *current)
{
int index;
TRANS_NUMBER number;
int type;
PATTERN value;
type = TYPE_get_id(decl->type);
value = *current++;
index = PATTERN_index(value);
if (type == T_STRING)
{
if (PATTERN_is(value, RS_LBRA))
{
value = *current++;
if (!PATTERN_is_string(value))
THROW("Syntax error");
index = PATTERN_index(value);
value = *current++;
if (!PATTERN_is(value, RS_RBRA))
THROW("Syntax error");
TYPE_set_id(&decl->type, T_CSTRING);
}
else
{
if (!PATTERN_is_string(value))
THROW("Syntax error");
}
decl->is_integer = FALSE;
decl->value = index;
}
else
{
if (PATTERN_is_string(value))
THROW("Syntax error");
if (type != T_BOOLEAN && type <= T_FLOAT)
{
if (TRANS_get_number(index, &number))
THROW("Type mismatch");
}
switch(type)
{
case T_BOOLEAN:
decl->is_integer = TRUE;
if (PATTERN_is(value, RS_TRUE))
decl->value = -1L;
else if (PATTERN_is(value, RS_FALSE))
decl->value = 0L;
else
THROW("Type mismatch");
break;
case T_BYTE: case T_SHORT: case T_INTEGER:
decl->is_integer = TRUE;
if (number.type != T_INTEGER)
{
if (number.type == T_LONG)
THROW("Out of range");
else
THROW("Type mismatch");
}
if (((type == T_BYTE) && (number.ival < 0 || number.ival > 255))
|| ((type == T_SHORT) && (number.ival < -32768L || number.ival > 32767L)))
THROW("Out of range");
decl->value = number.ival;
//fprintf(stderr, "TRANS_get_constant_value: INT: %ld\n", decl->value);
break;
case T_FLOAT: case T_SINGLE:
if (type == T_SINGLE && !finite((float)number.dval))
THROW("Out of range");
decl->is_integer = FALSE;
decl->value = index;
break;
case T_LONG:
if (number.type == T_FLOAT)
THROW("Type mismatch");
decl->is_integer = FALSE;
decl->value = index;
decl->lvalue = number.lval;
//fprintf(stderr, "TRANS_get_constant_value: LONG: %lld\n", decl->lvalue);
break;
default:
THROW("Bad constant type");
}
}
return current;
}
void TRANS_want(int reserved, char *msg)
{
if (!PATTERN_is(*JOB->current, reserved))
THROW("Syntax error. &1 expected", msg ? msg : COMP_res_info[reserved].name);
JOB->current++;
}
void TRANS_want_newline()
{
if (!TRANS_newline())
THROW_UNEXPECTED(JOB->current);
}
bool TRANS_is(int reserved)
{
if (PATTERN_is(*JOB->current, reserved))
{
JOB->current++;
return TRUE;
}
else
return FALSE;
}
void TRANS_ignore(int reserved)
{
if (PATTERN_is(*JOB->current, reserved))
JOB->current++;
}
bool TRANS_is_end_function(bool is_proc, PATTERN *look)
{
if (PATTERN_is_newline(*look))
return TRUE;
if (is_proc)
return PATTERN_is(*look, RS_PROCEDURE) || PATTERN_is(*look, RS_SUB);
else
return PATTERN_is(*look, RS_FUNCTION);
}
char *TRANS_get_num_desc(int num)
{
static const char *num_desc[3] = { "first", "second", "third" };
static char desc[6];
if (num < 1)
return NULL;
if (ERROR_translate)
{
snprintf(desc, sizeof(desc), "#%d", num);
}
else
{
if (num < 4)
return (char *)num_desc[num - 1];
snprintf(desc, sizeof(desc), "%dth", num);
}
return desc;
}
Reference in a new issue View git blame Copy permalink