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 static Type* promoteint (Type* lhst, Type* rhst)
125 /* In an expression with two ints, return the type of the result */
127 /* Rules for integer types:
128 * - If one of the values is a long, the result is long.
129 * - If one of the values is unsigned, the result is also unsigned.
130 * - Otherwise the result is an int.
132 if (IsTypeLong (lhst) || IsTypeLong (rhst)) {
133 if (IsSignUnsigned (lhst) || IsSignUnsigned (rhst)) {
139 if (IsSignUnsigned (lhst) || IsSignUnsigned (rhst)) {
149 static unsigned typeadjust (ExprDesc* lhs, ExprDesc* rhs, int NoPush)
150 /* Adjust the two values for a binary operation. lhs is expected on stack or
151 * to be constant, rhs is expected to be in the primary register or constant.
152 * The function will put the type of the result into lhs and return the
153 * code generator flags for the operation.
154 * If NoPush is given, it is assumed that the operation does not expect the lhs
155 * to be on stack, and that lhs is in a register instead.
156 * Beware: The function does only accept int types.
159 unsigned ltype, rtype;
162 /* Get the type strings */
163 Type* lhst = lhs->Type;
164 Type* rhst = rhs->Type;
166 /* Generate type adjustment code if needed */
167 ltype = TypeOf (lhst);
168 if (ED_IsLocAbs (lhs)) {
172 /* Value is in primary register*/
175 rtype = TypeOf (rhst);
176 if (ED_IsLocAbs (rhs)) {
179 flags = g_typeadjust (ltype, rtype);
181 /* Set the type of the result */
182 lhs->Type = promoteint (lhst, rhst);
184 /* Return the code generator flags */
190 static const GenDesc* FindGen (token_t Tok, const GenDesc* Table)
191 /* Find a token in a generator table */
193 while (Table->Tok != TOK_INVALID) {
194 if (Table->Tok == Tok) {
204 static int TypeSpecAhead (void)
205 /* Return true if some sort of type is waiting (helper for cast and sizeof()
211 /* There's a type waiting if:
213 * We have an opening paren, and
214 * a. the next token is a type, or
215 * b. the next token is a type qualifier, or
216 * c. the next token is a typedef'd type
218 return CurTok.Tok == TOK_LPAREN && (
219 TokIsType (&NextTok) ||
220 TokIsTypeQual (&NextTok) ||
221 (NextTok.Tok == TOK_IDENT &&
222 (Entry = FindSym (NextTok.Ident)) != 0 &&
223 SymIsTypeDef (Entry)));
228 void PushAddr (const ExprDesc* Expr)
229 /* If the expression contains an address that was somehow evaluated,
230 * push this address on the stack. This is a helper function for all
231 * sorts of implicit or explicit assignment functions where the lvalue
232 * must be saved if it's not constant, before evaluating the rhs.
235 /* Get the address on stack if needed */
236 if (ED_IsLocExpr (Expr)) {
237 /* Push the address (always a pointer) */
244 /*****************************************************************************/
246 /*****************************************************************************/
250 static unsigned FunctionParamList (FuncDesc* Func, int IsFastcall)
251 /* Parse a function parameter list and pass the parameters to the called
252 * function. Depending on several criteria this may be done by just pushing
253 * each parameter separately, or creating the parameter frame once and then
254 * storing into this frame.
255 * The function returns the size of the parameters pushed.
260 /* Initialize variables */
261 SymEntry* Param = 0; /* Keep gcc silent */
262 unsigned ParamSize = 0; /* Size of parameters pushed */
263 unsigned ParamCount = 0; /* Number of parameters pushed */
264 unsigned FrameSize = 0; /* Size of parameter frame */
265 unsigned FrameParams = 0; /* Number of params in frame */
266 int FrameOffs = 0; /* Offset into parameter frame */
267 int Ellipsis = 0; /* Function is variadic */
269 /* As an optimization, we may allocate the complete parameter frame at
270 * once instead of pushing each parameter as it comes. We may do that,
273 * - optimizations that increase code size are enabled (allocating the
274 * stack frame at once gives usually larger code).
275 * - we have more than one parameter to push (don't count the last param
276 * for __fastcall__ functions).
278 * The FrameSize variable will contain a value > 0 if storing into a frame
279 * (instead of pushing) is enabled.
282 if (IS_Get (&CodeSizeFactor) >= 200) {
284 /* Calculate the number and size of the parameters */
285 FrameParams = Func->ParamCount;
286 FrameSize = Func->ParamSize;
287 if (FrameParams > 0 && IsFastcall) {
288 /* Last parameter is not pushed */
289 FrameSize -= CheckedSizeOf (Func->LastParam->Type);
293 /* Do we have more than one parameter in the frame? */
294 if (FrameParams > 1) {
295 /* Okeydokey, setup the frame */
296 FrameOffs = StackPtr;
298 StackPtr -= FrameSize;
300 /* Don't use a preallocated frame */
305 /* Parse the actual parameter list */
306 while (CurTok.Tok != TOK_RPAREN) {
310 /* Count arguments */
313 /* Fetch the pointer to the next argument, check for too many args */
314 if (ParamCount <= Func->ParamCount) {
315 /* Beware: If there are parameters with identical names, they
316 * cannot go into the same symbol table, which means that in this
317 * case of errorneous input, the number of nodes in the symbol
318 * table and ParamCount are NOT equal. We have to handle this case
319 * below to avoid segmentation violations. Since we know that this
320 * problem can only occur if there is more than one parameter,
321 * we will just use the last one.
323 if (ParamCount == 1) {
325 Param = Func->SymTab->SymHead;
326 } else if (Param->NextSym != 0) {
328 Param = Param->NextSym;
329 CHECK ((Param->Flags & SC_PARAM) != 0);
331 } else if (!Ellipsis) {
332 /* Too many arguments. Do we have an open param list? */
333 if ((Func->Flags & FD_VARIADIC) == 0) {
334 /* End of param list reached, no ellipsis */
335 Error ("Too many arguments in function call");
337 /* Assume an ellipsis even in case of errors to avoid an error
338 * message for each other argument.
343 /* Evaluate the parameter expression */
346 /* If we don't have an argument spec, accept anything, otherwise
347 * convert the actual argument to the type needed.
352 /* Convert the argument to the parameter type if needed */
353 TypeConversion (&Expr, Param->Type);
355 /* If we have a prototype, chars may be pushed as chars */
356 Flags |= CF_FORCECHAR;
360 /* No prototype available. Convert array to "pointer to first
361 * element", and function to "pointer to function".
363 Expr.Type = PtrConversion (Expr.Type);
367 /* Load the value into the primary if it is not already there */
368 LoadExpr (Flags, &Expr);
370 /* Use the type of the argument for the push */
371 Flags |= TypeOf (Expr.Type);
373 /* If this is a fastcall function, don't push the last argument */
374 if (ParamCount != Func->ParamCount || !IsFastcall) {
375 unsigned ArgSize = sizeofarg (Flags);
377 /* We have the space already allocated, store in the frame.
378 * Because of invalid type conversions (that have produced an
379 * error before), we can end up here with a non aligned stack
380 * frame. Since no output will be generated anyway, handle
381 * these cases gracefully instead of doing a CHECK.
383 if (FrameSize >= ArgSize) {
384 FrameSize -= ArgSize;
388 FrameOffs -= ArgSize;
390 g_putlocal (Flags | CF_NOKEEP, FrameOffs, Expr.IVal);
392 /* Push the argument */
393 g_push (Flags, Expr.IVal);
396 /* Calculate total parameter size */
397 ParamSize += ArgSize;
400 /* Check for end of argument list */
401 if (CurTok.Tok != TOK_COMMA) {
407 /* Check if we had enough parameters */
408 if (ParamCount < Func->ParamCount) {
409 Error ("Too few arguments in function call");
412 /* The function returns the size of all parameters pushed onto the stack.
413 * However, if there are parameters missing (which is an error and was
414 * flagged by the compiler) AND a stack frame was preallocated above,
415 * we would loose track of the stackpointer and generate an internal error
416 * later. So we correct the value by the parameters that should have been
417 * pushed to avoid an internal compiler error. Since an error was
418 * generated before, no code will be output anyway.
420 return ParamSize + FrameSize;
425 static void FunctionCall (ExprDesc* Expr)
426 /* Perform a function call. */
428 FuncDesc* Func; /* Function descriptor */
429 int IsFuncPtr; /* Flag */
430 unsigned ParamSize; /* Number of parameter bytes */
432 int PtrOffs = 0; /* Offset of function pointer on stack */
433 int IsFastcall = 0; /* True if it's a fast call function */
434 int PtrOnStack = 0; /* True if a pointer copy is on stack */
436 /* Skip the left paren */
439 /* Get a pointer to the function descriptor from the type string */
440 Func = GetFuncDesc (Expr->Type);
442 /* Handle function pointers transparently */
443 IsFuncPtr = IsTypeFuncPtr (Expr->Type);
446 /* Check wether it's a fastcall function that has parameters */
447 IsFastcall = IsQualFastcall (Expr->Type + 1) && (Func->ParamCount > 0);
449 /* Things may be difficult, depending on where the function pointer
450 * resides. If the function pointer is an expression of some sort
451 * (not a local or global variable), we have to evaluate this
452 * expression now and save the result for later. Since calls to
453 * function pointers may be nested, we must save it onto the stack.
454 * For fastcall functions we do also need to place a copy of the
455 * pointer on stack, since we cannot use a/x.
457 PtrOnStack = IsFastcall || !ED_IsConst (Expr);
460 /* Not a global or local variable, or a fastcall function. Load
461 * the pointer into the primary and mark it as an expression.
463 LoadExpr (CF_NONE, Expr);
464 ED_MakeRValExpr (Expr);
466 /* Remember the code position */
469 /* Push the pointer onto the stack and remember the offset */
475 /* Check for known standard functions and inline them */
476 if (Expr->Name != 0) {
477 int StdFunc = FindStdFunc ((const char*) Expr->Name);
479 /* Inline this function */
480 HandleStdFunc (StdFunc, Func, Expr);
485 /* If we didn't inline the function, get fastcall info */
486 IsFastcall = IsQualFastcall (Expr->Type);
489 /* Parse the parameter list */
490 ParamSize = FunctionParamList (Func, IsFastcall);
492 /* We need the closing paren here */
495 /* Special handling for function pointers */
498 /* If the function is not a fastcall function, load the pointer to
499 * the function into the primary.
503 /* Not a fastcall function - we may use the primary */
505 /* If we have no parameters, the pointer is still in the
506 * primary. Remove the code to push it and correct the
509 if (ParamSize == 0) {
513 /* Load from the saved copy */
514 g_getlocal (CF_PTR, PtrOffs);
517 /* Load from original location */
518 LoadExpr (CF_NONE, Expr);
521 /* Call the function */
522 g_callind (TypeOf (Expr->Type+1), ParamSize, PtrOffs);
526 /* Fastcall function. We cannot use the primary for the function
527 * pointer and must therefore use an offset to the stack location.
528 * Since fastcall functions may never be variadic, we can use the
529 * index register for this purpose.
531 g_callind (CF_LOCAL, ParamSize, PtrOffs);
534 /* If we have a pointer on stack, remove it */
536 g_space (- (int) sizeofarg (CF_PTR));
545 /* Normal function */
546 g_call (TypeOf (Expr->Type), (const char*) Expr->Name, ParamSize);
550 /* The function result is an rvalue in the primary register */
551 ED_MakeRValExpr (Expr);
552 Expr->Type = GetFuncReturn (Expr->Type);
557 static void Primary (ExprDesc* E)
558 /* This is the lowest level of the expression parser. */
562 /* Initialize fields in the expression stucture */
565 /* Character and integer constants. */
566 if (CurTok.Tok == TOK_ICONST || CurTok.Tok == TOK_CCONST) {
567 E->IVal = CurTok.IVal;
568 E->Flags = E_LOC_ABS | E_RTYPE_RVAL;
569 E->Type = CurTok.Type;
574 /* Floating point constant */
575 if (CurTok.Tok == TOK_FCONST) {
576 E->FVal = CurTok.FVal;
577 E->Flags = E_LOC_ABS | E_RTYPE_RVAL;
578 E->Type = CurTok.Type;
583 /* Process parenthesized subexpression by calling the whole parser
586 if (CurTok.Tok == TOK_LPAREN) {
593 /* If we run into an identifier in preprocessing mode, we assume that this
594 * is an undefined macro and replace it by a constant value of zero.
596 if (Preprocessing && CurTok.Tok == TOK_IDENT) {
598 ED_MakeConstAbsInt (E, 0);
602 /* All others may only be used if the expression evaluation is not called
603 * recursively by the preprocessor.
606 /* Illegal expression in PP mode */
607 Error ("Preprocessor expression expected");
608 ED_MakeConstAbsInt (E, 1);
612 switch (CurTok.Tok) {
615 /* Identifier. Get a pointer to the symbol table entry */
616 Sym = E->Sym = FindSym (CurTok.Ident);
618 /* Is the symbol known? */
621 /* We found the symbol - skip the name token */
624 /* Check for illegal symbol types */
625 CHECK ((Sym->Flags & SC_LABEL) != SC_LABEL);
626 if (Sym->Flags & SC_TYPE) {
627 /* Cannot use type symbols */
628 Error ("Variable identifier expected");
629 /* Assume an int type to make E valid */
630 E->Flags = E_LOC_STACK | E_RTYPE_LVAL;
635 /* Mark the symbol as referenced */
636 Sym->Flags |= SC_REF;
638 /* The expression type is the symbol type */
641 /* Check for legal symbol types */
642 if ((Sym->Flags & SC_CONST) == SC_CONST) {
643 /* Enum or some other numeric constant */
644 E->Flags = E_LOC_ABS | E_RTYPE_RVAL;
645 E->IVal = Sym->V.ConstVal;
646 } else if ((Sym->Flags & SC_FUNC) == SC_FUNC) {
648 E->Flags = E_LOC_GLOBAL | E_RTYPE_LVAL;
649 E->Name = (unsigned long) Sym->Name;
650 } else if ((Sym->Flags & SC_AUTO) == SC_AUTO) {
651 /* Local variable. If this is a parameter for a variadic
652 * function, we have to add some address calculations, and the
653 * address is not const.
655 if ((Sym->Flags & SC_PARAM) == SC_PARAM && F_IsVariadic (CurrentFunc)) {
656 /* Variadic parameter */
657 g_leavariadic (Sym->V.Offs - F_GetParamSize (CurrentFunc));
658 E->Flags = E_LOC_EXPR | E_RTYPE_LVAL;
660 /* Normal parameter */
661 E->Flags = E_LOC_STACK | E_RTYPE_LVAL;
662 E->IVal = Sym->V.Offs;
664 } else if ((Sym->Flags & SC_REGISTER) == SC_REGISTER) {
665 /* Register variable, zero page based */
666 E->Flags = E_LOC_REGISTER | E_RTYPE_LVAL;
667 E->Name = Sym->V.R.RegOffs;
668 } else if ((Sym->Flags & SC_STATIC) == SC_STATIC) {
669 /* Static variable */
670 if (Sym->Flags & (SC_EXTERN | SC_STORAGE)) {
671 E->Flags = E_LOC_GLOBAL | E_RTYPE_LVAL;
672 E->Name = (unsigned long) Sym->Name;
674 E->Flags = E_LOC_STATIC | E_RTYPE_LVAL;
675 E->Name = Sym->V.Label;
678 /* Local static variable */
679 E->Flags = E_LOC_STATIC | E_RTYPE_LVAL;
680 E->Name = Sym->V.Offs;
683 /* We've made all variables lvalues above. However, this is
684 * not always correct: An array is actually the address of its
685 * first element, which is a rvalue, and a function is a
686 * rvalue, too, because we cannot store anything in a function.
687 * So fix the flags depending on the type.
689 if (IsTypeArray (E->Type) || IsTypeFunc (E->Type)) {
695 /* We did not find the symbol. Remember the name, then skip it */
697 strcpy (Ident, CurTok.Ident);
700 /* IDENT is either an auto-declared function or an undefined variable. */
701 if (CurTok.Tok == TOK_LPAREN) {
702 /* C99 doesn't allow calls to undefined functions, so
703 * generate an error and otherwise a warning. Declare a
704 * function returning int. For that purpose, prepare a
705 * function signature for a function having an empty param
706 * list and returning int.
708 if (IS_Get (&Standard) >= STD_C99) {
709 Error ("Call to undefined function `%s'", Ident);
711 Warning ("Call to undefined function `%s'", Ident);
713 Sym = AddGlobalSym (Ident, GetImplicitFuncType(), SC_EXTERN | SC_REF | SC_FUNC);
715 E->Flags = E_LOC_GLOBAL | E_RTYPE_RVAL;
716 E->Name = (unsigned long) Sym->Name;
718 /* Undeclared Variable */
719 Sym = AddLocalSym (Ident, type_int, SC_AUTO | SC_REF, 0);
720 E->Flags = E_LOC_STACK | E_RTYPE_LVAL;
722 Error ("Undefined symbol: `%s'", Ident);
730 E->Type = GetCharArrayType (GetLiteralPoolOffs () - CurTok.IVal);
731 E->Flags = E_LOC_LITERAL | E_RTYPE_RVAL;
732 E->IVal = CurTok.IVal;
733 E->Name = LiteralPoolLabel;
740 E->Flags = E_LOC_EXPR | E_RTYPE_RVAL;
745 /* Register pseudo variable */
746 E->Type = type_uchar;
747 E->Flags = E_LOC_PRIMARY | E_RTYPE_LVAL;
752 /* Register pseudo variable */
754 E->Flags = E_LOC_PRIMARY | E_RTYPE_LVAL;
759 /* Register pseudo variable */
760 E->Type = type_ulong;
761 E->Flags = E_LOC_PRIMARY | E_RTYPE_LVAL;
766 /* Illegal primary. */
767 Error ("Expression expected");
768 ED_MakeConstAbsInt (E, 1);
775 static void ArrayRef (ExprDesc* Expr)
776 /* Handle an array reference. This function needs a rewrite. */
786 /* Skip the bracket */
789 /* Get the type of left side */
792 /* We can apply a special treatment for arrays that have a const base
793 * address. This is true for most arrays and will produce a lot better
794 * code. Check if this is a const base address.
796 ConstBaseAddr = ED_IsRVal (Expr) &&
797 (ED_IsLocConst (Expr) || ED_IsLocStack (Expr));
799 /* If we have a constant base, we delay the address fetch */
801 if (!ConstBaseAddr) {
802 /* Get a pointer to the array into the primary */
803 LoadExpr (CF_NONE, Expr);
805 /* Get the array pointer on stack. Do not push more than 16
806 * bit, even if this value is greater, since we cannot handle
807 * other than 16bit stuff when doing indexing.
813 /* TOS now contains ptr to array elements. Get the subscript. */
814 ExprWithCheck (hie0, &SubScript);
816 /* Check the types of array and subscript. We can either have a
817 * pointer/array to the left, in which case the subscript must be of an
818 * integer type, or we have an integer to the left, in which case the
819 * subscript must be a pointer/array.
820 * Since we do the necessary checking here, we can rely later on the
823 if (IsClassPtr (Expr->Type)) {
824 if (!IsClassInt (SubScript.Type)) {
825 Error ("Array subscript is not an integer");
826 /* To avoid any compiler errors, make the expression a valid int */
827 ED_MakeConstAbsInt (&SubScript, 0);
829 ElementType = Indirect (Expr->Type);
830 } else if (IsClassInt (Expr->Type)) {
831 if (!IsClassPtr (SubScript.Type)) {
832 Error ("Subscripted value is neither array nor pointer");
833 /* To avoid compiler errors, make the subscript a char[] at
836 ED_MakeConstAbs (&SubScript, 0, GetCharArrayType (1));
838 ElementType = Indirect (SubScript.Type);
840 Error ("Cannot subscript");
841 /* To avoid compiler errors, fake both the array and the subscript, so
842 * we can just proceed.
844 ED_MakeConstAbs (Expr, 0, GetCharArrayType (1));
845 ED_MakeConstAbsInt (&SubScript, 0);
846 ElementType = Indirect (Expr->Type);
849 /* Check if the subscript is constant absolute value */
850 if (ED_IsConstAbs (&SubScript)) {
852 /* The array subscript is a numeric constant. If we had pushed the
853 * array base address onto the stack before, we can remove this value,
854 * since we can generate expression+offset.
856 if (!ConstBaseAddr) {
859 /* Get an array pointer into the primary */
860 LoadExpr (CF_NONE, Expr);
863 if (IsClassPtr (Expr->Type)) {
865 /* Lhs is pointer/array. Scale the subscript value according to
868 SubScript.IVal *= CheckedSizeOf (ElementType);
870 /* Remove the address load code */
873 /* In case of an array, we can adjust the offset of the expression
874 * already in Expr. If the base address was a constant, we can even
875 * remove the code that loaded the address into the primary.
877 if (IsTypeArray (Expr->Type)) {
879 /* Adjust the offset */
880 Expr->IVal += SubScript.IVal;
884 /* It's a pointer, so we do have to load it into the primary
885 * first (if it's not already there).
887 if (ConstBaseAddr || ED_IsLVal (Expr)) {
888 LoadExpr (CF_NONE, Expr);
889 ED_MakeRValExpr (Expr);
893 Expr->IVal = SubScript.IVal;
898 /* Scale the rhs value according to the element type */
899 g_scale (TypeOf (tptr1), CheckedSizeOf (ElementType));
901 /* Add the subscript. Since arrays are indexed by integers,
902 * we will ignore the true type of the subscript here and
903 * use always an int. #### Use offset but beware of LoadExpr!
905 g_inc (CF_INT | CF_CONST, SubScript.IVal);
911 /* Array subscript is not constant. Load it into the primary */
913 LoadExpr (CF_NONE, &SubScript);
916 if (IsClassPtr (Expr->Type)) {
918 /* Indexing is based on unsigneds, so we will just use the integer
919 * portion of the index (which is in (e)ax, so there's no further
922 g_scale (CF_INT, CheckedSizeOf (ElementType));
926 /* Get the int value on top. If we come here, we're sure, both
927 * values are 16 bit (the first one was truncated if necessary
928 * and the second one is a pointer). Note: If ConstBaseAddr is
929 * true, we don't have a value on stack, so to "swap" both, just
930 * push the subscript.
934 LoadExpr (CF_NONE, Expr);
941 g_scale (TypeOf (tptr1), CheckedSizeOf (ElementType));
945 /* The offset is now in the primary register. It we didn't have a
946 * constant base address for the lhs, the lhs address is already
947 * on stack, and we must add the offset. If the base address was
948 * constant, we call special functions to add the address to the
951 if (!ConstBaseAddr) {
953 /* The array base address is on stack and the subscript is in the
960 /* The subscript is in the primary, and the array base address is
961 * in Expr. If the subscript has itself a constant address, it is
962 * often a better idea to reverse again the order of the
963 * evaluation. This will generate better code if the subscript is
964 * a byte sized variable. But beware: This is only possible if the
965 * subscript was not scaled, that is, if this was a byte array
968 if ((ED_IsLocConst (&SubScript) || ED_IsLocStack (&SubScript)) &&
969 CheckedSizeOf (ElementType) == SIZEOF_CHAR) {
973 /* Reverse the order of evaluation */
974 if (CheckedSizeOf (SubScript.Type) == SIZEOF_CHAR) {
981 /* Get a pointer to the array into the primary. */
982 LoadExpr (CF_NONE, Expr);
984 /* Add the variable */
985 if (ED_IsLocStack (&SubScript)) {
986 g_addlocal (Flags, SubScript.IVal);
988 Flags |= GlobalModeFlags (&SubScript);
989 g_addstatic (Flags, SubScript.Name, SubScript.IVal);
993 if (ED_IsLocAbs (Expr)) {
994 /* Constant numeric address. Just add it */
995 g_inc (CF_INT, Expr->IVal);
996 } else if (ED_IsLocStack (Expr)) {
997 /* Base address is a local variable address */
998 if (IsTypeArray (Expr->Type)) {
999 g_addaddr_local (CF_INT, Expr->IVal);
1001 g_addlocal (CF_PTR, Expr->IVal);
1004 /* Base address is a static variable address */
1005 unsigned Flags = CF_INT | GlobalModeFlags (Expr);
1006 if (ED_IsRVal (Expr)) {
1007 /* Add the address of the location */
1008 g_addaddr_static (Flags, Expr->Name, Expr->IVal);
1010 /* Add the contents of the location */
1011 g_addstatic (Flags, Expr->Name, Expr->IVal);
1019 /* The result is an expression in the primary */
1020 ED_MakeRValExpr (Expr);
1024 /* Result is of element type */
1025 Expr->Type = ElementType;
1027 /* An array element is actually a variable. So the rules for variables
1028 * with respect to the reference type apply: If it's an array, it is
1029 * a rvalue, otherwise it's an lvalue. (A function would also be a rvalue,
1030 * but an array cannot contain functions).
1032 if (IsTypeArray (Expr->Type)) {
1038 /* Consume the closing bracket */
1044 static void StructRef (ExprDesc* Expr)
1045 /* Process struct field after . or ->. */
1050 /* Skip the token and check for an identifier */
1052 if (CurTok.Tok != TOK_IDENT) {
1053 Error ("Identifier expected");
1054 Expr->Type = type_int;
1058 /* Get the symbol table entry and check for a struct field */
1059 strcpy (Ident, CurTok.Ident);
1061 Field = FindStructField (Expr->Type, Ident);
1063 Error ("Struct/union has no field named `%s'", Ident);
1064 Expr->Type = type_int;
1068 /* If we have a struct pointer that is an lvalue and not already in the
1069 * primary, load it now.
1071 if (ED_IsLVal (Expr) && IsTypePtr (Expr->Type)) {
1073 /* Load into the primary */
1074 LoadExpr (CF_NONE, Expr);
1076 /* Make it an lvalue expression */
1077 ED_MakeLValExpr (Expr);
1080 /* Set the struct field offset */
1081 Expr->IVal += Field->V.Offs;
1083 /* The type is now the type of the field */
1084 Expr->Type = Field->Type;
1086 /* An struct member is actually a variable. So the rules for variables
1087 * with respect to the reference type apply: If it's an array, it is
1088 * a rvalue, otherwise it's an lvalue. (A function would also be a rvalue,
1089 * but a struct field cannot be a function).
1091 if (IsTypeArray (Expr->Type)) {
1100 static void hie11 (ExprDesc *Expr)
1101 /* Handle compound types (structs and arrays) */
1103 /* Name value used in invalid function calls */
1104 static const char IllegalFunc[] = "illegal_function_call";
1106 /* Evaluate the lhs */
1109 /* Check for a rhs */
1110 while (CurTok.Tok == TOK_LBRACK || CurTok.Tok == TOK_LPAREN ||
1111 CurTok.Tok == TOK_DOT || CurTok.Tok == TOK_PTR_REF) {
1113 switch (CurTok.Tok) {
1116 /* Array reference */
1121 /* Function call. */
1122 if (!IsTypeFunc (Expr->Type) && !IsTypeFuncPtr (Expr->Type)) {
1123 /* Not a function */
1124 Error ("Illegal function call");
1125 /* Force the type to be a implicitly defined function, one
1126 * returning an int and taking any number of arguments.
1127 * Since we don't have a name, invent one.
1129 ED_MakeConstAbs (Expr, 0, GetImplicitFuncType ());
1130 Expr->Name = (long) IllegalFunc;
1132 /* Call the function */
1133 FunctionCall (Expr);
1137 if (!IsClassStruct (Expr->Type)) {
1138 Error ("Struct expected");
1144 /* If we have an array, convert it to pointer to first element */
1145 if (IsTypeArray (Expr->Type)) {
1146 Expr->Type = ArrayToPtr (Expr->Type);
1148 if (!IsClassPtr (Expr->Type) || !IsClassStruct (Indirect (Expr->Type))) {
1149 Error ("Struct pointer expected");
1155 Internal ("Invalid token in hie11: %d", CurTok.Tok);
1163 void Store (ExprDesc* Expr, const Type* StoreType)
1164 /* Store the primary register into the location denoted by Expr. If StoreType
1165 * is given, use this type when storing instead of Expr->Type. If StoreType
1166 * is NULL, use Expr->Type instead.
1171 /* If StoreType was not given, use Expr->Type instead */
1172 if (StoreType == 0) {
1173 StoreType = Expr->Type;
1176 /* Prepare the code generator flags */
1177 Flags = TypeOf (StoreType) | GlobalModeFlags (Expr);
1179 /* Do the store depending on the location */
1180 switch (ED_GetLoc (Expr)) {
1183 /* Absolute: numeric address or const */
1184 g_putstatic (Flags, Expr->IVal, 0);
1188 /* Global variable */
1189 g_putstatic (Flags, Expr->Name, Expr->IVal);
1194 /* Static variable or literal in the literal pool */
1195 g_putstatic (Flags, Expr->Name, Expr->IVal);
1198 case E_LOC_REGISTER:
1199 /* Register variable */
1200 g_putstatic (Flags, Expr->Name, Expr->IVal);
1204 /* Value on the stack */
1205 g_putlocal (Flags, Expr->IVal, 0);
1209 /* The primary register (value is already there) */
1213 /* An expression in the primary register */
1214 g_putind (Flags, Expr->IVal);
1218 Internal ("Invalid location in Store(): 0x%04X", ED_GetLoc (Expr));
1221 /* Assume that each one of the stores will invalidate CC */
1222 ED_MarkAsUntested (Expr);
1227 static void PreInc (ExprDesc* Expr)
1228 /* Handle the preincrement operators */
1233 /* Skip the operator token */
1236 /* Evaluate the expression and check that it is an lvalue */
1238 if (!ED_IsLVal (Expr)) {
1239 Error ("Invalid lvalue");
1243 /* We cannot modify const values */
1244 if (IsQualConst (Expr->Type)) {
1245 Error ("Increment of read-only variable");
1248 /* Get the data type */
1249 Flags = TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR | CF_CONST;
1251 /* Get the increment value in bytes */
1252 Val = IsTypePtr (Expr->Type)? CheckedPSizeOf (Expr->Type) : 1;
1254 /* Check the location of the data */
1255 switch (ED_GetLoc (Expr)) {
1258 /* Absolute: numeric address or const */
1259 g_addeqstatic (Flags, Expr->IVal, 0, Val);
1263 /* Global variable */
1264 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1269 /* Static variable or literal in the literal pool */
1270 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1273 case E_LOC_REGISTER:
1274 /* Register variable */
1275 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1279 /* Value on the stack */
1280 g_addeqlocal (Flags, Expr->IVal, Val);
1284 /* The primary register */
1289 /* An expression in the primary register */
1290 g_addeqind (Flags, Expr->IVal, Val);
1294 Internal ("Invalid location in PreInc(): 0x%04X", ED_GetLoc (Expr));
1297 /* Result is an expression, no reference */
1298 ED_MakeRValExpr (Expr);
1303 static void PreDec (ExprDesc* Expr)
1304 /* Handle the predecrement operators */
1309 /* Skip the operator token */
1312 /* Evaluate the expression and check that it is an lvalue */
1314 if (!ED_IsLVal (Expr)) {
1315 Error ("Invalid lvalue");
1319 /* We cannot modify const values */
1320 if (IsQualConst (Expr->Type)) {
1321 Error ("Decrement of read-only variable");
1324 /* Get the data type */
1325 Flags = TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR | CF_CONST;
1327 /* Get the increment value in bytes */
1328 Val = IsTypePtr (Expr->Type)? CheckedPSizeOf (Expr->Type) : 1;
1330 /* Check the location of the data */
1331 switch (ED_GetLoc (Expr)) {
1334 /* Absolute: numeric address or const */
1335 g_subeqstatic (Flags, Expr->IVal, 0, Val);
1339 /* Global variable */
1340 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1345 /* Static variable or literal in the literal pool */
1346 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1349 case E_LOC_REGISTER:
1350 /* Register variable */
1351 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1355 /* Value on the stack */
1356 g_subeqlocal (Flags, Expr->IVal, Val);
1360 /* The primary register */
1365 /* An expression in the primary register */
1366 g_subeqind (Flags, Expr->IVal, Val);
1370 Internal ("Invalid location in PreDec(): 0x%04X", ED_GetLoc (Expr));
1373 /* Result is an expression, no reference */
1374 ED_MakeRValExpr (Expr);
1379 static void PostInc (ExprDesc* Expr)
1380 /* Handle the postincrement operator */
1386 /* The expression to increment must be an lvalue */
1387 if (!ED_IsLVal (Expr)) {
1388 Error ("Invalid lvalue");
1392 /* We cannot modify const values */
1393 if (IsQualConst (Expr->Type)) {
1394 Error ("Increment of read-only variable");
1397 /* Get the data type */
1398 Flags = TypeOf (Expr->Type);
1400 /* Push the address if needed */
1403 /* Fetch the value and save it (since it's the result of the expression) */
1404 LoadExpr (CF_NONE, Expr);
1405 g_save (Flags | CF_FORCECHAR);
1407 /* If we have a pointer expression, increment by the size of the type */
1408 if (IsTypePtr (Expr->Type)) {
1409 g_inc (Flags | CF_CONST | CF_FORCECHAR, CheckedSizeOf (Expr->Type + 1));
1411 g_inc (Flags | CF_CONST | CF_FORCECHAR, 1);
1414 /* Store the result back */
1417 /* Restore the original value in the primary register */
1418 g_restore (Flags | CF_FORCECHAR);
1420 /* The result is always an expression, no reference */
1421 ED_MakeRValExpr (Expr);
1426 static void PostDec (ExprDesc* Expr)
1427 /* Handle the postdecrement operator */
1433 /* The expression to increment must be an lvalue */
1434 if (!ED_IsLVal (Expr)) {
1435 Error ("Invalid lvalue");
1439 /* We cannot modify const values */
1440 if (IsQualConst (Expr->Type)) {
1441 Error ("Decrement of read-only variable");
1444 /* Get the data type */
1445 Flags = TypeOf (Expr->Type);
1447 /* Push the address if needed */
1450 /* Fetch the value and save it (since it's the result of the expression) */
1451 LoadExpr (CF_NONE, Expr);
1452 g_save (Flags | CF_FORCECHAR);
1454 /* If we have a pointer expression, increment by the size of the type */
1455 if (IsTypePtr (Expr->Type)) {
1456 g_dec (Flags | CF_CONST | CF_FORCECHAR, CheckedSizeOf (Expr->Type + 1));
1458 g_dec (Flags | CF_CONST | CF_FORCECHAR, 1);
1461 /* Store the result back */
1464 /* Restore the original value in the primary register */
1465 g_restore (Flags | CF_FORCECHAR);
1467 /* The result is always an expression, no reference */
1468 ED_MakeRValExpr (Expr);
1473 static void UnaryOp (ExprDesc* Expr)
1474 /* Handle unary -/+ and ~ */
1478 /* Remember the operator token and skip it */
1479 token_t Tok = CurTok.Tok;
1482 /* Get the expression */
1485 /* We can only handle integer types */
1486 if (!IsClassInt (Expr->Type)) {
1487 Error ("Argument must have integer type");
1488 ED_MakeConstAbsInt (Expr, 1);
1491 /* Check for a constant expression */
1492 if (ED_IsConstAbs (Expr)) {
1493 /* Value is constant */
1495 case TOK_MINUS: Expr->IVal = -Expr->IVal; break;
1496 case TOK_PLUS: break;
1497 case TOK_COMP: Expr->IVal = ~Expr->IVal; break;
1498 default: Internal ("Unexpected token: %d", Tok);
1501 /* Value is not constant */
1502 LoadExpr (CF_NONE, Expr);
1504 /* Get the type of the expression */
1505 Flags = TypeOf (Expr->Type);
1507 /* Handle the operation */
1509 case TOK_MINUS: g_neg (Flags); break;
1510 case TOK_PLUS: break;
1511 case TOK_COMP: g_com (Flags); break;
1512 default: Internal ("Unexpected token: %d", Tok);
1515 /* The result is a rvalue in the primary */
1516 ED_MakeRValExpr (Expr);
1522 void hie10 (ExprDesc* Expr)
1523 /* Handle ++, --, !, unary - etc. */
1527 switch (CurTok.Tok) {
1545 if (evalexpr (CF_NONE, hie10, Expr) == 0) {
1546 /* Constant expression */
1547 Expr->IVal = !Expr->IVal;
1549 g_bneg (TypeOf (Expr->Type));
1550 ED_MakeRValExpr (Expr);
1551 ED_TestDone (Expr); /* bneg will set cc */
1557 ExprWithCheck (hie10, Expr);
1558 if (ED_IsLVal (Expr) || !(ED_IsLocConst (Expr) || ED_IsLocStack (Expr))) {
1559 /* Not a const, load it into the primary and make it a
1562 LoadExpr (CF_NONE, Expr);
1563 ED_MakeRValExpr (Expr);
1565 /* If the expression is already a pointer to function, the
1566 * additional dereferencing operator must be ignored.
1568 if (IsTypeFuncPtr (Expr->Type)) {
1569 /* Expression not storable */
1572 if (IsClassPtr (Expr->Type)) {
1573 Expr->Type = Indirect (Expr->Type);
1575 Error ("Illegal indirection");
1577 /* The * operator yields an lvalue */
1584 ExprWithCheck (hie10, Expr);
1585 /* The & operator may be applied to any lvalue, and it may be
1586 * applied to functions, even if they're no lvalues.
1588 if (ED_IsRVal (Expr) && !IsTypeFunc (Expr->Type) && !IsTypeArray (Expr->Type)) {
1589 Error ("Illegal address");
1591 Expr->Type = PointerTo (Expr->Type);
1592 /* The & operator yields an rvalue */
1599 if (TypeSpecAhead ()) {
1602 Size = CheckedSizeOf (ParseType (T));
1605 /* Remember the output queue pointer */
1609 Size = CheckedSizeOf (Expr->Type);
1610 /* Remove any generated code */
1613 ED_MakeConstAbs (Expr, Size, type_size_t);
1614 ED_MarkAsUntested (Expr);
1618 if (TypeSpecAhead ()) {
1628 /* Handle post increment */
1629 switch (CurTok.Tok) {
1630 case TOK_INC: PostInc (Expr); break;
1631 case TOK_DEC: PostDec (Expr); break;
1642 static void hie_internal (const GenDesc* Ops, /* List of generators */
1644 void (*hienext) (ExprDesc*),
1646 /* Helper function */
1652 token_t Tok; /* The operator token */
1653 unsigned ltype, type;
1654 int rconst; /* Operand is a constant */
1660 while ((Gen = FindGen (CurTok.Tok, Ops)) != 0) {
1662 /* Tell the caller that we handled it's ops */
1665 /* All operators that call this function expect an int on the lhs */
1666 if (!IsClassInt (Expr->Type)) {
1667 Error ("Integer expression expected");
1668 /* To avoid further errors, make Expr a valid int expression */
1669 ED_MakeConstAbsInt (Expr, 1);
1672 /* Remember the operator token, then skip it */
1676 /* Get the lhs on stack */
1677 GetCodePos (&Mark1);
1678 ltype = TypeOf (Expr->Type);
1679 if (ED_IsConstAbs (Expr)) {
1680 /* Constant value */
1681 GetCodePos (&Mark2);
1682 g_push (ltype | CF_CONST, Expr->IVal);
1684 /* Value not constant */
1685 LoadExpr (CF_NONE, Expr);
1686 GetCodePos (&Mark2);
1690 /* Get the right hand side */
1691 rconst = (evalexpr (CF_NONE, hienext, &Expr2) == 0);
1693 /* Check the type of the rhs */
1694 if (!IsClassInt (Expr2.Type)) {
1695 Error ("Integer expression expected");
1698 /* Check for const operands */
1699 if (ED_IsConstAbs (Expr) && rconst) {
1701 /* Both operands are constant, remove the generated code */
1702 RemoveCode (&Mark1);
1704 /* Get the type of the result */
1705 Expr->Type = promoteint (Expr->Type, Expr2.Type);
1707 /* Handle the op differently for signed and unsigned types */
1708 if (IsSignSigned (Expr->Type)) {
1710 /* Evaluate the result for signed operands */
1711 signed long Val1 = Expr->IVal;
1712 signed long Val2 = Expr2.IVal;
1715 Expr->IVal = (Val1 | Val2);
1718 Expr->IVal = (Val1 ^ Val2);
1721 Expr->IVal = (Val1 & Val2);
1724 Expr->IVal = (Val1 * Val2);
1728 Error ("Division by zero");
1729 Expr->IVal = 0x7FFFFFFF;
1731 Expr->IVal = (Val1 / Val2);
1736 Error ("Modulo operation with zero");
1739 Expr->IVal = (Val1 % Val2);
1743 Internal ("hie_internal: got token 0x%X\n", Tok);
1747 /* Evaluate the result for unsigned operands */
1748 unsigned long Val1 = Expr->IVal;
1749 unsigned long Val2 = Expr2.IVal;
1752 Expr->IVal = (Val1 | Val2);
1755 Expr->IVal = (Val1 ^ Val2);
1758 Expr->IVal = (Val1 & Val2);
1761 Expr->IVal = (Val1 * Val2);
1765 Error ("Division by zero");
1766 Expr->IVal = 0xFFFFFFFF;
1768 Expr->IVal = (Val1 / Val2);
1773 Error ("Modulo operation with zero");
1776 Expr->IVal = (Val1 % Val2);
1780 Internal ("hie_internal: got token 0x%X\n", Tok);
1786 /* If the right hand side is constant, and the generator function
1787 * expects the lhs in the primary, remove the push of the primary
1790 unsigned rtype = TypeOf (Expr2.Type);
1793 /* Second value is constant - check for div */
1796 if (Tok == TOK_DIV && Expr2.IVal == 0) {
1797 Error ("Division by zero");
1798 } else if (Tok == TOK_MOD && Expr2.IVal == 0) {
1799 Error ("Modulo operation with zero");
1801 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1802 RemoveCode (&Mark2);
1803 ltype |= CF_REG; /* Value is in register */
1807 /* Determine the type of the operation result. */
1808 type |= g_typeadjust (ltype, rtype);
1809 Expr->Type = promoteint (Expr->Type, Expr2.Type);
1812 Gen->Func (type, Expr2.IVal);
1814 /* We have a rvalue in the primary now */
1815 ED_MakeRValExpr (Expr);
1822 static void hie_compare (const GenDesc* Ops, /* List of generators */
1824 void (*hienext) (ExprDesc*))
1825 /* Helper function for the compare operators */
1831 token_t Tok; /* The operator token */
1833 int rconst; /* Operand is a constant */
1838 while ((Gen = FindGen (CurTok.Tok, Ops)) != 0) {
1840 /* Remember the operator token, then skip it */
1844 /* Get the lhs on stack */
1845 GetCodePos (&Mark1);
1846 ltype = TypeOf (Expr->Type);
1847 if (ED_IsConstAbs (Expr)) {
1848 /* Constant value */
1849 GetCodePos (&Mark2);
1850 g_push (ltype | CF_CONST, Expr->IVal);
1852 /* Value not constant */
1853 LoadExpr (CF_NONE, Expr);
1854 GetCodePos (&Mark2);
1858 /* Get the right hand side */
1859 rconst = (evalexpr (CF_NONE, hienext, &Expr2) == 0);
1861 /* Make sure, the types are compatible */
1862 if (IsClassInt (Expr->Type)) {
1863 if (!IsClassInt (Expr2.Type) && !(IsClassPtr(Expr2.Type) && ED_IsNullPtr(Expr))) {
1864 Error ("Incompatible types");
1866 } else if (IsClassPtr (Expr->Type)) {
1867 if (IsClassPtr (Expr2.Type)) {
1868 /* Both pointers are allowed in comparison if they point to
1869 * the same type, or if one of them is a void pointer.
1871 Type* left = Indirect (Expr->Type);
1872 Type* right = Indirect (Expr2.Type);
1873 if (TypeCmp (left, right) < TC_EQUAL && left->C != T_VOID && right->C != T_VOID) {
1874 /* Incomatible pointers */
1875 Error ("Incompatible types");
1877 } else if (!ED_IsNullPtr (&Expr2)) {
1878 Error ("Incompatible types");
1882 /* Check for const operands */
1883 if (ED_IsConstAbs (Expr) && rconst) {
1885 /* Both operands are constant, remove the generated code */
1886 RemoveCode (&Mark1);
1888 /* Determine if this is a signed or unsigned compare */
1889 if (IsClassInt (Expr->Type) && IsSignSigned (Expr->Type) &&
1890 IsClassInt (Expr2.Type) && IsSignSigned (Expr2.Type)) {
1892 /* Evaluate the result for signed operands */
1893 signed long Val1 = Expr->IVal;
1894 signed long Val2 = Expr2.IVal;
1896 case TOK_EQ: Expr->IVal = (Val1 == Val2); break;
1897 case TOK_NE: Expr->IVal = (Val1 != Val2); break;
1898 case TOK_LT: Expr->IVal = (Val1 < Val2); break;
1899 case TOK_LE: Expr->IVal = (Val1 <= Val2); break;
1900 case TOK_GE: Expr->IVal = (Val1 >= Val2); break;
1901 case TOK_GT: Expr->IVal = (Val1 > Val2); break;
1902 default: Internal ("hie_compare: got token 0x%X\n", Tok);
1907 /* Evaluate the result for unsigned operands */
1908 unsigned long Val1 = Expr->IVal;
1909 unsigned long Val2 = Expr2.IVal;
1911 case TOK_EQ: Expr->IVal = (Val1 == Val2); break;
1912 case TOK_NE: Expr->IVal = (Val1 != Val2); break;
1913 case TOK_LT: Expr->IVal = (Val1 < Val2); break;
1914 case TOK_LE: Expr->IVal = (Val1 <= Val2); break;
1915 case TOK_GE: Expr->IVal = (Val1 >= Val2); break;
1916 case TOK_GT: Expr->IVal = (Val1 > Val2); break;
1917 default: Internal ("hie_compare: got token 0x%X\n", Tok);
1923 /* If the right hand side is constant, and the generator function
1924 * expects the lhs in the primary, remove the push of the primary
1930 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1931 RemoveCode (&Mark2);
1932 ltype |= CF_REG; /* Value is in register */
1936 /* Determine the type of the operation result. If the left
1937 * operand is of type char and the right is a constant, or
1938 * if both operands are of type char, we will encode the
1939 * operation as char operation. Otherwise the default
1940 * promotions are used.
1942 if (IsTypeChar (Expr->Type) && (IsTypeChar (Expr2.Type) || rconst)) {
1944 if (IsSignUnsigned (Expr->Type) || IsSignUnsigned (Expr2.Type)) {
1945 flags |= CF_UNSIGNED;
1948 flags |= CF_FORCECHAR;
1951 unsigned rtype = TypeOf (Expr2.Type) | (flags & CF_CONST);
1952 flags |= g_typeadjust (ltype, rtype);
1956 Gen->Func (flags, Expr2.IVal);
1958 /* The result is an rvalue in the primary */
1959 ED_MakeRValExpr (Expr);
1962 /* Result type is always int */
1963 Expr->Type = type_int;
1965 /* Condition codes are set */
1972 static void hie9 (ExprDesc *Expr)
1973 /* Process * and / operators. */
1975 static const GenDesc hie9_ops[] = {
1976 { TOK_STAR, GEN_NOPUSH, g_mul },
1977 { TOK_DIV, GEN_NOPUSH, g_div },
1978 { TOK_MOD, GEN_NOPUSH, g_mod },
1979 { TOK_INVALID, 0, 0 }
1983 hie_internal (hie9_ops, Expr, hie10, &UsedGen);
1988 static void parseadd (ExprDesc* Expr)
1989 /* Parse an expression with the binary plus operator. Expr contains the
1990 * unprocessed left hand side of the expression and will contain the
1991 * result of the expression on return.
1995 unsigned flags; /* Operation flags */
1996 CodeMark Mark; /* Remember code position */
1997 Type* lhst; /* Type of left hand side */
1998 Type* rhst; /* Type of right hand side */
2001 /* Skip the PLUS token */
2004 /* Get the left hand side type, initialize operation flags */
2008 /* Check for constness on both sides */
2009 if (ED_IsConst (Expr)) {
2011 /* The left hand side is a constant of some sort. Good. Get rhs */
2013 if (ED_IsConstAbs (&Expr2)) {
2015 /* Right hand side is a constant numeric value. Get the rhs type */
2018 /* Both expressions are constants. Check for pointer arithmetic */
2019 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2020 /* Left is pointer, right is int, must scale rhs */
2021 Expr->IVal += Expr2.IVal * CheckedPSizeOf (lhst);
2022 /* Result type is a pointer */
2023 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2024 /* Left is int, right is pointer, must scale lhs */
2025 Expr->IVal = Expr->IVal * CheckedPSizeOf (rhst) + Expr2.IVal;
2026 /* Result type is a pointer */
2027 Expr->Type = Expr2.Type;
2028 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2029 /* Integer addition */
2030 Expr->IVal += Expr2.IVal;
2031 typeadjust (Expr, &Expr2, 1);
2034 Error ("Invalid operands for binary operator `+'");
2039 /* lhs is a constant and rhs is not constant. Load rhs into
2042 LoadExpr (CF_NONE, &Expr2);
2044 /* Beware: The check above (for lhs) lets not only pass numeric
2045 * constants, but also constant addresses (labels), maybe even
2046 * with an offset. We have to check for that here.
2049 /* First, get the rhs type. */
2053 if (ED_IsLocAbs (Expr)) {
2054 /* A numerical constant */
2057 /* Constant address label */
2058 flags |= GlobalModeFlags (Expr) | CF_CONSTADDR;
2061 /* Check for pointer arithmetic */
2062 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2063 /* Left is pointer, right is int, must scale rhs */
2064 g_scale (CF_INT, CheckedPSizeOf (lhst));
2065 /* Operate on pointers, result type is a pointer */
2067 /* Generate the code for the add */
2068 if (ED_GetLoc (Expr) == E_LOC_ABS) {
2069 /* Numeric constant */
2070 g_inc (flags, Expr->IVal);
2072 /* Constant address */
2073 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2075 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2077 /* Left is int, right is pointer, must scale lhs. */
2078 unsigned ScaleFactor = CheckedPSizeOf (rhst);
2080 /* Operate on pointers, result type is a pointer */
2082 Expr->Type = Expr2.Type;
2084 /* Since we do already have rhs in the primary, if lhs is
2085 * not a numeric constant, and the scale factor is not one
2086 * (no scaling), we must take the long way over the stack.
2088 if (ED_IsLocAbs (Expr)) {
2089 /* Numeric constant, scale lhs */
2090 Expr->IVal *= ScaleFactor;
2091 /* Generate the code for the add */
2092 g_inc (flags, Expr->IVal);
2093 } else if (ScaleFactor == 1) {
2094 /* Constant address but no need to scale */
2095 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2097 /* Constant address that must be scaled */
2098 g_push (TypeOf (Expr2.Type), 0); /* rhs --> stack */
2099 g_getimmed (flags, Expr->Name, Expr->IVal);
2100 g_scale (CF_PTR, ScaleFactor);
2103 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2104 /* Integer addition */
2105 flags |= typeadjust (Expr, &Expr2, 1);
2106 /* Generate the code for the add */
2107 if (ED_IsLocAbs (Expr)) {
2108 /* Numeric constant */
2109 g_inc (flags, Expr->IVal);
2111 /* Constant address */
2112 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2116 Error ("Invalid operands for binary operator `+'");
2120 /* Result is a rvalue in primary register */
2121 ED_MakeRValExpr (Expr);
2126 /* Left hand side is not constant. Get the value onto the stack. */
2127 LoadExpr (CF_NONE, Expr); /* --> primary register */
2129 g_push (TypeOf (Expr->Type), 0); /* --> stack */
2131 /* Evaluate the rhs */
2132 if (evalexpr (CF_NONE, hie9, &Expr2) == 0) {
2134 /* Right hand side is a constant. Get the rhs type */
2137 /* Remove pushed value from stack */
2140 /* Check for pointer arithmetic */
2141 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2142 /* Left is pointer, right is int, must scale rhs */
2143 Expr2.IVal *= CheckedPSizeOf (lhst);
2144 /* Operate on pointers, result type is a pointer */
2146 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2147 /* Left is int, right is pointer, must scale lhs (ptr only) */
2148 g_scale (CF_INT | CF_CONST, CheckedPSizeOf (rhst));
2149 /* Operate on pointers, result type is a pointer */
2151 Expr->Type = Expr2.Type;
2152 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2153 /* Integer addition */
2154 flags = typeadjust (Expr, &Expr2, 1);
2157 Error ("Invalid operands for binary operator `+'");
2161 /* Generate code for the add */
2162 g_inc (flags | CF_CONST, Expr2.IVal);
2166 /* lhs and rhs are not constant. Get the rhs type. */
2169 /* Check for pointer arithmetic */
2170 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2171 /* Left is pointer, right is int, must scale rhs */
2172 g_scale (CF_INT, CheckedPSizeOf (lhst));
2173 /* Operate on pointers, result type is a pointer */
2175 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2176 /* Left is int, right is pointer, must scale lhs */
2177 g_tosint (TypeOf (rhst)); /* Make sure, TOS is int */
2178 g_swap (CF_INT); /* Swap TOS and primary */
2179 g_scale (CF_INT, CheckedPSizeOf (rhst));
2180 /* Operate on pointers, result type is a pointer */
2182 Expr->Type = Expr2.Type;
2183 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2184 /* Integer addition. Note: Result is never constant.
2185 * Problem here is that typeadjust does not know if the
2186 * variable is an rvalue or lvalue, so if both operands
2187 * are dereferenced constant numeric addresses, typeadjust
2188 * thinks the operation works on constants. Removing
2189 * CF_CONST here means handling the symptoms, however, the
2190 * whole parser is such a mess that I fear to break anything
2191 * when trying to apply another solution.
2193 flags = typeadjust (Expr, &Expr2, 0) & ~CF_CONST;
2196 Error ("Invalid operands for binary operator `+'");
2200 /* Generate code for the add */
2205 /* Result is a rvalue in primary register */
2206 ED_MakeRValExpr (Expr);
2209 /* Condition codes not set */
2210 ED_MarkAsUntested (Expr);
2216 static void parsesub (ExprDesc* Expr)
2217 /* Parse an expression with the binary minus operator. Expr contains the
2218 * unprocessed left hand side of the expression and will contain the
2219 * result of the expression on return.
2223 unsigned flags; /* Operation flags */
2224 Type* lhst; /* Type of left hand side */
2225 Type* rhst; /* Type of right hand side */
2226 CodeMark Mark1; /* Save position of output queue */
2227 CodeMark Mark2; /* Another position in the queue */
2228 int rscale; /* Scale factor for the result */
2231 /* Skip the MINUS token */
2234 /* Get the left hand side type, initialize operation flags */
2236 rscale = 1; /* Scale by 1, that is, don't scale */
2238 /* Remember the output queue position, then bring the value onto the stack */
2239 GetCodePos (&Mark1);
2240 LoadExpr (CF_NONE, Expr); /* --> primary register */
2241 GetCodePos (&Mark2);
2242 g_push (TypeOf (lhst), 0); /* --> stack */
2244 /* Parse the right hand side */
2245 if (evalexpr (CF_NONE, hie9, &Expr2) == 0) {
2247 /* The right hand side is constant. Get the rhs type. */
2250 /* Check left hand side */
2251 if (ED_IsConstAbs (Expr)) {
2253 /* Both sides are constant, remove generated code */
2254 RemoveCode (&Mark1);
2256 /* Check for pointer arithmetic */
2257 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2258 /* Left is pointer, right is int, must scale rhs */
2259 Expr->IVal -= Expr2.IVal * CheckedPSizeOf (lhst);
2260 /* Operate on pointers, result type is a pointer */
2261 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2262 /* Left is pointer, right is pointer, must scale result */
2263 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2264 Error ("Incompatible pointer types");
2266 Expr->IVal = (Expr->IVal - Expr2.IVal) /
2267 CheckedPSizeOf (lhst);
2269 /* Operate on pointers, result type is an integer */
2270 Expr->Type = type_int;
2271 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2272 /* Integer subtraction */
2273 typeadjust (Expr, &Expr2, 1);
2274 Expr->IVal -= Expr2.IVal;
2277 Error ("Invalid operands for binary operator `-'");
2280 /* Result is constant, condition codes not set */
2281 ED_MarkAsUntested (Expr);
2285 /* Left hand side is not constant, right hand side is.
2286 * Remove pushed value from stack.
2288 RemoveCode (&Mark2);
2290 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2291 /* Left is pointer, right is int, must scale rhs */
2292 Expr2.IVal *= CheckedPSizeOf (lhst);
2293 /* Operate on pointers, result type is a pointer */
2295 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2296 /* Left is pointer, right is pointer, must scale result */
2297 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2298 Error ("Incompatible pointer types");
2300 rscale = CheckedPSizeOf (lhst);
2302 /* Operate on pointers, result type is an integer */
2304 Expr->Type = type_int;
2305 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2306 /* Integer subtraction */
2307 flags = typeadjust (Expr, &Expr2, 1);
2310 Error ("Invalid operands for binary operator `-'");
2314 /* Do the subtraction */
2315 g_dec (flags | CF_CONST, Expr2.IVal);
2317 /* If this was a pointer subtraction, we must scale the result */
2319 g_scale (flags, -rscale);
2322 /* Result is a rvalue in the primary register */
2323 ED_MakeRValExpr (Expr);
2324 ED_MarkAsUntested (Expr);
2330 /* Right hand side is not constant. Get the rhs type. */
2333 /* Check for pointer arithmetic */
2334 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2335 /* Left is pointer, right is int, must scale rhs */
2336 g_scale (CF_INT, CheckedPSizeOf (lhst));
2337 /* Operate on pointers, result type is a pointer */
2339 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2340 /* Left is pointer, right is pointer, must scale result */
2341 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2342 Error ("Incompatible pointer types");
2344 rscale = CheckedPSizeOf (lhst);
2346 /* Operate on pointers, result type is an integer */
2348 Expr->Type = type_int;
2349 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2350 /* Integer subtraction. If the left hand side descriptor says that
2351 * the lhs is const, we have to remove this mark, since this is no
2352 * longer true, lhs is on stack instead.
2354 if (ED_IsLocAbs (Expr)) {
2355 ED_MakeRValExpr (Expr);
2357 /* Adjust operand types */
2358 flags = typeadjust (Expr, &Expr2, 0);
2361 Error ("Invalid operands for binary operator `-'");
2365 /* Generate code for the sub (the & is a hack here) */
2366 g_sub (flags & ~CF_CONST, 0);
2368 /* If this was a pointer subtraction, we must scale the result */
2370 g_scale (flags, -rscale);
2373 /* Result is a rvalue in the primary register */
2374 ED_MakeRValExpr (Expr);
2375 ED_MarkAsUntested (Expr);
2381 void hie8 (ExprDesc* Expr)
2382 /* Process + and - binary operators. */
2385 while (CurTok.Tok == TOK_PLUS || CurTok.Tok == TOK_MINUS) {
2386 if (CurTok.Tok == TOK_PLUS) {
2396 static void hie6 (ExprDesc* Expr)
2397 /* Handle greater-than type comparators */
2399 static const GenDesc hie6_ops [] = {
2400 { TOK_LT, GEN_NOPUSH, g_lt },
2401 { TOK_LE, GEN_NOPUSH, g_le },
2402 { TOK_GE, GEN_NOPUSH, g_ge },
2403 { TOK_GT, GEN_NOPUSH, g_gt },
2404 { TOK_INVALID, 0, 0 }
2406 hie_compare (hie6_ops, Expr, ShiftExpr);
2411 static void hie5 (ExprDesc* Expr)
2412 /* Handle == and != */
2414 static const GenDesc hie5_ops[] = {
2415 { TOK_EQ, GEN_NOPUSH, g_eq },
2416 { TOK_NE, GEN_NOPUSH, g_ne },
2417 { TOK_INVALID, 0, 0 }
2419 hie_compare (hie5_ops, Expr, hie6);
2424 static void hie4 (ExprDesc* Expr)
2425 /* Handle & (bitwise and) */
2427 static const GenDesc hie4_ops[] = {
2428 { TOK_AND, GEN_NOPUSH, g_and },
2429 { TOK_INVALID, 0, 0 }
2433 hie_internal (hie4_ops, Expr, hie5, &UsedGen);
2438 static void hie3 (ExprDesc* Expr)
2439 /* Handle ^ (bitwise exclusive or) */
2441 static const GenDesc hie3_ops[] = {
2442 { TOK_XOR, GEN_NOPUSH, g_xor },
2443 { TOK_INVALID, 0, 0 }
2447 hie_internal (hie3_ops, Expr, hie4, &UsedGen);
2452 static void hie2 (ExprDesc* Expr)
2453 /* Handle | (bitwise or) */
2455 static const GenDesc hie2_ops[] = {
2456 { TOK_OR, GEN_NOPUSH, g_or },
2457 { TOK_INVALID, 0, 0 }
2461 hie_internal (hie2_ops, Expr, hie3, &UsedGen);
2466 static void hieAndPP (ExprDesc* Expr)
2467 /* Process "exp && exp" in preprocessor mode (that is, when the parser is
2468 * called recursively from the preprocessor.
2473 ConstAbsIntExpr (hie2, Expr);
2474 while (CurTok.Tok == TOK_BOOL_AND) {
2480 ConstAbsIntExpr (hie2, &Expr2);
2482 /* Combine the two */
2483 Expr->IVal = (Expr->IVal && Expr2.IVal);
2489 static void hieOrPP (ExprDesc *Expr)
2490 /* Process "exp || exp" in preprocessor mode (that is, when the parser is
2491 * called recursively from the preprocessor.
2496 ConstAbsIntExpr (hieAndPP, Expr);
2497 while (CurTok.Tok == TOK_BOOL_OR) {
2503 ConstAbsIntExpr (hieAndPP, &Expr2);
2505 /* Combine the two */
2506 Expr->IVal = (Expr->IVal || Expr2.IVal);
2512 static void hieAnd (ExprDesc* Expr, unsigned TrueLab, int* BoolOp)
2513 /* Process "exp && exp" */
2519 if (CurTok.Tok == TOK_BOOL_AND) {
2521 /* Tell our caller that we're evaluating a boolean */
2524 /* Get a label that we will use for false expressions */
2525 lab = GetLocalLabel ();
2527 /* If the expr hasn't set condition codes, set the force-test flag */
2528 if (!ED_IsTested (Expr)) {
2529 ED_MarkForTest (Expr);
2532 /* Load the value */
2533 LoadExpr (CF_FORCECHAR, Expr);
2535 /* Generate the jump */
2536 g_falsejump (CF_NONE, lab);
2538 /* Parse more boolean and's */
2539 while (CurTok.Tok == TOK_BOOL_AND) {
2546 if (!ED_IsTested (&Expr2)) {
2547 ED_MarkForTest (&Expr2);
2549 LoadExpr (CF_FORCECHAR, &Expr2);
2551 /* Do short circuit evaluation */
2552 if (CurTok.Tok == TOK_BOOL_AND) {
2553 g_falsejump (CF_NONE, lab);
2555 /* Last expression - will evaluate to true */
2556 g_truejump (CF_NONE, TrueLab);
2560 /* Define the false jump label here */
2561 g_defcodelabel (lab);
2563 /* The result is an rvalue in primary */
2564 ED_MakeRValExpr (Expr);
2565 ED_TestDone (Expr); /* Condition codes are set */
2571 static void hieOr (ExprDesc *Expr)
2572 /* Process "exp || exp". */
2575 int BoolOp = 0; /* Did we have a boolean op? */
2576 int AndOp; /* Did we have a && operation? */
2577 unsigned TrueLab; /* Jump to this label if true */
2581 TrueLab = GetLocalLabel ();
2583 /* Call the next level parser */
2584 hieAnd (Expr, TrueLab, &BoolOp);
2586 /* Any boolean or's? */
2587 if (CurTok.Tok == TOK_BOOL_OR) {
2589 /* If the expr hasn't set condition codes, set the force-test flag */
2590 if (!ED_IsTested (Expr)) {
2591 ED_MarkForTest (Expr);
2594 /* Get first expr */
2595 LoadExpr (CF_FORCECHAR, Expr);
2597 /* For each expression jump to TrueLab if true. Beware: If we
2598 * had && operators, the jump is already in place!
2601 g_truejump (CF_NONE, TrueLab);
2604 /* Remember that we had a boolean op */
2607 /* while there's more expr */
2608 while (CurTok.Tok == TOK_BOOL_OR) {
2615 hieAnd (&Expr2, TrueLab, &AndOp);
2616 if (!ED_IsTested (&Expr2)) {
2617 ED_MarkForTest (&Expr2);
2619 LoadExpr (CF_FORCECHAR, &Expr2);
2621 /* If there is more to come, add shortcut boolean eval. */
2622 g_truejump (CF_NONE, TrueLab);
2626 /* The result is an rvalue in primary */
2627 ED_MakeRValExpr (Expr);
2628 ED_TestDone (Expr); /* Condition codes are set */
2631 /* If we really had boolean ops, generate the end sequence */
2633 DoneLab = GetLocalLabel ();
2634 g_getimmed (CF_INT | CF_CONST, 0, 0); /* Load FALSE */
2635 g_falsejump (CF_NONE, DoneLab);
2636 g_defcodelabel (TrueLab);
2637 g_getimmed (CF_INT | CF_CONST, 1, 0); /* Load TRUE */
2638 g_defcodelabel (DoneLab);
2644 static void hieQuest (ExprDesc* Expr)
2645 /* Parse the ternary operator */
2649 ExprDesc Expr2; /* Expression 2 */
2650 ExprDesc Expr3; /* Expression 3 */
2651 int Expr2IsNULL; /* Expression 2 is a NULL pointer */
2652 int Expr3IsNULL; /* Expression 3 is a NULL pointer */
2653 Type* ResultType; /* Type of result */
2656 /* Call the lower level eval routine */
2657 if (Preprocessing) {
2663 /* Check if it's a ternary expression */
2664 if (CurTok.Tok == TOK_QUEST) {
2666 if (!ED_IsTested (Expr)) {
2667 /* Condition codes not set, request a test */
2668 ED_MarkForTest (Expr);
2670 LoadExpr (CF_NONE, Expr);
2671 labf = GetLocalLabel ();
2672 g_falsejump (CF_NONE, labf);
2674 /* Parse second expression. Remember for later if it is a NULL pointer
2675 * expression, then load it into the primary.
2677 ExprWithCheck (hie1, &Expr2);
2678 Expr2IsNULL = ED_IsNullPtr (&Expr2);
2679 if (!IsTypeVoid (Expr2.Type)) {
2680 /* Load it into the primary */
2681 LoadExpr (CF_NONE, &Expr2);
2682 ED_MakeRValExpr (&Expr2);
2684 labt = GetLocalLabel ();
2688 /* Jump here if the first expression was false */
2689 g_defcodelabel (labf);
2691 /* Parse second expression. Remember for later if it is a NULL pointer
2692 * expression, then load it into the primary.
2694 ExprWithCheck (hie1, &Expr3);
2695 Expr3IsNULL = ED_IsNullPtr (&Expr3);
2696 if (!IsTypeVoid (Expr3.Type)) {
2697 /* Load it into the primary */
2698 LoadExpr (CF_NONE, &Expr3);
2699 ED_MakeRValExpr (&Expr3);
2702 /* Check if any conversions are needed, if so, do them.
2703 * Conversion rules for ?: expression are:
2704 * - if both expressions are int expressions, default promotion
2705 * rules for ints apply.
2706 * - if both expressions are pointers of the same type, the
2707 * result of the expression is of this type.
2708 * - if one of the expressions is a pointer and the other is
2709 * a zero constant, the resulting type is that of the pointer
2711 * - if both expressions are void expressions, the result is of
2713 * - all other cases are flagged by an error.
2715 if (IsClassInt (Expr2.Type) && IsClassInt (Expr3.Type)) {
2717 /* Get common type */
2718 ResultType = promoteint (Expr2.Type, Expr3.Type);
2720 /* Convert the third expression to this type if needed */
2721 TypeConversion (&Expr3, ResultType);
2723 /* Setup a new label so that the expr3 code will jump around
2724 * the type cast code for expr2.
2726 labf = GetLocalLabel (); /* Get new label */
2727 g_jump (labf); /* Jump around code */
2729 /* The jump for expr2 goes here */
2730 g_defcodelabel (labt);
2732 /* Create the typecast code for expr2 */
2733 TypeConversion (&Expr2, ResultType);
2735 /* Jump here around the typecase code. */
2736 g_defcodelabel (labf);
2737 labt = 0; /* Mark other label as invalid */
2739 } else if (IsClassPtr (Expr2.Type) && IsClassPtr (Expr3.Type)) {
2740 /* Must point to same type */
2741 if (TypeCmp (Indirect (Expr2.Type), Indirect (Expr3.Type)) < TC_EQUAL) {
2742 Error ("Incompatible pointer types");
2744 /* Result has the common type */
2745 ResultType = Expr2.Type;
2746 } else if (IsClassPtr (Expr2.Type) && Expr3IsNULL) {
2747 /* Result type is pointer, no cast needed */
2748 ResultType = Expr2.Type;
2749 } else if (Expr2IsNULL && IsClassPtr (Expr3.Type)) {
2750 /* Result type is pointer, no cast needed */
2751 ResultType = Expr3.Type;
2752 } else if (IsTypeVoid (Expr2.Type) && IsTypeVoid (Expr3.Type)) {
2753 /* Result type is void */
2754 ResultType = Expr3.Type;
2756 Error ("Incompatible types");
2757 ResultType = Expr2.Type; /* Doesn't matter here */
2760 /* If we don't have the label defined until now, do it */
2762 g_defcodelabel (labt);
2765 /* Setup the target expression */
2766 ED_MakeRValExpr (Expr);
2767 Expr->Type = ResultType;
2773 static void opeq (const GenDesc* Gen, ExprDesc* Expr)
2774 /* Process "op=" operators. */
2781 /* op= can only be used with lvalues */
2782 if (!ED_IsLVal (Expr)) {
2783 Error ("Invalid lvalue in assignment");
2787 /* The left side must not be const qualified */
2788 if (IsQualConst (Expr->Type)) {
2789 Error ("Assignment to const");
2792 /* There must be an integer or pointer on the left side */
2793 if (!IsClassInt (Expr->Type) && !IsTypePtr (Expr->Type)) {
2794 Error ("Invalid left operand type");
2795 /* Continue. Wrong code will be generated, but the compiler won't
2796 * break, so this is the best error recovery.
2800 /* Skip the operator token */
2803 /* Determine the type of the lhs */
2804 flags = TypeOf (Expr->Type);
2805 MustScale = (Gen->Func == g_add || Gen->Func == g_sub) && IsTypePtr (Expr->Type);
2807 /* Get the lhs address on stack (if needed) */
2810 /* Fetch the lhs into the primary register if needed */
2811 LoadExpr (CF_NONE, Expr);
2813 /* Bring the lhs on stack */
2817 /* Evaluate the rhs */
2818 if (evalexpr (CF_NONE, hie1, &Expr2) == 0) {
2819 /* The resulting value is a constant. If the generator has the NOPUSH
2820 * flag set, don't push the lhs.
2822 if (Gen->Flags & GEN_NOPUSH) {
2826 /* lhs is a pointer, scale rhs */
2827 Expr2.IVal *= CheckedSizeOf (Expr->Type+1);
2830 /* If the lhs is character sized, the operation may be later done
2833 if (CheckedSizeOf (Expr->Type) == SIZEOF_CHAR) {
2834 flags |= CF_FORCECHAR;
2837 /* Special handling for add and sub - some sort of a hack, but short code */
2838 if (Gen->Func == g_add) {
2839 g_inc (flags | CF_CONST, Expr2.IVal);
2840 } else if (Gen->Func == g_sub) {
2841 g_dec (flags | CF_CONST, Expr2.IVal);
2843 Gen->Func (flags | CF_CONST, Expr2.IVal);
2846 /* rhs is not constant and already in the primary register */
2848 /* lhs is a pointer, scale rhs */
2849 g_scale (TypeOf (Expr2.Type), CheckedSizeOf (Expr->Type+1));
2852 /* If the lhs is character sized, the operation may be later done
2855 if (CheckedSizeOf (Expr->Type) == SIZEOF_CHAR) {
2856 flags |= CF_FORCECHAR;
2859 /* Adjust the types of the operands if needed */
2860 Gen->Func (g_typeadjust (flags, TypeOf (Expr2.Type)), 0);
2863 ED_MakeRValExpr (Expr);
2868 static void addsubeq (const GenDesc* Gen, ExprDesc *Expr)
2869 /* Process the += and -= operators */
2877 /* We're currently only able to handle some adressing modes */
2878 if (ED_GetLoc (Expr) == E_LOC_EXPR || ED_GetLoc (Expr) == E_LOC_PRIMARY) {
2879 /* Use generic routine */
2884 /* We must have an lvalue */
2885 if (ED_IsRVal (Expr)) {
2886 Error ("Invalid lvalue in assignment");
2890 /* The left side must not be const qualified */
2891 if (IsQualConst (Expr->Type)) {
2892 Error ("Assignment to const");
2895 /* There must be an integer or pointer on the left side */
2896 if (!IsClassInt (Expr->Type) && !IsTypePtr (Expr->Type)) {
2897 Error ("Invalid left operand type");
2898 /* Continue. Wrong code will be generated, but the compiler won't
2899 * break, so this is the best error recovery.
2903 /* Skip the operator */
2906 /* Check if we have a pointer expression and must scale rhs */
2907 MustScale = IsTypePtr (Expr->Type);
2909 /* Initialize the code generator flags */
2913 /* Evaluate the rhs */
2915 if (ED_IsConstAbs (&Expr2)) {
2916 /* The resulting value is a constant. Scale it. */
2918 Expr2.IVal *= CheckedSizeOf (Indirect (Expr->Type));
2923 /* Not constant, load into the primary */
2924 LoadExpr (CF_NONE, &Expr2);
2926 /* lhs is a pointer, scale rhs */
2927 g_scale (TypeOf (Expr2.Type), CheckedSizeOf (Indirect (Expr->Type)));
2931 /* Setup the code generator flags */
2932 lflags |= TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR;
2933 rflags |= TypeOf (Expr2.Type);
2935 /* Convert the type of the lhs to that of the rhs */
2936 g_typecast (lflags, rflags);
2938 /* Output apropriate code depending on the location */
2939 switch (ED_GetLoc (Expr)) {
2942 /* Absolute: numeric address or const */
2943 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2944 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
2946 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
2951 /* Global variable */
2952 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2953 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
2955 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
2961 /* Static variable or literal in the literal pool */
2962 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2963 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
2965 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
2969 case E_LOC_REGISTER:
2970 /* Register variable */
2971 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2972 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
2974 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
2979 /* Value on the stack */
2980 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2981 g_addeqlocal (lflags, Expr->IVal, Expr2.IVal);
2983 g_subeqlocal (lflags, Expr->IVal, Expr2.IVal);
2988 Internal ("Invalid location in Store(): 0x%04X", ED_GetLoc (Expr));
2991 /* Expression is a rvalue in the primary now */
2992 ED_MakeRValExpr (Expr);
2997 void hie1 (ExprDesc* Expr)
2998 /* Parse first level of expression hierarchy. */
3001 switch (CurTok.Tok) {
3007 case TOK_PLUS_ASSIGN:
3008 addsubeq (&GenPASGN, Expr);
3011 case TOK_MINUS_ASSIGN:
3012 addsubeq (&GenSASGN, Expr);
3015 case TOK_MUL_ASSIGN:
3016 opeq (&GenMASGN, Expr);
3019 case TOK_DIV_ASSIGN:
3020 opeq (&GenDASGN, Expr);
3023 case TOK_MOD_ASSIGN:
3024 opeq (&GenMOASGN, Expr);
3027 case TOK_SHL_ASSIGN:
3028 opeq (&GenSLASGN, Expr);
3031 case TOK_SHR_ASSIGN:
3032 opeq (&GenSRASGN, Expr);
3035 case TOK_AND_ASSIGN:
3036 opeq (&GenAASGN, Expr);
3039 case TOK_XOR_ASSIGN:
3040 opeq (&GenXOASGN, Expr);
3044 opeq (&GenOASGN, Expr);
3054 void hie0 (ExprDesc *Expr)
3055 /* Parse comma operator. */
3058 while (CurTok.Tok == TOK_COMMA) {
3066 int evalexpr (unsigned Flags, void (*Func) (ExprDesc*), ExprDesc* Expr)
3067 /* Will evaluate an expression via the given function. If the result is a
3068 * constant, 0 is returned and the value is put in the Expr struct. If the
3069 * result is not constant, LoadExpr is called to bring the value into the
3070 * primary register and 1 is returned.
3074 ExprWithCheck (Func, Expr);
3076 /* Check for a constant expression */
3077 if (ED_IsConstAbs (Expr)) {
3078 /* Constant expression */
3081 /* Not constant, load into the primary */
3082 LoadExpr (Flags, Expr);
3089 void Expression0 (ExprDesc* Expr)
3090 /* Evaluate an expression via hie0 and put the result into the primary register */
3092 ExprWithCheck (hie0, Expr);
3093 LoadExpr (CF_NONE, Expr);
3098 void ConstExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3099 /* Will evaluate an expression via the given function. If the result is not
3100 * a constant of some sort, a diagnostic will be printed, and the value is
3101 * replaced by a constant one to make sure there are no internal errors that
3102 * result from this input error.
3105 ExprWithCheck (Func, Expr);
3106 if (!ED_IsConst (Expr)) {
3107 Error ("Constant expression expected");
3108 /* To avoid any compiler errors, make the expression a valid const */
3109 ED_MakeConstAbsInt (Expr, 1);
3115 void BoolExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3116 /* Will evaluate an expression via the given function. If the result is not
3117 * something that may be evaluated in a boolean context, a diagnostic will be
3118 * printed, and the value is replaced by a constant one to make sure there
3119 * are no internal errors that result from this input error.
3122 ExprWithCheck (Func, Expr);
3123 if (!ED_IsBool (Expr)) {
3124 Error ("Boolean expression expected");
3125 /* To avoid any compiler errors, make the expression a valid int */
3126 ED_MakeConstAbsInt (Expr, 1);
3132 void ConstAbsIntExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3133 /* Will evaluate an expression via the given function. If the result is not
3134 * a constant numeric integer value, a diagnostic will be printed, and the
3135 * value is replaced by a constant one to make sure there are no internal
3136 * errors that result from this input error.
3139 ExprWithCheck (Func, Expr);
3140 if (!ED_IsConstAbsInt (Expr)) {
3141 Error ("Constant integer expression expected");
3142 /* To avoid any compiler errors, make the expression a valid const */
3143 ED_MakeConstAbsInt (Expr, 1);