1 /*-------------------------------------------------------------------------
2 SDCCast.c - source file for parser support & all ast related routines
4 Written By - Sandeep Dutta . sandeep.dutta@usa.net (1998)
6 This program is free software; you can redistribute it and/or modify it
7 under the terms of the GNU General Public License as published by the
8 Free Software Foundation; either version 2, or (at your option) any
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
20 In other words, you are welcome to use, share and improve this program.
21 You are forbidden to forbid anyone else to use, share and improve
22 what you give them. Help stamp out software-hoarding!
23 -------------------------------------------------------------------------*/
29 set *operKeyReset = NULL;
30 ast *staticAutos = NULL;
33 #define LRVAL(x) x->left->rvalue
34 #define RRVAL(x) x->right->rvalue
35 #define TRVAL(x) x->rvalue
36 #define LLVAL(x) x->left->lvalue
37 #define RLVAL(x) x->right->lvalue
38 #define TLVAL(x) x->lvalue
39 #define RTYPE(x) x->right->ftype
40 #define RETYPE(x) x->right->etype
41 #define LTYPE(x) x->left->ftype
42 #define LETYPE(x) x->left->etype
43 #define TTYPE(x) x->ftype
44 #define TETYPE(x) x->etype
51 static ast *createIval (ast *, sym_link *, initList *, ast *);
52 static ast *createIvalCharPtr (ast *, sym_link *, ast *);
53 static ast *optimizeCompare (ast *);
54 ast *optimizeRRCRLC (ast *);
55 ast *optimizeGetHbit (ast *);
56 ast *backPatchLabels (ast *, symbol *, symbol *);
59 memmap *GcurMemmap=NULL; /* points to the memmap that's currently active */
64 printTypeChain (tree->ftype, stdout);
69 /*-----------------------------------------------------------------*/
70 /* newAst - creates a fresh node for an expression tree */
71 /*-----------------------------------------------------------------*/
73 newAst_ (unsigned type)
76 static int oldLineno = 0;
78 ex = Safe_alloc ( sizeof (ast));
81 ex->lineno = (noLineno ? oldLineno : yylineno);
82 ex->filename = currFname;
83 ex->level = NestLevel;
84 ex->block = currBlockno;
85 ex->initMode = inInitMode;
90 newAst_VALUE (value * val)
92 ast *ex = newAst_ (EX_VALUE);
98 newAst_OP (unsigned op)
100 ast *ex = newAst_ (EX_OP);
106 newAst_LINK (sym_link * val)
108 ast *ex = newAst_ (EX_LINK);
114 newAst_STMNT (unsigned val)
116 ast *ex = newAst_ (EX_STMNT);
117 ex->opval.stmnt = val;
121 /*-----------------------------------------------------------------*/
122 /* newNode - creates a new node */
123 /*-----------------------------------------------------------------*/
125 newNode (long op, ast * left, ast * right)
136 /*-----------------------------------------------------------------*/
137 /* newIfxNode - creates a new Ifx Node */
138 /*-----------------------------------------------------------------*/
140 newIfxNode (ast * condAst, symbol * trueLabel, symbol * falseLabel)
144 /* if this is a literal then we already know the result */
145 if (condAst->etype && IS_LITERAL (condAst->etype))
147 /* then depending on the expression value */
148 if (floatFromVal (condAst->opval.val))
149 ifxNode = newNode (GOTO,
150 newAst_VALUE (symbolVal (trueLabel)),
153 ifxNode = newNode (GOTO,
154 newAst_VALUE (symbolVal (falseLabel)),
159 ifxNode = newNode (IFX, condAst, NULL);
160 ifxNode->trueLabel = trueLabel;
161 ifxNode->falseLabel = falseLabel;
167 /*-----------------------------------------------------------------*/
168 /* copyAstValues - copies value portion of ast if needed */
169 /*-----------------------------------------------------------------*/
171 copyAstValues (ast * dest, ast * src)
173 switch (src->opval.op)
176 dest->values.sym = copySymbolChain (src->values.sym);
180 dest->values.switchVals.swVals =
181 copyValue (src->values.switchVals.swVals);
182 dest->values.switchVals.swDefault =
183 src->values.switchVals.swDefault;
184 dest->values.switchVals.swNum =
185 src->values.switchVals.swNum;
189 dest->values.inlineasm = Safe_alloc (strlen (src->values.inlineasm) + 1);
190 strcpy (dest->values.inlineasm, src->values.inlineasm);
194 dest->values.constlist = copyLiteralList(src->values.constlist);
198 AST_FOR (dest, trueLabel) = copySymbol (AST_FOR (src, trueLabel));
199 AST_FOR (dest, continueLabel) = copySymbol (AST_FOR (src, continueLabel));
200 AST_FOR (dest, falseLabel) = copySymbol (AST_FOR (src, falseLabel));
201 AST_FOR (dest, condLabel) = copySymbol (AST_FOR (src, condLabel));
202 AST_FOR (dest, initExpr) = copyAst (AST_FOR (src, initExpr));
203 AST_FOR (dest, condExpr) = copyAst (AST_FOR (src, condExpr));
204 AST_FOR (dest, loopExpr) = copyAst (AST_FOR (src, loopExpr));
209 /*-----------------------------------------------------------------*/
210 /* copyAst - makes a copy of a given astession */
211 /*-----------------------------------------------------------------*/
220 dest = Safe_alloc ( sizeof (ast));
222 dest->type = src->type;
223 dest->lineno = src->lineno;
224 dest->level = src->level;
225 dest->funcName = src->funcName;
228 dest->etype = getSpec (dest->ftype = copyLinkChain (src->ftype));
230 /* if this is a leaf */
232 if (src->type == EX_VALUE)
234 dest->opval.val = copyValue (src->opval.val);
239 if (src->type == EX_LINK)
241 dest->opval.lnk = copyLinkChain (src->opval.lnk);
245 dest->opval.op = src->opval.op;
247 /* if this is a node that has special values */
248 copyAstValues (dest, src);
250 dest->trueLabel = copySymbol (src->trueLabel);
251 dest->falseLabel = copySymbol (src->falseLabel);
252 dest->left = copyAst (src->left);
253 dest->right = copyAst (src->right);
259 /*-----------------------------------------------------------------*/
260 /* removeIncDecOps: remove for side effects in *_ASSIGN's */
261 /* "*s++ += 3" -> "*s++ = *s++ + 3" */
262 /*-----------------------------------------------------------------*/
263 ast *removeIncDecOps (ast * tree) {
265 // traverse the tree and remove inc/dec ops
270 if (tree->type == EX_OP &&
271 (tree->opval.op == INC_OP || tree->opval.op == DEC_OP)) {
278 tree->left=removeIncDecOps(tree->left);
279 tree->right=removeIncDecOps(tree->right);
284 /*-----------------------------------------------------------------*/
285 /* hasSEFcalls - returns TRUE if tree has a function call */
286 /*-----------------------------------------------------------------*/
288 hasSEFcalls (ast * tree)
293 if (tree->type == EX_OP &&
294 (tree->opval.op == CALL ||
295 tree->opval.op == PCALL ||
296 tree->opval.op == '=' ||
297 tree->opval.op == INC_OP ||
298 tree->opval.op == DEC_OP))
301 return (hasSEFcalls (tree->left) |
302 hasSEFcalls (tree->right));
305 /*-----------------------------------------------------------------*/
306 /* isAstEqual - compares two asts & returns 1 if they are equal */
307 /*-----------------------------------------------------------------*/
309 isAstEqual (ast * t1, ast * t2)
318 if (t1->type != t2->type)
324 if (t1->opval.op != t2->opval.op)
326 return (isAstEqual (t1->left, t2->left) &&
327 isAstEqual (t1->right, t2->right));
331 if (t1->opval.val->sym)
333 if (!t2->opval.val->sym)
336 return isSymbolEqual (t1->opval.val->sym,
341 if (t2->opval.val->sym)
344 return (floatFromVal (t1->opval.val) ==
345 floatFromVal (t2->opval.val));
349 /* only compare these two types */
357 /*-----------------------------------------------------------------*/
358 /* resolveSymbols - resolve symbols from the symbol table */
359 /*-----------------------------------------------------------------*/
361 resolveSymbols (ast * tree)
363 /* walk the entire tree and check for values */
364 /* with symbols if we find one then replace */
365 /* symbol with that from the symbol table */
371 /* if not block & function */
372 if (tree->type == EX_OP &&
373 (tree->opval.op != FUNCTION &&
374 tree->opval.op != BLOCK &&
375 tree->opval.op != NULLOP))
377 filename = tree->filename;
378 lineno = tree->lineno;
381 /* make sure we resolve the true & false labels for ifx */
382 if (tree->type == EX_OP && tree->opval.op == IFX)
388 if ((csym = findSym (LabelTab, tree->trueLabel,
389 tree->trueLabel->name)))
390 tree->trueLabel = csym;
392 werror (E_LABEL_UNDEF, tree->trueLabel->name);
395 if (tree->falseLabel)
397 if ((csym = findSym (LabelTab,
399 tree->falseLabel->name)))
400 tree->falseLabel = csym;
402 werror (E_LABEL_UNDEF, tree->falseLabel->name);
407 /* if this is a label resolve it from the labelTab */
408 if (IS_AST_VALUE (tree) &&
409 tree->opval.val->sym &&
410 tree->opval.val->sym->islbl)
413 symbol *csym = findSym (LabelTab, tree->opval.val->sym,
414 tree->opval.val->sym->name);
417 werror (E_LABEL_UNDEF, tree->opval.val->sym->name);
419 tree->opval.val->sym = csym;
421 goto resolveChildren;
424 /* do only for leafs */
425 if (IS_AST_VALUE (tree) &&
426 tree->opval.val->sym &&
427 !tree->opval.val->sym->implicit)
430 symbol *csym = findSymWithLevel (SymbolTab, tree->opval.val->sym);
432 /* if found in the symbol table & they r not the same */
433 if (csym && tree->opval.val->sym != csym)
435 tree->opval.val->sym = csym;
436 tree->opval.val->type = csym->type;
437 tree->opval.val->etype = csym->etype;
440 /* if not found in the symbol table */
441 /* mark it as undefined assume it is */
442 /* an integer in data space */
443 if (!csym && !tree->opval.val->sym->implicit)
446 /* if this is a function name then */
447 /* mark it as returning an int */
450 tree->opval.val->sym->type = newLink ();
451 DCL_TYPE (tree->opval.val->sym->type) = FUNCTION;
452 tree->opval.val->sym->type->next =
453 tree->opval.val->sym->etype = newIntLink ();
454 tree->opval.val->etype = tree->opval.val->etype;
455 tree->opval.val->type = tree->opval.val->sym->type;
456 werror (W_IMPLICIT_FUNC, tree->opval.val->sym->name);
457 allocVariables (tree->opval.val->sym);
461 tree->opval.val->sym->undefined = 1;
462 tree->opval.val->type =
463 tree->opval.val->etype = newIntLink ();
464 tree->opval.val->sym->type =
465 tree->opval.val->sym->etype = newIntLink ();
471 resolveSymbols (tree->left);
472 resolveSymbols (tree->right);
477 /*-----------------------------------------------------------------*/
478 /* setAstLineno - walks a ast tree & sets the line number */
479 /*-----------------------------------------------------------------*/
480 int setAstLineno (ast * tree, int lineno)
485 tree->lineno = lineno;
486 setAstLineno (tree->left, lineno);
487 setAstLineno (tree->right, lineno);
491 /*-----------------------------------------------------------------*/
492 /* funcOfType :- function of type with name */
493 /*-----------------------------------------------------------------*/
495 funcOfType (char *name, sym_link * type, sym_link * argType,
499 /* create the symbol */
500 sym = newSymbol (name, 0);
502 /* setup return value */
503 sym->type = newLink ();
504 DCL_TYPE (sym->type) = FUNCTION;
505 sym->type->next = copyLinkChain (type);
506 sym->etype = getSpec (sym->type);
507 FUNC_ISREENT(sym->type) = rent ? 1 : 0;
509 /* if arguments required */
513 args = FUNC_ARGS(sym->type) = newValue ();
517 args->type = copyLinkChain (argType);
518 args->etype = getSpec (args->type);
519 SPEC_EXTR(args->etype)=1;
522 args = args->next = newValue ();
529 allocVariables (sym);
534 /*-----------------------------------------------------------------*/
535 /* funcOfTypeVarg :- function of type with name and argtype */
536 /*-----------------------------------------------------------------*/
538 funcOfTypeVarg (char *name, char * rtype, int nArgs , char **atypes)
543 /* create the symbol */
544 sym = newSymbol (name, 0);
546 /* setup return value */
547 sym->type = newLink ();
548 DCL_TYPE (sym->type) = FUNCTION;
549 sym->type->next = typeFromStr(rtype);
550 sym->etype = getSpec (sym->type);
552 /* if arguments required */
555 args = FUNC_ARGS(sym->type) = newValue ();
557 for ( i = 0 ; i < nArgs ; i++ ) {
558 args->type = typeFromStr(atypes[i]);
559 args->etype = getSpec (args->type);
560 SPEC_EXTR(args->etype)=1;
561 if ((i + 1) == nArgs) break;
562 args = args->next = newValue ();
569 allocVariables (sym);
574 /*-----------------------------------------------------------------*/
575 /* reverseParms - will reverse a parameter tree */
576 /*-----------------------------------------------------------------*/
578 reverseParms (ast * ptree)
584 /* top down if we find a nonParm tree then quit */
585 if (ptree->type == EX_OP && ptree->opval.op == PARAM)
588 ptree->left = ptree->right;
589 ptree->right = ttree;
590 reverseParms (ptree->left);
591 reverseParms (ptree->right);
597 /*-----------------------------------------------------------------*/
598 /* processParms - makes sure the parameters are okay and do some */
599 /* processing with them */
600 /*-----------------------------------------------------------------*/
602 processParms (ast * func,
605 int *parmNumber, // unused, although updated
608 /* if none of them exist */
609 if (!defParm && !actParm)
613 if (getenv("DEBUG_SANITY")) {
614 fprintf (stderr, "processParms: %s ", defParm->name);
616 /* make sure the type is complete and sane */
617 checkTypeSanity(defParm->etype, defParm->name);
620 /* if the function is being called via a pointer & */
621 /* it has not been defined a reentrant then we cannot */
622 /* have parameters */
623 if (func->type != EX_VALUE && !IFFUNC_ISREENT (func->ftype) && !options.stackAuto)
625 werror (W_NONRENT_ARGS);
629 /* if defined parameters ended but actual parameters */
630 /* exist and this is not defined as a variable arg */
631 if (!defParm && actParm && !IFFUNC_HASVARARGS(func->ftype))
633 werror (E_TOO_MANY_PARMS);
637 /* if defined parameters present but no actual parameters */
638 if (defParm && !actParm)
640 werror (E_TOO_FEW_PARMS);
644 if (IS_VOID(actParm->ftype)) {
645 werror (E_VOID_VALUE_USED);
649 /* If this is a varargs function... */
650 if (!defParm && actParm && IFFUNC_HASVARARGS(func->ftype))
655 if (IS_CAST_OP (actParm)
656 || (IS_AST_LIT_VALUE (actParm) && actParm->values.literalFromCast))
658 /* Parameter was explicitly typecast; don't touch it. */
662 ftype = actParm->ftype;
664 /* If it's a small integer, upcast to int. */
665 if (IS_INTEGRAL (ftype)
666 && (getSize (ftype) < (unsigned) INTSIZE))
668 newType = newAst_LINK(INTTYPE);
671 if (IS_PTR(ftype) && !IS_GENPTR(ftype))
673 newType = newAst_LINK (copyLinkChain(ftype));
674 DCL_TYPE (newType->opval.lnk) = port->unqualified_pointer;
677 if (IS_AGGREGATE (ftype))
679 newType = newAst_LINK (copyLinkChain (ftype));
680 DCL_TYPE (newType->opval.lnk) = port->unqualified_pointer;
684 /* cast required; change this op to a cast. */
685 ast *parmCopy = decorateType(resolveSymbols (copyAst (actParm)));
687 actParm->type = EX_OP;
688 actParm->opval.op = CAST;
689 actParm->left = newType;
690 actParm->right = parmCopy;
691 decorateType (actParm);
693 else if (actParm->type == EX_OP && actParm->opval.op == PARAM)
695 return (processParms (func, NULL, actParm->left, parmNumber, FALSE) ||
696 processParms (func, NULL, actParm->right, parmNumber, rightmost));
701 /* if defined parameters ended but actual has not & */
703 if (!defParm && actParm &&
704 (options.stackAuto || IFFUNC_ISREENT (func->ftype)))
707 resolveSymbols (actParm);
708 /* if this is a PARAM node then match left & right */
709 if (actParm->type == EX_OP && actParm->opval.op == PARAM)
711 return (processParms (func, defParm, actParm->left, parmNumber, FALSE) ||
712 processParms (func, defParm->next, actParm->right, parmNumber, rightmost));
716 /* If we have found a value node by following only right-hand links,
717 * then we know that there are no more values after us.
719 * Therefore, if there are more defined parameters, the caller didn't
722 if (rightmost && defParm->next)
724 werror (E_TOO_FEW_PARMS);
729 /* the parameter type must be at least castable */
730 if (compareType (defParm->type, actParm->ftype) == 0) {
731 werror (E_INCOMPAT_TYPES);
732 printFromToType (actParm->ftype, defParm->type);
736 /* if the parameter is castable then add the cast */
737 if (compareType (defParm->type, actParm->ftype) < 0)
739 ast *pTree = decorateType(resolveSymbols (copyAst (actParm)));
741 /* now change the current one to a cast */
742 actParm->type = EX_OP;
743 actParm->opval.op = CAST;
744 actParm->left = newAst_LINK (defParm->type);
745 actParm->right = pTree;
746 actParm->etype = defParm->etype;
747 actParm->ftype = defParm->type;
748 actParm->decorated=0; /* force typechecking */
749 decorateType (actParm);
752 /* make a copy and change the regparm type to the defined parm */
753 actParm->etype = getSpec (actParm->ftype = copyLinkChain (actParm->ftype));
754 SPEC_REGPARM (actParm->etype) = SPEC_REGPARM (defParm->etype);
755 SPEC_ARGREG (actParm->etype) = SPEC_ARGREG (defParm->etype);
759 /*-----------------------------------------------------------------*/
760 /* createIvalType - generates ival for basic types */
761 /*-----------------------------------------------------------------*/
763 createIvalType (ast * sym, sym_link * type, initList * ilist)
767 /* if initList is deep */
768 if (ilist->type == INIT_DEEP)
769 ilist = ilist->init.deep;
771 iExpr = decorateType (resolveSymbols (list2expr (ilist)));
772 return decorateType (newNode ('=', sym, iExpr));
775 /*-----------------------------------------------------------------*/
776 /* createIvalStruct - generates initial value for structures */
777 /*-----------------------------------------------------------------*/
779 createIvalStruct (ast * sym, sym_link * type, initList * ilist)
786 sflds = SPEC_STRUCT (type)->fields;
787 if (ilist->type != INIT_DEEP)
789 werror (E_INIT_STRUCT, "");
793 iloop = ilist->init.deep;
795 for (; sflds; sflds = sflds->next, iloop = (iloop ? iloop->next : NULL))
797 /* if we have come to end */
801 lAst = newNode (PTR_OP, newNode ('&', sym, NULL), newAst_VALUE (symbolVal (sflds)));
802 lAst = decorateType (resolveSymbols (lAst));
803 rast = decorateType (resolveSymbols (createIval (lAst, sflds->type, iloop, rast)));
807 werror (W_EXCESS_INITIALIZERS, "struct",
808 sym->opval.val->sym->name, sym->opval.val->sym->lineDef);
815 /*-----------------------------------------------------------------*/
816 /* createIvalArray - generates code for array initialization */
817 /*-----------------------------------------------------------------*/
819 createIvalArray (ast * sym, sym_link * type, initList * ilist)
823 int lcnt = 0, size = 0;
824 literalList *literalL;
826 /* take care of the special case */
827 /* array of characters can be init */
829 if (IS_CHAR (type->next))
830 if ((rast = createIvalCharPtr (sym,
832 decorateType (resolveSymbols (list2expr (ilist))))))
834 return decorateType (resolveSymbols (rast));
836 /* not the special case */
837 if (ilist->type != INIT_DEEP)
839 werror (E_INIT_STRUCT, "");
843 iloop = ilist->init.deep;
844 lcnt = DCL_ELEM (type);
846 if (port->arrayInitializerSuppported && convertIListToConstList(ilist, &literalL))
850 aSym = decorateType (resolveSymbols(sym));
852 rast = newNode(ARRAYINIT, aSym, NULL);
853 rast->values.constlist = literalL;
855 // Make sure size is set to length of initializer list.
862 if (lcnt && size > lcnt)
864 // Array size was specified, and we have more initializers than needed.
865 char *name=sym->opval.val->sym->name;
866 int lineno=sym->opval.val->sym->lineDef;
868 werror (W_EXCESS_INITIALIZERS, "array", name, lineno);
877 aSym = newNode ('[', sym, newAst_VALUE (valueFromLit ((float) (size++))));
878 aSym = decorateType (resolveSymbols (aSym));
879 rast = createIval (aSym, type->next, iloop, rast);
880 iloop = (iloop ? iloop->next : NULL);
886 /* no of elements given and we */
887 /* have generated for all of them */
890 // there has to be a better way
891 char *name=sym->opval.val->sym->name;
892 int lineno=sym->opval.val->sym->lineDef;
893 werror (W_EXCESS_INITIALIZERS, "array", name, lineno);
900 /* if we have not been given a size */
901 if (!DCL_ELEM (type))
903 DCL_ELEM (type) = size;
906 return decorateType (resolveSymbols (rast));
910 /*-----------------------------------------------------------------*/
911 /* createIvalCharPtr - generates initial values for char pointers */
912 /*-----------------------------------------------------------------*/
914 createIvalCharPtr (ast * sym, sym_link * type, ast * iexpr)
918 /* if this is a pointer & right is a literal array then */
919 /* just assignment will do */
920 if (IS_PTR (type) && ((IS_LITERAL (iexpr->etype) ||
921 SPEC_SCLS (iexpr->etype) == S_CODE)
922 && IS_ARRAY (iexpr->ftype)))
923 return newNode ('=', sym, iexpr);
925 /* left side is an array so we have to assign each */
927 if ((IS_LITERAL (iexpr->etype) ||
928 SPEC_SCLS (iexpr->etype) == S_CODE)
929 && IS_ARRAY (iexpr->ftype))
931 /* for each character generate an assignment */
932 /* to the array element */
933 char *s = SPEC_CVAL (iexpr->etype).v_char;
938 rast = newNode (NULLOP,
942 newAst_VALUE (valueFromLit ((float) i))),
943 newAst_VALUE (valueFromLit (*s))));
947 rast = newNode (NULLOP,
951 newAst_VALUE (valueFromLit ((float) i))),
952 newAst_VALUE (valueFromLit (*s))));
954 // now we don't need iexpr's symbol anymore
956 symbol *sym=AST_SYMBOL(iexpr);
957 memmap *segment=SPEC_OCLS(sym->etype);
958 deleteSetItem(&segment->syms, sym);
960 return decorateType (resolveSymbols (rast));
966 /*-----------------------------------------------------------------*/
967 /* createIvalPtr - generates initial value for pointers */
968 /*-----------------------------------------------------------------*/
970 createIvalPtr (ast * sym, sym_link * type, initList * ilist)
976 if (ilist->type == INIT_DEEP)
977 ilist = ilist->init.deep;
979 iexpr = decorateType (resolveSymbols (list2expr (ilist)));
981 /* if character pointer */
982 if (IS_CHAR (type->next))
983 if ((rast = createIvalCharPtr (sym, type, iexpr)))
986 return newNode ('=', sym, iexpr);
989 /*-----------------------------------------------------------------*/
990 /* createIval - generates code for initial value */
991 /*-----------------------------------------------------------------*/
993 createIval (ast * sym, sym_link * type, initList * ilist, ast * wid)
1000 /* if structure then */
1001 if (IS_STRUCT (type))
1002 rast = createIvalStruct (sym, type, ilist);
1004 /* if this is a pointer */
1006 rast = createIvalPtr (sym, type, ilist);
1008 /* if this is an array */
1009 if (IS_ARRAY (type))
1010 rast = createIvalArray (sym, type, ilist);
1012 /* if type is SPECIFIER */
1014 rast = createIvalType (sym, type, ilist);
1017 return decorateType (resolveSymbols (newNode (NULLOP, wid, rast)));
1019 return decorateType (resolveSymbols (rast));
1022 /*-----------------------------------------------------------------*/
1023 /* initAggregates - initialises aggregate variables with initv */
1024 /*-----------------------------------------------------------------*/
1025 ast * initAggregates (symbol * sym, initList * ival, ast * wid) {
1026 return createIval (newAst_VALUE (symbolVal (sym)), sym->type, ival, wid);
1029 /*-----------------------------------------------------------------*/
1030 /* gatherAutoInit - creates assignment expressions for initial */
1032 /*-----------------------------------------------------------------*/
1034 gatherAutoInit (symbol * autoChain)
1041 for (sym = autoChain; sym; sym = sym->next)
1044 /* resolve the symbols in the ival */
1046 resolveIvalSym (sym->ival);
1048 /* if this is a static variable & has an */
1049 /* initial value the code needs to be lifted */
1050 /* here to the main portion since they can be */
1051 /* initialised only once at the start */
1052 if (IS_STATIC (sym->etype) && sym->ival &&
1053 SPEC_SCLS (sym->etype) != S_CODE)
1057 /* insert the symbol into the symbol table */
1058 /* with level = 0 & name = rname */
1059 newSym = copySymbol (sym);
1060 addSym (SymbolTab, newSym, newSym->rname, 0, 0, 1);
1062 /* now lift the code to main */
1063 if (IS_AGGREGATE (sym->type)) {
1064 work = initAggregates (sym, sym->ival, NULL);
1066 if (getNelements(sym->type, sym->ival)>1) {
1067 werror (W_EXCESS_INITIALIZERS, "scalar",
1068 sym->name, sym->lineDef);
1070 work = newNode ('=', newAst_VALUE (symbolVal (newSym)),
1071 list2expr (sym->ival));
1074 setAstLineno (work, sym->lineDef);
1078 staticAutos = newNode (NULLOP, staticAutos, work);
1085 /* if there is an initial value */
1086 if (sym->ival && SPEC_SCLS (sym->etype) != S_CODE)
1088 if (IS_AGGREGATE (sym->type)) {
1089 work = initAggregates (sym, sym->ival, NULL);
1091 if (getNelements(sym->type, sym->ival)>1) {
1092 werror (W_EXCESS_INITIALIZERS, "scalar",
1093 sym->name, sym->lineDef);
1095 work = newNode ('=', newAst_VALUE (symbolVal (sym)),
1096 list2expr (sym->ival));
1099 setAstLineno (work, sym->lineDef);
1102 init = newNode (NULLOP, init, work);
1111 /*-----------------------------------------------------------------*/
1112 /* stringToSymbol - creates a symbol from a literal string */
1113 /*-----------------------------------------------------------------*/
1115 stringToSymbol (value * val)
1117 char name[SDCC_NAME_MAX + 1];
1118 static int charLbl = 0;
1121 sprintf (name, "_str_%d", charLbl++);
1122 sym = newSymbol (name, 0); /* make it @ level 0 */
1123 strcpy (sym->rname, name);
1125 /* copy the type from the value passed */
1126 sym->type = copyLinkChain (val->type);
1127 sym->etype = getSpec (sym->type);
1128 /* change to storage class & output class */
1129 SPEC_SCLS (sym->etype) = S_CODE;
1130 SPEC_CVAL (sym->etype).v_char = SPEC_CVAL (val->etype).v_char;
1131 SPEC_STAT (sym->etype) = 1;
1132 /* make the level & block = 0 */
1133 sym->block = sym->level = 0;
1135 /* create an ival */
1136 sym->ival = newiList (INIT_NODE, newAst_VALUE (val));
1141 allocVariables (sym);
1144 return symbolVal (sym);
1148 /*-----------------------------------------------------------------*/
1149 /* processBlockVars - will go thru the ast looking for block if */
1150 /* a block is found then will allocate the syms */
1151 /* will also gather the auto inits present */
1152 /*-----------------------------------------------------------------*/
1154 processBlockVars (ast * tree, int *stack, int action)
1159 /* if this is a block */
1160 if (tree->type == EX_OP && tree->opval.op == BLOCK)
1164 if (action == ALLOCATE)
1166 *stack += allocVariables (tree->values.sym);
1167 autoInit = gatherAutoInit (tree->values.sym);
1169 /* if there are auto inits then do them */
1171 tree->left = newNode (NULLOP, autoInit, tree->left);
1173 else /* action is deallocate */
1174 deallocLocal (tree->values.sym);
1177 processBlockVars (tree->left, stack, action);
1178 processBlockVars (tree->right, stack, action);
1182 /*-------------------------------------------------------------*/
1183 /* constExprTree - returns TRUE if this tree is a constant */
1185 /*-------------------------------------------------------------*/
1186 bool constExprTree (ast *cexpr) {
1192 cexpr = decorateType (resolveSymbols (cexpr));
1194 switch (cexpr->type)
1197 if (IS_AST_LIT_VALUE(cexpr)) {
1198 // this is a literal
1201 if (IS_AST_SYM_VALUE(cexpr) && IS_FUNC(AST_SYMBOL(cexpr)->type)) {
1202 // a function's address will never change
1205 if (IS_AST_SYM_VALUE(cexpr) &&
1206 IN_CODESPACE(SPEC_OCLS(AST_SYMBOL(cexpr)->etype))) {
1207 // a symbol in code space will never change
1208 // This is only for the 'char *s="hallo"' case and will have to leave
1213 werror (E_INTERNAL_ERROR, __FILE__, __LINE__,
1214 "unexpected link in expression tree\n");
1217 if (cexpr->opval.op==ARRAYINIT) {
1218 // this is a list of literals
1221 if (cexpr->opval.op=='=') {
1222 return constExprTree(cexpr->right);
1224 if (cexpr->opval.op==CAST) {
1225 // jwk: cast ignored, maybe we should throw a warning here
1226 return constExprTree(cexpr->right);
1228 if (cexpr->opval.op=='&') {
1231 if (cexpr->opval.op==CALL || cexpr->opval.op==PCALL) {
1234 if (constExprTree(cexpr->left) && constExprTree(cexpr->right)) {
1241 /*-----------------------------------------------------------------*/
1242 /* constExprValue - returns the value of a constant expression */
1243 /* or NULL if it is not a constant expression */
1244 /*-----------------------------------------------------------------*/
1246 constExprValue (ast * cexpr, int check)
1248 cexpr = decorateType (resolveSymbols (cexpr));
1250 /* if this is not a constant then */
1251 if (!IS_LITERAL (cexpr->ftype))
1253 /* then check if this is a literal array
1255 if (SPEC_SCLS (cexpr->etype) == S_CODE &&
1256 SPEC_CVAL (cexpr->etype).v_char &&
1257 IS_ARRAY (cexpr->ftype))
1259 value *val = valFromType (cexpr->ftype);
1260 SPEC_SCLS (val->etype) = S_LITERAL;
1261 val->sym = cexpr->opval.val->sym;
1262 val->sym->type = copyLinkChain (cexpr->ftype);
1263 val->sym->etype = getSpec (val->sym->type);
1264 strcpy (val->name, cexpr->opval.val->sym->rname);
1268 /* if we are casting a literal value then */
1269 if (IS_AST_OP (cexpr) &&
1270 cexpr->opval.op == CAST &&
1271 IS_LITERAL (cexpr->right->ftype))
1272 return valCastLiteral (cexpr->ftype,
1273 floatFromVal (cexpr->right->opval.val));
1275 if (IS_AST_VALUE (cexpr))
1276 return cexpr->opval.val;
1279 werror (E_CONST_EXPECTED, "found expression");
1284 /* return the value */
1285 return cexpr->opval.val;
1289 /*-----------------------------------------------------------------*/
1290 /* isLabelInAst - will return true if a given label is found */
1291 /*-----------------------------------------------------------------*/
1293 isLabelInAst (symbol * label, ast * tree)
1295 if (!tree || IS_AST_VALUE (tree) || IS_AST_LINK (tree))
1298 if (IS_AST_OP (tree) &&
1299 tree->opval.op == LABEL &&
1300 isSymbolEqual (AST_SYMBOL (tree->left), label))
1303 return isLabelInAst (label, tree->right) &&
1304 isLabelInAst (label, tree->left);
1308 /*-----------------------------------------------------------------*/
1309 /* isLoopCountable - return true if the loop count can be determi- */
1310 /* -ned at compile time . */
1311 /*-----------------------------------------------------------------*/
1313 isLoopCountable (ast * initExpr, ast * condExpr, ast * loopExpr,
1314 symbol ** sym, ast ** init, ast ** end)
1317 /* the loop is considered countable if the following
1318 conditions are true :-
1320 a) initExpr :- <sym> = <const>
1321 b) condExpr :- <sym> < <const1>
1322 c) loopExpr :- <sym> ++
1325 /* first check the initExpr */
1326 if (IS_AST_OP (initExpr) &&
1327 initExpr->opval.op == '=' && /* is assignment */
1328 IS_AST_SYM_VALUE (initExpr->left))
1329 { /* left is a symbol */
1331 *sym = AST_SYMBOL (initExpr->left);
1332 *init = initExpr->right;
1337 /* for now the symbol has to be of
1339 if (!IS_INTEGRAL ((*sym)->type))
1342 /* now check condExpr */
1343 if (IS_AST_OP (condExpr))
1346 switch (condExpr->opval.op)
1349 if (IS_AST_SYM_VALUE (condExpr->left) &&
1350 isSymbolEqual (*sym, AST_SYMBOL (condExpr->left)) &&
1351 IS_AST_LIT_VALUE (condExpr->right))
1353 *end = condExpr->right;
1359 if (IS_AST_OP (condExpr->left) &&
1360 condExpr->left->opval.op == '>' &&
1361 IS_AST_LIT_VALUE (condExpr->left->right) &&
1362 IS_AST_SYM_VALUE (condExpr->left->left) &&
1363 isSymbolEqual (*sym, AST_SYMBOL (condExpr->left->left)))
1366 *end = newNode ('+', condExpr->left->right,
1367 newAst_VALUE (constVal ("1")));
1378 /* check loop expression is of the form <sym>++ */
1379 if (!IS_AST_OP (loopExpr))
1382 /* check if <sym> ++ */
1383 if (loopExpr->opval.op == INC_OP)
1389 if (IS_AST_SYM_VALUE (loopExpr->left) &&
1390 isSymbolEqual (*sym, AST_SYMBOL (loopExpr->left)))
1397 if (IS_AST_SYM_VALUE (loopExpr->right) &&
1398 isSymbolEqual (*sym, AST_SYMBOL (loopExpr->right)))
1406 if (loopExpr->opval.op == ADD_ASSIGN)
1409 if (IS_AST_SYM_VALUE (loopExpr->left) &&
1410 isSymbolEqual (*sym, AST_SYMBOL (loopExpr->left)) &&
1411 IS_AST_LIT_VALUE (loopExpr->right) &&
1412 (int) AST_LIT_VALUE (loopExpr->right) != 1)
1420 /*-----------------------------------------------------------------*/
1421 /* astHasVolatile - returns true if ast contains any volatile */
1422 /*-----------------------------------------------------------------*/
1424 astHasVolatile (ast * tree)
1429 if (TETYPE (tree) && IS_VOLATILE (TETYPE (tree)))
1432 if (IS_AST_OP (tree))
1433 return astHasVolatile (tree->left) ||
1434 astHasVolatile (tree->right);
1439 /*-----------------------------------------------------------------*/
1440 /* astHasPointer - return true if the ast contains any ptr variable */
1441 /*-----------------------------------------------------------------*/
1443 astHasPointer (ast * tree)
1448 if (IS_AST_LINK (tree))
1451 /* if we hit an array expression then check
1452 only the left side */
1453 if (IS_AST_OP (tree) && tree->opval.op == '[')
1454 return astHasPointer (tree->left);
1456 if (IS_AST_VALUE (tree))
1457 return IS_PTR (tree->ftype) || IS_ARRAY (tree->ftype);
1459 return astHasPointer (tree->left) ||
1460 astHasPointer (tree->right);
1464 /*-----------------------------------------------------------------*/
1465 /* astHasSymbol - return true if the ast has the given symbol */
1466 /*-----------------------------------------------------------------*/
1468 astHasSymbol (ast * tree, symbol * sym)
1470 if (!tree || IS_AST_LINK (tree))
1473 if (IS_AST_VALUE (tree))
1475 if (IS_AST_SYM_VALUE (tree))
1476 return isSymbolEqual (AST_SYMBOL (tree), sym);
1481 return astHasSymbol (tree->left, sym) ||
1482 astHasSymbol (tree->right, sym);
1485 /*-----------------------------------------------------------------*/
1486 /* astHasDeref - return true if the ast has an indirect access */
1487 /*-----------------------------------------------------------------*/
1489 astHasDeref (ast * tree)
1491 if (!tree || IS_AST_LINK (tree) || IS_AST_VALUE(tree))
1494 if (tree->opval.op == '*' && tree->right == NULL) return TRUE;
1496 return astHasDeref (tree->left) || astHasDeref (tree->right);
1499 /*-----------------------------------------------------------------*/
1500 /* isConformingBody - the loop body has to conform to a set of rules */
1501 /* for the loop to be considered reversible read on for rules */
1502 /*-----------------------------------------------------------------*/
1504 isConformingBody (ast * pbody, symbol * sym, ast * body)
1507 /* we are going to do a pre-order traversal of the
1508 tree && check for the following conditions. (essentially
1509 a set of very shallow tests )
1510 a) the sym passed does not participate in
1511 any arithmetic operation
1512 b) There are no function calls
1513 c) all jumps are within the body
1514 d) address of loop control variable not taken
1515 e) if an assignment has a pointer on the
1516 left hand side make sure right does not have
1517 loop control variable */
1519 /* if we reach the end or a leaf then true */
1520 if (!pbody || IS_AST_LINK (pbody) || IS_AST_VALUE (pbody))
1523 /* if anything else is "volatile" */
1524 if (IS_VOLATILE (TETYPE (pbody)))
1527 /* we will walk the body in a pre-order traversal for
1529 switch (pbody->opval.op)
1531 /*------------------------------------------------------------------*/
1533 // if the loopvar is used as an index
1534 if (astHasSymbol(pbody->right, sym)) {
1537 return isConformingBody (pbody->right, sym, body);
1539 /*------------------------------------------------------------------*/
1544 /*------------------------------------------------------------------*/
1545 case INC_OP: /* incerement operator unary so left only */
1548 /* sure we are not sym is not modified */
1550 IS_AST_SYM_VALUE (pbody->left) &&
1551 isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1555 IS_AST_SYM_VALUE (pbody->right) &&
1556 isSymbolEqual (AST_SYMBOL (pbody->right), sym))
1561 /*------------------------------------------------------------------*/
1563 case '*': /* can be unary : if right is null then unary operation */
1568 /* if right is NULL then unary operation */
1569 /*------------------------------------------------------------------*/
1570 /*----------------------------*/
1572 /*----------------------------*/
1575 if (IS_AST_SYM_VALUE (pbody->left) &&
1576 isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1579 return isConformingBody (pbody->left, sym, body);
1583 if (astHasSymbol (pbody->left, sym) ||
1584 astHasSymbol (pbody->right, sym))
1589 /*------------------------------------------------------------------*/
1597 if (IS_AST_SYM_VALUE (pbody->left) &&
1598 isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1601 if (IS_AST_SYM_VALUE (pbody->right) &&
1602 isSymbolEqual (AST_SYMBOL (pbody->right), sym))
1605 return isConformingBody (pbody->left, sym, body) &&
1606 isConformingBody (pbody->right, sym, body);
1613 if (IS_AST_SYM_VALUE (pbody->left) &&
1614 isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1616 return isConformingBody (pbody->left, sym, body);
1618 /*------------------------------------------------------------------*/
1630 case SIZEOF: /* evaluate wihout code generation */
1632 return isConformingBody (pbody->left, sym, body) &&
1633 isConformingBody (pbody->right, sym, body);
1635 /*------------------------------------------------------------------*/
1638 /* if left has a pointer & right has loop
1639 control variable then we cannot */
1640 if (astHasPointer (pbody->left) &&
1641 astHasSymbol (pbody->right, sym))
1643 if (astHasVolatile (pbody->left))
1646 if (IS_AST_SYM_VALUE (pbody->left)) {
1647 // if the loopvar has an assignment
1648 if (isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1650 // if the loopvar is used in another (maybe conditional) block
1651 if (astHasSymbol (pbody->right, sym) &&
1652 (pbody->level > body->level)) {
1657 if (astHasVolatile (pbody->left))
1660 if (astHasDeref(pbody->right)) return FALSE;
1662 return isConformingBody (pbody->left, sym, body) &&
1663 isConformingBody (pbody->right, sym, body);
1674 assert ("Parser should not have generated this\n");
1676 /*------------------------------------------------------------------*/
1677 /*----------------------------*/
1678 /* comma operator */
1679 /*----------------------------*/
1681 return isConformingBody (pbody->left, sym, body) &&
1682 isConformingBody (pbody->right, sym, body);
1684 /*------------------------------------------------------------------*/
1685 /*----------------------------*/
1687 /*----------------------------*/
1689 /* if local & not passed as paramater then ok */
1690 if (sym->level && !astHasSymbol(pbody->right,sym))
1694 /*------------------------------------------------------------------*/
1695 /*----------------------------*/
1696 /* return statement */
1697 /*----------------------------*/
1702 if (isLabelInAst (AST_SYMBOL (pbody->left), body))
1707 if (astHasSymbol (pbody->left, sym))
1714 return isConformingBody (pbody->left, sym, body) &&
1715 isConformingBody (pbody->right, sym, body);
1721 /*-----------------------------------------------------------------*/
1722 /* isLoopReversible - takes a for loop as input && returns true */
1723 /* if the for loop is reversible. If yes will set the value of */
1724 /* the loop control var & init value & termination value */
1725 /*-----------------------------------------------------------------*/
1727 isLoopReversible (ast * loop, symbol ** loopCntrl,
1728 ast ** init, ast ** end)
1730 /* if option says don't do it then don't */
1731 if (optimize.noLoopReverse)
1733 /* there are several tests to determine this */
1735 /* for loop has to be of the form
1736 for ( <sym> = <const1> ;
1737 [<sym> < <const2>] ;
1738 [<sym>++] | [<sym> += 1] | [<sym> = <sym> + 1] )
1740 if (!isLoopCountable (AST_FOR (loop, initExpr),
1741 AST_FOR (loop, condExpr),
1742 AST_FOR (loop, loopExpr),
1743 loopCntrl, init, end))
1746 /* now do some serious checking on the body of the loop
1749 return isConformingBody (loop->left, *loopCntrl, loop->left);
1753 /*-----------------------------------------------------------------*/
1754 /* replLoopSym - replace the loop sym by loop sym -1 */
1755 /*-----------------------------------------------------------------*/
1757 replLoopSym (ast * body, symbol * sym)
1760 if (!body || IS_AST_LINK (body))
1763 if (IS_AST_SYM_VALUE (body))
1766 if (isSymbolEqual (AST_SYMBOL (body), sym))
1770 body->opval.op = '-';
1771 body->left = newAst_VALUE (symbolVal (sym));
1772 body->right = newAst_VALUE (constVal ("1"));
1780 replLoopSym (body->left, sym);
1781 replLoopSym (body->right, sym);
1785 /*-----------------------------------------------------------------*/
1786 /* reverseLoop - do the actual loop reversal */
1787 /*-----------------------------------------------------------------*/
1789 reverseLoop (ast * loop, symbol * sym, ast * init, ast * end)
1793 /* create the following tree
1798 if (sym) goto for_continue ;
1801 /* put it together piece by piece */
1802 rloop = newNode (NULLOP,
1803 createIf (newAst_VALUE (symbolVal (sym)),
1805 newAst_VALUE (symbolVal (AST_FOR (loop, continueLabel))),
1808 newAst_VALUE (symbolVal (sym)),
1811 replLoopSym (loop->left, sym);
1812 setAstLineno (rloop, init->lineno);
1814 rloop = newNode (NULLOP,
1816 newAst_VALUE (symbolVal (sym)),
1817 newNode ('-', end, init)),
1818 createLabel (AST_FOR (loop, continueLabel),
1822 newNode (SUB_ASSIGN,
1823 newAst_VALUE (symbolVal (sym)),
1824 newAst_VALUE (constVal ("1"))),
1827 rloop->lineno=init->lineno;
1828 return decorateType (rloop);
1832 /*-----------------------------------------------------------------*/
1833 /* decorateType - compute type for this tree also does type cheking */
1834 /* this is done bottom up, since type have to flow upwards */
1835 /* it also does constant folding, and paramater checking */
1836 /*-----------------------------------------------------------------*/
1838 decorateType (ast * tree)
1846 /* if already has type then do nothing */
1847 if (tree->decorated)
1850 tree->decorated = 1;
1852 /* print the line */
1853 /* if not block & function */
1854 if (tree->type == EX_OP &&
1855 (tree->opval.op != FUNCTION &&
1856 tree->opval.op != BLOCK &&
1857 tree->opval.op != NULLOP))
1859 filename = tree->filename;
1860 lineno = tree->lineno;
1863 /* if any child is an error | this one is an error do nothing */
1864 if (tree->isError ||
1865 (tree->left && tree->left->isError) ||
1866 (tree->right && tree->right->isError))
1869 /*------------------------------------------------------------------*/
1870 /*----------------------------*/
1871 /* leaf has been reached */
1872 /*----------------------------*/
1873 /* if this is of type value */
1874 /* just get the type */
1875 if (tree->type == EX_VALUE)
1878 if (IS_LITERAL (tree->opval.val->etype))
1881 /* if this is a character array then declare it */
1882 if (IS_ARRAY (tree->opval.val->type))
1883 tree->opval.val = stringToSymbol (tree->opval.val);
1885 /* otherwise just copy the type information */
1886 COPYTYPE (TTYPE (tree), TETYPE (tree), tree->opval.val->type);
1890 if (tree->opval.val->sym)
1892 /* if the undefined flag is set then give error message */
1893 if (tree->opval.val->sym->undefined)
1895 werror (E_ID_UNDEF, tree->opval.val->sym->name);
1897 TTYPE (tree) = TETYPE (tree) =
1898 tree->opval.val->type = tree->opval.val->sym->type =
1899 tree->opval.val->etype = tree->opval.val->sym->etype =
1900 copyLinkChain (INTTYPE);
1905 /* if impilicit i.e. struct/union member then no type */
1906 if (tree->opval.val->sym->implicit)
1907 TTYPE (tree) = TETYPE (tree) = NULL;
1912 /* else copy the type */
1913 COPYTYPE (TTYPE (tree), TETYPE (tree), tree->opval.val->type);
1915 /* and mark it as referenced */
1916 tree->opval.val->sym->isref = 1;
1924 /* if type link for the case of cast */
1925 if (tree->type == EX_LINK)
1927 COPYTYPE (TTYPE (tree), TETYPE (tree), tree->opval.lnk);
1934 dtl = decorateType (tree->left);
1935 /* delay right side for '?' operator since conditional macro expansions might
1937 dtr = (tree->opval.op == '?' ? tree->right : decorateType (tree->right));
1939 /* this is to take care of situations
1940 when the tree gets rewritten */
1941 if (dtl != tree->left)
1943 if (dtr != tree->right)
1947 /* depending on type of operator do */
1949 switch (tree->opval.op)
1951 /*------------------------------------------------------------------*/
1952 /*----------------------------*/
1954 /*----------------------------*/
1957 /* determine which is the array & which the index */
1958 if ((IS_ARRAY (RTYPE (tree)) || IS_PTR (RTYPE (tree))) && IS_INTEGRAL (LTYPE (tree)))
1961 ast *tempTree = tree->left;
1962 tree->left = tree->right;
1963 tree->right = tempTree;
1966 /* first check if this is a array or a pointer */
1967 if ((!IS_ARRAY (LTYPE (tree))) && (!IS_PTR (LTYPE (tree))))
1969 werror (E_NEED_ARRAY_PTR, "[]");
1970 goto errorTreeReturn;
1973 /* check if the type of the idx */
1974 if (!IS_INTEGRAL (RTYPE (tree)))
1976 werror (E_IDX_NOT_INT);
1977 goto errorTreeReturn;
1980 /* if the left is an rvalue then error */
1983 werror (E_LVALUE_REQUIRED, "array access");
1984 goto errorTreeReturn;
1987 COPYTYPE (TTYPE (tree), TETYPE (tree), LTYPE (tree)->next);
1988 if (IS_PTR(LTYPE(tree))) {
1989 SPEC_CONST (TETYPE (tree)) = DCL_PTR_CONST (LTYPE(tree));
1993 /*------------------------------------------------------------------*/
1994 /*----------------------------*/
1996 /*----------------------------*/
1998 /* if this is not a structure */
1999 if (!IS_STRUCT (LTYPE (tree)))
2001 werror (E_STRUCT_UNION, ".");
2002 goto errorTreeReturn;
2004 TTYPE (tree) = structElemType (LTYPE (tree),
2005 (tree->right->type == EX_VALUE ?
2006 tree->right->opval.val : NULL));
2007 TETYPE (tree) = getSpec (TTYPE (tree));
2010 /*------------------------------------------------------------------*/
2011 /*----------------------------*/
2012 /* struct/union pointer */
2013 /*----------------------------*/
2015 /* if not pointer to a structure */
2016 if (!IS_PTR (LTYPE (tree)))
2018 werror (E_PTR_REQD);
2019 goto errorTreeReturn;
2022 if (!IS_STRUCT (LTYPE (tree)->next))
2024 werror (E_STRUCT_UNION, "->");
2025 goto errorTreeReturn;
2028 TTYPE (tree) = structElemType (LTYPE (tree)->next,
2029 (tree->right->type == EX_VALUE ?
2030 tree->right->opval.val : NULL));
2031 TETYPE (tree) = getSpec (TTYPE (tree));
2033 /* adjust the storage class */
2034 switch (DCL_TYPE(tree->left->ftype)) {
2038 SPEC_SCLS(TETYPE(tree)) = S_XDATA;
2041 SPEC_SCLS(TETYPE(tree)) = S_CODE;
2046 SPEC_SCLS(TETYPE(tree)) = S_XSTACK;
2049 SPEC_SCLS(TETYPE(tree)) = S_IDATA;
2052 SPEC_SCLS(TETYPE(tree)) = S_EEPROM;
2061 /*------------------------------------------------------------------*/
2062 /*----------------------------*/
2063 /* ++/-- operation */
2064 /*----------------------------*/
2065 case INC_OP: /* incerement operator unary so left only */
2068 sym_link *ltc = (tree->right ? RTYPE (tree) : LTYPE (tree));
2069 COPYTYPE (TTYPE (tree), TETYPE (tree), ltc);
2070 if (!tree->initMode && IS_CONSTANT(TETYPE(tree)))
2071 werror (E_CODE_WRITE, "++/--");
2080 /*------------------------------------------------------------------*/
2081 /*----------------------------*/
2083 /*----------------------------*/
2084 case '&': /* can be unary */
2085 /* if right is NULL then unary operation */
2086 if (tree->right) /* not an unary operation */
2089 if (!IS_INTEGRAL (LTYPE (tree)) || !IS_INTEGRAL (RTYPE (tree)))
2091 werror (E_BITWISE_OP);
2092 werror (W_CONTINUE, "left & right types are ");
2093 printTypeChain (LTYPE (tree), stderr);
2094 fprintf (stderr, ",");
2095 printTypeChain (RTYPE (tree), stderr);
2096 fprintf (stderr, "\n");
2097 goto errorTreeReturn;
2100 /* if they are both literal */
2101 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2103 tree->type = EX_VALUE;
2104 tree->opval.val = valBitwise (valFromType (LETYPE (tree)),
2105 valFromType (RETYPE (tree)), '&');
2107 tree->right = tree->left = NULL;
2108 TETYPE (tree) = tree->opval.val->etype;
2109 TTYPE (tree) = tree->opval.val->type;
2113 /* see if this is a GETHBIT operation if yes
2116 ast *otree = optimizeGetHbit (tree);
2119 return decorateType (otree);
2123 computeType (LTYPE (tree), RTYPE (tree));
2124 TETYPE (tree) = getSpec (TTYPE (tree));
2126 LRVAL (tree) = RRVAL (tree) = 1;
2130 /*------------------------------------------------------------------*/
2131 /*----------------------------*/
2133 /*----------------------------*/
2135 p->class = DECLARATOR;
2136 /* if bit field then error */
2137 if (IS_BITVAR (tree->left->etype))
2139 werror (E_ILLEGAL_ADDR, "address of bit variable");
2140 goto errorTreeReturn;
2143 if (SPEC_SCLS (tree->left->etype) == S_REGISTER)
2145 werror (E_ILLEGAL_ADDR, "address of register variable");
2146 goto errorTreeReturn;
2149 if (IS_FUNC (LTYPE (tree)))
2151 werror (E_ILLEGAL_ADDR, "address of function");
2152 goto errorTreeReturn;
2155 if (IS_LITERAL(LTYPE(tree)))
2157 werror (E_ILLEGAL_ADDR, "address of literal");
2158 goto errorTreeReturn;
2163 werror (E_LVALUE_REQUIRED, "address of");
2164 goto errorTreeReturn;
2166 if (SPEC_SCLS (tree->left->etype) == S_CODE)
2168 DCL_TYPE (p) = CPOINTER;
2169 DCL_PTR_CONST (p) = port->mem.code_ro;
2171 else if (SPEC_SCLS (tree->left->etype) == S_XDATA)
2172 DCL_TYPE (p) = FPOINTER;
2173 else if (SPEC_SCLS (tree->left->etype) == S_XSTACK)
2174 DCL_TYPE (p) = PPOINTER;
2175 else if (SPEC_SCLS (tree->left->etype) == S_IDATA)
2176 DCL_TYPE (p) = IPOINTER;
2177 else if (SPEC_SCLS (tree->left->etype) == S_EEPROM)
2178 DCL_TYPE (p) = EEPPOINTER;
2179 else if (SPEC_OCLS(tree->left->etype))
2180 DCL_TYPE (p) = PTR_TYPE(SPEC_OCLS(tree->left->etype));
2182 DCL_TYPE (p) = POINTER;
2184 if (IS_AST_SYM_VALUE (tree->left))
2186 AST_SYMBOL (tree->left)->addrtaken = 1;
2187 AST_SYMBOL (tree->left)->allocreq = 1;
2190 p->next = LTYPE (tree);
2192 TETYPE (tree) = getSpec (TTYPE (tree));
2193 DCL_PTR_CONST (p) = SPEC_CONST (TETYPE (tree));
2194 DCL_PTR_VOLATILE (p) = SPEC_VOLATILE (TETYPE (tree));
2199 /*------------------------------------------------------------------*/
2200 /*----------------------------*/
2202 /*----------------------------*/
2204 /* if the rewrite succeeds then don't go any furthur */
2206 ast *wtree = optimizeRRCRLC (tree);
2208 return decorateType (wtree);
2210 /*------------------------------------------------------------------*/
2211 /*----------------------------*/
2213 /*----------------------------*/
2215 if (!IS_INTEGRAL (LTYPE (tree)) || !IS_INTEGRAL (RTYPE (tree)))
2217 werror (E_BITWISE_OP);
2218 werror (W_CONTINUE, "left & right types are ");
2219 printTypeChain (LTYPE (tree), stderr);
2220 fprintf (stderr, ",");
2221 printTypeChain (RTYPE (tree), stderr);
2222 fprintf (stderr, "\n");
2223 goto errorTreeReturn;
2226 /* if they are both literal then */
2227 /* rewrite the tree */
2228 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2230 tree->type = EX_VALUE;
2231 tree->opval.val = valBitwise (valFromType (LETYPE (tree)),
2232 valFromType (RETYPE (tree)),
2234 tree->right = tree->left = NULL;
2235 TETYPE (tree) = tree->opval.val->etype;
2236 TTYPE (tree) = tree->opval.val->type;
2239 LRVAL (tree) = RRVAL (tree) = 1;
2240 TETYPE (tree) = getSpec (TTYPE (tree) =
2241 computeType (LTYPE (tree),
2244 /*------------------------------------------------------------------*/
2245 /*----------------------------*/
2247 /*----------------------------*/
2249 if (!IS_ARITHMETIC (LTYPE (tree)) || !IS_ARITHMETIC (RTYPE (tree)))
2251 werror (E_INVALID_OP, "divide");
2252 goto errorTreeReturn;
2254 /* if they are both literal then */
2255 /* rewrite the tree */
2256 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2258 tree->type = EX_VALUE;
2259 tree->opval.val = valDiv (valFromType (LETYPE (tree)),
2260 valFromType (RETYPE (tree)));
2261 tree->right = tree->left = NULL;
2262 TETYPE (tree) = getSpec (TTYPE (tree) =
2263 tree->opval.val->type);
2266 LRVAL (tree) = RRVAL (tree) = 1;
2267 TETYPE (tree) = getSpec (TTYPE (tree) =
2268 computeType (LTYPE (tree),
2272 /*------------------------------------------------------------------*/
2273 /*----------------------------*/
2275 /*----------------------------*/
2277 if (!IS_INTEGRAL (LTYPE (tree)) || !IS_INTEGRAL (RTYPE (tree)))
2279 werror (E_BITWISE_OP);
2280 werror (W_CONTINUE, "left & right types are ");
2281 printTypeChain (LTYPE (tree), stderr);
2282 fprintf (stderr, ",");
2283 printTypeChain (RTYPE (tree), stderr);
2284 fprintf (stderr, "\n");
2285 goto errorTreeReturn;
2287 /* if they are both literal then */
2288 /* rewrite the tree */
2289 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2291 tree->type = EX_VALUE;
2292 tree->opval.val = valMod (valFromType (LETYPE (tree)),
2293 valFromType (RETYPE (tree)));
2294 tree->right = tree->left = NULL;
2295 TETYPE (tree) = getSpec (TTYPE (tree) =
2296 tree->opval.val->type);
2299 LRVAL (tree) = RRVAL (tree) = 1;
2300 TETYPE (tree) = getSpec (TTYPE (tree) =
2301 computeType (LTYPE (tree),
2305 /*------------------------------------------------------------------*/
2306 /*----------------------------*/
2307 /* address dereference */
2308 /*----------------------------*/
2309 case '*': /* can be unary : if right is null then unary operation */
2312 if (!IS_PTR (LTYPE (tree)) && !IS_ARRAY (LTYPE (tree)))
2314 werror (E_PTR_REQD);
2315 goto errorTreeReturn;
2320 werror (E_LVALUE_REQUIRED, "pointer deref");
2321 goto errorTreeReturn;
2323 TTYPE (tree) = copyLinkChain ((IS_PTR (LTYPE (tree)) || IS_ARRAY (LTYPE (tree))) ?
2324 LTYPE (tree)->next : NULL);
2325 TETYPE (tree) = getSpec (TTYPE (tree));
2326 SPEC_CONST (TETYPE (tree)) = DCL_PTR_CONST (LTYPE(tree));
2330 /*------------------------------------------------------------------*/
2331 /*----------------------------*/
2332 /* multiplication */
2333 /*----------------------------*/
2334 if (!IS_ARITHMETIC (LTYPE (tree)) || !IS_ARITHMETIC (RTYPE (tree)))
2336 werror (E_INVALID_OP, "multiplication");
2337 goto errorTreeReturn;
2340 /* if they are both literal then */
2341 /* rewrite the tree */
2342 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2344 tree->type = EX_VALUE;
2345 tree->opval.val = valMult (valFromType (LETYPE (tree)),
2346 valFromType (RETYPE (tree)));
2347 tree->right = tree->left = NULL;
2348 TETYPE (tree) = getSpec (TTYPE (tree) =
2349 tree->opval.val->type);
2353 /* if left is a literal exchange left & right */
2354 if (IS_LITERAL (LTYPE (tree)))
2356 ast *tTree = tree->left;
2357 tree->left = tree->right;
2358 tree->right = tTree;
2361 LRVAL (tree) = RRVAL (tree) = 1;
2362 /* promote result to int if left & right are char
2363 this will facilitate hardware multiplies 8bit x 8bit = 16bit */
2364 if (IS_CHAR(LETYPE(tree)) && IS_CHAR(RETYPE(tree))) {
2365 TETYPE (tree) = getSpec (TTYPE (tree) =
2366 computeType (LTYPE (tree),
2368 SPEC_NOUN(TETYPE(tree)) = V_INT;
2370 TETYPE (tree) = getSpec (TTYPE (tree) =
2371 computeType (LTYPE (tree),
2376 /*------------------------------------------------------------------*/
2377 /*----------------------------*/
2378 /* unary '+' operator */
2379 /*----------------------------*/
2384 if (!IS_INTEGRAL (LTYPE (tree)))
2386 werror (E_UNARY_OP, '+');
2387 goto errorTreeReturn;
2390 /* if left is a literal then do it */
2391 if (IS_LITERAL (LTYPE (tree)))
2393 tree->type = EX_VALUE;
2394 tree->opval.val = valFromType (LETYPE (tree));
2396 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
2400 COPYTYPE (TTYPE (tree), TETYPE (tree), LTYPE (tree));
2404 /*------------------------------------------------------------------*/
2405 /*----------------------------*/
2407 /*----------------------------*/
2409 /* this is not a unary operation */
2410 /* if both pointers then problem */
2411 if ((IS_PTR (LTYPE (tree)) || IS_ARRAY (LTYPE (tree))) &&
2412 (IS_PTR (RTYPE (tree)) || IS_ARRAY (RTYPE (tree))))
2414 werror (E_PTR_PLUS_PTR);
2415 goto errorTreeReturn;
2418 if (!IS_ARITHMETIC (LTYPE (tree)) &&
2419 !IS_PTR (LTYPE (tree)) && !IS_ARRAY (LTYPE (tree)))
2421 werror (E_PLUS_INVALID, "+");
2422 goto errorTreeReturn;
2425 if (!IS_ARITHMETIC (RTYPE (tree)) &&
2426 !IS_PTR (RTYPE (tree)) && !IS_ARRAY (RTYPE (tree)))
2428 werror (E_PLUS_INVALID, "+");
2429 goto errorTreeReturn;
2431 /* if they are both literal then */
2432 /* rewrite the tree */
2433 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2435 tree->type = EX_VALUE;
2436 tree->opval.val = valPlus (valFromType (LETYPE (tree)),
2437 valFromType (RETYPE (tree)));
2438 tree->right = tree->left = NULL;
2439 TETYPE (tree) = getSpec (TTYPE (tree) =
2440 tree->opval.val->type);
2444 /* if the right is a pointer or left is a literal
2445 xchange left & right */
2446 if (IS_ARRAY (RTYPE (tree)) ||
2447 IS_PTR (RTYPE (tree)) ||
2448 IS_LITERAL (LTYPE (tree)))
2450 ast *tTree = tree->left;
2451 tree->left = tree->right;
2452 tree->right = tTree;
2455 LRVAL (tree) = RRVAL (tree) = 1;
2456 /* if the left is a pointer */
2457 if (IS_PTR (LTYPE (tree)))
2458 TETYPE (tree) = getSpec (TTYPE (tree) =
2461 TETYPE (tree) = getSpec (TTYPE (tree) =
2462 computeType (LTYPE (tree),
2466 /*------------------------------------------------------------------*/
2467 /*----------------------------*/
2469 /*----------------------------*/
2470 case '-': /* can be unary */
2471 /* if right is null then unary */
2475 if (!IS_ARITHMETIC (LTYPE (tree)))
2477 werror (E_UNARY_OP, tree->opval.op);
2478 goto errorTreeReturn;
2481 /* if left is a literal then do it */
2482 if (IS_LITERAL (LTYPE (tree)))
2484 tree->type = EX_VALUE;
2485 tree->opval.val = valUnaryPM (valFromType (LETYPE (tree)));
2487 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
2488 SPEC_USIGN(TETYPE(tree)) = 0;
2492 TTYPE (tree) = LTYPE (tree);
2496 /*------------------------------------------------------------------*/
2497 /*----------------------------*/
2499 /*----------------------------*/
2501 if (!(IS_PTR (LTYPE (tree)) ||
2502 IS_ARRAY (LTYPE (tree)) ||
2503 IS_ARITHMETIC (LTYPE (tree))))
2505 werror (E_PLUS_INVALID, "-");
2506 goto errorTreeReturn;
2509 if (!(IS_PTR (RTYPE (tree)) ||
2510 IS_ARRAY (RTYPE (tree)) ||
2511 IS_ARITHMETIC (RTYPE (tree))))
2513 werror (E_PLUS_INVALID, "-");
2514 goto errorTreeReturn;
2517 if ((IS_PTR (LTYPE (tree)) || IS_ARRAY (LTYPE (tree))) &&
2518 !(IS_PTR (RTYPE (tree)) || IS_ARRAY (RTYPE (tree)) ||
2519 IS_INTEGRAL (RTYPE (tree))))
2521 werror (E_PLUS_INVALID, "-");
2522 goto errorTreeReturn;
2525 /* if they are both literal then */
2526 /* rewrite the tree */
2527 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2529 tree->type = EX_VALUE;
2530 tree->opval.val = valMinus (valFromType (LETYPE (tree)),
2531 valFromType (RETYPE (tree)));
2532 tree->right = tree->left = NULL;
2533 TETYPE (tree) = getSpec (TTYPE (tree) =
2534 tree->opval.val->type);
2538 /* if the left & right are equal then zero */
2539 if (isAstEqual (tree->left, tree->right))
2541 tree->type = EX_VALUE;
2542 tree->left = tree->right = NULL;
2543 tree->opval.val = constVal ("0");
2544 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
2548 /* if both of them are pointers or arrays then */
2549 /* the result is going to be an integer */
2550 if ((IS_ARRAY (LTYPE (tree)) || IS_PTR (LTYPE (tree))) &&
2551 (IS_ARRAY (RTYPE (tree)) || IS_PTR (RTYPE (tree))))
2552 TETYPE (tree) = TTYPE (tree) = newIntLink ();
2554 /* if only the left is a pointer */
2555 /* then result is a pointer */
2556 if (IS_PTR (LTYPE (tree)) || IS_ARRAY (LTYPE (tree)))
2557 TETYPE (tree) = getSpec (TTYPE (tree) =
2560 TETYPE (tree) = getSpec (TTYPE (tree) =
2561 computeType (LTYPE (tree),
2563 LRVAL (tree) = RRVAL (tree) = 1;
2566 /*------------------------------------------------------------------*/
2567 /*----------------------------*/
2569 /*----------------------------*/
2571 /* can be only integral type */
2572 if (!IS_INTEGRAL (LTYPE (tree)))
2574 werror (E_UNARY_OP, tree->opval.op);
2575 goto errorTreeReturn;
2578 /* if left is a literal then do it */
2579 if (IS_LITERAL (LTYPE (tree)))
2581 tree->type = EX_VALUE;
2582 tree->opval.val = valComplement (valFromType (LETYPE (tree)));
2584 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
2588 COPYTYPE (TTYPE (tree), TETYPE (tree), LTYPE (tree));
2591 /*------------------------------------------------------------------*/
2592 /*----------------------------*/
2594 /*----------------------------*/
2596 /* can be pointer */
2597 if (!IS_ARITHMETIC (LTYPE (tree)) &&
2598 !IS_PTR (LTYPE (tree)) &&
2599 !IS_ARRAY (LTYPE (tree)))
2601 werror (E_UNARY_OP, tree->opval.op);
2602 goto errorTreeReturn;
2605 /* if left is a literal then do it */
2606 if (IS_LITERAL (LTYPE (tree)))
2608 tree->type = EX_VALUE;
2609 tree->opval.val = valNot (valFromType (LETYPE (tree)));
2611 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
2615 TTYPE (tree) = TETYPE (tree) = newCharLink ();
2618 /*------------------------------------------------------------------*/
2619 /*----------------------------*/
2621 /*----------------------------*/
2624 TTYPE (tree) = LTYPE (tree);
2625 TETYPE (tree) = LETYPE (tree);
2629 TTYPE (tree) = TETYPE (tree) = newCharLink ();
2634 if (!IS_INTEGRAL (LTYPE (tree)) || !IS_INTEGRAL (tree->left->etype))
2636 werror (E_SHIFT_OP_INVALID);
2637 werror (W_CONTINUE, "left & right types are ");
2638 printTypeChain (LTYPE (tree), stderr);
2639 fprintf (stderr, ",");
2640 printTypeChain (RTYPE (tree), stderr);
2641 fprintf (stderr, "\n");
2642 goto errorTreeReturn;
2645 /* if they are both literal then */
2646 /* rewrite the tree */
2647 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2649 tree->type = EX_VALUE;
2650 tree->opval.val = valShift (valFromType (LETYPE (tree)),
2651 valFromType (RETYPE (tree)),
2652 (tree->opval.op == LEFT_OP ? 1 : 0));
2653 tree->right = tree->left = NULL;
2654 TETYPE (tree) = getSpec (TTYPE (tree) =
2655 tree->opval.val->type);
2658 /* if only the right side is a literal & we are
2659 shifting more than size of the left operand then zero */
2660 if (IS_LITERAL (RTYPE (tree)) &&
2661 ((unsigned) floatFromVal (valFromType (RETYPE (tree)))) >=
2662 (getSize (LTYPE (tree)) * 8))
2664 werror (W_SHIFT_CHANGED,
2665 (tree->opval.op == LEFT_OP ? "left" : "right"));
2666 tree->type = EX_VALUE;
2667 tree->left = tree->right = NULL;
2668 tree->opval.val = constVal ("0");
2669 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
2672 LRVAL (tree) = RRVAL (tree) = 1;
2673 if (IS_LITERAL (LTYPE (tree)) && !IS_LITERAL (RTYPE (tree)))
2675 COPYTYPE (TTYPE (tree), TETYPE (tree), RTYPE (tree));
2679 COPYTYPE (TTYPE (tree), TETYPE (tree), LTYPE (tree));
2683 /*------------------------------------------------------------------*/
2684 /*----------------------------*/
2686 /*----------------------------*/
2687 case CAST: /* change the type */
2688 /* cannot cast to an aggregate type */
2689 if (IS_AGGREGATE (LTYPE (tree)))
2691 werror (E_CAST_ILLEGAL);
2692 goto errorTreeReturn;
2695 /* make sure the type is complete and sane */
2696 checkTypeSanity(LETYPE(tree), "(cast)");
2699 /* if the right is a literal replace the tree */
2700 if (IS_LITERAL (RETYPE (tree))) {
2701 if (!IS_PTR (LTYPE (tree))) {
2702 tree->type = EX_VALUE;
2704 valCastLiteral (LTYPE (tree),
2705 floatFromVal (valFromType (RETYPE (tree))));
2708 TTYPE (tree) = tree->opval.val->type;
2709 tree->values.literalFromCast = 1;
2710 } else if (IS_GENPTR(LTYPE(tree)) && !IS_PTR(RTYPE(tree)) &&
2711 ((int)floatFromVal(valFromType(RETYPE(tree)))) !=0 ) /* special case of NULL */ {
2712 sym_link *rest = LTYPE(tree)->next;
2713 werror(W_LITERAL_GENERIC);
2714 TTYPE(tree) = newLink();
2715 DCL_TYPE(TTYPE(tree)) = FPOINTER;
2716 TTYPE(tree)->next = rest;
2717 tree->left->opval.lnk = TTYPE(tree);
2720 TTYPE (tree) = LTYPE (tree);
2724 TTYPE (tree) = LTYPE (tree);
2728 /* if pointer to struct then check names */
2729 if (IS_PTR(LTYPE(tree)) && IS_STRUCT(LTYPE(tree)->next) &&
2730 IS_PTR(RTYPE(tree)) && IS_STRUCT(RTYPE(tree)->next) &&
2731 strcmp(SPEC_STRUCT(LETYPE(tree))->tag,SPEC_STRUCT(RETYPE(tree))->tag)) {
2732 werror(W_CAST_STRUCT_PTR,SPEC_STRUCT(RETYPE(tree))->tag,SPEC_STRUCT(LETYPE(tree))->tag);
2734 /* if the right is a literal replace the tree */
2735 if (IS_LITERAL (RETYPE (tree)) && !IS_PTR (LTYPE (tree))) {
2736 tree->type = EX_VALUE;
2738 valCastLiteral (LTYPE (tree),
2739 floatFromVal (valFromType (RETYPE (tree))));
2742 TTYPE (tree) = tree->opval.val->type;
2743 tree->values.literalFromCast = 1;
2745 TTYPE (tree) = LTYPE (tree);
2749 TETYPE (tree) = getSpec (TTYPE (tree));
2753 /*------------------------------------------------------------------*/
2754 /*----------------------------*/
2755 /* logical &&, || */
2756 /*----------------------------*/
2759 /* each must me arithmetic type or be a pointer */
2760 if (!IS_PTR (LTYPE (tree)) &&
2761 !IS_ARRAY (LTYPE (tree)) &&
2762 !IS_INTEGRAL (LTYPE (tree)))
2764 werror (E_COMPARE_OP);
2765 goto errorTreeReturn;
2768 if (!IS_PTR (RTYPE (tree)) &&
2769 !IS_ARRAY (RTYPE (tree)) &&
2770 !IS_INTEGRAL (RTYPE (tree)))
2772 werror (E_COMPARE_OP);
2773 goto errorTreeReturn;
2775 /* if they are both literal then */
2776 /* rewrite the tree */
2777 if (IS_LITERAL (RTYPE (tree)) &&
2778 IS_LITERAL (LTYPE (tree)))
2780 tree->type = EX_VALUE;
2781 tree->opval.val = valLogicAndOr (valFromType (LETYPE (tree)),
2782 valFromType (RETYPE (tree)),
2784 tree->right = tree->left = NULL;
2785 TETYPE (tree) = getSpec (TTYPE (tree) =
2786 tree->opval.val->type);
2789 LRVAL (tree) = RRVAL (tree) = 1;
2790 TTYPE (tree) = TETYPE (tree) = newCharLink ();
2793 /*------------------------------------------------------------------*/
2794 /*----------------------------*/
2795 /* comparison operators */
2796 /*----------------------------*/
2804 ast *lt = optimizeCompare (tree);
2810 /* if they are pointers they must be castable */
2811 if (IS_PTR (LTYPE (tree)) && IS_PTR (RTYPE (tree)))
2813 if (compareType (LTYPE (tree), RTYPE (tree)) == 0)
2815 werror (E_COMPARE_OP);
2816 fprintf (stderr, "comparing type ");
2817 printTypeChain (LTYPE (tree), stderr);
2818 fprintf (stderr, "to type ");
2819 printTypeChain (RTYPE (tree), stderr);
2820 fprintf (stderr, "\n");
2821 goto errorTreeReturn;
2824 /* else they should be promotable to one another */
2827 if (!((IS_PTR (LTYPE (tree)) && IS_LITERAL (RTYPE (tree))) ||
2828 (IS_PTR (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))))
2830 if (compareType (LTYPE (tree), RTYPE (tree)) == 0)
2832 werror (E_COMPARE_OP);
2833 fprintf (stderr, "comparing type ");
2834 printTypeChain (LTYPE (tree), stderr);
2835 fprintf (stderr, "to type ");
2836 printTypeChain (RTYPE (tree), stderr);
2837 fprintf (stderr, "\n");
2838 goto errorTreeReturn;
2841 /* if unsigned value < 0 then always false */
2842 /* if (unsigned value) > 0 then (unsigned value) */
2843 if (SPEC_USIGN(LETYPE(tree)) && IS_LITERAL(RTYPE(tree)) &&
2844 ((int) floatFromVal (valFromType (RETYPE (tree)))) == 0) {
2846 if (tree->opval.op == '<') {
2849 if (tree->opval.op == '>') {
2853 /* if they are both literal then */
2854 /* rewrite the tree */
2855 if (IS_LITERAL (RTYPE (tree)) &&
2856 IS_LITERAL (LTYPE (tree)))
2858 tree->type = EX_VALUE;
2859 tree->opval.val = valCompare (valFromType (LETYPE (tree)),
2860 valFromType (RETYPE (tree)),
2862 tree->right = tree->left = NULL;
2863 TETYPE (tree) = getSpec (TTYPE (tree) =
2864 tree->opval.val->type);
2867 LRVAL (tree) = RRVAL (tree) = 1;
2868 TTYPE (tree) = TETYPE (tree) = newCharLink ();
2871 /*------------------------------------------------------------------*/
2872 /*----------------------------*/
2874 /*----------------------------*/
2875 case SIZEOF: /* evaluate wihout code generation */
2876 /* change the type to a integer */
2877 tree->type = EX_VALUE;
2878 sprintf (buffer, "%d", (getSize (tree->right->ftype)));
2879 tree->opval.val = constVal (buffer);
2880 tree->right = tree->left = NULL;
2881 TETYPE (tree) = getSpec (TTYPE (tree) =
2882 tree->opval.val->type);
2885 /*------------------------------------------------------------------*/
2886 /*----------------------------*/
2888 /*----------------------------*/
2890 /* return typeof enum value */
2891 tree->type = EX_VALUE;
2894 if (IS_SPEC(tree->right->ftype)) {
2895 switch (SPEC_NOUN(tree->right->ftype)) {
2897 if (SPEC_LONG(tree->right->ftype)) typeofv = TYPEOF_LONG;
2898 else typeofv = TYPEOF_INT;
2901 typeofv = TYPEOF_FLOAT;
2904 typeofv = TYPEOF_CHAR;
2907 typeofv = TYPEOF_VOID;
2910 typeofv = TYPEOF_STRUCT;
2913 typeofv = TYPEOF_BIT;
2916 typeofv = TYPEOF_SBIT;
2922 switch (DCL_TYPE(tree->right->ftype)) {
2924 typeofv = TYPEOF_POINTER;
2927 typeofv = TYPEOF_FPOINTER;
2930 typeofv = TYPEOF_CPOINTER;
2933 typeofv = TYPEOF_GPOINTER;
2936 typeofv = TYPEOF_PPOINTER;
2939 typeofv = TYPEOF_IPOINTER;
2942 typeofv = TYPEOF_ARRAY;
2945 typeofv = TYPEOF_FUNCTION;
2951 sprintf (buffer, "%d", typeofv);
2952 tree->opval.val = constVal (buffer);
2953 tree->right = tree->left = NULL;
2954 TETYPE (tree) = getSpec (TTYPE (tree) =
2955 tree->opval.val->type);
2958 /*------------------------------------------------------------------*/
2959 /*----------------------------*/
2960 /* conditional operator '?' */
2961 /*----------------------------*/
2963 /* the type is value of the colon operator (on the right) */
2964 assert(IS_COLON_OP(tree->right));
2965 /* if already known then replace the tree : optimizer will do it
2966 but faster to do it here */
2967 if (IS_LITERAL (LTYPE(tree))) {
2968 if ( ((int) floatFromVal (valFromType (LETYPE (tree)))) != 0) {
2969 return decorateType(tree->right->left) ;
2971 return decorateType(tree->right->right) ;
2974 tree->right = decorateType(tree->right);
2975 TTYPE (tree) = RTYPE(tree);
2976 TETYPE (tree) = getSpec (TTYPE (tree));
2981 /* if they don't match we have a problem */
2982 if (compareType (LTYPE (tree), RTYPE (tree)) == 0)
2984 werror (E_TYPE_MISMATCH, "conditional operator", " ");
2985 goto errorTreeReturn;
2988 TTYPE (tree) = computeType (LTYPE (tree), RTYPE (tree));
2989 TETYPE (tree) = getSpec (TTYPE (tree));
2993 #if 0 // assignment operators are converted by the parser
2994 /*------------------------------------------------------------------*/
2995 /*----------------------------*/
2996 /* assignment operators */
2997 /*----------------------------*/
3000 /* for these it must be both must be integral */
3001 if (!IS_ARITHMETIC (LTYPE (tree)) ||
3002 !IS_ARITHMETIC (RTYPE (tree)))
3004 werror (E_OPS_INTEGRAL);
3005 goto errorTreeReturn;
3008 TETYPE (tree) = getSpec (TTYPE (tree) = LTYPE (tree));
3010 if (!tree->initMode && IS_CONSTANT (LETYPE (tree)))
3011 werror (E_CODE_WRITE, " ");
3015 werror (E_LVALUE_REQUIRED, "*= or /=");
3016 goto errorTreeReturn;
3027 /* for these it must be both must be integral */
3028 if (!IS_INTEGRAL (LTYPE (tree)) ||
3029 !IS_INTEGRAL (RTYPE (tree)))
3031 werror (E_OPS_INTEGRAL);
3032 goto errorTreeReturn;
3035 TETYPE (tree) = getSpec (TTYPE (tree) = LTYPE (tree));
3037 if (!tree->initMode && IS_CONSTANT (LETYPE (tree)))
3038 werror (E_CODE_WRITE, " ");
3042 werror (E_LVALUE_REQUIRED, "&= or |= or ^= or >>= or <<=");
3043 goto errorTreeReturn;
3049 /*------------------------------------------------------------------*/
3050 /*----------------------------*/
3052 /*----------------------------*/
3054 if (!(IS_PTR (LTYPE (tree)) ||
3055 IS_ARITHMETIC (LTYPE (tree))))
3057 werror (E_PLUS_INVALID, "-=");
3058 goto errorTreeReturn;
3061 if (!(IS_PTR (RTYPE (tree)) ||
3062 IS_ARITHMETIC (RTYPE (tree))))
3064 werror (E_PLUS_INVALID, "-=");
3065 goto errorTreeReturn;
3068 TETYPE (tree) = getSpec (TTYPE (tree) =
3069 computeType (LTYPE (tree),
3072 if (!tree->initMode && IS_CONSTANT (LETYPE (tree)))
3073 werror (E_CODE_WRITE, " ");
3077 werror (E_LVALUE_REQUIRED, "-=");
3078 goto errorTreeReturn;
3084 /*------------------------------------------------------------------*/
3085 /*----------------------------*/
3087 /*----------------------------*/
3089 /* this is not a unary operation */
3090 /* if both pointers then problem */
3091 if (IS_PTR (LTYPE (tree)) && IS_PTR (RTYPE (tree)))
3093 werror (E_PTR_PLUS_PTR);
3094 goto errorTreeReturn;
3097 if (!IS_ARITHMETIC (LTYPE (tree)) && !IS_PTR (LTYPE (tree)))
3099 werror (E_PLUS_INVALID, "+=");
3100 goto errorTreeReturn;
3103 if (!IS_ARITHMETIC (RTYPE (tree)) && !IS_PTR (RTYPE (tree)))
3105 werror (E_PLUS_INVALID, "+=");
3106 goto errorTreeReturn;
3109 TETYPE (tree) = getSpec (TTYPE (tree) =
3110 computeType (LTYPE (tree),
3113 if (!tree->initMode && IS_CONSTANT (LETYPE (tree)))
3114 werror (E_CODE_WRITE, " ");
3118 werror (E_LVALUE_REQUIRED, "+=");
3119 goto errorTreeReturn;
3122 tree->right = decorateType (newNode ('+', copyAst (tree->left), tree->right));
3123 tree->opval.op = '=';
3128 /*------------------------------------------------------------------*/
3129 /*----------------------------*/
3130 /* straight assignemnt */
3131 /*----------------------------*/
3133 /* cannot be an aggregate */
3134 if (IS_AGGREGATE (LTYPE (tree)))
3136 werror (E_AGGR_ASSIGN);
3137 goto errorTreeReturn;
3140 /* they should either match or be castable */
3141 if (compareType (LTYPE (tree), RTYPE (tree)) == 0)
3143 werror (E_TYPE_MISMATCH, "assignment", " ");
3144 printFromToType(RTYPE(tree),LTYPE(tree));
3145 //goto errorTreeReturn;
3148 /* if the left side of the tree is of type void
3149 then report error */
3150 if (IS_VOID (LTYPE (tree)))
3152 werror (E_CAST_ZERO);
3153 printFromToType(RTYPE(tree), LTYPE(tree));
3156 TETYPE (tree) = getSpec (TTYPE (tree) =
3160 if (!tree->initMode ) {
3161 if ((IS_SPEC(LETYPE(tree)) && IS_CONSTANT (LETYPE (tree))))
3162 werror (E_CODE_WRITE, " ");
3166 werror (E_LVALUE_REQUIRED, "=");
3167 goto errorTreeReturn;
3172 /*------------------------------------------------------------------*/
3173 /*----------------------------*/
3174 /* comma operator */
3175 /*----------------------------*/
3177 TETYPE (tree) = getSpec (TTYPE (tree) = RTYPE (tree));
3180 /*------------------------------------------------------------------*/
3181 /*----------------------------*/
3183 /*----------------------------*/
3187 if (processParms (tree->left,
3188 FUNC_ARGS(tree->left->ftype),
3189 tree->right, &parmNumber, TRUE)) {
3190 goto errorTreeReturn;
3193 if ((options.stackAuto || IFFUNC_ISREENT (LTYPE (tree))) &&
3194 !IFFUNC_ISBUILTIN(LTYPE(tree)))
3196 //FUNC_ARGS(tree->left->ftype) =
3197 //reverseVal (FUNC_ARGS(tree->left->ftype));
3198 reverseParms (tree->right);
3201 TETYPE (tree) = getSpec (TTYPE (tree) = LTYPE (tree)->next);
3204 /*------------------------------------------------------------------*/
3205 /*----------------------------*/
3206 /* return statement */
3207 /*----------------------------*/
3212 if (compareType (currFunc->type->next, RTYPE (tree)) == 0)
3214 werror (W_RETURN_MISMATCH);
3215 printFromToType (RTYPE(tree), currFunc->type->next);
3216 goto errorTreeReturn;
3219 if (IS_VOID (currFunc->type->next)
3221 !IS_VOID (RTYPE (tree)))
3223 werror (E_FUNC_VOID);
3224 goto errorTreeReturn;
3227 /* if there is going to be a casing required then add it */
3228 if (compareType (currFunc->type->next, RTYPE (tree)) < 0)
3231 decorateType (newNode (CAST,
3232 newAst_LINK (copyLinkChain (currFunc->type->next)),
3241 if (!IS_VOID (currFunc->type->next) && tree->right == NULL)
3243 werror (E_VOID_FUNC, currFunc->name);
3244 goto errorTreeReturn;
3247 TTYPE (tree) = TETYPE (tree) = NULL;
3250 /*------------------------------------------------------------------*/
3251 /*----------------------------*/
3252 /* switch statement */
3253 /*----------------------------*/
3255 /* the switch value must be an integer */
3256 if (!IS_INTEGRAL (LTYPE (tree)))
3258 werror (E_SWITCH_NON_INTEGER);
3259 goto errorTreeReturn;
3262 TTYPE (tree) = TETYPE (tree) = NULL;
3265 /*------------------------------------------------------------------*/
3266 /*----------------------------*/
3268 /*----------------------------*/
3270 tree->left = backPatchLabels (tree->left,
3273 TTYPE (tree) = TETYPE (tree) = NULL;
3276 /*------------------------------------------------------------------*/
3277 /*----------------------------*/
3279 /*----------------------------*/
3282 decorateType (resolveSymbols (AST_FOR (tree, initExpr)));
3283 decorateType (resolveSymbols (AST_FOR (tree, condExpr)));
3284 decorateType (resolveSymbols (AST_FOR (tree, loopExpr)));
3286 /* if the for loop is reversible then
3287 reverse it otherwise do what we normally
3293 if (isLoopReversible (tree, &sym, &init, &end))
3294 return reverseLoop (tree, sym, init, end);
3296 return decorateType (createFor (AST_FOR (tree, trueLabel),
3297 AST_FOR (tree, continueLabel),
3298 AST_FOR (tree, falseLabel),
3299 AST_FOR (tree, condLabel),
3300 AST_FOR (tree, initExpr),
3301 AST_FOR (tree, condExpr),
3302 AST_FOR (tree, loopExpr),
3306 TTYPE (tree) = TETYPE (tree) = NULL;
3310 /* some error found this tree will be killed */
3312 TTYPE (tree) = TETYPE (tree) = newCharLink ();
3313 tree->opval.op = NULLOP;
3319 /*-----------------------------------------------------------------*/
3320 /* sizeofOp - processes size of operation */
3321 /*-----------------------------------------------------------------*/
3323 sizeofOp (sym_link * type)
3327 /* make sure the type is complete and sane */
3328 checkTypeSanity(type, "(sizeof)");
3330 /* get the size and convert it to character */
3331 sprintf (buff, "%d", getSize (type));
3333 /* now convert into value */
3334 return constVal (buff);
3338 #define IS_AND(ex) (ex->type == EX_OP && ex->opval.op == AND_OP )
3339 #define IS_OR(ex) (ex->type == EX_OP && ex->opval.op == OR_OP )
3340 #define IS_NOT(ex) (ex->type == EX_OP && ex->opval.op == '!' )
3341 #define IS_ANDORNOT(ex) (IS_AND(ex) || IS_OR(ex) || IS_NOT(ex))
3342 #define IS_IFX(ex) (ex->type == EX_OP && ex->opval.op == IFX )
3343 #define IS_LT(ex) (ex->type == EX_OP && ex->opval.op == '<' )
3344 #define IS_GT(ex) (ex->type == EX_OP && ex->opval.op == '>')
3346 /*-----------------------------------------------------------------*/
3347 /* backPatchLabels - change and or not operators to flow control */
3348 /*-----------------------------------------------------------------*/
3350 backPatchLabels (ast * tree, symbol * trueLabel, symbol * falseLabel)
3356 if (!(IS_ANDORNOT (tree)))
3359 /* if this an and */
3362 static int localLbl = 0;
3365 sprintf (buffer, "_and_%d", localLbl++);
3366 localLabel = newSymbol (buffer, NestLevel);
3368 tree->left = backPatchLabels (tree->left, localLabel, falseLabel);
3370 /* if left is already a IFX then just change the if true label in that */
3371 if (!IS_IFX (tree->left))
3372 tree->left = newIfxNode (tree->left, localLabel, falseLabel);
3374 tree->right = backPatchLabels (tree->right, trueLabel, falseLabel);
3375 /* right is a IFX then just join */
3376 if (IS_IFX (tree->right))
3377 return newNode (NULLOP, tree->left, createLabel (localLabel, tree->right));
3379 tree->right = createLabel (localLabel, tree->right);
3380 tree->right = newIfxNode (tree->right, trueLabel, falseLabel);
3382 return newNode (NULLOP, tree->left, tree->right);
3385 /* if this is an or operation */
3388 static int localLbl = 0;
3391 sprintf (buffer, "_or_%d", localLbl++);
3392 localLabel = newSymbol (buffer, NestLevel);
3394 tree->left = backPatchLabels (tree->left, trueLabel, localLabel);
3396 /* if left is already a IFX then just change the if true label in that */
3397 if (!IS_IFX (tree->left))
3398 tree->left = newIfxNode (tree->left, trueLabel, localLabel);
3400 tree->right = backPatchLabels (tree->right, trueLabel, falseLabel);
3401 /* right is a IFX then just join */
3402 if (IS_IFX (tree->right))
3403 return newNode (NULLOP, tree->left, createLabel (localLabel, tree->right));
3405 tree->right = createLabel (localLabel, tree->right);
3406 tree->right = newIfxNode (tree->right, trueLabel, falseLabel);
3408 return newNode (NULLOP, tree->left, tree->right);
3414 int wasnot = IS_NOT (tree->left);
3415 tree->left = backPatchLabels (tree->left, falseLabel, trueLabel);
3417 /* if the left is already a IFX */
3418 if (!IS_IFX (tree->left))
3419 tree->left = newNode (IFX, tree->left, NULL);
3423 tree->left->trueLabel = trueLabel;
3424 tree->left->falseLabel = falseLabel;
3428 tree->left->trueLabel = falseLabel;
3429 tree->left->falseLabel = trueLabel;
3436 tree->trueLabel = trueLabel;
3437 tree->falseLabel = falseLabel;
3444 /*-----------------------------------------------------------------*/
3445 /* createBlock - create expression tree for block */
3446 /*-----------------------------------------------------------------*/
3448 createBlock (symbol * decl, ast * body)
3452 /* if the block has nothing */
3456 ex = newNode (BLOCK, NULL, body);
3457 ex->values.sym = decl;
3459 ex->right = ex->right;
3465 /*-----------------------------------------------------------------*/
3466 /* createLabel - creates the expression tree for labels */
3467 /*-----------------------------------------------------------------*/
3469 createLabel (symbol * label, ast * stmnt)
3472 char name[SDCC_NAME_MAX + 1];
3475 /* must create fresh symbol if the symbol name */
3476 /* exists in the symbol table, since there can */
3477 /* be a variable with the same name as the labl */
3478 if ((csym = findSym (SymbolTab, NULL, label->name)) &&
3479 (csym->level == label->level))
3480 label = newSymbol (label->name, label->level);
3482 /* change the name before putting it in add _ */
3483 sprintf (name, "%s", label->name);
3485 /* put the label in the LabelSymbol table */
3486 /* but first check if a label of the same */
3488 if ((csym = findSym (LabelTab, NULL, name)))
3489 werror (E_DUPLICATE_LABEL, label->name);
3491 addSym (LabelTab, label, name, label->level, 0, 0);
3494 label->key = labelKey++;
3495 rValue = newNode (LABEL, newAst_VALUE (symbolVal (label)), stmnt);
3501 /*-----------------------------------------------------------------*/
3502 /* createCase - generates the parsetree for a case statement */
3503 /*-----------------------------------------------------------------*/
3505 createCase (ast * swStat, ast * caseVal, ast * stmnt)
3507 char caseLbl[SDCC_NAME_MAX + 1];
3511 /* if the switch statement does not exist */
3512 /* then case is out of context */
3515 werror (E_CASE_CONTEXT);
3519 caseVal = decorateType (resolveSymbols (caseVal));
3520 /* if not a constant then error */
3521 if (!IS_LITERAL (caseVal->ftype))
3523 werror (E_CASE_CONSTANT);
3527 /* if not a integer than error */
3528 if (!IS_INTEGRAL (caseVal->ftype))
3530 werror (E_CASE_NON_INTEGER);
3534 /* find the end of the switch values chain */
3535 if (!(val = swStat->values.switchVals.swVals))
3536 swStat->values.switchVals.swVals = caseVal->opval.val;
3539 /* also order the cases according to value */
3541 int cVal = (int) floatFromVal (caseVal->opval.val);
3542 while (val && (int) floatFromVal (val) < cVal)
3548 /* if we reached the end then */
3551 pval->next = caseVal->opval.val;
3555 /* we found a value greater than */
3556 /* the current value we must add this */
3557 /* before the value */
3558 caseVal->opval.val->next = val;
3560 /* if this was the first in chain */
3561 if (swStat->values.switchVals.swVals == val)
3562 swStat->values.switchVals.swVals =
3565 pval->next = caseVal->opval.val;
3570 /* create the case label */
3571 sprintf (caseLbl, "_case_%d_%d",
3572 swStat->values.switchVals.swNum,
3573 (int) floatFromVal (caseVal->opval.val));
3575 rexpr = createLabel (newSymbol (caseLbl, 0), stmnt);
3580 /*-----------------------------------------------------------------*/
3581 /* createDefault - creates the parse tree for the default statement */
3582 /*-----------------------------------------------------------------*/
3584 createDefault (ast * swStat, ast * stmnt)
3586 char defLbl[SDCC_NAME_MAX + 1];
3588 /* if the switch statement does not exist */
3589 /* then case is out of context */
3592 werror (E_CASE_CONTEXT);
3596 /* turn on the default flag */
3597 swStat->values.switchVals.swDefault = 1;
3599 /* create the label */
3600 sprintf (defLbl, "_default_%d", swStat->values.switchVals.swNum);
3601 return createLabel (newSymbol (defLbl, 0), stmnt);
3604 /*-----------------------------------------------------------------*/
3605 /* createIf - creates the parsetree for the if statement */
3606 /*-----------------------------------------------------------------*/
3608 createIf (ast * condAst, ast * ifBody, ast * elseBody)
3610 static int Lblnum = 0;
3612 symbol *ifTrue, *ifFalse, *ifEnd;
3614 /* if neither exists */
3615 if (!elseBody && !ifBody) {
3616 // if there are no side effects (i++, j() etc)
3617 if (!hasSEFcalls(condAst)) {
3622 /* create the labels */
3623 sprintf (buffer, "_iffalse_%d", Lblnum);
3624 ifFalse = newSymbol (buffer, NestLevel);
3625 /* if no else body then end == false */
3630 sprintf (buffer, "_ifend_%d", Lblnum);
3631 ifEnd = newSymbol (buffer, NestLevel);
3634 sprintf (buffer, "_iftrue_%d", Lblnum);
3635 ifTrue = newSymbol (buffer, NestLevel);
3639 /* attach the ifTrue label to the top of it body */
3640 ifBody = createLabel (ifTrue, ifBody);
3641 /* attach a goto end to the ifBody if else is present */
3644 ifBody = newNode (NULLOP, ifBody,
3646 newAst_VALUE (symbolVal (ifEnd)),
3648 /* put the elseLabel on the else body */
3649 elseBody = createLabel (ifFalse, elseBody);
3650 /* out the end at the end of the body */
3651 elseBody = newNode (NULLOP,
3653 createLabel (ifEnd, NULL));
3657 ifBody = newNode (NULLOP, ifBody,
3658 createLabel (ifFalse, NULL));
3660 condAst = backPatchLabels (condAst, ifTrue, ifFalse);
3661 if (IS_IFX (condAst))
3664 ifTree = newIfxNode (condAst, ifTrue, ifFalse);
3666 return newNode (NULLOP, ifTree,
3667 newNode (NULLOP, ifBody, elseBody));
3671 /*-----------------------------------------------------------------*/
3672 /* createDo - creates parse tree for do */
3675 /* _docontinue_n: */
3676 /* condition_expression +-> trueLabel -> _dobody_n */
3678 /* +-> falseLabel-> _dobreak_n */
3680 /*-----------------------------------------------------------------*/
3682 createDo (symbol * trueLabel, symbol * continueLabel,
3683 symbol * falseLabel, ast * condAst, ast * doBody)
3688 /* if the body does not exist then it is simple */
3691 condAst = backPatchLabels (condAst, continueLabel, NULL);
3692 doTree = (IS_IFX (condAst) ? createLabel (continueLabel, condAst)
3693 : newNode (IFX, createLabel (continueLabel, condAst), NULL));
3694 doTree->trueLabel = continueLabel;
3695 doTree->falseLabel = NULL;
3699 /* otherwise we have a body */
3700 condAst = backPatchLabels (condAst, trueLabel, falseLabel);
3702 /* attach the body label to the top */
3703 doBody = createLabel (trueLabel, doBody);
3704 /* attach the continue label to end of body */
3705 doBody = newNode (NULLOP, doBody,
3706 createLabel (continueLabel, NULL));
3708 /* now put the break label at the end */
3709 if (IS_IFX (condAst))
3712 doTree = newIfxNode (condAst, trueLabel, falseLabel);
3714 doTree = newNode (NULLOP, doTree, createLabel (falseLabel, NULL));
3716 /* putting it together */
3717 return newNode (NULLOP, doBody, doTree);
3720 /*-----------------------------------------------------------------*/
3721 /* createFor - creates parse tree for 'for' statement */
3724 /* condExpr +-> trueLabel -> _forbody_n */
3726 /* +-> falseLabel-> _forbreak_n */
3729 /* _forcontinue_n: */
3731 /* goto _forcond_n ; */
3733 /*-----------------------------------------------------------------*/
3735 createFor (symbol * trueLabel, symbol * continueLabel,
3736 symbol * falseLabel, symbol * condLabel,
3737 ast * initExpr, ast * condExpr, ast * loopExpr,
3742 /* if loopexpression not present then we can generate it */
3743 /* the same way as a while */
3745 return newNode (NULLOP, initExpr,
3746 createWhile (trueLabel, continueLabel,
3747 falseLabel, condExpr, forBody));
3748 /* vanilla for statement */
3749 condExpr = backPatchLabels (condExpr, trueLabel, falseLabel);
3751 if (condExpr && !IS_IFX (condExpr))
3752 condExpr = newIfxNode (condExpr, trueLabel, falseLabel);
3755 /* attach condition label to condition */
3756 condExpr = createLabel (condLabel, condExpr);
3758 /* attach body label to body */
3759 forBody = createLabel (trueLabel, forBody);
3761 /* attach continue to forLoop expression & attach */
3762 /* goto the forcond @ and of loopExpression */
3763 loopExpr = createLabel (continueLabel,
3767 newAst_VALUE (symbolVal (condLabel)),
3769 /* now start putting them together */
3770 forTree = newNode (NULLOP, initExpr, condExpr);
3771 forTree = newNode (NULLOP, forTree, forBody);
3772 forTree = newNode (NULLOP, forTree, loopExpr);
3773 /* finally add the break label */
3774 forTree = newNode (NULLOP, forTree,
3775 createLabel (falseLabel, NULL));
3779 /*-----------------------------------------------------------------*/
3780 /* createWhile - creates parse tree for while statement */
3781 /* the while statement will be created as follows */
3783 /* _while_continue_n: */
3784 /* condition_expression +-> trueLabel -> _while_boby_n */
3786 /* +-> falseLabel -> _while_break_n */
3787 /* _while_body_n: */
3789 /* goto _while_continue_n */
3790 /* _while_break_n: */
3791 /*-----------------------------------------------------------------*/
3793 createWhile (symbol * trueLabel, symbol * continueLabel,
3794 symbol * falseLabel, ast * condExpr, ast * whileBody)
3798 /* put the continue label */
3799 condExpr = backPatchLabels (condExpr, trueLabel, falseLabel);
3800 condExpr = createLabel (continueLabel, condExpr);
3801 condExpr->lineno = 0;
3803 /* put the body label in front of the body */
3804 whileBody = createLabel (trueLabel, whileBody);
3805 whileBody->lineno = 0;
3806 /* put a jump to continue at the end of the body */
3807 /* and put break label at the end of the body */
3808 whileBody = newNode (NULLOP,
3811 newAst_VALUE (symbolVal (continueLabel)),
3812 createLabel (falseLabel, NULL)));
3814 /* put it all together */
3815 if (IS_IFX (condExpr))
3816 whileTree = condExpr;
3819 whileTree = newNode (IFX, condExpr, NULL);
3820 /* put the true & false labels in place */
3821 whileTree->trueLabel = trueLabel;
3822 whileTree->falseLabel = falseLabel;
3825 return newNode (NULLOP, whileTree, whileBody);
3828 /*-----------------------------------------------------------------*/
3829 /* optimizeGetHbit - get highest order bit of the expression */
3830 /*-----------------------------------------------------------------*/
3832 optimizeGetHbit (ast * tree)
3835 /* if this is not a bit and */
3836 if (!IS_BITAND (tree))
3839 /* will look for tree of the form
3840 ( expr >> ((sizeof expr) -1) ) & 1 */
3841 if (!IS_AST_LIT_VALUE (tree->right))
3844 if (AST_LIT_VALUE (tree->right) != 1)
3847 if (!IS_RIGHT_OP (tree->left))
3850 if (!IS_AST_LIT_VALUE (tree->left->right))
3853 if ((i = (int) AST_LIT_VALUE (tree->left->right)) !=
3854 (j = (getSize (TTYPE (tree->left->left)) * 8 - 1)))
3857 return decorateType (newNode (GETHBIT, tree->left->left, NULL));
3861 /*-----------------------------------------------------------------*/
3862 /* optimizeRRCRLC :- optimize for Rotate Left/Right with carry */
3863 /*-----------------------------------------------------------------*/
3865 optimizeRRCRLC (ast * root)
3867 /* will look for trees of the form
3868 (?expr << 1) | (?expr >> 7) or
3869 (?expr >> 7) | (?expr << 1) will make that
3870 into a RLC : operation ..
3872 (?expr >> 1) | (?expr << 7) or
3873 (?expr << 7) | (?expr >> 1) will make that
3874 into a RRC operation
3875 note : by 7 I mean (number of bits required to hold the
3877 /* if the root operations is not a | operation the not */
3878 if (!IS_BITOR (root))
3881 /* I have to think of a better way to match patterns this sucks */
3882 /* that aside let start looking for the first case : I use a the
3883 negative check a lot to improve the efficiency */
3884 /* (?expr << 1) | (?expr >> 7) */
3885 if (IS_LEFT_OP (root->left) &&
3886 IS_RIGHT_OP (root->right))
3889 if (!SPEC_USIGN (TETYPE (root->left->left)))
3892 if (!IS_AST_LIT_VALUE (root->left->right) ||
3893 !IS_AST_LIT_VALUE (root->right->right))
3896 /* make sure it is the same expression */
3897 if (!isAstEqual (root->left->left,
3901 if (AST_LIT_VALUE (root->left->right) != 1)
3904 if (AST_LIT_VALUE (root->right->right) !=
3905 (getSize (TTYPE (root->left->left)) * 8 - 1))
3908 /* whew got the first case : create the AST */
3909 return newNode (RLC, root->left->left, NULL);
3913 /* check for second case */
3914 /* (?expr >> 7) | (?expr << 1) */
3915 if (IS_LEFT_OP (root->right) &&
3916 IS_RIGHT_OP (root->left))
3919 if (!SPEC_USIGN (TETYPE (root->left->left)))
3922 if (!IS_AST_LIT_VALUE (root->left->right) ||
3923 !IS_AST_LIT_VALUE (root->right->right))
3926 /* make sure it is the same symbol */
3927 if (!isAstEqual (root->left->left,
3931 if (AST_LIT_VALUE (root->right->right) != 1)
3934 if (AST_LIT_VALUE (root->left->right) !=
3935 (getSize (TTYPE (root->left->left)) * 8 - 1))
3938 /* whew got the first case : create the AST */
3939 return newNode (RLC, root->left->left, NULL);
3944 /* third case for RRC */
3945 /* (?symbol >> 1) | (?symbol << 7) */
3946 if (IS_LEFT_OP (root->right) &&
3947 IS_RIGHT_OP (root->left))
3950 if (!SPEC_USIGN (TETYPE (root->left->left)))
3953 if (!IS_AST_LIT_VALUE (root->left->right) ||
3954 !IS_AST_LIT_VALUE (root->right->right))
3957 /* make sure it is the same symbol */
3958 if (!isAstEqual (root->left->left,
3962 if (AST_LIT_VALUE (root->left->right) != 1)
3965 if (AST_LIT_VALUE (root->right->right) !=
3966 (getSize (TTYPE (root->left->left)) * 8 - 1))
3969 /* whew got the first case : create the AST */
3970 return newNode (RRC, root->left->left, NULL);
3974 /* fourth and last case for now */
3975 /* (?symbol << 7) | (?symbol >> 1) */
3976 if (IS_RIGHT_OP (root->right) &&
3977 IS_LEFT_OP (root->left))
3980 if (!SPEC_USIGN (TETYPE (root->left->left)))
3983 if (!IS_AST_LIT_VALUE (root->left->right) ||
3984 !IS_AST_LIT_VALUE (root->right->right))
3987 /* make sure it is the same symbol */
3988 if (!isAstEqual (root->left->left,
3992 if (AST_LIT_VALUE (root->right->right) != 1)
3995 if (AST_LIT_VALUE (root->left->right) !=
3996 (getSize (TTYPE (root->left->left)) * 8 - 1))
3999 /* whew got the first case : create the AST */
4000 return newNode (RRC, root->left->left, NULL);
4004 /* not found return root */
4008 /*-----------------------------------------------------------------*/
4009 /* optimizeCompare - otimizes compares for bit variables */
4010 /*-----------------------------------------------------------------*/
4012 optimizeCompare (ast * root)
4014 ast *optExpr = NULL;
4017 unsigned int litValue;
4019 /* if nothing then return nothing */
4023 /* if not a compare op then do leaves */
4024 if (!IS_COMPARE_OP (root))
4026 root->left = optimizeCompare (root->left);
4027 root->right = optimizeCompare (root->right);
4031 /* if left & right are the same then depending
4032 of the operation do */
4033 if (isAstEqual (root->left, root->right))
4035 switch (root->opval.op)
4040 optExpr = newAst_VALUE (constVal ("0"));
4045 optExpr = newAst_VALUE (constVal ("1"));
4049 return decorateType (optExpr);
4052 vleft = (root->left->type == EX_VALUE ?
4053 root->left->opval.val : NULL);
4055 vright = (root->right->type == EX_VALUE ?
4056 root->right->opval.val : NULL);
4058 /* if left is a BITVAR in BITSPACE */
4059 /* and right is a LITERAL then opt- */
4060 /* imize else do nothing */
4061 if (vleft && vright &&
4062 IS_BITVAR (vleft->etype) &&
4063 IN_BITSPACE (SPEC_OCLS (vleft->etype)) &&
4064 IS_LITERAL (vright->etype))
4067 /* if right side > 1 then comparison may never succeed */
4068 if ((litValue = (int) floatFromVal (vright)) > 1)
4070 werror (W_BAD_COMPARE);
4076 switch (root->opval.op)
4078 case '>': /* bit value greater than 1 cannot be */
4079 werror (W_BAD_COMPARE);
4083 case '<': /* bit value < 1 means 0 */
4085 optExpr = newNode ('!', newAst_VALUE (vleft), NULL);
4088 case LE_OP: /* bit value <= 1 means no check */
4089 optExpr = newAst_VALUE (vright);
4092 case GE_OP: /* bit value >= 1 means only check for = */
4094 optExpr = newAst_VALUE (vleft);
4099 { /* literal is zero */
4100 switch (root->opval.op)
4102 case '<': /* bit value < 0 cannot be */
4103 werror (W_BAD_COMPARE);
4107 case '>': /* bit value > 0 means 1 */
4109 optExpr = newAst_VALUE (vleft);
4112 case LE_OP: /* bit value <= 0 means no check */
4113 case GE_OP: /* bit value >= 0 means no check */
4114 werror (W_BAD_COMPARE);
4118 case EQ_OP: /* bit == 0 means ! of bit */
4119 optExpr = newNode ('!', newAst_VALUE (vleft), NULL);
4123 return decorateType (resolveSymbols (optExpr));
4124 } /* end-of-if of BITVAR */
4129 /*-----------------------------------------------------------------*/
4130 /* addSymToBlock : adds the symbol to the first block we find */
4131 /*-----------------------------------------------------------------*/
4133 addSymToBlock (symbol * sym, ast * tree)
4135 /* reached end of tree or a leaf */
4136 if (!tree || IS_AST_LINK (tree) || IS_AST_VALUE (tree))
4140 if (IS_AST_OP (tree) &&
4141 tree->opval.op == BLOCK)
4144 symbol *lsym = copySymbol (sym);
4146 lsym->next = AST_VALUES (tree, sym);
4147 AST_VALUES (tree, sym) = lsym;
4151 addSymToBlock (sym, tree->left);
4152 addSymToBlock (sym, tree->right);
4155 /*-----------------------------------------------------------------*/
4156 /* processRegParms - do processing for register parameters */
4157 /*-----------------------------------------------------------------*/
4159 processRegParms (value * args, ast * body)
4163 if (IS_REGPARM (args->etype))
4164 addSymToBlock (args->sym, body);
4169 /*-----------------------------------------------------------------*/
4170 /* resetParmKey - resets the operandkeys for the symbols */
4171 /*-----------------------------------------------------------------*/
4172 DEFSETFUNC (resetParmKey)
4183 /*-----------------------------------------------------------------*/
4184 /* createFunction - This is the key node that calls the iCode for */
4185 /* generating the code for a function. Note code */
4186 /* is generated function by function, later when */
4187 /* add inter-procedural analysis this will change */
4188 /*-----------------------------------------------------------------*/
4190 createFunction (symbol * name, ast * body)
4196 iCode *piCode = NULL;
4198 if (getenv("SDCC_DEBUG_FUNCTION_POINTERS"))
4199 fprintf (stderr, "SDCCast.c:createFunction(%s)\n", name->name);
4201 /* if check function return 0 then some problem */
4202 if (checkFunction (name, NULL) == 0)
4205 /* create a dummy block if none exists */
4207 body = newNode (BLOCK, NULL, NULL);
4211 /* check if the function name already in the symbol table */
4212 if ((csym = findSym (SymbolTab, NULL, name->name)))
4215 /* special case for compiler defined functions
4216 we need to add the name to the publics list : this
4217 actually means we are now compiling the compiler
4221 addSet (&publics, name);
4227 allocVariables (name);
4229 name->lastLine = yylineno;
4232 /* set the stack pointer */
4233 /* PENDING: check this for the mcs51 */
4234 stackPtr = -port->stack.direction * port->stack.call_overhead;
4235 if (IFFUNC_ISISR (name->type))
4236 stackPtr -= port->stack.direction * port->stack.isr_overhead;
4237 if (IFFUNC_ISREENT (name->type) || options.stackAuto)
4238 stackPtr -= port->stack.direction * port->stack.reent_overhead;
4240 xstackPtr = -port->stack.direction * port->stack.call_overhead;
4242 fetype = getSpec (name->type); /* get the specifier for the function */
4243 /* if this is a reentrant function then */
4244 if (IFFUNC_ISREENT (name->type))
4247 allocParms (FUNC_ARGS(name->type)); /* allocate the parameters */
4249 /* do processing for parameters that are passed in registers */
4250 processRegParms (FUNC_ARGS(name->type), body);
4252 /* set the stack pointer */
4256 /* allocate & autoinit the block variables */
4257 processBlockVars (body, &stack, ALLOCATE);
4259 /* save the stack information */
4260 if (options.useXstack)
4261 name->xstack = SPEC_STAK (fetype) = stack;
4263 name->stack = SPEC_STAK (fetype) = stack;
4265 /* name needs to be mangled */
4266 sprintf (name->rname, "%s%s", port->fun_prefix, name->name);
4268 body = resolveSymbols (body); /* resolve the symbols */
4269 body = decorateType (body); /* propagateType & do semantic checks */
4271 ex = newAst_VALUE (symbolVal (name)); /* create name */
4272 ex = newNode (FUNCTION, ex, body);
4273 ex->values.args = FUNC_ARGS(name->type);
4275 if (options.dump_tree) PA(ex);
4278 werror (E_FUNC_NO_CODE, name->name);
4282 /* create the node & generate intermediate code */
4284 codeOutFile = code->oFile;
4285 piCode = iCodeFromAst (ex);
4289 werror (E_FUNC_NO_CODE, name->name);
4293 eBBlockFromiCode (piCode);
4295 /* if there are any statics then do them */
4298 GcurMemmap = statsg;
4299 codeOutFile = statsg->oFile;
4300 eBBlockFromiCode (iCodeFromAst (decorateType (resolveSymbols (staticAutos))));
4306 /* dealloc the block variables */
4307 processBlockVars (body, &stack, DEALLOCATE);
4308 /* deallocate paramaters */
4309 deallocParms (FUNC_ARGS(name->type));
4311 if (IFFUNC_ISREENT (name->type))
4314 /* we are done freeup memory & cleanup */
4316 if (port->reset_labelKey) labelKey = 1;
4318 FUNC_HASBODY(name->type) = 1;
4319 addSet (&operKeyReset, name);
4320 applyToSet (operKeyReset, resetParmKey);
4323 cdbStructBlock (1, cdbFile);
4325 cleanUpLevel (LabelTab, 0);
4326 cleanUpBlock (StructTab, 1);
4327 cleanUpBlock (TypedefTab, 1);
4329 xstack->syms = NULL;
4330 istack->syms = NULL;
4335 #define INDENT(x,f) { int i ; for (i=0;i < x; i++) fprintf(f," "); }
4336 /*-----------------------------------------------------------------*/
4337 /* ast_print : prints the ast (for debugging purposes) */
4338 /*-----------------------------------------------------------------*/
4340 void ast_print (ast * tree, FILE *outfile, int indent)
4345 /* can print only decorated trees */
4346 if (!tree->decorated) return;
4348 /* if any child is an error | this one is an error do nothing */
4349 if (tree->isError ||
4350 (tree->left && tree->left->isError) ||
4351 (tree->right && tree->right->isError)) {
4352 fprintf(outfile,"ERROR_NODE(%p)\n",tree);
4356 /* print the line */
4357 /* if not block & function */
4358 if (tree->type == EX_OP &&
4359 (tree->opval.op != FUNCTION &&
4360 tree->opval.op != BLOCK &&
4361 tree->opval.op != NULLOP)) {
4364 if (tree->opval.op == FUNCTION) {
4366 value *args=FUNC_ARGS(tree->left->opval.val->type);
4367 fprintf(outfile,"FUNCTION (%s=%p) type (",
4368 tree->left->opval.val->name, tree);
4369 printTypeChain (tree->ftype,outfile);
4370 fprintf(outfile,") args (");
4373 fprintf (outfile, ", ");
4375 printTypeChain (args ? args->type : NULL, outfile);
4377 args= args ? args->next : NULL;
4379 fprintf(outfile,")\n");
4380 ast_print(tree->left,outfile,indent);
4381 ast_print(tree->right,outfile,indent);
4384 if (tree->opval.op == BLOCK) {
4385 symbol *decls = tree->values.sym;
4386 INDENT(indent,outfile);
4387 fprintf(outfile,"{\n");
4389 INDENT(indent+2,outfile);
4390 fprintf(outfile,"DECLARE SYMBOL (%s=%p) type (",
4391 decls->name, decls);
4392 printTypeChain(decls->type,outfile);
4393 fprintf(outfile,")\n");
4395 decls = decls->next;
4397 ast_print(tree->right,outfile,indent+2);
4398 INDENT(indent,outfile);
4399 fprintf(outfile,"}\n");
4402 if (tree->opval.op == NULLOP) {
4403 fprintf(outfile,"\n");
4404 ast_print(tree->left,outfile,indent);
4405 fprintf(outfile,"\n");
4406 ast_print(tree->right,outfile,indent);
4409 INDENT(indent,outfile);
4411 /*------------------------------------------------------------------*/
4412 /*----------------------------*/
4413 /* leaf has been reached */
4414 /*----------------------------*/
4415 /* if this is of type value */
4416 /* just get the type */
4417 if (tree->type == EX_VALUE) {
4419 if (IS_LITERAL (tree->opval.val->etype)) {
4420 fprintf(outfile,"CONSTANT (%p) value = %d, 0x%x, %g", tree,
4421 (int) floatFromVal(tree->opval.val),
4422 (int) floatFromVal(tree->opval.val),
4423 floatFromVal(tree->opval.val));
4424 } else if (tree->opval.val->sym) {
4425 /* if the undefined flag is set then give error message */
4426 if (tree->opval.val->sym->undefined) {
4427 fprintf(outfile,"UNDEFINED SYMBOL ");
4429 fprintf(outfile,"SYMBOL ");
4431 fprintf(outfile,"(%s=%p)",
4432 tree->opval.val->sym->name,tree);
4435 fprintf(outfile," type (");
4436 printTypeChain(tree->ftype,outfile);
4437 fprintf(outfile,")\n");
4439 fprintf(outfile,"\n");
4444 /* if type link for the case of cast */
4445 if (tree->type == EX_LINK) {
4446 fprintf(outfile,"TYPENODE (%p) type = (",tree);
4447 printTypeChain(tree->opval.lnk,outfile);
4448 fprintf(outfile,")\n");
4453 /* depending on type of operator do */
4455 switch (tree->opval.op) {
4456 /*------------------------------------------------------------------*/
4457 /*----------------------------*/
4459 /*----------------------------*/
4461 fprintf(outfile,"ARRAY_OP (%p) type (",tree);
4462 printTypeChain(tree->ftype,outfile);
4463 fprintf(outfile,")\n");
4464 ast_print(tree->left,outfile,indent+2);
4465 ast_print(tree->right,outfile,indent+2);
4468 /*------------------------------------------------------------------*/
4469 /*----------------------------*/
4471 /*----------------------------*/
4473 fprintf(outfile,"STRUCT_ACCESS (%p) type (",tree);
4474 printTypeChain(tree->ftype,outfile);
4475 fprintf(outfile,")\n");
4476 ast_print(tree->left,outfile,indent+2);
4477 ast_print(tree->right,outfile,indent+2);
4480 /*------------------------------------------------------------------*/
4481 /*----------------------------*/
4482 /* struct/union pointer */
4483 /*----------------------------*/
4485 fprintf(outfile,"PTR_ACCESS (%p) type (",tree);
4486 printTypeChain(tree->ftype,outfile);
4487 fprintf(outfile,")\n");
4488 ast_print(tree->left,outfile,indent+2);
4489 ast_print(tree->right,outfile,indent+2);
4492 /*------------------------------------------------------------------*/
4493 /*----------------------------*/
4494 /* ++/-- operation */
4495 /*----------------------------*/
4496 case INC_OP: /* incerement operator unary so left only */
4497 fprintf(outfile,"INC_OP (%p) type (",tree);
4498 printTypeChain(tree->ftype,outfile);
4499 fprintf(outfile,")\n");
4500 ast_print(tree->left,outfile,indent+2);
4504 fprintf(outfile,"DEC_OP (%p) type (",tree);
4505 printTypeChain(tree->ftype,outfile);
4506 fprintf(outfile,")\n");
4507 ast_print(tree->left,outfile,indent+2);
4510 /*------------------------------------------------------------------*/
4511 /*----------------------------*/
4513 /*----------------------------*/
4516 fprintf(outfile,"& (%p) type (",tree);
4517 printTypeChain(tree->ftype,outfile);
4518 fprintf(outfile,")\n");
4519 ast_print(tree->left,outfile,indent+2);
4520 ast_print(tree->right,outfile,indent+2);
4522 fprintf(outfile,"ADDRESS_OF (%p) type (",tree);
4523 printTypeChain(tree->ftype,outfile);
4524 fprintf(outfile,")\n");
4525 ast_print(tree->left,outfile,indent+2);
4526 ast_print(tree->right,outfile,indent+2);
4529 /*----------------------------*/
4531 /*----------------------------*/
4533 fprintf(outfile,"OR (%p) type (",tree);
4534 printTypeChain(tree->ftype,outfile);
4535 fprintf(outfile,")\n");
4536 ast_print(tree->left,outfile,indent+2);
4537 ast_print(tree->right,outfile,indent+2);
4539 /*------------------------------------------------------------------*/
4540 /*----------------------------*/
4542 /*----------------------------*/
4544 fprintf(outfile,"XOR (%p) type (",tree);
4545 printTypeChain(tree->ftype,outfile);
4546 fprintf(outfile,")\n");
4547 ast_print(tree->left,outfile,indent+2);
4548 ast_print(tree->right,outfile,indent+2);
4551 /*------------------------------------------------------------------*/
4552 /*----------------------------*/
4554 /*----------------------------*/
4556 fprintf(outfile,"DIV (%p) type (",tree);
4557 printTypeChain(tree->ftype,outfile);
4558 fprintf(outfile,")\n");
4559 ast_print(tree->left,outfile,indent+2);
4560 ast_print(tree->right,outfile,indent+2);
4562 /*------------------------------------------------------------------*/
4563 /*----------------------------*/
4565 /*----------------------------*/
4567 fprintf(outfile,"MOD (%p) type (",tree);
4568 printTypeChain(tree->ftype,outfile);
4569 fprintf(outfile,")\n");
4570 ast_print(tree->left,outfile,indent+2);
4571 ast_print(tree->right,outfile,indent+2);
4574 /*------------------------------------------------------------------*/
4575 /*----------------------------*/
4576 /* address dereference */
4577 /*----------------------------*/
4578 case '*': /* can be unary : if right is null then unary operation */
4580 fprintf(outfile,"DEREF (%p) type (",tree);
4581 printTypeChain(tree->ftype,outfile);
4582 fprintf(outfile,")\n");
4583 ast_print(tree->left,outfile,indent+2);
4586 /*------------------------------------------------------------------*/
4587 /*----------------------------*/
4588 /* multiplication */
4589 /*----------------------------*/
4590 fprintf(outfile,"MULT (%p) type (",tree);
4591 printTypeChain(tree->ftype,outfile);
4592 fprintf(outfile,")\n");
4593 ast_print(tree->left,outfile,indent+2);
4594 ast_print(tree->right,outfile,indent+2);
4598 /*------------------------------------------------------------------*/
4599 /*----------------------------*/
4600 /* unary '+' operator */
4601 /*----------------------------*/
4605 fprintf(outfile,"UPLUS (%p) type (",tree);
4606 printTypeChain(tree->ftype,outfile);
4607 fprintf(outfile,")\n");
4608 ast_print(tree->left,outfile,indent+2);
4610 /*------------------------------------------------------------------*/
4611 /*----------------------------*/
4613 /*----------------------------*/
4614 fprintf(outfile,"ADD (%p) type (",tree);
4615 printTypeChain(tree->ftype,outfile);
4616 fprintf(outfile,")\n");
4617 ast_print(tree->left,outfile,indent+2);
4618 ast_print(tree->right,outfile,indent+2);
4621 /*------------------------------------------------------------------*/
4622 /*----------------------------*/
4624 /*----------------------------*/
4625 case '-': /* can be unary */
4627 fprintf(outfile,"UMINUS (%p) type (",tree);
4628 printTypeChain(tree->ftype,outfile);
4629 fprintf(outfile,")\n");
4630 ast_print(tree->left,outfile,indent+2);
4632 /*------------------------------------------------------------------*/
4633 /*----------------------------*/
4635 /*----------------------------*/
4636 fprintf(outfile,"SUB (%p) type (",tree);
4637 printTypeChain(tree->ftype,outfile);
4638 fprintf(outfile,")\n");
4639 ast_print(tree->left,outfile,indent+2);
4640 ast_print(tree->right,outfile,indent+2);
4643 /*------------------------------------------------------------------*/
4644 /*----------------------------*/
4646 /*----------------------------*/
4648 fprintf(outfile,"COMPL (%p) type (",tree);
4649 printTypeChain(tree->ftype,outfile);
4650 fprintf(outfile,")\n");
4651 ast_print(tree->left,outfile,indent+2);
4653 /*------------------------------------------------------------------*/
4654 /*----------------------------*/
4656 /*----------------------------*/
4658 fprintf(outfile,"NOT (%p) type (",tree);
4659 printTypeChain(tree->ftype,outfile);
4660 fprintf(outfile,")\n");
4661 ast_print(tree->left,outfile,indent+2);
4663 /*------------------------------------------------------------------*/
4664 /*----------------------------*/
4666 /*----------------------------*/
4668 fprintf(outfile,"RRC (%p) type (",tree);
4669 printTypeChain(tree->ftype,outfile);
4670 fprintf(outfile,")\n");
4671 ast_print(tree->left,outfile,indent+2);
4675 fprintf(outfile,"RLC (%p) type (",tree);
4676 printTypeChain(tree->ftype,outfile);
4677 fprintf(outfile,")\n");
4678 ast_print(tree->left,outfile,indent+2);
4681 fprintf(outfile,"GETHBIT (%p) type (",tree);
4682 printTypeChain(tree->ftype,outfile);
4683 fprintf(outfile,")\n");
4684 ast_print(tree->left,outfile,indent+2);
4687 fprintf(outfile,"LEFT_SHIFT (%p) type (",tree);
4688 printTypeChain(tree->ftype,outfile);
4689 fprintf(outfile,")\n");
4690 ast_print(tree->left,outfile,indent+2);
4691 ast_print(tree->right,outfile,indent+2);
4694 fprintf(outfile,"RIGHT_SHIFT (%p) type (",tree);
4695 printTypeChain(tree->ftype,outfile);
4696 fprintf(outfile,")\n");
4697 ast_print(tree->left,outfile,indent+2);
4698 ast_print(tree->right,outfile,indent+2);
4700 /*------------------------------------------------------------------*/
4701 /*----------------------------*/
4703 /*----------------------------*/
4704 case CAST: /* change the type */
4705 fprintf(outfile,"CAST (%p) from type (",tree);
4706 printTypeChain(tree->right->ftype,outfile);
4707 fprintf(outfile,") to type (");
4708 printTypeChain(tree->ftype,outfile);
4709 fprintf(outfile,")\n");
4710 ast_print(tree->right,outfile,indent+2);
4714 fprintf(outfile,"ANDAND (%p) type (",tree);
4715 printTypeChain(tree->ftype,outfile);
4716 fprintf(outfile,")\n");
4717 ast_print(tree->left,outfile,indent+2);
4718 ast_print(tree->right,outfile,indent+2);
4721 fprintf(outfile,"OROR (%p) type (",tree);
4722 printTypeChain(tree->ftype,outfile);
4723 fprintf(outfile,")\n");
4724 ast_print(tree->left,outfile,indent+2);
4725 ast_print(tree->right,outfile,indent+2);
4728 /*------------------------------------------------------------------*/
4729 /*----------------------------*/
4730 /* comparison operators */
4731 /*----------------------------*/
4733 fprintf(outfile,"GT(>) (%p) type (",tree);
4734 printTypeChain(tree->ftype,outfile);
4735 fprintf(outfile,")\n");
4736 ast_print(tree->left,outfile,indent+2);
4737 ast_print(tree->right,outfile,indent+2);
4740 fprintf(outfile,"LT(<) (%p) type (",tree);
4741 printTypeChain(tree->ftype,outfile);
4742 fprintf(outfile,")\n");
4743 ast_print(tree->left,outfile,indent+2);
4744 ast_print(tree->right,outfile,indent+2);
4747 fprintf(outfile,"LE(<=) (%p) type (",tree);
4748 printTypeChain(tree->ftype,outfile);
4749 fprintf(outfile,")\n");
4750 ast_print(tree->left,outfile,indent+2);
4751 ast_print(tree->right,outfile,indent+2);
4754 fprintf(outfile,"GE(>=) (%p) type (",tree);
4755 printTypeChain(tree->ftype,outfile);
4756 fprintf(outfile,")\n");
4757 ast_print(tree->left,outfile,indent+2);
4758 ast_print(tree->right,outfile,indent+2);
4761 fprintf(outfile,"EQ(==) (%p) type (",tree);
4762 printTypeChain(tree->ftype,outfile);
4763 fprintf(outfile,")\n");
4764 ast_print(tree->left,outfile,indent+2);
4765 ast_print(tree->right,outfile,indent+2);
4768 fprintf(outfile,"NE(!=) (%p) type (",tree);
4769 printTypeChain(tree->ftype,outfile);
4770 fprintf(outfile,")\n");
4771 ast_print(tree->left,outfile,indent+2);
4772 ast_print(tree->right,outfile,indent+2);
4773 /*------------------------------------------------------------------*/
4774 /*----------------------------*/
4776 /*----------------------------*/
4777 case SIZEOF: /* evaluate wihout code generation */
4778 fprintf(outfile,"SIZEOF %d\n",(getSize (tree->right->ftype)));
4781 /*------------------------------------------------------------------*/
4782 /*----------------------------*/
4783 /* conditional operator '?' */
4784 /*----------------------------*/
4786 fprintf(outfile,"QUEST(?) (%p) type (",tree);
4787 printTypeChain(tree->ftype,outfile);
4788 fprintf(outfile,")\n");
4789 ast_print(tree->left,outfile,indent+2);
4790 ast_print(tree->right,outfile,indent+2);
4794 fprintf(outfile,"COLON(:) (%p) type (",tree);
4795 printTypeChain(tree->ftype,outfile);
4796 fprintf(outfile,")\n");
4797 ast_print(tree->left,outfile,indent+2);
4798 ast_print(tree->right,outfile,indent+2);
4801 /*------------------------------------------------------------------*/
4802 /*----------------------------*/
4803 /* assignment operators */
4804 /*----------------------------*/
4806 fprintf(outfile,"MULASS(*=) (%p) type (",tree);
4807 printTypeChain(tree->ftype,outfile);
4808 fprintf(outfile,")\n");
4809 ast_print(tree->left,outfile,indent+2);
4810 ast_print(tree->right,outfile,indent+2);
4813 fprintf(outfile,"DIVASS(/=) (%p) type (",tree);
4814 printTypeChain(tree->ftype,outfile);
4815 fprintf(outfile,")\n");
4816 ast_print(tree->left,outfile,indent+2);
4817 ast_print(tree->right,outfile,indent+2);
4820 fprintf(outfile,"ANDASS(&=) (%p) type (",tree);
4821 printTypeChain(tree->ftype,outfile);
4822 fprintf(outfile,")\n");
4823 ast_print(tree->left,outfile,indent+2);
4824 ast_print(tree->right,outfile,indent+2);
4827 fprintf(outfile,"ORASS(*=) (%p) type (",tree);
4828 printTypeChain(tree->ftype,outfile);
4829 fprintf(outfile,")\n");
4830 ast_print(tree->left,outfile,indent+2);
4831 ast_print(tree->right,outfile,indent+2);
4834 fprintf(outfile,"XORASS(*=) (%p) type (",tree);
4835 printTypeChain(tree->ftype,outfile);
4836 fprintf(outfile,")\n");
4837 ast_print(tree->left,outfile,indent+2);
4838 ast_print(tree->right,outfile,indent+2);
4841 fprintf(outfile,"RSHFTASS(>>=) (%p) type (",tree);
4842 printTypeChain(tree->ftype,outfile);
4843 fprintf(outfile,")\n");
4844 ast_print(tree->left,outfile,indent+2);
4845 ast_print(tree->right,outfile,indent+2);
4848 fprintf(outfile,"LSHFTASS(*=) (%p) type (",tree);
4849 printTypeChain(tree->ftype,outfile);
4850 fprintf(outfile,")\n");
4851 ast_print(tree->left,outfile,indent+2);
4852 ast_print(tree->right,outfile,indent+2);
4854 /*------------------------------------------------------------------*/
4855 /*----------------------------*/
4857 /*----------------------------*/
4859 fprintf(outfile,"SUBASS(-=) (%p) type (",tree);
4860 printTypeChain(tree->ftype,outfile);
4861 fprintf(outfile,")\n");
4862 ast_print(tree->left,outfile,indent+2);
4863 ast_print(tree->right,outfile,indent+2);
4865 /*------------------------------------------------------------------*/
4866 /*----------------------------*/
4868 /*----------------------------*/
4870 fprintf(outfile,"ADDASS(+=) (%p) type (",tree);
4871 printTypeChain(tree->ftype,outfile);
4872 fprintf(outfile,")\n");
4873 ast_print(tree->left,outfile,indent+2);
4874 ast_print(tree->right,outfile,indent+2);
4876 /*------------------------------------------------------------------*/
4877 /*----------------------------*/
4878 /* straight assignemnt */
4879 /*----------------------------*/
4881 fprintf(outfile,"ASSIGN(=) (%p) type (",tree);
4882 printTypeChain(tree->ftype,outfile);
4883 fprintf(outfile,")\n");
4884 ast_print(tree->left,outfile,indent+2);
4885 ast_print(tree->right,outfile,indent+2);
4887 /*------------------------------------------------------------------*/
4888 /*----------------------------*/
4889 /* comma operator */
4890 /*----------------------------*/
4892 fprintf(outfile,"COMMA(,) (%p) type (",tree);
4893 printTypeChain(tree->ftype,outfile);
4894 fprintf(outfile,")\n");
4895 ast_print(tree->left,outfile,indent+2);
4896 ast_print(tree->right,outfile,indent+2);
4898 /*------------------------------------------------------------------*/
4899 /*----------------------------*/
4901 /*----------------------------*/
4904 fprintf(outfile,"CALL (%p) type (",tree);
4905 printTypeChain(tree->ftype,outfile);
4906 fprintf(outfile,")\n");
4907 ast_print(tree->left,outfile,indent+2);
4908 ast_print(tree->right,outfile,indent+2);
4911 fprintf(outfile,"PARMS\n");
4912 ast_print(tree->left,outfile,indent+2);
4913 if (tree->right /*&& !IS_AST_PARAM(tree->right)*/) {
4914 ast_print(tree->right,outfile,indent+2);
4917 /*------------------------------------------------------------------*/
4918 /*----------------------------*/
4919 /* return statement */
4920 /*----------------------------*/
4922 fprintf(outfile,"RETURN (%p) type (",tree);
4924 printTypeChain(tree->right->ftype,outfile);
4926 fprintf(outfile,")\n");
4927 ast_print(tree->right,outfile,indent+2);
4929 /*------------------------------------------------------------------*/
4930 /*----------------------------*/
4931 /* label statement */
4932 /*----------------------------*/
4934 fprintf(outfile,"LABEL (%p)\n",tree);
4935 ast_print(tree->left,outfile,indent+2);
4936 ast_print(tree->right,outfile,indent);
4938 /*------------------------------------------------------------------*/
4939 /*----------------------------*/
4940 /* switch statement */
4941 /*----------------------------*/
4945 fprintf(outfile,"SWITCH (%p) ",tree);
4946 ast_print(tree->left,outfile,0);
4947 for (val = tree->values.switchVals.swVals; val ; val = val->next) {
4948 INDENT(indent+2,outfile);
4949 fprintf(outfile,"CASE 0x%x GOTO _case_%d_%d\n",
4950 (int) floatFromVal(val),
4951 tree->values.switchVals.swNum,
4952 (int) floatFromVal(val));
4954 ast_print(tree->right,outfile,indent);
4957 /*------------------------------------------------------------------*/
4958 /*----------------------------*/
4960 /*----------------------------*/
4962 fprintf(outfile,"IF (%p) \n",tree);
4963 ast_print(tree->left,outfile,indent+2);
4964 if (tree->trueLabel) {
4965 INDENT(indent,outfile);
4966 fprintf(outfile,"NE(!=) 0 goto %s\n",tree->trueLabel->name);
4968 if (tree->falseLabel) {
4969 INDENT(indent,outfile);
4970 fprintf(outfile,"EQ(==) 0 goto %s\n",tree->falseLabel->name);
4972 ast_print(tree->right,outfile,indent+2);
4974 /*------------------------------------------------------------------*/
4975 /*----------------------------*/
4977 /*----------------------------*/
4979 fprintf(outfile,"FOR (%p) \n",tree);
4980 if (AST_FOR( tree, initExpr)) {
4981 INDENT(indent+2,outfile);
4982 fprintf(outfile,"INIT EXPR ");
4983 ast_print(AST_FOR(tree, initExpr),outfile,indent+2);
4985 if (AST_FOR( tree, condExpr)) {
4986 INDENT(indent+2,outfile);
4987 fprintf(outfile,"COND EXPR ");
4988 ast_print(AST_FOR(tree, condExpr),outfile,indent+2);
4990 if (AST_FOR( tree, loopExpr)) {
4991 INDENT(indent+2,outfile);
4992 fprintf(outfile,"LOOP EXPR ");
4993 ast_print(AST_FOR(tree, loopExpr),outfile,indent+2);
4995 fprintf(outfile,"FOR LOOP BODY \n");
4996 ast_print(tree->left,outfile,indent+2);
5005 ast_print(t,stdout,0);