1 /*-----------------------------------------------------------------------
3 SDCC.y - parser definition file for sdcc :
4 Written By : Sandeep Dutta . sandeep.dutta@usa.net (1997)
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 -------------------------------------------------------------------------*/
28 #include "SDCCglobl.h"
30 #include "SDCChasht.h"
39 extern int yyerror (char *);
41 int NestLevel = 0 ; /* current NestLevel */
42 int stackPtr = 1 ; /* stack pointer */
43 int xstackPtr = 0 ; /* xstack pointer */
45 int blockNo = 0 ; /* sequential block number */
51 char lbuff[1024]; /* local buffer */
53 /* break & continue stacks */
54 STACK_DCL(continueStack ,symbol *,MAX_NEST_LEVEL)
55 STACK_DCL(breakStack ,symbol *,MAX_NEST_LEVEL)
56 STACK_DCL(forStack ,symbol *,MAX_NEST_LEVEL)
57 STACK_DCL(swStk ,ast *,MAX_NEST_LEVEL)
58 STACK_DCL(blockNum,int,MAX_NEST_LEVEL*3)
60 value *cenum = NULL ; /* current enumeration type chain*/
61 bool uselessDecl = TRUE;
67 symbol *sym ; /* symbol table pointer */
68 structdef *sdef; /* structure definition */
69 char yychar[SDCC_NAME_MAX+1];
70 sym_link *lnk ; /* declarator or specifier */
71 int yyint; /* integer value returned */
72 value *val ; /* for integer constant */
73 initList *ilist; /* initial list */
74 const char *yyinline; /* inlined assembler code */
75 ast *asts; /* expression tree */
78 %token <yychar> IDENTIFIER TYPE_NAME
79 %token <val> CONSTANT STRING_LITERAL
81 %token PTR_OP INC_OP DEC_OP LEFT_OP RIGHT_OP LE_OP GE_OP EQ_OP NE_OP
83 %token <yyint> MUL_ASSIGN DIV_ASSIGN MOD_ASSIGN ADD_ASSIGN
84 %token <yyint> SUB_ASSIGN LEFT_ASSIGN RIGHT_ASSIGN AND_ASSIGN
85 %token <yyint> XOR_ASSIGN OR_ASSIGN
86 %token TYPEDEF EXTERN STATIC AUTO REGISTER CODE EEPROM INTERRUPT SFR AT SBIT
87 %token REENTRANT USING XDATA DATA IDATA PDATA VAR_ARGS CRITICAL NONBANKED BANKED
88 %token CHAR SHORT INT LONG SIGNED UNSIGNED FLOAT DOUBLE CONST VOLATILE VOID BIT
89 %token STRUCT UNION ENUM ELIPSIS RANGE FAR
90 %token CASE DEFAULT IF ELSE SWITCH WHILE DO FOR GOTO CONTINUE BREAK RETURN
91 %token NAKED JAVANATIVE OVERLAY
92 %token <yyinline> INLINEASM
93 %token IFX ADDRESS_OF GET_VALUE_AT_ADDRESS SPIL UNSPIL GETHBIT
94 %token BITWISEAND UNARYMINUS IPUSH IPOP PCALL ENDFUNCTION JUMPTABLE
96 %token CAST CALL PARAM NULLOP BLOCK LABEL RECEIVE SEND ARRAYINIT
97 %token DUMMY_READ_VOLATILE ENDCRITICAL SWAP
99 %type <yyint> Interrupt_storage
100 %type <sym> identifier declarator declarator2 enumerator_list enumerator
101 %type <sym> struct_declarator
102 %type <sym> struct_declarator_list struct_declaration struct_declaration_list
103 %type <sym> declaration init_declarator_list init_declarator
104 %type <sym> declaration_list identifier_list parameter_identifier_list
105 %type <sym> declarator2_function_attributes while do for critical
106 %type <lnk> pointer type_specifier_list type_specifier type_name
107 %type <lnk> storage_class_specifier struct_or_union_specifier
108 %type <lnk> declaration_specifiers sfr_reg_bit type_specifier2
109 %type <lnk> function_attribute function_attributes enum_specifier
110 %type <lnk> abstract_declarator abstract_declarator2 unqualified_pointer
111 %type <val> parameter_type_list parameter_list parameter_declaration opt_assign_expr
112 %type <sdef> stag opt_stag
113 %type <asts> primary_expr
114 %type <asts> postfix_expr unary_expr cast_expr multiplicative_expr
115 %type <asts> additive_expr shift_expr relational_expr equality_expr
116 %type <asts> and_expr exclusive_or_expr inclusive_or_expr logical_or_expr
117 %type <asts> logical_and_expr conditional_expr assignment_expr constant_expr
118 %type <asts> expr argument_expr_list function_definition expr_opt
119 %type <asts> statement_list statement labeled_statement compound_statement
120 %type <asts> expression_statement selection_statement iteration_statement
121 %type <asts> jump_statement function_body else_statement string_literal
122 %type <asts> critical_statement
123 %type <ilist> initializer initializer_list
124 %type <yyint> unary_operator assignment_operator struct_or_union
131 : external_definition
132 | file external_definition
136 : function_definition {
141 && IS_FUNC($1->type))
143 /* The only legal storage classes for
144 * a function prototype (declaration)
145 * are extern and static. extern is the
146 * default. Thus, if this function isn't
147 * explicitly marked static, mark it
151 && IS_SPEC($1->etype)
152 && !SPEC_STAT($1->etype))
154 SPEC_EXTR($1->etype) = 1;
158 allocVariables ($1) ;
159 cleanUpLevel (SymbolTab,1);
164 : declarator function_body { /* function type not specified */
165 /* assume it to be 'int' */
166 addDecl($1,0,newIntLink());
167 $$ = createFunction($1,$2);
169 | declaration_specifiers declarator function_body
171 pointerTypes($2->type,copyLinkChain($1));
173 $$ = createFunction($2,$3);
178 : function_attributes
179 | function_attributes function_attribute { $$ = mergeSpec($1,$2,"function_attribute"); }
184 $$ = newLink(SPECIFIER) ;
185 FUNC_REGBANK($$) = (int) floatFromVal($2);
187 | REENTRANT { $$ = newLink (SPECIFIER);
190 | CRITICAL { $$ = newLink (SPECIFIER);
191 FUNC_ISCRITICAL($$) = 1;
193 | NAKED { $$ = newLink (SPECIFIER);
196 | JAVANATIVE { $$ = newLink (SPECIFIER);
197 FUNC_ISJAVANATIVE($$)=1;
199 | OVERLAY { $$ = newLink (SPECIFIER);
200 FUNC_ISOVERLAY($$)=1;
202 | NONBANKED {$$ = newLink (SPECIFIER);
203 FUNC_NONBANKED($$) = 1;
204 if (FUNC_BANKED($$)) {
205 werror(W_BANKED_WITH_NONBANKED);
208 | BANKED {$$ = newLink (SPECIFIER);
210 if (FUNC_NONBANKED($$)) {
211 werror(W_BANKED_WITH_NONBANKED);
214 werror(W_BANKED_WITH_STATIC);
219 $$ = newLink (SPECIFIER) ;
220 FUNC_INTNO($$) = $1 ;
227 | declaration_list compound_statement
229 werror(E_OLD_STYLE,($1 ? $1->name: "")) ;
235 : identifier { $$ = newAst_VALUE(symbolVal($1)); }
236 | CONSTANT { $$ = newAst_VALUE($1); }
238 | '(' expr ')' { $$ = $2 ; }
242 : STRING_LITERAL { $$ = newAst_VALUE($1); }
247 | postfix_expr '[' expr ']' { $$ = newNode ('[', $1, $3) ; }
248 | postfix_expr '(' ')' { $$ = newNode (CALL,$1,NULL);
249 $$->left->funcName = 1;}
250 | postfix_expr '(' argument_expr_list ')'
252 $$ = newNode (CALL,$1,$3) ; $$->left->funcName = 1;
254 | postfix_expr '.' identifier
256 $3 = newSymbol($3->name,NestLevel);
258 $$ = newNode(PTR_OP,newNode('&',$1,NULL),newAst_VALUE(symbolVal($3)));
259 /* $$ = newNode('.',$1,newAst(EX_VALUE,symbolVal($3))) ; */
261 | postfix_expr PTR_OP identifier
263 $3 = newSymbol($3->name,NestLevel);
265 $$ = newNode(PTR_OP,$1,newAst_VALUE(symbolVal($3)));
267 | postfix_expr INC_OP
268 { $$ = newNode(INC_OP,$1,NULL);}
269 | postfix_expr DEC_OP
270 { $$ = newNode(DEC_OP,$1,NULL); }
275 | assignment_expr ',' argument_expr_list { $$ = newNode(PARAM,$1,$3); }
280 | INC_OP unary_expr { $$ = newNode(INC_OP,NULL,$2); }
281 | DEC_OP unary_expr { $$ = newNode(DEC_OP,NULL,$2); }
282 | unary_operator cast_expr { $$ = newNode($1,$2,NULL) ; }
283 | SIZEOF unary_expr { $$ = newNode(SIZEOF,NULL,$2); }
284 | SIZEOF '(' type_name ')' { $$ = newAst_VALUE(sizeofOp($3)); }
285 | TYPEOF unary_expr { $$ = newNode(TYPEOF,NULL,$2); }
299 | '(' type_name ')' cast_expr { $$ = newNode(CAST,newAst_LINK($2),$4); }
304 | multiplicative_expr '*' cast_expr { $$ = newNode('*',$1,$3);}
305 | multiplicative_expr '/' cast_expr { $$ = newNode('/',$1,$3);}
306 | multiplicative_expr '%' cast_expr { $$ = newNode('%',$1,$3);}
310 : multiplicative_expr
311 | additive_expr '+' multiplicative_expr { $$=newNode('+',$1,$3);}
312 | additive_expr '-' multiplicative_expr { $$=newNode('-',$1,$3);}
317 | shift_expr LEFT_OP additive_expr { $$ = newNode(LEFT_OP,$1,$3); }
318 | shift_expr RIGHT_OP additive_expr { $$ = newNode(RIGHT_OP,$1,$3); }
323 | relational_expr '<' shift_expr {
325 newNode('!',newNode(GE_OP,$1,$3),NULL) :
326 newNode('<', $1,$3));
328 | relational_expr '>' shift_expr {
330 newNode('!',newNode(LE_OP,$1,$3),NULL) :
333 | relational_expr LE_OP shift_expr {
335 newNode('!', newNode('>', $1 , $3 ), NULL) :
336 newNode(LE_OP,$1,$3));
338 | relational_expr GE_OP shift_expr {
340 newNode('!', newNode('<', $1 , $3 ), NULL) :
341 newNode(GE_OP,$1,$3));
347 | equality_expr EQ_OP relational_expr {
349 newNode('!',newNode(NE_OP,$1,$3),NULL) :
350 newNode(EQ_OP,$1,$3));
352 | equality_expr NE_OP relational_expr {
354 newNode('!', newNode(EQ_OP,$1,$3), NULL) :
355 newNode(NE_OP,$1,$3));
361 | and_expr '&' equality_expr { $$ = newNode('&',$1,$3);}
366 | exclusive_or_expr '^' and_expr { $$ = newNode('^',$1,$3);}
371 | inclusive_or_expr '|' exclusive_or_expr { $$ = newNode('|',$1,$3);}
376 | logical_and_expr AND_OP inclusive_or_expr
377 { $$ = newNode(AND_OP,$1,$3);}
382 | logical_or_expr OR_OP logical_and_expr
383 { $$ = newNode(OR_OP,$1,$3); }
388 | logical_or_expr '?' logical_or_expr ':' conditional_expr
390 $$ = newNode(':',$3,$5) ;
391 $$ = newNode('?',$1,$$) ;
397 | unary_expr assignment_operator assignment_expr
402 $$ = newNode($2,$1,$3);
405 $$ = newNode('=',removePostIncDecOps(copyAst($1)),
406 newNode('*',removePreIncDecOps(copyAst($1)),$3));
409 $$ = newNode('=',removePostIncDecOps(copyAst($1)),
410 newNode('/',removePreIncDecOps(copyAst($1)),$3));
413 $$ = newNode('=',removePostIncDecOps(copyAst($1)),
414 newNode('%',removePreIncDecOps(copyAst($1)),$3));
417 $$ = newNode('=',removePostIncDecOps(copyAst($1)),
418 newNode('+',removePreIncDecOps(copyAst($1)),$3));
421 $$ = newNode('=',removePostIncDecOps(copyAst($1)),
422 newNode('-',removePreIncDecOps(copyAst($1)),$3));
425 $$ = newNode('=',removePostIncDecOps(copyAst($1)),
426 newNode(LEFT_OP,removePreIncDecOps(copyAst($1)),$3));
429 $$ = newNode('=',removePostIncDecOps(copyAst($1)),
430 newNode(RIGHT_OP,removePreIncDecOps(copyAst($1)),$3));
433 $$ = newNode('=',removePostIncDecOps(copyAst($1)),
434 newNode('&',removePreIncDecOps(copyAst($1)),$3));
437 $$ = newNode('=',removePostIncDecOps(copyAst($1)),
438 newNode('^',removePreIncDecOps(copyAst($1)),$3));
441 /* $$ = newNode('=',$1,newNode('|',removeIncDecOps(copyAst($1)),$3)); */
442 $$ = newNode('=',removePostIncDecOps(copyAst($1)),
443 newNode('|',removePreIncDecOps(copyAst($1)),$3));
468 | expr ',' assignment_expr { $$ = newNode(',',$1,$3);}
476 : declaration_specifiers ';'
479 werror(W_USELESS_DECL);
483 | declaration_specifiers init_declarator_list ';'
485 /* add the specifier list to the id */
488 for (sym1 = sym = reverseSyms($2);sym != NULL;sym = sym->next) {
489 sym_link *lnk = copyLinkChain($1);
490 /* do the pointer stuff */
491 pointerTypes(sym->type,lnk);
492 addDecl (sym,0,lnk) ;
500 declaration_specifiers
501 : storage_class_specifier { $$ = $1; }
502 | storage_class_specifier declaration_specifiers {
503 /* if the decl $2 is not a specifier */
504 /* find the spec and replace it */
507 while (lnk && !IS_SPEC(lnk->next))
509 lnk->next = mergeSpec($1,lnk->next, "storage_class_specifier declaration_specifiers - skipped");
513 $$ = mergeSpec($1,$2, "storage_class_specifier declaration_specifiers");
515 | type_specifier { $$ = $1; }
516 | type_specifier declaration_specifiers {
517 /* if the decl $2 is not a specifier */
518 /* find the spec and replace it */
521 while (lnk && !IS_SPEC(lnk->next))
523 lnk->next = mergeSpec($1,lnk->next, "type_specifier declaration_specifiers - skipped");
527 $$ = mergeSpec($1,$2, "type_specifier declaration_specifiers");
533 | init_declarator_list ',' init_declarator { $3->next = $1 ; $$ = $3;}
537 : declarator { $1->ival = NULL ; }
538 | declarator '=' initializer { $1->ival = $3 ; }
542 storage_class_specifier
544 $$ = newLink (SPECIFIER) ;
545 SPEC_TYPEDEF($$) = 1 ;
548 $$ = newLink(SPECIFIER);
552 $$ = newLink (SPECIFIER);
556 $$ = newLink (SPECIFIER) ;
557 SPEC_SCLS($$) = S_AUTO ;
560 $$ = newLink (SPECIFIER);
561 SPEC_SCLS($$) = S_REGISTER ;
566 : INTERRUPT { $$ = INTNO_UNSPEC ; }
568 { int intno = (int) floatFromVal($2);
569 if ((intno >= 0) && (intno <= INTNO_MAX))
573 werror(E_INT_BAD_INTNO, intno);
581 | type_specifier2 AT constant_expr
583 /* add this to the storage class specifier */
584 SPEC_ABSA($1) = 1; /* set the absolute addr flag */
585 /* now get the abs addr from value */
586 SPEC_ADDR($1) = (int) floatFromVal(constExprValue($3,TRUE)) ;
592 $$=newLink(SPECIFIER);
593 SPEC_NOUN($$) = V_CHAR ;
596 $$=newLink(SPECIFIER);
597 $$->select.s._short = 1 ;
600 $$=newLink(SPECIFIER);
601 SPEC_NOUN($$) = V_INT ;
604 $$=newLink(SPECIFIER);
608 $$=newLink(SPECIFIER);
609 $$->select.s._signed = 1;
612 $$=newLink(SPECIFIER);
616 $$=newLink(SPECIFIER);
617 SPEC_NOUN($$) = V_VOID ;
620 $$=newLink(SPECIFIER);
624 $$=newLink(SPECIFIER);
625 SPEC_VOLATILE($$) = 1 ;
628 $$=newLink(SPECIFIER);
629 SPEC_NOUN($$) = V_FLOAT;
632 $$ = newLink (SPECIFIER);
633 SPEC_SCLS($$) = S_XDATA ;
636 $$ = newLink (SPECIFIER) ;
637 SPEC_SCLS($$) = S_CODE ;
640 $$ = newLink (SPECIFIER) ;
641 SPEC_SCLS($$) = S_EEPROM ;
644 $$ = newLink (SPECIFIER);
645 SPEC_SCLS($$) = S_DATA ;
648 $$ = newLink (SPECIFIER);
649 SPEC_SCLS($$) = S_IDATA ;
652 $$ = newLink (SPECIFIER);
653 SPEC_SCLS($$) = S_PDATA ;
656 $$=newLink(SPECIFIER);
657 SPEC_NOUN($$) = V_BIT ;
658 SPEC_SCLS($$) = S_BIT ;
663 | struct_or_union_specifier {
676 sym = findSym(TypedefTab,NULL,$1) ;
677 $$ = p = copyLinkChain(sym->type);
678 SPEC_TYPEDEF(getSpec(p)) = 0;
685 $$ = newLink(SPECIFIER) ;
686 SPEC_NOUN($$) = V_SBIT;
687 SPEC_SCLS($$) = S_SBIT;
690 $$ = newLink(SPECIFIER) ;
691 SPEC_NOUN($$) = V_CHAR;
692 SPEC_SCLS($$) = S_SFR ;
697 struct_or_union_specifier
698 : struct_or_union opt_stag '{' struct_declaration_list '}'
703 // check for duplicate structure members
704 for (sym=$4; sym; sym=sym->next) {
705 for (dsym=sym->next; dsym; dsym=dsym->next) {
706 if (strcmp(sym->name, dsym->name)==0) {
707 werror(E_DUPLICATE_MEMBER,
708 $1==STRUCT ? "struct" : "union", sym->name);
713 /* Create a structdef */
715 sdef->fields = reverseSyms($4) ; /* link the fields */
716 sdef->size = compStructSize($1,sdef); /* update size of */
718 /* Create the specifier */
719 $$ = newLink (SPECIFIER) ;
720 SPEC_NOUN($$) = V_STRUCT;
721 SPEC_STRUCT($$)= sdef ;
723 | struct_or_union stag
725 $$ = newLink(SPECIFIER) ;
726 SPEC_NOUN($$) = V_STRUCT;
727 SPEC_STRUCT($$) = $2 ;
732 : STRUCT { $$ = STRUCT ; }
733 | UNION { $$ = UNION ; }
738 | { /* synthesize a name add to structtable */
739 $$ = newStruct(genSymName(NestLevel)) ;
740 $$->level = NestLevel ;
741 addSym (StructTab, $$, $$->tag,$$->level,currBlockno, 0);
745 : identifier { /* add name to structure table */
746 $$ = findSymWithBlock (StructTab,$1,currBlockno);
748 $$ = newStruct($1->name) ;
749 $$->level = NestLevel ;
750 addSym (StructTab, $$, $$->tag,$$->level,currBlockno,0);
755 struct_declaration_list
757 | struct_declaration_list struct_declaration
761 /* go to the end of the chain */
762 while (sym->next) sym=sym->next;
770 : type_specifier_list struct_declarator_list ';'
772 /* add this type to all the symbols */
774 for ( sym = $2 ; sym != NULL ; sym = sym->next ) {
776 /* make the symbol one level up */
779 pointerTypes(sym->type,copyLinkChain($1));
781 sym->type = copyLinkChain($1);
782 sym->etype = getSpec(sym->type);
785 addDecl (sym,0,copyLinkChain($1));
786 /* make sure the type is complete and sane */
787 checkTypeSanity(sym->etype, sym->name);
793 struct_declarator_list
795 | struct_declarator_list ',' struct_declarator
804 | ':' constant_expr {
806 $$ = newSymbol (genSymName(NestLevel),NestLevel) ;
807 bitsize= (int) floatFromVal(constExprValue($2,TRUE));
808 if (bitsize > (port->s.int_size * 8)) {
809 bitsize = port->s.int_size * 8;
810 werror(E_BITFLD_SIZE, bitsize);
813 bitsize = BITVAR_PAD;
814 $$->bitVar = bitsize;
816 | declarator ':' constant_expr
819 bitsize= (int) floatFromVal(constExprValue($3,TRUE));
820 if (bitsize > (port->s.int_size * 8)) {
821 bitsize = port->s.int_size * 8;
822 werror(E_BITFLD_SIZE, bitsize);
825 $$ = newSymbol (genSymName(NestLevel),NestLevel) ;
826 $$->bitVar = BITVAR_PAD;
827 werror(W_BITFLD_NAMED);
830 $1->bitVar = bitsize;
835 : ENUM '{' enumerator_list '}' {
839 // check for duplicate enums
840 for (sym=$3; sym; sym=sym->next) {
841 for (dsym=sym->next; dsym; dsym=dsym->next) {
842 if (strcmp(sym->name, dsym->name)==0) {
843 werror(E_DUPLICATE_MEMBER, "enum", sym->name);
849 $$ = copyLinkChain(cenum->type);
856 | ENUM identifier '{' enumerator_list '}' {
859 $2->type = copyLinkChain(cenum->type);
860 $2->etype = getSpec($2->type);
861 /* add this to the enumerator table */
862 if (!(csym=findSym(enumTab,$2,$2->name)) &&
863 (csym && csym->level == $2->level))
864 werror(E_DUPLICATE_TYPEDEF,csym->name);
866 addSym ( enumTab,$2,$2->name,$2->level,$2->block, 0);
868 //allocVariables (reverseSyms($4));
869 $$ = copyLinkChain(cenum->type);
870 SPEC_SCLS(getSpec($$)) = 0 ;
875 /* check the enumerator table */
876 if ((csym = findSym(enumTab,$2,$2->name)))
877 $$ = copyLinkChain(csym->type);
879 $$ = newLink(SPECIFIER) ;
880 SPEC_NOUN($$) = V_INT ;
883 SPEC_SCLS(getSpec($$)) = 0 ;
889 | enumerator_list ',' {
891 | enumerator_list ',' enumerator {
898 : identifier opt_assign_expr
900 /* make the symbol one level up */
902 $1->type = copyLinkChain($2->type);
903 $1->etype= getSpec($1->type);
904 SPEC_ENUM($1->etype) = 1;
906 // do this now, so we can use it for the next enums in the list
912 : '=' constant_expr {
915 val = constExprValue($2,TRUE);
920 SNPRINTF(lbuff, sizeof(lbuff),
921 "%d",(int) floatFromVal(cenum)+1);
922 $$ = cenum = constVal(lbuff);
925 SNPRINTF(lbuff, sizeof(lbuff),
927 $$ = cenum = constVal(lbuff);
933 : declarator2_function_attributes { $$ = $1; }
934 | pointer declarator2_function_attributes
936 addDecl ($2,0,reverseLink($1));
941 declarator2_function_attributes
942 : declarator2 { $$ = $1 ; }
943 | declarator2 function_attribute {
944 if ((! $1) || (! IS_FUNC($1->etype)))
946 // function_attribute is only allowed if declarator2 was
947 // an actual function
953 // copy the functionAttributes (not the args and hasVargs !!)
954 sym_link *funcType=$1->etype;
955 struct value *args=FUNC_ARGS(funcType);
956 unsigned hasVargs=FUNC_HASVARARGS(funcType);
958 memcpy (&funcType->funcAttrs, &$2->funcAttrs,
959 sizeof($2->funcAttrs));
961 FUNC_ARGS(funcType)=args;
962 FUNC_HASVARARGS(funcType)=hasVargs;
965 memset (&$2->funcAttrs, 0,
966 sizeof($2->funcAttrs));
975 | '(' declarator ')' { $$ = $2; }
976 | declarator2 '[' ']'
980 p = newLink (DECLARATOR);
981 DCL_TYPE(p) = ARRAY ;
985 | declarator2 '[' constant_expr ']'
990 tval = constExprValue($3,TRUE);
991 /* if it is not a constant then Error */
992 p = newLink (DECLARATOR);
993 DCL_TYPE(p) = ARRAY ;
994 if ( !tval || (SPEC_SCLS(tval->etype) != S_LITERAL)) {
995 werror(E_CONST_EXPECTED) ;
996 /* Assume a single item array to limit the cascade */
997 /* of additional errors. */
1001 DCL_ELEM(p) = (int) floatFromVal(tval) ;
1005 | declarator2 '(' ')' { addDecl ($1,FUNCTION,NULL) ; }
1006 | declarator2 '(' { NestLevel++ ; currBlockno++; } parameter_type_list ')'
1009 addDecl ($1,FUNCTION,NULL) ;
1011 FUNC_HASVARARGS($1->type) = IS_VARG($4);
1012 FUNC_ARGS($1->type) = reverseVal($4);
1014 /* nest level was incremented to take care of the parms */
1018 // if this was a pointer (to a function)
1019 if (IS_PTR($1->type)) {
1020 // move the args and hasVargs to the function
1021 FUNC_ARGS($1->etype)=FUNC_ARGS($1->type);
1022 FUNC_HASVARARGS($1->etype)=FUNC_HASVARARGS($1->type);
1023 memset (&$1->type->funcAttrs, 0,
1024 sizeof($1->type->funcAttrs));
1025 // remove the symbol args (if any)
1026 cleanUpLevel(SymbolTab,NestLevel+1);
1031 | declarator2 '(' parameter_identifier_list ')'
1033 werror(E_OLD_STYLE,$1->name) ;
1035 /* assume it returns an int */
1036 $1->type = $1->etype = newIntLink();
1042 : unqualified_pointer { $$ = $1 ;}
1043 | unqualified_pointer type_specifier_list
1047 DCL_PTR_CONST($1) = SPEC_CONST($2);
1048 DCL_PTR_VOLATILE($1) = SPEC_VOLATILE($2);
1050 | unqualified_pointer pointer
1054 DCL_TYPE($2)=port->unqualified_pointer;
1056 | unqualified_pointer type_specifier_list pointer
1059 if (IS_SPEC($2) && DCL_TYPE($3) == UPOINTER) {
1060 DCL_PTR_CONST($1) = SPEC_CONST($2);
1061 DCL_PTR_VOLATILE($1) = SPEC_VOLATILE($2);
1062 switch (SPEC_SCLS($2)) {
1064 DCL_TYPE($3) = FPOINTER;
1067 DCL_TYPE($3) = IPOINTER ;
1070 DCL_TYPE($3) = PPOINTER ;
1073 DCL_TYPE($3) = POINTER ;
1076 DCL_TYPE($3) = CPOINTER ;
1079 DCL_TYPE($3) = EEPPOINTER;
1082 // this could be just "constant"
1083 // werror(W_PTR_TYPE_INVALID);
1088 werror (W_PTR_TYPE_INVALID);
1096 $$ = newLink(DECLARATOR);
1097 DCL_TYPE($$)=UPOINTER;
1103 //| type_specifier_list type_specifier { $$ = mergeSpec ($1,$2, "type_specifier_list"); }
1104 | type_specifier_list type_specifier {
1105 /* if the decl $2 is not a specifier */
1106 /* find the spec and replace it */
1107 if ( !IS_SPEC($2)) {
1108 sym_link *lnk = $2 ;
1109 while (lnk && !IS_SPEC(lnk->next))
1111 lnk->next = mergeSpec($1,lnk->next, "type_specifier_list type_specifier skipped");
1115 $$ = mergeSpec($1,$2, "type_specifier_list type_specifier");
1119 parameter_identifier_list
1121 | identifier_list ',' ELIPSIS
1126 | identifier_list ',' identifier
1135 | parameter_list ',' VAR_ARGS { $1->vArgs = 1;}
1139 : parameter_declaration
1140 | parameter_list ',' parameter_declaration
1147 parameter_declaration
1148 : type_specifier_list declarator
1151 pointerTypes($2->type,$1);
1153 for (loop=$2;loop;loop->_isparm=1,loop=loop->next);
1160 $$->etype = getSpec($$->type);
1165 : type_specifier_list { $$ = $1 ;}
1166 | type_specifier_list abstract_declarator
1168 /* go to the end of the list */
1170 pointerTypes($2,$1);
1171 for ( p = $2 ; p && p->next ; p=p->next);
1173 werror(E_SYNTAX_ERROR, yytext);
1182 : pointer { $$ = reverseLink($1); }
1183 | abstract_declarator2
1184 | pointer abstract_declarator2 { $1 = reverseLink($1); $1->next = $2 ; $$ = $1;
1185 if (IS_PTR($1) && IS_FUNC($2))
1186 DCL_TYPE($1) = CPOINTER;
1190 abstract_declarator2
1191 : '(' abstract_declarator ')' { $$ = $2 ; }
1193 $$ = newLink (DECLARATOR);
1194 DCL_TYPE($$) = ARRAY ;
1197 | '[' constant_expr ']' {
1199 $$ = newLink (DECLARATOR);
1200 DCL_TYPE($$) = ARRAY ;
1201 DCL_ELEM($$) = (int) floatFromVal(val = constExprValue($2,TRUE));
1203 | abstract_declarator2 '[' ']' {
1204 $$ = newLink (DECLARATOR);
1205 DCL_TYPE($$) = ARRAY ;
1209 | abstract_declarator2 '[' constant_expr ']'
1212 $$ = newLink (DECLARATOR);
1213 DCL_TYPE($$) = ARRAY ;
1214 DCL_ELEM($$) = (int) floatFromVal(val = constExprValue($3,TRUE));
1217 | '(' ')' { $$ = NULL;}
1218 | '(' parameter_type_list ')' { $$ = NULL;}
1219 | abstract_declarator2 '(' ')' {
1220 // $1 must be a pointer to a function
1221 sym_link *p=newLink(DECLARATOR);
1222 DCL_TYPE(p) = FUNCTION;
1224 // ((void (code *) ()) 0) ()
1225 $1=newLink(DECLARATOR);
1226 DCL_TYPE($1)=CPOINTER;
1231 | abstract_declarator2 '(' { NestLevel++ ; currBlockno++; } parameter_type_list ')' {
1232 sym_link *p=newLink(DECLARATOR);
1233 DCL_TYPE(p) = FUNCTION;
1235 FUNC_HASVARARGS(p) = IS_VARG($4);
1236 FUNC_ARGS(p) = reverseVal($4);
1238 /* nest level was incremented to take care of the parms */
1244 // remove the symbol args (if any)
1245 cleanUpLevel(SymbolTab,NestLevel+1);
1250 : assignment_expr { $$ = newiList(INIT_NODE,$1); }
1251 | '{' initializer_list '}' { $$ = newiList(INIT_DEEP,revinit($2)); }
1252 | '{' initializer_list ',' '}' { $$ = newiList(INIT_DEEP,revinit($2)); }
1257 | initializer_list ',' initializer { $3->next = $1; $$ = $3; }
1262 | compound_statement
1263 | expression_statement
1264 | selection_statement
1265 | iteration_statement
1267 | critical_statement
1269 ast *ex = newNode(INLINEASM,NULL,NULL);
1270 ex->values.inlineasm = strdup($1);
1278 STACK_PUSH(continueStack,NULL);
1279 STACK_PUSH(breakStack,NULL);
1285 : critical statement {
1286 STACK_POP(breakStack);
1287 STACK_POP(continueStack);
1289 $$ = newNode(CRITICAL,$2,NULL);
1294 // : identifier ':' statement { $$ = createLabel($1,$3); }
1295 : identifier ':' { $$ = createLabel($1,NULL); }
1296 | CASE constant_expr ':' statement { $$ = createCase(STACK_PEEK(swStk),$2,$4); }
1297 | DEFAULT ':' statement { $$ = createDefault(STACK_PEEK(swStk),$3); }
1300 start_block : '{' { STACK_PUSH(blockNum,currBlockno); currBlockno = ++blockNo ; }
1303 end_block : '}' { currBlockno = STACK_POP(blockNum); }
1307 : start_block end_block { $$ = createBlock(NULL,NULL); }
1308 | start_block statement_list end_block { $$ = createBlock(NULL,$2) ; }
1310 declaration_list { addSymChain($2); }
1311 end_block { $$ = createBlock($2,NULL) ; }
1313 declaration_list { addSymChain ($2); }
1315 end_block {$$ = createBlock($2,$4) ; }
1316 | error ';' { $$ = NULL ; }
1322 /* if this is typedef declare it immediately */
1323 if ( $1 && IS_TYPEDEF($1->etype)) {
1324 allocVariables ($1);
1331 | declaration_list declaration
1335 /* if this is a typedef */
1336 if ($2 && IS_TYPEDEF($2->etype)) {
1337 allocVariables ($2);
1341 /* get to the end of the previous decl */
1356 | statement_list statement { $$ = newNode(NULLOP,$1,$2) ;}
1359 expression_statement
1365 : ELSE statement { $$ = $2 ; }
1371 : IF '(' expr ')' statement else_statement { noLineno++ ; $$ = createIf ($3, $5, $6 ); noLineno--;}
1372 | SWITCH '(' expr ')' {
1374 static int swLabel = 0 ;
1376 /* create a node for expression */
1377 ex = newNode(SWITCH,$3,NULL);
1378 STACK_PUSH(swStk,ex); /* save it in the stack */
1379 ex->values.switchVals.swNum = swLabel ;
1381 /* now create the label */
1382 SNPRINTF(lbuff, sizeof(lbuff),
1383 "_swBrk_%d",swLabel++);
1384 $<sym>$ = newSymbol(lbuff,NestLevel);
1385 /* put label in the break stack */
1386 STACK_PUSH(breakStack,$<sym>$);
1389 /* get back the switch form the stack */
1390 $$ = STACK_POP(swStk) ;
1391 $$->right = newNode (NULLOP,$6,createLabel($<sym>5,NULL));
1392 STACK_POP(breakStack);
1396 while : WHILE { /* create and push the continue , break & body labels */
1397 static int Lblnum = 0 ;
1399 SNPRINTF (lbuff, sizeof(lbuff), "_whilecontinue_%d",Lblnum);
1400 STACK_PUSH(continueStack,newSymbol(lbuff,NestLevel));
1402 SNPRINTF (lbuff, sizeof(lbuff), "_whilebreak_%d",Lblnum);
1403 STACK_PUSH(breakStack,newSymbol(lbuff,NestLevel));
1405 SNPRINTF (lbuff, sizeof(lbuff), "_whilebody_%d",Lblnum++);
1406 $$ = newSymbol(lbuff,NestLevel);
1410 do : DO { /* create and push the continue , break & body Labels */
1411 static int Lblnum = 0 ;
1414 SNPRINTF(lbuff, sizeof(lbuff), "_docontinue_%d",Lblnum);
1415 STACK_PUSH(continueStack,newSymbol(lbuff,NestLevel));
1417 SNPRINTF(lbuff, sizeof(lbuff), "_dobreak_%d",Lblnum);
1418 STACK_PUSH(breakStack,newSymbol(lbuff,NestLevel));
1420 SNPRINTF(lbuff, sizeof(lbuff), "_dobody_%d",Lblnum++);
1421 $$ = newSymbol (lbuff,NestLevel);
1425 for : FOR { /* create & push continue, break & body labels */
1426 static int Lblnum = 0 ;
1429 SNPRINTF(lbuff, sizeof(lbuff), "_forcontinue_%d",Lblnum);
1430 STACK_PUSH(continueStack,newSymbol(lbuff,NestLevel));
1432 SNPRINTF(lbuff, sizeof(lbuff), "_forbreak_%d",Lblnum);
1433 STACK_PUSH(breakStack,newSymbol(lbuff,NestLevel));
1435 SNPRINTF(lbuff, sizeof(lbuff), "_forbody_%d",Lblnum);
1436 $$ = newSymbol(lbuff,NestLevel);
1438 SNPRINTF(lbuff, sizeof(lbuff), "_forcond_%d",Lblnum++);
1439 STACK_PUSH(forStack,newSymbol(lbuff,NestLevel));
1444 : while '(' expr ')' statement
1447 $$ = createWhile ( $1, STACK_POP(continueStack),
1448 STACK_POP(breakStack), $3, $5 );
1449 $$->lineno = $1->lineDef ;
1452 | do statement WHILE '(' expr ')' ';'
1455 $$ = createDo ( $1 , STACK_POP(continueStack),
1456 STACK_POP(breakStack), $5, $2);
1457 $$->lineno = $1->lineDef ;
1460 | for '(' expr_opt ';' expr_opt ';' expr_opt ')' statement
1464 /* if break or continue statement present
1465 then create a general case loop */
1466 if (STACK_PEEK(continueStack)->isref ||
1467 STACK_PEEK(breakStack)->isref) {
1468 $$ = createFor ($1, STACK_POP(continueStack),
1469 STACK_POP(breakStack) ,
1470 STACK_POP(forStack) ,
1473 $$ = newNode(FOR,$9,NULL);
1474 AST_FOR($$,trueLabel) = $1;
1475 AST_FOR($$,continueLabel) = STACK_POP(continueStack);
1476 AST_FOR($$,falseLabel) = STACK_POP(breakStack);
1477 AST_FOR($$,condLabel) = STACK_POP(forStack) ;
1478 AST_FOR($$,initExpr) = $3;
1479 AST_FOR($$,condExpr) = $5;
1480 AST_FOR($$,loopExpr) = $7;
1493 : GOTO identifier ';' {
1495 $$ = newAst_VALUE(symbolVal($2));
1496 $$ = newNode(GOTO,$$,NULL);
1499 /* make sure continue is in context */
1500 if (STACK_PEEK(continueStack) == NULL) {
1501 werror(E_BREAK_CONTEXT);
1505 $$ = newAst_VALUE(symbolVal(STACK_PEEK(continueStack)));
1506 $$ = newNode(GOTO,$$,NULL);
1507 /* mark the continue label as referenced */
1508 STACK_PEEK(continueStack)->isref = 1;
1512 if (STACK_PEEK(breakStack) == NULL) {
1513 werror(E_BREAK_CONTEXT);
1516 $$ = newAst_VALUE(symbolVal(STACK_PEEK(breakStack)));
1517 $$ = newNode(GOTO,$$,NULL);
1518 STACK_PEEK(breakStack)->isref = 1;
1523 werror(E_INVALID_CRITICAL);
1526 $$ = newNode(RETURN,NULL,NULL);
1531 werror(E_INVALID_CRITICAL);
1534 $$ = newNode(RETURN,NULL,$2);
1540 : IDENTIFIER { $$ = newSymbol ($1,NestLevel) ; }