4 * Ullrich von Bassewitz, 21.06.1998
14 #include "debugflag.h"
21 #include "assignment.h"
40 /*****************************************************************************/
42 /*****************************************************************************/
46 /* Generator attributes */
47 #define GEN_NOPUSH 0x01 /* Don't push lhs */
49 /* Map a generator function and its attributes to a token */
51 token_t Tok; /* Token to map to */
52 unsigned Flags; /* Flags for generator function */
53 void (*Func) (unsigned, unsigned long); /* Generator func */
56 /* Descriptors for the operations */
57 static GenDesc GenMUL = { TOK_STAR, GEN_NOPUSH, g_mul };
58 static GenDesc GenDIV = { TOK_DIV, GEN_NOPUSH, g_div };
59 static GenDesc GenMOD = { TOK_MOD, GEN_NOPUSH, g_mod };
60 static GenDesc GenASL = { TOK_SHL, GEN_NOPUSH, g_asl };
61 static GenDesc GenASR = { TOK_SHR, GEN_NOPUSH, g_asr };
62 static GenDesc GenLT = { TOK_LT, GEN_NOPUSH, g_lt };
63 static GenDesc GenLE = { TOK_LE, GEN_NOPUSH, g_le };
64 static GenDesc GenGE = { TOK_GE, GEN_NOPUSH, g_ge };
65 static GenDesc GenGT = { TOK_GT, GEN_NOPUSH, g_gt };
66 static GenDesc GenEQ = { TOK_EQ, GEN_NOPUSH, g_eq };
67 static GenDesc GenNE = { TOK_NE, GEN_NOPUSH, g_ne };
68 static GenDesc GenAND = { TOK_AND, GEN_NOPUSH, g_and };
69 static GenDesc GenXOR = { TOK_XOR, GEN_NOPUSH, g_xor };
70 static GenDesc GenOR = { TOK_OR, GEN_NOPUSH, g_or };
71 static GenDesc GenPASGN = { TOK_PLUS_ASSIGN, GEN_NOPUSH, g_add };
72 static GenDesc GenSASGN = { TOK_MINUS_ASSIGN, GEN_NOPUSH, g_sub };
73 static GenDesc GenMASGN = { TOK_MUL_ASSIGN, GEN_NOPUSH, g_mul };
74 static GenDesc GenDASGN = { TOK_DIV_ASSIGN, GEN_NOPUSH, g_div };
75 static GenDesc GenMOASGN = { TOK_MOD_ASSIGN, GEN_NOPUSH, g_mod };
76 static GenDesc GenSLASGN = { TOK_SHL_ASSIGN, GEN_NOPUSH, g_asl };
77 static GenDesc GenSRASGN = { TOK_SHR_ASSIGN, GEN_NOPUSH, g_asr };
78 static GenDesc GenAASGN = { TOK_AND_ASSIGN, GEN_NOPUSH, g_and };
79 static GenDesc GenXOASGN = { TOK_XOR_ASSIGN, GEN_NOPUSH, g_xor };
80 static GenDesc GenOASGN = { TOK_OR_ASSIGN, GEN_NOPUSH, g_or };
84 /*****************************************************************************/
85 /* Function forwards */
86 /*****************************************************************************/
90 int hie0 (ExprDesc *lval);
91 /* Parse comma operator. */
93 static int expr (int (*func) (ExprDesc*), ExprDesc *lval);
94 /* Expression parser; func is either hie0 or hie1. */
98 /*****************************************************************************/
99 /* Helper functions */
100 /*****************************************************************************/
104 static unsigned GlobalModeFlags (unsigned flags)
105 /* Return the addressing mode flags for the variable with the given flags */
108 if (flags == E_TGLAB) {
109 /* External linkage */
111 } else if (flags == E_TREGISTER) {
112 /* Register variable */
122 static int IsNullPtr (ExprDesc* lval)
123 /* Return true if this is the NULL pointer constant */
125 return (IsClassInt (lval->Type) && /* Is it an int? */
126 lval->Flags == E_MCONST && /* Is it constant? */
127 lval->ConstVal == 0); /* And is it's value zero? */
132 static type* promoteint (type* lhst, type* rhst)
133 /* In an expression with two ints, return the type of the result */
135 /* Rules for integer types:
136 * - If one of the values is a long, the result is long.
137 * - If one of the values is unsigned, the result is also unsigned.
138 * - Otherwise the result is an int.
140 if (IsTypeLong (lhst) || IsTypeLong (rhst)) {
141 if (IsSignUnsigned (lhst) || IsSignUnsigned (rhst)) {
147 if (IsSignUnsigned (lhst) || IsSignUnsigned (rhst)) {
157 static unsigned typeadjust (ExprDesc* lhs, ExprDesc* rhs, int NoPush)
158 /* Adjust the two values for a binary operation. lhs is expected on stack or
159 * to be constant, rhs is expected to be in the primary register or constant.
160 * The function will put the type of the result into lhs and return the
161 * code generator flags for the operation.
162 * If NoPush is given, it is assumed that the operation does not expect the lhs
163 * to be on stack, and that lhs is in a register instead.
164 * Beware: The function does only accept int types.
167 unsigned ltype, rtype;
170 /* Get the type strings */
171 type* lhst = lhs->Type;
172 type* rhst = rhs->Type;
174 /* Generate type adjustment code if needed */
175 ltype = TypeOf (lhst);
176 if (lhs->Flags == E_MCONST) {
180 /* Value is in primary register*/
183 rtype = TypeOf (rhst);
184 if (rhs->Flags == E_MCONST) {
187 flags = g_typeadjust (ltype, rtype);
189 /* Set the type of the result */
190 lhs->Type = promoteint (lhst, rhst);
192 /* Return the code generator flags */
198 void DefineData (ExprDesc* Expr)
199 /* Output a data definition for the given expression */
201 unsigned Flags = Expr->Flags;
203 switch (Flags & E_MCTYPE) {
207 g_defdata (TypeOf (Expr->Type) | CF_CONST, Expr->ConstVal, 0);
211 /* Register variable. Taking the address is usually not
214 if (!AllowRegVarAddr) {
215 Error ("Cannot take the address of a register variable");
221 /* Local or global symbol */
222 g_defdata (GlobalModeFlags (Flags), Expr->Name, Expr->ConstVal);
226 /* a literal of some kind */
227 g_defdata (CF_STATIC, LiteralPoolLabel, Expr->ConstVal);
231 Internal ("Unknown constant type: %04X", Flags);
237 static void LoadConstant (unsigned Flags, ExprDesc* Expr)
238 /* Load the primary register with some constant value. */
240 switch (Expr->Flags & E_MCTYPE) {
243 g_leasp (Expr->ConstVal);
247 /* Number constant */
248 g_getimmed (Flags | TypeOf (Expr->Type) | CF_CONST, Expr->ConstVal, 0);
252 /* Register variable. Taking the address is usually not
255 if (!AllowRegVarAddr) {
256 Error ("Cannot take the address of a register variable");
262 /* Local or global symbol, load address */
263 Flags |= GlobalModeFlags (Expr->Flags);
265 g_getimmed (Flags, Expr->Name, Expr->ConstVal);
270 g_getimmed (CF_STATIC, LiteralPoolLabel, Expr->ConstVal);
274 Internal ("Unknown constant type: %04X", Expr->Flags);
280 static int kcalc (token_t tok, long val1, long val2)
281 /* Calculate an operation with left and right operand constant. */
285 return (val1 == val2);
287 return (val1 != val2);
289 return (val1 < val2);
291 return (val1 <= val2);
293 return (val1 >= val2);
295 return (val1 > val2);
297 return (val1 | val2);
299 return (val1 ^ val2);
301 return (val1 & val2);
303 return (val1 >> val2);
305 return (val1 << val2);
307 return (val1 * val2);
310 Error ("Division by zero");
313 return (val1 / val2);
316 Error ("Modulo operation with zero");
319 return (val1 % val2);
321 Internal ("kcalc: got token 0x%X\n", tok);
328 static const GenDesc* FindGen (token_t Tok, const GenDesc** Table)
329 /* Find a token in a generator table */
332 while ((G = *Table) != 0) {
343 static int istypeexpr (void)
344 /* Return true if some sort of variable or type is waiting (helper for cast
345 * and sizeof() in hie10).
350 return CurTok.Tok == TOK_LPAREN && (
351 (NextTok.Tok >= TOK_FIRSTTYPE && NextTok.Tok <= TOK_LASTTYPE) ||
352 (NextTok.Tok == TOK_CONST) ||
353 (NextTok.Tok == TOK_IDENT &&
354 (Entry = FindSym (NextTok.Ident)) != 0 &&
355 SymIsTypeDef (Entry)));
360 void PushAddr (ExprDesc* lval)
361 /* If the expression contains an address that was somehow evaluated,
362 * push this address on the stack. This is a helper function for all
363 * sorts of implicit or explicit assignment functions where the lvalue
364 * must be saved if it's not constant, before evaluating the rhs.
367 /* Get the address on stack if needed */
368 if (lval->Flags != E_MREG && (lval->Flags & E_MEXPR)) {
369 /* Push the address (always a pointer) */
376 void ConstSubExpr (int (*F) (ExprDesc*), ExprDesc* Expr)
377 /* Will evaluate an expression via the given function. If the result is not
378 * a constant, a diagnostic will be printed, and the value is replaced by
379 * a constant one to make sure there are no internal errors that result
380 * from this input error.
384 if (F (Expr) != 0 || Expr->Flags != E_MCONST) {
385 Error ("Constant expression expected");
386 /* To avoid any compiler errors, make the expression a valid const */
387 MakeConstIntExpr (Expr, 1);
393 void CheckBoolExpr (ExprDesc* lval)
394 /* Check if the given expression is a boolean expression, output a diagnostic
398 /* If it's an integer, it's ok. If it's not an integer, but a pointer,
399 * the pointer used in a boolean context is also ok
401 if (!IsClassInt (lval->Type) && !IsClassPtr (lval->Type)) {
402 Error ("Boolean expression expected");
403 /* To avoid any compiler errors, make the expression a valid int */
404 MakeConstIntExpr (lval, 1);
410 /*****************************************************************************/
412 /*****************************************************************************/
416 void exprhs (unsigned flags, int k, ExprDesc* lval)
417 /* Put the result of an expression into the primary register */
423 /* Dereferenced lvalue */
424 flags |= TypeOf (lval->Type);
425 if (lval->Test & E_FORCETEST) {
427 lval->Test &= ~E_FORCETEST;
429 if (f & E_MGLOBAL) { /* ref to globalvar */
431 flags |= GlobalModeFlags (f);
432 g_getstatic (flags, lval->Name, lval->ConstVal);
433 } else if (f & E_MLOCAL) {
434 /* ref to localvar */
435 g_getlocal (flags, lval->ConstVal);
436 } else if (f & E_MCONST) {
437 /* ref to absolute address */
438 g_getstatic (flags | CF_ABSOLUTE, lval->ConstVal, 0);
439 } else if (f == E_MEOFFS) {
440 g_getind (flags, lval->ConstVal);
441 } else if (f != E_MREG) {
444 } else if (f == E_MEOFFS) {
445 /* reference not storable */
446 flags |= TypeOf (lval->Type);
447 g_inc (flags | CF_CONST, lval->ConstVal);
448 } else if ((f & E_MEXPR) == 0) {
449 /* Constant of some sort, load it into the primary */
450 LoadConstant (flags, lval);
452 /* Are we testing this value? */
453 if (lval->Test & E_FORCETEST) {
454 /* Yes, force a test */
455 flags |= TypeOf (lval->Type);
457 lval->Test &= ~E_FORCETEST;
463 static unsigned FunctionParamList (FuncDesc* Func)
464 /* Parse a function parameter list and pass the parameters to the called
465 * function. Depending on several criteria this may be done by just pushing
466 * each parameter separately, or creating the parameter frame once and then
467 * storing into this frame.
468 * The function returns the size of the parameters pushed.
473 /* Initialize variables */
474 SymEntry* Param = 0; /* Keep gcc silent */
475 unsigned ParamSize = 0; /* Size of parameters pushed */
476 unsigned ParamCount = 0; /* Number of parameters pushed */
477 unsigned FrameSize = 0; /* Size of parameter frame */
478 unsigned FrameParams = 0; /* Number of params in frame */
479 int FrameOffs = 0; /* Offset into parameter frame */
480 int Ellipsis = 0; /* Function is variadic */
482 /* As an optimization, we may allocate the complete parameter frame at
483 * once instead of pushing each parameter as it comes. We may do that,
486 * - optimizations that increase code size are enabled (allocating the
487 * stack frame at once gives usually larger code).
488 * - we have more than one parameter to push (don't count the last param
489 * for __fastcall__ functions).
491 if (CodeSizeFactor >= 200) {
493 /* Calculate the number and size of the parameters */
494 FrameParams = Func->ParamCount;
495 FrameSize = Func->ParamSize;
496 if (FrameParams > 0 && (Func->Flags & FD_FASTCALL) != 0) {
497 /* Last parameter is not pushed */
498 FrameSize -= CheckedSizeOf (Func->LastParam->Type);
502 /* Do we have more than one parameter in the frame? */
503 if (FrameParams > 1) {
504 /* Okeydokey, setup the frame */
509 /* Don't use a preallocated frame */
514 /* Parse the actual parameter list */
515 while (CurTok.Tok != TOK_RPAREN) {
520 /* Count arguments */
523 /* Fetch the pointer to the next argument, check for too many args */
524 if (ParamCount <= Func->ParamCount) {
525 /* Beware: If there are parameters with identical names, they
526 * cannot go into the same symbol table, which means that in this
527 * case of errorneous input, the number of nodes in the symbol
528 * table and ParamCount are NOT equal. We have to handle this case
529 * below to avoid segmentation violations. Since we know that this
530 * problem can only occur if there is more than one parameter,
531 * we will just use the last one.
533 if (ParamCount == 1) {
535 Param = Func->SymTab->SymHead;
536 } else if (Param->NextSym != 0) {
538 Param = Param->NextSym;
539 CHECK ((Param->Flags & SC_PARAM) != 0);
541 } else if (!Ellipsis) {
542 /* Too many arguments. Do we have an open param list? */
543 if ((Func->Flags & FD_VARIADIC) == 0) {
544 /* End of param list reached, no ellipsis */
545 Error ("Too many arguments in function call");
547 /* Assume an ellipsis even in case of errors to avoid an error
548 * message for each other argument.
553 /* Do some optimization: If we have a constant value to push,
554 * use a special function that may optimize.
557 if (!Ellipsis && CheckedSizeOf (Param->Type) == 1) {
558 CFlags = CF_FORCECHAR;
561 if (evalexpr (CFlags, hie1, &lval) == 0) {
562 /* A constant value */
566 /* If we don't have an argument spec, accept anything, otherwise
567 * convert the actual argument to the type needed.
570 /* Convert the argument to the parameter type if needed */
571 TypeConversion (&lval, 0, Param->Type);
573 /* If we have a prototype, chars may be pushed as chars */
574 Flags |= CF_FORCECHAR;
577 /* Use the type of the argument for the push */
578 Flags |= TypeOf (lval.Type);
580 /* If this is a fastcall function, don't push the last argument */
581 if (ParamCount == Func->ParamCount && (Func->Flags & FD_FASTCALL) != 0) {
582 /* Just load the argument into the primary. This is only needed if
583 * we have a constant argument, otherwise the value is already in
586 if (Flags & CF_CONST) {
587 exprhs (CF_FORCECHAR, 0, &lval);
590 unsigned ArgSize = sizeofarg (Flags);
592 /* We have the space already allocated, store in the frame.
593 * Because of invalid type conversions (that have produced an
594 * error before), we can end up here with a non aligned stack
595 * frame. Since no output will be generated anyway, handle
596 * these cases gracefully instead of doing a CHECK.
598 if (FrameSize >= ArgSize) {
599 FrameSize -= ArgSize;
603 FrameOffs -= ArgSize;
605 g_putlocal (Flags | CF_NOKEEP, FrameOffs, lval.ConstVal);
607 /* Push the argument */
608 g_push (Flags, lval.ConstVal);
611 /* Calculate total parameter size */
612 ParamSize += ArgSize;
615 /* Check for end of argument list */
616 if (CurTok.Tok != TOK_COMMA) {
622 /* Check if we had enough parameters */
623 if (ParamCount < Func->ParamCount) {
624 Error ("Too few arguments in function call");
627 /* The function returns the size of all parameters pushed onto the stack.
628 * However, if there are parameters missing (which is an error and was
629 * flagged by the compiler) AND a stack frame was preallocated above,
630 * we would loose track of the stackpointer and generate an internal error
631 * later. So we correct the value by the parameters that should have been
632 * pushed to avoid an internal compiler error. Since an error was
633 * generated before, no code will be output anyway.
635 return ParamSize + FrameSize;
640 static void FunctionCall (int k, ExprDesc* lval)
641 /* Perform a function call. */
643 FuncDesc* Func; /* Function descriptor */
644 int IsFuncPtr; /* Flag */
645 unsigned ParamSize; /* Number of parameter bytes */
646 CodeMark Mark = 0; /* Initialize to keep gcc silent */
647 int PtrOffs = 0; /* Offset of function pointer on stack */
648 int IsFastCall = 0; /* True if it's a fast call function */
649 int PtrOnStack = 0; /* True if a pointer copy is on stack */
651 /* Get a pointer to the function descriptor from the type string */
652 Func = GetFuncDesc (lval->Type);
654 /* Handle function pointers transparently */
655 IsFuncPtr = IsTypeFuncPtr (lval->Type);
658 /* Check wether it's a fastcall function that has parameters */
659 IsFastCall = IsFastCallFunc (lval->Type + 1) && (Func->ParamCount > 0);
661 /* Things may be difficult, depending on where the function pointer
662 * resides. If the function pointer is an expression of some sort
663 * (not a local or global variable), we have to evaluate this
664 * expression now and save the result for later. Since calls to
665 * function pointers may be nested, we must save it onto the stack.
666 * For fastcall functions we do also need to place a copy of the
667 * pointer on stack, since we cannot use a/x.
669 PtrOnStack = IsFastCall || ((lval->Flags & (E_MGLOBAL | E_MLOCAL)) == 0);
672 /* Not a global or local variable, or a fastcall function. Load
673 * the pointer into the primary and mark it as an expression.
675 exprhs (CF_NONE, k, lval);
676 lval->Flags |= E_MEXPR;
678 /* Remember the code position */
679 Mark = GetCodePos ();
681 /* Push the pointer onto the stack and remember the offset */
686 /* Check for known standard functions and inline them if requested */
687 } else if (InlineStdFuncs && IsStdFunc ((const char*) lval->Name)) {
689 /* Inline this function */
690 HandleStdFunc (Func, lval);
695 /* Parse the parameter list */
696 ParamSize = FunctionParamList (Func);
698 /* We need the closing paren here */
701 /* Special handling for function pointers */
704 /* If the function is not a fastcall function, load the pointer to
705 * the function into the primary.
709 /* Not a fastcall function - we may use the primary */
711 /* If we have no parameters, the pointer is still in the
712 * primary. Remove the code to push it and correct the
715 if (ParamSize == 0) {
720 /* Load from the saved copy */
721 g_getlocal (CF_PTR, PtrOffs);
724 /* Load from original location */
725 exprhs (CF_NONE, k, lval);
728 /* Call the function */
729 g_callind (TypeOf (lval->Type+1), ParamSize, PtrOffs);
733 /* Fastcall function. We cannot use the primary for the function
734 * pointer and must therefore use an offset to the stack location.
735 * Since fastcall functions may never be variadic, we can use the
736 * index register for this purpose.
738 g_callind (CF_LOCAL, ParamSize, PtrOffs);
741 /* If we have a pointer on stack, remove it */
743 g_space (- (int) sizeofarg (CF_PTR));
752 /* Normal function */
753 g_call (TypeOf (lval->Type), (const char*) lval->Name, ParamSize);
760 static int primary (ExprDesc* lval)
761 /* This is the lowest level of the expression parser. */
765 /* Initialize fields in the expression stucture */
766 lval->Test = 0; /* No test */
767 lval->Sym = 0; /* Symbol unknown */
769 /* Character and integer constants. */
770 if (CurTok.Tok == TOK_ICONST || CurTok.Tok == TOK_CCONST) {
771 lval->Flags = E_MCONST | E_TCONST;
772 lval->Type = CurTok.Type;
773 lval->ConstVal = CurTok.IVal;
778 /* Process parenthesized subexpression by calling the whole parser
781 if (CurTok.Tok == TOK_LPAREN) {
783 InitExprDesc (lval); /* Remove any attributes */
789 /* If we run into an identifier in preprocessing mode, we assume that this
790 * is an undefined macro and replace it by a constant value of zero.
792 if (Preprocessing && CurTok.Tok == TOK_IDENT) {
793 MakeConstIntExpr (lval, 0);
797 /* All others may only be used if the expression evaluation is not called
798 * recursively by the preprocessor.
801 /* Illegal expression in PP mode */
802 Error ("Preprocessor expression expected");
803 MakeConstIntExpr (lval, 1);
808 if (CurTok.Tok == TOK_IDENT) {
813 /* Get a pointer to the symbol table entry */
814 Sym = lval->Sym = FindSym (CurTok.Ident);
816 /* Is the symbol known? */
819 /* We found the symbol - skip the name token */
822 /* The expression type is the symbol type */
823 lval->Type = Sym->Type;
825 /* Check for illegal symbol types */
826 CHECK ((Sym->Flags & SC_LABEL) != SC_LABEL);
827 if (Sym->Flags & SC_TYPE) {
828 /* Cannot use type symbols */
829 Error ("Variable identifier expected");
830 /* Assume an int type to make lval valid */
831 lval->Flags = E_MLOCAL | E_TLOFFS;
832 lval->Type = type_int;
837 /* Check for legal symbol types */
838 if ((Sym->Flags & SC_CONST) == SC_CONST) {
839 /* Enum or some other numeric constant */
840 lval->Flags = E_MCONST | E_TCONST;
841 lval->ConstVal = Sym->V.ConstVal;
843 } else if ((Sym->Flags & SC_FUNC) == SC_FUNC) {
845 lval->Flags = E_MGLOBAL | E_MCONST | E_TGLAB;
846 lval->Name = (unsigned long) Sym->Name;
848 } else if ((Sym->Flags & SC_AUTO) == SC_AUTO) {
849 /* Local variable. If this is a parameter for a variadic
850 * function, we have to add some address calculations, and the
851 * address is not const.
853 if ((Sym->Flags & SC_PARAM) == SC_PARAM && F_IsVariadic (CurrentFunc)) {
854 /* Variadic parameter */
855 g_leavariadic (Sym->V.Offs - F_GetParamSize (CurrentFunc));
856 lval->Flags = E_MEXPR;
859 /* Normal parameter */
860 lval->Flags = E_MLOCAL | E_TLOFFS;
861 lval->ConstVal = Sym->V.Offs;
863 } else if ((Sym->Flags & SC_REGISTER) == SC_REGISTER) {
864 /* Register variable, zero page based */
865 lval->Flags = E_MGLOBAL | E_MCONST | E_TREGISTER;
866 lval->Name = Sym->V.R.RegOffs;
868 } else if ((Sym->Flags & SC_STATIC) == SC_STATIC) {
869 /* Static variable */
870 if (Sym->Flags & (SC_EXTERN | SC_STORAGE)) {
871 lval->Flags = E_MGLOBAL | E_MCONST | E_TGLAB;
872 lval->Name = (unsigned long) Sym->Name;
874 lval->Flags = E_MGLOBAL | E_MCONST | E_TLLAB;
875 lval->Name = Sym->V.Label;
879 /* Local static variable */
880 lval->Flags = E_MGLOBAL | E_MCONST | E_TLLAB;
881 lval->Name = Sym->V.Offs;
885 /* The symbol is referenced now */
886 Sym->Flags |= SC_REF;
887 if (IsTypeFunc (lval->Type) || IsTypeArray (lval->Type)) {
893 /* We did not find the symbol. Remember the name, then skip it */
894 strcpy (Ident, CurTok.Ident);
897 /* IDENT is either an auto-declared function or an undefined variable. */
898 if (CurTok.Tok == TOK_LPAREN) {
899 /* Declare a function returning int. For that purpose, prepare a
900 * function signature for a function having an empty param list
903 Warning ("Function call without a prototype");
904 Sym = AddGlobalSym (Ident, GetImplicitFuncType(), SC_EXTERN | SC_REF | SC_FUNC);
905 lval->Type = Sym->Type;
906 lval->Flags = E_MGLOBAL | E_MCONST | E_TGLAB;
907 lval->Name = (unsigned long) Sym->Name;
913 /* Undeclared Variable */
914 Sym = AddLocalSym (Ident, type_int, SC_AUTO | SC_REF, 0);
915 lval->Flags = E_MLOCAL | E_TLOFFS;
916 lval->Type = type_int;
918 Error ("Undefined symbol: `%s'", Ident);
924 /* String literal? */
925 if (CurTok.Tok == TOK_SCONST) {
926 lval->Flags = E_MCONST | E_TLIT;
927 lval->ConstVal = CurTok.IVal;
928 lval->Type = GetCharArrayType (GetLiteralPoolOffs () - CurTok.IVal);
934 if (CurTok.Tok == TOK_ASM) {
936 lval->Type = type_void;
937 lval->Flags = E_MEXPR;
942 /* __AX__ and __EAX__ pseudo values? */
943 if (CurTok.Tok == TOK_AX || CurTok.Tok == TOK_EAX) {
944 lval->Type = (CurTok.Tok == TOK_AX)? type_uint : type_ulong;
945 lval->Flags = E_MREG;
949 return 1; /* May be used as lvalue */
952 /* Illegal primary. */
953 Error ("Expression expected");
954 MakeConstIntExpr (lval, 1);
960 static int arrayref (int k, ExprDesc* lval)
961 /* Handle an array reference */
975 /* Skip the bracket */
978 /* Get the type of left side */
981 /* We can apply a special treatment for arrays that have a const base
982 * address. This is true for most arrays and will produce a lot better
983 * code. Check if this is a const base address.
985 lflags = lval->Flags & ~E_MCTYPE;
986 ConstBaseAddr = (lflags == E_MCONST) || /* Constant numeric address */
987 (lflags & E_MGLOBAL) != 0 || /* Static array, or ... */
988 lflags == E_MLOCAL; /* Local array */
990 /* If we have a constant base, we delay the address fetch */
991 Mark1 = GetCodePos ();
992 Mark2 = 0; /* Silence gcc */
993 if (!ConstBaseAddr) {
994 /* Get a pointer to the array into the primary */
995 exprhs (CF_NONE, k, lval);
997 /* Get the array pointer on stack. Do not push more than 16
998 * bit, even if this value is greater, since we cannot handle
999 * other than 16bit stuff when doing indexing.
1001 Mark2 = GetCodePos ();
1005 /* TOS now contains ptr to array elements. Get the subscript. */
1007 if (l == 0 && lval2.Flags == E_MCONST) {
1009 /* The array subscript is a constant - remove value from stack */
1010 if (!ConstBaseAddr) {
1014 /* Get an array pointer into the primary */
1015 exprhs (CF_NONE, k, lval);
1018 if (IsClassPtr (tptr1)) {
1020 /* Scale the subscript value according to element size */
1021 lval2.ConstVal *= CheckedPSizeOf (tptr1);
1023 /* Remove code for lhs load */
1026 /* Handle constant base array on stack. Be sure NOT to
1027 * handle pointers the same way, and check for character literals
1028 * (both won't work).
1030 if (IsTypeArray (tptr1) && lval->Flags != (E_MCONST | E_TLIT) &&
1031 ((lval->Flags & ~E_MCTYPE) == E_MCONST ||
1032 (lval->Flags & ~E_MCTYPE) == E_MLOCAL ||
1033 (lval->Flags & E_MGLOBAL) != 0 ||
1034 (lval->Flags == E_MEOFFS))) {
1035 lval->ConstVal += lval2.ConstVal;
1038 /* Pointer - load into primary and remember offset */
1039 if ((lval->Flags & E_MEXPR) == 0 || k != 0) {
1040 exprhs (CF_NONE, k, lval);
1042 lval->ConstVal = lval2.ConstVal;
1043 lval->Flags = E_MEOFFS;
1046 /* Result is of element type */
1047 lval->Type = Indirect (tptr1);
1052 } else if (IsClassPtr (tptr2 = lval2.Type)) {
1053 /* Subscript is pointer, get element type */
1054 lval2.Type = Indirect (tptr2);
1056 /* Scale the rhs value in the primary register */
1057 g_scale (TypeOf (tptr1), CheckedSizeOf (lval2.Type));
1059 lval->Type = lval2.Type;
1061 Error ("Cannot subscript");
1064 /* Add the subscript. Since arrays are indexed by integers,
1065 * we will ignore the true type of the subscript here and
1066 * use always an int.
1068 g_inc (CF_INT | CF_CONST, lval2.ConstVal);
1072 /* Array subscript is not constant. Load it into the primary */
1073 Mark2 = GetCodePos ();
1074 exprhs (CF_NONE, l, &lval2);
1077 if (IsClassPtr (tptr1)) {
1079 /* Get the element type */
1080 lval->Type = Indirect (tptr1);
1082 /* Indexing is based on int's, so we will just use the integer
1083 * portion of the index (which is in (e)ax, so there's no further
1086 g_scale (CF_INT, CheckedSizeOf (lval->Type));
1088 } else if (IsClassPtr (tptr2)) {
1090 /* Get the element type */
1091 lval2.Type = Indirect (tptr2);
1093 /* Get the int value on top. If we go here, we're sure,
1094 * both values are 16 bit (the first one was truncated
1095 * if necessary and the second one is a pointer).
1096 * Note: If ConstBaseAddr is true, we don't have a value on
1097 * stack, so to "swap" both, just push the subscript.
1099 if (ConstBaseAddr) {
1101 exprhs (CF_NONE, k, lval);
1108 g_scale (TypeOf (tptr1), CheckedSizeOf (lval2.Type));
1109 lval->Type = lval2.Type;
1111 Error ("Cannot subscript");
1114 /* The offset is now in the primary register. It didn't have a
1115 * constant base address for the lhs, the lhs address is already
1116 * on stack, and we must add the offset. If the base address was
1117 * constant, we call special functions to add the address to the
1120 if (!ConstBaseAddr) {
1121 /* Add the subscript. Both values are int sized. */
1125 /* If the subscript has itself a constant address, it is often
1126 * a better idea to reverse again the order of the evaluation.
1127 * This will generate better code if the subscript is a byte
1128 * sized variable. But beware: This is only possible if the
1129 * subscript was not scaled, that is, if this was a byte array
1132 rflags = lval2.Flags & ~E_MCTYPE;
1133 ConstSubAddr = (rflags == E_MCONST) || /* Constant numeric address */
1134 (rflags & E_MGLOBAL) != 0 || /* Static array, or ... */
1135 rflags == E_MLOCAL; /* Local array */
1137 if (ConstSubAddr && CheckedSizeOf (lval->Type) == SIZEOF_CHAR) {
1141 /* Reverse the order of evaluation */
1142 unsigned flags = (CheckedSizeOf (lval2.Type) == SIZEOF_CHAR)? CF_CHAR : CF_INT;
1145 /* Get a pointer to the array into the primary. We have changed
1146 * Type above but we need the original type to load the
1147 * address, so restore it temporarily.
1149 SavedType = lval->Type;
1151 exprhs (CF_NONE, k, lval);
1152 lval->Type = SavedType;
1154 /* Add the variable */
1155 if (rflags == E_MLOCAL) {
1156 g_addlocal (flags, lval2.ConstVal);
1158 flags |= GlobalModeFlags (lval2.Flags);
1159 g_addstatic (flags, lval2.Name, lval2.ConstVal);
1162 if (lflags == E_MCONST) {
1163 /* Constant numeric address. Just add it */
1164 g_inc (CF_INT | CF_UNSIGNED, lval->ConstVal);
1165 } else if (lflags == E_MLOCAL) {
1166 /* Base address is a local variable address */
1167 if (IsTypeArray (tptr1)) {
1168 g_addaddr_local (CF_INT, lval->ConstVal);
1170 g_addlocal (CF_PTR, lval->ConstVal);
1173 /* Base address is a static variable address */
1174 unsigned flags = CF_INT;
1175 flags |= GlobalModeFlags (lval->Flags);
1176 if (IsTypeArray (tptr1)) {
1177 g_addaddr_static (flags, lval->Name, lval->ConstVal);
1179 g_addstatic (flags, lval->Name, lval->ConstVal);
1185 lval->Flags = E_MEXPR;
1188 return !IsTypeArray (lval->Type);
1194 static int structref (int k, ExprDesc* lval)
1195 /* Process struct field after . or ->. */
1201 /* Skip the token and check for an identifier */
1203 if (CurTok.Tok != TOK_IDENT) {
1204 Error ("Identifier expected");
1205 lval->Type = type_int;
1209 /* Get the symbol table entry and check for a struct field */
1210 strcpy (Ident, CurTok.Ident);
1212 Field = FindStructField (lval->Type, Ident);
1214 Error ("Struct/union has no field named `%s'", Ident);
1215 lval->Type = type_int;
1219 /* If we have constant input data, the result is also constant */
1220 flags = lval->Flags & ~E_MCTYPE;
1221 if (flags == E_MCONST ||
1222 (k == 0 && (flags == E_MLOCAL ||
1223 (flags & E_MGLOBAL) != 0 ||
1224 lval->Flags == E_MEOFFS))) {
1225 lval->ConstVal += Field->V.Offs;
1227 if ((flags & E_MEXPR) == 0 || k != 0) {
1228 exprhs (CF_NONE, k, lval);
1230 lval->ConstVal = Field->V.Offs;
1231 lval->Flags = E_MEOFFS;
1233 lval->Type = Field->Type;
1234 return !IsTypeArray (Field->Type);
1239 static int hie11 (ExprDesc *lval)
1240 /* Handle compound types (structs and arrays) */
1247 if (CurTok.Tok < TOK_LBRACK || CurTok.Tok > TOK_PTR_REF) {
1254 if (CurTok.Tok == TOK_LBRACK) {
1256 /* Array reference */
1257 k = arrayref (k, lval);
1259 } else if (CurTok.Tok == TOK_LPAREN) {
1261 /* Function call. Skip the opening parenthesis */
1264 if (IsTypeFunc (lval->Type) || IsTypeFuncPtr (lval->Type)) {
1266 /* Call the function */
1267 FunctionCall (k, lval);
1269 /* Result is in the primary register */
1270 lval->Flags = E_MEXPR;
1273 lval->Type = GetFuncReturn (lval->Type);
1276 Error ("Illegal function call");
1280 } else if (CurTok.Tok == TOK_DOT) {
1282 if (!IsClassStruct (lval->Type)) {
1283 Error ("Struct expected");
1285 k = structref (0, lval);
1287 } else if (CurTok.Tok == TOK_PTR_REF) {
1290 if (tptr[0] != T_PTR || (tptr[1] & T_STRUCT) == 0) {
1291 Error ("Struct pointer expected");
1293 k = structref (k, lval);
1303 void Store (ExprDesc* lval, const type* StoreType)
1304 /* Store the primary register into the location denoted by lval. If StoreType
1305 * is given, use this type when storing instead of lval->Type. If StoreType
1306 * is NULL, use lval->Type instead.
1311 unsigned f = lval->Flags;
1313 /* If StoreType was not given, use lval->Type instead */
1314 if (StoreType == 0) {
1315 StoreType = lval->Type;
1318 /* Get the code generator flags */
1319 Flags = TypeOf (StoreType);
1320 if (f & E_MGLOBAL) {
1321 Flags |= GlobalModeFlags (f);
1328 g_putstatic (Flags, lval->Name, lval->ConstVal);
1330 } else if (f & E_MLOCAL) {
1331 /* Store an auto variable */
1332 g_putlocal (Flags, lval->ConstVal, 0);
1333 } else if (f == E_MEOFFS) {
1334 /* Store indirect with offset */
1335 g_putind (Flags, lval->ConstVal);
1336 } else if (f != E_MREG) {
1338 /* Indirect without offset */
1339 g_putind (Flags, 0);
1341 /* Store into absolute address */
1342 g_putstatic (Flags | CF_ABSOLUTE, lval->ConstVal, 0);
1346 /* Assume that each one of the stores will invalidate CC */
1347 lval->Test &= ~E_CC;
1352 static void pre_incdec (ExprDesc* lval, void (*inc) (unsigned, unsigned long))
1353 /* Handle --i and ++i */
1360 if ((k = hie10 (lval)) == 0) {
1361 Error ("Invalid lvalue");
1365 /* Get the data type */
1366 flags = TypeOf (lval->Type) | CF_FORCECHAR | CF_CONST;
1368 /* Get the increment value in bytes */
1369 val = (lval->Type [0] == T_PTR)? CheckedPSizeOf (lval->Type) : 1;
1371 /* We're currently only able to handle some adressing modes */
1372 if ((lval->Flags & E_MGLOBAL) == 0 && /* Global address? */
1373 (lval->Flags & E_MLOCAL) == 0 && /* Local address? */
1374 (lval->Flags & E_MCONST) == 0 && /* Constant address? */
1375 (lval->Flags & E_MEXPR) == 0) { /* Address in a/x? */
1377 /* Use generic code. Push the address if needed */
1380 /* Fetch the value */
1381 exprhs (CF_NONE, k, lval);
1383 /* Increment value in primary */
1386 /* Store the result back */
1391 /* Special code for some addressing modes - use the special += ops */
1392 if (lval->Flags & E_MGLOBAL) {
1393 flags |= GlobalModeFlags (lval->Flags);
1395 g_addeqstatic (flags, lval->Name, lval->ConstVal, val);
1397 g_subeqstatic (flags, lval->Name, lval->ConstVal, val);
1399 } else if (lval->Flags & E_MLOCAL) {
1400 /* ref to localvar */
1402 g_addeqlocal (flags, lval->ConstVal, val);
1404 g_subeqlocal (flags, lval->ConstVal, val);
1406 } else if (lval->Flags & E_MCONST) {
1407 /* ref to absolute address */
1408 flags |= CF_ABSOLUTE;
1410 g_addeqstatic (flags, lval->ConstVal, 0, val);
1412 g_subeqstatic (flags, lval->ConstVal, 0, val);
1414 } else if (lval->Flags & E_MEXPR) {
1415 /* Address in a/x, check if we have an offset */
1416 unsigned Offs = (lval->Flags == E_MEOFFS)? lval->ConstVal : 0;
1418 g_addeqind (flags, Offs, val);
1420 g_subeqind (flags, Offs, val);
1423 Internal ("Invalid addressing mode");
1428 /* Result is an expression */
1429 lval->Flags = E_MEXPR;
1434 static void post_incdec (ExprDesc* lval, int k, void (*inc) (unsigned, unsigned long))
1435 /* Handle i-- and i++ */
1441 Error ("Invalid lvalue");
1445 /* Get the data type */
1446 flags = TypeOf (lval->Type);
1448 /* Push the address if needed */
1451 /* Fetch the value and save it (since it's the result of the expression) */
1452 exprhs (CF_NONE, 1, lval);
1453 g_save (flags | CF_FORCECHAR);
1455 /* If we have a pointer expression, increment by the size of the type */
1456 if (lval->Type[0] == T_PTR) {
1457 inc (flags | CF_CONST | CF_FORCECHAR, CheckedSizeOf (lval->Type + 1));
1459 inc (flags | CF_CONST | CF_FORCECHAR, 1);
1462 /* Store the result back */
1465 /* Restore the original value */
1466 g_restore (flags | CF_FORCECHAR);
1467 lval->Flags = E_MEXPR;
1472 static void unaryop (int tok, ExprDesc* lval)
1473 /* Handle unary -/+ and ~ */
1480 if (k == 0 && (lval->Flags & E_MCONST) != 0) {
1481 /* Value is constant */
1483 case TOK_MINUS: lval->ConstVal = -lval->ConstVal; break;
1484 case TOK_PLUS: break;
1485 case TOK_COMP: lval->ConstVal = ~lval->ConstVal; break;
1486 default: Internal ("Unexpected token: %d", tok);
1489 /* Value is not constant */
1490 exprhs (CF_NONE, k, lval);
1492 /* Get the type of the expression */
1493 flags = TypeOf (lval->Type);
1495 /* Handle the operation */
1497 case TOK_MINUS: g_neg (flags); break;
1498 case TOK_PLUS: break;
1499 case TOK_COMP: g_com (flags); break;
1500 default: Internal ("Unexpected token: %d", tok);
1502 lval->Flags = E_MEXPR;
1508 int hie10 (ExprDesc* lval)
1509 /* Handle ++, --, !, unary - etc. */
1514 switch (CurTok.Tok) {
1517 pre_incdec (lval, g_inc);
1521 pre_incdec (lval, g_dec);
1527 unaryop (CurTok.Tok, lval);
1532 if (evalexpr (CF_NONE, hie10, lval) == 0) {
1533 /* Constant expression */
1534 lval->ConstVal = !lval->ConstVal;
1536 g_bneg (TypeOf (lval->Type));
1537 lval->Test |= E_CC; /* bneg will set cc */
1538 lval->Flags = E_MEXPR; /* say it's an expr */
1540 return 0; /* expr not storable */
1544 if (evalexpr (CF_NONE, hie10, lval) != 0) {
1545 /* Expression is not const, indirect value loaded into primary */
1546 lval->Flags = E_MEXPR;
1547 lval->ConstVal = 0; /* Offset is zero now */
1549 /* If the expression is already a pointer to function, the
1550 * additional dereferencing operator must be ignored.
1552 if (IsTypeFuncPtr (lval->Type)) {
1553 /* Expression not storable */
1556 if (IsClassPtr (lval->Type)) {
1557 lval->Type = Indirect (lval->Type);
1559 Error ("Illegal indirection");
1568 /* The & operator may be applied to any lvalue, and it may be
1569 * applied to functions, even if they're no lvalues.
1571 if (k == 0 && !IsTypeFunc (lval->Type)) {
1572 /* Allow the & operator with an array */
1573 if (!IsTypeArray (lval->Type)) {
1574 Error ("Illegal address");
1577 t = TypeAlloc (TypeLen (lval->Type) + 2);
1579 TypeCpy (t + 1, lval->Type);
1586 if (istypeexpr ()) {
1587 type Type[MAXTYPELEN];
1589 lval->ConstVal = CheckedSizeOf (ParseType (Type));
1592 /* Remember the output queue pointer */
1593 CodeMark Mark = GetCodePos ();
1595 lval->ConstVal = CheckedSizeOf (lval->Type);
1596 /* Remove any generated code */
1599 lval->Flags = E_MCONST | E_TCONST;
1600 lval->Type = type_uint;
1601 lval->Test &= ~E_CC;
1605 if (istypeexpr ()) {
1607 return TypeCast (lval);
1612 switch (CurTok.Tok) {
1614 post_incdec (lval, k, g_inc);
1618 post_incdec (lval, k, g_dec);
1628 static int hie_internal (const GenDesc** ops, /* List of generators */
1629 ExprDesc* lval, /* parent expr's lval */
1630 int (*hienext) (ExprDesc*),
1631 int* UsedGen) /* next higher level */
1632 /* Helper function */
1639 token_t tok; /* The operator token */
1640 unsigned ltype, type;
1641 int rconst; /* Operand is a constant */
1647 while ((Gen = FindGen (CurTok.Tok, ops)) != 0) {
1649 /* Tell the caller that we handled it's ops */
1652 /* All operators that call this function expect an int on the lhs */
1653 if (!IsClassInt (lval->Type)) {
1654 Error ("Integer expression expected");
1657 /* Remember the operator token, then skip it */
1661 /* Get the lhs on stack */
1662 Mark1 = GetCodePos ();
1663 ltype = TypeOf (lval->Type);
1664 if (k == 0 && lval->Flags == E_MCONST) {
1665 /* Constant value */
1666 Mark2 = GetCodePos ();
1667 g_push (ltype | CF_CONST, lval->ConstVal);
1669 /* Value not constant */
1670 exprhs (CF_NONE, k, lval);
1671 Mark2 = GetCodePos ();
1675 /* Get the right hand side */
1676 rconst = (evalexpr (CF_NONE, hienext, &lval2) == 0);
1678 /* Check the type of the rhs */
1679 if (!IsClassInt (lval2.Type)) {
1680 Error ("Integer expression expected");
1683 /* Check for const operands */
1684 if (k == 0 && lval->Flags == E_MCONST && rconst) {
1686 /* Both operands are constant, remove the generated code */
1690 /* Evaluate the result */
1691 lval->ConstVal = kcalc (tok, lval->ConstVal, lval2.ConstVal);
1693 /* Get the type of the result */
1694 lval->Type = promoteint (lval->Type, lval2.Type);
1698 /* If the right hand side is constant, and the generator function
1699 * expects the lhs in the primary, remove the push of the primary
1702 unsigned rtype = TypeOf (lval2.Type);
1705 /* Second value is constant - check for div */
1708 if (tok == TOK_DIV && lval2.ConstVal == 0) {
1709 Error ("Division by zero");
1710 } else if (tok == TOK_MOD && lval2.ConstVal == 0) {
1711 Error ("Modulo operation with zero");
1713 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1716 ltype |= CF_REG; /* Value is in register */
1720 /* Determine the type of the operation result. */
1721 type |= g_typeadjust (ltype, rtype);
1722 lval->Type = promoteint (lval->Type, lval2.Type);
1725 Gen->Func (type, lval2.ConstVal);
1726 lval->Flags = E_MEXPR;
1729 /* We have a rvalue now */
1738 static int hie_compare (const GenDesc** ops, /* List of generators */
1739 ExprDesc* lval, /* parent expr's lval */
1740 int (*hienext) (ExprDesc*))
1741 /* Helper function for the compare operators */
1748 token_t tok; /* The operator token */
1750 int rconst; /* Operand is a constant */
1755 while ((Gen = FindGen (CurTok.Tok, ops)) != 0) {
1757 /* Remember the operator token, then skip it */
1761 /* Get the lhs on stack */
1762 Mark1 = GetCodePos ();
1763 ltype = TypeOf (lval->Type);
1764 if (k == 0 && lval->Flags == E_MCONST) {
1765 /* Constant value */
1766 Mark2 = GetCodePos ();
1767 g_push (ltype | CF_CONST, lval->ConstVal);
1769 /* Value not constant */
1770 exprhs (CF_NONE, k, lval);
1771 Mark2 = GetCodePos ();
1775 /* Get the right hand side */
1776 rconst = (evalexpr (CF_NONE, hienext, &lval2) == 0);
1778 /* Make sure, the types are compatible */
1779 if (IsClassInt (lval->Type)) {
1780 if (!IsClassInt (lval2.Type) && !(IsClassPtr(lval2.Type) && IsNullPtr(lval))) {
1781 Error ("Incompatible types");
1783 } else if (IsClassPtr (lval->Type)) {
1784 if (IsClassPtr (lval2.Type)) {
1785 /* Both pointers are allowed in comparison if they point to
1786 * the same type, or if one of them is a void pointer.
1788 type* left = Indirect (lval->Type);
1789 type* right = Indirect (lval2.Type);
1790 if (TypeCmp (left, right) < TC_EQUAL && *left != T_VOID && *right != T_VOID) {
1791 /* Incomatible pointers */
1792 Error ("Incompatible types");
1794 } else if (!IsNullPtr (&lval2)) {
1795 Error ("Incompatible types");
1799 /* Check for const operands */
1800 if (k == 0 && lval->Flags == E_MCONST && rconst) {
1802 /* Both operands are constant, remove the generated code */
1806 /* Evaluate the result */
1807 lval->ConstVal = kcalc (tok, lval->ConstVal, lval2.ConstVal);
1811 /* If the right hand side is constant, and the generator function
1812 * expects the lhs in the primary, remove the push of the primary
1818 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1821 ltype |= CF_REG; /* Value is in register */
1825 /* Determine the type of the operation result. If the left
1826 * operand is of type char and the right is a constant, or
1827 * if both operands are of type char, we will encode the
1828 * operation as char operation. Otherwise the default
1829 * promotions are used.
1831 if (IsTypeChar (lval->Type) && (IsTypeChar (lval2.Type) || rconst)) {
1833 if (IsSignUnsigned (lval->Type) || IsSignUnsigned (lval2.Type)) {
1834 flags |= CF_UNSIGNED;
1837 flags |= CF_FORCECHAR;
1840 unsigned rtype = TypeOf (lval2.Type) | (flags & CF_CONST);
1841 flags |= g_typeadjust (ltype, rtype);
1845 Gen->Func (flags, lval2.ConstVal);
1846 lval->Flags = E_MEXPR;
1849 /* Result type is always int */
1850 lval->Type = type_int;
1852 /* We have a rvalue now, condition codes are set */
1862 static int hie9 (ExprDesc *lval)
1863 /* Process * and / operators. */
1865 static const GenDesc* hie9_ops [] = {
1866 &GenMUL, &GenDIV, &GenMOD, 0
1870 return hie_internal (hie9_ops, lval, hie10, &UsedGen);
1875 static void parseadd (int k, ExprDesc* lval)
1876 /* Parse an expression with the binary plus operator. lval contains the
1877 * unprocessed left hand side of the expression and will contain the
1878 * result of the expression on return.
1882 unsigned flags; /* Operation flags */
1883 CodeMark Mark; /* Remember code position */
1884 type* lhst; /* Type of left hand side */
1885 type* rhst; /* Type of right hand side */
1888 /* Skip the PLUS token */
1891 /* Get the left hand side type, initialize operation flags */
1895 /* Check for constness on both sides */
1896 if (k == 0 && (lval->Flags & E_MCONST) != 0) {
1898 /* The left hand side is a constant. Good. Get rhs */
1900 if (k == 0 && lval2.Flags == E_MCONST) {
1902 /* Right hand side is also constant. Get the rhs type */
1905 /* Both expressions are constants. Check for pointer arithmetic */
1906 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
1907 /* Left is pointer, right is int, must scale rhs */
1908 lval->ConstVal += lval2.ConstVal * CheckedPSizeOf (lhst);
1909 /* Result type is a pointer */
1910 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
1911 /* Left is int, right is pointer, must scale lhs */
1912 lval->ConstVal = lval->ConstVal * CheckedPSizeOf (rhst) + lval2.ConstVal;
1913 /* Result type is a pointer */
1914 lval->Type = lval2.Type;
1915 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
1916 /* Integer addition */
1917 lval->ConstVal += lval2.ConstVal;
1918 typeadjust (lval, &lval2, 1);
1921 Error ("Invalid operands for binary operator `+'");
1924 /* Result is constant, condition codes not set */
1925 lval->Test &= ~E_CC;
1929 /* lhs is a constant and rhs is not constant. Load rhs into
1932 exprhs (CF_NONE, k, &lval2);
1934 /* Beware: The check above (for lhs) lets not only pass numeric
1935 * constants, but also constant addresses (labels), maybe even
1936 * with an offset. We have to check for that here.
1939 /* First, get the rhs type. */
1943 if (lval->Flags == E_MCONST) {
1944 /* A numerical constant */
1947 /* Constant address label */
1948 flags |= GlobalModeFlags (lval->Flags) | CF_CONSTADDR;
1951 /* Check for pointer arithmetic */
1952 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
1953 /* Left is pointer, right is int, must scale rhs */
1954 g_scale (CF_INT, CheckedPSizeOf (lhst));
1955 /* Operate on pointers, result type is a pointer */
1957 /* Generate the code for the add */
1958 if (lval->Flags == E_MCONST) {
1959 /* Numeric constant */
1960 g_inc (flags, lval->ConstVal);
1962 /* Constant address */
1963 g_addaddr_static (flags, lval->Name, lval->ConstVal);
1965 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
1967 /* Left is int, right is pointer, must scale lhs. */
1968 unsigned ScaleFactor = CheckedPSizeOf (rhst);
1970 /* Operate on pointers, result type is a pointer */
1972 lval->Type = lval2.Type;
1974 /* Since we do already have rhs in the primary, if lhs is
1975 * not a numeric constant, and the scale factor is not one
1976 * (no scaling), we must take the long way over the stack.
1978 if (lval->Flags == E_MCONST) {
1979 /* Numeric constant, scale lhs */
1980 lval->ConstVal *= ScaleFactor;
1981 /* Generate the code for the add */
1982 g_inc (flags, lval->ConstVal);
1983 } else if (ScaleFactor == 1) {
1984 /* Constant address but no need to scale */
1985 g_addaddr_static (flags, lval->Name, lval->ConstVal);
1987 /* Constant address that must be scaled */
1988 g_push (TypeOf (lval2.Type), 0); /* rhs --> stack */
1989 g_getimmed (flags, lval->Name, lval->ConstVal);
1990 g_scale (CF_PTR, ScaleFactor);
1993 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
1994 /* Integer addition */
1995 flags |= typeadjust (lval, &lval2, 1);
1996 /* Generate the code for the add */
1997 if (lval->Flags == E_MCONST) {
1998 /* Numeric constant */
1999 g_inc (flags, lval->ConstVal);
2001 /* Constant address */
2002 g_addaddr_static (flags, lval->Name, lval->ConstVal);
2006 Error ("Invalid operands for binary operator `+'");
2009 /* Result is in primary register */
2010 lval->Flags = E_MEXPR;
2011 lval->Test &= ~E_CC;
2017 /* Left hand side is not constant. Get the value onto the stack. */
2018 exprhs (CF_NONE, k, lval); /* --> primary register */
2019 Mark = GetCodePos ();
2020 g_push (TypeOf (lval->Type), 0); /* --> stack */
2022 /* Evaluate the rhs */
2023 if (evalexpr (CF_NONE, hie9, &lval2) == 0) {
2025 /* Right hand side is a constant. Get the rhs type */
2028 /* Remove pushed value from stack */
2030 pop (TypeOf (lval->Type));
2032 /* Check for pointer arithmetic */
2033 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2034 /* Left is pointer, right is int, must scale rhs */
2035 lval2.ConstVal *= CheckedPSizeOf (lhst);
2036 /* Operate on pointers, result type is a pointer */
2038 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2039 /* Left is int, right is pointer, must scale lhs (ptr only) */
2040 g_scale (CF_INT | CF_CONST, CheckedPSizeOf (rhst));
2041 /* Operate on pointers, result type is a pointer */
2043 lval->Type = lval2.Type;
2044 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2045 /* Integer addition */
2046 flags = typeadjust (lval, &lval2, 1);
2049 Error ("Invalid operands for binary operator `+'");
2052 /* Generate code for the add */
2053 g_inc (flags | CF_CONST, lval2.ConstVal);
2055 /* Result is in primary register */
2056 lval->Flags = E_MEXPR;
2057 lval->Test &= ~E_CC;
2061 /* lhs and rhs are not constant. Get the rhs type. */
2064 /* Check for pointer arithmetic */
2065 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2066 /* Left is pointer, right is int, must scale rhs */
2067 g_scale (CF_INT, CheckedPSizeOf (lhst));
2068 /* Operate on pointers, result type is a pointer */
2070 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2071 /* Left is int, right is pointer, must scale lhs */
2072 g_tosint (TypeOf (rhst)); /* Make sure, TOS is int */
2073 g_swap (CF_INT); /* Swap TOS and primary */
2074 g_scale (CF_INT, CheckedPSizeOf (rhst));
2075 /* Operate on pointers, result type is a pointer */
2077 lval->Type = lval2.Type;
2078 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2079 /* Integer addition. Note: Result is never constant.
2080 * Problem here is that typeadjust does not know if the
2081 * variable is an rvalue or lvalue, so if both operands
2082 * are dereferenced constant numeric addresses, typeadjust
2083 * thinks the operation works on constants. Removing
2084 * CF_CONST here means handling the symptoms, however, the
2085 * whole parser is such a mess that I fear to break anything
2086 * when trying to apply another solution.
2088 flags = typeadjust (lval, &lval2, 0) & ~CF_CONST;
2091 Error ("Invalid operands for binary operator `+'");
2094 /* Generate code for the add */
2097 /* Result is in primary register */
2098 lval->Flags = E_MEXPR;
2099 lval->Test &= ~E_CC;
2108 static void parsesub (int k, ExprDesc* lval)
2109 /* Parse an expression with the binary minus operator. lval contains the
2110 * unprocessed left hand side of the expression and will contain the
2111 * result of the expression on return.
2115 unsigned flags; /* Operation flags */
2116 type* lhst; /* Type of left hand side */
2117 type* rhst; /* Type of right hand side */
2118 CodeMark Mark1; /* Save position of output queue */
2119 CodeMark Mark2; /* Another position in the queue */
2120 int rscale; /* Scale factor for the result */
2123 /* Skip the MINUS token */
2126 /* Get the left hand side type, initialize operation flags */
2129 rscale = 1; /* Scale by 1, that is, don't scale */
2131 /* Remember the output queue position, then bring the value onto the stack */
2132 Mark1 = GetCodePos ();
2133 exprhs (CF_NONE, k, lval); /* --> primary register */
2134 Mark2 = GetCodePos ();
2135 g_push (TypeOf (lhst), 0); /* --> stack */
2137 /* Parse the right hand side */
2138 if (evalexpr (CF_NONE, hie9, &lval2) == 0) {
2140 /* The right hand side is constant. Get the rhs type. */
2143 /* Check left hand side */
2144 if (k == 0 && (lval->Flags & E_MCONST) != 0) {
2146 /* Both sides are constant, remove generated code */
2148 pop (TypeOf (lhst)); /* Clean up the stack */
2150 /* Check for pointer arithmetic */
2151 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2152 /* Left is pointer, right is int, must scale rhs */
2153 lval->ConstVal -= lval2.ConstVal * CheckedPSizeOf (lhst);
2154 /* Operate on pointers, result type is a pointer */
2155 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2156 /* Left is pointer, right is pointer, must scale result */
2157 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2158 Error ("Incompatible pointer types");
2160 lval->ConstVal = (lval->ConstVal - lval2.ConstVal) /
2161 CheckedPSizeOf (lhst);
2163 /* Operate on pointers, result type is an integer */
2164 lval->Type = type_int;
2165 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2166 /* Integer subtraction */
2167 typeadjust (lval, &lval2, 1);
2168 lval->ConstVal -= lval2.ConstVal;
2171 Error ("Invalid operands for binary operator `-'");
2174 /* Result is constant, condition codes not set */
2175 /* lval->Flags = E_MCONST; ### */
2176 lval->Test &= ~E_CC;
2180 /* Left hand side is not constant, right hand side is.
2181 * Remove pushed value from stack.
2184 pop (TypeOf (lhst));
2186 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2187 /* Left is pointer, right is int, must scale rhs */
2188 lval2.ConstVal *= CheckedPSizeOf (lhst);
2189 /* Operate on pointers, result type is a pointer */
2191 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2192 /* Left is pointer, right is pointer, must scale result */
2193 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2194 Error ("Incompatible pointer types");
2196 rscale = CheckedPSizeOf (lhst);
2198 /* Operate on pointers, result type is an integer */
2200 lval->Type = type_int;
2201 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2202 /* Integer subtraction */
2203 flags = typeadjust (lval, &lval2, 1);
2206 Error ("Invalid operands for binary operator `-'");
2209 /* Do the subtraction */
2210 g_dec (flags | CF_CONST, lval2.ConstVal);
2212 /* If this was a pointer subtraction, we must scale the result */
2214 g_scale (flags, -rscale);
2217 /* Result is in primary register */
2218 lval->Flags = E_MEXPR;
2219 lval->Test &= ~E_CC;
2225 /* Right hand side is not constant. Get the rhs type. */
2228 /* Check for pointer arithmetic */
2229 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2230 /* Left is pointer, right is int, must scale rhs */
2231 g_scale (CF_INT, CheckedPSizeOf (lhst));
2232 /* Operate on pointers, result type is a pointer */
2234 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2235 /* Left is pointer, right is pointer, must scale result */
2236 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2237 Error ("Incompatible pointer types");
2239 rscale = CheckedPSizeOf (lhst);
2241 /* Operate on pointers, result type is an integer */
2243 lval->Type = type_int;
2244 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2245 /* Integer subtraction. If the left hand side descriptor says that
2246 * the lhs is const, we have to remove this mark, since this is no
2247 * longer true, lhs is on stack instead.
2249 if (lval->Flags == E_MCONST) {
2250 lval->Flags = E_MEXPR;
2252 /* Adjust operand types */
2253 flags = typeadjust (lval, &lval2, 0);
2256 Error ("Invalid operands for binary operator `-'");
2259 /* Generate code for the sub (the & is a hack here) */
2260 g_sub (flags & ~CF_CONST, 0);
2262 /* If this was a pointer subtraction, we must scale the result */
2264 g_scale (flags, -rscale);
2267 /* Result is in primary register */
2268 lval->Flags = E_MEXPR;
2269 lval->Test &= ~E_CC;
2275 static int hie8 (ExprDesc* lval)
2276 /* Process + and - binary operators. */
2278 int k = hie9 (lval);
2279 while (CurTok.Tok == TOK_PLUS || CurTok.Tok == TOK_MINUS) {
2281 if (CurTok.Tok == TOK_PLUS) {
2294 static int hie7 (ExprDesc *lval)
2295 /* Parse << and >>. */
2297 static const GenDesc* hie7_ops [] = {
2302 return hie_internal (hie7_ops, lval, hie8, &UsedGen);
2307 static int hie6 (ExprDesc *lval)
2308 /* process greater-than type comparators */
2310 static const GenDesc* hie6_ops [] = {
2311 &GenLT, &GenLE, &GenGE, &GenGT, 0
2313 return hie_compare (hie6_ops, lval, hie7);
2318 static int hie5 (ExprDesc *lval)
2320 static const GenDesc* hie5_ops[] = {
2323 return hie_compare (hie5_ops, lval, hie6);
2328 static int hie4 (ExprDesc* lval)
2329 /* Handle & (bitwise and) */
2331 static const GenDesc* hie4_ops [] = {
2336 return hie_internal (hie4_ops, lval, hie5, &UsedGen);
2341 static int hie3 (ExprDesc *lval)
2342 /* Handle ^ (bitwise exclusive or) */
2344 static const GenDesc* hie3_ops [] = {
2349 return hie_internal (hie3_ops, lval, hie4, &UsedGen);
2354 static int hie2 (ExprDesc *lval)
2355 /* Handle | (bitwise or) */
2357 static const GenDesc* hie2_ops [] = {
2362 return hie_internal (hie2_ops, lval, hie3, &UsedGen);
2367 static int hieAndPP (ExprDesc* lval)
2368 /* Process "exp && exp" in preprocessor mode (that is, when the parser is
2369 * called recursively from the preprocessor.
2374 ConstSubExpr (hie2, lval);
2375 while (CurTok.Tok == TOK_BOOL_AND) {
2377 /* Left hand side must be an int */
2378 if (!IsClassInt (lval->Type)) {
2379 Error ("Left hand side must be of integer type");
2380 MakeConstIntExpr (lval, 1);
2387 ConstSubExpr (hie2, &lval2);
2389 /* Since we are in PP mode, all we know about is integers */
2390 if (!IsClassInt (lval2.Type)) {
2391 Error ("Right hand side must be of integer type");
2392 MakeConstIntExpr (&lval2, 1);
2395 /* Combine the two */
2396 lval->ConstVal = (lval->ConstVal && lval2.ConstVal);
2399 /* Always a rvalue */
2405 static int hieOrPP (ExprDesc *lval)
2406 /* Process "exp || exp" in preprocessor mode (that is, when the parser is
2407 * called recursively from the preprocessor.
2412 ConstSubExpr (hieAndPP, lval);
2413 while (CurTok.Tok == TOK_BOOL_OR) {
2415 /* Left hand side must be an int */
2416 if (!IsClassInt (lval->Type)) {
2417 Error ("Left hand side must be of integer type");
2418 MakeConstIntExpr (lval, 1);
2425 ConstSubExpr (hieAndPP, &lval2);
2427 /* Since we are in PP mode, all we know about is integers */
2428 if (!IsClassInt (lval2.Type)) {
2429 Error ("Right hand side must be of integer type");
2430 MakeConstIntExpr (&lval2, 1);
2433 /* Combine the two */
2434 lval->ConstVal = (lval->ConstVal || lval2.ConstVal);
2437 /* Always a rvalue */
2443 static int hieAnd (ExprDesc* lval, unsigned TrueLab, int* BoolOp)
2444 /* Process "exp && exp" */
2451 if (CurTok.Tok == TOK_BOOL_AND) {
2453 /* Tell our caller that we're evaluating a boolean */
2456 /* Get a label that we will use for false expressions */
2457 lab = GetLocalLabel ();
2459 /* If the expr hasn't set condition codes, set the force-test flag */
2460 if ((lval->Test & E_CC) == 0) {
2461 lval->Test |= E_FORCETEST;
2464 /* Load the value */
2465 exprhs (CF_FORCECHAR, k, lval);
2467 /* Generate the jump */
2468 g_falsejump (CF_NONE, lab);
2470 /* Parse more boolean and's */
2471 while (CurTok.Tok == TOK_BOOL_AND) {
2478 if ((lval2.Test & E_CC) == 0) {
2479 lval2.Test |= E_FORCETEST;
2481 exprhs (CF_FORCECHAR, k, &lval2);
2483 /* Do short circuit evaluation */
2484 if (CurTok.Tok == TOK_BOOL_AND) {
2485 g_falsejump (CF_NONE, lab);
2487 /* Last expression - will evaluate to true */
2488 g_truejump (CF_NONE, TrueLab);
2492 /* Define the false jump label here */
2493 g_defcodelabel (lab);
2495 /* Define the label */
2496 lval->Flags = E_MEXPR;
2497 lval->Test |= E_CC; /* Condition codes are set */
2505 static int hieOr (ExprDesc *lval)
2506 /* Process "exp || exp". */
2510 int BoolOp = 0; /* Did we have a boolean op? */
2511 int AndOp; /* Did we have a && operation? */
2512 unsigned TrueLab; /* Jump to this label if true */
2516 TrueLab = GetLocalLabel ();
2518 /* Call the next level parser */
2519 k = hieAnd (lval, TrueLab, &BoolOp);
2521 /* Any boolean or's? */
2522 if (CurTok.Tok == TOK_BOOL_OR) {
2524 /* If the expr hasn't set condition codes, set the force-test flag */
2525 if ((lval->Test & E_CC) == 0) {
2526 lval->Test |= E_FORCETEST;
2529 /* Get first expr */
2530 exprhs (CF_FORCECHAR, k, lval);
2532 /* For each expression jump to TrueLab if true. Beware: If we
2533 * had && operators, the jump is already in place!
2536 g_truejump (CF_NONE, TrueLab);
2539 /* Remember that we had a boolean op */
2542 /* while there's more expr */
2543 while (CurTok.Tok == TOK_BOOL_OR) {
2550 k = hieAnd (&lval2, TrueLab, &AndOp);
2551 if ((lval2.Test & E_CC) == 0) {
2552 lval2.Test |= E_FORCETEST;
2554 exprhs (CF_FORCECHAR, k, &lval2);
2556 /* If there is more to come, add shortcut boolean eval. */
2557 g_truejump (CF_NONE, TrueLab);
2560 lval->Flags = E_MEXPR;
2561 lval->Test |= E_CC; /* Condition codes are set */
2565 /* If we really had boolean ops, generate the end sequence */
2567 DoneLab = GetLocalLabel ();
2568 g_getimmed (CF_INT | CF_CONST, 0, 0); /* Load FALSE */
2569 g_falsejump (CF_NONE, DoneLab);
2570 g_defcodelabel (TrueLab);
2571 g_getimmed (CF_INT | CF_CONST, 1, 0); /* Load TRUE */
2572 g_defcodelabel (DoneLab);
2579 static int hieQuest (ExprDesc *lval)
2580 /* Parse "lvalue ? exp : exp" */
2585 ExprDesc lval2; /* Expression 2 */
2586 ExprDesc lval3; /* Expression 3 */
2587 type* type2; /* Type of expression 2 */
2588 type* type3; /* Type of expression 3 */
2589 type* rtype; /* Type of result */
2592 k = Preprocessing? hieOrPP (lval) : hieOr (lval);
2593 if (CurTok.Tok == TOK_QUEST) {
2595 if ((lval->Test & E_CC) == 0) {
2596 /* Condition codes not set, force a test */
2597 lval->Test |= E_FORCETEST;
2599 exprhs (CF_NONE, k, lval);
2600 labf = GetLocalLabel ();
2601 g_falsejump (CF_NONE, labf);
2603 /* Parse second expression */
2604 k = expr (hie1, &lval2);
2606 if (!IsTypeVoid (lval2.Type)) {
2607 /* Load it into the primary */
2608 exprhs (CF_NONE, k, &lval2);
2610 labt = GetLocalLabel ();
2614 /* Parse the third expression */
2615 g_defcodelabel (labf);
2616 k = expr (hie1, &lval3);
2618 if (!IsTypeVoid (lval3.Type)) {
2619 /* Load it into the primary */
2620 exprhs (CF_NONE, k, &lval3);
2623 /* Check if any conversions are needed, if so, do them.
2624 * Conversion rules for ?: expression are:
2625 * - if both expressions are int expressions, default promotion
2626 * rules for ints apply.
2627 * - if both expressions are pointers of the same type, the
2628 * result of the expression is of this type.
2629 * - if one of the expressions is a pointer and the other is
2630 * a zero constant, the resulting type is that of the pointer
2632 * - if both expressions are void expressions, the result is of
2634 * - all other cases are flagged by an error.
2636 if (IsClassInt (type2) && IsClassInt (type3)) {
2638 /* Get common type */
2639 rtype = promoteint (type2, type3);
2641 /* Convert the third expression to this type if needed */
2642 g_typecast (TypeOf (rtype), TypeOf (type3));
2644 /* Setup a new label so that the expr3 code will jump around
2645 * the type cast code for expr2.
2647 labf = GetLocalLabel (); /* Get new label */
2648 g_jump (labf); /* Jump around code */
2650 /* The jump for expr2 goes here */
2651 g_defcodelabel (labt);
2653 /* Create the typecast code for expr2 */
2654 g_typecast (TypeOf (rtype), TypeOf (type2));
2656 /* Jump here around the typecase code. */
2657 g_defcodelabel (labf);
2658 labt = 0; /* Mark other label as invalid */
2660 } else if (IsClassPtr (type2) && IsClassPtr (type3)) {
2661 /* Must point to same type */
2662 if (TypeCmp (Indirect (type2), Indirect (type3)) < TC_EQUAL) {
2663 Error ("Incompatible pointer types");
2665 /* Result has the common type */
2667 } else if (IsClassPtr (type2) && IsNullPtr (&lval3)) {
2668 /* Result type is pointer, no cast needed */
2670 } else if (IsNullPtr (&lval2) && IsClassPtr (type3)) {
2671 /* Result type is pointer, no cast needed */
2673 } else if (IsTypeVoid (type2) && IsTypeVoid (type3)) {
2674 /* Result type is void */
2677 Error ("Incompatible types");
2678 rtype = lval2.Type; /* Doesn't matter here */
2681 /* If we don't have the label defined until now, do it */
2683 g_defcodelabel (labt);
2686 /* Setup the target expression */
2687 lval->Flags = E_MEXPR;
2696 static void opeq (const GenDesc* Gen, ExprDesc *lval, int k)
2697 /* Process "op=" operators. */
2706 Error ("Invalid lvalue in assignment");
2710 /* Determine the type of the lhs */
2711 flags = TypeOf (lval->Type);
2712 MustScale = (Gen->Func == g_add || Gen->Func == g_sub) &&
2713 lval->Type [0] == T_PTR;
2715 /* Get the lhs address on stack (if needed) */
2718 /* Fetch the lhs into the primary register if needed */
2719 exprhs (CF_NONE, k, lval);
2721 /* Bring the lhs on stack */
2722 Mark = GetCodePos ();
2725 /* Evaluate the rhs */
2726 if (evalexpr (CF_NONE, hie1, &lval2) == 0) {
2727 /* The resulting value is a constant. If the generator has the NOPUSH
2728 * flag set, don't push the lhs.
2730 if (Gen->Flags & GEN_NOPUSH) {
2735 /* lhs is a pointer, scale rhs */
2736 lval2.ConstVal *= CheckedSizeOf (lval->Type+1);
2739 /* If the lhs is character sized, the operation may be later done
2742 if (CheckedSizeOf (lval->Type) == SIZEOF_CHAR) {
2743 flags |= CF_FORCECHAR;
2746 /* Special handling for add and sub - some sort of a hack, but short code */
2747 if (Gen->Func == g_add) {
2748 g_inc (flags | CF_CONST, lval2.ConstVal);
2749 } else if (Gen->Func == g_sub) {
2750 g_dec (flags | CF_CONST, lval2.ConstVal);
2752 Gen->Func (flags | CF_CONST, lval2.ConstVal);
2755 /* rhs is not constant and already in the primary register */
2757 /* lhs is a pointer, scale rhs */
2758 g_scale (TypeOf (lval2.Type), CheckedSizeOf (lval->Type+1));
2761 /* If the lhs is character sized, the operation may be later done
2764 if (CheckedSizeOf (lval->Type) == SIZEOF_CHAR) {
2765 flags |= CF_FORCECHAR;
2768 /* Adjust the types of the operands if needed */
2769 Gen->Func (g_typeadjust (flags, TypeOf (lval2.Type)), 0);
2772 lval->Flags = E_MEXPR;
2777 static void addsubeq (const GenDesc* Gen, ExprDesc *lval, int k)
2778 /* Process the += and -= operators */
2786 /* We must have an lvalue */
2788 Error ("Invalid lvalue in assignment");
2792 /* We're currently only able to handle some adressing modes */
2793 if ((lval->Flags & E_MGLOBAL) == 0 && /* Global address? */
2794 (lval->Flags & E_MLOCAL) == 0 && /* Local address? */
2795 (lval->Flags & E_MCONST) == 0) { /* Constant address? */
2796 /* Use generic routine */
2797 opeq (Gen, lval, k);
2801 /* Skip the operator */
2804 /* Check if we have a pointer expression and must scale rhs */
2805 MustScale = (lval->Type [0] == T_PTR);
2807 /* Initialize the code generator flags */
2811 /* Evaluate the rhs */
2812 if (evalexpr (CF_NONE, hie1, &lval2) == 0) {
2813 /* The resulting value is a constant. */
2815 /* lhs is a pointer, scale rhs */
2816 lval2.ConstVal *= CheckedSizeOf (lval->Type+1);
2821 /* rhs is not constant and already in the primary register */
2823 /* lhs is a pointer, scale rhs */
2824 g_scale (TypeOf (lval2.Type), CheckedSizeOf (lval->Type+1));
2828 /* Setup the code generator flags */
2829 lflags |= TypeOf (lval->Type) | CF_FORCECHAR;
2830 rflags |= TypeOf (lval2.Type);
2832 /* Cast the rhs to the type of the lhs */
2833 g_typecast (lflags, rflags);
2835 /* Output apropriate code */
2836 if (lval->Flags & E_MGLOBAL) {
2837 /* Static variable */
2838 lflags |= GlobalModeFlags (lval->Flags);
2839 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2840 g_addeqstatic (lflags, lval->Name, lval->ConstVal, lval2.ConstVal);
2842 g_subeqstatic (lflags, lval->Name, lval->ConstVal, lval2.ConstVal);
2844 } else if (lval->Flags & E_MLOCAL) {
2845 /* ref to localvar */
2846 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2847 g_addeqlocal (lflags, lval->ConstVal, lval2.ConstVal);
2849 g_subeqlocal (lflags, lval->ConstVal, lval2.ConstVal);
2851 } else if (lval->Flags & E_MCONST) {
2852 /* ref to absolute address */
2853 lflags |= CF_ABSOLUTE;
2854 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2855 g_addeqstatic (lflags, lval->ConstVal, 0, lval2.ConstVal);
2857 g_subeqstatic (lflags, lval->ConstVal, 0, lval2.ConstVal);
2859 } else if (lval->Flags & E_MEXPR) {
2860 /* Address in a/x. */
2861 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2862 g_addeqind (lflags, lval->ConstVal, lval2.ConstVal);
2864 g_subeqind (lflags, lval->ConstVal, lval2.ConstVal);
2867 Internal ("Invalid addressing mode");
2870 /* Expression is in the primary now */
2871 lval->Flags = E_MEXPR;
2876 int hie1 (ExprDesc* lval)
2877 /* Parse first level of expression hierarchy. */
2881 k = hieQuest (lval);
2882 switch (CurTok.Tok) {
2891 Error ("Invalid lvalue in assignment");
2897 case TOK_PLUS_ASSIGN:
2898 addsubeq (&GenPASGN, lval, k);
2901 case TOK_MINUS_ASSIGN:
2902 addsubeq (&GenSASGN, lval, k);
2905 case TOK_MUL_ASSIGN:
2906 opeq (&GenMASGN, lval, k);
2909 case TOK_DIV_ASSIGN:
2910 opeq (&GenDASGN, lval, k);
2913 case TOK_MOD_ASSIGN:
2914 opeq (&GenMOASGN, lval, k);
2917 case TOK_SHL_ASSIGN:
2918 opeq (&GenSLASGN, lval, k);
2921 case TOK_SHR_ASSIGN:
2922 opeq (&GenSRASGN, lval, k);
2925 case TOK_AND_ASSIGN:
2926 opeq (&GenAASGN, lval, k);
2929 case TOK_XOR_ASSIGN:
2930 opeq (&GenXOASGN, lval, k);
2934 opeq (&GenOASGN, lval, k);
2945 int hie0 (ExprDesc *lval)
2946 /* Parse comma operator. */
2948 int k = hie1 (lval);
2949 while (CurTok.Tok == TOK_COMMA) {
2958 int evalexpr (unsigned flags, int (*f) (ExprDesc*), ExprDesc* lval)
2959 /* Will evaluate an expression via the given function. If the result is a
2960 * constant, 0 is returned and the value is put in the lval struct. If the
2961 * result is not constant, exprhs is called to bring the value into the
2962 * primary register and 1 is returned.
2969 if (k == 0 && lval->Flags == E_MCONST) {
2970 /* Constant expression */
2973 /* Not constant, load into the primary */
2974 exprhs (flags, k, lval);
2981 static int expr (int (*func) (ExprDesc*), ExprDesc *lval)
2982 /* Expression parser; func is either hie0 or hie1. */
2991 /* Do some checks if code generation is still constistent */
2992 if (savsp != oursp) {
2994 fprintf (stderr, "oursp != savesp (%d != %d)\n", oursp, savsp);
2996 Internal ("oursp != savsp (%d != %d)", oursp, savsp);
3004 void expression1 (ExprDesc* lval)
3005 /* Evaluate an expression on level 1 (no comma operator) and put it into
3006 * the primary register
3009 InitExprDesc (lval);
3010 exprhs (CF_NONE, expr (hie1, lval), lval);
3015 void expression (ExprDesc* lval)
3016 /* Evaluate an expression and put it into the primary register */
3018 InitExprDesc (lval);
3019 exprhs (CF_NONE, expr (hie0, lval), lval);
3024 void ConstExpr (ExprDesc* lval)
3025 /* Get a constant value */
3027 InitExprDesc (lval);
3028 if (expr (hie1, lval) != 0 || (lval->Flags & E_MCONST) == 0) {
3029 Error ("Constant expression expected");
3030 /* To avoid any compiler errors, make the expression a valid const */
3031 MakeConstIntExpr (lval, 1);
3037 void ConstIntExpr (ExprDesc* Val)
3038 /* Get a constant int value */
3041 if (expr (hie1, Val) != 0 ||
3042 (Val->Flags & E_MCONST) == 0 ||
3043 !IsClassInt (Val->Type)) {
3044 Error ("Constant integer expression expected");
3045 /* To avoid any compiler errors, make the expression a valid const */
3046 MakeConstIntExpr (Val, 1);
3052 void intexpr (ExprDesc* lval)
3053 /* Get an integer expression */
3056 if (!IsClassInt (lval->Type)) {
3057 Error ("Integer expression expected");
3058 /* To avoid any compiler errors, make the expression a valid int */
3059 MakeConstIntExpr (lval, 1);
3065 void Test (unsigned Label, int Invert)
3066 /* Evaluate a boolean test expression and jump depending on the result of
3067 * the test and on Invert.
3073 /* Evaluate the expression */
3074 k = expr (hie0, InitExprDesc (&lval));
3076 /* Check for a boolean expression */
3077 CheckBoolExpr (&lval);
3079 /* Check for a constant expression */
3080 if (k == 0 && lval.Flags == E_MCONST) {
3082 /* Constant rvalue */
3083 if (!Invert && lval.ConstVal == 0) {
3085 Warning ("Unreachable code");
3086 } else if (Invert && lval.ConstVal != 0) {
3092 /* If the expr hasn't set condition codes, set the force-test flag */
3093 if ((lval.Test & E_CC) == 0) {
3094 lval.Test |= E_FORCETEST;
3097 /* Load the value into the primary register */
3098 exprhs (CF_FORCECHAR, k, &lval);
3100 /* Generate the jump */
3102 g_truejump (CF_NONE, Label);
3104 g_falsejump (CF_NONE, Label);
3111 void TestInParens (unsigned Label, int Invert)
3112 /* Evaluate a boolean test expression in parenthesis and jump depending on
3113 * the result of the test * and on Invert.
3116 /* Eat the parenthesis */
3120 Test (Label, Invert);
3122 /* Check for the closing brace */