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 -------------------------------------------------------------------------*/
25 #define DEBUG_CF(x) /* puts(x); */
31 set *operKeyReset = NULL;
32 ast *staticAutos = NULL;
35 #define LRVAL(x) x->left->rvalue
36 #define RRVAL(x) x->right->rvalue
37 #define TRVAL(x) x->rvalue
38 #define LLVAL(x) x->left->lvalue
39 #define RLVAL(x) x->right->lvalue
40 #define TLVAL(x) x->lvalue
41 #define RTYPE(x) x->right->ftype
42 #define RETYPE(x) x->right->etype
43 #define LTYPE(x) x->left->ftype
44 #define LETYPE(x) x->left->etype
45 #define TTYPE(x) x->ftype
46 #define TETYPE(x) x->etype
52 symbol *currFunc=NULL;
53 static ast *createIval (ast *, sym_link *, initList *, ast *, ast *);
54 static ast *createIvalCharPtr (ast *, sym_link *, ast *, ast *);
55 static ast *optimizeCompare (ast *);
56 ast *optimizeRRCRLC (ast *);
57 ast *optimizeSWAP (ast *);
58 ast *optimizeGetHbit (ast *, RESULT_TYPE);
59 ast *optimizeGetAbit (ast *, RESULT_TYPE);
60 ast *optimizeGetByte (ast *, RESULT_TYPE);
61 ast *optimizeGetWord (ast *, RESULT_TYPE);
62 static ast *backPatchLabels (ast *, symbol *, symbol *);
65 memmap *GcurMemmap=NULL; /* points to the memmap that's currently active */
70 printTypeChain (tree->ftype, stdout);
75 /*-----------------------------------------------------------------*/
76 /* newAst - creates a fresh node for an expression tree */
77 /*-----------------------------------------------------------------*/
79 newAst_ (unsigned type)
82 static int oldLineno = 0;
84 ex = Safe_alloc ( sizeof (ast));
87 ex->lineno = (noLineno ? oldLineno : mylineno);
88 ex->filename = currFname;
89 ex->level = NestLevel;
90 ex->block = currBlockno;
91 ex->initMode = inInitMode;
92 ex->seqPoint = seqPointNo;
97 newAst_VALUE (value * val)
99 ast *ex = newAst_ (EX_VALUE);
105 newAst_OP (unsigned op)
107 ast *ex = newAst_ (EX_OP);
113 newAst_LINK (sym_link * val)
115 ast *ex = newAst_ (EX_LINK);
120 /*-----------------------------------------------------------------*/
121 /* newNode - creates a new node */
122 /*-----------------------------------------------------------------*/
124 newNode (long op, ast * left, ast * right)
135 /*-----------------------------------------------------------------*/
136 /* newIfxNode - creates a new Ifx Node */
137 /*-----------------------------------------------------------------*/
139 newIfxNode (ast * condAst, symbol * trueLabel, symbol * falseLabel)
143 /* if this is a literal then we already know the result */
144 if (condAst->etype && IS_LITERAL (condAst->etype))
146 /* then depending on the expression value */
147 if (floatFromVal (condAst->opval.val))
148 ifxNode = newNode (GOTO,
149 newAst_VALUE (symbolVal (trueLabel)),
152 ifxNode = newNode (GOTO,
153 newAst_VALUE (symbolVal (falseLabel)),
158 ifxNode = newNode (IFX, condAst, NULL);
159 ifxNode->trueLabel = trueLabel;
160 ifxNode->falseLabel = falseLabel;
166 /*-----------------------------------------------------------------*/
167 /* copyAstValues - copies value portion of ast if needed */
168 /*-----------------------------------------------------------------*/
170 copyAstValues (ast * dest, ast * src)
172 switch (src->opval.op)
175 dest->values.sym = copySymbolChain (src->values.sym);
179 dest->values.switchVals.swVals =
180 copyValue (src->values.switchVals.swVals);
181 dest->values.switchVals.swDefault =
182 src->values.switchVals.swDefault;
183 dest->values.switchVals.swNum =
184 src->values.switchVals.swNum;
188 dest->values.inlineasm = Safe_strdup(src->values.inlineasm);
192 dest->values.constlist = copyLiteralList(src->values.constlist);
196 AST_FOR (dest, trueLabel) = copySymbol (AST_FOR (src, trueLabel));
197 AST_FOR (dest, continueLabel) = copySymbol (AST_FOR (src, continueLabel));
198 AST_FOR (dest, falseLabel) = copySymbol (AST_FOR (src, falseLabel));
199 AST_FOR (dest, condLabel) = copySymbol (AST_FOR (src, condLabel));
200 AST_FOR (dest, initExpr) = copyAst (AST_FOR (src, initExpr));
201 AST_FOR (dest, condExpr) = copyAst (AST_FOR (src, condExpr));
202 AST_FOR (dest, loopExpr) = copyAst (AST_FOR (src, loopExpr));
207 /*-----------------------------------------------------------------*/
208 /* copyAst - makes a copy of a given astession */
209 /*-----------------------------------------------------------------*/
218 dest = Safe_alloc ( sizeof (ast));
220 dest->type = src->type;
221 dest->lineno = src->lineno;
222 dest->level = src->level;
223 dest->funcName = src->funcName;
224 dest->reversed = src->reversed;
227 dest->etype = getSpec (dest->ftype = copyLinkChain (src->ftype));
229 /* if this is a leaf */
231 if (src->type == EX_VALUE)
233 dest->opval.val = copyValue (src->opval.val);
238 if (src->type == EX_LINK)
240 dest->opval.lnk = copyLinkChain (src->opval.lnk);
244 dest->opval.op = src->opval.op;
246 /* if this is a node that has special values */
247 copyAstValues (dest, src);
249 dest->trueLabel = copySymbol (src->trueLabel);
250 dest->falseLabel = copySymbol (src->falseLabel);
251 dest->left = copyAst (src->left);
252 dest->right = copyAst (src->right);
258 /*-----------------------------------------------------------------*/
259 /* removeIncDecOps: remove for side effects in *_ASSIGN's */
260 /* "*s++ += 3" -> "*s++ = *s++ + 3" */
261 /*-----------------------------------------------------------------*/
262 ast *removeIncDecOps (ast * tree) {
264 // traverse the tree and remove inc/dec ops
269 if (tree->type == EX_OP &&
270 (tree->opval.op == INC_OP || tree->opval.op == DEC_OP)) {
277 tree->left=removeIncDecOps(tree->left);
278 tree->right=removeIncDecOps(tree->right);
283 /*-----------------------------------------------------------------*/
284 /* removePreIncDecOps: remove for side effects in *_ASSIGN's */
285 /* "*++s += 3" -> "*++s = *++s + 3" */
286 /*-----------------------------------------------------------------*/
287 ast *removePreIncDecOps (ast * tree) {
289 // traverse the tree and remove pre-inc/dec ops
294 if (tree->type == EX_OP &&
295 (tree->opval.op == INC_OP || tree->opval.op == DEC_OP)) {
300 tree->left=removePreIncDecOps(tree->left);
301 tree->right=removePreIncDecOps(tree->right);
306 /*-----------------------------------------------------------------*/
307 /* removePostIncDecOps: remove for side effects in *_ASSIGN's */
308 /* "*s++ += 3" -> "*s++ = *s++ + 3" */
309 /*-----------------------------------------------------------------*/
310 ast *removePostIncDecOps (ast * tree) {
312 // traverse the tree and remove pre-inc/dec ops
317 if (tree->type == EX_OP &&
318 (tree->opval.op == INC_OP || tree->opval.op == DEC_OP)) {
323 tree->left=removePostIncDecOps(tree->left);
324 tree->right=removePostIncDecOps(tree->right);
329 /*-----------------------------------------------------------------*/
330 /* hasSEFcalls - returns TRUE if tree has a function call */
331 /*-----------------------------------------------------------------*/
333 hasSEFcalls (ast * tree)
338 if (tree->type == EX_OP &&
339 (tree->opval.op == CALL ||
340 tree->opval.op == PCALL ||
341 tree->opval.op == '=' ||
342 tree->opval.op == INC_OP ||
343 tree->opval.op == DEC_OP))
346 return (hasSEFcalls (tree->left) |
347 hasSEFcalls (tree->right));
350 /*-----------------------------------------------------------------*/
351 /* isAstEqual - compares two asts & returns 1 if they are equal */
352 /*-----------------------------------------------------------------*/
354 isAstEqual (ast * t1, ast * t2)
363 if (t1->type != t2->type)
369 if (t1->opval.op != t2->opval.op)
371 return (isAstEqual (t1->left, t2->left) &&
372 isAstEqual (t1->right, t2->right));
376 if (t1->opval.val->sym)
378 if (!t2->opval.val->sym)
381 return isSymbolEqual (t1->opval.val->sym,
386 if (t2->opval.val->sym)
389 return (floatFromVal (t1->opval.val) ==
390 floatFromVal (t2->opval.val));
394 /* only compare these two types */
402 /*-----------------------------------------------------------------*/
403 /* resolveSymbols - resolve symbols from the symbol table */
404 /*-----------------------------------------------------------------*/
406 resolveSymbols (ast * tree)
408 /* walk the entire tree and check for values */
409 /* with symbols if we find one then replace */
410 /* symbol with that from the symbol table */
417 /* if not block & function */
418 if (tree->type == EX_OP &&
419 (tree->opval.op != FUNCTION &&
420 tree->opval.op != BLOCK &&
421 tree->opval.op != NULLOP))
423 filename = tree->filename;
424 lineno = tree->lineno;
428 /* make sure we resolve the true & false labels for ifx */
429 if (tree->type == EX_OP && tree->opval.op == IFX)
435 if ((csym = findSym (LabelTab, tree->trueLabel,
436 tree->trueLabel->name)))
437 tree->trueLabel = csym;
439 werrorfl (tree->filename, tree->lineno, E_LABEL_UNDEF,
440 tree->trueLabel->name);
443 if (tree->falseLabel)
445 if ((csym = findSym (LabelTab,
447 tree->falseLabel->name)))
448 tree->falseLabel = csym;
450 werrorfl (tree->filename, tree->lineno, E_LABEL_UNDEF,
451 tree->falseLabel->name);
456 /* if this is a label resolve it from the labelTab */
457 if (IS_AST_VALUE (tree) &&
458 tree->opval.val->sym &&
459 tree->opval.val->sym->islbl)
462 symbol *csym = findSym (LabelTab, tree->opval.val->sym,
463 tree->opval.val->sym->name);
466 werrorfl (tree->filename, tree->lineno, E_LABEL_UNDEF,
467 tree->opval.val->sym->name);
469 tree->opval.val->sym = csym;
471 goto resolveChildren;
474 /* do only for leafs */
475 if (IS_AST_VALUE (tree) &&
476 tree->opval.val->sym &&
477 !tree->opval.val->sym->implicit)
480 symbol *csym = findSymWithLevel (SymbolTab, tree->opval.val->sym);
482 /* if found in the symbol table & they r not the same */
483 if (csym && tree->opval.val->sym != csym)
485 tree->opval.val->sym = csym;
486 tree->opval.val->type = csym->type;
487 tree->opval.val->etype = csym->etype;
490 /* if not found in the symbol table */
491 /* mark it as undefined assume it is */
492 /* an integer in data space */
493 if (!csym && !tree->opval.val->sym->implicit)
496 /* if this is a function name then */
497 /* mark it as returning an int */
500 tree->opval.val->sym->type = newLink (DECLARATOR);
501 DCL_TYPE (tree->opval.val->sym->type) = FUNCTION;
502 tree->opval.val->sym->type->next =
503 tree->opval.val->sym->etype = newIntLink ();
504 tree->opval.val->etype = tree->opval.val->etype;
505 tree->opval.val->type = tree->opval.val->sym->type;
506 werrorfl (tree->filename, tree->lineno, W_IMPLICIT_FUNC,
507 tree->opval.val->sym->name);
508 //tree->opval.val->sym->undefined = 1;
509 allocVariables (tree->opval.val->sym);
513 tree->opval.val->sym->undefined = 1;
514 tree->opval.val->type =
515 tree->opval.val->etype = newIntLink ();
516 tree->opval.val->sym->type =
517 tree->opval.val->sym->etype = newIntLink ();
523 resolveSymbols (tree->left);
524 resolveSymbols (tree->right);
529 /*-----------------------------------------------------------------*/
530 /* setAstLineno - walks a ast tree & sets the line number */
531 /*-----------------------------------------------------------------*/
532 int setAstLineno (ast * tree, int lineno)
537 tree->lineno = lineno;
538 setAstLineno (tree->left, lineno);
539 setAstLineno (tree->right, lineno);
543 /*-----------------------------------------------------------------*/
544 /* funcOfType :- function of type with name */
545 /*-----------------------------------------------------------------*/
547 funcOfType (char *name, sym_link * type, sym_link * argType,
551 /* create the symbol */
552 sym = newSymbol (name, 0);
554 /* setup return value */
555 sym->type = newLink (DECLARATOR);
556 DCL_TYPE (sym->type) = FUNCTION;
557 sym->type->next = copyLinkChain (type);
558 sym->etype = getSpec (sym->type);
559 FUNC_ISREENT(sym->type) = rent ? 1 : 0;
561 /* if arguments required */
565 args = FUNC_ARGS(sym->type) = newValue ();
569 args->type = copyLinkChain (argType);
570 args->etype = getSpec (args->type);
571 SPEC_EXTR(args->etype)=1;
574 args = args->next = newValue ();
581 allocVariables (sym);
586 /*-----------------------------------------------------------------*/
587 /* funcOfTypeVarg :- function of type with name and argtype */
588 /*-----------------------------------------------------------------*/
590 funcOfTypeVarg (char *name, char * rtype, int nArgs , char **atypes)
595 /* create the symbol */
596 sym = newSymbol (name, 0);
598 /* setup return value */
599 sym->type = newLink (DECLARATOR);
600 DCL_TYPE (sym->type) = FUNCTION;
601 sym->type->next = typeFromStr(rtype);
602 sym->etype = getSpec (sym->type);
604 /* if arguments required */
607 args = FUNC_ARGS(sym->type) = newValue ();
609 for ( i = 0 ; i < nArgs ; i++ ) {
610 args->type = typeFromStr(atypes[i]);
611 args->etype = getSpec (args->type);
612 SPEC_EXTR(args->etype)=1;
613 if ((i + 1) == nArgs) break;
614 args = args->next = newValue ();
621 allocVariables (sym);
626 /*-----------------------------------------------------------------*/
627 /* reverseParms - will reverse a parameter tree */
628 /*-----------------------------------------------------------------*/
630 reverseParms (ast * ptree)
636 /* top down if we find a nonParm tree then quit */
637 if (ptree->type == EX_OP && ptree->opval.op == PARAM && !ptree->reversed)
639 /* The various functions expect the parameter tree to be right heavy. */
640 /* Rotate the tree to be left heavy so that after reversal it is */
641 /* right heavy again. */
642 while ((ttree = ptree->right) && ttree->type == EX_OP &&
643 ttree->opval.op == PARAM)
645 ptree->right = ttree->right;
646 ttree->right = ttree->left;
647 ttree->left = ptree->left;
653 ptree->left = ptree->right;
654 ptree->right = ttree;
656 reverseParms (ptree->left);
657 reverseParms (ptree->right);
663 /*-----------------------------------------------------------------*/
664 /* processParms - makes sure the parameters are okay and do some */
665 /* processing with them */
666 /*-----------------------------------------------------------------*/
668 processParms (ast *func,
671 int *parmNumber, /* unused, although updated */
674 RESULT_TYPE resultType;
677 /* if none of them exist */
678 if (!defParm && !*actParm)
683 if (getenv("DEBUG_SANITY"))
685 fprintf (stderr, "processParms: %s ", defParm->name);
687 /* make sure the type is complete and sane */
688 checkTypeSanity(defParm->etype, defParm->name);
691 if (IS_CODEPTR (func->ftype))
692 functype = func->ftype->next;
694 functype = func->ftype;
696 /* if the function is being called via a pointer & */
697 /* it has not been defined a reentrant then we cannot */
698 /* have parameters */
699 /* PIC16 port can... */
700 if (!TARGET_IS_PIC16)
702 if (func->type != EX_VALUE && !IFFUNC_ISREENT (functype) && !options.stackAuto)
704 werror (W_NONRENT_ARGS);
710 /* if defined parameters ended but actual parameters */
711 /* exist and this is not defined as a variable arg */
712 if (!defParm && *actParm && !IFFUNC_HASVARARGS(functype))
714 werror (E_TOO_MANY_PARMS);
718 /* if defined parameters present but no actual parameters */
719 if (defParm && !*actParm)
721 werror (E_TOO_FEW_PARMS);
725 /* if this is a PARAM node then match left & right */
726 if ((*actParm)->type == EX_OP && (*actParm)->opval.op == PARAM)
728 (*actParm)->decorated = 1;
729 return (processParms (func, defParm,
730 &(*actParm)->left, parmNumber, FALSE) ||
731 processParms (func, defParm ? defParm->next : NULL,
732 &(*actParm)->right, parmNumber, rightmost));
734 else if (defParm) /* not vararg */
736 /* If we have found a value node by following only right-hand links,
737 * then we know that there are no more values after us.
739 * Therefore, if there are more defined parameters, the caller didn't
742 if (rightmost && defParm->next)
744 werror (E_TOO_FEW_PARMS);
749 /* decorate parameter */
750 resultType = defParm ? getResultTypeFromType (defParm->etype) :
752 *actParm = decorateType (*actParm, resultType);
754 if (IS_VOID((*actParm)->ftype))
756 werror (E_VOID_VALUE_USED);
760 /* If this is a varargs function... */
761 if (!defParm && *actParm && IFFUNC_HASVARARGS(functype))
766 if (IS_CAST_OP (*actParm)
767 || (IS_AST_LIT_VALUE (*actParm) && (*actParm)->values.literalFromCast))
769 /* Parameter was explicitly typecast; don't touch it. */
773 ftype = (*actParm)->ftype;
775 /* If it's a char, upcast to int. */
776 if (IS_INTEGRAL (ftype)
777 && (getSize (ftype) < (unsigned) INTSIZE))
779 newType = newAst_LINK(INTTYPE);
782 if (IS_PTR(ftype) && !IS_GENPTR(ftype))
784 newType = newAst_LINK (copyLinkChain(ftype));
785 DCL_TYPE (newType->opval.lnk) = port->unqualified_pointer;
788 if (IS_AGGREGATE (ftype))
790 newType = newAst_LINK (copyLinkChain (ftype));
791 DCL_TYPE (newType->opval.lnk) = port->unqualified_pointer;
796 /* cast required; change this op to a cast. */
797 (*actParm)->decorated = 0;
798 *actParm = newNode (CAST, newType, *actParm);
799 (*actParm)->lineno = (*actParm)->right->lineno;
801 decorateType (*actParm, RESULT_TYPE_NONE);
806 /* if defined parameters ended but actual has not & */
808 if (!defParm && *actParm &&
809 (options.stackAuto || IFFUNC_ISREENT (functype)))
812 resolveSymbols (*actParm);
814 /* the parameter type must be at least castable */
815 if (compareType (defParm->type, (*actParm)->ftype) == 0)
817 werror (E_INCOMPAT_TYPES);
818 printFromToType ((*actParm)->ftype, defParm->type);
822 /* if the parameter is castable then add the cast */
823 if (compareType (defParm->type, (*actParm)->ftype) < 0)
827 resultType = getResultTypeFromType (defParm->etype);
828 pTree = resolveSymbols (copyAst (*actParm));
830 /* now change the current one to a cast */
831 (*actParm)->type = EX_OP;
832 (*actParm)->opval.op = CAST;
833 (*actParm)->left = newAst_LINK (defParm->type);
834 (*actParm)->right = pTree;
835 (*actParm)->decorated = 0; /* force typechecking */
836 decorateType (*actParm, resultType);
839 /* make a copy and change the regparm type to the defined parm */
840 (*actParm)->etype = getSpec ((*actParm)->ftype = copyLinkChain ((*actParm)->ftype));
841 SPEC_REGPARM ((*actParm)->etype) = SPEC_REGPARM (defParm->etype);
842 SPEC_ARGREG ((*actParm)->etype) = SPEC_ARGREG (defParm->etype);
847 /*-----------------------------------------------------------------*/
848 /* createIvalType - generates ival for basic types */
849 /*-----------------------------------------------------------------*/
851 createIvalType (ast * sym, sym_link * type, initList * ilist)
855 /* if initList is deep */
856 if (ilist->type == INIT_DEEP)
857 ilist = ilist->init.deep;
859 iExpr = decorateType (resolveSymbols (list2expr (ilist)), RESULT_TYPE_NONE);
860 return decorateType (newNode ('=', sym, iExpr), RESULT_TYPE_NONE);
863 /*-----------------------------------------------------------------*/
864 /* createIvalStruct - generates initial value for structures */
865 /*-----------------------------------------------------------------*/
867 createIvalStruct (ast * sym, sym_link * type, initList * ilist, ast *rootValue)
874 sflds = SPEC_STRUCT (type)->fields;
875 if (ilist->type != INIT_DEEP)
877 werror (E_INIT_STRUCT, "");
881 iloop = ilist->init.deep;
883 for (; sflds; sflds = sflds->next, iloop = (iloop ? iloop->next : NULL))
885 /* if we have come to end */
889 lAst = newNode (PTR_OP, newNode ('&', sym, NULL), newAst_VALUE (symbolVal (sflds)));
890 lAst = decorateType (resolveSymbols (lAst), RESULT_TYPE_NONE);
891 rast = decorateType (resolveSymbols (createIval (lAst, sflds->type,
892 iloop, rast, rootValue)),
898 werrorfl (sym->opval.val->sym->fileDef, sym->opval.val->sym->lineDef,
899 W_EXCESS_INITIALIZERS, "struct",
900 sym->opval.val->sym->name);
907 /*-----------------------------------------------------------------*/
908 /* createIvalArray - generates code for array initialization */
909 /*-----------------------------------------------------------------*/
911 createIvalArray (ast * sym, sym_link * type, initList * ilist, ast *rootValue)
915 int lcnt = 0, size = 0;
916 literalList *literalL;
918 /* take care of the special case */
919 /* array of characters can be init */
921 if (IS_CHAR (type->next))
922 if ((rast = createIvalCharPtr (sym,
924 decorateType (resolveSymbols (list2expr (ilist)), RESULT_TYPE_NONE),
927 return decorateType (resolveSymbols (rast), RESULT_TYPE_NONE);
929 /* not the special case */
930 if (ilist->type != INIT_DEEP)
932 werror (E_INIT_STRUCT, "");
936 iloop = ilist->init.deep;
937 lcnt = DCL_ELEM (type);
939 if (port->arrayInitializerSuppported && convertIListToConstList(ilist, &literalL))
943 aSym = decorateType (resolveSymbols(sym), RESULT_TYPE_NONE);
945 rast = newNode(ARRAYINIT, aSym, NULL);
946 rast->values.constlist = literalL;
948 // Make sure size is set to length of initializer list.
955 if (lcnt && size > lcnt)
957 // Array size was specified, and we have more initializers than needed.
958 char *name=sym->opval.val->sym->name;
959 int lineno=sym->opval.val->sym->lineDef;
960 char *filename=sym->opval.val->sym->fileDef;
962 werrorfl (filename, lineno, W_EXCESS_INITIALIZERS, "array", name);
971 aSym = newNode ('[', sym, newAst_VALUE (valueFromLit ((float) (size++))));
972 aSym = decorateType (resolveSymbols (aSym), RESULT_TYPE_NONE);
973 rast = createIval (aSym, type->next, iloop, rast, rootValue);
974 iloop = (iloop ? iloop->next : NULL);
980 /* no of elements given and we */
981 /* have generated for all of them */
984 // is this a better way? at least it won't crash
985 char *name = (IS_AST_SYM_VALUE(sym)) ? AST_SYMBOL(sym)->name : "";
986 int lineno = iloop->lineno;
987 char *filename = iloop->filename;
988 werrorfl (filename, lineno, W_EXCESS_INITIALIZERS, "array", name);
995 /* if we have not been given a size */
996 if (!DCL_ELEM (type))
998 /* check, if it's a flexible array */
999 if (IS_STRUCT (AST_VALUE (rootValue)->type))
1000 AST_SYMBOL(rootValue)->flexArrayLength = size * getSize (type->next);
1002 DCL_ELEM (type) = size;
1005 return decorateType (resolveSymbols (rast), RESULT_TYPE_NONE);
1009 /*-----------------------------------------------------------------*/
1010 /* createIvalCharPtr - generates initial values for char pointers */
1011 /*-----------------------------------------------------------------*/
1013 createIvalCharPtr (ast * sym, sym_link * type, ast * iexpr, ast *rootVal)
1018 /* if this is a pointer & right is a literal array then */
1019 /* just assignment will do */
1020 if (IS_PTR (type) && ((IS_LITERAL (iexpr->etype) ||
1021 SPEC_SCLS (iexpr->etype) == S_CODE)
1022 && IS_ARRAY (iexpr->ftype)))
1023 return newNode ('=', sym, iexpr);
1025 /* left side is an array so we have to assign each */
1027 if ((IS_LITERAL (iexpr->etype) ||
1028 SPEC_SCLS (iexpr->etype) == S_CODE)
1029 && IS_ARRAY (iexpr->ftype))
1031 /* for each character generate an assignment */
1032 /* to the array element */
1033 char *s = SPEC_CVAL (iexpr->etype).v_char;
1035 unsigned int symsize = getSize (type);
1037 size = getSize (iexpr->ftype);
1038 if (symsize && size>symsize)
1040 if (size>(symsize+1))
1042 char *name = (IS_AST_SYM_VALUE(sym)) ? AST_SYMBOL(sym)->name : "";
1044 werrorfl (iexpr->filename, iexpr->lineno, W_EXCESS_INITIALIZERS,
1050 for (i=0;i<size;i++)
1052 rast = newNode (NULLOP,
1056 newAst_VALUE (valueFromLit ((float) i))),
1057 newAst_VALUE (valueFromLit (*s))));
1061 // now WE don't need iexpr's symbol anymore
1062 freeStringSymbol(AST_SYMBOL(iexpr));
1064 /* if we have not been given a size */
1065 if (!DCL_ELEM (type))
1067 /* check, if it's a flexible array */
1068 if (IS_STRUCT (AST_VALUE (rootVal)->type))
1069 AST_SYMBOL(rootVal)->flexArrayLength = size * getSize (type->next);
1071 DCL_ELEM (type) = size;
1074 return decorateType (resolveSymbols (rast), RESULT_TYPE_NONE);
1080 /*-----------------------------------------------------------------*/
1081 /* createIvalPtr - generates initial value for pointers */
1082 /*-----------------------------------------------------------------*/
1084 createIvalPtr (ast * sym, sym_link * type, initList * ilist, ast *rootVal)
1090 if (ilist->type == INIT_DEEP)
1091 ilist = ilist->init.deep;
1093 iexpr = decorateType (resolveSymbols (list2expr (ilist)), RESULT_TYPE_NONE);
1095 /* if character pointer */
1096 if (IS_CHAR (type->next))
1097 if ((rast = createIvalCharPtr (sym, type, iexpr, rootVal)))
1100 return newNode ('=', sym, iexpr);
1103 /*-----------------------------------------------------------------*/
1104 /* createIval - generates code for initial value */
1105 /*-----------------------------------------------------------------*/
1107 createIval (ast * sym, sym_link * type, initList * ilist, ast * wid, ast *rootValue)
1114 /* if structure then */
1115 if (IS_STRUCT (type))
1116 rast = createIvalStruct (sym, type, ilist, rootValue);
1118 /* if this is a pointer */
1120 rast = createIvalPtr (sym, type, ilist, rootValue);
1122 /* if this is an array */
1123 if (IS_ARRAY (type))
1124 rast = createIvalArray (sym, type, ilist, rootValue);
1126 /* if type is SPECIFIER */
1128 rast = createIvalType (sym, type, ilist);
1131 return decorateType (resolveSymbols (newNode (NULLOP, wid, rast)), RESULT_TYPE_NONE);
1133 return decorateType (resolveSymbols (rast), RESULT_TYPE_NONE);
1136 /*-----------------------------------------------------------------*/
1137 /* initAggregates - initialises aggregate variables with initv */
1138 /*-----------------------------------------------------------------*/
1139 ast * initAggregates (symbol * sym, initList * ival, ast * wid) {
1140 ast *newAst = newAst_VALUE (symbolVal (sym));
1141 return createIval (newAst, sym->type, ival, wid, newAst);
1144 /*-----------------------------------------------------------------*/
1145 /* gatherAutoInit - creates assignment expressions for initial */
1147 /*-----------------------------------------------------------------*/
1149 gatherAutoInit (symbol * autoChain)
1156 for (sym = autoChain; sym; sym = sym->next)
1159 /* resolve the symbols in the ival */
1161 resolveIvalSym (sym->ival, sym->type);
1164 /* if we are PIC16 port,
1165 * and this is a static,
1166 * and have initial value,
1167 * and not S_CODE, don't emit in gs segment,
1168 * but allow glue.c:pic16emitRegularMap to put symbol
1169 * in idata section */
1170 if(TARGET_IS_PIC16 &&
1171 IS_STATIC (sym->etype) && sym->ival
1172 && SPEC_SCLS(sym->etype) != S_CODE) {
1173 SPEC_SCLS (sym->etype) = S_DATA;
1178 /* if this is a static variable & has an */
1179 /* initial value the code needs to be lifted */
1180 /* here to the main portion since they can be */
1181 /* initialised only once at the start */
1182 if (IS_STATIC (sym->etype) && sym->ival &&
1183 SPEC_SCLS (sym->etype) != S_CODE)
1187 /* insert the symbol into the symbol table */
1188 /* with level = 0 & name = rname */
1189 newSym = copySymbol (sym);
1190 addSym (SymbolTab, newSym, newSym->rname, 0, 0, 1);
1192 /* now lift the code to main */
1193 if (IS_AGGREGATE (sym->type)) {
1194 work = initAggregates (sym, sym->ival, NULL);
1196 if (getNelements(sym->type, sym->ival)>1) {
1197 werrorfl (sym->fileDef, sym->lineDef,
1198 W_EXCESS_INITIALIZERS, "scalar",
1201 work = newNode ('=', newAst_VALUE (symbolVal (newSym)),
1202 list2expr (sym->ival));
1205 setAstLineno (work, sym->lineDef);
1209 staticAutos = newNode (NULLOP, staticAutos, work);
1216 /* if there is an initial value */
1217 if (sym->ival && SPEC_SCLS (sym->etype) != S_CODE)
1219 initList *ilist=sym->ival;
1221 while (ilist->type == INIT_DEEP) {
1222 ilist = ilist->init.deep;
1225 /* update lineno for error msg */
1226 lineno=sym->lineDef;
1227 setAstLineno (ilist->init.node, lineno);
1229 if (IS_AGGREGATE (sym->type)) {
1230 work = initAggregates (sym, sym->ival, NULL);
1232 if (getNelements(sym->type, sym->ival)>1) {
1233 werrorfl (sym->fileDef, sym->lineDef,
1234 W_EXCESS_INITIALIZERS, "scalar",
1237 work = newNode ('=', newAst_VALUE (symbolVal (sym)),
1238 list2expr (sym->ival));
1242 setAstLineno (work, sym->lineDef);
1246 init = newNode (NULLOP, init, work);
1255 /*-----------------------------------------------------------------*/
1256 /* freeStringSymbol - delete a literal string if no more usage */
1257 /*-----------------------------------------------------------------*/
1258 void freeStringSymbol(symbol *sym) {
1259 /* make sure this is a literal string */
1260 assert (sym->isstrlit);
1261 if (--sym->isstrlit == 0) { // lower the usage count
1262 memmap *segment=SPEC_OCLS(sym->etype);
1264 deleteSetItem(&segment->syms, sym);
1269 /*-----------------------------------------------------------------*/
1270 /* stringToSymbol - creates a symbol from a literal string */
1271 /*-----------------------------------------------------------------*/
1273 stringToSymbol (value * val)
1275 char name[SDCC_NAME_MAX + 1];
1276 static int charLbl = 0;
1281 // have we heard this before?
1282 for (sp=statsg->syms; sp; sp=sp->next) {
1284 size = getSize (sym->type);
1285 if (sym->isstrlit && size == getSize (val->type) &&
1286 !memcmp(SPEC_CVAL(sym->etype).v_char, SPEC_CVAL(val->etype).v_char, size)) {
1287 // yes, this is old news. Don't publish it again.
1288 sym->isstrlit++; // but raise the usage count
1289 return symbolVal(sym);
1293 SNPRINTF (name, sizeof(name), "_str_%d", charLbl++);
1294 sym = newSymbol (name, 0); /* make it @ level 0 */
1295 strncpyz (sym->rname, name, SDCC_NAME_MAX);
1297 /* copy the type from the value passed */
1298 sym->type = copyLinkChain (val->type);
1299 sym->etype = getSpec (sym->type);
1300 /* change to storage class & output class */
1301 SPEC_SCLS (sym->etype) = S_CODE;
1302 SPEC_CVAL (sym->etype).v_char = SPEC_CVAL (val->etype).v_char;
1303 SPEC_STAT (sym->etype) = 1;
1304 /* make the level & block = 0 */
1305 sym->block = sym->level = 0;
1307 /* create an ival */
1308 sym->ival = newiList (INIT_NODE, newAst_VALUE (val));
1313 allocVariables (sym);
1316 return symbolVal (sym);
1320 /*-----------------------------------------------------------------*/
1321 /* processBlockVars - will go thru the ast looking for block if */
1322 /* a block is found then will allocate the syms */
1323 /* will also gather the auto inits present */
1324 /*-----------------------------------------------------------------*/
1326 processBlockVars (ast * tree, int *stack, int action)
1331 /* if this is a block */
1332 if (tree->type == EX_OP && tree->opval.op == BLOCK)
1336 if (action == ALLOCATE)
1338 *stack += allocVariables (tree->values.sym);
1339 autoInit = gatherAutoInit (tree->values.sym);
1341 /* if there are auto inits then do them */
1343 tree->left = newNode (NULLOP, autoInit, tree->left);
1345 else /* action is deallocate */
1346 deallocLocal (tree->values.sym);
1349 processBlockVars (tree->left, stack, action);
1350 processBlockVars (tree->right, stack, action);
1355 /*-------------------------------------------------------------*/
1356 /* constExprTree - returns TRUE if this tree is a constant */
1358 /*-------------------------------------------------------------*/
1359 bool constExprTree (ast *cexpr) {
1365 cexpr = decorateType (resolveSymbols (cexpr), RESULT_TYPE_NONE);
1367 switch (cexpr->type)
1370 if (IS_AST_LIT_VALUE(cexpr)) {
1371 // this is a literal
1374 if (IS_AST_SYM_VALUE(cexpr) && IS_FUNC(AST_SYMBOL(cexpr)->type)) {
1375 // a function's address will never change
1378 if (IS_AST_SYM_VALUE(cexpr) && IS_ARRAY(AST_SYMBOL(cexpr)->type)) {
1379 // an array's address will never change
1382 if (IS_AST_SYM_VALUE(cexpr) &&
1383 IN_CODESPACE(SPEC_OCLS(AST_SYMBOL(cexpr)->etype))) {
1384 // a symbol in code space will never change
1385 // This is only for the 'char *s="hallo"' case and will have to leave
1386 //printf(" code space symbol");
1391 werror (E_INTERNAL_ERROR, __FILE__, __LINE__,
1392 "unexpected link in expression tree\n");
1395 if (cexpr->opval.op==ARRAYINIT) {
1396 // this is a list of literals
1399 if (cexpr->opval.op=='=') {
1400 return constExprTree(cexpr->right);
1402 if (cexpr->opval.op==CAST) {
1403 // cast ignored, maybe we should throw a warning here?
1404 return constExprTree(cexpr->right);
1406 if (cexpr->opval.op=='&') {
1409 if (cexpr->opval.op==CALL || cexpr->opval.op==PCALL) {
1412 if (constExprTree(cexpr->left) && constExprTree(cexpr->right)) {
1417 return IS_CONSTANT(operandType(cexpr->opval.oprnd));
1422 /*-----------------------------------------------------------------*/
1423 /* constExprValue - returns the value of a constant expression */
1424 /* or NULL if it is not a constant expression */
1425 /*-----------------------------------------------------------------*/
1427 constExprValue (ast * cexpr, int check)
1429 cexpr = decorateType (resolveSymbols (cexpr), RESULT_TYPE_NONE);
1431 /* if this is not a constant then */
1432 if (!IS_LITERAL (cexpr->ftype))
1434 /* then check if this is a literal array
1436 if (SPEC_SCLS (cexpr->etype) == S_CODE &&
1437 SPEC_CVAL (cexpr->etype).v_char &&
1438 IS_ARRAY (cexpr->ftype))
1440 value *val = valFromType (cexpr->ftype);
1441 SPEC_SCLS (val->etype) = S_LITERAL;
1442 val->sym = cexpr->opval.val->sym;
1443 val->sym->type = copyLinkChain (cexpr->ftype);
1444 val->sym->etype = getSpec (val->sym->type);
1445 strncpyz (val->name, cexpr->opval.val->sym->rname, SDCC_NAME_MAX);
1449 /* if we are casting a literal value then */
1450 if (IS_AST_OP (cexpr) &&
1451 cexpr->opval.op == CAST &&
1452 IS_LITERAL (cexpr->right->ftype))
1454 return valCastLiteral (cexpr->ftype,
1455 floatFromVal (cexpr->right->opval.val));
1458 if (IS_AST_VALUE (cexpr))
1460 return cexpr->opval.val;
1464 werror (E_CONST_EXPECTED, "found expression");
1469 /* return the value */
1470 return cexpr->opval.val;
1474 /*-----------------------------------------------------------------*/
1475 /* isLabelInAst - will return true if a given label is found */
1476 /*-----------------------------------------------------------------*/
1478 isLabelInAst (symbol * label, ast * tree)
1480 if (!tree || IS_AST_VALUE (tree) || IS_AST_LINK (tree))
1483 if (IS_AST_OP (tree) &&
1484 tree->opval.op == LABEL &&
1485 isSymbolEqual (AST_SYMBOL (tree->left), label))
1488 return isLabelInAst (label, tree->right) &&
1489 isLabelInAst (label, tree->left);
1493 /*-----------------------------------------------------------------*/
1494 /* isLoopCountable - return true if the loop count can be determi- */
1495 /* -ned at compile time . */
1496 /*-----------------------------------------------------------------*/
1498 isLoopCountable (ast * initExpr, ast * condExpr, ast * loopExpr,
1499 symbol ** sym, ast ** init, ast ** end)
1502 /* the loop is considered countable if the following
1503 conditions are true :-
1505 a) initExpr :- <sym> = <const>
1506 b) condExpr :- <sym> < <const1>
1507 c) loopExpr :- <sym> ++
1510 /* first check the initExpr */
1511 if (IS_AST_OP (initExpr) &&
1512 initExpr->opval.op == '=' && /* is assignment */
1513 IS_AST_SYM_VALUE (initExpr->left))
1514 { /* left is a symbol */
1516 *sym = AST_SYMBOL (initExpr->left);
1517 *init = initExpr->right;
1522 /* for now the symbol has to be of
1524 if (!IS_INTEGRAL ((*sym)->type))
1527 /* now check condExpr */
1528 if (IS_AST_OP (condExpr))
1531 switch (condExpr->opval.op)
1534 if (IS_AST_SYM_VALUE (condExpr->left) &&
1535 isSymbolEqual (*sym, AST_SYMBOL (condExpr->left)) &&
1536 IS_AST_LIT_VALUE (condExpr->right))
1538 *end = condExpr->right;
1544 if (IS_AST_OP (condExpr->left) &&
1545 condExpr->left->opval.op == '>' &&
1546 IS_AST_LIT_VALUE (condExpr->left->right) &&
1547 IS_AST_SYM_VALUE (condExpr->left->left) &&
1548 isSymbolEqual (*sym, AST_SYMBOL (condExpr->left->left)))
1551 *end = newNode ('+', condExpr->left->right,
1552 newAst_VALUE (constVal ("1")));
1565 /* check loop expression is of the form <sym>++ */
1566 if (!IS_AST_OP (loopExpr))
1569 /* check if <sym> ++ */
1570 if (loopExpr->opval.op == INC_OP)
1576 if (IS_AST_SYM_VALUE (loopExpr->left) &&
1577 isSymbolEqual (*sym, AST_SYMBOL (loopExpr->left)))
1584 if (IS_AST_SYM_VALUE (loopExpr->right) &&
1585 isSymbolEqual (*sym, AST_SYMBOL (loopExpr->right)))
1593 if (loopExpr->opval.op == ADD_ASSIGN)
1596 if (IS_AST_SYM_VALUE (loopExpr->left) &&
1597 isSymbolEqual (*sym, AST_SYMBOL (loopExpr->left)) &&
1598 IS_AST_LIT_VALUE (loopExpr->right) &&
1599 (int) AST_LIT_VALUE (loopExpr->right) != 1)
1607 /*-----------------------------------------------------------------*/
1608 /* astHasVolatile - returns true if ast contains any volatile */
1609 /*-----------------------------------------------------------------*/
1611 astHasVolatile (ast * tree)
1616 if (TETYPE (tree) && IS_VOLATILE (TETYPE (tree)))
1619 if (IS_AST_OP (tree))
1620 return astHasVolatile (tree->left) ||
1621 astHasVolatile (tree->right);
1626 /*-----------------------------------------------------------------*/
1627 /* astHasPointer - return true if the ast contains any ptr variable */
1628 /*-----------------------------------------------------------------*/
1630 astHasPointer (ast * tree)
1635 if (IS_AST_LINK (tree))
1638 /* if we hit an array expression then check
1639 only the left side */
1640 if (IS_AST_OP (tree) && tree->opval.op == '[')
1641 return astHasPointer (tree->left);
1643 if (IS_AST_VALUE (tree))
1644 return IS_PTR (tree->ftype) || IS_ARRAY (tree->ftype);
1646 return astHasPointer (tree->left) ||
1647 astHasPointer (tree->right);
1651 /*-----------------------------------------------------------------*/
1652 /* astHasSymbol - return true if the ast has the given symbol */
1653 /*-----------------------------------------------------------------*/
1655 astHasSymbol (ast * tree, symbol * sym)
1657 if (!tree || IS_AST_LINK (tree))
1660 if (IS_AST_VALUE (tree))
1662 if (IS_AST_SYM_VALUE (tree))
1663 return isSymbolEqual (AST_SYMBOL (tree), sym);
1668 return astHasSymbol (tree->left, sym) ||
1669 astHasSymbol (tree->right, sym);
1672 /*-----------------------------------------------------------------*/
1673 /* astHasDeref - return true if the ast has an indirect access */
1674 /*-----------------------------------------------------------------*/
1676 astHasDeref (ast * tree)
1678 if (!tree || IS_AST_LINK (tree) || IS_AST_VALUE(tree))
1681 if (tree->opval.op == '*' && tree->right == NULL) return TRUE;
1683 return astHasDeref (tree->left) || astHasDeref (tree->right);
1686 /*-----------------------------------------------------------------*/
1687 /* isConformingBody - the loop body has to conform to a set of rules */
1688 /* for the loop to be considered reversible read on for rules */
1689 /*-----------------------------------------------------------------*/
1691 isConformingBody (ast * pbody, symbol * sym, ast * body)
1694 /* we are going to do a pre-order traversal of the
1695 tree && check for the following conditions. (essentially
1696 a set of very shallow tests )
1697 a) the sym passed does not participate in
1698 any arithmetic operation
1699 b) There are no function calls
1700 c) all jumps are within the body
1701 d) address of loop control variable not taken
1702 e) if an assignment has a pointer on the
1703 left hand side make sure right does not have
1704 loop control variable */
1706 /* if we reach the end or a leaf then true */
1707 if (!pbody || IS_AST_LINK (pbody) || IS_AST_VALUE (pbody))
1710 /* if anything else is "volatile" */
1711 if (IS_VOLATILE (TETYPE (pbody)))
1714 /* we will walk the body in a pre-order traversal for
1716 switch (pbody->opval.op)
1718 /*------------------------------------------------------------------*/
1720 // if the loopvar is used as an index
1721 /* array op is commutative -- must check both left & right */
1722 if (astHasSymbol(pbody->right, sym) || astHasSymbol(pbody->left, sym)) {
1725 return isConformingBody (pbody->right, sym, body)
1726 && isConformingBody (pbody->left, sym, body);
1728 /*------------------------------------------------------------------*/
1733 /*------------------------------------------------------------------*/
1737 /* sure we are not sym is not modified */
1739 IS_AST_SYM_VALUE (pbody->left) &&
1740 isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1744 IS_AST_SYM_VALUE (pbody->right) &&
1745 isSymbolEqual (AST_SYMBOL (pbody->right), sym))
1750 /*------------------------------------------------------------------*/
1752 case '*': /* can be unary : if right is null then unary operation */
1757 /* if right is NULL then unary operation */
1758 /*------------------------------------------------------------------*/
1759 /*----------------------------*/
1761 /*----------------------------*/
1764 if (IS_AST_SYM_VALUE (pbody->left) &&
1765 isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1768 return isConformingBody (pbody->left, sym, body);
1772 if (astHasSymbol (pbody->left, sym) ||
1773 astHasSymbol (pbody->right, sym))
1778 /*------------------------------------------------------------------*/
1789 if (IS_AST_SYM_VALUE (pbody->left) &&
1790 isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1793 if (IS_AST_SYM_VALUE (pbody->right) &&
1794 isSymbolEqual (AST_SYMBOL (pbody->right), sym))
1797 return isConformingBody (pbody->left, sym, body) &&
1798 isConformingBody (pbody->right, sym, body);
1806 if (IS_AST_SYM_VALUE (pbody->left) &&
1807 isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1809 return isConformingBody (pbody->left, sym, body);
1811 /*------------------------------------------------------------------*/
1823 case SIZEOF: /* evaluate wihout code generation */
1825 if (IS_AST_SYM_VALUE (pbody->left) &&
1826 isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1829 if (IS_AST_SYM_VALUE (pbody->right) &&
1830 isSymbolEqual (AST_SYMBOL (pbody->right), sym))
1833 return isConformingBody (pbody->left, sym, body) &&
1834 isConformingBody (pbody->right, sym, body);
1836 /*------------------------------------------------------------------*/
1839 /* if left has a pointer & right has loop
1840 control variable then we cannot */
1841 if (astHasPointer (pbody->left) &&
1842 astHasSymbol (pbody->right, sym))
1844 if (astHasVolatile (pbody->left))
1847 if (IS_AST_SYM_VALUE (pbody->left)) {
1848 // if the loopvar has an assignment
1849 if (isSymbolEqual (AST_SYMBOL (pbody->left), sym))
1851 // if the loopvar is used in another (maybe conditional) block
1852 if (astHasSymbol (pbody->right, sym) &&
1853 (pbody->level >= body->level)) {
1858 if (astHasVolatile (pbody->left))
1861 if (astHasDeref(pbody->right)) return FALSE;
1863 return isConformingBody (pbody->left, sym, body) &&
1864 isConformingBody (pbody->right, sym, body);
1875 assert ("Parser should not have generated this\n");
1877 /*------------------------------------------------------------------*/
1878 /*----------------------------*/
1879 /* comma operator */
1880 /*----------------------------*/
1882 return isConformingBody (pbody->left, sym, body) &&
1883 isConformingBody (pbody->right, sym, body);
1885 /*------------------------------------------------------------------*/
1886 /*----------------------------*/
1888 /*----------------------------*/
1890 /* if local & not passed as paramater then ok */
1891 if (sym->level && !astHasSymbol(pbody->right,sym))
1895 /*------------------------------------------------------------------*/
1896 /*----------------------------*/
1897 /* return statement */
1898 /*----------------------------*/
1903 if (isLabelInAst (AST_SYMBOL (pbody->left), body))
1908 if (astHasSymbol (pbody->left, sym))
1915 return isConformingBody (pbody->left, sym, body) &&
1916 isConformingBody (pbody->right, sym, body);
1922 /*-----------------------------------------------------------------*/
1923 /* isLoopReversible - takes a for loop as input && returns true */
1924 /* if the for loop is reversible. If yes will set the value of */
1925 /* the loop control var & init value & termination value */
1926 /*-----------------------------------------------------------------*/
1928 isLoopReversible (ast * loop, symbol ** loopCntrl,
1929 ast ** init, ast ** end)
1931 /* if option says don't do it then don't */
1932 if (optimize.noLoopReverse)
1934 /* there are several tests to determine this */
1936 /* for loop has to be of the form
1937 for ( <sym> = <const1> ;
1938 [<sym> < <const2>] ;
1939 [<sym>++] | [<sym> += 1] | [<sym> = <sym> + 1] )
1941 if (!isLoopCountable (AST_FOR (loop, initExpr),
1942 AST_FOR (loop, condExpr),
1943 AST_FOR (loop, loopExpr),
1944 loopCntrl, init, end))
1947 /* now do some serious checking on the body of the loop
1950 return isConformingBody (loop->left, *loopCntrl, loop->left);
1954 /*-----------------------------------------------------------------*/
1955 /* replLoopSym - replace the loop sym by loop sym -1 */
1956 /*-----------------------------------------------------------------*/
1958 replLoopSym (ast * body, symbol * sym)
1961 if (!body || IS_AST_LINK (body))
1964 if (IS_AST_SYM_VALUE (body))
1967 if (isSymbolEqual (AST_SYMBOL (body), sym))
1971 body->opval.op = '-';
1972 body->left = newAst_VALUE (symbolVal (sym));
1973 body->right = newAst_VALUE (constVal ("1"));
1981 replLoopSym (body->left, sym);
1982 replLoopSym (body->right, sym);
1986 /*-----------------------------------------------------------------*/
1987 /* reverseLoop - do the actual loop reversal */
1988 /*-----------------------------------------------------------------*/
1990 reverseLoop (ast * loop, symbol * sym, ast * init, ast * end)
1994 /* create the following tree
1999 if (sym) goto for_continue ;
2002 /* put it together piece by piece */
2003 rloop = newNode (NULLOP,
2004 createIf (newAst_VALUE (symbolVal (sym)),
2006 newAst_VALUE (symbolVal (AST_FOR (loop, continueLabel))),
2009 newAst_VALUE (symbolVal (sym)),
2012 replLoopSym (loop->left, sym);
2013 setAstLineno (rloop, init->lineno);
2015 rloop = newNode (NULLOP,
2017 newAst_VALUE (symbolVal (sym)),
2018 newNode ('-', end, init)),
2019 createLabel (AST_FOR (loop, continueLabel),
2023 newNode (SUB_ASSIGN,
2024 newAst_VALUE (symbolVal (sym)),
2025 newAst_VALUE (constVal ("1"))),
2028 rloop->lineno=init->lineno;
2029 return decorateType (rloop, RESULT_TYPE_NONE);
2033 /*-----------------------------------------------------------------*/
2034 /* searchLitOp - search tree (*ops only) for an ast with literal */
2035 /*-----------------------------------------------------------------*/
2037 searchLitOp (ast *tree, ast **parent, const unsigned char *ops)
2041 if (tree && optimize.global_cse)
2043 /* is there a literal operand? */
2045 IS_AST_OP(tree->right) &&
2046 tree->right->right &&
2047 (tree->right->opval.op == ops[0] || tree->right->opval.op == ops[1]))
2049 if (IS_LITERAL (RTYPE (tree->right)) !=
2050 IS_LITERAL (LTYPE (tree->right)))
2052 tree->right->decorated = 0;
2053 tree->decorated = 0;
2057 ret = searchLitOp (tree->right, parent, ops);
2062 IS_AST_OP(tree->left) &&
2063 tree->left->right &&
2064 (tree->left->opval.op == ops[0] || tree->left->opval.op == ops[1]))
2066 if (IS_LITERAL (RTYPE (tree->left)) !=
2067 IS_LITERAL (LTYPE (tree->left)))
2069 tree->left->decorated = 0;
2070 tree->decorated = 0;
2074 ret = searchLitOp (tree->left, parent, ops);
2082 /*-----------------------------------------------------------------*/
2083 /* getResultFromType */
2084 /*-----------------------------------------------------------------*/
2086 getResultTypeFromType (sym_link *type)
2088 /* type = getSpec (type); */
2090 return RESULT_TYPE_BIT;
2091 if (IS_BITFIELD (type))
2093 int blen = SPEC_BLEN (type);
2096 return RESULT_TYPE_BIT;
2098 return RESULT_TYPE_CHAR;
2099 return RESULT_TYPE_INT;
2102 return RESULT_TYPE_CHAR;
2105 return RESULT_TYPE_INT;
2106 return RESULT_TYPE_OTHER;
2109 /*-----------------------------------------------------------------*/
2110 /* addCast - adds casts to a type specified by RESULT_TYPE */
2111 /*-----------------------------------------------------------------*/
2113 addCast (ast *tree, RESULT_TYPE resultType, bool promote)
2116 bool upCasted = FALSE;
2120 case RESULT_TYPE_NONE:
2121 /* if thing smaller than int must be promoted to int */
2123 getSize (tree->etype) >= INTSIZE)
2124 /* promotion not necessary or already an int */
2126 /* char and bits: promote to int */
2127 newLink = newIntLink();
2130 case RESULT_TYPE_BIT:
2132 /* already an int */
2133 bitsForType (tree->etype) >= 16 ||
2134 /* bit to bit operation: don't promote, the code generators
2135 hopefully know everything about promotion rules */
2136 bitsForType (tree->etype) == 1)
2138 newLink = newIntLink();
2141 case RESULT_TYPE_CHAR:
2142 if (IS_CHAR (tree->etype) ||
2143 IS_FLOAT(tree->etype) ||
2144 IS_FIXED(tree->etype))
2146 newLink = newCharLink();
2148 case RESULT_TYPE_INT:
2150 if (getSize (tree->etype) > INTSIZE)
2152 /* warn ("Loosing significant digits"); */
2156 /* char: promote to int */
2158 getSize (tree->etype) >= INTSIZE)
2160 newLink = newIntLink();
2163 case RESULT_TYPE_OTHER:
2166 /* return type is long, float: promote char to int */
2167 if (getSize (tree->etype) >= INTSIZE)
2169 newLink = newIntLink();
2175 tree->decorated = 0;
2176 tree = newNode (CAST, newAst_LINK (newLink), tree);
2177 tree->lineno = tree->right->lineno;
2178 /* keep unsigned type during cast to smaller type,
2179 but not when promoting from char to int */
2181 SPEC_USIGN (tree->left->opval.lnk) = IS_UNSIGNED (tree->right->etype) ? 1 : 0;
2182 return decorateType (tree, resultType);
2185 /*-----------------------------------------------------------------*/
2186 /* resultTypePropagate - decides if resultType can be propagated */
2187 /*-----------------------------------------------------------------*/
2189 resultTypePropagate (ast *tree, RESULT_TYPE resultType)
2191 switch (tree->opval.op)
2210 return RESULT_TYPE_NONE;
2214 return RESULT_TYPE_IFX;
2216 return RESULT_TYPE_NONE;
2220 /*-----------------------------------------------------------------*/
2221 /* getLeftResultType - gets type from left branch for propagation */
2222 /*-----------------------------------------------------------------*/
2224 getLeftResultType (ast *tree, RESULT_TYPE resultType)
2226 switch (tree->opval.op)
2230 if (IS_PTR (LTYPE (tree)))
2231 return RESULT_TYPE_NONE;
2233 return getResultTypeFromType (LETYPE (tree));
2235 if (IS_PTR (currFunc->type->next))
2236 return RESULT_TYPE_NONE;
2238 return getResultTypeFromType (currFunc->type->next);
2240 if (!IS_ARRAY (LTYPE (tree)))
2242 if (DCL_ELEM (LTYPE (tree)) > 0 && DCL_ELEM (LTYPE (tree)) <= 256)
2243 return RESULT_TYPE_CHAR;
2250 /*--------------------------------------------------------------------*/
2251 /* decorateType - compute type for this tree, also does type checking.*/
2252 /* This is done bottom up, since type has to flow upwards. */
2253 /* resultType flows top-down and forces e.g. char-arithmetik, if the */
2254 /* result is a char and the operand(s) are int's. */
2255 /* It also does constant folding, and parameter checking. */
2256 /*--------------------------------------------------------------------*/
2258 decorateType (ast * tree, RESULT_TYPE resultType)
2262 RESULT_TYPE resultTypeProp;
2267 /* if already has type then do nothing */
2268 if (tree->decorated)
2271 tree->decorated = 1;
2274 /* print the line */
2275 /* if not block & function */
2276 if (tree->type == EX_OP &&
2277 (tree->opval.op != FUNCTION &&
2278 tree->opval.op != BLOCK &&
2279 tree->opval.op != NULLOP))
2281 filename = tree->filename;
2282 lineno = tree->lineno;
2286 /* if any child is an error | this one is an error do nothing */
2287 if (tree->isError ||
2288 (tree->left && tree->left->isError) ||
2289 (tree->right && tree->right->isError))
2292 /*------------------------------------------------------------------*/
2293 /*----------------------------*/
2294 /* leaf has been reached */
2295 /*----------------------------*/
2296 lineno=tree->lineno;
2297 /* if this is of type value */
2298 /* just get the type */
2299 if (tree->type == EX_VALUE)
2302 if (IS_LITERAL (tree->opval.val->etype))
2305 /* if this is a character array then declare it */
2306 if (IS_ARRAY (tree->opval.val->type))
2307 tree->opval.val = stringToSymbol (tree->opval.val);
2309 /* otherwise just copy the type information */
2310 COPYTYPE (TTYPE (tree), TETYPE (tree), tree->opval.val->type);
2314 if (tree->opval.val->sym)
2316 /* if the undefined flag is set then give error message */
2317 if (tree->opval.val->sym->undefined)
2319 werror (E_ID_UNDEF, tree->opval.val->sym->name);
2321 TTYPE (tree) = TETYPE (tree) =
2322 tree->opval.val->type = tree->opval.val->sym->type =
2323 tree->opval.val->etype = tree->opval.val->sym->etype =
2324 copyLinkChain (INTTYPE);
2329 /* if impilicit i.e. struct/union member then no type */
2330 if (tree->opval.val->sym->implicit)
2331 TTYPE (tree) = TETYPE (tree) = NULL;
2336 /* else copy the type */
2337 COPYTYPE (TTYPE (tree), TETYPE (tree), tree->opval.val->type);
2339 /* and mark it as referenced */
2340 tree->opval.val->sym->isref = 1;
2348 /* if type link for the case of cast */
2349 if (tree->type == EX_LINK)
2351 COPYTYPE (TTYPE (tree), TETYPE (tree), tree->opval.lnk);
2359 if (tree->opval.op == NULLOP || tree->opval.op == BLOCK)
2361 if (tree->left && tree->left->type == EX_OPERAND
2362 && (tree->left->opval.op == INC_OP
2363 || tree->left->opval.op == DEC_OP)
2364 && tree->left->left)
2366 tree->left->right = tree->left->left;
2367 tree->left->left = NULL;
2369 if (tree->right && tree->right->type == EX_OPERAND
2370 && (tree->right->opval.op == INC_OP
2371 || tree->right->opval.op == DEC_OP)
2372 && tree->right->left)
2374 tree->right->right = tree->right->left;
2375 tree->right->left = NULL;
2380 /* Before decorating the left branch we've to decide in dependence
2381 upon tree->opval.op, if resultType can be propagated */
2382 resultTypeProp = resultTypePropagate (tree, resultType);
2384 if (tree->opval.op == '?')
2385 dtl = decorateType (tree->left, RESULT_TYPE_IFX);
2387 dtl = decorateType (tree->left, resultTypeProp);
2389 /* if an array node, we may need to swap branches */
2390 if (tree->opval.op == '[')
2392 /* determine which is the array & which the index */
2393 if ((IS_ARRAY (RTYPE (tree)) || IS_PTR (RTYPE (tree))) &&
2394 IS_INTEGRAL (LTYPE (tree)))
2396 ast *tempTree = tree->left;
2397 tree->left = tree->right;
2398 tree->right = tempTree;
2402 /* After decorating the left branch there's type information available
2403 in tree->left->?type. If the op is e.g. '=' we extract the type
2404 information from there and propagate it to the right branch. */
2405 resultTypeProp = getLeftResultType (tree, resultTypeProp);
2407 switch (tree->opval.op)
2410 /* delay right side for '?' operator since conditional macro
2411 expansions might rely on this */
2415 /* decorate right side for CALL (parameter list) in processParms();
2416 there is resultType available */
2420 dtr = decorateType (tree->right, resultTypeProp);
2424 /* this is to take care of situations
2425 when the tree gets rewritten */
2426 if (dtl != tree->left)
2428 if (dtr != tree->right)
2430 if ((dtl && dtl->isError) || (dtr && dtr->isError))
2434 /* depending on type of operator do */
2436 switch (tree->opval.op)
2438 /*------------------------------------------------------------------*/
2439 /*----------------------------*/
2441 /*----------------------------*/
2444 /* first check if this is a array or a pointer */
2445 if ((!IS_ARRAY (LTYPE (tree))) && (!IS_PTR (LTYPE (tree))))
2447 werror (E_NEED_ARRAY_PTR, "[]");
2448 goto errorTreeReturn;
2451 /* check if the type of the idx */
2452 if (!IS_INTEGRAL (RTYPE (tree)))
2454 werror (E_IDX_NOT_INT);
2455 goto errorTreeReturn;
2458 /* if the left is an rvalue then error */
2461 werror (E_LVALUE_REQUIRED, "array access");
2462 goto errorTreeReturn;
2465 if (IS_LITERAL (RTYPE (tree)))
2467 int arrayIndex = (int) floatFromVal (valFromType (RETYPE (tree)));
2468 int arraySize = DCL_ELEM (LTYPE (tree));
2469 if (arraySize && arrayIndex >= arraySize)
2471 werror (W_IDX_OUT_OF_BOUNDS, arrayIndex, arraySize);
2476 COPYTYPE (TTYPE (tree), TETYPE (tree), LTYPE (tree)->next);
2477 SPEC_CONST (TETYPE (tree)) |= DCL_PTR_CONST (LTYPE (tree));
2480 /*------------------------------------------------------------------*/
2481 /*----------------------------*/
2483 /*----------------------------*/
2485 /* if this is not a structure */
2486 if (!IS_STRUCT (LTYPE (tree)))
2488 werror (E_STRUCT_UNION, ".");
2489 goto errorTreeReturn;
2491 TTYPE (tree) = structElemType (LTYPE (tree),
2492 (tree->right->type == EX_VALUE ?
2493 tree->right->opval.val : NULL));
2494 TETYPE (tree) = getSpec (TTYPE (tree));
2497 /*------------------------------------------------------------------*/
2498 /*----------------------------*/
2499 /* struct/union pointer */
2500 /*----------------------------*/
2502 /* if not pointer to a structure */
2503 if (!IS_PTR (LTYPE (tree)) && !IS_ARRAY (LTYPE(tree)))
2505 werror (E_PTR_REQD);
2506 goto errorTreeReturn;
2509 if (!IS_STRUCT (LTYPE (tree)->next))
2511 werror (E_STRUCT_UNION, "->");
2512 goto errorTreeReturn;
2515 TTYPE (tree) = structElemType (LTYPE (tree)->next,
2516 (tree->right->type == EX_VALUE ?
2517 tree->right->opval.val : NULL));
2518 TETYPE (tree) = getSpec (TTYPE (tree));
2520 /* adjust the storage class */
2521 switch (DCL_TYPE(tree->left->ftype)) {
2523 SPEC_SCLS(TETYPE(tree)) = S_DATA;
2526 SPEC_SCLS(TETYPE(tree)) = S_XDATA;
2529 SPEC_SCLS(TETYPE(tree)) = S_CODE;
2532 SPEC_SCLS (TETYPE (tree)) = 0;
2535 SPEC_SCLS(TETYPE(tree)) = S_XSTACK;
2538 SPEC_SCLS(TETYPE(tree)) = S_IDATA;
2541 SPEC_SCLS(TETYPE(tree)) = S_EEPROM;
2544 SPEC_SCLS (TETYPE (tree)) = 0;
2551 /* This breaks with extern declarations, bitfields, and perhaps other */
2552 /* cases (gcse). Let's leave this optimization disabled for now and */
2553 /* ponder if there's a safe way to do this. -- EEP */
2555 if (IS_ADDRESS_OF_OP (tree->left) && IS_AST_SYM_VALUE(tree->left->left)
2556 && SPEC_ABSA (AST_SYMBOL (tree->left->left)->etype))
2558 /* If defined struct type at addr var
2559 then rewrite (&struct var)->member
2561 and define membertype at (addr+offsetof(struct var,member)) temp
2564 symbol *element = getStructElement (SPEC_STRUCT (LETYPE(tree)),
2565 AST_SYMBOL(tree->right));
2567 sym = newSymbol(genSymName (0), 0);
2568 sym->type = TTYPE (tree);
2569 sym->etype = getSpec(sym->type);
2570 sym->lineDef = tree->lineno;
2573 SPEC_STAT (sym->etype) = 1;
2574 SPEC_ADDR (sym->etype) = SPEC_ADDR (AST_SYMBOL (tree->left->left)->etype)
2576 SPEC_ABSA(sym->etype) = 1;
2577 addSym (SymbolTab, sym, sym->name, 0, 0, 0);
2580 AST_VALUE (tree) = symbolVal(sym);
2583 tree->type = EX_VALUE;
2591 /*------------------------------------------------------------------*/
2592 /*----------------------------*/
2593 /* ++/-- operation */
2594 /*----------------------------*/
2598 sym_link *ltc = (tree->right ? RTYPE (tree) : LTYPE (tree));
2599 COPYTYPE (TTYPE (tree), TETYPE (tree), ltc);
2600 if (!tree->initMode && IS_CONSTANT(TTYPE(tree)))
2601 werror (E_CODE_WRITE, tree->opval.op==INC_OP ? "++" : "--");
2610 /*------------------------------------------------------------------*/
2611 /*----------------------------*/
2613 /*----------------------------*/
2614 case '&': /* can be unary */
2615 /* if right is NULL then unary operation */
2616 if (tree->right) /* not an unary operation */
2619 if (!IS_INTEGRAL (LTYPE (tree)) || !IS_INTEGRAL (RTYPE (tree)))
2621 werror (E_BITWISE_OP);
2622 werror (W_CONTINUE, "left & right types are ");
2623 printTypeChain (LTYPE (tree), stderr);
2624 fprintf (stderr, ",");
2625 printTypeChain (RTYPE (tree), stderr);
2626 fprintf (stderr, "\n");
2627 goto errorTreeReturn;
2630 /* if they are both literal */
2631 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2633 tree->type = EX_VALUE;
2634 tree->opval.val = valBitwise (valFromType (LETYPE (tree)),
2635 valFromType (RETYPE (tree)), '&');
2637 tree->right = tree->left = NULL;
2638 TETYPE (tree) = tree->opval.val->etype;
2639 TTYPE (tree) = tree->opval.val->type;
2643 /* see if this is a GETHBIT operation if yes
2646 ast *otree = optimizeGetHbit (tree, resultType);
2649 return decorateType (otree, RESULT_TYPE_NONE);
2652 /* see if this is a GETABIT operation if yes
2655 ast *otree = optimizeGetAbit (tree, resultType);
2658 return decorateType (otree, RESULT_TYPE_NONE);
2661 /* see if this is a GETBYTE operation if yes
2664 ast *otree = optimizeGetByte (tree, resultType);
2667 return decorateType (otree, RESULT_TYPE_NONE);
2670 /* see if this is a GETWORD operation if yes
2673 ast *otree = optimizeGetWord (tree, resultType);
2676 return decorateType (otree, RESULT_TYPE_NONE);
2679 /* if left is a literal exchange left & right */
2680 if (IS_LITERAL (LTYPE (tree)))
2682 ast *tTree = tree->left;
2683 tree->left = tree->right;
2684 tree->right = tTree;
2687 /* if right is a literal and */
2688 /* we can find a 2nd literal in an and-tree then */
2689 /* rearrange the tree */
2690 if (IS_LITERAL (RTYPE (tree)))
2693 ast *litTree = searchLitOp (tree, &parent, "&");
2697 ast *tTree = litTree->left;
2698 litTree->left = tree->right;
2699 tree->right = tTree;
2700 /* both operands in litTree are literal now */
2701 decorateType (parent, resultType);
2705 LRVAL (tree) = RRVAL (tree) = 1;
2707 TTYPE (tree) = computeType (LTYPE (tree),
2711 TETYPE (tree) = getSpec (TTYPE (tree));
2716 /*------------------------------------------------------------------*/
2717 /*----------------------------*/
2719 /*----------------------------*/
2720 p = newLink (DECLARATOR);
2721 /* if bit field then error */
2722 if (IS_BITVAR (tree->left->etype))
2724 werror (E_ILLEGAL_ADDR, "address of bit variable");
2725 goto errorTreeReturn;
2728 if (LETYPE(tree) && SPEC_SCLS (tree->left->etype) == S_REGISTER)
2730 werror (E_ILLEGAL_ADDR, "address of register variable");
2731 goto errorTreeReturn;
2734 if (IS_FUNC (LTYPE (tree)))
2736 // this ought to be ignored
2737 return (tree->left);
2740 if (IS_LITERAL(LTYPE(tree)))
2742 werror (E_ILLEGAL_ADDR, "address of literal");
2743 goto errorTreeReturn;
2748 werror (E_LVALUE_REQUIRED, "address of");
2749 goto errorTreeReturn;
2752 DCL_TYPE (p) = POINTER;
2753 else if (SPEC_SCLS (tree->left->etype) == S_CODE)
2754 DCL_TYPE (p) = CPOINTER;
2755 else if (SPEC_SCLS (tree->left->etype) == S_XDATA)
2756 DCL_TYPE (p) = FPOINTER;
2757 else if (SPEC_SCLS (tree->left->etype) == S_XSTACK)
2758 DCL_TYPE (p) = PPOINTER;
2759 else if (SPEC_SCLS (tree->left->etype) == S_IDATA)
2760 DCL_TYPE (p) = IPOINTER;
2761 else if (SPEC_SCLS (tree->left->etype) == S_EEPROM)
2762 DCL_TYPE (p) = EEPPOINTER;
2763 else if (SPEC_OCLS(tree->left->etype))
2764 DCL_TYPE (p) = PTR_TYPE(SPEC_OCLS(tree->left->etype));
2766 DCL_TYPE (p) = POINTER;
2768 if (IS_AST_SYM_VALUE (tree->left))
2770 AST_SYMBOL (tree->left)->addrtaken = 1;
2771 AST_SYMBOL (tree->left)->allocreq = 1;
2774 p->next = LTYPE (tree);
2776 TETYPE (tree) = getSpec (TTYPE (tree));
2781 if (IS_AST_OP (tree->left) && tree->left->opval.op == PTR_OP
2782 && IS_AST_VALUE (tree->left->left) && !IS_AST_SYM_VALUE (tree->left->left))
2784 symbol *element = getStructElement (SPEC_STRUCT (LETYPE(tree->left)),
2785 AST_SYMBOL(tree->left->right));
2786 AST_VALUE(tree) = valPlus(AST_VALUE(tree->left->left),
2787 valueFromLit(element->offset));
2790 tree->type = EX_VALUE;
2791 tree->values.literalFromCast = 1;
2797 /*------------------------------------------------------------------*/
2798 /*----------------------------*/
2800 /*----------------------------*/
2802 /* if the rewrite succeeds then don't go any further */
2804 ast *wtree = optimizeRRCRLC (tree);
2806 return decorateType (wtree, RESULT_TYPE_NONE);
2808 wtree = optimizeSWAP (tree);
2810 return decorateType (wtree, RESULT_TYPE_NONE);
2813 /* if left is a literal exchange left & right */
2814 if (IS_LITERAL (LTYPE (tree)))
2816 ast *tTree = tree->left;
2817 tree->left = tree->right;
2818 tree->right = tTree;
2821 /* if right is a literal and */
2822 /* we can find a 2nd literal in an or-tree then */
2823 /* rearrange the tree */
2824 if (IS_LITERAL (RTYPE (tree)))
2827 ast *litTree = searchLitOp (tree, &parent, "|");
2831 ast *tTree = litTree->left;
2832 litTree->left = tree->right;
2833 tree->right = tTree;
2834 /* both operands in tTree are literal now */
2835 decorateType (parent, resultType);
2840 /*------------------------------------------------------------------*/
2841 /*----------------------------*/
2843 /*----------------------------*/
2845 if (!IS_INTEGRAL (LTYPE (tree)) || !IS_INTEGRAL (RTYPE (tree)))
2847 werror (E_BITWISE_OP);
2848 werror (W_CONTINUE, "left & right types are ");
2849 printTypeChain (LTYPE (tree), stderr);
2850 fprintf (stderr, ",");
2851 printTypeChain (RTYPE (tree), stderr);
2852 fprintf (stderr, "\n");
2853 goto errorTreeReturn;
2856 /* if they are both literal then rewrite the tree */
2857 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2859 tree->type = EX_VALUE;
2860 tree->opval.val = valBitwise (valFromType (LETYPE (tree)),
2861 valFromType (RETYPE (tree)),
2863 tree->right = tree->left = NULL;
2864 TETYPE (tree) = tree->opval.val->etype;
2865 TTYPE (tree) = tree->opval.val->type;
2869 /* if left is a literal exchange left & right */
2870 if (IS_LITERAL (LTYPE (tree)))
2872 ast *tTree = tree->left;
2873 tree->left = tree->right;
2874 tree->right = tTree;
2877 /* if right is a literal and */
2878 /* we can find a 2nd literal in a xor-tree then */
2879 /* rearrange the tree */
2880 if (IS_LITERAL (RTYPE (tree)) &&
2881 tree->opval.op == '^') /* the same source is used by 'bitwise or' */
2884 ast *litTree = searchLitOp (tree, &parent, "^");
2888 ast *tTree = litTree->left;
2889 litTree->left = tree->right;
2890 tree->right = tTree;
2891 /* both operands in litTree are literal now */
2892 decorateType (parent, resultType);
2896 LRVAL (tree) = RRVAL (tree) = 1;
2898 TTYPE (tree) = computeType (LTYPE (tree),
2902 TETYPE (tree) = getSpec (TTYPE (tree));
2906 /*------------------------------------------------------------------*/
2907 /*----------------------------*/
2909 /*----------------------------*/
2911 if (!IS_ARITHMETIC (LTYPE (tree)) || !IS_ARITHMETIC (RTYPE (tree)))
2913 werror (E_INVALID_OP, "divide");
2914 goto errorTreeReturn;
2916 /* if they are both literal then */
2917 /* rewrite the tree */
2918 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2920 tree->type = EX_VALUE;
2921 tree->opval.val = valDiv (valFromType (LETYPE (tree)),
2922 valFromType (RETYPE (tree)));
2923 tree->right = tree->left = NULL;
2924 TETYPE (tree) = getSpec (TTYPE (tree) =
2925 tree->opval.val->type);
2929 LRVAL (tree) = RRVAL (tree) = 1;
2931 TETYPE (tree) = getSpec (TTYPE (tree) =
2932 computeType (LTYPE (tree),
2937 /* if right is a literal and */
2938 /* left is also a division by a literal then */
2939 /* rearrange the tree */
2940 if (IS_LITERAL (RTYPE (tree))
2941 /* avoid infinite loop */
2942 && (TYPE_UDWORD) floatFromVal (tree->right->opval.val) != 1)
2945 ast *litTree = searchLitOp (tree, &parent, "/");
2948 if (IS_LITERAL (RTYPE (litTree)))
2952 litTree->right = newNode ('*',
2954 copyAst (tree->right));
2955 litTree->right->lineno = tree->lineno;
2957 tree->right->opval.val = constVal ("1");
2958 decorateType (parent, resultType);
2962 /* litTree->left is literal: no gcse possible.
2963 We can't call decorateType(parent, RESULT_TYPE_NONE), because
2964 this would cause an infinit loop. */
2965 parent->decorated = 1;
2966 decorateType (litTree, resultType);
2973 /*------------------------------------------------------------------*/
2974 /*----------------------------*/
2976 /*----------------------------*/
2978 if (!IS_INTEGRAL (LTYPE (tree)) || !IS_INTEGRAL (RTYPE (tree)))
2980 werror (E_BITWISE_OP);
2981 werror (W_CONTINUE, "left & right types are ");
2982 printTypeChain (LTYPE (tree), stderr);
2983 fprintf (stderr, ",");
2984 printTypeChain (RTYPE (tree), stderr);
2985 fprintf (stderr, "\n");
2986 goto errorTreeReturn;
2988 /* if they are both literal then */
2989 /* rewrite the tree */
2990 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
2992 tree->type = EX_VALUE;
2993 tree->opval.val = valMod (valFromType (LETYPE (tree)),
2994 valFromType (RETYPE (tree)));
2995 tree->right = tree->left = NULL;
2996 TETYPE (tree) = getSpec (TTYPE (tree) =
2997 tree->opval.val->type);
3000 LRVAL (tree) = RRVAL (tree) = 1;
3001 TETYPE (tree) = getSpec (TTYPE (tree) =
3002 computeType (LTYPE (tree),
3008 /*------------------------------------------------------------------*/
3009 /*----------------------------*/
3010 /* address dereference */
3011 /*----------------------------*/
3012 case '*': /* can be unary : if right is null then unary operation */
3015 if (!IS_PTR (LTYPE (tree)) && !IS_ARRAY (LTYPE (tree)))
3017 werror (E_PTR_REQD);
3018 goto errorTreeReturn;
3023 werror (E_LVALUE_REQUIRED, "pointer deref");
3024 goto errorTreeReturn;
3026 if (IS_ADDRESS_OF_OP(tree->left))
3028 /* replace *&obj with obj */
3029 return tree->left->left;
3031 TTYPE (tree) = copyLinkChain (LTYPE (tree)->next);
3032 TETYPE (tree) = getSpec (TTYPE (tree));
3033 /* adjust the storage class */
3034 switch (DCL_TYPE(tree->left->ftype)) {
3036 SPEC_SCLS(TETYPE(tree)) = S_DATA;
3039 SPEC_SCLS(TETYPE(tree)) = S_XDATA;
3042 SPEC_SCLS(TETYPE(tree)) = S_CODE;
3045 SPEC_SCLS (TETYPE (tree)) = 0;
3048 SPEC_SCLS(TETYPE(tree)) = S_XSTACK;
3051 SPEC_SCLS(TETYPE(tree)) = S_IDATA;
3054 SPEC_SCLS(TETYPE(tree)) = S_EEPROM;
3057 SPEC_SCLS (TETYPE (tree)) = 0;
3066 /*------------------------------------------------------------------*/
3067 /*----------------------------*/
3068 /* multiplication */
3069 /*----------------------------*/
3070 if (!IS_ARITHMETIC (LTYPE (tree)) || !IS_ARITHMETIC (RTYPE (tree)))
3072 werror (E_INVALID_OP, "multiplication");
3073 goto errorTreeReturn;
3076 /* if they are both literal then */
3077 /* rewrite the tree */
3078 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
3080 tree->type = EX_VALUE;
3081 tree->opval.val = valMult (valFromType (LETYPE (tree)),
3082 valFromType (RETYPE (tree)));
3083 tree->right = tree->left = NULL;
3084 TETYPE (tree) = getSpec (TTYPE (tree) =
3085 tree->opval.val->type);
3089 /* if left is a literal exchange left & right */
3090 if (IS_LITERAL (LTYPE (tree)))
3092 ast *tTree = tree->left;
3093 tree->left = tree->right;
3094 tree->right = tTree;
3097 /* if right is a literal and */
3098 /* we can find a 2nd literal in a mul-tree then */
3099 /* rearrange the tree */
3100 if (IS_LITERAL (RTYPE (tree)))
3103 ast *litTree = searchLitOp (tree, &parent, "*");
3107 ast *tTree = litTree->left;
3108 litTree->left = tree->right;
3109 tree->right = tTree;
3110 /* both operands in litTree are literal now */
3111 decorateType (parent, resultType);
3115 LRVAL (tree) = RRVAL (tree) = 1;
3116 tree->left = addCast (tree->left, resultType, FALSE);
3117 tree->right = addCast (tree->right, resultType, FALSE);
3118 TETYPE (tree) = getSpec (TTYPE (tree) =
3119 computeType (LTYPE (tree),
3126 /*------------------------------------------------------------------*/
3127 /*----------------------------*/
3128 /* unary '+' operator */
3129 /*----------------------------*/
3134 if (!IS_ARITHMETIC (LTYPE (tree)))
3136 werror (E_UNARY_OP, '+');
3137 goto errorTreeReturn;
3140 /* if left is a literal then do it */
3141 if (IS_LITERAL (LTYPE (tree)))
3143 tree->type = EX_VALUE;
3144 tree->opval.val = valFromType (LETYPE (tree));
3146 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
3150 COPYTYPE (TTYPE (tree), TETYPE (tree), LTYPE (tree));
3154 /*------------------------------------------------------------------*/
3155 /*----------------------------*/
3157 /*----------------------------*/
3159 /* this is not a unary operation */
3160 /* if both pointers then problem */
3161 if ((IS_PTR (LTYPE (tree)) || IS_ARRAY (LTYPE (tree))) &&
3162 (IS_PTR (RTYPE (tree)) || IS_ARRAY (RTYPE (tree))))
3164 werror (E_PTR_PLUS_PTR);
3165 goto errorTreeReturn;
3168 if (!IS_ARITHMETIC (LTYPE (tree)) &&
3169 !IS_PTR (LTYPE (tree)) && !IS_ARRAY (LTYPE (tree)))
3171 werror (E_PLUS_INVALID, "+");
3172 goto errorTreeReturn;
3175 if (!IS_ARITHMETIC (RTYPE (tree)) &&
3176 !IS_PTR (RTYPE (tree)) && !IS_ARRAY (RTYPE (tree)))
3178 werror (E_PLUS_INVALID, "+");
3179 goto errorTreeReturn;
3181 /* if they are both literal then */
3182 /* rewrite the tree */
3183 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
3185 tree->type = EX_VALUE;
3186 tree->left = addCast (tree->left, resultType, TRUE);
3187 tree->right = addCast (tree->right, resultType, TRUE);
3188 tree->opval.val = valPlus (valFromType (LETYPE (tree)),
3189 valFromType (RETYPE (tree)));
3190 tree->right = tree->left = NULL;
3191 TETYPE (tree) = getSpec (TTYPE (tree) =
3192 tree->opval.val->type);
3196 /* if the right is a pointer or left is a literal
3197 xchange left & right */
3198 if (IS_ARRAY (RTYPE (tree)) ||
3199 IS_PTR (RTYPE (tree)) ||
3200 IS_LITERAL (LTYPE (tree)))
3202 ast *tTree = tree->left;
3203 tree->left = tree->right;
3204 tree->right = tTree;
3207 /* if right is a literal and */
3208 /* left is also an addition/subtraction with a literal then */
3209 /* rearrange the tree */
3210 if (IS_LITERAL (RTYPE (tree)))
3212 ast *litTree, *parent;
3213 litTree = searchLitOp (tree, &parent, "+-");
3216 if (litTree->opval.op == '+')
3220 ast *tTree = litTree->left;
3221 litTree->left = tree->right;
3222 tree->right = tree->left;
3225 else if (litTree->opval.op == '-')
3227 if (IS_LITERAL (RTYPE (litTree)))
3231 ast *tTree = litTree->left;
3232 litTree->left = tree->right;
3233 tree->right = tTree;
3239 ast *tTree = litTree->right;
3240 litTree->right = tree->right;
3241 tree->right = tTree;
3242 litTree->opval.op = '+';
3243 tree->opval.op = '-';
3246 decorateType (parent, resultType);
3250 LRVAL (tree) = RRVAL (tree) = 1;
3251 /* if the left is a pointer */
3252 if (IS_PTR (LTYPE (tree)) || IS_AGGREGATE (LTYPE (tree)) )
3253 TETYPE (tree) = getSpec (TTYPE (tree) =
3257 tree->left = addCast (tree->left, resultType, TRUE);
3258 tree->right = addCast (tree->right, resultType, TRUE);
3259 TETYPE (tree) = getSpec (TTYPE (tree) =
3260 computeType (LTYPE (tree),
3268 /*------------------------------------------------------------------*/
3269 /*----------------------------*/
3271 /*----------------------------*/
3272 case '-': /* can be unary */
3273 /* if right is null then unary */
3277 if (!IS_ARITHMETIC (LTYPE (tree)))
3279 werror (E_UNARY_OP, tree->opval.op);
3280 goto errorTreeReturn;
3283 /* if left is a literal then do it */
3284 if (IS_LITERAL (LTYPE (tree)))
3286 tree->type = EX_VALUE;
3287 tree->opval.val = valUnaryPM (valFromType (LETYPE (tree)));
3289 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
3292 tree->left = addCast (tree->left, resultType, TRUE);
3293 TETYPE (tree) = getSpec (TTYPE (tree) =
3294 computeType (LTYPE (tree),
3302 /*------------------------------------------------------------------*/
3303 /*----------------------------*/
3305 /*----------------------------*/
3307 if (!(IS_PTR (LTYPE (tree)) ||
3308 IS_ARRAY (LTYPE (tree)) ||
3309 IS_ARITHMETIC (LTYPE (tree))))
3311 werror (E_PLUS_INVALID, "-");
3312 goto errorTreeReturn;
3315 if (!(IS_PTR (RTYPE (tree)) ||
3316 IS_ARRAY (RTYPE (tree)) ||
3317 IS_ARITHMETIC (RTYPE (tree))))
3319 werror (E_PLUS_INVALID, "-");
3320 goto errorTreeReturn;
3323 if ((IS_PTR (LTYPE (tree)) || IS_ARRAY (LTYPE (tree))) &&
3324 !(IS_PTR (RTYPE (tree)) || IS_ARRAY (RTYPE (tree)) ||
3325 IS_INTEGRAL (RTYPE (tree))))
3327 werror (E_PLUS_INVALID, "-");
3328 goto errorTreeReturn;
3331 /* if they are both literal then */
3332 /* rewrite the tree */
3333 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
3335 tree->type = EX_VALUE;
3336 tree->left = addCast (tree->left, resultType, TRUE);
3337 tree->right = addCast (tree->right, resultType, TRUE);
3338 tree->opval.val = valMinus (valFromType (LETYPE (tree)),
3339 valFromType (RETYPE (tree)));
3340 tree->right = tree->left = NULL;
3341 TETYPE (tree) = getSpec (TTYPE (tree) =
3342 tree->opval.val->type);
3346 /* if the left & right are equal then zero */
3347 if (isAstEqual (tree->left, tree->right))
3349 tree->type = EX_VALUE;
3350 tree->left = tree->right = NULL;
3351 tree->opval.val = constVal ("0");
3352 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
3356 /* if both of them are pointers or arrays then */
3357 /* the result is going to be an integer */
3358 if ((IS_ARRAY (LTYPE (tree)) || IS_PTR (LTYPE (tree))) &&
3359 (IS_ARRAY (RTYPE (tree)) || IS_PTR (RTYPE (tree))))
3360 TETYPE (tree) = TTYPE (tree) = newIntLink ();
3362 /* if only the left is a pointer */
3363 /* then result is a pointer */
3364 if (IS_PTR (LTYPE (tree)) || IS_ARRAY (LTYPE (tree)))
3365 TETYPE (tree) = getSpec (TTYPE (tree) =
3369 tree->left = addCast (tree->left, resultType, TRUE);
3370 tree->right = addCast (tree->right, resultType, TRUE);
3372 TETYPE (tree) = getSpec (TTYPE (tree) =
3373 computeType (LTYPE (tree),
3379 LRVAL (tree) = RRVAL (tree) = 1;
3381 /* if right is a literal and */
3382 /* left is also an addition/subtraction with a literal then */
3383 /* rearrange the tree */
3384 if (IS_LITERAL (RTYPE (tree))
3385 /* avoid infinite loop */
3386 && (TYPE_UDWORD) floatFromVal (tree->right->opval.val) != 0)
3388 ast *litTree, *litParent;
3389 litTree = searchLitOp (tree, &litParent, "+-");
3392 if (litTree->opval.op == '+')
3396 ast *tTree = litTree->left;
3397 litTree->left = litTree->right;
3398 litTree->right = tree->right;
3399 tree->right = tTree;
3400 tree->opval.op = '+';
3401 litTree->opval.op = '-';
3403 else if (litTree->opval.op == '-')
3405 if (IS_LITERAL (RTYPE (litTree)))
3409 ast *tTree = litTree->left;
3410 litTree->left = tree->right;
3411 tree->right = litParent->left;
3412 litParent->left = tTree;
3413 litTree->opval.op = '+';
3415 tree->decorated = 0;
3416 decorateType (tree, resultType);
3422 ast *tTree = litTree->right;
3423 litTree->right = tree->right;
3424 tree->right = tTree;
3427 decorateType (litParent, resultType);
3432 /*------------------------------------------------------------------*/
3433 /*----------------------------*/
3435 /*----------------------------*/
3437 /* can be only integral type */
3438 if (!IS_INTEGRAL (LTYPE (tree)))
3440 werror (E_UNARY_OP, tree->opval.op);
3441 goto errorTreeReturn;
3444 /* if left is a literal then do it */
3445 if (IS_LITERAL (LTYPE (tree)))
3447 tree->type = EX_VALUE;
3448 tree->opval.val = valComplement (valFromType (LETYPE (tree)));
3450 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
3451 return addCast (tree, resultType, TRUE);
3454 if (resultType == RESULT_TYPE_BIT &&
3455 IS_UNSIGNED (tree->left->etype) &&
3456 getSize (tree->left->etype) < INTSIZE)
3458 /* promotion rules are responsible for this strange result:
3459 bit -> int -> ~int -> bit
3460 uchar -> int -> ~int -> bit
3462 werror(W_COMPLEMENT);
3464 /* optimize bit-result, even if we optimize a buggy source */
3465 tree->type = EX_VALUE;
3466 tree->opval.val = constVal ("1");
3469 tree->left = addCast (tree->left, resultType, TRUE);
3471 COPYTYPE (TTYPE (tree), TETYPE (tree), LTYPE (tree));
3474 /*------------------------------------------------------------------*/
3475 /*----------------------------*/
3477 /*----------------------------*/
3479 /* can be pointer */
3480 if (!IS_ARITHMETIC (LTYPE (tree)) &&
3481 !IS_PTR (LTYPE (tree)) &&
3482 !IS_ARRAY (LTYPE (tree)))
3484 werror (E_UNARY_OP, tree->opval.op);
3485 goto errorTreeReturn;
3488 /* if left is a literal then do it */
3489 if (IS_LITERAL (LTYPE (tree)))
3491 tree->type = EX_VALUE;
3492 tree->opval.val = valNot (valFromType (LETYPE (tree)));
3494 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
3498 TTYPE (tree) = TETYPE (tree) = (resultTypeProp == RESULT_TYPE_BIT) ? newBoolLink() :newCharLink();
3501 /*------------------------------------------------------------------*/
3502 /*----------------------------*/
3504 /*----------------------------*/
3508 TTYPE (tree) = LTYPE (tree);
3509 TETYPE (tree) = LETYPE (tree);
3514 TTYPE (tree) = TETYPE (tree) = (resultTypeProp == RESULT_TYPE_BIT) ? newBoolLink() :newCharLink();
3518 TTYPE (tree) = TETYPE (tree) = newCharLink();
3522 TTYPE (tree) = TETYPE (tree) = newIntLink();
3527 if (!IS_INTEGRAL (LTYPE (tree)) || !IS_INTEGRAL (tree->left->etype))
3529 werror (E_SHIFT_OP_INVALID);
3530 werror (W_CONTINUE, "left & right types are ");
3531 printTypeChain (LTYPE (tree), stderr);
3532 fprintf (stderr, ",");
3533 printTypeChain (RTYPE (tree), stderr);
3534 fprintf (stderr, "\n");
3535 goto errorTreeReturn;
3538 /* make smaller type only if it's a LEFT_OP */
3539 if (tree->opval.op == LEFT_OP)
3540 tree->left = addCast (tree->left, resultType, TRUE);
3542 /* if they are both literal then */
3543 /* rewrite the tree */
3544 if (IS_LITERAL (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))
3546 tree->type = EX_VALUE;
3547 tree->opval.val = valShift (valFromType (LETYPE (tree)),
3548 valFromType (RETYPE (tree)),
3549 (tree->opval.op == LEFT_OP ? 1 : 0));
3550 tree->right = tree->left = NULL;
3551 TETYPE (tree) = getSpec (TTYPE (tree) =
3552 tree->opval.val->type);
3556 /* see if this is a GETBYTE operation if yes
3559 ast *otree = optimizeGetByte (tree, resultType);
3562 return decorateType (otree, RESULT_TYPE_NONE);
3565 /* see if this is a GETWORD operation if yes
3568 ast *otree = optimizeGetWord (tree, resultType);
3571 return decorateType (otree, RESULT_TYPE_NONE);
3574 LRVAL (tree) = RRVAL (tree) = 1;
3575 if (tree->opval.op == LEFT_OP)
3577 TETYPE (tree) = getSpec (TTYPE (tree) =
3578 computeType (LTYPE (tree),
3585 /* no promotion necessary */
3586 TTYPE (tree) = TETYPE (tree) = copyLinkChain (LTYPE (tree));
3587 if (IS_LITERAL (TTYPE (tree)))
3588 SPEC_SCLS (TTYPE (tree)) &= ~S_LITERAL;
3591 /* if only the right side is a literal & we are
3592 shifting more than size of the left operand then zero */
3593 if (IS_LITERAL (RTYPE (tree)) &&
3594 ((TYPE_UDWORD) floatFromVal (valFromType (RETYPE (tree)))) >=
3595 (getSize (TETYPE (tree)) * 8))
3597 if (tree->opval.op==LEFT_OP ||
3598 (tree->opval.op==RIGHT_OP && SPEC_USIGN(LETYPE(tree))))
3600 lineno=tree->lineno;
3601 werror (W_SHIFT_CHANGED,
3602 (tree->opval.op == LEFT_OP ? "left" : "right"));
3603 tree->type = EX_VALUE;
3604 tree->left = tree->right = NULL;
3605 tree->opval.val = constVal ("0");
3606 TETYPE (tree) = TTYPE (tree) = tree->opval.val->type;
3613 /*------------------------------------------------------------------*/
3614 /*----------------------------*/
3616 /*----------------------------*/
3617 case CAST: /* change the type */
3618 /* cannot cast to an aggregate type */
3619 if (IS_AGGREGATE (LTYPE (tree)))
3621 werror (E_CAST_ILLEGAL);
3622 goto errorTreeReturn;
3625 /* make sure the type is complete and sane */
3626 changePointer(LTYPE(tree));
3627 checkTypeSanity(LETYPE(tree), "(cast)");
3629 /* If code memory is read only, then pointers to code memory */
3630 /* implicitly point to constants -- make this explicit */
3632 sym_link *t = LTYPE(tree);
3633 while (t && t->next)
3635 if (IS_CODEPTR(t) && port->mem.code_ro)
3637 if (IS_SPEC(t->next))
3638 SPEC_CONST (t->next) = 1;
3640 DCL_PTR_CONST (t->next) = 1;
3647 /* if the right is a literal replace the tree */
3648 if (IS_LITERAL (RETYPE (tree))) {
3649 if (!IS_PTR (LTYPE (tree))) {
3650 tree->type = EX_VALUE;
3652 valCastLiteral (LTYPE (tree),
3653 floatFromVal (valFromType (RETYPE (tree))));
3656 TTYPE (tree) = tree->opval.val->type;
3657 tree->values.literalFromCast = 1;
3658 } else if (IS_GENPTR(LTYPE(tree)) && !IS_PTR(RTYPE(tree)) &&
3659 ((int)floatFromVal(valFromType(RETYPE(tree)))) !=0 ) /* special case of NULL */ {
3660 sym_link *rest = LTYPE(tree)->next;
3661 werror(W_LITERAL_GENERIC);
3662 TTYPE(tree) = newLink(DECLARATOR);
3663 DCL_TYPE(TTYPE(tree)) = FPOINTER;
3664 TTYPE(tree)->next = rest;
3665 tree->left->opval.lnk = TTYPE(tree);
3668 TTYPE (tree) = LTYPE (tree);
3672 TTYPE (tree) = LTYPE (tree);
3676 #if 0 // this is already checked, now this could be explicit
3677 /* if pointer to struct then check names */
3678 if (IS_PTR(LTYPE(tree)) && IS_STRUCT(LTYPE(tree)->next) &&
3679 IS_PTR(RTYPE(tree)) && IS_STRUCT(RTYPE(tree)->next) &&
3680 strcmp(SPEC_STRUCT(LETYPE(tree))->tag,SPEC_STRUCT(RETYPE(tree))->tag))
3682 werror(W_CAST_STRUCT_PTR,SPEC_STRUCT(RETYPE(tree))->tag,
3683 SPEC_STRUCT(LETYPE(tree))->tag);
3686 if (IS_ADDRESS_OF_OP(tree->right)
3687 && IS_AST_SYM_VALUE (tree->right->left)
3688 && SPEC_ABSA (AST_SYMBOL (tree->right->left)->etype)) {
3690 symbol * sym = AST_SYMBOL (tree->right->left);
3691 unsigned int gptype = 0;
3692 unsigned int addr = SPEC_ADDR (sym->etype);
3694 if (IS_GENPTR (LTYPE (tree)) && GPTRSIZE > FPTRSIZE)
3696 switch (SPEC_SCLS (sym->etype))
3699 gptype = GPTYPE_CODE;
3702 gptype = GPTYPE_FAR;
3706 gptype = GPTYPE_NEAR;
3709 gptype = GPTYPE_XSTACK;
3714 addr |= gptype << (8*(GPTRSIZE - 1));
3717 tree->type = EX_VALUE;
3719 valCastLiteral (LTYPE (tree), addr);
3720 TTYPE (tree) = tree->opval.val->type;
3721 TETYPE (tree) = getSpec (TTYPE (tree));
3724 tree->values.literalFromCast = 1;
3728 /* handle offsetof macro: */
3729 /* #define offsetof(TYPE, MEMBER) \ */
3730 /* ((unsigned) &((TYPE *)0)->MEMBER) */
3731 if (IS_ADDRESS_OF_OP(tree->right)
3732 && IS_AST_OP (tree->right->left)
3733 && tree->right->left->opval.op == PTR_OP
3734 && IS_AST_OP (tree->right->left->left)
3735 && tree->right->left->left->opval.op == CAST
3736 && IS_AST_LIT_VALUE(tree->right->left->left->right)) {
3738 symbol *element = getStructElement (
3739 SPEC_STRUCT (LETYPE(tree->right->left)),
3740 AST_SYMBOL(tree->right->left->right)
3744 tree->type = EX_VALUE;
3745 tree->opval.val = valCastLiteral (
3748 + floatFromVal (valFromType (RTYPE (tree->right->left->left)))
3751 TTYPE (tree) = tree->opval.val->type;
3752 TETYPE (tree) = getSpec (TTYPE (tree));
3759 /* if the right is a literal replace the tree */
3760 if (IS_LITERAL (RETYPE (tree))) {
3762 if (IS_PTR (LTYPE (tree)) && !IS_GENPTR (LTYPE (tree)) ) {
3763 /* rewrite (type *)litaddr
3765 and define type at litaddr temp
3766 (but only if type's storage class is not generic)
3768 ast *newTree = newNode ('&', NULL, NULL);
3771 TTYPE (newTree) = LTYPE (tree);
3772 TETYPE (newTree) = getSpec(LTYPE (tree));
3774 /* define a global symbol at the casted address*/
3775 sym = newSymbol(genSymName (0), 0);
3776 sym->type = LTYPE (tree)->next;
3778 sym->type = newLink (V_VOID);
3779 sym->etype = getSpec(sym->type);
3780 SPEC_SCLS (sym->etype) = sclsFromPtr (LTYPE (tree));
3781 sym->lineDef = tree->lineno;
3784 SPEC_STAT (sym->etype) = 1;
3785 SPEC_ADDR(sym->etype) = floatFromVal (valFromType (RTYPE (tree)));
3786 SPEC_ABSA(sym->etype) = 1;
3787 addSym (SymbolTab, sym, sym->name, 0, 0, 0);
3790 newTree->left = newAst_VALUE(symbolVal(sym));
3791 newTree->left->lineno = tree->lineno;
3792 LTYPE (newTree) = sym->type;
3793 LETYPE (newTree) = sym->etype;
3794 LLVAL (newTree) = 1;
3795 LRVAL (newTree) = 0;
3796 TLVAL (newTree) = 1;
3800 if (!IS_PTR (LTYPE (tree))) {
3801 tree->type = EX_VALUE;
3803 valCastLiteral (LTYPE (tree),
3804 floatFromVal (valFromType (RTYPE (tree))));
3805 TTYPE (tree) = tree->opval.val->type;
3808 tree->values.literalFromCast = 1;
3809 TETYPE (tree) = getSpec (TTYPE (tree));
3813 TTYPE (tree) = LTYPE (tree);
3817 TETYPE (tree) = getSpec (TTYPE (tree));
3821 /*------------------------------------------------------------------*/
3822 /*----------------------------*/
3823 /* logical &&, || */
3824 /*----------------------------*/
3827 /* each must be arithmetic type or be a pointer */
3828 if (!IS_PTR (LTYPE (tree)) &&
3829 !IS_ARRAY (LTYPE (tree)) &&
3830 !IS_INTEGRAL (LTYPE (tree)))
3832 werror (E_COMPARE_OP);
3833 goto errorTreeReturn;
3836 if (!IS_PTR (RTYPE (tree)) &&
3837 !IS_ARRAY (RTYPE (tree)) &&
3838 !IS_INTEGRAL (RTYPE (tree)))
3840 werror (E_COMPARE_OP);
3841 goto errorTreeReturn;
3843 /* if they are both literal then */
3844 /* rewrite the tree */
3845 if (IS_LITERAL (RTYPE (tree)) &&
3846 IS_LITERAL (LTYPE (tree)))
3848 tree->type = EX_VALUE;
3849 tree->opval.val = valLogicAndOr (valFromType (LTYPE (tree)),
3850 valFromType (RTYPE (tree)),
3852 tree->right = tree->left = NULL;
3853 TETYPE (tree) = getSpec (TTYPE (tree) =
3854 tree->opval.val->type);
3857 LRVAL (tree) = RRVAL (tree) = 1;
3858 TTYPE (tree) = TETYPE (tree) = (resultTypeProp == RESULT_TYPE_BIT) ? newBoolLink() :newCharLink();
3861 /*------------------------------------------------------------------*/
3862 /*----------------------------*/
3863 /* comparison operators */
3864 /*----------------------------*/
3872 ast *lt = optimizeCompare (tree);
3878 /* if they are pointers they must be castable */
3879 if (IS_PTR (LTYPE (tree)) && IS_PTR (RTYPE (tree)))
3881 if (tree->opval.op==EQ_OP &&
3882 !IS_GENPTR(LTYPE(tree)) && IS_GENPTR(RTYPE(tree))) {
3883 // we cannot cast a gptr to a !gptr: switch the leaves
3884 struct ast *s=tree->left;
3885 tree->left=tree->right;
3888 if (compareType (LTYPE (tree), RTYPE (tree)) == 0)
3890 werror (E_COMPARE_OP);
3891 fprintf (stderr, "comparing type ");
3892 printTypeChain (LTYPE (tree), stderr);
3893 fprintf (stderr, "to type ");
3894 printTypeChain (RTYPE (tree), stderr);
3895 fprintf (stderr, "\n");
3896 goto errorTreeReturn;
3899 /* else they should be promotable to one another */
3902 if (!((IS_PTR (LTYPE (tree)) && IS_LITERAL (RTYPE (tree))) ||
3903 (IS_PTR (RTYPE (tree)) && IS_LITERAL (LTYPE (tree)))))
3905 if (compareType (LTYPE (tree), RTYPE (tree)) == 0)
3907 werror (E_COMPARE_OP);
3908 fprintf (stderr, "comparing type ");
3909 printTypeChain (LTYPE (tree), stderr);
3910 fprintf (stderr, "to type ");
3911 printTypeChain (RTYPE (tree), stderr);
3912 fprintf (stderr, "\n");
3913 goto errorTreeReturn;
3916 /* if unsigned value < 0 then always false */
3917 /* if (unsigned value) > 0 then '(unsigned value) ? 1 : 0' */
3918 if (SPEC_USIGN(LETYPE(tree)) &&
3919 !IS_CHAR(LETYPE(tree)) && /* promotion to signed int */
3920 IS_LITERAL(RTYPE(tree)) &&
3921 ((int) floatFromVal (valFromType (RETYPE (tree)))) == 0)
3923 if (tree->opval.op == '<')
3927 if (tree->opval.op == '>')
3929 if (resultType == RESULT_TYPE_IFX)
3931 /* the parent is an ifx: */
3932 /* if (unsigned value) */
3936 /* (unsigned value) ? 1 : 0 */
3937 tree->opval.op = '?';
3938 tree->right = newNode (':',
3939 newAst_VALUE (constVal ("1")),
3940 tree->right); /* val 0 */
3941 tree->right->lineno = tree->lineno;
3942 tree->right->left->lineno = tree->lineno;
3943 decorateType (tree->right, RESULT_TYPE_NONE);
3946 /* if they are both literal then */
3947 /* rewrite the tree */
3948 if (IS_LITERAL (RTYPE (tree)) &&
3949 IS_LITERAL (LTYPE (tree)))
3951 tree->type = EX_VALUE;
3952 tree->opval.val = valCompare (valFromType (LETYPE (tree)),
3953 valFromType (RETYPE (tree)),
3955 tree->right = tree->left = NULL;
3956 TETYPE (tree) = getSpec (TTYPE (tree) =
3957 tree->opval.val->type);
3960 /* if one is 'signed char ' and the other one is 'unsigned char' */
3961 /* it's necessary to promote to int */
3962 if (IS_CHAR (RTYPE (tree)) && IS_CHAR (LTYPE (tree)) &&
3963 (IS_UNSIGNED (RTYPE (tree)) != IS_UNSIGNED (LTYPE (tree))))
3965 /* Literals are 'optimized' to 'unsigned char'. Try to figure out,
3966 if it's possible to use a 'signed char' */
3968 /* is left a 'unsigned char'? */
3969 if (IS_LITERAL (RTYPE (tree)) && IS_UNSIGNED (RTYPE (tree)) &&
3970 /* the value range of a 'unsigned char' is 0...255;
3971 if the actual value is < 128 it can be changed to signed */
3972 (int) floatFromVal (valFromType (RETYPE (tree))) < 128)
3974 /* now we've got 2 'signed char'! */
3975 SPEC_USIGN (RETYPE (tree)) = 0;
3977 /* same test for the left operand: */
3978 else if (IS_LITERAL (LTYPE (tree)) && IS_UNSIGNED (LTYPE (tree)) &&
3979 (int) floatFromVal (valFromType (LETYPE (tree))) < 128)
3981 SPEC_USIGN (LETYPE (tree)) = 0;
3985 werror (W_CMP_SU_CHAR);
3986 tree->left = addCast (tree->left , RESULT_TYPE_INT, TRUE);
3987 tree->right = addCast (tree->right, RESULT_TYPE_INT, TRUE);
3991 LRVAL (tree) = RRVAL (tree) = 1;
3992 TTYPE (tree) = TETYPE (tree) = newCharLink ();
3995 /*------------------------------------------------------------------*/
3996 /*----------------------------*/
3998 /*----------------------------*/
3999 case SIZEOF: /* evaluate wihout code generation */
4000 /* change the type to a integer */
4002 int size = getSize (tree->right->ftype);
4003 SNPRINTF(buffer, sizeof(buffer), "%d", size);
4004 if (!size && !IS_VOID(tree->right->ftype))
4005 werrorfl (tree->filename, tree->lineno, E_SIZEOF_INCOMPLETE_TYPE);
4007 tree->type = EX_VALUE;
4008 tree->opval.val = constVal (buffer);
4009 tree->right = tree->left = NULL;
4010 TETYPE (tree) = getSpec (TTYPE (tree) =
4011 tree->opval.val->type);
4014 /*------------------------------------------------------------------*/
4015 /*----------------------------*/
4017 /*----------------------------*/
4019 /* return typeof enum value */
4020 tree->type = EX_VALUE;
4023 if (IS_SPEC(tree->right->ftype)) {
4024 switch (SPEC_NOUN(tree->right->ftype)) {
4026 if (SPEC_LONG(tree->right->ftype)) typeofv = TYPEOF_LONG;
4027 else typeofv = TYPEOF_INT;
4030 typeofv = TYPEOF_FLOAT;
4033 typeofv = TYPEOF_FIXED16X16;
4036 typeofv = TYPEOF_CHAR;
4039 typeofv = TYPEOF_VOID;
4042 typeofv = TYPEOF_STRUCT;
4045 typeofv = TYPEOF_BITFIELD;
4048 typeofv = TYPEOF_BIT;
4051 typeofv = TYPEOF_SBIT;
4057 switch (DCL_TYPE(tree->right->ftype)) {
4059 typeofv = TYPEOF_POINTER;
4062 typeofv = TYPEOF_FPOINTER;
4065 typeofv = TYPEOF_CPOINTER;
4068 typeofv = TYPEOF_GPOINTER;
4071 typeofv = TYPEOF_PPOINTER;
4074 typeofv = TYPEOF_IPOINTER;
4077 typeofv = TYPEOF_ARRAY;
4080 typeofv = TYPEOF_FUNCTION;
4086 SNPRINTF (buffer, sizeof(buffer), "%d", typeofv);
4087 tree->opval.val = constVal (buffer);
4088 tree->right = tree->left = NULL;
4089 TETYPE (tree) = getSpec (TTYPE (tree) =
4090 tree->opval.val->type);
4093 /*------------------------------------------------------------------*/
4094 /*----------------------------*/
4095 /* conditional operator '?' */
4096 /*----------------------------*/
4098 /* the type is value of the colon operator (on the right) */
4099 assert (IS_COLON_OP (tree->right));
4100 /* if already known then replace the tree : optimizer will do it
4101 but faster to do it here */
4102 if (IS_LITERAL (LTYPE (tree)))
4104 if (((int) floatFromVal (valFromType (LETYPE (tree)))) != 0)
4105 return decorateType (tree->right->left, resultTypeProp);
4107 return decorateType (tree->right->right, resultTypeProp);
4111 tree->right = decorateType (tree->right, resultTypeProp);
4112 TTYPE (tree) = RTYPE (tree);
4113 TETYPE (tree) = getSpec (TTYPE (tree));
4118 /* if they don't match we have a problem */
4119 if ((compareType (LTYPE (tree), RTYPE (tree)) == 0) &&
4120 (compareType (RTYPE (tree), LTYPE (tree)) == 0))
4122 werror (E_TYPE_MISMATCH, "conditional operator", " ");
4123 goto errorTreeReturn;
4126 TTYPE (tree) = computeType (LTYPE (tree), RTYPE (tree),
4127 resultType, tree->opval.op);
4128 TETYPE (tree) = getSpec (TTYPE (tree));
4132 #if 0 // assignment operators are converted by the parser
4133 /*------------------------------------------------------------------*/
4134 /*----------------------------*/
4135 /* assignment operators */
4136 /*----------------------------*/
4139 /* for these it must be both must be integral */
4140 if (!IS_ARITHMETIC (LTYPE (tree)) ||
4141 !IS_ARITHMETIC (RTYPE (tree)))
4143 werror (E_OPS_INTEGRAL);
4144 goto errorTreeReturn;
4147 TETYPE (tree) = getSpec (TTYPE (tree) = LTYPE (tree));
4149 if (!tree->initMode && IS_CONSTANT (LTYPE (tree)))
4150 werror (E_CODE_WRITE, tree->opval.op==MUL_ASSIGN ? "*=" : "/=");
4154 werror (E_LVALUE_REQUIRED, tree->opval.op==MUL_ASSIGN ? "*=" : "/=");
4155 goto errorTreeReturn;
4166 /* for these it must be both must be integral */
4167 if (!IS_INTEGRAL (LTYPE (tree)) ||
4168 !IS_INTEGRAL (RTYPE (tree)))
4170 werror (E_OPS_INTEGRAL);
4171 goto errorTreeReturn;
4174 TETYPE (tree) = getSpec (TTYPE (tree) = LTYPE (tree));
4176 if (!tree->initMode && IS_CONSTANT (LETYPE (tree)))
4177 werror (E_CODE_WRITE, "&= or |= or ^= or >>= or <<=");
4181 werror (E_LVALUE_REQUIRED, "&= or |= or ^= or >>= or <<=");
4182 goto errorTreeReturn;
4188 /*------------------------------------------------------------------*/
4189 /*----------------------------*/
4191 /*----------------------------*/
4193 if (!(IS_PTR (LTYPE (tree)) ||
4194 IS_ARITHMETIC (LTYPE (tree))))
4196 werror (E_PLUS_INVALID, "-=");
4197 goto errorTreeReturn;
4200 if (!(IS_PTR (RTYPE (tree)) ||
4201 IS_ARITHMETIC (RTYPE (tree))))
4203 werror (E_PLUS_INVALID, "-=");
4204 goto errorTreeReturn;
4207 TETYPE (tree) = getSpec (TTYPE (tree) =
4208 computeType (LTYPE (tree),
4213 if (!tree->initMode && IS_CONSTANT (LETYPE (tree)))
4214 werror (E_CODE_WRITE, "-=");
4218 werror (E_LVALUE_REQUIRED, "-=");
4219 goto errorTreeReturn;
4225 /*------------------------------------------------------------------*/
4226 /*----------------------------*/
4228 /*----------------------------*/
4230 /* this is not a unary operation */
4231 /* if both pointers then problem */
4232 if (IS_PTR (LTYPE (tree)) && IS_PTR (RTYPE (tree)))
4234 werror (E_PTR_PLUS_PTR);
4235 goto errorTreeReturn;
4238 if (!IS_ARITHMETIC (LTYPE (tree)) && !IS_PTR (LTYPE (tree)))
4240 werror (E_PLUS_INVALID, "+=");
4241 goto errorTreeReturn;
4244 if (!IS_ARITHMETIC (RTYPE (tree)) && !IS_PTR (RTYPE (tree)))
4246 werror (E_PLUS_INVALID, "+=");
4247 goto errorTreeReturn;
4250 TETYPE (tree) = getSpec (TTYPE (tree) =
4251 computeType (LTYPE (tree),
4256 if (!tree->initMode && IS_CONSTANT (LETYPE (tree)))
4257 werror (E_CODE_WRITE, "+=");
4261 werror (E_LVALUE_REQUIRED, "+=");
4262 goto errorTreeReturn;
4265 tree->right = decorateType (newNode ('+', copyAst (tree->left), tree->right), RESULT_TYPE_NONE);
4266 tree->opval.op = '=';
4271 /*------------------------------------------------------------------*/
4272 /*----------------------------*/
4273 /* straight assignemnt */
4274 /*----------------------------*/
4276 /* cannot be an aggregate */
4277 if (IS_AGGREGATE (LTYPE (tree)))
4279 werror (E_AGGR_ASSIGN);
4280 goto errorTreeReturn;
4283 /* they should either match or be castable */
4284 if (compareType (LTYPE (tree), RTYPE (tree)) == 0)
4286 werror (E_TYPE_MISMATCH, "assignment", " ");
4287 printFromToType(RTYPE(tree),LTYPE(tree));
4290 /* if the left side of the tree is of type void
4291 then report error */
4292 if (IS_VOID (LTYPE (tree)))
4294 werror (E_CAST_ZERO);
4295 printFromToType(RTYPE(tree), LTYPE(tree));
4298 TETYPE (tree) = getSpec (TTYPE (tree) =
4302 if (!tree->initMode ) {
4303 if (IS_CONSTANT(LTYPE(tree)))
4304 werror (E_CODE_WRITE, "=");
4308 werror (E_LVALUE_REQUIRED, "=");
4309 goto errorTreeReturn;
4314 /*------------------------------------------------------------------*/
4315 /*----------------------------*/
4316 /* comma operator */
4317 /*----------------------------*/
4319 TETYPE (tree) = getSpec (TTYPE (tree) = RTYPE (tree));
4322 /*------------------------------------------------------------------*/
4323 /*----------------------------*/
4325 /*----------------------------*/
4328 /* undo any explicit pointer derefernce; PCALL will handle it instead */
4329 if (IS_FUNC (LTYPE (tree)) && tree->left->type == EX_OP)
4331 if (tree->left->opval.op == '*' && !tree->left->right)
4332 tree->left = tree->left->left;
4335 /* require a function or pointer to function */
4336 if (!IS_FUNC (LTYPE (tree)) && !IS_FUNCPTR (LTYPE (tree)))
4338 werrorfl (tree->filename, tree->lineno, E_FUNCTION_EXPECTED);
4339 goto errorTreeReturn;
4342 /* if there are parms, make sure that
4343 parms are decorate / process / reverse only once */
4345 !tree->right->decorated)
4350 if (IS_FUNCPTR (LTYPE (tree)))
4351 functype = LTYPE (tree)->next;
4353 functype = LTYPE (tree);
4355 if (processParms (tree->left, FUNC_ARGS(functype),
4356 &tree->right, &parmNumber, TRUE))
4358 goto errorTreeReturn;
4361 if ((options.stackAuto || IFFUNC_ISREENT (functype)) &&
4362 !IFFUNC_ISBUILTIN(functype))
4364 reverseParms (tree->right);
4367 TTYPE (tree) = functype->next;
4368 TETYPE (tree) = getSpec (TTYPE (tree));
4372 /*------------------------------------------------------------------*/
4373 /*----------------------------*/
4374 /* return statement */
4375 /*----------------------------*/
4380 if (compareType (currFunc->type->next, RTYPE (tree)) == 0)
4382 werrorfl (tree->filename, tree->lineno, W_RETURN_MISMATCH);
4383 printFromToType (RTYPE(tree), currFunc->type->next);
4384 goto errorTreeReturn;
4387 if (IS_VOID (currFunc->type->next)
4389 !IS_VOID (RTYPE (tree)))
4391 werrorfl (tree->filename, tree->lineno, E_FUNC_VOID);
4392 goto errorTreeReturn;
4395 /* if there is going to be a casting required then add it */
4396 if (compareType (currFunc->type->next, RTYPE (tree)) < 0)
4399 decorateType (newNode (CAST,
4400 newAst_LINK (copyLinkChain (currFunc->type->next)),
4410 if (!IS_VOID (currFunc->type->next) && tree->right == NULL)
4412 werror (W_VOID_FUNC, currFunc->name);
4413 goto errorTreeReturn;
4416 TTYPE (tree) = TETYPE (tree) = NULL;
4419 /*------------------------------------------------------------------*/
4420 /*----------------------------*/
4421 /* switch statement */
4422 /*----------------------------*/
4424 /* the switch value must be an integer */
4425 if (!IS_INTEGRAL (LTYPE (tree)))
4427 werrorfl (tree->filename, tree->lineno, E_SWITCH_NON_INTEGER);
4428 goto errorTreeReturn;
4431 TTYPE (tree) = TETYPE (tree) = NULL;
4434 /*------------------------------------------------------------------*/
4435 /*----------------------------*/
4437 /*----------------------------*/
4439 tree->left = backPatchLabels (tree->left,
4442 TTYPE (tree) = TETYPE (tree) = NULL;
4445 /*------------------------------------------------------------------*/
4446 /*----------------------------*/
4448 /*----------------------------*/
4451 decorateType (resolveSymbols (AST_FOR (tree, initExpr)), RESULT_TYPE_NONE);
4452 decorateType (resolveSymbols (AST_FOR (tree, condExpr)), RESULT_TYPE_NONE);
4453 decorateType (resolveSymbols (AST_FOR (tree, loopExpr)), RESULT_TYPE_NONE);
4455 /* if the for loop is reversible then
4456 reverse it otherwise do what we normally
4462 if (isLoopReversible (tree, &sym, &init, &end))
4463 return reverseLoop (tree, sym, init, end);
4465 return decorateType (createFor (AST_FOR (tree, trueLabel),
4466 AST_FOR (tree, continueLabel),
4467 AST_FOR (tree, falseLabel),
4468 AST_FOR (tree, condLabel),
4469 AST_FOR (tree, initExpr),
4470 AST_FOR (tree, condExpr),
4471 AST_FOR (tree, loopExpr),
4472 tree->left), RESULT_TYPE_NONE);
4475 werror (E_INTERNAL_ERROR, __FILE__, __LINE__,
4476 "node PARAM shouldn't be processed here");
4477 /* but in processParams() */
4480 TTYPE (tree) = TETYPE (tree) = NULL;
4484 /* some error found this tree will be killed */
4486 TTYPE (tree) = TETYPE (tree) = newCharLink ();
4487 tree->opval.op = NULLOP;
4493 /*-----------------------------------------------------------------*/
4494 /* sizeofOp - processes size of operation */
4495 /*-----------------------------------------------------------------*/
4497 sizeofOp (sym_link * type)
4502 /* make sure the type is complete and sane */
4503 checkTypeSanity(type, "(sizeof)");
4505 /* get the size and convert it to character */
4506 SNPRINTF (buff, sizeof(buff), "%d", size = getSize (type));
4507 if (!size && !IS_VOID(type))
4508 werror (E_SIZEOF_INCOMPLETE_TYPE);
4510 /* now convert into value */
4511 return constVal (buff);
4515 #define IS_AND(ex) (ex->type == EX_OP && ex->opval.op == AND_OP )
4516 #define IS_OR(ex) (ex->type == EX_OP && ex->opval.op == OR_OP )
4517 #define IS_NOT(ex) (ex->type == EX_OP && ex->opval.op == '!' )
4518 #define IS_ANDORNOT(ex) (IS_AND(ex) || IS_OR(ex) || IS_NOT(ex))
4519 #define IS_IFX(ex) (ex->type == EX_OP && ex->opval.op == IFX )
4520 #define IS_LT(ex) (ex->type == EX_OP && ex->opval.op == '<' )
4521 #define IS_GT(ex) (ex->type == EX_OP && ex->opval.op == '>')
4522 #define IS_NULLOP(ex) (ex->type == EX_OP && ex->opval.op == NULLOP)
4524 /*-----------------------------------------------------------------*/
4525 /* backPatchLabels - change and or not operators to flow control */
4526 /*-----------------------------------------------------------------*/
4528 backPatchLabels (ast * tree, symbol * trueLabel, symbol * falseLabel)
4534 if (!(IS_ANDORNOT (tree)))
4537 /* if this an and */
4540 static int localLbl = 0;
4543 SNPRINTF(buffer, sizeof(buffer), "_andif_%d", localLbl++);
4544 localLabel = newSymbol (buffer, NestLevel);
4546 tree->left = backPatchLabels (tree->left, localLabel, falseLabel);
4548 /* if left is already a IFX then just change the if true label in that */
4549 if (!IS_IFX (tree->left))
4550 tree->left = newIfxNode (tree->left, localLabel, falseLabel);
4552 tree->right = backPatchLabels (tree->right, trueLabel, falseLabel);
4553 /* right is a IFX then just join */
4554 if (IS_IFX (tree->right))
4555 return newNode (NULLOP, tree->left, createLabel (localLabel, tree->right));
4557 tree->right = createLabel (localLabel, tree->right);
4558 tree->right = newIfxNode (tree->right, trueLabel, falseLabel);
4560 return newNode (NULLOP, tree->left, tree->right);
4563 /* if this is an or operation */
4566 static int localLbl = 0;
4569 SNPRINTF(buffer, sizeof(buffer), "_orif_%d", localLbl++);
4570 localLabel = newSymbol (buffer, NestLevel);
4572 tree->left = backPatchLabels (tree->left, trueLabel, localLabel);
4574 /* if left is already a IFX then just change the if true label in that */
4575 if (!IS_IFX (tree->left))
4576 tree->left = newIfxNode (tree->left, trueLabel, localLabel);
4578 tree->right = backPatchLabels (tree->right, trueLabel, falseLabel);
4579 /* right is a IFX then just join */
4580 if (IS_IFX (tree->right))
4581 return newNode (NULLOP, tree->left, createLabel (localLabel, tree->right));
4583 tree->right = createLabel (localLabel, tree->right);
4584 tree->right = newIfxNode (tree->right, trueLabel, falseLabel);
4586 return newNode (NULLOP, tree->left, tree->right);
4592 /* call with exchanged labels */
4593 tree->left = backPatchLabels (tree->left, falseLabel, trueLabel);
4595 /* if left isn't already a IFX */
4596 if (!IS_IFX (tree->left))
4598 tree->left = newNode (IFX, tree->left, NULL);
4599 tree->left->trueLabel = falseLabel;
4600 tree->left->falseLabel = trueLabel;
4607 tree->trueLabel = trueLabel;
4608 tree->falseLabel = falseLabel;
4615 /*-----------------------------------------------------------------*/
4616 /* createBlock - create expression tree for block */
4617 /*-----------------------------------------------------------------*/
4619 createBlock (symbol * decl, ast * body)
4623 /* if the block has nothing */
4627 ex = newNode (BLOCK, NULL, body);
4628 ex->values.sym = decl;
4635 /*-----------------------------------------------------------------*/
4636 /* createLabel - creates the expression tree for labels */
4637 /*-----------------------------------------------------------------*/
4639 createLabel (symbol * label, ast * stmnt)
4642 char name[SDCC_NAME_MAX + 1];
4645 /* must create fresh symbol if the symbol name */
4646 /* exists in the symbol table, since there can */
4647 /* be a variable with the same name as the labl */
4648 if ((csym = findSym (SymbolTab, NULL, label->name)) &&
4649 (csym->level == label->level))
4650 label = newSymbol (label->name, label->level);
4652 /* change the name before putting it in add _ */
4653 SNPRINTF(name, sizeof(name), "%s", label->name);
4655 /* put the label in the LabelSymbol table */
4656 /* but first check if a label of the same */
4658 if ((csym = findSym (LabelTab, NULL, name)))
4659 werror (E_DUPLICATE_LABEL, label->name);
4661 addSym (LabelTab, label, name, label->level, 0, 0);
4665 label->key = labelKey++;
4666 rValue = newNode (LABEL, newAst_VALUE (symbolVal (label)), stmnt);
4672 /*-----------------------------------------------------------------*/
4673 /* createCase - generates the parsetree for a case statement */
4674 /*-----------------------------------------------------------------*/
4676 createCase (ast * swStat, ast * caseVal, ast * stmnt)
4678 char caseLbl[SDCC_NAME_MAX + 1];
4682 /* if the switch statement does not exist */
4683 /* then case is out of context */
4686 werrorfl (caseVal->filename, caseVal->lineno, E_CASE_CONTEXT);
4690 caseVal = decorateType (resolveSymbols (caseVal), RESULT_TYPE_NONE);
4691 /* if not a constant then error */
4692 if (!IS_LITERAL (caseVal->ftype))
4694 werrorfl (caseVal->filename, caseVal->lineno, E_CASE_CONSTANT);
4698 /* if not a integer than error */
4699 if (!IS_INTEGRAL (caseVal->ftype))
4701 werrorfl (caseVal->filename, caseVal->lineno, E_CASE_NON_INTEGER);
4705 /* find the end of the switch values chain */
4706 if (!(val = swStat->values.switchVals.swVals))
4707 swStat->values.switchVals.swVals = caseVal->opval.val;
4710 /* also order the cases according to value */
4712 int cVal = (int) floatFromVal (caseVal->opval.val);
4713 while (val && (int) floatFromVal (val) < cVal)
4719 /* if we reached the end then */
4722 pval->next = caseVal->opval.val;
4724 else if ((int) floatFromVal (val) == cVal)
4726 werrorfl (caseVal->filename, caseVal->lineno, E_DUPLICATE_LABEL,
4732 /* we found a value greater than */
4733 /* the current value we must add this */
4734 /* before the value */
4735 caseVal->opval.val->next = val;
4737 /* if this was the first in chain */
4738 if (swStat->values.switchVals.swVals == val)
4739 swStat->values.switchVals.swVals =
4742 pval->next = caseVal->opval.val;
4747 /* create the case label */
4748 SNPRINTF(caseLbl, sizeof(caseLbl),
4750 swStat->values.switchVals.swNum,
4751 (int) floatFromVal (caseVal->opval.val));
4753 rexpr = createLabel (newSymbol (caseLbl, 0), stmnt);
4758 /*-----------------------------------------------------------------*/
4759 /* createDefault - creates the parse tree for the default statement */
4760 /*-----------------------------------------------------------------*/
4762 createDefault (ast * swStat, ast * defaultVal, ast * stmnt)
4764 char defLbl[SDCC_NAME_MAX + 1];
4766 /* if the switch statement does not exist */
4767 /* then case is out of context */
4770 werrorfl (defaultVal->filename, defaultVal->lineno, E_CASE_CONTEXT);
4774 if (swStat->values.switchVals.swDefault)
4776 werrorfl (defaultVal->filename, defaultVal->lineno, E_DUPLICATE_LABEL,
4781 /* turn on the default flag */
4782 swStat->values.switchVals.swDefault = 1;
4784 /* create the label */
4785 SNPRINTF (defLbl, sizeof(defLbl),
4786 "_default_%d", swStat->values.switchVals.swNum);
4787 return createLabel (newSymbol (defLbl, 0), stmnt);
4790 /*-----------------------------------------------------------------*/
4791 /* createIf - creates the parsetree for the if statement */
4792 /*-----------------------------------------------------------------*/
4794 createIf (ast * condAst, ast * ifBody, ast * elseBody)
4796 static int Lblnum = 0;
4798 symbol *ifTrue, *ifFalse, *ifEnd;
4800 /* if neither exists */
4801 if (!elseBody && !ifBody) {
4802 // if there are no side effects (i++, j() etc)
4803 if (!hasSEFcalls(condAst)) {
4808 /* create the labels */
4809 SNPRINTF (buffer, sizeof(buffer), "_iffalse_%d", Lblnum);
4810 ifFalse = newSymbol (buffer, NestLevel);
4811 /* if no else body then end == false */
4816 SNPRINTF(buffer, sizeof(buffer), "_ifend_%d", Lblnum);
4817 ifEnd = newSymbol (buffer, NestLevel);
4820 SNPRINTF (buffer, sizeof(buffer), "_iftrue_%d", Lblnum);
4821 ifTrue = newSymbol (buffer, NestLevel);
4825 /* attach the ifTrue label to the top of it body */
4826 ifBody = createLabel (ifTrue, ifBody);
4827 /* attach a goto end to the ifBody if else is present */
4830 ifBody = newNode (NULLOP, ifBody,
4832 newAst_VALUE (symbolVal (ifEnd)),
4834 /* put the elseLabel on the else body */
4835 elseBody = createLabel (ifFalse, elseBody);
4836 /* out the end at the end of the body */
4837 elseBody = newNode (NULLOP,
4839 createLabel (ifEnd, NULL));
4843 ifBody = newNode (NULLOP, ifBody,
4844 createLabel (ifFalse, NULL));
4846 condAst = backPatchLabels (condAst, ifTrue, ifFalse);
4847 if (IS_IFX (condAst))
4850 ifTree = newIfxNode (condAst, ifTrue, ifFalse);
4852 return newNode (NULLOP, ifTree,
4853 newNode (NULLOP, ifBody, elseBody));
4857 /*-----------------------------------------------------------------*/
4858 /* createDo - creates parse tree for do */
4861 /* _docontinue_n: */
4862 /* condition_expression +-> trueLabel -> _dobody_n */
4864 /* +-> falseLabel-> _dobreak_n */
4866 /*-----------------------------------------------------------------*/
4868 createDo (symbol * trueLabel, symbol * continueLabel,
4869 symbol * falseLabel, ast * condAst, ast * doBody)
4874 /* if the body does not exist then it is simple */
4877 condAst = backPatchLabels (condAst, continueLabel, NULL);
4878 doTree = (IS_IFX (condAst) ? createLabel (continueLabel, condAst)
4879 : newNode (IFX, createLabel (continueLabel, condAst), NULL));
4880 doTree->trueLabel = continueLabel;
4881 doTree->falseLabel = NULL;
4885 /* otherwise we have a body */
4886 condAst = backPatchLabels (condAst, trueLabel, falseLabel);
4888 /* attach the body label to the top */
4889 doBody = createLabel (trueLabel, doBody);
4890 /* attach the continue label to end of body */
4891 doBody = newNode (NULLOP, doBody,
4892 createLabel (continueLabel, NULL));
4894 /* now put the break label at the end */
4895 if (IS_IFX (condAst))
4898 doTree = newIfxNode (condAst, trueLabel, falseLabel);
4900 doTree = newNode (NULLOP, doTree, createLabel (falseLabel, NULL));
4902 /* putting it together */
4903 return newNode (NULLOP, doBody, doTree);
4906 /*-----------------------------------------------------------------*/
4907 /* createFor - creates parse tree for 'for' statement */
4910 /* condExpr +-> trueLabel -> _forbody_n */
4912 /* +-> falseLabel-> _forbreak_n */
4915 /* _forcontinue_n: */
4917 /* goto _forcond_n ; */
4919 /*-----------------------------------------------------------------*/
4921 createFor (symbol * trueLabel, symbol * continueLabel,
4922 symbol * falseLabel, symbol * condLabel,
4923 ast * initExpr, ast * condExpr, ast * loopExpr,
4928 /* if loopexpression not present then we can generate it */
4929 /* the same way as a while */
4931 return newNode (NULLOP, initExpr,
4932 createWhile (trueLabel, continueLabel,
4933 falseLabel, condExpr, forBody));
4934 /* vanilla for statement */
4935 condExpr = backPatchLabels (condExpr, trueLabel, falseLabel);
4937 if (condExpr && !IS_IFX (condExpr))
4938 condExpr = newIfxNode (condExpr, trueLabel, falseLabel);
4941 /* attach condition label to condition */
4942 condExpr = createLabel (condLabel, condExpr);
4944 /* attach body label to body */
4945 forBody = createLabel (trueLabel, forBody);
4947 /* attach continue to forLoop expression & attach */
4948 /* goto the forcond @ and of loopExpression */
4949 loopExpr = createLabel (continueLabel,
4953 newAst_VALUE (symbolVal (condLabel)),
4955 /* now start putting them together */
4956 forTree = newNode (NULLOP, initExpr, condExpr);
4957 forTree = newNode (NULLOP, forTree, forBody);
4958 forTree = newNode (NULLOP, forTree, loopExpr);
4959 /* finally add the break label */
4960 forTree = newNode (NULLOP, forTree,
4961 createLabel (falseLabel, NULL));
4965 /*-----------------------------------------------------------------*/
4966 /* createWhile - creates parse tree for while statement */
4967 /* the while statement will be created as follows */
4969 /* _while_continue_n: */
4970 /* condition_expression +-> trueLabel -> _while_boby_n */
4972 /* +-> falseLabel -> _while_break_n */
4973 /* _while_body_n: */
4975 /* goto _while_continue_n */
4976 /* _while_break_n: */
4977 /*-----------------------------------------------------------------*/
4979 createWhile (symbol * trueLabel, symbol * continueLabel,
4980 symbol * falseLabel, ast * condExpr, ast * whileBody)
4984 /* put the continue label */
4985 condExpr = backPatchLabels (condExpr, trueLabel, falseLabel);
4986 condExpr = createLabel (continueLabel, condExpr);
4987 condExpr->lineno = 0;
4989 /* put the body label in front of the body */
4990 whileBody = createLabel (trueLabel, whileBody);
4991 whileBody->lineno = 0;
4992 /* put a jump to continue at the end of the body */
4993 /* and put break label at the end of the body */
4994 whileBody = newNode (NULLOP,
4997 newAst_VALUE (symbolVal (continueLabel)),
4998 createLabel (falseLabel, NULL)));
5000 /* put it all together */
5001 if (IS_IFX (condExpr))
5002 whileTree = condExpr;
5005 whileTree = newNode (IFX, condExpr, NULL);
5006 /* put the true & false labels in place */
5007 whileTree->trueLabel = trueLabel;
5008 whileTree->falseLabel = falseLabel;
5011 return newNode (NULLOP, whileTree, whileBody);
5014 /*-----------------------------------------------------------------*/
5015 /* isShiftRightLitVal _BitAndLitVal - helper function */
5016 /*-----------------------------------------------------------------*/
5018 isShiftRightLitVal_BitAndLitVal (ast * tree)
5020 /* if this is not a bit and */
5021 if (!IS_BITAND (tree))
5024 /* will look for tree of the form
5025 ( expr >> litval2) & litval1 */
5026 if (!IS_AST_LIT_VALUE (tree->right))
5029 if (!IS_RIGHT_OP (tree->left))
5032 if (!IS_AST_LIT_VALUE (tree->left->right))
5035 return tree->left->left;
5038 /*-----------------------------------------------------------------*/
5039 /* isBitAndPowOf2 - helper function */
5040 /*-----------------------------------------------------------------*/
5042 isBitAndPow2 (ast * tree)
5044 /* if this is not a bit and */
5045 if (!IS_BITAND (tree))
5048 /* will look for tree of the form
5049 ( expr & (1 << litval) */
5050 if (!IS_AST_LIT_VALUE (tree->right))
5053 return powof2 ((TYPE_UDWORD)AST_LIT_VALUE (tree->right));
5056 /*-----------------------------------------------------------------*/
5057 /* optimizeGetHbit - get highest order bit of the expression */
5058 /*-----------------------------------------------------------------*/
5060 optimizeGetHbit (ast * tree, RESULT_TYPE resultType)
5065 expr = isShiftRightLitVal_BitAndLitVal(tree);
5068 if ((AST_LIT_VALUE (tree->right) != 1) ||
5069 ((i = (int) AST_LIT_VALUE (tree->left->right)) !=
5070 (j = (getSize (TTYPE (expr)) * 8 - 1))))
5073 if (!expr && (resultType == RESULT_TYPE_BIT))
5076 if (isBitAndPow2 (tree) != (signed)getSize (TTYPE (expr)) * 8 - 1)
5082 /* make sure the port supports GETHBIT */
5083 if (port->hasExtBitOp
5084 && !port->hasExtBitOp(GETHBIT, getSize (TTYPE (expr))))
5087 return decorateType (newNode (GETHBIT, expr, NULL), RESULT_TYPE_NONE);
5090 /*-----------------------------------------------------------------*/
5091 /* optimizeGetAbit - get a single bit of the expression */
5092 /*-----------------------------------------------------------------*/
5094 optimizeGetAbit (ast * tree, RESULT_TYPE resultType)
5099 expr = isShiftRightLitVal_BitAndLitVal(tree);
5102 if (AST_LIT_VALUE (tree->right) != 1)
5104 count = tree->left->right;
5106 if (!expr && (resultType == RESULT_TYPE_BIT))
5108 int p2 = isBitAndPow2 (tree);
5112 count = newAst_VALUE (valueFromLit (p2));
5118 /* make sure the port supports GETABIT */
5119 if (port->hasExtBitOp
5120 && !port->hasExtBitOp(GETABIT, getSize (TTYPE (expr))))
5123 return decorateType (newNode (GETABIT, expr, count), RESULT_TYPE_NONE);
5127 /*-----------------------------------------------------------------*/
5128 /* optimizeGetByte - get a byte of the expression */
5129 /*-----------------------------------------------------------------*/
5131 optimizeGetByte (ast * tree, RESULT_TYPE resultType)
5137 expr = isShiftRightLitVal_BitAndLitVal(tree);
5140 i = (unsigned int) AST_LIT_VALUE (tree->left->right);
5141 count = tree->left->right;
5142 if (AST_LIT_VALUE (tree->right) != 0xFF)
5145 if (!expr && resultType == RESULT_TYPE_CHAR)
5147 /* if this is a right shift over a multiple of 8 */
5148 if (IS_RIGHT_OP (tree) && IS_AST_LIT_VALUE (tree->right))
5150 i = (unsigned int) AST_LIT_VALUE (tree->right);
5151 count = tree->right;
5155 if (!expr || (i == 0) || (i % 8) || (i >= getSize (TTYPE (expr)) * 8))
5158 /* make sure the port supports GETBYTE */
5159 if (port->hasExtBitOp
5160 && !port->hasExtBitOp(GETBYTE, getSize (TTYPE (expr))))
5163 return decorateType (newNode (GETBYTE, expr, count), RESULT_TYPE_NONE);
5166 /*-----------------------------------------------------------------*/
5167 /* optimizeGetWord - get two bytes of the expression */
5168 /*-----------------------------------------------------------------*/
5170 optimizeGetWord (ast * tree, RESULT_TYPE resultType)
5176 expr = isShiftRightLitVal_BitAndLitVal(tree);
5179 i = (unsigned int) AST_LIT_VALUE (tree->left->right);
5180 count = tree->left->right;
5181 if (AST_LIT_VALUE (tree->right) != 0xFFFF)
5184 if (!expr && resultType == RESULT_TYPE_INT)
5186 /* if this is a right shift over a multiple of 8 */
5187 if (IS_RIGHT_OP (tree) && IS_AST_LIT_VALUE (tree->right))
5189 i = (unsigned int) AST_LIT_VALUE (tree->right);
5190 count = tree->right;
5194 if (!expr || (i == 0) || (i % 8) || (i >= (getSize (TTYPE (expr))-1) * 8))
5197 /* make sure the port supports GETWORD */
5198 if (port->hasExtBitOp
5199 && !port->hasExtBitOp(GETWORD, getSize (TTYPE (expr))))
5202 return decorateType (newNode (GETWORD, expr, count), RESULT_TYPE_NONE);
5205 /*-----------------------------------------------------------------*/
5206 /* optimizeRRCRLC :- optimize for Rotate Left/Right with carry */
5207 /*-----------------------------------------------------------------*/
5209 optimizeRRCRLC (ast * root)
5211 /* will look for trees of the form
5212 (?expr << 1) | (?expr >> 7) or
5213 (?expr >> 7) | (?expr << 1) will make that
5214 into a RLC : operation ..
5216 (?expr >> 1) | (?expr << 7) or
5217 (?expr << 7) | (?expr >> 1) will make that
5218 into a RRC operation
5219 note : by 7 I mean (number of bits required to hold the
5221 /* if the root operations is not a | operation the not */
5222 if (!IS_BITOR (root))
5225 /* I have to think of a better way to match patterns this sucks */
5226 /* that aside let start looking for the first case : I use a the
5227 negative check a lot to improve the efficiency */
5228 /* (?expr << 1) | (?expr >> 7) */
5229 if (IS_LEFT_OP (root->left) &&
5230 IS_RIGHT_OP (root->right))
5233 if (!SPEC_USIGN (TETYPE (root->left->left)))
5236 if (!IS_AST_LIT_VALUE (root->left->right) ||
5237 !IS_AST_LIT_VALUE (root->right->right))
5240 /* make sure it is the same expression */
5241 if (!isAstEqual (root->left->left,
5245 if (AST_LIT_VALUE (root->left->right) != 1)
5248 if (AST_LIT_VALUE (root->right->right) !=
5249 (getSize (TTYPE (root->left->left)) * 8 - 1))
5252 /* make sure the port supports RLC */
5253 if (port->hasExtBitOp
5254 && !port->hasExtBitOp(RLC, getSize (TTYPE (root->left->left))))
5257 /* whew got the first case : create the AST */
5258 return newNode (RLC, root->left->left, NULL);
5262 /* check for second case */
5263 /* (?expr >> 7) | (?expr << 1) */
5264 if (IS_LEFT_OP (root->right) &&
5265 IS_RIGHT_OP (root->left))
5268 if (!SPEC_USIGN (TETYPE (root->left->left)))
5271 if (!IS_AST_LIT_VALUE (root->left->right) ||
5272 !IS_AST_LIT_VALUE (root->right->right))
5275 /* make sure it is the same symbol */
5276 if (!isAstEqual (root->left->left,
5280 if (AST_LIT_VALUE (root->right->right) != 1)
5283 if (AST_LIT_VALUE (root->left->right) !=
5284 (getSize (TTYPE (root->left->left)) * 8 - 1))
5287 /* make sure the port supports RLC */
5288 if (port->hasExtBitOp
5289 && !port->hasExtBitOp(RLC, getSize (TTYPE (root->left->left))))
5292 /* whew got the first case : create the AST */
5293 return newNode (RLC, root->left->left, NULL);
5298 /* third case for RRC */
5299 /* (?symbol >> 1) | (?symbol << 7) */
5300 if (IS_LEFT_OP (root->right) &&
5301 IS_RIGHT_OP (root->left))
5304 if (!SPEC_USIGN (TETYPE (root->left->left)))
5307 if (!IS_AST_LIT_VALUE (root->left->right) ||
5308 !IS_AST_LIT_VALUE (root->right->right))
5311 /* make sure it is the same symbol */
5312 if (!isAstEqual (root->left->left,
5316 if (AST_LIT_VALUE (root->left->right) != 1)
5319 if (AST_LIT_VALUE (root->right->right) !=
5320 (getSize (TTYPE (root->left->left)) * 8 - 1))
5323 /* make sure the port supports RRC */
5324 if (port->hasExtBitOp
5325 && !port->hasExtBitOp(RRC, getSize (TTYPE (root->left->left))))
5328 /* whew got the first case : create the AST */
5329 return newNode (RRC, root->left->left, NULL);
5333 /* fourth and last case for now */
5334 /* (?symbol << 7) | (?symbol >> 1) */
5335 if (IS_RIGHT_OP (root->right) &&
5336 IS_LEFT_OP (root->left))
5339 if (!SPEC_USIGN (TETYPE (root->left->left)))
5342 if (!IS_AST_LIT_VALUE (root->left->right) ||
5343 !IS_AST_LIT_VALUE (root->right->right))
5346 /* make sure it is the same symbol */
5347 if (!isAstEqual (root->left->left,
5351 if (AST_LIT_VALUE (root->right->right) != 1)
5354 if (AST_LIT_VALUE (root->left->right) !=
5355 (getSize (TTYPE (root->left->left)) * 8 - 1))
5358 /* make sure the port supports RRC */
5359 if (port->hasExtBitOp
5360 && !port->hasExtBitOp(RRC, getSize (TTYPE (root->left->left))))
5363 /* whew got the first case : create the AST */
5364 return newNode (RRC, root->left->left, NULL);
5368 /* not found return root */
5372 /*-----------------------------------------------------------------*/
5373 /* optimizeSWAP :- optimize for nibble/byte/word swaps */
5374 /*-----------------------------------------------------------------*/
5376 optimizeSWAP (ast * root)
5378 /* will look for trees of the form
5379 (?expr << 4) | (?expr >> 4) or
5380 (?expr >> 4) | (?expr << 4) will make that
5381 into a SWAP : operation ..
5382 note : by 4 I mean (number of bits required to hold the
5384 /* if the root operations is not a | operation the not */
5385 if (!IS_BITOR (root))
5388 /* (?expr << 4) | (?expr >> 4) */
5389 if ((IS_LEFT_OP (root->left) && IS_RIGHT_OP (root->right))
5390 || (IS_RIGHT_OP (root->left) && IS_LEFT_OP (root->right)))
5393 if (!SPEC_USIGN (TETYPE (root->left->left)))
5396 if (!IS_AST_LIT_VALUE (root->left->right) ||
5397 !IS_AST_LIT_VALUE (root->right->right))
5400 /* make sure it is the same expression */
5401 if (!isAstEqual (root->left->left,
5405 if (AST_LIT_VALUE (root->left->right) !=
5406 (getSize (TTYPE (root->left->left)) * 4))
5409 if (AST_LIT_VALUE (root->right->right) !=
5410 (getSize (TTYPE (root->left->left)) * 4))
5413 /* make sure the port supports SWAP */
5414 if (port->hasExtBitOp
5415 && !port->hasExtBitOp(SWAP, getSize (TTYPE (root->left->left))))
5418 /* found it : create the AST */
5419 return newNode (SWAP, root->left->left, NULL);
5423 /* not found return root */
5427 /*-----------------------------------------------------------------*/
5428 /* optimizeCompare - optimizes compares for bit variables */
5429 /*-----------------------------------------------------------------*/
5431 optimizeCompare (ast * root)
5433 ast *optExpr = NULL;
5436 unsigned int litValue;
5438 /* if nothing then return nothing */
5442 /* if not a compare op then do leaves */
5443 if (!IS_COMPARE_OP (root))
5445 root->left = optimizeCompare (root->left);
5446 root->right = optimizeCompare (root->right);
5450 /* if left & right are the same then depending
5451 of the operation do */
5452 if (isAstEqual (root->left, root->right))
5454 switch (root->opval.op)
5459 optExpr = newAst_VALUE (constVal ("0"));
5464 optExpr = newAst_VALUE (constVal ("1"));
5468 return decorateType (optExpr, RESULT_TYPE_NONE);
5471 vleft = (root->left->type == EX_VALUE ?
5472 root->left->opval.val : NULL);
5474 vright = (root->right->type == EX_VALUE ?
5475 root->right->opval.val : NULL);
5477 /* if left is a BITVAR in BITSPACE */
5478 /* and right is a LITERAL then opt- */
5479 /* imize else do nothing */
5480 if (vleft && vright &&
5481 IS_BITVAR (vleft->etype) &&
5482 IN_BITSPACE (SPEC_OCLS (vleft->etype)) &&
5483 IS_LITERAL (vright->etype))
5486 /* if right side > 1 then comparison may never succeed */
5487 if ((litValue = (int) floatFromVal (vright)) > 1)
5489 werror (W_BAD_COMPARE);
5495 switch (root->opval.op)
5497 case '>': /* bit value greater than 1 cannot be */
5498 werror (W_BAD_COMPARE);
5502 case '<': /* bit value < 1 means 0 */
5504 optExpr = newNode ('!', newAst_VALUE (vleft), NULL);
5507 case LE_OP: /* bit value <= 1 means no check */
5508 optExpr = newAst_VALUE (vright);
5511 case GE_OP: /* bit value >= 1 means only check for = */
5513 optExpr = newAst_VALUE (vleft);
5518 { /* literal is zero */
5519 switch (root->opval.op)
5521 case '<': /* bit value < 0 cannot be */
5522 werror (W_BAD_COMPARE);
5526 case '>': /* bit value > 0 means 1 */
5528 optExpr = newAst_VALUE (vleft);
5531 case LE_OP: /* bit value <= 0 means no check */
5532 case GE_OP: /* bit value >= 0 means no check */
5533 werror (W_BAD_COMPARE);
5537 case EQ_OP: /* bit == 0 means ! of bit */
5538 optExpr = newNode ('!', newAst_VALUE (vleft), NULL);
5542 return decorateType (resolveSymbols (optExpr), RESULT_TYPE_NONE);
5543 } /* end-of-if of BITVAR */
5548 /*-----------------------------------------------------------------*/
5549 /* addSymToBlock : adds the symbol to the first block we find */
5550 /*-----------------------------------------------------------------*/
5552 addSymToBlock (symbol * sym, ast * tree)
5554 /* reached end of tree or a leaf */
5555 if (!tree || IS_AST_LINK (tree) || IS_AST_VALUE (tree))
5559 if (IS_AST_OP (tree) &&
5560 tree->opval.op == BLOCK)
5563 symbol *lsym = copySymbol (sym);
5565 lsym->next = AST_VALUES (tree, sym);
5566 AST_VALUES (tree, sym) = lsym;
5570 addSymToBlock (sym, tree->left);
5571 addSymToBlock (sym, tree->right);
5574 /*-----------------------------------------------------------------*/
5575 /* processRegParms - do processing for register parameters */
5576 /*-----------------------------------------------------------------*/
5578 processRegParms (value * args, ast * body)
5582 if (IS_REGPARM (args->etype))
5583 addSymToBlock (args->sym, body);
5588 /*-----------------------------------------------------------------*/
5589 /* resetParmKey - resets the operandkeys for the symbols */
5590 /*-----------------------------------------------------------------*/
5591 DEFSETFUNC (resetParmKey)
5602 /*-----------------------------------------------------------------*/
5603 /* createFunction - This is the key node that calls the iCode for */
5604 /* generating the code for a function. Note code */
5605 /* is generated function by function, later when */
5606 /* add inter-procedural analysis this will change */
5607 /*-----------------------------------------------------------------*/
5609 createFunction (symbol * name, ast * body)
5615 iCode *piCode = NULL;
5617 if (getenv("SDCC_DEBUG_FUNCTION_POINTERS"))
5618 fprintf (stderr, "SDCCast.c:createFunction(%s)\n", name->name);
5620 /* if check function return 0 then some problem */
5621 if (checkFunction (name, NULL) == 0)
5624 /* create a dummy block if none exists */
5626 body = newNode (BLOCK, NULL, NULL);
5630 /* check if the function name already in the symbol table */
5631 if ((csym = findSym (SymbolTab, NULL, name->name)))
5634 /* special case for compiler defined functions
5635 we need to add the name to the publics list : this
5636 actually means we are now compiling the compiler
5640 addSet (&publics, name);
5645 addSymChain (&name);
5646 allocVariables (name);
5648 name->lastLine = mylineno;
5651 /* set the stack pointer */
5652 stackPtr = -port->stack.direction * port->stack.call_overhead;
5655 if (IFFUNC_ISISR (name->type))
5656 stackPtr -= port->stack.direction * port->stack.isr_overhead;
5658 if (IFFUNC_ISREENT (name->type) || options.stackAuto)
5660 if (options.useXstack)
5661 xstackPtr -= port->stack.direction * port->stack.reent_overhead;
5663 stackPtr -= port->stack.direction * port->stack.reent_overhead;
5666 fetype = getSpec (name->type); /* get the specifier for the function */
5667 /* if this is a reentrant function then */
5668 if (IFFUNC_ISREENT (name->type))
5671 allocParms (FUNC_ARGS(name->type)); /* allocate the parameters */
5673 /* do processing for parameters that are passed in registers */
5674 processRegParms (FUNC_ARGS(name->type), body);
5676 /* set the stack pointer */
5680 /* allocate & autoinit the block variables */
5681 processBlockVars (body, &stack, ALLOCATE);
5683 /* save the stack information */
5684 if (options.useXstack)
5685 name->xstack = SPEC_STAK (fetype) = stack;
5687 name->stack = SPEC_STAK (fetype) = stack;
5689 /* name needs to be mangled */
5690 SNPRINTF (name->rname, sizeof(name->rname), "%s%s", port->fun_prefix, name->name);
5692 body = resolveSymbols (body); /* resolve the symbols */
5693 body = decorateType (body, RESULT_TYPE_NONE); /* propagateType & do semantic checks */
5695 ex = newAst_VALUE (symbolVal (name)); /* create name */
5696 ex = newNode (FUNCTION, ex, body);
5697 ex->values.args = FUNC_ARGS(name->type);
5699 if (options.dump_tree) PA(ex);
5702 werror (E_FUNC_NO_CODE, name->name);
5706 /* create the node & generate intermediate code */
5708 codeOutFile = code->oFile;
5709 piCode = iCodeFromAst (ex);
5713 werror (E_FUNC_NO_CODE, name->name);
5717 eBBlockFromiCode (piCode);
5719 /* if there are any statics then do them */
5722 GcurMemmap = statsg;
5723 codeOutFile = statsg->oFile;
5724 eBBlockFromiCode (iCodeFromAst (decorateType (resolveSymbols (staticAutos), RESULT_TYPE_NONE)));
5730 /* dealloc the block variables */
5731 processBlockVars (body, &stack, DEALLOCATE);
5732 outputDebugStackSymbols();
5733 /* deallocate paramaters */
5734 deallocParms (FUNC_ARGS(name->type));
5736 if (IFFUNC_ISREENT (name->type))
5739 /* we are done freeup memory & cleanup */
5741 if (port->reset_labelKey) labelKey = 1;
5743 FUNC_HASBODY(name->type) = 1;
5744 addSet (&operKeyReset, name);
5745 applyToSet (operKeyReset, resetParmKey);
5750 cleanUpLevel (LabelTab, 0);
5751 cleanUpBlock (StructTab, 1);
5752 cleanUpBlock (TypedefTab, 1);
5754 xstack->syms = NULL;
5755 istack->syms = NULL;
5760 #define INDENT(x,f) { int i ; fprintf (f, "%d:", tree->lineno); for (i=0;i < x; i++) fprintf(f," "); }
5761 /*-----------------------------------------------------------------*/
5762 /* ast_print : prints the ast (for debugging purposes) */
5763 /*-----------------------------------------------------------------*/
5765 void ast_print (ast * tree, FILE *outfile, int indent)
5770 /* can print only decorated trees */
5771 if (!tree->decorated) return;
5773 /* if any child is an error | this one is an error do nothing */
5774 if (tree->isError ||
5775 (tree->left && tree->left->isError) ||
5776 (tree->right && tree->right->isError)) {
5777 fprintf(outfile,"ERROR_NODE(%p)\n",tree);
5781 /* print the line */
5782 /* if not block & function */
5783 if (tree->type == EX_OP &&
5784 (tree->opval.op != FUNCTION &&
5785 tree->opval.op != BLOCK &&
5786 tree->opval.op != NULLOP)) {
5789 if (tree->opval.op == FUNCTION) {
5791 value *args=FUNC_ARGS(tree->left->opval.val->type);
5792 fprintf(outfile,"FUNCTION (%s=%p) type (",
5793 tree->left->opval.val->name, tree);
5794 printTypeChain (tree->left->opval.val->type->next,outfile);
5795 fprintf(outfile,") args (");
5798 fprintf (outfile, ", ");
5800 printTypeChain (args ? args->type : NULL, outfile);
5802 args= args ? args->next : NULL;
5804 fprintf(outfile,")\n");
5805 ast_print(tree->left,outfile,indent);
5806 ast_print(tree->right,outfile,indent);
5809 if (tree->opval.op == BLOCK) {
5810 symbol *decls = tree->values.sym;
5811 INDENT(indent,outfile);
5812 fprintf(outfile,"{\n");
5814 INDENT(indent+2,outfile);
5815 fprintf(outfile,"DECLARE SYMBOL (%s=%p) type (",
5816 decls->name, decls);
5817 printTypeChain(decls->type,outfile);
5818 fprintf(outfile,")\n");
5820 decls = decls->next;
5822 ast_print(tree->right,outfile,indent+2);
5823 INDENT(indent,outfile);
5824 fprintf(outfile,"}\n");
5827 if (tree->opval.op == NULLOP) {
5828 ast_print(tree->left,outfile,indent);
5829 ast_print(tree->right,outfile,indent);
5832 INDENT(indent,outfile);
5834 /*------------------------------------------------------------------*/
5835 /*----------------------------*/
5836 /* leaf has been reached */
5837 /*----------------------------*/
5838 /* if this is of type value */
5839 /* just get the type */
5840 if (tree->type == EX_VALUE) {
5842 if (IS_LITERAL (tree->opval.val->etype)) {
5843 fprintf(outfile,"CONSTANT (%p) value = ", tree);
5844 if (SPEC_USIGN (tree->opval.val->etype))
5845 fprintf(outfile,"%u", (TYPE_UDWORD) floatFromVal(tree->opval.val));
5847 fprintf(outfile,"%d", (TYPE_DWORD) floatFromVal(tree->opval.val));
5848 fprintf(outfile,", 0x%x, %f", (TYPE_UDWORD) floatFromVal(tree->opval.val),
5849 floatFromVal(tree->opval.val));
5850 } else if (tree->opval.val->sym) {
5851 /* if the undefined flag is set then give error message */
5852 if (tree->opval.val->sym->undefined) {
5853 fprintf(outfile,"UNDEFINED SYMBOL ");
5855 fprintf(outfile,"SYMBOL ");
5857 fprintf(outfile,"(%s=%p)",
5858 tree->opval.val->sym->name,tree);
5861 fprintf(outfile," type (");
5862 printTypeChain(tree->ftype,outfile);
5863 fprintf(outfile,")\n");
5865 fprintf(outfile,"\n");
5870 /* if type link for the case of cast */
5871 if (tree->type == EX_LINK) {
5872 fprintf(outfile,"TYPENODE (%p) type = (",tree);
5873 printTypeChain(tree->opval.lnk,outfile);
5874 fprintf(outfile,")\n");
5879 /* depending on type of operator do */
5881 switch (tree->opval.op) {
5882 /*------------------------------------------------------------------*/
5883 /*----------------------------*/
5885 /*----------------------------*/
5887 fprintf(outfile,"ARRAY_OP (%p) type (",tree);
5888 printTypeChain(tree->ftype,outfile);
5889 fprintf(outfile,")\n");
5890 ast_print(tree->left,outfile,indent+2);
5891 ast_print(tree->right,outfile,indent+2);
5894 /*------------------------------------------------------------------*/
5895 /*----------------------------*/
5897 /*----------------------------*/
5899 fprintf(outfile,"STRUCT_ACCESS (%p) type (",tree);
5900 printTypeChain(tree->ftype,outfile);
5901 fprintf(outfile,")\n");
5902 ast_print(tree->left,outfile,indent+2);
5903 ast_print(tree->right,outfile,indent+2);
5906 /*------------------------------------------------------------------*/
5907 /*----------------------------*/
5908 /* struct/union pointer */
5909 /*----------------------------*/
5911 fprintf(outfile,"PTR_ACCESS (%p) type (",tree);
5912 printTypeChain(tree->ftype,outfile);
5913 fprintf(outfile,")\n");
5914 ast_print(tree->left,outfile,indent+2);
5915 ast_print(tree->right,outfile,indent+2);
5918 /*------------------------------------------------------------------*/
5919 /*----------------------------*/
5920 /* ++/-- operation */
5921 /*----------------------------*/
5924 fprintf(outfile,"post-");
5926 fprintf(outfile,"pre-");
5927 fprintf(outfile,"INC_OP (%p) type (",tree);
5928 printTypeChain(tree->ftype,outfile);
5929 fprintf(outfile,")\n");
5930 ast_print(tree->left,outfile,indent+2); /* postincrement case */
5931 ast_print(tree->right,outfile,indent+2); /* preincrement case */
5936 fprintf(outfile,"post-");
5938 fprintf(outfile,"pre-");
5939 fprintf(outfile,"DEC_OP (%p) type (",tree);
5940 printTypeChain(tree->ftype,outfile);
5941 fprintf(outfile,")\n");
5942 ast_print(tree->left,outfile,indent+2); /* postdecrement case */
5943 ast_print(tree->right,outfile,indent+2); /* predecrement case */
5946 /*------------------------------------------------------------------*/
5947 /*----------------------------*/
5949 /*----------------------------*/
5952 fprintf(outfile,"& (%p) type (",tree);
5953 printTypeChain(tree->ftype,outfile);
5954 fprintf(outfile,")\n");
5955 ast_print(tree->left,outfile,indent+2);
5956 ast_print(tree->right,outfile,indent+2);
5958 fprintf(outfile,"ADDRESS_OF (%p) type (",tree);
5959 printTypeChain(tree->ftype,outfile);
5960 fprintf(outfile,")\n");
5961 ast_print(tree->left,outfile,indent+2);
5962 ast_print(tree->right,outfile,indent+2);
5965 /*----------------------------*/
5967 /*----------------------------*/
5969 fprintf(outfile,"OR (%p) type (",tree);
5970 printTypeChain(tree->ftype,outfile);
5971 fprintf(outfile,")\n");
5972 ast_print(tree->left,outfile,indent+2);
5973 ast_print(tree->right,outfile,indent+2);
5975 /*------------------------------------------------------------------*/
5976 /*----------------------------*/
5978 /*----------------------------*/
5980 fprintf(outfile,"XOR (%p) type (",tree);
5981 printTypeChain(tree->ftype,outfile);
5982 fprintf(outfile,")\n");
5983 ast_print(tree->left,outfile,indent+2);
5984 ast_print(tree->right,outfile,indent+2);
5987 /*------------------------------------------------------------------*/
5988 /*----------------------------*/
5990 /*----------------------------*/
5992 fprintf(outfile,"DIV (%p) type (",tree);
5993 printTypeChain(tree->ftype,outfile);
5994 fprintf(outfile,")\n");
5995 ast_print(tree->left,outfile,indent+2);
5996 ast_print(tree->right,outfile,indent+2);
5998 /*------------------------------------------------------------------*/
5999 /*----------------------------*/
6001 /*----------------------------*/
6003 fprintf(outfile,"MOD (%p) type (",tree);
6004 printTypeChain(tree->ftype,outfile);
6005 fprintf(outfile,")\n");
6006 ast_print(tree->left,outfile,indent+2);
6007 ast_print(tree->right,outfile,indent+2);
6010 /*------------------------------------------------------------------*/
6011 /*----------------------------*/
6012 /* address dereference */
6013 /*----------------------------*/
6014 case '*': /* can be unary : if right is null then unary operation */
6016 fprintf(outfile,"DEREF (%p) type (",tree);
6017 printTypeChain(tree->ftype,outfile);
6018 fprintf(outfile,")\n");
6019 ast_print(tree->left,outfile,indent+2);
6022 /*------------------------------------------------------------------*/
6023 /*----------------------------*/
6024 /* multiplication */
6025 /*----------------------------*/
6026 fprintf(outfile,"MULT (%p) type (",tree);
6027 printTypeChain(tree->ftype,outfile);
6028 fprintf(outfile,")\n");
6029 ast_print(tree->left,outfile,indent+2);
6030 ast_print(tree->right,outfile,indent+2);
6034 /*------------------------------------------------------------------*/
6035 /*----------------------------*/
6036 /* unary '+' operator */
6037 /*----------------------------*/
6041 fprintf(outfile,"UPLUS (%p) type (",tree);
6042 printTypeChain(tree->ftype,outfile);
6043 fprintf(outfile,")\n");
6044 ast_print(tree->left,outfile,indent+2);
6046 /*------------------------------------------------------------------*/
6047 /*----------------------------*/
6049 /*----------------------------*/
6050 fprintf(outfile,"ADD (%p) type (",tree);
6051 printTypeChain(tree->ftype,outfile);
6052 fprintf(outfile,")\n");
6053 ast_print(tree->left,outfile,indent+2);
6054 ast_print(tree->right,outfile,indent+2);
6057 /*------------------------------------------------------------------*/
6058 /*----------------------------*/
6060 /*----------------------------*/
6061 case '-': /* can be unary */
6063 fprintf(outfile,"UMINUS (%p) type (",tree);
6064 printTypeChain(tree->ftype,outfile);
6065 fprintf(outfile,")\n");
6066 ast_print(tree->left,outfile,indent+2);
6068 /*------------------------------------------------------------------*/
6069 /*----------------------------*/
6071 /*----------------------------*/
6072 fprintf(outfile,"SUB (%p) type (",tree);
6073 printTypeChain(tree->ftype,outfile);
6074 fprintf(outfile,")\n");
6075 ast_print(tree->left,outfile,indent+2);
6076 ast_print(tree->right,outfile,indent+2);
6079 /*------------------------------------------------------------------*/
6080 /*----------------------------*/
6082 /*----------------------------*/
6084 fprintf(outfile,"COMPL (%p) type (",tree);
6085 printTypeChain(tree->ftype,outfile);
6086 fprintf(outfile,")\n");
6087 ast_print(tree->left,outfile,indent+2);
6089 /*------------------------------------------------------------------*/
6090 /*----------------------------*/
6092 /*----------------------------*/
6094 fprintf(outfile,"NOT (%p) type (",tree);
6095 printTypeChain(tree->ftype,outfile);
6096 fprintf(outfile,")\n");
6097 ast_print(tree->left,outfile,indent+2);
6099 /*------------------------------------------------------------------*/
6100 /*----------------------------*/
6102 /*----------------------------*/
6104 fprintf(outfile,"RRC (%p) type (",tree);
6105 printTypeChain(tree->ftype,outfile);
6106 fprintf(outfile,")\n");
6107 ast_print(tree->left,outfile,indent+2);
6111 fprintf(outfile,"RLC (%p) type (",tree);
6112 printTypeChain(tree->ftype,outfile);
6113 fprintf(outfile,")\n");
6114 ast_print(tree->left,outfile,indent+2);
6117 fprintf(outfile,"SWAP (%p) type (",tree);
6118 printTypeChain(tree->ftype,outfile);
6119 fprintf(outfile,")\n");
6120 ast_print(tree->left,outfile,indent+2);
6123 fprintf(outfile,"GETHBIT (%p) type (",tree);
6124 printTypeChain(tree->ftype,outfile);
6125 fprintf(outfile,")\n");
6126 ast_print(tree->left,outfile,indent+2);
6129 fprintf(outfile,"GETABIT (%p) type (",tree);
6130 printTypeChain(tree->ftype,outfile);
6131 fprintf(outfile,")\n");
6132 ast_print(tree->left,outfile,indent+2);
6133 ast_print(tree->right,outfile,indent+2);
6136 fprintf(outfile,"GETBYTE (%p) type (",tree);
6137 printTypeChain(tree->ftype,outfile);
6138 fprintf(outfile,")\n");
6139 ast_print(tree->left,outfile,indent+2);
6140 ast_print(tree->right,outfile,indent+2);
6143 fprintf(outfile,"GETWORD (%p) type (",tree);
6144 printTypeChain(tree->ftype,outfile);
6145 fprintf(outfile,")\n");
6146 ast_print(tree->left,outfile,indent+2);
6147 ast_print(tree->right,outfile,indent+2);
6150 fprintf(outfile,"LEFT_SHIFT (%p) type (",tree);
6151 printTypeChain(tree->ftype,outfile);
6152 fprintf(outfile,")\n");
6153 ast_print(tree->left,outfile,indent+2);
6154 ast_print(tree->right,outfile,indent+2);
6157 fprintf(outfile,"RIGHT_SHIFT (%p) type (",tree);
6158 printTypeChain(tree->ftype,outfile);
6159 fprintf(outfile,")\n");
6160 ast_print(tree->left,outfile,indent+2);
6161 ast_print(tree->right,outfile,indent+2);
6163 /*------------------------------------------------------------------*/
6164 /*----------------------------*/
6166 /*----------------------------*/
6167 case CAST: /* change the type */
6168 fprintf(outfile,"CAST (%p) from type (",tree);
6169 printTypeChain(tree->right->ftype,outfile);
6170 fprintf(outfile,") to type (");
6171 printTypeChain(tree->ftype,outfile);
6172 fprintf(outfile,")\n");
6173 ast_print(tree->right,outfile,indent+2);
6177 fprintf(outfile,"ANDAND (%p) type (",tree);
6178 printTypeChain(tree->ftype,outfile);
6179 fprintf(outfile,")\n");
6180 ast_print(tree->left,outfile,indent+2);
6181 ast_print(tree->right,outfile,indent+2);
6184 fprintf(outfile,"OROR (%p) type (",tree);
6185 printTypeChain(tree->ftype,outfile);
6186 fprintf(outfile,")\n");
6187 ast_print(tree->left,outfile,indent+2);
6188 ast_print(tree->right,outfile,indent+2);
6191 /*------------------------------------------------------------------*/
6192 /*----------------------------*/
6193 /* comparison operators */
6194 /*----------------------------*/
6196 fprintf(outfile,"GT(>) (%p) type (",tree);
6197 printTypeChain(tree->ftype,outfile);
6198 fprintf(outfile,")\n");
6199 ast_print(tree->left,outfile,indent+2);
6200 ast_print(tree->right,outfile,indent+2);
6203 fprintf(outfile,"LT(<) (%p) type (",tree);
6204 printTypeChain(tree->ftype,outfile);
6205 fprintf(outfile,")\n");
6206 ast_print(tree->left,outfile,indent+2);
6207 ast_print(tree->right,outfile,indent+2);
6210 fprintf(outfile,"LE(<=) (%p) type (",tree);
6211 printTypeChain(tree->ftype,outfile);
6212 fprintf(outfile,")\n");
6213 ast_print(tree->left,outfile,indent+2);
6214 ast_print(tree->right,outfile,indent+2);
6217 fprintf(outfile,"GE(>=) (%p) type (",tree);
6218 printTypeChain(tree->ftype,outfile);
6219 fprintf(outfile,")\n");
6220 ast_print(tree->left,outfile,indent+2);
6221 ast_print(tree->right,outfile,indent+2);
6224 fprintf(outfile,"EQ(==) (%p) type (",tree);
6225 printTypeChain(tree->ftype,outfile);
6226 fprintf(outfile,")\n");
6227 ast_print(tree->left,outfile,indent+2);
6228 ast_print(tree->right,outfile,indent+2);
6231 fprintf(outfile,"NE(!=) (%p) type (",tree);
6232 printTypeChain(tree->ftype,outfile);
6233 fprintf(outfile,")\n");
6234 ast_print(tree->left,outfile,indent+2);
6235 ast_print(tree->right,outfile,indent+2);
6236 /*------------------------------------------------------------------*/
6237 /*----------------------------*/
6239 /*----------------------------*/
6240 case SIZEOF: /* evaluate wihout code generation */
6241 fprintf(outfile,"SIZEOF %d\n",(getSize (tree->right->ftype)));
6244 /*------------------------------------------------------------------*/
6245 /*----------------------------*/
6246 /* conditional operator '?' */
6247 /*----------------------------*/
6249 fprintf(outfile,"QUEST(?) (%p) type (",tree);
6250 printTypeChain(tree->ftype,outfile);
6251 fprintf(outfile,")\n");
6252 ast_print(tree->left,outfile,indent+2);
6253 ast_print(tree->right,outfile,indent+2);
6257 fprintf(outfile,"COLON(:) (%p) type (",tree);
6258 printTypeChain(tree->ftype,outfile);
6259 fprintf(outfile,")\n");
6260 ast_print(tree->left,outfile,indent+2);
6261 ast_print(tree->right,outfile,indent+2);
6264 /*------------------------------------------------------------------*/
6265 /*----------------------------*/
6266 /* assignment operators */
6267 /*----------------------------*/
6269 fprintf(outfile,"MULASS(*=) (%p) type (",tree);
6270 printTypeChain(tree->ftype,outfile);
6271 fprintf(outfile,")\n");
6272 ast_print(tree->left,outfile,indent+2);
6273 ast_print(tree->right,outfile,indent+2);
6276 fprintf(outfile,"DIVASS(/=) (%p) type (",tree);
6277 printTypeChain(tree->ftype,outfile);
6278 fprintf(outfile,")\n");
6279 ast_print(tree->left,outfile,indent+2);
6280 ast_print(tree->right,outfile,indent+2);
6283 fprintf(outfile,"ANDASS(&=) (%p) type (",tree);
6284 printTypeChain(tree->ftype,outfile);
6285 fprintf(outfile,")\n");
6286 ast_print(tree->left,outfile,indent+2);
6287 ast_print(tree->right,outfile,indent+2);
6290 fprintf(outfile,"ORASS(|=) (%p) type (",tree);
6291 printTypeChain(tree->ftype,outfile);
6292 fprintf(outfile,")\n");
6293 ast_print(tree->left,outfile,indent+2);
6294 ast_print(tree->right,outfile,indent+2);
6297 fprintf(outfile,"XORASS(^=) (%p) type (",tree);
6298 printTypeChain(tree->ftype,outfile);
6299 fprintf(outfile,")\n");
6300 ast_print(tree->left,outfile,indent+2);
6301 ast_print(tree->right,outfile,indent+2);
6304 fprintf(outfile,"RSHFTASS(>>=) (%p) type (",tree);
6305 printTypeChain(tree->ftype,outfile);
6306 fprintf(outfile,")\n");
6307 ast_print(tree->left,outfile,indent+2);
6308 ast_print(tree->right,outfile,indent+2);
6311 fprintf(outfile,"LSHFTASS(<<=) (%p) type (",tree);
6312 printTypeChain(tree->ftype,outfile);
6313 fprintf(outfile,")\n");
6314 ast_print(tree->left,outfile,indent+2);
6315 ast_print(tree->right,outfile,indent+2);
6317 /*------------------------------------------------------------------*/
6318 /*----------------------------*/
6320 /*----------------------------*/
6322 fprintf(outfile,"SUBASS(-=) (%p) type (",tree);
6323 printTypeChain(tree->ftype,outfile);
6324 fprintf(outfile,")\n");
6325 ast_print(tree->left,outfile,indent+2);
6326 ast_print(tree->right,outfile,indent+2);
6328 /*------------------------------------------------------------------*/
6329 /*----------------------------*/
6331 /*----------------------------*/
6333 fprintf(outfile,"ADDASS(+=) (%p) type (",tree);
6334 printTypeChain(tree->ftype,outfile);
6335 fprintf(outfile,")\n");
6336 ast_print(tree->left,outfile,indent+2);
6337 ast_print(tree->right,outfile,indent+2);
6339 /*------------------------------------------------------------------*/
6340 /*----------------------------*/
6341 /* straight assignemnt */
6342 /*----------------------------*/
6344 fprintf(outfile,"ASSIGN(=) (%p) type (",tree);
6345 printTypeChain(tree->ftype,outfile);
6346 fprintf(outfile,")\n");
6347 ast_print(tree->left,outfile,indent+2);
6348 ast_print(tree->right,outfile,indent+2);
6350 /*------------------------------------------------------------------*/
6351 /*----------------------------*/
6352 /* comma operator */
6353 /*----------------------------*/
6355 fprintf(outfile,"COMMA(,) (%p) type (",tree);
6356 printTypeChain(tree->ftype,outfile);
6357 fprintf(outfile,")\n");
6358 ast_print(tree->left,outfile,indent+2);
6359 ast_print(tree->right,outfile,indent+2);
6361 /*------------------------------------------------------------------*/
6362 /*----------------------------*/
6364 /*----------------------------*/
6367 fprintf(outfile,"CALL (%p) type (",tree);
6368 printTypeChain(tree->ftype,outfile);
6369 fprintf(outfile,")\n");
6370 ast_print(tree->left,outfile,indent+2);
6371 ast_print(tree->right,outfile,indent+2);
6374 fprintf(outfile,"PARMS\n");
6375 ast_print(tree->left,outfile,indent+2);
6376 if (tree->right /*&& !IS_AST_PARAM(tree->right)*/) {
6377 ast_print(tree->right,outfile,indent+2);
6380 /*------------------------------------------------------------------*/
6381 /*----------------------------*/
6382 /* return statement */
6383 /*----------------------------*/
6385 fprintf(outfile,"RETURN (%p) type (",tree);
6387 printTypeChain(tree->right->ftype,outfile);
6389 fprintf(outfile,")\n");
6390 ast_print(tree->right,outfile,indent+2);
6392 /*------------------------------------------------------------------*/
6393 /*----------------------------*/
6394 /* label statement */
6395 /*----------------------------*/
6397 fprintf(outfile,"LABEL (%p)\n",tree);
6398 ast_print(tree->left,outfile,indent+2);
6399 ast_print(tree->right,outfile,indent);
6401 /*------------------------------------------------------------------*/
6402 /*----------------------------*/
6403 /* switch statement */
6404 /*----------------------------*/
6408 fprintf(outfile,"SWITCH (%p) ",tree);
6409 ast_print(tree->left,outfile,0);
6410 for (val = tree->values.switchVals.swVals; val ; val = val->next) {
6411 INDENT(indent+2,outfile);
6412 fprintf(outfile,"CASE 0x%x GOTO _case_%d_%d\n",
6413 (int) floatFromVal(val),
6414 tree->values.switchVals.swNum,
6415 (int) floatFromVal(val));
6417 ast_print(tree->right,outfile,indent);
6420 /*------------------------------------------------------------------*/
6421 /*----------------------------*/
6423 /*----------------------------*/
6425 fprintf(outfile,"IF (%p) \n",tree);
6426 ast_print(tree->left,outfile,indent+2);
6427 if (tree->trueLabel) {
6428 INDENT(indent+2,outfile);
6429 fprintf(outfile,"NE(!=) 0 goto %s\n",tree->trueLabel->name);
6431 if (tree->falseLabel) {
6432 INDENT(indent+2,outfile);
6433 fprintf(outfile,"EQ(==) 0 goto %s\n",tree->falseLabel->name);
6435 ast_print(tree->right,outfile,indent+2);
6437 /*----------------------------*/
6438 /* goto Statement */
6439 /*----------------------------*/
6441 fprintf(outfile,"GOTO (%p) \n",tree);
6442 ast_print(tree->left,outfile,indent+2);
6443 fprintf(outfile,"\n");
6445 /*------------------------------------------------------------------*/
6446 /*----------------------------*/
6448 /*----------------------------*/
6450 fprintf(outfile,"FOR (%p) \n",tree);
6451 if (AST_FOR( tree, initExpr)) {
6452 INDENT(indent+2,outfile);
6453 fprintf(outfile,"INIT EXPR ");
6454 ast_print(AST_FOR(tree, initExpr),outfile,indent+2);
6456 if (AST_FOR( tree, condExpr)) {
6457 INDENT(indent+2,outfile);
6458 fprintf(outfile,"COND EXPR ");
6459 ast_print(AST_FOR(tree, condExpr),outfile,indent+2);
6461 if (AST_FOR( tree, loopExpr)) {
6462 INDENT(indent+2,outfile);
6463 fprintf(outfile,"LOOP EXPR ");
6464 ast_print(AST_FOR(tree, loopExpr),outfile,indent+2);
6466 fprintf(outfile,"FOR LOOP BODY \n");
6467 ast_print(tree->left,outfile,indent+2);
6470 fprintf(outfile,"CRITICAL (%p) \n",tree);
6471 ast_print(tree->left,outfile,indent+2);
6479 ast_print(t,stdout,0);
6484 /*-----------------------------------------------------------------*/
6485 /* astErrors : returns non-zero if errors present in tree */
6486 /*-----------------------------------------------------------------*/
6487 int astErrors(ast *t)
6496 if (t->type == EX_VALUE
6497 && t->opval.val->sym
6498 && t->opval.val->sym->undefined)
6501 errors += astErrors(t->left);
6502 errors += astErrors(t->right);