3 * Ullrich von Bassewitz, 21.06.1998
13 #include "debugflag.h"
20 #include "assignment.h"
32 #include "shiftexpr.h"
43 /*****************************************************************************/
45 /*****************************************************************************/
49 /* Generator attributes */
50 #define GEN_NOPUSH 0x01 /* Don't push lhs */
52 /* Map a generator function and its attributes to a token */
54 token_t Tok; /* Token to map to */
55 unsigned Flags; /* Flags for generator function */
56 void (*Func) (unsigned, unsigned long); /* Generator func */
59 /* Descriptors for the operations */
60 static GenDesc GenPASGN = { TOK_PLUS_ASSIGN, GEN_NOPUSH, g_add };
61 static GenDesc GenSASGN = { TOK_MINUS_ASSIGN, GEN_NOPUSH, g_sub };
62 static GenDesc GenMASGN = { TOK_MUL_ASSIGN, GEN_NOPUSH, g_mul };
63 static GenDesc GenDASGN = { TOK_DIV_ASSIGN, GEN_NOPUSH, g_div };
64 static GenDesc GenMOASGN = { TOK_MOD_ASSIGN, GEN_NOPUSH, g_mod };
65 static GenDesc GenSLASGN = { TOK_SHL_ASSIGN, GEN_NOPUSH, g_asl };
66 static GenDesc GenSRASGN = { TOK_SHR_ASSIGN, GEN_NOPUSH, g_asr };
67 static GenDesc GenAASGN = { TOK_AND_ASSIGN, GEN_NOPUSH, g_and };
68 static GenDesc GenXOASGN = { TOK_XOR_ASSIGN, GEN_NOPUSH, g_xor };
69 static GenDesc GenOASGN = { TOK_OR_ASSIGN, GEN_NOPUSH, g_or };
73 /*****************************************************************************/
74 /* Helper functions */
75 /*****************************************************************************/
79 static unsigned GlobalModeFlags (const ExprDesc* Expr)
80 /* Return the addressing mode flags for the given expression */
82 switch (ED_GetLoc (Expr)) {
83 case E_LOC_ABS: return CF_ABSOLUTE;
84 case E_LOC_GLOBAL: return CF_EXTERNAL;
85 case E_LOC_STATIC: return CF_STATIC;
86 case E_LOC_REGISTER: return CF_REGVAR;
87 case E_LOC_STACK: return CF_NONE;
88 case E_LOC_PRIMARY: return CF_NONE;
89 case E_LOC_EXPR: return CF_NONE;
90 case E_LOC_LITERAL: return CF_STATIC; /* Same as static */
92 Internal ("GlobalModeFlags: Invalid location flags value: 0x%04X", Expr->Flags);
100 void ExprWithCheck (void (*Func) (ExprDesc*), ExprDesc* Expr)
101 /* Call an expression function with checks. */
103 /* Remember the stack pointer */
104 int OldSP = StackPtr;
106 /* Call the expression function */
109 /* Do some checks if code generation is still constistent */
110 if (StackPtr != OldSP) {
113 "Code generation messed up!\n"
114 "StackPtr is %d, should be %d",
117 Internal ("StackPtr is %d, should be %d\n", StackPtr, OldSP);
124 void MarkedExprWithCheck (void (*Func) (ExprDesc*), ExprDesc* Expr)
125 /* Call an expression function with checks and record start and end of the
131 ExprWithCheck (Func, Expr);
133 ED_SetCodeRange (Expr, &Start, &End);
138 static Type* promoteint (Type* lhst, Type* rhst)
139 /* In an expression with two ints, return the type of the result */
141 /* Rules for integer types:
142 * - If one of the values is a long, the result is long.
143 * - If one of the values is unsigned, the result is also unsigned.
144 * - Otherwise the result is an int.
146 if (IsTypeLong (lhst) || IsTypeLong (rhst)) {
147 if (IsSignUnsigned (lhst) || IsSignUnsigned (rhst)) {
153 if (IsSignUnsigned (lhst) || IsSignUnsigned (rhst)) {
163 static unsigned typeadjust (ExprDesc* lhs, ExprDesc* rhs, int NoPush)
164 /* Adjust the two values for a binary operation. lhs is expected on stack or
165 * to be constant, rhs is expected to be in the primary register or constant.
166 * The function will put the type of the result into lhs and return the
167 * code generator flags for the operation.
168 * If NoPush is given, it is assumed that the operation does not expect the lhs
169 * to be on stack, and that lhs is in a register instead.
170 * Beware: The function does only accept int types.
173 unsigned ltype, rtype;
176 /* Get the type strings */
177 Type* lhst = lhs->Type;
178 Type* rhst = rhs->Type;
180 /* Generate type adjustment code if needed */
181 ltype = TypeOf (lhst);
182 if (ED_IsLocAbs (lhs)) {
186 /* Value is in primary register*/
189 rtype = TypeOf (rhst);
190 if (ED_IsLocAbs (rhs)) {
193 flags = g_typeadjust (ltype, rtype);
195 /* Set the type of the result */
196 lhs->Type = promoteint (lhst, rhst);
198 /* Return the code generator flags */
204 static const GenDesc* FindGen (token_t Tok, const GenDesc* Table)
205 /* Find a token in a generator table */
207 while (Table->Tok != TOK_INVALID) {
208 if (Table->Tok == Tok) {
218 static int TypeSpecAhead (void)
219 /* Return true if some sort of type is waiting (helper for cast and sizeof()
225 /* There's a type waiting if:
227 * We have an opening paren, and
228 * a. the next token is a type, or
229 * b. the next token is a type qualifier, or
230 * c. the next token is a typedef'd type
232 return CurTok.Tok == TOK_LPAREN && (
233 TokIsType (&NextTok) ||
234 TokIsTypeQual (&NextTok) ||
235 (NextTok.Tok == TOK_IDENT &&
236 (Entry = FindSym (NextTok.Ident)) != 0 &&
237 SymIsTypeDef (Entry)));
242 void PushAddr (const ExprDesc* Expr)
243 /* If the expression contains an address that was somehow evaluated,
244 * push this address on the stack. This is a helper function for all
245 * sorts of implicit or explicit assignment functions where the lvalue
246 * must be saved if it's not constant, before evaluating the rhs.
249 /* Get the address on stack if needed */
250 if (ED_IsLocExpr (Expr)) {
251 /* Push the address (always a pointer) */
258 /*****************************************************************************/
260 /*****************************************************************************/
264 static unsigned FunctionParamList (FuncDesc* Func, int IsFastcall)
265 /* Parse a function parameter list and pass the parameters to the called
266 * function. Depending on several criteria this may be done by just pushing
267 * each parameter separately, or creating the parameter frame once and then
268 * storing into this frame.
269 * The function returns the size of the parameters pushed.
274 /* Initialize variables */
275 SymEntry* Param = 0; /* Keep gcc silent */
276 unsigned ParamSize = 0; /* Size of parameters pushed */
277 unsigned ParamCount = 0; /* Number of parameters pushed */
278 unsigned FrameSize = 0; /* Size of parameter frame */
279 unsigned FrameParams = 0; /* Number of params in frame */
280 int FrameOffs = 0; /* Offset into parameter frame */
281 int Ellipsis = 0; /* Function is variadic */
283 /* As an optimization, we may allocate the complete parameter frame at
284 * once instead of pushing each parameter as it comes. We may do that,
287 * - optimizations that increase code size are enabled (allocating the
288 * stack frame at once gives usually larger code).
289 * - we have more than one parameter to push (don't count the last param
290 * for __fastcall__ functions).
292 * The FrameSize variable will contain a value > 0 if storing into a frame
293 * (instead of pushing) is enabled.
296 if (IS_Get (&CodeSizeFactor) >= 200) {
298 /* Calculate the number and size of the parameters */
299 FrameParams = Func->ParamCount;
300 FrameSize = Func->ParamSize;
301 if (FrameParams > 0 && IsFastcall) {
302 /* Last parameter is not pushed */
303 FrameSize -= CheckedSizeOf (Func->LastParam->Type);
307 /* Do we have more than one parameter in the frame? */
308 if (FrameParams > 1) {
309 /* Okeydokey, setup the frame */
310 FrameOffs = StackPtr;
312 StackPtr -= FrameSize;
314 /* Don't use a preallocated frame */
319 /* Parse the actual parameter list */
320 while (CurTok.Tok != TOK_RPAREN) {
324 /* Count arguments */
327 /* Fetch the pointer to the next argument, check for too many args */
328 if (ParamCount <= Func->ParamCount) {
329 /* Beware: If there are parameters with identical names, they
330 * cannot go into the same symbol table, which means that in this
331 * case of errorneous input, the number of nodes in the symbol
332 * table and ParamCount are NOT equal. We have to handle this case
333 * below to avoid segmentation violations. Since we know that this
334 * problem can only occur if there is more than one parameter,
335 * we will just use the last one.
337 if (ParamCount == 1) {
339 Param = Func->SymTab->SymHead;
340 } else if (Param->NextSym != 0) {
342 Param = Param->NextSym;
343 CHECK ((Param->Flags & SC_PARAM) != 0);
345 } else if (!Ellipsis) {
346 /* Too many arguments. Do we have an open param list? */
347 if ((Func->Flags & FD_VARIADIC) == 0) {
348 /* End of param list reached, no ellipsis */
349 Error ("Too many arguments in function call");
351 /* Assume an ellipsis even in case of errors to avoid an error
352 * message for each other argument.
357 /* Evaluate the parameter expression */
360 /* If we don't have an argument spec, accept anything, otherwise
361 * convert the actual argument to the type needed.
366 /* Convert the argument to the parameter type if needed */
367 TypeConversion (&Expr, Param->Type);
369 /* If we have a prototype, chars may be pushed as chars */
370 Flags |= CF_FORCECHAR;
374 /* No prototype available. Convert array to "pointer to first
375 * element", and function to "pointer to function".
377 Expr.Type = PtrConversion (Expr.Type);
381 /* Load the value into the primary if it is not already there */
382 LoadExpr (Flags, &Expr);
384 /* Use the type of the argument for the push */
385 Flags |= TypeOf (Expr.Type);
387 /* If this is a fastcall function, don't push the last argument */
388 if (ParamCount != Func->ParamCount || !IsFastcall) {
389 unsigned ArgSize = sizeofarg (Flags);
391 /* We have the space already allocated, store in the frame.
392 * Because of invalid type conversions (that have produced an
393 * error before), we can end up here with a non aligned stack
394 * frame. Since no output will be generated anyway, handle
395 * these cases gracefully instead of doing a CHECK.
397 if (FrameSize >= ArgSize) {
398 FrameSize -= ArgSize;
402 FrameOffs -= ArgSize;
404 g_putlocal (Flags | CF_NOKEEP, FrameOffs, Expr.IVal);
406 /* Push the argument */
407 g_push (Flags, Expr.IVal);
410 /* Calculate total parameter size */
411 ParamSize += ArgSize;
414 /* Check for end of argument list */
415 if (CurTok.Tok != TOK_COMMA) {
421 /* Check if we had enough parameters */
422 if (ParamCount < Func->ParamCount) {
423 Error ("Too few arguments in function call");
426 /* The function returns the size of all parameters pushed onto the stack.
427 * However, if there are parameters missing (which is an error and was
428 * flagged by the compiler) AND a stack frame was preallocated above,
429 * we would loose track of the stackpointer and generate an internal error
430 * later. So we correct the value by the parameters that should have been
431 * pushed to avoid an internal compiler error. Since an error was
432 * generated before, no code will be output anyway.
434 return ParamSize + FrameSize;
439 static void FunctionCall (ExprDesc* Expr)
440 /* Perform a function call. */
442 FuncDesc* Func; /* Function descriptor */
443 int IsFuncPtr; /* Flag */
444 unsigned ParamSize; /* Number of parameter bytes */
446 int PtrOffs = 0; /* Offset of function pointer on stack */
447 int IsFastcall = 0; /* True if it's a fast call function */
448 int PtrOnStack = 0; /* True if a pointer copy is on stack */
450 /* Skip the left paren */
453 /* Get a pointer to the function descriptor from the type string */
454 Func = GetFuncDesc (Expr->Type);
456 /* Handle function pointers transparently */
457 IsFuncPtr = IsTypeFuncPtr (Expr->Type);
460 /* Check wether it's a fastcall function that has parameters */
461 IsFastcall = IsQualFastcall (Expr->Type + 1) && (Func->ParamCount > 0);
463 /* Things may be difficult, depending on where the function pointer
464 * resides. If the function pointer is an expression of some sort
465 * (not a local or global variable), we have to evaluate this
466 * expression now and save the result for later. Since calls to
467 * function pointers may be nested, we must save it onto the stack.
468 * For fastcall functions we do also need to place a copy of the
469 * pointer on stack, since we cannot use a/x.
471 PtrOnStack = IsFastcall || !ED_IsConst (Expr);
474 /* Not a global or local variable, or a fastcall function. Load
475 * the pointer into the primary and mark it as an expression.
477 LoadExpr (CF_NONE, Expr);
478 ED_MakeRValExpr (Expr);
480 /* Remember the code position */
483 /* Push the pointer onto the stack and remember the offset */
489 /* Check for known standard functions and inline them */
490 if (Expr->Name != 0) {
491 int StdFunc = FindStdFunc ((const char*) Expr->Name);
493 /* Inline this function */
494 HandleStdFunc (StdFunc, Func, Expr);
499 /* If we didn't inline the function, get fastcall info */
500 IsFastcall = IsQualFastcall (Expr->Type);
503 /* Parse the parameter list */
504 ParamSize = FunctionParamList (Func, IsFastcall);
506 /* We need the closing paren here */
509 /* Special handling for function pointers */
512 /* If the function is not a fastcall function, load the pointer to
513 * the function into the primary.
517 /* Not a fastcall function - we may use the primary */
519 /* If we have no parameters, the pointer is still in the
520 * primary. Remove the code to push it and correct the
523 if (ParamSize == 0) {
527 /* Load from the saved copy */
528 g_getlocal (CF_PTR, PtrOffs);
531 /* Load from original location */
532 LoadExpr (CF_NONE, Expr);
535 /* Call the function */
536 g_callind (TypeOf (Expr->Type+1), ParamSize, PtrOffs);
540 /* Fastcall function. We cannot use the primary for the function
541 * pointer and must therefore use an offset to the stack location.
542 * Since fastcall functions may never be variadic, we can use the
543 * index register for this purpose.
545 g_callind (CF_LOCAL, ParamSize, PtrOffs);
548 /* If we have a pointer on stack, remove it */
550 g_space (- (int) sizeofarg (CF_PTR));
559 /* Normal function */
560 g_call (TypeOf (Expr->Type), (const char*) Expr->Name, ParamSize);
564 /* The function result is an rvalue in the primary register */
565 ED_MakeRValExpr (Expr);
566 Expr->Type = GetFuncReturn (Expr->Type);
571 static void Primary (ExprDesc* E)
572 /* This is the lowest level of the expression parser. */
576 /* Initialize fields in the expression stucture */
579 /* Character and integer constants. */
580 if (CurTok.Tok == TOK_ICONST || CurTok.Tok == TOK_CCONST) {
581 E->IVal = CurTok.IVal;
582 E->Flags = E_LOC_ABS | E_RTYPE_RVAL;
583 E->Type = CurTok.Type;
588 /* Floating point constant */
589 if (CurTok.Tok == TOK_FCONST) {
590 E->FVal = CurTok.FVal;
591 E->Flags = E_LOC_ABS | E_RTYPE_RVAL;
592 E->Type = CurTok.Type;
597 /* Process parenthesized subexpression by calling the whole parser
600 if (CurTok.Tok == TOK_LPAREN) {
607 /* If we run into an identifier in preprocessing mode, we assume that this
608 * is an undefined macro and replace it by a constant value of zero.
610 if (Preprocessing && CurTok.Tok == TOK_IDENT) {
612 ED_MakeConstAbsInt (E, 0);
616 /* All others may only be used if the expression evaluation is not called
617 * recursively by the preprocessor.
620 /* Illegal expression in PP mode */
621 Error ("Preprocessor expression expected");
622 ED_MakeConstAbsInt (E, 1);
626 switch (CurTok.Tok) {
629 /* Identifier. Get a pointer to the symbol table entry */
630 Sym = E->Sym = FindSym (CurTok.Ident);
632 /* Is the symbol known? */
635 /* We found the symbol - skip the name token */
638 /* Check for illegal symbol types */
639 CHECK ((Sym->Flags & SC_LABEL) != SC_LABEL);
640 if (Sym->Flags & SC_TYPE) {
641 /* Cannot use type symbols */
642 Error ("Variable identifier expected");
643 /* Assume an int type to make E valid */
644 E->Flags = E_LOC_STACK | E_RTYPE_LVAL;
649 /* Mark the symbol as referenced */
650 Sym->Flags |= SC_REF;
652 /* The expression type is the symbol type */
655 /* Check for legal symbol types */
656 if ((Sym->Flags & SC_CONST) == SC_CONST) {
657 /* Enum or some other numeric constant */
658 E->Flags = E_LOC_ABS | E_RTYPE_RVAL;
659 E->IVal = Sym->V.ConstVal;
660 } else if ((Sym->Flags & SC_FUNC) == SC_FUNC) {
662 E->Flags = E_LOC_GLOBAL | E_RTYPE_LVAL;
663 E->Name = (unsigned long) Sym->Name;
664 } else if ((Sym->Flags & SC_AUTO) == SC_AUTO) {
665 /* Local variable. If this is a parameter for a variadic
666 * function, we have to add some address calculations, and the
667 * address is not const.
669 if ((Sym->Flags & SC_PARAM) == SC_PARAM && F_IsVariadic (CurrentFunc)) {
670 /* Variadic parameter */
671 g_leavariadic (Sym->V.Offs - F_GetParamSize (CurrentFunc));
672 E->Flags = E_LOC_EXPR | E_RTYPE_LVAL;
674 /* Normal parameter */
675 E->Flags = E_LOC_STACK | E_RTYPE_LVAL;
676 E->IVal = Sym->V.Offs;
678 } else if ((Sym->Flags & SC_REGISTER) == SC_REGISTER) {
679 /* Register variable, zero page based */
680 E->Flags = E_LOC_REGISTER | E_RTYPE_LVAL;
681 E->Name = Sym->V.R.RegOffs;
682 } else if ((Sym->Flags & SC_STATIC) == SC_STATIC) {
683 /* Static variable */
684 if (Sym->Flags & (SC_EXTERN | SC_STORAGE)) {
685 E->Flags = E_LOC_GLOBAL | E_RTYPE_LVAL;
686 E->Name = (unsigned long) Sym->Name;
688 E->Flags = E_LOC_STATIC | E_RTYPE_LVAL;
689 E->Name = Sym->V.Label;
692 /* Local static variable */
693 E->Flags = E_LOC_STATIC | E_RTYPE_LVAL;
694 E->Name = Sym->V.Offs;
697 /* We've made all variables lvalues above. However, this is
698 * not always correct: An array is actually the address of its
699 * first element, which is a rvalue, and a function is a
700 * rvalue, too, because we cannot store anything in a function.
701 * So fix the flags depending on the type.
703 if (IsTypeArray (E->Type) || IsTypeFunc (E->Type)) {
709 /* We did not find the symbol. Remember the name, then skip it */
711 strcpy (Ident, CurTok.Ident);
714 /* IDENT is either an auto-declared function or an undefined variable. */
715 if (CurTok.Tok == TOK_LPAREN) {
716 /* C99 doesn't allow calls to undefined functions, so
717 * generate an error and otherwise a warning. Declare a
718 * function returning int. For that purpose, prepare a
719 * function signature for a function having an empty param
720 * list and returning int.
722 if (IS_Get (&Standard) >= STD_C99) {
723 Error ("Call to undefined function `%s'", Ident);
725 Warning ("Call to undefined function `%s'", Ident);
727 Sym = AddGlobalSym (Ident, GetImplicitFuncType(), SC_EXTERN | SC_REF | SC_FUNC);
729 E->Flags = E_LOC_GLOBAL | E_RTYPE_RVAL;
730 E->Name = (unsigned long) Sym->Name;
732 /* Undeclared Variable */
733 Sym = AddLocalSym (Ident, type_int, SC_AUTO | SC_REF, 0);
734 E->Flags = E_LOC_STACK | E_RTYPE_LVAL;
736 Error ("Undefined symbol: `%s'", Ident);
745 E->Type = GetCharArrayType (GetLiteralPoolOffs () - CurTok.IVal);
746 E->Flags = E_LOC_LITERAL | E_RTYPE_RVAL;
747 E->IVal = CurTok.IVal;
748 E->Name = LiteralPoolLabel;
755 E->Flags = E_LOC_EXPR | E_RTYPE_RVAL;
760 /* Register pseudo variable */
761 E->Type = type_uchar;
762 E->Flags = E_LOC_PRIMARY | E_RTYPE_LVAL;
767 /* Register pseudo variable */
769 E->Flags = E_LOC_PRIMARY | E_RTYPE_LVAL;
774 /* Register pseudo variable */
775 E->Type = type_ulong;
776 E->Flags = E_LOC_PRIMARY | E_RTYPE_LVAL;
781 /* Illegal primary. Be sure to skip the token to avoid endless
784 Error ("Expression expected");
786 ED_MakeConstAbsInt (E, 1);
793 static void ArrayRef (ExprDesc* Expr)
794 /* Handle an array reference. This function needs a rewrite. */
805 /* Skip the bracket */
808 /* Get the type of left side */
811 /* We can apply a special treatment for arrays that have a const base
812 * address. This is true for most arrays and will produce a lot better
813 * code. Check if this is a const base address.
815 ConstBaseAddr = ED_IsRVal (Expr) &&
816 (ED_IsLocConst (Expr) || ED_IsLocStack (Expr));
818 /* If we have a constant base, we delay the address fetch */
820 if (!ConstBaseAddr) {
821 /* Get a pointer to the array into the primary */
822 LoadExpr (CF_NONE, Expr);
824 /* Get the array pointer on stack. Do not push more than 16
825 * bit, even if this value is greater, since we cannot handle
826 * other than 16bit stuff when doing indexing.
832 /* TOS now contains ptr to array elements. Get the subscript. */
833 MarkedExprWithCheck (hie0, &Subscript);
835 /* Check the types of array and subscript. We can either have a
836 * pointer/array to the left, in which case the subscript must be of an
837 * integer type, or we have an integer to the left, in which case the
838 * subscript must be a pointer/array.
839 * Since we do the necessary checking here, we can rely later on the
842 Qualifiers = T_QUAL_NONE;
843 if (IsClassPtr (Expr->Type)) {
844 if (!IsClassInt (Subscript.Type)) {
845 Error ("Array subscript is not an integer");
846 /* To avoid any compiler errors, make the expression a valid int */
847 ED_MakeConstAbsInt (&Subscript, 0);
849 if (IsTypeArray (Expr->Type)) {
850 Qualifiers = GetQualifier (Expr->Type);
852 ElementType = Indirect (Expr->Type);
853 } else if (IsClassInt (Expr->Type)) {
854 if (!IsClassPtr (Subscript.Type)) {
855 Error ("Subscripted value is neither array nor pointer");
856 /* To avoid compiler errors, make the subscript a char[] at
859 ED_MakeConstAbs (&Subscript, 0, GetCharArrayType (1));
860 } else if (IsTypeArray (Subscript.Type)) {
861 Qualifiers = GetQualifier (Subscript.Type);
863 ElementType = Indirect (Subscript.Type);
865 Error ("Cannot subscript");
866 /* To avoid compiler errors, fake both the array and the subscript, so
867 * we can just proceed.
869 ED_MakeConstAbs (Expr, 0, GetCharArrayType (1));
870 ED_MakeConstAbsInt (&Subscript, 0);
871 ElementType = Indirect (Expr->Type);
874 /* The element type has the combined qualifiers from itself and the array,
875 * it is a member of (if any).
877 if (GetQualifier (ElementType) != (GetQualifier (ElementType) | Qualifiers)) {
878 ElementType = TypeDup (ElementType);
879 ElementType->C |= Qualifiers;
882 /* If the subscript is a bit-field, load it and make it an rvalue */
883 if (ED_IsBitField (&Subscript)) {
884 LoadExpr (CF_NONE, &Subscript);
885 ED_MakeRValExpr (&Subscript);
888 /* Check if the subscript is constant absolute value */
889 if (ED_IsConstAbs (&Subscript) && ED_CodeRangeIsEmpty (&Subscript)) {
891 /* The array subscript is a numeric constant. If we had pushed the
892 * array base address onto the stack before, we can remove this value,
893 * since we can generate expression+offset.
895 if (!ConstBaseAddr) {
898 /* Get an array pointer into the primary */
899 LoadExpr (CF_NONE, Expr);
902 if (IsClassPtr (Expr->Type)) {
904 /* Lhs is pointer/array. Scale the subscript value according to
907 Subscript.IVal *= CheckedSizeOf (ElementType);
909 /* Remove the address load code */
912 /* In case of an array, we can adjust the offset of the expression
913 * already in Expr. If the base address was a constant, we can even
914 * remove the code that loaded the address into the primary.
916 if (IsTypeArray (Expr->Type)) {
918 /* Adjust the offset */
919 Expr->IVal += Subscript.IVal;
923 /* It's a pointer, so we do have to load it into the primary
924 * first (if it's not already there).
926 if (ConstBaseAddr || ED_IsLVal (Expr)) {
927 LoadExpr (CF_NONE, Expr);
928 ED_MakeRValExpr (Expr);
932 Expr->IVal = Subscript.IVal;
937 /* Scale the rhs value according to the element type */
938 g_scale (TypeOf (tptr1), CheckedSizeOf (ElementType));
940 /* Add the subscript. Since arrays are indexed by integers,
941 * we will ignore the true type of the subscript here and
942 * use always an int. #### Use offset but beware of LoadExpr!
944 g_inc (CF_INT | CF_CONST, Subscript.IVal);
950 /* Array subscript is not constant. Load it into the primary */
952 LoadExpr (CF_NONE, &Subscript);
955 if (IsClassPtr (Expr->Type)) {
957 /* Indexing is based on unsigneds, so we will just use the integer
958 * portion of the index (which is in (e)ax, so there's no further
961 g_scale (CF_INT, CheckedSizeOf (ElementType));
965 /* Get the int value on top. If we come here, we're sure, both
966 * values are 16 bit (the first one was truncated if necessary
967 * and the second one is a pointer). Note: If ConstBaseAddr is
968 * true, we don't have a value on stack, so to "swap" both, just
969 * push the subscript.
973 LoadExpr (CF_NONE, Expr);
980 g_scale (TypeOf (tptr1), CheckedSizeOf (ElementType));
984 /* The offset is now in the primary register. It we didn't have a
985 * constant base address for the lhs, the lhs address is already
986 * on stack, and we must add the offset. If the base address was
987 * constant, we call special functions to add the address to the
990 if (!ConstBaseAddr) {
992 /* The array base address is on stack and the subscript is in the
999 /* The subscript is in the primary, and the array base address is
1000 * in Expr. If the subscript has itself a constant address, it is
1001 * often a better idea to reverse again the order of the
1002 * evaluation. This will generate better code if the subscript is
1003 * a byte sized variable. But beware: This is only possible if the
1004 * subscript was not scaled, that is, if this was a byte array
1007 if ((ED_IsLocConst (&Subscript) || ED_IsLocStack (&Subscript)) &&
1008 CheckedSizeOf (ElementType) == SIZEOF_CHAR) {
1012 /* Reverse the order of evaluation */
1013 if (CheckedSizeOf (Subscript.Type) == SIZEOF_CHAR) {
1018 RemoveCode (&Mark2);
1020 /* Get a pointer to the array into the primary. */
1021 LoadExpr (CF_NONE, Expr);
1023 /* Add the variable */
1024 if (ED_IsLocStack (&Subscript)) {
1025 g_addlocal (Flags, Subscript.IVal);
1027 Flags |= GlobalModeFlags (&Subscript);
1028 g_addstatic (Flags, Subscript.Name, Subscript.IVal);
1032 if (ED_IsLocAbs (Expr)) {
1033 /* Constant numeric address. Just add it */
1034 g_inc (CF_INT, Expr->IVal);
1035 } else if (ED_IsLocStack (Expr)) {
1036 /* Base address is a local variable address */
1037 if (IsTypeArray (Expr->Type)) {
1038 g_addaddr_local (CF_INT, Expr->IVal);
1040 g_addlocal (CF_PTR, Expr->IVal);
1043 /* Base address is a static variable address */
1044 unsigned Flags = CF_INT | GlobalModeFlags (Expr);
1045 if (ED_IsRVal (Expr)) {
1046 /* Add the address of the location */
1047 g_addaddr_static (Flags, Expr->Name, Expr->IVal);
1049 /* Add the contents of the location */
1050 g_addstatic (Flags, Expr->Name, Expr->IVal);
1058 /* The result is an expression in the primary */
1059 ED_MakeRValExpr (Expr);
1063 /* Result is of element type */
1064 Expr->Type = ElementType;
1066 /* An array element is actually a variable. So the rules for variables
1067 * with respect to the reference type apply: If it's an array, it is
1068 * a rvalue, otherwise it's an lvalue. (A function would also be a rvalue,
1069 * but an array cannot contain functions).
1071 if (IsTypeArray (Expr->Type)) {
1077 /* Consume the closing bracket */
1083 static void StructRef (ExprDesc* Expr)
1084 /* Process struct field after . or ->. */
1090 /* Skip the token and check for an identifier */
1092 if (CurTok.Tok != TOK_IDENT) {
1093 Error ("Identifier expected");
1094 Expr->Type = type_int;
1098 /* Get the symbol table entry and check for a struct field */
1099 strcpy (Ident, CurTok.Ident);
1101 Field = FindStructField (Expr->Type, Ident);
1103 Error ("Struct/union has no field named `%s'", Ident);
1104 Expr->Type = type_int;
1108 /* If we have a struct pointer that is an lvalue and not already in the
1109 * primary, load it now.
1111 if (ED_IsLVal (Expr) && IsTypePtr (Expr->Type)) {
1113 /* Load into the primary */
1114 LoadExpr (CF_NONE, Expr);
1116 /* Make it an lvalue expression */
1117 ED_MakeLValExpr (Expr);
1120 /* Set the struct field offset */
1121 Expr->IVal += Field->V.Offs;
1123 /* The type is the type of the field plus any qualifiers from the struct */
1124 if (IsClassStruct (Expr->Type)) {
1125 Q = GetQualifier (Expr->Type);
1127 Q = GetQualifier (Indirect (Expr->Type));
1129 if (GetQualifier (Field->Type) == (GetQualifier (Field->Type) | Q)) {
1130 Expr->Type = Field->Type;
1132 Expr->Type = TypeDup (Field->Type);
1136 /* An struct member is actually a variable. So the rules for variables
1137 * with respect to the reference type apply: If it's an array, it is
1138 * a rvalue, otherwise it's an lvalue. (A function would also be a rvalue,
1139 * but a struct field cannot be a function).
1141 if (IsTypeArray (Expr->Type)) {
1147 /* Make the expression a bit field if necessary */
1148 if (SymIsBitField (Field)) {
1149 ED_MakeBitField (Expr, Field->V.B.BitOffs, Field->V.B.BitWidth);
1155 static void hie11 (ExprDesc *Expr)
1156 /* Handle compound types (structs and arrays) */
1158 /* Name value used in invalid function calls */
1159 static const char IllegalFunc[] = "illegal_function_call";
1161 /* Evaluate the lhs */
1164 /* Check for a rhs */
1165 while (CurTok.Tok == TOK_LBRACK || CurTok.Tok == TOK_LPAREN ||
1166 CurTok.Tok == TOK_DOT || CurTok.Tok == TOK_PTR_REF) {
1168 switch (CurTok.Tok) {
1171 /* Array reference */
1176 /* Function call. */
1177 if (!IsTypeFunc (Expr->Type) && !IsTypeFuncPtr (Expr->Type)) {
1178 /* Not a function */
1179 Error ("Illegal function call");
1180 /* Force the type to be a implicitly defined function, one
1181 * returning an int and taking any number of arguments.
1182 * Since we don't have a name, invent one.
1184 ED_MakeConstAbs (Expr, 0, GetImplicitFuncType ());
1185 Expr->Name = (long) IllegalFunc;
1187 /* Call the function */
1188 FunctionCall (Expr);
1192 if (!IsClassStruct (Expr->Type)) {
1193 Error ("Struct expected");
1199 /* If we have an array, convert it to pointer to first element */
1200 if (IsTypeArray (Expr->Type)) {
1201 Expr->Type = ArrayToPtr (Expr->Type);
1203 if (!IsClassPtr (Expr->Type) || !IsClassStruct (Indirect (Expr->Type))) {
1204 Error ("Struct pointer expected");
1210 Internal ("Invalid token in hie11: %d", CurTok.Tok);
1218 void Store (ExprDesc* Expr, const Type* StoreType)
1219 /* Store the primary register into the location denoted by Expr. If StoreType
1220 * is given, use this type when storing instead of Expr->Type. If StoreType
1221 * is NULL, use Expr->Type instead.
1226 /* If StoreType was not given, use Expr->Type instead */
1227 if (StoreType == 0) {
1228 StoreType = Expr->Type;
1231 /* Prepare the code generator flags */
1232 Flags = TypeOf (StoreType) | GlobalModeFlags (Expr);
1234 /* Do the store depending on the location */
1235 switch (ED_GetLoc (Expr)) {
1238 /* Absolute: numeric address or const */
1239 g_putstatic (Flags, Expr->IVal, 0);
1243 /* Global variable */
1244 g_putstatic (Flags, Expr->Name, Expr->IVal);
1249 /* Static variable or literal in the literal pool */
1250 g_putstatic (Flags, Expr->Name, Expr->IVal);
1253 case E_LOC_REGISTER:
1254 /* Register variable */
1255 g_putstatic (Flags, Expr->Name, Expr->IVal);
1259 /* Value on the stack */
1260 g_putlocal (Flags, Expr->IVal, 0);
1264 /* The primary register (value is already there) */
1268 /* An expression in the primary register */
1269 g_putind (Flags, Expr->IVal);
1273 Internal ("Invalid location in Store(): 0x%04X", ED_GetLoc (Expr));
1276 /* Assume that each one of the stores will invalidate CC */
1277 ED_MarkAsUntested (Expr);
1282 static void PreInc (ExprDesc* Expr)
1283 /* Handle the preincrement operators */
1288 /* Skip the operator token */
1291 /* Evaluate the expression and check that it is an lvalue */
1293 if (!ED_IsLVal (Expr)) {
1294 Error ("Invalid lvalue");
1298 /* We cannot modify const values */
1299 if (IsQualConst (Expr->Type)) {
1300 Error ("Increment of read-only variable");
1303 /* Get the data type */
1304 Flags = TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR | CF_CONST;
1306 /* Get the increment value in bytes */
1307 Val = IsTypePtr (Expr->Type)? CheckedPSizeOf (Expr->Type) : 1;
1309 /* Check the location of the data */
1310 switch (ED_GetLoc (Expr)) {
1313 /* Absolute: numeric address or const */
1314 g_addeqstatic (Flags, Expr->IVal, 0, Val);
1318 /* Global variable */
1319 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1324 /* Static variable or literal in the literal pool */
1325 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1328 case E_LOC_REGISTER:
1329 /* Register variable */
1330 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1334 /* Value on the stack */
1335 g_addeqlocal (Flags, Expr->IVal, Val);
1339 /* The primary register */
1344 /* An expression in the primary register */
1345 g_addeqind (Flags, Expr->IVal, Val);
1349 Internal ("Invalid location in PreInc(): 0x%04X", ED_GetLoc (Expr));
1352 /* Result is an expression, no reference */
1353 ED_MakeRValExpr (Expr);
1358 static void PreDec (ExprDesc* Expr)
1359 /* Handle the predecrement operators */
1364 /* Skip the operator token */
1367 /* Evaluate the expression and check that it is an lvalue */
1369 if (!ED_IsLVal (Expr)) {
1370 Error ("Invalid lvalue");
1374 /* We cannot modify const values */
1375 if (IsQualConst (Expr->Type)) {
1376 Error ("Decrement of read-only variable");
1379 /* Get the data type */
1380 Flags = TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR | CF_CONST;
1382 /* Get the increment value in bytes */
1383 Val = IsTypePtr (Expr->Type)? CheckedPSizeOf (Expr->Type) : 1;
1385 /* Check the location of the data */
1386 switch (ED_GetLoc (Expr)) {
1389 /* Absolute: numeric address or const */
1390 g_subeqstatic (Flags, Expr->IVal, 0, Val);
1394 /* Global variable */
1395 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1400 /* Static variable or literal in the literal pool */
1401 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1404 case E_LOC_REGISTER:
1405 /* Register variable */
1406 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1410 /* Value on the stack */
1411 g_subeqlocal (Flags, Expr->IVal, Val);
1415 /* The primary register */
1420 /* An expression in the primary register */
1421 g_subeqind (Flags, Expr->IVal, Val);
1425 Internal ("Invalid location in PreDec(): 0x%04X", ED_GetLoc (Expr));
1428 /* Result is an expression, no reference */
1429 ED_MakeRValExpr (Expr);
1434 static void PostInc (ExprDesc* Expr)
1435 /* Handle the postincrement operator */
1441 /* The expression to increment must be an lvalue */
1442 if (!ED_IsLVal (Expr)) {
1443 Error ("Invalid lvalue");
1447 /* We cannot modify const values */
1448 if (IsQualConst (Expr->Type)) {
1449 Error ("Increment of read-only variable");
1452 /* Get the data type */
1453 Flags = TypeOf (Expr->Type);
1455 /* Push the address if needed */
1458 /* Fetch the value and save it (since it's the result of the expression) */
1459 LoadExpr (CF_NONE, Expr);
1460 g_save (Flags | CF_FORCECHAR);
1462 /* If we have a pointer expression, increment by the size of the type */
1463 if (IsTypePtr (Expr->Type)) {
1464 g_inc (Flags | CF_CONST | CF_FORCECHAR, CheckedSizeOf (Expr->Type + 1));
1466 g_inc (Flags | CF_CONST | CF_FORCECHAR, 1);
1469 /* Store the result back */
1472 /* Restore the original value in the primary register */
1473 g_restore (Flags | CF_FORCECHAR);
1475 /* The result is always an expression, no reference */
1476 ED_MakeRValExpr (Expr);
1481 static void PostDec (ExprDesc* Expr)
1482 /* Handle the postdecrement operator */
1488 /* The expression to increment must be an lvalue */
1489 if (!ED_IsLVal (Expr)) {
1490 Error ("Invalid lvalue");
1494 /* We cannot modify const values */
1495 if (IsQualConst (Expr->Type)) {
1496 Error ("Decrement of read-only variable");
1499 /* Get the data type */
1500 Flags = TypeOf (Expr->Type);
1502 /* Push the address if needed */
1505 /* Fetch the value and save it (since it's the result of the expression) */
1506 LoadExpr (CF_NONE, Expr);
1507 g_save (Flags | CF_FORCECHAR);
1509 /* If we have a pointer expression, increment by the size of the type */
1510 if (IsTypePtr (Expr->Type)) {
1511 g_dec (Flags | CF_CONST | CF_FORCECHAR, CheckedSizeOf (Expr->Type + 1));
1513 g_dec (Flags | CF_CONST | CF_FORCECHAR, 1);
1516 /* Store the result back */
1519 /* Restore the original value in the primary register */
1520 g_restore (Flags | CF_FORCECHAR);
1522 /* The result is always an expression, no reference */
1523 ED_MakeRValExpr (Expr);
1528 static void UnaryOp (ExprDesc* Expr)
1529 /* Handle unary -/+ and ~ */
1533 /* Remember the operator token and skip it */
1534 token_t Tok = CurTok.Tok;
1537 /* Get the expression */
1540 /* We can only handle integer types */
1541 if (!IsClassInt (Expr->Type)) {
1542 Error ("Argument must have integer type");
1543 ED_MakeConstAbsInt (Expr, 1);
1546 /* Check for a constant expression */
1547 if (ED_IsConstAbs (Expr)) {
1548 /* Value is constant */
1550 case TOK_MINUS: Expr->IVal = -Expr->IVal; break;
1551 case TOK_PLUS: break;
1552 case TOK_COMP: Expr->IVal = ~Expr->IVal; break;
1553 default: Internal ("Unexpected token: %d", Tok);
1556 /* Value is not constant */
1557 LoadExpr (CF_NONE, Expr);
1559 /* Get the type of the expression */
1560 Flags = TypeOf (Expr->Type);
1562 /* Handle the operation */
1564 case TOK_MINUS: g_neg (Flags); break;
1565 case TOK_PLUS: break;
1566 case TOK_COMP: g_com (Flags); break;
1567 default: Internal ("Unexpected token: %d", Tok);
1570 /* The result is a rvalue in the primary */
1571 ED_MakeRValExpr (Expr);
1577 void hie10 (ExprDesc* Expr)
1578 /* Handle ++, --, !, unary - etc. */
1582 switch (CurTok.Tok) {
1600 if (evalexpr (CF_NONE, hie10, Expr) == 0) {
1601 /* Constant expression */
1602 Expr->IVal = !Expr->IVal;
1604 g_bneg (TypeOf (Expr->Type));
1605 ED_MakeRValExpr (Expr);
1606 ED_TestDone (Expr); /* bneg will set cc */
1612 ExprWithCheck (hie10, Expr);
1613 if (ED_IsLVal (Expr) || !(ED_IsLocConst (Expr) || ED_IsLocStack (Expr))) {
1614 /* Not a const, load it into the primary and make it a
1617 LoadExpr (CF_NONE, Expr);
1618 ED_MakeRValExpr (Expr);
1620 /* If the expression is already a pointer to function, the
1621 * additional dereferencing operator must be ignored. A function
1622 * itself is represented as "pointer to function", so any number
1623 * of dereference operators is legal, since the result will
1624 * always be converted to "pointer to function".
1626 if (IsTypeFuncPtr (Expr->Type) || IsTypeFunc (Expr->Type)) {
1627 /* Expression not storable */
1630 if (IsClassPtr (Expr->Type)) {
1631 Expr->Type = Indirect (Expr->Type);
1633 Error ("Illegal indirection");
1635 /* The * operator yields an lvalue */
1642 ExprWithCheck (hie10, Expr);
1643 /* The & operator may be applied to any lvalue, and it may be
1644 * applied to functions, even if they're no lvalues.
1646 if (ED_IsRVal (Expr) && !IsTypeFunc (Expr->Type) && !IsTypeArray (Expr->Type)) {
1647 Error ("Illegal address");
1649 if (ED_IsBitField (Expr)) {
1650 Error ("Cannot take address of bit-field");
1651 /* Do it anyway, just to avoid further warnings */
1652 Expr->Flags &= ~E_BITFIELD;
1654 Expr->Type = PointerTo (Expr->Type);
1655 /* The & operator yields an rvalue */
1662 if (TypeSpecAhead ()) {
1665 Size = CheckedSizeOf (ParseType (T));
1668 /* Remember the output queue pointer */
1672 Size = CheckedSizeOf (Expr->Type);
1673 /* Remove any generated code */
1676 ED_MakeConstAbs (Expr, Size, type_size_t);
1677 ED_MarkAsUntested (Expr);
1681 if (TypeSpecAhead ()) {
1691 /* Handle post increment */
1692 switch (CurTok.Tok) {
1693 case TOK_INC: PostInc (Expr); break;
1694 case TOK_DEC: PostDec (Expr); break;
1705 static void hie_internal (const GenDesc* Ops, /* List of generators */
1707 void (*hienext) (ExprDesc*),
1709 /* Helper function */
1715 token_t Tok; /* The operator token */
1716 unsigned ltype, type;
1717 int rconst; /* Operand is a constant */
1723 while ((Gen = FindGen (CurTok.Tok, Ops)) != 0) {
1725 /* Tell the caller that we handled it's ops */
1728 /* All operators that call this function expect an int on the lhs */
1729 if (!IsClassInt (Expr->Type)) {
1730 Error ("Integer expression expected");
1731 /* To avoid further errors, make Expr a valid int expression */
1732 ED_MakeConstAbsInt (Expr, 1);
1735 /* Remember the operator token, then skip it */
1739 /* Get the lhs on stack */
1740 GetCodePos (&Mark1);
1741 ltype = TypeOf (Expr->Type);
1742 if (ED_IsConstAbs (Expr)) {
1743 /* Constant value */
1744 GetCodePos (&Mark2);
1745 g_push (ltype | CF_CONST, Expr->IVal);
1747 /* Value not constant */
1748 LoadExpr (CF_NONE, Expr);
1749 GetCodePos (&Mark2);
1753 /* Get the right hand side */
1754 MarkedExprWithCheck (hienext, &Expr2);
1756 /* Check for a constant expression */
1757 rconst = (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2));
1759 /* Not constant, load into the primary */
1760 LoadExpr (CF_NONE, &Expr2);
1763 /* Check the type of the rhs */
1764 if (!IsClassInt (Expr2.Type)) {
1765 Error ("Integer expression expected");
1768 /* Check for const operands */
1769 if (ED_IsConstAbs (Expr) && rconst) {
1771 /* Both operands are constant, remove the generated code */
1772 RemoveCode (&Mark1);
1774 /* Get the type of the result */
1775 Expr->Type = promoteint (Expr->Type, Expr2.Type);
1777 /* Handle the op differently for signed and unsigned types */
1778 if (IsSignSigned (Expr->Type)) {
1780 /* Evaluate the result for signed operands */
1781 signed long Val1 = Expr->IVal;
1782 signed long Val2 = Expr2.IVal;
1785 Expr->IVal = (Val1 | Val2);
1788 Expr->IVal = (Val1 ^ Val2);
1791 Expr->IVal = (Val1 & Val2);
1794 Expr->IVal = (Val1 * Val2);
1798 Error ("Division by zero");
1799 Expr->IVal = 0x7FFFFFFF;
1801 Expr->IVal = (Val1 / Val2);
1806 Error ("Modulo operation with zero");
1809 Expr->IVal = (Val1 % Val2);
1813 Internal ("hie_internal: got token 0x%X\n", Tok);
1817 /* Evaluate the result for unsigned operands */
1818 unsigned long Val1 = Expr->IVal;
1819 unsigned long Val2 = Expr2.IVal;
1822 Expr->IVal = (Val1 | Val2);
1825 Expr->IVal = (Val1 ^ Val2);
1828 Expr->IVal = (Val1 & Val2);
1831 Expr->IVal = (Val1 * Val2);
1835 Error ("Division by zero");
1836 Expr->IVal = 0xFFFFFFFF;
1838 Expr->IVal = (Val1 / Val2);
1843 Error ("Modulo operation with zero");
1846 Expr->IVal = (Val1 % Val2);
1850 Internal ("hie_internal: got token 0x%X\n", Tok);
1856 /* If the right hand side is constant, and the generator function
1857 * expects the lhs in the primary, remove the push of the primary
1860 unsigned rtype = TypeOf (Expr2.Type);
1863 /* Second value is constant - check for div */
1866 if (Tok == TOK_DIV && Expr2.IVal == 0) {
1867 Error ("Division by zero");
1868 } else if (Tok == TOK_MOD && Expr2.IVal == 0) {
1869 Error ("Modulo operation with zero");
1871 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1872 RemoveCode (&Mark2);
1873 ltype |= CF_REG; /* Value is in register */
1877 /* Determine the type of the operation result. */
1878 type |= g_typeadjust (ltype, rtype);
1879 Expr->Type = promoteint (Expr->Type, Expr2.Type);
1882 Gen->Func (type, Expr2.IVal);
1884 /* We have a rvalue in the primary now */
1885 ED_MakeRValExpr (Expr);
1892 static void hie_compare (const GenDesc* Ops, /* List of generators */
1894 void (*hienext) (ExprDesc*))
1895 /* Helper function for the compare operators */
1901 token_t Tok; /* The operator token */
1903 int rconst; /* Operand is a constant */
1908 while ((Gen = FindGen (CurTok.Tok, Ops)) != 0) {
1910 /* Remember the operator token, then skip it */
1914 /* Get the lhs on stack */
1915 GetCodePos (&Mark1);
1916 ltype = TypeOf (Expr->Type);
1917 if (ED_IsConstAbs (Expr)) {
1918 /* Constant value */
1919 GetCodePos (&Mark2);
1920 g_push (ltype | CF_CONST, Expr->IVal);
1922 /* Value not constant */
1923 LoadExpr (CF_NONE, Expr);
1924 GetCodePos (&Mark2);
1928 /* Get the right hand side */
1929 MarkedExprWithCheck (hienext, &Expr2);
1931 /* Check for a constant expression */
1932 rconst = (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2));
1934 /* Not constant, load into the primary */
1935 LoadExpr (CF_NONE, &Expr2);
1938 /* Make sure, the types are compatible */
1939 if (IsClassInt (Expr->Type)) {
1940 if (!IsClassInt (Expr2.Type) && !(IsClassPtr(Expr2.Type) && ED_IsNullPtr(Expr))) {
1941 Error ("Incompatible types");
1943 } else if (IsClassPtr (Expr->Type)) {
1944 if (IsClassPtr (Expr2.Type)) {
1945 /* Both pointers are allowed in comparison if they point to
1946 * the same type, or if one of them is a void pointer.
1948 Type* left = Indirect (Expr->Type);
1949 Type* right = Indirect (Expr2.Type);
1950 if (TypeCmp (left, right) < TC_EQUAL && left->C != T_VOID && right->C != T_VOID) {
1951 /* Incomatible pointers */
1952 Error ("Incompatible types");
1954 } else if (!ED_IsNullPtr (&Expr2)) {
1955 Error ("Incompatible types");
1959 /* Check for const operands */
1960 if (ED_IsConstAbs (Expr) && rconst) {
1962 /* If the result is constant, this is suspicious when not in
1963 * preprocessor mode.
1965 if (!Preprocessing) {
1966 Warning ("Result of comparison is constant");
1969 /* Both operands are constant, remove the generated code */
1970 RemoveCode (&Mark1);
1972 /* Determine if this is a signed or unsigned compare */
1973 if (IsClassInt (Expr->Type) && IsSignSigned (Expr->Type) &&
1974 IsClassInt (Expr2.Type) && IsSignSigned (Expr2.Type)) {
1976 /* Evaluate the result for signed operands */
1977 signed long Val1 = Expr->IVal;
1978 signed long Val2 = Expr2.IVal;
1980 case TOK_EQ: Expr->IVal = (Val1 == Val2); break;
1981 case TOK_NE: Expr->IVal = (Val1 != Val2); break;
1982 case TOK_LT: Expr->IVal = (Val1 < Val2); break;
1983 case TOK_LE: Expr->IVal = (Val1 <= Val2); break;
1984 case TOK_GE: Expr->IVal = (Val1 >= Val2); break;
1985 case TOK_GT: Expr->IVal = (Val1 > Val2); break;
1986 default: Internal ("hie_compare: got token 0x%X\n", Tok);
1991 /* Evaluate the result for unsigned operands */
1992 unsigned long Val1 = Expr->IVal;
1993 unsigned long Val2 = Expr2.IVal;
1995 case TOK_EQ: Expr->IVal = (Val1 == Val2); break;
1996 case TOK_NE: Expr->IVal = (Val1 != Val2); break;
1997 case TOK_LT: Expr->IVal = (Val1 < Val2); break;
1998 case TOK_LE: Expr->IVal = (Val1 <= Val2); break;
1999 case TOK_GE: Expr->IVal = (Val1 >= Val2); break;
2000 case TOK_GT: Expr->IVal = (Val1 > Val2); break;
2001 default: Internal ("hie_compare: got token 0x%X\n", Tok);
2007 /* If the right hand side is constant, and the generator function
2008 * expects the lhs in the primary, remove the push of the primary
2014 if ((Gen->Flags & GEN_NOPUSH) != 0) {
2015 RemoveCode (&Mark2);
2016 ltype |= CF_REG; /* Value is in register */
2020 /* Determine the type of the operation result. If the left
2021 * operand is of type char and the right is a constant, or
2022 * if both operands are of type char, we will encode the
2023 * operation as char operation. Otherwise the default
2024 * promotions are used.
2026 if (IsTypeChar (Expr->Type) && (IsTypeChar (Expr2.Type) || rconst)) {
2028 if (IsSignUnsigned (Expr->Type) || IsSignUnsigned (Expr2.Type)) {
2029 flags |= CF_UNSIGNED;
2032 flags |= CF_FORCECHAR;
2035 unsigned rtype = TypeOf (Expr2.Type) | (flags & CF_CONST);
2036 flags |= g_typeadjust (ltype, rtype);
2040 Gen->Func (flags, Expr2.IVal);
2042 /* The result is an rvalue in the primary */
2043 ED_MakeRValExpr (Expr);
2046 /* Result type is always int */
2047 Expr->Type = type_int;
2049 /* Condition codes are set */
2056 static void hie9 (ExprDesc *Expr)
2057 /* Process * and / operators. */
2059 static const GenDesc hie9_ops[] = {
2060 { TOK_STAR, GEN_NOPUSH, g_mul },
2061 { TOK_DIV, GEN_NOPUSH, g_div },
2062 { TOK_MOD, GEN_NOPUSH, g_mod },
2063 { TOK_INVALID, 0, 0 }
2067 hie_internal (hie9_ops, Expr, hie10, &UsedGen);
2072 static void parseadd (ExprDesc* Expr)
2073 /* Parse an expression with the binary plus operator. Expr contains the
2074 * unprocessed left hand side of the expression and will contain the
2075 * result of the expression on return.
2079 unsigned flags; /* Operation flags */
2080 CodeMark Mark; /* Remember code position */
2081 Type* lhst; /* Type of left hand side */
2082 Type* rhst; /* Type of right hand side */
2085 /* Skip the PLUS token */
2088 /* Get the left hand side type, initialize operation flags */
2092 /* Check for constness on both sides */
2093 if (ED_IsConst (Expr)) {
2095 /* The left hand side is a constant of some sort. Good. Get rhs */
2097 if (ED_IsConstAbs (&Expr2)) {
2099 /* Right hand side is a constant numeric value. Get the rhs type */
2102 /* Both expressions are constants. Check for pointer arithmetic */
2103 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2104 /* Left is pointer, right is int, must scale rhs */
2105 Expr->IVal += Expr2.IVal * CheckedPSizeOf (lhst);
2106 /* Result type is a pointer */
2107 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2108 /* Left is int, right is pointer, must scale lhs */
2109 Expr->IVal = Expr->IVal * CheckedPSizeOf (rhst) + Expr2.IVal;
2110 /* Result type is a pointer */
2111 Expr->Type = Expr2.Type;
2112 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2113 /* Integer addition */
2114 Expr->IVal += Expr2.IVal;
2115 typeadjust (Expr, &Expr2, 1);
2118 Error ("Invalid operands for binary operator `+'");
2123 /* lhs is a constant and rhs is not constant. Load rhs into
2126 LoadExpr (CF_NONE, &Expr2);
2128 /* Beware: The check above (for lhs) lets not only pass numeric
2129 * constants, but also constant addresses (labels), maybe even
2130 * with an offset. We have to check for that here.
2133 /* First, get the rhs type. */
2137 if (ED_IsLocAbs (Expr)) {
2138 /* A numerical constant */
2141 /* Constant address label */
2142 flags |= GlobalModeFlags (Expr) | CF_CONSTADDR;
2145 /* Check for pointer arithmetic */
2146 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2147 /* Left is pointer, right is int, must scale rhs */
2148 g_scale (CF_INT, CheckedPSizeOf (lhst));
2149 /* Operate on pointers, result type is a pointer */
2151 /* Generate the code for the add */
2152 if (ED_GetLoc (Expr) == E_LOC_ABS) {
2153 /* Numeric constant */
2154 g_inc (flags, Expr->IVal);
2156 /* Constant address */
2157 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2159 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2161 /* Left is int, right is pointer, must scale lhs. */
2162 unsigned ScaleFactor = CheckedPSizeOf (rhst);
2164 /* Operate on pointers, result type is a pointer */
2166 Expr->Type = Expr2.Type;
2168 /* Since we do already have rhs in the primary, if lhs is
2169 * not a numeric constant, and the scale factor is not one
2170 * (no scaling), we must take the long way over the stack.
2172 if (ED_IsLocAbs (Expr)) {
2173 /* Numeric constant, scale lhs */
2174 Expr->IVal *= ScaleFactor;
2175 /* Generate the code for the add */
2176 g_inc (flags, Expr->IVal);
2177 } else if (ScaleFactor == 1) {
2178 /* Constant address but no need to scale */
2179 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2181 /* Constant address that must be scaled */
2182 g_push (TypeOf (Expr2.Type), 0); /* rhs --> stack */
2183 g_getimmed (flags, Expr->Name, Expr->IVal);
2184 g_scale (CF_PTR, ScaleFactor);
2187 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2188 /* Integer addition */
2189 flags |= typeadjust (Expr, &Expr2, 1);
2190 /* Generate the code for the add */
2191 if (ED_IsLocAbs (Expr)) {
2192 /* Numeric constant */
2193 g_inc (flags, Expr->IVal);
2195 /* Constant address */
2196 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2200 Error ("Invalid operands for binary operator `+'");
2204 /* Result is a rvalue in primary register */
2205 ED_MakeRValExpr (Expr);
2210 /* Left hand side is not constant. Get the value onto the stack. */
2211 LoadExpr (CF_NONE, Expr); /* --> primary register */
2213 g_push (TypeOf (Expr->Type), 0); /* --> stack */
2215 /* Evaluate the rhs */
2216 MarkedExprWithCheck (hie9, &Expr2);
2218 /* Check for a constant rhs expression */
2219 if (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2)) {
2221 /* Right hand side is a constant. Get the rhs type */
2224 /* Remove pushed value from stack */
2227 /* Check for pointer arithmetic */
2228 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2229 /* Left is pointer, right is int, must scale rhs */
2230 Expr2.IVal *= CheckedPSizeOf (lhst);
2231 /* Operate on pointers, result type is a pointer */
2233 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2234 /* Left is int, right is pointer, must scale lhs (ptr only) */
2235 g_scale (CF_INT | CF_CONST, CheckedPSizeOf (rhst));
2236 /* Operate on pointers, result type is a pointer */
2238 Expr->Type = Expr2.Type;
2239 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2240 /* Integer addition */
2241 flags = typeadjust (Expr, &Expr2, 1);
2244 Error ("Invalid operands for binary operator `+'");
2248 /* Generate code for the add */
2249 g_inc (flags | CF_CONST, Expr2.IVal);
2253 /* Not constant, load into the primary */
2254 LoadExpr (CF_NONE, &Expr2);
2256 /* lhs and rhs are not constant. Get the rhs type. */
2259 /* Check for pointer arithmetic */
2260 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2261 /* Left is pointer, right is int, must scale rhs */
2262 g_scale (CF_INT, CheckedPSizeOf (lhst));
2263 /* Operate on pointers, result type is a pointer */
2265 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2266 /* Left is int, right is pointer, must scale lhs */
2267 g_tosint (TypeOf (rhst)); /* Make sure, TOS is int */
2268 g_swap (CF_INT); /* Swap TOS and primary */
2269 g_scale (CF_INT, CheckedPSizeOf (rhst));
2270 /* Operate on pointers, result type is a pointer */
2272 Expr->Type = Expr2.Type;
2273 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2274 /* Integer addition. Note: Result is never constant.
2275 * Problem here is that typeadjust does not know if the
2276 * variable is an rvalue or lvalue, so if both operands
2277 * are dereferenced constant numeric addresses, typeadjust
2278 * thinks the operation works on constants. Removing
2279 * CF_CONST here means handling the symptoms, however, the
2280 * whole parser is such a mess that I fear to break anything
2281 * when trying to apply another solution.
2283 flags = typeadjust (Expr, &Expr2, 0) & ~CF_CONST;
2286 Error ("Invalid operands for binary operator `+'");
2290 /* Generate code for the add */
2295 /* Result is a rvalue in primary register */
2296 ED_MakeRValExpr (Expr);
2299 /* Condition codes not set */
2300 ED_MarkAsUntested (Expr);
2306 static void parsesub (ExprDesc* Expr)
2307 /* Parse an expression with the binary minus operator. Expr contains the
2308 * unprocessed left hand side of the expression and will contain the
2309 * result of the expression on return.
2313 unsigned flags; /* Operation flags */
2314 Type* lhst; /* Type of left hand side */
2315 Type* rhst; /* Type of right hand side */
2316 CodeMark Mark1; /* Save position of output queue */
2317 CodeMark Mark2; /* Another position in the queue */
2318 int rscale; /* Scale factor for the result */
2321 /* Skip the MINUS token */
2324 /* Get the left hand side type, initialize operation flags */
2326 rscale = 1; /* Scale by 1, that is, don't scale */
2328 /* Remember the output queue position, then bring the value onto the stack */
2329 GetCodePos (&Mark1);
2330 LoadExpr (CF_NONE, Expr); /* --> primary register */
2331 GetCodePos (&Mark2);
2332 g_push (TypeOf (lhst), 0); /* --> stack */
2334 /* Parse the right hand side */
2335 MarkedExprWithCheck (hie9, &Expr2);
2337 /* Check for a constant rhs expression */
2338 if (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2)) {
2340 /* The right hand side is constant. Get the rhs type. */
2343 /* Check left hand side */
2344 if (ED_IsConstAbs (Expr)) {
2346 /* Both sides are constant, remove generated code */
2347 RemoveCode (&Mark1);
2349 /* Check for pointer arithmetic */
2350 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2351 /* Left is pointer, right is int, must scale rhs */
2352 Expr->IVal -= Expr2.IVal * CheckedPSizeOf (lhst);
2353 /* Operate on pointers, result type is a pointer */
2354 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2355 /* Left is pointer, right is pointer, must scale result */
2356 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2357 Error ("Incompatible pointer types");
2359 Expr->IVal = (Expr->IVal - Expr2.IVal) /
2360 CheckedPSizeOf (lhst);
2362 /* Operate on pointers, result type is an integer */
2363 Expr->Type = type_int;
2364 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2365 /* Integer subtraction */
2366 typeadjust (Expr, &Expr2, 1);
2367 Expr->IVal -= Expr2.IVal;
2370 Error ("Invalid operands for binary operator `-'");
2373 /* Result is constant, condition codes not set */
2374 ED_MarkAsUntested (Expr);
2378 /* Left hand side is not constant, right hand side is.
2379 * Remove pushed value from stack.
2381 RemoveCode (&Mark2);
2383 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2384 /* Left is pointer, right is int, must scale rhs */
2385 Expr2.IVal *= CheckedPSizeOf (lhst);
2386 /* Operate on pointers, result type is a pointer */
2388 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2389 /* Left is pointer, right is pointer, must scale result */
2390 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2391 Error ("Incompatible pointer types");
2393 rscale = CheckedPSizeOf (lhst);
2395 /* Operate on pointers, result type is an integer */
2397 Expr->Type = type_int;
2398 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2399 /* Integer subtraction */
2400 flags = typeadjust (Expr, &Expr2, 1);
2403 Error ("Invalid operands for binary operator `-'");
2407 /* Do the subtraction */
2408 g_dec (flags | CF_CONST, Expr2.IVal);
2410 /* If this was a pointer subtraction, we must scale the result */
2412 g_scale (flags, -rscale);
2415 /* Result is a rvalue in the primary register */
2416 ED_MakeRValExpr (Expr);
2417 ED_MarkAsUntested (Expr);
2423 /* Not constant, load into the primary */
2424 LoadExpr (CF_NONE, &Expr2);
2426 /* Right hand side is not constant. Get the rhs type. */
2429 /* Check for pointer arithmetic */
2430 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2431 /* Left is pointer, right is int, must scale rhs */
2432 g_scale (CF_INT, CheckedPSizeOf (lhst));
2433 /* Operate on pointers, result type is a pointer */
2435 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2436 /* Left is pointer, right is pointer, must scale result */
2437 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2438 Error ("Incompatible pointer types");
2440 rscale = CheckedPSizeOf (lhst);
2442 /* Operate on pointers, result type is an integer */
2444 Expr->Type = type_int;
2445 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2446 /* Integer subtraction. If the left hand side descriptor says that
2447 * the lhs is const, we have to remove this mark, since this is no
2448 * longer true, lhs is on stack instead.
2450 if (ED_IsLocAbs (Expr)) {
2451 ED_MakeRValExpr (Expr);
2453 /* Adjust operand types */
2454 flags = typeadjust (Expr, &Expr2, 0);
2457 Error ("Invalid operands for binary operator `-'");
2461 /* Generate code for the sub (the & is a hack here) */
2462 g_sub (flags & ~CF_CONST, 0);
2464 /* If this was a pointer subtraction, we must scale the result */
2466 g_scale (flags, -rscale);
2469 /* Result is a rvalue in the primary register */
2470 ED_MakeRValExpr (Expr);
2471 ED_MarkAsUntested (Expr);
2477 void hie8 (ExprDesc* Expr)
2478 /* Process + and - binary operators. */
2481 while (CurTok.Tok == TOK_PLUS || CurTok.Tok == TOK_MINUS) {
2482 if (CurTok.Tok == TOK_PLUS) {
2492 static void hie6 (ExprDesc* Expr)
2493 /* Handle greater-than type comparators */
2495 static const GenDesc hie6_ops [] = {
2496 { TOK_LT, GEN_NOPUSH, g_lt },
2497 { TOK_LE, GEN_NOPUSH, g_le },
2498 { TOK_GE, GEN_NOPUSH, g_ge },
2499 { TOK_GT, GEN_NOPUSH, g_gt },
2500 { TOK_INVALID, 0, 0 }
2502 hie_compare (hie6_ops, Expr, ShiftExpr);
2507 static void hie5 (ExprDesc* Expr)
2508 /* Handle == and != */
2510 static const GenDesc hie5_ops[] = {
2511 { TOK_EQ, GEN_NOPUSH, g_eq },
2512 { TOK_NE, GEN_NOPUSH, g_ne },
2513 { TOK_INVALID, 0, 0 }
2515 hie_compare (hie5_ops, Expr, hie6);
2520 static void hie4 (ExprDesc* Expr)
2521 /* Handle & (bitwise and) */
2523 static const GenDesc hie4_ops[] = {
2524 { TOK_AND, GEN_NOPUSH, g_and },
2525 { TOK_INVALID, 0, 0 }
2529 hie_internal (hie4_ops, Expr, hie5, &UsedGen);
2534 static void hie3 (ExprDesc* Expr)
2535 /* Handle ^ (bitwise exclusive or) */
2537 static const GenDesc hie3_ops[] = {
2538 { TOK_XOR, GEN_NOPUSH, g_xor },
2539 { TOK_INVALID, 0, 0 }
2543 hie_internal (hie3_ops, Expr, hie4, &UsedGen);
2548 static void hie2 (ExprDesc* Expr)
2549 /* Handle | (bitwise or) */
2551 static const GenDesc hie2_ops[] = {
2552 { TOK_OR, GEN_NOPUSH, g_or },
2553 { TOK_INVALID, 0, 0 }
2557 hie_internal (hie2_ops, Expr, hie3, &UsedGen);
2562 static void hieAndPP (ExprDesc* Expr)
2563 /* Process "exp && exp" in preprocessor mode (that is, when the parser is
2564 * called recursively from the preprocessor.
2569 ConstAbsIntExpr (hie2, Expr);
2570 while (CurTok.Tok == TOK_BOOL_AND) {
2576 ConstAbsIntExpr (hie2, &Expr2);
2578 /* Combine the two */
2579 Expr->IVal = (Expr->IVal && Expr2.IVal);
2585 static void hieOrPP (ExprDesc *Expr)
2586 /* Process "exp || exp" in preprocessor mode (that is, when the parser is
2587 * called recursively from the preprocessor.
2592 ConstAbsIntExpr (hieAndPP, Expr);
2593 while (CurTok.Tok == TOK_BOOL_OR) {
2599 ConstAbsIntExpr (hieAndPP, &Expr2);
2601 /* Combine the two */
2602 Expr->IVal = (Expr->IVal || Expr2.IVal);
2608 static void hieAnd (ExprDesc* Expr, unsigned TrueLab, int* BoolOp)
2609 /* Process "exp && exp" */
2615 if (CurTok.Tok == TOK_BOOL_AND) {
2617 /* Tell our caller that we're evaluating a boolean */
2620 /* Get a label that we will use for false expressions */
2621 FalseLab = GetLocalLabel ();
2623 /* If the expr hasn't set condition codes, set the force-test flag */
2624 if (!ED_IsTested (Expr)) {
2625 ED_MarkForTest (Expr);
2628 /* Load the value */
2629 LoadExpr (CF_FORCECHAR, Expr);
2631 /* Generate the jump */
2632 g_falsejump (CF_NONE, FalseLab);
2634 /* Parse more boolean and's */
2635 while (CurTok.Tok == TOK_BOOL_AND) {
2642 if (!ED_IsTested (&Expr2)) {
2643 ED_MarkForTest (&Expr2);
2645 LoadExpr (CF_FORCECHAR, &Expr2);
2647 /* Do short circuit evaluation */
2648 if (CurTok.Tok == TOK_BOOL_AND) {
2649 g_falsejump (CF_NONE, FalseLab);
2651 /* Last expression - will evaluate to true */
2652 g_truejump (CF_NONE, TrueLab);
2656 /* Define the false jump label here */
2657 g_defcodelabel (FalseLab);
2659 /* The result is an rvalue in primary */
2660 ED_MakeRValExpr (Expr);
2661 ED_TestDone (Expr); /* Condition codes are set */
2667 static void hieOr (ExprDesc *Expr)
2668 /* Process "exp || exp". */
2671 int BoolOp = 0; /* Did we have a boolean op? */
2672 int AndOp; /* Did we have a && operation? */
2673 unsigned TrueLab; /* Jump to this label if true */
2677 TrueLab = GetLocalLabel ();
2679 /* Call the next level parser */
2680 hieAnd (Expr, TrueLab, &BoolOp);
2682 /* Any boolean or's? */
2683 if (CurTok.Tok == TOK_BOOL_OR) {
2685 /* If the expr hasn't set condition codes, set the force-test flag */
2686 if (!ED_IsTested (Expr)) {
2687 ED_MarkForTest (Expr);
2690 /* Get first expr */
2691 LoadExpr (CF_FORCECHAR, Expr);
2693 /* For each expression jump to TrueLab if true. Beware: If we
2694 * had && operators, the jump is already in place!
2697 g_truejump (CF_NONE, TrueLab);
2700 /* Remember that we had a boolean op */
2703 /* while there's more expr */
2704 while (CurTok.Tok == TOK_BOOL_OR) {
2711 hieAnd (&Expr2, TrueLab, &AndOp);
2712 if (!ED_IsTested (&Expr2)) {
2713 ED_MarkForTest (&Expr2);
2715 LoadExpr (CF_FORCECHAR, &Expr2);
2717 /* If there is more to come, add shortcut boolean eval. */
2718 g_truejump (CF_NONE, TrueLab);
2722 /* The result is an rvalue in primary */
2723 ED_MakeRValExpr (Expr);
2724 ED_TestDone (Expr); /* Condition codes are set */
2727 /* If we really had boolean ops, generate the end sequence */
2729 DoneLab = GetLocalLabel ();
2730 g_getimmed (CF_INT | CF_CONST, 0, 0); /* Load FALSE */
2731 g_falsejump (CF_NONE, DoneLab);
2732 g_defcodelabel (TrueLab);
2733 g_getimmed (CF_INT | CF_CONST, 1, 0); /* Load TRUE */
2734 g_defcodelabel (DoneLab);
2740 static void hieQuest (ExprDesc* Expr)
2741 /* Parse the ternary operator */
2745 CodeMark TrueCodeEnd;
2746 ExprDesc Expr2; /* Expression 2 */
2747 ExprDesc Expr3; /* Expression 3 */
2748 int Expr2IsNULL; /* Expression 2 is a NULL pointer */
2749 int Expr3IsNULL; /* Expression 3 is a NULL pointer */
2750 Type* ResultType; /* Type of result */
2753 /* Call the lower level eval routine */
2754 if (Preprocessing) {
2760 /* Check if it's a ternary expression */
2761 if (CurTok.Tok == TOK_QUEST) {
2763 if (!ED_IsTested (Expr)) {
2764 /* Condition codes not set, request a test */
2765 ED_MarkForTest (Expr);
2767 LoadExpr (CF_NONE, Expr);
2768 FalseLab = GetLocalLabel ();
2769 g_falsejump (CF_NONE, FalseLab);
2771 /* Parse second expression. Remember for later if it is a NULL pointer
2772 * expression, then load it into the primary.
2774 ExprWithCheck (hie1, &Expr2);
2775 Expr2IsNULL = ED_IsNullPtr (&Expr2);
2776 if (!IsTypeVoid (Expr2.Type)) {
2777 /* Load it into the primary */
2778 LoadExpr (CF_NONE, &Expr2);
2779 ED_MakeRValExpr (&Expr2);
2780 Expr2.Type = PtrConversion (Expr2.Type);
2783 /* Remember the current code position */
2784 GetCodePos (&TrueCodeEnd);
2786 /* Jump around the evaluation of the third expression */
2787 TrueLab = GetLocalLabel ();
2791 /* Jump here if the first expression was false */
2792 g_defcodelabel (FalseLab);
2794 /* Parse third expression. Remember for later if it is a NULL pointer
2795 * expression, then load it into the primary.
2797 ExprWithCheck (hie1, &Expr3);
2798 Expr3IsNULL = ED_IsNullPtr (&Expr3);
2799 if (!IsTypeVoid (Expr3.Type)) {
2800 /* Load it into the primary */
2801 LoadExpr (CF_NONE, &Expr3);
2802 ED_MakeRValExpr (&Expr3);
2803 Expr3.Type = PtrConversion (Expr3.Type);
2806 /* Check if any conversions are needed, if so, do them.
2807 * Conversion rules for ?: expression are:
2808 * - if both expressions are int expressions, default promotion
2809 * rules for ints apply.
2810 * - if both expressions are pointers of the same type, the
2811 * result of the expression is of this type.
2812 * - if one of the expressions is a pointer and the other is
2813 * a zero constant, the resulting type is that of the pointer
2815 * - if both expressions are void expressions, the result is of
2817 * - all other cases are flagged by an error.
2819 if (IsClassInt (Expr2.Type) && IsClassInt (Expr3.Type)) {
2821 CodeMark CvtCodeStart;
2822 CodeMark CvtCodeEnd;
2825 /* Get common type */
2826 ResultType = promoteint (Expr2.Type, Expr3.Type);
2828 /* Convert the third expression to this type if needed */
2829 TypeConversion (&Expr3, ResultType);
2831 /* Emit conversion code for the second expression, but remember
2832 * where it starts end ends.
2834 GetCodePos (&CvtCodeStart);
2835 TypeConversion (&Expr2, ResultType);
2836 GetCodePos (&CvtCodeEnd);
2838 /* If we had conversion code, move it to the right place */
2839 if (!CodeRangeIsEmpty (&CvtCodeStart, &CvtCodeEnd)) {
2840 MoveCode (&CvtCodeStart, &CvtCodeEnd, &TrueCodeEnd);
2843 } else if (IsClassPtr (Expr2.Type) && IsClassPtr (Expr3.Type)) {
2844 /* Must point to same type */
2845 if (TypeCmp (Indirect (Expr2.Type), Indirect (Expr3.Type)) < TC_EQUAL) {
2846 Error ("Incompatible pointer types");
2848 /* Result has the common type */
2849 ResultType = Expr2.Type;
2850 } else if (IsClassPtr (Expr2.Type) && Expr3IsNULL) {
2851 /* Result type is pointer, no cast needed */
2852 ResultType = Expr2.Type;
2853 } else if (Expr2IsNULL && IsClassPtr (Expr3.Type)) {
2854 /* Result type is pointer, no cast needed */
2855 ResultType = Expr3.Type;
2856 } else if (IsTypeVoid (Expr2.Type) && IsTypeVoid (Expr3.Type)) {
2857 /* Result type is void */
2858 ResultType = Expr3.Type;
2860 Error ("Incompatible types");
2861 ResultType = Expr2.Type; /* Doesn't matter here */
2864 /* Define the final label */
2865 g_defcodelabel (TrueLab);
2867 /* Setup the target expression */
2868 ED_MakeRValExpr (Expr);
2869 Expr->Type = ResultType;
2875 static void opeq (const GenDesc* Gen, ExprDesc* Expr, const char* Op)
2876 /* Process "op=" operators. */
2883 /* op= can only be used with lvalues */
2884 if (!ED_IsLVal (Expr)) {
2885 Error ("Invalid lvalue in assignment");
2889 /* The left side must not be const qualified */
2890 if (IsQualConst (Expr->Type)) {
2891 Error ("Assignment to const");
2894 /* There must be an integer or pointer on the left side */
2895 if (!IsClassInt (Expr->Type) && !IsTypePtr (Expr->Type)) {
2896 Error ("Invalid left operand type");
2897 /* Continue. Wrong code will be generated, but the compiler won't
2898 * break, so this is the best error recovery.
2902 /* Skip the operator token */
2905 /* Determine the type of the lhs */
2906 flags = TypeOf (Expr->Type);
2907 MustScale = (Gen->Func == g_add || Gen->Func == g_sub) && IsTypePtr (Expr->Type);
2909 /* Get the lhs address on stack (if needed) */
2912 /* Fetch the lhs into the primary register if needed */
2913 LoadExpr (CF_NONE, Expr);
2915 /* Bring the lhs on stack */
2919 /* Evaluate the rhs */
2920 MarkedExprWithCheck (hie1, &Expr2);
2922 /* The rhs must be an integer (or a float, but we don't support that yet */
2923 if (!IsClassInt (Expr2.Type)) {
2924 Error ("Invalid right operand for binary operator `%s'", Op);
2925 /* Continue. Wrong code will be generated, but the compiler won't
2926 * break, so this is the best error recovery.
2930 /* Check for a constant expression */
2931 if (ED_IsConstAbs (&Expr2) && ED_CodeRangeIsEmpty (&Expr2)) {
2932 /* The resulting value is a constant. If the generator has the NOPUSH
2933 * flag set, don't push the lhs.
2935 if (Gen->Flags & GEN_NOPUSH) {
2939 /* lhs is a pointer, scale rhs */
2940 Expr2.IVal *= CheckedSizeOf (Expr->Type+1);
2943 /* If the lhs is character sized, the operation may be later done
2946 if (CheckedSizeOf (Expr->Type) == SIZEOF_CHAR) {
2947 flags |= CF_FORCECHAR;
2950 /* Special handling for add and sub - some sort of a hack, but short code */
2951 if (Gen->Func == g_add) {
2952 g_inc (flags | CF_CONST, Expr2.IVal);
2953 } else if (Gen->Func == g_sub) {
2954 g_dec (flags | CF_CONST, Expr2.IVal);
2956 if (Expr2.IVal == 0) {
2957 /* Check for div by zero/mod by zero */
2958 if (Gen->Func == g_div) {
2959 Error ("Division by zero");
2960 } else if (Gen->Func == g_mod) {
2961 Error ("Modulo operation with zero");
2964 Gen->Func (flags | CF_CONST, Expr2.IVal);
2968 /* rhs is not constant. Load into the primary */
2969 LoadExpr (CF_NONE, &Expr2);
2971 /* lhs is a pointer, scale rhs */
2972 g_scale (TypeOf (Expr2.Type), CheckedSizeOf (Expr->Type+1));
2975 /* If the lhs is character sized, the operation may be later done
2978 if (CheckedSizeOf (Expr->Type) == SIZEOF_CHAR) {
2979 flags |= CF_FORCECHAR;
2982 /* Adjust the types of the operands if needed */
2983 Gen->Func (g_typeadjust (flags, TypeOf (Expr2.Type)), 0);
2986 ED_MakeRValExpr (Expr);
2991 static void addsubeq (const GenDesc* Gen, ExprDesc *Expr, const char* Op)
2992 /* Process the += and -= operators */
3000 /* We're currently only able to handle some adressing modes */
3001 if (ED_GetLoc (Expr) == E_LOC_EXPR || ED_GetLoc (Expr) == E_LOC_PRIMARY) {
3002 /* Use generic routine */
3003 opeq (Gen, Expr, Op);
3007 /* We must have an lvalue */
3008 if (ED_IsRVal (Expr)) {
3009 Error ("Invalid lvalue in assignment");
3013 /* The left side must not be const qualified */
3014 if (IsQualConst (Expr->Type)) {
3015 Error ("Assignment to const");
3018 /* There must be an integer or pointer on the left side */
3019 if (!IsClassInt (Expr->Type) && !IsTypePtr (Expr->Type)) {
3020 Error ("Invalid left operand type");
3021 /* Continue. Wrong code will be generated, but the compiler won't
3022 * break, so this is the best error recovery.
3026 /* Skip the operator */
3029 /* Check if we have a pointer expression and must scale rhs */
3030 MustScale = IsTypePtr (Expr->Type);
3032 /* Initialize the code generator flags */
3036 /* Evaluate the rhs. We expect an integer here, since float is not
3040 if (!IsClassInt (Expr2.Type)) {
3041 Error ("Invalid right operand for binary operator `%s'", Op);
3042 /* Continue. Wrong code will be generated, but the compiler won't
3043 * break, so this is the best error recovery.
3046 if (ED_IsConstAbs (&Expr2)) {
3047 /* The resulting value is a constant. Scale it. */
3049 Expr2.IVal *= CheckedSizeOf (Indirect (Expr->Type));
3054 /* Not constant, load into the primary */
3055 LoadExpr (CF_NONE, &Expr2);
3057 /* lhs is a pointer, scale rhs */
3058 g_scale (TypeOf (Expr2.Type), CheckedSizeOf (Indirect (Expr->Type)));
3062 /* Setup the code generator flags */
3063 lflags |= TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR;
3064 rflags |= TypeOf (Expr2.Type) | CF_FORCECHAR;
3066 /* Convert the type of the lhs to that of the rhs */
3067 g_typecast (lflags, rflags);
3069 /* Output apropriate code depending on the location */
3070 switch (ED_GetLoc (Expr)) {
3073 /* Absolute: numeric address or const */
3074 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3075 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3077 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3082 /* Global variable */
3083 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3084 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3086 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3092 /* Static variable or literal in the literal pool */
3093 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3094 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3096 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3100 case E_LOC_REGISTER:
3101 /* Register variable */
3102 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3103 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3105 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3110 /* Value on the stack */
3111 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3112 g_addeqlocal (lflags, Expr->IVal, Expr2.IVal);
3114 g_subeqlocal (lflags, Expr->IVal, Expr2.IVal);
3119 Internal ("Invalid location in Store(): 0x%04X", ED_GetLoc (Expr));
3122 /* Expression is a rvalue in the primary now */
3123 ED_MakeRValExpr (Expr);
3128 void hie1 (ExprDesc* Expr)
3129 /* Parse first level of expression hierarchy. */
3132 switch (CurTok.Tok) {
3138 case TOK_PLUS_ASSIGN:
3139 addsubeq (&GenPASGN, Expr, "+=");
3142 case TOK_MINUS_ASSIGN:
3143 addsubeq (&GenSASGN, Expr, "-=");
3146 case TOK_MUL_ASSIGN:
3147 opeq (&GenMASGN, Expr, "*=");
3150 case TOK_DIV_ASSIGN:
3151 opeq (&GenDASGN, Expr, "/=");
3154 case TOK_MOD_ASSIGN:
3155 opeq (&GenMOASGN, Expr, "%=");
3158 case TOK_SHL_ASSIGN:
3159 opeq (&GenSLASGN, Expr, "<<=");
3162 case TOK_SHR_ASSIGN:
3163 opeq (&GenSRASGN, Expr, ">>=");
3166 case TOK_AND_ASSIGN:
3167 opeq (&GenAASGN, Expr, "&=");
3170 case TOK_XOR_ASSIGN:
3171 opeq (&GenXOASGN, Expr, "^=");
3175 opeq (&GenOASGN, Expr, "|=");
3185 void hie0 (ExprDesc *Expr)
3186 /* Parse comma operator. */
3189 while (CurTok.Tok == TOK_COMMA) {
3197 int evalexpr (unsigned Flags, void (*Func) (ExprDesc*), ExprDesc* Expr)
3198 /* Will evaluate an expression via the given function. If the result is a
3199 * constant, 0 is returned and the value is put in the Expr struct. If the
3200 * result is not constant, LoadExpr is called to bring the value into the
3201 * primary register and 1 is returned.
3205 ExprWithCheck (Func, Expr);
3207 /* Check for a constant expression */
3208 if (ED_IsConstAbs (Expr)) {
3209 /* Constant expression */
3212 /* Not constant, load into the primary */
3213 LoadExpr (Flags, Expr);
3220 void Expression0 (ExprDesc* Expr)
3221 /* Evaluate an expression via hie0 and put the result into the primary register */
3223 ExprWithCheck (hie0, Expr);
3224 LoadExpr (CF_NONE, Expr);
3229 void ConstExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3230 /* Will evaluate an expression via the given function. If the result is not
3231 * a constant of some sort, a diagnostic will be printed, and the value is
3232 * replaced by a constant one to make sure there are no internal errors that
3233 * result from this input error.
3236 ExprWithCheck (Func, Expr);
3237 if (!ED_IsConst (Expr)) {
3238 Error ("Constant expression expected");
3239 /* To avoid any compiler errors, make the expression a valid const */
3240 ED_MakeConstAbsInt (Expr, 1);
3246 void BoolExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3247 /* Will evaluate an expression via the given function. If the result is not
3248 * something that may be evaluated in a boolean context, a diagnostic will be
3249 * printed, and the value is replaced by a constant one to make sure there
3250 * are no internal errors that result from this input error.
3253 ExprWithCheck (Func, Expr);
3254 if (!ED_IsBool (Expr)) {
3255 Error ("Boolean expression expected");
3256 /* To avoid any compiler errors, make the expression a valid int */
3257 ED_MakeConstAbsInt (Expr, 1);
3263 void ConstAbsIntExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3264 /* Will evaluate an expression via the given function. If the result is not
3265 * a constant numeric integer value, a diagnostic will be printed, and the
3266 * value is replaced by a constant one to make sure there are no internal
3267 * errors that result from this input error.
3270 ExprWithCheck (Func, Expr);
3271 if (!ED_IsConstAbsInt (Expr)) {
3272 Error ("Constant integer expression expected");
3273 /* To avoid any compiler errors, make the expression a valid const */
3274 ED_MakeConstAbsInt (Expr, 1);