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
50 symbol *currFunc=NULL;
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 *optimizeSWAP (ast *);
56 ast *optimizeGetHbit (ast *);
57 ast *backPatchLabels (ast *, symbol *, symbol *);
60 memmap *GcurMemmap=NULL; /* points to the memmap that's currently active */
65 printTypeChain (tree->ftype, stdout);
70 /*-----------------------------------------------------------------*/
71 /* newAst - creates a fresh node for an expression tree */
72 /*-----------------------------------------------------------------*/
74 newAst_ (unsigned type)
77 static int oldLineno = 0;
79 ex = Safe_alloc ( sizeof (ast));
82 ex->lineno = (noLineno ? oldLineno : mylineno);
83 ex->filename = currFname;
84 ex->level = NestLevel;
85 ex->block = currBlockno;
86 ex->initMode = inInitMode;
87 ex->seqPoint = seqPointNo;
92 newAst_VALUE (value * val)
94 ast *ex = newAst_ (EX_VALUE);
100 newAst_OP (unsigned op)
102 ast *ex = newAst_ (EX_OP);
108 newAst_LINK (sym_link * val)
110 ast *ex = newAst_ (EX_LINK);
115 /*-----------------------------------------------------------------*/
116 /* newNode - creates a new node */
117 /*-----------------------------------------------------------------*/
119 newNode (long op, ast * left, ast * right)
130 /*-----------------------------------------------------------------*/
131 /* newIfxNode - creates a new Ifx Node */
132 /*-----------------------------------------------------------------*/
134 newIfxNode (ast * condAst, symbol * trueLabel, symbol * falseLabel)
138 /* if this is a literal then we already know the result */
139 if (condAst->etype && IS_LITERAL (condAst->etype))
141 /* then depending on the expression value */
142 if (floatFromVal (condAst->opval.val))
143 ifxNode = newNode (GOTO,
144 newAst_VALUE (symbolVal (trueLabel)),
147 ifxNode = newNode (GOTO,
148 newAst_VALUE (symbolVal (falseLabel)),
153 ifxNode = newNode (IFX, condAst, NULL);
154 ifxNode->trueLabel = trueLabel;
155 ifxNode->falseLabel = falseLabel;
161 /*-----------------------------------------------------------------*/
162 /* copyAstValues - copies value portion of ast if needed */
163 /*-----------------------------------------------------------------*/
165 copyAstValues (ast * dest, ast * src)
167 switch (src->opval.op)
170 dest->values.sym = copySymbolChain (src->values.sym);
174 dest->values.switchVals.swVals =
175 copyValue (src->values.switchVals.swVals);
176 dest->values.switchVals.swDefault =
177 src->values.switchVals.swDefault;
178 dest->values.switchVals.swNum =
179 src->values.switchVals.swNum;
183 dest->values.inlineasm = Safe_strdup(src->values.inlineasm);
187 dest->values.constlist = copyLiteralList(src->values.constlist);
191 AST_FOR (dest, trueLabel) = copySymbol (AST_FOR (src, trueLabel));
192 AST_FOR (dest, continueLabel) = copySymbol (AST_FOR (src, continueLabel));
193 AST_FOR (dest, falseLabel) = copySymbol (AST_FOR (src, falseLabel));
194 AST_FOR (dest, condLabel) = copySymbol (AST_FOR (src, condLabel));
195 AST_FOR (dest, initExpr) = copyAst (AST_FOR (src, initExpr));
196 AST_FOR (dest, condExpr) = copyAst (AST_FOR (src, condExpr));
197 AST_FOR (dest, loopExpr) = copyAst (AST_FOR (src, loopExpr));
202 /*-----------------------------------------------------------------*/
203 /* copyAst - makes a copy of a given astession */
204 /*-----------------------------------------------------------------*/
213 dest = Safe_alloc ( sizeof (ast));
215 dest->type = src->type;
216 dest->lineno = src->lineno;
217 dest->level = src->level;
218 dest->funcName = src->funcName;
221 dest->etype = getSpec (dest->ftype = copyLinkChain (src->ftype));
223 /* if this is a leaf */
225 if (src->type == EX_VALUE)
227 dest->opval.val = copyValue (src->opval.val);
232 if (src->type == EX_LINK)
234 dest->opval.lnk = copyLinkChain (src->opval.lnk);
238 dest->opval.op = src->opval.op;
240 /* if this is a node that has special values */
241 copyAstValues (dest, src);
243 dest->trueLabel = copySymbol (src->trueLabel);
244 dest->falseLabel = copySymbol (src->falseLabel);
245 dest->left = copyAst (src->left);
246 dest->right = copyAst (src->right);
252 /*-----------------------------------------------------------------*/
253 /* removeIncDecOps: remove for side effects in *_ASSIGN's */
254 /* "*s++ += 3" -> "*s++ = *s++ + 3" */
255 /*-----------------------------------------------------------------*/
256 ast *removeIncDecOps (ast * tree) {
258 // traverse the tree and remove inc/dec ops
263 if (tree->type == EX_OP &&
264 (tree->opval.op == INC_OP || tree->opval.op == DEC_OP)) {
271 tree->left=removeIncDecOps(tree->left);
272 tree->right=removeIncDecOps(tree->right);
277 /*-----------------------------------------------------------------*/
278 /* removePreIncDecOps: remove for side effects in *_ASSIGN's */
279 /* "*++s += 3" -> "*++s = *++s + 3" */
280 /*-----------------------------------------------------------------*/
281 ast *removePreIncDecOps (ast * tree) {
283 // traverse the tree and remove pre-inc/dec ops
288 if (tree->type == EX_OP &&
289 (tree->opval.op == INC_OP || tree->opval.op == DEC_OP)) {
294 tree->left=removePreIncDecOps(tree->left);
295 tree->right=removePreIncDecOps(tree->right);
300 /*-----------------------------------------------------------------*/
301 /* removePostIncDecOps: remove for side effects in *_ASSIGN's */
302 /* "*s++ += 3" -> "*s++ = *s++ + 3" */
303 /*-----------------------------------------------------------------*/
304 ast *removePostIncDecOps (ast * tree) {
306 // traverse the tree and remove pre-inc/dec ops
311 if (tree->type == EX_OP &&
312 (tree->opval.op == INC_OP || tree->opval.op == DEC_OP)) {
317 tree->left=removePostIncDecOps(tree->left);
318 tree->right=removePostIncDecOps(tree->right);
323 /*-----------------------------------------------------------------*/
324 /* hasSEFcalls - returns TRUE if tree has a function call */
325 /*-----------------------------------------------------------------*/
327 hasSEFcalls (ast * tree)
332 if (tree->type == EX_OP &&
333 (tree->opval.op == CALL ||
334 tree->opval.op == PCALL ||
335 tree->opval.op == '=' ||
336 tree->opval.op == INC_OP ||
337 tree->opval.op == DEC_OP))
340 return (hasSEFcalls (tree->left) |
341 hasSEFcalls (tree->right));
344 /*-----------------------------------------------------------------*/
345 /* isAstEqual - compares two asts & returns 1 if they are equal */
346 /*-----------------------------------------------------------------*/
348 isAstEqual (ast * t1, ast * t2)
357 if (t1->type != t2->type)
363 if (t1->opval.op != t2->opval.op)
365 return (isAstEqual (t1->left, t2->left) &&
366 isAstEqual (t1->right, t2->right));
370 if (t1->opval.val->sym)
372 if (!t2->opval.val->sym)
375 return isSymbolEqual (t1->opval.val->sym,
380 if (t2->opval.val->sym)
383 return (floatFromVal (t1->opval.val) ==
384 floatFromVal (t2->opval.val));
388 /* only compare these two types */
396 /*-----------------------------------------------------------------*/
397 /* resolveSymbols - resolve symbols from the symbol table */
398 /*-----------------------------------------------------------------*/
400 resolveSymbols (ast * tree)
402 /* walk the entire tree and check for values */
403 /* with symbols if we find one then replace */
404 /* symbol with that from the symbol table */
411 /* if not block & function */
412 if (tree->type == EX_OP &&
413 (tree->opval.op != FUNCTION &&
414 tree->opval.op != BLOCK &&
415 tree->opval.op != NULLOP))
417 filename = tree->filename;
418 lineno = tree->lineno;
422 /* make sure we resolve the true & false labels for ifx */
423 if (tree->type == EX_OP && tree->opval.op == IFX)
429 if ((csym = findSym (LabelTab, tree->trueLabel,
430 tree->trueLabel->name)))
431 tree->trueLabel = csym;
433 werrorfl (tree->filename, tree->lineno, E_LABEL_UNDEF,
434 tree->trueLabel->name);
437 if (tree->falseLabel)
439 if ((csym = findSym (LabelTab,
441 tree->falseLabel->name)))
442 tree->falseLabel = csym;
444 werrorfl (tree->filename, tree->lineno, E_LABEL_UNDEF,
445 tree->falseLabel->name);
450 /* if this is a label resolve it from the labelTab */
451 if (IS_AST_VALUE (tree) &&
452 tree->opval.val->sym &&
453 tree->opval.val->sym->islbl)
456 symbol *csym = findSym (LabelTab, tree->opval.val->sym,
457 tree->opval.val->sym->name);
460 werrorfl (tree->filename, tree->lineno, E_LABEL_UNDEF,
461 tree->opval.val->sym->name);
463 tree->opval.val->sym = csym;
465 goto resolveChildren;
468 /* do only for leafs */
469 if (IS_AST_VALUE (tree) &&
470 tree->opval.val->sym &&
471 !tree->opval.val->sym->implicit)
474 symbol *csym = findSymWithLevel (SymbolTab, tree->opval.val->sym);
476 /* if found in the symbol table & they r not the same */
477 if (csym && tree->opval.val->sym != csym)
479 tree->opval.val->sym = csym;
480 tree->opval.val->type = csym->type;
481 tree->opval.val->etype = csym->etype;
484 /* if not found in the symbol table */
485 /* mark it as undefined assume it is */
486 /* an integer in data space */
487 if (!csym && !tree->opval.val->sym->implicit)
490 /* if this is a function name then */
491 /* mark it as returning an int */
494 tree->opval.val->sym->type = newLink (DECLARATOR);
495 DCL_TYPE (tree->opval.val->sym->type) = FUNCTION;
496 tree->opval.val->sym->type->next =
497 tree->opval.val->sym->etype = newIntLink ();
498 tree->opval.val->etype = tree->opval.val->etype;
499 tree->opval.val->type = tree->opval.val->sym->type;
500 werrorfl (tree->filename, tree->lineno, W_IMPLICIT_FUNC,
501 tree->opval.val->sym->name);
502 //tree->opval.val->sym->undefined = 1;
503 allocVariables (tree->opval.val->sym);
507 tree->opval.val->sym->undefined = 1;
508 tree->opval.val->type =
509 tree->opval.val->etype = newIntLink ();
510 tree->opval.val->sym->type =
511 tree->opval.val->sym->etype = newIntLink ();
517 resolveSymbols (tree->left);
518 resolveSymbols (tree->right);
523 /*-----------------------------------------------------------------*/
524 /* setAstLineno - walks a ast tree & sets the line number */
525 /*-----------------------------------------------------------------*/
526 int setAstLineno (ast * tree, int lineno)
531 tree->lineno = lineno;
532 setAstLineno (tree->left, lineno);
533 setAstLineno (tree->right, lineno);
537 /*-----------------------------------------------------------------*/
538 /* funcOfType :- function of type with name */
539 /*-----------------------------------------------------------------*/
541 funcOfType (char *name, sym_link * type, sym_link * argType,
545 /* create the symbol */
546 sym = newSymbol (name, 0);
548 /* setup return value */
549 sym->type = newLink (DECLARATOR);
550 DCL_TYPE (sym->type) = FUNCTION;
551 sym->type->next = copyLinkChain (type);
552 sym->etype = getSpec (sym->type);
553 FUNC_ISREENT(sym->type) = rent ? 1 : 0;
555 /* if arguments required */
559 args = FUNC_ARGS(sym->type) = newValue ();
563 args->type = copyLinkChain (argType);
564 args->etype = getSpec (args->type);
565 SPEC_EXTR(args->etype)=1;
568 args = args->next = newValue ();
575 allocVariables (sym);
580 /*-----------------------------------------------------------------*/
581 /* funcOfTypeVarg :- function of type with name and argtype */
582 /*-----------------------------------------------------------------*/
584 funcOfTypeVarg (char *name, char * rtype, int nArgs , char **atypes)
589 /* create the symbol */
590 sym = newSymbol (name, 0);
592 /* setup return value */
593 sym->type = newLink (DECLARATOR);
594 DCL_TYPE (sym->type) = FUNCTION;
595 sym->type->next = typeFromStr(rtype);
596 sym->etype = getSpec (sym->type);
598 /* if arguments required */
601 args = FUNC_ARGS(sym->type) = newValue ();
603 for ( i = 0 ; i < nArgs ; i++ ) {
604 args->type = typeFromStr(atypes[i]);
605 args->etype = getSpec (args->type);
606 SPEC_EXTR(args->etype)=1;
607 if ((i + 1) == nArgs) break;
608 args = args->next = newValue ();
615 allocVariables (sym);
620 /*-----------------------------------------------------------------*/
621 /* reverseParms - will reverse a parameter tree */
622 /*-----------------------------------------------------------------*/
624 reverseParms (ast * ptree)
630 /* top down if we find a nonParm tree then quit */
631 if (ptree->type == EX_OP && ptree->opval.op == PARAM)
634 ptree->left = ptree->right;
635 ptree->right = ttree;
636 reverseParms (ptree->left);
637 reverseParms (ptree->right);
643 /*-----------------------------------------------------------------*/
644 /* processParms - makes sure the parameters are okay and do some */
645 /* processing with them */
646 /*-----------------------------------------------------------------*/
648 processParms (ast * func,
651 int *parmNumber, // unused, although updated
654 /* if none of them exist */
655 if (!defParm && !actParm)
659 if (getenv("DEBUG_SANITY")) {
660 fprintf (stderr, "processParms: %s ", defParm->name);
662 /* make sure the type is complete and sane */
663 checkTypeSanity(defParm->etype, defParm->name);
666 /* if the function is being called via a pointer & */
667 /* it has not been defined a reentrant then we cannot */
668 /* have parameters */
669 if (func->type != EX_VALUE && !IFFUNC_ISREENT (func->ftype) && !options.stackAuto)
671 werror (W_NONRENT_ARGS);
675 /* if defined parameters ended but actual parameters */
676 /* exist and this is not defined as a variable arg */
677 if (!defParm && actParm && !IFFUNC_HASVARARGS(func->ftype))
679 //if (func->type==EX_VALUE && func->opval.val->sym->undefined)
680 // return 1; /* Already gave them an undefined function error */
681 werror (E_TOO_MANY_PARMS);
685 /* if defined parameters present but no actual parameters */
686 if (defParm && !actParm)
688 werror (E_TOO_FEW_PARMS);
692 if (IS_VOID(actParm->ftype)) {
693 werror (E_VOID_VALUE_USED);
697 /* If this is a varargs function... */
698 if (!defParm && actParm && IFFUNC_HASVARARGS(func->ftype))
703 if (IS_CAST_OP (actParm)
704 || (IS_AST_LIT_VALUE (actParm) && actParm->values.literalFromCast))
706 /* Parameter was explicitly typecast; don't touch it. */
710 ftype = actParm->ftype;
712 /* If it's a small integer, upcast to int. */
713 if (IS_INTEGRAL (ftype)
714 && (getSize (ftype) < (unsigned) INTSIZE))
716 if (IS_AST_OP(actParm) &&
717 (actParm->opval.op == LEFT_OP ||
718 actParm->opval.op == '*' ||
719 actParm->opval.op == '+' ||
720 actParm->opval.op == '-') &&
722 // we should cast an operand instead of the result
723 actParm->decorated = 0;
724 actParm->left = newNode( CAST, newAst_LINK(newIntLink()),
726 actParm = decorateType(actParm);
728 newType = newAst_LINK(INTTYPE);
732 if (IS_PTR(ftype) && !IS_GENPTR(ftype))
734 newType = newAst_LINK (copyLinkChain(ftype));
735 DCL_TYPE (newType->opval.lnk) = port->unqualified_pointer;
738 if (IS_AGGREGATE (ftype))
740 newType = newAst_LINK (copyLinkChain (ftype));
741 DCL_TYPE (newType->opval.lnk) = port->unqualified_pointer;
745 /* cast required; change this op to a cast. */
746 ast *parmCopy = decorateType(resolveSymbols (copyAst (actParm)));
748 actParm->type = EX_OP;
749 actParm->opval.op = CAST;
750 actParm->left = newType;
751 actParm->right = parmCopy;
752 decorateType (actParm);
754 else if (actParm->type == EX_OP && actParm->opval.op == PARAM)
756 return (processParms (func, NULL, actParm->left, parmNumber, FALSE) ||
757 processParms (func, NULL, actParm->right, parmNumber, rightmost));
762 /* if defined parameters ended but actual has not & */
764 if (!defParm && actParm &&
765 (options.stackAuto || IFFUNC_ISREENT (func->ftype)))
768 resolveSymbols (actParm);
769 /* if this is a PARAM node then match left & right */
770 if (actParm->type == EX_OP && actParm->opval.op == PARAM)
772 return (processParms (func, defParm, actParm->left, parmNumber, FALSE) ||
773 processParms (func, defParm->next, actParm->right, parmNumber, rightmost));
777 /* If we have found a value node by following only right-hand links,
778 * then we know that there are no more values after us.
780 * Therefore, if there are more defined parameters, the caller didn't
783 if (rightmost && defParm->next)
785 werror (E_TOO_FEW_PARMS);
790 /* the parameter type must be at least castable */
791 if (compareType (defParm->type, actParm->ftype) == 0) {
792 werror (E_INCOMPAT_TYPES);
793 printFromToType (actParm->ftype, defParm->type);
797 /* if the parameter is castable then add the cast */
798 if (compareType (defParm->type, actParm->ftype) < 0)
800 ast *pTree = decorateType(resolveSymbols (copyAst (actParm)));
802 /* now change the current one to a cast */
803 actParm->type = EX_OP;
804 actParm->opval.op = CAST;
805 actParm->left = newAst_LINK (defParm->type);
806 actParm->right = pTree;
807 actParm->etype = defParm->etype;
808 actParm->ftype = defParm->type;
809 actParm->decorated=0; /* force typechecking */
810 decorateType (actParm);
813 /* make a copy and change the regparm type to the defined parm */
814 actParm->etype = getSpec (actParm->ftype = copyLinkChain (actParm->ftype));
815 SPEC_REGPARM (actParm->etype) = SPEC_REGPARM (defParm->etype);
816 SPEC_ARGREG (actParm->etype) = SPEC_ARGREG (defParm->etype);
820 /*-----------------------------------------------------------------*/
821 /* createIvalType - generates ival for basic types */
822 /*-----------------------------------------------------------------*/
824 createIvalType (ast * sym, sym_link * type, initList * ilist)
828 /* if initList is deep */
829 if (ilist->type == INIT_DEEP)
830 ilist = ilist->init.deep;
832 iExpr = decorateType (resolveSymbols (list2expr (ilist)));
833 return decorateType (newNode ('=', sym, iExpr));
836 /*-----------------------------------------------------------------*/
837 /* createIvalStruct - generates initial value for structures */
838 /*-----------------------------------------------------------------*/
840 createIvalStruct (ast * sym, sym_link * type, initList * ilist)
847 sflds = SPEC_STRUCT (type)->fields;
848 if (ilist->type != INIT_DEEP)
850 werror (E_INIT_STRUCT, "");
854 iloop = ilist->init.deep;
856 for (; sflds; sflds = sflds->next, iloop = (iloop ? iloop->next : NULL))
858 /* if we have come to end */
862 lAst = newNode (PTR_OP, newNode ('&', sym, NULL), newAst_VALUE (symbolVal (sflds)));
863 lAst = decorateType (resolveSymbols (lAst));
864 rast = decorateType (resolveSymbols (createIval (lAst, sflds->type, iloop, rast)));
868 werrorfl (filename, sym->opval.val->sym->lineDef,
869 W_EXCESS_INITIALIZERS, "struct",
870 sym->opval.val->sym->name);
877 /*-----------------------------------------------------------------*/
878 /* createIvalArray - generates code for array initialization */
879 /*-----------------------------------------------------------------*/
881 createIvalArray (ast * sym, sym_link * type, initList * ilist)
885 int lcnt = 0, size = 0;
886 literalList *literalL;
888 /* take care of the special case */
889 /* array of characters can be init */
891 if (IS_CHAR (type->next))
892 if ((rast = createIvalCharPtr (sym,
894 decorateType (resolveSymbols (list2expr (ilist))))))
896 return decorateType (resolveSymbols (rast));
898 /* not the special case */
899 if (ilist->type != INIT_DEEP)
901 werror (E_INIT_STRUCT, "");
905 iloop = ilist->init.deep;
906 lcnt = DCL_ELEM (type);
908 if (port->arrayInitializerSuppported && convertIListToConstList(ilist, &literalL))
912 aSym = decorateType (resolveSymbols(sym));
914 rast = newNode(ARRAYINIT, aSym, NULL);
915 rast->values.constlist = literalL;
917 // Make sure size is set to length of initializer list.
924 if (lcnt && size > lcnt)
926 // Array size was specified, and we have more initializers than needed.
927 char *name=sym->opval.val->sym->name;
928 int lineno=sym->opval.val->sym->lineDef;
930 werrorfl (filename, lineno, W_EXCESS_INITIALIZERS, "array", name);
939 aSym = newNode ('[', sym, newAst_VALUE (valueFromLit ((float) (size++))));
940 aSym = decorateType (resolveSymbols (aSym));
941 rast = createIval (aSym, type->next, iloop, rast);
942 iloop = (iloop ? iloop->next : NULL);
948 /* no of elements given and we */
949 /* have generated for all of them */
952 // there has to be a better way
953 char *name=sym->opval.val->sym->name;
954 int lineno=sym->opval.val->sym->lineDef;
955 werrorfl (filename, lineno, W_EXCESS_INITIALIZERS, "array", name);
962 /* if we have not been given a size */
963 if (!DCL_ELEM (type))
965 DCL_ELEM (type) = size;
968 return decorateType (resolveSymbols (rast));
972 /*-----------------------------------------------------------------*/
973 /* createIvalCharPtr - generates initial values for char pointers */
974 /*-----------------------------------------------------------------*/
976 createIvalCharPtr (ast * sym, sym_link * type, ast * iexpr)
980 /* if this is a pointer & right is a literal array then */
981 /* just assignment will do */
982 if (IS_PTR (type) && ((IS_LITERAL (iexpr->etype) ||
983 SPEC_SCLS (iexpr->etype) == S_CODE)
984 && IS_ARRAY (iexpr->ftype)))
985 return newNode ('=', sym, iexpr);
987 /* left side is an array so we have to assign each */
989 if ((IS_LITERAL (iexpr->etype) ||
990 SPEC_SCLS (iexpr->etype) == S_CODE)
991 && IS_ARRAY (iexpr->ftype))
993 /* for each character generate an assignment */
994 /* to the array element */
995 char *s = SPEC_CVAL (iexpr->etype).v_char;
997 int size = getSize (iexpr->ftype);
998 int symsize = getSize (type);
1002 if (size>(symsize+1))
1003 werrorfl (iexpr->filename, iexpr->lineno, W_EXCESS_INITIALIZERS,
1004 "string", sym->opval.val->sym->name);
1008 for (i=0;i<size;i++)
1010 rast = newNode (NULLOP,
1014 newAst_VALUE (valueFromLit ((float) i))),
1015 newAst_VALUE (valueFromLit (*s))));
1019 // now WE don't need iexpr's symbol anymore
1020 freeStringSymbol(AST_SYMBOL(iexpr));
1022 return decorateType (resolveSymbols (rast));
1028 /*-----------------------------------------------------------------*/
1029 /* createIvalPtr - generates initial value for pointers */
1030 /*-----------------------------------------------------------------*/
1032 createIvalPtr (ast * sym, sym_link * type, initList * ilist)
1038 if (ilist->type == INIT_DEEP)
1039 ilist = ilist->init.deep;
1041 iexpr = decorateType (resolveSymbols (list2expr (ilist)));
1043 /* if character pointer */
1044 if (IS_CHAR (type->next))
1045 if ((rast = createIvalCharPtr (sym, type, iexpr)))
1048 return newNode ('=', sym, iexpr);
1051 /*-----------------------------------------------------------------*/
1052 /* createIval - generates code for initial value */
1053 /*-----------------------------------------------------------------*/
1055 createIval (ast * sym, sym_link * type, initList * ilist, ast * wid)
1062 /* if structure then */
1063 if (IS_STRUCT (type))
1064 rast = createIvalStruct (sym, type, ilist);
1066 /* if this is a pointer */
1068 rast = createIvalPtr (sym, type, ilist);
1070 /* if this is an array */
1071 if (IS_ARRAY (type))
1072 rast = createIvalArray (sym, type, ilist);
1074 /* if type is SPECIFIER */
1076 rast = createIvalType (sym, type, ilist);
1079 return decorateType (resolveSymbols (newNode (NULLOP, wid, rast)));
1081 return decorateType (resolveSymbols (rast));
1084 /*-----------------------------------------------------------------*/
1085 /* initAggregates - initialises aggregate variables with initv */
1086 /*-----------------------------------------------------------------*/
1087 ast * initAggregates (symbol * sym, initList * ival, ast * wid) {
1088 return createIval (newAst_VALUE (symbolVal (sym)), sym->type, ival, wid);
1091 /*-----------------------------------------------------------------*/
1092 /* gatherAutoInit - creates assignment expressions for initial */
1094 /*-----------------------------------------------------------------*/
1096 gatherAutoInit (symbol * autoChain)
1103 for (sym = autoChain; sym; sym = sym->next)
1106 /* resolve the symbols in the ival */
1108 resolveIvalSym (sym->ival);
1110 /* if this is a static variable & has an */
1111 /* initial value the code needs to be lifted */
1112 /* here to the main portion since they can be */
1113 /* initialised only once at the start */
1114 if (IS_STATIC (sym->etype) && sym->ival &&
1115 SPEC_SCLS (sym->etype) != S_CODE)
1119 /* insert the symbol into the symbol table */
1120 /* with level = 0 & name = rname */
1121 newSym = copySymbol (sym);
1122 addSym (SymbolTab, newSym, newSym->rname, 0, 0, 1);
1124 /* now lift the code to main */
1125 if (IS_AGGREGATE (sym->type)) {
1126 work = initAggregates (sym, sym->ival, NULL);
1128 if (getNelements(sym->type, sym->ival)>1) {
1129 werrorfl (filename, sym->lineDef,
1130 W_EXCESS_INITIALIZERS, "scalar",
1133 work = newNode ('=', newAst_VALUE (symbolVal (newSym)),
1134 list2expr (sym->ival));
1137 setAstLineno (work, sym->lineDef);
1141 staticAutos = newNode (NULLOP, staticAutos, work);
1148 /* if there is an initial value */
1149 if (sym->ival && SPEC_SCLS (sym->etype) != S_CODE)
1151 initList *ilist=sym->ival;
1153 while (ilist->type == INIT_DEEP) {
1154 ilist = ilist->init.deep;
1157 /* update lineno for error msg */
1158 lineno=sym->lineDef;
1159 setAstLineno (ilist->init.node, lineno);
1161 if (IS_AGGREGATE (sym->type)) {
1162 work = initAggregates (sym, sym->ival, NULL);
1164 if (getNelements(sym->type, sym->ival)>1) {
1165 werrorfl (filename, sym->lineDef,
1166 W_EXCESS_INITIALIZERS, "scalar",
1169 work = newNode ('=', newAst_VALUE (symbolVal (sym)),
1170 list2expr (sym->ival));
1174 setAstLineno (work, sym->lineDef);
1178 init = newNode (NULLOP, init, work);
1187 /*-----------------------------------------------------------------*/
1188 /* freeStringSymbol - delete a literal string if no more usage */
1189 /*-----------------------------------------------------------------*/
1190 void freeStringSymbol(symbol *sym) {
1191 /* make sure this is a literal string */
1192 assert (sym->isstrlit);
1193 if (--sym->isstrlit == 0) { // lower the usage count
1194 memmap *segment=SPEC_OCLS(sym->etype);
1196 deleteSetItem(&segment->syms, sym);
1201 /*-----------------------------------------------------------------*/
1202 /* stringToSymbol - creates a symbol from a literal string */
1203 /*-----------------------------------------------------------------*/
1205 stringToSymbol (value * val)
1207 char name[SDCC_NAME_MAX + 1];
1208 static int charLbl = 0;
1213 // have we heard this before?
1214 for (sp=statsg->syms; sp; sp=sp->next) {
1216 size = getSize (sym->type);
1217 if (sym->isstrlit && size == getSize (val->type) &&
1218 !memcmp(SPEC_CVAL(sym->etype).v_char, SPEC_CVAL(val->etype).v_char, size)) {
1219 // yes, this is old news. Don't publish it again.
1220 sym->isstrlit++; // but raise the usage count
1221 return symbolVal(sym);
1225 SNPRINTF (name, sizeof(name), "_str_%d", charLbl++);
1226 sym = newSymbol (name, 0); /* make it @ level 0 */
1227 strncpyz (sym->rname, name, SDCC_NAME_MAX);
1229 /* copy the type from the value passed */
1230 sym->type = copyLinkChain (val->type);
1231 sym->etype = getSpec (sym->type);
1232 /* change to storage class & output class */
1233 SPEC_SCLS (sym->etype) = S_CODE;
1234 SPEC_CVAL (sym->etype).v_char = SPEC_CVAL (val->etype).v_char;
1235 SPEC_STAT (sym->etype) = 1;
1236 /* make the level & block = 0 */
1237 sym->block = sym->level = 0;
1239 /* create an ival */
1240 sym->ival = newiList (INIT_NODE, newAst_VALUE (val));
1245 allocVariables (sym);
1248 return symbolVal (sym);
1252 /*-----------------------------------------------------------------*/
1253 /* processBlockVars - will go thru the ast looking for block if */
1254 /* a block is found then will allocate the syms */
1255 /* will also gather the auto inits present */
1256 /*-----------------------------------------------------------------*/
1258 processBlockVars (ast * tree, int *stack, int action)
1263 /* if this is a block */
1264 if (tree->type == EX_OP && tree->opval.op == BLOCK)
1268 if (action == ALLOCATE)
1270 *stack += allocVariables (tree->values.sym);
1271 autoInit = gatherAutoInit (tree->values.sym);
1273 /* if there are auto inits then do them */
1275 tree->left = newNode (NULLOP, autoInit, tree->left);
1277 else /* action is deallocate */
1278 deallocLocal (tree->values.sym);
1281 processBlockVars (tree->left, stack, action);
1282 processBlockVars (tree->right, stack, action);
1287 /*-------------------------------------------------------------*/
1288 /* constExprTree - returns TRUE if this tree is a constant */
1290 /*-------------------------------------------------------------*/
1291 bool constExprTree (ast *cexpr) {
1297 cexpr = decorateType (resolveSymbols (cexpr));
1299 switch (cexpr->type)
1302 if (IS_AST_LIT_VALUE(cexpr)) {
1303 // this is a literal
1306 if (IS_AST_SYM_VALUE(cexpr) && IS_FUNC(AST_SYMBOL(cexpr)->type)) {
1307 // a function's address will never change
1310 if (IS_AST_SYM_VALUE(cexpr) && IS_ARRAY(AST_SYMBOL(cexpr)->type)) {
1311 // an array's address will never change
1314 if (IS_AST_SYM_VALUE(cexpr) &&
1315 IN_CODESPACE(SPEC_OCLS(AST_SYMBOL(cexpr)->etype))) {
1316 // a symbol in code space will never change
1317 // This is only for the 'char *s="hallo"' case and will have to leave
1318 //printf(" code space symbol");
1323 werror (E_INTERNAL_ERROR, __FILE__, __LINE__,
1324 "unexpected link in expression tree\n");
1327 if (cexpr->opval.op==ARRAYINIT) {
1328 // this is a list of literals
1331 if (cexpr->opval.op=='=') {
1332 return constExprTree(cexpr->right);
1334 if (cexpr->opval.op==CAST) {
1335 // cast ignored, maybe we should throw a warning here?
1336 return constExprTree(cexpr->right);
1338 if (cexpr->opval.op=='&') {
1341 if (cexpr->opval.op==CALL || cexpr->opval.op==PCALL) {
1344 if (constExprTree(cexpr->left) && constExprTree(cexpr->right)) {
1349 return IS_CONSTANT(operandType(cexpr->opval.oprnd));
1354 /*-----------------------------------------------------------------*/
1355 /* constExprValue - returns the value of a constant expression */
1356 /* or NULL if it is not a constant expression */
1357 /*-----------------------------------------------------------------*/
1359 constExprValue (ast * cexpr, int check)
1361 cexpr = decorateType (resolveSymbols (cexpr));
1363 /* if this is not a constant then */
1364 if (!IS_LITERAL (cexpr->ftype))
1366 /* then check if this is a literal array
1368 if (SPEC_SCLS (cexpr->etype) == S_CODE &&
1369 SPEC_CVAL (cexpr->etype).v_char &&
1370 IS_ARRAY (cexpr->ftype))
1372 value *val = valFromType (cexpr->ftype);
1373 SPEC_SCLS (val->etype) = S_LITERAL;
1374 val->sym = cexpr->opval.val->sym;
1375 val->sym->type = copyLinkChain (cexpr->ftype);
1376 val->sym->etype = getSpec (val->sym->type);
1377 strncpyz (val->name, cexpr->opval.val->sym->rname, SDCC_NAME_MAX);
1381 /* if we are casting a literal value then */
1382 if (IS_AST_OP (cexpr) &&
1383 cexpr->opval.op == CAST &&
1384 IS_LITERAL (cexpr->right->ftype))
1386 return valCastLiteral (cexpr->ftype,
1387 floatFromVal (cexpr->right->opval.val));
1390 if (IS_AST_VALUE (cexpr))
1392 return cexpr->opval.val;
1396 werror (E_CONST_EXPECTED, "found expression");
1401 /* return the value */
1402 return cexpr->opval.val;
1406 /*-----------------------------------------------------------------*/
1407 /* isLabelInAst - will return true if a given label is found */
1408 /*-----------------------------------------------------------------*/
1410 isLabelInAst (symbol * label, ast * tree)
1412 if (!tree || IS_AST_VALUE (tree) || IS_AST_LINK (tree))
1415 if (IS_AST_OP (tree) &&
1416 tree->opval.op == LABEL &&
1417 isSymbolEqual (AST_SYMBOL (tree->left), label))
1420 return isLabelInAst (label, tree->right) &&
1421 isLabelInAst (label, tree->left);
1425 /*-----------------------------------------------------------------*/
1426 /* isLoopCountable - return true if the loop count can be determi- */
1427 /* -ned at compile time . */
1428 /*-----------------------------------------------------------------*/
1430 isLoopCountable (ast * initExpr, ast * condExpr, ast * loopExpr,
1431 symbol ** sym, ast ** init, ast ** end)
1434 /* the loop is considered countable if the following
1435 conditions are true :-
1437 a) initExpr :- <sym> = <const>
1438 b) condExpr :- <sym> < <const1>
1439 c) loopExpr :- <sym> ++
1442 /* first check the initExpr */
1443 if (IS_AST_OP (initExpr) &&
1444 initExpr->opval.op == '=' && /* is assignment */
1445 IS_AST_SYM_VALUE (initExpr->left))
1446 { /* left is a symbol */
1448 *sym = AST_SYMBOL (initExpr->left);
1449 *init = initExpr->right;
1454 /* for now the symbol has to be of
1456 if (!IS_INTEGRAL ((*sym)->type))
1459 /* now check condExpr */
1460 if (IS_AST_OP (condExpr))
1463 switch (condExpr->opval.op)
1466 if (IS_AST_SYM_VALUE (condExpr->left) &&
1467 isSymbolEqual (*sym, AST_SYMBOL (condExpr->left)) &&
1468 IS_AST_LIT_VALUE (condExpr->right))
1470 *end = condExpr->right;
1476 if (IS_AST_OP (condExpr->left) &&
1477 condExpr->left->opval.op == '>' &&
1478 IS_AST_LIT_VALUE (condExpr->left->right) &&
1479 IS_AST_SYM_VALUE (condExpr->left->left) &&
1480 isSymbolEqual (*sym, AST_SYMBOL (condExpr->left->left)))
1483 *end = newNode ('+', condExpr->left->right,
1484 newAst_VALUE (constVal ("1")));
1495 /* check loop expression is of the form <sym>++ */
1496 if (!IS_AST_OP (loopExpr))
1499 /* check if <sym> ++ */
1500 if (loopExpr->opval.op == INC_OP)
1506 if (IS_AST_SYM_VALUE (loopExpr->left) &&
1507 isSymbolEqual (*sym, AST_SYMBOL (loopExpr->left)))
1514 if (IS_AST_SYM_VALUE (loopExpr->right) &&
1515 isSymbolEqual (*sym, AST_SYMBOL (loopExpr->right)))
1523 if (loopExpr->opval.op == ADD_ASSIGN)
1526 if (IS_AST_SYM_VALUE (loopExpr->left) &&
1527 isSymbolEqual (*sym, AST_SYMBOL (loopExpr->left)) &&
1528 IS_AST_LIT_VALUE (loopExpr->right) &&
1529 (int) AST_LIT_VALUE (loopExpr->right) != 1)
1537 /*-----------------------------------------------------------------*/
1538 /* astHasVolatile - returns true if ast contains any volatile */
1539 /*-----------------------------------------------------------------*/
1541 astHasVolatile (ast * tree)
1546 if (TETYPE (tree) && IS_VOLATILE (TETYPE (tree)))
1549 if (IS_AST_OP (tree))
1550 return astHasVolatile (tree->left) ||
1551 astHasVolatile (tree->right);
1556 /*-----------------------------------------------------------------*/
1557 /* astHasPointer - return true if the ast contains any ptr variable */
1558 /*-----------------------------------------------------------------*/
1560 astHasPointer (ast * tree)
1565 if (IS_AST_LINK (tree))
1568 /* if we hit an array expression then check
1569 only the left side */
1570 if (IS_AST_OP (tree) && tree->opval.op == '[')
1571 return astHasPointer (tree->left);
1573 if (IS_AST_VALUE (tree))
1574 return IS_PTR (tree->ftype) || IS_ARRAY (tree->ftype);
1576 return astHasPointer (tree->left) ||
1577 astHasPointer (tree->right);
1581 /*-----------------------------------------------------------------*/
1582 /* astHasSymbol - return true if the ast has the given symbol */
1583 /*-----------------------------------------------------------------*/
1585 astHasSymbol (ast * tree, symbol * sym)
1587 if (!tree || IS_AST_LINK (tree))
1590 if (IS_AST_VALUE (tree))
1592 if (IS_AST_SYM_VALUE (tree))
1593 return isSymbolEqual (AST_SYMBOL (tree), sym);
1598 return astHasSymbol (tree->left, sym) ||
1599 astHasSymbol (tree->right, sym);
1602 /*-----------------------------------------------------------------*/
1603 /* astHasDeref - return true if the ast has an indirect access */
1604 /*-----------------------------------------------------------------*/
1606 astHasDeref (ast * tree)
1608 if (!tree || IS_AST_LINK (tree) || IS_AST_VALUE(tree))
1611 if (tree->opval.op == '*' && tree->right == NULL) return TRUE;
1613 return astHasDeref (tree->left) || astHasDeref (tree->right);
1616 /*-----------------------------------------------------------------*/
1617 /* isConformingBody - the loop body has to conform to a set of rules */
1618 /* for the loop to be considered reversible read on for rules */
1619 /*-----------------------------------------------------------------*/
1621 isConformingBody (ast * pbody, symbol * sym, ast * body)
1624 /* we are going to do a pre-order traversal of the
1625 tree && check for the following conditions. (essentially
1626 a set of very shallow tests )
1627 a) the sym passed does not participate in
1628 any arithmetic operation
1629 b) There are no function calls
1630 c) all jumps are within the body
1631 d) address of loop control variable not taken
1632 e) if an assignment has a pointer on the
1633 left hand side make sure right does not have
1634 loop control variable */
1636 /* if we reach the end or a leaf then true */
1637 if (!pbody || IS_AST_LINK (pbody) || IS_AST_VALUE (pbody))
1640 /* if anything else is "volatile" */
1641 if (IS_VOLATILE (TETYPE (pbody)))
1644 /* we will walk the body in a pre-order traversal for
1646 switch (pbody->opval.op)
1648 /*------------------------------------------------------------------*/
1650 // if the loopvar is used as an index
1651 if (astHasSymbol(pbody->right, sym)) {
1654 return isConformingBody (pbody->right, sym, body);
1656 /*------------------------------------------------------------------*/
1661 /*------------------------------------------------------------------*/
1665 /* sure we are not sym is not modified */
1667 IS_AST_SYM_VALUE (pbody->left) &&
1668 isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1672 IS_AST_SYM_VALUE (pbody->right) &&
1673 isSymbolEqual (AST_SYMBOL (pbody->right), sym))
1678 /*------------------------------------------------------------------*/
1680 case '*': /* can be unary : if right is null then unary operation */
1685 /* if right is NULL then unary operation */
1686 /*------------------------------------------------------------------*/
1687 /*----------------------------*/
1689 /*----------------------------*/
1692 if (IS_AST_SYM_VALUE (pbody->left) &&
1693 isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1696 return isConformingBody (pbody->left, sym, body);
1700 if (astHasSymbol (pbody->left, sym) ||
1701 astHasSymbol (pbody->right, sym))
1706 /*------------------------------------------------------------------*/
1714 if (IS_AST_SYM_VALUE (pbody->left) &&
1715 isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1718 if (IS_AST_SYM_VALUE (pbody->right) &&
1719 isSymbolEqual (AST_SYMBOL (pbody->right), sym))
1722 return isConformingBody (pbody->left, sym, body) &&
1723 isConformingBody (pbody->right, sym, body);
1731 if (IS_AST_SYM_VALUE (pbody->left) &&
1732 isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1734 return isConformingBody (pbody->left, sym, body);
1736 /*------------------------------------------------------------------*/
1748 case SIZEOF: /* evaluate wihout code generation */
1750 if (IS_AST_SYM_VALUE (pbody->left) &&
1751 isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1754 if (IS_AST_SYM_VALUE (pbody->right) &&
1755 isSymbolEqual (AST_SYMBOL (pbody->right), sym))
1758 return isConformingBody (pbody->left, sym, body) &&
1759 isConformingBody (pbody->right, sym, body);
1761 /*------------------------------------------------------------------*/
1764 /* if left has a pointer & right has loop
1765 control variable then we cannot */
1766 if (astHasPointer (pbody->left) &&
1767 astHasSymbol (pbody->right, sym))
1769 if (astHasVolatile (pbody->left))
1772 if (IS_AST_SYM_VALUE (pbody->left)) {
1773 // if the loopvar has an assignment
1774 if (isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1776 // if the loopvar is used in another (maybe conditional) block
1777 if (astHasSymbol (pbody->right, sym) &&
1778 (pbody->level >= body->level)) {
1783 if (astHasVolatile (pbody->left))
1786 if (astHasDeref(pbody->right)) return FALSE;
1788 return isConformingBody (pbody->left, sym, body) &&
1789 isConformingBody (pbody->right, sym, body);
1800 assert ("Parser should not have generated this\n");
1802 /*------------------------------------------------------------------*/
1803 /*----------------------------*/
1804 /* comma operator */
1805 /*----------------------------*/
1807 return isConformingBody (pbody->left, sym, body) &&
1808 isConformingBody (pbody->right, sym, body);
1810 /*------------------------------------------------------------------*/
1811 /*----------------------------*/
1813 /*----------------------------*/
1815 /* if local & not passed as paramater then ok */
1816 if (sym->level && !astHasSymbol(pbody->right,sym))
1820 /*------------------------------------------------------------------*/
1821 /*----------------------------*/
1822 /* return statement */
1823 /*----------------------------*/
1828 if (isLabelInAst (AST_SYMBOL (pbody->left), body))
1833 if (astHasSymbol (pbody->left, sym))
1840 return isConformingBody (pbody->left, sym, body) &&
1841 isConformingBody (pbody->right, sym, body);
1847 /*-----------------------------------------------------------------*/
1848 /* isLoopReversible - takes a for loop as input && returns true */
1849 /* if the for loop is reversible. If yes will set the value of */
1850 /* the loop control var & init value & termination value */
1851 /*-----------------------------------------------------------------*/
1853 isLoopReversible (ast * loop, symbol ** loopCntrl,
1854 ast ** init, ast ** end)
1856 /* if option says don't do it then don't */
1857 if (optimize.noLoopReverse)
1859 /* there are several tests to determine this */
1861 /* for loop has to be of the form
1862 for ( <sym> = <const1> ;
1863 [<sym> < <const2>] ;
1864 [<sym>++] | [<sym> += 1] | [<sym> = <sym> + 1] )
1866 if (!isLoopCountable (AST_FOR (loop, initExpr),
1867 AST_FOR (loop, condExpr),
1868 AST_FOR (loop, loopExpr),
1869 loopCntrl, init, end))
1872 /* now do some serious checking on the body of the loop
1875 return isConformingBody (loop->left, *loopCntrl, loop->left);
1879 /*-----------------------------------------------------------------*/
1880 /* replLoopSym - replace the loop sym by loop sym -1 */
1881 /*-----------------------------------------------------------------*/
1883 replLoopSym (ast * body, symbol * sym)
1886 if (!body || IS_AST_LINK (body))
1889 if (IS_AST_SYM_VALUE (body))
1892 if (isSymbolEqual (AST_SYMBOL (body), sym))
1896 body->opval.op = '-';
1897 body->left = newAst_VALUE (symbolVal (sym));
1898 body->right = newAst_VALUE (constVal ("1"));
1906 replLoopSym (body->left, sym);
1907 replLoopSym (body->right, sym);
1911 /*-----------------------------------------------------------------*/
1912 /* reverseLoop - do the actual loop reversal */
1913 /*-----------------------------------------------------------------*/
1915 reverseLoop (ast * loop, symbol * sym, ast * init, ast * end)
1919 /* create the following tree
1924 if (sym) goto for_continue ;
1927 /* put it together piece by piece */
1928 rloop = newNode (NULLOP,
1929 createIf (newAst_VALUE (symbolVal (sym)),
1931 newAst_VALUE (symbolVal (AST_FOR (loop, continueLabel))),
1934 newAst_VALUE (symbolVal (sym)),
1937 replLoopSym (loop->left, sym);
1938 setAstLineno (rloop, init->lineno);
1940 rloop = newNode (NULLOP,
1942 newAst_VALUE (symbolVal (sym)),
1943 newNode ('-', end, init)),
1944 createLabel (AST_FOR (loop, continueLabel),
1948 newNode (SUB_ASSIGN,
1949 newAst_VALUE (symbolVal (sym)),
1950 newAst_VALUE (constVal ("1"))),
1953 rloop->lineno=init->lineno;
1954 return decorateType (rloop);
1958 /*-----------------------------------------------------------------*/
1959 /* searchLitOp - search tree (*ops only) for an ast with literal */
1960 /*-----------------------------------------------------------------*/
1962 searchLitOp (ast *tree, ast **parent, const char *ops)
1966 if (tree && optimize.global_cse)
1968 /* is there a literal operand? */
1970 IS_AST_OP(tree->right) &&
1971 tree->right->right &&
1972 (tree->right->opval.op == ops[0] || tree->right->opval.op == ops[1]))
1974 if (IS_LITERAL (RTYPE (tree->right)) ^
1975 IS_LITERAL (LTYPE (tree->right)))
1977 tree->right->decorated = 0;
1978 tree->decorated = 0;
1982 ret = searchLitOp (tree->right, parent, ops);
1987 IS_AST_OP(tree->left) &&
1988 tree->left->right &&
1989 (tree->left->opval.op == ops[0] || tree->left->opval.op == ops[1]))
1991 if (IS_LITERAL (RTYPE (tree->left)) ^
1992 IS_LITERAL (LTYPE (tree->left)))
1994 tree->left->decorated = 0;
1995 tree->decorated = 0;
1999 ret = searchLitOp (tree->left, parent, ops);
2007 /*-----------------------------------------------------------------*/
2008 /* decorateType - compute type for this tree also does type checking */
2009 /* this is done bottom up, since type have to flow upwards */
2010 /* it also does constant folding, and paramater checking */
2011 /*-----------------------------------------------------------------*/
2013 decorateType (ast * tree)
2021 /* if already has type then do nothing */
2022 if (tree->decorated)
2025 tree->decorated = 1;
2028 /* print the line */
2029 /* if not block & function */
2030 if (tree->type == EX_OP &&
2031 (tree->opval.op != FUNCTION &&
2032 tree->opval.op != BLOCK &&
2033 tree->opval.op != NULLOP))
2035 filename = tree->filename;
2036 lineno = tree->lineno;
2040 /* if any child is an error | this one is an error do nothing */
2041 if (tree->isError ||
2042 (tree->left && tree->left->isError) ||
2043 (tree->right && tree->right->isError))
2046 /*------------------------------------------------------------------*/
2047 /*----------------------------*/
2048 /* leaf has been reached */
2049 /*----------------------------*/
2050 lineno=tree->lineno;
2051 /* if this is of type value */
2052 /* just get the type */
2053 if (tree->type == EX_VALUE)
2056 if (IS_LITERAL (tree->opval.val->etype))
2059 /* if this is a character array then declare it */
2060 if (IS_ARRAY (tree->opval.val->type))
2061 tree->opval.val = stringToSymbol (tree->opval.val);
2063 /* otherwise just copy the type information */
2064 COPYTYPE (TTYPE (tree), TETYPE (tree), tree->opval.val->type);
2068 if (tree->opval.val->sym)
2070 /* if the undefined flag is set then give error message */
2071 if (tree->opval.val->sym->undefined)
2073 werror (E_ID_UNDEF, tree->opval.val->sym->name);
2075 TTYPE (tree) = TETYPE (tree) =
2076 tree->opval.val->type = tree->opval.val->sym->type =
2077 tree->opval.val->etype = tree->opval.val->sym->etype =
2078 copyLinkChain (INTTYPE);
2083 /* if impilicit i.e. struct/union member then no type */
2084 if (tree->opval.val->sym->implicit)
2085 TTYPE (tree) = TETYPE (tree) = NULL;
2090 /* else copy the type */
2091 COPYTYPE (TTYPE (tree), TETYPE (tree), tree->opval.val->type);
2093 /* and mark it as referenced */
2094 tree->opval.val->sym->isref = 1;
2102 /* if type link for the case of cast */
2103 if (tree->type == EX_LINK)
2105 COPYTYPE (TTYPE (tree), TETYPE (tree), tree->opval.lnk);
2113 if (tree->opval.op == NULLOP || tree->opval.op == BLOCK)
2115 if (tree->left && tree->left->type == EX_OPERAND
2116 && (tree->left->opval.op == INC_OP
2117 || tree->left->opval.op == DEC_OP)
2118 && tree->left->left)
2120 tree->left->right = tree->left->left;
2121 tree->left->left = NULL;
2123 if (tree->right && tree->right->type == EX_OPERAND
2124 && (tree->right->opval.op == INC_OP
2125 || tree->right->opval.op == DEC_OP)
2126 && tree->right->left)
2128 tree->right->right = tree->right->left;
2129 tree->right->left = NULL;
2134 dtl = decorateType (tree->left);
2135 /* delay right side for '?' operator since conditional macro expansions might
2137 dtr = (tree->opval.op == '?' ? tree->right : decorateType (tree->right));
2139 /* this is to take care of situations
2140 when the tree gets rewritten */
2141 if (dtl != tree->left)
2143 if (dtr != tree->right)
2145 if ((dtl && dtl->isError) || (dtr && dtr->isError))
2148 if (IS_AST_OP(tree) &&
2149 (tree->opval.op == CAST || tree->opval.op == '=') &&
2150 (getSize(LTYPE(tree)) > getSize(RTYPE(tree))) &&
2151 (getSize(RTYPE(tree)) < (unsigned) INTSIZE)) {
2152 // this is a cast/assign to a bigger type
2153 if (IS_AST_OP(tree->right) &&
2154 IS_INTEGRAL(tree->right->ftype) &&
2155 (tree->right->opval.op == LEFT_OP ||
2156 tree->right->opval.op == '*' ||
2157 tree->right->opval.op == '+' ||
2158 tree->right->opval.op == '-') &&
2159 tree->right->right) {
2160 // we should cast an operand instead of the result
2161 tree->right->decorated = 0;
2162 tree->right->left = newNode( CAST, newAst_LINK(newIntLink()),
2164 tree->right = decorateType(tree->right);
2169 /* depending on type of operator do */
2171 switch (tree->opval.op)
2173 /*------------------------------------------------------------------*/
2174 /*----------------------------*/
2176 /*----------------------------*/
2179 /* determine which is the array & which the index */
2180 if ((IS_ARRAY (RTYPE (tree)) || IS_PTR (RTYPE (tree))) && IS_INTEGRAL (LTYPE (tree)))
2183 ast *tempTree = tree->left;
2184 tree->left = tree->right;
2185 tree->right = tempTree;
2188 /* first check if this is a array or a pointer */
2189 if ((!IS_ARRAY (LTYPE (tree))) && (!IS_PTR (LTYPE (tree))))
2191 werror (E_NEED_ARRAY_PTR, "[]");
2192 goto errorTreeReturn;
2195 /* check if the type of the idx */
2196 if (!IS_INTEGRAL (RTYPE (tree)))
2198 werror (E_IDX_NOT_INT);
2199 goto errorTreeReturn;
2202 /* if the left is an rvalue then error */
2205 werror (E_LVALUE_REQUIRED, "array access");
2206 goto errorTreeReturn;
2209 COPYTYPE (TTYPE (tree), TETYPE (tree), LTYPE (tree)->next);
2212 /*------------------------------------------------------------------*/
2213 /*----------------------------*/
2215 /*----------------------------*/
2217 /* if this is not a structure */
2218 if (!IS_STRUCT (LTYPE (tree)))
2220 werror (E_STRUCT_UNION, ".");
2221 goto errorTreeReturn;
2223 TTYPE (tree) = structElemType (LTYPE (tree),
2224 (tree->right->type == EX_VALUE ?
2225 tree->right->opval.val : NULL));
2226 TETYPE (tree) = getSpec (TTYPE (tree));
2229 /*------------------------------------------------------------------*/
2230 /*----------------------------*/
2231 /* struct/union pointer */
2232 /*----------------------------*/
2234 /* if not pointer to a structure */
2235 if (!IS_PTR (LTYPE (tree)) && !IS_ARRAY (LTYPE(tree)))
2237 werror (E_PTR_REQD);
2238 goto errorTreeReturn;
2241 if (!IS_STRUCT (LTYPE (tree)->next))
2243 werror (E_STRUCT_UNION, "->");
2244 goto errorTreeReturn;
2247 TTYPE (tree) = structElemType (LTYPE (tree)->next,
2248 (tree->right->type == EX_VALUE ?
2249 tree->right->opval.val : NULL));
2250 TETYPE (tree) = getSpec (TTYPE (tree));
2252 /* adjust the storage class */
2253 switch (DCL_TYPE(tree->left->ftype)) {
2255 SPEC_SCLS(TETYPE(tree)) = S_DATA;
2258 SPEC_SCLS(TETYPE(tree)) = S_XDATA;
2261 SPEC_SCLS(TETYPE(tree)) = S_CODE;
2264 SPEC_SCLS (TETYPE (tree)) = 0;
2267 SPEC_SCLS(TETYPE(tree)) = S_XSTACK;
2270 SPEC_SCLS(TETYPE(tree)) = S_IDATA;
2273 SPEC_SCLS(TETYPE(tree)) = S_EEPROM;
2276 SPEC_SCLS (TETYPE (tree)) = 0;
2283 /* This breaks with extern declarations, bitfields, and perhaps other */
2284 /* cases (gcse). Let's leave this optimization disabled for now and */
2285 /* ponder if there's a safe way to do this. -- EEP */
2287 if (IS_ADDRESS_OF_OP (tree->left) && IS_AST_SYM_VALUE(tree->left->left)
2288 && SPEC_ABSA (AST_SYMBOL (tree->left->left)->etype))
2290 /* If defined struct type at addr var
2291 then rewrite (&struct var)->member
2293 and define membertype at (addr+offsetof(struct var,member)) temp
2296 symbol *element = getStructElement (SPEC_STRUCT (LETYPE(tree)),
2297 AST_SYMBOL(tree->right));
2299 sym = newSymbol(genSymName (0), 0);
2300 sym->type = TTYPE (tree);
2301 sym->etype = getSpec(sym->type);
2302 sym->lineDef = tree->lineno;
2305 SPEC_STAT (sym->etype) = 1;
2306 SPEC_ADDR (sym->etype) = SPEC_ADDR (AST_SYMBOL (tree->left->left)->etype)
2308 SPEC_ABSA(sym->etype) = 1;
2309 addSym (SymbolTab, sym, sym->name, 0, 0, 0);
2312 AST_VALUE (tree) = symbolVal(sym);
2315 tree->type = EX_VALUE;
2323 /*------------------------------------------------------------------*/
2324 /*----------------------------*/
2325 /* ++/-- operation */
2326 /*----------------------------*/
2330 sym_link *ltc = (tree->right ? RTYPE (tree) : LTYPE (tree));
2331 COPYTYPE (TTYPE (tree), TETYPE (tree), ltc);
2332 if (!tree->initMode && IS_CONSTANT(TTYPE(tree)))
2333 werror (E_CODE_WRITE, tree->opval.op==INC_OP ? "++" : "--");
2342 /*------------------------------------------------------------------*/
2343 /*----------------------------*/
2345 /*----------------------------*/
2346 case '&': /* can be unary */
2347 /* if right is NULL then unary operation */
2348 if (tree->right) /* not an unary operation */
2351 if (!IS_INTEGRAL (LTYPE (tree)) || !IS_INTEGRAL (RTYPE (tree)))
2353 werror (E_BITWISE_OP);
2354 werror (W_CONTINUE, "left & right types are ");
2355 printTypeChain (LTYPE (tree), stderr);
2356 fprintf (stderr, ",");
2357 printTypeChain (RTYPE (tree), stderr);
2358 fprintf (stderr, "\n");
2359 goto errorTreeReturn;
2362 /* if they are both literal */
2363 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2365 tree->type = EX_VALUE;
2366 tree->opval.val = valBitwise (valFromType (LETYPE (tree)),
2367 valFromType (RETYPE (tree)), '&');
2369 tree->right = tree->left = NULL;
2370 TETYPE (tree) = tree->opval.val->etype;
2371 TTYPE (tree) = tree->opval.val->type;
2375 /* see if this is a GETHBIT operation if yes
2378 ast *otree = optimizeGetHbit (tree);
2381 return decorateType (otree);
2385 computeType (LTYPE (tree), RTYPE (tree), FALSE);
2386 TETYPE (tree) = getSpec (TTYPE (tree));
2388 /* if left is a literal exchange left & right */
2389 if (IS_LITERAL (LTYPE (tree)))
2391 ast *tTree = tree->left;
2392 tree->left = tree->right;
2393 tree->right = tTree;
2396 /* if right is a literal and */
2397 /* we can find a 2nd literal in a and-tree then */
2398 /* rearrange the tree */
2399 if (IS_LITERAL (RTYPE (tree)))
2402 ast *litTree = searchLitOp (tree, &parent, "&");
2405 ast *tTree = litTree->left;
2406 litTree->left = tree->right;
2407 tree->right = tTree;
2408 /* both operands in tTree are literal now */
2409 decorateType (parent);
2413 LRVAL (tree) = RRVAL (tree) = 1;
2417 /*------------------------------------------------------------------*/
2418 /*----------------------------*/
2420 /*----------------------------*/
2421 p = newLink (DECLARATOR);
2422 /* if bit field then error */
2423 if (IS_BITVAR (tree->left->etype))
2425 werror (E_ILLEGAL_ADDR, "address of bit variable");
2426 goto errorTreeReturn;
2429 if (LETYPE(tree) && SPEC_SCLS (tree->left->etype) == S_REGISTER)
2431 werror (E_ILLEGAL_ADDR, "address of register variable");
2432 goto errorTreeReturn;
2435 if (IS_FUNC (LTYPE (tree)))
2437 // this ought to be ignored
2438 return (tree->left);
2441 if (IS_LITERAL(LTYPE(tree)))
2443 werror (E_ILLEGAL_ADDR, "address of literal");
2444 goto errorTreeReturn;
2449 werror (E_LVALUE_REQUIRED, "address of");
2450 goto errorTreeReturn;
2453 DCL_TYPE (p) = POINTER;
2454 else if (SPEC_SCLS (tree->left->etype) == S_CODE)
2455 DCL_TYPE (p) = CPOINTER;
2456 else if (SPEC_SCLS (tree->left->etype) == S_XDATA)
2457 DCL_TYPE (p) = FPOINTER;
2458 else if (SPEC_SCLS (tree->left->etype) == S_XSTACK)
2459 DCL_TYPE (p) = PPOINTER;
2460 else if (SPEC_SCLS (tree->left->etype) == S_IDATA)
2461 DCL_TYPE (p) = IPOINTER;
2462 else if (SPEC_SCLS (tree->left->etype) == S_EEPROM)
2463 DCL_TYPE (p) = EEPPOINTER;
2464 else if (SPEC_OCLS(tree->left->etype))
2465 DCL_TYPE (p) = PTR_TYPE(SPEC_OCLS(tree->left->etype));
2467 DCL_TYPE (p) = POINTER;
2469 if (IS_AST_SYM_VALUE (tree->left))
2471 AST_SYMBOL (tree->left)->addrtaken = 1;
2472 AST_SYMBOL (tree->left)->allocreq = 1;
2475 p->next = LTYPE (tree);
2477 TETYPE (tree) = getSpec (TTYPE (tree));
2482 if (IS_AST_OP (tree->left) && tree->left->opval.op == PTR_OP
2483 && IS_AST_VALUE (tree->left->left) && !IS_AST_SYM_VALUE (tree->left->left))
2485 symbol *element = getStructElement (SPEC_STRUCT (LETYPE(tree->left)),
2486 AST_SYMBOL(tree->left->right));
2487 AST_VALUE(tree) = valPlus(AST_VALUE(tree->left->left),
2488 valueFromLit(element->offset));
2491 tree->type = EX_VALUE;
2492 tree->values.literalFromCast = 1;
2498 /*------------------------------------------------------------------*/
2499 /*----------------------------*/
2501 /*----------------------------*/
2503 /* if the rewrite succeeds then don't go any furthur */
2505 ast *wtree = optimizeRRCRLC (tree);
2507 return decorateType (wtree);
2509 wtree = optimizeSWAP (tree);
2511 return decorateType (wtree);
2514 /* if left is a literal exchange left & right */
2515 if (IS_LITERAL (LTYPE (tree)))
2517 ast *tTree = tree->left;
2518 tree->left = tree->right;
2519 tree->right = tTree;
2522 /* if right is a literal and */
2523 /* we can find a 2nd literal in a or-tree then */
2524 /* rearrange the tree */
2525 if (IS_LITERAL (RTYPE (tree)))
2528 ast *litTree = searchLitOp (tree, &parent, "|");
2531 ast *tTree = litTree->left;
2532 litTree->left = tree->right;
2533 tree->right = tTree;
2534 /* both operands in tTree are literal now */
2535 decorateType (parent);
2540 /*------------------------------------------------------------------*/
2541 /*----------------------------*/
2543 /*----------------------------*/
2545 if (!IS_INTEGRAL (LTYPE (tree)) || !IS_INTEGRAL (RTYPE (tree)))
2547 werror (E_BITWISE_OP);
2548 werror (W_CONTINUE, "left & right types are ");
2549 printTypeChain (LTYPE (tree), stderr);
2550 fprintf (stderr, ",");
2551 printTypeChain (RTYPE (tree), stderr);
2552 fprintf (stderr, "\n");
2553 goto errorTreeReturn;
2556 /* if they are both literal then */
2557 /* rewrite the tree */
2558 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2560 tree->type = EX_VALUE;
2561 tree->opval.val = valBitwise (valFromType (LETYPE (tree)),
2562 valFromType (RETYPE (tree)),
2564 tree->right = tree->left = NULL;
2565 TETYPE (tree) = tree->opval.val->etype;
2566 TTYPE (tree) = tree->opval.val->type;
2570 /* if left is a literal exchange left & right */
2571 if (IS_LITERAL (LTYPE (tree)))
2573 ast *tTree = tree->left;
2574 tree->left = tree->right;
2575 tree->right = tTree;
2578 /* if right is a literal and */
2579 /* we can find a 2nd literal in a xor-tree then */
2580 /* rearrange the tree */
2581 if (IS_LITERAL (RTYPE (tree)) &&
2582 tree->opval.op == '^') /* the same source is used by 'bitwise or' */
2585 ast *litTree = searchLitOp (tree, &parent, "^");
2588 ast *tTree = litTree->left;
2589 litTree->left = tree->right;
2590 tree->right = tTree;
2591 /* both operands in litTree are literal now */
2592 decorateType (parent);
2596 LRVAL (tree) = RRVAL (tree) = 1;
2597 TETYPE (tree) = getSpec (TTYPE (tree) =
2598 computeType (LTYPE (tree),
2604 /*------------------------------------------------------------------*/
2605 /*----------------------------*/
2607 /*----------------------------*/
2609 if (!IS_ARITHMETIC (LTYPE (tree)) || !IS_ARITHMETIC (RTYPE (tree)))
2611 werror (E_INVALID_OP, "divide");
2612 goto errorTreeReturn;
2614 /* if they are both literal then */
2615 /* rewrite the tree */
2616 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2618 tree->type = EX_VALUE;
2619 tree->opval.val = valDiv (valFromType (LETYPE (tree)),
2620 valFromType (RETYPE (tree)));
2621 tree->right = tree->left = NULL;
2622 TETYPE (tree) = getSpec (TTYPE (tree) =
2623 tree->opval.val->type);
2627 LRVAL (tree) = RRVAL (tree) = 1;
2628 TETYPE (tree) = getSpec (TTYPE (tree) =
2629 computeType (LTYPE (tree),
2633 /* if right is a literal and */
2634 /* left is also a division by a literal then */
2635 /* rearrange the tree */
2636 if (IS_LITERAL (RTYPE (tree))
2637 /* avoid infinite loop */
2638 && (TYPE_UDWORD) floatFromVal (tree->right->opval.val) != 1)
2641 ast *litTree = searchLitOp (tree, &parent, "/");
2644 if (IS_LITERAL (RTYPE (litTree)))
2647 litTree->right = newNode ('*', litTree->right, tree->right);
2648 litTree->right->lineno = tree->lineno;
2650 tree->right->opval.val = constVal ("1");
2651 decorateType (parent);
2655 /* litTree->left is literal: no gcse possible.
2656 We can't call decorateType(parent), because
2657 this would cause an infinit loop. */
2658 parent->decorated = 1;
2659 decorateType (litTree);
2666 /*------------------------------------------------------------------*/
2667 /*----------------------------*/
2669 /*----------------------------*/
2671 if (!IS_INTEGRAL (LTYPE (tree)) || !IS_INTEGRAL (RTYPE (tree)))
2673 werror (E_BITWISE_OP);
2674 werror (W_CONTINUE, "left & right types are ");
2675 printTypeChain (LTYPE (tree), stderr);
2676 fprintf (stderr, ",");
2677 printTypeChain (RTYPE (tree), stderr);
2678 fprintf (stderr, "\n");
2679 goto errorTreeReturn;
2681 /* if they are both literal then */
2682 /* rewrite the tree */
2683 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2685 tree->type = EX_VALUE;
2686 tree->opval.val = valMod (valFromType (LETYPE (tree)),
2687 valFromType (RETYPE (tree)));
2688 tree->right = tree->left = NULL;
2689 TETYPE (tree) = getSpec (TTYPE (tree) =
2690 tree->opval.val->type);
2693 LRVAL (tree) = RRVAL (tree) = 1;
2694 TETYPE (tree) = getSpec (TTYPE (tree) =
2695 computeType (LTYPE (tree),
2700 /*------------------------------------------------------------------*/
2701 /*----------------------------*/
2702 /* address dereference */
2703 /*----------------------------*/
2704 case '*': /* can be unary : if right is null then unary operation */
2707 if (!IS_PTR (LTYPE (tree)) && !IS_ARRAY (LTYPE (tree)))
2709 werror (E_PTR_REQD);
2710 goto errorTreeReturn;
2715 werror (E_LVALUE_REQUIRED, "pointer deref");
2716 goto errorTreeReturn;
2718 if (IS_ADDRESS_OF_OP(tree->left))
2720 /* replace *&obj with obj */
2721 return tree->left->left;
2723 TTYPE (tree) = copyLinkChain (LTYPE (tree)->next);
2724 TETYPE (tree) = getSpec (TTYPE (tree));
2725 /* adjust the storage class */
2726 switch (DCL_TYPE(tree->left->ftype)) {
2728 SPEC_SCLS(TETYPE(tree)) = S_DATA;
2731 SPEC_SCLS(TETYPE(tree)) = S_XDATA;
2734 SPEC_SCLS(TETYPE(tree)) = S_CODE;
2737 SPEC_SCLS (TETYPE (tree)) = 0;
2740 SPEC_SCLS(TETYPE(tree)) = S_XSTACK;
2743 SPEC_SCLS(TETYPE(tree)) = S_IDATA;
2746 SPEC_SCLS(TETYPE(tree)) = S_EEPROM;
2749 SPEC_SCLS (TETYPE (tree)) = 0;
2758 /*------------------------------------------------------------------*/
2759 /*----------------------------*/
2760 /* multiplication */
2761 /*----------------------------*/
2762 if (!IS_ARITHMETIC (LTYPE (tree)) || !IS_ARITHMETIC (RTYPE (tree)))
2764 werror (E_INVALID_OP, "multiplication");
2765 goto errorTreeReturn;
2768 /* if they are both literal then */
2769 /* rewrite the tree */
2770 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2772 tree->type = EX_VALUE;
2773 tree->opval.val = valMult (valFromType (LETYPE (tree)),
2774 valFromType (RETYPE (tree)));
2775 tree->right = tree->left = NULL;
2776 TETYPE (tree) = getSpec (TTYPE (tree) =
2777 tree->opval.val->type);
2781 /* if left is a literal exchange left & right */
2782 if (IS_LITERAL (LTYPE (tree)))
2784 ast *tTree = tree->left;
2785 tree->left = tree->right;
2786 tree->right = tTree;
2789 /* if right is a literal and */
2790 /* we can find a 2nd literal in a mul-tree then */
2791 /* rearrange the tree */
2792 if (IS_LITERAL (RTYPE (tree)))
2795 ast *litTree = searchLitOp (tree, &parent, "*");
2798 ast *tTree = litTree->left;
2799 litTree->left = tree->right;
2800 tree->right = tTree;
2801 /* both operands in litTree are literal now */
2802 decorateType (parent);
2806 LRVAL (tree) = RRVAL (tree) = 1;
2807 TETYPE (tree) = getSpec (TTYPE (tree) =
2808 computeType (LTYPE (tree),
2814 /*------------------------------------------------------------------*/
2815 /*----------------------------*/
2816 /* unary '+' operator */
2817 /*----------------------------*/
2822 if (!IS_ARITHMETIC (LTYPE (tree)))
2824 werror (E_UNARY_OP, '+');
2825 goto errorTreeReturn;
2828 /* if left is a literal then do it */
2829 if (IS_LITERAL (LTYPE (tree)))
2831 tree->type = EX_VALUE;
2832 tree->opval.val = valFromType (LETYPE (tree));
2834 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
2838 COPYTYPE (TTYPE (tree), TETYPE (tree), LTYPE (tree));
2842 /*------------------------------------------------------------------*/
2843 /*----------------------------*/
2845 /*----------------------------*/
2847 /* this is not a unary operation */
2848 /* if both pointers then problem */
2849 if ((IS_PTR (LTYPE (tree)) || IS_ARRAY (LTYPE (tree))) &&
2850 (IS_PTR (RTYPE (tree)) || IS_ARRAY (RTYPE (tree))))
2852 werror (E_PTR_PLUS_PTR);
2853 goto errorTreeReturn;
2856 if (!IS_ARITHMETIC (LTYPE (tree)) &&
2857 !IS_PTR (LTYPE (tree)) && !IS_ARRAY (LTYPE (tree)))
2859 werror (E_PLUS_INVALID, "+");
2860 goto errorTreeReturn;
2863 if (!IS_ARITHMETIC (RTYPE (tree)) &&
2864 !IS_PTR (RTYPE (tree)) && !IS_ARRAY (RTYPE (tree)))
2866 werror (E_PLUS_INVALID, "+");
2867 goto errorTreeReturn;
2869 /* if they are both literal then */
2870 /* rewrite the tree */
2871 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2873 tree->type = EX_VALUE;
2874 tree->opval.val = valPlus (valFromType (LETYPE (tree)),
2875 valFromType (RETYPE (tree)));
2876 tree->right = tree->left = NULL;
2877 TETYPE (tree) = getSpec (TTYPE (tree) =
2878 tree->opval.val->type);
2882 /* if the right is a pointer or left is a literal
2883 xchange left & right */
2884 if (IS_ARRAY (RTYPE (tree)) ||
2885 IS_PTR (RTYPE (tree)) ||
2886 IS_LITERAL (LTYPE (tree)))
2888 ast *tTree = tree->left;
2889 tree->left = tree->right;
2890 tree->right = tTree;
2893 /* if right is a literal and */
2894 /* left is also an addition/subtraction with a literal then */
2895 /* rearrange the tree */
2896 if (IS_LITERAL (RTYPE (tree)))
2898 ast *litTree, *parent;
2899 litTree = searchLitOp (tree, &parent, "+-");
2902 if (litTree->opval.op == '+')
2905 ast *tTree = litTree->left;
2906 litTree->left = tree->right;
2907 tree->right = tree->left;
2910 else if (litTree->opval.op == '-')
2912 if (IS_LITERAL (RTYPE (litTree)))
2915 ast *tTree = litTree->left;
2916 litTree->left = tree->right;
2917 tree->right = tTree;
2922 ast *tTree = litTree->right;
2923 litTree->right = tree->right;
2924 tree->right = tTree;
2925 litTree->opval.op = '+';
2926 tree->opval.op = '-';
2929 decorateType (parent);
2933 LRVAL (tree) = RRVAL (tree) = 1;
2934 /* if the left is a pointer */
2935 if (IS_PTR (LTYPE (tree)) || IS_AGGREGATE (LTYPE (tree)) )
2936 TETYPE (tree) = getSpec (TTYPE (tree) =
2939 TETYPE (tree) = getSpec (TTYPE (tree) =
2940 computeType (LTYPE (tree),
2945 /*------------------------------------------------------------------*/
2946 /*----------------------------*/
2948 /*----------------------------*/
2949 case '-': /* can be unary */
2950 /* if right is null then unary */
2954 if (!IS_ARITHMETIC (LTYPE (tree)))
2956 werror (E_UNARY_OP, tree->opval.op);
2957 goto errorTreeReturn;
2960 /* if left is a literal then do it */
2961 if (IS_LITERAL (LTYPE (tree)))
2963 tree->type = EX_VALUE;
2964 tree->opval.val = valUnaryPM (valFromType (LETYPE (tree)));
2966 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
2967 SPEC_USIGN(TETYPE(tree)) = 0;
2971 TETYPE(tree) = getSpec (TTYPE (tree) = LTYPE (tree));
2975 /*------------------------------------------------------------------*/
2976 /*----------------------------*/
2978 /*----------------------------*/
2980 if (!(IS_PTR (LTYPE (tree)) ||
2981 IS_ARRAY (LTYPE (tree)) ||
2982 IS_ARITHMETIC (LTYPE (tree))))
2984 werror (E_PLUS_INVALID, "-");
2985 goto errorTreeReturn;
2988 if (!(IS_PTR (RTYPE (tree)) ||
2989 IS_ARRAY (RTYPE (tree)) ||
2990 IS_ARITHMETIC (RTYPE (tree))))
2992 werror (E_PLUS_INVALID, "-");
2993 goto errorTreeReturn;
2996 if ((IS_PTR (LTYPE (tree)) || IS_ARRAY (LTYPE (tree))) &&
2997 !(IS_PTR (RTYPE (tree)) || IS_ARRAY (RTYPE (tree)) ||
2998 IS_INTEGRAL (RTYPE (tree))))
3000 werror (E_PLUS_INVALID, "-");
3001 goto errorTreeReturn;
3004 /* if they are both literal then */
3005 /* rewrite the tree */
3006 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
3008 tree->type = EX_VALUE;
3009 tree->opval.val = valMinus (valFromType (LETYPE (tree)),
3010 valFromType (RETYPE (tree)));
3011 tree->right = tree->left = NULL;
3012 TETYPE (tree) = getSpec (TTYPE (tree) =
3013 tree->opval.val->type);
3017 /* if the left & right are equal then zero */
3018 if (isAstEqual (tree->left, tree->right))
3020 tree->type = EX_VALUE;
3021 tree->left = tree->right = NULL;
3022 tree->opval.val = constVal ("0");
3023 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
3027 /* if both of them are pointers or arrays then */
3028 /* the result is going to be an integer */
3029 if ((IS_ARRAY (LTYPE (tree)) || IS_PTR (LTYPE (tree))) &&
3030 (IS_ARRAY (RTYPE (tree)) || IS_PTR (RTYPE (tree))))
3031 TETYPE (tree) = TTYPE (tree) = newIntLink ();
3033 /* if only the left is a pointer */
3034 /* then result is a pointer */
3035 if (IS_PTR (LTYPE (tree)) || IS_ARRAY (LTYPE (tree)))
3036 TETYPE (tree) = getSpec (TTYPE (tree) =
3039 TETYPE (tree) = getSpec (TTYPE (tree) =
3040 computeType (LTYPE (tree),
3044 LRVAL (tree) = RRVAL (tree) = 1;
3046 /* if right is a literal and */
3047 /* left is also an addition/subtraction with a literal then */
3048 /* rearrange the tree */
3049 if (IS_LITERAL (RTYPE (tree))
3050 /* avoid infinite loop */
3051 && (TYPE_UDWORD) floatFromVal (tree->right->opval.val) != 0)
3053 ast *litTree, *litParent;
3054 litTree = searchLitOp (tree, &litParent, "+-");
3057 if (litTree->opval.op == '+')
3060 litTree->right = newNode ('-', litTree->right, tree->right);
3061 litTree->right->lineno = tree->lineno;
3063 tree->right->opval.val = constVal ("0");
3065 else if (litTree->opval.op == '-')
3067 if (IS_LITERAL (RTYPE (litTree)))
3070 litTree->right = newNode ('+', tree->right, litTree->right);
3071 litTree->right->lineno = tree->lineno;
3073 tree->right->opval.val = constVal ("0");
3078 ast *tTree = litTree->right;
3079 litTree->right = tree->right;
3080 tree->right = tTree;
3083 decorateType (litParent);
3088 /*------------------------------------------------------------------*/
3089 /*----------------------------*/
3091 /*----------------------------*/
3093 /* can be only integral type */
3094 if (!IS_INTEGRAL (LTYPE (tree)))
3096 werror (E_UNARY_OP, tree->opval.op);
3097 goto errorTreeReturn;
3100 /* if left is a literal then do it */
3101 if (IS_LITERAL (LTYPE (tree)))
3103 tree->type = EX_VALUE;
3104 tree->opval.val = valComplement (valFromType (LETYPE (tree)));
3106 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
3110 COPYTYPE (TTYPE (tree), TETYPE (tree), LTYPE (tree));
3113 /*------------------------------------------------------------------*/
3114 /*----------------------------*/
3116 /*----------------------------*/
3118 /* can be pointer */
3119 if (!IS_ARITHMETIC (LTYPE (tree)) &&
3120 !IS_PTR (LTYPE (tree)) &&
3121 !IS_ARRAY (LTYPE (tree)))
3123 werror (E_UNARY_OP, tree->opval.op);
3124 goto errorTreeReturn;
3127 /* if left is a literal then do it */
3128 if (IS_LITERAL (LTYPE (tree)))
3130 tree->type = EX_VALUE;
3131 tree->opval.val = valNot (valFromType (LETYPE (tree)));
3133 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
3137 TTYPE (tree) = TETYPE (tree) = newCharLink ();
3140 /*------------------------------------------------------------------*/
3141 /*----------------------------*/
3143 /*----------------------------*/
3147 TTYPE (tree) = LTYPE (tree);
3148 TETYPE (tree) = LETYPE (tree);
3152 TTYPE (tree) = TETYPE (tree) = newCharLink ();
3157 if (!IS_INTEGRAL (LTYPE (tree)) || !IS_INTEGRAL (tree->left->etype))
3159 werror (E_SHIFT_OP_INVALID);
3160 werror (W_CONTINUE, "left & right types are ");
3161 printTypeChain (LTYPE (tree), stderr);
3162 fprintf (stderr, ",");
3163 printTypeChain (RTYPE (tree), stderr);
3164 fprintf (stderr, "\n");
3165 goto errorTreeReturn;
3168 /* if they are both literal then */
3169 /* rewrite the tree */
3170 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
3172 tree->type = EX_VALUE;
3173 tree->opval.val = valShift (valFromType (LETYPE (tree)),
3174 valFromType (RETYPE (tree)),
3175 (tree->opval.op == LEFT_OP ? 1 : 0));
3176 tree->right = tree->left = NULL;
3177 TETYPE (tree) = getSpec (TTYPE (tree) =
3178 tree->opval.val->type);
3182 LRVAL (tree) = RRVAL (tree) = 1;
3183 if (tree->opval.op == LEFT_OP)
3185 /* promote char to int */
3186 TETYPE (tree) = getSpec (TTYPE (tree) =
3187 computeType (LTYPE (tree),
3188 LTYPE (tree), /* no, not RTYPE! */
3193 /* no promotion necessary */
3194 TTYPE (tree) = TETYPE (tree) = copyLinkChain (LTYPE (tree));
3195 if (IS_LITERAL (TTYPE (tree)))
3196 SPEC_SCLS (TTYPE (tree)) &= ~S_LITERAL;
3199 /* if only the right side is a literal & we are
3200 shifting more than size of the left operand then zero */
3201 if (IS_LITERAL (RTYPE (tree)) &&
3202 ((TYPE_UDWORD) floatFromVal (valFromType (RETYPE (tree)))) >=
3203 (getSize (TETYPE (tree)) * 8))
3205 if (tree->opval.op==LEFT_OP ||
3206 (tree->opval.op==RIGHT_OP && SPEC_USIGN(LETYPE(tree))))
3208 lineno=tree->lineno;
3209 werror (W_SHIFT_CHANGED,
3210 (tree->opval.op == LEFT_OP ? "left" : "right"));
3211 tree->type = EX_VALUE;
3212 tree->left = tree->right = NULL;
3213 tree->opval.val = constVal ("0");
3214 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
3221 /*------------------------------------------------------------------*/
3222 /*----------------------------*/
3224 /*----------------------------*/
3225 case CAST: /* change the type */
3226 /* cannot cast to an aggregate type */
3227 if (IS_AGGREGATE (LTYPE (tree)))
3229 werror (E_CAST_ILLEGAL);
3230 goto errorTreeReturn;
3233 /* make sure the type is complete and sane */
3234 checkTypeSanity(LETYPE(tree), "(cast)");
3237 /* if the right is a literal replace the tree */
3238 if (IS_LITERAL (RETYPE (tree))) {
3239 if (!IS_PTR (LTYPE (tree))) {
3240 tree->type = EX_VALUE;
3242 valCastLiteral (LTYPE (tree),
3243 floatFromVal (valFromType (RETYPE (tree))));
3246 TTYPE (tree) = tree->opval.val->type;
3247 tree->values.literalFromCast = 1;
3248 } else if (IS_GENPTR(LTYPE(tree)) && !IS_PTR(RTYPE(tree)) &&
3249 ((int)floatFromVal(valFromType(RETYPE(tree)))) !=0 ) /* special case of NULL */ {
3250 sym_link *rest = LTYPE(tree)->next;
3251 werror(W_LITERAL_GENERIC);
3252 TTYPE(tree) = newLink(DECLARATOR);
3253 DCL_TYPE(TTYPE(tree)) = FPOINTER;
3254 TTYPE(tree)->next = rest;
3255 tree->left->opval.lnk = TTYPE(tree);
3258 TTYPE (tree) = LTYPE (tree);
3262 TTYPE (tree) = LTYPE (tree);
3266 #if 0 // this is already checked, now this could be explicit
3267 /* if pointer to struct then check names */
3268 if (IS_PTR(LTYPE(tree)) && IS_STRUCT(LTYPE(tree)->next) &&
3269 IS_PTR(RTYPE(tree)) && IS_STRUCT(RTYPE(tree)->next) &&
3270 strcmp(SPEC_STRUCT(LETYPE(tree))->tag,SPEC_STRUCT(RETYPE(tree))->tag))
3272 werror(W_CAST_STRUCT_PTR,SPEC_STRUCT(RETYPE(tree))->tag,
3273 SPEC_STRUCT(LETYPE(tree))->tag);
3276 if (IS_ADDRESS_OF_OP(tree->right)
3277 && IS_AST_SYM_VALUE (tree->right->left)
3278 && SPEC_ABSA (AST_SYMBOL (tree->right->left)->etype)) {
3280 tree->type = EX_VALUE;
3282 valCastLiteral (LTYPE (tree),
3283 SPEC_ADDR (AST_SYMBOL (tree->right->left)->etype));
3284 TTYPE (tree) = tree->opval.val->type;
3285 TETYPE (tree) = getSpec (TTYPE (tree));
3288 tree->values.literalFromCast = 1;
3292 /* handle offsetof macro: */
3293 /* #define offsetof(TYPE, MEMBER) \ */
3294 /* ((unsigned) &((TYPE *)0)->MEMBER) */
3295 if (IS_ADDRESS_OF_OP(tree->right)
3296 && IS_AST_OP (tree->right->left)
3297 && tree->right->left->opval.op == PTR_OP
3298 && IS_AST_OP (tree->right->left->left)
3299 && tree->right->left->left->opval.op == CAST
3300 && IS_AST_LIT_VALUE(tree->right->left->left->right)) {
3302 symbol *element = getStructElement (
3303 SPEC_STRUCT (LETYPE(tree->right->left)),
3304 AST_SYMBOL(tree->right->left->right)
3308 tree->type = EX_VALUE;
3309 tree->opval.val = valCastLiteral (
3312 + floatFromVal (valFromType (RTYPE (tree->right->left->left)))
3315 TTYPE (tree) = tree->opval.val->type;
3316 TETYPE (tree) = getSpec (TTYPE (tree));
3323 /* if the right is a literal replace the tree */
3324 if (IS_LITERAL (RETYPE (tree))) {
3325 if (IS_PTR (LTYPE (tree)) && !IS_GENPTR (LTYPE (tree)) ) {
3326 /* rewrite (type *)litaddr
3328 and define type at litaddr temp
3329 (but only if type's storage class is not generic)
3331 ast *newTree = newNode ('&', NULL, NULL);
3334 TTYPE (newTree) = LTYPE (tree);
3335 TETYPE (newTree) = getSpec(LTYPE (tree));
3337 /* define a global symbol at the casted address*/
3338 sym = newSymbol(genSymName (0), 0);
3339 sym->type = LTYPE (tree)->next;
3341 sym->type = newLink (V_VOID);
3342 sym->etype = getSpec(sym->type);
3343 SPEC_SCLS (sym->etype) = sclsFromPtr (LTYPE (tree));
3344 sym->lineDef = tree->lineno;
3347 SPEC_STAT (sym->etype) = 1;
3348 SPEC_ADDR(sym->etype) = floatFromVal (valFromType (RTYPE (tree)));
3349 SPEC_ABSA(sym->etype) = 1;
3350 addSym (SymbolTab, sym, sym->name, 0, 0, 0);
3353 newTree->left = newAst_VALUE(symbolVal(sym));
3354 newTree->left->lineno = tree->lineno;
3355 LTYPE (newTree) = sym->type;
3356 LETYPE (newTree) = sym->etype;
3357 LLVAL (newTree) = 1;
3358 LRVAL (newTree) = 0;
3359 TLVAL (newTree) = 1;
3362 if (!IS_PTR (LTYPE (tree))) {
3363 tree->type = EX_VALUE;
3365 valCastLiteral (LTYPE (tree),
3366 floatFromVal (valFromType (RTYPE (tree))));
3367 TTYPE (tree) = tree->opval.val->type;
3370 tree->values.literalFromCast = 1;
3371 TETYPE (tree) = getSpec (TTYPE (tree));
3375 TTYPE (tree) = LTYPE (tree);
3379 TETYPE (tree) = getSpec (TTYPE (tree));
3383 /*------------------------------------------------------------------*/
3384 /*----------------------------*/
3385 /* logical &&, || */
3386 /*----------------------------*/
3389 /* each must me arithmetic type or be a pointer */
3390 if (!IS_PTR (LTYPE (tree)) &&
3391 !IS_ARRAY (LTYPE (tree)) &&
3392 !IS_INTEGRAL (LTYPE (tree)))
3394 werror (E_COMPARE_OP);
3395 goto errorTreeReturn;
3398 if (!IS_PTR (RTYPE (tree)) &&
3399 !IS_ARRAY (RTYPE (tree)) &&
3400 !IS_INTEGRAL (RTYPE (tree)))
3402 werror (E_COMPARE_OP);
3403 goto errorTreeReturn;
3405 /* if they are both literal then */
3406 /* rewrite the tree */
3407 if (IS_LITERAL (RTYPE (tree)) &&
3408 IS_LITERAL (LTYPE (tree)))
3410 tree->type = EX_VALUE;
3411 tree->opval.val = valLogicAndOr (valFromType (LTYPE (tree)),
3412 valFromType (RTYPE (tree)),
3414 tree->right = tree->left = NULL;
3415 TETYPE (tree) = getSpec (TTYPE (tree) =
3416 tree->opval.val->type);
3419 LRVAL (tree) = RRVAL (tree) = 1;
3420 TTYPE (tree) = TETYPE (tree) = newCharLink ();
3423 /*------------------------------------------------------------------*/
3424 /*----------------------------*/
3425 /* comparison operators */
3426 /*----------------------------*/
3434 ast *lt = optimizeCompare (tree);
3440 /* if they are pointers they must be castable */
3441 if (IS_PTR (LTYPE (tree)) && IS_PTR (RTYPE (tree)))
3443 if (tree->opval.op==EQ_OP &&
3444 !IS_GENPTR(LTYPE(tree)) && IS_GENPTR(RTYPE(tree))) {
3445 // we cannot cast a gptr to a !gptr: switch the leaves
3446 struct ast *s=tree->left;
3447 tree->left=tree->right;
3450 if (compareType (LTYPE (tree), RTYPE (tree)) == 0)
3452 werror (E_COMPARE_OP);
3453 fprintf (stderr, "comparing type ");
3454 printTypeChain (LTYPE (tree), stderr);
3455 fprintf (stderr, "to type ");
3456 printTypeChain (RTYPE (tree), stderr);
3457 fprintf (stderr, "\n");
3458 goto errorTreeReturn;
3461 /* else they should be promotable to one another */
3464 if (!((IS_PTR (LTYPE (tree)) && IS_LITERAL (RTYPE (tree))) ||
3465 (IS_PTR (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))))
3467 if (compareType (LTYPE (tree), RTYPE (tree)) == 0)
3469 werror (E_COMPARE_OP);
3470 fprintf (stderr, "comparing type ");
3471 printTypeChain (LTYPE (tree), stderr);
3472 fprintf (stderr, "to type ");
3473 printTypeChain (RTYPE (tree), stderr);
3474 fprintf (stderr, "\n");
3475 goto errorTreeReturn;
3478 /* if unsigned value < 0 then always false */
3479 /* if (unsigned value) > 0 then (unsigned value) */
3480 if (SPEC_USIGN(LETYPE(tree)) && IS_LITERAL(RTYPE(tree)) &&
3481 ((int) floatFromVal (valFromType (RETYPE (tree)))) == 0)
3483 if (tree->opval.op == '<')
3487 if (tree->opval.op == '>')
3492 /* if they are both literal then */
3493 /* rewrite the tree */
3494 if (IS_LITERAL (RTYPE (tree)) &&
3495 IS_LITERAL (LTYPE (tree)))
3497 tree->type = EX_VALUE;
3498 tree->opval.val = valCompare (valFromType (LETYPE (tree)),
3499 valFromType (RETYPE (tree)),
3501 tree->right = tree->left = NULL;
3502 TETYPE (tree) = getSpec (TTYPE (tree) =
3503 tree->opval.val->type);
3506 LRVAL (tree) = RRVAL (tree) = 1;
3507 TTYPE (tree) = TETYPE (tree) = newCharLink ();
3510 /*------------------------------------------------------------------*/
3511 /*----------------------------*/
3513 /*----------------------------*/
3514 case SIZEOF: /* evaluate wihout code generation */
3515 /* change the type to a integer */
3516 tree->type = EX_VALUE;
3517 SNPRINTF(buffer, sizeof(buffer), "%d", (getSize (tree->right->ftype)));
3518 tree->opval.val = constVal (buffer);
3519 tree->right = tree->left = NULL;
3520 TETYPE (tree) = getSpec (TTYPE (tree) =
3521 tree->opval.val->type);
3524 /*------------------------------------------------------------------*/
3525 /*----------------------------*/
3527 /*----------------------------*/
3529 /* return typeof enum value */
3530 tree->type = EX_VALUE;
3533 if (IS_SPEC(tree->right->ftype)) {
3534 switch (SPEC_NOUN(tree->right->ftype)) {
3536 if (SPEC_LONG(tree->right->ftype)) typeofv = TYPEOF_LONG;
3537 else typeofv = TYPEOF_INT;
3540 typeofv = TYPEOF_FLOAT;
3543 typeofv = TYPEOF_CHAR;
3546 typeofv = TYPEOF_VOID;
3549 typeofv = TYPEOF_STRUCT;
3552 typeofv = TYPEOF_BITFIELD;
3555 typeofv = TYPEOF_BIT;
3558 typeofv = TYPEOF_SBIT;
3564 switch (DCL_TYPE(tree->right->ftype)) {
3566 typeofv = TYPEOF_POINTER;
3569 typeofv = TYPEOF_FPOINTER;
3572 typeofv = TYPEOF_CPOINTER;
3575 typeofv = TYPEOF_GPOINTER;
3578 typeofv = TYPEOF_PPOINTER;
3581 typeofv = TYPEOF_IPOINTER;
3584 typeofv = TYPEOF_ARRAY;
3587 typeofv = TYPEOF_FUNCTION;
3593 SNPRINTF (buffer, sizeof(buffer), "%d", typeofv);
3594 tree->opval.val = constVal (buffer);
3595 tree->right = tree->left = NULL;
3596 TETYPE (tree) = getSpec (TTYPE (tree) =
3597 tree->opval.val->type);
3600 /*------------------------------------------------------------------*/
3601 /*----------------------------*/
3602 /* conditional operator '?' */
3603 /*----------------------------*/
3605 /* the type is value of the colon operator (on the right) */
3606 assert(IS_COLON_OP(tree->right));
3607 /* if already known then replace the tree : optimizer will do it
3608 but faster to do it here */
3609 if (IS_LITERAL (LTYPE(tree))) {
3610 if ( ((int) floatFromVal (valFromType (LETYPE (tree)))) != 0) {
3611 return decorateType(tree->right->left) ;
3613 return decorateType(tree->right->right) ;
3616 tree->right = decorateType(tree->right);
3617 TTYPE (tree) = RTYPE(tree);
3618 TETYPE (tree) = getSpec (TTYPE (tree));
3623 /* if they don't match we have a problem */
3624 if (compareType (LTYPE (tree), RTYPE (tree)) == 0)
3626 werror (E_TYPE_MISMATCH, "conditional operator", " ");
3627 goto errorTreeReturn;
3630 TTYPE (tree) = computeType (LTYPE (tree), RTYPE (tree), FALSE);
3631 TETYPE (tree) = getSpec (TTYPE (tree));
3635 #if 0 // assignment operators are converted by the parser
3636 /*------------------------------------------------------------------*/
3637 /*----------------------------*/
3638 /* assignment operators */
3639 /*----------------------------*/
3642 /* for these it must be both must be integral */
3643 if (!IS_ARITHMETIC (LTYPE (tree)) ||
3644 !IS_ARITHMETIC (RTYPE (tree)))
3646 werror (E_OPS_INTEGRAL);
3647 goto errorTreeReturn;
3650 TETYPE (tree) = getSpec (TTYPE (tree) = LTYPE (tree));
3652 if (!tree->initMode && IS_CONSTANT (LTYPE (tree)))
3653 werror (E_CODE_WRITE, tree->opval.op==MUL_ASSIGN ? "*=" : "/=");
3657 werror (E_LVALUE_REQUIRED, tree->opval.op==MUL_ASSIGN ? "*=" : "/=");
3658 goto errorTreeReturn;
3669 /* for these it must be both must be integral */
3670 if (!IS_INTEGRAL (LTYPE (tree)) ||
3671 !IS_INTEGRAL (RTYPE (tree)))
3673 werror (E_OPS_INTEGRAL);
3674 goto errorTreeReturn;
3677 TETYPE (tree) = getSpec (TTYPE (tree) = LTYPE (tree));
3679 if (!tree->initMode && IS_CONSTANT (LETYPE (tree)))
3680 werror (E_CODE_WRITE, "&= or |= or ^= or >>= or <<=");
3684 werror (E_LVALUE_REQUIRED, "&= or |= or ^= or >>= or <<=");
3685 goto errorTreeReturn;
3691 /*------------------------------------------------------------------*/
3692 /*----------------------------*/
3694 /*----------------------------*/
3696 if (!(IS_PTR (LTYPE (tree)) ||
3697 IS_ARITHMETIC (LTYPE (tree))))
3699 werror (E_PLUS_INVALID, "-=");
3700 goto errorTreeReturn;
3703 if (!(IS_PTR (RTYPE (tree)) ||
3704 IS_ARITHMETIC (RTYPE (tree))))
3706 werror (E_PLUS_INVALID, "-=");
3707 goto errorTreeReturn;
3710 TETYPE (tree) = getSpec (TTYPE (tree) =
3711 computeType (LTYPE (tree),
3715 if (!tree->initMode && IS_CONSTANT (LETYPE (tree)))
3716 werror (E_CODE_WRITE, "-=");
3720 werror (E_LVALUE_REQUIRED, "-=");
3721 goto errorTreeReturn;
3727 /*------------------------------------------------------------------*/
3728 /*----------------------------*/
3730 /*----------------------------*/
3732 /* this is not a unary operation */
3733 /* if both pointers then problem */
3734 if (IS_PTR (LTYPE (tree)) && IS_PTR (RTYPE (tree)))
3736 werror (E_PTR_PLUS_PTR);
3737 goto errorTreeReturn;
3740 if (!IS_ARITHMETIC (LTYPE (tree)) && !IS_PTR (LTYPE (tree)))
3742 werror (E_PLUS_INVALID, "+=");
3743 goto errorTreeReturn;
3746 if (!IS_ARITHMETIC (RTYPE (tree)) && !IS_PTR (RTYPE (tree)))
3748 werror (E_PLUS_INVALID, "+=");
3749 goto errorTreeReturn;
3752 TETYPE (tree) = getSpec (TTYPE (tree) =
3753 computeType (LTYPE (tree),
3757 if (!tree->initMode && IS_CONSTANT (LETYPE (tree)))
3758 werror (E_CODE_WRITE, "+=");
3762 werror (E_LVALUE_REQUIRED, "+=");
3763 goto errorTreeReturn;
3766 tree->right = decorateType (newNode ('+', copyAst (tree->left), tree->right));
3767 tree->opval.op = '=';
3772 /*------------------------------------------------------------------*/
3773 /*----------------------------*/
3774 /* straight assignemnt */
3775 /*----------------------------*/
3777 /* cannot be an aggregate */
3778 if (IS_AGGREGATE (LTYPE (tree)))
3780 werror (E_AGGR_ASSIGN);
3781 goto errorTreeReturn;
3784 /* they should either match or be castable */
3785 if (compareType (LTYPE (tree), RTYPE (tree)) == 0)
3787 werror (E_TYPE_MISMATCH, "assignment", " ");
3788 printFromToType(RTYPE(tree),LTYPE(tree));
3791 /* if the left side of the tree is of type void
3792 then report error */
3793 if (IS_VOID (LTYPE (tree)))
3795 werror (E_CAST_ZERO);
3796 printFromToType(RTYPE(tree), LTYPE(tree));
3799 TETYPE (tree) = getSpec (TTYPE (tree) =
3803 if (!tree->initMode ) {
3804 if (IS_CONSTANT(LTYPE(tree)))
3805 werror (E_CODE_WRITE, "=");
3809 werror (E_LVALUE_REQUIRED, "=");
3810 goto errorTreeReturn;
3815 /*------------------------------------------------------------------*/
3816 /*----------------------------*/
3817 /* comma operator */
3818 /*----------------------------*/
3820 TETYPE (tree) = getSpec (TTYPE (tree) = RTYPE (tree));
3823 /*------------------------------------------------------------------*/
3824 /*----------------------------*/
3826 /*----------------------------*/
3830 if (processParms (tree->left,
3831 FUNC_ARGS(tree->left->ftype),
3832 tree->right, &parmNumber, TRUE)) {
3833 goto errorTreeReturn;
3836 if ((options.stackAuto || IFFUNC_ISREENT (LTYPE (tree))) &&
3837 !IFFUNC_ISBUILTIN(LTYPE(tree)))
3839 reverseParms (tree->right);
3842 if (IS_CODEPTR(LTYPE(tree))) {
3843 TTYPE(tree) = LTYPE(tree)->next->next;
3845 TTYPE(tree) = LTYPE(tree)->next;
3847 TETYPE (tree) = getSpec (TTYPE (tree));
3850 /*------------------------------------------------------------------*/
3851 /*----------------------------*/
3852 /* return statement */
3853 /*----------------------------*/
3858 if (compareType (currFunc->type->next, RTYPE (tree)) == 0)
3860 werrorfl (tree->filename, tree->lineno, W_RETURN_MISMATCH);
3861 printFromToType (RTYPE(tree), currFunc->type->next);
3862 goto errorTreeReturn;
3865 if (IS_VOID (currFunc->type->next)
3867 !IS_VOID (RTYPE (tree)))
3869 werrorfl (tree->filename, tree->lineno, E_FUNC_VOID);
3870 goto errorTreeReturn;
3873 /* if there is going to be a casing required then add it */
3874 if (compareType (currFunc->type->next, RTYPE (tree)) < 0)
3877 decorateType (newNode (CAST,
3878 newAst_LINK (copyLinkChain (currFunc->type->next)),
3887 if (!IS_VOID (currFunc->type->next) && tree->right == NULL)
3889 werror (W_VOID_FUNC, currFunc->name);
3890 goto errorTreeReturn;
3893 TTYPE (tree) = TETYPE (tree) = NULL;
3896 /*------------------------------------------------------------------*/
3897 /*----------------------------*/
3898 /* switch statement */
3899 /*----------------------------*/
3901 /* the switch value must be an integer */
3902 if (!IS_INTEGRAL (LTYPE (tree)))
3904 werrorfl (tree->filename, tree->lineno, E_SWITCH_NON_INTEGER);
3905 goto errorTreeReturn;
3908 TTYPE (tree) = TETYPE (tree) = NULL;
3911 /*------------------------------------------------------------------*/
3912 /*----------------------------*/
3914 /*----------------------------*/
3916 tree->left = backPatchLabels (tree->left,
3919 TTYPE (tree) = TETYPE (tree) = NULL;
3922 /*------------------------------------------------------------------*/
3923 /*----------------------------*/
3925 /*----------------------------*/
3928 decorateType (resolveSymbols (AST_FOR (tree, initExpr)));
3929 decorateType (resolveSymbols (AST_FOR (tree, condExpr)));
3930 decorateType (resolveSymbols (AST_FOR (tree, loopExpr)));
3932 /* if the for loop is reversible then
3933 reverse it otherwise do what we normally
3939 if (isLoopReversible (tree, &sym, &init, &end))
3940 return reverseLoop (tree, sym, init, end);
3942 return decorateType (createFor (AST_FOR (tree, trueLabel),
3943 AST_FOR (tree, continueLabel),
3944 AST_FOR (tree, falseLabel),
3945 AST_FOR (tree, condLabel),
3946 AST_FOR (tree, initExpr),
3947 AST_FOR (tree, condExpr),
3948 AST_FOR (tree, loopExpr),
3952 TTYPE (tree) = TETYPE (tree) = NULL;
3956 /* some error found this tree will be killed */
3958 TTYPE (tree) = TETYPE (tree) = newCharLink ();
3959 tree->opval.op = NULLOP;
3965 /*-----------------------------------------------------------------*/
3966 /* sizeofOp - processes size of operation */
3967 /*-----------------------------------------------------------------*/
3969 sizeofOp (sym_link * type)
3973 /* make sure the type is complete and sane */
3974 checkTypeSanity(type, "(sizeof)");
3976 /* get the size and convert it to character */
3977 SNPRINTF (buff, sizeof(buff), "%d", getSize (type));
3979 /* now convert into value */
3980 return constVal (buff);
3984 #define IS_AND(ex) (ex->type == EX_OP && ex->opval.op == AND_OP )
3985 #define IS_OR(ex) (ex->type == EX_OP && ex->opval.op == OR_OP )
3986 #define IS_NOT(ex) (ex->type == EX_OP && ex->opval.op == '!' )
3987 #define IS_ANDORNOT(ex) (IS_AND(ex) || IS_OR(ex) || IS_NOT(ex))
3988 #define IS_IFX(ex) (ex->type == EX_OP && ex->opval.op == IFX )
3989 #define IS_LT(ex) (ex->type == EX_OP && ex->opval.op == '<' )
3990 #define IS_GT(ex) (ex->type == EX_OP && ex->opval.op == '>')
3992 /*-----------------------------------------------------------------*/
3993 /* backPatchLabels - change and or not operators to flow control */
3994 /*-----------------------------------------------------------------*/
3996 backPatchLabels (ast * tree, symbol * trueLabel, symbol * falseLabel)
4002 if (!(IS_ANDORNOT (tree)))
4005 /* if this an and */
4008 static int localLbl = 0;
4011 SNPRINTF(buffer, sizeof(buffer), "_andif_%d", localLbl++);
4012 localLabel = newSymbol (buffer, NestLevel);
4014 tree->left = backPatchLabels (tree->left, localLabel, falseLabel);
4016 /* if left is already a IFX then just change the if true label in that */
4017 if (!IS_IFX (tree->left))
4018 tree->left = newIfxNode (tree->left, localLabel, falseLabel);
4020 tree->right = backPatchLabels (tree->right, trueLabel, falseLabel);
4021 /* right is a IFX then just join */
4022 if (IS_IFX (tree->right))
4023 return newNode (NULLOP, tree->left, createLabel (localLabel, tree->right));
4025 tree->right = createLabel (localLabel, tree->right);
4026 tree->right = newIfxNode (tree->right, trueLabel, falseLabel);
4028 return newNode (NULLOP, tree->left, tree->right);
4031 /* if this is an or operation */
4034 static int localLbl = 0;
4037 SNPRINTF(buffer, sizeof(buffer), "_orif_%d", localLbl++);
4038 localLabel = newSymbol (buffer, NestLevel);
4040 tree->left = backPatchLabels (tree->left, trueLabel, localLabel);
4042 /* if left is already a IFX then just change the if true label in that */
4043 if (!IS_IFX (tree->left))
4044 tree->left = newIfxNode (tree->left, trueLabel, localLabel);
4046 tree->right = backPatchLabels (tree->right, trueLabel, falseLabel);
4047 /* right is a IFX then just join */
4048 if (IS_IFX (tree->right))
4049 return newNode (NULLOP, tree->left, createLabel (localLabel, tree->right));
4051 tree->right = createLabel (localLabel, tree->right);
4052 tree->right = newIfxNode (tree->right, trueLabel, falseLabel);
4054 return newNode (NULLOP, tree->left, tree->right);
4060 int wasnot = IS_NOT (tree->left);
4061 tree->left = backPatchLabels (tree->left, falseLabel, trueLabel);
4063 /* if the left is already a IFX */
4064 if (!IS_IFX (tree->left))
4065 tree->left = newNode (IFX, tree->left, NULL);
4069 tree->left->trueLabel = trueLabel;
4070 tree->left->falseLabel = falseLabel;
4074 tree->left->trueLabel = falseLabel;
4075 tree->left->falseLabel = trueLabel;
4082 tree->trueLabel = trueLabel;
4083 tree->falseLabel = falseLabel;
4090 /*-----------------------------------------------------------------*/
4091 /* createBlock - create expression tree for block */
4092 /*-----------------------------------------------------------------*/
4094 createBlock (symbol * decl, ast * body)
4098 /* if the block has nothing */
4102 ex = newNode (BLOCK, NULL, body);
4103 ex->values.sym = decl;
4105 ex->right = ex->right;
4111 /*-----------------------------------------------------------------*/
4112 /* createLabel - creates the expression tree for labels */
4113 /*-----------------------------------------------------------------*/
4115 createLabel (symbol * label, ast * stmnt)
4118 char name[SDCC_NAME_MAX + 1];
4121 /* must create fresh symbol if the symbol name */
4122 /* exists in the symbol table, since there can */
4123 /* be a variable with the same name as the labl */
4124 if ((csym = findSym (SymbolTab, NULL, label->name)) &&
4125 (csym->level == label->level))
4126 label = newSymbol (label->name, label->level);
4128 /* change the name before putting it in add _ */
4129 SNPRINTF(name, sizeof(name), "%s", label->name);
4131 /* put the label in the LabelSymbol table */
4132 /* but first check if a label of the same */
4134 if ((csym = findSym (LabelTab, NULL, name)))
4135 werror (E_DUPLICATE_LABEL, label->name);
4137 addSym (LabelTab, label, name, label->level, 0, 0);
4140 label->key = labelKey++;
4141 rValue = newNode (LABEL, newAst_VALUE (symbolVal (label)), stmnt);
4147 /*-----------------------------------------------------------------*/
4148 /* createCase - generates the parsetree for a case statement */
4149 /*-----------------------------------------------------------------*/
4151 createCase (ast * swStat, ast * caseVal, ast * stmnt)
4153 char caseLbl[SDCC_NAME_MAX + 1];
4157 /* if the switch statement does not exist */
4158 /* then case is out of context */
4161 werrorfl (caseVal->filename, caseVal->lineno, E_CASE_CONTEXT);
4165 caseVal = decorateType (resolveSymbols (caseVal));
4166 /* if not a constant then error */
4167 if (!IS_LITERAL (caseVal->ftype))
4169 werrorfl (caseVal->filename, caseVal->lineno, E_CASE_CONSTANT);
4173 /* if not a integer than error */
4174 if (!IS_INTEGRAL (caseVal->ftype))
4176 werrorfl (caseVal->filename, caseVal->lineno, E_CASE_NON_INTEGER);
4180 /* find the end of the switch values chain */
4181 if (!(val = swStat->values.switchVals.swVals))
4182 swStat->values.switchVals.swVals = caseVal->opval.val;
4185 /* also order the cases according to value */
4187 int cVal = (int) floatFromVal (caseVal->opval.val);
4188 while (val && (int) floatFromVal (val) < cVal)
4194 /* if we reached the end then */
4197 pval->next = caseVal->opval.val;
4199 else if ((int) floatFromVal (val) == cVal)
4201 werrorfl (caseVal->filename, caseVal->lineno, E_DUPLICATE_LABEL,
4207 /* we found a value greater than */
4208 /* the current value we must add this */
4209 /* before the value */
4210 caseVal->opval.val->next = val;
4212 /* if this was the first in chain */
4213 if (swStat->values.switchVals.swVals == val)
4214 swStat->values.switchVals.swVals =
4217 pval->next = caseVal->opval.val;
4222 /* create the case label */
4223 SNPRINTF(caseLbl, sizeof(caseLbl),
4225 swStat->values.switchVals.swNum,
4226 (int) floatFromVal (caseVal->opval.val));
4228 rexpr = createLabel (newSymbol (caseLbl, 0), stmnt);
4233 /*-----------------------------------------------------------------*/
4234 /* createDefault - creates the parse tree for the default statement */
4235 /*-----------------------------------------------------------------*/
4237 createDefault (ast * swStat, ast * defaultVal, ast * stmnt)
4239 char defLbl[SDCC_NAME_MAX + 1];
4241 /* if the switch statement does not exist */
4242 /* then case is out of context */
4245 werrorfl (defaultVal->filename, defaultVal->lineno, E_CASE_CONTEXT);
4249 if (swStat->values.switchVals.swDefault)
4251 werrorfl (defaultVal->filename, defaultVal->lineno, E_DUPLICATE_LABEL,
4256 /* turn on the default flag */
4257 swStat->values.switchVals.swDefault = 1;
4259 /* create the label */
4260 SNPRINTF (defLbl, sizeof(defLbl),
4261 "_default_%d", swStat->values.switchVals.swNum);
4262 return createLabel (newSymbol (defLbl, 0), stmnt);
4265 /*-----------------------------------------------------------------*/
4266 /* createIf - creates the parsetree for the if statement */
4267 /*-----------------------------------------------------------------*/
4269 createIf (ast * condAst, ast * ifBody, ast * elseBody)
4271 static int Lblnum = 0;
4273 symbol *ifTrue, *ifFalse, *ifEnd;
4275 /* if neither exists */
4276 if (!elseBody && !ifBody) {
4277 // if there are no side effects (i++, j() etc)
4278 if (!hasSEFcalls(condAst)) {
4283 /* create the labels */
4284 SNPRINTF (buffer, sizeof(buffer), "_iffalse_%d", Lblnum);
4285 ifFalse = newSymbol (buffer, NestLevel);
4286 /* if no else body then end == false */
4291 SNPRINTF(buffer, sizeof(buffer), "_ifend_%d", Lblnum);
4292 ifEnd = newSymbol (buffer, NestLevel);
4295 SNPRINTF (buffer, sizeof(buffer), "_iftrue_%d", Lblnum);
4296 ifTrue = newSymbol (buffer, NestLevel);
4300 /* attach the ifTrue label to the top of it body */
4301 ifBody = createLabel (ifTrue, ifBody);
4302 /* attach a goto end to the ifBody if else is present */
4305 ifBody = newNode (NULLOP, ifBody,
4307 newAst_VALUE (symbolVal (ifEnd)),
4309 /* put the elseLabel on the else body */
4310 elseBody = createLabel (ifFalse, elseBody);
4311 /* out the end at the end of the body */
4312 elseBody = newNode (NULLOP,
4314 createLabel (ifEnd, NULL));
4318 ifBody = newNode (NULLOP, ifBody,
4319 createLabel (ifFalse, NULL));
4321 condAst = backPatchLabels (condAst, ifTrue, ifFalse);
4322 if (IS_IFX (condAst))
4325 ifTree = newIfxNode (condAst, ifTrue, ifFalse);
4327 return newNode (NULLOP, ifTree,
4328 newNode (NULLOP, ifBody, elseBody));
4332 /*-----------------------------------------------------------------*/
4333 /* createDo - creates parse tree for do */
4336 /* _docontinue_n: */
4337 /* condition_expression +-> trueLabel -> _dobody_n */
4339 /* +-> falseLabel-> _dobreak_n */
4341 /*-----------------------------------------------------------------*/
4343 createDo (symbol * trueLabel, symbol * continueLabel,
4344 symbol * falseLabel, ast * condAst, ast * doBody)
4349 /* if the body does not exist then it is simple */
4352 condAst = backPatchLabels (condAst, continueLabel, NULL);
4353 doTree = (IS_IFX (condAst) ? createLabel (continueLabel, condAst)
4354 : newNode (IFX, createLabel (continueLabel, condAst), NULL));
4355 doTree->trueLabel = continueLabel;
4356 doTree->falseLabel = NULL;
4360 /* otherwise we have a body */
4361 condAst = backPatchLabels (condAst, trueLabel, falseLabel);
4363 /* attach the body label to the top */
4364 doBody = createLabel (trueLabel, doBody);
4365 /* attach the continue label to end of body */
4366 doBody = newNode (NULLOP, doBody,
4367 createLabel (continueLabel, NULL));
4369 /* now put the break label at the end */
4370 if (IS_IFX (condAst))
4373 doTree = newIfxNode (condAst, trueLabel, falseLabel);
4375 doTree = newNode (NULLOP, doTree, createLabel (falseLabel, NULL));
4377 /* putting it together */
4378 return newNode (NULLOP, doBody, doTree);
4381 /*-----------------------------------------------------------------*/
4382 /* createFor - creates parse tree for 'for' statement */
4385 /* condExpr +-> trueLabel -> _forbody_n */
4387 /* +-> falseLabel-> _forbreak_n */
4390 /* _forcontinue_n: */
4392 /* goto _forcond_n ; */
4394 /*-----------------------------------------------------------------*/
4396 createFor (symbol * trueLabel, symbol * continueLabel,
4397 symbol * falseLabel, symbol * condLabel,
4398 ast * initExpr, ast * condExpr, ast * loopExpr,
4403 /* if loopexpression not present then we can generate it */
4404 /* the same way as a while */
4406 return newNode (NULLOP, initExpr,
4407 createWhile (trueLabel, continueLabel,
4408 falseLabel, condExpr, forBody));
4409 /* vanilla for statement */
4410 condExpr = backPatchLabels (condExpr, trueLabel, falseLabel);
4412 if (condExpr && !IS_IFX (condExpr))
4413 condExpr = newIfxNode (condExpr, trueLabel, falseLabel);
4416 /* attach condition label to condition */
4417 condExpr = createLabel (condLabel, condExpr);
4419 /* attach body label to body */
4420 forBody = createLabel (trueLabel, forBody);
4422 /* attach continue to forLoop expression & attach */
4423 /* goto the forcond @ and of loopExpression */
4424 loopExpr = createLabel (continueLabel,
4428 newAst_VALUE (symbolVal (condLabel)),
4430 /* now start putting them together */
4431 forTree = newNode (NULLOP, initExpr, condExpr);
4432 forTree = newNode (NULLOP, forTree, forBody);
4433 forTree = newNode (NULLOP, forTree, loopExpr);
4434 /* finally add the break label */
4435 forTree = newNode (NULLOP, forTree,
4436 createLabel (falseLabel, NULL));
4440 /*-----------------------------------------------------------------*/
4441 /* createWhile - creates parse tree for while statement */
4442 /* the while statement will be created as follows */
4444 /* _while_continue_n: */
4445 /* condition_expression +-> trueLabel -> _while_boby_n */
4447 /* +-> falseLabel -> _while_break_n */
4448 /* _while_body_n: */
4450 /* goto _while_continue_n */
4451 /* _while_break_n: */
4452 /*-----------------------------------------------------------------*/
4454 createWhile (symbol * trueLabel, symbol * continueLabel,
4455 symbol * falseLabel, ast * condExpr, ast * whileBody)
4459 /* put the continue label */
4460 condExpr = backPatchLabels (condExpr, trueLabel, falseLabel);
4461 condExpr = createLabel (continueLabel, condExpr);
4462 condExpr->lineno = 0;
4464 /* put the body label in front of the body */
4465 whileBody = createLabel (trueLabel, whileBody);
4466 whileBody->lineno = 0;
4467 /* put a jump to continue at the end of the body */
4468 /* and put break label at the end of the body */
4469 whileBody = newNode (NULLOP,
4472 newAst_VALUE (symbolVal (continueLabel)),
4473 createLabel (falseLabel, NULL)));
4475 /* put it all together */
4476 if (IS_IFX (condExpr))
4477 whileTree = condExpr;
4480 whileTree = newNode (IFX, condExpr, NULL);
4481 /* put the true & false labels in place */
4482 whileTree->trueLabel = trueLabel;
4483 whileTree->falseLabel = falseLabel;
4486 return newNode (NULLOP, whileTree, whileBody);
4489 /*-----------------------------------------------------------------*/
4490 /* optimizeGetHbit - get highest order bit of the expression */
4491 /*-----------------------------------------------------------------*/
4493 optimizeGetHbit (ast * tree)
4496 /* if this is not a bit and */
4497 if (!IS_BITAND (tree))
4500 /* will look for tree of the form
4501 ( expr >> ((sizeof expr) -1) ) & 1 */
4502 if (!IS_AST_LIT_VALUE (tree->right))
4505 if (AST_LIT_VALUE (tree->right) != 1)
4508 if (!IS_RIGHT_OP (tree->left))
4511 if (!IS_AST_LIT_VALUE (tree->left->right))
4514 if ((i = (int) AST_LIT_VALUE (tree->left->right)) !=
4515 (j = (getSize (TTYPE (tree->left->left)) * 8 - 1)))
4518 /* make sure the port supports GETHBIT */
4519 if (port->hasExtBitOp
4520 && !port->hasExtBitOp(GETHBIT, getSize (TTYPE (tree->left->left))))
4523 return decorateType (newNode (GETHBIT, tree->left->left, NULL));
4527 /*-----------------------------------------------------------------*/
4528 /* optimizeRRCRLC :- optimize for Rotate Left/Right with carry */
4529 /*-----------------------------------------------------------------*/
4531 optimizeRRCRLC (ast * root)
4533 /* will look for trees of the form
4534 (?expr << 1) | (?expr >> 7) or
4535 (?expr >> 7) | (?expr << 1) will make that
4536 into a RLC : operation ..
4538 (?expr >> 1) | (?expr << 7) or
4539 (?expr << 7) | (?expr >> 1) will make that
4540 into a RRC operation
4541 note : by 7 I mean (number of bits required to hold the
4543 /* if the root operations is not a | operation the not */
4544 if (!IS_BITOR (root))
4547 /* I have to think of a better way to match patterns this sucks */
4548 /* that aside let start looking for the first case : I use a the
4549 negative check a lot to improve the efficiency */
4550 /* (?expr << 1) | (?expr >> 7) */
4551 if (IS_LEFT_OP (root->left) &&
4552 IS_RIGHT_OP (root->right))
4555 if (!SPEC_USIGN (TETYPE (root->left->left)))
4558 if (!IS_AST_LIT_VALUE (root->left->right) ||
4559 !IS_AST_LIT_VALUE (root->right->right))
4562 /* make sure it is the same expression */
4563 if (!isAstEqual (root->left->left,
4567 if (AST_LIT_VALUE (root->left->right) != 1)
4570 if (AST_LIT_VALUE (root->right->right) !=
4571 (getSize (TTYPE (root->left->left)) * 8 - 1))
4574 /* make sure the port supports RLC */
4575 if (port->hasExtBitOp
4576 && !port->hasExtBitOp(RLC, getSize (TTYPE (root->left->left))))
4579 /* whew got the first case : create the AST */
4580 return newNode (RLC, root->left->left, NULL);
4584 /* check for second case */
4585 /* (?expr >> 7) | (?expr << 1) */
4586 if (IS_LEFT_OP (root->right) &&
4587 IS_RIGHT_OP (root->left))
4590 if (!SPEC_USIGN (TETYPE (root->left->left)))
4593 if (!IS_AST_LIT_VALUE (root->left->right) ||
4594 !IS_AST_LIT_VALUE (root->right->right))
4597 /* make sure it is the same symbol */
4598 if (!isAstEqual (root->left->left,
4602 if (AST_LIT_VALUE (root->right->right) != 1)
4605 if (AST_LIT_VALUE (root->left->right) !=
4606 (getSize (TTYPE (root->left->left)) * 8 - 1))
4609 /* make sure the port supports RLC */
4610 if (port->hasExtBitOp
4611 && !port->hasExtBitOp(RLC, getSize (TTYPE (root->left->left))))
4614 /* whew got the first case : create the AST */
4615 return newNode (RLC, root->left->left, NULL);
4620 /* third case for RRC */
4621 /* (?symbol >> 1) | (?symbol << 7) */
4622 if (IS_LEFT_OP (root->right) &&
4623 IS_RIGHT_OP (root->left))
4626 if (!SPEC_USIGN (TETYPE (root->left->left)))
4629 if (!IS_AST_LIT_VALUE (root->left->right) ||
4630 !IS_AST_LIT_VALUE (root->right->right))
4633 /* make sure it is the same symbol */
4634 if (!isAstEqual (root->left->left,
4638 if (AST_LIT_VALUE (root->left->right) != 1)
4641 if (AST_LIT_VALUE (root->right->right) !=
4642 (getSize (TTYPE (root->left->left)) * 8 - 1))
4645 /* make sure the port supports RRC */
4646 if (port->hasExtBitOp
4647 && !port->hasExtBitOp(RRC, getSize (TTYPE (root->left->left))))
4650 /* whew got the first case : create the AST */
4651 return newNode (RRC, root->left->left, NULL);
4655 /* fourth and last case for now */
4656 /* (?symbol << 7) | (?symbol >> 1) */
4657 if (IS_RIGHT_OP (root->right) &&
4658 IS_LEFT_OP (root->left))
4661 if (!SPEC_USIGN (TETYPE (root->left->left)))
4664 if (!IS_AST_LIT_VALUE (root->left->right) ||
4665 !IS_AST_LIT_VALUE (root->right->right))
4668 /* make sure it is the same symbol */
4669 if (!isAstEqual (root->left->left,
4673 if (AST_LIT_VALUE (root->right->right) != 1)
4676 if (AST_LIT_VALUE (root->left->right) !=
4677 (getSize (TTYPE (root->left->left)) * 8 - 1))
4680 /* make sure the port supports RRC */
4681 if (port->hasExtBitOp
4682 && !port->hasExtBitOp(RRC, getSize (TTYPE (root->left->left))))
4685 /* whew got the first case : create the AST */
4686 return newNode (RRC, root->left->left, NULL);
4690 /* not found return root */
4694 /*-----------------------------------------------------------------*/
4695 /* optimizeSWAP :- optimize for nibble/byte/word swaps */
4696 /*-----------------------------------------------------------------*/
4698 optimizeSWAP (ast * root)
4700 /* will look for trees of the form
4701 (?expr << 4) | (?expr >> 4) or
4702 (?expr >> 4) | (?expr << 4) will make that
4703 into a SWAP : operation ..
4704 note : by 4 I mean (number of bits required to hold the
4706 /* if the root operations is not a | operation the not */
4707 if (!IS_BITOR (root))
4710 /* (?expr << 4) | (?expr >> 4) */
4711 if ((IS_LEFT_OP (root->left) && IS_RIGHT_OP (root->right))
4712 || (IS_RIGHT_OP (root->left) && IS_LEFT_OP (root->right)))
4715 if (!SPEC_USIGN (TETYPE (root->left->left)))
4718 if (!IS_AST_LIT_VALUE (root->left->right) ||
4719 !IS_AST_LIT_VALUE (root->right->right))
4722 /* make sure it is the same expression */
4723 if (!isAstEqual (root->left->left,
4727 if (AST_LIT_VALUE (root->left->right) !=
4728 (getSize (TTYPE (root->left->left)) * 4))
4731 if (AST_LIT_VALUE (root->right->right) !=
4732 (getSize (TTYPE (root->left->left)) * 4))
4735 /* make sure the port supports SWAP */
4736 if (port->hasExtBitOp
4737 && !port->hasExtBitOp(SWAP, getSize (TTYPE (root->left->left))))
4740 /* found it : create the AST */
4741 return newNode (SWAP, root->left->left, NULL);
4745 /* not found return root */
4749 /*-----------------------------------------------------------------*/
4750 /* optimizeCompare - otimizes compares for bit variables */
4751 /*-----------------------------------------------------------------*/
4753 optimizeCompare (ast * root)
4755 ast *optExpr = NULL;
4758 unsigned int litValue;
4760 /* if nothing then return nothing */
4764 /* if not a compare op then do leaves */
4765 if (!IS_COMPARE_OP (root))
4767 root->left = optimizeCompare (root->left);
4768 root->right = optimizeCompare (root->right);
4772 /* if left & right are the same then depending
4773 of the operation do */
4774 if (isAstEqual (root->left, root->right))
4776 switch (root->opval.op)
4781 optExpr = newAst_VALUE (constVal ("0"));
4786 optExpr = newAst_VALUE (constVal ("1"));
4790 return decorateType (optExpr);
4793 vleft = (root->left->type == EX_VALUE ?
4794 root->left->opval.val : NULL);
4796 vright = (root->right->type == EX_VALUE ?
4797 root->right->opval.val : NULL);
4799 /* if left is a BITVAR in BITSPACE */
4800 /* and right is a LITERAL then opt- */
4801 /* imize else do nothing */
4802 if (vleft && vright &&
4803 IS_BITVAR (vleft->etype) &&
4804 IN_BITSPACE (SPEC_OCLS (vleft->etype)) &&
4805 IS_LITERAL (vright->etype))
4808 /* if right side > 1 then comparison may never succeed */
4809 if ((litValue = (int) floatFromVal (vright)) > 1)
4811 werror (W_BAD_COMPARE);
4817 switch (root->opval.op)
4819 case '>': /* bit value greater than 1 cannot be */
4820 werror (W_BAD_COMPARE);
4824 case '<': /* bit value < 1 means 0 */
4826 optExpr = newNode ('!', newAst_VALUE (vleft), NULL);
4829 case LE_OP: /* bit value <= 1 means no check */
4830 optExpr = newAst_VALUE (vright);
4833 case GE_OP: /* bit value >= 1 means only check for = */
4835 optExpr = newAst_VALUE (vleft);
4840 { /* literal is zero */
4841 switch (root->opval.op)
4843 case '<': /* bit value < 0 cannot be */
4844 werror (W_BAD_COMPARE);
4848 case '>': /* bit value > 0 means 1 */
4850 optExpr = newAst_VALUE (vleft);
4853 case LE_OP: /* bit value <= 0 means no check */
4854 case GE_OP: /* bit value >= 0 means no check */
4855 werror (W_BAD_COMPARE);
4859 case EQ_OP: /* bit == 0 means ! of bit */
4860 optExpr = newNode ('!', newAst_VALUE (vleft), NULL);
4864 return decorateType (resolveSymbols (optExpr));
4865 } /* end-of-if of BITVAR */
4870 /*-----------------------------------------------------------------*/
4871 /* addSymToBlock : adds the symbol to the first block we find */
4872 /*-----------------------------------------------------------------*/
4874 addSymToBlock (symbol * sym, ast * tree)
4876 /* reached end of tree or a leaf */
4877 if (!tree || IS_AST_LINK (tree) || IS_AST_VALUE (tree))
4881 if (IS_AST_OP (tree) &&
4882 tree->opval.op == BLOCK)
4885 symbol *lsym = copySymbol (sym);
4887 lsym->next = AST_VALUES (tree, sym);
4888 AST_VALUES (tree, sym) = lsym;
4892 addSymToBlock (sym, tree->left);
4893 addSymToBlock (sym, tree->right);
4896 /*-----------------------------------------------------------------*/
4897 /* processRegParms - do processing for register parameters */
4898 /*-----------------------------------------------------------------*/
4900 processRegParms (value * args, ast * body)
4904 if (IS_REGPARM (args->etype))
4905 addSymToBlock (args->sym, body);
4910 /*-----------------------------------------------------------------*/
4911 /* resetParmKey - resets the operandkeys for the symbols */
4912 /*-----------------------------------------------------------------*/
4913 DEFSETFUNC (resetParmKey)
4924 /*-----------------------------------------------------------------*/
4925 /* createFunction - This is the key node that calls the iCode for */
4926 /* generating the code for a function. Note code */
4927 /* is generated function by function, later when */
4928 /* add inter-procedural analysis this will change */
4929 /*-----------------------------------------------------------------*/
4931 createFunction (symbol * name, ast * body)
4937 iCode *piCode = NULL;
4939 if (getenv("SDCC_DEBUG_FUNCTION_POINTERS"))
4940 fprintf (stderr, "SDCCast.c:createFunction(%s)\n", name->name);
4942 /* if check function return 0 then some problem */
4943 if (checkFunction (name, NULL) == 0)
4946 /* create a dummy block if none exists */
4948 body = newNode (BLOCK, NULL, NULL);
4952 /* check if the function name already in the symbol table */
4953 if ((csym = findSym (SymbolTab, NULL, name->name)))
4956 /* special case for compiler defined functions
4957 we need to add the name to the publics list : this
4958 actually means we are now compiling the compiler
4962 addSet (&publics, name);
4968 allocVariables (name);
4970 name->lastLine = mylineno;
4973 /* set the stack pointer */
4974 /* PENDING: check this for the mcs51 */
4975 stackPtr = -port->stack.direction * port->stack.call_overhead;
4976 if (IFFUNC_ISISR (name->type))
4977 stackPtr -= port->stack.direction * port->stack.isr_overhead;
4978 if (IFFUNC_ISREENT (name->type) || options.stackAuto)
4979 stackPtr -= port->stack.direction * port->stack.reent_overhead;
4981 xstackPtr = -port->stack.direction * port->stack.call_overhead;
4983 fetype = getSpec (name->type); /* get the specifier for the function */
4984 /* if this is a reentrant function then */
4985 if (IFFUNC_ISREENT (name->type))
4988 allocParms (FUNC_ARGS(name->type)); /* allocate the parameters */
4990 /* do processing for parameters that are passed in registers */
4991 processRegParms (FUNC_ARGS(name->type), body);
4993 /* set the stack pointer */
4997 /* allocate & autoinit the block variables */
4998 processBlockVars (body, &stack, ALLOCATE);
5000 /* save the stack information */
5001 if (options.useXstack)
5002 name->xstack = SPEC_STAK (fetype) = stack;
5004 name->stack = SPEC_STAK (fetype) = stack;
5006 /* name needs to be mangled */
5007 SNPRINTF (name->rname, sizeof(name->rname), "%s%s", port->fun_prefix, name->name);
5009 body = resolveSymbols (body); /* resolve the symbols */
5010 body = decorateType (body); /* propagateType & do semantic checks */
5012 ex = newAst_VALUE (symbolVal (name)); /* create name */
5013 ex = newNode (FUNCTION, ex, body);
5014 ex->values.args = FUNC_ARGS(name->type);
5016 if (options.dump_tree) PA(ex);
5019 werror (E_FUNC_NO_CODE, name->name);
5023 /* create the node & generate intermediate code */
5025 codeOutFile = code->oFile;
5026 piCode = iCodeFromAst (ex);
5030 werror (E_FUNC_NO_CODE, name->name);
5034 eBBlockFromiCode (piCode);
5036 /* if there are any statics then do them */
5039 GcurMemmap = statsg;
5040 codeOutFile = statsg->oFile;
5041 eBBlockFromiCode (iCodeFromAst (decorateType (resolveSymbols (staticAutos))));
5047 /* dealloc the block variables */
5048 processBlockVars (body, &stack, DEALLOCATE);
5049 outputDebugStackSymbols();
5050 /* deallocate paramaters */
5051 deallocParms (FUNC_ARGS(name->type));
5053 if (IFFUNC_ISREENT (name->type))
5056 /* we are done freeup memory & cleanup */
5058 if (port->reset_labelKey) labelKey = 1;
5060 FUNC_HASBODY(name->type) = 1;
5061 addSet (&operKeyReset, name);
5062 applyToSet (operKeyReset, resetParmKey);
5067 cleanUpLevel (LabelTab, 0);
5068 cleanUpBlock (StructTab, 1);
5069 cleanUpBlock (TypedefTab, 1);
5071 xstack->syms = NULL;
5072 istack->syms = NULL;
5077 #define INDENT(x,f) { int i ; fprintf (f, "%d:", tree->lineno); for (i=0;i < x; i++) fprintf(f," "); }
5078 /*-----------------------------------------------------------------*/
5079 /* ast_print : prints the ast (for debugging purposes) */
5080 /*-----------------------------------------------------------------*/
5082 void ast_print (ast * tree, FILE *outfile, int indent)
5087 /* can print only decorated trees */
5088 if (!tree->decorated) return;
5090 /* if any child is an error | this one is an error do nothing */
5091 if (tree->isError ||
5092 (tree->left && tree->left->isError) ||
5093 (tree->right && tree->right->isError)) {
5094 fprintf(outfile,"ERROR_NODE(%p)\n",tree);
5098 /* print the line */
5099 /* if not block & function */
5100 if (tree->type == EX_OP &&
5101 (tree->opval.op != FUNCTION &&
5102 tree->opval.op != BLOCK &&
5103 tree->opval.op != NULLOP)) {
5106 if (tree->opval.op == FUNCTION) {
5108 value *args=FUNC_ARGS(tree->left->opval.val->type);
5109 fprintf(outfile,"FUNCTION (%s=%p) type (",
5110 tree->left->opval.val->name, tree);
5111 printTypeChain (tree->left->opval.val->type->next,outfile);
5112 fprintf(outfile,") args (");
5115 fprintf (outfile, ", ");
5117 printTypeChain (args ? args->type : NULL, outfile);
5119 args= args ? args->next : NULL;
5121 fprintf(outfile,")\n");
5122 ast_print(tree->left,outfile,indent);
5123 ast_print(tree->right,outfile,indent);
5126 if (tree->opval.op == BLOCK) {
5127 symbol *decls = tree->values.sym;
5128 INDENT(indent,outfile);
5129 fprintf(outfile,"{\n");
5131 INDENT(indent+2,outfile);
5132 fprintf(outfile,"DECLARE SYMBOL (%s=%p) type (",
5133 decls->name, decls);
5134 printTypeChain(decls->type,outfile);
5135 fprintf(outfile,")\n");
5137 decls = decls->next;
5139 ast_print(tree->right,outfile,indent+2);
5140 INDENT(indent,outfile);
5141 fprintf(outfile,"}\n");
5144 if (tree->opval.op == NULLOP) {
5145 ast_print(tree->left,outfile,indent);
5146 ast_print(tree->right,outfile,indent);
5149 INDENT(indent,outfile);
5151 /*------------------------------------------------------------------*/
5152 /*----------------------------*/
5153 /* leaf has been reached */
5154 /*----------------------------*/
5155 /* if this is of type value */
5156 /* just get the type */
5157 if (tree->type == EX_VALUE) {
5159 if (IS_LITERAL (tree->opval.val->etype)) {
5160 fprintf(outfile,"CONSTANT (%p) value = ", tree);
5161 if (SPEC_USIGN (tree->opval.val->etype))
5162 fprintf(outfile,"%u", (TYPE_UDWORD) floatFromVal(tree->opval.val));
5164 fprintf(outfile,"%d", (TYPE_DWORD) floatFromVal(tree->opval.val));
5165 fprintf(outfile,", 0x%x, %f", (TYPE_UDWORD) floatFromVal(tree->opval.val),
5166 floatFromVal(tree->opval.val));
5167 } else if (tree->opval.val->sym) {
5168 /* if the undefined flag is set then give error message */
5169 if (tree->opval.val->sym->undefined) {
5170 fprintf(outfile,"UNDEFINED SYMBOL ");
5172 fprintf(outfile,"SYMBOL ");
5174 fprintf(outfile,"(%s=%p)",
5175 tree->opval.val->sym->name,tree);
5178 fprintf(outfile," type (");
5179 printTypeChain(tree->ftype,outfile);
5180 fprintf(outfile,")\n");
5182 fprintf(outfile,"\n");
5187 /* if type link for the case of cast */
5188 if (tree->type == EX_LINK) {
5189 fprintf(outfile,"TYPENODE (%p) type = (",tree);
5190 printTypeChain(tree->opval.lnk,outfile);
5191 fprintf(outfile,")\n");
5196 /* depending on type of operator do */
5198 switch (tree->opval.op) {
5199 /*------------------------------------------------------------------*/
5200 /*----------------------------*/
5202 /*----------------------------*/
5204 fprintf(outfile,"ARRAY_OP (%p) type (",tree);
5205 printTypeChain(tree->ftype,outfile);
5206 fprintf(outfile,")\n");
5207 ast_print(tree->left,outfile,indent+2);
5208 ast_print(tree->right,outfile,indent+2);
5211 /*------------------------------------------------------------------*/
5212 /*----------------------------*/
5214 /*----------------------------*/
5216 fprintf(outfile,"STRUCT_ACCESS (%p) type (",tree);
5217 printTypeChain(tree->ftype,outfile);
5218 fprintf(outfile,")\n");
5219 ast_print(tree->left,outfile,indent+2);
5220 ast_print(tree->right,outfile,indent+2);
5223 /*------------------------------------------------------------------*/
5224 /*----------------------------*/
5225 /* struct/union pointer */
5226 /*----------------------------*/
5228 fprintf(outfile,"PTR_ACCESS (%p) type (",tree);
5229 printTypeChain(tree->ftype,outfile);
5230 fprintf(outfile,")\n");
5231 ast_print(tree->left,outfile,indent+2);
5232 ast_print(tree->right,outfile,indent+2);
5235 /*------------------------------------------------------------------*/
5236 /*----------------------------*/
5237 /* ++/-- operation */
5238 /*----------------------------*/
5241 fprintf(outfile,"post-");
5243 fprintf(outfile,"pre-");
5244 fprintf(outfile,"INC_OP (%p) type (",tree);
5245 printTypeChain(tree->ftype,outfile);
5246 fprintf(outfile,")\n");
5247 ast_print(tree->left,outfile,indent+2); /* postincrement case */
5248 ast_print(tree->right,outfile,indent+2); /* preincrement case */
5253 fprintf(outfile,"post-");
5255 fprintf(outfile,"pre-");
5256 fprintf(outfile,"DEC_OP (%p) type (",tree);
5257 printTypeChain(tree->ftype,outfile);
5258 fprintf(outfile,")\n");
5259 ast_print(tree->left,outfile,indent+2); /* postdecrement case */
5260 ast_print(tree->right,outfile,indent+2); /* predecrement case */
5263 /*------------------------------------------------------------------*/
5264 /*----------------------------*/
5266 /*----------------------------*/
5269 fprintf(outfile,"& (%p) type (",tree);
5270 printTypeChain(tree->ftype,outfile);
5271 fprintf(outfile,")\n");
5272 ast_print(tree->left,outfile,indent+2);
5273 ast_print(tree->right,outfile,indent+2);
5275 fprintf(outfile,"ADDRESS_OF (%p) type (",tree);
5276 printTypeChain(tree->ftype,outfile);
5277 fprintf(outfile,")\n");
5278 ast_print(tree->left,outfile,indent+2);
5279 ast_print(tree->right,outfile,indent+2);
5282 /*----------------------------*/
5284 /*----------------------------*/
5286 fprintf(outfile,"OR (%p) type (",tree);
5287 printTypeChain(tree->ftype,outfile);
5288 fprintf(outfile,")\n");
5289 ast_print(tree->left,outfile,indent+2);
5290 ast_print(tree->right,outfile,indent+2);
5292 /*------------------------------------------------------------------*/
5293 /*----------------------------*/
5295 /*----------------------------*/
5297 fprintf(outfile,"XOR (%p) type (",tree);
5298 printTypeChain(tree->ftype,outfile);
5299 fprintf(outfile,")\n");
5300 ast_print(tree->left,outfile,indent+2);
5301 ast_print(tree->right,outfile,indent+2);
5304 /*------------------------------------------------------------------*/
5305 /*----------------------------*/
5307 /*----------------------------*/
5309 fprintf(outfile,"DIV (%p) type (",tree);
5310 printTypeChain(tree->ftype,outfile);
5311 fprintf(outfile,")\n");
5312 ast_print(tree->left,outfile,indent+2);
5313 ast_print(tree->right,outfile,indent+2);
5315 /*------------------------------------------------------------------*/
5316 /*----------------------------*/
5318 /*----------------------------*/
5320 fprintf(outfile,"MOD (%p) type (",tree);
5321 printTypeChain(tree->ftype,outfile);
5322 fprintf(outfile,")\n");
5323 ast_print(tree->left,outfile,indent+2);
5324 ast_print(tree->right,outfile,indent+2);
5327 /*------------------------------------------------------------------*/
5328 /*----------------------------*/
5329 /* address dereference */
5330 /*----------------------------*/
5331 case '*': /* can be unary : if right is null then unary operation */
5333 fprintf(outfile,"DEREF (%p) type (",tree);
5334 printTypeChain(tree->ftype,outfile);
5335 fprintf(outfile,")\n");
5336 ast_print(tree->left,outfile,indent+2);
5339 /*------------------------------------------------------------------*/
5340 /*----------------------------*/
5341 /* multiplication */
5342 /*----------------------------*/
5343 fprintf(outfile,"MULT (%p) type (",tree);
5344 printTypeChain(tree->ftype,outfile);
5345 fprintf(outfile,")\n");
5346 ast_print(tree->left,outfile,indent+2);
5347 ast_print(tree->right,outfile,indent+2);
5351 /*------------------------------------------------------------------*/
5352 /*----------------------------*/
5353 /* unary '+' operator */
5354 /*----------------------------*/
5358 fprintf(outfile,"UPLUS (%p) type (",tree);
5359 printTypeChain(tree->ftype,outfile);
5360 fprintf(outfile,")\n");
5361 ast_print(tree->left,outfile,indent+2);
5363 /*------------------------------------------------------------------*/
5364 /*----------------------------*/
5366 /*----------------------------*/
5367 fprintf(outfile,"ADD (%p) type (",tree);
5368 printTypeChain(tree->ftype,outfile);
5369 fprintf(outfile,")\n");
5370 ast_print(tree->left,outfile,indent+2);
5371 ast_print(tree->right,outfile,indent+2);
5374 /*------------------------------------------------------------------*/
5375 /*----------------------------*/
5377 /*----------------------------*/
5378 case '-': /* can be unary */
5380 fprintf(outfile,"UMINUS (%p) type (",tree);
5381 printTypeChain(tree->ftype,outfile);
5382 fprintf(outfile,")\n");
5383 ast_print(tree->left,outfile,indent+2);
5385 /*------------------------------------------------------------------*/
5386 /*----------------------------*/
5388 /*----------------------------*/
5389 fprintf(outfile,"SUB (%p) type (",tree);
5390 printTypeChain(tree->ftype,outfile);
5391 fprintf(outfile,")\n");
5392 ast_print(tree->left,outfile,indent+2);
5393 ast_print(tree->right,outfile,indent+2);
5396 /*------------------------------------------------------------------*/
5397 /*----------------------------*/
5399 /*----------------------------*/
5401 fprintf(outfile,"COMPL (%p) type (",tree);
5402 printTypeChain(tree->ftype,outfile);
5403 fprintf(outfile,")\n");
5404 ast_print(tree->left,outfile,indent+2);
5406 /*------------------------------------------------------------------*/
5407 /*----------------------------*/
5409 /*----------------------------*/
5411 fprintf(outfile,"NOT (%p) type (",tree);
5412 printTypeChain(tree->ftype,outfile);
5413 fprintf(outfile,")\n");
5414 ast_print(tree->left,outfile,indent+2);
5416 /*------------------------------------------------------------------*/
5417 /*----------------------------*/
5419 /*----------------------------*/
5421 fprintf(outfile,"RRC (%p) type (",tree);
5422 printTypeChain(tree->ftype,outfile);
5423 fprintf(outfile,")\n");
5424 ast_print(tree->left,outfile,indent+2);
5428 fprintf(outfile,"RLC (%p) type (",tree);
5429 printTypeChain(tree->ftype,outfile);
5430 fprintf(outfile,")\n");
5431 ast_print(tree->left,outfile,indent+2);
5434 fprintf(outfile,"SWAP (%p) type (",tree);
5435 printTypeChain(tree->ftype,outfile);
5436 fprintf(outfile,")\n");
5437 ast_print(tree->left,outfile,indent+2);
5440 fprintf(outfile,"GETHBIT (%p) type (",tree);
5441 printTypeChain(tree->ftype,outfile);
5442 fprintf(outfile,")\n");
5443 ast_print(tree->left,outfile,indent+2);
5446 fprintf(outfile,"LEFT_SHIFT (%p) type (",tree);
5447 printTypeChain(tree->ftype,outfile);
5448 fprintf(outfile,")\n");
5449 ast_print(tree->left,outfile,indent+2);
5450 ast_print(tree->right,outfile,indent+2);
5453 fprintf(outfile,"RIGHT_SHIFT (%p) type (",tree);
5454 printTypeChain(tree->ftype,outfile);
5455 fprintf(outfile,")\n");
5456 ast_print(tree->left,outfile,indent+2);
5457 ast_print(tree->right,outfile,indent+2);
5459 /*------------------------------------------------------------------*/
5460 /*----------------------------*/
5462 /*----------------------------*/
5463 case CAST: /* change the type */
5464 fprintf(outfile,"CAST (%p) from type (",tree);
5465 printTypeChain(tree->right->ftype,outfile);
5466 fprintf(outfile,") to type (");
5467 printTypeChain(tree->ftype,outfile);
5468 fprintf(outfile,")\n");
5469 ast_print(tree->right,outfile,indent+2);
5473 fprintf(outfile,"ANDAND (%p) type (",tree);
5474 printTypeChain(tree->ftype,outfile);
5475 fprintf(outfile,")\n");
5476 ast_print(tree->left,outfile,indent+2);
5477 ast_print(tree->right,outfile,indent+2);
5480 fprintf(outfile,"OROR (%p) type (",tree);
5481 printTypeChain(tree->ftype,outfile);
5482 fprintf(outfile,")\n");
5483 ast_print(tree->left,outfile,indent+2);
5484 ast_print(tree->right,outfile,indent+2);
5487 /*------------------------------------------------------------------*/
5488 /*----------------------------*/
5489 /* comparison operators */
5490 /*----------------------------*/
5492 fprintf(outfile,"GT(>) (%p) type (",tree);
5493 printTypeChain(tree->ftype,outfile);
5494 fprintf(outfile,")\n");
5495 ast_print(tree->left,outfile,indent+2);
5496 ast_print(tree->right,outfile,indent+2);
5499 fprintf(outfile,"LT(<) (%p) type (",tree);
5500 printTypeChain(tree->ftype,outfile);
5501 fprintf(outfile,")\n");
5502 ast_print(tree->left,outfile,indent+2);
5503 ast_print(tree->right,outfile,indent+2);
5506 fprintf(outfile,"LE(<=) (%p) type (",tree);
5507 printTypeChain(tree->ftype,outfile);
5508 fprintf(outfile,")\n");
5509 ast_print(tree->left,outfile,indent+2);
5510 ast_print(tree->right,outfile,indent+2);
5513 fprintf(outfile,"GE(>=) (%p) type (",tree);
5514 printTypeChain(tree->ftype,outfile);
5515 fprintf(outfile,")\n");
5516 ast_print(tree->left,outfile,indent+2);
5517 ast_print(tree->right,outfile,indent+2);
5520 fprintf(outfile,"EQ(==) (%p) type (",tree);
5521 printTypeChain(tree->ftype,outfile);
5522 fprintf(outfile,")\n");
5523 ast_print(tree->left,outfile,indent+2);
5524 ast_print(tree->right,outfile,indent+2);
5527 fprintf(outfile,"NE(!=) (%p) type (",tree);
5528 printTypeChain(tree->ftype,outfile);
5529 fprintf(outfile,")\n");
5530 ast_print(tree->left,outfile,indent+2);
5531 ast_print(tree->right,outfile,indent+2);
5532 /*------------------------------------------------------------------*/
5533 /*----------------------------*/
5535 /*----------------------------*/
5536 case SIZEOF: /* evaluate wihout code generation */
5537 fprintf(outfile,"SIZEOF %d\n",(getSize (tree->right->ftype)));
5540 /*------------------------------------------------------------------*/
5541 /*----------------------------*/
5542 /* conditional operator '?' */
5543 /*----------------------------*/
5545 fprintf(outfile,"QUEST(?) (%p) type (",tree);
5546 printTypeChain(tree->ftype,outfile);
5547 fprintf(outfile,")\n");
5548 ast_print(tree->left,outfile,indent+2);
5549 ast_print(tree->right,outfile,indent+2);
5553 fprintf(outfile,"COLON(:) (%p) type (",tree);
5554 printTypeChain(tree->ftype,outfile);
5555 fprintf(outfile,")\n");
5556 ast_print(tree->left,outfile,indent+2);
5557 ast_print(tree->right,outfile,indent+2);
5560 /*------------------------------------------------------------------*/
5561 /*----------------------------*/
5562 /* assignment operators */
5563 /*----------------------------*/
5565 fprintf(outfile,"MULASS(*=) (%p) type (",tree);
5566 printTypeChain(tree->ftype,outfile);
5567 fprintf(outfile,")\n");
5568 ast_print(tree->left,outfile,indent+2);
5569 ast_print(tree->right,outfile,indent+2);
5572 fprintf(outfile,"DIVASS(/=) (%p) type (",tree);
5573 printTypeChain(tree->ftype,outfile);
5574 fprintf(outfile,")\n");
5575 ast_print(tree->left,outfile,indent+2);
5576 ast_print(tree->right,outfile,indent+2);
5579 fprintf(outfile,"ANDASS(&=) (%p) type (",tree);
5580 printTypeChain(tree->ftype,outfile);
5581 fprintf(outfile,")\n");
5582 ast_print(tree->left,outfile,indent+2);
5583 ast_print(tree->right,outfile,indent+2);
5586 fprintf(outfile,"ORASS(|=) (%p) type (",tree);
5587 printTypeChain(tree->ftype,outfile);
5588 fprintf(outfile,")\n");
5589 ast_print(tree->left,outfile,indent+2);
5590 ast_print(tree->right,outfile,indent+2);
5593 fprintf(outfile,"XORASS(^=) (%p) type (",tree);
5594 printTypeChain(tree->ftype,outfile);
5595 fprintf(outfile,")\n");
5596 ast_print(tree->left,outfile,indent+2);
5597 ast_print(tree->right,outfile,indent+2);
5600 fprintf(outfile,"RSHFTASS(>>=) (%p) type (",tree);
5601 printTypeChain(tree->ftype,outfile);
5602 fprintf(outfile,")\n");
5603 ast_print(tree->left,outfile,indent+2);
5604 ast_print(tree->right,outfile,indent+2);
5607 fprintf(outfile,"LSHFTASS(<<=) (%p) type (",tree);
5608 printTypeChain(tree->ftype,outfile);
5609 fprintf(outfile,")\n");
5610 ast_print(tree->left,outfile,indent+2);
5611 ast_print(tree->right,outfile,indent+2);
5613 /*------------------------------------------------------------------*/
5614 /*----------------------------*/
5616 /*----------------------------*/
5618 fprintf(outfile,"SUBASS(-=) (%p) type (",tree);
5619 printTypeChain(tree->ftype,outfile);
5620 fprintf(outfile,")\n");
5621 ast_print(tree->left,outfile,indent+2);
5622 ast_print(tree->right,outfile,indent+2);
5624 /*------------------------------------------------------------------*/
5625 /*----------------------------*/
5627 /*----------------------------*/
5629 fprintf(outfile,"ADDASS(+=) (%p) type (",tree);
5630 printTypeChain(tree->ftype,outfile);
5631 fprintf(outfile,")\n");
5632 ast_print(tree->left,outfile,indent+2);
5633 ast_print(tree->right,outfile,indent+2);
5635 /*------------------------------------------------------------------*/
5636 /*----------------------------*/
5637 /* straight assignemnt */
5638 /*----------------------------*/
5640 fprintf(outfile,"ASSIGN(=) (%p) type (",tree);
5641 printTypeChain(tree->ftype,outfile);
5642 fprintf(outfile,")\n");
5643 ast_print(tree->left,outfile,indent+2);
5644 ast_print(tree->right,outfile,indent+2);
5646 /*------------------------------------------------------------------*/
5647 /*----------------------------*/
5648 /* comma operator */
5649 /*----------------------------*/
5651 fprintf(outfile,"COMMA(,) (%p) type (",tree);
5652 printTypeChain(tree->ftype,outfile);
5653 fprintf(outfile,")\n");
5654 ast_print(tree->left,outfile,indent+2);
5655 ast_print(tree->right,outfile,indent+2);
5657 /*------------------------------------------------------------------*/
5658 /*----------------------------*/
5660 /*----------------------------*/
5663 fprintf(outfile,"CALL (%p) type (",tree);
5664 printTypeChain(tree->ftype,outfile);
5665 fprintf(outfile,")\n");
5666 ast_print(tree->left,outfile,indent+2);
5667 ast_print(tree->right,outfile,indent+2);
5670 fprintf(outfile,"PARMS\n");
5671 ast_print(tree->left,outfile,indent+2);
5672 if (tree->right /*&& !IS_AST_PARAM(tree->right)*/) {
5673 ast_print(tree->right,outfile,indent+2);
5676 /*------------------------------------------------------------------*/
5677 /*----------------------------*/
5678 /* return statement */
5679 /*----------------------------*/
5681 fprintf(outfile,"RETURN (%p) type (",tree);
5683 printTypeChain(tree->right->ftype,outfile);
5685 fprintf(outfile,")\n");
5686 ast_print(tree->right,outfile,indent+2);
5688 /*------------------------------------------------------------------*/
5689 /*----------------------------*/
5690 /* label statement */
5691 /*----------------------------*/
5693 fprintf(outfile,"LABEL (%p)\n",tree);
5694 ast_print(tree->left,outfile,indent+2);
5695 ast_print(tree->right,outfile,indent);
5697 /*------------------------------------------------------------------*/
5698 /*----------------------------*/
5699 /* switch statement */
5700 /*----------------------------*/
5704 fprintf(outfile,"SWITCH (%p) ",tree);
5705 ast_print(tree->left,outfile,0);
5706 for (val = tree->values.switchVals.swVals; val ; val = val->next) {
5707 INDENT(indent+2,outfile);
5708 fprintf(outfile,"CASE 0x%x GOTO _case_%d_%d\n",
5709 (int) floatFromVal(val),
5710 tree->values.switchVals.swNum,
5711 (int) floatFromVal(val));
5713 ast_print(tree->right,outfile,indent);
5716 /*------------------------------------------------------------------*/
5717 /*----------------------------*/
5719 /*----------------------------*/
5721 fprintf(outfile,"IF (%p) \n",tree);
5722 ast_print(tree->left,outfile,indent+2);
5723 if (tree->trueLabel) {
5724 INDENT(indent+2,outfile);
5725 fprintf(outfile,"NE(!=) 0 goto %s\n",tree->trueLabel->name);
5727 if (tree->falseLabel) {
5728 INDENT(indent+2,outfile);
5729 fprintf(outfile,"EQ(==) 0 goto %s\n",tree->falseLabel->name);
5731 ast_print(tree->right,outfile,indent+2);
5733 /*----------------------------*/
5734 /* goto Statement */
5735 /*----------------------------*/
5737 fprintf(outfile,"GOTO (%p) \n",tree);
5738 ast_print(tree->left,outfile,indent+2);
5739 fprintf(outfile,"\n");
5741 /*------------------------------------------------------------------*/
5742 /*----------------------------*/
5744 /*----------------------------*/
5746 fprintf(outfile,"FOR (%p) \n",tree);
5747 if (AST_FOR( tree, initExpr)) {
5748 INDENT(indent+2,outfile);
5749 fprintf(outfile,"INIT EXPR ");
5750 ast_print(AST_FOR(tree, initExpr),outfile,indent+2);
5752 if (AST_FOR( tree, condExpr)) {
5753 INDENT(indent+2,outfile);
5754 fprintf(outfile,"COND EXPR ");
5755 ast_print(AST_FOR(tree, condExpr),outfile,indent+2);
5757 if (AST_FOR( tree, loopExpr)) {
5758 INDENT(indent+2,outfile);
5759 fprintf(outfile,"LOOP EXPR ");
5760 ast_print(AST_FOR(tree, loopExpr),outfile,indent+2);
5762 fprintf(outfile,"FOR LOOP BODY \n");
5763 ast_print(tree->left,outfile,indent+2);
5766 fprintf(outfile,"CRITICAL (%p) \n",tree);
5767 ast_print(tree->left,outfile,indent+2);
5775 ast_print(t,stdout,0);
5780 /*-----------------------------------------------------------------*/
5781 /* astErrors : returns non-zero if errors present in tree */
5782 /*-----------------------------------------------------------------*/
5783 int astErrors(ast *t)
5792 if (t->type == EX_VALUE
5793 && t->opval.val->sym
5794 && t->opval.val->sym->undefined)
5797 errors += astErrors(t->left);
5798 errors += astErrors(t->right);