6502/cc65
1
0
Fork 0
mirror of https://github.com/cc65/cc65.git synced 2024-06-08 15:29:37 +00:00
Code Issues Projects Releases Wiki Activity
97c9226c1e
cc65/src/cc65/expr.c
cuz 97c9226c1e Fixed a bug 
git-svn-id: svn://svn.cc65.org/cc65/trunk@43 b7a2c559-68d2-44c3-8de9-860c34a00d81
2000-06-10 10:24:28 +00:00

2977 lines
79 KiB
C
Raw Blame History

/*
* expr.c
*
* Ullrich von Bassewitz, 21.06.1998
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "asmcode.h"
#include "asmlabel.h"
#include "check.h"
#include "codegen.h"
#include "datatype.h"
#include "declare.h"
#include "error.h"
#include "funcdesc.h"
#include "function.h"
#include "global.h"
#include "io.h"
#include "litpool.h"
#include "macrotab.h"
#include "mem.h"
#include "preproc.h"
#include "scanner.h"
#include "stdfunc.h"
#include "symtab.h"
#include "expr.h"
/*****************************************************************************/
/* Data */
/*****************************************************************************/
/* Generator attributes */
#define GEN_NOPUSH 0x01 /* Don't push lhs */
/* Map a generator function and its attributes to a token */
typedef struct {
unsigned char Tok; /* Token to map to */
unsigned char Flags; /* Flags for generator function */
void (*Func) (unsigned, unsigned long); /* Generator func */
} GenDesc;
/* Descriptors for the operations */
static GenDesc GenMUL = { STAR, GEN_NOPUSH, g_mul };
static GenDesc GenDIV = { DIV, GEN_NOPUSH, g_div };
static GenDesc GenMOD = { MOD, GEN_NOPUSH, g_mod };
static GenDesc GenASL = { ASL, GEN_NOPUSH, g_asl };
static GenDesc GenASR = { ASR, GEN_NOPUSH, g_asr };
static GenDesc GenLT = { LT, GEN_NOPUSH, g_lt };
static GenDesc GenLE = { LE, GEN_NOPUSH, g_le };
static GenDesc GenGE = { GE, GEN_NOPUSH, g_ge };
static GenDesc GenGT = { GT, GEN_NOPUSH, g_gt };
static GenDesc GenEQ = { EQ, GEN_NOPUSH, g_eq };
static GenDesc GenNE = { NE, GEN_NOPUSH, g_ne };
static GenDesc GenAND = { AMP, GEN_NOPUSH, g_and };
static GenDesc GenXOR = { XOR, GEN_NOPUSH, g_xor };
static GenDesc GenOR = { BAR, GEN_NOPUSH, g_or };
static GenDesc GenPASGN = { PASGN, GEN_NOPUSH, g_add };
static GenDesc GenSASGN = { SASGN, GEN_NOPUSH, g_sub };
static GenDesc GenMASGN = { MASGN, GEN_NOPUSH, g_mul };
static GenDesc GenDASGN = { DASGN, GEN_NOPUSH, g_div };
static GenDesc GenMOASGN = { MOASGN, GEN_NOPUSH, g_mod };
static GenDesc GenSLASGN = { SLASGN, GEN_NOPUSH, g_asl };
static GenDesc GenSRASGN = { SRASGN, GEN_NOPUSH, g_asr };
static GenDesc GenAASGN = { AASGN, GEN_NOPUSH, g_and };
static GenDesc GenXOASGN = { XOASGN, GEN_NOPUSH, g_xor };
static GenDesc GenOASGN = { OASGN, GEN_NOPUSH, g_or };
/*****************************************************************************/
/* Function forwards */
/*****************************************************************************/
static int hie10 (struct expent* lval);
/* Handle ++, --, !, unary - etc. */
/*****************************************************************************/
/* Helper functions */
/*****************************************************************************/
static unsigned GlobalModeFlags (unsigned flags)
/* Return the addressing mode flags for the variable with the given flags */
{
flags &= E_MCTYPE;
if (flags == E_TGLAB) {
/* External linkage */
return CF_EXTERNAL;
} else if (flags == E_TREGISTER) {
/* Register variable */
return CF_REGVAR;
} else {
/* Static */
return CF_STATIC;
}
}
static int IsNullPtr (struct expent* lval)
/* Return true if this is the NULL pointer constant */
{
return (IsInt (lval->e_tptr) && /* Is it an int? */
lval->e_flags == E_MCONST && /* Is it constant? */
lval->e_const == 0); /* And is it's value zero? */
}
static type* promoteint (type* lhst, type* rhst)
/* In an expression with two ints, return the type of the result */
{
/* Rules for integer types:
* - If one of the values is a long, the result is long.
* - If one of the values is unsigned, the result is also unsigned.
* - Otherwise the result is an int.
*/
if (IsLong (lhst) || IsLong (rhst)) {
if (IsUnsigned (lhst) || IsUnsigned (rhst)) {
return type_ulong;
} else {
return type_long;
}
} else {
if (IsUnsigned (lhst) || IsUnsigned (rhst)) {
return type_uint;
} else {
return type_int;
}
}
}
static unsigned typeadjust (struct expent* lhs, struct expent* rhs, int NoPush)
/* Adjust the two values for a binary operation. lhs is expected on stack or
* to be constant, rhs is expected to be in the primary register or constant.
* The function will put the type of the result into lhs and return the
* code generator flags for the operation.
* If NoPush is given, it is assumed that the operation does not expect the lhs
* to be on stack, and that lhs is in a register instead.
* Beware: The function does only accept int types.
*/
{
unsigned ltype, rtype;
unsigned flags;
/* Get the type strings */
type* lhst = lhs->e_tptr;
type* rhst = rhs->e_tptr;
/* Generate type adjustment code if needed */
ltype = TypeOf (lhst);
if (lhs->e_flags == E_MCONST) {
ltype |= CF_CONST;
}
if (NoPush) {
/* Value is in primary register*/
ltype |= CF_REG;
}
rtype = TypeOf (rhst);
if (rhs->e_flags == E_MCONST) {
rtype |= CF_CONST;
}
flags = g_typeadjust (ltype, rtype);
/* Set the type of the result */
lhs->e_tptr = promoteint (lhst, rhst);
/* Return the code generator flags */
return flags;
}
unsigned assignadjust (type* lhst, struct expent* rhs)
/* Adjust the type of the right hand expression so that it can be assigned to
* the type on the left hand side. This function is used for assignment and
* for converting parameters in a function call. It returns the code generator
* flags for the operation. The type string of the right hand side will be
* set to the type of the left hand side.
*/
{
/* Get the type of the right hand side */
type* rhst = rhs->e_tptr;
/* After calling this function, rhs will have the type of the lhs */
rhs->e_tptr = lhst;
/* First, do some type checking */
if (IsVoid (lhst) || IsVoid (rhst)) {
/* If one of the sides are of type void, output a more apropriate
* error message.
*/
Error (ERR_ILLEGAL_TYPE);
} else if (IsInt (lhst)) {
if (IsPtr (rhst)) {
/* Pointer -> int conversion */
Warning (WARN_PTR_TO_INT_CONV);
} else if (!IsInt (rhst)) {
Error (ERR_INCOMPATIBLE_TYPES);
} else {
/* Adjust the int types. To avoid manipulation of TOS mark lhs
* as const.
*/
unsigned flags = TypeOf (rhst);
if (rhs->e_flags & E_MCONST) {
flags |= CF_CONST;
}
return g_typeadjust (TypeOf (lhst) | CF_CONST, flags);
}
} else if (IsPtr (lhst)) {
if (IsPtr (rhst)) {
/* Pointer to pointer assignment is valid, if:
* - both point to the same types, or
* - the rhs pointer is a void pointer, or
* - the lhs pointer is a void pointer.
*/
type* left = Indirect (lhst);
type* right = Indirect (rhst);
if (!EqualTypes (left, right) && *left != T_VOID && *right != T_VOID) {
Error (ERR_INCOMPATIBLE_POINTERS);
}
} else if (IsInt (rhst)) {
/* Int to pointer assignment is valid only for constant zero */
if ((rhs->e_flags & E_MCONST) == 0 || rhs->e_const != 0) {
Warning (WARN_INT_TO_PTR_CONV);
}
} else if (IsFuncPtr (lhst) && IsFunc(rhst)) {
/* Assignment of function to function pointer is allowed, provided
* that both functions have the same parameter list.
*/
if (!EqualTypes(Indirect (lhst), rhst)) {
Error (ERR_INCOMPATIBLE_TYPES);
}
} else {
Error (ERR_INCOMPATIBLE_TYPES);
}
} else {
Error (ERR_INCOMPATIBLE_TYPES);
}
/* Return an int value in all cases where the operands are not both ints */
return CF_INT;
}
void DefineData (struct expent* lval)
/* Output a data definition for the given expression */
{
unsigned flags = lval->e_flags;
switch (flags & E_MCTYPE) {
case E_TCONST:
/* Number */
g_defdata (TypeOf (lval->e_tptr) | CF_CONST, lval->e_const, 0);
break;
case E_TREGISTER:
/* Register variable. Taking the address is usually not
* allowed.
*/
if (!AllowRegVarAddr) {
Error (ERR_CANNOT_TAKE_ADDR_OF_REG);
}
/* FALLTHROUGH */
case E_TGLAB:
case E_TLLAB:
/* Local or global symbol */
g_defdata (GlobalModeFlags (flags), lval->e_name, lval->e_const);
break;
case E_TLIT:
/* a literal of some kind */
g_defdata (CF_STATIC, LiteralLabel, lval->e_const);
break;
default:
Internal ("Unknown constant type: %04X", flags);
}
}
static void lconst (unsigned flags, struct expent* lval)
/* Load primary reg with some constant value. */
{
switch (lval->e_flags & E_MCTYPE) {
case E_TLOFFS:
g_leasp (lval->e_const);
break;
case E_TCONST:
/* Number constant */
g_getimmed (flags | TypeOf (lval->e_tptr) | CF_CONST, lval->e_const, 0);
break;
case E_TREGISTER:
/* Register variable. Taking the address is usually not
* allowed.
*/
if (!AllowRegVarAddr) {
Error (ERR_CANNOT_TAKE_ADDR_OF_REG);
}
/* FALLTHROUGH */
case E_TGLAB:
case E_TLLAB:
/* Local or global symbol, load address */
flags |= GlobalModeFlags (lval->e_flags);
flags &= ~CF_CONST;
g_getimmed (flags, lval->e_name, lval->e_const);
break;
case E_TLIT:
/* Literal string */
g_getimmed (CF_STATIC, LiteralLabel, lval->e_const);
break;
default:
Internal ("Unknown constant type: %04X", lval->e_flags);
}
}
static int kcalc (int tok, long val1, long val2)
/* Calculate an operation with left and right operand constant. */
{
switch (tok) {
case EQ:
return (val1 == val2);
case NE:
return (val1 != val2);
case LT:
return (val1 < val2);
case LE:
return (val1 <= val2);
case GE:
return (val1 >= val2);
case GT:
return (val1 > val2);
case BAR:
return (val1 | val2);
case XOR:
return (val1 ^ val2);
case AMP:
return (val1 & val2);
case ASR:
return (val1 >> val2);
case ASL:
return (val1 << val2);
case STAR:
return (val1 * val2);
case DIV:
if (val2 == 0) {
Error (ERR_DIV_BY_ZERO);
return 0x7FFFFFFF;
}
return (val1 / val2);
case MOD:
if (val2 == 0) {
Error (ERR_MOD_BY_ZERO);
return 0;
}
return (val1 % val2);
default:
Internal ("kcalc: got token 0x%X\n", tok);
return 0;
}
}
static GenDesc* FindGen (int Tok, GenDesc** Table)
{
GenDesc* G;
while ((G = *Table) != 0) {
if (G->Tok == Tok) {
return G;
}
++Table;
}
return 0;
}
static int istypeexpr (void)
/* Return true if some sort of variable or type is waiting (helper for cast
* and sizeof() in hie10).
*/
{
SymEntry* Entry;
return curtok == LPAREN && (
(nxttok >= FIRSTTYPE && nxttok <= LASTTYPE) ||
(nxttok == CONST) ||
(nxttok == IDENT &&
(Entry = FindSym (NextTok.Ident)) != 0 &&
IsTypeDef (Entry))
);
}
static void PushAddr (struct expent* lval)
/* If the expression contains an address that was somehow evaluated,
* push this address on the stack. This is a helper function for all
* sorts of implicit or explicit assignment functions where the lvalue
* must be saved if it's not constant, before evaluating the rhs.
*/
{
/* Get the address on stack if needed */
if (lval->e_flags != E_MREG && (lval->e_flags & E_MEXPR)) {
/* Push the address (always a pointer) */
g_push (CF_PTR, 0);
}
}
/*****************************************************************************/
/* code */
/*****************************************************************************/
void exprhs (unsigned flags, int k, struct expent *lval)
/* Put the result of an expression into the primary register */
{
int f;
f = lval->e_flags;
if (k) {
/* Dereferenced lvalue */
flags |= TypeOf (lval->e_tptr);
if (lval->e_test & E_FORCETEST) {
flags |= CF_TEST;
lval->e_test &= ~E_FORCETEST;
}
if (f & E_MGLOBAL) { /* ref to globalvar */
/* Generate code */
flags |= GlobalModeFlags (f);
g_getstatic (flags, lval->e_name, lval->e_const);
} else if (f & E_MLOCAL) {
/* ref to localvar */
g_getlocal (flags, lval->e_const);
} else if (f & E_MCONST) {
/* ref to absolute address */
g_getstatic (flags | CF_ABSOLUTE, lval->e_const, 0);
} else if (f == E_MEOFFS) {
g_getind (flags, lval->e_const);
} else if (f != E_MREG) {
g_getind (flags, 0);
}
} else if (f == E_MEOFFS) {
/* reference not storable */
flags |= TypeOf (lval->e_tptr);
g_inc (flags | CF_CONST, lval->e_const);
} else if ((f & E_MEXPR) == 0) {
/* Constant of some sort, load it into the primary */
lconst (flags, lval);
}
if (lval->e_test & E_FORCETEST) { /* we testing this value? */
/* debug... */
AddCodeHint ("forcetest");
flags |= TypeOf (lval->e_tptr);
g_test (flags); /* yes, force a test */
lval->e_test &= ~E_FORCETEST;
}
}
static void callfunction (struct expent* lval)
/* Perform a function call. Called from hie11, this routine will
* either call the named function, or if the supplied ptr is zero,
* will call the contents of P.
*/
{
struct expent lval2;
FuncDesc* Func; /* Function descriptor */
int Ellipsis; /* True if we have an open param list */
SymEntry* Param; /* Current formal parameter */
unsigned ParamCount; /* Actual parameter count */
unsigned ParamSize; /* Number of parameter bytes */
unsigned Flags;
unsigned CFlags;
CodeMark Mark;
/* Get a pointer to the function descriptor from the type string */
Func = GetFuncDesc (lval->e_tptr);
/* Initialize vars to keep gcc silent */
Param = 0;
Mark = 0;
/* Check if this is a function pointer. If so, save it. If not, check for
* special known library functions that may be inlined.
*/
if (lval->e_flags & E_MEXPR) {
/* Function pointer is in primary register, save it */
Mark = GetCodePos ();
g_save (CF_PTR);
} else if (InlineStdFuncs && IsStdFunc ((const char*) lval->e_name)) {
/* Inline this function */
HandleStdFunc (lval);
return;
}
/* Parse the actual parameter list */
ParamSize = 0;
ParamCount = 0;
Ellipsis = 0;
while (curtok != RPAREN) {
/* Add a hint for the optimizer */
AddCodeHint ("param:start");
/* Count arguments */
++ParamCount;
/* Fetch the pointer to the next argument, check for too many args */
if (ParamCount <= Func->ParamCount) {
if (ParamCount == 1) {
/* First argument */
Param = Func->SymTab->SymHead;
} else {
/* Next argument */
Param = Param->NextSym;
CHECK ((Param->Flags & SC_PARAM) != 0);
}
} else if (!Ellipsis) {
/* Too many arguments. Do we have an open param list? */
if ((Func->Flags & FD_ELLIPSIS) == 0) {
/* End of param list reached, no ellipsis */
Error (ERR_TOO_MANY_FUNC_ARGS);
}
/* Assume an ellipsis even in case of errors to avoid an error
* message for each other argument.
*/
Ellipsis = 1;
}
/* Do some optimization: If we have a constant value to push,
* use a special function that may optimize.
*/
CFlags = CF_NONE;
if (!Ellipsis && SizeOf (Param->Type) == 1) {
CFlags = CF_FORCECHAR;
}
Flags = 0;
if (evalexpr (CFlags, hie1, &lval2) == 0) {
/* A constant value */
Flags |= CF_CONST;
}
/* If we don't have an argument spec, accept anything, otherwise
* convert the actual argument to the type needed.
*/
if (!Ellipsis) {
/* Promote the argument if needed */
assignadjust (Param->Type, &lval2);
/* If we have a prototype, chars may be pushed as chars */
Flags |= CF_FORCECHAR;
}
/* Use the type of the argument for the push */
Flags |= TypeOf (lval2.e_tptr);
/* If this is a fastcall function, don't push the last argument */
if (ParamCount == Func->ParamCount && (Func->Flags & FD_FASTCALL) != 0) {
/* Just load the argument into the primary. This is only needed if
* we have a constant argument, otherwise the value is already in
* the primary.
*/
if (Flags & CF_CONST) {
exprhs (CF_FORCECHAR, 0, &lval2);
}
} else {
/* Push the argument, count the argument size */
g_push (Flags, lval2.e_const);
ParamSize += sizeofarg (Flags);
}
/* Add an optimizer hint */
AddCodeHint ("param:end");
/* Check for end of argument list */
if (curtok != COMMA) {
break;
}
gettok ();
}
/* We need the closing bracket here */
ConsumeRParen ();
/* Check if we had enough parameters */
if (ParamCount < Func->ParamCount) {
Error (ERR_TOO_FEW_FUNC_ARGS);
}
/* */
if (lval->e_flags & E_MEXPR) {
/* Function called via pointer: Restore it and call function */
if (ParamSize != 0) {
g_restore (CF_PTR);
} else {
/* We had no parameters - remove save code */
RemoveCode (Mark);
}
g_callind (TypeOf (lval->e_tptr), ParamSize);
} else {
g_call (TypeOf (lval->e_tptr), (char*) lval->e_name, ParamSize);
}
}
void doasm (void)
/* This function parses ASM statements. The syntax of the ASM directive
* looks like the one defined for C++ (C has no ASM directive), that is,
* a string literal in parenthesis.
*/
{
/* Skip the ASM */
gettok ();
/* Need left parenthesis */
ConsumeLParen ();
/* String literal */
if (curtok != SCONST) {
Error (ERR_STRLIT_EXPECTED);
} else {
/* Write the string directly into the output, followed by a newline */
AddCodeLine (GetLiteral (curval));
/* Reset the string pointer, effectivly clearing the string from the
* string table. Since we're working with one token lookahead, this
* will fail if the next token is also a string token, but that's a
* syntax error anyway, because we expect a right paren.
*/
ResetLiteralOffs (curval);
}
/* Skip the string token */
gettok ();
/* Closing paren needed */
ConsumeRParen ();
}
static int primary (struct expent* lval)
/* This is the lowest level of the expression parser. */
{
int k;
/* not a test at all, yet */
lval->e_test = 0;
/* Character and integer constants. */
if (curtok == ICONST || curtok == CCONST) {
lval->e_flags = E_MCONST | E_TCONST;
lval->e_tptr = curtype;
lval->e_const = curval;
gettok ();
return 0;
}
/* Process parenthesized subexpression by calling the whole parser
* recursively.
*/
if (curtok == LPAREN) {
gettok ();
memset (lval, 0, sizeof (*lval)); /* Remove any attributes */
k = hie0 (lval);
ConsumeRParen ();
return k;
}
/* All others may only be used if the expression evaluation is not called
* recursively by the preprocessor.
*/
if (Preprocessing) {
/* Illegal expression in PP mode */
Error (ERR_CPP_EXPR_EXPECTED);
lval->e_flags = E_MCONST;
lval->e_tptr = type_int;
return 0;
}
/* Identifier? */
if (curtok == IDENT) {
SymEntry* Sym;
ident Ident;
/* Get a pointer to the symbol table entry */
Sym = FindSym (CurTok.Ident);
/* Is the symbol known? */
if (Sym) {
/* We found the symbol - skip the name token */
gettok ();
/* The expression type is the symbol type */
lval->e_tptr = Sym->Type;
/* Check for illegal symbol types */
if ((Sym->Flags & SC_LABEL) == SC_LABEL) {
/* Cannot use labels in expressions */
Error (ERR_SYMBOL_KIND);
return 1;
} else if (Sym->Flags & SC_TYPE) {
/* Cannot use type symbols */
Error (ERR_VAR_IDENT_EXPECTED);
/* Assume an int type to make lval valid */
lval->e_flags = E_MLOCAL | E_TLOFFS;
lval->e_tptr = type_int;
lval->e_const = 0;
return 0;
}
/* Check for legal symbol types */
if ((Sym->Flags & SC_ENUM) == SC_ENUM) {
lval->e_flags = E_MCONST;
lval->e_const = Sym->V.EnumVal;
return 0;
} else if ((Sym->Flags & SC_FUNC) == SC_FUNC) {
/* Function */
lval->e_flags = E_MGLOBAL | E_MCONST | E_TGLAB;
lval->e_name = (unsigned long) Sym->Name;
lval->e_const = 0;
} else if ((Sym->Flags & SC_AUTO) == SC_AUTO) {
/* Local variable */
lval->e_flags = E_MLOCAL | E_TLOFFS;
lval->e_const = Sym->V.Offs;
} else if ((Sym->Flags & SC_STATIC) == SC_STATIC) {
/* Static variable */
if (Sym->Flags & (SC_EXTERN | SC_STORAGE)) {
lval->e_flags = E_MGLOBAL | E_MCONST | E_TGLAB;
lval->e_name = (unsigned long) Sym->Name;
} else {
lval->e_flags = E_MGLOBAL | E_MCONST | E_TLLAB;
lval->e_name = Sym->V.Label;
}
lval->e_const = 0;
} else if ((Sym->Flags & SC_REGISTER) == SC_REGISTER) {
/* Register variable, zero page based */
lval->e_flags = E_MGLOBAL | E_MCONST | E_TREGISTER;
lval->e_name = Sym->V.Offs;
lval->e_const = 0;
} else {
/* Local static variable */
lval->e_flags = E_MGLOBAL | E_MCONST | E_TLLAB;
lval->e_name = Sym->V.Offs;
lval->e_const = 0;
}
/* The symbol is referenced now */
Sym->Flags |= SC_REF;
if (IsFunc (lval->e_tptr) || IsArray (lval->e_tptr)) {
return 0;
}
return 1;
}
/* We did not find the symbol. Remember the name, then skip it */
strcpy (Ident, CurTok.Ident);
gettok ();
/* IDENT is either an auto-declared function or an undefined variable. */
if (curtok == LPAREN) {
/* Declare a function returning int. For that purpose, prepare a
* function signature for a function having an empty param list
* and returning int.
*/
Warning (WARN_FUNC_WITHOUT_PROTO);
Sym = AddGlobalSym (Ident, GetImplicitFuncType(), SC_EXTERN | SC_REF);
lval->e_tptr = Sym->Type;
lval->e_flags = E_MGLOBAL | E_MCONST | E_TGLAB;
lval->e_name = (unsigned long) Sym->Name;
lval->e_const = 0;
return 0;
} else {
/* Undeclared Variable */
Sym = AddLocalSym (Ident, type_int, SC_AUTO | SC_REF, 0);
lval->e_flags = E_MLOCAL | E_TLOFFS;
lval->e_tptr = type_int;
lval->e_const = 0;
Error (ERR_UNDEFINED_SYMBOL, Ident);
return 1;
}
}
/* String literal? */
if (curtok == SCONST) {
lval->e_flags = E_MCONST | E_TLIT;
lval->e_const = curval;
lval->e_tptr = GetCharArrayType (strlen (GetLiteral (curval)));
gettok ();
return 0;
}
/* ASM statement? */
if (curtok == ASM) {
doasm ();
lval->e_tptr = type_void;
lval->e_flags = E_MEXPR;
lval->e_const = 0;
return 0;
}
/* __AX__ and __EAX__ pseudo values? */
if (curtok == AX || curtok == EAX) {
lval->e_tptr = (curtok == AX)? type_uint : type_ulong;
lval->e_flags = E_MREG;
lval->e_test &= ~E_CC;
lval->e_const = 0;
gettok ();
return 1; /* May be used as lvalue */
}
/* Illegal primary. */
Error (ERR_EXPR_EXPECTED);
lval->e_flags = E_MCONST;
lval->e_tptr = type_int;
return 0;
}
static int arrayref (int k, struct expent* lval)
/* Handle an array reference */
{
unsigned lflags;
unsigned rflags;
int ConstBaseAddr;
int ConstSubAddr;
int l;
struct expent lval2;
CodeMark Mark1;
CodeMark Mark2;
type* tptr1;
type* tptr2;
/* Skip the bracket */
gettok ();
/* Get the type of left side */
tptr1 = lval->e_tptr;
/* We can apply a special treatment for arrays that have a const base
* address. This is true for most arrays and will produce a lot better
* code. Check if this is a const base address.
*/
lflags = lval->e_flags & ~E_MCTYPE;
ConstBaseAddr = (lflags == E_MCONST) || /* Constant numeric address */
(lflags & E_MGLOBAL) != 0 || /* Static array, or ... */
lflags == E_MLOCAL; /* Local array */
/* If we have a constant base, we delay the address fetch */
Mark1 = GetCodePos ();
Mark2 = 0; /* Silence gcc */
if (!ConstBaseAddr) {
/* Get a pointer to the array into the primary */
exprhs (CF_NONE, k, lval);
/* Get the array pointer on stack. Do not push more than 16
* bit, even if this value is greater, since we cannot handle
* other than 16bit stuff when doing indexing.
*/
Mark2 = GetCodePos ();
g_push (CF_PTR, 0);
}
/* TOS now contains ptr to array elements. Get the subscript. */
l = hie0 (&lval2);
if (l == 0 && lval2.e_flags == E_MCONST) {
/* The array subscript is a constant - remove value from stack */
if (!ConstBaseAddr) {
RemoveCode (Mark2);
pop (CF_PTR);
} else {
/* Get an array pointer into the primary */
exprhs (CF_NONE, k, lval);
}
if (IsPtr (tptr1)) {
/* Scale the subscript value according to element size */
lval2.e_const *= PSizeOf (tptr1);
/* Remove code for lhs load */
RemoveCode (Mark1);
/* Handle constant base array on stack. Be sure NOT to
* handle pointers the same way, this won't work.
*/
if (IsArray (tptr1) &&
((lval->e_flags & ~E_MCTYPE) == E_MCONST ||
(lval->e_flags & ~E_MCTYPE) == E_MLOCAL ||
(lval->e_flags & E_MGLOBAL) != 0 ||
(lval->e_flags == E_MEOFFS))) {
lval->e_const += lval2.e_const;
} else {
/* Pointer - load into primary and remember offset */
if ((lval->e_flags & E_MEXPR) == 0 || k != 0) {
exprhs (CF_NONE, k, lval);
}
lval->e_const = lval2.e_const;
lval->e_flags = E_MEOFFS;
}
/* Result is of element type */
lval->e_tptr = Indirect (tptr1);
/* Done */
goto end_array;
} else if ((tptr2 = lval2.e_tptr) [0] & T_POINTER) {
/* Subscript is pointer, get element type */
lval2.e_tptr = Indirect (tptr2);
/* Scale the rhs value in the primary register */
g_scale (TypeOf (tptr1), SizeOf (lval2.e_tptr));
/* */
lval->e_tptr = lval2.e_tptr;
} else {
Error (ERR_CANNOT_SUBSCRIPT);
}
/* Add the subscript. Since arrays are indexed by integers,
* we will ignore the true type of the subscript here and
* use always an int.
*/
g_inc (CF_INT | CF_CONST, lval2.e_const);
} else {
/* Array subscript is not constant. Load it into the primary */
Mark2 = GetCodePos ();
exprhs (CF_NONE, l, &lval2);
tptr2 = lval2.e_tptr;
if (IsPtr (tptr1)) {
/* Get the element type */
lval->e_tptr = Indirect (tptr1);
/* Indexing is based on int's, so we will just use the integer
* portion of the index (which is in (e)ax, so there's no further
* action required).
*/
g_scale (CF_INT, SizeOf (lval->e_tptr));
} else if (IsPtr (tptr2)) {
/* Get the element type */
lval2.e_tptr = Indirect (tptr2);
/* Get the int value on top. If we go here, we're sure,
* both values are 16 bit (the first one was truncated
* if necessary and the second one is a pointer).
* Note: If ConstBaseAddr is true, we don't have a value on
* stack, so to "swap" both, just push the subscript.
*/
if (ConstBaseAddr) {
g_push (CF_INT, 0);
exprhs (CF_NONE, k, lval);
ConstBaseAddr = 0;
} else {
g_swap (CF_INT);
}
/* Scale it */
g_scale (TypeOf (tptr1), SizeOf (lval2.e_tptr));
lval->e_tptr = lval2.e_tptr;
} else {
Error (ERR_CANNOT_SUBSCRIPT);
}
/* The offset is now in the primary register. It didn't have a
* constant base address for the lhs, the lhs address is already
* on stack, and we must add the offset. If the base address was
* constant, we call special functions to add the address to the
* offset value.
*/
if (!ConstBaseAddr) {
/* Add the subscript. Both values are int sized. */
g_add (CF_INT, 0);
} else {
/* If the subscript has itself a constant address, it is often
* a better idea to reverse again the order of the evaluation.
* This will generate better code if the subscript is a byte
* sized variable. But beware: This is only possible if the
* subscript was not scaled, that is, if this was a byte array
* or pointer.
*/
rflags = lval2.e_flags & ~E_MCTYPE;
ConstSubAddr = (rflags == E_MCONST) || /* Constant numeric address */
(rflags & E_MGLOBAL) != 0 || /* Static array, or ... */
rflags == E_MLOCAL; /* Local array */
if (ConstSubAddr && SizeOf (lval->e_tptr) == 1) {
type* SavedType;
/* Reverse the order of evaluation */
unsigned flags = (SizeOf (lval2.e_tptr) == 1)? CF_CHAR : CF_INT;
RemoveCode (Mark2);
/* Get a pointer to the array into the primary. We have changed
* e_tptr above but we need the original type to load the
* address, so restore it temporarily.
*/
SavedType = lval->e_tptr;
lval->e_tptr = tptr1;
exprhs (CF_NONE, k, lval);
lval->e_tptr = SavedType;
/* Add the variable */
if (rflags == E_MLOCAL) {
g_addlocal (flags, lval2.e_const);
} else {
flags |= GlobalModeFlags (lval2.e_flags);
g_addstatic (flags, lval2.e_name, lval2.e_const);
}
} else {
if (lflags == E_MCONST) {
/* Constant numeric address. Just add it */
g_inc (CF_INT | CF_UNSIGNED, lval->e_const);
} else if (lflags == E_MLOCAL) {
/* Base address is a local variable address */
if (IsArray (tptr1)) {
g_addaddr_local (CF_INT, lval->e_const);
} else {
g_addlocal (CF_PTR, lval->e_const);
}
} else {
/* Base address is a static variable address */
unsigned flags = CF_INT;
flags |= GlobalModeFlags (lval->e_flags);
if (IsArray (tptr1)) {
g_addaddr_static (flags, lval->e_name, lval->e_const);
} else {
g_addstatic (flags, lval->e_name, lval->e_const);
}
}
}
}
}
lval->e_flags = E_MEXPR;
end_array:
ConsumeRBrack ();
return !IsArray (lval->e_tptr);
}
static int structref (int k, struct expent* lval)
/* Process struct field after . or ->. */
{
ident Ident;
SymEntry* Field;
int flags;
/* Skip the token and check for an identifier */
gettok ();
if (curtok != IDENT) {
Error (ERR_IDENT_EXPECTED);
lval->e_tptr = type_int;
return 0;
}
/* Get the symbol table entry and check for a struct field */
strcpy (Ident, CurTok.Ident);
gettok ();
Field = FindStructField (lval->e_tptr, Ident);
if (Field == 0) {
Error (ERR_STRUCT_FIELD_MISMATCH, Ident);
lval->e_tptr = type_int;
return 0;
}
/* If we have constant input data, the result is also constant */
flags = lval->e_flags & ~E_MCTYPE;
if (flags == E_MCONST ||
(k == 0 && (flags == E_MLOCAL ||
(flags & E_MGLOBAL) != 0 ||
lval->e_flags == E_MEOFFS))) {
lval->e_const += Field->V.Offs;
} else {
if ((flags & E_MEXPR) == 0 || k != 0) {
exprhs (CF_NONE, k, lval);
}
lval->e_const = Field->V.Offs;
lval->e_flags = E_MEOFFS;
}
lval->e_tptr = Field->Type;
return !IsArray (Field->Type);
}
static int hie11 (struct expent *lval)
/* Handle compound types (structs and arrays) */
{
int k;
type* tptr;
k = primary (lval);
if (curtok < LBRACK || curtok > PREF) {
/* Not for us */
return k;
}
while (1) {
if (curtok == LBRACK) {
/* Array reference */
k = arrayref (k, lval);
} else if (curtok == LPAREN) {
/* Function call. Skip the opening parenthesis */
gettok ();
tptr = lval->e_tptr;
if (IsFunc (tptr) || IsFuncPtr (tptr)) {
if (IsFuncPtr (tptr)) {
/* Pointer to function. Handle transparently */
exprhs (CF_NONE, k, lval); /* Function pointer to A/X */
++lval->e_tptr; /* Skip T_PTR */
lval->e_flags |= E_MEXPR;
}
callfunction (lval);
lval->e_flags = E_MEXPR;
lval->e_tptr += DECODE_SIZE + 1; /* Set to result */
} else {
Error (ERR_ILLEGAL_FUNC_CALL);
}
k = 0;
} else if (curtok == DOT) {
if (!IsStruct (lval->e_tptr)) {
Error (ERR_STRUCT_EXPECTED);
}
k = structref (0, lval);
} else if (curtok == PREF) {
tptr = lval->e_tptr;
if (tptr[0] != T_PTR || (tptr[1] & T_STRUCT) == 0) {
Error (ERR_STRUCT_PTR_EXPECTED);
}
k = structref (k, lval);
} else {
return k;
}
}
}
static void store (struct expent* lval)
/* Store primary reg into this reference */
{
int f;
unsigned flags;
f = lval->e_flags;
flags = TypeOf (lval->e_tptr);
if (f & E_MGLOBAL) {
flags |= GlobalModeFlags (f);
if (lval->e_test) {
/* Just testing */
flags |= CF_TEST;
}
/* Generate code */
g_putstatic (flags, lval->e_name, lval->e_const);
} else if (f & E_MLOCAL) {
g_putlocal (flags, lval->e_const);
} else if (f == E_MEOFFS) {
g_putind (flags, lval->e_const);
} else if (f != E_MREG) {
if (f & E_MEXPR) {
g_putind (flags, 0);
} else {
/* Store into absolute address */
g_putstatic (flags | CF_ABSOLUTE, lval->e_const, 0);
}
}
/* Assume that each one of the stores will invalidate CC */
lval->e_test &= ~E_CC;
}
static void pre_incdec (struct expent* lval, void (*inc) (unsigned, unsigned long))
/* Handle --i and ++i */
{
int k;
unsigned flags;
unsigned long val;
gettok ();
if ((k = hie10 (lval)) == 0) {
Error (ERR_LVALUE_EXPECTED);
return;
}
/* Get the data type */
flags = TypeOf (lval->e_tptr) | CF_FORCECHAR | CF_CONST;
/* Get the increment value in bytes */
val = (lval->e_tptr [0] == T_PTR)? PSizeOf (lval->e_tptr) : 1;
/* We're currently only able to handle some adressing modes */
if ((lval->e_flags & E_MGLOBAL) == 0 && /* Global address? */
(lval->e_flags & E_MLOCAL) == 0 && /* Local address? */
(lval->e_flags & E_MCONST) == 0 && /* Constant address? */
(lval->e_flags & E_MEXPR) == 0) { /* Address in a/x? */
/* Use generic code. Push the address if needed */
PushAddr (lval);
/* Fetch the value */
exprhs (CF_NONE, k, lval);
/* Increment value in primary */
inc (flags, val);
/* Store the result back */
store (lval);
} else {
/* Special code for some addressing modes - use the special += ops */
if (lval->e_flags & E_MGLOBAL) {
flags |= GlobalModeFlags (lval->e_flags);
if (inc == g_inc) {
g_addeqstatic (flags, lval->e_name, lval->e_const, val);
} else {
g_subeqstatic (flags, lval->e_name, lval->e_const, val);
}
} else if (lval->e_flags & E_MLOCAL) {
/* ref to localvar */
if (inc == g_inc) {
g_addeqlocal (flags, lval->e_const, val);
} else {
g_subeqlocal (flags, lval->e_const, val);
}
} else if (lval->e_flags & E_MCONST) {
/* ref to absolute address */
flags |= CF_ABSOLUTE;
if (inc == g_inc) {
g_addeqstatic (flags, lval->e_const, 0, val);
} else {
g_subeqstatic (flags, lval->e_const, 0, val);
}
} else if (lval->e_flags & E_MEXPR) {
/* Address in a/x. */
if (inc == g_inc) {
g_addeqind (flags, lval->e_const, val);
} else {
g_subeqind (flags, lval->e_const, val);
}
} else {
Internal ("Invalid addressing mode");
}
}
/* Result is an expression */
lval->e_flags = E_MEXPR;
}
static void post_incdec (struct expent *lval, int k, void (*inc) (unsigned, unsigned long))
/* Handle i-- and i++ */
{
unsigned flags;
gettok ();
if (k == 0) {
Error (ERR_LVALUE_EXPECTED);
return;
}
/* Get the data type */
flags = TypeOf (lval->e_tptr);
/* Push the address if needed */
PushAddr (lval);
/* Fetch the value and save it (since it's the result of the expression) */
exprhs (CF_NONE, 1, lval);
g_save (flags | CF_FORCECHAR);
/* If we have a pointer expression, increment by the size of the type */
if (lval->e_tptr[0] == T_PTR) {
inc (flags | CF_CONST | CF_FORCECHAR, SizeOf (lval->e_tptr + 1));
} else {
inc (flags | CF_CONST | CF_FORCECHAR, 1);
}
/* Store the result back */
store (lval);
/* Restore the original value */
g_restore (flags | CF_FORCECHAR);
lval->e_flags = E_MEXPR;
}
static void unaryop (int tok, struct expent* lval)
/* Handle unary -/+ and ~ */
{
int k;
unsigned flags;
gettok ();
k = hie10 (lval);
if (k == 0 && lval->e_flags & E_MCONST) {
/* Value is constant */
switch (tok) {
case MINUS: lval->e_const = -lval->e_const; break;
case PLUS: break;
case COMP: lval->e_const = ~lval->e_const; break;
default: Internal ("Unexpected token: %d", tok);
}
} else {
/* Value is not constant */
exprhs (CF_NONE, k, lval);
/* Get the type of the expression */
flags = TypeOf (lval->e_tptr);
/* Handle the operation */
switch (tok) {
case MINUS: g_neg (flags); break;
case PLUS: break;
case COMP: g_com (flags); break;
default: Internal ("Unexpected token: %d", tok);
}
lval->e_flags = E_MEXPR;
}
}
static int typecast (struct expent* lval)
/* Handle an explicit cast */
{
int k;
type Type[MAXTYPELEN];
unsigned rflags;
/* Skip the left paren */
gettok ();
/* Read the type */
ParseType (Type);
/* Closing paren */
ConsumeRParen ();
/* Read the expression we have to cast */
k = hie10 (lval);
/* Get the type of the expression and honor constant values */
rflags = TypeOf (lval->e_tptr);
if (lval->e_flags & E_MCONST) {
rflags |= CF_CONST;
}
/* Do the actual cast. Special handling for void casts */
if (!IsVoid (Type)) {
/* Mark the lhs as const to avoid a manipulation of TOS */
g_typecast (TypeOf (Type) | CF_CONST, rflags);
}
/* Use the new type */
lval->e_tptr = TypeDup (Type);
/* Done */
return k;
}
static int hie10 (struct expent* lval)
/* Handle ++, --, !, unary - etc. */
{
int k;
type* t;
switch (curtok) {
case INC:
pre_incdec (lval, g_inc);
return 0;
case DEC:
pre_incdec (lval, g_dec);
return 0;
case PLUS:
case MINUS:
case COMP:
unaryop (curtok, lval);
return 0;
case BANG:
gettok ();
if (evalexpr (CF_NONE, hie10, lval) == 0) {
/* Constant expression */
lval->e_const = !lval->e_const;
} else {
g_bneg (TypeOf (lval->e_tptr));
lval->e_test |= E_CC; /* bneg will set cc */
lval->e_flags = E_MEXPR; /* say it's an expr */
}
return 0; /* expr not storable */
case STAR:
gettok ();
if (evalexpr (CF_NONE, hie10, lval) != 0) {
/* Expression is not const, indirect value loaded into primary */
lval->e_flags = E_MEXPR;
lval->e_const = 0; /* Offset is zero now */
}
t = lval->e_tptr;
if (IsPtr (t)) {
lval->e_tptr = Indirect (t);
} else {
Error (ERR_ILLEGAL_INDIRECT);
}
return 1;
case AMP:
gettok ();
k = hie10 (lval);
if (k == 0) {
/* Allow the & operator with an array */
if (!IsArray (lval->e_tptr)) {
Error (ERR_ILLEGAL_ADDRESS);
}
} else {
t = TypeAlloc (TypeLen (lval->e_tptr) + 2);
t [0] = T_PTR;
TypeCpy (t + 1, lval->e_tptr);
lval->e_tptr = t;
}
return 0;
case SIZEOF:
gettok ();
if (istypeexpr ()) {
type Type[MAXTYPELEN];
gettok ();
lval->e_const = SizeOf (ParseType (Type));
ConsumeRParen ();
} else {
/* Remember the output queue pointer */
CodeMark Mark = GetCodePos ();
hie10 (lval);
lval->e_const = SizeOf (lval->e_tptr);
/* Remove any generated code */
RemoveCode (Mark);
}
lval->e_flags = E_MCONST | E_TCONST;
lval->e_tptr = type_uint;
lval->e_test &= ~E_CC;
return 0;
default:
if (istypeexpr ()) {
/* A cast */
return typecast (lval);
}
}
k = hie11 (lval);
switch (curtok) {
case INC:
post_incdec (lval, k, g_inc);
return 0;
case DEC:
post_incdec (lval, k, g_dec);
return 0;
default:
return k;
}
}
static int hie_internal (GenDesc** ops, /* List of generators */
struct expent* lval, /* parent expr's lval */
int (*hienext) (struct expent*),
int* UsedGen) /* next higher level */
/* Helper function */
{
int k;
struct expent lval2;
CodeMark Mark1;
CodeMark Mark2;
GenDesc* Gen;
int tok; /* The operator token */
unsigned ltype, type;
int rconst; /* Operand is a constant */
k = hienext (lval);
*UsedGen = 0;
while ((Gen = FindGen (curtok, ops)) != 0) {
/* Tell the caller that we handled it's ops */
*UsedGen = 1;
/* All operators that call this function expect an int on the lhs */
if (!IsInt (lval->e_tptr)) {
Error (ERR_INT_EXPR_EXPECTED);
}
/* Remember the operator token, then skip it */
tok = curtok;
gettok ();
/* Get the lhs on stack */
Mark1 = GetCodePos ();
ltype = TypeOf (lval->e_tptr);
if (k == 0 && lval->e_flags == E_MCONST) {
/* Constant value */
Mark2 = GetCodePos ();
g_push (ltype | CF_CONST, lval->e_const);
} else {
/* Value not constant */
exprhs (CF_NONE, k, lval);
Mark2 = GetCodePos ();
g_push (ltype, 0);
}
/* Get the right hand side */
rconst = (evalexpr (CF_NONE, hienext, &lval2) == 0);
/* Check the type of the rhs */
if (!IsInt (lval2.e_tptr)) {
Error (ERR_INT_EXPR_EXPECTED);
}
/* Check for const operands */
if (k == 0 && lval->e_flags == E_MCONST && rconst) {
/* Both operands are constant, remove the generated code */
RemoveCode (Mark1);
pop (ltype);
/* Evaluate the result */
lval->e_const = kcalc (tok, lval->e_const, lval2.e_const);
/* Get the type of the result */
lval->e_tptr = promoteint (lval->e_tptr, lval2.e_tptr);
} else {
/* If the right hand side is constant, and the generator function
* expects the lhs in the primary, remove the push of the primary
* now.
*/
unsigned rtype = TypeOf (lval2.e_tptr);
type = 0;
if (rconst) {
/* Second value is constant - check for div */
type |= CF_CONST;
rtype |= CF_CONST;
if (tok == DIV && lval2.e_const == 0) {
Error (ERR_DIV_BY_ZERO);
} else if (tok == MOD && lval2.e_const == 0) {
Error (ERR_MOD_BY_ZERO);
}
if ((Gen->Flags & GEN_NOPUSH) != 0) {
RemoveCode (Mark2);
pop (ltype);
ltype |= CF_REG; /* Value is in register */
}
}
/* Determine the type of the operation result. */
type |= g_typeadjust (ltype, rtype);
lval->e_tptr = promoteint (lval->e_tptr, lval2.e_tptr);
/* Generate code */
Gen->Func (type, lval2.e_const);
lval->e_flags = E_MEXPR;
}
/* We have a rvalue now */
k = 0;
}
return k;
}
static int hie_compare (GenDesc** ops, /* List of generators */
struct expent* lval, /* parent expr's lval */
int (*hienext) (struct expent*))
/* Helper function for the compare operators */
{
int k;
struct expent lval2;
CodeMark Mark1;
CodeMark Mark2;
GenDesc* Gen;
int tok; /* The operator token */
unsigned ltype;
int rconst; /* Operand is a constant */
k = hienext (lval);
while ((Gen = FindGen (curtok, ops)) != 0) {
/* Remember the operator token, then skip it */
tok = curtok;
gettok ();
/* Get the lhs on stack */
Mark1 = GetCodePos ();
ltype = TypeOf (lval->e_tptr);
if (k == 0 && lval->e_flags == E_MCONST) {
/* Constant value */
Mark2 = GetCodePos ();
g_push (ltype | CF_CONST, lval->e_const);
} else {
/* Value not constant */
exprhs (CF_NONE, k, lval);
Mark2 = GetCodePos ();
g_push (ltype, 0);
}
/* Get the right hand side */
rconst = (evalexpr (CF_NONE, hienext, &lval2) == 0);
/* Make sure, the types are compatible */
if (IsInt (lval->e_tptr)) {
if (!IsInt (lval2.e_tptr) && !(IsPtr(lval2.e_tptr) && IsNullPtr(lval))) {
Error (ERR_INCOMPATIBLE_TYPES);
}
} else if (IsPtr (lval->e_tptr)) {
if (IsPtr (lval2.e_tptr)) {
/* Both pointers are allowed in comparison if they point to
* the same type, or if one of them is a void pointer.
*/
type* left = Indirect (lval->e_tptr);
type* right = Indirect (lval2.e_tptr);
if (!EqualTypes (left, right) && *left != T_VOID && *right != T_VOID) {
/* Incomatible pointers */
Error (ERR_INCOMPATIBLE_TYPES);
}
} else if (!IsNullPtr (&lval2)) {
Error (ERR_INCOMPATIBLE_TYPES);
}
}
/* Check for const operands */
if (k == 0 && lval->e_flags == E_MCONST && rconst) {
/* Both operands are constant, remove the generated code */
RemoveCode (Mark1);
pop (ltype);
/* Evaluate the result */
lval->e_const = kcalc (tok, lval->e_const, lval2.e_const);
} else {
/* If the right hand side is constant, and the generator function
* expects the lhs in the primary, remove the push of the primary
* now.
*/
unsigned flags = 0;
if (rconst) {
flags |= CF_CONST;
if ((Gen->Flags & GEN_NOPUSH) != 0) {
RemoveCode (Mark2);
pop (ltype);
ltype |= CF_REG; /* Value is in register */
}
}
/* Determine the type of the operation result. If the left
* operand is of type char and the right is a constant, or
* if both operands are of type char, we will encode the
* operation as char operation. Otherwise the default
* promotions are used.
*/
if (IsChar (lval->e_tptr) && (IsChar (lval2.e_tptr) || rconst)) {
flags |= CF_CHAR;
if (IsUnsigned (lval->e_tptr) || IsUnsigned (lval2.e_tptr)) {
flags |= CF_UNSIGNED;
}
if (rconst) {
flags |= CF_FORCECHAR;
}
} else {
unsigned rtype = TypeOf (lval2.e_tptr) | (flags & CF_CONST);
flags |= g_typeadjust (ltype, rtype);
}
/* Generate code */
Gen->Func (flags, lval2.e_const);
lval->e_flags = E_MEXPR;
}
/* Result type is always int */
lval->e_tptr = type_int;
/* We have a rvalue now, condition codes are set */
k = 0;
lval->e_test |= E_CC;
}
return k;
}
static int hie9 (struct expent *lval)
/* Process * and / operators. */
{
static GenDesc* hie9_ops [] = {
&GenMUL, &GenDIV, &GenMOD, 0
};
int UsedGen;
return hie_internal (hie9_ops, lval, hie10, &UsedGen);
}
static void parseadd (int k, struct expent* lval)
/* Parse an expression with the binary plus operator. lval contains the
* unprocessed left hand side of the expression and will contain the
* result of the expression on return.
*/
{
struct expent lval2;
unsigned flags; /* Operation flags */
CodeMark Mark; /* Remember code position */
type* lhst; /* Type of left hand side */
type* rhst; /* Type of right hand side */
/* Skip the PLUS token */
gettok ();
/* Get the left hand side type, initialize operation flags */
lhst = lval->e_tptr;
flags = 0;
/* Check for constness on both sides */
if (k == 0 && lval->e_flags == E_MCONST) {
/* The left hand side is a constant. Good. Get rhs */
if (evalexpr (CF_NONE, hie9, &lval2) == 0) {
/* Right hand side is also constant. Get the rhs type */
rhst = lval2.e_tptr;
/* Both expressions are constants. Check for pointer arithmetic */
if (IsPtr (lhst) && IsInt (rhst)) {
/* Left is pointer, right is int, must scale rhs */
lval->e_const = lval->e_const + lval2.e_const * PSizeOf (lhst);
/* Result type is a pointer */
} else if (IsInt (lhst) && IsPtr (rhst)) {
/* Left is int, right is pointer, must scale lhs */
lval->e_const = lval->e_const * PSizeOf (rhst) + lval2.e_const;
/* Result type is a pointer */
lval->e_tptr = lval2.e_tptr;
} else if (IsInt (lhst) && IsInt (rhst)) {
/* Integer addition */
lval->e_const += lval2.e_const;
typeadjust (lval, &lval2, 1);
} else {
/* OOPS */
Error (ERR_OP_NOT_ALLOWED);
}
/* Result is constant, condition codes not set */
lval->e_test = E_MCONST;
} else {
/* lhs is constant, rhs is not. Get the rhs type. */
rhst = lval2.e_tptr;
/* Check for pointer arithmetic */
if (IsPtr (lhst) && IsInt (rhst)) {
/* Left is pointer, right is int, must scale rhs */
g_scale (CF_INT, PSizeOf (lhst));
/* Operate on pointers, result type is a pointer */
flags = CF_PTR;
} else if (IsInt (lhst) && IsPtr (rhst)) {
/* Left is int, right is pointer, must scale lhs */
lval->e_const *= PSizeOf (rhst);
/* Operate on pointers, result type is a pointer */
flags = CF_PTR;
lval->e_tptr = lval2.e_tptr;
} else if (IsInt (lhst) && IsInt (rhst)) {
/* Integer addition */
flags = typeadjust (lval, &lval2, 1);
} else {
/* OOPS */
Error (ERR_OP_NOT_ALLOWED);
}
/* Generate code for the add */
g_inc (flags | CF_CONST, lval->e_const);
/* Result is in primary register */
lval->e_flags = E_MEXPR;
lval->e_test &= ~E_CC;
}
} else {
/* Left hand side is not constant. Get the value onto the stack. */
exprhs (CF_NONE, k, lval); /* --> primary register */
Mark = GetCodePos ();
g_push (TypeOf (lval->e_tptr), 0); /* --> stack */
/* Evaluate the rhs */
if (evalexpr (CF_NONE, hie9, &lval2) == 0) {
/* Right hand side is a constant. Get the rhs type */
rhst = lval2.e_tptr;
/* Remove pushed value from stack */
RemoveCode (Mark);
pop (TypeOf (lval->e_tptr));
/* Check for pointer arithmetic */
if (IsPtr (lhst) && IsInt (rhst)) {
/* Left is pointer, right is int, must scale rhs */
lval2.e_const *= PSizeOf (lhst);
/* Operate on pointers, result type is a pointer */
flags = CF_PTR;
} else if (IsInt (lhst) && IsPtr (rhst)) {
/* Left is int, right is pointer, must scale lhs (ptr only) */
g_scale (CF_INT | CF_CONST, PSizeOf (rhst));
/* Operate on pointers, result type is a pointer */
flags = CF_PTR;
lval->e_tptr = lval2.e_tptr;
} else if (IsInt (lhst) && IsInt (rhst)) {
/* Integer addition */
flags = typeadjust (lval, &lval2, 1);
} else {
/* OOPS */
Error (ERR_OP_NOT_ALLOWED);
}
/* Generate code for the add */
g_inc (flags | CF_CONST, lval2.e_const);
/* Result is in primary register */
lval->e_flags = E_MEXPR;
lval->e_test &= ~E_CC;
} else {
/* lhs and rhs are not constant. Get the rhs type. */
rhst = lval2.e_tptr;
/* Check for pointer arithmetic */
if (IsPtr (lhst) && IsInt (rhst)) {
/* Left is pointer, right is int, must scale rhs */
g_scale (CF_INT, PSizeOf (lhst));
/* Operate on pointers, result type is a pointer */
flags = CF_PTR;
} else if (IsInt (lhst) && IsPtr (rhst)) {
/* Left is int, right is pointer, must scale lhs */
g_tosint (TypeOf (rhst)); /* Make sure, TOS is int */
g_swap (CF_INT); /* Swap TOS and primary */
g_scale (CF_INT, PSizeOf (rhst));
/* Operate on pointers, result type is a pointer */
flags = CF_PTR;
lval->e_tptr = lval2.e_tptr;
} else if (IsInt (lhst) && IsInt (rhst)) {
/* Integer addition */
flags = typeadjust (lval, &lval2, 0);
} else {
/* OOPS */
Error (ERR_OP_NOT_ALLOWED);
}
/* Generate code for the add */
g_add (flags, 0);
/* Result is in primary register */
lval->e_flags = E_MEXPR;
lval->e_test &= ~E_CC;
}
}
}
static void parsesub (int k, struct expent* lval)
/* Parse an expression with the binary minus operator. lval contains the
* unprocessed left hand side of the expression and will contain the
* result of the expression on return.
*/
{
struct expent lval2;
unsigned flags; /* Operation flags */
type* lhst; /* Type of left hand side */
type* rhst; /* Type of right hand side */
CodeMark Mark1; /* Save position of output queue */
CodeMark Mark2; /* Another position in the queue */
int rscale; /* Scale factor for the result */
/* Skip the MINUS token */
gettok ();
/* Get the left hand side type, initialize operation flags */
lhst = lval->e_tptr;
flags = 0;
rscale = 1; /* Scale by 1, that is, don't scale */
/* Remember the output queue position, then bring the value onto the stack */
Mark1 = GetCodePos ();
exprhs (CF_NONE, k, lval); /* --> primary register */
Mark2 = GetCodePos ();
g_push (TypeOf (lhst), 0); /* --> stack */
/* Parse the right hand side */
if (evalexpr (CF_NONE, hie9, &lval2) == 0) {
/* The right hand side is constant. Get the rhs type. */
rhst = lval2.e_tptr;
/* Check left hand side */
if (k == 0 && lval->e_flags & E_MCONST) {
/* Both sides are constant, remove generated code */
RemoveCode (Mark1);
pop (TypeOf (lhst)); /* Clean up the stack */
/* Check for pointer arithmetic */
if (IsPtr (lhst) && IsInt (rhst)) {
/* Left is pointer, right is int, must scale rhs */
lval->e_const -= lval2.e_const * PSizeOf (lhst);
/* Operate on pointers, result type is a pointer */
} else if (IsPtr (lhst) && IsPtr (rhst)) {
/* Left is pointer, right is pointer, must scale result */
if (TypeCmp (Indirect (lhst), Indirect (rhst)) != 0) {
Error (ERR_INCOMPATIBLE_POINTERS);
} else {
lval->e_const = (lval->e_const - lval2.e_const) / PSizeOf (lhst);
}
/* Operate on pointers, result type is an integer */
lval->e_tptr = type_int;
} else if (IsInt (lhst) && IsInt (rhst)) {
/* Integer subtraction */
typeadjust (lval, &lval2, 1);
lval->e_const -= lval2.e_const;
} else {
/* OOPS */
Error (ERR_OP_NOT_ALLOWED);
}
/* Result is constant, condition codes not set */
lval->e_flags = E_MCONST;
lval->e_test &= ~E_CC;
} else {
/* Left hand side is not constant, right hand side is.
* Remove pushed value from stack.
*/
RemoveCode (Mark2);
pop (TypeOf (lhst));
if (IsPtr (lhst) && IsInt (rhst)) {
/* Left is pointer, right is int, must scale rhs */
lval2.e_const *= PSizeOf (lhst);
/* Operate on pointers, result type is a pointer */
flags = CF_PTR;
} else if (IsPtr (lhst) && IsPtr (rhst)) {
/* Left is pointer, right is pointer, must scale result */
if (TypeCmp (Indirect (lhst), Indirect (rhst)) != 0) {
Error (ERR_INCOMPATIBLE_POINTERS);
} else {
rscale = PSizeOf (lhst);
}
/* Operate on pointers, result type is an integer */
flags = CF_PTR;
lval->e_tptr = type_int;
} else if (IsInt (lhst) && IsInt (rhst)) {
/* Integer subtraction */
flags = typeadjust (lval, &lval2, 1);
} else {
/* OOPS */
Error (ERR_OP_NOT_ALLOWED);
}
/* Do the subtraction */
g_dec (flags | CF_CONST, lval2.e_const);
/* If this was a pointer subtraction, we must scale the result */
if (rscale != 1) {
g_scale (flags, -rscale);
}
/* Result is in primary register */
lval->e_flags = E_MEXPR;
lval->e_test &= ~E_CC;
}
} else {
/* Right hand side is not constant. Get the rhs type. */
rhst = lval2.e_tptr;
/* Check for pointer arithmetic */
if (IsPtr (lhst) && IsInt (rhst)) {
/* Left is pointer, right is int, must scale rhs */
g_scale (CF_INT, PSizeOf (lhst));
/* Operate on pointers, result type is a pointer */
flags = CF_PTR;
} else if (IsPtr (lhst) && IsPtr (rhst)) {
/* Left is pointer, right is pointer, must scale result */
if (TypeCmp (Indirect (lhst), Indirect (rhst)) != 0) {
Error (ERR_INCOMPATIBLE_POINTERS);
} else {
rscale = PSizeOf (lhst);
}
/* Operate on pointers, result type is an integer */
flags = CF_PTR;
lval->e_tptr = type_int;
} else if (IsInt (lhst) && IsInt (rhst)) {
/* Integer subtraction. If the left hand side descriptor says that
* the lhs is const, we have to remove this mark, since this is no
* longer true, lhs is on stack instead.
*/
if (lval->e_flags == E_MCONST) {
lval->e_flags = E_MEXPR;
}
/* Adjust operand types */
flags = typeadjust (lval, &lval2, 0);
} else {
/* OOPS */
Error (ERR_OP_NOT_ALLOWED);
}
/* Generate code for the sub (the & is a hack here) */
g_sub (flags & ~CF_CONST, 0);
/* If this was a pointer subtraction, we must scale the result */
if (rscale != 1) {
g_scale (flags, -rscale);
}
/* Result is in primary register */
lval->e_flags = E_MEXPR;
lval->e_test &= ~E_CC;
}
}
static int hie8 (struct expent* lval)
/* Process + and - binary operators. */
{
int k = hie9 (lval);
while (curtok == PLUS || curtok == MINUS) {
if (curtok == PLUS) {
parseadd (k, lval);
} else {
parsesub (k, lval);
}
k = 0;
}
return k;
}
static int hie7 (struct expent *lval)
/* Parse << and >>. */
{
static GenDesc* hie7_ops [] = {
&GenASL, &GenASR, 0
};
int UsedGen;
return hie_internal (hie7_ops, lval, hie8, &UsedGen);
}
static int hie6 (struct expent *lval)
/* process greater-than type comparators */
{
static GenDesc* hie6_ops [] = {
&GenLT, &GenLE, &GenGE, &GenGT, 0
};
return hie_compare (hie6_ops, lval, hie7);
}
static int hie5 (struct expent *lval)
{
static GenDesc* hie5_ops[] = {
&GenEQ, &GenNE, 0
};
return hie_compare (hie5_ops, lval, hie6);
}
static int hie4 (struct expent* lval)
/* Handle & (bitwise and) */
{
static GenDesc* hie4_ops [] = {
&GenAND, 0
};
int UsedGen;
return hie_internal (hie4_ops, lval, hie5, &UsedGen);
}
static int hie3 (struct expent *lval)
/* Handle ^ (bitwise exclusive or) */
{
static GenDesc* hie3_ops [] = {
&GenXOR, 0
};
int UsedGen;
return hie_internal (hie3_ops, lval, hie4, &UsedGen);
}
static int hie2 (struct expent *lval)
/* Handle | (bitwise or) */
{
static GenDesc* hie2_ops [] = {
&GenOR, 0
};
int UsedGen;
return hie_internal (hie2_ops, lval, hie3, &UsedGen);
}
static int hieAnd (struct expent* lval, unsigned TrueLab, int* BoolOp)
/* Process "exp && exp" */
{
int k;
int lab;
struct expent lval2;
k = hie2 (lval);
if (curtok == DAMP) {
/* Tell our caller that we're evaluating a boolean */
*BoolOp = 1;
/* Get a label that we will use for false expressions */
lab = GetLabel ();
/* If the expr hasn't set condition codes, set the force-test flag */
if ((lval->e_test & E_CC) == 0) {
lval->e_test |= E_FORCETEST;
}
/* Load the value */
exprhs (CF_FORCECHAR, k, lval);
/* Generate the jump */
g_falsejump (CF_NONE, lab);
/* Parse more boolean and's */
while (curtok == DAMP) {
/* Skip the && */
gettok ();
/* Get rhs */
k = hie2 (&lval2);
if ((lval2.e_test & E_CC) == 0) {
lval2.e_test |= E_FORCETEST;
}
exprhs (CF_FORCECHAR, k, &lval2);
/* Do short circuit evaluation */
if (curtok == DAMP) {
g_falsejump (CF_NONE, lab);
} else {
/* Last expression - will evaluate to true */
g_truejump (CF_NONE, TrueLab);
}
}
/* Define the false jump label here */
g_defloclabel (lab);
/* Define the label */
lval->e_flags = E_MEXPR;
lval->e_test |= E_CC; /* Condition codes are set */
k = 0;
}
return k;
}
static int hieOr (struct expent *lval)
/* Process "exp || exp". */
{
int k;
struct expent lval2;
int BoolOp = 0; /* Did we have a boolean op? */
int AndOp; /* Did we have a && operation? */
unsigned TrueLab; /* Jump to this label if true */
unsigned DoneLab;
/* Get a label */
TrueLab = GetLabel ();
/* Call the next level parser */
k = hieAnd (lval, TrueLab, &BoolOp);
/* Any boolean or's? */
if (curtok == DBAR) {
/* If the expr hasn't set condition codes, set the force-test flag */
if ((lval->e_test & E_CC) == 0) {
lval->e_test |= E_FORCETEST;
}
/* Get first expr */
exprhs (CF_FORCECHAR, k, lval);
/* For each expression jump to TrueLab if true. Beware: If we
* had && operators, the jump is already in place!
*/
if (!BoolOp) {
g_truejump (CF_NONE, TrueLab);
}
/* Remember that we had a boolean op */
BoolOp = 1;
/* while there's more expr */
while (curtok == DBAR) {
/* skip the || */
gettok ();
/* Get a subexpr */
AndOp = 0;
k = hieAnd (&lval2, TrueLab, &AndOp);
if ((lval2.e_test & E_CC) == 0) {
lval2.e_test |= E_FORCETEST;
}
exprhs (CF_FORCECHAR, k, &lval2);
/* If there is more to come, add shortcut boolean eval.
* Beware: If we had && operators, the jump is already
* in place!
*/
#if 0
/* Seems this sometimes generates wrong code */
if (curtok == DBAR && !AndOp) {
g_truejump (CF_NONE, TrueLab);
}
#else
g_truejump (CF_NONE, TrueLab);
#endif
}
lval->e_flags = E_MEXPR;
lval->e_test |= E_CC; /* Condition codes are set */
k = 0;
}
/* If we really had boolean ops, generate the end sequence */
if (BoolOp) {
DoneLab = GetLabel ();
g_getimmed (CF_INT | CF_CONST, 0, 0); /* Load FALSE */
g_falsejump (CF_NONE, DoneLab);
g_defloclabel (TrueLab);
g_getimmed (CF_INT | CF_CONST, 1, 0); /* Load TRUE */
g_defloclabel (DoneLab);
}
return k;
}
static int hieQuest (struct expent *lval)
/* Parse "lvalue ? exp : exp" */
{
int k;
int labf;
int labt;
struct expent lval2; /* Expression 2 */
struct expent lval3; /* Expression 3 */
type* type2; /* Type of expression 2 */
type* type3; /* Type of expression 3 */
type* rtype; /* Type of result */
CodeMark Mark1; /* Save position in output code */
CodeMark Mark2; /* Save position in output code */
k = hieOr (lval);
if (curtok == QUEST) {
gettok ();
if ((lval->e_test & E_CC) == 0) {
/* Condition codes not set, force a test */
lval->e_test |= E_FORCETEST;
}
exprhs (CF_NONE, k, lval);
labf = GetLabel ();
g_falsejump (CF_NONE, labf);
/* Parse second and third expression */
expression1 (&lval2);
labt = GetLabel ();
ConsumeColon ();
g_jump (labt);
g_defloclabel (labf);
expression1 (&lval3);
/* Check if any conversions are needed, if so, do them.
* Conversion rules for ?: expression are:
* - if both expressions are int expressions, default promotion
* rules for ints apply.
* - if both expressions are pointers of the same type, the
* result of the expression is of this type.
* - if one of the expressions is a pointer and the other is
* a zero constant, the resulting type is that of the pointer
* type.
* - all other cases are flagged by an error.
*/
type2 = lval2.e_tptr;
type3 = lval3.e_tptr;
if (IsInt (type2) && IsInt (type3)) {
/* Get common type */
rtype = promoteint (type2, type3);
/* Convert the third expression to this type if needed */
g_typecast (TypeOf (rtype), TypeOf (type3));
/* Setup a new label so that the expr3 code will jump around
* the type cast code for expr2.
*/
labf = GetLabel (); /* Get new label */
Mark1 = GetCodePos (); /* Remember current position */
g_jump (labf); /* Jump around code */
/* The jump for expr2 goes here */
g_defloclabel (labt);
/* Create the typecast code for expr2 */
Mark2 = GetCodePos (); /* Remember position */
g_typecast (TypeOf (rtype), TypeOf (type2));
/* If the typecast did not produce code, remove the jump,
* otherwise output the label.
*/
if (GetCodePos() == Mark2) {
RemoveCode (Mark1); /* Remove code */
} else {
/* We have typecast code, output label */
g_defloclabel (labf);
labt = 0; /* Mark other label as invalid */
}
} else if (IsPtr (type2) && IsPtr (type3)) {
/* Must point to same type */
if (TypeCmp (Indirect (type2), Indirect (type3)) != 0) {
Error (ERR_INCOMPATIBLE_TYPES);
}
/* Result has the common type */
rtype = lval2.e_tptr;
} else if (IsPtr (type2) && IsNullPtr (&lval3)) {
/* Result type is pointer, no cast needed */
rtype = lval2.e_tptr;
} else if (IsNullPtr (&lval2) && IsPtr (type3)) {
/* Result type is pointer, no cast needed */
rtype = lval3.e_tptr;
} else {
Error (ERR_INCOMPATIBLE_TYPES);
rtype = lval2.e_tptr; /* Doesn't matter here */
}
/* If we don't have the label defined until now, do it */
if (labt) {
g_defloclabel (labt);
}
/* Setup the target expression */
lval->e_flags = E_MEXPR;
lval->e_tptr = rtype;
k = 0;
}
return k;
}
static void opeq (GenDesc* Gen, struct expent *lval, int k)
/* Process "op=" operators. */
{
struct expent lval2;
unsigned flags;
CodeMark Mark;
int MustScale;
gettok ();
if (k == 0) {
Error (ERR_LVALUE_EXPECTED);
return;
}
/* Determine the type of the lhs */
flags = TypeOf (lval->e_tptr);
MustScale = (Gen->Func == g_add || Gen->Func == g_sub) &&
lval->e_tptr [0] == T_PTR;
/* Get the lhs address on stack (if needed) */
PushAddr (lval);
/* Fetch the lhs into the primary register if needed */
exprhs (CF_NONE, k, lval);
/* Bring the lhs on stack */
Mark = GetCodePos ();
g_push (flags, 0);
/* Evaluate the rhs */
if (evalexpr (CF_NONE, hie1, &lval2) == 0) {
/* The resulting value is a constant. If the generator has the NOPUSH
* flag set, don't push the lhs.
*/
if (Gen->Flags & GEN_NOPUSH) {
RemoveCode (Mark);
pop (flags);
}
if (MustScale) {
/* lhs is a pointer, scale rhs */
lval2.e_const *= SizeOf (lval->e_tptr+1);
}
/* If the lhs is character sized, the operation may be later done
* with characters.
*/
if (SizeOf (lval->e_tptr) == 1) {
flags |= CF_FORCECHAR;
}
/* Special handling for add and sub - some sort of a hack, but short code */
if (Gen->Func == g_add) {
g_inc (flags | CF_CONST, lval2.e_const);
} else if (Gen->Func == g_sub) {
g_dec (flags | CF_CONST, lval2.e_const);
} else {
Gen->Func (flags | CF_CONST, lval2.e_const);
}
} else {
/* rhs is not constant and already in the primary register */
if (MustScale) {
/* lhs is a pointer, scale rhs */
g_scale (TypeOf (lval2.e_tptr), SizeOf (lval->e_tptr+1));
}
/* If the lhs is character sized, the operation may be later done
* with characters.
*/
if (SizeOf (lval->e_tptr) == 1) {
flags |= CF_FORCECHAR;
}
/* Adjust the types of the operands if needed */
Gen->Func (g_typeadjust (flags, TypeOf (lval2.e_tptr)), 0);
}
store (lval);
lval->e_flags = E_MEXPR;
}
static void addsubeq (GenDesc* Gen, struct expent *lval, int k)
/* Process the += and -= operators */
{
struct expent lval2;
unsigned flags;
int MustScale;
if (k == 0) {
Error (ERR_LVALUE_EXPECTED);
return;
}
/* We're currently only able to handle some adressing modes */
if ((lval->e_flags & E_MGLOBAL) == 0 && /* Global address? */
(lval->e_flags & E_MLOCAL) == 0 && /* Local address? */
(lval->e_flags & E_MCONST) == 0) { /* Constant address? */
/* Use generic routine */
opeq (Gen, lval, k);
return;
}
/* Skip the operator */
gettok ();
/* Check if we have a pointer expression and must scale rhs */
MustScale = (lval->e_tptr [0] == T_PTR);
/* Determine the code generator flags */
flags = TypeOf (lval->e_tptr) | CF_FORCECHAR;
/* Evaluate the rhs */
if (evalexpr (CF_NONE, hie1, &lval2) == 0) {
/* The resulting value is a constant. */
if (MustScale) {
/* lhs is a pointer, scale rhs */
lval2.e_const *= SizeOf (lval->e_tptr+1);
}
flags |= CF_CONST;
} else {
/* rhs is not constant and already in the primary register */
if (MustScale) {
/* lhs is a pointer, scale rhs */
g_scale (TypeOf (lval2.e_tptr), SizeOf (lval->e_tptr+1));
}
}
/* Adjust the rhs to the lhs */
g_typeadjust (flags, TypeOf (lval2.e_tptr));
/* Output apropriate code */
if (lval->e_flags & E_MGLOBAL) {
/* Static variable */
flags |= GlobalModeFlags (lval->e_flags);
if (Gen->Tok == PASGN) {
g_addeqstatic (flags, lval->e_name, lval->e_const, lval2.e_const);
} else {
g_subeqstatic (flags, lval->e_name, lval->e_const, lval2.e_const);
}
} else if (lval->e_flags & E_MLOCAL) {
/* ref to localvar */
if (Gen->Tok == PASGN) {
g_addeqlocal (flags, lval->e_const, lval2.e_const);
} else {
g_subeqlocal (flags, lval->e_const, lval2.e_const);
}
} else if (lval->e_flags & E_MCONST) {
/* ref to absolute address */
flags |= CF_ABSOLUTE;
if (Gen->Tok == PASGN) {
g_addeqstatic (flags, lval->e_const, 0, lval2.e_const);
} else {
g_subeqstatic (flags, lval->e_const, 0, lval2.e_const);
}
} else if (lval->e_flags & E_MEXPR) {
/* Address in a/x. */
if (Gen->Tok == PASGN) {
g_addeqind (flags, lval->e_const, lval2.e_const);
} else {
g_subeqind (flags, lval->e_const, lval2.e_const);
}
} else {
Internal ("Invalid addressing mode");
}
/* Expression is in the primary now */
lval->e_flags = E_MEXPR;
}
static void Assignment (struct expent* lval)
/* Parse an assignment */
{
int k;
struct expent lval2;
unsigned flags;
type* ltype = lval->e_tptr;
/* cc65 does not have full support for handling structs by value. Since
* assigning structs is one of the more useful operations from this
* familiy, allow it here.
*/
if (IsStruct (ltype)) {
/* Bring the address of the lhs into the primary and push it */
exprhs (0, 0, lval);
g_push (CF_PTR | CF_UNSIGNED, 0);
/* Get the expression on the right of the '=' into the primary */
k = hie1 (&lval2);
if (k) {
/* Get the address */
exprhs (0, 0, &lval2);
} else {
/* We need an lvalue */
Error (ERR_LVALUE_EXPECTED);
}
/* Push the address (or whatever is in ax in case of errors) */
g_push (CF_PTR | CF_UNSIGNED, 0);
/* Check for equality of the structs */
if (!EqualTypes (ltype, lval2.e_tptr)) {
Error (ERR_INCOMPATIBLE_TYPES);
}
/* Load the size of the struct into the primary */
g_getimmed (CF_INT | CF_UNSIGNED | CF_CONST, SizeOf (ltype), 0);
/* Call the memcpy function */
g_call (CF_FIXARGC, "memcpy", 4);
} else {
/* Get the address on stack if needed */
PushAddr (lval);
/* No struct, setup flags for the load */
flags = SizeOf (ltype) == 1? CF_FORCECHAR : CF_NONE;
/* Get the expression on the right of the '=' into the primary */
if (evalexpr (flags, hie1, &lval2) == 0) {
/* Constant expression. Adjust the types */
assignadjust (ltype, &lval2);
/* Put the value into the primary register */
lconst (flags, &lval2);
} else {
/* Expression is not constant and already in the primary */
assignadjust (ltype, &lval2);
}
/* Generate a store instruction */
store (lval);
}
/* Value is still in primary */
lval->e_flags = E_MEXPR;
}
int hie1 (struct expent* lval)
/* Parse first level of expression hierarchy. */
{
int k;
k = hieQuest (lval);
switch (curtok) {
case RPAREN:
case SEMI:
return k;
case ASGN:
gettok ();
if (k == 0) {
Error (ERR_LVALUE_EXPECTED);
} else {
Assignment (lval);
}
break;
case PASGN:
addsubeq (&GenPASGN, lval, k);
break;
case SASGN:
addsubeq (&GenSASGN, lval, k);
break;
case MASGN:
opeq (&GenMASGN, lval, k);
break;
case DASGN:
opeq (&GenDASGN, lval, k);
break;
case MOASGN:
opeq (&GenMOASGN, lval, k);
break;
case SLASGN:
opeq (&GenSLASGN, lval, k);
break;
case SRASGN:
opeq (&GenSRASGN, lval, k);
break;
case AASGN:
opeq (&GenAASGN, lval, k);
break;
case XOASGN:
opeq (&GenXOASGN, lval, k);
break;
case OASGN:
opeq (&GenOASGN, lval, k);
break;
default:
return k;
}
return 0;
}
int hie0 (struct expent *lval)
/* Parse comma operator. */
{
int k;
k = hie1 (lval);
while (curtok == COMMA) {
gettok ();
k = hie1 (lval);
}
return k;
}
int evalexpr (unsigned flags, int (*f) (struct expent*), struct expent* lval)
/* Will evaluate an expression via the given function. If the result is a
* constant, 0 is returned and the value is put in the lval struct. If the
* result is not constant, exprhs is called to bring the value into the
* primary register and 1 is returned.
*/
{
int k;
/* Evaluate */
k = f (lval);
if (k == 0 && lval->e_flags == E_MCONST) {
/* Constant expression */
return 0;
} else {
/* Not constant, load into the primary */
exprhs (flags, k, lval);
return 1;
}
}
int expr (int (*func) (), struct expent *lval)
/* Expression parser; func is either hie0 or hie1. */
{
int k;
int savsp;
savsp = oursp;
k = (*func) (lval);
/* Do some checks if code generation is still constistent */
if (savsp != oursp) {
if (Debug) {
fprintf (stderr, "oursp != savesp (%d != %d)\n", oursp, savsp);
} else {
Internal ("oursp != savsp (%d != %d)", oursp, savsp);
}
}
return k;
}
void expression1 (struct expent* lval)
/* Evaluate an expression on level 1 (no comma operator) and put it into
* the primary register
*/
{
memset (lval, 0, sizeof (*lval));
exprhs (CF_NONE, expr (hie1, lval), lval);
}
void expression (struct expent* lval)
/* Evaluate an expression and put it into the primary register */
{
memset (lval, 0, sizeof (*lval));
exprhs (CF_NONE, expr (hie0, lval), lval);
}
void constexpr (struct expent* lval)
/* Get a constant value */
{
memset (lval, 0, sizeof (*lval));
if (expr (hie1, lval) != 0 || (lval->e_flags & E_MCONST) == 0) {
Error (ERR_CONST_EXPR_EXPECTED);
/* To avoid any compiler errors, make the expression a valid const */
lval->e_flags = E_MCONST;
lval->e_tptr = type_int;
lval->e_const = 0;
}
}
void intexpr (struct expent* lval)
/* Get an integer expression */
{
expression (lval);
if (!IsInt (lval->e_tptr)) {
Error (ERR_INT_EXPR_EXPECTED);
/* To avoid any compiler errors, make the expression a valid int */
lval->e_flags = E_MCONST;
lval->e_tptr = type_int;
lval->e_const = 0;
}
}
void boolexpr (struct expent* lval)
/* Get a boolean expression */
{
/* Read an expression */
expression (lval);
/* If it's an integer, it's ok. If it's not an integer, but a pointer,
* the pointer used in a boolean context is also ok (Ootherwise check if it's a pointer
* expression.
*/
if (!IsInt (lval->e_tptr) && !IsPtr (lval->e_tptr)) {
Error (ERR_INT_EXPR_EXPECTED);
/* To avoid any compiler errors, make the expression a valid int */
lval->e_flags = E_MCONST;
lval->e_tptr = type_int;
lval->e_const = 0;
}
}
void test (unsigned label, int cond)
/* Generate code to perform test and jump if false. */
{
int k;
struct expent lval;
/* Eat the parenthesis */
ConsumeLParen ();
/* Prepare the expression, setup labels */
memset (&lval, 0, sizeof (lval));
lval.e_test = E_TEST;
/* Generate code to eval the expr */
k = expr (hie0, &lval);
if (k == 0 && lval.e_flags == E_MCONST) {
/* Constant rvalue */
if (cond == 0 && lval.e_const == 0) {
g_jump (label);
Warning (WARN_UNREACHABLE_CODE);
} else if (cond && lval.e_const) {
g_jump (label);
}
ConsumeRParen ();
return;
}
/* If the expr hasn't set condition codes, set the force-test flag */
if ((lval.e_test & E_CC) == 0) {
lval.e_test |= E_FORCETEST;
}
/* Load the value into the primary register */
exprhs (CF_FORCECHAR, k, &lval);
/* Check for the closing brace */
ConsumeRParen ();
/* Generate the jump */
if (cond) {
g_truejump (CF_NONE, label);
} else {
/* Special case (putting this here is a small hack - but hey, the
* compiler itself is one big hack...): If a semicolon follows, we
* don't have a statement and may omit the jump.
*/
if (curtok != SEMI) {
g_falsejump (CF_NONE, label);
}
}
}
Reference in New Issue View Git Blame Copy Permalink