3 * Ullrich von Bassewitz, 21.06.1998
13 #include "debugflag.h"
20 #include "assignment.h"
32 #include "shiftexpr.h"
43 /*****************************************************************************/
45 /*****************************************************************************/
49 /* Generator attributes */
50 #define GEN_NOPUSH 0x01 /* Don't push lhs */
52 /* Map a generator function and its attributes to a token */
54 token_t Tok; /* Token to map to */
55 unsigned Flags; /* Flags for generator function */
56 void (*Func) (unsigned, unsigned long); /* Generator func */
59 /* Descriptors for the operations */
60 static GenDesc GenPASGN = { TOK_PLUS_ASSIGN, GEN_NOPUSH, g_add };
61 static GenDesc GenSASGN = { TOK_MINUS_ASSIGN, GEN_NOPUSH, g_sub };
62 static GenDesc GenMASGN = { TOK_MUL_ASSIGN, GEN_NOPUSH, g_mul };
63 static GenDesc GenDASGN = { TOK_DIV_ASSIGN, GEN_NOPUSH, g_div };
64 static GenDesc GenMOASGN = { TOK_MOD_ASSIGN, GEN_NOPUSH, g_mod };
65 static GenDesc GenSLASGN = { TOK_SHL_ASSIGN, GEN_NOPUSH, g_asl };
66 static GenDesc GenSRASGN = { TOK_SHR_ASSIGN, GEN_NOPUSH, g_asr };
67 static GenDesc GenAASGN = { TOK_AND_ASSIGN, GEN_NOPUSH, g_and };
68 static GenDesc GenXOASGN = { TOK_XOR_ASSIGN, GEN_NOPUSH, g_xor };
69 static GenDesc GenOASGN = { TOK_OR_ASSIGN, GEN_NOPUSH, g_or };
73 /*****************************************************************************/
74 /* Helper functions */
75 /*****************************************************************************/
79 static unsigned GlobalModeFlags (const ExprDesc* Expr)
80 /* Return the addressing mode flags for the given expression */
82 switch (ED_GetLoc (Expr)) {
83 case E_LOC_ABS: return CF_ABSOLUTE;
84 case E_LOC_GLOBAL: return CF_EXTERNAL;
85 case E_LOC_STATIC: return CF_STATIC;
86 case E_LOC_REGISTER: return CF_REGVAR;
87 case E_LOC_STACK: return CF_NONE;
88 case E_LOC_PRIMARY: return CF_NONE;
89 case E_LOC_EXPR: return CF_NONE;
90 case E_LOC_LITERAL: return CF_STATIC; /* Same as static */
92 Internal ("GlobalModeFlags: Invalid location flags value: 0x%04X", Expr->Flags);
100 void ExprWithCheck (void (*Func) (ExprDesc*), ExprDesc* Expr)
101 /* Call an expression function with checks. */
103 /* Remember the stack pointer */
104 int OldSP = StackPtr;
106 /* Call the expression function */
109 /* Do some checks if code generation is still constistent */
110 if (StackPtr != OldSP) {
113 "Code generation messed up!\n"
114 "StackPtr is %d, should be %d",
117 Internal ("StackPtr is %d, should be %d\n", StackPtr, OldSP);
124 void MarkedExprWithCheck (void (*Func) (ExprDesc*), ExprDesc* Expr)
125 /* Call an expression function with checks and record start and end of the
131 ExprWithCheck (Func, Expr);
133 ED_SetCodeRange (Expr, &Start, &End);
138 static Type* promoteint (Type* lhst, Type* rhst)
139 /* In an expression with two ints, return the type of the result */
141 /* Rules for integer types:
142 * - If one of the values is a long, the result is long.
143 * - If one of the values is unsigned, the result is also unsigned.
144 * - Otherwise the result is an int.
146 if (IsTypeLong (lhst) || IsTypeLong (rhst)) {
147 if (IsSignUnsigned (lhst) || IsSignUnsigned (rhst)) {
153 if (IsSignUnsigned (lhst) || IsSignUnsigned (rhst)) {
163 static unsigned typeadjust (ExprDesc* lhs, ExprDesc* rhs, int NoPush)
164 /* Adjust the two values for a binary operation. lhs is expected on stack or
165 * to be constant, rhs is expected to be in the primary register or constant.
166 * The function will put the type of the result into lhs and return the
167 * code generator flags for the operation.
168 * If NoPush is given, it is assumed that the operation does not expect the lhs
169 * to be on stack, and that lhs is in a register instead.
170 * Beware: The function does only accept int types.
173 unsigned ltype, rtype;
176 /* Get the type strings */
177 Type* lhst = lhs->Type;
178 Type* rhst = rhs->Type;
180 /* Generate type adjustment code if needed */
181 ltype = TypeOf (lhst);
182 if (ED_IsLocAbs (lhs)) {
186 /* Value is in primary register*/
189 rtype = TypeOf (rhst);
190 if (ED_IsLocAbs (rhs)) {
193 flags = g_typeadjust (ltype, rtype);
195 /* Set the type of the result */
196 lhs->Type = promoteint (lhst, rhst);
198 /* Return the code generator flags */
204 static const GenDesc* FindGen (token_t Tok, const GenDesc* Table)
205 /* Find a token in a generator table */
207 while (Table->Tok != TOK_INVALID) {
208 if (Table->Tok == Tok) {
218 static int TypeSpecAhead (void)
219 /* Return true if some sort of type is waiting (helper for cast and sizeof()
225 /* There's a type waiting if:
227 * We have an opening paren, and
228 * a. the next token is a type, or
229 * b. the next token is a type qualifier, or
230 * c. the next token is a typedef'd type
232 return CurTok.Tok == TOK_LPAREN && (
233 TokIsType (&NextTok) ||
234 TokIsTypeQual (&NextTok) ||
235 (NextTok.Tok == TOK_IDENT &&
236 (Entry = FindSym (NextTok.Ident)) != 0 &&
237 SymIsTypeDef (Entry)));
242 void PushAddr (const ExprDesc* Expr)
243 /* If the expression contains an address that was somehow evaluated,
244 * push this address on the stack. This is a helper function for all
245 * sorts of implicit or explicit assignment functions where the lvalue
246 * must be saved if it's not constant, before evaluating the rhs.
249 /* Get the address on stack if needed */
250 if (ED_IsLocExpr (Expr)) {
251 /* Push the address (always a pointer) */
258 /*****************************************************************************/
260 /*****************************************************************************/
264 static unsigned FunctionParamList (FuncDesc* Func, int IsFastcall)
265 /* Parse a function parameter list and pass the parameters to the called
266 * function. Depending on several criteria this may be done by just pushing
267 * each parameter separately, or creating the parameter frame once and then
268 * storing into this frame.
269 * The function returns the size of the parameters pushed.
274 /* Initialize variables */
275 SymEntry* Param = 0; /* Keep gcc silent */
276 unsigned ParamSize = 0; /* Size of parameters pushed */
277 unsigned ParamCount = 0; /* Number of parameters pushed */
278 unsigned FrameSize = 0; /* Size of parameter frame */
279 unsigned FrameParams = 0; /* Number of params in frame */
280 int FrameOffs = 0; /* Offset into parameter frame */
281 int Ellipsis = 0; /* Function is variadic */
283 /* As an optimization, we may allocate the complete parameter frame at
284 * once instead of pushing each parameter as it comes. We may do that,
287 * - optimizations that increase code size are enabled (allocating the
288 * stack frame at once gives usually larger code).
289 * - we have more than one parameter to push (don't count the last param
290 * for __fastcall__ functions).
292 * The FrameSize variable will contain a value > 0 if storing into a frame
293 * (instead of pushing) is enabled.
296 if (IS_Get (&CodeSizeFactor) >= 200) {
298 /* Calculate the number and size of the parameters */
299 FrameParams = Func->ParamCount;
300 FrameSize = Func->ParamSize;
301 if (FrameParams > 0 && IsFastcall) {
302 /* Last parameter is not pushed */
303 FrameSize -= CheckedSizeOf (Func->LastParam->Type);
307 /* Do we have more than one parameter in the frame? */
308 if (FrameParams > 1) {
309 /* Okeydokey, setup the frame */
310 FrameOffs = StackPtr;
312 StackPtr -= FrameSize;
314 /* Don't use a preallocated frame */
319 /* Parse the actual parameter list */
320 while (CurTok.Tok != TOK_RPAREN) {
324 /* Count arguments */
327 /* Fetch the pointer to the next argument, check for too many args */
328 if (ParamCount <= Func->ParamCount) {
329 /* Beware: If there are parameters with identical names, they
330 * cannot go into the same symbol table, which means that in this
331 * case of errorneous input, the number of nodes in the symbol
332 * table and ParamCount are NOT equal. We have to handle this case
333 * below to avoid segmentation violations. Since we know that this
334 * problem can only occur if there is more than one parameter,
335 * we will just use the last one.
337 if (ParamCount == 1) {
339 Param = Func->SymTab->SymHead;
340 } else if (Param->NextSym != 0) {
342 Param = Param->NextSym;
343 CHECK ((Param->Flags & SC_PARAM) != 0);
345 } else if (!Ellipsis) {
346 /* Too many arguments. Do we have an open param list? */
347 if ((Func->Flags & FD_VARIADIC) == 0) {
348 /* End of param list reached, no ellipsis */
349 Error ("Too many arguments in function call");
351 /* Assume an ellipsis even in case of errors to avoid an error
352 * message for each other argument.
357 /* Evaluate the parameter expression */
360 /* If we don't have an argument spec, accept anything, otherwise
361 * convert the actual argument to the type needed.
366 /* Convert the argument to the parameter type if needed */
367 TypeConversion (&Expr, Param->Type);
369 /* If we have a prototype, chars may be pushed as chars */
370 Flags |= CF_FORCECHAR;
374 /* No prototype available. Convert array to "pointer to first
375 * element", and function to "pointer to function".
377 Expr.Type = PtrConversion (Expr.Type);
381 /* Load the value into the primary if it is not already there */
382 LoadExpr (Flags, &Expr);
384 /* Use the type of the argument for the push */
385 Flags |= TypeOf (Expr.Type);
387 /* If this is a fastcall function, don't push the last argument */
388 if (ParamCount != Func->ParamCount || !IsFastcall) {
389 unsigned ArgSize = sizeofarg (Flags);
391 /* We have the space already allocated, store in the frame.
392 * Because of invalid type conversions (that have produced an
393 * error before), we can end up here with a non aligned stack
394 * frame. Since no output will be generated anyway, handle
395 * these cases gracefully instead of doing a CHECK.
397 if (FrameSize >= ArgSize) {
398 FrameSize -= ArgSize;
402 FrameOffs -= ArgSize;
404 g_putlocal (Flags | CF_NOKEEP, FrameOffs, Expr.IVal);
406 /* Push the argument */
407 g_push (Flags, Expr.IVal);
410 /* Calculate total parameter size */
411 ParamSize += ArgSize;
414 /* Check for end of argument list */
415 if (CurTok.Tok != TOK_COMMA) {
421 /* Check if we had enough parameters */
422 if (ParamCount < Func->ParamCount) {
423 Error ("Too few arguments in function call");
426 /* The function returns the size of all parameters pushed onto the stack.
427 * However, if there are parameters missing (which is an error and was
428 * flagged by the compiler) AND a stack frame was preallocated above,
429 * we would loose track of the stackpointer and generate an internal error
430 * later. So we correct the value by the parameters that should have been
431 * pushed to avoid an internal compiler error. Since an error was
432 * generated before, no code will be output anyway.
434 return ParamSize + FrameSize;
439 static void FunctionCall (ExprDesc* Expr)
440 /* Perform a function call. */
442 FuncDesc* Func; /* Function descriptor */
443 int IsFuncPtr; /* Flag */
444 unsigned ParamSize; /* Number of parameter bytes */
446 int PtrOffs = 0; /* Offset of function pointer on stack */
447 int IsFastcall = 0; /* True if it's a fast call function */
448 int PtrOnStack = 0; /* True if a pointer copy is on stack */
450 /* Skip the left paren */
453 /* Get a pointer to the function descriptor from the type string */
454 Func = GetFuncDesc (Expr->Type);
456 /* Handle function pointers transparently */
457 IsFuncPtr = IsTypeFuncPtr (Expr->Type);
460 /* Check wether it's a fastcall function that has parameters */
461 IsFastcall = IsQualFastcall (Expr->Type + 1) && (Func->ParamCount > 0);
463 /* Things may be difficult, depending on where the function pointer
464 * resides. If the function pointer is an expression of some sort
465 * (not a local or global variable), we have to evaluate this
466 * expression now and save the result for later. Since calls to
467 * function pointers may be nested, we must save it onto the stack.
468 * For fastcall functions we do also need to place a copy of the
469 * pointer on stack, since we cannot use a/x.
471 PtrOnStack = IsFastcall || !ED_IsConst (Expr);
474 /* Not a global or local variable, or a fastcall function. Load
475 * the pointer into the primary and mark it as an expression.
477 LoadExpr (CF_NONE, Expr);
478 ED_MakeRValExpr (Expr);
480 /* Remember the code position */
483 /* Push the pointer onto the stack and remember the offset */
489 /* Check function attributes */
490 if (Expr->Sym && SymHasAttr (Expr->Sym, atNoReturn)) {
491 /* For now, handle as if a return statement was encountered */
492 F_ReturnFound (CurrentFunc);
495 /* Check for known standard functions and inline them */
496 if (Expr->Name != 0) {
497 int StdFunc = FindStdFunc ((const char*) Expr->Name);
499 /* Inline this function */
500 HandleStdFunc (StdFunc, Func, Expr);
505 /* If we didn't inline the function, get fastcall info */
506 IsFastcall = IsQualFastcall (Expr->Type);
509 /* Parse the parameter list */
510 ParamSize = FunctionParamList (Func, IsFastcall);
512 /* We need the closing paren here */
515 /* Special handling for function pointers */
518 /* If the function is not a fastcall function, load the pointer to
519 * the function into the primary.
523 /* Not a fastcall function - we may use the primary */
525 /* If we have no parameters, the pointer is still in the
526 * primary. Remove the code to push it and correct the
529 if (ParamSize == 0) {
533 /* Load from the saved copy */
534 g_getlocal (CF_PTR, PtrOffs);
537 /* Load from original location */
538 LoadExpr (CF_NONE, Expr);
541 /* Call the function */
542 g_callind (TypeOf (Expr->Type+1), ParamSize, PtrOffs);
546 /* Fastcall function. We cannot use the primary for the function
547 * pointer and must therefore use an offset to the stack location.
548 * Since fastcall functions may never be variadic, we can use the
549 * index register for this purpose.
551 g_callind (CF_LOCAL, ParamSize, PtrOffs);
554 /* If we have a pointer on stack, remove it */
565 /* Normal function */
566 g_call (TypeOf (Expr->Type), (const char*) Expr->Name, ParamSize);
570 /* The function result is an rvalue in the primary register */
571 ED_MakeRValExpr (Expr);
572 Expr->Type = GetFuncReturn (Expr->Type);
577 static void Primary (ExprDesc* E)
578 /* This is the lowest level of the expression parser. */
582 /* Initialize fields in the expression stucture */
585 /* Character and integer constants. */
586 if (CurTok.Tok == TOK_ICONST || CurTok.Tok == TOK_CCONST) {
587 E->IVal = CurTok.IVal;
588 E->Flags = E_LOC_ABS | E_RTYPE_RVAL;
589 E->Type = CurTok.Type;
594 /* Floating point constant */
595 if (CurTok.Tok == TOK_FCONST) {
596 E->FVal = CurTok.FVal;
597 E->Flags = E_LOC_ABS | E_RTYPE_RVAL;
598 E->Type = CurTok.Type;
603 /* Process parenthesized subexpression by calling the whole parser
606 if (CurTok.Tok == TOK_LPAREN) {
613 /* If we run into an identifier in preprocessing mode, we assume that this
614 * is an undefined macro and replace it by a constant value of zero.
616 if (Preprocessing && CurTok.Tok == TOK_IDENT) {
618 ED_MakeConstAbsInt (E, 0);
622 /* All others may only be used if the expression evaluation is not called
623 * recursively by the preprocessor.
626 /* Illegal expression in PP mode */
627 Error ("Preprocessor expression expected");
628 ED_MakeConstAbsInt (E, 1);
632 switch (CurTok.Tok) {
635 /* Identifier. Get a pointer to the symbol table entry */
636 Sym = E->Sym = FindSym (CurTok.Ident);
638 /* Is the symbol known? */
641 /* We found the symbol - skip the name token */
644 /* Check for illegal symbol types */
645 CHECK ((Sym->Flags & SC_LABEL) != SC_LABEL);
646 if (Sym->Flags & SC_TYPE) {
647 /* Cannot use type symbols */
648 Error ("Variable identifier expected");
649 /* Assume an int type to make E valid */
650 E->Flags = E_LOC_STACK | E_RTYPE_LVAL;
655 /* Mark the symbol as referenced */
656 Sym->Flags |= SC_REF;
658 /* The expression type is the symbol type */
661 /* Check for legal symbol types */
662 if ((Sym->Flags & SC_CONST) == SC_CONST) {
663 /* Enum or some other numeric constant */
664 E->Flags = E_LOC_ABS | E_RTYPE_RVAL;
665 E->IVal = Sym->V.ConstVal;
666 } else if ((Sym->Flags & SC_FUNC) == SC_FUNC) {
668 E->Flags = E_LOC_GLOBAL | E_RTYPE_LVAL;
669 E->Name = (unsigned long) Sym->Name;
670 } else if ((Sym->Flags & SC_AUTO) == SC_AUTO) {
671 /* Local variable. If this is a parameter for a variadic
672 * function, we have to add some address calculations, and the
673 * address is not const.
675 if ((Sym->Flags & SC_PARAM) == SC_PARAM && F_IsVariadic (CurrentFunc)) {
676 /* Variadic parameter */
677 g_leavariadic (Sym->V.Offs - F_GetParamSize (CurrentFunc));
678 E->Flags = E_LOC_EXPR | E_RTYPE_LVAL;
680 /* Normal parameter */
681 E->Flags = E_LOC_STACK | E_RTYPE_LVAL;
682 E->IVal = Sym->V.Offs;
684 } else if ((Sym->Flags & SC_REGISTER) == SC_REGISTER) {
685 /* Register variable, zero page based */
686 E->Flags = E_LOC_REGISTER | E_RTYPE_LVAL;
687 E->Name = Sym->V.R.RegOffs;
688 } else if ((Sym->Flags & SC_STATIC) == SC_STATIC) {
689 /* Static variable */
690 if (Sym->Flags & (SC_EXTERN | SC_STORAGE)) {
691 E->Flags = E_LOC_GLOBAL | E_RTYPE_LVAL;
692 E->Name = (unsigned long) Sym->Name;
694 E->Flags = E_LOC_STATIC | E_RTYPE_LVAL;
695 E->Name = Sym->V.Label;
698 /* Local static variable */
699 E->Flags = E_LOC_STATIC | E_RTYPE_LVAL;
700 E->Name = Sym->V.Offs;
703 /* We've made all variables lvalues above. However, this is
704 * not always correct: An array is actually the address of its
705 * first element, which is a rvalue, and a function is a
706 * rvalue, too, because we cannot store anything in a function.
707 * So fix the flags depending on the type.
709 if (IsTypeArray (E->Type) || IsTypeFunc (E->Type)) {
715 /* We did not find the symbol. Remember the name, then skip it */
717 strcpy (Ident, CurTok.Ident);
720 /* IDENT is either an auto-declared function or an undefined variable. */
721 if (CurTok.Tok == TOK_LPAREN) {
722 /* C99 doesn't allow calls to undefined functions, so
723 * generate an error and otherwise a warning. Declare a
724 * function returning int. For that purpose, prepare a
725 * function signature for a function having an empty param
726 * list and returning int.
728 if (IS_Get (&Standard) >= STD_C99) {
729 Error ("Call to undefined function `%s'", Ident);
731 Warning ("Call to undefined function `%s'", Ident);
733 Sym = AddGlobalSym (Ident, GetImplicitFuncType(), SC_EXTERN | SC_REF | SC_FUNC);
735 E->Flags = E_LOC_GLOBAL | E_RTYPE_RVAL;
736 E->Name = (unsigned long) Sym->Name;
738 /* Undeclared Variable */
739 Sym = AddLocalSym (Ident, type_int, SC_AUTO | SC_REF, 0);
740 E->Flags = E_LOC_STACK | E_RTYPE_LVAL;
742 Error ("Undefined symbol: `%s'", Ident);
751 E->Type = GetCharArrayType (GetLiteralPoolOffs () - CurTok.IVal);
752 E->Flags = E_LOC_LITERAL | E_RTYPE_RVAL;
753 E->IVal = CurTok.IVal;
754 E->Name = GetLiteralPoolLabel ();
761 E->Flags = E_LOC_EXPR | E_RTYPE_RVAL;
766 /* Register pseudo variable */
767 E->Type = type_uchar;
768 E->Flags = E_LOC_PRIMARY | E_RTYPE_LVAL;
773 /* Register pseudo variable */
775 E->Flags = E_LOC_PRIMARY | E_RTYPE_LVAL;
780 /* Register pseudo variable */
781 E->Type = type_ulong;
782 E->Flags = E_LOC_PRIMARY | E_RTYPE_LVAL;
787 /* Illegal primary. Be sure to skip the token to avoid endless
790 Error ("Expression expected");
792 ED_MakeConstAbsInt (E, 1);
799 static void ArrayRef (ExprDesc* Expr)
800 /* Handle an array reference. This function needs a rewrite. */
811 /* Skip the bracket */
814 /* Get the type of left side */
817 /* We can apply a special treatment for arrays that have a const base
818 * address. This is true for most arrays and will produce a lot better
819 * code. Check if this is a const base address.
821 ConstBaseAddr = ED_IsRVal (Expr) &&
822 (ED_IsLocConst (Expr) || ED_IsLocStack (Expr));
824 /* If we have a constant base, we delay the address fetch */
826 if (!ConstBaseAddr) {
827 /* Get a pointer to the array into the primary */
828 LoadExpr (CF_NONE, Expr);
830 /* Get the array pointer on stack. Do not push more than 16
831 * bit, even if this value is greater, since we cannot handle
832 * other than 16bit stuff when doing indexing.
838 /* TOS now contains ptr to array elements. Get the subscript. */
839 MarkedExprWithCheck (hie0, &Subscript);
841 /* Check the types of array and subscript. We can either have a
842 * pointer/array to the left, in which case the subscript must be of an
843 * integer type, or we have an integer to the left, in which case the
844 * subscript must be a pointer/array.
845 * Since we do the necessary checking here, we can rely later on the
848 Qualifiers = T_QUAL_NONE;
849 if (IsClassPtr (Expr->Type)) {
850 if (!IsClassInt (Subscript.Type)) {
851 Error ("Array subscript is not an integer");
852 /* To avoid any compiler errors, make the expression a valid int */
853 ED_MakeConstAbsInt (&Subscript, 0);
855 if (IsTypeArray (Expr->Type)) {
856 Qualifiers = GetQualifier (Expr->Type);
858 ElementType = Indirect (Expr->Type);
859 } else if (IsClassInt (Expr->Type)) {
860 if (!IsClassPtr (Subscript.Type)) {
861 Error ("Subscripted value is neither array nor pointer");
862 /* To avoid compiler errors, make the subscript a char[] at
865 ED_MakeConstAbs (&Subscript, 0, GetCharArrayType (1));
866 } else if (IsTypeArray (Subscript.Type)) {
867 Qualifiers = GetQualifier (Subscript.Type);
869 ElementType = Indirect (Subscript.Type);
871 Error ("Cannot subscript");
872 /* To avoid compiler errors, fake both the array and the subscript, so
873 * we can just proceed.
875 ED_MakeConstAbs (Expr, 0, GetCharArrayType (1));
876 ED_MakeConstAbsInt (&Subscript, 0);
877 ElementType = Indirect (Expr->Type);
880 /* The element type has the combined qualifiers from itself and the array,
881 * it is a member of (if any).
883 if (GetQualifier (ElementType) != (GetQualifier (ElementType) | Qualifiers)) {
884 ElementType = TypeDup (ElementType);
885 ElementType->C |= Qualifiers;
888 /* If the subscript is a bit-field, load it and make it an rvalue */
889 if (ED_IsBitField (&Subscript)) {
890 LoadExpr (CF_NONE, &Subscript);
891 ED_MakeRValExpr (&Subscript);
894 /* Check if the subscript is constant absolute value */
895 if (ED_IsConstAbs (&Subscript) && ED_CodeRangeIsEmpty (&Subscript)) {
897 /* The array subscript is a numeric constant. If we had pushed the
898 * array base address onto the stack before, we can remove this value,
899 * since we can generate expression+offset.
901 if (!ConstBaseAddr) {
904 /* Get an array pointer into the primary */
905 LoadExpr (CF_NONE, Expr);
908 if (IsClassPtr (Expr->Type)) {
910 /* Lhs is pointer/array. Scale the subscript value according to
913 Subscript.IVal *= CheckedSizeOf (ElementType);
915 /* Remove the address load code */
918 /* In case of an array, we can adjust the offset of the expression
919 * already in Expr. If the base address was a constant, we can even
920 * remove the code that loaded the address into the primary.
922 if (IsTypeArray (Expr->Type)) {
924 /* Adjust the offset */
925 Expr->IVal += Subscript.IVal;
929 /* It's a pointer, so we do have to load it into the primary
930 * first (if it's not already there).
932 if (ConstBaseAddr || ED_IsLVal (Expr)) {
933 LoadExpr (CF_NONE, Expr);
934 ED_MakeRValExpr (Expr);
938 Expr->IVal = Subscript.IVal;
943 /* Scale the rhs value according to the element type */
944 g_scale (TypeOf (tptr1), CheckedSizeOf (ElementType));
946 /* Add the subscript. Since arrays are indexed by integers,
947 * we will ignore the true type of the subscript here and
948 * use always an int. #### Use offset but beware of LoadExpr!
950 g_inc (CF_INT | CF_CONST, Subscript.IVal);
956 /* Array subscript is not constant. Load it into the primary */
958 LoadExpr (CF_NONE, &Subscript);
961 if (IsClassPtr (Expr->Type)) {
963 /* Indexing is based on unsigneds, so we will just use the integer
964 * portion of the index (which is in (e)ax, so there's no further
967 g_scale (CF_INT, CheckedSizeOf (ElementType));
971 /* Get the int value on top. If we come here, we're sure, both
972 * values are 16 bit (the first one was truncated if necessary
973 * and the second one is a pointer). Note: If ConstBaseAddr is
974 * true, we don't have a value on stack, so to "swap" both, just
975 * push the subscript.
979 LoadExpr (CF_NONE, Expr);
986 g_scale (TypeOf (tptr1), CheckedSizeOf (ElementType));
990 /* The offset is now in the primary register. It we didn't have a
991 * constant base address for the lhs, the lhs address is already
992 * on stack, and we must add the offset. If the base address was
993 * constant, we call special functions to add the address to the
996 if (!ConstBaseAddr) {
998 /* The array base address is on stack and the subscript is in the
1005 /* The subscript is in the primary, and the array base address is
1006 * in Expr. If the subscript has itself a constant address, it is
1007 * often a better idea to reverse again the order of the
1008 * evaluation. This will generate better code if the subscript is
1009 * a byte sized variable. But beware: This is only possible if the
1010 * subscript was not scaled, that is, if this was a byte array
1013 if ((ED_IsLocConst (&Subscript) || ED_IsLocStack (&Subscript)) &&
1014 CheckedSizeOf (ElementType) == SIZEOF_CHAR) {
1018 /* Reverse the order of evaluation */
1019 if (CheckedSizeOf (Subscript.Type) == SIZEOF_CHAR) {
1024 RemoveCode (&Mark2);
1026 /* Get a pointer to the array into the primary. */
1027 LoadExpr (CF_NONE, Expr);
1029 /* Add the variable */
1030 if (ED_IsLocStack (&Subscript)) {
1031 g_addlocal (Flags, Subscript.IVal);
1033 Flags |= GlobalModeFlags (&Subscript);
1034 g_addstatic (Flags, Subscript.Name, Subscript.IVal);
1038 if (ED_IsLocAbs (Expr)) {
1039 /* Constant numeric address. Just add it */
1040 g_inc (CF_INT, Expr->IVal);
1041 } else if (ED_IsLocStack (Expr)) {
1042 /* Base address is a local variable address */
1043 if (IsTypeArray (Expr->Type)) {
1044 g_addaddr_local (CF_INT, Expr->IVal);
1046 g_addlocal (CF_PTR, Expr->IVal);
1049 /* Base address is a static variable address */
1050 unsigned Flags = CF_INT | GlobalModeFlags (Expr);
1051 if (ED_IsRVal (Expr)) {
1052 /* Add the address of the location */
1053 g_addaddr_static (Flags, Expr->Name, Expr->IVal);
1055 /* Add the contents of the location */
1056 g_addstatic (Flags, Expr->Name, Expr->IVal);
1064 /* The result is an expression in the primary */
1065 ED_MakeRValExpr (Expr);
1069 /* Result is of element type */
1070 Expr->Type = ElementType;
1072 /* An array element is actually a variable. So the rules for variables
1073 * with respect to the reference type apply: If it's an array, it is
1074 * a rvalue, otherwise it's an lvalue. (A function would also be a rvalue,
1075 * but an array cannot contain functions).
1077 if (IsTypeArray (Expr->Type)) {
1083 /* Consume the closing bracket */
1089 static void StructRef (ExprDesc* Expr)
1090 /* Process struct field after . or ->. */
1096 /* Skip the token and check for an identifier */
1098 if (CurTok.Tok != TOK_IDENT) {
1099 Error ("Identifier expected");
1100 /* Make the expression an integer at address zero */
1101 ED_MakeConstAbs (Expr, 0, type_int);
1105 /* Get the symbol table entry and check for a struct field */
1106 strcpy (Ident, CurTok.Ident);
1108 Field = FindStructField (Expr->Type, Ident);
1110 Error ("Struct/union has no field named `%s'", Ident);
1111 /* Make the expression an integer at address zero */
1112 ED_MakeConstAbs (Expr, 0, type_int);
1116 /* If we have a struct pointer that is an lvalue and not already in the
1117 * primary, load it now.
1119 if (ED_IsLVal (Expr) && IsTypePtr (Expr->Type)) {
1121 /* Load into the primary */
1122 LoadExpr (CF_NONE, Expr);
1124 /* Make it an lvalue expression */
1125 ED_MakeLValExpr (Expr);
1128 /* Set the struct field offset */
1129 Expr->IVal += Field->V.Offs;
1131 /* The type is the type of the field plus any qualifiers from the struct */
1132 if (IsClassStruct (Expr->Type)) {
1133 Q = GetQualifier (Expr->Type);
1135 Q = GetQualifier (Indirect (Expr->Type));
1137 if (GetQualifier (Field->Type) == (GetQualifier (Field->Type) | Q)) {
1138 Expr->Type = Field->Type;
1140 Expr->Type = TypeDup (Field->Type);
1144 /* An struct member is actually a variable. So the rules for variables
1145 * with respect to the reference type apply: If it's an array, it is
1146 * a rvalue, otherwise it's an lvalue. (A function would also be a rvalue,
1147 * but a struct field cannot be a function).
1149 if (IsTypeArray (Expr->Type)) {
1155 /* Make the expression a bit field if necessary */
1156 if (SymIsBitField (Field)) {
1157 ED_MakeBitField (Expr, Field->V.B.BitOffs, Field->V.B.BitWidth);
1163 static void hie11 (ExprDesc *Expr)
1164 /* Handle compound types (structs and arrays) */
1166 /* Name value used in invalid function calls */
1167 static const char IllegalFunc[] = "illegal_function_call";
1169 /* Evaluate the lhs */
1172 /* Check for a rhs */
1173 while (CurTok.Tok == TOK_LBRACK || CurTok.Tok == TOK_LPAREN ||
1174 CurTok.Tok == TOK_DOT || CurTok.Tok == TOK_PTR_REF) {
1176 switch (CurTok.Tok) {
1179 /* Array reference */
1184 /* Function call. */
1185 if (!IsTypeFunc (Expr->Type) && !IsTypeFuncPtr (Expr->Type)) {
1186 /* Not a function */
1187 Error ("Illegal function call");
1188 /* Force the type to be a implicitly defined function, one
1189 * returning an int and taking any number of arguments.
1190 * Since we don't have a name, invent one.
1192 ED_MakeConstAbs (Expr, 0, GetImplicitFuncType ());
1193 Expr->Name = (long) IllegalFunc;
1195 /* Call the function */
1196 FunctionCall (Expr);
1200 if (!IsClassStruct (Expr->Type)) {
1201 Error ("Struct expected");
1207 /* If we have an array, convert it to pointer to first element */
1208 if (IsTypeArray (Expr->Type)) {
1209 Expr->Type = ArrayToPtr (Expr->Type);
1211 if (!IsClassPtr (Expr->Type) || !IsClassStruct (Indirect (Expr->Type))) {
1212 Error ("Struct pointer expected");
1218 Internal ("Invalid token in hie11: %d", CurTok.Tok);
1226 void Store (ExprDesc* Expr, const Type* StoreType)
1227 /* Store the primary register into the location denoted by Expr. If StoreType
1228 * is given, use this type when storing instead of Expr->Type. If StoreType
1229 * is NULL, use Expr->Type instead.
1234 /* If StoreType was not given, use Expr->Type instead */
1235 if (StoreType == 0) {
1236 StoreType = Expr->Type;
1239 /* Prepare the code generator flags */
1240 Flags = TypeOf (StoreType) | GlobalModeFlags (Expr);
1242 /* Do the store depending on the location */
1243 switch (ED_GetLoc (Expr)) {
1246 /* Absolute: numeric address or const */
1247 g_putstatic (Flags, Expr->IVal, 0);
1251 /* Global variable */
1252 g_putstatic (Flags, Expr->Name, Expr->IVal);
1257 /* Static variable or literal in the literal pool */
1258 g_putstatic (Flags, Expr->Name, Expr->IVal);
1261 case E_LOC_REGISTER:
1262 /* Register variable */
1263 g_putstatic (Flags, Expr->Name, Expr->IVal);
1267 /* Value on the stack */
1268 g_putlocal (Flags, Expr->IVal, 0);
1272 /* The primary register (value is already there) */
1276 /* An expression in the primary register */
1277 g_putind (Flags, Expr->IVal);
1281 Internal ("Invalid location in Store(): 0x%04X", ED_GetLoc (Expr));
1284 /* Assume that each one of the stores will invalidate CC */
1285 ED_MarkAsUntested (Expr);
1290 static void PreInc (ExprDesc* Expr)
1291 /* Handle the preincrement operators */
1296 /* Skip the operator token */
1299 /* Evaluate the expression and check that it is an lvalue */
1301 if (!ED_IsLVal (Expr)) {
1302 Error ("Invalid lvalue");
1306 /* We cannot modify const values */
1307 if (IsQualConst (Expr->Type)) {
1308 Error ("Increment of read-only variable");
1311 /* Get the data type */
1312 Flags = TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR | CF_CONST;
1314 /* Get the increment value in bytes */
1315 Val = IsTypePtr (Expr->Type)? CheckedPSizeOf (Expr->Type) : 1;
1317 /* Check the location of the data */
1318 switch (ED_GetLoc (Expr)) {
1321 /* Absolute: numeric address or const */
1322 g_addeqstatic (Flags, Expr->IVal, 0, Val);
1326 /* Global variable */
1327 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1332 /* Static variable or literal in the literal pool */
1333 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1336 case E_LOC_REGISTER:
1337 /* Register variable */
1338 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1342 /* Value on the stack */
1343 g_addeqlocal (Flags, Expr->IVal, Val);
1347 /* The primary register */
1352 /* An expression in the primary register */
1353 g_addeqind (Flags, Expr->IVal, Val);
1357 Internal ("Invalid location in PreInc(): 0x%04X", ED_GetLoc (Expr));
1360 /* Result is an expression, no reference */
1361 ED_MakeRValExpr (Expr);
1366 static void PreDec (ExprDesc* Expr)
1367 /* Handle the predecrement operators */
1372 /* Skip the operator token */
1375 /* Evaluate the expression and check that it is an lvalue */
1377 if (!ED_IsLVal (Expr)) {
1378 Error ("Invalid lvalue");
1382 /* We cannot modify const values */
1383 if (IsQualConst (Expr->Type)) {
1384 Error ("Decrement of read-only variable");
1387 /* Get the data type */
1388 Flags = TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR | CF_CONST;
1390 /* Get the increment value in bytes */
1391 Val = IsTypePtr (Expr->Type)? CheckedPSizeOf (Expr->Type) : 1;
1393 /* Check the location of the data */
1394 switch (ED_GetLoc (Expr)) {
1397 /* Absolute: numeric address or const */
1398 g_subeqstatic (Flags, Expr->IVal, 0, Val);
1402 /* Global variable */
1403 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1408 /* Static variable or literal in the literal pool */
1409 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1412 case E_LOC_REGISTER:
1413 /* Register variable */
1414 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1418 /* Value on the stack */
1419 g_subeqlocal (Flags, Expr->IVal, Val);
1423 /* The primary register */
1428 /* An expression in the primary register */
1429 g_subeqind (Flags, Expr->IVal, Val);
1433 Internal ("Invalid location in PreDec(): 0x%04X", ED_GetLoc (Expr));
1436 /* Result is an expression, no reference */
1437 ED_MakeRValExpr (Expr);
1442 static void PostInc (ExprDesc* Expr)
1443 /* Handle the postincrement operator */
1449 /* The expression to increment must be an lvalue */
1450 if (!ED_IsLVal (Expr)) {
1451 Error ("Invalid lvalue");
1455 /* We cannot modify const values */
1456 if (IsQualConst (Expr->Type)) {
1457 Error ("Increment of read-only variable");
1460 /* Get the data type */
1461 Flags = TypeOf (Expr->Type);
1463 /* Push the address if needed */
1466 /* Fetch the value and save it (since it's the result of the expression) */
1467 LoadExpr (CF_NONE, Expr);
1468 g_save (Flags | CF_FORCECHAR);
1470 /* If we have a pointer expression, increment by the size of the type */
1471 if (IsTypePtr (Expr->Type)) {
1472 g_inc (Flags | CF_CONST | CF_FORCECHAR, CheckedSizeOf (Expr->Type + 1));
1474 g_inc (Flags | CF_CONST | CF_FORCECHAR, 1);
1477 /* Store the result back */
1480 /* Restore the original value in the primary register */
1481 g_restore (Flags | CF_FORCECHAR);
1483 /* The result is always an expression, no reference */
1484 ED_MakeRValExpr (Expr);
1489 static void PostDec (ExprDesc* Expr)
1490 /* Handle the postdecrement operator */
1496 /* The expression to increment must be an lvalue */
1497 if (!ED_IsLVal (Expr)) {
1498 Error ("Invalid lvalue");
1502 /* We cannot modify const values */
1503 if (IsQualConst (Expr->Type)) {
1504 Error ("Decrement of read-only variable");
1507 /* Get the data type */
1508 Flags = TypeOf (Expr->Type);
1510 /* Push the address if needed */
1513 /* Fetch the value and save it (since it's the result of the expression) */
1514 LoadExpr (CF_NONE, Expr);
1515 g_save (Flags | CF_FORCECHAR);
1517 /* If we have a pointer expression, increment by the size of the type */
1518 if (IsTypePtr (Expr->Type)) {
1519 g_dec (Flags | CF_CONST | CF_FORCECHAR, CheckedSizeOf (Expr->Type + 1));
1521 g_dec (Flags | CF_CONST | CF_FORCECHAR, 1);
1524 /* Store the result back */
1527 /* Restore the original value in the primary register */
1528 g_restore (Flags | CF_FORCECHAR);
1530 /* The result is always an expression, no reference */
1531 ED_MakeRValExpr (Expr);
1536 static void UnaryOp (ExprDesc* Expr)
1537 /* Handle unary -/+ and ~ */
1541 /* Remember the operator token and skip it */
1542 token_t Tok = CurTok.Tok;
1545 /* Get the expression */
1548 /* We can only handle integer types */
1549 if (!IsClassInt (Expr->Type)) {
1550 Error ("Argument must have integer type");
1551 ED_MakeConstAbsInt (Expr, 1);
1554 /* Check for a constant expression */
1555 if (ED_IsConstAbs (Expr)) {
1556 /* Value is constant */
1558 case TOK_MINUS: Expr->IVal = -Expr->IVal; break;
1559 case TOK_PLUS: break;
1560 case TOK_COMP: Expr->IVal = ~Expr->IVal; break;
1561 default: Internal ("Unexpected token: %d", Tok);
1564 /* Value is not constant */
1565 LoadExpr (CF_NONE, Expr);
1567 /* Get the type of the expression */
1568 Flags = TypeOf (Expr->Type);
1570 /* Handle the operation */
1572 case TOK_MINUS: g_neg (Flags); break;
1573 case TOK_PLUS: break;
1574 case TOK_COMP: g_com (Flags); break;
1575 default: Internal ("Unexpected token: %d", Tok);
1578 /* The result is a rvalue in the primary */
1579 ED_MakeRValExpr (Expr);
1585 void hie10 (ExprDesc* Expr)
1586 /* Handle ++, --, !, unary - etc. */
1590 switch (CurTok.Tok) {
1608 if (evalexpr (CF_NONE, hie10, Expr) == 0) {
1609 /* Constant expression */
1610 Expr->IVal = !Expr->IVal;
1612 g_bneg (TypeOf (Expr->Type));
1613 ED_MakeRValExpr (Expr);
1614 ED_TestDone (Expr); /* bneg will set cc */
1620 ExprWithCheck (hie10, Expr);
1621 if (ED_IsLVal (Expr) || !(ED_IsLocConst (Expr) || ED_IsLocStack (Expr))) {
1622 /* Not a const, load it into the primary and make it a
1625 LoadExpr (CF_NONE, Expr);
1626 ED_MakeRValExpr (Expr);
1628 /* If the expression is already a pointer to function, the
1629 * additional dereferencing operator must be ignored. A function
1630 * itself is represented as "pointer to function", so any number
1631 * of dereference operators is legal, since the result will
1632 * always be converted to "pointer to function".
1634 if (IsTypeFuncPtr (Expr->Type) || IsTypeFunc (Expr->Type)) {
1635 /* Expression not storable */
1638 if (IsClassPtr (Expr->Type)) {
1639 Expr->Type = Indirect (Expr->Type);
1641 Error ("Illegal indirection");
1643 /* The * operator yields an lvalue */
1650 ExprWithCheck (hie10, Expr);
1651 /* The & operator may be applied to any lvalue, and it may be
1652 * applied to functions, even if they're no lvalues.
1654 if (ED_IsRVal (Expr) && !IsTypeFunc (Expr->Type) && !IsTypeArray (Expr->Type)) {
1655 Error ("Illegal address");
1657 if (ED_IsBitField (Expr)) {
1658 Error ("Cannot take address of bit-field");
1659 /* Do it anyway, just to avoid further warnings */
1660 Expr->Flags &= ~E_BITFIELD;
1662 Expr->Type = PointerTo (Expr->Type);
1663 /* The & operator yields an rvalue */
1670 if (TypeSpecAhead ()) {
1673 Size = CheckedSizeOf (ParseType (T));
1676 /* Remember the output queue pointer */
1680 Size = CheckedSizeOf (Expr->Type);
1681 /* Remove any generated code */
1684 ED_MakeConstAbs (Expr, Size, type_size_t);
1685 ED_MarkAsUntested (Expr);
1689 if (TypeSpecAhead ()) {
1699 /* Handle post increment */
1700 switch (CurTok.Tok) {
1701 case TOK_INC: PostInc (Expr); break;
1702 case TOK_DEC: PostDec (Expr); break;
1713 static void hie_internal (const GenDesc* Ops, /* List of generators */
1715 void (*hienext) (ExprDesc*),
1717 /* Helper function */
1723 token_t Tok; /* The operator token */
1724 unsigned ltype, type;
1725 int rconst; /* Operand is a constant */
1731 while ((Gen = FindGen (CurTok.Tok, Ops)) != 0) {
1733 /* Tell the caller that we handled it's ops */
1736 /* All operators that call this function expect an int on the lhs */
1737 if (!IsClassInt (Expr->Type)) {
1738 Error ("Integer expression expected");
1739 /* To avoid further errors, make Expr a valid int expression */
1740 ED_MakeConstAbsInt (Expr, 1);
1743 /* Remember the operator token, then skip it */
1747 /* Get the lhs on stack */
1748 GetCodePos (&Mark1);
1749 ltype = TypeOf (Expr->Type);
1750 if (ED_IsConstAbs (Expr)) {
1751 /* Constant value */
1752 GetCodePos (&Mark2);
1753 g_push (ltype | CF_CONST, Expr->IVal);
1755 /* Value not constant */
1756 LoadExpr (CF_NONE, Expr);
1757 GetCodePos (&Mark2);
1761 /* Get the right hand side */
1762 MarkedExprWithCheck (hienext, &Expr2);
1764 /* Check for a constant expression */
1765 rconst = (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2));
1767 /* Not constant, load into the primary */
1768 LoadExpr (CF_NONE, &Expr2);
1771 /* Check the type of the rhs */
1772 if (!IsClassInt (Expr2.Type)) {
1773 Error ("Integer expression expected");
1776 /* Check for const operands */
1777 if (ED_IsConstAbs (Expr) && rconst) {
1779 /* Both operands are constant, remove the generated code */
1780 RemoveCode (&Mark1);
1782 /* Get the type of the result */
1783 Expr->Type = promoteint (Expr->Type, Expr2.Type);
1785 /* Handle the op differently for signed and unsigned types */
1786 if (IsSignSigned (Expr->Type)) {
1788 /* Evaluate the result for signed operands */
1789 signed long Val1 = Expr->IVal;
1790 signed long Val2 = Expr2.IVal;
1793 Expr->IVal = (Val1 | Val2);
1796 Expr->IVal = (Val1 ^ Val2);
1799 Expr->IVal = (Val1 & Val2);
1802 Expr->IVal = (Val1 * Val2);
1806 Error ("Division by zero");
1807 Expr->IVal = 0x7FFFFFFF;
1809 Expr->IVal = (Val1 / Val2);
1814 Error ("Modulo operation with zero");
1817 Expr->IVal = (Val1 % Val2);
1821 Internal ("hie_internal: got token 0x%X\n", Tok);
1825 /* Evaluate the result for unsigned operands */
1826 unsigned long Val1 = Expr->IVal;
1827 unsigned long Val2 = Expr2.IVal;
1830 Expr->IVal = (Val1 | Val2);
1833 Expr->IVal = (Val1 ^ Val2);
1836 Expr->IVal = (Val1 & Val2);
1839 Expr->IVal = (Val1 * Val2);
1843 Error ("Division by zero");
1844 Expr->IVal = 0xFFFFFFFF;
1846 Expr->IVal = (Val1 / Val2);
1851 Error ("Modulo operation with zero");
1854 Expr->IVal = (Val1 % Val2);
1858 Internal ("hie_internal: got token 0x%X\n", Tok);
1864 /* If the right hand side is constant, and the generator function
1865 * expects the lhs in the primary, remove the push of the primary
1868 unsigned rtype = TypeOf (Expr2.Type);
1871 /* Second value is constant - check for div */
1874 if (Tok == TOK_DIV && Expr2.IVal == 0) {
1875 Error ("Division by zero");
1876 } else if (Tok == TOK_MOD && Expr2.IVal == 0) {
1877 Error ("Modulo operation with zero");
1879 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1880 RemoveCode (&Mark2);
1881 ltype |= CF_REG; /* Value is in register */
1885 /* Determine the type of the operation result. */
1886 type |= g_typeadjust (ltype, rtype);
1887 Expr->Type = promoteint (Expr->Type, Expr2.Type);
1890 Gen->Func (type, Expr2.IVal);
1892 /* We have a rvalue in the primary now */
1893 ED_MakeRValExpr (Expr);
1900 static void hie_compare (const GenDesc* Ops, /* List of generators */
1902 void (*hienext) (ExprDesc*))
1903 /* Helper function for the compare operators */
1909 token_t Tok; /* The operator token */
1911 int rconst; /* Operand is a constant */
1916 while ((Gen = FindGen (CurTok.Tok, Ops)) != 0) {
1918 /* Remember the operator token, then skip it */
1922 /* Get the lhs on stack */
1923 GetCodePos (&Mark1);
1924 ltype = TypeOf (Expr->Type);
1925 if (ED_IsConstAbs (Expr)) {
1926 /* Constant value */
1927 GetCodePos (&Mark2);
1928 g_push (ltype | CF_CONST, Expr->IVal);
1930 /* Value not constant */
1931 LoadExpr (CF_NONE, Expr);
1932 GetCodePos (&Mark2);
1936 /* Get the right hand side */
1937 MarkedExprWithCheck (hienext, &Expr2);
1939 /* Check for a constant expression */
1940 rconst = (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2));
1942 /* Not constant, load into the primary */
1943 LoadExpr (CF_NONE, &Expr2);
1946 /* Make sure, the types are compatible */
1947 if (IsClassInt (Expr->Type)) {
1948 if (!IsClassInt (Expr2.Type) && !(IsClassPtr(Expr2.Type) && ED_IsNullPtr(Expr))) {
1949 Error ("Incompatible types");
1951 } else if (IsClassPtr (Expr->Type)) {
1952 if (IsClassPtr (Expr2.Type)) {
1953 /* Both pointers are allowed in comparison if they point to
1954 * the same type, or if one of them is a void pointer.
1956 Type* left = Indirect (Expr->Type);
1957 Type* right = Indirect (Expr2.Type);
1958 if (TypeCmp (left, right) < TC_EQUAL && left->C != T_VOID && right->C != T_VOID) {
1959 /* Incomatible pointers */
1960 Error ("Incompatible types");
1962 } else if (!ED_IsNullPtr (&Expr2)) {
1963 Error ("Incompatible types");
1967 /* Check for const operands */
1968 if (ED_IsConstAbs (Expr) && rconst) {
1970 /* If the result is constant, this is suspicious when not in
1971 * preprocessor mode.
1973 if (!Preprocessing) {
1974 Warning ("Result of comparison is constant");
1977 /* Both operands are constant, remove the generated code */
1978 RemoveCode (&Mark1);
1980 /* Determine if this is a signed or unsigned compare */
1981 if (IsClassInt (Expr->Type) && IsSignSigned (Expr->Type) &&
1982 IsClassInt (Expr2.Type) && IsSignSigned (Expr2.Type)) {
1984 /* Evaluate the result for signed operands */
1985 signed long Val1 = Expr->IVal;
1986 signed long Val2 = Expr2.IVal;
1988 case TOK_EQ: Expr->IVal = (Val1 == Val2); break;
1989 case TOK_NE: Expr->IVal = (Val1 != Val2); break;
1990 case TOK_LT: Expr->IVal = (Val1 < Val2); break;
1991 case TOK_LE: Expr->IVal = (Val1 <= Val2); break;
1992 case TOK_GE: Expr->IVal = (Val1 >= Val2); break;
1993 case TOK_GT: Expr->IVal = (Val1 > Val2); break;
1994 default: Internal ("hie_compare: got token 0x%X\n", Tok);
1999 /* Evaluate the result for unsigned operands */
2000 unsigned long Val1 = Expr->IVal;
2001 unsigned long Val2 = Expr2.IVal;
2003 case TOK_EQ: Expr->IVal = (Val1 == Val2); break;
2004 case TOK_NE: Expr->IVal = (Val1 != Val2); break;
2005 case TOK_LT: Expr->IVal = (Val1 < Val2); break;
2006 case TOK_LE: Expr->IVal = (Val1 <= Val2); break;
2007 case TOK_GE: Expr->IVal = (Val1 >= Val2); break;
2008 case TOK_GT: Expr->IVal = (Val1 > Val2); break;
2009 default: Internal ("hie_compare: got token 0x%X\n", Tok);
2015 /* If the right hand side is constant, and the generator function
2016 * expects the lhs in the primary, remove the push of the primary
2022 if ((Gen->Flags & GEN_NOPUSH) != 0) {
2023 RemoveCode (&Mark2);
2024 ltype |= CF_REG; /* Value is in register */
2028 /* Determine the type of the operation result. If the left
2029 * operand is of type char and the right is a constant, or
2030 * if both operands are of type char, we will encode the
2031 * operation as char operation. Otherwise the default
2032 * promotions are used.
2034 if (IsTypeChar (Expr->Type) && (IsTypeChar (Expr2.Type) || rconst)) {
2036 if (IsSignUnsigned (Expr->Type) || IsSignUnsigned (Expr2.Type)) {
2037 flags |= CF_UNSIGNED;
2040 flags |= CF_FORCECHAR;
2043 unsigned rtype = TypeOf (Expr2.Type) | (flags & CF_CONST);
2044 flags |= g_typeadjust (ltype, rtype);
2048 Gen->Func (flags, Expr2.IVal);
2050 /* The result is an rvalue in the primary */
2051 ED_MakeRValExpr (Expr);
2054 /* Result type is always int */
2055 Expr->Type = type_int;
2057 /* Condition codes are set */
2064 static void hie9 (ExprDesc *Expr)
2065 /* Process * and / operators. */
2067 static const GenDesc hie9_ops[] = {
2068 { TOK_STAR, GEN_NOPUSH, g_mul },
2069 { TOK_DIV, GEN_NOPUSH, g_div },
2070 { TOK_MOD, GEN_NOPUSH, g_mod },
2071 { TOK_INVALID, 0, 0 }
2075 hie_internal (hie9_ops, Expr, hie10, &UsedGen);
2080 static void parseadd (ExprDesc* Expr)
2081 /* Parse an expression with the binary plus operator. Expr contains the
2082 * unprocessed left hand side of the expression and will contain the
2083 * result of the expression on return.
2087 unsigned flags; /* Operation flags */
2088 CodeMark Mark; /* Remember code position */
2089 Type* lhst; /* Type of left hand side */
2090 Type* rhst; /* Type of right hand side */
2093 /* Skip the PLUS token */
2096 /* Get the left hand side type, initialize operation flags */
2100 /* Check for constness on both sides */
2101 if (ED_IsConst (Expr)) {
2103 /* The left hand side is a constant of some sort. Good. Get rhs */
2105 if (ED_IsConstAbs (&Expr2)) {
2107 /* Right hand side is a constant numeric value. Get the rhs type */
2110 /* Both expressions are constants. Check for pointer arithmetic */
2111 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2112 /* Left is pointer, right is int, must scale rhs */
2113 Expr->IVal += Expr2.IVal * CheckedPSizeOf (lhst);
2114 /* Result type is a pointer */
2115 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2116 /* Left is int, right is pointer, must scale lhs */
2117 Expr->IVal = Expr->IVal * CheckedPSizeOf (rhst) + Expr2.IVal;
2118 /* Result type is a pointer */
2119 Expr->Type = Expr2.Type;
2120 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2121 /* Integer addition */
2122 Expr->IVal += Expr2.IVal;
2123 typeadjust (Expr, &Expr2, 1);
2126 Error ("Invalid operands for binary operator `+'");
2131 /* lhs is a constant and rhs is not constant. Load rhs into
2134 LoadExpr (CF_NONE, &Expr2);
2136 /* Beware: The check above (for lhs) lets not only pass numeric
2137 * constants, but also constant addresses (labels), maybe even
2138 * with an offset. We have to check for that here.
2141 /* First, get the rhs type. */
2145 if (ED_IsLocAbs (Expr)) {
2146 /* A numerical constant */
2149 /* Constant address label */
2150 flags |= GlobalModeFlags (Expr) | CF_CONSTADDR;
2153 /* Check for pointer arithmetic */
2154 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2155 /* Left is pointer, right is int, must scale rhs */
2156 g_scale (CF_INT, CheckedPSizeOf (lhst));
2157 /* Operate on pointers, result type is a pointer */
2159 /* Generate the code for the add */
2160 if (ED_GetLoc (Expr) == E_LOC_ABS) {
2161 /* Numeric constant */
2162 g_inc (flags, Expr->IVal);
2164 /* Constant address */
2165 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2167 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2169 /* Left is int, right is pointer, must scale lhs. */
2170 unsigned ScaleFactor = CheckedPSizeOf (rhst);
2172 /* Operate on pointers, result type is a pointer */
2174 Expr->Type = Expr2.Type;
2176 /* Since we do already have rhs in the primary, if lhs is
2177 * not a numeric constant, and the scale factor is not one
2178 * (no scaling), we must take the long way over the stack.
2180 if (ED_IsLocAbs (Expr)) {
2181 /* Numeric constant, scale lhs */
2182 Expr->IVal *= ScaleFactor;
2183 /* Generate the code for the add */
2184 g_inc (flags, Expr->IVal);
2185 } else if (ScaleFactor == 1) {
2186 /* Constant address but no need to scale */
2187 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2189 /* Constant address that must be scaled */
2190 g_push (TypeOf (Expr2.Type), 0); /* rhs --> stack */
2191 g_getimmed (flags, Expr->Name, Expr->IVal);
2192 g_scale (CF_PTR, ScaleFactor);
2195 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2196 /* Integer addition */
2197 flags |= typeadjust (Expr, &Expr2, 1);
2198 /* Generate the code for the add */
2199 if (ED_IsLocAbs (Expr)) {
2200 /* Numeric constant */
2201 g_inc (flags, Expr->IVal);
2203 /* Constant address */
2204 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2208 Error ("Invalid operands for binary operator `+'");
2212 /* Result is a rvalue in primary register */
2213 ED_MakeRValExpr (Expr);
2218 /* Left hand side is not constant. Get the value onto the stack. */
2219 LoadExpr (CF_NONE, Expr); /* --> primary register */
2221 g_push (TypeOf (Expr->Type), 0); /* --> stack */
2223 /* Evaluate the rhs */
2224 MarkedExprWithCheck (hie9, &Expr2);
2226 /* Check for a constant rhs expression */
2227 if (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2)) {
2229 /* Right hand side is a constant. Get the rhs type */
2232 /* Remove pushed value from stack */
2235 /* Check for pointer arithmetic */
2236 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2237 /* Left is pointer, right is int, must scale rhs */
2238 Expr2.IVal *= CheckedPSizeOf (lhst);
2239 /* Operate on pointers, result type is a pointer */
2241 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2242 /* Left is int, right is pointer, must scale lhs (ptr only) */
2243 g_scale (CF_INT | CF_CONST, CheckedPSizeOf (rhst));
2244 /* Operate on pointers, result type is a pointer */
2246 Expr->Type = Expr2.Type;
2247 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2248 /* Integer addition */
2249 flags = typeadjust (Expr, &Expr2, 1);
2252 Error ("Invalid operands for binary operator `+'");
2256 /* Generate code for the add */
2257 g_inc (flags | CF_CONST, Expr2.IVal);
2261 /* Not constant, load into the primary */
2262 LoadExpr (CF_NONE, &Expr2);
2264 /* lhs and rhs are not constant. Get the rhs type. */
2267 /* Check for pointer arithmetic */
2268 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2269 /* Left is pointer, right is int, must scale rhs */
2270 g_scale (CF_INT, CheckedPSizeOf (lhst));
2271 /* Operate on pointers, result type is a pointer */
2273 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2274 /* Left is int, right is pointer, must scale lhs */
2275 g_tosint (TypeOf (rhst)); /* Make sure, TOS is int */
2276 g_swap (CF_INT); /* Swap TOS and primary */
2277 g_scale (CF_INT, CheckedPSizeOf (rhst));
2278 /* Operate on pointers, result type is a pointer */
2280 Expr->Type = Expr2.Type;
2281 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2282 /* Integer addition. Note: Result is never constant.
2283 * Problem here is that typeadjust does not know if the
2284 * variable is an rvalue or lvalue, so if both operands
2285 * are dereferenced constant numeric addresses, typeadjust
2286 * thinks the operation works on constants. Removing
2287 * CF_CONST here means handling the symptoms, however, the
2288 * whole parser is such a mess that I fear to break anything
2289 * when trying to apply another solution.
2291 flags = typeadjust (Expr, &Expr2, 0) & ~CF_CONST;
2294 Error ("Invalid operands for binary operator `+'");
2298 /* Generate code for the add */
2303 /* Result is a rvalue in primary register */
2304 ED_MakeRValExpr (Expr);
2307 /* Condition codes not set */
2308 ED_MarkAsUntested (Expr);
2314 static void parsesub (ExprDesc* Expr)
2315 /* Parse an expression with the binary minus operator. Expr contains the
2316 * unprocessed left hand side of the expression and will contain the
2317 * result of the expression on return.
2321 unsigned flags; /* Operation flags */
2322 Type* lhst; /* Type of left hand side */
2323 Type* rhst; /* Type of right hand side */
2324 CodeMark Mark1; /* Save position of output queue */
2325 CodeMark Mark2; /* Another position in the queue */
2326 int rscale; /* Scale factor for the result */
2329 /* Skip the MINUS token */
2332 /* Get the left hand side type, initialize operation flags */
2334 rscale = 1; /* Scale by 1, that is, don't scale */
2336 /* Remember the output queue position, then bring the value onto the stack */
2337 GetCodePos (&Mark1);
2338 LoadExpr (CF_NONE, Expr); /* --> primary register */
2339 GetCodePos (&Mark2);
2340 g_push (TypeOf (lhst), 0); /* --> stack */
2342 /* Parse the right hand side */
2343 MarkedExprWithCheck (hie9, &Expr2);
2345 /* Check for a constant rhs expression */
2346 if (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2)) {
2348 /* The right hand side is constant. Get the rhs type. */
2351 /* Check left hand side */
2352 if (ED_IsConstAbs (Expr)) {
2354 /* Both sides are constant, remove generated code */
2355 RemoveCode (&Mark1);
2357 /* Check for pointer arithmetic */
2358 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2359 /* Left is pointer, right is int, must scale rhs */
2360 Expr->IVal -= Expr2.IVal * CheckedPSizeOf (lhst);
2361 /* Operate on pointers, result type is a pointer */
2362 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2363 /* Left is pointer, right is pointer, must scale result */
2364 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2365 Error ("Incompatible pointer types");
2367 Expr->IVal = (Expr->IVal - Expr2.IVal) /
2368 CheckedPSizeOf (lhst);
2370 /* Operate on pointers, result type is an integer */
2371 Expr->Type = type_int;
2372 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2373 /* Integer subtraction */
2374 typeadjust (Expr, &Expr2, 1);
2375 Expr->IVal -= Expr2.IVal;
2378 Error ("Invalid operands for binary operator `-'");
2381 /* Result is constant, condition codes not set */
2382 ED_MarkAsUntested (Expr);
2386 /* Left hand side is not constant, right hand side is.
2387 * Remove pushed value from stack.
2389 RemoveCode (&Mark2);
2391 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2392 /* Left is pointer, right is int, must scale rhs */
2393 Expr2.IVal *= CheckedPSizeOf (lhst);
2394 /* Operate on pointers, result type is a pointer */
2396 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2397 /* Left is pointer, right is pointer, must scale result */
2398 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2399 Error ("Incompatible pointer types");
2401 rscale = CheckedPSizeOf (lhst);
2403 /* Operate on pointers, result type is an integer */
2405 Expr->Type = type_int;
2406 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2407 /* Integer subtraction */
2408 flags = typeadjust (Expr, &Expr2, 1);
2411 Error ("Invalid operands for binary operator `-'");
2415 /* Do the subtraction */
2416 g_dec (flags | CF_CONST, Expr2.IVal);
2418 /* If this was a pointer subtraction, we must scale the result */
2420 g_scale (flags, -rscale);
2423 /* Result is a rvalue in the primary register */
2424 ED_MakeRValExpr (Expr);
2425 ED_MarkAsUntested (Expr);
2431 /* Not constant, load into the primary */
2432 LoadExpr (CF_NONE, &Expr2);
2434 /* Right hand side is not constant. Get the rhs type. */
2437 /* Check for pointer arithmetic */
2438 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2439 /* Left is pointer, right is int, must scale rhs */
2440 g_scale (CF_INT, CheckedPSizeOf (lhst));
2441 /* Operate on pointers, result type is a pointer */
2443 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2444 /* Left is pointer, right is pointer, must scale result */
2445 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2446 Error ("Incompatible pointer types");
2448 rscale = CheckedPSizeOf (lhst);
2450 /* Operate on pointers, result type is an integer */
2452 Expr->Type = type_int;
2453 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2454 /* Integer subtraction. If the left hand side descriptor says that
2455 * the lhs is const, we have to remove this mark, since this is no
2456 * longer true, lhs is on stack instead.
2458 if (ED_IsLocAbs (Expr)) {
2459 ED_MakeRValExpr (Expr);
2461 /* Adjust operand types */
2462 flags = typeadjust (Expr, &Expr2, 0);
2465 Error ("Invalid operands for binary operator `-'");
2469 /* Generate code for the sub (the & is a hack here) */
2470 g_sub (flags & ~CF_CONST, 0);
2472 /* If this was a pointer subtraction, we must scale the result */
2474 g_scale (flags, -rscale);
2477 /* Result is a rvalue in the primary register */
2478 ED_MakeRValExpr (Expr);
2479 ED_MarkAsUntested (Expr);
2485 void hie8 (ExprDesc* Expr)
2486 /* Process + and - binary operators. */
2489 while (CurTok.Tok == TOK_PLUS || CurTok.Tok == TOK_MINUS) {
2490 if (CurTok.Tok == TOK_PLUS) {
2500 static void hie6 (ExprDesc* Expr)
2501 /* Handle greater-than type comparators */
2503 static const GenDesc hie6_ops [] = {
2504 { TOK_LT, GEN_NOPUSH, g_lt },
2505 { TOK_LE, GEN_NOPUSH, g_le },
2506 { TOK_GE, GEN_NOPUSH, g_ge },
2507 { TOK_GT, GEN_NOPUSH, g_gt },
2508 { TOK_INVALID, 0, 0 }
2510 hie_compare (hie6_ops, Expr, ShiftExpr);
2515 static void hie5 (ExprDesc* Expr)
2516 /* Handle == and != */
2518 static const GenDesc hie5_ops[] = {
2519 { TOK_EQ, GEN_NOPUSH, g_eq },
2520 { TOK_NE, GEN_NOPUSH, g_ne },
2521 { TOK_INVALID, 0, 0 }
2523 hie_compare (hie5_ops, Expr, hie6);
2528 static void hie4 (ExprDesc* Expr)
2529 /* Handle & (bitwise and) */
2531 static const GenDesc hie4_ops[] = {
2532 { TOK_AND, GEN_NOPUSH, g_and },
2533 { TOK_INVALID, 0, 0 }
2537 hie_internal (hie4_ops, Expr, hie5, &UsedGen);
2542 static void hie3 (ExprDesc* Expr)
2543 /* Handle ^ (bitwise exclusive or) */
2545 static const GenDesc hie3_ops[] = {
2546 { TOK_XOR, GEN_NOPUSH, g_xor },
2547 { TOK_INVALID, 0, 0 }
2551 hie_internal (hie3_ops, Expr, hie4, &UsedGen);
2556 static void hie2 (ExprDesc* Expr)
2557 /* Handle | (bitwise or) */
2559 static const GenDesc hie2_ops[] = {
2560 { TOK_OR, GEN_NOPUSH, g_or },
2561 { TOK_INVALID, 0, 0 }
2565 hie_internal (hie2_ops, Expr, hie3, &UsedGen);
2570 static void hieAndPP (ExprDesc* Expr)
2571 /* Process "exp && exp" in preprocessor mode (that is, when the parser is
2572 * called recursively from the preprocessor.
2577 ConstAbsIntExpr (hie2, Expr);
2578 while (CurTok.Tok == TOK_BOOL_AND) {
2584 ConstAbsIntExpr (hie2, &Expr2);
2586 /* Combine the two */
2587 Expr->IVal = (Expr->IVal && Expr2.IVal);
2593 static void hieOrPP (ExprDesc *Expr)
2594 /* Process "exp || exp" in preprocessor mode (that is, when the parser is
2595 * called recursively from the preprocessor.
2600 ConstAbsIntExpr (hieAndPP, Expr);
2601 while (CurTok.Tok == TOK_BOOL_OR) {
2607 ConstAbsIntExpr (hieAndPP, &Expr2);
2609 /* Combine the two */
2610 Expr->IVal = (Expr->IVal || Expr2.IVal);
2616 static void hieAnd (ExprDesc* Expr, unsigned TrueLab, int* BoolOp)
2617 /* Process "exp && exp" */
2623 if (CurTok.Tok == TOK_BOOL_AND) {
2625 /* Tell our caller that we're evaluating a boolean */
2628 /* Get a label that we will use for false expressions */
2629 FalseLab = GetLocalLabel ();
2631 /* If the expr hasn't set condition codes, set the force-test flag */
2632 if (!ED_IsTested (Expr)) {
2633 ED_MarkForTest (Expr);
2636 /* Load the value */
2637 LoadExpr (CF_FORCECHAR, Expr);
2639 /* Generate the jump */
2640 g_falsejump (CF_NONE, FalseLab);
2642 /* Parse more boolean and's */
2643 while (CurTok.Tok == TOK_BOOL_AND) {
2650 if (!ED_IsTested (&Expr2)) {
2651 ED_MarkForTest (&Expr2);
2653 LoadExpr (CF_FORCECHAR, &Expr2);
2655 /* Do short circuit evaluation */
2656 if (CurTok.Tok == TOK_BOOL_AND) {
2657 g_falsejump (CF_NONE, FalseLab);
2659 /* Last expression - will evaluate to true */
2660 g_truejump (CF_NONE, TrueLab);
2664 /* Define the false jump label here */
2665 g_defcodelabel (FalseLab);
2667 /* The result is an rvalue in primary */
2668 ED_MakeRValExpr (Expr);
2669 ED_TestDone (Expr); /* Condition codes are set */
2675 static void hieOr (ExprDesc *Expr)
2676 /* Process "exp || exp". */
2679 int BoolOp = 0; /* Did we have a boolean op? */
2680 int AndOp; /* Did we have a && operation? */
2681 unsigned TrueLab; /* Jump to this label if true */
2685 TrueLab = GetLocalLabel ();
2687 /* Call the next level parser */
2688 hieAnd (Expr, TrueLab, &BoolOp);
2690 /* Any boolean or's? */
2691 if (CurTok.Tok == TOK_BOOL_OR) {
2693 /* If the expr hasn't set condition codes, set the force-test flag */
2694 if (!ED_IsTested (Expr)) {
2695 ED_MarkForTest (Expr);
2698 /* Get first expr */
2699 LoadExpr (CF_FORCECHAR, Expr);
2701 /* For each expression jump to TrueLab if true. Beware: If we
2702 * had && operators, the jump is already in place!
2705 g_truejump (CF_NONE, TrueLab);
2708 /* Remember that we had a boolean op */
2711 /* while there's more expr */
2712 while (CurTok.Tok == TOK_BOOL_OR) {
2719 hieAnd (&Expr2, TrueLab, &AndOp);
2720 if (!ED_IsTested (&Expr2)) {
2721 ED_MarkForTest (&Expr2);
2723 LoadExpr (CF_FORCECHAR, &Expr2);
2725 /* If there is more to come, add shortcut boolean eval. */
2726 g_truejump (CF_NONE, TrueLab);
2730 /* The result is an rvalue in primary */
2731 ED_MakeRValExpr (Expr);
2732 ED_TestDone (Expr); /* Condition codes are set */
2735 /* If we really had boolean ops, generate the end sequence */
2737 DoneLab = GetLocalLabel ();
2738 g_getimmed (CF_INT | CF_CONST, 0, 0); /* Load FALSE */
2739 g_falsejump (CF_NONE, DoneLab);
2740 g_defcodelabel (TrueLab);
2741 g_getimmed (CF_INT | CF_CONST, 1, 0); /* Load TRUE */
2742 g_defcodelabel (DoneLab);
2748 static void hieQuest (ExprDesc* Expr)
2749 /* Parse the ternary operator */
2753 CodeMark TrueCodeEnd;
2754 ExprDesc Expr2; /* Expression 2 */
2755 ExprDesc Expr3; /* Expression 3 */
2756 int Expr2IsNULL; /* Expression 2 is a NULL pointer */
2757 int Expr3IsNULL; /* Expression 3 is a NULL pointer */
2758 Type* ResultType; /* Type of result */
2761 /* Call the lower level eval routine */
2762 if (Preprocessing) {
2768 /* Check if it's a ternary expression */
2769 if (CurTok.Tok == TOK_QUEST) {
2771 if (!ED_IsTested (Expr)) {
2772 /* Condition codes not set, request a test */
2773 ED_MarkForTest (Expr);
2775 LoadExpr (CF_NONE, Expr);
2776 FalseLab = GetLocalLabel ();
2777 g_falsejump (CF_NONE, FalseLab);
2779 /* Parse second expression. Remember for later if it is a NULL pointer
2780 * expression, then load it into the primary.
2782 ExprWithCheck (hie1, &Expr2);
2783 Expr2IsNULL = ED_IsNullPtr (&Expr2);
2784 if (!IsTypeVoid (Expr2.Type)) {
2785 /* Load it into the primary */
2786 LoadExpr (CF_NONE, &Expr2);
2787 ED_MakeRValExpr (&Expr2);
2788 Expr2.Type = PtrConversion (Expr2.Type);
2791 /* Remember the current code position */
2792 GetCodePos (&TrueCodeEnd);
2794 /* Jump around the evaluation of the third expression */
2795 TrueLab = GetLocalLabel ();
2799 /* Jump here if the first expression was false */
2800 g_defcodelabel (FalseLab);
2802 /* Parse third expression. Remember for later if it is a NULL pointer
2803 * expression, then load it into the primary.
2805 ExprWithCheck (hie1, &Expr3);
2806 Expr3IsNULL = ED_IsNullPtr (&Expr3);
2807 if (!IsTypeVoid (Expr3.Type)) {
2808 /* Load it into the primary */
2809 LoadExpr (CF_NONE, &Expr3);
2810 ED_MakeRValExpr (&Expr3);
2811 Expr3.Type = PtrConversion (Expr3.Type);
2814 /* Check if any conversions are needed, if so, do them.
2815 * Conversion rules for ?: expression are:
2816 * - if both expressions are int expressions, default promotion
2817 * rules for ints apply.
2818 * - if both expressions are pointers of the same type, the
2819 * result of the expression is of this type.
2820 * - if one of the expressions is a pointer and the other is
2821 * a zero constant, the resulting type is that of the pointer
2823 * - if both expressions are void expressions, the result is of
2825 * - all other cases are flagged by an error.
2827 if (IsClassInt (Expr2.Type) && IsClassInt (Expr3.Type)) {
2829 CodeMark CvtCodeStart;
2830 CodeMark CvtCodeEnd;
2833 /* Get common type */
2834 ResultType = promoteint (Expr2.Type, Expr3.Type);
2836 /* Convert the third expression to this type if needed */
2837 TypeConversion (&Expr3, ResultType);
2839 /* Emit conversion code for the second expression, but remember
2840 * where it starts end ends.
2842 GetCodePos (&CvtCodeStart);
2843 TypeConversion (&Expr2, ResultType);
2844 GetCodePos (&CvtCodeEnd);
2846 /* If we had conversion code, move it to the right place */
2847 if (!CodeRangeIsEmpty (&CvtCodeStart, &CvtCodeEnd)) {
2848 MoveCode (&CvtCodeStart, &CvtCodeEnd, &TrueCodeEnd);
2851 } else if (IsClassPtr (Expr2.Type) && IsClassPtr (Expr3.Type)) {
2852 /* Must point to same type */
2853 if (TypeCmp (Indirect (Expr2.Type), Indirect (Expr3.Type)) < TC_EQUAL) {
2854 Error ("Incompatible pointer types");
2856 /* Result has the common type */
2857 ResultType = Expr2.Type;
2858 } else if (IsClassPtr (Expr2.Type) && Expr3IsNULL) {
2859 /* Result type is pointer, no cast needed */
2860 ResultType = Expr2.Type;
2861 } else if (Expr2IsNULL && IsClassPtr (Expr3.Type)) {
2862 /* Result type is pointer, no cast needed */
2863 ResultType = Expr3.Type;
2864 } else if (IsTypeVoid (Expr2.Type) && IsTypeVoid (Expr3.Type)) {
2865 /* Result type is void */
2866 ResultType = Expr3.Type;
2868 Error ("Incompatible types");
2869 ResultType = Expr2.Type; /* Doesn't matter here */
2872 /* Define the final label */
2873 g_defcodelabel (TrueLab);
2875 /* Setup the target expression */
2876 ED_MakeRValExpr (Expr);
2877 Expr->Type = ResultType;
2883 static void opeq (const GenDesc* Gen, ExprDesc* Expr, const char* Op)
2884 /* Process "op=" operators. */
2891 /* op= can only be used with lvalues */
2892 if (!ED_IsLVal (Expr)) {
2893 Error ("Invalid lvalue in assignment");
2897 /* The left side must not be const qualified */
2898 if (IsQualConst (Expr->Type)) {
2899 Error ("Assignment to const");
2902 /* There must be an integer or pointer on the left side */
2903 if (!IsClassInt (Expr->Type) && !IsTypePtr (Expr->Type)) {
2904 Error ("Invalid left operand type");
2905 /* Continue. Wrong code will be generated, but the compiler won't
2906 * break, so this is the best error recovery.
2910 /* Skip the operator token */
2913 /* Determine the type of the lhs */
2914 flags = TypeOf (Expr->Type);
2915 MustScale = (Gen->Func == g_add || Gen->Func == g_sub) && IsTypePtr (Expr->Type);
2917 /* Get the lhs address on stack (if needed) */
2920 /* Fetch the lhs into the primary register if needed */
2921 LoadExpr (CF_NONE, Expr);
2923 /* Bring the lhs on stack */
2927 /* Evaluate the rhs */
2928 MarkedExprWithCheck (hie1, &Expr2);
2930 /* The rhs must be an integer (or a float, but we don't support that yet */
2931 if (!IsClassInt (Expr2.Type)) {
2932 Error ("Invalid right operand for binary operator `%s'", Op);
2933 /* Continue. Wrong code will be generated, but the compiler won't
2934 * break, so this is the best error recovery.
2938 /* Check for a constant expression */
2939 if (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2)) {
2940 /* The resulting value is a constant. If the generator has the NOPUSH
2941 * flag set, don't push the lhs.
2943 if (Gen->Flags & GEN_NOPUSH) {
2947 /* lhs is a pointer, scale rhs */
2948 Expr2.IVal *= CheckedSizeOf (Expr->Type+1);
2951 /* If the lhs is character sized, the operation may be later done
2954 if (CheckedSizeOf (Expr->Type) == SIZEOF_CHAR) {
2955 flags |= CF_FORCECHAR;
2958 /* Special handling for add and sub - some sort of a hack, but short code */
2959 if (Gen->Func == g_add) {
2960 g_inc (flags | CF_CONST, Expr2.IVal);
2961 } else if (Gen->Func == g_sub) {
2962 g_dec (flags | CF_CONST, Expr2.IVal);
2964 if (Expr2.IVal == 0) {
2965 /* Check for div by zero/mod by zero */
2966 if (Gen->Func == g_div) {
2967 Error ("Division by zero");
2968 } else if (Gen->Func == g_mod) {
2969 Error ("Modulo operation with zero");
2972 Gen->Func (flags | CF_CONST, Expr2.IVal);
2976 /* rhs is not constant. Load into the primary */
2977 LoadExpr (CF_NONE, &Expr2);
2979 /* lhs is a pointer, scale rhs */
2980 g_scale (TypeOf (Expr2.Type), CheckedSizeOf (Expr->Type+1));
2983 /* If the lhs is character sized, the operation may be later done
2986 if (CheckedSizeOf (Expr->Type) == SIZEOF_CHAR) {
2987 flags |= CF_FORCECHAR;
2990 /* Adjust the types of the operands if needed */
2991 Gen->Func (g_typeadjust (flags, TypeOf (Expr2.Type)), 0);
2994 ED_MakeRValExpr (Expr);
2999 static void addsubeq (const GenDesc* Gen, ExprDesc *Expr, const char* Op)
3000 /* Process the += and -= operators */
3008 /* We're currently only able to handle some adressing modes */
3009 if (ED_GetLoc (Expr) == E_LOC_EXPR || ED_GetLoc (Expr) == E_LOC_PRIMARY) {
3010 /* Use generic routine */
3011 opeq (Gen, Expr, Op);
3015 /* We must have an lvalue */
3016 if (ED_IsRVal (Expr)) {
3017 Error ("Invalid lvalue in assignment");
3021 /* The left side must not be const qualified */
3022 if (IsQualConst (Expr->Type)) {
3023 Error ("Assignment to const");
3026 /* There must be an integer or pointer on the left side */
3027 if (!IsClassInt (Expr->Type) && !IsTypePtr (Expr->Type)) {
3028 Error ("Invalid left operand type");
3029 /* Continue. Wrong code will be generated, but the compiler won't
3030 * break, so this is the best error recovery.
3034 /* Skip the operator */
3037 /* Check if we have a pointer expression and must scale rhs */
3038 MustScale = IsTypePtr (Expr->Type);
3040 /* Initialize the code generator flags */
3044 /* Evaluate the rhs. We expect an integer here, since float is not
3048 if (!IsClassInt (Expr2.Type)) {
3049 Error ("Invalid right operand for binary operator `%s'", Op);
3050 /* Continue. Wrong code will be generated, but the compiler won't
3051 * break, so this is the best error recovery.
3054 if (ED_IsConstAbs (&Expr2)) {
3055 /* The resulting value is a constant. Scale it. */
3057 Expr2.IVal *= CheckedSizeOf (Indirect (Expr->Type));
3062 /* Not constant, load into the primary */
3063 LoadExpr (CF_NONE, &Expr2);
3065 /* lhs is a pointer, scale rhs */
3066 g_scale (TypeOf (Expr2.Type), CheckedSizeOf (Indirect (Expr->Type)));
3070 /* Setup the code generator flags */
3071 lflags |= TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR;
3072 rflags |= TypeOf (Expr2.Type) | CF_FORCECHAR;
3074 /* Convert the type of the lhs to that of the rhs */
3075 g_typecast (lflags, rflags);
3077 /* Output apropriate code depending on the location */
3078 switch (ED_GetLoc (Expr)) {
3081 /* Absolute: numeric address or const */
3082 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3083 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3085 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3090 /* Global variable */
3091 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3092 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3094 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3100 /* Static variable or literal in the literal pool */
3101 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3102 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3104 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3108 case E_LOC_REGISTER:
3109 /* Register variable */
3110 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3111 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3113 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3118 /* Value on the stack */
3119 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3120 g_addeqlocal (lflags, Expr->IVal, Expr2.IVal);
3122 g_subeqlocal (lflags, Expr->IVal, Expr2.IVal);
3127 Internal ("Invalid location in Store(): 0x%04X", ED_GetLoc (Expr));
3130 /* Expression is a rvalue in the primary now */
3131 ED_MakeRValExpr (Expr);
3136 void hie1 (ExprDesc* Expr)
3137 /* Parse first level of expression hierarchy. */
3140 switch (CurTok.Tok) {
3146 case TOK_PLUS_ASSIGN:
3147 addsubeq (&GenPASGN, Expr, "+=");
3150 case TOK_MINUS_ASSIGN:
3151 addsubeq (&GenSASGN, Expr, "-=");
3154 case TOK_MUL_ASSIGN:
3155 opeq (&GenMASGN, Expr, "*=");
3158 case TOK_DIV_ASSIGN:
3159 opeq (&GenDASGN, Expr, "/=");
3162 case TOK_MOD_ASSIGN:
3163 opeq (&GenMOASGN, Expr, "%=");
3166 case TOK_SHL_ASSIGN:
3167 opeq (&GenSLASGN, Expr, "<<=");
3170 case TOK_SHR_ASSIGN:
3171 opeq (&GenSRASGN, Expr, ">>=");
3174 case TOK_AND_ASSIGN:
3175 opeq (&GenAASGN, Expr, "&=");
3178 case TOK_XOR_ASSIGN:
3179 opeq (&GenXOASGN, Expr, "^=");
3183 opeq (&GenOASGN, Expr, "|=");
3193 void hie0 (ExprDesc *Expr)
3194 /* Parse comma operator. */
3197 while (CurTok.Tok == TOK_COMMA) {
3205 int evalexpr (unsigned Flags, void (*Func) (ExprDesc*), ExprDesc* Expr)
3206 /* Will evaluate an expression via the given function. If the result is a
3207 * constant, 0 is returned and the value is put in the Expr struct. If the
3208 * result is not constant, LoadExpr is called to bring the value into the
3209 * primary register and 1 is returned.
3213 ExprWithCheck (Func, Expr);
3215 /* Check for a constant expression */
3216 if (ED_IsConstAbs (Expr)) {
3217 /* Constant expression */
3220 /* Not constant, load into the primary */
3221 LoadExpr (Flags, Expr);
3228 void Expression0 (ExprDesc* Expr)
3229 /* Evaluate an expression via hie0 and put the result into the primary register */
3231 ExprWithCheck (hie0, Expr);
3232 LoadExpr (CF_NONE, Expr);
3237 void ConstExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3238 /* Will evaluate an expression via the given function. If the result is not
3239 * a constant of some sort, a diagnostic will be printed, and the value is
3240 * replaced by a constant one to make sure there are no internal errors that
3241 * result from this input error.
3244 ExprWithCheck (Func, Expr);
3245 if (!ED_IsConst (Expr)) {
3246 Error ("Constant expression expected");
3247 /* To avoid any compiler errors, make the expression a valid const */
3248 ED_MakeConstAbsInt (Expr, 1);
3254 void BoolExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3255 /* Will evaluate an expression via the given function. If the result is not
3256 * something that may be evaluated in a boolean context, a diagnostic will be
3257 * printed, and the value is replaced by a constant one to make sure there
3258 * are no internal errors that result from this input error.
3261 ExprWithCheck (Func, Expr);
3262 if (!ED_IsBool (Expr)) {
3263 Error ("Boolean expression expected");
3264 /* To avoid any compiler errors, make the expression a valid int */
3265 ED_MakeConstAbsInt (Expr, 1);
3271 void ConstAbsIntExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3272 /* Will evaluate an expression via the given function. If the result is not
3273 * a constant numeric integer value, a diagnostic will be printed, and the
3274 * value is replaced by a constant one to make sure there are no internal
3275 * errors that result from this input error.
3278 ExprWithCheck (Func, Expr);
3279 if (!ED_IsConstAbsInt (Expr)) {
3280 Error ("Constant integer expression expected");
3281 /* To avoid any compiler errors, make the expression a valid const */
3282 ED_MakeConstAbsInt (Expr, 1);