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 */
51 #define GEN_COMM 0x02 /* Operator is commutative */
53 /* Map a generator function and its attributes to a token */
55 token_t Tok; /* Token to map to */
56 unsigned Flags; /* Flags for generator function */
57 void (*Func) (unsigned, unsigned long); /* Generator func */
60 /* Descriptors for the operations */
61 static GenDesc GenPASGN = { TOK_PLUS_ASSIGN, GEN_NOPUSH, g_add };
62 static GenDesc GenSASGN = { TOK_MINUS_ASSIGN, GEN_NOPUSH, g_sub };
63 static GenDesc GenMASGN = { TOK_MUL_ASSIGN, GEN_NOPUSH, g_mul };
64 static GenDesc GenDASGN = { TOK_DIV_ASSIGN, GEN_NOPUSH, g_div };
65 static GenDesc GenMOASGN = { TOK_MOD_ASSIGN, GEN_NOPUSH, g_mod };
66 static GenDesc GenSLASGN = { TOK_SHL_ASSIGN, GEN_NOPUSH, g_asl };
67 static GenDesc GenSRASGN = { TOK_SHR_ASSIGN, GEN_NOPUSH, g_asr };
68 static GenDesc GenAASGN = { TOK_AND_ASSIGN, GEN_NOPUSH, g_and };
69 static GenDesc GenXOASGN = { TOK_XOR_ASSIGN, GEN_NOPUSH, g_xor };
70 static GenDesc GenOASGN = { TOK_OR_ASSIGN, GEN_NOPUSH, g_or };
74 /*****************************************************************************/
75 /* Helper functions */
76 /*****************************************************************************/
80 static unsigned GlobalModeFlags (const ExprDesc* Expr)
81 /* Return the addressing mode flags for the given expression */
83 switch (ED_GetLoc (Expr)) {
84 case E_LOC_ABS: return CF_ABSOLUTE;
85 case E_LOC_GLOBAL: return CF_EXTERNAL;
86 case E_LOC_STATIC: return CF_STATIC;
87 case E_LOC_REGISTER: return CF_REGVAR;
88 case E_LOC_STACK: return CF_NONE;
89 case E_LOC_PRIMARY: return CF_NONE;
90 case E_LOC_EXPR: return CF_NONE;
91 case E_LOC_LITERAL: return CF_STATIC; /* Same as static */
93 Internal ("GlobalModeFlags: Invalid location flags value: 0x%04X", Expr->Flags);
101 void ExprWithCheck (void (*Func) (ExprDesc*), ExprDesc* Expr)
102 /* Call an expression function with checks. */
104 /* Remember the stack pointer */
105 int OldSP = StackPtr;
107 /* Call the expression function */
110 /* Do some checks if code generation is still constistent */
111 if (StackPtr != OldSP) {
113 Error ("Code generation messed up: "
114 "StackPtr is %d, should be %d",
117 Internal ("Code generation messed up: "
118 "StackPtr is %d, should be %d",
126 void MarkedExprWithCheck (void (*Func) (ExprDesc*), ExprDesc* Expr)
127 /* Call an expression function with checks and record start and end of the
133 ExprWithCheck (Func, Expr);
135 ED_SetCodeRange (Expr, &Start, &End);
140 static Type* promoteint (Type* lhst, Type* rhst)
141 /* In an expression with two ints, return the type of the result */
143 /* Rules for integer types:
144 * - If one of the values is a long, the result is long.
145 * - If one of the values is unsigned, the result is also unsigned.
146 * - Otherwise the result is an int.
148 if (IsTypeLong (lhst) || IsTypeLong (rhst)) {
149 if (IsSignUnsigned (lhst) || IsSignUnsigned (rhst)) {
155 if (IsSignUnsigned (lhst) || IsSignUnsigned (rhst)) {
165 static unsigned typeadjust (ExprDesc* lhs, ExprDesc* rhs, int NoPush)
166 /* Adjust the two values for a binary operation. lhs is expected on stack or
167 * to be constant, rhs is expected to be in the primary register or constant.
168 * The function will put the type of the result into lhs and return the
169 * code generator flags for the operation.
170 * If NoPush is given, it is assumed that the operation does not expect the lhs
171 * to be on stack, and that lhs is in a register instead.
172 * Beware: The function does only accept int types.
175 unsigned ltype, rtype;
178 /* Get the type strings */
179 Type* lhst = lhs->Type;
180 Type* rhst = rhs->Type;
182 /* Generate type adjustment code if needed */
183 ltype = TypeOf (lhst);
184 if (ED_IsLocAbs (lhs)) {
188 /* Value is in primary register*/
191 rtype = TypeOf (rhst);
192 if (ED_IsLocAbs (rhs)) {
195 flags = g_typeadjust (ltype, rtype);
197 /* Set the type of the result */
198 lhs->Type = promoteint (lhst, rhst);
200 /* Return the code generator flags */
206 static const GenDesc* FindGen (token_t Tok, const GenDesc* Table)
207 /* Find a token in a generator table */
209 while (Table->Tok != TOK_INVALID) {
210 if (Table->Tok == Tok) {
220 static int TypeSpecAhead (void)
221 /* Return true if some sort of type is waiting (helper for cast and sizeof()
227 /* There's a type waiting if:
229 * We have an opening paren, and
230 * a. the next token is a type, or
231 * b. the next token is a type qualifier, or
232 * c. the next token is a typedef'd type
234 return CurTok.Tok == TOK_LPAREN && (
235 TokIsType (&NextTok) ||
236 TokIsTypeQual (&NextTok) ||
237 (NextTok.Tok == TOK_IDENT &&
238 (Entry = FindSym (NextTok.Ident)) != 0 &&
239 SymIsTypeDef (Entry)));
244 void PushAddr (const ExprDesc* Expr)
245 /* If the expression contains an address that was somehow evaluated,
246 * push this address on the stack. This is a helper function for all
247 * sorts of implicit or explicit assignment functions where the lvalue
248 * must be saved if it's not constant, before evaluating the rhs.
251 /* Get the address on stack if needed */
252 if (ED_IsLocExpr (Expr)) {
253 /* Push the address (always a pointer) */
260 static void WarnConstCompareResult (void)
261 /* If the result of a comparison is constant, this is suspicious when not in
265 if (!Preprocessing && IS_Get (&WarnConstComparison) != 0) {
266 Warning ("Result of comparison is constant");
272 /*****************************************************************************/
274 /*****************************************************************************/
278 static unsigned FunctionParamList (FuncDesc* Func, int IsFastcall)
279 /* Parse a function parameter list and pass the parameters to the called
280 * function. Depending on several criteria this may be done by just pushing
281 * each parameter separately, or creating the parameter frame once and then
282 * storing into this frame.
283 * The function returns the size of the parameters pushed.
288 /* Initialize variables */
289 SymEntry* Param = 0; /* Keep gcc silent */
290 unsigned ParamSize = 0; /* Size of parameters pushed */
291 unsigned ParamCount = 0; /* Number of parameters pushed */
292 unsigned FrameSize = 0; /* Size of parameter frame */
293 unsigned FrameParams = 0; /* Number of params in frame */
294 int FrameOffs = 0; /* Offset into parameter frame */
295 int Ellipsis = 0; /* Function is variadic */
297 /* As an optimization, we may allocate the complete parameter frame at
298 * once instead of pushing each parameter as it comes. We may do that,
301 * - optimizations that increase code size are enabled (allocating the
302 * stack frame at once gives usually larger code).
303 * - we have more than one parameter to push (don't count the last param
304 * for __fastcall__ functions).
306 * The FrameSize variable will contain a value > 0 if storing into a frame
307 * (instead of pushing) is enabled.
310 if (IS_Get (&CodeSizeFactor) >= 200) {
312 /* Calculate the number and size of the parameters */
313 FrameParams = Func->ParamCount;
314 FrameSize = Func->ParamSize;
315 if (FrameParams > 0 && IsFastcall) {
316 /* Last parameter is not pushed */
317 FrameSize -= CheckedSizeOf (Func->LastParam->Type);
321 /* Do we have more than one parameter in the frame? */
322 if (FrameParams > 1) {
323 /* Okeydokey, setup the frame */
324 FrameOffs = StackPtr;
326 StackPtr -= FrameSize;
328 /* Don't use a preallocated frame */
333 /* Parse the actual parameter list */
334 while (CurTok.Tok != TOK_RPAREN) {
338 /* Count arguments */
341 /* Fetch the pointer to the next argument, check for too many args */
342 if (ParamCount <= Func->ParamCount) {
343 /* Beware: If there are parameters with identical names, they
344 * cannot go into the same symbol table, which means that in this
345 * case of errorneous input, the number of nodes in the symbol
346 * table and ParamCount are NOT equal. We have to handle this case
347 * below to avoid segmentation violations. Since we know that this
348 * problem can only occur if there is more than one parameter,
349 * we will just use the last one.
351 if (ParamCount == 1) {
353 Param = Func->SymTab->SymHead;
354 } else if (Param->NextSym != 0) {
356 Param = Param->NextSym;
357 CHECK ((Param->Flags & SC_PARAM) != 0);
359 } else if (!Ellipsis) {
360 /* Too many arguments. Do we have an open param list? */
361 if ((Func->Flags & FD_VARIADIC) == 0) {
362 /* End of param list reached, no ellipsis */
363 Error ("Too many arguments in function call");
365 /* Assume an ellipsis even in case of errors to avoid an error
366 * message for each other argument.
371 /* Evaluate the parameter expression */
374 /* If we don't have an argument spec, accept anything, otherwise
375 * convert the actual argument to the type needed.
380 /* Convert the argument to the parameter type if needed */
381 TypeConversion (&Expr, Param->Type);
383 /* If we have a prototype, chars may be pushed as chars */
384 Flags |= CF_FORCECHAR;
388 /* No prototype available. Convert array to "pointer to first
389 * element", and function to "pointer to function".
391 Expr.Type = PtrConversion (Expr.Type);
395 /* Load the value into the primary if it is not already there */
396 LoadExpr (Flags, &Expr);
398 /* Use the type of the argument for the push */
399 Flags |= TypeOf (Expr.Type);
401 /* If this is a fastcall function, don't push the last argument */
402 if (ParamCount != Func->ParamCount || !IsFastcall) {
403 unsigned ArgSize = sizeofarg (Flags);
405 /* We have the space already allocated, store in the frame.
406 * Because of invalid type conversions (that have produced an
407 * error before), we can end up here with a non aligned stack
408 * frame. Since no output will be generated anyway, handle
409 * these cases gracefully instead of doing a CHECK.
411 if (FrameSize >= ArgSize) {
412 FrameSize -= ArgSize;
416 FrameOffs -= ArgSize;
418 g_putlocal (Flags | CF_NOKEEP, FrameOffs, Expr.IVal);
420 /* Push the argument */
421 g_push (Flags, Expr.IVal);
424 /* Calculate total parameter size */
425 ParamSize += ArgSize;
428 /* Check for end of argument list */
429 if (CurTok.Tok != TOK_COMMA) {
435 /* Check if we had enough parameters */
436 if (ParamCount < Func->ParamCount) {
437 Error ("Too few arguments in function call");
440 /* The function returns the size of all parameters pushed onto the stack.
441 * However, if there are parameters missing (which is an error and was
442 * flagged by the compiler) AND a stack frame was preallocated above,
443 * we would loose track of the stackpointer and generate an internal error
444 * later. So we correct the value by the parameters that should have been
445 * pushed to avoid an internal compiler error. Since an error was
446 * generated before, no code will be output anyway.
448 return ParamSize + FrameSize;
453 static void FunctionCall (ExprDesc* Expr)
454 /* Perform a function call. */
456 FuncDesc* Func; /* Function descriptor */
457 int IsFuncPtr; /* Flag */
458 unsigned ParamSize; /* Number of parameter bytes */
460 int PtrOffs = 0; /* Offset of function pointer on stack */
461 int IsFastcall = 0; /* True if it's a fast call function */
462 int PtrOnStack = 0; /* True if a pointer copy is on stack */
464 /* Skip the left paren */
467 /* Get a pointer to the function descriptor from the type string */
468 Func = GetFuncDesc (Expr->Type);
470 /* Handle function pointers transparently */
471 IsFuncPtr = IsTypeFuncPtr (Expr->Type);
474 /* Check wether it's a fastcall function that has parameters */
475 IsFastcall = IsQualFastcall (Expr->Type + 1) && (Func->ParamCount > 0);
477 /* Things may be difficult, depending on where the function pointer
478 * resides. If the function pointer is an expression of some sort
479 * (not a local or global variable), we have to evaluate this
480 * expression now and save the result for later. Since calls to
481 * function pointers may be nested, we must save it onto the stack.
482 * For fastcall functions we do also need to place a copy of the
483 * pointer on stack, since we cannot use a/x.
485 PtrOnStack = IsFastcall || !ED_IsConst (Expr);
488 /* Not a global or local variable, or a fastcall function. Load
489 * the pointer into the primary and mark it as an expression.
491 LoadExpr (CF_NONE, Expr);
492 ED_MakeRValExpr (Expr);
494 /* Remember the code position */
497 /* Push the pointer onto the stack and remember the offset */
503 /* Check function attributes */
504 if (Expr->Sym && SymHasAttr (Expr->Sym, atNoReturn)) {
505 /* For now, handle as if a return statement was encountered */
506 F_ReturnFound (CurrentFunc);
509 /* Check for known standard functions and inline them */
510 if (Expr->Name != 0) {
511 int StdFunc = FindStdFunc ((const char*) Expr->Name);
513 /* Inline this function */
514 HandleStdFunc (StdFunc, Func, Expr);
519 /* If we didn't inline the function, get fastcall info */
520 IsFastcall = IsQualFastcall (Expr->Type);
523 /* Parse the parameter list */
524 ParamSize = FunctionParamList (Func, IsFastcall);
526 /* We need the closing paren here */
529 /* Special handling for function pointers */
532 /* If the function is not a fastcall function, load the pointer to
533 * the function into the primary.
537 /* Not a fastcall function - we may use the primary */
539 /* If we have no parameters, the pointer is still in the
540 * primary. Remove the code to push it and correct the
543 if (ParamSize == 0) {
547 /* Load from the saved copy */
548 g_getlocal (CF_PTR, PtrOffs);
551 /* Load from original location */
552 LoadExpr (CF_NONE, Expr);
555 /* Call the function */
556 g_callind (TypeOf (Expr->Type+1), ParamSize, PtrOffs);
560 /* Fastcall function. We cannot use the primary for the function
561 * pointer and must therefore use an offset to the stack location.
562 * Since fastcall functions may never be variadic, we can use the
563 * index register for this purpose.
565 g_callind (CF_LOCAL, ParamSize, PtrOffs);
568 /* If we have a pointer on stack, remove it */
579 /* Normal function */
580 g_call (TypeOf (Expr->Type), (const char*) Expr->Name, ParamSize);
584 /* The function result is an rvalue in the primary register */
585 ED_MakeRValExpr (Expr);
586 Expr->Type = GetFuncReturn (Expr->Type);
591 static void Primary (ExprDesc* E)
592 /* This is the lowest level of the expression parser. */
596 /* Initialize fields in the expression stucture */
599 /* Character and integer constants. */
600 if (CurTok.Tok == TOK_ICONST || CurTok.Tok == TOK_CCONST) {
601 E->IVal = CurTok.IVal;
602 E->Flags = E_LOC_ABS | E_RTYPE_RVAL;
603 E->Type = CurTok.Type;
608 /* Floating point constant */
609 if (CurTok.Tok == TOK_FCONST) {
610 E->FVal = CurTok.FVal;
611 E->Flags = E_LOC_ABS | E_RTYPE_RVAL;
612 E->Type = CurTok.Type;
617 /* Process parenthesized subexpression by calling the whole parser
620 if (CurTok.Tok == TOK_LPAREN) {
627 /* If we run into an identifier in preprocessing mode, we assume that this
628 * is an undefined macro and replace it by a constant value of zero.
630 if (Preprocessing && CurTok.Tok == TOK_IDENT) {
632 ED_MakeConstAbsInt (E, 0);
636 /* All others may only be used if the expression evaluation is not called
637 * recursively by the preprocessor.
640 /* Illegal expression in PP mode */
641 Error ("Preprocessor expression expected");
642 ED_MakeConstAbsInt (E, 1);
646 switch (CurTok.Tok) {
649 /* Identifier. Get a pointer to the symbol table entry */
650 Sym = E->Sym = FindSym (CurTok.Ident);
652 /* Is the symbol known? */
655 /* We found the symbol - skip the name token */
658 /* Check for illegal symbol types */
659 CHECK ((Sym->Flags & SC_LABEL) != SC_LABEL);
660 if (Sym->Flags & SC_TYPE) {
661 /* Cannot use type symbols */
662 Error ("Variable identifier expected");
663 /* Assume an int type to make E valid */
664 E->Flags = E_LOC_STACK | E_RTYPE_LVAL;
669 /* Mark the symbol as referenced */
670 Sym->Flags |= SC_REF;
672 /* The expression type is the symbol type */
675 /* Check for legal symbol types */
676 if ((Sym->Flags & SC_CONST) == SC_CONST) {
677 /* Enum or some other numeric constant */
678 E->Flags = E_LOC_ABS | E_RTYPE_RVAL;
679 E->IVal = Sym->V.ConstVal;
680 } else if ((Sym->Flags & SC_FUNC) == SC_FUNC) {
682 E->Flags = E_LOC_GLOBAL | E_RTYPE_LVAL;
683 E->Name = (unsigned long) Sym->Name;
684 } else if ((Sym->Flags & SC_AUTO) == SC_AUTO) {
685 /* Local variable. If this is a parameter for a variadic
686 * function, we have to add some address calculations, and the
687 * address is not const.
689 if ((Sym->Flags & SC_PARAM) == SC_PARAM && F_IsVariadic (CurrentFunc)) {
690 /* Variadic parameter */
691 g_leavariadic (Sym->V.Offs - F_GetParamSize (CurrentFunc));
692 E->Flags = E_LOC_EXPR | E_RTYPE_LVAL;
694 /* Normal parameter */
695 E->Flags = E_LOC_STACK | E_RTYPE_LVAL;
696 E->IVal = Sym->V.Offs;
698 } else if ((Sym->Flags & SC_REGISTER) == SC_REGISTER) {
699 /* Register variable, zero page based */
700 E->Flags = E_LOC_REGISTER | E_RTYPE_LVAL;
701 E->Name = Sym->V.R.RegOffs;
702 } else if ((Sym->Flags & SC_STATIC) == SC_STATIC) {
703 /* Static variable */
704 if (Sym->Flags & (SC_EXTERN | SC_STORAGE)) {
705 E->Flags = E_LOC_GLOBAL | E_RTYPE_LVAL;
706 E->Name = (unsigned long) Sym->Name;
708 E->Flags = E_LOC_STATIC | E_RTYPE_LVAL;
709 E->Name = Sym->V.Label;
712 /* Local static variable */
713 E->Flags = E_LOC_STATIC | E_RTYPE_LVAL;
714 E->Name = Sym->V.Offs;
717 /* We've made all variables lvalues above. However, this is
718 * not always correct: An array is actually the address of its
719 * first element, which is a rvalue, and a function is a
720 * rvalue, too, because we cannot store anything in a function.
721 * So fix the flags depending on the type.
723 if (IsTypeArray (E->Type) || IsTypeFunc (E->Type)) {
729 /* We did not find the symbol. Remember the name, then skip it */
731 strcpy (Ident, CurTok.Ident);
734 /* IDENT is either an auto-declared function or an undefined variable. */
735 if (CurTok.Tok == TOK_LPAREN) {
736 /* C99 doesn't allow calls to undefined functions, so
737 * generate an error and otherwise a warning. Declare a
738 * function returning int. For that purpose, prepare a
739 * function signature for a function having an empty param
740 * list and returning int.
742 if (IS_Get (&Standard) >= STD_C99) {
743 Error ("Call to undefined function `%s'", Ident);
745 Warning ("Call to undefined function `%s'", Ident);
747 Sym = AddGlobalSym (Ident, GetImplicitFuncType(), SC_EXTERN | SC_REF | SC_FUNC);
749 E->Flags = E_LOC_GLOBAL | E_RTYPE_RVAL;
750 E->Name = (unsigned long) Sym->Name;
752 /* Undeclared Variable */
753 Sym = AddLocalSym (Ident, type_int, SC_AUTO | SC_REF, 0);
754 E->Flags = E_LOC_STACK | E_RTYPE_LVAL;
756 Error ("Undefined symbol: `%s'", Ident);
765 E->LVal = UseLiteral (CurTok.SVal);
766 E->Type = GetCharArrayType (GetLiteralSize (CurTok.SVal));
767 E->Flags = E_LOC_LITERAL | E_RTYPE_RVAL;
769 E->Name = GetLiteralLabel (CurTok.SVal);
776 E->Flags = E_LOC_EXPR | E_RTYPE_RVAL;
781 /* Register pseudo variable */
782 E->Type = type_uchar;
783 E->Flags = E_LOC_PRIMARY | E_RTYPE_LVAL;
788 /* Register pseudo variable */
790 E->Flags = E_LOC_PRIMARY | E_RTYPE_LVAL;
795 /* Register pseudo variable */
796 E->Type = type_ulong;
797 E->Flags = E_LOC_PRIMARY | E_RTYPE_LVAL;
802 /* Illegal primary. Be sure to skip the token to avoid endless
805 Error ("Expression expected");
807 ED_MakeConstAbsInt (E, 1);
814 static void ArrayRef (ExprDesc* Expr)
815 /* Handle an array reference. This function needs a rewrite. */
826 /* Skip the bracket */
829 /* Get the type of left side */
832 /* We can apply a special treatment for arrays that have a const base
833 * address. This is true for most arrays and will produce a lot better
834 * code. Check if this is a const base address.
836 ConstBaseAddr = ED_IsRVal (Expr) &&
837 (ED_IsLocConst (Expr) || ED_IsLocStack (Expr));
839 /* If we have a constant base, we delay the address fetch */
841 if (!ConstBaseAddr) {
842 /* Get a pointer to the array into the primary */
843 LoadExpr (CF_NONE, Expr);
845 /* Get the array pointer on stack. Do not push more than 16
846 * bit, even if this value is greater, since we cannot handle
847 * other than 16bit stuff when doing indexing.
853 /* TOS now contains ptr to array elements. Get the subscript. */
854 MarkedExprWithCheck (hie0, &Subscript);
856 /* Check the types of array and subscript. We can either have a
857 * pointer/array to the left, in which case the subscript must be of an
858 * integer type, or we have an integer to the left, in which case the
859 * subscript must be a pointer/array.
860 * Since we do the necessary checking here, we can rely later on the
863 Qualifiers = T_QUAL_NONE;
864 if (IsClassPtr (Expr->Type)) {
865 if (!IsClassInt (Subscript.Type)) {
866 Error ("Array subscript is not an integer");
867 /* To avoid any compiler errors, make the expression a valid int */
868 ED_MakeConstAbsInt (&Subscript, 0);
870 if (IsTypeArray (Expr->Type)) {
871 Qualifiers = GetQualifier (Expr->Type);
873 ElementType = Indirect (Expr->Type);
874 } else if (IsClassInt (Expr->Type)) {
875 if (!IsClassPtr (Subscript.Type)) {
876 Error ("Subscripted value is neither array nor pointer");
877 /* To avoid compiler errors, make the subscript a char[] at
880 ED_MakeConstAbs (&Subscript, 0, GetCharArrayType (1));
881 } else if (IsTypeArray (Subscript.Type)) {
882 Qualifiers = GetQualifier (Subscript.Type);
884 ElementType = Indirect (Subscript.Type);
886 Error ("Cannot subscript");
887 /* To avoid compiler errors, fake both the array and the subscript, so
888 * we can just proceed.
890 ED_MakeConstAbs (Expr, 0, GetCharArrayType (1));
891 ED_MakeConstAbsInt (&Subscript, 0);
892 ElementType = Indirect (Expr->Type);
895 /* The element type has the combined qualifiers from itself and the array,
896 * it is a member of (if any).
898 if (GetQualifier (ElementType) != (GetQualifier (ElementType) | Qualifiers)) {
899 ElementType = TypeDup (ElementType);
900 ElementType->C |= Qualifiers;
903 /* If the subscript is a bit-field, load it and make it an rvalue */
904 if (ED_IsBitField (&Subscript)) {
905 LoadExpr (CF_NONE, &Subscript);
906 ED_MakeRValExpr (&Subscript);
909 /* Check if the subscript is constant absolute value */
910 if (ED_IsConstAbs (&Subscript) && ED_CodeRangeIsEmpty (&Subscript)) {
912 /* The array subscript is a numeric constant. If we had pushed the
913 * array base address onto the stack before, we can remove this value,
914 * since we can generate expression+offset.
916 if (!ConstBaseAddr) {
919 /* Get an array pointer into the primary */
920 LoadExpr (CF_NONE, Expr);
923 if (IsClassPtr (Expr->Type)) {
925 /* Lhs is pointer/array. Scale the subscript value according to
928 Subscript.IVal *= CheckedSizeOf (ElementType);
930 /* Remove the address load code */
933 /* In case of an array, we can adjust the offset of the expression
934 * already in Expr. If the base address was a constant, we can even
935 * remove the code that loaded the address into the primary.
937 if (IsTypeArray (Expr->Type)) {
939 /* Adjust the offset */
940 Expr->IVal += Subscript.IVal;
944 /* It's a pointer, so we do have to load it into the primary
945 * first (if it's not already there).
947 if (ConstBaseAddr || ED_IsLVal (Expr)) {
948 LoadExpr (CF_NONE, Expr);
949 ED_MakeRValExpr (Expr);
953 Expr->IVal = Subscript.IVal;
958 /* Scale the rhs value according to the element type */
959 g_scale (TypeOf (tptr1), CheckedSizeOf (ElementType));
961 /* Add the subscript. Since arrays are indexed by integers,
962 * we will ignore the true type of the subscript here and
963 * use always an int. #### Use offset but beware of LoadExpr!
965 g_inc (CF_INT | CF_CONST, Subscript.IVal);
971 /* Array subscript is not constant. Load it into the primary */
973 LoadExpr (CF_NONE, &Subscript);
976 if (IsClassPtr (Expr->Type)) {
978 /* Indexing is based on unsigneds, so we will just use the integer
979 * portion of the index (which is in (e)ax, so there's no further
982 g_scale (CF_INT, CheckedSizeOf (ElementType));
986 /* Get the int value on top. If we come here, we're sure, both
987 * values are 16 bit (the first one was truncated if necessary
988 * and the second one is a pointer). Note: If ConstBaseAddr is
989 * true, we don't have a value on stack, so to "swap" both, just
990 * push the subscript.
994 LoadExpr (CF_NONE, Expr);
1001 g_scale (TypeOf (tptr1), CheckedSizeOf (ElementType));
1005 /* The offset is now in the primary register. It we didn't have a
1006 * constant base address for the lhs, the lhs address is already
1007 * on stack, and we must add the offset. If the base address was
1008 * constant, we call special functions to add the address to the
1011 if (!ConstBaseAddr) {
1013 /* The array base address is on stack and the subscript is in the
1014 * primary. Add both.
1020 /* The subscript is in the primary, and the array base address is
1021 * in Expr. If the subscript has itself a constant address, it is
1022 * often a better idea to reverse again the order of the
1023 * evaluation. This will generate better code if the subscript is
1024 * a byte sized variable. But beware: This is only possible if the
1025 * subscript was not scaled, that is, if this was a byte array
1028 if ((ED_IsLocConst (&Subscript) || ED_IsLocStack (&Subscript)) &&
1029 CheckedSizeOf (ElementType) == SIZEOF_CHAR) {
1033 /* Reverse the order of evaluation */
1034 if (CheckedSizeOf (Subscript.Type) == SIZEOF_CHAR) {
1039 RemoveCode (&Mark2);
1041 /* Get a pointer to the array into the primary. */
1042 LoadExpr (CF_NONE, Expr);
1044 /* Add the variable */
1045 if (ED_IsLocStack (&Subscript)) {
1046 g_addlocal (Flags, Subscript.IVal);
1048 Flags |= GlobalModeFlags (&Subscript);
1049 g_addstatic (Flags, Subscript.Name, Subscript.IVal);
1053 if (ED_IsLocAbs (Expr)) {
1054 /* Constant numeric address. Just add it */
1055 g_inc (CF_INT, Expr->IVal);
1056 } else if (ED_IsLocStack (Expr)) {
1057 /* Base address is a local variable address */
1058 if (IsTypeArray (Expr->Type)) {
1059 g_addaddr_local (CF_INT, Expr->IVal);
1061 g_addlocal (CF_PTR, Expr->IVal);
1064 /* Base address is a static variable address */
1065 unsigned Flags = CF_INT | GlobalModeFlags (Expr);
1066 if (ED_IsRVal (Expr)) {
1067 /* Add the address of the location */
1068 g_addaddr_static (Flags, Expr->Name, Expr->IVal);
1070 /* Add the contents of the location */
1071 g_addstatic (Flags, Expr->Name, Expr->IVal);
1079 /* The result is an expression in the primary */
1080 ED_MakeRValExpr (Expr);
1084 /* Result is of element type */
1085 Expr->Type = ElementType;
1087 /* An array element is actually a variable. So the rules for variables
1088 * with respect to the reference type apply: If it's an array, it is
1089 * a rvalue, otherwise it's an lvalue. (A function would also be a rvalue,
1090 * but an array cannot contain functions).
1092 if (IsTypeArray (Expr->Type)) {
1098 /* Consume the closing bracket */
1104 static void StructRef (ExprDesc* Expr)
1105 /* Process struct field after . or ->. */
1112 /* Skip the token and check for an identifier */
1114 if (CurTok.Tok != TOK_IDENT) {
1115 Error ("Identifier expected");
1116 /* Make the expression an integer at address zero */
1117 ED_MakeConstAbs (Expr, 0, type_int);
1121 /* Get the symbol table entry and check for a struct field */
1122 strcpy (Ident, CurTok.Ident);
1124 Field = FindStructField (Expr->Type, Ident);
1126 Error ("Struct/union has no field named `%s'", Ident);
1127 /* Make the expression an integer at address zero */
1128 ED_MakeConstAbs (Expr, 0, type_int);
1132 /* If we have a struct pointer that is an lvalue and not already in the
1133 * primary, load it now.
1135 if (ED_IsLVal (Expr) && IsTypePtr (Expr->Type)) {
1137 /* Load into the primary */
1138 LoadExpr (CF_NONE, Expr);
1140 /* Make it an lvalue expression */
1141 ED_MakeLValExpr (Expr);
1144 /* The type is the type of the field plus any qualifiers from the struct */
1145 if (IsClassStruct (Expr->Type)) {
1146 Q = GetQualifier (Expr->Type);
1148 Q = GetQualifier (Indirect (Expr->Type));
1150 if (GetQualifier (Field->Type) == (GetQualifier (Field->Type) | Q)) {
1151 FinalType = Field->Type;
1153 FinalType = TypeDup (Field->Type);
1157 /* A struct is usually an lvalue. If not, it is a struct in the primary
1160 if (ED_IsRVal (Expr) && ED_IsLocExpr (Expr) && !IsTypePtr (Expr->Type)) {
1165 /* Get the size of the type */
1166 unsigned Size = SizeOf (Expr->Type);
1169 CHECK (Field->V.Offs + Size <= SIZEOF_LONG);
1171 /* The type of the operation depends on the type of the struct */
1173 case 1: Flags = CF_CHAR | CF_UNSIGNED | CF_CONST; break;
1174 case 2: Flags = CF_INT | CF_UNSIGNED | CF_CONST; break;
1175 case 3: /* FALLTHROUGH */
1176 case 4: Flags = CF_LONG | CF_UNSIGNED | CF_CONST; break;
1177 default: Internal ("Invalid struct size: %u", Size); break;
1180 /* Generate a shift to get the field in the proper position in the
1181 * primary. For bit fields, mask the value.
1183 BitOffs = Field->V.Offs * CHAR_BITS;
1184 if (SymIsBitField (Field)) {
1185 BitOffs += Field->V.B.BitOffs;
1186 g_asr (Flags, BitOffs);
1187 /* Mask the value. This is unnecessary if the shift executed above
1188 * moved only zeroes into the value.
1190 if (BitOffs + Field->V.B.BitWidth != Size * CHAR_BITS) {
1191 g_and (CF_INT | CF_UNSIGNED | CF_CONST,
1192 (0x0001U << Field->V.B.BitWidth) - 1U);
1195 g_asr (Flags, BitOffs);
1198 /* Use the new type */
1199 Expr->Type = FinalType;
1203 /* Set the struct field offset */
1204 Expr->IVal += Field->V.Offs;
1206 /* Use the new type */
1207 Expr->Type = FinalType;
1209 /* An struct member is actually a variable. So the rules for variables
1210 * with respect to the reference type apply: If it's an array, it is
1211 * a rvalue, otherwise it's an lvalue. (A function would also be a rvalue,
1212 * but a struct field cannot be a function).
1214 if (IsTypeArray (Expr->Type)) {
1220 /* Make the expression a bit field if necessary */
1221 if (SymIsBitField (Field)) {
1222 ED_MakeBitField (Expr, Field->V.B.BitOffs, Field->V.B.BitWidth);
1230 static void hie11 (ExprDesc *Expr)
1231 /* Handle compound types (structs and arrays) */
1233 /* Name value used in invalid function calls */
1234 static const char IllegalFunc[] = "illegal_function_call";
1236 /* Evaluate the lhs */
1239 /* Check for a rhs */
1240 while (CurTok.Tok == TOK_LBRACK || CurTok.Tok == TOK_LPAREN ||
1241 CurTok.Tok == TOK_DOT || CurTok.Tok == TOK_PTR_REF) {
1243 switch (CurTok.Tok) {
1246 /* Array reference */
1251 /* Function call. */
1252 if (!IsTypeFunc (Expr->Type) && !IsTypeFuncPtr (Expr->Type)) {
1253 /* Not a function */
1254 Error ("Illegal function call");
1255 /* Force the type to be a implicitly defined function, one
1256 * returning an int and taking any number of arguments.
1257 * Since we don't have a name, invent one.
1259 ED_MakeConstAbs (Expr, 0, GetImplicitFuncType ());
1260 Expr->Name = (long) IllegalFunc;
1262 /* Call the function */
1263 FunctionCall (Expr);
1267 if (!IsClassStruct (Expr->Type)) {
1268 Error ("Struct expected");
1274 /* If we have an array, convert it to pointer to first element */
1275 if (IsTypeArray (Expr->Type)) {
1276 Expr->Type = ArrayToPtr (Expr->Type);
1278 if (!IsClassPtr (Expr->Type) || !IsClassStruct (Indirect (Expr->Type))) {
1279 Error ("Struct pointer expected");
1285 Internal ("Invalid token in hie11: %d", CurTok.Tok);
1293 void Store (ExprDesc* Expr, const Type* StoreType)
1294 /* Store the primary register into the location denoted by Expr. If StoreType
1295 * is given, use this type when storing instead of Expr->Type. If StoreType
1296 * is NULL, use Expr->Type instead.
1301 /* If StoreType was not given, use Expr->Type instead */
1302 if (StoreType == 0) {
1303 StoreType = Expr->Type;
1306 /* Prepare the code generator flags */
1307 Flags = TypeOf (StoreType) | GlobalModeFlags (Expr);
1309 /* Do the store depending on the location */
1310 switch (ED_GetLoc (Expr)) {
1313 /* Absolute: numeric address or const */
1314 g_putstatic (Flags, Expr->IVal, 0);
1318 /* Global variable */
1319 g_putstatic (Flags, Expr->Name, Expr->IVal);
1324 /* Static variable or literal in the literal pool */
1325 g_putstatic (Flags, Expr->Name, Expr->IVal);
1328 case E_LOC_REGISTER:
1329 /* Register variable */
1330 g_putstatic (Flags, Expr->Name, Expr->IVal);
1334 /* Value on the stack */
1335 g_putlocal (Flags, Expr->IVal, 0);
1339 /* The primary register (value is already there) */
1343 /* An expression in the primary register */
1344 g_putind (Flags, Expr->IVal);
1348 Internal ("Invalid location in Store(): 0x%04X", ED_GetLoc (Expr));
1351 /* Assume that each one of the stores will invalidate CC */
1352 ED_MarkAsUntested (Expr);
1357 static void PreInc (ExprDesc* Expr)
1358 /* Handle the preincrement operators */
1363 /* Skip the operator token */
1366 /* Evaluate the expression and check that it is an lvalue */
1368 if (!ED_IsLVal (Expr)) {
1369 Error ("Invalid lvalue");
1373 /* We cannot modify const values */
1374 if (IsQualConst (Expr->Type)) {
1375 Error ("Increment of read-only variable");
1378 /* Get the data type */
1379 Flags = TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR | CF_CONST;
1381 /* Get the increment value in bytes */
1382 Val = IsTypePtr (Expr->Type)? CheckedPSizeOf (Expr->Type) : 1;
1384 /* Check the location of the data */
1385 switch (ED_GetLoc (Expr)) {
1388 /* Absolute: numeric address or const */
1389 g_addeqstatic (Flags, Expr->IVal, 0, Val);
1393 /* Global variable */
1394 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1399 /* Static variable or literal in the literal pool */
1400 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1403 case E_LOC_REGISTER:
1404 /* Register variable */
1405 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1409 /* Value on the stack */
1410 g_addeqlocal (Flags, Expr->IVal, Val);
1414 /* The primary register */
1419 /* An expression in the primary register */
1420 g_addeqind (Flags, Expr->IVal, Val);
1424 Internal ("Invalid location in PreInc(): 0x%04X", ED_GetLoc (Expr));
1427 /* Result is an expression, no reference */
1428 ED_MakeRValExpr (Expr);
1433 static void PreDec (ExprDesc* Expr)
1434 /* Handle the predecrement operators */
1439 /* Skip the operator token */
1442 /* Evaluate the expression and check that it is an lvalue */
1444 if (!ED_IsLVal (Expr)) {
1445 Error ("Invalid lvalue");
1449 /* We cannot modify const values */
1450 if (IsQualConst (Expr->Type)) {
1451 Error ("Decrement of read-only variable");
1454 /* Get the data type */
1455 Flags = TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR | CF_CONST;
1457 /* Get the increment value in bytes */
1458 Val = IsTypePtr (Expr->Type)? CheckedPSizeOf (Expr->Type) : 1;
1460 /* Check the location of the data */
1461 switch (ED_GetLoc (Expr)) {
1464 /* Absolute: numeric address or const */
1465 g_subeqstatic (Flags, Expr->IVal, 0, Val);
1469 /* Global variable */
1470 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1475 /* Static variable or literal in the literal pool */
1476 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1479 case E_LOC_REGISTER:
1480 /* Register variable */
1481 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1485 /* Value on the stack */
1486 g_subeqlocal (Flags, Expr->IVal, Val);
1490 /* The primary register */
1495 /* An expression in the primary register */
1496 g_subeqind (Flags, Expr->IVal, Val);
1500 Internal ("Invalid location in PreDec(): 0x%04X", ED_GetLoc (Expr));
1503 /* Result is an expression, no reference */
1504 ED_MakeRValExpr (Expr);
1509 static void PostInc (ExprDesc* Expr)
1510 /* Handle the postincrement operator */
1516 /* The expression to increment must be an lvalue */
1517 if (!ED_IsLVal (Expr)) {
1518 Error ("Invalid lvalue");
1522 /* We cannot modify const values */
1523 if (IsQualConst (Expr->Type)) {
1524 Error ("Increment of read-only variable");
1527 /* Get the data type */
1528 Flags = TypeOf (Expr->Type);
1530 /* Push the address if needed */
1533 /* Fetch the value and save it (since it's the result of the expression) */
1534 LoadExpr (CF_NONE, Expr);
1535 g_save (Flags | CF_FORCECHAR);
1537 /* If we have a pointer expression, increment by the size of the type */
1538 if (IsTypePtr (Expr->Type)) {
1539 g_inc (Flags | CF_CONST | CF_FORCECHAR, CheckedSizeOf (Expr->Type + 1));
1541 g_inc (Flags | CF_CONST | CF_FORCECHAR, 1);
1544 /* Store the result back */
1547 /* Restore the original value in the primary register */
1548 g_restore (Flags | CF_FORCECHAR);
1550 /* The result is always an expression, no reference */
1551 ED_MakeRValExpr (Expr);
1556 static void PostDec (ExprDesc* Expr)
1557 /* Handle the postdecrement operator */
1563 /* The expression to increment must be an lvalue */
1564 if (!ED_IsLVal (Expr)) {
1565 Error ("Invalid lvalue");
1569 /* We cannot modify const values */
1570 if (IsQualConst (Expr->Type)) {
1571 Error ("Decrement of read-only variable");
1574 /* Get the data type */
1575 Flags = TypeOf (Expr->Type);
1577 /* Push the address if needed */
1580 /* Fetch the value and save it (since it's the result of the expression) */
1581 LoadExpr (CF_NONE, Expr);
1582 g_save (Flags | CF_FORCECHAR);
1584 /* If we have a pointer expression, increment by the size of the type */
1585 if (IsTypePtr (Expr->Type)) {
1586 g_dec (Flags | CF_CONST | CF_FORCECHAR, CheckedSizeOf (Expr->Type + 1));
1588 g_dec (Flags | CF_CONST | CF_FORCECHAR, 1);
1591 /* Store the result back */
1594 /* Restore the original value in the primary register */
1595 g_restore (Flags | CF_FORCECHAR);
1597 /* The result is always an expression, no reference */
1598 ED_MakeRValExpr (Expr);
1603 static void UnaryOp (ExprDesc* Expr)
1604 /* Handle unary -/+ and ~ */
1608 /* Remember the operator token and skip it */
1609 token_t Tok = CurTok.Tok;
1612 /* Get the expression */
1615 /* We can only handle integer types */
1616 if (!IsClassInt (Expr->Type)) {
1617 Error ("Argument must have integer type");
1618 ED_MakeConstAbsInt (Expr, 1);
1621 /* Check for a constant expression */
1622 if (ED_IsConstAbs (Expr)) {
1623 /* Value is constant */
1625 case TOK_MINUS: Expr->IVal = -Expr->IVal; break;
1626 case TOK_PLUS: break;
1627 case TOK_COMP: Expr->IVal = ~Expr->IVal; break;
1628 default: Internal ("Unexpected token: %d", Tok);
1631 /* Value is not constant */
1632 LoadExpr (CF_NONE, Expr);
1634 /* Get the type of the expression */
1635 Flags = TypeOf (Expr->Type);
1637 /* Handle the operation */
1639 case TOK_MINUS: g_neg (Flags); break;
1640 case TOK_PLUS: break;
1641 case TOK_COMP: g_com (Flags); break;
1642 default: Internal ("Unexpected token: %d", Tok);
1645 /* The result is a rvalue in the primary */
1646 ED_MakeRValExpr (Expr);
1652 void hie10 (ExprDesc* Expr)
1653 /* Handle ++, --, !, unary - etc. */
1657 switch (CurTok.Tok) {
1675 if (evalexpr (CF_NONE, hie10, Expr) == 0) {
1676 /* Constant expression */
1677 Expr->IVal = !Expr->IVal;
1679 g_bneg (TypeOf (Expr->Type));
1680 ED_MakeRValExpr (Expr);
1681 ED_TestDone (Expr); /* bneg will set cc */
1687 ExprWithCheck (hie10, Expr);
1688 if (ED_IsLVal (Expr) || !(ED_IsLocConst (Expr) || ED_IsLocStack (Expr))) {
1689 /* Not a const, load it into the primary and make it a
1692 LoadExpr (CF_NONE, Expr);
1693 ED_MakeRValExpr (Expr);
1695 /* If the expression is already a pointer to function, the
1696 * additional dereferencing operator must be ignored. A function
1697 * itself is represented as "pointer to function", so any number
1698 * of dereference operators is legal, since the result will
1699 * always be converted to "pointer to function".
1701 if (IsTypeFuncPtr (Expr->Type) || IsTypeFunc (Expr->Type)) {
1702 /* Expression not storable */
1705 if (IsClassPtr (Expr->Type)) {
1706 Expr->Type = Indirect (Expr->Type);
1708 Error ("Illegal indirection");
1710 /* The * operator yields an lvalue */
1717 ExprWithCheck (hie10, Expr);
1718 /* The & operator may be applied to any lvalue, and it may be
1719 * applied to functions, even if they're no lvalues.
1721 if (ED_IsRVal (Expr) && !IsTypeFunc (Expr->Type) && !IsTypeArray (Expr->Type)) {
1722 Error ("Illegal address");
1724 if (ED_IsBitField (Expr)) {
1725 Error ("Cannot take address of bit-field");
1726 /* Do it anyway, just to avoid further warnings */
1727 Expr->Flags &= ~E_BITFIELD;
1729 Expr->Type = PointerTo (Expr->Type);
1730 /* The & operator yields an rvalue */
1737 if (TypeSpecAhead ()) {
1740 Size = CheckedSizeOf (ParseType (T));
1743 /* Remember the output queue pointer */
1747 /* If the expression is a literal string, release it, so it
1748 * won't be output as data if not used elsewhere.
1750 if (ED_IsLocLiteral (Expr)) {
1751 ReleaseLiteral (Expr->LVal);
1753 /* Calculate the size */
1754 Size = CheckedSizeOf (Expr->Type);
1755 /* Remove any generated code */
1758 ED_MakeConstAbs (Expr, Size, type_size_t);
1759 ED_MarkAsUntested (Expr);
1763 if (TypeSpecAhead ()) {
1773 /* Handle post increment */
1774 switch (CurTok.Tok) {
1775 case TOK_INC: PostInc (Expr); break;
1776 case TOK_DEC: PostDec (Expr); break;
1787 static void hie_internal (const GenDesc* Ops, /* List of generators */
1789 void (*hienext) (ExprDesc*),
1791 /* Helper function */
1797 token_t Tok; /* The operator token */
1798 unsigned ltype, type;
1799 int lconst; /* Left operand is a constant */
1800 int rconst; /* Right operand is a constant */
1803 ExprWithCheck (hienext, Expr);
1806 while ((Gen = FindGen (CurTok.Tok, Ops)) != 0) {
1808 /* Tell the caller that we handled it's ops */
1811 /* All operators that call this function expect an int on the lhs */
1812 if (!IsClassInt (Expr->Type)) {
1813 Error ("Integer expression expected");
1814 /* To avoid further errors, make Expr a valid int expression */
1815 ED_MakeConstAbsInt (Expr, 1);
1818 /* Remember the operator token, then skip it */
1822 /* Get the lhs on stack */
1823 GetCodePos (&Mark1);
1824 ltype = TypeOf (Expr->Type);
1825 lconst = ED_IsConstAbs (Expr);
1827 /* Constant value */
1828 GetCodePos (&Mark2);
1829 /* If the operator is commutative, don't push the left side, if
1830 * it's a constant, since we will exchange both operands.
1832 if ((Gen->Flags & GEN_COMM) == 0) {
1833 g_push (ltype | CF_CONST, Expr->IVal);
1836 /* Value not constant */
1837 LoadExpr (CF_NONE, Expr);
1838 GetCodePos (&Mark2);
1842 /* Get the right hand side */
1843 MarkedExprWithCheck (hienext, &Expr2);
1845 /* Check for a constant expression */
1846 rconst = (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2));
1848 /* Not constant, load into the primary */
1849 LoadExpr (CF_NONE, &Expr2);
1852 /* Check the type of the rhs */
1853 if (!IsClassInt (Expr2.Type)) {
1854 Error ("Integer expression expected");
1857 /* Check for const operands */
1858 if (lconst && rconst) {
1860 /* Both operands are constant, remove the generated code */
1861 RemoveCode (&Mark1);
1863 /* Get the type of the result */
1864 Expr->Type = promoteint (Expr->Type, Expr2.Type);
1866 /* Handle the op differently for signed and unsigned types */
1867 if (IsSignSigned (Expr->Type)) {
1869 /* Evaluate the result for signed operands */
1870 signed long Val1 = Expr->IVal;
1871 signed long Val2 = Expr2.IVal;
1874 Expr->IVal = (Val1 | Val2);
1877 Expr->IVal = (Val1 ^ Val2);
1880 Expr->IVal = (Val1 & Val2);
1883 Expr->IVal = (Val1 * Val2);
1887 Error ("Division by zero");
1888 Expr->IVal = 0x7FFFFFFF;
1890 Expr->IVal = (Val1 / Val2);
1895 Error ("Modulo operation with zero");
1898 Expr->IVal = (Val1 % Val2);
1902 Internal ("hie_internal: got token 0x%X\n", Tok);
1906 /* Evaluate the result for unsigned operands */
1907 unsigned long Val1 = Expr->IVal;
1908 unsigned long Val2 = Expr2.IVal;
1911 Expr->IVal = (Val1 | Val2);
1914 Expr->IVal = (Val1 ^ Val2);
1917 Expr->IVal = (Val1 & Val2);
1920 Expr->IVal = (Val1 * Val2);
1924 Error ("Division by zero");
1925 Expr->IVal = 0xFFFFFFFF;
1927 Expr->IVal = (Val1 / Val2);
1932 Error ("Modulo operation with zero");
1935 Expr->IVal = (Val1 % Val2);
1939 Internal ("hie_internal: got token 0x%X\n", Tok);
1943 } else if (lconst && (Gen->Flags & GEN_COMM) && !rconst) {
1945 /* The left side is constant, the right side is not, and the
1946 * operator allows swapping the operands. We haven't pushed the
1947 * left side onto the stack in this case, and will reverse the
1948 * operation because this allows for better code.
1950 unsigned rtype = ltype | CF_CONST;
1951 ltype = TypeOf (Expr2.Type); /* Expr2 is now left */
1953 if ((Gen->Flags & GEN_NOPUSH) == 0) {
1956 ltype |= CF_REG; /* Value is in register */
1959 /* Determine the type of the operation result. */
1960 type |= g_typeadjust (ltype, rtype);
1961 Expr->Type = promoteint (Expr->Type, Expr2.Type);
1964 Gen->Func (type, Expr->IVal);
1966 /* We have a rvalue in the primary now */
1967 ED_MakeRValExpr (Expr);
1971 /* If the right hand side is constant, and the generator function
1972 * expects the lhs in the primary, remove the push of the primary
1975 unsigned rtype = TypeOf (Expr2.Type);
1978 /* Second value is constant - check for div */
1981 if (Tok == TOK_DIV && Expr2.IVal == 0) {
1982 Error ("Division by zero");
1983 } else if (Tok == TOK_MOD && Expr2.IVal == 0) {
1984 Error ("Modulo operation with zero");
1986 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1987 RemoveCode (&Mark2);
1988 ltype |= CF_REG; /* Value is in register */
1992 /* Determine the type of the operation result. */
1993 type |= g_typeadjust (ltype, rtype);
1994 Expr->Type = promoteint (Expr->Type, Expr2.Type);
1997 Gen->Func (type, Expr2.IVal);
1999 /* We have a rvalue in the primary now */
2000 ED_MakeRValExpr (Expr);
2007 static void hie_compare (const GenDesc* Ops, /* List of generators */
2009 void (*hienext) (ExprDesc*))
2010 /* Helper function for the compare operators */
2017 token_t Tok; /* The operator token */
2019 int rconst; /* Operand is a constant */
2022 GetCodePos (&Mark0);
2023 ExprWithCheck (hienext, Expr);
2025 while ((Gen = FindGen (CurTok.Tok, Ops)) != 0) {
2027 /* Remember the generator function */
2028 void (*GenFunc) (unsigned, unsigned long) = Gen->Func;
2030 /* Remember the operator token, then skip it */
2034 /* Get the lhs on stack */
2035 GetCodePos (&Mark1);
2036 ltype = TypeOf (Expr->Type);
2037 if (ED_IsConstAbs (Expr)) {
2038 /* Constant value */
2039 GetCodePos (&Mark2);
2040 g_push (ltype | CF_CONST, Expr->IVal);
2042 /* Value not constant */
2043 LoadExpr (CF_NONE, Expr);
2044 GetCodePos (&Mark2);
2048 /* Get the right hand side */
2049 MarkedExprWithCheck (hienext, &Expr2);
2051 /* Check for a constant expression */
2052 rconst = (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2));
2054 /* Not constant, load into the primary */
2055 LoadExpr (CF_NONE, &Expr2);
2058 /* Make sure, the types are compatible */
2059 if (IsClassInt (Expr->Type)) {
2060 if (!IsClassInt (Expr2.Type) && !(IsClassPtr(Expr2.Type) && ED_IsNullPtr(Expr))) {
2061 Error ("Incompatible types");
2063 } else if (IsClassPtr (Expr->Type)) {
2064 if (IsClassPtr (Expr2.Type)) {
2065 /* Both pointers are allowed in comparison if they point to
2066 * the same type, or if one of them is a void pointer.
2068 Type* left = Indirect (Expr->Type);
2069 Type* right = Indirect (Expr2.Type);
2070 if (TypeCmp (left, right) < TC_EQUAL && left->C != T_VOID && right->C != T_VOID) {
2071 /* Incomatible pointers */
2072 Error ("Incompatible types");
2074 } else if (!ED_IsNullPtr (&Expr2)) {
2075 Error ("Incompatible types");
2079 /* Check for const operands */
2080 if (ED_IsConstAbs (Expr) && rconst) {
2082 /* If the result is constant, this is suspicious when not in
2083 * preprocessor mode.
2085 WarnConstCompareResult ();
2087 /* Both operands are constant, remove the generated code */
2088 RemoveCode (&Mark1);
2090 /* Determine if this is a signed or unsigned compare */
2091 if (IsClassInt (Expr->Type) && IsSignSigned (Expr->Type) &&
2092 IsClassInt (Expr2.Type) && IsSignSigned (Expr2.Type)) {
2094 /* Evaluate the result for signed operands */
2095 signed long Val1 = Expr->IVal;
2096 signed long Val2 = Expr2.IVal;
2098 case TOK_EQ: Expr->IVal = (Val1 == Val2); break;
2099 case TOK_NE: Expr->IVal = (Val1 != Val2); break;
2100 case TOK_LT: Expr->IVal = (Val1 < Val2); break;
2101 case TOK_LE: Expr->IVal = (Val1 <= Val2); break;
2102 case TOK_GE: Expr->IVal = (Val1 >= Val2); break;
2103 case TOK_GT: Expr->IVal = (Val1 > Val2); break;
2104 default: Internal ("hie_compare: got token 0x%X\n", Tok);
2109 /* Evaluate the result for unsigned operands */
2110 unsigned long Val1 = Expr->IVal;
2111 unsigned long Val2 = Expr2.IVal;
2113 case TOK_EQ: Expr->IVal = (Val1 == Val2); break;
2114 case TOK_NE: Expr->IVal = (Val1 != Val2); break;
2115 case TOK_LT: Expr->IVal = (Val1 < Val2); break;
2116 case TOK_LE: Expr->IVal = (Val1 <= Val2); break;
2117 case TOK_GE: Expr->IVal = (Val1 >= Val2); break;
2118 case TOK_GT: Expr->IVal = (Val1 > Val2); break;
2119 default: Internal ("hie_compare: got token 0x%X\n", Tok);
2125 /* Determine the signedness of the operands */
2126 int LeftSigned = IsSignSigned (Expr->Type);
2127 int RightSigned = IsSignSigned (Expr2.Type);
2129 /* If the right hand side is constant, and the generator function
2130 * expects the lhs in the primary, remove the push of the primary
2136 if ((Gen->Flags & GEN_NOPUSH) != 0) {
2137 RemoveCode (&Mark2);
2138 ltype |= CF_REG; /* Value is in register */
2142 /* Determine the type of the operation. */
2143 if (IsTypeChar (Expr->Type) && rconst) {
2145 /* Left side is unsigned char, right side is constant.
2146 * Determine the minimum and maximum values
2148 int LeftMin, LeftMax;
2156 /* An integer value is always represented as a signed in the
2157 * ExprDesc structure. This may lead to false results below,
2158 * if it is actually unsigned, but interpreted as signed
2159 * because of the representation. Fortunately, in this case,
2160 * the actual value doesn't matter, since it's always greater
2161 * than what can be represented in a char. So correct the
2162 * value accordingly.
2164 if (!RightSigned && Expr2.IVal < 0) {
2165 /* Correct the value so it is an unsigned. It will then
2166 * anyway match one of the cases below.
2168 Expr2.IVal = LeftMax + 1;
2171 /* Comparing a char against a constant may have a constant
2172 * result. Please note: It is not possible to remove the code
2173 * for the compare alltogether, because it may have side
2179 if (Expr2.IVal < LeftMin || Expr2.IVal > LeftMax) {
2180 ED_MakeConstAbsInt (Expr, 0);
2181 WarnConstCompareResult ();
2187 if (Expr2.IVal < LeftMin || Expr2.IVal > LeftMax) {
2188 ED_MakeConstAbsInt (Expr, 1);
2189 WarnConstCompareResult ();
2195 if (Expr2.IVal <= LeftMin || Expr2.IVal > LeftMax) {
2196 ED_MakeConstAbsInt (Expr, Expr2.IVal > LeftMax);
2197 WarnConstCompareResult ();
2203 if (Expr2.IVal < LeftMin || Expr2.IVal >= LeftMax) {
2204 ED_MakeConstAbsInt (Expr, Expr2.IVal >= LeftMax);
2205 WarnConstCompareResult ();
2211 if (Expr2.IVal <= LeftMin || Expr2.IVal > LeftMax) {
2212 ED_MakeConstAbsInt (Expr, Expr2.IVal <= LeftMin);
2213 WarnConstCompareResult ();
2219 if (Expr2.IVal < LeftMin || Expr2.IVal >= LeftMax) {
2220 ED_MakeConstAbsInt (Expr, Expr2.IVal < LeftMin);
2221 WarnConstCompareResult ();
2227 Internal ("hie_compare: got token 0x%X\n", Tok);
2230 /* If the result is not already constant (as evaluated in the
2231 * switch above), we can execute the operation as a char op,
2232 * since the right side constant is in a valid range.
2234 flags |= (CF_CHAR | CF_FORCECHAR);
2236 flags |= CF_UNSIGNED;
2239 } else if (IsTypeChar (Expr->Type) && IsTypeChar (Expr2.Type) &&
2240 GetSignedness (Expr->Type) == GetSignedness (Expr2.Type)) {
2242 /* Both are chars with the same signedness. We can encode the
2243 * operation as a char operation.
2247 flags |= CF_FORCECHAR;
2250 flags |= CF_UNSIGNED;
2253 unsigned rtype = TypeOf (Expr2.Type) | (flags & CF_CONST);
2254 flags |= g_typeadjust (ltype, rtype);
2257 /* If the left side is an unsigned and the right is a constant,
2258 * we may be able to change the compares to something more
2261 if (!LeftSigned && rconst) {
2266 if (Expr2.IVal == 1) {
2267 /* An unsigned compare to one means that the value
2276 if (Expr2.IVal == 0) {
2277 /* An unsigned compare to zero means that the value
2285 if (Expr2.IVal == 1) {
2286 /* An unsigned compare to one means that the value
2295 if (Expr2.IVal == 0) {
2296 /* An unsigned compare to zero means that the value
2311 GenFunc (flags, Expr2.IVal);
2313 /* The result is an rvalue in the primary */
2314 ED_MakeRValExpr (Expr);
2317 /* Result type is always int */
2318 Expr->Type = type_int;
2320 Done: /* Condition codes are set */
2327 static void hie9 (ExprDesc *Expr)
2328 /* Process * and / operators. */
2330 static const GenDesc hie9_ops[] = {
2331 { TOK_STAR, GEN_NOPUSH | GEN_COMM, g_mul },
2332 { TOK_DIV, GEN_NOPUSH, g_div },
2333 { TOK_MOD, GEN_NOPUSH, g_mod },
2334 { TOK_INVALID, 0, 0 }
2338 hie_internal (hie9_ops, Expr, hie10, &UsedGen);
2343 static void parseadd (ExprDesc* Expr)
2344 /* Parse an expression with the binary plus operator. Expr contains the
2345 * unprocessed left hand side of the expression and will contain the
2346 * result of the expression on return.
2350 unsigned flags; /* Operation flags */
2351 CodeMark Mark; /* Remember code position */
2352 Type* lhst; /* Type of left hand side */
2353 Type* rhst; /* Type of right hand side */
2356 /* Skip the PLUS token */
2359 /* Get the left hand side type, initialize operation flags */
2363 /* Check for constness on both sides */
2364 if (ED_IsConst (Expr)) {
2366 /* The left hand side is a constant of some sort. Good. Get rhs */
2367 ExprWithCheck (hie9, &Expr2);
2368 if (ED_IsConstAbs (&Expr2)) {
2370 /* Right hand side is a constant numeric value. Get the rhs type */
2373 /* Both expressions are constants. Check for pointer arithmetic */
2374 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2375 /* Left is pointer, right is int, must scale rhs */
2376 Expr->IVal += Expr2.IVal * CheckedPSizeOf (lhst);
2377 /* Result type is a pointer */
2378 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2379 /* Left is int, right is pointer, must scale lhs */
2380 Expr->IVal = Expr->IVal * CheckedPSizeOf (rhst) + Expr2.IVal;
2381 /* Result type is a pointer */
2382 Expr->Type = Expr2.Type;
2383 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2384 /* Integer addition */
2385 Expr->IVal += Expr2.IVal;
2386 typeadjust (Expr, &Expr2, 1);
2389 Error ("Invalid operands for binary operator `+'");
2394 /* lhs is a constant and rhs is not constant. Load rhs into
2397 LoadExpr (CF_NONE, &Expr2);
2399 /* Beware: The check above (for lhs) lets not only pass numeric
2400 * constants, but also constant addresses (labels), maybe even
2401 * with an offset. We have to check for that here.
2404 /* First, get the rhs type. */
2408 if (ED_IsLocAbs (Expr)) {
2409 /* A numerical constant */
2412 /* Constant address label */
2413 flags |= GlobalModeFlags (Expr) | CF_CONSTADDR;
2416 /* Check for pointer arithmetic */
2417 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2418 /* Left is pointer, right is int, must scale rhs */
2419 g_scale (CF_INT, CheckedPSizeOf (lhst));
2420 /* Operate on pointers, result type is a pointer */
2422 /* Generate the code for the add */
2423 if (ED_GetLoc (Expr) == E_LOC_ABS) {
2424 /* Numeric constant */
2425 g_inc (flags, Expr->IVal);
2427 /* Constant address */
2428 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2430 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2432 /* Left is int, right is pointer, must scale lhs. */
2433 unsigned ScaleFactor = CheckedPSizeOf (rhst);
2435 /* Operate on pointers, result type is a pointer */
2437 Expr->Type = Expr2.Type;
2439 /* Since we do already have rhs in the primary, if lhs is
2440 * not a numeric constant, and the scale factor is not one
2441 * (no scaling), we must take the long way over the stack.
2443 if (ED_IsLocAbs (Expr)) {
2444 /* Numeric constant, scale lhs */
2445 Expr->IVal *= ScaleFactor;
2446 /* Generate the code for the add */
2447 g_inc (flags, Expr->IVal);
2448 } else if (ScaleFactor == 1) {
2449 /* Constant address but no need to scale */
2450 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2452 /* Constant address that must be scaled */
2453 g_push (TypeOf (Expr2.Type), 0); /* rhs --> stack */
2454 g_getimmed (flags, Expr->Name, Expr->IVal);
2455 g_scale (CF_PTR, ScaleFactor);
2458 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2459 /* Integer addition */
2460 flags |= typeadjust (Expr, &Expr2, 1);
2461 /* Generate the code for the add */
2462 if (ED_IsLocAbs (Expr)) {
2463 /* Numeric constant */
2464 g_inc (flags, Expr->IVal);
2466 /* Constant address */
2467 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2471 Error ("Invalid operands for binary operator `+'");
2475 /* Result is a rvalue in primary register */
2476 ED_MakeRValExpr (Expr);
2481 /* Left hand side is not constant. Get the value onto the stack. */
2482 LoadExpr (CF_NONE, Expr); /* --> primary register */
2484 g_push (TypeOf (Expr->Type), 0); /* --> stack */
2486 /* Evaluate the rhs */
2487 MarkedExprWithCheck (hie9, &Expr2);
2489 /* Check for a constant rhs expression */
2490 if (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2)) {
2492 /* Right hand side is a constant. Get the rhs type */
2495 /* Remove pushed value from stack */
2498 /* Check for pointer arithmetic */
2499 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2500 /* Left is pointer, right is int, must scale rhs */
2501 Expr2.IVal *= CheckedPSizeOf (lhst);
2502 /* Operate on pointers, result type is a pointer */
2504 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2505 /* Left is int, right is pointer, must scale lhs (ptr only) */
2506 g_scale (CF_INT | CF_CONST, CheckedPSizeOf (rhst));
2507 /* Operate on pointers, result type is a pointer */
2509 Expr->Type = Expr2.Type;
2510 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2511 /* Integer addition */
2512 flags = typeadjust (Expr, &Expr2, 1);
2515 Error ("Invalid operands for binary operator `+'");
2519 /* Generate code for the add */
2520 g_inc (flags | CF_CONST, Expr2.IVal);
2524 /* Not constant, load into the primary */
2525 LoadExpr (CF_NONE, &Expr2);
2527 /* lhs and rhs are not constant. Get the rhs type. */
2530 /* Check for pointer arithmetic */
2531 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2532 /* Left is pointer, right is int, must scale rhs */
2533 g_scale (CF_INT, CheckedPSizeOf (lhst));
2534 /* Operate on pointers, result type is a pointer */
2536 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2537 /* Left is int, right is pointer, must scale lhs */
2538 g_tosint (TypeOf (rhst)); /* Make sure, TOS is int */
2539 g_swap (CF_INT); /* Swap TOS and primary */
2540 g_scale (CF_INT, CheckedPSizeOf (rhst));
2541 /* Operate on pointers, result type is a pointer */
2543 Expr->Type = Expr2.Type;
2544 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2545 /* Integer addition. Note: Result is never constant.
2546 * Problem here is that typeadjust does not know if the
2547 * variable is an rvalue or lvalue, so if both operands
2548 * are dereferenced constant numeric addresses, typeadjust
2549 * thinks the operation works on constants. Removing
2550 * CF_CONST here means handling the symptoms, however, the
2551 * whole parser is such a mess that I fear to break anything
2552 * when trying to apply another solution.
2554 flags = typeadjust (Expr, &Expr2, 0) & ~CF_CONST;
2557 Error ("Invalid operands for binary operator `+'");
2561 /* Generate code for the add */
2566 /* Result is a rvalue in primary register */
2567 ED_MakeRValExpr (Expr);
2570 /* Condition codes not set */
2571 ED_MarkAsUntested (Expr);
2577 static void parsesub (ExprDesc* Expr)
2578 /* Parse an expression with the binary minus operator. Expr contains the
2579 * unprocessed left hand side of the expression and will contain the
2580 * result of the expression on return.
2584 unsigned flags; /* Operation flags */
2585 Type* lhst; /* Type of left hand side */
2586 Type* rhst; /* Type of right hand side */
2587 CodeMark Mark1; /* Save position of output queue */
2588 CodeMark Mark2; /* Another position in the queue */
2589 int rscale; /* Scale factor for the result */
2592 /* Skip the MINUS token */
2595 /* Get the left hand side type, initialize operation flags */
2597 rscale = 1; /* Scale by 1, that is, don't scale */
2599 /* Remember the output queue position, then bring the value onto the stack */
2600 GetCodePos (&Mark1);
2601 LoadExpr (CF_NONE, Expr); /* --> primary register */
2602 GetCodePos (&Mark2);
2603 g_push (TypeOf (lhst), 0); /* --> stack */
2605 /* Parse the right hand side */
2606 MarkedExprWithCheck (hie9, &Expr2);
2608 /* Check for a constant rhs expression */
2609 if (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2)) {
2611 /* The right hand side is constant. Get the rhs type. */
2614 /* Check left hand side */
2615 if (ED_IsConstAbs (Expr)) {
2617 /* Both sides are constant, remove generated code */
2618 RemoveCode (&Mark1);
2620 /* Check for pointer arithmetic */
2621 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2622 /* Left is pointer, right is int, must scale rhs */
2623 Expr->IVal -= Expr2.IVal * CheckedPSizeOf (lhst);
2624 /* Operate on pointers, result type is a pointer */
2625 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2626 /* Left is pointer, right is pointer, must scale result */
2627 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2628 Error ("Incompatible pointer types");
2630 Expr->IVal = (Expr->IVal - Expr2.IVal) /
2631 CheckedPSizeOf (lhst);
2633 /* Operate on pointers, result type is an integer */
2634 Expr->Type = type_int;
2635 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2636 /* Integer subtraction */
2637 typeadjust (Expr, &Expr2, 1);
2638 Expr->IVal -= Expr2.IVal;
2641 Error ("Invalid operands for binary operator `-'");
2644 /* Result is constant, condition codes not set */
2645 ED_MarkAsUntested (Expr);
2649 /* Left hand side is not constant, right hand side is.
2650 * Remove pushed value from stack.
2652 RemoveCode (&Mark2);
2654 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2655 /* Left is pointer, right is int, must scale rhs */
2656 Expr2.IVal *= CheckedPSizeOf (lhst);
2657 /* Operate on pointers, result type is a pointer */
2659 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2660 /* Left is pointer, right is pointer, must scale result */
2661 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2662 Error ("Incompatible pointer types");
2664 rscale = CheckedPSizeOf (lhst);
2666 /* Operate on pointers, result type is an integer */
2668 Expr->Type = type_int;
2669 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2670 /* Integer subtraction */
2671 flags = typeadjust (Expr, &Expr2, 1);
2674 Error ("Invalid operands for binary operator `-'");
2678 /* Do the subtraction */
2679 g_dec (flags | CF_CONST, Expr2.IVal);
2681 /* If this was a pointer subtraction, we must scale the result */
2683 g_scale (flags, -rscale);
2686 /* Result is a rvalue in the primary register */
2687 ED_MakeRValExpr (Expr);
2688 ED_MarkAsUntested (Expr);
2694 /* Not constant, load into the primary */
2695 LoadExpr (CF_NONE, &Expr2);
2697 /* Right hand side is not constant. Get the rhs type. */
2700 /* Check for pointer arithmetic */
2701 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2702 /* Left is pointer, right is int, must scale rhs */
2703 g_scale (CF_INT, CheckedPSizeOf (lhst));
2704 /* Operate on pointers, result type is a pointer */
2706 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2707 /* Left is pointer, right is pointer, must scale result */
2708 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2709 Error ("Incompatible pointer types");
2711 rscale = CheckedPSizeOf (lhst);
2713 /* Operate on pointers, result type is an integer */
2715 Expr->Type = type_int;
2716 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2717 /* Integer subtraction. If the left hand side descriptor says that
2718 * the lhs is const, we have to remove this mark, since this is no
2719 * longer true, lhs is on stack instead.
2721 if (ED_IsLocAbs (Expr)) {
2722 ED_MakeRValExpr (Expr);
2724 /* Adjust operand types */
2725 flags = typeadjust (Expr, &Expr2, 0);
2728 Error ("Invalid operands for binary operator `-'");
2732 /* Generate code for the sub (the & is a hack here) */
2733 g_sub (flags & ~CF_CONST, 0);
2735 /* If this was a pointer subtraction, we must scale the result */
2737 g_scale (flags, -rscale);
2740 /* Result is a rvalue in the primary register */
2741 ED_MakeRValExpr (Expr);
2742 ED_MarkAsUntested (Expr);
2748 void hie8 (ExprDesc* Expr)
2749 /* Process + and - binary operators. */
2751 ExprWithCheck (hie9, Expr);
2752 while (CurTok.Tok == TOK_PLUS || CurTok.Tok == TOK_MINUS) {
2753 if (CurTok.Tok == TOK_PLUS) {
2763 static void hie6 (ExprDesc* Expr)
2764 /* Handle greater-than type comparators */
2766 static const GenDesc hie6_ops [] = {
2767 { TOK_LT, GEN_NOPUSH, g_lt },
2768 { TOK_LE, GEN_NOPUSH, g_le },
2769 { TOK_GE, GEN_NOPUSH, g_ge },
2770 { TOK_GT, GEN_NOPUSH, g_gt },
2771 { TOK_INVALID, 0, 0 }
2773 hie_compare (hie6_ops, Expr, ShiftExpr);
2778 static void hie5 (ExprDesc* Expr)
2779 /* Handle == and != */
2781 static const GenDesc hie5_ops[] = {
2782 { TOK_EQ, GEN_NOPUSH, g_eq },
2783 { TOK_NE, GEN_NOPUSH, g_ne },
2784 { TOK_INVALID, 0, 0 }
2786 hie_compare (hie5_ops, Expr, hie6);
2791 static void hie4 (ExprDesc* Expr)
2792 /* Handle & (bitwise and) */
2794 static const GenDesc hie4_ops[] = {
2795 { TOK_AND, GEN_NOPUSH | GEN_COMM, g_and },
2796 { TOK_INVALID, 0, 0 }
2800 hie_internal (hie4_ops, Expr, hie5, &UsedGen);
2805 static void hie3 (ExprDesc* Expr)
2806 /* Handle ^ (bitwise exclusive or) */
2808 static const GenDesc hie3_ops[] = {
2809 { TOK_XOR, GEN_NOPUSH | GEN_COMM, g_xor },
2810 { TOK_INVALID, 0, 0 }
2814 hie_internal (hie3_ops, Expr, hie4, &UsedGen);
2819 static void hie2 (ExprDesc* Expr)
2820 /* Handle | (bitwise or) */
2822 static const GenDesc hie2_ops[] = {
2823 { TOK_OR, GEN_NOPUSH | GEN_COMM, g_or },
2824 { TOK_INVALID, 0, 0 }
2828 hie_internal (hie2_ops, Expr, hie3, &UsedGen);
2833 static void hieAndPP (ExprDesc* Expr)
2834 /* Process "exp && exp" in preprocessor mode (that is, when the parser is
2835 * called recursively from the preprocessor.
2840 ConstAbsIntExpr (hie2, Expr);
2841 while (CurTok.Tok == TOK_BOOL_AND) {
2847 ConstAbsIntExpr (hie2, &Expr2);
2849 /* Combine the two */
2850 Expr->IVal = (Expr->IVal && Expr2.IVal);
2856 static void hieOrPP (ExprDesc *Expr)
2857 /* Process "exp || exp" in preprocessor mode (that is, when the parser is
2858 * called recursively from the preprocessor.
2863 ConstAbsIntExpr (hieAndPP, Expr);
2864 while (CurTok.Tok == TOK_BOOL_OR) {
2870 ConstAbsIntExpr (hieAndPP, &Expr2);
2872 /* Combine the two */
2873 Expr->IVal = (Expr->IVal || Expr2.IVal);
2879 static void hieAnd (ExprDesc* Expr, unsigned TrueLab, int* BoolOp)
2880 /* Process "exp && exp" */
2885 ExprWithCheck (hie2, Expr);
2886 if (CurTok.Tok == TOK_BOOL_AND) {
2888 /* Tell our caller that we're evaluating a boolean */
2891 /* Get a label that we will use for false expressions */
2892 FalseLab = GetLocalLabel ();
2894 /* If the expr hasn't set condition codes, set the force-test flag */
2895 if (!ED_IsTested (Expr)) {
2896 ED_MarkForTest (Expr);
2899 /* Load the value */
2900 LoadExpr (CF_FORCECHAR, Expr);
2902 /* Generate the jump */
2903 g_falsejump (CF_NONE, FalseLab);
2905 /* Parse more boolean and's */
2906 while (CurTok.Tok == TOK_BOOL_AND) {
2913 if (!ED_IsTested (&Expr2)) {
2914 ED_MarkForTest (&Expr2);
2916 LoadExpr (CF_FORCECHAR, &Expr2);
2918 /* Do short circuit evaluation */
2919 if (CurTok.Tok == TOK_BOOL_AND) {
2920 g_falsejump (CF_NONE, FalseLab);
2922 /* Last expression - will evaluate to true */
2923 g_truejump (CF_NONE, TrueLab);
2927 /* Define the false jump label here */
2928 g_defcodelabel (FalseLab);
2930 /* The result is an rvalue in primary */
2931 ED_MakeRValExpr (Expr);
2932 ED_TestDone (Expr); /* Condition codes are set */
2938 static void hieOr (ExprDesc *Expr)
2939 /* Process "exp || exp". */
2942 int BoolOp = 0; /* Did we have a boolean op? */
2943 int AndOp; /* Did we have a && operation? */
2944 unsigned TrueLab; /* Jump to this label if true */
2948 TrueLab = GetLocalLabel ();
2950 /* Call the next level parser */
2951 hieAnd (Expr, TrueLab, &BoolOp);
2953 /* Any boolean or's? */
2954 if (CurTok.Tok == TOK_BOOL_OR) {
2956 /* If the expr hasn't set condition codes, set the force-test flag */
2957 if (!ED_IsTested (Expr)) {
2958 ED_MarkForTest (Expr);
2961 /* Get first expr */
2962 LoadExpr (CF_FORCECHAR, Expr);
2964 /* For each expression jump to TrueLab if true. Beware: If we
2965 * had && operators, the jump is already in place!
2968 g_truejump (CF_NONE, TrueLab);
2971 /* Remember that we had a boolean op */
2974 /* while there's more expr */
2975 while (CurTok.Tok == TOK_BOOL_OR) {
2982 hieAnd (&Expr2, TrueLab, &AndOp);
2983 if (!ED_IsTested (&Expr2)) {
2984 ED_MarkForTest (&Expr2);
2986 LoadExpr (CF_FORCECHAR, &Expr2);
2988 /* If there is more to come, add shortcut boolean eval. */
2989 g_truejump (CF_NONE, TrueLab);
2993 /* The result is an rvalue in primary */
2994 ED_MakeRValExpr (Expr);
2995 ED_TestDone (Expr); /* Condition codes are set */
2998 /* If we really had boolean ops, generate the end sequence */
3000 DoneLab = GetLocalLabel ();
3001 g_getimmed (CF_INT | CF_CONST, 0, 0); /* Load FALSE */
3002 g_falsejump (CF_NONE, DoneLab);
3003 g_defcodelabel (TrueLab);
3004 g_getimmed (CF_INT | CF_CONST, 1, 0); /* Load TRUE */
3005 g_defcodelabel (DoneLab);
3011 static void hieQuest (ExprDesc* Expr)
3012 /* Parse the ternary operator */
3016 CodeMark TrueCodeEnd;
3017 ExprDesc Expr2; /* Expression 2 */
3018 ExprDesc Expr3; /* Expression 3 */
3019 int Expr2IsNULL; /* Expression 2 is a NULL pointer */
3020 int Expr3IsNULL; /* Expression 3 is a NULL pointer */
3021 Type* ResultType; /* Type of result */
3024 /* Call the lower level eval routine */
3025 if (Preprocessing) {
3026 ExprWithCheck (hieOrPP, Expr);
3028 ExprWithCheck (hieOr, Expr);
3031 /* Check if it's a ternary expression */
3032 if (CurTok.Tok == TOK_QUEST) {
3034 if (!ED_IsTested (Expr)) {
3035 /* Condition codes not set, request a test */
3036 ED_MarkForTest (Expr);
3038 LoadExpr (CF_NONE, Expr);
3039 FalseLab = GetLocalLabel ();
3040 g_falsejump (CF_NONE, FalseLab);
3042 /* Parse second expression. Remember for later if it is a NULL pointer
3043 * expression, then load it into the primary.
3045 ExprWithCheck (hie1, &Expr2);
3046 Expr2IsNULL = ED_IsNullPtr (&Expr2);
3047 if (!IsTypeVoid (Expr2.Type)) {
3048 /* Load it into the primary */
3049 LoadExpr (CF_NONE, &Expr2);
3050 ED_MakeRValExpr (&Expr2);
3051 Expr2.Type = PtrConversion (Expr2.Type);
3054 /* Remember the current code position */
3055 GetCodePos (&TrueCodeEnd);
3057 /* Jump around the evaluation of the third expression */
3058 TrueLab = GetLocalLabel ();
3062 /* Jump here if the first expression was false */
3063 g_defcodelabel (FalseLab);
3065 /* Parse third expression. Remember for later if it is a NULL pointer
3066 * expression, then load it into the primary.
3068 ExprWithCheck (hie1, &Expr3);
3069 Expr3IsNULL = ED_IsNullPtr (&Expr3);
3070 if (!IsTypeVoid (Expr3.Type)) {
3071 /* Load it into the primary */
3072 LoadExpr (CF_NONE, &Expr3);
3073 ED_MakeRValExpr (&Expr3);
3074 Expr3.Type = PtrConversion (Expr3.Type);
3077 /* Check if any conversions are needed, if so, do them.
3078 * Conversion rules for ?: expression are:
3079 * - if both expressions are int expressions, default promotion
3080 * rules for ints apply.
3081 * - if both expressions are pointers of the same type, the
3082 * result of the expression is of this type.
3083 * - if one of the expressions is a pointer and the other is
3084 * a zero constant, the resulting type is that of the pointer
3086 * - if both expressions are void expressions, the result is of
3088 * - all other cases are flagged by an error.
3090 if (IsClassInt (Expr2.Type) && IsClassInt (Expr3.Type)) {
3092 CodeMark CvtCodeStart;
3093 CodeMark CvtCodeEnd;
3096 /* Get common type */
3097 ResultType = promoteint (Expr2.Type, Expr3.Type);
3099 /* Convert the third expression to this type if needed */
3100 TypeConversion (&Expr3, ResultType);
3102 /* Emit conversion code for the second expression, but remember
3103 * where it starts end ends.
3105 GetCodePos (&CvtCodeStart);
3106 TypeConversion (&Expr2, ResultType);
3107 GetCodePos (&CvtCodeEnd);
3109 /* If we had conversion code, move it to the right place */
3110 if (!CodeRangeIsEmpty (&CvtCodeStart, &CvtCodeEnd)) {
3111 MoveCode (&CvtCodeStart, &CvtCodeEnd, &TrueCodeEnd);
3114 } else if (IsClassPtr (Expr2.Type) && IsClassPtr (Expr3.Type)) {
3115 /* Must point to same type */
3116 if (TypeCmp (Indirect (Expr2.Type), Indirect (Expr3.Type)) < TC_EQUAL) {
3117 Error ("Incompatible pointer types");
3119 /* Result has the common type */
3120 ResultType = Expr2.Type;
3121 } else if (IsClassPtr (Expr2.Type) && Expr3IsNULL) {
3122 /* Result type is pointer, no cast needed */
3123 ResultType = Expr2.Type;
3124 } else if (Expr2IsNULL && IsClassPtr (Expr3.Type)) {
3125 /* Result type is pointer, no cast needed */
3126 ResultType = Expr3.Type;
3127 } else if (IsTypeVoid (Expr2.Type) && IsTypeVoid (Expr3.Type)) {
3128 /* Result type is void */
3129 ResultType = Expr3.Type;
3131 Error ("Incompatible types");
3132 ResultType = Expr2.Type; /* Doesn't matter here */
3135 /* Define the final label */
3136 g_defcodelabel (TrueLab);
3138 /* Setup the target expression */
3139 ED_MakeRValExpr (Expr);
3140 Expr->Type = ResultType;
3146 static void opeq (const GenDesc* Gen, ExprDesc* Expr, const char* Op)
3147 /* Process "op=" operators. */
3154 /* op= can only be used with lvalues */
3155 if (!ED_IsLVal (Expr)) {
3156 Error ("Invalid lvalue in assignment");
3160 /* The left side must not be const qualified */
3161 if (IsQualConst (Expr->Type)) {
3162 Error ("Assignment to const");
3165 /* There must be an integer or pointer on the left side */
3166 if (!IsClassInt (Expr->Type) && !IsTypePtr (Expr->Type)) {
3167 Error ("Invalid left operand type");
3168 /* Continue. Wrong code will be generated, but the compiler won't
3169 * break, so this is the best error recovery.
3173 /* Skip the operator token */
3176 /* Determine the type of the lhs */
3177 flags = TypeOf (Expr->Type);
3178 MustScale = (Gen->Func == g_add || Gen->Func == g_sub) && IsTypePtr (Expr->Type);
3180 /* Get the lhs address on stack (if needed) */
3183 /* Fetch the lhs into the primary register if needed */
3184 LoadExpr (CF_NONE, Expr);
3186 /* Bring the lhs on stack */
3190 /* Evaluate the rhs */
3191 MarkedExprWithCheck (hie1, &Expr2);
3193 /* The rhs must be an integer (or a float, but we don't support that yet */
3194 if (!IsClassInt (Expr2.Type)) {
3195 Error ("Invalid right operand for binary operator `%s'", Op);
3196 /* Continue. Wrong code will be generated, but the compiler won't
3197 * break, so this is the best error recovery.
3201 /* Check for a constant expression */
3202 if (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2)) {
3203 /* The resulting value is a constant. If the generator has the NOPUSH
3204 * flag set, don't push the lhs.
3206 if (Gen->Flags & GEN_NOPUSH) {
3210 /* lhs is a pointer, scale rhs */
3211 Expr2.IVal *= CheckedSizeOf (Expr->Type+1);
3214 /* If the lhs is character sized, the operation may be later done
3217 if (CheckedSizeOf (Expr->Type) == SIZEOF_CHAR) {
3218 flags |= CF_FORCECHAR;
3221 /* Special handling for add and sub - some sort of a hack, but short code */
3222 if (Gen->Func == g_add) {
3223 g_inc (flags | CF_CONST, Expr2.IVal);
3224 } else if (Gen->Func == g_sub) {
3225 g_dec (flags | CF_CONST, Expr2.IVal);
3227 if (Expr2.IVal == 0) {
3228 /* Check for div by zero/mod by zero */
3229 if (Gen->Func == g_div) {
3230 Error ("Division by zero");
3231 } else if (Gen->Func == g_mod) {
3232 Error ("Modulo operation with zero");
3235 Gen->Func (flags | CF_CONST, Expr2.IVal);
3239 /* rhs is not constant. Load into the primary */
3240 LoadExpr (CF_NONE, &Expr2);
3242 /* lhs is a pointer, scale rhs */
3243 g_scale (TypeOf (Expr2.Type), CheckedSizeOf (Expr->Type+1));
3246 /* If the lhs is character sized, the operation may be later done
3249 if (CheckedSizeOf (Expr->Type) == SIZEOF_CHAR) {
3250 flags |= CF_FORCECHAR;
3253 /* Adjust the types of the operands if needed */
3254 Gen->Func (g_typeadjust (flags, TypeOf (Expr2.Type)), 0);
3257 ED_MakeRValExpr (Expr);
3262 static void addsubeq (const GenDesc* Gen, ExprDesc *Expr, const char* Op)
3263 /* Process the += and -= operators */
3271 /* We're currently only able to handle some adressing modes */
3272 if (ED_GetLoc (Expr) == E_LOC_EXPR || ED_GetLoc (Expr) == E_LOC_PRIMARY) {
3273 /* Use generic routine */
3274 opeq (Gen, Expr, Op);
3278 /* We must have an lvalue */
3279 if (ED_IsRVal (Expr)) {
3280 Error ("Invalid lvalue in assignment");
3284 /* The left side must not be const qualified */
3285 if (IsQualConst (Expr->Type)) {
3286 Error ("Assignment to const");
3289 /* There must be an integer or pointer on the left side */
3290 if (!IsClassInt (Expr->Type) && !IsTypePtr (Expr->Type)) {
3291 Error ("Invalid left operand type");
3292 /* Continue. Wrong code will be generated, but the compiler won't
3293 * break, so this is the best error recovery.
3297 /* Skip the operator */
3300 /* Check if we have a pointer expression and must scale rhs */
3301 MustScale = IsTypePtr (Expr->Type);
3303 /* Initialize the code generator flags */
3307 /* Evaluate the rhs. We expect an integer here, since float is not
3311 if (!IsClassInt (Expr2.Type)) {
3312 Error ("Invalid right operand for binary operator `%s'", Op);
3313 /* Continue. Wrong code will be generated, but the compiler won't
3314 * break, so this is the best error recovery.
3317 if (ED_IsConstAbs (&Expr2)) {
3318 /* The resulting value is a constant. Scale it. */
3320 Expr2.IVal *= CheckedSizeOf (Indirect (Expr->Type));
3325 /* Not constant, load into the primary */
3326 LoadExpr (CF_NONE, &Expr2);
3328 /* lhs is a pointer, scale rhs */
3329 g_scale (TypeOf (Expr2.Type), CheckedSizeOf (Indirect (Expr->Type)));
3333 /* Setup the code generator flags */
3334 lflags |= TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR;
3335 rflags |= TypeOf (Expr2.Type) | CF_FORCECHAR;
3337 /* Convert the type of the lhs to that of the rhs */
3338 g_typecast (lflags, rflags);
3340 /* Output apropriate code depending on the location */
3341 switch (ED_GetLoc (Expr)) {
3344 /* Absolute: numeric address or const */
3345 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3346 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3348 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3353 /* Global variable */
3354 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3355 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3357 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3363 /* Static variable or literal in the literal pool */
3364 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3365 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3367 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3371 case E_LOC_REGISTER:
3372 /* Register variable */
3373 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3374 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3376 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3381 /* Value on the stack */
3382 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3383 g_addeqlocal (lflags, Expr->IVal, Expr2.IVal);
3385 g_subeqlocal (lflags, Expr->IVal, Expr2.IVal);
3390 Internal ("Invalid location in Store(): 0x%04X", ED_GetLoc (Expr));
3393 /* Expression is a rvalue in the primary now */
3394 ED_MakeRValExpr (Expr);
3399 void hie1 (ExprDesc* Expr)
3400 /* Parse first level of expression hierarchy. */
3403 switch (CurTok.Tok) {
3409 case TOK_PLUS_ASSIGN:
3410 addsubeq (&GenPASGN, Expr, "+=");
3413 case TOK_MINUS_ASSIGN:
3414 addsubeq (&GenSASGN, Expr, "-=");
3417 case TOK_MUL_ASSIGN:
3418 opeq (&GenMASGN, Expr, "*=");
3421 case TOK_DIV_ASSIGN:
3422 opeq (&GenDASGN, Expr, "/=");
3425 case TOK_MOD_ASSIGN:
3426 opeq (&GenMOASGN, Expr, "%=");
3429 case TOK_SHL_ASSIGN:
3430 opeq (&GenSLASGN, Expr, "<<=");
3433 case TOK_SHR_ASSIGN:
3434 opeq (&GenSRASGN, Expr, ">>=");
3437 case TOK_AND_ASSIGN:
3438 opeq (&GenAASGN, Expr, "&=");
3441 case TOK_XOR_ASSIGN:
3442 opeq (&GenXOASGN, Expr, "^=");
3446 opeq (&GenOASGN, Expr, "|=");
3456 void hie0 (ExprDesc *Expr)
3457 /* Parse comma operator. */
3460 while (CurTok.Tok == TOK_COMMA) {
3468 int evalexpr (unsigned Flags, void (*Func) (ExprDesc*), ExprDesc* Expr)
3469 /* Will evaluate an expression via the given function. If the result is a
3470 * constant, 0 is returned and the value is put in the Expr struct. If the
3471 * result is not constant, LoadExpr is called to bring the value into the
3472 * primary register and 1 is returned.
3476 ExprWithCheck (Func, Expr);
3478 /* Check for a constant expression */
3479 if (ED_IsConstAbs (Expr)) {
3480 /* Constant expression */
3483 /* Not constant, load into the primary */
3484 LoadExpr (Flags, Expr);
3491 void Expression0 (ExprDesc* Expr)
3492 /* Evaluate an expression via hie0 and put the result into the primary register */
3494 ExprWithCheck (hie0, Expr);
3495 LoadExpr (CF_NONE, Expr);
3500 void ConstExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3501 /* Will evaluate an expression via the given function. If the result is not
3502 * a constant of some sort, a diagnostic will be printed, and the value is
3503 * replaced by a constant one to make sure there are no internal errors that
3504 * result from this input error.
3507 ExprWithCheck (Func, Expr);
3508 if (!ED_IsConst (Expr)) {
3509 Error ("Constant expression expected");
3510 /* To avoid any compiler errors, make the expression a valid const */
3511 ED_MakeConstAbsInt (Expr, 1);
3517 void BoolExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3518 /* Will evaluate an expression via the given function. If the result is not
3519 * something that may be evaluated in a boolean context, a diagnostic will be
3520 * printed, and the value is replaced by a constant one to make sure there
3521 * are no internal errors that result from this input error.
3524 ExprWithCheck (Func, Expr);
3525 if (!ED_IsBool (Expr)) {
3526 Error ("Boolean expression expected");
3527 /* To avoid any compiler errors, make the expression a valid int */
3528 ED_MakeConstAbsInt (Expr, 1);
3534 void ConstAbsIntExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3535 /* Will evaluate an expression via the given function. If the result is not
3536 * a constant numeric integer value, a diagnostic will be printed, and the
3537 * value is replaced by a constant one to make sure there are no internal
3538 * errors that result from this input error.
3541 ExprWithCheck (Func, Expr);
3542 if (!ED_IsConstAbsInt (Expr)) {
3543 Error ("Constant integer expression expected");
3544 /* To avoid any compiler errors, make the expression a valid const */
3545 ED_MakeConstAbsInt (Expr, 1);