4 * Ullrich von Bassewitz, 21.06.1998
39 /*****************************************************************************/
41 /*****************************************************************************/
45 /* Generator attributes */
46 #define GEN_NOPUSH 0x01 /* Don't push lhs */
48 /* Map a generator function and its attributes to a token */
50 token_t Tok; /* Token to map to */
51 unsigned Flags; /* Flags for generator function */
52 void (*Func) (unsigned, unsigned long); /* Generator func */
55 /* Descriptors for the operations */
56 static GenDesc GenMUL = { TOK_STAR, GEN_NOPUSH, g_mul };
57 static GenDesc GenDIV = { TOK_DIV, GEN_NOPUSH, g_div };
58 static GenDesc GenMOD = { TOK_MOD, GEN_NOPUSH, g_mod };
59 static GenDesc GenASL = { TOK_SHL, GEN_NOPUSH, g_asl };
60 static GenDesc GenASR = { TOK_SHR, GEN_NOPUSH, g_asr };
61 static GenDesc GenLT = { TOK_LT, GEN_NOPUSH, g_lt };
62 static GenDesc GenLE = { TOK_LE, GEN_NOPUSH, g_le };
63 static GenDesc GenGE = { TOK_GE, GEN_NOPUSH, g_ge };
64 static GenDesc GenGT = { TOK_GT, GEN_NOPUSH, g_gt };
65 static GenDesc GenEQ = { TOK_EQ, GEN_NOPUSH, g_eq };
66 static GenDesc GenNE = { TOK_NE, GEN_NOPUSH, g_ne };
67 static GenDesc GenAND = { TOK_AND, GEN_NOPUSH, g_and };
68 static GenDesc GenXOR = { TOK_XOR, GEN_NOPUSH, g_xor };
69 static GenDesc GenOR = { TOK_OR, GEN_NOPUSH, g_or };
70 static GenDesc GenPASGN = { TOK_PLUS_ASSIGN, GEN_NOPUSH, g_add };
71 static GenDesc GenSASGN = { TOK_MINUS_ASSIGN, GEN_NOPUSH, g_sub };
72 static GenDesc GenMASGN = { TOK_MUL_ASSIGN, GEN_NOPUSH, g_mul };
73 static GenDesc GenDASGN = { TOK_DIV_ASSIGN, GEN_NOPUSH, g_div };
74 static GenDesc GenMOASGN = { TOK_MOD_ASSIGN, GEN_NOPUSH, g_mod };
75 static GenDesc GenSLASGN = { TOK_SHL_ASSIGN, GEN_NOPUSH, g_asl };
76 static GenDesc GenSRASGN = { TOK_SHR_ASSIGN, GEN_NOPUSH, g_asr };
77 static GenDesc GenAASGN = { TOK_AND_ASSIGN, GEN_NOPUSH, g_and };
78 static GenDesc GenXOASGN = { TOK_XOR_ASSIGN, GEN_NOPUSH, g_xor };
79 static GenDesc GenOASGN = { TOK_OR_ASSIGN, GEN_NOPUSH, g_or };
83 /*****************************************************************************/
84 /* Function forwards */
85 /*****************************************************************************/
89 static int hie10 (ExprDesc* lval);
90 /* Handle ++, --, !, unary - etc. */
94 /*****************************************************************************/
95 /* Helper functions */
96 /*****************************************************************************/
100 static unsigned GlobalModeFlags (unsigned flags)
101 /* Return the addressing mode flags for the variable with the given flags */
104 if (flags == E_TGLAB) {
105 /* External linkage */
107 } else if (flags == E_TREGISTER) {
108 /* Register variable */
118 static int IsNullPtr (ExprDesc* lval)
119 /* Return true if this is the NULL pointer constant */
121 return (IsClassInt (lval->Type) && /* Is it an int? */
122 lval->Flags == E_MCONST && /* Is it constant? */
123 lval->ConstVal == 0); /* And is it's value zero? */
128 static type* promoteint (type* lhst, type* rhst)
129 /* In an expression with two ints, return the type of the result */
131 /* Rules for integer types:
132 * - If one of the values is a long, the result is long.
133 * - If one of the values is unsigned, the result is also unsigned.
134 * - Otherwise the result is an int.
136 if (IsTypeLong (lhst) || IsTypeLong (rhst)) {
137 if (IsSignUnsigned (lhst) || IsSignUnsigned (rhst)) {
143 if (IsSignUnsigned (lhst) || IsSignUnsigned (rhst)) {
153 static unsigned typeadjust (ExprDesc* lhs, ExprDesc* rhs, int NoPush)
154 /* Adjust the two values for a binary operation. lhs is expected on stack or
155 * to be constant, rhs is expected to be in the primary register or constant.
156 * The function will put the type of the result into lhs and return the
157 * code generator flags for the operation.
158 * If NoPush is given, it is assumed that the operation does not expect the lhs
159 * to be on stack, and that lhs is in a register instead.
160 * Beware: The function does only accept int types.
163 unsigned ltype, rtype;
166 /* Get the type strings */
167 type* lhst = lhs->Type;
168 type* rhst = rhs->Type;
170 /* Generate type adjustment code if needed */
171 ltype = TypeOf (lhst);
172 if (lhs->Flags == E_MCONST) {
176 /* Value is in primary register*/
179 rtype = TypeOf (rhst);
180 if (rhs->Flags == E_MCONST) {
183 flags = g_typeadjust (ltype, rtype);
185 /* Set the type of the result */
186 lhs->Type = promoteint (lhst, rhst);
188 /* Return the code generator flags */
194 unsigned assignadjust (type* lhst, ExprDesc* rhs)
195 /* Adjust the type of the right hand expression so that it can be assigned to
196 * the type on the left hand side. This function is used for assignment and
197 * for converting parameters in a function call. It returns the code generator
198 * flags for the operation. The type string of the right hand side will be
199 * set to the type of the left hand side.
202 /* Get the type of the right hand side. Treat function types as
203 * pointer-to-function
205 type* rhst = rhs->Type;
206 if (IsTypeFunc (rhst)) {
207 rhst = PointerTo (rhst);
210 /* After calling this function, rhs will have the type of the lhs */
213 /* First, do some type checking */
214 if (IsTypeVoid (lhst) || IsTypeVoid (rhst)) {
215 /* If one of the sides are of type void, output a more apropriate
218 Error ("Illegal type");
219 } else if (IsClassInt (lhst)) {
220 if (IsClassPtr (rhst)) {
221 /* Pointer -> int conversion */
222 Warning ("Converting pointer to integer without a cast");
223 } else if (!IsClassInt (rhst)) {
224 Error ("Incompatible types");
226 /* Adjust the int types. To avoid manipulation of TOS mark lhs
229 unsigned flags = TypeOf (rhst);
230 if (rhs->Flags == E_MCONST) {
233 return g_typeadjust (TypeOf (lhst) | CF_CONST, flags);
235 } else if (IsClassPtr (lhst)) {
236 if (IsClassPtr (rhst)) {
237 /* Pointer to pointer assignment is valid, if:
238 * - both point to the same types, or
239 * - the rhs pointer is a void pointer, or
240 * - the lhs pointer is a void pointer.
242 if (!IsTypeVoid (Indirect (lhst)) && !IsTypeVoid (Indirect (rhst))) {
243 /* Compare the types */
244 switch (TypeCmp (lhst, rhst)) {
246 case TC_INCOMPATIBLE:
247 Error ("Incompatible pointer types");
251 Error ("Pointer types differ in type qualifiers");
259 } else if (IsClassInt (rhst)) {
260 /* Int to pointer assignment is valid only for constant zero */
261 if (rhs->Flags != E_MCONST || rhs->ConstVal != 0) {
262 Warning ("Converting integer to pointer without a cast");
264 } else if (IsTypeFuncPtr (lhst) && IsTypeFunc(rhst)) {
265 /* Assignment of function to function pointer is allowed, provided
266 * that both functions have the same parameter list.
268 if (TypeCmp (Indirect (lhst), rhst) < TC_EQUAL) {
269 Error ("Incompatible types");
272 Error ("Incompatible types");
275 Error ("Incompatible types");
278 /* Return an int value in all cases where the operands are not both ints */
284 void DefineData (ExprDesc* lval)
285 /* Output a data definition for the given expression */
287 unsigned flags = lval->Flags;
289 switch (flags & E_MCTYPE) {
293 g_defdata (TypeOf (lval->Type) | CF_CONST, lval->ConstVal, 0);
297 /* Register variable. Taking the address is usually not
300 if (!AllowRegVarAddr) {
301 Error ("Cannot take the address of a register variable");
307 /* Local or global symbol */
308 g_defdata (GlobalModeFlags (flags), lval->Name, lval->ConstVal);
312 /* a literal of some kind */
313 g_defdata (CF_STATIC, LiteralPoolLabel, lval->ConstVal);
317 Internal ("Unknown constant type: %04X", flags);
323 static void lconst (unsigned flags, ExprDesc* lval)
324 /* Load primary reg with some constant value. */
326 switch (lval->Flags & E_MCTYPE) {
329 g_leasp (lval->ConstVal);
333 /* Number constant */
334 g_getimmed (flags | TypeOf (lval->Type) | CF_CONST, lval->ConstVal, 0);
338 /* Register variable. Taking the address is usually not
341 if (!AllowRegVarAddr) {
342 Error ("Cannot take the address of a register variable");
348 /* Local or global symbol, load address */
349 flags |= GlobalModeFlags (lval->Flags);
351 g_getimmed (flags, lval->Name, lval->ConstVal);
356 g_getimmed (CF_STATIC, LiteralPoolLabel, lval->ConstVal);
360 Internal ("Unknown constant type: %04X", lval->Flags);
366 static int kcalc (int tok, long val1, long val2)
367 /* Calculate an operation with left and right operand constant. */
371 return (val1 == val2);
373 return (val1 != val2);
375 return (val1 < val2);
377 return (val1 <= val2);
379 return (val1 >= val2);
381 return (val1 > val2);
383 return (val1 | val2);
385 return (val1 ^ val2);
387 return (val1 & val2);
389 return (val1 >> val2);
391 return (val1 << val2);
393 return (val1 * val2);
396 Error ("Division by zero");
399 return (val1 / val2);
402 Error ("Modulo operation with zero");
405 return (val1 % val2);
407 Internal ("kcalc: got token 0x%X\n", tok);
414 static GenDesc* FindGen (token_t Tok, GenDesc** Table)
417 while ((G = *Table) != 0) {
428 static int istypeexpr (void)
429 /* Return true if some sort of variable or type is waiting (helper for cast
430 * and sizeof() in hie10).
435 return CurTok.Tok == TOK_LPAREN && (
436 (NextTok.Tok >= TOK_FIRSTTYPE && NextTok.Tok <= TOK_LASTTYPE) ||
437 (NextTok.Tok == TOK_CONST) ||
438 (NextTok.Tok == TOK_IDENT &&
439 (Entry = FindSym (NextTok.Ident)) != 0 &&
445 static void PushAddr (ExprDesc* lval)
446 /* If the expression contains an address that was somehow evaluated,
447 * push this address on the stack. This is a helper function for all
448 * sorts of implicit or explicit assignment functions where the lvalue
449 * must be saved if it's not constant, before evaluating the rhs.
452 /* Get the address on stack if needed */
453 if (lval->Flags != E_MREG && (lval->Flags & E_MEXPR)) {
454 /* Push the address (always a pointer) */
461 static void MakeConstIntExpr (ExprDesc* Expr, long Value)
462 /* Make Expr a constant integer expression with the given value */
464 Expr->Flags = E_MCONST;
465 Expr->Type = type_int;
466 Expr->ConstVal = Value;
471 void ConstSubExpr (int (*F) (ExprDesc*), ExprDesc* Expr)
472 /* Will evaluate an expression via the given function. If the result is not
473 * a constant, a diagnostic will be printed, and the value is replaced by
474 * a constant one to make sure there are no internal errors that result
475 * from this input error.
478 memset (Expr, 0, sizeof (*Expr));
479 if (F (Expr) != 0 || Expr->Flags != E_MCONST) {
480 Error ("Constant expression expected");
481 /* To avoid any compiler errors, make the expression a valid const */
482 MakeConstIntExpr (Expr, 1);
488 /*****************************************************************************/
490 /*****************************************************************************/
494 void exprhs (unsigned flags, int k, ExprDesc *lval)
495 /* Put the result of an expression into the primary register */
501 /* Dereferenced lvalue */
502 flags |= TypeOf (lval->Type);
503 if (lval->Test & E_FORCETEST) {
505 lval->Test &= ~E_FORCETEST;
507 if (f & E_MGLOBAL) { /* ref to globalvar */
509 flags |= GlobalModeFlags (f);
510 g_getstatic (flags, lval->Name, lval->ConstVal);
511 } else if (f & E_MLOCAL) {
512 /* ref to localvar */
513 g_getlocal (flags, lval->ConstVal);
514 } else if (f & E_MCONST) {
515 /* ref to absolute address */
516 g_getstatic (flags | CF_ABSOLUTE, lval->ConstVal, 0);
517 } else if (f == E_MEOFFS) {
518 g_getind (flags, lval->ConstVal);
519 } else if (f != E_MREG) {
522 } else if (f == E_MEOFFS) {
523 /* reference not storable */
524 flags |= TypeOf (lval->Type);
525 g_inc (flags | CF_CONST, lval->ConstVal);
526 } else if ((f & E_MEXPR) == 0) {
527 /* Constant of some sort, load it into the primary */
528 lconst (flags, lval);
530 if (lval->Test & E_FORCETEST) { /* we testing this value? */
532 flags |= TypeOf (lval->Type);
533 g_test (flags); /* yes, force a test */
534 lval->Test &= ~E_FORCETEST;
540 static unsigned FunctionParamList (FuncDesc* Func)
541 /* Parse a function parameter list and pass the parameters to the called
542 * function. Depending on several criteria this may be done by just pushing
543 * each parameter separately, or creating the parameter frame once and then
544 * storing into this frame.
545 * The function returns the size of the parameters pushed.
550 /* Initialize variables */
551 SymEntry* Param = 0; /* Keep gcc silent */
552 unsigned ParamSize = 0; /* Size of parameters pushed */
553 unsigned ParamCount = 0; /* Number of parameters pushed */
554 unsigned FrameSize = 0; /* Size of parameter frame */
555 unsigned FrameParams = 0; /* Number of params in frame */
556 int FrameOffs = 0; /* Offset into parameter frame */
557 int Ellipsis = 0; /* Function is variadic */
559 /* As an optimization, we may allocate the complete parameter frame at
560 * once instead of pushing each parameter as it comes. We may do that,
563 * - optimizations that increase code size are enabled (allocating the
564 * stack frame at once gives usually larger code).
565 * - we have more than one parameter to push (don't count the last param
566 * for __fastcall__ functions).
568 if (CodeSizeFactor >= 200) {
570 /* Calculate the number and size of the parameters */
571 FrameParams = Func->ParamCount;
572 FrameSize = Func->ParamSize;
573 if (FrameParams > 0 && (Func->Flags & FD_FASTCALL) != 0) {
574 /* Last parameter is not pushed */
575 const SymEntry* LastParam = Func->SymTab->SymTail;
576 FrameSize -= SizeOf (LastParam->Type);
580 /* Do we have more than one parameter in the frame? */
581 if (FrameParams > 1) {
582 /* Okeydokey, setup the frame */
587 /* Don't use a preallocated frame */
592 /* Parse the actual parameter list */
593 while (CurTok.Tok != TOK_RPAREN) {
598 /* Count arguments */
601 /* Fetch the pointer to the next argument, check for too many args */
602 if (ParamCount <= Func->ParamCount) {
603 /* Beware: If there are parameters with identical names, they
604 * cannot go into the same symbol table, which means that in this
605 * case of errorneous input, the number of nodes in the symbol
606 * table and ParamCount are NOT equal. We have to handle this case
607 * below to avoid segmentation violations. Since we know that this
608 * problem can only occur if there is more than one parameter,
609 * we will just use the last one.
611 if (ParamCount == 1) {
613 Param = Func->SymTab->SymHead;
614 } else if (Param->NextSym != 0) {
616 Param = Param->NextSym;
617 CHECK ((Param->Flags & SC_PARAM) != 0);
619 } else if (!Ellipsis) {
620 /* Too many arguments. Do we have an open param list? */
621 if ((Func->Flags & FD_VARIADIC) == 0) {
622 /* End of param list reached, no ellipsis */
623 Error ("Too many arguments in function call");
625 /* Assume an ellipsis even in case of errors to avoid an error
626 * message for each other argument.
631 /* Do some optimization: If we have a constant value to push,
632 * use a special function that may optimize.
635 if (!Ellipsis && SizeOf (Param->Type) == 1) {
636 CFlags = CF_FORCECHAR;
639 if (evalexpr (CFlags, hie1, &lval) == 0) {
640 /* A constant value */
644 /* If we don't have an argument spec, accept anything, otherwise
645 * convert the actual argument to the type needed.
648 /* Promote the argument if needed */
649 assignadjust (Param->Type, &lval);
651 /* If we have a prototype, chars may be pushed as chars */
652 Flags |= CF_FORCECHAR;
655 /* Use the type of the argument for the push */
656 Flags |= TypeOf (lval.Type);
658 /* If this is a fastcall function, don't push the last argument */
659 if (ParamCount == Func->ParamCount && (Func->Flags & FD_FASTCALL) != 0) {
660 /* Just load the argument into the primary. This is only needed if
661 * we have a constant argument, otherwise the value is already in
664 if (Flags & CF_CONST) {
665 exprhs (CF_FORCECHAR, 0, &lval);
668 unsigned ArgSize = sizeofarg (Flags);
670 /* We have the space already allocated, store in the frame */
671 CHECK (FrameSize >= ArgSize);
672 FrameSize -= ArgSize;
673 FrameOffs -= ArgSize;
675 g_putlocal (Flags | CF_NOKEEP, FrameOffs, lval.ConstVal);
677 /* Push the argument */
678 g_push (Flags, lval.ConstVal);
681 /* Calculate total parameter size */
682 ParamSize += ArgSize;
685 /* Check for end of argument list */
686 if (CurTok.Tok != TOK_COMMA) {
692 /* Check if we had enough parameters */
693 if (ParamCount < Func->ParamCount) {
694 Error ("Too few arguments in function call");
697 /* The function returns the size of all parameters pushed onto the stack.
698 * However, if there are parameters missing (which is an error and was
699 * flagged by the compiler) AND a stack frame was preallocated above,
700 * we would loose track of the stackpointer and generate an internal error
701 * later. So we correct the value by the parameters that should have been
702 * pushed to avoid an internal compiler error. Since an error was
703 * generated before, no code will be output anyway.
705 return ParamSize + FrameSize;
710 static void FunctionCall (int k, ExprDesc* lval)
711 /* Perform a function call. */
713 FuncDesc* Func; /* Function descriptor */
714 int IsFuncPtr; /* Flag */
715 unsigned ParamSize; /* Number of parameter bytes */
716 CodeMark Mark = 0; /* Initialize to keep gcc silent */
717 int PtrOffs = 0; /* Offset of function pointer on stack */
718 int IsFastCall = 0; /* True if it's a fast call function */
719 int PtrOnStack = 0; /* True if a pointer copy is on stack */
721 /* Get a pointer to the function descriptor from the type string */
722 Func = GetFuncDesc (lval->Type);
724 /* Handle function pointers transparently */
725 IsFuncPtr = IsTypeFuncPtr (lval->Type);
728 /* Check wether it's a fastcall function */
729 IsFastCall = IsFastCallFunc (lval->Type + 1);
731 /* Things may be difficult, depending on where the function pointer
732 * resides. If the function pointer is an expression of some sort
733 * (not a local or global variable), we have to evaluate this
734 * expression now and save the result for later. Since calls to
735 * function pointers may be nested, we must save it onto the stack.
736 * For fastcall functions we do also need to place a copy of the
737 * pointer on stack, since we cannot use a/x.
739 PtrOnStack = IsFastCall || ((lval->Flags & (E_MGLOBAL | E_MLOCAL)) == 0);
742 /* Not a global or local variable, or a fastcall function. Load
743 * the pointer into the primary and mark it as an expression.
745 exprhs (CF_NONE, k, lval);
746 lval->Flags |= E_MEXPR;
748 /* Remember the code position */
749 Mark = GetCodePos ();
751 /* Push the pointer onto the stack and remember the offset */
756 /* Check for known standard functions and inline them if requested */
757 } else if (InlineStdFuncs && IsStdFunc ((const char*) lval->Name)) {
759 /* Inline this function */
760 HandleStdFunc (lval);
765 /* Parse the parameter list */
766 ParamSize = FunctionParamList (Func);
768 /* We need the closing paren here */
771 /* Special handling for function pointers */
774 /* If the function is not a fastcall function, load the pointer to
775 * the function into the primary.
779 /* Not a fastcall function - we may use the primary */
781 /* If we have no parameters, the pointer is still in the
782 * primary. Remove the code to push it and correct the
785 if (ParamSize == 0) {
790 /* Load from the saved copy */
791 g_getlocal (CF_PTR, PtrOffs);
794 /* Load from original location */
795 exprhs (CF_NONE, k, lval);
798 /* Call the function */
799 g_callind (TypeOf (lval->Type), ParamSize, PtrOffs);
803 /* Fastcall function. We cannot use the primary for the function
804 * pointer and must therefore use an offset to the stack location.
805 * Since fastcall functions may never be variadic, we can use the
806 * index register for this purpose.
808 g_callind (CF_LOCAL, ParamSize, PtrOffs);
811 /* If we have a pointer on stack, remove it */
813 g_space (- (int) sizeofarg (CF_PTR));
822 /* Normal function */
823 g_call (TypeOf (lval->Type), (const char*) lval->Name, ParamSize);
830 static int primary (ExprDesc* lval)
831 /* This is the lowest level of the expression parser. */
835 /* not a test at all, yet */
838 /* Character and integer constants. */
839 if (CurTok.Tok == TOK_ICONST || CurTok.Tok == TOK_CCONST) {
840 lval->Flags = E_MCONST | E_TCONST;
841 lval->Type = CurTok.Type;
842 lval->ConstVal = CurTok.IVal;
847 /* Process parenthesized subexpression by calling the whole parser
850 if (CurTok.Tok == TOK_LPAREN) {
852 memset (lval, 0, sizeof (*lval)); /* Remove any attributes */
858 /* All others may only be used if the expression evaluation is not called
859 * recursively by the preprocessor.
862 /* Illegal expression in PP mode */
863 Error ("Preprocessor expression expected");
864 MakeConstIntExpr (lval, 1);
869 if (CurTok.Tok == TOK_IDENT) {
874 /* Get a pointer to the symbol table entry */
875 Sym = FindSym (CurTok.Ident);
877 /* Is the symbol known? */
880 /* We found the symbol - skip the name token */
883 /* The expression type is the symbol type */
884 lval->Type = Sym->Type;
886 /* Check for illegal symbol types */
887 CHECK ((Sym->Flags & SC_LABEL) != SC_LABEL);
888 if (Sym->Flags & SC_TYPE) {
889 /* Cannot use type symbols */
890 Error ("Variable identifier expected");
891 /* Assume an int type to make lval valid */
892 lval->Flags = E_MLOCAL | E_TLOFFS;
893 lval->Type = type_int;
898 /* Check for legal symbol types */
899 if ((Sym->Flags & SC_CONST) == SC_CONST) {
900 /* Enum or some other numeric constant */
901 lval->Flags = E_MCONST;
902 lval->ConstVal = Sym->V.ConstVal;
904 } else if ((Sym->Flags & SC_FUNC) == SC_FUNC) {
906 lval->Flags = E_MGLOBAL | E_MCONST | E_TGLAB;
907 lval->Name = (unsigned long) Sym->Name;
909 } else if ((Sym->Flags & SC_AUTO) == SC_AUTO) {
910 /* Local variable. If this is a parameter for a variadic
911 * function, we have to add some address calculations, and the
912 * address is not const.
914 if ((Sym->Flags & SC_PARAM) == SC_PARAM && IsVariadic (CurrentFunc)) {
915 /* Variadic parameter */
916 g_leavariadic (Sym->V.Offs - GetParamSize (CurrentFunc));
917 lval->Flags = E_MEXPR;
920 /* Normal parameter */
921 lval->Flags = E_MLOCAL | E_TLOFFS;
922 lval->ConstVal = Sym->V.Offs;
924 } else if ((Sym->Flags & SC_STATIC) == SC_STATIC) {
925 /* Static variable */
926 if (Sym->Flags & (SC_EXTERN | SC_STORAGE)) {
927 lval->Flags = E_MGLOBAL | E_MCONST | E_TGLAB;
928 lval->Name = (unsigned long) Sym->Name;
930 lval->Flags = E_MGLOBAL | E_MCONST | E_TLLAB;
931 lval->Name = Sym->V.Label;
934 } else if ((Sym->Flags & SC_REGISTER) == SC_REGISTER) {
935 /* Register variable, zero page based */
936 lval->Flags = E_MGLOBAL | E_MCONST | E_TREGISTER;
937 lval->Name = Sym->V.Offs;
940 /* Local static variable */
941 lval->Flags = E_MGLOBAL | E_MCONST | E_TLLAB;
942 lval->Name = Sym->V.Offs;
946 /* The symbol is referenced now */
947 Sym->Flags |= SC_REF;
948 if (IsTypeFunc (lval->Type) || IsTypeArray (lval->Type)) {
954 /* We did not find the symbol. Remember the name, then skip it */
955 strcpy (Ident, CurTok.Ident);
958 /* IDENT is either an auto-declared function or an undefined variable. */
959 if (CurTok.Tok == TOK_LPAREN) {
960 /* Declare a function returning int. For that purpose, prepare a
961 * function signature for a function having an empty param list
964 Warning ("Function call without a prototype");
965 Sym = AddGlobalSym (Ident, GetImplicitFuncType(), SC_EXTERN | SC_REF | SC_FUNC);
966 lval->Type = Sym->Type;
967 lval->Flags = E_MGLOBAL | E_MCONST | E_TGLAB;
968 lval->Name = (unsigned long) Sym->Name;
974 /* Undeclared Variable */
975 Sym = AddLocalSym (Ident, type_int, SC_AUTO | SC_REF, 0);
976 lval->Flags = E_MLOCAL | E_TLOFFS;
977 lval->Type = type_int;
979 Error ("Undefined symbol: `%s'", Ident);
985 /* String literal? */
986 if (CurTok.Tok == TOK_SCONST) {
987 lval->Flags = E_MCONST | E_TLIT;
988 lval->ConstVal = CurTok.IVal;
989 lval->Type = GetCharArrayType (strlen (GetLiteral (CurTok.IVal)));
995 if (CurTok.Tok == TOK_ASM) {
997 lval->Type = type_void;
998 lval->Flags = E_MEXPR;
1003 /* __AX__ and __EAX__ pseudo values? */
1004 if (CurTok.Tok == TOK_AX || CurTok.Tok == TOK_EAX) {
1005 lval->Type = (CurTok.Tok == TOK_AX)? type_uint : type_ulong;
1006 lval->Flags = E_MREG;
1007 lval->Test &= ~E_CC;
1010 return 1; /* May be used as lvalue */
1013 /* Illegal primary. */
1014 Error ("Expression expected");
1015 MakeConstIntExpr (lval, 1);
1021 static int arrayref (int k, ExprDesc* lval)
1022 /* Handle an array reference */
1036 /* Skip the bracket */
1039 /* Get the type of left side */
1042 /* We can apply a special treatment for arrays that have a const base
1043 * address. This is true for most arrays and will produce a lot better
1044 * code. Check if this is a const base address.
1046 lflags = lval->Flags & ~E_MCTYPE;
1047 ConstBaseAddr = (lflags == E_MCONST) || /* Constant numeric address */
1048 (lflags & E_MGLOBAL) != 0 || /* Static array, or ... */
1049 lflags == E_MLOCAL; /* Local array */
1051 /* If we have a constant base, we delay the address fetch */
1052 Mark1 = GetCodePos ();
1053 Mark2 = 0; /* Silence gcc */
1054 if (!ConstBaseAddr) {
1055 /* Get a pointer to the array into the primary */
1056 exprhs (CF_NONE, k, lval);
1058 /* Get the array pointer on stack. Do not push more than 16
1059 * bit, even if this value is greater, since we cannot handle
1060 * other than 16bit stuff when doing indexing.
1062 Mark2 = GetCodePos ();
1066 /* TOS now contains ptr to array elements. Get the subscript. */
1068 if (l == 0 && lval2.Flags == E_MCONST) {
1070 /* The array subscript is a constant - remove value from stack */
1071 if (!ConstBaseAddr) {
1075 /* Get an array pointer into the primary */
1076 exprhs (CF_NONE, k, lval);
1079 if (IsClassPtr (tptr1)) {
1081 /* Scale the subscript value according to element size */
1082 lval2.ConstVal *= PSizeOf (tptr1);
1084 /* Remove code for lhs load */
1087 /* Handle constant base array on stack. Be sure NOT to
1088 * handle pointers the same way, this won't work.
1090 if (IsTypeArray (tptr1) &&
1091 ((lval->Flags & ~E_MCTYPE) == E_MCONST ||
1092 (lval->Flags & ~E_MCTYPE) == E_MLOCAL ||
1093 (lval->Flags & E_MGLOBAL) != 0 ||
1094 (lval->Flags == E_MEOFFS))) {
1095 lval->ConstVal += lval2.ConstVal;
1098 /* Pointer - load into primary and remember offset */
1099 if ((lval->Flags & E_MEXPR) == 0 || k != 0) {
1100 exprhs (CF_NONE, k, lval);
1102 lval->ConstVal = lval2.ConstVal;
1103 lval->Flags = E_MEOFFS;
1106 /* Result is of element type */
1107 lval->Type = Indirect (tptr1);
1112 } else if (IsClassPtr (tptr2 = lval2.Type)) {
1113 /* Subscript is pointer, get element type */
1114 lval2.Type = Indirect (tptr2);
1116 /* Scale the rhs value in the primary register */
1117 g_scale (TypeOf (tptr1), SizeOf (lval2.Type));
1119 lval->Type = lval2.Type;
1121 Error ("Cannot subscript");
1124 /* Add the subscript. Since arrays are indexed by integers,
1125 * we will ignore the true type of the subscript here and
1126 * use always an int.
1128 g_inc (CF_INT | CF_CONST, lval2.ConstVal);
1132 /* Array subscript is not constant. Load it into the primary */
1133 Mark2 = GetCodePos ();
1134 exprhs (CF_NONE, l, &lval2);
1137 if (IsClassPtr (tptr1)) {
1139 /* Get the element type */
1140 lval->Type = Indirect (tptr1);
1142 /* Indexing is based on int's, so we will just use the integer
1143 * portion of the index (which is in (e)ax, so there's no further
1146 g_scale (CF_INT, SizeOf (lval->Type));
1148 } else if (IsClassPtr (tptr2)) {
1150 /* Get the element type */
1151 lval2.Type = Indirect (tptr2);
1153 /* Get the int value on top. If we go here, we're sure,
1154 * both values are 16 bit (the first one was truncated
1155 * if necessary and the second one is a pointer).
1156 * Note: If ConstBaseAddr is true, we don't have a value on
1157 * stack, so to "swap" both, just push the subscript.
1159 if (ConstBaseAddr) {
1161 exprhs (CF_NONE, k, lval);
1168 g_scale (TypeOf (tptr1), SizeOf (lval2.Type));
1169 lval->Type = lval2.Type;
1171 Error ("Cannot subscript");
1174 /* The offset is now in the primary register. It didn't have a
1175 * constant base address for the lhs, the lhs address is already
1176 * on stack, and we must add the offset. If the base address was
1177 * constant, we call special functions to add the address to the
1180 if (!ConstBaseAddr) {
1181 /* Add the subscript. Both values are int sized. */
1185 /* If the subscript has itself a constant address, it is often
1186 * a better idea to reverse again the order of the evaluation.
1187 * This will generate better code if the subscript is a byte
1188 * sized variable. But beware: This is only possible if the
1189 * subscript was not scaled, that is, if this was a byte array
1192 rflags = lval2.Flags & ~E_MCTYPE;
1193 ConstSubAddr = (rflags == E_MCONST) || /* Constant numeric address */
1194 (rflags & E_MGLOBAL) != 0 || /* Static array, or ... */
1195 rflags == E_MLOCAL; /* Local array */
1197 if (ConstSubAddr && SizeOf (lval->Type) == 1) {
1201 /* Reverse the order of evaluation */
1202 unsigned flags = (SizeOf (lval2.Type) == 1)? CF_CHAR : CF_INT;
1205 /* Get a pointer to the array into the primary. We have changed
1206 * Type above but we need the original type to load the
1207 * address, so restore it temporarily.
1209 SavedType = lval->Type;
1211 exprhs (CF_NONE, k, lval);
1212 lval->Type = SavedType;
1214 /* Add the variable */
1215 if (rflags == E_MLOCAL) {
1216 g_addlocal (flags, lval2.ConstVal);
1218 flags |= GlobalModeFlags (lval2.Flags);
1219 g_addstatic (flags, lval2.Name, lval2.ConstVal);
1222 if (lflags == E_MCONST) {
1223 /* Constant numeric address. Just add it */
1224 g_inc (CF_INT | CF_UNSIGNED, lval->ConstVal);
1225 } else if (lflags == E_MLOCAL) {
1226 /* Base address is a local variable address */
1227 if (IsTypeArray (tptr1)) {
1228 g_addaddr_local (CF_INT, lval->ConstVal);
1230 g_addlocal (CF_PTR, lval->ConstVal);
1233 /* Base address is a static variable address */
1234 unsigned flags = CF_INT;
1235 flags |= GlobalModeFlags (lval->Flags);
1236 if (IsTypeArray (tptr1)) {
1237 g_addaddr_static (flags, lval->Name, lval->ConstVal);
1239 g_addstatic (flags, lval->Name, lval->ConstVal);
1245 lval->Flags = E_MEXPR;
1248 return !IsTypeArray (lval->Type);
1254 static int structref (int k, ExprDesc* lval)
1255 /* Process struct field after . or ->. */
1261 /* Skip the token and check for an identifier */
1263 if (CurTok.Tok != TOK_IDENT) {
1264 Error ("Identifier expected");
1265 lval->Type = type_int;
1269 /* Get the symbol table entry and check for a struct field */
1270 strcpy (Ident, CurTok.Ident);
1272 Field = FindStructField (lval->Type, Ident);
1274 Error ("Struct/union has no field named `%s'", Ident);
1275 lval->Type = type_int;
1279 /* If we have constant input data, the result is also constant */
1280 flags = lval->Flags & ~E_MCTYPE;
1281 if (flags == E_MCONST ||
1282 (k == 0 && (flags == E_MLOCAL ||
1283 (flags & E_MGLOBAL) != 0 ||
1284 lval->Flags == E_MEOFFS))) {
1285 lval->ConstVal += Field->V.Offs;
1287 if ((flags & E_MEXPR) == 0 || k != 0) {
1288 exprhs (CF_NONE, k, lval);
1290 lval->ConstVal = Field->V.Offs;
1291 lval->Flags = E_MEOFFS;
1293 lval->Type = Field->Type;
1294 return !IsTypeArray (Field->Type);
1299 static int hie11 (ExprDesc *lval)
1300 /* Handle compound types (structs and arrays) */
1307 if (CurTok.Tok < TOK_LBRACK || CurTok.Tok > TOK_PTR_REF) {
1314 if (CurTok.Tok == TOK_LBRACK) {
1316 /* Array reference */
1317 k = arrayref (k, lval);
1319 } else if (CurTok.Tok == TOK_LPAREN) {
1321 /* Function call. Skip the opening parenthesis */
1324 if (IsTypeFunc (lval->Type) || IsTypeFuncPtr (lval->Type)) {
1326 /* Call the function */
1327 FunctionCall (k, lval);
1329 /* Result is in the primary register */
1330 lval->Flags = E_MEXPR;
1333 lval->Type = GetFuncReturn (lval->Type);
1336 Error ("Illegal function call");
1340 } else if (CurTok.Tok == TOK_DOT) {
1342 if (!IsClassStruct (lval->Type)) {
1343 Error ("Struct expected");
1345 k = structref (0, lval);
1347 } else if (CurTok.Tok == TOK_PTR_REF) {
1350 if (tptr[0] != T_PTR || (tptr[1] & T_STRUCT) == 0) {
1351 Error ("Struct pointer expected");
1353 k = structref (k, lval);
1363 static void store (ExprDesc* lval)
1364 /* Store primary reg into this reference */
1370 flags = TypeOf (lval->Type);
1371 if (f & E_MGLOBAL) {
1372 flags |= GlobalModeFlags (f);
1379 g_putstatic (flags, lval->Name, lval->ConstVal);
1381 } else if (f & E_MLOCAL) {
1382 g_putlocal (flags, lval->ConstVal, 0);
1383 } else if (f == E_MEOFFS) {
1384 g_putind (flags, lval->ConstVal);
1385 } else if (f != E_MREG) {
1387 g_putind (flags, 0);
1389 /* Store into absolute address */
1390 g_putstatic (flags | CF_ABSOLUTE, lval->ConstVal, 0);
1394 /* Assume that each one of the stores will invalidate CC */
1395 lval->Test &= ~E_CC;
1400 static void pre_incdec (ExprDesc* lval, void (*inc) (unsigned, unsigned long))
1401 /* Handle --i and ++i */
1408 if ((k = hie10 (lval)) == 0) {
1409 Error ("Invalid lvalue");
1413 /* Get the data type */
1414 flags = TypeOf (lval->Type) | CF_FORCECHAR | CF_CONST;
1416 /* Get the increment value in bytes */
1417 val = (lval->Type [0] == T_PTR)? PSizeOf (lval->Type) : 1;
1419 /* We're currently only able to handle some adressing modes */
1420 if ((lval->Flags & E_MGLOBAL) == 0 && /* Global address? */
1421 (lval->Flags & E_MLOCAL) == 0 && /* Local address? */
1422 (lval->Flags & E_MCONST) == 0 && /* Constant address? */
1423 (lval->Flags & E_MEXPR) == 0) { /* Address in a/x? */
1425 /* Use generic code. Push the address if needed */
1428 /* Fetch the value */
1429 exprhs (CF_NONE, k, lval);
1431 /* Increment value in primary */
1434 /* Store the result back */
1439 /* Special code for some addressing modes - use the special += ops */
1440 if (lval->Flags & E_MGLOBAL) {
1441 flags |= GlobalModeFlags (lval->Flags);
1443 g_addeqstatic (flags, lval->Name, lval->ConstVal, val);
1445 g_subeqstatic (flags, lval->Name, lval->ConstVal, val);
1447 } else if (lval->Flags & E_MLOCAL) {
1448 /* ref to localvar */
1450 g_addeqlocal (flags, lval->ConstVal, val);
1452 g_subeqlocal (flags, lval->ConstVal, val);
1454 } else if (lval->Flags & E_MCONST) {
1455 /* ref to absolute address */
1456 flags |= CF_ABSOLUTE;
1458 g_addeqstatic (flags, lval->ConstVal, 0, val);
1460 g_subeqstatic (flags, lval->ConstVal, 0, val);
1462 } else if (lval->Flags & E_MEXPR) {
1463 /* Address in a/x, check if we have an offset */
1464 unsigned Offs = (lval->Flags == E_MEOFFS)? lval->ConstVal : 0;
1466 g_addeqind (flags, Offs, val);
1468 g_subeqind (flags, Offs, val);
1471 Internal ("Invalid addressing mode");
1476 /* Result is an expression */
1477 lval->Flags = E_MEXPR;
1482 static void post_incdec (ExprDesc *lval, int k, void (*inc) (unsigned, unsigned long))
1483 /* Handle i-- and i++ */
1489 Error ("Invalid lvalue");
1493 /* Get the data type */
1494 flags = TypeOf (lval->Type);
1496 /* Push the address if needed */
1499 /* Fetch the value and save it (since it's the result of the expression) */
1500 exprhs (CF_NONE, 1, lval);
1501 g_save (flags | CF_FORCECHAR);
1503 /* If we have a pointer expression, increment by the size of the type */
1504 if (lval->Type[0] == T_PTR) {
1505 inc (flags | CF_CONST | CF_FORCECHAR, SizeOf (lval->Type + 1));
1507 inc (flags | CF_CONST | CF_FORCECHAR, 1);
1510 /* Store the result back */
1513 /* Restore the original value */
1514 g_restore (flags | CF_FORCECHAR);
1515 lval->Flags = E_MEXPR;
1520 static void unaryop (int tok, ExprDesc* lval)
1521 /* Handle unary -/+ and ~ */
1528 if (k == 0 && (lval->Flags & E_MCONST) != 0) {
1529 /* Value is constant */
1531 case TOK_MINUS: lval->ConstVal = -lval->ConstVal; break;
1532 case TOK_PLUS: break;
1533 case TOK_COMP: lval->ConstVal = ~lval->ConstVal; break;
1534 default: Internal ("Unexpected token: %d", tok);
1537 /* Value is not constant */
1538 exprhs (CF_NONE, k, lval);
1540 /* Get the type of the expression */
1541 flags = TypeOf (lval->Type);
1543 /* Handle the operation */
1545 case TOK_MINUS: g_neg (flags); break;
1546 case TOK_PLUS: break;
1547 case TOK_COMP: g_com (flags); break;
1548 default: Internal ("Unexpected token: %d", tok);
1550 lval->Flags = E_MEXPR;
1556 static int typecast (ExprDesc* lval)
1557 /* Handle an explicit cast */
1560 type Type[MAXTYPELEN];
1562 /* Skip the left paren */
1571 /* Read the expression we have to cast */
1574 /* If the expression is a function, treat it as pointer-to-function */
1575 if (IsTypeFunc (lval->Type)) {
1576 lval->Type = PointerTo (lval->Type);
1579 /* Check for a constant on the right side */
1580 if (k == 0 && lval->Flags == E_MCONST) {
1582 /* A cast of a constant to something else. If the new type is an int,
1583 * be sure to handle the size extension correctly. If the new type is
1584 * not an int, the cast is implementation specific anyway, so leave
1587 if (IsClassInt (Type)) {
1589 /* Get the current and new size of the value */
1590 unsigned OldSize = SizeOf (lval->Type);
1591 unsigned NewSize = SizeOf (Type);
1592 unsigned OldBits = OldSize * 8;
1593 unsigned NewBits = NewSize * 8;
1595 /* Check if the new datatype will have a smaller range */
1596 if (NewSize < OldSize) {
1598 /* Cut the value to the new size */
1599 lval->ConstVal &= (0xFFFFFFFFUL >> (32 - NewBits));
1601 /* If the new value is signed, sign extend the value */
1602 if (!IsSignUnsigned (Type)) {
1603 lval->ConstVal |= ((~0L) << NewBits);
1606 } else if (NewSize > OldSize) {
1608 /* Sign extend the value if needed */
1609 if (!IsSignUnsigned (Type) && !IsSignUnsigned (lval->Type)) {
1610 if (lval->ConstVal & (0x01UL << (OldBits-1))) {
1611 lval->ConstVal |= ((~0L) << OldBits);
1619 /* Not a constant. Be sure to ignore casts to void */
1620 if (!IsTypeVoid (Type)) {
1622 /* If the size does not change, leave the value alone. Otherwise,
1623 * we have to load the value into the primary and generate code to
1624 * cast the value in the primary register.
1626 if (SizeOf (Type) != SizeOf (lval->Type)) {
1628 /* Load the value into the primary */
1629 exprhs (CF_NONE, k, lval);
1631 /* Mark the lhs as const to avoid a manipulation of TOS */
1632 g_typecast (TypeOf (Type) | CF_CONST, TypeOf (lval->Type));
1634 /* Value is now in primary */
1635 lval->Flags = E_MEXPR;
1641 /* In any case, use the new type */
1642 lval->Type = TypeDup (Type);
1650 static int hie10 (ExprDesc* lval)
1651 /* Handle ++, --, !, unary - etc. */
1656 switch (CurTok.Tok) {
1659 pre_incdec (lval, g_inc);
1663 pre_incdec (lval, g_dec);
1669 unaryop (CurTok.Tok, lval);
1674 if (evalexpr (CF_NONE, hie10, lval) == 0) {
1675 /* Constant expression */
1676 lval->ConstVal = !lval->ConstVal;
1678 g_bneg (TypeOf (lval->Type));
1679 lval->Test |= E_CC; /* bneg will set cc */
1680 lval->Flags = E_MEXPR; /* say it's an expr */
1682 return 0; /* expr not storable */
1686 if (evalexpr (CF_NONE, hie10, lval) != 0) {
1687 /* Expression is not const, indirect value loaded into primary */
1688 lval->Flags = E_MEXPR;
1689 lval->ConstVal = 0; /* Offset is zero now */
1692 if (IsClassPtr (t)) {
1693 lval->Type = Indirect (t);
1695 Error ("Illegal indirection");
1702 /* The & operator may be applied to any lvalue, and it may be
1703 * applied to functions, even if they're no lvalues.
1705 if (k == 0 && !IsTypeFunc (lval->Type)) {
1706 /* Allow the & operator with an array */
1707 if (!IsTypeArray (lval->Type)) {
1708 Error ("Illegal address");
1711 t = TypeAlloc (TypeLen (lval->Type) + 2);
1713 TypeCpy (t + 1, lval->Type);
1720 if (istypeexpr ()) {
1721 type Type[MAXTYPELEN];
1723 lval->ConstVal = SizeOf (ParseType (Type));
1726 /* Remember the output queue pointer */
1727 CodeMark Mark = GetCodePos ();
1729 lval->ConstVal = SizeOf (lval->Type);
1730 /* Remove any generated code */
1733 lval->Flags = E_MCONST | E_TCONST;
1734 lval->Type = type_uint;
1735 lval->Test &= ~E_CC;
1739 if (istypeexpr ()) {
1741 return typecast (lval);
1746 switch (CurTok.Tok) {
1748 post_incdec (lval, k, g_inc);
1752 post_incdec (lval, k, g_dec);
1762 static int hie_internal (GenDesc** ops, /* List of generators */
1763 ExprDesc* lval, /* parent expr's lval */
1764 int (*hienext) (ExprDesc*),
1765 int* UsedGen) /* next higher level */
1766 /* Helper function */
1773 token_t tok; /* The operator token */
1774 unsigned ltype, type;
1775 int rconst; /* Operand is a constant */
1781 while ((Gen = FindGen (CurTok.Tok, ops)) != 0) {
1783 /* Tell the caller that we handled it's ops */
1786 /* All operators that call this function expect an int on the lhs */
1787 if (!IsClassInt (lval->Type)) {
1788 Error ("Integer expression expected");
1791 /* Remember the operator token, then skip it */
1795 /* Get the lhs on stack */
1796 Mark1 = GetCodePos ();
1797 ltype = TypeOf (lval->Type);
1798 if (k == 0 && lval->Flags == E_MCONST) {
1799 /* Constant value */
1800 Mark2 = GetCodePos ();
1801 g_push (ltype | CF_CONST, lval->ConstVal);
1803 /* Value not constant */
1804 exprhs (CF_NONE, k, lval);
1805 Mark2 = GetCodePos ();
1809 /* Get the right hand side */
1810 rconst = (evalexpr (CF_NONE, hienext, &lval2) == 0);
1812 /* Check the type of the rhs */
1813 if (!IsClassInt (lval2.Type)) {
1814 Error ("Integer expression expected");
1817 /* Check for const operands */
1818 if (k == 0 && lval->Flags == E_MCONST && rconst) {
1820 /* Both operands are constant, remove the generated code */
1824 /* Evaluate the result */
1825 lval->ConstVal = kcalc (tok, lval->ConstVal, lval2.ConstVal);
1827 /* Get the type of the result */
1828 lval->Type = promoteint (lval->Type, lval2.Type);
1832 /* If the right hand side is constant, and the generator function
1833 * expects the lhs in the primary, remove the push of the primary
1836 unsigned rtype = TypeOf (lval2.Type);
1839 /* Second value is constant - check for div */
1842 if (tok == TOK_DIV && lval2.ConstVal == 0) {
1843 Error ("Division by zero");
1844 } else if (tok == TOK_MOD && lval2.ConstVal == 0) {
1845 Error ("Modulo operation with zero");
1847 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1850 ltype |= CF_REG; /* Value is in register */
1854 /* Determine the type of the operation result. */
1855 type |= g_typeadjust (ltype, rtype);
1856 lval->Type = promoteint (lval->Type, lval2.Type);
1859 Gen->Func (type, lval2.ConstVal);
1860 lval->Flags = E_MEXPR;
1863 /* We have a rvalue now */
1872 static int hie_compare (GenDesc** ops, /* List of generators */
1873 ExprDesc* lval, /* parent expr's lval */
1874 int (*hienext) (ExprDesc*))
1875 /* Helper function for the compare operators */
1882 token_t tok; /* The operator token */
1884 int rconst; /* Operand is a constant */
1889 while ((Gen = FindGen (CurTok.Tok, ops)) != 0) {
1891 /* Remember the operator token, then skip it */
1895 /* Get the lhs on stack */
1896 Mark1 = GetCodePos ();
1897 ltype = TypeOf (lval->Type);
1898 if (k == 0 && lval->Flags == E_MCONST) {
1899 /* Constant value */
1900 Mark2 = GetCodePos ();
1901 g_push (ltype | CF_CONST, lval->ConstVal);
1903 /* Value not constant */
1904 exprhs (CF_NONE, k, lval);
1905 Mark2 = GetCodePos ();
1909 /* Get the right hand side */
1910 rconst = (evalexpr (CF_NONE, hienext, &lval2) == 0);
1912 /* Make sure, the types are compatible */
1913 if (IsClassInt (lval->Type)) {
1914 if (!IsClassInt (lval2.Type) && !(IsClassPtr(lval2.Type) && IsNullPtr(lval))) {
1915 Error ("Incompatible types");
1917 } else if (IsClassPtr (lval->Type)) {
1918 if (IsClassPtr (lval2.Type)) {
1919 /* Both pointers are allowed in comparison if they point to
1920 * the same type, or if one of them is a void pointer.
1922 type* left = Indirect (lval->Type);
1923 type* right = Indirect (lval2.Type);
1924 if (TypeCmp (left, right) < TC_EQUAL && *left != T_VOID && *right != T_VOID) {
1925 /* Incomatible pointers */
1926 Error ("Incompatible types");
1928 } else if (!IsNullPtr (&lval2)) {
1929 Error ("Incompatible types");
1933 /* Check for const operands */
1934 if (k == 0 && lval->Flags == E_MCONST && rconst) {
1936 /* Both operands are constant, remove the generated code */
1940 /* Evaluate the result */
1941 lval->ConstVal = kcalc (tok, lval->ConstVal, lval2.ConstVal);
1945 /* If the right hand side is constant, and the generator function
1946 * expects the lhs in the primary, remove the push of the primary
1952 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1955 ltype |= CF_REG; /* Value is in register */
1959 /* Determine the type of the operation result. If the left
1960 * operand is of type char and the right is a constant, or
1961 * if both operands are of type char, we will encode the
1962 * operation as char operation. Otherwise the default
1963 * promotions are used.
1965 if (IsTypeChar (lval->Type) && (IsTypeChar (lval2.Type) || rconst)) {
1967 if (IsSignUnsigned (lval->Type) || IsSignUnsigned (lval2.Type)) {
1968 flags |= CF_UNSIGNED;
1971 flags |= CF_FORCECHAR;
1974 unsigned rtype = TypeOf (lval2.Type) | (flags & CF_CONST);
1975 flags |= g_typeadjust (ltype, rtype);
1979 Gen->Func (flags, lval2.ConstVal);
1980 lval->Flags = E_MEXPR;
1983 /* Result type is always int */
1984 lval->Type = type_int;
1986 /* We have a rvalue now, condition codes are set */
1996 static int hie9 (ExprDesc *lval)
1997 /* Process * and / operators. */
1999 static GenDesc* hie9_ops [] = {
2000 &GenMUL, &GenDIV, &GenMOD, 0
2004 return hie_internal (hie9_ops, lval, hie10, &UsedGen);
2009 static void parseadd (int k, ExprDesc* lval)
2010 /* Parse an expression with the binary plus operator. lval contains the
2011 * unprocessed left hand side of the expression and will contain the
2012 * result of the expression on return.
2016 unsigned flags; /* Operation flags */
2017 CodeMark Mark; /* Remember code position */
2018 type* lhst; /* Type of left hand side */
2019 type* rhst; /* Type of right hand side */
2022 /* Skip the PLUS token */
2025 /* Get the left hand side type, initialize operation flags */
2029 /* Check for constness on both sides */
2030 if (k == 0 && (lval->Flags & E_MCONST) != 0) {
2032 /* The left hand side is a constant. Good. Get rhs */
2033 if (evalexpr (CF_NONE, hie9, &lval2) == 0) {
2035 /* Right hand side is also constant. Get the rhs type */
2038 /* Both expressions are constants. Check for pointer arithmetic */
2039 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2040 /* Left is pointer, right is int, must scale rhs */
2041 lval->ConstVal = lval->ConstVal + lval2.ConstVal * PSizeOf (lhst);
2042 /* Result type is a pointer */
2043 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2044 /* Left is int, right is pointer, must scale lhs */
2045 lval->ConstVal = lval->ConstVal * PSizeOf (rhst) + lval2.ConstVal;
2046 /* Result type is a pointer */
2047 lval->Type = lval2.Type;
2048 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2049 /* Integer addition */
2050 lval->ConstVal += lval2.ConstVal;
2051 typeadjust (lval, &lval2, 1);
2054 Error ("Invalid operands for binary operator `+'");
2057 /* Result is constant, condition codes not set */
2058 lval->Test &= ~E_CC;
2062 /* lhs is constant, rhs is not. Get the rhs type. */
2065 /* Check for pointer arithmetic */
2066 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2067 /* Left is pointer, right is int, must scale rhs */
2068 g_scale (CF_INT, PSizeOf (lhst));
2069 /* Operate on pointers, result type is a pointer */
2071 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2072 /* Left is int, right is pointer, must scale lhs */
2073 lval->ConstVal *= PSizeOf (rhst);
2074 /* Operate on pointers, result type is a pointer */
2076 lval->Type = lval2.Type;
2077 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2078 /* Integer addition */
2079 flags = typeadjust (lval, &lval2, 1);
2082 Error ("Invalid operands for binary operator `+'");
2085 /* Generate code for the add */
2086 g_inc (flags | CF_CONST, lval->ConstVal);
2088 /* Result is in primary register */
2089 lval->Flags = E_MEXPR;
2090 lval->Test &= ~E_CC;
2096 /* Left hand side is not constant. Get the value onto the stack. */
2097 exprhs (CF_NONE, k, lval); /* --> primary register */
2098 Mark = GetCodePos ();
2099 g_push (TypeOf (lval->Type), 0); /* --> stack */
2101 /* Evaluate the rhs */
2102 if (evalexpr (CF_NONE, hie9, &lval2) == 0) {
2104 /* Right hand side is a constant. Get the rhs type */
2107 /* Remove pushed value from stack */
2109 pop (TypeOf (lval->Type));
2111 /* Check for pointer arithmetic */
2112 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2113 /* Left is pointer, right is int, must scale rhs */
2114 lval2.ConstVal *= PSizeOf (lhst);
2115 /* Operate on pointers, result type is a pointer */
2117 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2118 /* Left is int, right is pointer, must scale lhs (ptr only) */
2119 g_scale (CF_INT | CF_CONST, PSizeOf (rhst));
2120 /* Operate on pointers, result type is a pointer */
2122 lval->Type = lval2.Type;
2123 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2124 /* Integer addition */
2125 flags = typeadjust (lval, &lval2, 1);
2128 Error ("Invalid operands for binary operator `+'");
2131 /* Generate code for the add */
2132 g_inc (flags | CF_CONST, lval2.ConstVal);
2134 /* Result is in primary register */
2135 lval->Flags = E_MEXPR;
2136 lval->Test &= ~E_CC;
2140 /* lhs and rhs are not constant. Get the rhs type. */
2143 /* Check for pointer arithmetic */
2144 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2145 /* Left is pointer, right is int, must scale rhs */
2146 g_scale (CF_INT, PSizeOf (lhst));
2147 /* Operate on pointers, result type is a pointer */
2149 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2150 /* Left is int, right is pointer, must scale lhs */
2151 g_tosint (TypeOf (rhst)); /* Make sure, TOS is int */
2152 g_swap (CF_INT); /* Swap TOS and primary */
2153 g_scale (CF_INT, PSizeOf (rhst));
2154 /* Operate on pointers, result type is a pointer */
2156 lval->Type = lval2.Type;
2157 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2158 /* Integer addition */
2159 flags = typeadjust (lval, &lval2, 0);
2162 Error ("Invalid operands for binary operator `+'");
2165 /* Generate code for the add */
2168 /* Result is in primary register */
2169 lval->Flags = E_MEXPR;
2170 lval->Test &= ~E_CC;
2179 static void parsesub (int k, ExprDesc* lval)
2180 /* Parse an expression with the binary minus operator. lval contains the
2181 * unprocessed left hand side of the expression and will contain the
2182 * result of the expression on return.
2186 unsigned flags; /* Operation flags */
2187 type* lhst; /* Type of left hand side */
2188 type* rhst; /* Type of right hand side */
2189 CodeMark Mark1; /* Save position of output queue */
2190 CodeMark Mark2; /* Another position in the queue */
2191 int rscale; /* Scale factor for the result */
2194 /* Skip the MINUS token */
2197 /* Get the left hand side type, initialize operation flags */
2200 rscale = 1; /* Scale by 1, that is, don't scale */
2202 /* Remember the output queue position, then bring the value onto the stack */
2203 Mark1 = GetCodePos ();
2204 exprhs (CF_NONE, k, lval); /* --> primary register */
2205 Mark2 = GetCodePos ();
2206 g_push (TypeOf (lhst), 0); /* --> stack */
2208 /* Parse the right hand side */
2209 if (evalexpr (CF_NONE, hie9, &lval2) == 0) {
2211 /* The right hand side is constant. Get the rhs type. */
2214 /* Check left hand side */
2215 if (k == 0 && (lval->Flags & E_MCONST) != 0) {
2217 /* Both sides are constant, remove generated code */
2219 pop (TypeOf (lhst)); /* Clean up the stack */
2221 /* Check for pointer arithmetic */
2222 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2223 /* Left is pointer, right is int, must scale rhs */
2224 lval->ConstVal -= lval2.ConstVal * PSizeOf (lhst);
2225 /* 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_EQUAL) {
2229 Error ("Incompatible pointer types");
2231 lval->ConstVal = (lval->ConstVal - lval2.ConstVal) / PSizeOf (lhst);
2233 /* Operate on pointers, result type is an integer */
2234 lval->Type = type_int;
2235 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2236 /* Integer subtraction */
2237 typeadjust (lval, &lval2, 1);
2238 lval->ConstVal -= lval2.ConstVal;
2241 Error ("Invalid operands for binary operator `-'");
2244 /* Result is constant, condition codes not set */
2245 /* lval->Flags = E_MCONST; ### */
2246 lval->Test &= ~E_CC;
2250 /* Left hand side is not constant, right hand side is.
2251 * Remove pushed value from stack.
2254 pop (TypeOf (lhst));
2256 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2257 /* Left is pointer, right is int, must scale rhs */
2258 lval2.ConstVal *= PSizeOf (lhst);
2259 /* Operate on pointers, result type is a pointer */
2261 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2262 /* Left is pointer, right is pointer, must scale result */
2263 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_EQUAL) {
2264 Error ("Incompatible pointer types");
2266 rscale = PSizeOf (lhst);
2268 /* Operate on pointers, result type is an integer */
2270 lval->Type = type_int;
2271 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2272 /* Integer subtraction */
2273 flags = typeadjust (lval, &lval2, 1);
2276 Error ("Invalid operands for binary operator `-'");
2279 /* Do the subtraction */
2280 g_dec (flags | CF_CONST, lval2.ConstVal);
2282 /* If this was a pointer subtraction, we must scale the result */
2284 g_scale (flags, -rscale);
2287 /* Result is in primary register */
2288 lval->Flags = E_MEXPR;
2289 lval->Test &= ~E_CC;
2295 /* Right hand side is not constant. Get the rhs type. */
2298 /* Check for pointer arithmetic */
2299 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2300 /* Left is pointer, right is int, must scale rhs */
2301 g_scale (CF_INT, PSizeOf (lhst));
2302 /* Operate on pointers, result type is a pointer */
2304 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2305 /* Left is pointer, right is pointer, must scale result */
2306 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_EQUAL) {
2307 Error ("Incompatible pointer types");
2309 rscale = PSizeOf (lhst);
2311 /* Operate on pointers, result type is an integer */
2313 lval->Type = type_int;
2314 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2315 /* Integer subtraction. If the left hand side descriptor says that
2316 * the lhs is const, we have to remove this mark, since this is no
2317 * longer true, lhs is on stack instead.
2319 if (lval->Flags == E_MCONST) {
2320 lval->Flags = E_MEXPR;
2322 /* Adjust operand types */
2323 flags = typeadjust (lval, &lval2, 0);
2326 Error ("Invalid operands for binary operator `-'");
2329 /* Generate code for the sub (the & is a hack here) */
2330 g_sub (flags & ~CF_CONST, 0);
2332 /* If this was a pointer subtraction, we must scale the result */
2334 g_scale (flags, -rscale);
2337 /* Result is in primary register */
2338 lval->Flags = E_MEXPR;
2339 lval->Test &= ~E_CC;
2345 static int hie8 (ExprDesc* lval)
2346 /* Process + and - binary operators. */
2348 int k = hie9 (lval);
2349 while (CurTok.Tok == TOK_PLUS || CurTok.Tok == TOK_MINUS) {
2351 if (CurTok.Tok == TOK_PLUS) {
2364 static int hie7 (ExprDesc *lval)
2365 /* Parse << and >>. */
2367 static GenDesc* hie7_ops [] = {
2372 return hie_internal (hie7_ops, lval, hie8, &UsedGen);
2377 static int hie6 (ExprDesc *lval)
2378 /* process greater-than type comparators */
2380 static GenDesc* hie6_ops [] = {
2381 &GenLT, &GenLE, &GenGE, &GenGT, 0
2383 return hie_compare (hie6_ops, lval, hie7);
2388 static int hie5 (ExprDesc *lval)
2390 static GenDesc* hie5_ops[] = {
2393 return hie_compare (hie5_ops, lval, hie6);
2398 static int hie4 (ExprDesc* lval)
2399 /* Handle & (bitwise and) */
2401 static GenDesc* hie4_ops [] = {
2406 return hie_internal (hie4_ops, lval, hie5, &UsedGen);
2411 static int hie3 (ExprDesc *lval)
2412 /* Handle ^ (bitwise exclusive or) */
2414 static GenDesc* hie3_ops [] = {
2419 return hie_internal (hie3_ops, lval, hie4, &UsedGen);
2424 static int hie2 (ExprDesc *lval)
2425 /* Handle | (bitwise or) */
2427 static GenDesc* hie2_ops [] = {
2432 return hie_internal (hie2_ops, lval, hie3, &UsedGen);
2437 static int hieAndPP (ExprDesc* lval)
2438 /* Process "exp && exp" in preprocessor mode (that is, when the parser is
2439 * called recursively from the preprocessor.
2444 ConstSubExpr (hie2, lval);
2445 while (CurTok.Tok == TOK_BOOL_AND) {
2447 /* Left hand side must be an int */
2448 if (!IsClassInt (lval->Type)) {
2449 Error ("Left hand side must be of integer type");
2450 MakeConstIntExpr (lval, 1);
2457 ConstSubExpr (hie2, &lval2);
2459 /* Since we are in PP mode, all we know about is integers */
2460 if (!IsClassInt (lval2.Type)) {
2461 Error ("Right hand side must be of integer type");
2462 MakeConstIntExpr (&lval2, 1);
2465 /* Combine the two */
2466 lval->ConstVal = (lval->ConstVal && lval2.ConstVal);
2469 /* Always a rvalue */
2475 static int hieOrPP (ExprDesc *lval)
2476 /* Process "exp || exp" in preprocessor mode (that is, when the parser is
2477 * called recursively from the preprocessor.
2482 ConstSubExpr (hieAndPP, lval);
2483 while (CurTok.Tok == TOK_BOOL_OR) {
2485 /* Left hand side must be an int */
2486 if (!IsClassInt (lval->Type)) {
2487 Error ("Left hand side must be of integer type");
2488 MakeConstIntExpr (lval, 1);
2495 ConstSubExpr (hieAndPP, &lval2);
2497 /* Since we are in PP mode, all we know about is integers */
2498 if (!IsClassInt (lval2.Type)) {
2499 Error ("Right hand side must be of integer type");
2500 MakeConstIntExpr (&lval2, 1);
2503 /* Combine the two */
2504 lval->ConstVal = (lval->ConstVal || lval2.ConstVal);
2507 /* Always a rvalue */
2513 static int hieAnd (ExprDesc* lval, unsigned TrueLab, int* BoolOp)
2514 /* Process "exp && exp" */
2521 if (CurTok.Tok == TOK_BOOL_AND) {
2523 /* Tell our caller that we're evaluating a boolean */
2526 /* Get a label that we will use for false expressions */
2527 lab = GetLocalLabel ();
2529 /* If the expr hasn't set condition codes, set the force-test flag */
2530 if ((lval->Test & E_CC) == 0) {
2531 lval->Test |= E_FORCETEST;
2534 /* Load the value */
2535 exprhs (CF_FORCECHAR, k, lval);
2537 /* Generate the jump */
2538 g_falsejump (CF_NONE, lab);
2540 /* Parse more boolean and's */
2541 while (CurTok.Tok == TOK_BOOL_AND) {
2548 if ((lval2.Test & E_CC) == 0) {
2549 lval2.Test |= E_FORCETEST;
2551 exprhs (CF_FORCECHAR, k, &lval2);
2553 /* Do short circuit evaluation */
2554 if (CurTok.Tok == TOK_BOOL_AND) {
2555 g_falsejump (CF_NONE, lab);
2557 /* Last expression - will evaluate to true */
2558 g_truejump (CF_NONE, TrueLab);
2562 /* Define the false jump label here */
2563 g_defcodelabel (lab);
2565 /* Define the label */
2566 lval->Flags = E_MEXPR;
2567 lval->Test |= E_CC; /* Condition codes are set */
2575 static int hieOr (ExprDesc *lval)
2576 /* Process "exp || exp". */
2580 int BoolOp = 0; /* Did we have a boolean op? */
2581 int AndOp; /* Did we have a && operation? */
2582 unsigned TrueLab; /* Jump to this label if true */
2586 TrueLab = GetLocalLabel ();
2588 /* Call the next level parser */
2589 k = hieAnd (lval, TrueLab, &BoolOp);
2591 /* Any boolean or's? */
2592 if (CurTok.Tok == TOK_BOOL_OR) {
2594 /* If the expr hasn't set condition codes, set the force-test flag */
2595 if ((lval->Test & E_CC) == 0) {
2596 lval->Test |= E_FORCETEST;
2599 /* Get first expr */
2600 exprhs (CF_FORCECHAR, k, lval);
2602 /* For each expression jump to TrueLab if true. Beware: If we
2603 * had && operators, the jump is already in place!
2606 g_truejump (CF_NONE, TrueLab);
2609 /* Remember that we had a boolean op */
2612 /* while there's more expr */
2613 while (CurTok.Tok == TOK_BOOL_OR) {
2620 k = hieAnd (&lval2, TrueLab, &AndOp);
2621 if ((lval2.Test & E_CC) == 0) {
2622 lval2.Test |= E_FORCETEST;
2624 exprhs (CF_FORCECHAR, k, &lval2);
2626 /* If there is more to come, add shortcut boolean eval. */
2627 g_truejump (CF_NONE, TrueLab);
2630 lval->Flags = E_MEXPR;
2631 lval->Test |= E_CC; /* Condition codes are set */
2635 /* If we really had boolean ops, generate the end sequence */
2637 DoneLab = GetLocalLabel ();
2638 g_getimmed (CF_INT | CF_CONST, 0, 0); /* Load FALSE */
2639 g_falsejump (CF_NONE, DoneLab);
2640 g_defcodelabel (TrueLab);
2641 g_getimmed (CF_INT | CF_CONST, 1, 0); /* Load TRUE */
2642 g_defcodelabel (DoneLab);
2649 static int hieQuest (ExprDesc *lval)
2650 /* Parse "lvalue ? exp : exp" */
2655 ExprDesc lval2; /* Expression 2 */
2656 ExprDesc lval3; /* Expression 3 */
2657 type* type2; /* Type of expression 2 */
2658 type* type3; /* Type of expression 3 */
2659 type* rtype; /* Type of result */
2660 CodeMark Mark1; /* Save position in output code */
2661 CodeMark Mark2; /* Save position in output code */
2665 k = Preprocessing? hieOrPP (lval) : hieOr (lval);
2666 if (CurTok.Tok == TOK_QUEST) {
2668 if ((lval->Test & E_CC) == 0) {
2669 /* Condition codes not set, force a test */
2670 lval->Test |= E_FORCETEST;
2672 exprhs (CF_NONE, k, lval);
2673 labf = GetLocalLabel ();
2674 g_falsejump (CF_NONE, labf);
2676 /* Parse second and third expression */
2677 expression1 (&lval2);
2678 labt = GetLocalLabel ();
2681 g_defcodelabel (labf);
2682 expression1 (&lval3);
2684 /* Check if any conversions are needed, if so, do them.
2685 * Conversion rules for ?: expression are:
2686 * - if both expressions are int expressions, default promotion
2687 * rules for ints apply.
2688 * - if both expressions are pointers of the same type, the
2689 * result of the expression is of this type.
2690 * - if one of the expressions is a pointer and the other is
2691 * a zero constant, the resulting type is that of the pointer
2693 * - all other cases are flagged by an error.
2697 if (IsClassInt (type2) && IsClassInt (type3)) {
2699 /* Get common type */
2700 rtype = promoteint (type2, type3);
2702 /* Convert the third expression to this type if needed */
2703 g_typecast (TypeOf (rtype), TypeOf (type3));
2705 /* Setup a new label so that the expr3 code will jump around
2706 * the type cast code for expr2.
2708 labf = GetLocalLabel (); /* Get new label */
2709 Mark1 = GetCodePos (); /* Remember current position */
2710 g_jump (labf); /* Jump around code */
2712 /* The jump for expr2 goes here */
2713 g_defcodelabel (labt);
2715 /* Create the typecast code for expr2 */
2716 Mark2 = GetCodePos (); /* Remember position */
2717 g_typecast (TypeOf (rtype), TypeOf (type2));
2719 /* Jump here around the typecase code. */
2720 g_defcodelabel (labf);
2721 labt = 0; /* Mark other label as invalid */
2723 } else if (IsClassPtr (type2) && IsClassPtr (type3)) {
2724 /* Must point to same type */
2725 if (TypeCmp (Indirect (type2), Indirect (type3)) < TC_EQUAL) {
2726 Error ("Incompatible pointer types");
2728 /* Result has the common type */
2730 } else if (IsClassPtr (type2) && IsNullPtr (&lval3)) {
2731 /* Result type is pointer, no cast needed */
2733 } else if (IsNullPtr (&lval2) && IsClassPtr (type3)) {
2734 /* Result type is pointer, no cast needed */
2737 Error ("Incompatible types");
2738 rtype = lval2.Type; /* Doesn't matter here */
2741 /* If we don't have the label defined until now, do it */
2743 g_defcodelabel (labt);
2746 /* Setup the target expression */
2747 lval->Flags = E_MEXPR;
2756 static void opeq (GenDesc* Gen, ExprDesc *lval, int k)
2757 /* Process "op=" operators. */
2766 Error ("Invalid lvalue in assignment");
2770 /* Determine the type of the lhs */
2771 flags = TypeOf (lval->Type);
2772 MustScale = (Gen->Func == g_add || Gen->Func == g_sub) &&
2773 lval->Type [0] == T_PTR;
2775 /* Get the lhs address on stack (if needed) */
2778 /* Fetch the lhs into the primary register if needed */
2779 exprhs (CF_NONE, k, lval);
2781 /* Bring the lhs on stack */
2782 Mark = GetCodePos ();
2785 /* Evaluate the rhs */
2786 if (evalexpr (CF_NONE, hie1, &lval2) == 0) {
2787 /* The resulting value is a constant. If the generator has the NOPUSH
2788 * flag set, don't push the lhs.
2790 if (Gen->Flags & GEN_NOPUSH) {
2795 /* lhs is a pointer, scale rhs */
2796 lval2.ConstVal *= SizeOf (lval->Type+1);
2799 /* If the lhs is character sized, the operation may be later done
2802 if (SizeOf (lval->Type) == 1) {
2803 flags |= CF_FORCECHAR;
2806 /* Special handling for add and sub - some sort of a hack, but short code */
2807 if (Gen->Func == g_add) {
2808 g_inc (flags | CF_CONST, lval2.ConstVal);
2809 } else if (Gen->Func == g_sub) {
2810 g_dec (flags | CF_CONST, lval2.ConstVal);
2812 Gen->Func (flags | CF_CONST, lval2.ConstVal);
2815 /* rhs is not constant and already in the primary register */
2817 /* lhs is a pointer, scale rhs */
2818 g_scale (TypeOf (lval2.Type), SizeOf (lval->Type+1));
2821 /* If the lhs is character sized, the operation may be later done
2824 if (SizeOf (lval->Type) == 1) {
2825 flags |= CF_FORCECHAR;
2828 /* Adjust the types of the operands if needed */
2829 Gen->Func (g_typeadjust (flags, TypeOf (lval2.Type)), 0);
2832 lval->Flags = E_MEXPR;
2837 static void addsubeq (GenDesc* Gen, ExprDesc *lval, int k)
2838 /* Process the += and -= operators */
2846 Error ("Invalid lvalue in assignment");
2851 /* We're currently only able to handle some adressing modes */
2852 if ((lval->Flags & E_MGLOBAL) == 0 && /* Global address? */
2853 (lval->Flags & E_MLOCAL) == 0 && /* Local address? */
2854 (lval->Flags & E_MCONST) == 0) { /* Constant address? */
2855 /* Use generic routine */
2856 opeq (Gen, lval, k);
2860 /* Skip the operator */
2863 /* Check if we have a pointer expression and must scale rhs */
2864 MustScale = (lval->Type [0] == T_PTR);
2866 /* Determine the code generator flags */
2867 flags = TypeOf (lval->Type) | CF_FORCECHAR;
2869 /* Evaluate the rhs */
2870 if (evalexpr (CF_NONE, hie1, &lval2) == 0) {
2871 /* The resulting value is a constant. */
2873 /* lhs is a pointer, scale rhs */
2874 lval2.ConstVal *= SizeOf (lval->Type+1);
2878 /* rhs is not constant and already in the primary register */
2880 /* lhs is a pointer, scale rhs */
2881 g_scale (TypeOf (lval2.Type), SizeOf (lval->Type+1));
2885 /* Adjust the rhs to the lhs */
2886 g_typeadjust (flags, TypeOf (lval2.Type));
2888 /* Output apropriate code */
2889 if (lval->Flags & E_MGLOBAL) {
2890 /* Static variable */
2891 flags |= GlobalModeFlags (lval->Flags);
2892 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2893 g_addeqstatic (flags, lval->Name, lval->ConstVal, lval2.ConstVal);
2895 g_subeqstatic (flags, lval->Name, lval->ConstVal, lval2.ConstVal);
2897 } else if (lval->Flags & E_MLOCAL) {
2898 /* ref to localvar */
2899 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2900 g_addeqlocal (flags, lval->ConstVal, lval2.ConstVal);
2902 g_subeqlocal (flags, lval->ConstVal, lval2.ConstVal);
2904 } else if (lval->Flags & E_MCONST) {
2905 /* ref to absolute address */
2906 flags |= CF_ABSOLUTE;
2907 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2908 g_addeqstatic (flags, lval->ConstVal, 0, lval2.ConstVal);
2910 g_subeqstatic (flags, lval->ConstVal, 0, lval2.ConstVal);
2912 } else if (lval->Flags & E_MEXPR) {
2913 /* Address in a/x. */
2914 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2915 g_addeqind (flags, lval->ConstVal, lval2.ConstVal);
2917 g_subeqind (flags, lval->ConstVal, lval2.ConstVal);
2920 Internal ("Invalid addressing mode");
2923 /* Expression is in the primary now */
2924 lval->Flags = E_MEXPR;
2929 static void Assignment (ExprDesc* lval)
2930 /* Parse an assignment */
2935 type* ltype = lval->Type;
2937 /* Check for assignment to const */
2938 if (IsQualConst (ltype)) {
2939 Error ("Assignment to const");
2942 /* cc65 does not have full support for handling structs by value. Since
2943 * assigning structs is one of the more useful operations from this
2944 * family, allow it here.
2946 if (IsClassStruct (ltype)) {
2948 /* Bring the address of the lhs into the primary and push it */
2949 exprhs (0, 0, lval);
2950 g_push (CF_PTR | CF_UNSIGNED, 0);
2952 /* Get the expression on the right of the '=' into the primary */
2955 /* Get the address */
2956 exprhs (0, 0, &lval2);
2958 /* We need an lvalue */
2959 Error ("Invalid lvalue in assignment");
2962 /* Push the address (or whatever is in ax in case of errors) */
2963 g_push (CF_PTR | CF_UNSIGNED, 0);
2965 /* Check for equality of the structs */
2966 if (TypeCmp (ltype, lval2.Type) < TC_EQUAL) {
2967 Error ("Incompatible types");
2970 /* Load the size of the struct into the primary */
2971 g_getimmed (CF_INT | CF_UNSIGNED | CF_CONST, SizeOf (ltype), 0);
2973 /* Call the memcpy function */
2974 g_call (CF_FIXARGC, "memcpy", 4);
2978 /* Get the address on stack if needed */
2981 /* No struct, setup flags for the load */
2982 flags = SizeOf (ltype) == 1? CF_FORCECHAR : CF_NONE;
2984 /* Get the expression on the right of the '=' into the primary */
2985 if (evalexpr (flags, hie1, &lval2) == 0) {
2986 /* Constant expression. Adjust the types */
2987 assignadjust (ltype, &lval2);
2988 /* Put the value into the primary register */
2989 lconst (flags, &lval2);
2991 /* Expression is not constant and already in the primary */
2992 assignadjust (ltype, &lval2);
2995 /* Generate a store instruction */
3000 /* Value is still in primary */
3001 lval->Flags = E_MEXPR;
3006 int hie1 (ExprDesc* lval)
3007 /* Parse first level of expression hierarchy. */
3011 k = hieQuest (lval);
3012 switch (CurTok.Tok) {
3021 Error ("Invalid lvalue in assignment");
3027 case TOK_PLUS_ASSIGN:
3028 addsubeq (&GenPASGN, lval, k);
3031 case TOK_MINUS_ASSIGN:
3032 addsubeq (&GenSASGN, lval, k);
3035 case TOK_MUL_ASSIGN:
3036 opeq (&GenMASGN, lval, k);
3039 case TOK_DIV_ASSIGN:
3040 opeq (&GenDASGN, lval, k);
3043 case TOK_MOD_ASSIGN:
3044 opeq (&GenMOASGN, lval, k);
3047 case TOK_SHL_ASSIGN:
3048 opeq (&GenSLASGN, lval, k);
3051 case TOK_SHR_ASSIGN:
3052 opeq (&GenSRASGN, lval, k);
3055 case TOK_AND_ASSIGN:
3056 opeq (&GenAASGN, lval, k);
3059 case TOK_XOR_ASSIGN:
3060 opeq (&GenXOASGN, lval, k);
3064 opeq (&GenOASGN, lval, k);
3075 int hie0 (ExprDesc *lval)
3076 /* Parse comma operator. */
3081 while (CurTok.Tok == TOK_COMMA) {
3090 int evalexpr (unsigned flags, int (*f) (ExprDesc*), ExprDesc* lval)
3091 /* Will evaluate an expression via the given function. If the result is a
3092 * constant, 0 is returned and the value is put in the lval struct. If the
3093 * result is not constant, exprhs is called to bring the value into the
3094 * primary register and 1 is returned.
3101 if (k == 0 && lval->Flags == E_MCONST) {
3102 /* Constant expression */
3105 /* Not constant, load into the primary */
3106 exprhs (flags, k, lval);
3113 int expr (int (*func) (ExprDesc*), ExprDesc *lval)
3114 /* Expression parser; func is either hie0 or hie1. */
3123 /* Do some checks if code generation is still constistent */
3124 if (savsp != oursp) {
3126 fprintf (stderr, "oursp != savesp (%d != %d)\n", oursp, savsp);
3128 Internal ("oursp != savsp (%d != %d)", oursp, savsp);
3136 void expression1 (ExprDesc* lval)
3137 /* Evaluate an expression on level 1 (no comma operator) and put it into
3138 * the primary register
3141 memset (lval, 0, sizeof (*lval));
3142 exprhs (CF_NONE, expr (hie1, lval), lval);
3147 void expression (ExprDesc* lval)
3148 /* Evaluate an expression and put it into the primary register */
3150 memset (lval, 0, sizeof (*lval));
3151 exprhs (CF_NONE, expr (hie0, lval), lval);
3156 void constexpr (ExprDesc* lval)
3157 /* Get a constant value */
3159 memset (lval, 0, sizeof (*lval));
3160 if (expr (hie1, lval) != 0 || (lval->Flags & E_MCONST) == 0) {
3161 Error ("Constant expression expected");
3162 /* To avoid any compiler errors, make the expression a valid const */
3163 MakeConstIntExpr (lval, 1);
3169 void intexpr (ExprDesc* lval)
3170 /* Get an integer expression */
3173 if (!IsClassInt (lval->Type)) {
3174 Error ("Integer expression expected");
3175 /* To avoid any compiler errors, make the expression a valid int */
3176 MakeConstIntExpr (lval, 1);
3182 void boolexpr (ExprDesc* lval)
3183 /* Get a boolean expression */
3185 /* Read an expression */
3188 /* If it's an integer, it's ok. If it's not an integer, but a pointer,
3189 * the pointer used in a boolean context is also ok
3191 if (!IsClassInt (lval->Type) && !IsClassPtr (lval->Type)) {
3192 Error ("Boolean expression expected");
3193 /* To avoid any compiler errors, make the expression a valid int */
3194 MakeConstIntExpr (lval, 1);
3200 void test (unsigned label, int cond)
3201 /* Generate code to perform test and jump if false. */
3206 /* Eat the parenthesis */
3209 /* Prepare the expression, setup labels */
3210 memset (&lval, 0, sizeof (lval));
3212 /* Generate code to eval the expr */
3213 k = expr (hie0, &lval);
3214 if (k == 0 && lval.Flags == E_MCONST) {
3215 /* Constant rvalue */
3216 if (cond == 0 && lval.ConstVal == 0) {
3218 Warning ("Unreachable code");
3219 } else if (cond && lval.ConstVal) {
3226 /* If the expr hasn't set condition codes, set the force-test flag */
3227 if ((lval.Test & E_CC) == 0) {
3228 lval.Test |= E_FORCETEST;
3231 /* Load the value into the primary register */
3232 exprhs (CF_FORCECHAR, k, &lval);
3234 /* Generate the jump */
3236 g_truejump (CF_NONE, label);
3238 /* Special case (putting this here is a small hack - but hey, the
3239 * compiler itself is one big hack...): If a semicolon follows, we
3240 * don't have a statement and may omit the jump.
3242 if (CurTok.Tok != TOK_SEMI) {
3243 g_falsejump (CF_NONE, label);
3247 /* Check for the closing brace */