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. Be sure to skip the token to avoid endless
769 Error ("Expression expected");
771 ED_MakeConstAbsInt (E, 1);
778 static void ArrayRef (ExprDesc* Expr)
779 /* Handle an array reference. This function needs a rewrite. */
789 /* Skip the bracket */
792 /* Get the type of left side */
795 /* We can apply a special treatment for arrays that have a const base
796 * address. This is true for most arrays and will produce a lot better
797 * code. Check if this is a const base address.
799 ConstBaseAddr = ED_IsRVal (Expr) &&
800 (ED_IsLocConst (Expr) || ED_IsLocStack (Expr));
802 /* If we have a constant base, we delay the address fetch */
804 if (!ConstBaseAddr) {
805 /* Get a pointer to the array into the primary */
806 LoadExpr (CF_NONE, Expr);
808 /* Get the array pointer on stack. Do not push more than 16
809 * bit, even if this value is greater, since we cannot handle
810 * other than 16bit stuff when doing indexing.
816 /* TOS now contains ptr to array elements. Get the subscript. */
817 ExprWithCheck (hie0, &Subscript);
819 /* Check the types of array and subscript. We can either have a
820 * pointer/array to the left, in which case the subscript must be of an
821 * integer type, or we have an integer to the left, in which case the
822 * subscript must be a pointer/array.
823 * Since we do the necessary checking here, we can rely later on the
826 if (IsClassPtr (Expr->Type)) {
827 if (!IsClassInt (Subscript.Type)) {
828 Error ("Array subscript is not an integer");
829 /* To avoid any compiler errors, make the expression a valid int */
830 ED_MakeConstAbsInt (&Subscript, 0);
832 ElementType = Indirect (Expr->Type);
833 } else if (IsClassInt (Expr->Type)) {
834 if (!IsClassPtr (Subscript.Type)) {
835 Error ("Subscripted value is neither array nor pointer");
836 /* To avoid compiler errors, make the subscript a char[] at
839 ED_MakeConstAbs (&Subscript, 0, GetCharArrayType (1));
841 ElementType = Indirect (Subscript.Type);
843 Error ("Cannot subscript");
844 /* To avoid compiler errors, fake both the array and the subscript, so
845 * we can just proceed.
847 ED_MakeConstAbs (Expr, 0, GetCharArrayType (1));
848 ED_MakeConstAbsInt (&Subscript, 0);
849 ElementType = Indirect (Expr->Type);
852 /* If the subscript is a bit-field, load it and make it an rvalue */
853 if (ED_IsBitField (&Subscript)) {
854 LoadExpr (CF_NONE, &Subscript);
855 ED_MakeRValExpr (&Subscript);
858 /* Check if the subscript is constant absolute value */
859 if (ED_IsConstAbs (&Subscript)) {
861 /* The array subscript is a numeric constant. If we had pushed the
862 * array base address onto the stack before, we can remove this value,
863 * since we can generate expression+offset.
865 if (!ConstBaseAddr) {
868 /* Get an array pointer into the primary */
869 LoadExpr (CF_NONE, Expr);
872 if (IsClassPtr (Expr->Type)) {
874 /* Lhs is pointer/array. Scale the subscript value according to
877 Subscript.IVal *= CheckedSizeOf (ElementType);
879 /* Remove the address load code */
882 /* In case of an array, we can adjust the offset of the expression
883 * already in Expr. If the base address was a constant, we can even
884 * remove the code that loaded the address into the primary.
886 if (IsTypeArray (Expr->Type)) {
888 /* Adjust the offset */
889 Expr->IVal += Subscript.IVal;
893 /* It's a pointer, so we do have to load it into the primary
894 * first (if it's not already there).
896 if (ConstBaseAddr || ED_IsLVal (Expr)) {
897 LoadExpr (CF_NONE, Expr);
898 ED_MakeRValExpr (Expr);
902 Expr->IVal = Subscript.IVal;
907 /* Scale the rhs value according to the element type */
908 g_scale (TypeOf (tptr1), CheckedSizeOf (ElementType));
910 /* Add the subscript. Since arrays are indexed by integers,
911 * we will ignore the true type of the subscript here and
912 * use always an int. #### Use offset but beware of LoadExpr!
914 g_inc (CF_INT | CF_CONST, Subscript.IVal);
920 /* Array subscript is not constant. Load it into the primary */
922 LoadExpr (CF_NONE, &Subscript);
925 if (IsClassPtr (Expr->Type)) {
927 /* Indexing is based on unsigneds, so we will just use the integer
928 * portion of the index (which is in (e)ax, so there's no further
931 g_scale (CF_INT, CheckedSizeOf (ElementType));
935 /* Get the int value on top. If we come here, we're sure, both
936 * values are 16 bit (the first one was truncated if necessary
937 * and the second one is a pointer). Note: If ConstBaseAddr is
938 * true, we don't have a value on stack, so to "swap" both, just
939 * push the subscript.
943 LoadExpr (CF_NONE, Expr);
950 g_scale (TypeOf (tptr1), CheckedSizeOf (ElementType));
954 /* The offset is now in the primary register. It we didn't have a
955 * constant base address for the lhs, the lhs address is already
956 * on stack, and we must add the offset. If the base address was
957 * constant, we call special functions to add the address to the
960 if (!ConstBaseAddr) {
962 /* The array base address is on stack and the subscript is in the
969 /* The subscript is in the primary, and the array base address is
970 * in Expr. If the subscript has itself a constant address, it is
971 * often a better idea to reverse again the order of the
972 * evaluation. This will generate better code if the subscript is
973 * a byte sized variable. But beware: This is only possible if the
974 * subscript was not scaled, that is, if this was a byte array
977 if ((ED_IsLocConst (&Subscript) || ED_IsLocStack (&Subscript)) &&
978 CheckedSizeOf (ElementType) == SIZEOF_CHAR) {
982 /* Reverse the order of evaluation */
983 if (CheckedSizeOf (Subscript.Type) == SIZEOF_CHAR) {
990 /* Get a pointer to the array into the primary. */
991 LoadExpr (CF_NONE, Expr);
993 /* Add the variable */
994 if (ED_IsLocStack (&Subscript)) {
995 g_addlocal (Flags, Subscript.IVal);
997 Flags |= GlobalModeFlags (&Subscript);
998 g_addstatic (Flags, Subscript.Name, Subscript.IVal);
1002 if (ED_IsLocAbs (Expr)) {
1003 /* Constant numeric address. Just add it */
1004 g_inc (CF_INT, Expr->IVal);
1005 } else if (ED_IsLocStack (Expr)) {
1006 /* Base address is a local variable address */
1007 if (IsTypeArray (Expr->Type)) {
1008 g_addaddr_local (CF_INT, Expr->IVal);
1010 g_addlocal (CF_PTR, Expr->IVal);
1013 /* Base address is a static variable address */
1014 unsigned Flags = CF_INT | GlobalModeFlags (Expr);
1015 if (ED_IsRVal (Expr)) {
1016 /* Add the address of the location */
1017 g_addaddr_static (Flags, Expr->Name, Expr->IVal);
1019 /* Add the contents of the location */
1020 g_addstatic (Flags, Expr->Name, Expr->IVal);
1028 /* The result is an expression in the primary */
1029 ED_MakeRValExpr (Expr);
1033 /* Result is of element type */
1034 Expr->Type = ElementType;
1036 /* An array element is actually a variable. So the rules for variables
1037 * with respect to the reference type apply: If it's an array, it is
1038 * a rvalue, otherwise it's an lvalue. (A function would also be a rvalue,
1039 * but an array cannot contain functions).
1041 if (IsTypeArray (Expr->Type)) {
1047 /* Consume the closing bracket */
1053 static void StructRef (ExprDesc* Expr)
1054 /* Process struct field after . or ->. */
1059 /* Skip the token and check for an identifier */
1061 if (CurTok.Tok != TOK_IDENT) {
1062 Error ("Identifier expected");
1063 Expr->Type = type_int;
1067 /* Get the symbol table entry and check for a struct field */
1068 strcpy (Ident, CurTok.Ident);
1070 Field = FindStructField (Expr->Type, Ident);
1072 Error ("Struct/union has no field named `%s'", Ident);
1073 Expr->Type = type_int;
1077 /* If we have a struct pointer that is an lvalue and not already in the
1078 * primary, load it now.
1080 if (ED_IsLVal (Expr) && IsTypePtr (Expr->Type)) {
1082 /* Load into the primary */
1083 LoadExpr (CF_NONE, Expr);
1085 /* Make it an lvalue expression */
1086 ED_MakeLValExpr (Expr);
1089 /* Set the struct field offset */
1090 Expr->IVal += Field->V.Offs;
1092 /* The type is now the type of the field */
1093 Expr->Type = Field->Type;
1095 /* An struct member is actually a variable. So the rules for variables
1096 * with respect to the reference type apply: If it's an array, it is
1097 * a rvalue, otherwise it's an lvalue. (A function would also be a rvalue,
1098 * but a struct field cannot be a function).
1100 if (IsTypeArray (Expr->Type)) {
1106 /* Make the expression a bit field if necessary */
1107 if (SymIsBitField (Field)) {
1108 ED_MakeBitField (Expr, Field->V.B.BitOffs, Field->V.B.BitWidth);
1114 static void hie11 (ExprDesc *Expr)
1115 /* Handle compound types (structs and arrays) */
1117 /* Name value used in invalid function calls */
1118 static const char IllegalFunc[] = "illegal_function_call";
1120 /* Evaluate the lhs */
1123 /* Check for a rhs */
1124 while (CurTok.Tok == TOK_LBRACK || CurTok.Tok == TOK_LPAREN ||
1125 CurTok.Tok == TOK_DOT || CurTok.Tok == TOK_PTR_REF) {
1127 switch (CurTok.Tok) {
1130 /* Array reference */
1135 /* Function call. */
1136 if (!IsTypeFunc (Expr->Type) && !IsTypeFuncPtr (Expr->Type)) {
1137 /* Not a function */
1138 Error ("Illegal function call");
1139 /* Force the type to be a implicitly defined function, one
1140 * returning an int and taking any number of arguments.
1141 * Since we don't have a name, invent one.
1143 ED_MakeConstAbs (Expr, 0, GetImplicitFuncType ());
1144 Expr->Name = (long) IllegalFunc;
1146 /* Call the function */
1147 FunctionCall (Expr);
1151 if (!IsClassStruct (Expr->Type)) {
1152 Error ("Struct expected");
1158 /* If we have an array, convert it to pointer to first element */
1159 if (IsTypeArray (Expr->Type)) {
1160 Expr->Type = ArrayToPtr (Expr->Type);
1162 if (!IsClassPtr (Expr->Type) || !IsClassStruct (Indirect (Expr->Type))) {
1163 Error ("Struct pointer expected");
1169 Internal ("Invalid token in hie11: %d", CurTok.Tok);
1177 void Store (ExprDesc* Expr, const Type* StoreType)
1178 /* Store the primary register into the location denoted by Expr. If StoreType
1179 * is given, use this type when storing instead of Expr->Type. If StoreType
1180 * is NULL, use Expr->Type instead.
1185 /* If StoreType was not given, use Expr->Type instead */
1186 if (StoreType == 0) {
1187 StoreType = Expr->Type;
1190 /* Prepare the code generator flags */
1191 Flags = TypeOf (StoreType) | GlobalModeFlags (Expr);
1193 /* Do the store depending on the location */
1194 switch (ED_GetLoc (Expr)) {
1197 /* Absolute: numeric address or const */
1198 g_putstatic (Flags, Expr->IVal, 0);
1202 /* Global variable */
1203 g_putstatic (Flags, Expr->Name, Expr->IVal);
1208 /* Static variable or literal in the literal pool */
1209 g_putstatic (Flags, Expr->Name, Expr->IVal);
1212 case E_LOC_REGISTER:
1213 /* Register variable */
1214 g_putstatic (Flags, Expr->Name, Expr->IVal);
1218 /* Value on the stack */
1219 g_putlocal (Flags, Expr->IVal, 0);
1223 /* The primary register (value is already there) */
1227 /* An expression in the primary register */
1228 g_putind (Flags, Expr->IVal);
1232 Internal ("Invalid location in Store(): 0x%04X", ED_GetLoc (Expr));
1235 /* Assume that each one of the stores will invalidate CC */
1236 ED_MarkAsUntested (Expr);
1241 static void PreInc (ExprDesc* Expr)
1242 /* Handle the preincrement operators */
1247 /* Skip the operator token */
1250 /* Evaluate the expression and check that it is an lvalue */
1252 if (!ED_IsLVal (Expr)) {
1253 Error ("Invalid lvalue");
1257 /* We cannot modify const values */
1258 if (IsQualConst (Expr->Type)) {
1259 Error ("Increment of read-only variable");
1262 /* Get the data type */
1263 Flags = TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR | CF_CONST;
1265 /* Get the increment value in bytes */
1266 Val = IsTypePtr (Expr->Type)? CheckedPSizeOf (Expr->Type) : 1;
1268 /* Check the location of the data */
1269 switch (ED_GetLoc (Expr)) {
1272 /* Absolute: numeric address or const */
1273 g_addeqstatic (Flags, Expr->IVal, 0, Val);
1277 /* Global variable */
1278 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1283 /* Static variable or literal in the literal pool */
1284 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1287 case E_LOC_REGISTER:
1288 /* Register variable */
1289 g_addeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1293 /* Value on the stack */
1294 g_addeqlocal (Flags, Expr->IVal, Val);
1298 /* The primary register */
1303 /* An expression in the primary register */
1304 g_addeqind (Flags, Expr->IVal, Val);
1308 Internal ("Invalid location in PreInc(): 0x%04X", ED_GetLoc (Expr));
1311 /* Result is an expression, no reference */
1312 ED_MakeRValExpr (Expr);
1317 static void PreDec (ExprDesc* Expr)
1318 /* Handle the predecrement operators */
1323 /* Skip the operator token */
1326 /* Evaluate the expression and check that it is an lvalue */
1328 if (!ED_IsLVal (Expr)) {
1329 Error ("Invalid lvalue");
1333 /* We cannot modify const values */
1334 if (IsQualConst (Expr->Type)) {
1335 Error ("Decrement of read-only variable");
1338 /* Get the data type */
1339 Flags = TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR | CF_CONST;
1341 /* Get the increment value in bytes */
1342 Val = IsTypePtr (Expr->Type)? CheckedPSizeOf (Expr->Type) : 1;
1344 /* Check the location of the data */
1345 switch (ED_GetLoc (Expr)) {
1348 /* Absolute: numeric address or const */
1349 g_subeqstatic (Flags, Expr->IVal, 0, Val);
1353 /* Global variable */
1354 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1359 /* Static variable or literal in the literal pool */
1360 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1363 case E_LOC_REGISTER:
1364 /* Register variable */
1365 g_subeqstatic (Flags, Expr->Name, Expr->IVal, Val);
1369 /* Value on the stack */
1370 g_subeqlocal (Flags, Expr->IVal, Val);
1374 /* The primary register */
1379 /* An expression in the primary register */
1380 g_subeqind (Flags, Expr->IVal, Val);
1384 Internal ("Invalid location in PreDec(): 0x%04X", ED_GetLoc (Expr));
1387 /* Result is an expression, no reference */
1388 ED_MakeRValExpr (Expr);
1393 static void PostInc (ExprDesc* Expr)
1394 /* Handle the postincrement operator */
1400 /* The expression to increment must be an lvalue */
1401 if (!ED_IsLVal (Expr)) {
1402 Error ("Invalid lvalue");
1406 /* We cannot modify const values */
1407 if (IsQualConst (Expr->Type)) {
1408 Error ("Increment of read-only variable");
1411 /* Get the data type */
1412 Flags = TypeOf (Expr->Type);
1414 /* Push the address if needed */
1417 /* Fetch the value and save it (since it's the result of the expression) */
1418 LoadExpr (CF_NONE, Expr);
1419 g_save (Flags | CF_FORCECHAR);
1421 /* If we have a pointer expression, increment by the size of the type */
1422 if (IsTypePtr (Expr->Type)) {
1423 g_inc (Flags | CF_CONST | CF_FORCECHAR, CheckedSizeOf (Expr->Type + 1));
1425 g_inc (Flags | CF_CONST | CF_FORCECHAR, 1);
1428 /* Store the result back */
1431 /* Restore the original value in the primary register */
1432 g_restore (Flags | CF_FORCECHAR);
1434 /* The result is always an expression, no reference */
1435 ED_MakeRValExpr (Expr);
1440 static void PostDec (ExprDesc* Expr)
1441 /* Handle the postdecrement operator */
1447 /* The expression to increment must be an lvalue */
1448 if (!ED_IsLVal (Expr)) {
1449 Error ("Invalid lvalue");
1453 /* We cannot modify const values */
1454 if (IsQualConst (Expr->Type)) {
1455 Error ("Decrement of read-only variable");
1458 /* Get the data type */
1459 Flags = TypeOf (Expr->Type);
1461 /* Push the address if needed */
1464 /* Fetch the value and save it (since it's the result of the expression) */
1465 LoadExpr (CF_NONE, Expr);
1466 g_save (Flags | CF_FORCECHAR);
1468 /* If we have a pointer expression, increment by the size of the type */
1469 if (IsTypePtr (Expr->Type)) {
1470 g_dec (Flags | CF_CONST | CF_FORCECHAR, CheckedSizeOf (Expr->Type + 1));
1472 g_dec (Flags | CF_CONST | CF_FORCECHAR, 1);
1475 /* Store the result back */
1478 /* Restore the original value in the primary register */
1479 g_restore (Flags | CF_FORCECHAR);
1481 /* The result is always an expression, no reference */
1482 ED_MakeRValExpr (Expr);
1487 static void UnaryOp (ExprDesc* Expr)
1488 /* Handle unary -/+ and ~ */
1492 /* Remember the operator token and skip it */
1493 token_t Tok = CurTok.Tok;
1496 /* Get the expression */
1499 /* We can only handle integer types */
1500 if (!IsClassInt (Expr->Type)) {
1501 Error ("Argument must have integer type");
1502 ED_MakeConstAbsInt (Expr, 1);
1505 /* Check for a constant expression */
1506 if (ED_IsConstAbs (Expr)) {
1507 /* Value is constant */
1509 case TOK_MINUS: Expr->IVal = -Expr->IVal; break;
1510 case TOK_PLUS: break;
1511 case TOK_COMP: Expr->IVal = ~Expr->IVal; break;
1512 default: Internal ("Unexpected token: %d", Tok);
1515 /* Value is not constant */
1516 LoadExpr (CF_NONE, Expr);
1518 /* Get the type of the expression */
1519 Flags = TypeOf (Expr->Type);
1521 /* Handle the operation */
1523 case TOK_MINUS: g_neg (Flags); break;
1524 case TOK_PLUS: break;
1525 case TOK_COMP: g_com (Flags); break;
1526 default: Internal ("Unexpected token: %d", Tok);
1529 /* The result is a rvalue in the primary */
1530 ED_MakeRValExpr (Expr);
1536 void hie10 (ExprDesc* Expr)
1537 /* Handle ++, --, !, unary - etc. */
1541 switch (CurTok.Tok) {
1559 if (evalexpr (CF_NONE, hie10, Expr) == 0) {
1560 /* Constant expression */
1561 Expr->IVal = !Expr->IVal;
1563 g_bneg (TypeOf (Expr->Type));
1564 ED_MakeRValExpr (Expr);
1565 ED_TestDone (Expr); /* bneg will set cc */
1571 ExprWithCheck (hie10, Expr);
1572 if (ED_IsLVal (Expr) || !(ED_IsLocConst (Expr) || ED_IsLocStack (Expr))) {
1573 /* Not a const, load it into the primary and make it a
1576 LoadExpr (CF_NONE, Expr);
1577 ED_MakeRValExpr (Expr);
1579 /* If the expression is already a pointer to function, the
1580 * additional dereferencing operator must be ignored.
1582 if (IsTypeFuncPtr (Expr->Type)) {
1583 /* Expression not storable */
1586 if (IsClassPtr (Expr->Type)) {
1587 Expr->Type = Indirect (Expr->Type);
1589 Error ("Illegal indirection");
1591 /* The * operator yields an lvalue */
1598 ExprWithCheck (hie10, Expr);
1599 /* The & operator may be applied to any lvalue, and it may be
1600 * applied to functions, even if they're no lvalues.
1602 if (ED_IsRVal (Expr) && !IsTypeFunc (Expr->Type) && !IsTypeArray (Expr->Type)) {
1603 Error ("Illegal address");
1605 if (ED_IsBitField (Expr)) {
1606 Error ("Cannot take address of bit-field");
1607 /* Do it anyway, just to avoid further warnings */
1608 Expr->Flags &= ~E_BITFIELD;
1610 Expr->Type = PointerTo (Expr->Type);
1611 /* The & operator yields an rvalue */
1618 if (TypeSpecAhead ()) {
1621 Size = CheckedSizeOf (ParseType (T));
1624 /* Remember the output queue pointer */
1628 Size = CheckedSizeOf (Expr->Type);
1629 /* Remove any generated code */
1632 ED_MakeConstAbs (Expr, Size, type_size_t);
1633 ED_MarkAsUntested (Expr);
1637 if (TypeSpecAhead ()) {
1647 /* Handle post increment */
1648 switch (CurTok.Tok) {
1649 case TOK_INC: PostInc (Expr); break;
1650 case TOK_DEC: PostDec (Expr); break;
1661 static void hie_internal (const GenDesc* Ops, /* List of generators */
1663 void (*hienext) (ExprDesc*),
1665 /* Helper function */
1671 token_t Tok; /* The operator token */
1672 unsigned ltype, type;
1673 int rconst; /* Operand is a constant */
1679 while ((Gen = FindGen (CurTok.Tok, Ops)) != 0) {
1681 /* Tell the caller that we handled it's ops */
1684 /* All operators that call this function expect an int on the lhs */
1685 if (!IsClassInt (Expr->Type)) {
1686 Error ("Integer expression expected");
1687 /* To avoid further errors, make Expr a valid int expression */
1688 ED_MakeConstAbsInt (Expr, 1);
1691 /* Remember the operator token, then skip it */
1695 /* Get the lhs on stack */
1696 GetCodePos (&Mark1);
1697 ltype = TypeOf (Expr->Type);
1698 if (ED_IsConstAbs (Expr)) {
1699 /* Constant value */
1700 GetCodePos (&Mark2);
1701 g_push (ltype | CF_CONST, Expr->IVal);
1703 /* Value not constant */
1704 LoadExpr (CF_NONE, Expr);
1705 GetCodePos (&Mark2);
1709 /* Get the right hand side */
1710 rconst = (evalexpr (CF_NONE, hienext, &Expr2) == 0);
1712 /* Check the type of the rhs */
1713 if (!IsClassInt (Expr2.Type)) {
1714 Error ("Integer expression expected");
1717 /* Check for const operands */
1718 if (ED_IsConstAbs (Expr) && rconst) {
1720 /* Both operands are constant, remove the generated code */
1721 RemoveCode (&Mark1);
1723 /* Get the type of the result */
1724 Expr->Type = promoteint (Expr->Type, Expr2.Type);
1726 /* Handle the op differently for signed and unsigned types */
1727 if (IsSignSigned (Expr->Type)) {
1729 /* Evaluate the result for signed operands */
1730 signed long Val1 = Expr->IVal;
1731 signed long Val2 = Expr2.IVal;
1734 Expr->IVal = (Val1 | Val2);
1737 Expr->IVal = (Val1 ^ Val2);
1740 Expr->IVal = (Val1 & Val2);
1743 Expr->IVal = (Val1 * Val2);
1747 Error ("Division by zero");
1748 Expr->IVal = 0x7FFFFFFF;
1750 Expr->IVal = (Val1 / Val2);
1755 Error ("Modulo operation with zero");
1758 Expr->IVal = (Val1 % Val2);
1762 Internal ("hie_internal: got token 0x%X\n", Tok);
1766 /* Evaluate the result for unsigned operands */
1767 unsigned long Val1 = Expr->IVal;
1768 unsigned long Val2 = Expr2.IVal;
1771 Expr->IVal = (Val1 | Val2);
1774 Expr->IVal = (Val1 ^ Val2);
1777 Expr->IVal = (Val1 & Val2);
1780 Expr->IVal = (Val1 * Val2);
1784 Error ("Division by zero");
1785 Expr->IVal = 0xFFFFFFFF;
1787 Expr->IVal = (Val1 / Val2);
1792 Error ("Modulo operation with zero");
1795 Expr->IVal = (Val1 % Val2);
1799 Internal ("hie_internal: got token 0x%X\n", Tok);
1805 /* If the right hand side is constant, and the generator function
1806 * expects the lhs in the primary, remove the push of the primary
1809 unsigned rtype = TypeOf (Expr2.Type);
1812 /* Second value is constant - check for div */
1815 if (Tok == TOK_DIV && Expr2.IVal == 0) {
1816 Error ("Division by zero");
1817 } else if (Tok == TOK_MOD && Expr2.IVal == 0) {
1818 Error ("Modulo operation with zero");
1820 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1821 RemoveCode (&Mark2);
1822 ltype |= CF_REG; /* Value is in register */
1826 /* Determine the type of the operation result. */
1827 type |= g_typeadjust (ltype, rtype);
1828 Expr->Type = promoteint (Expr->Type, Expr2.Type);
1831 Gen->Func (type, Expr2.IVal);
1833 /* We have a rvalue in the primary now */
1834 ED_MakeRValExpr (Expr);
1841 static void hie_compare (const GenDesc* Ops, /* List of generators */
1843 void (*hienext) (ExprDesc*))
1844 /* Helper function for the compare operators */
1850 token_t Tok; /* The operator token */
1852 int rconst; /* Operand is a constant */
1857 while ((Gen = FindGen (CurTok.Tok, Ops)) != 0) {
1859 /* Remember the operator token, then skip it */
1863 /* Get the lhs on stack */
1864 GetCodePos (&Mark1);
1865 ltype = TypeOf (Expr->Type);
1866 if (ED_IsConstAbs (Expr)) {
1867 /* Constant value */
1868 GetCodePos (&Mark2);
1869 g_push (ltype | CF_CONST, Expr->IVal);
1871 /* Value not constant */
1872 LoadExpr (CF_NONE, Expr);
1873 GetCodePos (&Mark2);
1877 /* Get the right hand side */
1878 rconst = (evalexpr (CF_NONE, hienext, &Expr2) == 0);
1880 /* Make sure, the types are compatible */
1881 if (IsClassInt (Expr->Type)) {
1882 if (!IsClassInt (Expr2.Type) && !(IsClassPtr(Expr2.Type) && ED_IsNullPtr(Expr))) {
1883 Error ("Incompatible types");
1885 } else if (IsClassPtr (Expr->Type)) {
1886 if (IsClassPtr (Expr2.Type)) {
1887 /* Both pointers are allowed in comparison if they point to
1888 * the same type, or if one of them is a void pointer.
1890 Type* left = Indirect (Expr->Type);
1891 Type* right = Indirect (Expr2.Type);
1892 if (TypeCmp (left, right) < TC_EQUAL && left->C != T_VOID && right->C != T_VOID) {
1893 /* Incomatible pointers */
1894 Error ("Incompatible types");
1896 } else if (!ED_IsNullPtr (&Expr2)) {
1897 Error ("Incompatible types");
1901 /* Check for const operands */
1902 if (ED_IsConstAbs (Expr) && rconst) {
1904 /* If the result is constant, this is suspicious when not in
1905 * preprocessor mode.
1907 if (!Preprocessing) {
1908 Warning ("Result of comparison is constant");
1911 /* Both operands are constant, remove the generated code */
1912 RemoveCode (&Mark1);
1914 /* Determine if this is a signed or unsigned compare */
1915 if (IsClassInt (Expr->Type) && IsSignSigned (Expr->Type) &&
1916 IsClassInt (Expr2.Type) && IsSignSigned (Expr2.Type)) {
1918 /* Evaluate the result for signed operands */
1919 signed long Val1 = Expr->IVal;
1920 signed long Val2 = Expr2.IVal;
1922 case TOK_EQ: Expr->IVal = (Val1 == Val2); break;
1923 case TOK_NE: Expr->IVal = (Val1 != Val2); break;
1924 case TOK_LT: Expr->IVal = (Val1 < Val2); break;
1925 case TOK_LE: Expr->IVal = (Val1 <= Val2); break;
1926 case TOK_GE: Expr->IVal = (Val1 >= Val2); break;
1927 case TOK_GT: Expr->IVal = (Val1 > Val2); break;
1928 default: Internal ("hie_compare: got token 0x%X\n", Tok);
1933 /* Evaluate the result for unsigned operands */
1934 unsigned long Val1 = Expr->IVal;
1935 unsigned long Val2 = Expr2.IVal;
1937 case TOK_EQ: Expr->IVal = (Val1 == Val2); break;
1938 case TOK_NE: Expr->IVal = (Val1 != Val2); break;
1939 case TOK_LT: Expr->IVal = (Val1 < Val2); break;
1940 case TOK_LE: Expr->IVal = (Val1 <= Val2); break;
1941 case TOK_GE: Expr->IVal = (Val1 >= Val2); break;
1942 case TOK_GT: Expr->IVal = (Val1 > Val2); break;
1943 default: Internal ("hie_compare: got token 0x%X\n", Tok);
1949 /* If the right hand side is constant, and the generator function
1950 * expects the lhs in the primary, remove the push of the primary
1956 if ((Gen->Flags & GEN_NOPUSH) != 0) {
1957 RemoveCode (&Mark2);
1958 ltype |= CF_REG; /* Value is in register */
1962 /* Determine the type of the operation result. If the left
1963 * operand is of type char and the right is a constant, or
1964 * if both operands are of type char, we will encode the
1965 * operation as char operation. Otherwise the default
1966 * promotions are used.
1968 if (IsTypeChar (Expr->Type) && (IsTypeChar (Expr2.Type) || rconst)) {
1970 if (IsSignUnsigned (Expr->Type) || IsSignUnsigned (Expr2.Type)) {
1971 flags |= CF_UNSIGNED;
1974 flags |= CF_FORCECHAR;
1977 unsigned rtype = TypeOf (Expr2.Type) | (flags & CF_CONST);
1978 flags |= g_typeadjust (ltype, rtype);
1982 Gen->Func (flags, Expr2.IVal);
1984 /* The result is an rvalue in the primary */
1985 ED_MakeRValExpr (Expr);
1988 /* Result type is always int */
1989 Expr->Type = type_int;
1991 /* Condition codes are set */
1998 static void hie9 (ExprDesc *Expr)
1999 /* Process * and / operators. */
2001 static const GenDesc hie9_ops[] = {
2002 { TOK_STAR, GEN_NOPUSH, g_mul },
2003 { TOK_DIV, GEN_NOPUSH, g_div },
2004 { TOK_MOD, GEN_NOPUSH, g_mod },
2005 { TOK_INVALID, 0, 0 }
2009 hie_internal (hie9_ops, Expr, hie10, &UsedGen);
2014 static void parseadd (ExprDesc* Expr)
2015 /* Parse an expression with the binary plus operator. Expr contains the
2016 * unprocessed left hand side of the expression and will contain the
2017 * result of the expression on return.
2021 unsigned flags; /* Operation flags */
2022 CodeMark Mark; /* Remember code position */
2023 Type* lhst; /* Type of left hand side */
2024 Type* rhst; /* Type of right hand side */
2027 /* Skip the PLUS token */
2030 /* Get the left hand side type, initialize operation flags */
2034 /* Check for constness on both sides */
2035 if (ED_IsConst (Expr)) {
2037 /* The left hand side is a constant of some sort. Good. Get rhs */
2039 if (ED_IsConstAbs (&Expr2)) {
2041 /* Right hand side is a constant numeric value. Get the rhs type */
2044 /* Both expressions are constants. Check for pointer arithmetic */
2045 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2046 /* Left is pointer, right is int, must scale rhs */
2047 Expr->IVal += Expr2.IVal * CheckedPSizeOf (lhst);
2048 /* Result type is a pointer */
2049 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2050 /* Left is int, right is pointer, must scale lhs */
2051 Expr->IVal = Expr->IVal * CheckedPSizeOf (rhst) + Expr2.IVal;
2052 /* Result type is a pointer */
2053 Expr->Type = Expr2.Type;
2054 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2055 /* Integer addition */
2056 Expr->IVal += Expr2.IVal;
2057 typeadjust (Expr, &Expr2, 1);
2060 Error ("Invalid operands for binary operator `+'");
2065 /* lhs is a constant and rhs is not constant. Load rhs into
2068 LoadExpr (CF_NONE, &Expr2);
2070 /* Beware: The check above (for lhs) lets not only pass numeric
2071 * constants, but also constant addresses (labels), maybe even
2072 * with an offset. We have to check for that here.
2075 /* First, get the rhs type. */
2079 if (ED_IsLocAbs (Expr)) {
2080 /* A numerical constant */
2083 /* Constant address label */
2084 flags |= GlobalModeFlags (Expr) | CF_CONSTADDR;
2087 /* Check for pointer arithmetic */
2088 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2089 /* Left is pointer, right is int, must scale rhs */
2090 g_scale (CF_INT, CheckedPSizeOf (lhst));
2091 /* Operate on pointers, result type is a pointer */
2093 /* Generate the code for the add */
2094 if (ED_GetLoc (Expr) == E_LOC_ABS) {
2095 /* Numeric constant */
2096 g_inc (flags, Expr->IVal);
2098 /* Constant address */
2099 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2101 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2103 /* Left is int, right is pointer, must scale lhs. */
2104 unsigned ScaleFactor = CheckedPSizeOf (rhst);
2106 /* Operate on pointers, result type is a pointer */
2108 Expr->Type = Expr2.Type;
2110 /* Since we do already have rhs in the primary, if lhs is
2111 * not a numeric constant, and the scale factor is not one
2112 * (no scaling), we must take the long way over the stack.
2114 if (ED_IsLocAbs (Expr)) {
2115 /* Numeric constant, scale lhs */
2116 Expr->IVal *= ScaleFactor;
2117 /* Generate the code for the add */
2118 g_inc (flags, Expr->IVal);
2119 } else if (ScaleFactor == 1) {
2120 /* Constant address but no need to scale */
2121 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2123 /* Constant address that must be scaled */
2124 g_push (TypeOf (Expr2.Type), 0); /* rhs --> stack */
2125 g_getimmed (flags, Expr->Name, Expr->IVal);
2126 g_scale (CF_PTR, ScaleFactor);
2129 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2130 /* Integer addition */
2131 flags |= typeadjust (Expr, &Expr2, 1);
2132 /* Generate the code for the add */
2133 if (ED_IsLocAbs (Expr)) {
2134 /* Numeric constant */
2135 g_inc (flags, Expr->IVal);
2137 /* Constant address */
2138 g_addaddr_static (flags, Expr->Name, Expr->IVal);
2142 Error ("Invalid operands for binary operator `+'");
2146 /* Result is a rvalue in primary register */
2147 ED_MakeRValExpr (Expr);
2152 /* Left hand side is not constant. Get the value onto the stack. */
2153 LoadExpr (CF_NONE, Expr); /* --> primary register */
2155 g_push (TypeOf (Expr->Type), 0); /* --> stack */
2157 /* Evaluate the rhs */
2158 if (evalexpr (CF_NONE, hie9, &Expr2) == 0) {
2160 /* Right hand side is a constant. Get the rhs type */
2163 /* Remove pushed value from stack */
2166 /* Check for pointer arithmetic */
2167 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2168 /* Left is pointer, right is int, must scale rhs */
2169 Expr2.IVal *= CheckedPSizeOf (lhst);
2170 /* Operate on pointers, result type is a pointer */
2172 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2173 /* Left is int, right is pointer, must scale lhs (ptr only) */
2174 g_scale (CF_INT | CF_CONST, CheckedPSizeOf (rhst));
2175 /* Operate on pointers, result type is a pointer */
2177 Expr->Type = Expr2.Type;
2178 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2179 /* Integer addition */
2180 flags = typeadjust (Expr, &Expr2, 1);
2183 Error ("Invalid operands for binary operator `+'");
2187 /* Generate code for the add */
2188 g_inc (flags | CF_CONST, Expr2.IVal);
2192 /* lhs and rhs are not constant. Get the rhs type. */
2195 /* Check for pointer arithmetic */
2196 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2197 /* Left is pointer, right is int, must scale rhs */
2198 g_scale (CF_INT, CheckedPSizeOf (lhst));
2199 /* Operate on pointers, result type is a pointer */
2201 } else if (IsClassInt (lhst) && IsClassPtr (rhst)) {
2202 /* Left is int, right is pointer, must scale lhs */
2203 g_tosint (TypeOf (rhst)); /* Make sure, TOS is int */
2204 g_swap (CF_INT); /* Swap TOS and primary */
2205 g_scale (CF_INT, CheckedPSizeOf (rhst));
2206 /* Operate on pointers, result type is a pointer */
2208 Expr->Type = Expr2.Type;
2209 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2210 /* Integer addition. Note: Result is never constant.
2211 * Problem here is that typeadjust does not know if the
2212 * variable is an rvalue or lvalue, so if both operands
2213 * are dereferenced constant numeric addresses, typeadjust
2214 * thinks the operation works on constants. Removing
2215 * CF_CONST here means handling the symptoms, however, the
2216 * whole parser is such a mess that I fear to break anything
2217 * when trying to apply another solution.
2219 flags = typeadjust (Expr, &Expr2, 0) & ~CF_CONST;
2222 Error ("Invalid operands for binary operator `+'");
2226 /* Generate code for the add */
2231 /* Result is a rvalue in primary register */
2232 ED_MakeRValExpr (Expr);
2235 /* Condition codes not set */
2236 ED_MarkAsUntested (Expr);
2242 static void parsesub (ExprDesc* Expr)
2243 /* Parse an expression with the binary minus operator. Expr contains the
2244 * unprocessed left hand side of the expression and will contain the
2245 * result of the expression on return.
2249 unsigned flags; /* Operation flags */
2250 Type* lhst; /* Type of left hand side */
2251 Type* rhst; /* Type of right hand side */
2252 CodeMark Mark1; /* Save position of output queue */
2253 CodeMark Mark2; /* Another position in the queue */
2254 int rscale; /* Scale factor for the result */
2257 /* Skip the MINUS token */
2260 /* Get the left hand side type, initialize operation flags */
2262 rscale = 1; /* Scale by 1, that is, don't scale */
2264 /* Remember the output queue position, then bring the value onto the stack */
2265 GetCodePos (&Mark1);
2266 LoadExpr (CF_NONE, Expr); /* --> primary register */
2267 GetCodePos (&Mark2);
2268 g_push (TypeOf (lhst), 0); /* --> stack */
2270 /* Parse the right hand side */
2271 if (evalexpr (CF_NONE, hie9, &Expr2) == 0) {
2273 /* The right hand side is constant. Get the rhs type. */
2276 /* Check left hand side */
2277 if (ED_IsConstAbs (Expr)) {
2279 /* Both sides are constant, remove generated code */
2280 RemoveCode (&Mark1);
2282 /* Check for pointer arithmetic */
2283 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2284 /* Left is pointer, right is int, must scale rhs */
2285 Expr->IVal -= Expr2.IVal * CheckedPSizeOf (lhst);
2286 /* Operate on pointers, result type is a pointer */
2287 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2288 /* Left is pointer, right is pointer, must scale result */
2289 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2290 Error ("Incompatible pointer types");
2292 Expr->IVal = (Expr->IVal - Expr2.IVal) /
2293 CheckedPSizeOf (lhst);
2295 /* Operate on pointers, result type is an integer */
2296 Expr->Type = type_int;
2297 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2298 /* Integer subtraction */
2299 typeadjust (Expr, &Expr2, 1);
2300 Expr->IVal -= Expr2.IVal;
2303 Error ("Invalid operands for binary operator `-'");
2306 /* Result is constant, condition codes not set */
2307 ED_MarkAsUntested (Expr);
2311 /* Left hand side is not constant, right hand side is.
2312 * Remove pushed value from stack.
2314 RemoveCode (&Mark2);
2316 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2317 /* Left is pointer, right is int, must scale rhs */
2318 Expr2.IVal *= CheckedPSizeOf (lhst);
2319 /* Operate on pointers, result type is a pointer */
2321 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2322 /* Left is pointer, right is pointer, must scale result */
2323 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2324 Error ("Incompatible pointer types");
2326 rscale = CheckedPSizeOf (lhst);
2328 /* Operate on pointers, result type is an integer */
2330 Expr->Type = type_int;
2331 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2332 /* Integer subtraction */
2333 flags = typeadjust (Expr, &Expr2, 1);
2336 Error ("Invalid operands for binary operator `-'");
2340 /* Do the subtraction */
2341 g_dec (flags | CF_CONST, Expr2.IVal);
2343 /* If this was a pointer subtraction, we must scale the result */
2345 g_scale (flags, -rscale);
2348 /* Result is a rvalue in the primary register */
2349 ED_MakeRValExpr (Expr);
2350 ED_MarkAsUntested (Expr);
2356 /* Right hand side is not constant. Get the rhs type. */
2359 /* Check for pointer arithmetic */
2360 if (IsClassPtr (lhst) && IsClassInt (rhst)) {
2361 /* Left is pointer, right is int, must scale rhs */
2362 g_scale (CF_INT, CheckedPSizeOf (lhst));
2363 /* Operate on pointers, result type is a pointer */
2365 } else if (IsClassPtr (lhst) && IsClassPtr (rhst)) {
2366 /* Left is pointer, right is pointer, must scale result */
2367 if (TypeCmp (Indirect (lhst), Indirect (rhst)) < TC_QUAL_DIFF) {
2368 Error ("Incompatible pointer types");
2370 rscale = CheckedPSizeOf (lhst);
2372 /* Operate on pointers, result type is an integer */
2374 Expr->Type = type_int;
2375 } else if (IsClassInt (lhst) && IsClassInt (rhst)) {
2376 /* Integer subtraction. If the left hand side descriptor says that
2377 * the lhs is const, we have to remove this mark, since this is no
2378 * longer true, lhs is on stack instead.
2380 if (ED_IsLocAbs (Expr)) {
2381 ED_MakeRValExpr (Expr);
2383 /* Adjust operand types */
2384 flags = typeadjust (Expr, &Expr2, 0);
2387 Error ("Invalid operands for binary operator `-'");
2391 /* Generate code for the sub (the & is a hack here) */
2392 g_sub (flags & ~CF_CONST, 0);
2394 /* If this was a pointer subtraction, we must scale the result */
2396 g_scale (flags, -rscale);
2399 /* Result is a rvalue in the primary register */
2400 ED_MakeRValExpr (Expr);
2401 ED_MarkAsUntested (Expr);
2407 void hie8 (ExprDesc* Expr)
2408 /* Process + and - binary operators. */
2411 while (CurTok.Tok == TOK_PLUS || CurTok.Tok == TOK_MINUS) {
2412 if (CurTok.Tok == TOK_PLUS) {
2422 static void hie6 (ExprDesc* Expr)
2423 /* Handle greater-than type comparators */
2425 static const GenDesc hie6_ops [] = {
2426 { TOK_LT, GEN_NOPUSH, g_lt },
2427 { TOK_LE, GEN_NOPUSH, g_le },
2428 { TOK_GE, GEN_NOPUSH, g_ge },
2429 { TOK_GT, GEN_NOPUSH, g_gt },
2430 { TOK_INVALID, 0, 0 }
2432 hie_compare (hie6_ops, Expr, ShiftExpr);
2437 static void hie5 (ExprDesc* Expr)
2438 /* Handle == and != */
2440 static const GenDesc hie5_ops[] = {
2441 { TOK_EQ, GEN_NOPUSH, g_eq },
2442 { TOK_NE, GEN_NOPUSH, g_ne },
2443 { TOK_INVALID, 0, 0 }
2445 hie_compare (hie5_ops, Expr, hie6);
2450 static void hie4 (ExprDesc* Expr)
2451 /* Handle & (bitwise and) */
2453 static const GenDesc hie4_ops[] = {
2454 { TOK_AND, GEN_NOPUSH, g_and },
2455 { TOK_INVALID, 0, 0 }
2459 hie_internal (hie4_ops, Expr, hie5, &UsedGen);
2464 static void hie3 (ExprDesc* Expr)
2465 /* Handle ^ (bitwise exclusive or) */
2467 static const GenDesc hie3_ops[] = {
2468 { TOK_XOR, GEN_NOPUSH, g_xor },
2469 { TOK_INVALID, 0, 0 }
2473 hie_internal (hie3_ops, Expr, hie4, &UsedGen);
2478 static void hie2 (ExprDesc* Expr)
2479 /* Handle | (bitwise or) */
2481 static const GenDesc hie2_ops[] = {
2482 { TOK_OR, GEN_NOPUSH, g_or },
2483 { TOK_INVALID, 0, 0 }
2487 hie_internal (hie2_ops, Expr, hie3, &UsedGen);
2492 static void hieAndPP (ExprDesc* Expr)
2493 /* Process "exp && exp" in preprocessor mode (that is, when the parser is
2494 * called recursively from the preprocessor.
2499 ConstAbsIntExpr (hie2, Expr);
2500 while (CurTok.Tok == TOK_BOOL_AND) {
2506 ConstAbsIntExpr (hie2, &Expr2);
2508 /* Combine the two */
2509 Expr->IVal = (Expr->IVal && Expr2.IVal);
2515 static void hieOrPP (ExprDesc *Expr)
2516 /* Process "exp || exp" in preprocessor mode (that is, when the parser is
2517 * called recursively from the preprocessor.
2522 ConstAbsIntExpr (hieAndPP, Expr);
2523 while (CurTok.Tok == TOK_BOOL_OR) {
2529 ConstAbsIntExpr (hieAndPP, &Expr2);
2531 /* Combine the two */
2532 Expr->IVal = (Expr->IVal || Expr2.IVal);
2538 static void hieAnd (ExprDesc* Expr, unsigned TrueLab, int* BoolOp)
2539 /* Process "exp && exp" */
2545 if (CurTok.Tok == TOK_BOOL_AND) {
2547 /* Tell our caller that we're evaluating a boolean */
2550 /* Get a label that we will use for false expressions */
2551 FalseLab = GetLocalLabel ();
2553 /* If the expr hasn't set condition codes, set the force-test flag */
2554 if (!ED_IsTested (Expr)) {
2555 ED_MarkForTest (Expr);
2558 /* Load the value */
2559 LoadExpr (CF_FORCECHAR, Expr);
2561 /* Generate the jump */
2562 g_falsejump (CF_NONE, FalseLab);
2564 /* Parse more boolean and's */
2565 while (CurTok.Tok == TOK_BOOL_AND) {
2572 if (!ED_IsTested (&Expr2)) {
2573 ED_MarkForTest (&Expr2);
2575 LoadExpr (CF_FORCECHAR, &Expr2);
2577 /* Do short circuit evaluation */
2578 if (CurTok.Tok == TOK_BOOL_AND) {
2579 g_falsejump (CF_NONE, FalseLab);
2581 /* Last expression - will evaluate to true */
2582 g_truejump (CF_NONE, TrueLab);
2586 /* Define the false jump label here */
2587 g_defcodelabel (FalseLab);
2589 /* The result is an rvalue in primary */
2590 ED_MakeRValExpr (Expr);
2591 ED_TestDone (Expr); /* Condition codes are set */
2597 static void hieOr (ExprDesc *Expr)
2598 /* Process "exp || exp". */
2601 int BoolOp = 0; /* Did we have a boolean op? */
2602 int AndOp; /* Did we have a && operation? */
2603 unsigned TrueLab; /* Jump to this label if true */
2607 TrueLab = GetLocalLabel ();
2609 /* Call the next level parser */
2610 hieAnd (Expr, TrueLab, &BoolOp);
2612 /* Any boolean or's? */
2613 if (CurTok.Tok == TOK_BOOL_OR) {
2615 /* If the expr hasn't set condition codes, set the force-test flag */
2616 if (!ED_IsTested (Expr)) {
2617 ED_MarkForTest (Expr);
2620 /* Get first expr */
2621 LoadExpr (CF_FORCECHAR, Expr);
2623 /* For each expression jump to TrueLab if true. Beware: If we
2624 * had && operators, the jump is already in place!
2627 g_truejump (CF_NONE, TrueLab);
2630 /* Remember that we had a boolean op */
2633 /* while there's more expr */
2634 while (CurTok.Tok == TOK_BOOL_OR) {
2641 hieAnd (&Expr2, TrueLab, &AndOp);
2642 if (!ED_IsTested (&Expr2)) {
2643 ED_MarkForTest (&Expr2);
2645 LoadExpr (CF_FORCECHAR, &Expr2);
2647 /* If there is more to come, add shortcut boolean eval. */
2648 g_truejump (CF_NONE, TrueLab);
2652 /* The result is an rvalue in primary */
2653 ED_MakeRValExpr (Expr);
2654 ED_TestDone (Expr); /* Condition codes are set */
2657 /* If we really had boolean ops, generate the end sequence */
2659 DoneLab = GetLocalLabel ();
2660 g_getimmed (CF_INT | CF_CONST, 0, 0); /* Load FALSE */
2661 g_falsejump (CF_NONE, DoneLab);
2662 g_defcodelabel (TrueLab);
2663 g_getimmed (CF_INT | CF_CONST, 1, 0); /* Load TRUE */
2664 g_defcodelabel (DoneLab);
2670 static void hieQuest (ExprDesc* Expr)
2671 /* Parse the ternary operator */
2675 CodeMark TrueCodeEnd;
2676 ExprDesc Expr2; /* Expression 2 */
2677 ExprDesc Expr3; /* Expression 3 */
2678 int Expr2IsNULL; /* Expression 2 is a NULL pointer */
2679 int Expr3IsNULL; /* Expression 3 is a NULL pointer */
2680 Type* ResultType; /* Type of result */
2683 /* Call the lower level eval routine */
2684 if (Preprocessing) {
2690 /* Check if it's a ternary expression */
2691 if (CurTok.Tok == TOK_QUEST) {
2693 if (!ED_IsTested (Expr)) {
2694 /* Condition codes not set, request a test */
2695 ED_MarkForTest (Expr);
2697 LoadExpr (CF_NONE, Expr);
2698 FalseLab = GetLocalLabel ();
2699 g_falsejump (CF_NONE, FalseLab);
2701 /* Parse second expression. Remember for later if it is a NULL pointer
2702 * expression, then load it into the primary.
2704 ExprWithCheck (hie1, &Expr2);
2705 Expr2IsNULL = ED_IsNullPtr (&Expr2);
2706 if (!IsTypeVoid (Expr2.Type)) {
2707 /* Load it into the primary */
2708 LoadExpr (CF_NONE, &Expr2);
2709 ED_MakeRValExpr (&Expr2);
2710 Expr2.Type = PtrConversion (Expr2.Type);
2713 /* Remember the current code position */
2714 GetCodePos (&TrueCodeEnd);
2716 /* Jump around the evaluation of the third expression */
2717 TrueLab = GetLocalLabel ();
2721 /* Jump here if the first expression was false */
2722 g_defcodelabel (FalseLab);
2724 /* Parse third expression. Remember for later if it is a NULL pointer
2725 * expression, then load it into the primary.
2727 ExprWithCheck (hie1, &Expr3);
2728 Expr3IsNULL = ED_IsNullPtr (&Expr3);
2729 if (!IsTypeVoid (Expr3.Type)) {
2730 /* Load it into the primary */
2731 LoadExpr (CF_NONE, &Expr3);
2732 ED_MakeRValExpr (&Expr3);
2733 Expr3.Type = PtrConversion (Expr3.Type);
2736 /* Check if any conversions are needed, if so, do them.
2737 * Conversion rules for ?: expression are:
2738 * - if both expressions are int expressions, default promotion
2739 * rules for ints apply.
2740 * - if both expressions are pointers of the same type, the
2741 * result of the expression is of this type.
2742 * - if one of the expressions is a pointer and the other is
2743 * a zero constant, the resulting type is that of the pointer
2745 * - if both expressions are void expressions, the result is of
2747 * - all other cases are flagged by an error.
2749 if (IsClassInt (Expr2.Type) && IsClassInt (Expr3.Type)) {
2751 CodeMark CvtCodeStart;
2752 CodeMark CvtCodeEnd;
2755 /* Get common type */
2756 ResultType = promoteint (Expr2.Type, Expr3.Type);
2758 /* Convert the third expression to this type if needed */
2759 TypeConversion (&Expr3, ResultType);
2761 /* Emit conversion code for the second expression, but remember
2762 * where it starts end ends.
2764 GetCodePos (&CvtCodeStart);
2765 TypeConversion (&Expr2, ResultType);
2766 GetCodePos (&CvtCodeEnd);
2768 /* If we had conversion code, move it to the right place */
2769 if (!CodeRangeIsEmpty (&CvtCodeStart, &CvtCodeEnd)) {
2770 MoveCode (&CvtCodeStart, &CvtCodeEnd, &TrueCodeEnd);
2773 } else if (IsClassPtr (Expr2.Type) && IsClassPtr (Expr3.Type)) {
2774 /* Must point to same type */
2775 if (TypeCmp (Indirect (Expr2.Type), Indirect (Expr3.Type)) < TC_EQUAL) {
2776 Error ("Incompatible pointer types");
2778 /* Result has the common type */
2779 ResultType = Expr2.Type;
2780 } else if (IsClassPtr (Expr2.Type) && Expr3IsNULL) {
2781 /* Result type is pointer, no cast needed */
2782 ResultType = Expr2.Type;
2783 } else if (Expr2IsNULL && IsClassPtr (Expr3.Type)) {
2784 /* Result type is pointer, no cast needed */
2785 ResultType = Expr3.Type;
2786 } else if (IsTypeVoid (Expr2.Type) && IsTypeVoid (Expr3.Type)) {
2787 /* Result type is void */
2788 ResultType = Expr3.Type;
2790 Error ("Incompatible types");
2791 ResultType = Expr2.Type; /* Doesn't matter here */
2794 /* Define the final label */
2795 g_defcodelabel (TrueLab);
2797 /* Setup the target expression */
2798 ED_MakeRValExpr (Expr);
2799 Expr->Type = ResultType;
2805 static void opeq (const GenDesc* Gen, ExprDesc* Expr)
2806 /* Process "op=" operators. */
2813 /* op= can only be used with lvalues */
2814 if (!ED_IsLVal (Expr)) {
2815 Error ("Invalid lvalue in assignment");
2819 /* The left side must not be const qualified */
2820 if (IsQualConst (Expr->Type)) {
2821 Error ("Assignment to const");
2824 /* There must be an integer or pointer on the left side */
2825 if (!IsClassInt (Expr->Type) && !IsTypePtr (Expr->Type)) {
2826 Error ("Invalid left operand type");
2827 /* Continue. Wrong code will be generated, but the compiler won't
2828 * break, so this is the best error recovery.
2832 /* Skip the operator token */
2835 /* Determine the type of the lhs */
2836 flags = TypeOf (Expr->Type);
2837 MustScale = (Gen->Func == g_add || Gen->Func == g_sub) && IsTypePtr (Expr->Type);
2839 /* Get the lhs address on stack (if needed) */
2842 /* Fetch the lhs into the primary register if needed */
2843 LoadExpr (CF_NONE, Expr);
2845 /* Bring the lhs on stack */
2849 /* Evaluate the rhs */
2850 if (evalexpr (CF_NONE, hie1, &Expr2) == 0) {
2851 /* The resulting value is a constant. If the generator has the NOPUSH
2852 * flag set, don't push the lhs.
2854 if (Gen->Flags & GEN_NOPUSH) {
2858 /* lhs is a pointer, scale rhs */
2859 Expr2.IVal *= CheckedSizeOf (Expr->Type+1);
2862 /* If the lhs is character sized, the operation may be later done
2865 if (CheckedSizeOf (Expr->Type) == SIZEOF_CHAR) {
2866 flags |= CF_FORCECHAR;
2869 /* Special handling for add and sub - some sort of a hack, but short code */
2870 if (Gen->Func == g_add) {
2871 g_inc (flags | CF_CONST, Expr2.IVal);
2872 } else if (Gen->Func == g_sub) {
2873 g_dec (flags | CF_CONST, Expr2.IVal);
2875 if (Expr2.IVal == 0) {
2876 /* Check for div by zero/mod by zero */
2877 if (Gen->Func == g_div) {
2878 Error ("Division by zero");
2879 } else if (Gen->Func == g_mod) {
2880 Error ("Modulo operation with zero");
2883 Gen->Func (flags | CF_CONST, Expr2.IVal);
2886 /* rhs is not constant and already in the primary register */
2888 /* lhs is a pointer, scale rhs */
2889 g_scale (TypeOf (Expr2.Type), CheckedSizeOf (Expr->Type+1));
2892 /* If the lhs is character sized, the operation may be later done
2895 if (CheckedSizeOf (Expr->Type) == SIZEOF_CHAR) {
2896 flags |= CF_FORCECHAR;
2899 /* Adjust the types of the operands if needed */
2900 Gen->Func (g_typeadjust (flags, TypeOf (Expr2.Type)), 0);
2903 ED_MakeRValExpr (Expr);
2908 static void addsubeq (const GenDesc* Gen, ExprDesc *Expr)
2909 /* Process the += and -= operators */
2917 /* We're currently only able to handle some adressing modes */
2918 if (ED_GetLoc (Expr) == E_LOC_EXPR || ED_GetLoc (Expr) == E_LOC_PRIMARY) {
2919 /* Use generic routine */
2924 /* We must have an lvalue */
2925 if (ED_IsRVal (Expr)) {
2926 Error ("Invalid lvalue in assignment");
2930 /* The left side must not be const qualified */
2931 if (IsQualConst (Expr->Type)) {
2932 Error ("Assignment to const");
2935 /* There must be an integer or pointer on the left side */
2936 if (!IsClassInt (Expr->Type) && !IsTypePtr (Expr->Type)) {
2937 Error ("Invalid left operand type");
2938 /* Continue. Wrong code will be generated, but the compiler won't
2939 * break, so this is the best error recovery.
2943 /* Skip the operator */
2946 /* Check if we have a pointer expression and must scale rhs */
2947 MustScale = IsTypePtr (Expr->Type);
2949 /* Initialize the code generator flags */
2953 /* Evaluate the rhs */
2955 if (ED_IsConstAbs (&Expr2)) {
2956 /* The resulting value is a constant. Scale it. */
2958 Expr2.IVal *= CheckedSizeOf (Indirect (Expr->Type));
2963 /* Not constant, load into the primary */
2964 LoadExpr (CF_NONE, &Expr2);
2966 /* lhs is a pointer, scale rhs */
2967 g_scale (TypeOf (Expr2.Type), CheckedSizeOf (Indirect (Expr->Type)));
2971 /* Setup the code generator flags */
2972 lflags |= TypeOf (Expr->Type) | GlobalModeFlags (Expr) | CF_FORCECHAR;
2973 rflags |= TypeOf (Expr2.Type) | CF_FORCECHAR;
2975 /* Convert the type of the lhs to that of the rhs */
2976 g_typecast (lflags, rflags);
2978 /* Output apropriate code depending on the location */
2979 switch (ED_GetLoc (Expr)) {
2982 /* Absolute: numeric address or const */
2983 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2984 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
2986 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
2991 /* Global variable */
2992 if (Gen->Tok == TOK_PLUS_ASSIGN) {
2993 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
2995 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3001 /* Static variable or literal in the literal pool */
3002 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3003 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3005 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3009 case E_LOC_REGISTER:
3010 /* Register variable */
3011 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3012 g_addeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3014 g_subeqstatic (lflags, Expr->Name, Expr->IVal, Expr2.IVal);
3019 /* Value on the stack */
3020 if (Gen->Tok == TOK_PLUS_ASSIGN) {
3021 g_addeqlocal (lflags, Expr->IVal, Expr2.IVal);
3023 g_subeqlocal (lflags, Expr->IVal, Expr2.IVal);
3028 Internal ("Invalid location in Store(): 0x%04X", ED_GetLoc (Expr));
3031 /* Expression is a rvalue in the primary now */
3032 ED_MakeRValExpr (Expr);
3037 void hie1 (ExprDesc* Expr)
3038 /* Parse first level of expression hierarchy. */
3041 switch (CurTok.Tok) {
3047 case TOK_PLUS_ASSIGN:
3048 addsubeq (&GenPASGN, Expr);
3051 case TOK_MINUS_ASSIGN:
3052 addsubeq (&GenSASGN, Expr);
3055 case TOK_MUL_ASSIGN:
3056 opeq (&GenMASGN, Expr);
3059 case TOK_DIV_ASSIGN:
3060 opeq (&GenDASGN, Expr);
3063 case TOK_MOD_ASSIGN:
3064 opeq (&GenMOASGN, Expr);
3067 case TOK_SHL_ASSIGN:
3068 opeq (&GenSLASGN, Expr);
3071 case TOK_SHR_ASSIGN:
3072 opeq (&GenSRASGN, Expr);
3075 case TOK_AND_ASSIGN:
3076 opeq (&GenAASGN, Expr);
3079 case TOK_XOR_ASSIGN:
3080 opeq (&GenXOASGN, Expr);
3084 opeq (&GenOASGN, Expr);
3094 void hie0 (ExprDesc *Expr)
3095 /* Parse comma operator. */
3098 while (CurTok.Tok == TOK_COMMA) {
3106 int evalexpr (unsigned Flags, void (*Func) (ExprDesc*), ExprDesc* Expr)
3107 /* Will evaluate an expression via the given function. If the result is a
3108 * constant, 0 is returned and the value is put in the Expr struct. If the
3109 * result is not constant, LoadExpr is called to bring the value into the
3110 * primary register and 1 is returned.
3114 ExprWithCheck (Func, Expr);
3116 /* Check for a constant expression */
3117 if (ED_IsConstAbs (Expr)) {
3118 /* Constant expression */
3121 /* Not constant, load into the primary */
3122 LoadExpr (Flags, Expr);
3129 void Expression0 (ExprDesc* Expr)
3130 /* Evaluate an expression via hie0 and put the result into the primary register */
3132 ExprWithCheck (hie0, Expr);
3133 LoadExpr (CF_NONE, Expr);
3138 void ConstExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3139 /* Will evaluate an expression via the given function. If the result is not
3140 * a constant of some sort, a diagnostic will be printed, and the value is
3141 * replaced by a constant one to make sure there are no internal errors that
3142 * result from this input error.
3145 ExprWithCheck (Func, Expr);
3146 if (!ED_IsConst (Expr)) {
3147 Error ("Constant expression expected");
3148 /* To avoid any compiler errors, make the expression a valid const */
3149 ED_MakeConstAbsInt (Expr, 1);
3155 void BoolExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3156 /* Will evaluate an expression via the given function. If the result is not
3157 * something that may be evaluated in a boolean context, a diagnostic will be
3158 * printed, and the value is replaced by a constant one to make sure there
3159 * are no internal errors that result from this input error.
3162 ExprWithCheck (Func, Expr);
3163 if (!ED_IsBool (Expr)) {
3164 Error ("Boolean expression expected");
3165 /* To avoid any compiler errors, make the expression a valid int */
3166 ED_MakeConstAbsInt (Expr, 1);
3172 void ConstAbsIntExpr (void (*Func) (ExprDesc*), ExprDesc* Expr)
3173 /* Will evaluate an expression via the given function. If the result is not
3174 * a constant numeric integer value, a diagnostic will be printed, and the
3175 * value is replaced by a constant one to make sure there are no internal
3176 * errors that result from this input error.
3179 ExprWithCheck (Func, Expr);
3180 if (!ED_IsConstAbsInt (Expr)) {
3181 Error ("Constant integer expression expected");
3182 /* To avoid any compiler errors, make the expression a valid const */
3183 ED_MakeConstAbsInt (Expr, 1);