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* Expr)
417 /* Put the result of an expression into the primary register */
423 /* Dereferenced lvalue */
424 Flags |= TypeOf (Expr->Type);
425 if (Expr->Test & E_FORCETEST) {
427 Expr->Test &= ~E_FORCETEST;
430 /* Reference to a global variable */
431 Flags |= GlobalModeFlags (f);
432 g_getstatic (Flags, Expr->Name, Expr->ConstVal);
433 } else if (f & E_MLOCAL) {
434 /* Reference to a local variable */
435 g_getlocal (Flags, Expr->ConstVal);
436 } else if (f & E_MCONST) {
437 /* Reference to an absolute address */
438 g_getstatic (Flags | CF_ABSOLUTE, Expr->ConstVal, 0);
439 } else if (f == E_MEOFFS) {
440 /* Reference to address in primary with offset in Expr */
441 g_getind (Flags, Expr->ConstVal);
442 } else if (f != E_MREG) {
443 /* Reference with address in primary */
449 /* reference not storable */
450 Flags |= TypeOf (Expr->Type);
451 g_inc (Flags | CF_CONST, Expr->ConstVal);
452 } else if ((f & E_MEXPR) == 0) {
453 /* Constant of some sort, load it into the primary */
454 LoadConstant (Flags, Expr);
458 /* Are we testing this value? */
459 if (Expr->Test & E_FORCETEST) {
460 /* Yes, force a test */
461 Flags |= TypeOf (Expr->Type);
463 Expr->Test &= ~E_FORCETEST;
469 static unsigned FunctionParamList (FuncDesc* Func)
470 /* Parse a function parameter list and pass the parameters to the called
471 * function. Depending on several criteria this may be done by just pushing
472 * each parameter separately, or creating the parameter frame once and then
473 * storing into this frame.
474 * The function returns the size of the parameters pushed.
479 /* Initialize variables */
480 SymEntry* Param = 0; /* Keep gcc silent */
481 unsigned ParamSize = 0; /* Size of parameters pushed */
482 unsigned ParamCount = 0; /* Number of parameters pushed */
483 unsigned FrameSize = 0; /* Size of parameter frame */
484 unsigned FrameParams = 0; /* Number of params in frame */
485 int FrameOffs = 0; /* Offset into parameter frame */
486 int Ellipsis = 0; /* Function is variadic */
488 /* As an optimization, we may allocate the complete parameter frame at
489 * once instead of pushing each parameter as it comes. We may do that,
492 * - optimizations that increase code size are enabled (allocating the
493 * stack frame at once gives usually larger code).
494 * - we have more than one parameter to push (don't count the last param
495 * for __fastcall__ functions).
497 if (CodeSizeFactor >= 200) {
499 /* Calculate the number and size of the parameters */
500 FrameParams = Func->ParamCount;
501 FrameSize = Func->ParamSize;
502 if (FrameParams > 0 && (Func->Flags & FD_FASTCALL) != 0) {
503 /* Last parameter is not pushed */
504 FrameSize -= CheckedSizeOf (Func->LastParam->Type);
508 /* Do we have more than one parameter in the frame? */
509 if (FrameParams > 1) {
510 /* Okeydokey, setup the frame */
515 /* Don't use a preallocated frame */
520 /* Parse the actual parameter list */
521 while (CurTok.Tok != TOK_RPAREN) {
526 /* Count arguments */
529 /* Fetch the pointer to the next argument, check for too many args */
530 if (ParamCount <= Func->ParamCount) {
531 /* Beware: If there are parameters with identical names, they
532 * cannot go into the same symbol table, which means that in this
533 * case of errorneous input, the number of nodes in the symbol
534 * table and ParamCount are NOT equal. We have to handle this case
535 * below to avoid segmentation violations. Since we know that this
536 * problem can only occur if there is more than one parameter,
537 * we will just use the last one.
539 if (ParamCount == 1) {
541 Param = Func->SymTab->SymHead;
542 } else if (Param->NextSym != 0) {
544 Param = Param->NextSym;
545 CHECK ((Param->Flags & SC_PARAM) != 0);
547 } else if (!Ellipsis) {
548 /* Too many arguments. Do we have an open param list? */
549 if ((Func->Flags & FD_VARIADIC) == 0) {
550 /* End of param list reached, no ellipsis */
551 Error ("Too many arguments in function call");
553 /* Assume an ellipsis even in case of errors to avoid an error
554 * message for each other argument.
559 /* Do some optimization: If we have a constant value to push,
560 * use a special function that may optimize.
563 if (!Ellipsis && CheckedSizeOf (Param->Type) == 1) {
564 CFlags = CF_FORCECHAR;
567 if (evalexpr (CFlags, hie1, &lval) == 0) {
568 /* A constant value */
572 /* If we don't have an argument spec, accept anything, otherwise
573 * convert the actual argument to the type needed.
576 /* Convert the argument to the parameter type if needed */
577 TypeConversion (&lval, 0, Param->Type);
579 /* If we have a prototype, chars may be pushed as chars */
580 Flags |= CF_FORCECHAR;
583 /* Use the type of the argument for the push */
584 Flags |= TypeOf (lval.Type);
586 /* If this is a fastcall function, don't push the last argument */
587 if (ParamCount == Func->ParamCount && (Func->Flags & FD_FASTCALL) != 0) {
588 /* Just load the argument into the primary. This is only needed if
589 * we have a constant argument, otherwise the value is already in
592 if (Flags & CF_CONST) {
593 exprhs (CF_FORCECHAR, 0, &lval);
596 unsigned ArgSize = sizeofarg (Flags);
598 /* We have the space already allocated, store in the frame.
599 * Because of invalid type conversions (that have produced an
600 * error before), we can end up here with a non aligned stack
601 * frame. Since no output will be generated anyway, handle
602 * these cases gracefully instead of doing a CHECK.
604 if (FrameSize >= ArgSize) {
605 FrameSize -= ArgSize;
609 FrameOffs -= ArgSize;
611 g_putlocal (Flags | CF_NOKEEP, FrameOffs, lval.ConstVal);
613 /* Push the argument */
614 g_push (Flags, lval.ConstVal);
617 /* Calculate total parameter size */
618 ParamSize += ArgSize;
621 /* Check for end of argument list */
622 if (CurTok.Tok != TOK_COMMA) {
628 /* Check if we had enough parameters */
629 if (ParamCount < Func->ParamCount) {
630 Error ("Too few arguments in function call");
633 /* The function returns the size of all parameters pushed onto the stack.
634 * However, if there are parameters missing (which is an error and was
635 * flagged by the compiler) AND a stack frame was preallocated above,
636 * we would loose track of the stackpointer and generate an internal error
637 * later. So we correct the value by the parameters that should have been
638 * pushed to avoid an internal compiler error. Since an error was
639 * generated before, no code will be output anyway.
641 return ParamSize + FrameSize;
646 static void FunctionCall (int k, ExprDesc* lval)
647 /* Perform a function call. */
649 FuncDesc* Func; /* Function descriptor */
650 int IsFuncPtr; /* Flag */
651 unsigned ParamSize; /* Number of parameter bytes */
652 CodeMark Mark = 0; /* Initialize to keep gcc silent */
653 int PtrOffs = 0; /* Offset of function pointer on stack */
654 int IsFastCall = 0; /* True if it's a fast call function */
655 int PtrOnStack = 0; /* True if a pointer copy is on stack */
657 /* Get a pointer to the function descriptor from the type string */
658 Func = GetFuncDesc (lval->Type);
660 /* Handle function pointers transparently */
661 IsFuncPtr = IsTypeFuncPtr (lval->Type);
664 /* Check wether it's a fastcall function that has parameters */
665 IsFastCall = IsFastCallFunc (lval->Type + 1) && (Func->ParamCount > 0);
667 /* Things may be difficult, depending on where the function pointer
668 * resides. If the function pointer is an expression of some sort
669 * (not a local or global variable), we have to evaluate this
670 * expression now and save the result for later. Since calls to
671 * function pointers may be nested, we must save it onto the stack.
672 * For fastcall functions we do also need to place a copy of the
673 * pointer on stack, since we cannot use a/x.
675 PtrOnStack = IsFastCall || ((lval->Flags & (E_MGLOBAL | E_MLOCAL)) == 0);
678 /* Not a global or local variable, or a fastcall function. Load
679 * the pointer into the primary and mark it as an expression.
681 exprhs (CF_NONE, k, lval);
682 lval->Flags |= E_MEXPR;
684 /* Remember the code position */
685 Mark = GetCodePos ();
687 /* Push the pointer onto the stack and remember the offset */
692 /* Check for known standard functions and inline them if requested */
693 } else if (InlineStdFuncs && IsStdFunc ((const char*) lval->Name)) {
695 /* Inline this function */
696 HandleStdFunc (Func, lval);
701 /* Parse the parameter list */
702 ParamSize = FunctionParamList (Func);
704 /* We need the closing paren here */
707 /* Special handling for function pointers */
710 /* If the function is not a fastcall function, load the pointer to
711 * the function into the primary.
715 /* Not a fastcall function - we may use the primary */
717 /* If we have no parameters, the pointer is still in the
718 * primary. Remove the code to push it and correct the
721 if (ParamSize == 0) {
726 /* Load from the saved copy */
727 g_getlocal (CF_PTR, PtrOffs);
730 /* Load from original location */
731 exprhs (CF_NONE, k, lval);
734 /* Call the function */
735 g_callind (TypeOf (lval->Type+1), ParamSize, PtrOffs);
739 /* Fastcall function. We cannot use the primary for the function
740 * pointer and must therefore use an offset to the stack location.
741 * Since fastcall functions may never be variadic, we can use the
742 * index register for this purpose.
744 g_callind (CF_LOCAL, ParamSize, PtrOffs);
747 /* If we have a pointer on stack, remove it */
749 g_space (- (int) sizeofarg (CF_PTR));
758 /* Normal function */
759 g_call (TypeOf (lval->Type), (const char*) lval->Name, ParamSize);
766 static int primary (ExprDesc* lval)
767 /* This is the lowest level of the expression parser. */
771 /* Initialize fields in the expression stucture */
772 lval->Test = 0; /* No test */
773 lval->Sym = 0; /* Symbol unknown */
775 /* Character and integer constants. */
776 if (CurTok.Tok == TOK_ICONST || CurTok.Tok == TOK_CCONST) {
777 lval->Flags = E_MCONST | E_TCONST;
778 lval->Type = CurTok.Type;
779 lval->ConstVal = CurTok.IVal;
784 /* Process parenthesized subexpression by calling the whole parser
787 if (CurTok.Tok == TOK_LPAREN) {
789 InitExprDesc (lval); /* Remove any attributes */
795 /* If we run into an identifier in preprocessing mode, we assume that this
796 * is an undefined macro and replace it by a constant value of zero.
798 if (Preprocessing && CurTok.Tok == TOK_IDENT) {
799 MakeConstIntExpr (lval, 0);
803 /* All others may only be used if the expression evaluation is not called
804 * recursively by the preprocessor.
807 /* Illegal expression in PP mode */
808 Error ("Preprocessor expression expected");
809 MakeConstIntExpr (lval, 1);
814 if (CurTok.Tok == TOK_IDENT) {
819 /* Get a pointer to the symbol table entry */
820 Sym = lval->Sym = FindSym (CurTok.Ident);
822 /* Is the symbol known? */
825 /* We found the symbol - skip the name token */
828 /* The expression type is the symbol type */
829 lval->Type = Sym->Type;
831 /* Check for illegal symbol types */
832 CHECK ((Sym->Flags & SC_LABEL) != SC_LABEL);
833 if (Sym->Flags & SC_TYPE) {
834 /* Cannot use type symbols */
835 Error ("Variable identifier expected");
836 /* Assume an int type to make lval valid */
837 lval->Flags = E_MLOCAL | E_TLOFFS;
838 lval->Type = type_int;
843 /* Check for legal symbol types */
844 if ((Sym->Flags & SC_CONST) == SC_CONST) {
845 /* Enum or some other numeric constant */
846 lval->Flags = E_MCONST | E_TCONST;
847 lval->ConstVal = Sym->V.ConstVal;
849 } else if ((Sym->Flags & SC_FUNC) == SC_FUNC) {
851 lval->Flags = E_MGLOBAL | E_MCONST | E_TGLAB;
852 lval->Name = (unsigned long) Sym->Name;
854 } else if ((Sym->Flags & SC_AUTO) == SC_AUTO) {
855 /* Local variable. If this is a parameter for a variadic
856 * function, we have to add some address calculations, and the
857 * address is not const.
859 if ((Sym->Flags & SC_PARAM) == SC_PARAM && F_IsVariadic (CurrentFunc)) {
860 /* Variadic parameter */
861 g_leavariadic (Sym->V.Offs - F_GetParamSize (CurrentFunc));
862 lval->Flags = E_MEXPR;
865 /* Normal parameter */
866 lval->Flags = E_MLOCAL | E_TLOFFS;
867 lval->ConstVal = Sym->V.Offs;
869 } else if ((Sym->Flags & SC_REGISTER) == SC_REGISTER) {
870 /* Register variable, zero page based */
871 lval->Flags = E_MGLOBAL | E_MCONST | E_TREGISTER;
872 lval->Name = Sym->V.R.RegOffs;
874 } else if ((Sym->Flags & SC_STATIC) == SC_STATIC) {
875 /* Static variable */
876 if (Sym->Flags & (SC_EXTERN | SC_STORAGE)) {
877 lval->Flags = E_MGLOBAL | E_MCONST | E_TGLAB;
878 lval->Name = (unsigned long) Sym->Name;
880 lval->Flags = E_MGLOBAL | E_MCONST | E_TLLAB;
881 lval->Name = Sym->V.Label;
885 /* Local static variable */
886 lval->Flags = E_MGLOBAL | E_MCONST | E_TLLAB;
887 lval->Name = Sym->V.Offs;
891 /* The symbol is referenced now */
892 Sym->Flags |= SC_REF;
893 if (IsTypeFunc (lval->Type) || IsTypeArray (lval->Type)) {
899 /* We did not find the symbol. Remember the name, then skip it */
900 strcpy (Ident, CurTok.Ident);
903 /* IDENT is either an auto-declared function or an undefined variable. */
904 if (CurTok.Tok == TOK_LPAREN) {
905 /* Declare a function returning int. For that purpose, prepare a
906 * function signature for a function having an empty param list
909 Warning ("Function call without a prototype");
910 Sym = AddGlobalSym (Ident, GetImplicitFuncType(), SC_EXTERN | SC_REF | SC_FUNC);
911 lval->Type = Sym->Type;
912 lval->Flags = E_MGLOBAL | E_MCONST | E_TGLAB;
913 lval->Name = (unsigned long) Sym->Name;
919 /* Undeclared Variable */
920 Sym = AddLocalSym (Ident, type_int, SC_AUTO | SC_REF, 0);
921 lval->Flags = E_MLOCAL | E_TLOFFS;
922 lval->Type = type_int;
924 Error ("Undefined symbol: `%s'", Ident);
930 /* String literal? */
931 if (CurTok.Tok == TOK_SCONST) {
932 lval->Flags = E_MCONST | E_TLIT;
933 lval->ConstVal = CurTok.IVal;
934 lval->Type = GetCharArrayType (GetLiteralPoolOffs () - CurTok.IVal);
940 if (CurTok.Tok == TOK_ASM) {
942 lval->Type = type_void;
943 lval->Flags = E_MEXPR;
948 /* __AX__ and __EAX__ pseudo values? */
949 if (CurTok.Tok == TOK_AX || CurTok.Tok == TOK_EAX) {
950 lval->Type = (CurTok.Tok == TOK_AX)? type_uint : type_ulong;
951 lval->Flags = E_MREG;
955 return 1; /* May be used as lvalue */
958 /* Illegal primary. */
959 Error ("Expression expected");
960 MakeConstIntExpr (lval, 1);
966 static int arrayref (int k, ExprDesc* lval)
967 /* Handle an array reference */
981 /* Skip the bracket */
984 /* Get the type of left side */
987 /* We can apply a special treatment for arrays that have a const base
988 * address. This is true for most arrays and will produce a lot better
989 * code. Check if this is a const base address.
991 lflags = lval->Flags & ~E_MCTYPE;
992 ConstBaseAddr = (lflags == E_MCONST) || /* Constant numeric address */
993 (lflags & E_MGLOBAL) != 0 || /* Static array, or ... */
994 lflags == E_MLOCAL; /* Local array */
996 /* If we have a constant base, we delay the address fetch */
997 Mark1 = GetCodePos ();
998 Mark2 = 0; /* Silence gcc */
999 if (!ConstBaseAddr) {
1000 /* Get a pointer to the array into the primary */
1001 exprhs (CF_NONE, k, lval);
1003 /* Get the array pointer on stack. Do not push more than 16
1004 * bit, even if this value is greater, since we cannot handle
1005 * other than 16bit stuff when doing indexing.
1007 Mark2 = GetCodePos ();
1011 /* TOS now contains ptr to array elements. Get the subscript. */
1013 if (l == 0 && lval2.Flags == E_MCONST) {
1015 /* The array subscript is a constant - remove value from stack */
1016 if (!ConstBaseAddr) {
1020 /* Get an array pointer into the primary */
1021 exprhs (CF_NONE, k, lval);
1024 if (IsClassPtr (tptr1)) {
1026 /* Scale the subscript value according to element size */
1027 lval2.ConstVal *= CheckedPSizeOf (tptr1);
1029 /* Remove code for lhs load */
1032 /* Handle constant base array on stack. Be sure NOT to
1033 * handle pointers the same way, and check for character literals
1034 * (both won't work).
1036 if (IsTypeArray (tptr1) && lval->Flags != (E_MCONST | E_TLIT) &&
1037 ((lval->Flags & ~E_MCTYPE) == E_MCONST ||
1038 (lval->Flags & ~E_MCTYPE) == E_MLOCAL ||
1039 (lval->Flags & E_MGLOBAL) != 0 ||
1040 (lval->Flags == E_MEOFFS))) {
1041 lval->ConstVal += lval2.ConstVal;
1044 /* Pointer - load into primary and remember offset */
1045 if ((lval->Flags & E_MEXPR) == 0 || k != 0) {
1046 exprhs (CF_NONE, k, lval);
1048 lval->ConstVal = lval2.ConstVal;
1049 lval->Flags = E_MEOFFS;
1052 /* Result is of element type */
1053 lval->Type = Indirect (tptr1);
1058 } else if (IsClassPtr (tptr2 = lval2.Type)) {
1059 /* Subscript is pointer, get element type */
1060 lval2.Type = Indirect (tptr2);
1062 /* Scale the rhs value in the primary register */
1063 g_scale (TypeOf (tptr1), CheckedSizeOf (lval2.Type));
1065 lval->Type = lval2.Type;
1067 Error ("Cannot subscript");
1070 /* Add the subscript. Since arrays are indexed by integers,
1071 * we will ignore the true type of the subscript here and
1072 * use always an int.
1074 g_inc (CF_INT | CF_CONST, lval2.ConstVal);
1078 /* Array subscript is not constant. Load it into the primary */
1079 Mark2 = GetCodePos ();
1080 exprhs (CF_NONE, l, &lval2);
1083 if (IsClassPtr (tptr1)) {
1085 /* Get the element type */
1086 lval->Type = Indirect (tptr1);
1088 /* Indexing is based on int's, so we will just use the integer
1089 * portion of the index (which is in (e)ax, so there's no further
1092 g_scale (CF_INT, CheckedSizeOf (lval->Type));
1094 } else if (IsClassPtr (tptr2)) {
1096 /* Get the element type */
1097 lval2.Type = Indirect (tptr2);
1099 /* Get the int value on top. If we go here, we're sure,
1100 * both values are 16 bit (the first one was truncated
1101 * if necessary and the second one is a pointer).
1102 * Note: If ConstBaseAddr is true, we don't have a value on
1103 * stack, so to "swap" both, just push the subscript.
1105 if (ConstBaseAddr) {
1107 exprhs (CF_NONE, k, lval);
1114 g_scale (TypeOf (tptr1), CheckedSizeOf (lval2.Type));
1115 lval->Type = lval2.Type;
1117 Error ("Cannot subscript");
1120 /* The offset is now in the primary register. It didn't have a
1121 * constant base address for the lhs, the lhs address is already
1122 * on stack, and we must add the offset. If the base address was
1123 * constant, we call special functions to add the address to the
1126 if (!ConstBaseAddr) {
1127 /* Add the subscript. Both values are int sized. */
1131 /* If the subscript has itself a constant address, it is often
1132 * a better idea to reverse again the order of the evaluation.
1133 * This will generate better code if the subscript is a byte
1134 * sized variable. But beware: This is only possible if the
1135 * subscript was not scaled, that is, if this was a byte array
1138 rflags = lval2.Flags & ~E_MCTYPE;
1139 ConstSubAddr = (rflags == E_MCONST) || /* Constant numeric address */
1140 (rflags & E_MGLOBAL) != 0 || /* Static array, or ... */
1141 rflags == E_MLOCAL; /* Local array */
1143 if (ConstSubAddr && CheckedSizeOf (lval->Type) == SIZEOF_CHAR) {
1147 /* Reverse the order of evaluation */
1148 unsigned flags = (CheckedSizeOf (lval2.Type) == SIZEOF_CHAR)? CF_CHAR : CF_INT;
1151 /* Get a pointer to the array into the primary. We have changed
1152 * Type above but we need the original type to load the
1153 * address, so restore it temporarily.
1155 SavedType = lval->Type;
1157 exprhs (CF_NONE, k, lval);
1158 lval->Type = SavedType;
1160 /* Add the variable */
1161 if (rflags == E_MLOCAL) {
1162 g_addlocal (flags, lval2.ConstVal);
1164 flags |= GlobalModeFlags (lval2.Flags);
1165 g_addstatic (flags, lval2.Name, lval2.ConstVal);
1168 if (lflags == E_MCONST) {
1169 /* Constant numeric address. Just add it */
1170 g_inc (CF_INT | CF_UNSIGNED, lval->ConstVal);
1171 } else if (lflags == E_MLOCAL) {
1172 /* Base address is a local variable address */
1173 if (IsTypeArray (tptr1)) {
1174 g_addaddr_local (CF_INT, lval->ConstVal);
1176 g_addlocal (CF_PTR, lval->ConstVal);
1179 /* Base address is a static variable address */
1180 unsigned flags = CF_INT;
1181 flags |= GlobalModeFlags (lval->Flags);
1182 if (IsTypeArray (tptr1)) {
1183 g_addaddr_static (flags, lval->Name, lval->ConstVal);
1185 g_addstatic (flags, lval->Name, lval->ConstVal);
1191 lval->Flags = E_MEXPR;
1194 return !IsTypeArray (lval->Type);
1200 static int structref (int k, ExprDesc* lval)
1201 /* Process struct field after . or ->. */
1207 /* Skip the token and check for an identifier */
1209 if (CurTok.Tok != TOK_IDENT) {
1210 Error ("Identifier expected");
1211 lval->Type = type_int;
1215 /* Get the symbol table entry and check for a struct field */
1216 strcpy (Ident, CurTok.Ident);
1218 Field = FindStructField (lval->Type, Ident);
1220 Error ("Struct/union has no field named `%s'", Ident);
1221 lval->Type = type_int;
1225 /* If we have constant input data, the result is also constant */
1226 flags = lval->Flags & ~E_MCTYPE;
1227 if (flags == E_MCONST ||
1228 (k == 0 && (flags == E_MLOCAL ||
1229 (flags & E_MGLOBAL) != 0 ||
1230 lval->Flags == E_MEOFFS))) {
1231 lval->ConstVal += Field->V.Offs;
1233 if ((flags & E_MEXPR) == 0 || k != 0) {
1234 exprhs (CF_NONE, k, lval);
1236 lval->ConstVal = Field->V.Offs;
1237 lval->Flags = E_MEOFFS;
1239 lval->Type = Field->Type;
1240 return !IsTypeArray (Field->Type);
1245 static int hie11 (ExprDesc *lval)
1246 /* Handle compound types (structs and arrays) */
1253 if (CurTok.Tok < TOK_LBRACK || CurTok.Tok > TOK_PTR_REF) {
1260 if (CurTok.Tok == TOK_LBRACK) {
1262 /* Array reference */
1263 k = arrayref (k, lval);
1265 } else if (CurTok.Tok == TOK_LPAREN) {
1267 /* Function call. Skip the opening parenthesis */
1270 if (IsTypeFunc (lval->Type) || IsTypeFuncPtr (lval->Type)) {
1272 /* Call the function */
1273 FunctionCall (k, lval);
1275 /* Result is in the primary register */
1276 lval->Flags = E_MEXPR;
1279 lval->Type = GetFuncReturn (lval->Type);
1282 Error ("Illegal function call");
1286 } else if (CurTok.Tok == TOK_DOT) {
1288 if (!IsClassStruct (lval->Type)) {
1289 Error ("Struct expected");
1291 k = structref (0, lval);
1293 } else if (CurTok.Tok == TOK_PTR_REF) {
1296 if (tptr[0] != T_PTR || (tptr[1] & T_STRUCT) == 0) {
1297 Error ("Struct pointer expected");
1299 k = structref (k, lval);
1309 void Store (ExprDesc* lval, const type* StoreType)
1310 /* Store the primary register into the location denoted by lval. If StoreType
1311 * is given, use this type when storing instead of lval->Type. If StoreType
1312 * is NULL, use lval->Type instead.
1317 unsigned f = lval->Flags;
1319 /* If StoreType was not given, use lval->Type instead */
1320 if (StoreType == 0) {
1321 StoreType = lval->Type;
1324 /* Get the code generator flags */
1325 Flags = TypeOf (StoreType);
1326 if (f & E_MGLOBAL) {
1327 Flags |= GlobalModeFlags (f);
1334 g_putstatic (Flags, lval->Name, lval->ConstVal);
1336 } else if (f & E_MLOCAL) {
1337 /* Store an auto variable */
1338 g_putlocal (Flags, lval->ConstVal, 0);
1339 } else if (f == E_MEOFFS) {
1340 /* Store indirect with offset */
1341 g_putind (Flags, lval->ConstVal);
1342 } else if (f != E_MREG) {
1344 /* Indirect without offset */
1345 g_putind (Flags, 0);
1347 /* Store into absolute address */
1348 g_putstatic (Flags | CF_ABSOLUTE, lval->ConstVal, 0);
1352 /* Assume that each one of the stores will invalidate CC */
1353 lval->Test &= ~E_CC;
1358 static void pre_incdec (ExprDesc* lval, void (*inc) (unsigned, unsigned long))
1359 /* Handle --i and ++i */
1366 if ((k = hie10 (lval)) == 0) {
1367 Error ("Invalid lvalue");
1371 /* Get the data type */
1372 flags = TypeOf (lval->Type) | CF_FORCECHAR | CF_CONST;
1374 /* Get the increment value in bytes */
1375 val = (lval->Type [0] == T_PTR)? CheckedPSizeOf (lval->Type) : 1;
1377 /* We're currently only able to handle some adressing modes */
1378 if ((lval->Flags & E_MGLOBAL) == 0 && /* Global address? */
1379 (lval->Flags & E_MLOCAL) == 0 && /* Local address? */
1380 (lval->Flags & E_MCONST) == 0 && /* Constant address? */
1381 (lval->Flags & E_MEXPR) == 0) { /* Address in a/x? */
1383 /* Use generic code. Push the address if needed */
1386 /* Fetch the value */
1387 exprhs (CF_NONE, k, lval);
1389 /* Increment value in primary */
1392 /* Store the result back */
1397 /* Special code for some addressing modes - use the special += ops */
1398 if (lval->Flags & E_MGLOBAL) {
1399 flags |= GlobalModeFlags (lval->Flags);
1401 g_addeqstatic (flags, lval->Name, lval->ConstVal, val);
1403 g_subeqstatic (flags, lval->Name, lval->ConstVal, val);
1405 } else if (lval->Flags & E_MLOCAL) {
1406 /* ref to localvar */
1408 g_addeqlocal (flags, lval->ConstVal, val);
1410 g_subeqlocal (flags, lval->ConstVal, val);
1412 } else if (lval->Flags & E_MCONST) {
1413 /* ref to absolute address */
1414 flags |= CF_ABSOLUTE;
1416 g_addeqstatic (flags, lval->ConstVal, 0, val);
1418 g_subeqstatic (flags, lval->ConstVal, 0, val);
1420 } else if (lval->Flags & E_MEXPR) {
1421 /* Address in a/x, check if we have an offset */
1422 unsigned Offs = (lval->Flags == E_MEOFFS)? lval->ConstVal : 0;
1424 g_addeqind (flags, Offs, val);
1426 g_subeqind (flags, Offs, val);
1429 Internal ("Invalid addressing mode");
1434 /* Result is an expression */
1435 lval->Flags = E_MEXPR;
1440 static void post_incdec (ExprDesc* lval, int k, void (*inc) (unsigned, unsigned long))
1441 /* Handle i-- and i++ */
1447 Error ("Invalid lvalue");
1451 /* Get the data type */
1452 flags = TypeOf (lval->Type);
1454 /* Push the address if needed */
1457 /* Fetch the value and save it (since it's the result of the expression) */
1458 exprhs (CF_NONE, 1, lval);
1459 g_save (flags | CF_FORCECHAR);
1461 /* If we have a pointer expression, increment by the size of the type */
1462 if (lval->Type[0] == T_PTR) {
1463 inc (flags | CF_CONST | CF_FORCECHAR, CheckedSizeOf (lval->Type + 1));
1465 inc (flags | CF_CONST | CF_FORCECHAR, 1);
1468 /* Store the result back */
1471 /* Restore the original value */
1472 g_restore (flags | CF_FORCECHAR);
1473 lval->Flags = E_MEXPR;
1478 static void unaryop (int tok, ExprDesc* lval)
1479 /* Handle unary -/+ and ~ */
1486 if (k == 0 && (lval->Flags & E_MCONST) != 0) {
1487 /* Value is constant */
1489 case TOK_MINUS: lval->ConstVal = -lval->ConstVal; break;
1490 case TOK_PLUS: break;
1491 case TOK_COMP: lval->ConstVal = ~lval->ConstVal; break;
1492 default: Internal ("Unexpected token: %d", tok);
1495 /* Value is not constant */
1496 exprhs (CF_NONE, k, lval);
1498 /* Get the type of the expression */
1499 flags = TypeOf (lval->Type);
1501 /* Handle the operation */
1503 case TOK_MINUS: g_neg (flags); break;
1504 case TOK_PLUS: break;
1505 case TOK_COMP: g_com (flags); break;
1506 default: Internal ("Unexpected token: %d", tok);
1508 lval->Flags = E_MEXPR;
1514 int hie10 (ExprDesc* lval)
1515 /* Handle ++, --, !, unary - etc. */
1520 switch (CurTok.Tok) {
1523 pre_incdec (lval, g_inc);
1527 pre_incdec (lval, g_dec);
1533 unaryop (CurTok.Tok, lval);
1538 if (evalexpr (CF_NONE, hie10, lval) == 0) {
1539 /* Constant expression */
1540 lval->ConstVal = !lval->ConstVal;
1542 g_bneg (TypeOf (lval->Type));
1543 lval->Test |= E_CC; /* bneg will set cc */
1544 lval->Flags = E_MEXPR; /* say it's an expr */
1546 return 0; /* expr not storable */
1550 if (evalexpr (CF_NONE, hie10, lval) != 0) {
1551 /* Expression is not const, indirect value loaded into primary */
1552 lval->Flags = E_MEXPR;
1553 lval->ConstVal = 0; /* Offset is zero now */
1555 /* If the expression is already a pointer to function, the
1556 * additional dereferencing operator must be ignored.
1558 if (IsTypeFuncPtr (lval->Type)) {
1559 /* Expression not storable */
1562 if (IsClassPtr (lval->Type)) {
1563 lval->Type = Indirect (lval->Type);
1565 Error ("Illegal indirection");
1574 /* The & operator may be applied to any lvalue, and it may be
1575 * applied to functions, even if they're no lvalues.
1577 if (k == 0 && !IsTypeFunc (lval->Type)) {
1578 /* Allow the & operator with an array */
1579 if (!IsTypeArray (lval->Type)) {
1580 Error ("Illegal address");
1583 t = TypeAlloc (TypeLen (lval->Type) + 2);
1585 TypeCpy (t + 1, lval->Type);
1592 if (istypeexpr ()) {
1593 type Type[MAXTYPELEN];
1595 lval->ConstVal = CheckedSizeOf (ParseType (Type));
1598 /* Remember the output queue pointer */
1599 CodeMark Mark = GetCodePos ();
1601 lval->ConstVal = CheckedSizeOf (lval->Type);
1602 /* Remove any generated code */
1605 lval->Flags = E_MCONST | E_TCONST;
1606 lval->Type = type_uint;
1607 lval->Test &= ~E_CC;
1611 if (istypeexpr ()) {
1613 return TypeCast (lval);
1618 switch (CurTok.Tok) {
1620 post_incdec (lval, k, g_inc);
1624 post_incdec (lval, k, g_dec);
1634 static int hie_internal (const GenDesc** ops, /* List of generators */
1635 ExprDesc* lval, /* parent expr's lval */
1636 int (*hienext) (ExprDesc*),
1637 int* UsedGen) /* next higher level */
1638 /* Helper function */
1645 token_t tok; /* The operator token */
1646 unsigned ltype, type;
1647 int rconst; /* Operand is a constant */
1653 while ((Gen = FindGen (CurTok.Tok, ops)) != 0) {
1655 /* Tell the caller that we handled it's ops */
1658 /* All operators that call this function expect an int on the lhs */
1659 if (!IsClassInt (lval->Type)) {
1660 Error ("Integer expression expected");
1663 /* Remember the operator token, then skip it */
1667 /* Get the lhs on stack */
1668 Mark1 = GetCodePos ();
1669 ltype = TypeOf (lval->Type);
1670 if (k == 0 && lval->Flags == E_MCONST) {
1671 /* Constant value */
1672 Mark2 = GetCodePos ();
1673 g_push (ltype | CF_CONST, lval->ConstVal);
1675 /* Value not constant */
1676 exprhs (CF_NONE, k, lval);
1677 Mark2 = GetCodePos ();
1681 /* Get the right hand side */
1682 rconst = (evalexpr (CF_NONE, hienext, &lval2) == 0);
1684 /* Check the type of the rhs */
1685 if (!IsClassInt (lval2.Type)) {
1686 Error ("Integer expression expected");
1689 /* Check for const operands */
1690 if (k == 0 && lval->Flags == E_MCONST && rconst) {
1692 /* Both operands are constant, remove the generated code */
1696 /* Evaluate the result */
1697 lval->ConstVal = kcalc (tok, lval->ConstVal, lval2.ConstVal);
1699 /* Get the type of the result */
1700 lval->Type = promoteint (lval->Type, lval2.Type);
1704 /* If the right hand side is constant, and the generator function
1705 * expects the lhs in the primary, remove the push of the primary
1708 unsigned rtype = TypeOf (lval2.Type);
1711 /* Second value is constant - check for div */
1714 if (tok == TOK_DIV && lval2.ConstVal == 0) {
1715 Error ("Division by zero");
1716 } else if (tok == TOK_MOD && lval2.ConstVal == 0) {
1717 Error ("Modulo operation with zero");
1719 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1722 ltype |= CF_REG; /* Value is in register */
1726 /* Determine the type of the operation result. */
1727 type |= g_typeadjust (ltype, rtype);
1728 lval->Type = promoteint (lval->Type, lval2.Type);
1731 Gen->Func (type, lval2.ConstVal);
1732 lval->Flags = E_MEXPR;
1735 /* We have a rvalue now */
1744 static int hie_compare (const GenDesc** ops, /* List of generators */
1745 ExprDesc* lval, /* parent expr's lval */
1746 int (*hienext) (ExprDesc*))
1747 /* Helper function for the compare operators */
1754 token_t tok; /* The operator token */
1756 int rconst; /* Operand is a constant */
1761 while ((Gen = FindGen (CurTok.Tok, ops)) != 0) {
1763 /* Remember the operator token, then skip it */
1767 /* Get the lhs on stack */
1768 Mark1 = GetCodePos ();
1769 ltype = TypeOf (lval->Type);
1770 if (k == 0 && lval->Flags == E_MCONST) {
1771 /* Constant value */
1772 Mark2 = GetCodePos ();
1773 g_push (ltype | CF_CONST, lval->ConstVal);
1775 /* Value not constant */
1776 exprhs (CF_NONE, k, lval);
1777 Mark2 = GetCodePos ();
1781 /* Get the right hand side */
1782 rconst = (evalexpr (CF_NONE, hienext, &lval2) == 0);
1784 /* Make sure, the types are compatible */
1785 if (IsClassInt (lval->Type)) {
1786 if (!IsClassInt (lval2.Type) && !(IsClassPtr(lval2.Type) && IsNullPtr(lval))) {
1787 Error ("Incompatible types");
1789 } else if (IsClassPtr (lval->Type)) {
1790 if (IsClassPtr (lval2.Type)) {
1791 /* Both pointers are allowed in comparison if they point to
1792 * the same type, or if one of them is a void pointer.
1794 type* left = Indirect (lval->Type);
1795 type* right = Indirect (lval2.Type);
1796 if (TypeCmp (left, right) < TC_EQUAL && *left != T_VOID && *right != T_VOID) {
1797 /* Incomatible pointers */
1798 Error ("Incompatible types");
1800 } else if (!IsNullPtr (&lval2)) {
1801 Error ("Incompatible types");
1805 /* Check for const operands */
1806 if (k == 0 && lval->Flags == E_MCONST && rconst) {
1808 /* Both operands are constant, remove the generated code */
1812 /* Evaluate the result */
1813 lval->ConstVal = kcalc (tok, lval->ConstVal, lval2.ConstVal);
1817 /* If the right hand side is constant, and the generator function
1818 * expects the lhs in the primary, remove the push of the primary
1824 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1827 ltype |= CF_REG; /* Value is in register */
1831 /* Determine the type of the operation result. If the left
1832 * operand is of type char and the right is a constant, or
1833 * if both operands are of type char, we will encode the
1834 * operation as char operation. Otherwise the default
1835 * promotions are used.
1837 if (IsTypeChar (lval->Type) && (IsTypeChar (lval2.Type) || rconst)) {
1839 if (IsSignUnsigned (lval->Type) || IsSignUnsigned (lval2.Type)) {
1840 flags |= CF_UNSIGNED;
1843 flags |= CF_FORCECHAR;
1846 unsigned rtype = TypeOf (lval2.Type) | (flags & CF_CONST);
1847 flags |= g_typeadjust (ltype, rtype);
1851 Gen->Func (flags, lval2.ConstVal);
1852 lval->Flags = E_MEXPR;
1855 /* Result type is always int */
1856 lval->Type = type_int;
1858 /* We have a rvalue now, condition codes are set */
1868 static int hie9 (ExprDesc *lval)
1869 /* Process * and / operators. */
1871 static const GenDesc* hie9_ops [] = {
1872 &GenMUL, &GenDIV, &GenMOD, 0
1876 return hie_internal (hie9_ops, lval, hie10, &UsedGen);
1881 static void parseadd (int k, ExprDesc* lval)
1882 /* Parse an expression with the binary plus operator. lval contains the
1883 * unprocessed left hand side of the expression and will contain the
1884 * result of the expression on return.
1888 unsigned flags; /* Operation flags */
1889 CodeMark Mark; /* Remember code position */
1890 type* lhst; /* Type of left hand side */
1891 type* rhst; /* Type of right hand side */
1894 /* Skip the PLUS token */
1897 /* Get the left hand side type, initialize operation flags */
1901 /* Check for constness on both sides */
1902 if (k == 0 && (lval->Flags & E_MCONST) != 0) {
1904 /* The left hand side is a constant. Good. Get rhs */
1906 if (k == 0 && lval2.Flags == E_MCONST) {
1908 /* Right hand side is also constant. Get the rhs type */
1911 /* Both expressions are constants. Check for pointer arithmetic */
1912 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
1913 /* Left is pointer, right is int, must scale rhs */
1914 lval->ConstVal += lval2.ConstVal * CheckedPSizeOf (lhst);
1915 /* Result type is a pointer */
1916 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
1917 /* Left is int, right is pointer, must scale lhs */
1918 lval->ConstVal = lval->ConstVal * CheckedPSizeOf (rhst) + lval2.ConstVal;
1919 /* Result type is a pointer */
1920 lval->Type = lval2.Type;
1921 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
1922 /* Integer addition */
1923 lval->ConstVal += lval2.ConstVal;
1924 typeadjust (lval, &lval2, 1);
1927 Error ("Invalid operands for binary operator `+'");
1930 /* Result is constant, condition codes not set */
1931 lval->Test &= ~E_CC;
1935 /* lhs is a constant and rhs is not constant. Load rhs into
1938 exprhs (CF_NONE, k, &lval2);
1940 /* Beware: The check above (for lhs) lets not only pass numeric
1941 * constants, but also constant addresses (labels), maybe even
1942 * with an offset. We have to check for that here.
1945 /* First, get the rhs type. */
1949 if (lval->Flags == E_MCONST) {
1950 /* A numerical constant */
1953 /* Constant address label */
1954 flags |= GlobalModeFlags (lval->Flags) | CF_CONSTADDR;
1957 /* Check for pointer arithmetic */
1958 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
1959 /* Left is pointer, right is int, must scale rhs */
1960 g_scale (CF_INT, CheckedPSizeOf (lhst));
1961 /* Operate on pointers, result type is a pointer */
1963 /* Generate the code for the add */
1964 if (lval->Flags == E_MCONST) {
1965 /* Numeric constant */
1966 g_inc (flags, lval->ConstVal);
1968 /* Constant address */
1969 g_addaddr_static (flags, lval->Name, lval->ConstVal);
1971 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
1973 /* Left is int, right is pointer, must scale lhs. */
1974 unsigned ScaleFactor = CheckedPSizeOf (rhst);
1976 /* Operate on pointers, result type is a pointer */
1978 lval->Type = lval2.Type;
1980 /* Since we do already have rhs in the primary, if lhs is
1981 * not a numeric constant, and the scale factor is not one
1982 * (no scaling), we must take the long way over the stack.
1984 if (lval->Flags == E_MCONST) {
1985 /* Numeric constant, scale lhs */
1986 lval->ConstVal *= ScaleFactor;
1987 /* Generate the code for the add */
1988 g_inc (flags, lval->ConstVal);
1989 } else if (ScaleFactor == 1) {
1990 /* Constant address but no need to scale */
1991 g_addaddr_static (flags, lval->Name, lval->ConstVal);
1993 /* Constant address that must be scaled */
1994 g_push (TypeOf (lval2.Type), 0); /* rhs --> stack */
1995 g_getimmed (flags, lval->Name, lval->ConstVal);
1996 g_scale (CF_PTR, ScaleFactor);
1999 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2000 /* Integer addition */
2001 flags |= typeadjust (lval, &lval2, 1);
2002 /* Generate the code for the add */
2003 if (lval->Flags == E_MCONST) {
2004 /* Numeric constant */
2005 g_inc (flags, lval->ConstVal);
2007 /* Constant address */
2008 g_addaddr_static (flags, lval->Name, lval->ConstVal);
2012 Error ("Invalid operands for binary operator `+'");
2015 /* Result is in primary register */
2016 lval->Flags = E_MEXPR;
2017 lval->Test &= ~E_CC;
2023 /* Left hand side is not constant. Get the value onto the stack. */
2024 exprhs (CF_NONE, k, lval); /* --> primary register */
2025 Mark = GetCodePos ();
2026 g_push (TypeOf (lval->Type), 0); /* --> stack */
2028 /* Evaluate the rhs */
2029 if (evalexpr (CF_NONE, hie9, &lval2) == 0) {
2031 /* Right hand side is a constant. Get the rhs type */
2034 /* Remove pushed value from stack */
2036 pop (TypeOf (lval->Type));
2038 /* Check for pointer arithmetic */
2039 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2040 /* Left is pointer, right is int, must scale rhs */
2041 lval2.ConstVal *= CheckedPSizeOf (lhst);
2042 /* Operate on pointers, result type is a pointer */
2044 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2045 /* Left is int, right is pointer, must scale lhs (ptr only) */
2046 g_scale (CF_INT | CF_CONST, CheckedPSizeOf (rhst));
2047 /* Operate on pointers, result type is a pointer */
2049 lval->Type = lval2.Type;
2050 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2051 /* Integer addition */
2052 flags = typeadjust (lval, &lval2, 1);
2055 Error ("Invalid operands for binary operator `+'");
2058 /* Generate code for the add */
2059 g_inc (flags | CF_CONST, lval2.ConstVal);
2061 /* Result is in primary register */
2062 lval->Flags = E_MEXPR;
2063 lval->Test &= ~E_CC;
2067 /* lhs and rhs are not constant. Get the rhs type. */
2070 /* Check for pointer arithmetic */
2071 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2072 /* Left is pointer, right is int, must scale rhs */
2073 g_scale (CF_INT, CheckedPSizeOf (lhst));
2074 /* Operate on pointers, result type is a pointer */
2076 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2077 /* Left is int, right is pointer, must scale lhs */
2078 g_tosint (TypeOf (rhst)); /* Make sure, TOS is int */
2079 g_swap (CF_INT); /* Swap TOS and primary */
2080 g_scale (CF_INT, CheckedPSizeOf (rhst));
2081 /* Operate on pointers, result type is a pointer */
2083 lval->Type = lval2.Type;
2084 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2085 /* Integer addition. Note: Result is never constant.
2086 * Problem here is that typeadjust does not know if the
2087 * variable is an rvalue or lvalue, so if both operands
2088 * are dereferenced constant numeric addresses, typeadjust
2089 * thinks the operation works on constants. Removing
2090 * CF_CONST here means handling the symptoms, however, the
2091 * whole parser is such a mess that I fear to break anything
2092 * when trying to apply another solution.
2094 flags = typeadjust (lval, &lval2, 0) & ~CF_CONST;
2097 Error ("Invalid operands for binary operator `+'");
2100 /* Generate code for the add */
2103 /* Result is in primary register */
2104 lval->Flags = E_MEXPR;
2105 lval->Test &= ~E_CC;
2114 static void parsesub (int k, ExprDesc* lval)
2115 /* Parse an expression with the binary minus operator. lval contains the
2116 * unprocessed left hand side of the expression and will contain the
2117 * result of the expression on return.
2121 unsigned flags; /* Operation flags */
2122 type* lhst; /* Type of left hand side */
2123 type* rhst; /* Type of right hand side */
2124 CodeMark Mark1; /* Save position of output queue */
2125 CodeMark Mark2; /* Another position in the queue */
2126 int rscale; /* Scale factor for the result */
2129 /* Skip the MINUS token */
2132 /* Get the left hand side type, initialize operation flags */
2135 rscale = 1; /* Scale by 1, that is, don't scale */
2137 /* Remember the output queue position, then bring the value onto the stack */
2138 Mark1 = GetCodePos ();
2139 exprhs (CF_NONE, k, lval); /* --> primary register */
2140 Mark2 = GetCodePos ();
2141 g_push (TypeOf (lhst), 0); /* --> stack */
2143 /* Parse the right hand side */
2144 if (evalexpr (CF_NONE, hie9, &lval2) == 0) {
2146 /* The right hand side is constant. Get the rhs type. */
2149 /* Check left hand side */
2150 if (k == 0 && (lval->Flags & E_MCONST) != 0) {
2152 /* Both sides are constant, remove generated code */
2154 pop (TypeOf (lhst)); /* Clean up the stack */
2156 /* Check for pointer arithmetic */
2157 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2158 /* Left is pointer, right is int, must scale rhs */
2159 lval->ConstVal -= lval2.ConstVal * CheckedPSizeOf (lhst);
2160 /* Operate on pointers, result type is a pointer */
2161 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2162 /* Left is pointer, right is pointer, must scale result */
2163 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2164 Error ("Incompatible pointer types");
2166 lval->ConstVal = (lval->ConstVal - lval2.ConstVal) /
2167 CheckedPSizeOf (lhst);
2169 /* Operate on pointers, result type is an integer */
2170 lval->Type = type_int;
2171 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2172 /* Integer subtraction */
2173 typeadjust (lval, &lval2, 1);
2174 lval->ConstVal -= lval2.ConstVal;
2177 Error ("Invalid operands for binary operator `-'");
2180 /* Result is constant, condition codes not set */
2181 /* lval->Flags = E_MCONST; ### */
2182 lval->Test &= ~E_CC;
2186 /* Left hand side is not constant, right hand side is.
2187 * Remove pushed value from stack.
2190 pop (TypeOf (lhst));
2192 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2193 /* Left is pointer, right is int, must scale rhs */
2194 lval2.ConstVal *= CheckedPSizeOf (lhst);
2195 /* Operate on pointers, result type is a pointer */
2197 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2198 /* Left is pointer, right is pointer, must scale result */
2199 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2200 Error ("Incompatible pointer types");
2202 rscale = CheckedPSizeOf (lhst);
2204 /* Operate on pointers, result type is an integer */
2206 lval->Type = type_int;
2207 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2208 /* Integer subtraction */
2209 flags = typeadjust (lval, &lval2, 1);
2212 Error ("Invalid operands for binary operator `-'");
2215 /* Do the subtraction */
2216 g_dec (flags | CF_CONST, lval2.ConstVal);
2218 /* If this was a pointer subtraction, we must scale the result */
2220 g_scale (flags, -rscale);
2223 /* Result is in primary register */
2224 lval->Flags = E_MEXPR;
2225 lval->Test &= ~E_CC;
2231 /* Right hand side is not constant. Get the rhs type. */
2234 /* Check for pointer arithmetic */
2235 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2236 /* Left is pointer, right is int, must scale rhs */
2237 g_scale (CF_INT, CheckedPSizeOf (lhst));
2238 /* Operate on pointers, result type is a pointer */
2240 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2241 /* Left is pointer, right is pointer, must scale result */
2242 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2243 Error ("Incompatible pointer types");
2245 rscale = CheckedPSizeOf (lhst);
2247 /* Operate on pointers, result type is an integer */
2249 lval->Type = type_int;
2250 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2251 /* Integer subtraction. If the left hand side descriptor says that
2252 * the lhs is const, we have to remove this mark, since this is no
2253 * longer true, lhs is on stack instead.
2255 if (lval->Flags == E_MCONST) {
2256 lval->Flags = E_MEXPR;
2258 /* Adjust operand types */
2259 flags = typeadjust (lval, &lval2, 0);
2262 Error ("Invalid operands for binary operator `-'");
2265 /* Generate code for the sub (the & is a hack here) */
2266 g_sub (flags & ~CF_CONST, 0);
2268 /* If this was a pointer subtraction, we must scale the result */
2270 g_scale (flags, -rscale);
2273 /* Result is in primary register */
2274 lval->Flags = E_MEXPR;
2275 lval->Test &= ~E_CC;
2281 static int hie8 (ExprDesc* lval)
2282 /* Process + and - binary operators. */
2284 int k = hie9 (lval);
2285 while (CurTok.Tok == TOK_PLUS || CurTok.Tok == TOK_MINUS) {
2287 if (CurTok.Tok == TOK_PLUS) {
2300 static int hie7 (ExprDesc *lval)
2301 /* Parse << and >>. */
2303 static const GenDesc* hie7_ops [] = {
2308 return hie_internal (hie7_ops, lval, hie8, &UsedGen);
2313 static int hie6 (ExprDesc *lval)
2314 /* process greater-than type comparators */
2316 static const GenDesc* hie6_ops [] = {
2317 &GenLT, &GenLE, &GenGE, &GenGT, 0
2319 return hie_compare (hie6_ops, lval, hie7);
2324 static int hie5 (ExprDesc *lval)
2326 static const GenDesc* hie5_ops[] = {
2329 return hie_compare (hie5_ops, lval, hie6);
2334 static int hie4 (ExprDesc* lval)
2335 /* Handle & (bitwise and) */
2337 static const GenDesc* hie4_ops [] = {
2342 return hie_internal (hie4_ops, lval, hie5, &UsedGen);
2347 static int hie3 (ExprDesc *lval)
2348 /* Handle ^ (bitwise exclusive or) */
2350 static const GenDesc* hie3_ops [] = {
2355 return hie_internal (hie3_ops, lval, hie4, &UsedGen);
2360 static int hie2 (ExprDesc *lval)
2361 /* Handle | (bitwise or) */
2363 static const GenDesc* hie2_ops [] = {
2368 return hie_internal (hie2_ops, lval, hie3, &UsedGen);
2373 static int hieAndPP (ExprDesc* lval)
2374 /* Process "exp && exp" in preprocessor mode (that is, when the parser is
2375 * called recursively from the preprocessor.
2380 ConstSubExpr (hie2, lval);
2381 while (CurTok.Tok == TOK_BOOL_AND) {
2383 /* Left hand side must be an int */
2384 if (!IsClassInt (lval->Type)) {
2385 Error ("Left hand side must be of integer type");
2386 MakeConstIntExpr (lval, 1);
2393 ConstSubExpr (hie2, &lval2);
2395 /* Since we are in PP mode, all we know about is integers */
2396 if (!IsClassInt (lval2.Type)) {
2397 Error ("Right hand side must be of integer type");
2398 MakeConstIntExpr (&lval2, 1);
2401 /* Combine the two */
2402 lval->ConstVal = (lval->ConstVal && lval2.ConstVal);
2405 /* Always a rvalue */
2411 static int hieOrPP (ExprDesc *lval)
2412 /* Process "exp || exp" in preprocessor mode (that is, when the parser is
2413 * called recursively from the preprocessor.
2418 ConstSubExpr (hieAndPP, lval);
2419 while (CurTok.Tok == TOK_BOOL_OR) {
2421 /* Left hand side must be an int */
2422 if (!IsClassInt (lval->Type)) {
2423 Error ("Left hand side must be of integer type");
2424 MakeConstIntExpr (lval, 1);
2431 ConstSubExpr (hieAndPP, &lval2);
2433 /* Since we are in PP mode, all we know about is integers */
2434 if (!IsClassInt (lval2.Type)) {
2435 Error ("Right hand side must be of integer type");
2436 MakeConstIntExpr (&lval2, 1);
2439 /* Combine the two */
2440 lval->ConstVal = (lval->ConstVal || lval2.ConstVal);
2443 /* Always a rvalue */
2449 static int hieAnd (ExprDesc* lval, unsigned TrueLab, int* BoolOp)
2450 /* Process "exp && exp" */
2457 if (CurTok.Tok == TOK_BOOL_AND) {
2459 /* Tell our caller that we're evaluating a boolean */
2462 /* Get a label that we will use for false expressions */
2463 lab = GetLocalLabel ();
2465 /* If the expr hasn't set condition codes, set the force-test flag */
2466 if ((lval->Test & E_CC) == 0) {
2467 lval->Test |= E_FORCETEST;
2470 /* Load the value */
2471 exprhs (CF_FORCECHAR, k, lval);
2473 /* Generate the jump */
2474 g_falsejump (CF_NONE, lab);
2476 /* Parse more boolean and's */
2477 while (CurTok.Tok == TOK_BOOL_AND) {
2484 if ((lval2.Test & E_CC) == 0) {
2485 lval2.Test |= E_FORCETEST;
2487 exprhs (CF_FORCECHAR, k, &lval2);
2489 /* Do short circuit evaluation */
2490 if (CurTok.Tok == TOK_BOOL_AND) {
2491 g_falsejump (CF_NONE, lab);
2493 /* Last expression - will evaluate to true */
2494 g_truejump (CF_NONE, TrueLab);
2498 /* Define the false jump label here */
2499 g_defcodelabel (lab);
2501 /* Define the label */
2502 lval->Flags = E_MEXPR;
2503 lval->Test |= E_CC; /* Condition codes are set */
2511 static int hieOr (ExprDesc *lval)
2512 /* Process "exp || exp". */
2516 int BoolOp = 0; /* Did we have a boolean op? */
2517 int AndOp; /* Did we have a && operation? */
2518 unsigned TrueLab; /* Jump to this label if true */
2522 TrueLab = GetLocalLabel ();
2524 /* Call the next level parser */
2525 k = hieAnd (lval, TrueLab, &BoolOp);
2527 /* Any boolean or's? */
2528 if (CurTok.Tok == TOK_BOOL_OR) {
2530 /* If the expr hasn't set condition codes, set the force-test flag */
2531 if ((lval->Test & E_CC) == 0) {
2532 lval->Test |= E_FORCETEST;
2535 /* Get first expr */
2536 exprhs (CF_FORCECHAR, k, lval);
2538 /* For each expression jump to TrueLab if true. Beware: If we
2539 * had && operators, the jump is already in place!
2542 g_truejump (CF_NONE, TrueLab);
2545 /* Remember that we had a boolean op */
2548 /* while there's more expr */
2549 while (CurTok.Tok == TOK_BOOL_OR) {
2556 k = hieAnd (&lval2, TrueLab, &AndOp);
2557 if ((lval2.Test & E_CC) == 0) {
2558 lval2.Test |= E_FORCETEST;
2560 exprhs (CF_FORCECHAR, k, &lval2);
2562 /* If there is more to come, add shortcut boolean eval. */
2563 g_truejump (CF_NONE, TrueLab);
2566 lval->Flags = E_MEXPR;
2567 lval->Test |= E_CC; /* Condition codes are set */
2571 /* If we really had boolean ops, generate the end sequence */
2573 DoneLab = GetLocalLabel ();
2574 g_getimmed (CF_INT | CF_CONST, 0, 0); /* Load FALSE */
2575 g_falsejump (CF_NONE, DoneLab);
2576 g_defcodelabel (TrueLab);
2577 g_getimmed (CF_INT | CF_CONST, 1, 0); /* Load TRUE */
2578 g_defcodelabel (DoneLab);
2585 static int hieQuest (ExprDesc* lval)
2586 /* Parse the ternary operator */
2591 ExprDesc Expr2; /* Expression 2 */
2592 ExprDesc Expr3; /* Expression 3 */
2593 int Expr2IsNULL; /* Expression 2 is a NULL pointer */
2594 int Expr3IsNULL; /* Expression 3 is a NULL pointer */
2595 type* ResultType; /* Type of result */
2598 k1 = Preprocessing? hieOrPP (lval) : hieOr (lval);
2599 if (CurTok.Tok == TOK_QUEST) {
2601 if ((lval->Test & E_CC) == 0) {
2602 /* Condition codes not set, force a test */
2603 lval->Test |= E_FORCETEST;
2605 exprhs (CF_NONE, k1, lval);
2606 labf = GetLocalLabel ();
2607 g_falsejump (CF_NONE, labf);
2609 /* Parse second expression. Remember for later if it is a NULL pointer
2610 * expression, then load it into the primary.
2612 k2 = expr (hie1, &Expr2);
2613 Expr2IsNULL = IsNullPtr (&Expr2);
2614 if (!IsTypeVoid (Expr2.Type)) {
2615 /* Load it into the primary */
2616 exprhs (CF_NONE, k2, &Expr2);
2617 Expr2.Flags = E_MEXPR;
2620 labt = GetLocalLabel ();
2624 /* Jump here if the first expression was false */
2625 g_defcodelabel (labf);
2627 /* Parse second expression. Remember for later if it is a NULL pointer
2628 * expression, then load it into the primary.
2630 k3 = expr (hie1, &Expr3);
2631 Expr3IsNULL = IsNullPtr (&Expr3);
2632 if (!IsTypeVoid (Expr3.Type)) {
2633 /* Load it into the primary */
2634 exprhs (CF_NONE, k3, &Expr3);
2635 Expr3.Flags = E_MEXPR;
2639 /* Check if any conversions are needed, if so, do them.
2640 * Conversion rules for ?: expression are:
2641 * - if both expressions are int expressions, default promotion
2642 * rules for ints apply.
2643 * - if both expressions are pointers of the same type, the
2644 * result of the expression is of this type.
2645 * - if one of the expressions is a pointer and the other is
2646 * a zero constant, the resulting type is that of the pointer
2648 * - if both expressions are void expressions, the result is of
2650 * - all other cases are flagged by an error.
2652 if (IsClassInt (Expr2.Type) && IsClassInt (Expr3.Type)) {
2654 /* Get common type */
2655 ResultType = promoteint (Expr2.Type, Expr3.Type);
2657 /* Convert the third expression to this type if needed */
2658 TypeConversion (&Expr3, k3, ResultType);
2660 /* Setup a new label so that the expr3 code will jump around
2661 * the type cast code for expr2.
2663 labf = GetLocalLabel (); /* Get new label */
2664 g_jump (labf); /* Jump around code */
2666 /* The jump for expr2 goes here */
2667 g_defcodelabel (labt);
2669 /* Create the typecast code for expr2 */
2670 TypeConversion (&Expr2, k2, ResultType);
2672 /* Jump here around the typecase code. */
2673 g_defcodelabel (labf);
2674 labt = 0; /* Mark other label as invalid */
2676 } else if (IsClassPtr (Expr2.Type) && IsClassPtr (Expr3.Type)) {
2677 /* Must point to same type */
2678 if (TypeCmp (Indirect (Expr2.Type), Indirect (Expr3.Type)) < TC_EQUAL) {
2679 Error ("Incompatible pointer types");
2681 /* Result has the common type */
2682 ResultType = Expr2.Type;
2683 } else if (IsClassPtr (Expr2.Type) && Expr3IsNULL) {
2684 /* Result type is pointer, no cast needed */
2685 ResultType = Expr2.Type;
2686 } else if (Expr2IsNULL && IsClassPtr (Expr3.Type)) {
2687 /* Result type is pointer, no cast needed */
2688 ResultType = Expr3.Type;
2689 } else if (IsTypeVoid (Expr2.Type) && IsTypeVoid (Expr3.Type)) {
2690 /* Result type is void */
2691 ResultType = Expr3.Type;
2693 Error ("Incompatible types");
2694 ResultType = Expr2.Type; /* Doesn't matter here */
2697 /* If we don't have the label defined until now, do it */
2699 g_defcodelabel (labt);
2702 /* Setup the target expression */
2703 lval->Flags = E_MEXPR;
2704 lval->Type = ResultType;
2712 static void opeq (const GenDesc* Gen, ExprDesc *lval, int k)
2713 /* Process "op=" operators. */
2722 Error ("Invalid lvalue in assignment");
2726 /* Determine the type of the lhs */
2727 flags = TypeOf (lval->Type);
2728 MustScale = (Gen->Func == g_add || Gen->Func == g_sub) &&
2729 lval->Type [0] == T_PTR;
2731 /* Get the lhs address on stack (if needed) */
2734 /* Fetch the lhs into the primary register if needed */
2735 exprhs (CF_NONE, k, lval);
2737 /* Bring the lhs on stack */
2738 Mark = GetCodePos ();
2741 /* Evaluate the rhs */
2742 if (evalexpr (CF_NONE, hie1, &lval2) == 0) {
2743 /* The resulting value is a constant. If the generator has the NOPUSH
2744 * flag set, don't push the lhs.
2746 if (Gen->Flags & GEN_NOPUSH) {
2751 /* lhs is a pointer, scale rhs */
2752 lval2.ConstVal *= CheckedSizeOf (lval->Type+1);
2755 /* If the lhs is character sized, the operation may be later done
2758 if (CheckedSizeOf (lval->Type) == SIZEOF_CHAR) {
2759 flags |= CF_FORCECHAR;
2762 /* Special handling for add and sub - some sort of a hack, but short code */
2763 if (Gen->Func == g_add) {
2764 g_inc (flags | CF_CONST, lval2.ConstVal);
2765 } else if (Gen->Func == g_sub) {
2766 g_dec (flags | CF_CONST, lval2.ConstVal);
2768 Gen->Func (flags | CF_CONST, lval2.ConstVal);
2771 /* rhs is not constant and already in the primary register */
2773 /* lhs is a pointer, scale rhs */
2774 g_scale (TypeOf (lval2.Type), CheckedSizeOf (lval->Type+1));
2777 /* If the lhs is character sized, the operation may be later done
2780 if (CheckedSizeOf (lval->Type) == SIZEOF_CHAR) {
2781 flags |= CF_FORCECHAR;
2784 /* Adjust the types of the operands if needed */
2785 Gen->Func (g_typeadjust (flags, TypeOf (lval2.Type)), 0);
2788 lval->Flags = E_MEXPR;
2793 static void addsubeq (const GenDesc* Gen, ExprDesc *lval, int k)
2794 /* Process the += and -= operators */
2802 /* We must have an lvalue */
2804 Error ("Invalid lvalue in assignment");
2808 /* We're currently only able to handle some adressing modes */
2809 if ((lval->Flags & E_MGLOBAL) == 0 && /* Global address? */
2810 (lval->Flags & E_MLOCAL) == 0 && /* Local address? */
2811 (lval->Flags & E_MCONST) == 0) { /* Constant address? */
2812 /* Use generic routine */
2813 opeq (Gen, lval, k);
2817 /* Skip the operator */
2820 /* Check if we have a pointer expression and must scale rhs */
2821 MustScale = (lval->Type [0] == T_PTR);
2823 /* Initialize the code generator flags */
2827 /* Evaluate the rhs */
2829 if (k == 0 && lval2.Flags == E_MCONST) {
2830 /* The resulting value is a constant. */
2832 /* lhs is a pointer, scale rhs */
2833 lval2.ConstVal *= CheckedSizeOf (lval->Type+1);
2838 /* Not constant, load into the primary */
2839 exprhs (CF_NONE, k, &lval2);
2841 /* lhs is a pointer, scale rhs */
2842 g_scale (TypeOf (lval2.Type), CheckedSizeOf (lval->Type+1));
2846 /* Setup the code generator flags */
2847 lflags |= TypeOf (lval->Type) | CF_FORCECHAR;
2848 rflags |= TypeOf (lval2.Type);
2850 /* Convert the type of the lhs to that of the rhs */
2851 g_typecast (lflags, rflags);
2853 /* Output apropriate code */
2854 if (lval->Flags & E_MGLOBAL) {
2855 /* Static variable */
2856 lflags |= GlobalModeFlags (lval->Flags);
2857 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2858 g_addeqstatic (lflags, lval->Name, lval->ConstVal, lval2.ConstVal);
2860 g_subeqstatic (lflags, lval->Name, lval->ConstVal, lval2.ConstVal);
2862 } else if (lval->Flags & E_MLOCAL) {
2863 /* ref to localvar */
2864 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2865 g_addeqlocal (lflags, lval->ConstVal, lval2.ConstVal);
2867 g_subeqlocal (lflags, lval->ConstVal, lval2.ConstVal);
2869 } else if (lval->Flags & E_MCONST) {
2870 /* ref to absolute address */
2871 lflags |= CF_ABSOLUTE;
2872 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2873 g_addeqstatic (lflags, lval->ConstVal, 0, lval2.ConstVal);
2875 g_subeqstatic (lflags, lval->ConstVal, 0, lval2.ConstVal);
2877 } else if (lval->Flags & E_MEXPR) {
2878 /* Address in a/x. */
2879 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2880 g_addeqind (lflags, lval->ConstVal, lval2.ConstVal);
2882 g_subeqind (lflags, lval->ConstVal, lval2.ConstVal);
2885 Internal ("Invalid addressing mode");
2888 /* Expression is in the primary now */
2889 lval->Flags = E_MEXPR;
2894 int hie1 (ExprDesc* lval)
2895 /* Parse first level of expression hierarchy. */
2899 k = hieQuest (lval);
2900 switch (CurTok.Tok) {
2909 Error ("Invalid lvalue in assignment");
2915 case TOK_PLUS_ASSIGN:
2916 addsubeq (&GenPASGN, lval, k);
2919 case TOK_MINUS_ASSIGN:
2920 addsubeq (&GenSASGN, lval, k);
2923 case TOK_MUL_ASSIGN:
2924 opeq (&GenMASGN, lval, k);
2927 case TOK_DIV_ASSIGN:
2928 opeq (&GenDASGN, lval, k);
2931 case TOK_MOD_ASSIGN:
2932 opeq (&GenMOASGN, lval, k);
2935 case TOK_SHL_ASSIGN:
2936 opeq (&GenSLASGN, lval, k);
2939 case TOK_SHR_ASSIGN:
2940 opeq (&GenSRASGN, lval, k);
2943 case TOK_AND_ASSIGN:
2944 opeq (&GenAASGN, lval, k);
2947 case TOK_XOR_ASSIGN:
2948 opeq (&GenXOASGN, lval, k);
2952 opeq (&GenOASGN, lval, k);
2963 int hie0 (ExprDesc *lval)
2964 /* Parse comma operator. */
2966 int k = hie1 (lval);
2967 while (CurTok.Tok == TOK_COMMA) {
2976 int evalexpr (unsigned flags, int (*f) (ExprDesc*), ExprDesc* lval)
2977 /* Will evaluate an expression via the given function. If the result is a
2978 * constant, 0 is returned and the value is put in the lval struct. If the
2979 * result is not constant, exprhs is called to bring the value into the
2980 * primary register and 1 is returned.
2987 if (k == 0 && lval->Flags == E_MCONST) {
2988 /* Constant expression */
2991 /* Not constant, load into the primary */
2992 exprhs (flags, k, lval);
2999 static int expr (int (*func) (ExprDesc*), ExprDesc *lval)
3000 /* Expression parser; func is either hie0 or hie1. */
3009 /* Do some checks if code generation is still constistent */
3010 if (savsp != oursp) {
3012 fprintf (stderr, "oursp != savesp (%d != %d)\n", oursp, savsp);
3014 Internal ("oursp != savsp (%d != %d)", oursp, savsp);
3022 void expression1 (ExprDesc* lval)
3023 /* Evaluate an expression on level 1 (no comma operator) and put it into
3024 * the primary register
3027 InitExprDesc (lval);
3028 exprhs (CF_NONE, expr (hie1, lval), lval);
3033 void expression (ExprDesc* lval)
3034 /* Evaluate an expression and put it into the primary register */
3036 InitExprDesc (lval);
3037 exprhs (CF_NONE, expr (hie0, lval), lval);
3042 void ConstExpr (ExprDesc* lval)
3043 /* Get a constant value */
3045 InitExprDesc (lval);
3046 if (expr (hie1, lval) != 0 || (lval->Flags & E_MCONST) == 0) {
3047 Error ("Constant expression expected");
3048 /* To avoid any compiler errors, make the expression a valid const */
3049 MakeConstIntExpr (lval, 1);
3055 void ConstIntExpr (ExprDesc* Val)
3056 /* Get a constant int value */
3059 if (expr (hie1, Val) != 0 ||
3060 (Val->Flags & E_MCONST) == 0 ||
3061 !IsClassInt (Val->Type)) {
3062 Error ("Constant integer expression expected");
3063 /* To avoid any compiler errors, make the expression a valid const */
3064 MakeConstIntExpr (Val, 1);
3070 void intexpr (ExprDesc* lval)
3071 /* Get an integer expression */
3074 if (!IsClassInt (lval->Type)) {
3075 Error ("Integer expression expected");
3076 /* To avoid any compiler errors, make the expression a valid int */
3077 MakeConstIntExpr (lval, 1);
3083 void Test (unsigned Label, int Invert)
3084 /* Evaluate a boolean test expression and jump depending on the result of
3085 * the test and on Invert.
3091 /* Evaluate the expression */
3092 k = expr (hie0, InitExprDesc (&lval));
3094 /* Check for a boolean expression */
3095 CheckBoolExpr (&lval);
3097 /* Check for a constant expression */
3098 if (k == 0 && lval.Flags == E_MCONST) {
3100 /* Constant rvalue */
3101 if (!Invert && lval.ConstVal == 0) {
3103 Warning ("Unreachable code");
3104 } else if (Invert && lval.ConstVal != 0) {
3110 /* If the expr hasn't set condition codes, set the force-test flag */
3111 if ((lval.Test & E_CC) == 0) {
3112 lval.Test |= E_FORCETEST;
3115 /* Load the value into the primary register */
3116 exprhs (CF_FORCECHAR, k, &lval);
3118 /* Generate the jump */
3120 g_truejump (CF_NONE, Label);
3122 g_falsejump (CF_NONE, Label);
3129 void TestInParens (unsigned Label, int Invert)
3130 /* Evaluate a boolean test expression in parenthesis and jump depending on
3131 * the result of the test * and on Invert.
3134 /* Eat the parenthesis */
3138 Test (Label, Invert);
3140 /* Check for the closing brace */