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 CHECK (FrameSize >= ArgSize);
594 FrameSize -= ArgSize;
595 FrameOffs -= ArgSize;
597 g_putlocal (Flags | CF_NOKEEP, FrameOffs, lval.ConstVal);
599 /* Push the argument */
600 g_push (Flags, lval.ConstVal);
603 /* Calculate total parameter size */
604 ParamSize += ArgSize;
607 /* Check for end of argument list */
608 if (CurTok.Tok != TOK_COMMA) {
614 /* Check if we had enough parameters */
615 if (ParamCount < Func->ParamCount) {
616 Error ("Too few arguments in function call");
619 /* The function returns the size of all parameters pushed onto the stack.
620 * However, if there are parameters missing (which is an error and was
621 * flagged by the compiler) AND a stack frame was preallocated above,
622 * we would loose track of the stackpointer and generate an internal error
623 * later. So we correct the value by the parameters that should have been
624 * pushed to avoid an internal compiler error. Since an error was
625 * generated before, no code will be output anyway.
627 return ParamSize + FrameSize;
632 static void FunctionCall (int k, ExprDesc* lval)
633 /* Perform a function call. */
635 FuncDesc* Func; /* Function descriptor */
636 int IsFuncPtr; /* Flag */
637 unsigned ParamSize; /* Number of parameter bytes */
638 CodeMark Mark = 0; /* Initialize to keep gcc silent */
639 int PtrOffs = 0; /* Offset of function pointer on stack */
640 int IsFastCall = 0; /* True if it's a fast call function */
641 int PtrOnStack = 0; /* True if a pointer copy is on stack */
643 /* Get a pointer to the function descriptor from the type string */
644 Func = GetFuncDesc (lval->Type);
646 /* Handle function pointers transparently */
647 IsFuncPtr = IsTypeFuncPtr (lval->Type);
650 /* Check wether it's a fastcall function that has parameters */
651 IsFastCall = IsFastCallFunc (lval->Type + 1) && (Func->ParamCount > 0);
653 /* Things may be difficult, depending on where the function pointer
654 * resides. If the function pointer is an expression of some sort
655 * (not a local or global variable), we have to evaluate this
656 * expression now and save the result for later. Since calls to
657 * function pointers may be nested, we must save it onto the stack.
658 * For fastcall functions we do also need to place a copy of the
659 * pointer on stack, since we cannot use a/x.
661 PtrOnStack = IsFastCall || ((lval->Flags & (E_MGLOBAL | E_MLOCAL)) == 0);
664 /* Not a global or local variable, or a fastcall function. Load
665 * the pointer into the primary and mark it as an expression.
667 exprhs (CF_NONE, k, lval);
668 lval->Flags |= E_MEXPR;
670 /* Remember the code position */
671 Mark = GetCodePos ();
673 /* Push the pointer onto the stack and remember the offset */
678 /* Check for known standard functions and inline them if requested */
679 } else if (InlineStdFuncs && IsStdFunc ((const char*) lval->Name)) {
681 /* Inline this function */
682 HandleStdFunc (Func, lval);
687 /* Parse the parameter list */
688 ParamSize = FunctionParamList (Func);
690 /* We need the closing paren here */
693 /* Special handling for function pointers */
696 /* If the function is not a fastcall function, load the pointer to
697 * the function into the primary.
701 /* Not a fastcall function - we may use the primary */
703 /* If we have no parameters, the pointer is still in the
704 * primary. Remove the code to push it and correct the
707 if (ParamSize == 0) {
712 /* Load from the saved copy */
713 g_getlocal (CF_PTR, PtrOffs);
716 /* Load from original location */
717 exprhs (CF_NONE, k, lval);
720 /* Call the function */
721 g_callind (TypeOf (lval->Type+1), ParamSize, PtrOffs);
725 /* Fastcall function. We cannot use the primary for the function
726 * pointer and must therefore use an offset to the stack location.
727 * Since fastcall functions may never be variadic, we can use the
728 * index register for this purpose.
730 g_callind (CF_LOCAL, ParamSize, PtrOffs);
733 /* If we have a pointer on stack, remove it */
735 g_space (- (int) sizeofarg (CF_PTR));
744 /* Normal function */
745 g_call (TypeOf (lval->Type), (const char*) lval->Name, ParamSize);
752 static int primary (ExprDesc* lval)
753 /* This is the lowest level of the expression parser. */
757 /* Initialize fields in the expression stucture */
758 lval->Test = 0; /* No test */
759 lval->Sym = 0; /* Symbol unknown */
761 /* Character and integer constants. */
762 if (CurTok.Tok == TOK_ICONST || CurTok.Tok == TOK_CCONST) {
763 lval->Flags = E_MCONST | E_TCONST;
764 lval->Type = CurTok.Type;
765 lval->ConstVal = CurTok.IVal;
770 /* Process parenthesized subexpression by calling the whole parser
773 if (CurTok.Tok == TOK_LPAREN) {
775 InitExprDesc (lval); /* Remove any attributes */
781 /* If we run into an identifier in preprocessing mode, we assume that this
782 * is an undefined macro and replace it by a constant value of zero.
784 if (Preprocessing && CurTok.Tok == TOK_IDENT) {
785 MakeConstIntExpr (lval, 0);
789 /* All others may only be used if the expression evaluation is not called
790 * recursively by the preprocessor.
793 /* Illegal expression in PP mode */
794 Error ("Preprocessor expression expected");
795 MakeConstIntExpr (lval, 1);
800 if (CurTok.Tok == TOK_IDENT) {
805 /* Get a pointer to the symbol table entry */
806 Sym = lval->Sym = FindSym (CurTok.Ident);
808 /* Is the symbol known? */
811 /* We found the symbol - skip the name token */
814 /* The expression type is the symbol type */
815 lval->Type = Sym->Type;
817 /* Check for illegal symbol types */
818 CHECK ((Sym->Flags & SC_LABEL) != SC_LABEL);
819 if (Sym->Flags & SC_TYPE) {
820 /* Cannot use type symbols */
821 Error ("Variable identifier expected");
822 /* Assume an int type to make lval valid */
823 lval->Flags = E_MLOCAL | E_TLOFFS;
824 lval->Type = type_int;
829 /* Check for legal symbol types */
830 if ((Sym->Flags & SC_CONST) == SC_CONST) {
831 /* Enum or some other numeric constant */
832 lval->Flags = E_MCONST | E_TCONST;
833 lval->ConstVal = Sym->V.ConstVal;
835 } else if ((Sym->Flags & SC_FUNC) == SC_FUNC) {
837 lval->Flags = E_MGLOBAL | E_MCONST | E_TGLAB;
838 lval->Name = (unsigned long) Sym->Name;
840 } else if ((Sym->Flags & SC_AUTO) == SC_AUTO) {
841 /* Local variable. If this is a parameter for a variadic
842 * function, we have to add some address calculations, and the
843 * address is not const.
845 if ((Sym->Flags & SC_PARAM) == SC_PARAM && F_IsVariadic (CurrentFunc)) {
846 /* Variadic parameter */
847 g_leavariadic (Sym->V.Offs - F_GetParamSize (CurrentFunc));
848 lval->Flags = E_MEXPR;
851 /* Normal parameter */
852 lval->Flags = E_MLOCAL | E_TLOFFS;
853 lval->ConstVal = Sym->V.Offs;
855 } else if ((Sym->Flags & SC_REGISTER) == SC_REGISTER) {
856 /* Register variable, zero page based */
857 lval->Flags = E_MGLOBAL | E_MCONST | E_TREGISTER;
858 lval->Name = Sym->V.R.RegOffs;
860 } else if ((Sym->Flags & SC_STATIC) == SC_STATIC) {
861 /* Static variable */
862 if (Sym->Flags & (SC_EXTERN | SC_STORAGE)) {
863 lval->Flags = E_MGLOBAL | E_MCONST | E_TGLAB;
864 lval->Name = (unsigned long) Sym->Name;
866 lval->Flags = E_MGLOBAL | E_MCONST | E_TLLAB;
867 lval->Name = Sym->V.Label;
871 /* Local static variable */
872 lval->Flags = E_MGLOBAL | E_MCONST | E_TLLAB;
873 lval->Name = Sym->V.Offs;
877 /* The symbol is referenced now */
878 Sym->Flags |= SC_REF;
879 if (IsTypeFunc (lval->Type) || IsTypeArray (lval->Type)) {
885 /* We did not find the symbol. Remember the name, then skip it */
886 strcpy (Ident, CurTok.Ident);
889 /* IDENT is either an auto-declared function or an undefined variable. */
890 if (CurTok.Tok == TOK_LPAREN) {
891 /* Declare a function returning int. For that purpose, prepare a
892 * function signature for a function having an empty param list
895 Warning ("Function call without a prototype");
896 Sym = AddGlobalSym (Ident, GetImplicitFuncType(), SC_EXTERN | SC_REF | SC_FUNC);
897 lval->Type = Sym->Type;
898 lval->Flags = E_MGLOBAL | E_MCONST | E_TGLAB;
899 lval->Name = (unsigned long) Sym->Name;
905 /* Undeclared Variable */
906 Sym = AddLocalSym (Ident, type_int, SC_AUTO | SC_REF, 0);
907 lval->Flags = E_MLOCAL | E_TLOFFS;
908 lval->Type = type_int;
910 Error ("Undefined symbol: `%s'", Ident);
916 /* String literal? */
917 if (CurTok.Tok == TOK_SCONST) {
918 lval->Flags = E_MCONST | E_TLIT;
919 lval->ConstVal = CurTok.IVal;
920 lval->Type = GetCharArrayType (GetLiteralPoolOffs () - CurTok.IVal);
926 if (CurTok.Tok == TOK_ASM) {
928 lval->Type = type_void;
929 lval->Flags = E_MEXPR;
934 /* __AX__ and __EAX__ pseudo values? */
935 if (CurTok.Tok == TOK_AX || CurTok.Tok == TOK_EAX) {
936 lval->Type = (CurTok.Tok == TOK_AX)? type_uint : type_ulong;
937 lval->Flags = E_MREG;
941 return 1; /* May be used as lvalue */
944 /* Illegal primary. */
945 Error ("Expression expected");
946 MakeConstIntExpr (lval, 1);
952 static int arrayref (int k, ExprDesc* lval)
953 /* Handle an array reference */
967 /* Skip the bracket */
970 /* Get the type of left side */
973 /* We can apply a special treatment for arrays that have a const base
974 * address. This is true for most arrays and will produce a lot better
975 * code. Check if this is a const base address.
977 lflags = lval->Flags & ~E_MCTYPE;
978 ConstBaseAddr = (lflags == E_MCONST) || /* Constant numeric address */
979 (lflags & E_MGLOBAL) != 0 || /* Static array, or ... */
980 lflags == E_MLOCAL; /* Local array */
982 /* If we have a constant base, we delay the address fetch */
983 Mark1 = GetCodePos ();
984 Mark2 = 0; /* Silence gcc */
985 if (!ConstBaseAddr) {
986 /* Get a pointer to the array into the primary */
987 exprhs (CF_NONE, k, lval);
989 /* Get the array pointer on stack. Do not push more than 16
990 * bit, even if this value is greater, since we cannot handle
991 * other than 16bit stuff when doing indexing.
993 Mark2 = GetCodePos ();
997 /* TOS now contains ptr to array elements. Get the subscript. */
999 if (l == 0 && lval2.Flags == E_MCONST) {
1001 /* The array subscript is a constant - remove value from stack */
1002 if (!ConstBaseAddr) {
1006 /* Get an array pointer into the primary */
1007 exprhs (CF_NONE, k, lval);
1010 if (IsClassPtr (tptr1)) {
1012 /* Scale the subscript value according to element size */
1013 lval2.ConstVal *= CheckedPSizeOf (tptr1);
1015 /* Remove code for lhs load */
1018 /* Handle constant base array on stack. Be sure NOT to
1019 * handle pointers the same way, and check for character literals
1020 * (both won't work).
1022 if (IsTypeArray (tptr1) && lval->Flags != (E_MCONST | E_TLIT) &&
1023 ((lval->Flags & ~E_MCTYPE) == E_MCONST ||
1024 (lval->Flags & ~E_MCTYPE) == E_MLOCAL ||
1025 (lval->Flags & E_MGLOBAL) != 0 ||
1026 (lval->Flags == E_MEOFFS))) {
1027 lval->ConstVal += lval2.ConstVal;
1030 /* Pointer - load into primary and remember offset */
1031 if ((lval->Flags & E_MEXPR) == 0 || k != 0) {
1032 exprhs (CF_NONE, k, lval);
1034 lval->ConstVal = lval2.ConstVal;
1035 lval->Flags = E_MEOFFS;
1038 /* Result is of element type */
1039 lval->Type = Indirect (tptr1);
1044 } else if (IsClassPtr (tptr2 = lval2.Type)) {
1045 /* Subscript is pointer, get element type */
1046 lval2.Type = Indirect (tptr2);
1048 /* Scale the rhs value in the primary register */
1049 g_scale (TypeOf (tptr1), CheckedSizeOf (lval2.Type));
1051 lval->Type = lval2.Type;
1053 Error ("Cannot subscript");
1056 /* Add the subscript. Since arrays are indexed by integers,
1057 * we will ignore the true type of the subscript here and
1058 * use always an int.
1060 g_inc (CF_INT | CF_CONST, lval2.ConstVal);
1064 /* Array subscript is not constant. Load it into the primary */
1065 Mark2 = GetCodePos ();
1066 exprhs (CF_NONE, l, &lval2);
1069 if (IsClassPtr (tptr1)) {
1071 /* Get the element type */
1072 lval->Type = Indirect (tptr1);
1074 /* Indexing is based on int's, so we will just use the integer
1075 * portion of the index (which is in (e)ax, so there's no further
1078 g_scale (CF_INT, CheckedSizeOf (lval->Type));
1080 } else if (IsClassPtr (tptr2)) {
1082 /* Get the element type */
1083 lval2.Type = Indirect (tptr2);
1085 /* Get the int value on top. If we go here, we're sure,
1086 * both values are 16 bit (the first one was truncated
1087 * if necessary and the second one is a pointer).
1088 * Note: If ConstBaseAddr is true, we don't have a value on
1089 * stack, so to "swap" both, just push the subscript.
1091 if (ConstBaseAddr) {
1093 exprhs (CF_NONE, k, lval);
1100 g_scale (TypeOf (tptr1), CheckedSizeOf (lval2.Type));
1101 lval->Type = lval2.Type;
1103 Error ("Cannot subscript");
1106 /* The offset is now in the primary register. It didn't have a
1107 * constant base address for the lhs, the lhs address is already
1108 * on stack, and we must add the offset. If the base address was
1109 * constant, we call special functions to add the address to the
1112 if (!ConstBaseAddr) {
1113 /* Add the subscript. Both values are int sized. */
1117 /* If the subscript has itself a constant address, it is often
1118 * a better idea to reverse again the order of the evaluation.
1119 * This will generate better code if the subscript is a byte
1120 * sized variable. But beware: This is only possible if the
1121 * subscript was not scaled, that is, if this was a byte array
1124 rflags = lval2.Flags & ~E_MCTYPE;
1125 ConstSubAddr = (rflags == E_MCONST) || /* Constant numeric address */
1126 (rflags & E_MGLOBAL) != 0 || /* Static array, or ... */
1127 rflags == E_MLOCAL; /* Local array */
1129 if (ConstSubAddr && CheckedSizeOf (lval->Type) == SIZEOF_CHAR) {
1133 /* Reverse the order of evaluation */
1134 unsigned flags = (CheckedSizeOf (lval2.Type) == SIZEOF_CHAR)? CF_CHAR : CF_INT;
1137 /* Get a pointer to the array into the primary. We have changed
1138 * Type above but we need the original type to load the
1139 * address, so restore it temporarily.
1141 SavedType = lval->Type;
1143 exprhs (CF_NONE, k, lval);
1144 lval->Type = SavedType;
1146 /* Add the variable */
1147 if (rflags == E_MLOCAL) {
1148 g_addlocal (flags, lval2.ConstVal);
1150 flags |= GlobalModeFlags (lval2.Flags);
1151 g_addstatic (flags, lval2.Name, lval2.ConstVal);
1154 if (lflags == E_MCONST) {
1155 /* Constant numeric address. Just add it */
1156 g_inc (CF_INT | CF_UNSIGNED, lval->ConstVal);
1157 } else if (lflags == E_MLOCAL) {
1158 /* Base address is a local variable address */
1159 if (IsTypeArray (tptr1)) {
1160 g_addaddr_local (CF_INT, lval->ConstVal);
1162 g_addlocal (CF_PTR, lval->ConstVal);
1165 /* Base address is a static variable address */
1166 unsigned flags = CF_INT;
1167 flags |= GlobalModeFlags (lval->Flags);
1168 if (IsTypeArray (tptr1)) {
1169 g_addaddr_static (flags, lval->Name, lval->ConstVal);
1171 g_addstatic (flags, lval->Name, lval->ConstVal);
1177 lval->Flags = E_MEXPR;
1180 return !IsTypeArray (lval->Type);
1186 static int structref (int k, ExprDesc* lval)
1187 /* Process struct field after . or ->. */
1193 /* Skip the token and check for an identifier */
1195 if (CurTok.Tok != TOK_IDENT) {
1196 Error ("Identifier expected");
1197 lval->Type = type_int;
1201 /* Get the symbol table entry and check for a struct field */
1202 strcpy (Ident, CurTok.Ident);
1204 Field = FindStructField (lval->Type, Ident);
1206 Error ("Struct/union has no field named `%s'", Ident);
1207 lval->Type = type_int;
1211 /* If we have constant input data, the result is also constant */
1212 flags = lval->Flags & ~E_MCTYPE;
1213 if (flags == E_MCONST ||
1214 (k == 0 && (flags == E_MLOCAL ||
1215 (flags & E_MGLOBAL) != 0 ||
1216 lval->Flags == E_MEOFFS))) {
1217 lval->ConstVal += Field->V.Offs;
1219 if ((flags & E_MEXPR) == 0 || k != 0) {
1220 exprhs (CF_NONE, k, lval);
1222 lval->ConstVal = Field->V.Offs;
1223 lval->Flags = E_MEOFFS;
1225 lval->Type = Field->Type;
1226 return !IsTypeArray (Field->Type);
1231 static int hie11 (ExprDesc *lval)
1232 /* Handle compound types (structs and arrays) */
1239 if (CurTok.Tok < TOK_LBRACK || CurTok.Tok > TOK_PTR_REF) {
1246 if (CurTok.Tok == TOK_LBRACK) {
1248 /* Array reference */
1249 k = arrayref (k, lval);
1251 } else if (CurTok.Tok == TOK_LPAREN) {
1253 /* Function call. Skip the opening parenthesis */
1256 if (IsTypeFunc (lval->Type) || IsTypeFuncPtr (lval->Type)) {
1258 /* Call the function */
1259 FunctionCall (k, lval);
1261 /* Result is in the primary register */
1262 lval->Flags = E_MEXPR;
1265 lval->Type = GetFuncReturn (lval->Type);
1268 Error ("Illegal function call");
1272 } else if (CurTok.Tok == TOK_DOT) {
1274 if (!IsClassStruct (lval->Type)) {
1275 Error ("Struct expected");
1277 k = structref (0, lval);
1279 } else if (CurTok.Tok == TOK_PTR_REF) {
1282 if (tptr[0] != T_PTR || (tptr[1] & T_STRUCT) == 0) {
1283 Error ("Struct pointer expected");
1285 k = structref (k, lval);
1295 void Store (ExprDesc* lval, const type* StoreType)
1296 /* Store the primary register into the location denoted by lval. If StoreType
1297 * is given, use this type when storing instead of lval->Type. If StoreType
1298 * is NULL, use lval->Type instead.
1303 unsigned f = lval->Flags;
1305 /* If StoreType was not given, use lval->Type instead */
1306 if (StoreType == 0) {
1307 StoreType = lval->Type;
1310 /* Get the code generator flags */
1311 Flags = TypeOf (StoreType);
1312 if (f & E_MGLOBAL) {
1313 Flags |= GlobalModeFlags (f);
1320 g_putstatic (Flags, lval->Name, lval->ConstVal);
1322 } else if (f & E_MLOCAL) {
1323 /* Store an auto variable */
1324 g_putlocal (Flags, lval->ConstVal, 0);
1325 } else if (f == E_MEOFFS) {
1326 /* Store indirect with offset */
1327 g_putind (Flags, lval->ConstVal);
1328 } else if (f != E_MREG) {
1330 /* Indirect without offset */
1331 g_putind (Flags, 0);
1333 /* Store into absolute address */
1334 g_putstatic (Flags | CF_ABSOLUTE, lval->ConstVal, 0);
1338 /* Assume that each one of the stores will invalidate CC */
1339 lval->Test &= ~E_CC;
1344 static void pre_incdec (ExprDesc* lval, void (*inc) (unsigned, unsigned long))
1345 /* Handle --i and ++i */
1352 if ((k = hie10 (lval)) == 0) {
1353 Error ("Invalid lvalue");
1357 /* Get the data type */
1358 flags = TypeOf (lval->Type) | CF_FORCECHAR | CF_CONST;
1360 /* Get the increment value in bytes */
1361 val = (lval->Type [0] == T_PTR)? CheckedPSizeOf (lval->Type) : 1;
1363 /* We're currently only able to handle some adressing modes */
1364 if ((lval->Flags & E_MGLOBAL) == 0 && /* Global address? */
1365 (lval->Flags & E_MLOCAL) == 0 && /* Local address? */
1366 (lval->Flags & E_MCONST) == 0 && /* Constant address? */
1367 (lval->Flags & E_MEXPR) == 0) { /* Address in a/x? */
1369 /* Use generic code. Push the address if needed */
1372 /* Fetch the value */
1373 exprhs (CF_NONE, k, lval);
1375 /* Increment value in primary */
1378 /* Store the result back */
1383 /* Special code for some addressing modes - use the special += ops */
1384 if (lval->Flags & E_MGLOBAL) {
1385 flags |= GlobalModeFlags (lval->Flags);
1387 g_addeqstatic (flags, lval->Name, lval->ConstVal, val);
1389 g_subeqstatic (flags, lval->Name, lval->ConstVal, val);
1391 } else if (lval->Flags & E_MLOCAL) {
1392 /* ref to localvar */
1394 g_addeqlocal (flags, lval->ConstVal, val);
1396 g_subeqlocal (flags, lval->ConstVal, val);
1398 } else if (lval->Flags & E_MCONST) {
1399 /* ref to absolute address */
1400 flags |= CF_ABSOLUTE;
1402 g_addeqstatic (flags, lval->ConstVal, 0, val);
1404 g_subeqstatic (flags, lval->ConstVal, 0, val);
1406 } else if (lval->Flags & E_MEXPR) {
1407 /* Address in a/x, check if we have an offset */
1408 unsigned Offs = (lval->Flags == E_MEOFFS)? lval->ConstVal : 0;
1410 g_addeqind (flags, Offs, val);
1412 g_subeqind (flags, Offs, val);
1415 Internal ("Invalid addressing mode");
1420 /* Result is an expression */
1421 lval->Flags = E_MEXPR;
1426 static void post_incdec (ExprDesc* lval, int k, void (*inc) (unsigned, unsigned long))
1427 /* Handle i-- and i++ */
1433 Error ("Invalid lvalue");
1437 /* Get the data type */
1438 flags = TypeOf (lval->Type);
1440 /* Push the address if needed */
1443 /* Fetch the value and save it (since it's the result of the expression) */
1444 exprhs (CF_NONE, 1, lval);
1445 g_save (flags | CF_FORCECHAR);
1447 /* If we have a pointer expression, increment by the size of the type */
1448 if (lval->Type[0] == T_PTR) {
1449 inc (flags | CF_CONST | CF_FORCECHAR, CheckedSizeOf (lval->Type + 1));
1451 inc (flags | CF_CONST | CF_FORCECHAR, 1);
1454 /* Store the result back */
1457 /* Restore the original value */
1458 g_restore (flags | CF_FORCECHAR);
1459 lval->Flags = E_MEXPR;
1464 static void unaryop (int tok, ExprDesc* lval)
1465 /* Handle unary -/+ and ~ */
1472 if (k == 0 && (lval->Flags & E_MCONST) != 0) {
1473 /* Value is constant */
1475 case TOK_MINUS: lval->ConstVal = -lval->ConstVal; break;
1476 case TOK_PLUS: break;
1477 case TOK_COMP: lval->ConstVal = ~lval->ConstVal; break;
1478 default: Internal ("Unexpected token: %d", tok);
1481 /* Value is not constant */
1482 exprhs (CF_NONE, k, lval);
1484 /* Get the type of the expression */
1485 flags = TypeOf (lval->Type);
1487 /* Handle the operation */
1489 case TOK_MINUS: g_neg (flags); break;
1490 case TOK_PLUS: break;
1491 case TOK_COMP: g_com (flags); break;
1492 default: Internal ("Unexpected token: %d", tok);
1494 lval->Flags = E_MEXPR;
1500 int hie10 (ExprDesc* lval)
1501 /* Handle ++, --, !, unary - etc. */
1506 switch (CurTok.Tok) {
1509 pre_incdec (lval, g_inc);
1513 pre_incdec (lval, g_dec);
1519 unaryop (CurTok.Tok, lval);
1524 if (evalexpr (CF_NONE, hie10, lval) == 0) {
1525 /* Constant expression */
1526 lval->ConstVal = !lval->ConstVal;
1528 g_bneg (TypeOf (lval->Type));
1529 lval->Test |= E_CC; /* bneg will set cc */
1530 lval->Flags = E_MEXPR; /* say it's an expr */
1532 return 0; /* expr not storable */
1536 if (evalexpr (CF_NONE, hie10, lval) != 0) {
1537 /* Expression is not const, indirect value loaded into primary */
1538 lval->Flags = E_MEXPR;
1539 lval->ConstVal = 0; /* Offset is zero now */
1541 /* If the expression is already a pointer to function, the
1542 * additional dereferencing operator must be ignored.
1544 if (IsTypeFuncPtr (lval->Type)) {
1545 /* Expression not storable */
1548 if (IsClassPtr (lval->Type)) {
1549 lval->Type = Indirect (lval->Type);
1551 Error ("Illegal indirection");
1560 /* The & operator may be applied to any lvalue, and it may be
1561 * applied to functions, even if they're no lvalues.
1563 if (k == 0 && !IsTypeFunc (lval->Type)) {
1564 /* Allow the & operator with an array */
1565 if (!IsTypeArray (lval->Type)) {
1566 Error ("Illegal address");
1569 t = TypeAlloc (TypeLen (lval->Type) + 2);
1571 TypeCpy (t + 1, lval->Type);
1578 if (istypeexpr ()) {
1579 type Type[MAXTYPELEN];
1581 lval->ConstVal = CheckedSizeOf (ParseType (Type));
1584 /* Remember the output queue pointer */
1585 CodeMark Mark = GetCodePos ();
1587 lval->ConstVal = CheckedSizeOf (lval->Type);
1588 /* Remove any generated code */
1591 lval->Flags = E_MCONST | E_TCONST;
1592 lval->Type = type_uint;
1593 lval->Test &= ~E_CC;
1597 if (istypeexpr ()) {
1599 return TypeCast (lval);
1604 switch (CurTok.Tok) {
1606 post_incdec (lval, k, g_inc);
1610 post_incdec (lval, k, g_dec);
1620 static int hie_internal (const GenDesc** ops, /* List of generators */
1621 ExprDesc* lval, /* parent expr's lval */
1622 int (*hienext) (ExprDesc*),
1623 int* UsedGen) /* next higher level */
1624 /* Helper function */
1631 token_t tok; /* The operator token */
1632 unsigned ltype, type;
1633 int rconst; /* Operand is a constant */
1639 while ((Gen = FindGen (CurTok.Tok, ops)) != 0) {
1641 /* Tell the caller that we handled it's ops */
1644 /* All operators that call this function expect an int on the lhs */
1645 if (!IsClassInt (lval->Type)) {
1646 Error ("Integer expression expected");
1649 /* Remember the operator token, then skip it */
1653 /* Get the lhs on stack */
1654 Mark1 = GetCodePos ();
1655 ltype = TypeOf (lval->Type);
1656 if (k == 0 && lval->Flags == E_MCONST) {
1657 /* Constant value */
1658 Mark2 = GetCodePos ();
1659 g_push (ltype | CF_CONST, lval->ConstVal);
1661 /* Value not constant */
1662 exprhs (CF_NONE, k, lval);
1663 Mark2 = GetCodePos ();
1667 /* Get the right hand side */
1668 rconst = (evalexpr (CF_NONE, hienext, &lval2) == 0);
1670 /* Check the type of the rhs */
1671 if (!IsClassInt (lval2.Type)) {
1672 Error ("Integer expression expected");
1675 /* Check for const operands */
1676 if (k == 0 && lval->Flags == E_MCONST && rconst) {
1678 /* Both operands are constant, remove the generated code */
1682 /* Evaluate the result */
1683 lval->ConstVal = kcalc (tok, lval->ConstVal, lval2.ConstVal);
1685 /* Get the type of the result */
1686 lval->Type = promoteint (lval->Type, lval2.Type);
1690 /* If the right hand side is constant, and the generator function
1691 * expects the lhs in the primary, remove the push of the primary
1694 unsigned rtype = TypeOf (lval2.Type);
1697 /* Second value is constant - check for div */
1700 if (tok == TOK_DIV && lval2.ConstVal == 0) {
1701 Error ("Division by zero");
1702 } else if (tok == TOK_MOD && lval2.ConstVal == 0) {
1703 Error ("Modulo operation with zero");
1705 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1708 ltype |= CF_REG; /* Value is in register */
1712 /* Determine the type of the operation result. */
1713 type |= g_typeadjust (ltype, rtype);
1714 lval->Type = promoteint (lval->Type, lval2.Type);
1717 Gen->Func (type, lval2.ConstVal);
1718 lval->Flags = E_MEXPR;
1721 /* We have a rvalue now */
1730 static int hie_compare (const GenDesc** ops, /* List of generators */
1731 ExprDesc* lval, /* parent expr's lval */
1732 int (*hienext) (ExprDesc*))
1733 /* Helper function for the compare operators */
1740 token_t tok; /* The operator token */
1742 int rconst; /* Operand is a constant */
1747 while ((Gen = FindGen (CurTok.Tok, ops)) != 0) {
1749 /* Remember the operator token, then skip it */
1753 /* Get the lhs on stack */
1754 Mark1 = GetCodePos ();
1755 ltype = TypeOf (lval->Type);
1756 if (k == 0 && lval->Flags == E_MCONST) {
1757 /* Constant value */
1758 Mark2 = GetCodePos ();
1759 g_push (ltype | CF_CONST, lval->ConstVal);
1761 /* Value not constant */
1762 exprhs (CF_NONE, k, lval);
1763 Mark2 = GetCodePos ();
1767 /* Get the right hand side */
1768 rconst = (evalexpr (CF_NONE, hienext, &lval2) == 0);
1770 /* Make sure, the types are compatible */
1771 if (IsClassInt (lval->Type)) {
1772 if (!IsClassInt (lval2.Type) && !(IsClassPtr(lval2.Type) && IsNullPtr(lval))) {
1773 Error ("Incompatible types");
1775 } else if (IsClassPtr (lval->Type)) {
1776 if (IsClassPtr (lval2.Type)) {
1777 /* Both pointers are allowed in comparison if they point to
1778 * the same type, or if one of them is a void pointer.
1780 type* left = Indirect (lval->Type);
1781 type* right = Indirect (lval2.Type);
1782 if (TypeCmp (left, right) < TC_EQUAL && *left != T_VOID && *right != T_VOID) {
1783 /* Incomatible pointers */
1784 Error ("Incompatible types");
1786 } else if (!IsNullPtr (&lval2)) {
1787 Error ("Incompatible types");
1791 /* Check for const operands */
1792 if (k == 0 && lval->Flags == E_MCONST && rconst) {
1794 /* Both operands are constant, remove the generated code */
1798 /* Evaluate the result */
1799 lval->ConstVal = kcalc (tok, lval->ConstVal, lval2.ConstVal);
1803 /* If the right hand side is constant, and the generator function
1804 * expects the lhs in the primary, remove the push of the primary
1810 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1813 ltype |= CF_REG; /* Value is in register */
1817 /* Determine the type of the operation result. If the left
1818 * operand is of type char and the right is a constant, or
1819 * if both operands are of type char, we will encode the
1820 * operation as char operation. Otherwise the default
1821 * promotions are used.
1823 if (IsTypeChar (lval->Type) && (IsTypeChar (lval2.Type) || rconst)) {
1825 if (IsSignUnsigned (lval->Type) || IsSignUnsigned (lval2.Type)) {
1826 flags |= CF_UNSIGNED;
1829 flags |= CF_FORCECHAR;
1832 unsigned rtype = TypeOf (lval2.Type) | (flags & CF_CONST);
1833 flags |= g_typeadjust (ltype, rtype);
1837 Gen->Func (flags, lval2.ConstVal);
1838 lval->Flags = E_MEXPR;
1841 /* Result type is always int */
1842 lval->Type = type_int;
1844 /* We have a rvalue now, condition codes are set */
1854 static int hie9 (ExprDesc *lval)
1855 /* Process * and / operators. */
1857 static const GenDesc* hie9_ops [] = {
1858 &GenMUL, &GenDIV, &GenMOD, 0
1862 return hie_internal (hie9_ops, lval, hie10, &UsedGen);
1867 static void parseadd (int k, ExprDesc* lval)
1868 /* Parse an expression with the binary plus operator. lval contains the
1869 * unprocessed left hand side of the expression and will contain the
1870 * result of the expression on return.
1874 unsigned flags; /* Operation flags */
1875 CodeMark Mark; /* Remember code position */
1876 type* lhst; /* Type of left hand side */
1877 type* rhst; /* Type of right hand side */
1880 /* Skip the PLUS token */
1883 /* Get the left hand side type, initialize operation flags */
1887 /* Check for constness on both sides */
1888 if (k == 0 && (lval->Flags & E_MCONST) != 0) {
1890 /* The left hand side is a constant. Good. Get rhs */
1892 if (k == 0 && lval2.Flags == E_MCONST) {
1894 /* Right hand side is also constant. Get the rhs type */
1897 /* Both expressions are constants. Check for pointer arithmetic */
1898 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
1899 /* Left is pointer, right is int, must scale rhs */
1900 lval->ConstVal += lval2.ConstVal * CheckedPSizeOf (lhst);
1901 /* Result type is a pointer */
1902 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
1903 /* Left is int, right is pointer, must scale lhs */
1904 lval->ConstVal = lval->ConstVal * CheckedPSizeOf (rhst) + lval2.ConstVal;
1905 /* Result type is a pointer */
1906 lval->Type = lval2.Type;
1907 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
1908 /* Integer addition */
1909 lval->ConstVal += lval2.ConstVal;
1910 typeadjust (lval, &lval2, 1);
1913 Error ("Invalid operands for binary operator `+'");
1916 /* Result is constant, condition codes not set */
1917 lval->Test &= ~E_CC;
1921 /* lhs is a constant and rhs is not constant. Load rhs into
1924 exprhs (CF_NONE, k, &lval2);
1926 /* Beware: The check above (for lhs) lets not only pass numeric
1927 * constants, but also constant addresses (labels), maybe even
1928 * with an offset. We have to check for that here.
1931 /* First, get the rhs type. */
1935 if (lval->Flags == E_MCONST) {
1936 /* A numerical constant */
1939 /* Constant address label */
1940 flags |= GlobalModeFlags (lval->Flags) | CF_CONSTADDR;
1943 /* Check for pointer arithmetic */
1944 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
1945 /* Left is pointer, right is int, must scale rhs */
1946 g_scale (CF_INT, CheckedPSizeOf (lhst));
1947 /* Operate on pointers, result type is a pointer */
1949 /* Generate the code for the add */
1950 if (lval->Flags == E_MCONST) {
1951 /* Numeric constant */
1952 g_inc (flags, lval->ConstVal);
1954 /* Constant address */
1955 g_addaddr_static (flags, lval->Name, lval->ConstVal);
1957 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
1959 /* Left is int, right is pointer, must scale lhs. */
1960 unsigned ScaleFactor = CheckedPSizeOf (rhst);
1962 /* Operate on pointers, result type is a pointer */
1964 lval->Type = lval2.Type;
1966 /* Since we do already have rhs in the primary, if lhs is
1967 * not a numeric constant, and the scale factor is not one
1968 * (no scaling), we must take the long way over the stack.
1970 if (lval->Flags == E_MCONST) {
1971 /* Numeric constant, scale lhs */
1972 lval->ConstVal *= ScaleFactor;
1973 /* Generate the code for the add */
1974 g_inc (flags, lval->ConstVal);
1975 } else if (ScaleFactor == 1) {
1976 /* Constant address but no need to scale */
1977 g_addaddr_static (flags, lval->Name, lval->ConstVal);
1979 /* Constant address that must be scaled */
1980 g_push (TypeOf (lval2.Type), 0); /* rhs --> stack */
1981 g_getimmed (flags, lval->Name, lval->ConstVal);
1982 g_scale (CF_PTR, ScaleFactor);
1985 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
1986 /* Integer addition */
1987 flags |= typeadjust (lval, &lval2, 1);
1988 /* Generate the code for the add */
1989 if (lval->Flags == E_MCONST) {
1990 /* Numeric constant */
1991 g_inc (flags, lval->ConstVal);
1993 /* Constant address */
1994 g_addaddr_static (flags, lval->Name, lval->ConstVal);
1998 Error ("Invalid operands for binary operator `+'");
2001 /* Result is in primary register */
2002 lval->Flags = E_MEXPR;
2003 lval->Test &= ~E_CC;
2009 /* Left hand side is not constant. Get the value onto the stack. */
2010 exprhs (CF_NONE, k, lval); /* --> primary register */
2011 Mark = GetCodePos ();
2012 g_push (TypeOf (lval->Type), 0); /* --> stack */
2014 /* Evaluate the rhs */
2015 if (evalexpr (CF_NONE, hie9, &lval2) == 0) {
2017 /* Right hand side is a constant. Get the rhs type */
2020 /* Remove pushed value from stack */
2022 pop (TypeOf (lval->Type));
2024 /* Check for pointer arithmetic */
2025 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2026 /* Left is pointer, right is int, must scale rhs */
2027 lval2.ConstVal *= CheckedPSizeOf (lhst);
2028 /* Operate on pointers, result type is a pointer */
2030 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2031 /* Left is int, right is pointer, must scale lhs (ptr only) */
2032 g_scale (CF_INT | CF_CONST, CheckedPSizeOf (rhst));
2033 /* Operate on pointers, result type is a pointer */
2035 lval->Type = lval2.Type;
2036 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2037 /* Integer addition */
2038 flags = typeadjust (lval, &lval2, 1);
2041 Error ("Invalid operands for binary operator `+'");
2044 /* Generate code for the add */
2045 g_inc (flags | CF_CONST, lval2.ConstVal);
2047 /* Result is in primary register */
2048 lval->Flags = E_MEXPR;
2049 lval->Test &= ~E_CC;
2053 /* lhs and rhs are not constant. Get the rhs type. */
2056 /* Check for pointer arithmetic */
2057 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2058 /* Left is pointer, right is int, must scale rhs */
2059 g_scale (CF_INT, CheckedPSizeOf (lhst));
2060 /* Operate on pointers, result type is a pointer */
2062 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2063 /* Left is int, right is pointer, must scale lhs */
2064 g_tosint (TypeOf (rhst)); /* Make sure, TOS is int */
2065 g_swap (CF_INT); /* Swap TOS and primary */
2066 g_scale (CF_INT, CheckedPSizeOf (rhst));
2067 /* Operate on pointers, result type is a pointer */
2069 lval->Type = lval2.Type;
2070 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2071 /* Integer addition. Note: Result is never constant.
2072 * Problem here is that typeadjust does not know if the
2073 * variable is an rvalue or lvalue, so if both operands
2074 * are dereferenced constant numeric addresses, typeadjust
2075 * thinks the operation works on constants. Removing
2076 * CF_CONST here means handling the symptoms, however, the
2077 * whole parser is such a mess that I fear to break anything
2078 * when trying to apply another solution.
2080 flags = typeadjust (lval, &lval2, 0) & ~CF_CONST;
2083 Error ("Invalid operands for binary operator `+'");
2086 /* Generate code for the add */
2089 /* Result is in primary register */
2090 lval->Flags = E_MEXPR;
2091 lval->Test &= ~E_CC;
2100 static void parsesub (int k, ExprDesc* lval)
2101 /* Parse an expression with the binary minus operator. lval contains the
2102 * unprocessed left hand side of the expression and will contain the
2103 * result of the expression on return.
2107 unsigned flags; /* Operation flags */
2108 type* lhst; /* Type of left hand side */
2109 type* rhst; /* Type of right hand side */
2110 CodeMark Mark1; /* Save position of output queue */
2111 CodeMark Mark2; /* Another position in the queue */
2112 int rscale; /* Scale factor for the result */
2115 /* Skip the MINUS token */
2118 /* Get the left hand side type, initialize operation flags */
2121 rscale = 1; /* Scale by 1, that is, don't scale */
2123 /* Remember the output queue position, then bring the value onto the stack */
2124 Mark1 = GetCodePos ();
2125 exprhs (CF_NONE, k, lval); /* --> primary register */
2126 Mark2 = GetCodePos ();
2127 g_push (TypeOf (lhst), 0); /* --> stack */
2129 /* Parse the right hand side */
2130 if (evalexpr (CF_NONE, hie9, &lval2) == 0) {
2132 /* The right hand side is constant. Get the rhs type. */
2135 /* Check left hand side */
2136 if (k == 0 && (lval->Flags & E_MCONST) != 0) {
2138 /* Both sides are constant, remove generated code */
2140 pop (TypeOf (lhst)); /* Clean up the stack */
2142 /* Check for pointer arithmetic */
2143 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2144 /* Left is pointer, right is int, must scale rhs */
2145 lval->ConstVal -= lval2.ConstVal * CheckedPSizeOf (lhst);
2146 /* Operate on pointers, result type is a pointer */
2147 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2148 /* Left is pointer, right is pointer, must scale result */
2149 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2150 Error ("Incompatible pointer types");
2152 lval->ConstVal = (lval->ConstVal - lval2.ConstVal) /
2153 CheckedPSizeOf (lhst);
2155 /* Operate on pointers, result type is an integer */
2156 lval->Type = type_int;
2157 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2158 /* Integer subtraction */
2159 typeadjust (lval, &lval2, 1);
2160 lval->ConstVal -= lval2.ConstVal;
2163 Error ("Invalid operands for binary operator `-'");
2166 /* Result is constant, condition codes not set */
2167 /* lval->Flags = E_MCONST; ### */
2168 lval->Test &= ~E_CC;
2172 /* Left hand side is not constant, right hand side is.
2173 * Remove pushed value from stack.
2176 pop (TypeOf (lhst));
2178 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2179 /* Left is pointer, right is int, must scale rhs */
2180 lval2.ConstVal *= CheckedPSizeOf (lhst);
2181 /* Operate on pointers, result type is a pointer */
2183 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2184 /* Left is pointer, right is pointer, must scale result */
2185 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2186 Error ("Incompatible pointer types");
2188 rscale = CheckedPSizeOf (lhst);
2190 /* Operate on pointers, result type is an integer */
2192 lval->Type = type_int;
2193 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2194 /* Integer subtraction */
2195 flags = typeadjust (lval, &lval2, 1);
2198 Error ("Invalid operands for binary operator `-'");
2201 /* Do the subtraction */
2202 g_dec (flags | CF_CONST, lval2.ConstVal);
2204 /* If this was a pointer subtraction, we must scale the result */
2206 g_scale (flags, -rscale);
2209 /* Result is in primary register */
2210 lval->Flags = E_MEXPR;
2211 lval->Test &= ~E_CC;
2217 /* Right hand side is not constant. Get the rhs type. */
2220 /* Check for pointer arithmetic */
2221 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2222 /* Left is pointer, right is int, must scale rhs */
2223 g_scale (CF_INT, CheckedPSizeOf (lhst));
2224 /* Operate on pointers, result type is a pointer */
2226 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2227 /* Left is pointer, right is pointer, must scale result */
2228 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2229 Error ("Incompatible pointer types");
2231 rscale = CheckedPSizeOf (lhst);
2233 /* Operate on pointers, result type is an integer */
2235 lval->Type = type_int;
2236 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2237 /* Integer subtraction. If the left hand side descriptor says that
2238 * the lhs is const, we have to remove this mark, since this is no
2239 * longer true, lhs is on stack instead.
2241 if (lval->Flags == E_MCONST) {
2242 lval->Flags = E_MEXPR;
2244 /* Adjust operand types */
2245 flags = typeadjust (lval, &lval2, 0);
2248 Error ("Invalid operands for binary operator `-'");
2251 /* Generate code for the sub (the & is a hack here) */
2252 g_sub (flags & ~CF_CONST, 0);
2254 /* If this was a pointer subtraction, we must scale the result */
2256 g_scale (flags, -rscale);
2259 /* Result is in primary register */
2260 lval->Flags = E_MEXPR;
2261 lval->Test &= ~E_CC;
2267 static int hie8 (ExprDesc* lval)
2268 /* Process + and - binary operators. */
2270 int k = hie9 (lval);
2271 while (CurTok.Tok == TOK_PLUS || CurTok.Tok == TOK_MINUS) {
2273 if (CurTok.Tok == TOK_PLUS) {
2286 static int hie7 (ExprDesc *lval)
2287 /* Parse << and >>. */
2289 static const GenDesc* hie7_ops [] = {
2294 return hie_internal (hie7_ops, lval, hie8, &UsedGen);
2299 static int hie6 (ExprDesc *lval)
2300 /* process greater-than type comparators */
2302 static const GenDesc* hie6_ops [] = {
2303 &GenLT, &GenLE, &GenGE, &GenGT, 0
2305 return hie_compare (hie6_ops, lval, hie7);
2310 static int hie5 (ExprDesc *lval)
2312 static const GenDesc* hie5_ops[] = {
2315 return hie_compare (hie5_ops, lval, hie6);
2320 static int hie4 (ExprDesc* lval)
2321 /* Handle & (bitwise and) */
2323 static const GenDesc* hie4_ops [] = {
2328 return hie_internal (hie4_ops, lval, hie5, &UsedGen);
2333 static int hie3 (ExprDesc *lval)
2334 /* Handle ^ (bitwise exclusive or) */
2336 static const GenDesc* hie3_ops [] = {
2341 return hie_internal (hie3_ops, lval, hie4, &UsedGen);
2346 static int hie2 (ExprDesc *lval)
2347 /* Handle | (bitwise or) */
2349 static const GenDesc* hie2_ops [] = {
2354 return hie_internal (hie2_ops, lval, hie3, &UsedGen);
2359 static int hieAndPP (ExprDesc* lval)
2360 /* Process "exp && exp" in preprocessor mode (that is, when the parser is
2361 * called recursively from the preprocessor.
2366 ConstSubExpr (hie2, lval);
2367 while (CurTok.Tok == TOK_BOOL_AND) {
2369 /* Left hand side must be an int */
2370 if (!IsClassInt (lval->Type)) {
2371 Error ("Left hand side must be of integer type");
2372 MakeConstIntExpr (lval, 1);
2379 ConstSubExpr (hie2, &lval2);
2381 /* Since we are in PP mode, all we know about is integers */
2382 if (!IsClassInt (lval2.Type)) {
2383 Error ("Right hand side must be of integer type");
2384 MakeConstIntExpr (&lval2, 1);
2387 /* Combine the two */
2388 lval->ConstVal = (lval->ConstVal && lval2.ConstVal);
2391 /* Always a rvalue */
2397 static int hieOrPP (ExprDesc *lval)
2398 /* Process "exp || exp" in preprocessor mode (that is, when the parser is
2399 * called recursively from the preprocessor.
2404 ConstSubExpr (hieAndPP, lval);
2405 while (CurTok.Tok == TOK_BOOL_OR) {
2407 /* Left hand side must be an int */
2408 if (!IsClassInt (lval->Type)) {
2409 Error ("Left hand side must be of integer type");
2410 MakeConstIntExpr (lval, 1);
2417 ConstSubExpr (hieAndPP, &lval2);
2419 /* Since we are in PP mode, all we know about is integers */
2420 if (!IsClassInt (lval2.Type)) {
2421 Error ("Right hand side must be of integer type");
2422 MakeConstIntExpr (&lval2, 1);
2425 /* Combine the two */
2426 lval->ConstVal = (lval->ConstVal || lval2.ConstVal);
2429 /* Always a rvalue */
2435 static int hieAnd (ExprDesc* lval, unsigned TrueLab, int* BoolOp)
2436 /* Process "exp && exp" */
2443 if (CurTok.Tok == TOK_BOOL_AND) {
2445 /* Tell our caller that we're evaluating a boolean */
2448 /* Get a label that we will use for false expressions */
2449 lab = GetLocalLabel ();
2451 /* If the expr hasn't set condition codes, set the force-test flag */
2452 if ((lval->Test & E_CC) == 0) {
2453 lval->Test |= E_FORCETEST;
2456 /* Load the value */
2457 exprhs (CF_FORCECHAR, k, lval);
2459 /* Generate the jump */
2460 g_falsejump (CF_NONE, lab);
2462 /* Parse more boolean and's */
2463 while (CurTok.Tok == TOK_BOOL_AND) {
2470 if ((lval2.Test & E_CC) == 0) {
2471 lval2.Test |= E_FORCETEST;
2473 exprhs (CF_FORCECHAR, k, &lval2);
2475 /* Do short circuit evaluation */
2476 if (CurTok.Tok == TOK_BOOL_AND) {
2477 g_falsejump (CF_NONE, lab);
2479 /* Last expression - will evaluate to true */
2480 g_truejump (CF_NONE, TrueLab);
2484 /* Define the false jump label here */
2485 g_defcodelabel (lab);
2487 /* Define the label */
2488 lval->Flags = E_MEXPR;
2489 lval->Test |= E_CC; /* Condition codes are set */
2497 static int hieOr (ExprDesc *lval)
2498 /* Process "exp || exp". */
2502 int BoolOp = 0; /* Did we have a boolean op? */
2503 int AndOp; /* Did we have a && operation? */
2504 unsigned TrueLab; /* Jump to this label if true */
2508 TrueLab = GetLocalLabel ();
2510 /* Call the next level parser */
2511 k = hieAnd (lval, TrueLab, &BoolOp);
2513 /* Any boolean or's? */
2514 if (CurTok.Tok == TOK_BOOL_OR) {
2516 /* If the expr hasn't set condition codes, set the force-test flag */
2517 if ((lval->Test & E_CC) == 0) {
2518 lval->Test |= E_FORCETEST;
2521 /* Get first expr */
2522 exprhs (CF_FORCECHAR, k, lval);
2524 /* For each expression jump to TrueLab if true. Beware: If we
2525 * had && operators, the jump is already in place!
2528 g_truejump (CF_NONE, TrueLab);
2531 /* Remember that we had a boolean op */
2534 /* while there's more expr */
2535 while (CurTok.Tok == TOK_BOOL_OR) {
2542 k = hieAnd (&lval2, TrueLab, &AndOp);
2543 if ((lval2.Test & E_CC) == 0) {
2544 lval2.Test |= E_FORCETEST;
2546 exprhs (CF_FORCECHAR, k, &lval2);
2548 /* If there is more to come, add shortcut boolean eval. */
2549 g_truejump (CF_NONE, TrueLab);
2552 lval->Flags = E_MEXPR;
2553 lval->Test |= E_CC; /* Condition codes are set */
2557 /* If we really had boolean ops, generate the end sequence */
2559 DoneLab = GetLocalLabel ();
2560 g_getimmed (CF_INT | CF_CONST, 0, 0); /* Load FALSE */
2561 g_falsejump (CF_NONE, DoneLab);
2562 g_defcodelabel (TrueLab);
2563 g_getimmed (CF_INT | CF_CONST, 1, 0); /* Load TRUE */
2564 g_defcodelabel (DoneLab);
2571 static int hieQuest (ExprDesc *lval)
2572 /* Parse "lvalue ? exp : exp" */
2577 ExprDesc lval2; /* Expression 2 */
2578 ExprDesc lval3; /* Expression 3 */
2579 type* type2; /* Type of expression 2 */
2580 type* type3; /* Type of expression 3 */
2581 type* rtype; /* Type of result */
2584 k = Preprocessing? hieOrPP (lval) : hieOr (lval);
2585 if (CurTok.Tok == TOK_QUEST) {
2587 if ((lval->Test & E_CC) == 0) {
2588 /* Condition codes not set, force a test */
2589 lval->Test |= E_FORCETEST;
2591 exprhs (CF_NONE, k, lval);
2592 labf = GetLocalLabel ();
2593 g_falsejump (CF_NONE, labf);
2595 /* Parse second expression */
2596 k = expr (hie1, &lval2);
2598 if (!IsTypeVoid (lval2.Type)) {
2599 /* Load it into the primary */
2600 exprhs (CF_NONE, k, &lval2);
2602 labt = GetLocalLabel ();
2606 /* Parse the third expression */
2607 g_defcodelabel (labf);
2608 k = expr (hie1, &lval3);
2610 if (!IsTypeVoid (lval3.Type)) {
2611 /* Load it into the primary */
2612 exprhs (CF_NONE, k, &lval3);
2615 /* Check if any conversions are needed, if so, do them.
2616 * Conversion rules for ?: expression are:
2617 * - if both expressions are int expressions, default promotion
2618 * rules for ints apply.
2619 * - if both expressions are pointers of the same type, the
2620 * result of the expression is of this type.
2621 * - if one of the expressions is a pointer and the other is
2622 * a zero constant, the resulting type is that of the pointer
2624 * - if both expressions are void expressions, the result is of
2626 * - all other cases are flagged by an error.
2628 if (IsClassInt (type2) && IsClassInt (type3)) {
2630 /* Get common type */
2631 rtype = promoteint (type2, type3);
2633 /* Convert the third expression to this type if needed */
2634 g_typecast (TypeOf (rtype), TypeOf (type3));
2636 /* Setup a new label so that the expr3 code will jump around
2637 * the type cast code for expr2.
2639 labf = GetLocalLabel (); /* Get new label */
2640 g_jump (labf); /* Jump around code */
2642 /* The jump for expr2 goes here */
2643 g_defcodelabel (labt);
2645 /* Create the typecast code for expr2 */
2646 g_typecast (TypeOf (rtype), TypeOf (type2));
2648 /* Jump here around the typecase code. */
2649 g_defcodelabel (labf);
2650 labt = 0; /* Mark other label as invalid */
2652 } else if (IsClassPtr (type2) && IsClassPtr (type3)) {
2653 /* Must point to same type */
2654 if (TypeCmp (Indirect (type2), Indirect (type3)) < TC_EQUAL) {
2655 Error ("Incompatible pointer types");
2657 /* Result has the common type */
2659 } else if (IsClassPtr (type2) && IsNullPtr (&lval3)) {
2660 /* Result type is pointer, no cast needed */
2662 } else if (IsNullPtr (&lval2) && IsClassPtr (type3)) {
2663 /* Result type is pointer, no cast needed */
2665 } else if (IsTypeVoid (type2) && IsTypeVoid (type3)) {
2666 /* Result type is void */
2669 Error ("Incompatible types");
2670 rtype = lval2.Type; /* Doesn't matter here */
2673 /* If we don't have the label defined until now, do it */
2675 g_defcodelabel (labt);
2678 /* Setup the target expression */
2679 lval->Flags = E_MEXPR;
2688 static void opeq (const GenDesc* Gen, ExprDesc *lval, int k)
2689 /* Process "op=" operators. */
2698 Error ("Invalid lvalue in assignment");
2702 /* Determine the type of the lhs */
2703 flags = TypeOf (lval->Type);
2704 MustScale = (Gen->Func == g_add || Gen->Func == g_sub) &&
2705 lval->Type [0] == T_PTR;
2707 /* Get the lhs address on stack (if needed) */
2710 /* Fetch the lhs into the primary register if needed */
2711 exprhs (CF_NONE, k, lval);
2713 /* Bring the lhs on stack */
2714 Mark = GetCodePos ();
2717 /* Evaluate the rhs */
2718 if (evalexpr (CF_NONE, hie1, &lval2) == 0) {
2719 /* The resulting value is a constant. If the generator has the NOPUSH
2720 * flag set, don't push the lhs.
2722 if (Gen->Flags & GEN_NOPUSH) {
2727 /* lhs is a pointer, scale rhs */
2728 lval2.ConstVal *= CheckedSizeOf (lval->Type+1);
2731 /* If the lhs is character sized, the operation may be later done
2734 if (CheckedSizeOf (lval->Type) == SIZEOF_CHAR) {
2735 flags |= CF_FORCECHAR;
2738 /* Special handling for add and sub - some sort of a hack, but short code */
2739 if (Gen->Func == g_add) {
2740 g_inc (flags | CF_CONST, lval2.ConstVal);
2741 } else if (Gen->Func == g_sub) {
2742 g_dec (flags | CF_CONST, lval2.ConstVal);
2744 Gen->Func (flags | CF_CONST, lval2.ConstVal);
2747 /* rhs is not constant and already in the primary register */
2749 /* lhs is a pointer, scale rhs */
2750 g_scale (TypeOf (lval2.Type), CheckedSizeOf (lval->Type+1));
2753 /* If the lhs is character sized, the operation may be later done
2756 if (CheckedSizeOf (lval->Type) == SIZEOF_CHAR) {
2757 flags |= CF_FORCECHAR;
2760 /* Adjust the types of the operands if needed */
2761 Gen->Func (g_typeadjust (flags, TypeOf (lval2.Type)), 0);
2764 lval->Flags = E_MEXPR;
2769 static void addsubeq (const GenDesc* Gen, ExprDesc *lval, int k)
2770 /* Process the += and -= operators */
2778 /* We must have an lvalue */
2780 Error ("Invalid lvalue in assignment");
2784 /* We're currently only able to handle some adressing modes */
2785 if ((lval->Flags & E_MGLOBAL) == 0 && /* Global address? */
2786 (lval->Flags & E_MLOCAL) == 0 && /* Local address? */
2787 (lval->Flags & E_MCONST) == 0) { /* Constant address? */
2788 /* Use generic routine */
2789 opeq (Gen, lval, k);
2793 /* Skip the operator */
2796 /* Check if we have a pointer expression and must scale rhs */
2797 MustScale = (lval->Type [0] == T_PTR);
2799 /* Initialize the code generator flags */
2803 /* Evaluate the rhs */
2804 if (evalexpr (CF_NONE, hie1, &lval2) == 0) {
2805 /* The resulting value is a constant. */
2807 /* lhs is a pointer, scale rhs */
2808 lval2.ConstVal *= CheckedSizeOf (lval->Type+1);
2813 /* rhs is not constant and already in the primary register */
2815 /* lhs is a pointer, scale rhs */
2816 g_scale (TypeOf (lval2.Type), CheckedSizeOf (lval->Type+1));
2820 /* Setup the code generator flags */
2821 lflags |= TypeOf (lval->Type) | CF_FORCECHAR;
2822 rflags |= TypeOf (lval2.Type);
2824 /* Cast the rhs to the type of the lhs */
2825 g_typecast (lflags, rflags);
2827 /* Output apropriate code */
2828 if (lval->Flags & E_MGLOBAL) {
2829 /* Static variable */
2830 lflags |= GlobalModeFlags (lval->Flags);
2831 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2832 g_addeqstatic (lflags, lval->Name, lval->ConstVal, lval2.ConstVal);
2834 g_subeqstatic (lflags, lval->Name, lval->ConstVal, lval2.ConstVal);
2836 } else if (lval->Flags & E_MLOCAL) {
2837 /* ref to localvar */
2838 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2839 g_addeqlocal (lflags, lval->ConstVal, lval2.ConstVal);
2841 g_subeqlocal (lflags, lval->ConstVal, lval2.ConstVal);
2843 } else if (lval->Flags & E_MCONST) {
2844 /* ref to absolute address */
2845 lflags |= CF_ABSOLUTE;
2846 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2847 g_addeqstatic (lflags, lval->ConstVal, 0, lval2.ConstVal);
2849 g_subeqstatic (lflags, lval->ConstVal, 0, lval2.ConstVal);
2851 } else if (lval->Flags & E_MEXPR) {
2852 /* Address in a/x. */
2853 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2854 g_addeqind (lflags, lval->ConstVal, lval2.ConstVal);
2856 g_subeqind (lflags, lval->ConstVal, lval2.ConstVal);
2859 Internal ("Invalid addressing mode");
2862 /* Expression is in the primary now */
2863 lval->Flags = E_MEXPR;
2868 int hie1 (ExprDesc* lval)
2869 /* Parse first level of expression hierarchy. */
2873 k = hieQuest (lval);
2874 switch (CurTok.Tok) {
2883 Error ("Invalid lvalue in assignment");
2889 case TOK_PLUS_ASSIGN:
2890 addsubeq (&GenPASGN, lval, k);
2893 case TOK_MINUS_ASSIGN:
2894 addsubeq (&GenSASGN, lval, k);
2897 case TOK_MUL_ASSIGN:
2898 opeq (&GenMASGN, lval, k);
2901 case TOK_DIV_ASSIGN:
2902 opeq (&GenDASGN, lval, k);
2905 case TOK_MOD_ASSIGN:
2906 opeq (&GenMOASGN, lval, k);
2909 case TOK_SHL_ASSIGN:
2910 opeq (&GenSLASGN, lval, k);
2913 case TOK_SHR_ASSIGN:
2914 opeq (&GenSRASGN, lval, k);
2917 case TOK_AND_ASSIGN:
2918 opeq (&GenAASGN, lval, k);
2921 case TOK_XOR_ASSIGN:
2922 opeq (&GenXOASGN, lval, k);
2926 opeq (&GenOASGN, lval, k);
2937 int hie0 (ExprDesc *lval)
2938 /* Parse comma operator. */
2940 int k = hie1 (lval);
2941 while (CurTok.Tok == TOK_COMMA) {
2950 int evalexpr (unsigned flags, int (*f) (ExprDesc*), ExprDesc* lval)
2951 /* Will evaluate an expression via the given function. If the result is a
2952 * constant, 0 is returned and the value is put in the lval struct. If the
2953 * result is not constant, exprhs is called to bring the value into the
2954 * primary register and 1 is returned.
2961 if (k == 0 && lval->Flags == E_MCONST) {
2962 /* Constant expression */
2965 /* Not constant, load into the primary */
2966 exprhs (flags, k, lval);
2973 static int expr (int (*func) (ExprDesc*), ExprDesc *lval)
2974 /* Expression parser; func is either hie0 or hie1. */
2983 /* Do some checks if code generation is still constistent */
2984 if (savsp != oursp) {
2986 fprintf (stderr, "oursp != savesp (%d != %d)\n", oursp, savsp);
2988 Internal ("oursp != savsp (%d != %d)", oursp, savsp);
2996 void expression1 (ExprDesc* lval)
2997 /* Evaluate an expression on level 1 (no comma operator) and put it into
2998 * the primary register
3001 InitExprDesc (lval);
3002 exprhs (CF_NONE, expr (hie1, lval), lval);
3007 void expression (ExprDesc* lval)
3008 /* Evaluate an expression and put it into the primary register */
3010 InitExprDesc (lval);
3011 exprhs (CF_NONE, expr (hie0, lval), lval);
3016 void ConstExpr (ExprDesc* lval)
3017 /* Get a constant value */
3019 InitExprDesc (lval);
3020 if (expr (hie1, lval) != 0 || (lval->Flags & E_MCONST) == 0) {
3021 Error ("Constant expression expected");
3022 /* To avoid any compiler errors, make the expression a valid const */
3023 MakeConstIntExpr (lval, 1);
3029 void ConstIntExpr (ExprDesc* Val)
3030 /* Get a constant int value */
3033 if (expr (hie1, Val) != 0 ||
3034 (Val->Flags & E_MCONST) == 0 ||
3035 !IsClassInt (Val->Type)) {
3036 Error ("Constant integer expression expected");
3037 /* To avoid any compiler errors, make the expression a valid const */
3038 MakeConstIntExpr (Val, 1);
3044 void intexpr (ExprDesc* lval)
3045 /* Get an integer expression */
3048 if (!IsClassInt (lval->Type)) {
3049 Error ("Integer expression expected");
3050 /* To avoid any compiler errors, make the expression a valid int */
3051 MakeConstIntExpr (lval, 1);
3057 void Test (unsigned Label, int Invert)
3058 /* Evaluate a boolean test expression and jump depending on the result of
3059 * the test and on Invert.
3065 /* Evaluate the expression */
3066 k = expr (hie0, InitExprDesc (&lval));
3068 /* Check for a boolean expression */
3069 CheckBoolExpr (&lval);
3071 /* Check for a constant expression */
3072 if (k == 0 && lval.Flags == E_MCONST) {
3074 /* Constant rvalue */
3075 if (!Invert && lval.ConstVal == 0) {
3077 Warning ("Unreachable code");
3078 } else if (Invert && lval.ConstVal != 0) {
3084 /* If the expr hasn't set condition codes, set the force-test flag */
3085 if ((lval.Test & E_CC) == 0) {
3086 lval.Test |= E_FORCETEST;
3089 /* Load the value into the primary register */
3090 exprhs (CF_FORCECHAR, k, &lval);
3092 /* Generate the jump */
3094 g_truejump (CF_NONE, Label);
3096 g_falsejump (CF_NONE, Label);
3103 void TestInParens (unsigned Label, int Invert)
3104 /* Evaluate a boolean test expression in parenthesis and jump depending on
3105 * the result of the test * and on Invert.
3108 /* Eat the parenthesis */
3112 Test (Label, Invert);
3114 /* Check for the closing brace */